OpenAI's model used 64 parallel subagents to produce a complete proof of the Cycle Double Cover Conjecture, but a mathematician praises the result while faulting its missing citations.
OpenAI’s GPT-5.6 Sol Ultra has generated a complete proof of the Cycle Double Cover Conjecture — an open problem in graph theory for roughly 50 years — finishing the task in under an hour using 64 subagents running in parallel [1].
For developers and researchers building with large reasoning models, the result is a concrete data point on what current AI systems can do on hard, long-horizon mathematical tasks — and on where their outputs still fall short of academic standards [1].
What the conjecture is and why it mattered
The Cycle Double Cover Conjecture asks whether, for any network of vertices and edges, it is always possible to find a set of cycles that traverses each individual edge exactly twice [1]. The problem was formulated independently by several mathematicians in the 1970s, and while partial solutions for special cases accumulated over the decades, no generally accepted proof existed before now [1].
According to OpenAI, the proof was produced entirely by GPT-5.6 Sol Ultra, and the accompanying paper was written by GPT-5.6 Sol [1].
A “very nice proof” — with a caveat
Thomas Bloom, a mathematician at the University of Manchester, offered the most detailed public assessment so far, calling it “a very nice proof” and noting that the solution is “short, elementary, and could have been discovered in the 1980s” [1]. The proof does not require new mathematical theories; it combines existing tools in a clever way [1].
Bloom’s explanation for why humans missed it centers on persistence. A human mathematician would likely have tried the obvious approach, seen it fail, and moved on, he said [1]. The AI, by contrast, kept trying small variations without discouragement until one worked [1]. As Bloom writes: “One can imagine trying the natural labelling first, checking the linear algebra, and when that failed shrugging and thinking ‘oh well, I was expecting to fail, guess it can’t be done this easily’ – while the AI does not get discouraged and keeps trying small variations” [1].
Bloom also notes that the core mathematical ideas trace back at least to a 1983 paper by Bermond, Jackson, and Jaeger — work that OpenAI’s paper does not cite at all [1]. “I assume that these previous works were a big influence on the OpenAI proof, and it is a shame that it does not mention them at all,” Bloom writes, adding that missing citations are “a frequent issue with AI-generated proofs and papers” [1]. He doubts the model arrived at the solution independently, given that its typical first instinct is to search for and read related papers [1].
A full mathematical verification by the broader scientific community is still pending [1].
How the prompt was engineered
The setup was as important as the model itself. The prompt instructed GPT-5.6 Sol Ultra to assume a complete proof exists, effectively blocking its most likely default response — that the conjecture remains open [1]. The model was also barred from searching the internet to check whether the problem had already been solved, and from stating that it was unsolved [1].
Verification rules were strict: partial results, reductions to other unproven conjectures, and summaries of why the problem is hard were all rejected as insufficient responses [1]. Most of the 64 agents were deliberately kept unaware of which approach looked most promising, to encourage independent reasoning paths [1]. Adversarial agents then checked each candidate proof against a list of common errors [1].
The model was told to compute for at least eight hours before it could consider giving up — it finished in one [1].
What this class of result does and doesn’t show
Bloom compares the Cycle Double Cover result to the unit distance conjecture, which OpenAI also recently solved, describing both as major open problems “that turned out to be much easier than expected” requiring no large new theories [1]. He expects AI systems to keep solving problems of this type — those requiring only existing, well-developed theory plus patience — but cautions that “this is likely only a small proportion of open problems, and we don’t know in advance which they are” [1].
Bloom also flags a structural dynamic in how these results reach the public: “big AI companies are spending a lot of time and money attacking many open problems at once (and only reporting the successes, of course)” [1].
Sources
This article was drafted with AI from the cited sources and checked against them before publication. Spot an error? Let us know.
