Fermat’s Last Theorem — no positive integers a, b, c satisfy aⁿ + bⁿ = cⁿ for n > 2 — sat unproven for 350 years after Fermat claimed a “marvelous proof” his margin was too narrow to contain. Andrew Wiles proved it in 1995 with a 129-page argument, and even that nearly collapsed: a reviewer’s question exposed a gap that took Wiles a year to fix.
Anthropic says Claude has now produced the first proof a computer can check end to end. In 11 days, working largely autonomously, a team of collaborating Claude agents wrote roughly 13 million lines in Lean — a “proof assistant” language that verifies every logical step — proving about 30,000 intermediate theorems along the way. Translating a proof into this form is called formalization, and it is brutally tedious for humans: Lean needs to see every step, however trivial. A community effort had expected to take years.
...