AI Produces Machine-Checked Proofs of Open Problems
AI systems will keep producing formally verified (Lean) claims on long-standing open problems in mathematics and theoretical computer science. Each claim triggers expert review that decides whether it holds. Confirmed results would remove assumptions that large bodies of downstream work, including cryptographic hardness assumptions, depend on, so frontier labs' research claims become a recurring source of shocks to the foundations of theory.
forming · confidence 35 · Emerging (watchlist) · tracking since October 27, 2026 · updated October 27, 2026
Why the conviction moved
- Oct 27Strengthened
OpenAI says an AI system disproved the Exponential Time Hypothesis, a lower bound that hundreds of complexity results relied on, and the conjecture's original authors are now reviewing the Lean proof. The claim is not yet confirmed.
Source trail
Supporting · October 27, 2026
OpenAI says an AI system disproved the Exponential Time Hypothesis, and the conjecture's original authors are now reviewing the Lean proof
OpenAI says an AI system disproved the Exponential Time Hypothesis, a lower bound that hundreds of complexity results relied on, and the conjecture's original authors are now reviewing the Lean proof. The claim is not yet confirmed.
Hacker News (OpenAI preprint)
Unlock full source trail, score history, and daily updates.
Unlock TrendsAffected regions & assets
Townsquare
Argue the thesis in Townsquare.