Anthropic's AI Agents Crack Fermat's Last Theorem Formalization in Just 11 Days

Reviewed byNidhi Govil

2 Sources

Share

Anthropic has achieved a breakthrough in mathematical AI by formalizing Andrew Wiles' proof of Fermat's Last Theorem in just 11 days. The Claude AI model autonomously generated 13 million lines of Lean code, creating the largest computer-verifiable mathematical proof ever written and demonstrating AI's potential to accelerate mathematical research.

Anthropic Completes Historic Mathematical Formalization

Anthropic has accomplished what mathematicians expected would take years: creating a formalized proof of Fermat's Last Theorem in just 11 days

1

. Using its Claude AI model, the company transformed Andrew Wiles' 1995 proof into a computer-verifiable format, producing 13 million lines of Lean code that represents the largest Lean proof ever written

2

. This achievement marks a pivotal moment in AI-driven autoformalization, demonstrating that machines can now tackle complex mathematical verification tasks that previously required extensive human effort.

Fermat's Last Theorem, originally posed by mathematician Pierre de Fermat in the 17th century, states that no whole numbers a, b, and c can satisfy the equation aⁿ + bⁿ = cⁿ when n is a whole number greater than 2

1

. While simple to state, the theorem remained unsolved for centuries until Andrew Wiles announced his breakthrough in 1993 after seven years of secret work. Even then, a flaw was discovered that took Wiles and collaborator Richard Taylor around a year to fix. The final proof spans 129 pages and took months to verify

2

.

Source: New Scientist

Source: New Scientist

How AI Agents Tackled the Formalization Challenge

The formalization process involved numerous AI agents working continuously and autonomously, each assigned different tasks like tackling smaller chunks of the theorem

1

. The internal research model, described as roughly on par with Claude Fable 5.1, generated six billion tokens of output while completing the task

2

. Human experts occasionally issued high-level instructions to keep the work on track, but the system operated largely independently.

Formalization translates mathematical proofs from pen and paper into Lean programming language, allowing machines to methodically work through the logic and expose any flaws

1

. This computer code configuration is crucial because proofs often involve lengthy logical arguments that build on each other—if a single step contains an error, the entire structure can collapse. Anthropic's formalized proof covers roughly 29,500 intermediate theorems that were necessary stepping stones to completing the overall work

1

.

The Breakthrough That Made Success Possible

Anthropic's initial attempt to formalize the proof was unsuccessful. Several times the agents lost track of the project's state and stopped collaborating effectively

1

. The breakthrough came when the company gave Claude access to Prove2Me, an open-source tool designed for human mathematical collaboration

2

. This software helped different agents track their work, determine the optimal next step in lengthy processing workflows, and decide on subsequent tasks. Prove2Me also helped lower inference costs during the formalization process.

The complexity of formalization stems from the terse nature of mathematical proofs, which lack certain explanations that computers need to understand them

2

. Lean developers must manually add these explanations. Another challenge is that arguments in proofs build on one another, meaning one erroneous line of Lean code can render all subsequent code invalid.

Implications for Mathematical Research and AI Capabilities

Kevin Buzzard at Imperial College London, who was working on a five-year project to formalize the same proof, stated that Anthropic's result leaves "no assumptions other than the axioms of mathematics"

1

. Buzzard noted that the proof demonstrates autoformalisation across algebra, harmonic analysis, geometry and number theory, proving that AI autoformalisation artefacts are now robust enough to be built upon. "If the automatic formalisation of FLT is possible now, then we have taken a big step towards automatic formalisation of the modern mathematical literature," he said

1

.

The 13 million lines of formalized proof are over five times the current size of all previous work stored in the Mathlib repository, which contains 2 million lines of formalised mathematics

1

. This massive expansion demonstrates the scale at which AI can now operate in mathematical verification. The achievement comes a month after Anthropic used Claude to discover new information about the Riemann zeta function, the center focus of the Riemann hypothesis, one of the world's most difficult conjectures

2

.

Source: SiliconANGLE

Source: SiliconANGLE

The Competitive Landscape in AI-Driven Mathematics

Anthropic isn't alone in harnessing LLMs to advance mathematics research. Rival OpenAI recently used its latest Astra model to solve several Erdos problems and narrow a number of open questions in theoretical computer science

2

. This competition signals a broader trend: AI systems are moving beyond pattern recognition and natural language processing to tackle abstract reasoning tasks that were previously the exclusive domain of human experts.

The speed of Anthropic's achievement—completing in 11 days what was expected to take years—suggests we're approaching an inflection point in automating the formalization of mathematics. Watch for increased collaboration between AI companies and mathematical institutions, potential acceleration of other long-standing formalization projects, and growing use of AI agents in verifying complex proofs. The implications extend beyond pure mathematics: computer-verifiable proofs could strengthen cryptographic systems, improve software verification, and accelerate scientific research that relies on mathematical foundations.

Today's Top Stories

© 2026 TheOutpost.AI All rights reserved