@rohanpaul_ai: This is so great. GPT-5.6 Sol Ultra produced a 50-year-old conjecture proof using 64 subagents within one hour. The pro…
Summary
GPT-5.6 Sol Ultra, released by OpenAI, reportedly proved the 50-year-old Cycle Double Cover Conjecture in under one hour using 64 subagents, marking a major AI breakthrough.
View Cached Full Text
Cached at: 07/11/26, 01:29 PM
This is so great.
GPT-5.6 Sol Ultra produced a 50-year-old conjecture proof using 64 subagents within one hour.
The prompt directed 64 agents toward competing approaches, repeated audits, and rejection of partial arguments.
OpenAI’s release says GPT-5.6 Sol Ultra parallelizes difficult work through multiple subagents.
Ethan Knight (@eknight): Yesterday, we made GPT-5.6 Sol Ultra generally available. Today, we’re sharing that it produced a proof of the 50-year-old Cycle Double Cover Conjecture using 64 subagents in just under one hour. We’re sharing the prompt and proof below. We’re excited to see what you all do with
Similar Articles
GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]
GPT-5.6 Sol Ultra, an AI model from OpenAI, has produced a proof of the Cycle Double Cover Conjecture, a long-standing problem in graph theory.
@VraserX: You genuinely can’t overhype this. GPT-5.6 Sol Ultra, which is a publicly available AI just cracked a 50-year-old math …
GPT-5.6 Sol Ultra, a publicly available AI model, solved a 50-year-old math conjecture in under an hour, suggesting that AI may solve mathematics within the next decade.
@LiorOnAI: GPT-5.6 Sol may have solved a 50-year-old math problem using 64 subagents in parallel. The system did not rely on one l…
GPT-5.6 Sol reportedly solved a 50-year-old math problem by using 64 subagents in parallel, potentially changing R&D economics if verified.
@danshipper: Yesterday, GPT-5.6 Sol Ultra became generally available. Today, I'm sharing that I accidentally spent 2b tokens overnig…
Dan Shipper announces that GPT-5.6 Sol Ultra is generally available, and shares a tweet from Ethan Knight claiming the model produced a proof of the Cycle Double Cover Conjecture using 64 subagents in under an hour.
AI helped produce two proofs for the same cryptography problem
Two research groups independently used OpenAI's GPT-5.6 Sol Ultra to help produce proofs for the same unclonable encryption problem, submitting nearly simultaneous arXiv preprints. The near collision illustrates AI's growing role in theoretical computer science and raises questions about independent discovery and credit.