Formalizing Fermat's Last Theorem
ScienceFormalizing Fermat's Last Theorem Sep 4, 2026We are sharing the first complete computer-checked proof of Fermat’s Last Theorem. Claude worked largely autonomously over 11 days to write the proof in the Lean programming language. Fermat’s Last Theorem (FLT), as the conjecture became known, turned out to be incredibly difficult to prove.
- ▪ScienceFormalizing Fermat's Last Theorem Sep 4, 2026We are sharing the first complete computer-checked proof of Fermat’s Last Theorem.
- ▪Claude worked largely autonomously over 11 days to write the proof in the Lean programming language.
- ▪Fermat’s Last Theorem (FLT), as the conjecture became known, turned out to be incredibly difficult to prove.
Hacker News (Front Page) files mainly under programming. We currently carry 1,435 of its stories. Top-voted stories on Hacker News.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Anthropic |
| Canonical URL | https://www.anthropic.com/research/formalizing-fermats-last-theorem |
| Publication time | Fri, 04 Sep 2026 18:42:56 +0000 |
| Retrieval time | 2026-09-04T19:01:43.598Z |
| Last seen | 2026-09-04T19:01:43.598Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | None |
| Cluster logic | Not yet clustered, or no peer story found in the clustering window. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
ScienceFormalizing Fermat's Last Theorem Sep 4, 2026We are sharing the first complete computer-checked proof of Fermat’s Last Theorem. Claude worked largely autonomously over 11 days to write the proof in the Lean programming language. Below, we describe how the formalization was done and share some thoughts about what this work could mean for research mathematics.Around 1637, Pierre de Fermat jotted down a claim in the margin of his copy of Diophantus’s Arithmetica that would become one of the most famous mathematical conjectures of all time: no positive integers a, b, c satisfy aⁿ + bⁿ = cⁿ for any n > 2. Fermat’s Last Theorem (FLT), as the conjecture became known, turned out to be incredibly difficult to prove.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Anthropic.
Discussion
0 commentsMore from Anthropic
