In July 2026, OpenAI announced that its flagship model, GPT-5.6 Sol Ultra, had successfully proven the Cycle Double Cover Conjecture in graph theory. Since its proposal in the 1970s, only partial special cases had been solved over 50 years. The model used 64 sub-agents running in parallel and completed the proof in under an hour.
Mathematician Thomas Bloom of the University of Manchester praised the proof in his preliminary assessment as 'very beautiful,' noting it is 'short, elementary, and could have been discovered in the 1980s.' The proof introduced no new theory but cleverly combined existing tools. Bloom believed the key step contained a counterintuitive twist, where human mathematicians might give up after trying natural approaches, while the AI kept trying small variations until it succeeded.
Prompt engineering was crucial to this success: the model was told to 'assume a complete proof exists,' prohibited from searching the internet, and had to reject partial results or reductions to other unsolved conjectures. It was required to compute for at least 8 hours before giving up, but actually only took 1 hour.