Yudkowsky summons Grok to explain how Lean machine-verifies a Riemann proof

matthew_d_green · x · 2026-11-21

A screenshot thread captures someone asking how we'd verify an AI's claimed proof of the Riemann Hypothesis. Eliezer Yudkowsky tags @Grok to explain: Lean is a theorem prover built on dependent type theory where a small trusted kernel type-checks terms — if the formalization compiles cleanly (no sorry, no extra axioms) against Mathlib's definition, the proof is machine-verified. Asked to explain it 'like they're five,' Grok offers a LEGO analogy: Lean is the robot checking every brick against the official castle picture.

Original post →

More from Fun

Fun channel →