- Claude turned a famous mathematical proof into millions of checkable code lines
- Anthropic says Claude completed years of expected work in 11 days
- The massive proof contains 13 million lines of Lean code
Anthropic has used its Claude artificial intelligence system to produce a fully computer-checked version of a famous, centuries-old mathematical proof.
The proof addresses Fermat’s Last Theorem, a hypothesis first proposed by the mathematician Pierre de Fermat back in the year 1637.
Mathematician Andrew Wiles produced the very first full mathematical proof of the theorem back in 1995, spanning 129 pages total in length.
A proof rebuilt for machines
Formalizing a proof simply means converting its mathematical reasoning into code that computers can check automatically without any human assistance.
Anthropic says it expected the entire task to take several years, based on how mathematicians first described the project.
Instead, the company says its internal research model finished the entire proof in only 11 days of continuous, largely unsupervised work.
The finished proof runs to 13 million lines of specialized code written in a programming language called Lean, used by mathematicians.
Along the way, Claude’s agents reportedly proved roughly 30,300 separate theorems, ultimately using 29,500 of them in the final version.
Human input was reportedly limited to occasional high-level guidance, rather than any direct hands-on coding throughout the entire eleven-day process.
At 13 million lines, the resulting proof is over five times larger than Mathlib, the community’s own main proof library.
“This extraordinary autoformalization achievement…proves Fermat’s Last Theorem with no assumptions other than the axioms of mathematics,” said Kevin Buzzard, a mathematician at Imperial College London.
“Along the way we see autoformalization of algebra, harmonic analysis, geometry and number theory, and we learn that AI autoformalization artefacts are now robust enough to be built upon; the proof is multi-layered.”
Anthropic attempted the formalization several times before succeeding, with those efforts contributing roughly 7% of the final proof’s non-boilerplate lines.
Not Anthropic’s first math breakthrough
The formalization arrives just one month after Anthropic detailed a separate breakthrough involving the Riemann zeta function, a well-studied mathematical object.
That function sits at the very center of the Riemann hypothesis, considered one of mathematics’ hardest unsolved problems worldwide.
Rival lab OpenAI is also pursuing similar work, using its newest Astra model to solve several classic Erdős problems.
That same OpenAI effort also reportedly narrowed several long-standing open questions within the field of theoretical computer science.
Anthropic says its breakthrough came only after giving Claude access to an open-
The software helps AI agents pick the most useful next step during a long, multi-stage research workflow, while also cutting inference costs.
Anthropic has also expanded free access and research credits for mathematicians working specifically on formalization projects, alongside dedicated larger grants.
Despite the record pace set here, an eleven-day timeline still shows how labor-intensive full formalization remains, even with today’s most capable systems.
