Tool Open source
A research artifact containing a complete machine-checked Lean 4 proof of Fermat's Last Theorem, following the Frey–Serre–Ribet–Wiles and Taylor–Wiles argument and built on Mathlib. The theorem states that for natural numbers n, a, b, and c with n ≥ 3 and a, b, and c positive, a^n + b^n ≠ c^n. Lean's kernel checks the proof, which uses only Lean's three standard axioms—propext, Classical.choice, and Quot.sound—and the repository excludes sorry statements, added axioms, native_decide, unsafe code, and related escape mechanisms. A comparator independently replays the environment against a Mathlib formulation, while Nanoda, an independent Lean kernel implemented in Rust, checks an exported version of the environment. The repository also includes PROOF-PATH.md and an offline HTML presentation of the proof's theorems, definitions, dependencies, and generated documentation. It is released under the Apache License 2.0 and is described as not maintained and not accepting contributions.
1 use taken from transcripts — each links to the moment in the video.
A complete machine-checked Lean 4 proof of Fermat's Last Theorem, with no shortcuts, sorry statements, or extra axioms. The proof is independently checked by Lean's kernel and a Rust implementation called Nanoda.
1 in the library.