Csaba Szepesvari on AI math proofs: Lean kernel and compiler bugs undermine trust
CsabaSzepesvari · x · 2026-09-07
RL researcher Csaba Szepesvári discussed the reliability of AI-formalized math proofs.
Key points:
- Formalized proofs rest on a chain of trust: a correct compiler, a bug-free Lean kernel, and trustworthy Mathlib plus its extensions — "relatively trusted" isn't bug-free.
- Formalization introduces many new definitions and proofs; one mistaken axiom means you've proven something else entirely.
- On reflection, he added that his worry may be overblown.
Related event: Claude's FLT Formalization Sparks Scooping-Ethics Debate in Mathematics(25 posts)→
More from AGI Musings
- Population Ethics Consistency Test, built with Claude, forces you to bite bullets — lxrjl · 2026-09-08
- Gary Marcus amplifies a fiery Terence Tao take on AI — GaryMarcus · 2026-09-08
- After NYT Covered His AI Emails Story, Philosopher Toby Ord Gets Even More AI Mail — tobyordoxford · 2026-09-08
- Garrison Lovely's 'Obsolete' Book on AI's Trillion-Dollar Labor-Replacement Race Due Sept 2026 — GarrisonLovely · 2026-09-08
- Math community clashes over whether AI-generated results count — RexDouglass · 2026-09-08
- Gary Marcus catalogs every premature 'AGI achieved' claim, from Ilya to Jensen Huang — GaryMarcus · 2026-09-08