OpenAI's GPT-5.6 Sol Ultra Solves Cycle Double Cover Conjecture in Under an Hour

OpenAI’s GPT-5.6 Sol Ultra solved the Cycle Double Cover Conjecture, a math problem that remained unsolved for 50 years, in under an hour. This achievement utilized 64 subagents working in parallel. Mathematician Thomas Bloom commented that the proof is surprisingly elementary but criticized it for lacking citations of known prior work. He raised questions about whether AI merely recombines existing knowledge or creates something new. This development follows OpenAI’s ongoing advancements in AI reasoning capabilities, as seen in their previous work with task complexity mapping for GPT-5.6. The implications for mathematical research and AI’s role in problem-solving are significant, as practitioners may now leverage such models for complex proofs and theoretical advancements. For more details, see The Decoder.