Fifty Years, One Hour, Sixty-Four Agents
OpenAI claims GPT-5.6 Sol Ultra produced a three-page proof of the Cycle Double Cover Conjecture — a 50-year-old open problem in graph theory — in under an hour, using 64 parallel subagents. The math community hasn't had a chance to stress-test it yet, and the details of how much human guidance went in are unclear. Worth watching, cautiously.
Read more →