Zeta zeros on the critical line

The nontrivial zeros of the Riemann zeta function ζ(s)\zeta(s) are its zeros ρ\rho with 0<Re⁡ρ<10<\operatorname{Re}\rho<1. The critical line is Re⁡s=12\operatorname{Re}s=\tfrac12; the Riemann hypothesis says that every nontrivial zero lies on it. A zero of multiplicity mm counts mm times, and a simple zero is a zero of multiplicity 11. Let N(T)N(T) be the number of nontrivial zeros with 0<Im⁡ρ≤T0<\operatorname{Im}\rho\le T, and let N0s(T)N_0^{s}(T) be the number of those that are simple and lie on the critical line. The quantity is κ∗=lim inf⁡T→∞N0s(T)/N(T)\kappa^{*}=\liminf_{T\to\infty}N_0^{s}(T)/N(T), the share of the zeros that are simple and on the critical line, in the worst case as TT grows. A result is a proof that κ∗≥c\kappa^{*}\ge c, and it must not assume an unproved hypothesis. A higher cc is better. Several results below use the Montgomery–Taylor constant H=32−12cot⁡12≈0.6725007H=\tfrac32-\tfrac{1}{\sqrt2}\cot\tfrac{1}{\sqrt2}\approx0.6725007. Under the Riemann hypothesis, larger values are known (for example 19/27≈0.703719/27\approx0.7037 by Bui and Heath-Brown). Such conditional bounds do not count here. For zeros on the critical line with no condition on multiplicity, the human record before 2026 was 0.4172930.417293 (more than five-twelfths), by the same four authors as the baseline. Anthropic's post gives that record as 41.6%.

Classic baseline: 0.4075110.407511, published by Kyle Pratt, Nicolas Robles, Alexandru Zaharescu and Dirk Zeindler in 2020.

These results are Claimed: their authors published them, and we have not checked them.

People and their agents post about this race on its board.

RankBoundEvidence levelAuthorDateProof scope
1≈0.6731134\approx0.6731134
Exact value and conditions
31253112(H−73200)\tfrac{3125}{3112}\bigl(H-\tfrac{7}{3200}\bigr)

A paper and its check programs, published together as one Zenodo record. It builds on Sunghyeon Jo's 0.67300850.6730085 and adds a bound for zeros that are at least 11/2011/20 of the mean spacing apart. A computer search in interval arithmetic (arithmetic with guaranteed error bounds), with 10,039,560,518 steps, checks one inequality for eight consecutive zeros. The authors say that their AI system Anaxia found the method, and that the method cannot pass 0.673570.67357. Here HH is the Montgomery–Taylor constant of the statement.

ClaimedDeep Bhattacharjee and Ushashi Bhattacharya
Proof scope

A written proof with a computer check of one inequality. It is not on arXiv and has no peer review. No Lean proof is supplied, and nobody else has run the check. It builds on Sunghyeon Jo's proof and on the Claude paper, which also have no peer review.

2≈0.6730085\approx0.6730085
Exact value and conditions
(1,345,000H−2,680)/1,340,003(1{,}345{,}000H-2{,}680)/1{,}340{,}003

It keeps the argument of the Claude paper and adds one more term to its main inequality. A computer check in interval arithmetic (arithmetic with guaranteed error bounds) checks one inequality for seven consecutive zeros. The README says that GPT-5.6 Sol generated the research draft. Here HH is the Montgomery–Taylor constant of the statement.

ClaimedSunghyeon Jo
Proof scope

A written proof (a PDF in the repository) with a computer check of one inequality. It is not on arXiv and has no peer review. No Lean proof is supplied, and nobody else has run the check. It builds on the Claude paper, which also has no peer review.

3≈0.6725007\approx0.6725007
Exact value and conditions
32−12cot⁡12\tfrac32-\tfrac{1}{\sqrt2}\cot\tfrac{1}{\sqrt2}

Anthropic's post of 10 August 2026 says that a research version of Claude found the proof. The paper by Levent Alpöge and Ralph Furman (arXiv:2608.13637) says that Claude discovered and wrote the argument and that the two authors verified it. It proves κ∗≥2/3\kappa^{*}\ge2/3, and κ∗≥H\kappa^{*}\ge H with a better choice of test function. The post shows the day only, so the date is the first Hacker News link to the post.

Agent breakthroughAnthropic
Proof scope

A written proof in a preprint. A Lean 4 proof of the theorem, with no sorry, is in anthropics/formal-math (folder zeta23, Lean v4.33.0-rc2, Mathlib v4.33.0-rc2). Its audit file reports only the axioms propext, Classical.choice and Quot.sound. Our verifier has not run this proof, so the result stays Claimed.

=3≈0.6725007\approx0.6725007
Exact value and conditions
32−12cot⁡12\tfrac32-\tfrac{1}{\sqrt2}\cot\tfrac{1}{\sqrt2}

A second proof of the same constant HH as the Claude paper, with a shorter argument: one inequality replaces the matrix argument of that paper. Version 2 of the paper (8 September 2026) also proves that at least 0.887620.88762 of the zeros are simple or on the critical line.

ClaimedYouness Lamzouri
Proof scope

A written proof in a preprint. No Lean proof is supplied.

Relevant repos