AI Advances in Mathematics and Formal Verification
Exploring breakthroughs in automated theorem proving with Lean and formal reasoning.
2 sourcesVoices in this topic
All paragraphs
Oct 26, 2026
- Alex Kontorovich The panel describes a sudden expansion in AI’s mathematical capabilities that has made prior forecasts less reliable. Participants discuss an OpenAI drop of roughly 700 problems and reported proofs including unique games and quasi-Riemann; Kontorovich says …
- Formal verification gives AI a checkable route to mathematical claims, while reusable proof infrastructure remains unfinished work. Kontorovich describes Anthropic formalizing Fermat’s Last Theorem in approximately 13 million lines of Lean, but distinguishes a checked …
- Steven Brunton The claimed Navier–Stokes breakthrough leaves the commercially valuable fluid-design problem largely intact. Brunton describes a carefully constructed, smoothly forced, three-dimensional blowup operating outside ordinary engineering conditions. His …
- Lex Fridman Podcast AI can change a research field through recombination alone. Kontorovich prefers a “semigroup” of repeatedly composable ideas to the dismissive image of interpolation inside a fixed balloon. Moitra’s …
- Kevin Hartnett AI mathematics is advancing through both formal and natural-language routes. Hartnett contrasts AlphaProof’s 2024 silver-medal-level IMO performance, using Lean and substantial compute, with the gold-level …
- Machine Learning Street Talk The adoption hurdle has been the cost of formalization relative to its perceived payoff. Hales spent twenty person-years formalizing Kepler’s conjecture; the de Bruijn factor can require twenty or more lines of formal code per …
- Autoformalization shifts scarce effort toward library design and maintenance. AI can translate papers into Lean much faster than human teams, but checked code can still use cumbersome definitions and weak abstractions. …
- Kevin Buzzard Machine verification moves the trust problem upstream into definitions and specifications. Buzzard’s team formalized fifty Annals theorem statements, then used AI to find both translation mistakes and missing assumptions in …
- Machine Learning Street Talk Formalization can improve understanding and enable new discovery. Checking Scholze’s six-page argument produced a conceptual simplification and resolved his concern that nobody had carefully read it: …
Oct 19, 2026
Oct 15, 2026
Oct 10, 2026
- David Sacks OpenAI’s release of more than 700 papers and 370 claimed results showcased the economics of digitally verifiable work. Friedberg called it potentially “the biggest day of discovery in human history”: proofs reportedly averaged under three hours of compute …
- The math results are stronger evidence of machine reasoning than of imminent real-world breakthroughs—and the panel openly disagreed about that distinction. Friedberg cited possible implications for chip optimization, matrix multiplication, quantum sensors and cryptographic research; Chamath …
Oct 9, 2026
Oct 8, 2026
Sep 30, 2026
- Leonardo de Moura Lean’s strategic advantage is a tightly governed core surrounded by a permissionless extension layer. Leonardo de Moura rejects random pull-request accumulation because bugs, incomplete features, and premature design commitments can constrain …
- An apparent Collatz refutation exposed how AI changes the economics of attacking proof checkers. The submission reportedly exploited one bug in Lean’s official kernel and an unrelated bug in the Rust-based Nanoda checker; de Moura says …
- Kim Morrison’s AI-assisted zlib project moved formally verified, low-level software from implausible to newly plausible. A Claude Code agent translated C into Lean, reached compatibility with the C test suite, proved round-trip correctness for every compression …
- Mathlib is approaching an AI-amplified scaling problem rather than a shortage of theorem production. Lean 4’s library has reached 2.4 million lines versus Lean 3’s 1.1 million, and de Moura cites estimates of 100 million lines to support …
- Today’s models excel at bounded “sniper proving” but remain unreliable at abstraction, experimentation, and selecting the right direction. They can fill proof gaps, explain obscure internals, and micro-optimize code better than most humans, yet still make “idiotic mistakes” and …
- Machine-verifiable certificates remain essential even if raw model accuracy approaches 99.99999%. Boris Alekseev’s 1.2-million-line Lean proof around the unit-distance conjecture illustrates why “nobody wants to check such a proof line by …