A Reproducible Quantitative Framework for Zeta-Zero Verification (Summary for Researchers)

Abstract

Concise summary of a reproducible quantitative framework for zeta-zero verification: Criterion 1 (argument-quantitative jump = pi +/- delta_theta iff exactly one zero, with Riemann-Siegel error bound, Gabcke constant); Criterion 2 (lock-circle geometry); five-dimensional omission sweep (0 off-line candidates); grid/Taylor refinement; three-tool off-line detection. 298,190 zeros complete (t <= 200,000), truncation sampling to 2x10^14. Pure Python, fully reproducible. NOT a proof of the Riemann hypothesis.