MIT verifies Riemann Hypothesis Lean proof with Claude Code: all 175,187 modules pass
sqcai · x · 2026-11-21
MIT mathematician Andrew Sutherland has published verification results for the Lean formalization of the Riemann Hypothesis proof, with checks run using Claude Code.
Key results:
- All 175,187 modules compile under Lean v4.33.1 + Mathlib v4.33.1 with zero errors
- The five headline theorems depend only on the three standard axioms (propext, Classical.choice, Quot.sound), with no axioms outside Lean core
- 8,322 Mathlib files match the official cache byte for byte
- The independent Rust kernel nanoda accepted the full export (27 min 42 s on 80 threads); the independent con-leche kernel accepted all 1,468,418 declarations
- lean4lean accepted every compiled module; lake comparator and paranoid kernel checks are still running
The proof was announced on 20 November 2026; the page will be updated as remaining checks finish. A landmark case of AI tools deeply involved in formal verification of major mathematics.
More from AGI Musings
- The Only Skill That Matters in Knowledge Work Now: Knowing What to Work On — vaibhavbetter · 2026-11-21
- Founder Warns: Bubble Burst Would Devastate AI Startups With $10M+ Seed Rounds — dr1337 · 2026-11-21
- 'Computers Have Broken Everything': NYT on America's growing tech fragility — nordicinst · 2026-11-21
- Lean-verified route to the Riemann Hypothesis sparks debate on AI-era proofs — aran_nayebi · 2026-11-21
- Gary Marcus mocks 'AI psychosis' hype over AI-solved math problems with satirical test — GaryMarcus · 2026-11-21
- NYU/UT Austin study: all 9 frontier models write text harder to process than human writing — windx0303 · 2026-11-21