Re:" and the proof is checked in Lean"
by DoctorOetker on Monday November 16, 2026 @06:43AM
(#50516507)
I have a concise proof of FLT.
96 cores and 500 GB RAM to ... verify FLT?
The huge size of the proof is also remarkable, since brute forcing a long sequence of steps is much harder than brute forcing a shorter sequence of steps.
I thought the whole "tactics" approach in Lean was supposed to permit shorter proofs? to skip the low level stuff?
If I formalize my short proof of FLT in MetaMath, it would just be a small file and any computer would be able to verify it.
96 cores and 500 GB RAM to ... verify FLT?
The huge size of the proof is also remarkable, since brute forcing a long sequence of steps is much harder than brute forcing a shorter sequence of steps.
I thought the whole "tactics" approach in Lean was supposed to permit shorter proofs? to skip the low level stuff?
If I formalize my short proof of FLT in MetaMath, it would just be a small file and any computer would be able to verify it.