# 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.

- Conviction: 35 / 100 (forming)
- Horizon: Emerging (watchlist)
- Tracking since: 2026-10-27T00:00:00.000Z
- Last updated: 2026-10-27T06:37:43.956Z
- Canonical: https://polylog.news/crypto/trends/ai-machine-verified-math-breakthroughs
- Publisher: Polylog
- Affected regions: Global

## Recent evidence

- [confirms] OpenAI says an AI system disproved the Exponential Time Hypothesis, and the conjecture's original authors are now reviewing the Lean proof (2026-10-27): 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.