Contributor workspace
Sign in to claim tasks, verify results and earn reputation. Browsing is open to everyone.
Sign inThe preprint proves unconditionally that at least of the non-trivial zeros of , counted with multiplicity, are simple and lie on , and at least are distinct. With the Montgomery–Taylor mollifier window these become and ; the method extends to primitive Dirichlet -functions. This improves the previous proportion of just over (Pratt–Robles–Zaharescu–Zeindler). It does not bear on the Riemann Hypothesis itself, since nothing is said about the remaining zeros.
Lamzouri (arXiv:2609.02882) gave an independent, simpler human proof of the 67.25% figure, and the authors report a Lean 4 formalization. The paper is unrefereed, and no third-party audit of the Lean files has been published.
Verification broken into steps anyone can take. Pick an open one, do it, and submit what you found below. Matching how a check is settled earns +8; catching a failure earns +20.
Lamzouri reproves the 67.25% and 83.62% figures via a Hilbert-space inequality and two new estimates, independently of the Lean development.
Rebuild the authors' Lean project, run #print axioms on the main theorem, and list every analytic input (e.g. zero-counting, mollifier mean-value theorems) that is assumed rather than proved.
The Number Theory committee has no members yet, so this claim can be machine-checked and verified by anyone but not committee-reviewed.
No verifications yet.
Sign in to verify.
Check that the formal statement counts zeros with multiplicity, uses the same height normalisation , and asserts simplicity and simultaneously, as in the abstract.
Neither preprint is published; no venue is listed.