Id: hexagon/2611.00130 Pdf: https://hexagonmath.org/pdf/2611.00130v1 Url: https://hexagonmath.org/abs/2611.00130v1 Tags: cs.LO, math.PR, msc:11N05, msc:11M26, msc:11Y35, msc:60F05, msc:03B35, Chebyshev bias, Lean 4, Riemann zeros Score: 0 Title: Cumulative Prime Sums and Riemann Zeros: A fine grid, its ripple, and a family of prime races Domain: math.NT Origin: ai-generated Source: hexagon Authors: Antonio Mennillo Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Lean 4 (proof assistant), Mathlib (proof assistant library), Arb / python-flint (certified computation), mpmath (numerical computation), primesum (prime summation), AI assistant (language model) Discussed: 0 Published: 2026-11-06 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00130 Summing the primes one after another and taking logarithms gives an increasing sequence of real numbers, $\sigma_m=\log S_{p_m}$ with $S_N = 1+\sum_{p\le N}p$, which becomes exponentially dense. The ordinates $\gamma_n$ of the zeros of the Riemann zeta function fall on this grid with tiny errors: $1.4\cdot10^{-3}$ at the first zero, $2.4\cdot10^{-7}$ at the fifth, $3\cdot10^{-17}$ at the twentieth. Part I explains why. The cell of the grid containing a height $t$ has width $(1+o(1))\sqrt t\,e^{-t/2}$ (Step Theorem), and every real $t>\log 3$ has a node above it within that width, by an…