Unconditional Bound on the Exceptional Set for the Restricted Binary Goldbach Problem Above 1019.9: A Rigorous Combination of the Almost-All Theorem and the GRH Threshold
We establish the strongest unconditional consequence of combining two recent results of the author on the restricted weighted Goldbach sum
where is the twin-prime constant and is the binary singular series. Paper (unconditional) proves an almost-all bound: the number of even for which is at most , with the explicit constant . Paper(conditional on GRH) proves that for every even with (Normalisation B), i.e. ; the certified worst-case bound is .
We prove three results. (I) (Structural obstruction, unconditional) Combining the two papers to obtain for every even is logically equivalent to proving GRH for all Dirichlet -functions modulo 4. This barrier is structural, not a deficiency of the proofs. (II) (Main theorem, unconditional) For , , any , and all ,
where is effectively computable; for the fraction of potential counterexamples among all even integers in is at most . (III) (Quantitative comparison with Pintz) The bound in (II) improves upon the Pintz unconditional bound in relative density over : the exceptional set is for every , which is smaller than any fixed power of in the relative sense.
This paper does not prove the Goldbach conjecture, does not prove GRH, and does not prove that every specific even is a Goldbach sum. The exceptional set is shown to have density zero but may be infinite. The result is the strongest unconditional statement extractable from the combination of and .
May 2026
Keywords: Goldbach problem; restricted Goldbach sum; arithmetic progressions; almost-all theorem; exceptional set; GRH threshold; Dirichlet -functions; Montgomery–Vaughan theorem; Pintz bound; explicit constants; circle method.
MSC 2020: 11P32, 11N13, 11M26.