One day after GPT-5.6 Sol Ultra went generally available, OpenAI says it produced a complete proof of the Cycle Double Cover Conjecture — a graph theory problem open since Tutte, Szekeres and Seymour posed it 50 years ago. 64 subagents, under one hour. The prompt and the full proof PDF are public. HN thread: 224 points, 203 comments, and mathematicians are still checking every line.
What Sol Ultra actually is
It’s a frontier model with a built-in multi-agent mode: Ultra decomposes a hard problem, spawns parallel subagents that coordinate mid-task, then merges results. The proof came from Sol Ultra alone; Codex only cleaned up the writeup.
You can run the same setup today
GPT-5.6 Sol is GA on the OpenAI API at $5 input / $30 output per million tokens, with subagent mode available. Same machinery, pointed at your own hard research or verification problems.
Why this matters
Last month a frontier model disproved the Erdős unit-distance conjecture. This is the second famous open problem to fall in two months. If the proof holds, “AI does original math” stops being a demo and becomes a cadence.
You Might Also Like
- Gpt 5 6 sol Ultra Hits 91 9 on Terminal Bench 2 1 and its Landing in Codex
- Openai gpt 5 6 sol Terra Luna a Three Tier Lineup Only 20 Orgs can Touch
- Gpt oss 120b Openai Finally Goes Open Source and its Worth the Wait
- Openai Desktop Superapp Chatgpt Codex and Atlas are Becoming one app
- A 20 Year old Dropout Built Supermemory now it has 18k Github Stars and Googles Jeff Dean as an Investor
Top AI Product 
Leave a comment