- - GPT‑5.6 Sol Ultra, a large language model from OpenAI, was fed a specially crafted prompt that guided it toward a proof.
- - The model generated a proof that every connected graph can be covered by cycles in a way that meets the conjecture’s conditions.
- - Mathematicians reviewed the proof and confirmed it meets all required steps.
- - This is the first time an AI has solved a conjecture of this difficulty level.
- - The achievement highlights the growing power of AI in abstract reasoning and formal verification.
TOP 10 STORIES
11-Jul-2026
Expand: ▼ Summary · ▼ Why Matters · ▼ AI Explained
DAILY READS
WEEKLY READS