Baturalp Güvenç · Wiener Labs · Published August 3, 2026 · Zenodo, CC BY 4.0
Abstract
We study the exponent-level structure of zero-density estimates for the Riemann zeta function around the Guth-Maynard bound
First, the classical zero-detection pipeline is formalized as an explicit two-player length-selection game and solved exactly. The Ingham, Huxley, Guth-Maynard and Jutila exponents all arise as closed-form straddle-closure values, each accompanied by a machine-checkable dual certificate. For the stated input library the value
is exactly optimal on , Proposition 12.1 of Guth-Maynard is provably neutral, and the diagonal edge of the certificate is matched by an explicit example whenever .
Second, an entropy ledger shows that within the Guth-Maynard Fourier framework every additional leg of the cyclic Gram moment costs a factor at both critical configurations, which closes the route.
Third, the extremal rational-concentration scenario is verified to be a simultaneous fixed point of four independent constraint families, including a Rudin-Chang bound over the -dissociated log-prime system; a universal height law emerges across the whole range.
Finally, a single Alignment Hypothesis on linear-form correlations of mollified Möbius coefficients is isolated and its exact price computed: it yields
but leaves the uniform exponent invariant.
All exponent arithmetic is verified in exact rational arithmetic. No new unconditional zero-density exponent is claimed; the contribution is the certification of optimality for the stated inputs, the barrier map, and the conditional results. Verification code accompanies the paper.
Where it sits
Zero-density estimates bound , the number of zeros of with and , in the form
The 2024 Guth-Maynard breakthrough moved the frontier at for the first time since Ingham. This paper does not push the frontier further; it maps the walls around it. Three independent barriers are certified, each with an exact ledger of what any assault on it must pay, and the one hypothesis that would move a wall is priced exactly.
The full paper, together with the exact-arithmetic verification code, is openly available on Zenodo under CC BY 4.0.