On the Quantitative Sieve Parity Bypass under the Siegel Zero Hypothesis
This paper develops a quantitative form of the “exceptional-character bypass” of the sieve parity barrier for the binary Goldbach problem. The main statement is explicitly conditional: if a Siegel zero of exists, then the number of representations satisfies for all even above an explicit threshold depending on .
Status correction (May 2026). A later source audit found that the draft’s derivation additionally rests on a broad Hardy–Littlewood-type dominance assumption that has not been matched to any published theorem. The claimed bypass of the parity barrier is therefore not established from the Siegel-zero hypothesis alone; the text is kept online as a documented draft, with its status corrected here and on the results page. The paper does not prove the Goldbach conjecture.
BibTeX
@misc{zheleznov2026siegel,
author = {Zheleznov, Sergey},
title = {On the Quantitative Sieve Parity Bypass
under the Siegel Zero Hypothesis},
year = {2026},
month = may,
howpublished = {Unreviewed draft v1, goldbach.zheleznov.com},
url = {https://goldbach.zheleznov.com/papers/paper1_bk_plus.pdf},
note = {Accessed YYYY-MM-DD}
}