Answers are grounded in this paper and cite their sources.
Computer-assisted analysis demonstrates an unconditional 67.34% lower bound for simple zeros in the Riemann zeta function, indicating that most zeros on the critical line are non-multiple.
An Unconditional 67.345129% Lower Bound for Simple Zeros of the Riemann Zeta Function on the Critical Line: Per-Window Gram Concavity, Positioned Pressure, and an Unconditional 83.672564% Distinct-Zero CorollaryLet N(T, 2T) denote the number of nontrivial zeros of the Riemann zeta function with ordinates in the interval (T, 2T], counted with multiplicity. Let N0s(T, 2T) denote the number of those zeros that are both simple and on the critical line, and let Nd(T, 2T) denote the number of distinct zeros. We prove two unconditional, computer-assisted asymptotic bounds. As T tends to infinity, the lower limit of the ratio N0s(T, 2T) divided by N(T, 2T) is greater than 0.67345129, while the lower limit of Nd(T, 2T) divided by N(T, 2T) is greater than 0.83672564. Equivalently, more than 67.345129% of the nontrivial zeros are simple and lie on the critical line, and more than 83.672564% are distinct, with the latter proportion measured against the zero count with multiplicity. The corresponding exact rational constants are 2820183620839/4187657898650 and 7007841519489/8375315797300. Building on the unconditional finite-compression method of Alpöge and Furman, the improvement is obtained by applying a concave finite-dimensional Gram-defect profile separately inside each consecutive seven-point window before block aggregation. This per-window nonlinear construction preserves local pair information that is lost when a single aggregate chord is applied only after summation. The proof-critical step is a six-variable inequality with block length m = 367 and local target 0.0079109. It is verified over the complete domain by a fail-closed branch-and-bound computation using outward-rounded interval bounds. The analytic window constant and window positivity are independently checked with closed-form interval arithmetic. All six interval-table streams were regenerated from exact rational cell endpoints, and an independently implemented closed-form checker verifies every one of the 64,954 coarse cells and 129,909 midpoint locations across all six streams. The final deductions use exact rational arithmetic. The C++ interval verifiers are reproducible and fail closed, but are not themselves formally verified. The result is unconditional in the mathematical sense: it assumes neither the Riemann hypothesis nor any pair-correlation conjecture, zero-density hypothesis, or other unproved assertion about zeros of the Riemann zeta function. The analytic finite-compression framework is imported from the recent Alpöge-Furman preprint and its Lean companion; this release explicitly derives the finite-column Gram-to-kernel consequence used by the new assembly, while the new C++ interval certificate is reproducible but not formally verified. Release v1 includes the paper, LaTeX source, exact candidate data, rigorous interval tables, independent table checks, verification code, replay logs, provenance, and checksums. DOI: 10.5281/zenodo.22119371.The original paper and documentation are licensed CC BY 4.0. Code is licensed MIT; adapted third-party code retains its upstream notices and license text in the archive.
No takes yet. Share an insight, caveat, or question.
Ketan Singh (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: