GPT-5.6 Sol Ultra produces proof of the Cycle Double Cover Conjecture [pdf]
Summary
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.
View Cached Full Text
Cached at: 07/10/26, 09:13 PM
Similar Articles
@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…
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.
@gdb: Sol Ultra for solving Erdős problems:
GPT-5.6 Sol Ultra has solved another Erdős problem (#793) with an extremely short and elegant construction, enhancing the original method used by Erdős.
@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.
Imbalance Conjecture proven and Teschner’s bondage-number conjecture disproven by AI
An undergraduate researcher reports that GPT-5.6 Sol Max solved two open graph theory problems: proving the Imbalance Conjecture and disproving Teschner's bondage-number conjecture. The preprints have been posted but not yet peer-reviewed.
@gdb: GPT-5.6 Sol for resolving 100+ year old conjectures. Wild that this level of intelligence can be accessed by and is ava…
GPT-5.6 Sol reportedly found a counterexample to the Maxwell conjecture, a 100+ year old problem, with human mathematicians communicating the result.