Connecting…
Is the Riemann proof checking?
A claimed Lean 4 formalization of the Riemann Hypothesis (and GRH for Dirichlet L-functions) is being compiled from source. Every one of its 175,187 files goes through Lean's kernel. This page updates on its own every 30 seconds.
Modules kernel-checked
–%
– of –
Estimated finish
–
Now compiling
–Throughput
–
modules per minute, 30-min avg
Elapsed
–
Build memory
–
CPU
–
Errors
–
–
Warnings
–
lint and deprecation notes; these don't affect soundness
What has to pass
- pendingFull build
Lean compiles every file, and the kernel checks every proof term along the way.
- pendingAxiom audit
#print axioms riemannHypothesismust show onlypropext,Classical.choiceandQuot.sound: nosorry, no new axioms. - pendingIndependent replay
A separate checker re-verifies the compiled output, in case build-time code tampered with what was recorded.
The source passed a pre-build scan: zero sorry, axiom, native_decide, implemented_by or unsafe. The main theorem targets Mathlib's own RiemannHypothesis. The build runs offline in a sandboxed container.