Anthropic AI formalized Fermat's last theorem proof in 11 days per Nature
Anthropic reports that Claude spent eleven days working largely autonomously to produce what it describes as the first complete computer-checked formalization of Fermat's Last Theorem in the Lean proof assistant, a landmark result Nature highlighted in recent coverage. The effort targets a problem long treated as a demanding benchmark for machine-assisted formal mathematics, shifting attention from probabilistic text generation toward verifiable logical structure. If the Lean artifact holds up under independent scrutiny, it would signal that frontier models can sustain multi-day reasoning on proofs requiring strict consistency. Public materials remain thin on methods, tooling, and the extent of human prompting or debugging during the run, so the autonomy claim should be treated as preliminary until logs and code receive outside review.
Anthropic AI formalized Fermat's last theorem proof in 11 days per Nature
Nature reports Anthropic AI formalized proof of Fermat's last theorem in just 11 days. The coverage highlights a rapid AI-driven formalization timeline for one of mathematics' most famous proofs.
Key takeaway
Claude's claimed eleven-day Lean formalization of Fermat's Last Theorem marks a shift toward verifiable, long-horizon mathematical reasoning.
What happened
Nature reports that Anthropic AI formalized the proof of Fermat's last theorem in just eleven days, highlighting a rapid AI-driven formalization timeline for one of mathematics' most famous results.
Anthropic says Claude worked largely autonomously over eleven days to formalize the proof in the Lean programming language, and the company is sharing what it calls the first complete computer-checked proof of Fermat's Last Theorem.
Evidence
Nature reports Anthropic AI formalized Fermat's last theorem proof in eleven days.
Nature AI · attributed
Nature reports Anthropic AI formalized proof of Fermat's last theorem in just 11 days.
Anthropic says Claude worked largely autonomously for eleven days to formalize the proof in Lean.
Techmeme · attributed
Anthropic says Claude worked "largely autonomously" over 11 days to formalize the proof of Fermat's Last Theorem in the Lean programming language
Anthropic is sharing the first complete computer-checked proof of Fermat's Last Theorem.
Techmeme · attributed
We are sharing the first complete computer-checked proof of Fermat's Last Theorem. Claude worked largely autonomously over 11 days
Reuters sources say Anthropic may publish its IPO prospectus in late September.
Techmeme · attributed
Sources: Anthropic is expected to make its IPO prospectus public late September and complete the listing days before the US midterm elections in November
Why it matters
Validated autonomous formalization at this scale could expand how builders use frontier models in theorem proving, code correctness, and other domains that demand machine-checkable logic rather than persuasive prose.
Limits and uncertainties
The claim of largely autonomous operation lacks transparency on human prompting, debugging, and intervention during the eleven-day run.
Nature's excerpt is generic and does not specify the formalization method, verification tools, or whether the AI generated the proof versus translating an existing human proof.
Reuters IPO timing relies on anonymous sources and lacks confirmation from Anthropic.
Practical implications
Research and verification teams should treat the Lean artifact as a benchmark candidate and plan independent review before relying on it in production proof pipelines.
Builders evaluating long-horizon agents should weigh autonomy claims against missing public interaction logs and code access.
Operators tracking Anthropic should watch for prospectus and listing disclosures that could change research pace and commercial priorities.
What to watch
Public release and independent audit of the Lean formalization code and interaction logs.
Whether Anthropic publishes its IPO prospectus in late September as Reuters sources report.
Third-party replication or verification of the computer-checked Fermat proof in Lean.
