High-Precision Approximation of Riemann Zeros via the Truncated Weil Form
Akiva Groskin

TL;DR
This paper presents a high-precision numerical implementation of the Connes-van Suijlekom truncated Weil form, achieving unprecedented accuracy in approximating Riemann zeros and eigenvalues related to the Riemann Hypothesis.
Contribution
First public implementation of the CvS Galerkin matrix at multiple cutoffs, demonstrating exponential convergence in approximating Riemann zeros and eigenvalues with high precision.
Findings
Monotonically decreasing error in first zero approximation across cutoffs
Eigenvalues reach magnitudes around 10^{-334} at c=100, N=250
Eigenvector recovery of multiple zeros to over 300 digits of accuracy
Abstract
The Connes-van Suijlekom truncated Weil quadratic form, indexed by a cutoff parameter that controls the primes entering the operator, has a ground state whose Fourier-Mellin zeros provably lie on the critical line; whether they converge to the Riemann zeros as is open (Connes 2026; Connes-Consani-Moscovici 2025). We present, to our knowledge, the first public implementation of the CvS Galerkin matrix at sixteen cutoffs ( through , plus ). Across through at , the first-zero absolute error shrinks monotonically from to -- a 113-OOM convergence across fifteen cutoffs. The smallest-positive even-sector eigenvalue separately reaches at , (275-OOM span from ), and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
