What a Checker Checks
Fermat’s Last Theorem was proved by people in 1995. In 2026 machines wrote that proof out so a computer could check every step. Here is how fast that became, what each check actually vouches for, and the part that is still left to a reader.
1 · Time to a machine-checked proof
Three numbers, on one scale. Switch scales to see how much the shortest one hides.
The comparison is not like for like. The five-year project, begun in 2024, follows a newer route through the proof; the eleven-day proof follows the 1995 exposition and reused some of that project’s files. The thirty-hour run is Anthropic’s account, and its files are not published. Hatched means claimed, not shown.
2 · What each check vouches for
A machine-checked proof is a stack of promises. Pick a check to see which promises it keeps.
sorry, no native_decide, no extra assumptions.level_lowering_to_two really is the level-lowering step of the classical proof, at the strength claimed.3 · What it stood on
The proof’s own attribution file lists the human work it reused. The Lean was assembled by agents and published without comments, so the credits were restored afterwards by matching lines.
I’ve compiled the code base and run comparator on it — it checks out.
Mathematically this work of anthropic tells us essentially nothing.
Kevin Buzzard, who leads the human project, September 4, 2026
File counts say nothing about how important each reused file was. The point is narrower: the first machine proof did not start from nothing, and it says so.