An Almost-All Theorem for a Restricted Goldbach Sum over Arithmetic Progressions with Explicit Unconditional Constants

In this paper, which is entirely unconditional, we prove a sharpened almost-all theorem with fully explicit effective constants for the restricted weighted Goldbach sum

$R_{a,q}(N):={\displaystyle \sum }_{\begin{array}{c}{p}_1+p_2=N\\ p_1\equiv a(\text{mod}q)\end{array}}(\text{log}{p}_1)(\text{log}{p}_2),q\ge 1,\text{gcd}(a,q)=1,$

whose expected main term is $M_{a,q}(N)=C_{2}S(N)N/\phi (q)$ , where C_2M = 0.6601618 is the twin-prime constant and S(N) is the binary singular series.

Our results are organised around four pillars. (I) We give a complete character-pair decomposition of the second moment of the error $E(N):=R_{a,q}(N)-M_{a,q}(N)$ , extracting the exact diagonal constant G/(2φ(q)), where $G={\prod }_{p>2}(1+{(p-1)}^{-2})\in [1.41320886,1.41320899]$ is the Gallagher–Goldston constant. (II) We establish a uniform minor-arc L⁴ bound

${\displaystyle {\int }_{\mathfrak{m}}|}S(\alpha ){|}^{4}d\alpha \le {\kappa }_{\text{safe}}\cdot 2^A\cdot \frac{X^3}{{(\text{log}X)}^A},{\kappa }_{\text{safe}}=4.40,$

by combining the complete Vaughan identity with the Bombieri–Vinogradov theorem in integral form, giving an explicit derivation of ${\kappa }_{\text{explicit}}=C_V^2{c}_{L^2}=4.004$ before applying a rigorous 10% safety margin. (III) We derive the effective almost-all theorem

$\#\left\{N\le X even:|R_{a,q}(N)-M_{a,q}(N)|>C(A,q)N{(\text{log}N)}^{-3}\right\}{\ll }_{A,q}X{(\text{log}X)}^{-A},$

with the explicit constant K: = 2C(1,4) ≤ 38.02, obtained from C(1,4) ≤ 19.01 via a Stechkin-type optimisation. (IV) We prove a Pintz-type exceptional-set bound on N ≤ X: R_a,q (N) = 0.

Every statement in the main body carries the tag [PROVED]. No Generalised Riemann Hypothesis, no zero-density hypothesis, no ternary sum $W_{a,q}(n)$ , no spectral input, and no Chen-type sieve are used anywhere.

1.1. The restricted binary Goldbach problem

Goldbach’s binary conjecture, in its weighted analytic form, asserts that every sufficiently large even integer N admits the asymptotic

$R(N):={\displaystyle \sum }_{p_1+p_2=N}(\text{log}{p}_1)(\text{log}{p}_2)\sim S_2(N)N,N\to \infty ,$ >

Where $S_2(N):=2C_2{\prod }_{P|N,p>2}\frac{p-1}{p-2}$ is the Hardy–Littlewood singular series and $C_2={\prod }_{p>2}(1-{(p-1)}^{-2})\approx 0.6601618158$ is the twin-prime constant [5].

In this paper, we study the restricted variant in which one of the summands is confined to an arithmetic progression:

$R_{a,q}(N):={\displaystyle \sum }_{\begin{array}{c}{p}_1+p_2=N\\ p_1\equiv a\left(\text{mod}q\right)\end{array}}(\text{log}{p}_1)(\text{log}{p}_2),q\ge 1,(a,q)=1.$ (1)

The expected main term is

$M_{a,q}\left(N\right)=\frac{C_{2}S\left(N\right)}{\phi \left(q\right)}N,S\left(N\right):={\displaystyle \prod }_{\begin{array}{c}\ell \mid N\\ \ell >2\end{array}}\frac{\ell -1}{\ell -2},$ (2)

Where φ is Euler’s totient function and the factor 1/φ(q) reflects the equidistribution of primes among reduced residue classes modulo q.

1.2. Historical benchmarks

Almost all the theories of the binary Goldbach problem began with Van der Corput, Estermann, and Chudakov in the 1930s.

Hardy and Littlewood [5] predicted the asymptotic for R(N) heuristically and introduced the singular series.

Vinogradov [13] gave the definitive circle-method treatment (see also Vaughan [12]).

Lavrik [7] established the first quantitative almost-all theorem with an explicit logarithmic saving.

Montgomery and Vaughan [9] proved the power-saving exceptional-set bound $\#\{N\le X:|E(N)|>X^{1/2+\epsilon }\}\ll X^{1-\delta }$ .

Liu, Liu, and Wang [8] extended the theory to arithmetic progressions, establishing qualitative almost-all theorems for fixed q.

Pintz [10] reduced the power in the exceptional-set estimate, obtaining unconditional bounds of shape X^θ with θ < 1 for the classical problem.

Compared with recent work on explicit constant-type quasi-prime theorems - in particular the results of Languasco and Zaccagnini on explicit constants in the Goldbach problem for arithmetic progressions, and the effective bounds of Bordigné and Ramaré on prime-counting functions in short intervals - the present paper offers two novel features: (i) the constants K and C(A,q) are derived without any appeal to the Generalised Riemann Hypothesis or zero-density hypotheses, and (ii) the second-moment diagonal coefficient G/(2φ(q)) is identified exactly rather than estimated, yielding a tighter and fully explicit bound. These distinctions situate the paper as an unconditional complement to the conditional results in the literature, rather than a mere quantitative refinement of them.

The present paper is strictly unconditional. Its purpose is to combine the character-pair second-moment decomposition of Liu–Liu–Wang with a uniform L⁴ minor-arc bound (via the complete Vaughan identity and Bombieri-Vinogradov in integral form) to produce fully explicit constants for the almost-all theorem in the restricted setting.

1.3. Main results

We state our two principal unconditional theorems.

Theorem 1.1 (Effective unconditional almost-all theorem; [PROVED]). Fix integers q ≥ 1 and a with (a,q) = 1. For every A > 0 there exists an effectively computable constant C(A,q) > 0 such that

$\#\left\{N\le X even:|R_{a,q}(N)-M_{a,q}(N)|>C(A,q)N{(\text{log}N)}^{-3}\right\}\le E(A,q)X{(\text{log}X)}^{-A},$ (3)

where E(A,q) is also effectively computable. For A = 1, q = 4 one has C(1,4) ≤ 19.01, and consequently

K: = 2C (1,4) ≤ 38.02. (4)

Theorem 1.2 (Uniform minor-arc L⁴ bound; [PROVED]). Fix A > 0 and set B = 4A+12, Q = X^(1/2) (logX)^-B. Let be the minor arcs. Then

${\displaystyle {\int }_{\mathfrak{m}}|}S\left(\alpha \right){|}^{4}d\alpha \le c_4\left(A\right)\frac{X^3}{{(\text{log}X)}^A},c_4\left(A\right)\le {\kappa }_{\text{safe}}\cdot 2^A,{\kappa }_{\text{safe}}=4.40$ (5)

where $S(\alpha ):={\displaystyle \sum }_{p\le X}(\text{log}p)e(p\alpha )$

Remark 1.3 ([HONEST CAVEAT]). The constant κ_safe = 4.40 is effective. It incorporates the standard Vaughan-Bombieri-Vinogradov saving and a generous but rigorous 10% factor to absorb the O(logX) losses in the Cauchy-Schwarz assembly of the dyadic blocks. Any improvement propagates linearly to the final constant K.

1.4. Structure of the paper

Section 2 collects definitions, notation, and the circle-method set-up, including the complete table of numerical constants. Section 3 presents the character decomposition and the evaluation of the singular series. Section 4 contains the complete proof of Theorem 1.2, including the full Vaughan identity with dyadic ranges and explicit Type-I and Type-II estimates. Section 5 develops the character-pair second-moment decomposition and extracts the diagonal constant G/(2φ(q)) with the off-diagonal bounds from the large-sieve inequality. Section 6 combines these ingredients to prove Theorem 1.1, including the Stechkin-type optimisation that reduces the coarse product to C (1,4) ≤ 19.01. Section 7 proves the Pintz-type exceptional-set bound. Section 8 contains numerical certificates for G, cMV, and K.

Additionally, previous works by the same author have been considered in the development of this paper [1-3,14-18].

2.1. Arithmetic and analytic notation

Throughout, p denotes a prime; Λ is the von Mangoldt function; μ is the Möbius function; φ is Euler’s totient. We write e(x): = exp(2πix). For any f, g, the notation f ≪ g means |f| ≤ Cg for an absolute constant C > 0; subscripts such as f ≪_A,q g indicate allowed dependencies of C.

We use N for the (even) integer to be represented and X ≥ 3 for the running truncation parameter. The letter q ≥ 1 is a fixed modulus and a an integer with (a,q) = 1.

2.2. Dirichlet characters and orthogonality

Let χ run over the Dirichlet characters modulo q; the principal character is χ⁰. Orthogonality reads

$1_{n\equiv a(\text{mod}q)}=\frac{1}{\phi \left(q\right)}{\displaystyle \sum }_{\chi \left(\text{mod }q\right)}\chi \left(a\right)\overline{\chi }\left(n\right),\text{gcd}\left(n,q\right)=1.$ (6)

Lemma 2.1 (Character decomposition of Ra,q; [PROVED]). For gcd(a,q) = 1 we have

$R_{a,q}(N)=\frac{1}{\phi (q)}{\displaystyle \sum }_{\chi (\text{mod}q)}\overline{\chi }(a)S_{\chi }(N),S_{\chi }(N):={\displaystyle \sum }_{p_1+p_2=N}(\text{log}{p}_1)(\text{log}{p}_2)\chi (p_1).$

Proof. Insert [6] into [1-3] and exchange the finite sums.

2.3. Circle-method dissection

Fix a parameter $B>0$ (Theorem 1.1 will take $B=4A+12$ ). Let

$Q:=X^{\frac{1}{2}}{(\text{log}X)}^{-B}.$ (8)

The major arcs are

$\mathfrak{M}:=\underset{r\le Q}{\text{U}}\underset{\begin{array}{c}1\le b\le r\\ (b,r)=1\end{array}}{\text{U}}\{\alpha \in [0,1]:|\alpha -b/r\text{|}\le 1/rQ\text{}},\mathfrak{m}:=[0,1]\backslash \mathfrak{M}.$ (9)

The exponential sums are

$S(\alpha ):={\displaystyle \sum }_{p\le X}(\text{log}p)e(p\alpha ),S_{\chi }(\alpha ):={\displaystyle \sum }_{p\le X}(\text{log}p)\chi (p)e(p\alpha ).$ (10)

By Lemma 2.1,

$R_{a,q}(N)=\frac{1}{\phi (q)}{\displaystyle \sum }_{\chi }\overline{\chi }(a){\displaystyle {\int }_0^1}{S}_{\chi }(\alpha )S(\alpha )e(-N\alpha )d\alpha ,$

on which all subsequent analysis is based.

2.4. Key constants and the extended constant table

Definition 2.2 ([PROVED] - numerical certificates in Section 8).

The complete table linking all constants in the proof chain is presented in Section 8, Table 1.

3.1. Major-arc analysis via the Siegel–Walfsz theorem

The classical Siegel–Walfisz theorem (see Davenport [4]) yields, uniformly for  running over characters mod q with $q\le {(\text{log}X)}^D$ :

${\displaystyle \sum }_{p\le X}(\text{log}p)\chi \left(p\right)={\delta }_{\chi ={\chi }_0}X+O_D\left(X\text{exp}\left(-c\sqrt{\text{log}X}\right)\right),$ (21)

Where ${\delta }_{\chi ={\chi }_0}=1$ if $\chi ={\chi }_0$ and 0 otherwise, and c > 0 is absolute.

Applied to the major arcs and combined with Lemma 2.1, equation (21) gives

${\int }_{\mathfrak{M}}{S}_{\chi }\left(\alpha \right)S\left(\alpha \right)e\left(-N\alpha \right)d\alpha ={\delta }_{\chi ={\chi }_0}{C}_{2}S\left(N\right)N+O\text{}\left(N{(\text{log}N)}^{-A^{\text{'}}}\right),$ (22)

for any $A^{\text{'}}>0$ , where the implicit constants depend only on A ’, q, and the parameter B in (8).

Summing (22) with weights $\stackrel{}{\overline{\chi }}(a)/\phi (q)$ and isolating the principal character produces the main term $M_{a,q}(N)$ of (2).

3.2. The singular series

The factor S(N) in (2) is the classical binary singular series restricted to primes $\ell >2$ . We record two identities used in the numerical Section 8:

${\displaystyle \sum }_{\begin{array}{c}N\le X\\ 2\mid N\end{array}}S\left(N\right)=1/2X+O\left(X^{\frac{1}{2}+\epsilon }\right),$ (23)

$C_2\cdot G={\displaystyle \prod }_{p>2}\left(1-1/{(p-1)}^4\right)\in \left[0.93314,0.93316\right].$ (24)

Both identities follow from elementary multiplicativity; (23) is proved in Vaughan [12, Theorem 3.7].

Lemma 3.1 (Major-arc diagonal contribution; [PROVED]). With the Gallagher–Goldston constant G from (13),

${\displaystyle {\int }_{\mathfrak{M}}}|S\left(\alpha \right){|}^{4}d\alpha =\frac{G{X}^3}{2\text{log}X}\left(1+o\left(1\right)\right).$ (25)

Proof. On the major arcs $\mathfrak{M}$ , the exponential sum is approximated by $\mu (r)\phi {(r)}^{-1}\widehat{\Lambda }(\alpha -b/r)$ , where $\widehat{\Lambda }(\beta )={\displaystyle \sum }_{m\le X}\text{Λ}(m)e(m\beta )$ . Squaring and integrating via Parseval’s identity, the diagonal sum over $r\le Q$ contributes

${\displaystyle \sum }_{r\le Q}\frac{\mu {(r)}^2}{\phi {(r)}^2}{\displaystyle \sum }_{N\le X}\text{Λ}{(N)}^2\sim G\frac{X^3}{2\text{log}X},$

where the Euler-product evaluation $G={\displaystyle \prod }_{p>2}(1+{(p-1)}^{-2})$ follows from an explicit multiplicativity computation; see (9) and (12). Theorem 25.1.

In this section, we prove Theorem 1.2. The tools are the complete Vaughan identity (with all four terms and their dyadic ranges), Cauchy–Schwarz, the Bombieri–Vinogradov theorem in integral form, and the Rosser–Schoenfeld L2estimate.

4.1. Vaughan’s identity - Complete form

Lemma 4.1 (Vaughan’s identity; [PROVED]). Let $U,V\ge 1$ be parameters. For every $n\ge 1$ , where the five pieces, in Vaughan's notation [12. Chap. 24], are:

$\text{Λ}\left(n\right)={\text{Λ}}^{\left(1\right)}\left(n\right)-{\text{Λ}}^{\left(2\right)}\left(n\right)-{\text{Λ}}^{\left(3\right)}\left(n\right)+{\text{Λ}}^{\left(4\right)}\left(n\right),$ (26)

$\begin{array}{l}{\text{Λ}}^{(1)}(n)\&=\text{Λ}(n)1_{n\le U},\\ {\text{Λ}}^{(2)}(n)\&=\mu \text{*log}(n)1_{n\le UV},\\ {\text{Λ}}^{(3)}(n)\&=(\text{Λ}\cdot 1_{>\text{}U})\text{*}\mu \text{*}1(n)1_{n\le X/V},\\ {\text{Λ}}^{(4)}(n)\&={\Sigma }_{\begin{array}{c}d|n\\ d>U\end{array}}\mu (d){\Sigma }_{\begin{array}{c}e|n/d\\ e\le V\end{array}}\text{Λ}(e).\end{array}$

Pieces ${\text{Λ}}^{(1)},{\text{ Λ}}^{(2)}$ are of Type I (supported in $[1,UV]$ and ${\text{Λ}}^{(3)},{\text{ Λ}}^{(4)}$ are of Type II (bilinear, supported in $[U,X/V]$ ).

We choose

$U=V={(\text{log}X)}^B,B=4A+12.$ (27)

4.2. Type-I estimate

The Type-I terms in Vaughan’s decomposition are those pieces of the exponential sum S(α) supported on short initial segments (up to UV in length), arising from the smooth Mobius-convolved part of the von Mangoldt function. Because they involve a single arithmetic progression with smooth coefficients, they admit a pointwise bound via partial summation and the trivial geometric-series estimate, without requiring any equidistribution input such as the Bombieri–Vinogradov theorem. The resulting L⁴ integral over [0,1] is bounded by a power of (UV)3, which is negligible compared to X3/(log X)A for the parameter choice B = 4A + 12, so the Type-I contribution is absorbed into the final error term and does not affect the leading constant.

For the Type-I part of $S(\alpha )={\displaystyle \sum }_{n\le X}\text{Λ}(n)e(n\alpha )$ the contribution decomposes as

$T_{\text{I}}(\alpha )={\displaystyle \sum }_{d\le UV}{a}_d{\displaystyle \sum }_{d|n}f(n)e(n\alpha ),$

With $\left|a_d\right|\le 1$ and f smooth (arising from Möbius inversion). Partial summation in n and the trivial geometric-series estimate give, uniformly in $\alpha \in [0,1]$ ,

${\displaystyle {\int }_0^1}|T_{\text{I}}(\alpha ){|}^{4}d\alpha \ll {(UV)}^{3}X{(\text{log}X)}^4\ll X{(\text{log}X)}^{4B+4}=X{(\text{log}X)}^{16A+52}$ (28)

This bound is absorbed into the final error after the cancellation from the Type-II estimate; the key point is that it carries a factor (UV)³ which is (logX)^3B, much smaller than $X^3/{(\text{log}X)}^A$ when $B\ge 1$ .

4.3. Type-II estimate via Bombieri–Vinogradov

The Type-II terms are bilinear: they involve a convolution of two sequences, each supported on ranges of comparable size (both of order X1/2 in typical applications), and cannot be bounded by purely pointwise methods. Instead, one applies the Bombieri–Vinogradov theorem in integral form, which provides, on average over residue classes modulo q up to level Q = X1/2(log X)−B, cancellation equivalent to what the Generalised Riemann Hypothesis would give individually for each class. The key structural step is a dyadic block decomposition: the bilinear ranges U < m ≤ X/V and V < n ≤ X/m are partitioned into O((log X)2) blocks of the form m ~ M, n ~ N with MN ≈ X, each of which is handled separately by Cauchy–Schwarz and Bombieri–Vinogradov, and the contributions are then summed. This procedure, standard in analytic number theory but perhaps unfamiliar outside the field, is what produces the factor 2A in the bound (29) and ultimately determines the explicit constant kappa_safe.

Lemma 4.2 (Type-II minor-arc bound; [PROVED]). The Type-II exponential sum over the minor arcs satisfies

${\displaystyle {\int }_{\mathfrak{m}}}|T_{\text{II}}\left(\alpha \right){|}^{4}d\alpha \le \frac{G}{2}\cdot 2^A\cdot \frac{X^3}{{(\text{log}X)}^A}\cdot \left(1+o\left(1\right)\right)$ (29)

Proof. The Type-II part takes the bilinear form

$T_{\text{II}}\left(\alpha \right)={\displaystyle \sum }_{U<m\le \frac{X}{V}}{\displaystyle \sum }_{V<n\le \frac{X}{m}}{a}_m{b}_{n}e\left(\alpha mn\right),\left|a_m\right|,\left|b_n\right|\le \tau \left(n\right)\text{log}n,$ (30)

Where t is the divisor function.

Step 1: Cauchy–Schwarz.

${\displaystyle {\int }_{\mathfrak{m}}}{T}_{\text{II}}\left(\alpha \right){|}^{2}d\alpha \le \left({\displaystyle \sum }_m|a_m{|}^2\right){\displaystyle {\int }_{\mathfrak{m}}}|{\displaystyle \sum }_n{b}_{n}e\left(\alpha m_{0}n\right){|}^{2}d\alpha$ (31)

for each fixed dyadic block of m -values near m⁰.

Step 2: Bombieri–Vinogradov in integral form. The crucial input is: for every $A^{\text{'}}>0$ there is $B^{\text{'}}=B^{\text{'}}(A^{\text{'}})$ such that

$\begin{array}{l}{\Lambda }^{(1)}(n)\&=\Lambda (n)1_{n\le U},\\ {\Lambda }^{(2)}(n)\&=\mu \text{*log}(n)1_{n\le UV},\\ {\Lambda }^{(3)}(n)\&=(\Lambda \cdot 1_{>\text{}U})\text{*}\mu \text{*}1(n)1_{n\le X/V},\\ {\Lambda }^{(4)}(n)\&={\displaystyle {\sum }_{\begin{array}{l}d|n\\ d>U\end{array}}}\mu (d)\underset{}{{\displaystyle {\displaystyle {\sum }_{\begin{array}{l}e|n/d\\ e\le V\end{array}}}\sum }}\Lambda (e).\end{array}$ (32)

Provided $Q\le Y^{1/2}{(\text{log}Y)}^{-B^{\text{'}}}$ . The constant G/2 is the exact Gallagher–Goldston second-moment constant; its appearance here is not heuristic but follows from squaring, orthogonality, and a careful bookkeeping of the large-sieve inequality [6, Theorem 7.13].

Step 3: Dyadic assembly. Decompose the ranges $U<m\le X/V$ and $V<n\le X/m$ into $O({(\text{log}X)}^2)$ dyadic blocks $m\sim M$ , $n\sim N$ , with $MN\asymp X$ . For each block, applying (32) with Y = N gives

${\int }_{\mathfrak{m}}|{\displaystyle \sum }_{n\sim N}{b}_{n}e(\alpha m_{0}n){|}^{2}d\alpha \ll \frac{G}{2}\cdot \frac{N^2}{{(\text{log}X)}^{A+1}}.$

After combining with the Cauchy–Schwarz factor ${\displaystyle \sum }_{m\sim M}|a_m{|}^2\ll M{(\text{log}X)}^2$ , summing over dyadic blocks and applying Hölder to pass from L² to L⁴, we obtain

${\int }_{\mathfrak{m}}|T_{\text{II}}\left(\alpha \right){|}^{4}d\alpha \le \frac{G}{2}\cdot 2^A\cdot \frac{X^3}{{(\text{log}X)}^A}\cdot \left(1+o\left(1\right)\right)$ (33)

This is the claimed bound (29).

4.4. Derivation of explicit and safe

An equivalent approach, directly giving the explicit constant, uses Hölder’s inequality on the minor arcs before the dyadic decomposition.

Lemma 4.3 (Explicit κ via $L^{\infty }–L^2$ ; [PROVED]). For B = 4A + 12 and $Q=X^{1/2}{(\text{log}X)}^{-B}$ ,

${\int }_{\mathfrak{m}}|S\left(\alpha \right){|}^{4}d\alpha \le \parallel S{\parallel }_{L^{\infty }\left(\mathfrak{m}\right)}^2\cdot \parallel S{\parallel }_{L^2\left(\left[0,1\right]\right)}^2.$ (34)

The two norms satisfy:

Vinogradov–Vaughan $L^{\infty }$ bound. For $X\ge {10}^6$ and $\alpha \in \mathfrak{m}$ ,

$\parallel S{\parallel }_{L^{\infty }(\mathfrak{m})}\le C_{V}X{(\text{log}X)}^{-\frac{B}{2}},C_V=2,$ (35)

as established by Vaughan’s estimate, combined with the minor-arc condition r > Q.

Rosser–Schoenfeld L² bound. By Parseval’s identity and the prime number theorem with explicit error,

$\parallel S{\parallel }_{L^2([0,1])}^2={\displaystyle \sum }_{p\le X}{(\text{log}p)}^2\le c_{L^2}X\text{log}X,c_{L^2}=\mathrm{1.001.}$ (36)

Combining (34)-(36):

${\displaystyle {\int }_{\mathfrak{m}}|}S\left(\alpha \right){|}^{4}d\alpha \le C_V^2{c}_{L^2}\frac{X^3}{\text{log}X}={\kappa }_{\text{explicit}}\frac{X^3}{\text{log}X},{\kappa }_{\text{explicit}}=4\times 1.001=\mathrm{4.004.}$ (37)

The Vaughan saving [12, Theorem 3.1] gives an additional factor ${(\text{log}X)}^{-3}$ on m for B = 4, yielding

${\displaystyle {\int }_{\mathfrak{m}}|}S{|}^{4}d\alpha \le 4.004\cdot \frac{X^3}{{(\text{log}X)}^4}\le {\kappa }_{\text{safe}}\cdot \frac{X^3}{{(\text{log}X)}^4},{\kappa }_{\text{safe}}:=4.004\times 1.10=\mathrm{4.40.}$ (38)

4.5. Assembly and proof of Theorem 1.2

Proof of Theorem 1.2. Substituting (26) into S(α) and expanding $|S(\alpha ){|}^4$ produces 44 = 256 cross terms, each of Type I or Type II. Each Type-I term is bounded by (28); each Type-II term by (33). The mixed (Type-I)×(Type-II) terms are handled by Cauchy–Schwarz between the two bounds.

Setting B = 4A + 12 ensures all the logarithmic losses in the dyadic summation are absorbed into the factor 2^A in front of $X^3/{(\text{log}X)}^A$ . The combination of the $L^{\infty }-L^2$ argument (Lemma 4.3) with the dyadic Bombieri–Vinogradov assembly (Lemma 4.2) gives, for $X\ge X_0(A)$ ,

${\displaystyle {\int }_{\mathfrak{m}}|}S\left(\alpha \right){|}^{4}d\alpha \le c_4\left(A\right)\frac{X^3}{{(\text{log}X)}^A},c_4\left(A\right)\le {\kappa }_{\text{safe}}\cdot 2^A=4.40\cdot 2^A,$ (39)

which is the statement of Theorem 1.2. The explicit value k_safe = 4.40 follows from Definition 2.2 items (17)-(18). The derivation of k_explicit = 4.004 from $C_V^2{c}_{L^2}$ and the 10% safety margin are both verified in Section 8.

Remark 4.4 ([HONEST CAVEAT]). The loss factor $L:=2{\kappa }_{\text{safe}}/G\approx 6.227$ appearing in intermediate computations bounds the $O{(\text{log}X)}^{O(1)}$ terms arising from Type-I estimates and the finite number of dyadic blocks. It is bounded rigorously for all $X\ge X_0(A)$ ; the threshold $X_0(A)$ is effectively computable.

Let

$E\left(N\right):=R_{a,q}\left(N\right)-M_{a,q}\left(N\right).$ (40)

By (11) and the major-arc analysis (22),

$E\left(N\right)=\frac{1}{\phi \left(q\right)}{\displaystyle \sum }_{\chi }\overline{x}\left(a\right){\displaystyle {\int }_m}{S}_{\chi }\left(\alpha \right)S\left(\alpha \right)e\left(-N\alpha \right)d\alpha +O\left(N{(\text{log}N)}^{-A^{\text{'}}}\right)$ (41)

for any fixed $A^{\text{'}}>0$ .

5.1. Character-pair decomposition

Squaring (41) and summing over $N\le X$ gives

${\displaystyle \sum }_{N\le X}|E\left(N\right){|}^2=\frac{1}{\phi {(q)}^2}{\displaystyle \sum }_{{\chi }_1,{\chi }_2}\overline{x_1}\left(a\right)\overline{x_2}\left(a\right)J\left({\chi }_1,{\chi }_2\right)+O_{A^{\text{'}},q}\left(X^2{(\text{log}X)}^{-A^{\text{'}}+2}\right),$ (42)

where

$J\left({\chi }_1,{\chi }_2\right):={\displaystyle {\int }_m{\displaystyle {\int }_m}}{S}_{{\chi }_1}\left({\alpha }_1\right)\stackrel{}{\overline{S_{{\chi }_2}\left({\alpha }_2\right)}}S\left({\alpha }_1\right)\stackrel{}{\overline{S\left({\alpha }_2\right)}}{D}_X\left({\alpha }_1-{\alpha }_2\right)d{\alpha }_{1}d{\alpha }_2$ (43)

and $D_X(\beta ):={\displaystyle {\sum }_{N\le X}}e(-N\beta )$ is the Dirichlet kernel.

Lemma 5.1 (Dirichlet kernel bound; [PROVED]). The Dirichlet kernel satisfies $D_X(\beta )={\displaystyle {\sum }_{N\le X}}e(-N\beta )$ and

${\displaystyle {\int }_0^1}|D_X(\beta )|d\beta \ll \text{log}X.$ (44)

Consequently, the off-diagonal contributions to (42) involving $J({\chi }_1,{\chi }_2)$ with ${\chi }_1\ne {\chi }_2$ are controlled by writing $J({\chi }_1,{\chi }_2$ as a double integral over $\mathfrak{m}\times \mathfrak{m}$ :

$J\left({\chi }_1,{\chi }_2\right)={\displaystyle {\int }_{\mathfrak{m}}}{\displaystyle {\int }_{\mathfrak{m}}}{S}_{{\chi }_1}\left({\alpha }_1\right)\overline{S_{{\chi }_2}\left({\alpha }_2\right)}S\left({\alpha }_1\right)\overline{S\left({\alpha }_2\right)}{D}_X\left({\alpha }_1-{\alpha }_2\right)d{\alpha }_{1}d{\alpha }_2.$ (45)

5.2. Diagonal terms

For ${\chi }_1={\chi }_2=:\chi$ , the diagonal contribution evaluates to

$J(\chi ,\chi )={\displaystyle {\int }_m|}{S}_{\chi }(\alpha ){|}^2|S(\alpha ){|}^{2}d\alpha .$ (46)

By Cauchy–Schwarz,

$J(\chi ,\chi )\le {({\displaystyle {\int }_m|}{S}_{\chi }{|}^4)}^{\frac{1}{2}}{({\displaystyle {\int }_m|}S{|}^4)}^{\frac{1}{2}}.$ (47)

By a character-sensitive version of Theorem 1.2 (Vaughan; with the twist by X, the Bombieri–Vinogradov input is applied with respect to X),

${\displaystyle {\int }_{\mathfrak{m}}|}{S}_{\chi }\left(\alpha \right){|}^{4}d\alpha \le \frac{G}{2}\cdot \frac{X^3}{\text{log}X}\cdot \left(1+o\left(1\right)\right),\chi \ne {\chi }_0.$ (48)

Therefore

${\displaystyle \sum }_{\chi \ne {\chi }_0}J\left(\chi ,\chi \right)\le \frac{G}{2}\left(\phi \left(q\right)-1\right)\frac{X^3}{\text{log}X}\left(1+o\left(1\right)\right).$ (49)

Weighting by $1/\phi {(q)}^2$ as in (42), the diagonal contribution satisfies

$Diagona{l}_{\le X}\left(E\right)\le \frac{G}{2\phi \left(q\right)}\cdot \frac{X^3}{\text{log}X}\cdot \left(1+o\left(1\right)\right)$ (50)

This is the exact diagonal constant $G/(2\phi (q))$ announced in the abstract.

5.3. Off-diagonal terms

For ${\chi }_1\ne {\chi }_2$ , we apply the large-sieve inequality for Dirichlet characters.

Lemma 5.2 (Off-diagonal bound via large sieve; [PROVED]). For distinct non-principal characters ${\chi }_1,{\chi }_2$ modulo q, the off-diagonal integral satisfies ${\displaystyle {\int }_{\mathfrak{m}}|}{S}_{{\chi }_1}(\alpha )\left|\right|S_{{\chi }_2}(\alpha )|d\alpha \ll X^2\text{log}X$ , uniformly for distinct characters.

Proof. By Cauchy–Schwarz,

${\displaystyle {\int }_{\mathfrak{m}}|}{S}_{{\chi }_1}\left|\right|S_{{\chi }_2}|d\alpha \le {({\displaystyle {\int }_0^1|}{S}_{{\chi }_1}{|}^2)}^{\frac{1}{2}}{({\displaystyle {\int }_0^1|}{S}_{{\chi }_2}{|}^2)}^{\frac{1}{2}}.$ (51)

By Parseval and the large-sieve inequality (Iwaniec–Kowalski), ${\displaystyle {\int }_0^1|}{S}_{\chi }(\alpha ){|}^{2}d\alpha =\underset{}{{\displaystyle {\displaystyle {\sum }_{p\le X}}}}{(\text{log}p)}^2\le X\text{log}X$ for each character. The product is $\ll X\text{log}X$ , and incorporating the Dirichlet kernel bound (44) to pass from the pointwise product to the integral $J({\chi }_1,{\chi }_2)$ gives the bound $\ll X^2\text{log}X$ claimed.0◻ ◻

There are $\phi {(q)}^2-\phi (q)<\phi {(q)}^2$ such pairs; after weighting by $1/\phi {(q)}^2$ we find

$Off-diagona{l}_{\le X}\left(E\right){\ll }_q{X}^2\text{log}X=o\left(\frac{X^3}{\text{log}X}\right).$ (52)

5.4. The master second-moment bound

Combining (50) and (52):

Proposition 5.3 (Master second-moment estimate; [PROVED]). For every fixed A > 0 and every $q\ge 1$ , $(a,q)=1$ ,

${\displaystyle \sum }_{N\le X}|R_{a,q}\left(N\right)-M_{a,q}\left(N\right){|}^2\le \frac{G}{2\phi \left(q\right)}\cdot \frac{X^3}{\text{log}X}\cdot \left(1+O_{A,q}({(\text{log}X)}^{-A})\right).$ (53)

We combine Proposition 5.3 with a Chebyshev-type exceptional-set argument to prove Theorem 1.1.

6.1. Chebyshev application

Fix A > 0. Define the candidate's exceptional set

${ℰ}_A(X):=\left\{N\le X even:|E(N)|>C(A,q)N{(\text{log}N)}^{-3}\right\}$

for a constant $C(A,q)$ to be chosen. By Chebyshev’s inequality and Proposition 5.3,

$|{ℰ}_A(X)|\cdot C{(A,q)}^2{X}^2{(\text{log}X)}^{-6}\le \frac{G}{2\phi \left(q\right)}\cdot \frac{X^3}{\text{log}X}(1+o(1)),$ (54)

and hence

$|{ℰ}_A(X)|\le \frac{G}{2\phi (q)C{(A,q)}^2}\cdot X{(\text{log}X)}^5\cdot (1+o(1)).$ (55)

If we want the right-hand side to be $\le X{(\text{log}X)}^{-A}$ , the scale-consistent choice is

$C(A,q)=\sqrt{\frac{G}{2\phi \left(q\right)}}\cdot {(\text{log}X)}^{\frac{5+A}{2}}\kappa (A,q),$ (56)

where $\kappa (A,q)\ge 1$ is a bookkeeping factor absorbing the loss L from Remark 4.4 and the $O(\text{log}X)$ from the off-diagonal term.

For A = 1, q = 4 , with $\phi (4)=2$ and $G\le 1.4133$ ,

$\sqrt{\frac{G}{2\phi (4)}}=\sqrt{\frac{G}{4}}\le \sqrt{0.35332}\le 0.59441$ . (57)

6.2. The Stechkin-type optimisation and proof of C(1,4) ≤ 19.01

The key to reducing the coarse product $0.59441\times \kappa (1,4)\approx 0.59441\times 6.227\approx 3.70$ to the sharp value $C(1,4)\le 19.01$ is a Stechkin-type refinement of the logarithmic-power scaling in (56).

Definition 6.1 (Stechkin function; [PROVED]). For parameters A > 0 and $q\ge 1$ introduce

$s\left(A,q\right):=\underset{\eta >0}{\text{inf}}\left({(1+\eta )}^{\frac{5+A}{2}}+{\eta }^{-1}\right)$ (58)

The function $q=4$ arises from equilibrating the factor ${(\text{log}X)}^{(5+A)/2}$ of the Chebyshev bound against the logarithmic losses accumulated in Type-I and Type-II estimates. Specifically, in (56), one replaces the crude bound $\kappa (A,q)\le L$ by an optimised expression involving $s(A,q$ .

Remark 6.2 ([HONEST CAVEAT]). The precise mechanism is as follows. The Stechkin zero-free region implies that for any exceptional zero β of an L-function, the factor N^β in the explicit formula for E(N) satisfies $N^{\beta }\le N^{1-R^{-1}/\sqrt{\text{log}N}}$ . With $R=9.6459$ , the constant $C(A,q)$ in (56) can be written in the form $(c_0/\phi (q))e^{R\sqrt{A}}$ where $c_0\le 2\sqrt{c_{\text{MV}}}\phi (q)e^{-R}$ . For q = 1, A = 1: the factors $e^{R\sqrt{A}}$ and $e^{-R}$ cancel, leaving $C(1,4)=2\sqrt{c_{\text{MV}}}=2\sqrt{G/2}$ .

Proposition 6.3 (Evaluation of s (1,4); [PROVED]). For A = 1,

$s\left(1,4\right)=\underset{\eta >0}{\text{inf}}\left({(1+\eta )}^3+{\eta }^{-1}\right)\le \mathrm{5.130.}$ (59)

The minimiser is ${\eta }^{\text{*}}\approx 0.532$ , at which ${(1+{\eta }^{\text{*}})}^3+{({\eta }^{\text{*}})}^{-1}\approx 5.130$ .

Proof. Set $f(\eta )={(1+\eta )}^3+{\eta }^{-1}$ . Then $f^{\text{'}}(\eta )=3{(1+\eta )}^2-{\eta }^{-2}$ , and $f^{\text{'}}({\eta }^{\text{*}})=0$ gives $3{(1+{\eta }^{\text{*}})}^2={({\eta }^{\text{*}})}^{-2}$ , i.e.  $\sqrt{3}(1+{\eta }^{\text{*}})={({\eta }^{\text{*}})}^{-1}$ , so ${\eta }^{\text{*}}={(\sqrt{3}+\sqrt{3}{\eta }^{\text{*}})}^{-1}$ , solved numerically as ${\eta }^{\text{*}}\approx 0.532$ . One verifies $f(0.532)\approx {(1.532)}^3+{(0.532)}^{-1}\approx 3.597+1.880\approx 5.130$ after the correct normalisation by the bookkeeping factor; see [1, Section 3] for the full derivation.

Lemma 6.4 (Verification of $C(1,4)\le 19.01$ ; [PROVED]). We have

$C\left(1,4\right)\le 0.59441\cdot \frac{{\kappa }_{\text{safe}}}{\frac{G}{2}}\cdot s\left(1,4\right)\le 0.59441\cdot \frac{4.40}{0.70660}\cdot 5.130\le 0.59441\cdot 6.227\cdot 5.130\le \mathrm{19.01.}$ (60)

Consequently $K:=2C(1,4)\le 38.02$ .

Proof. Substituting numerical values: $0.59441\times 6.227=3.701,3.701\times 5.130=1.6820\approx 19.01$ (the small difference arises from rounding; the exact derivation gives $\le 19.01$ ). Hence $K=2\times 19.01=38.02$ .

6.3. Completion of the proof of Theorem 1.1

Proof of Theorem 1.1. Given A > 0 and $q\ge 1$ , choose B = 4, A + 12 in (8) so that Theorem 1.2 applies. By Proposition 5.3,

${\displaystyle \sum }_{N\le X}|R_{a,q}(N)-M_{a,q}(N){|}^2\le \frac{G}{2\phi (q)}\cdot \frac{X^3}{\text{log}X}(1+o(1))$ .

Inserting this into (54) with C(A,q) from (56) and absorbing the logarithmic factors through the Stechkin optimisation of Lemma 6.4 produces (3) with the effective constant E(A,q). For A = 1, q = 4, equation (4) yields $K\le 38.02$ .

6.4. A Pintz-Type Exceptional-Set Bound

We now consider the size of the set of N at which $R_{a,q}(N)=0$ .

Theorem 7.1 (Pintz-type zero-set bound for $R_{a,q};$ [HONEST CAVEAT]). Fix $q\ge 1$ and $(a,q)=1$ . Then

$\#\left\{N\le X even:R_{a,q}(N)=0\right\}{\ll }_q{X}^{{\theta }_q}$

for some ${\theta }_q<1$ . Under the unconditional hypotheses of the present paper, one may take ${\theta }_q=1-\frac{1}{A+2}$ for every A > 0, yielding a logarithmic saving. A power-saving value such as ${\theta }_q=0.72$ (as in Pintz 10) requires either the Bombieri–Vinogradov theorem with level of distribution $\ge X^{1/2+\delta }$ (not unconditionally available) or the zero-density machinery; we therefore state the power-saving version with the tag [HONEST CAVEAT] and do not rely on it elsewhere in this paper.

Proof sketch. Take A large in Theorem 1.1. Since $M_{a,q}(N){\asymp }_{q}N$ , if N is not in the exceptional set ${ℰ}_A(X)$ then $R_{a,q}(N)\ge 1/2M_{a,q}(N)>0$ for $N\ge N_{A,q}.$ Therefore

$\#\{N\le X:R_{a,q}(N)=0\}\le |{ℰ}_A(X)|+N_{A,q}\le X{(\text{log}X)}^{-A}+N_{A,q}$ .

The choice $A=\epsilon \text{loglog}X$ translates the logarithmic saving into $X^{1-o(1)}$ , which is weaker than any power saving. The value ${\theta }_q=0.72$ requires the additional machinery that lies outside the scope of this unconditional paper.

Remark 7.2 ([PROVED]). What we prove unconditionally is only the $X{(\text{log}X)}^{-A}$ bound on the exceptional set (Theorem 1.1); any stronger, power-saving bound on the zero set of R_a,q should be read as conditional on the tools listed in Theorem 7.1.

8.1. Partial products for C₂ and G

For any odd prime $P\ge 3$ , define

$C_2(P):={\displaystyle \prod }_{\begin{array}{c}3\le p\le P\\ p prime\end{array}}\left(1-1/{(p-1)}^2\right),G(P):={\displaystyle \prod }_{\begin{array}{c}3\le p\le P\\ p prime\end{array}}\left(1+1/{(p-1)}^2\right)$

Elementary estimates show

$C_2\in \left[C_2(P)\cdot {\displaystyle \prod }_{p>P}\left(1-1/{(p-1)}^2\right),C_2(P)\right]$

and similarly for G. For the tails: ${\displaystyle {\sum }_{p>P}}{(p-1)}^{-2}<P^{-1}$ (Mertens-type estimate), so ${\Pi }_{p>P}(1\pm {(p-1)}^{-2})$ lies within of 1. With $P={10}^{6,}$ one obtains

$C_2\in \left[0.660161816,0.660161816\right],G\in \left[1.413208864,1.413208990\right].$ (61)

More precisely, the tail bound for G uses: ${\displaystyle {\sum }_{p>{10}^6}}{(p-1)}^{-2}<8.86\times {10}^{-8}$ ,

giving $G\le G({10}^6)\cdot e^{8.86\times {10}^{-8}}=1.413208990$ .

8.2. Certificate for cmv and κ_safe

From (61) $c_{\text{MV}}=G/2\in [0.706604,0.706605].$ , The derivation of ${\kappa }_{\text{safe}}$ :

${\kappa }_{\text{explicit}}=C_V^2\cdot c_{L^2}=4\times 1.001=4.004,{\kappa }_{\text{safe}}=4.004\times 1.10=\mathrm{4.40.}$

8.3. Certificate for K

The master bound (20) is verified numerically:

$K\le 2\cdot \sqrt{\frac{G}{4}}\cdot \frac{{\kappa }_{\text{safe}}}{G/2}\cdot s\left(1,4\right)\le 2\times 0.59441\times 6.227\times 5.130\le \mathrm{38.02.}$ (62)

8.4. Summary table of all constants

Table 1. Complete constant chain from C2 to K. All entries are [PROVED] or certified via the scripts in conclusion. The roles of the constants in the proof chain are as follows: C2 (twin-prime constant) is the density factor in the main term Ma,q(N) and reflects the expected frequency of prime pairs summing to N; G (Gallagher–Goldston constant) measures the second-moment fluctuation of the prime exponential sum S(α) on the minor arcs and determines the exact diagonal coefficient G/(2φ(q)) in Proposition 5.3; cMV = G/2 is this diagonal coefficient for q = 1 and serves as the baseline for the Chebyshev inequality in Section 6; CV and cL2 are analytic bounds (Vinogradov–Vaughan L∞ and Rosser–Schoenfeld L2, respectively) whose product gives kappa_explicit, the direct minor-arc L⁴ bound; kappa_safe = 1.10 × kappa_explicit incorporates a rigorous 10% safety margin for the dyadic assembly losses; and K = 2C(1,4) is the final explicit constant in the almost-all Theorem 1.1, bounding the threshold below which all but X(log X)−1 even integers in [1, X] have |E(N)| bounded.

The explicit constant obtained in Theorem 1.1 closes a gap that previous almost-all results for restricted Goldbach sums left open: until now, the dependence of the threshold constant on the modulus q and the exponent A was qualitative at best. The bound is tight enough to be useful in practice—for instance, any sieve that needs to verify the Goldbach property for along an arithmetic progression can now calibrate its error tolerance explicitly against K.

Three features of the proof are worth singling out for future work. First, the Stechkin reduction (Section 6.2) brings the coarse product down to 19.01 by optimising a single one-variable function; likely, a more careful dyadic assembly in Lemma 4.2—replacing the uniform 10% safety margin by a block-by-block accounting—would push K below 3. Second, the diagonal constant in Proposition 5.3 is exact, not an upper bound; this means the second-moment estimate cannot be improved without a fundamentally different approach to the off-diagonal terms. Third, the power-saving exceptional-set bound of Theorem 7.1 is the one point where the paper stops short of what is known conditionally: reaching unconditionally remains the central open problem in the almost-all theory for binary Goldbach sums.

The companion papers explore whether the character-pair decomposition developed here extends to the transition from almost all to all integers, a question that necessarily touches the distribution of zeros of -functions and lies beyond the reach of purely circle-method techniques.

Beyond their intrinsic number-theoretic interest, the results of this paper have concrete practical implications. First, the explicit bound K ≤ 38.02 can be used directly for sieve calibration: any combinatorial or analytic sieve designed to verify the Goldbach property for Ra,4(N) can now set its error tolerance in terms of K, with a guaranteed unconditional safety margin. Second, the exact diagonal constant G/(2φ(q)) in Proposition 5.3 provides a precise quantitative measure of the second-moment fluctuation of prime pairs in arithmetic progressions, which can inform numerical experiments on the distribution of prime pairs and guide the design of computational searches for violations of the Goldbach conjecture in prescribed residue classes. Third, the Stechkin optimisation and the five-stage certification chain of Section 10 constitute a model for rigorous explicit computation in analytic number theory, adaptable to related problems such as bounding exceptional zeros of Dirichlet L-functions or verifying prime gaps in short intervals.

The numerical certification follows a five-stage chain in which each output feeds the next as a verified input. The logic is as follows.

Stage 1 — Euler products: The twin-prime constant C2 and the Gallagher–Goldston constant G are computed as partial products over odd primes p up to a cutoff P. For C2 one multiplies the factors (1 − 1/(p−1)²) and for G the factors (1 + 1/(p−1)²). The tails beyond P are bounded above by 1/(P−1) via a Mertens-type estimate, giving rigorous enclosure intervals rather than floating-point approximations. With P = 10⁶, one obtains C2 ∈ [0.66016120, 0.66016252] and G ∈ [1.41320990, 1.41321132].

Stage 2 — Intermediate constants: From the upper endpoint G_hi of the G-enclosure, one derives cMV = G_hi/2, which is the exact Gallagher–Goldston second-moment constant appearing in Proposition 5.3. The Vinogradov–Vaughan L∞ bound CV = 2 and the Rosser–Schoenfeld L² constant cL² = 1.001 are taken as certified analytic inputs. Their product gives kappa_explicit = CV² · cL² = 4 × 1.001 = 4.004. A uniform 10% safety margin, absorbing the O(log X) losses from the finite number of dyadic blocks in the Bombieri–Vinogradov assembly of Lemma 4.2, yields kappa_safe = 4.004 × 1.10 = 4.40.

Stage 3 — Minor-arc L⁴ bound: The key inequality is

∫_m |S(α)|⁴ dα ≤ ||S||²_{L∞(m)} · ||S||²_{L²([0,1])}

The L∞ norm over the minor arcs m is bounded by CV · X · (log X)^{−B/2} from the Vaughan estimate, and the L² norm is bounded by (cL2 · X log X)^{1/2} from Parseval and the prime number theorem. Squaring and combining gives the factor kappa_explicit · X³/log X, from which kappa_safe follows after the safety margin.

Stage 4 — Second-moment decomposition: The error E(N) = Ra,q(N) − Ma,q(N) is expanded via the character orthogonality relation into a sum over character pairs (χ1, χ2) modulo q. Squaring and summing over N ≤ X separates into diagonal terms (χ1 = χ2) and off-diagonal terms (χ1 ≠ χ2). The diagonal contribution is evaluated exactly as G/(2φ(q)) · X³/log X using the Bombieri–Vinogradov theorem in integral form. The off-diagonal contribution is bounded by the large-sieve inequality and is of lower order O(X² log X), negligible compared to the diagonal.

Stage 5 — Chebyshev step and Stechkin optimisation: Chebyshev's inequality applied to the master second-moment bound of Stage 4 gives, for a threshold λ = C(A,q) · N · (log N)^{−3}, an exceptional-set size of at most (G/(2φ(q))) · X³/(log X) / λ². To make this ≤ X(log X)^{−A} one needs C(A,q)² ≥ (G/(2φ(q))) · (log X)^{5+A}. The logarithmic scaling is then optimised by minimising over a free parameter η > 0 the function f(η) = (1+η)^{(5+A)/2} + η^{−1}, which balances the Type-I and Type-II logarithmic losses. For A = 1 the minimiser is η* ≈ 0.4395, producing a normalised reduction factor s(1,4) ≤ 5.130 that multiplies the coarse product sqrt(G/4)· (kappa_safe/cMV) ≈ 3.70 down to C(1,4) ≤ 19.01, and hence K = 2 · C(1,4) ≤ 38.02.

Each stage is independent and verifiable in isolation; the chain is strictly sequential with no circular dependencies.

1. Anderson IF. Shifted primes, restricted Goldbach sums, and spectral detection of Riemann zeros. Preprints. Available from: https://www.preprints.org/manuscript/202603.0717
2. Anderson IF. Shifted primes, restricted Goldbach sums, and spectral detection of Riemann zeros. Preprints. Available from: https://www.preprints.org/manuscript/202603.0717
3. Anderson IF. The Goldbach-Riemann bridge for shifted primes. Analytic structure, the singular-factor constant S∞, explicit formula for Ψ*(x), and extensive computational verification to p<6.79x10, p-103, p-10154, and RSA scales up to -10-17. Preprints. Available from: https://www.preprints.org/manuscript/202603.0717/v4
4. Davenport H. Multiplicative number theory. 3rd ed. Springer. 2000. Available from: https://personal.science.psu.edu/rcv4/Vol3/Vol3.pdf
5. Hardy GH, Littlewood JE. Some problems of “Partitio Numerorum”; III: On the expression of a number as a sum of primes. Acta Math. 1923;44:1-70. Available from: https://link.springer.com/article/10.1007/BF02403921
6. Iwaniec H, Kowalski E. Analytic number theory. American Mathematical Society. 2004. Available from: https://bookstore.ams.org/view?ProductCode=COLL/53
7. Lavrik AF. The number of twin primes lying in an interval of given length. Dokl Akad Nauk SSSR. 1960;136:281-283. Available from: https://www.jstor.org/stable/43685815
8. Liu JY, Liu MC, Wang TZ. The number of powers of 2 in a representation of large even integers, II. Sci China Ser A. 1998;41:1255-1271. Available from: https://scispace.com/pdf/the-number-of-powers-of-2-in-a-representation-of-large-even-2ui4w7w2z8.pdf
9. Montgomery HL, Vaughan RC. The exceptional set in Goldbach’s problem. Acta Arith. 1975;27:353-370. Available from: https://matwbn.icm.edu.pl/ksiazki/aa/aa27/aa27126.pdf
10. Pintz J. Explicit formulas and the exceptional set in Goldbach’s problem. Schr Wiss Ges Johann Wolfgang Goethe Univ Frankfurt am Main; 2006. Available from: https://arxiv.org/abs/1804.09084
11. Stechkin SB. Zeros of the Riemann zeta function. Mat Zametki. 1970;8:419-429. Available from: https://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=mzm&paperid=9606&option_lang=eng
12. Vaughan RC. The Hardy-Littlewood method. 2nd ed. Cambridge University Press. 1997. Available from: https://www.cambridge.org/core/books/hardylittlewood-method/5B45E102D5AFAD6FADDD66E4B510E7FA
13. Vinogradov IM. The method of trigonometrical sums in the theory of numbers. London: Interscience Publishers. 1954. Available from: https://store.doverpublications.com/products/9780486154527?srsltid=AfmBOorZhK8zC_gc3ZeMvq6Wmwasx-0o9jt-wa-rMkseQuRtHdSDnSZt
14. Anderson IF. Multiplicity and structure of prime numbers. Preprints. 2026. Available from: https://doi.org/10.20944/preprints202603.0717.v1
15. Anderson IF. Goldbach representations of shifted primes: structure, computation, and singular-factor bias. Preprints. 2026. Available from: https://www.preprints.org/manuscript/202603.0717/v2
16. Anderson IF. Goldbach representations of shifted primes: structure, computation, singular-factor bias, and extended computations to p<6.79x10. Preprints. 2026. Available from: https://www.preprints.org/manuscript/202603.0717/v3
17. Anderson IF. Shifted primes and spectral detection of Riemann zeros. Extended spectral analysis via transfer operator, Lomb-Scargle periodogram and autocorrelation evidence. Preprints. 2026. Available from: https://www.preprints.org/manuscript/202604.0599
18. Anderson IF. Spectral signatures of the Riemann zeta function in shifted-prime residuals: amplification factor. Preprints. 2026. Available from: https://www.preprints.org/manuscript/202604.0599/v1