OpenAI's GPT-5.6 Sol Ultra claims proof of longstanding graph theory conjecture
Hacker News·3d·OpenAI
OpenAI announced that GPT-5.6 Sol Ultra, an advanced language model, produced a formal proof of the Cycle Double Cover Conjecture, a decades-old problem in graph theory. If verified by the mathematical community, this would mark a significant milestone in AI-assisted theorem proving—though independent review of the proof's validity remains pending.
Original story
Read the original on Hacker NewsRelated stories
AI
Docx-CLI cuts token usage in half for AI agents working with Word docsHacker News Show HN·6d·kirillklimuk