\section{The cases}\label{sec:rungs} Table~\ref{tab:rungs} lists the cases. For each one, the forcing depth $m^*$ is the largest $j$ with $j\eta < \alpha'$ (\S\ref{sec:construction}). The constants are the nonzero class constants of the frozen function, used at their exact binary64 values, with $c = 0$ on every other class (Appendix~\ref{app:constants}). The margin is the certified value of $1 - L/U$ (\S\ref{sec:certificates}), rounded down, at the stated resolution. Theorem~\ref{thm:lift} is applied with $m$ at or below it. The decimal values in this section are outward roundings of the exact enclosures stored with each certificate; each margin fraction is computed from the exact values, not from the printed decimals, and Appendix~\ref{app:constants} gives the exact $U$ and $L$; the diagonal bounds of the second-order cases are one unit below the logs' nearest-rounded four-decimal values or, for $(1/20, 1/5)$, rounded down from the audit's replay (\S\ref{sec:computations}). \begin{table}[ht] \centering \small \begin{tabular}{@{}llcllrll@{}} \toprule Label & Case $(\eta, \alpha')$ & $m^*$ & profile & $g$ & $|c|$ & margin & method, $M$ \\ \midrule P3a & $(1/11, 1/10)$ & 1 & all $k$ & $e_{(0,3,3)}$ & 11 & $0.08129$ & exact, $79{,}200$ \\ P3b & $(1/14, 1/8)$ & 1 & all $k$ & $e_{(0,3,1)}$ & 19 & $0.05763$ & exact, $107{,}520$ \\ P4 & $(1/18, 1/6)$ & 2 & all $k$ & $e_{(0,3,1)}$ & 13 & $0.02909$ & exact, $216{,}000$ \\ & & & & & & $0.04587$ & separate, $288{,}000$ \\ P5 & $(1/20, 1/5)$ & 3 & $k = 3$ & $e_{(0,3,4)}$ & 32 & $0.03864$ & second order, $7200$ \\ & & & & & & $0.01609$ & separate, $432{,}000^*$ \\ P6 & $(1/30, 1/4)$ & 7 & $w_2 = 1$, $w_3 = -1$ & $e_{(0,3,2)} + e_{(0,3,3)}$ & 45 & $0.013338$ & second order, $7680$ \\ P7 & $(1/30, 4/15)$ & 7 & $w_2 = 1$, $w_3 = -1$ & $e_{(0,3,2)} + e_{(0,3,3)}$ & 49 & $0.005347$ & second order, $23{,}040$ \\ \bottomrule \end{tabular} \caption{The cases: label (P3 of the computations' records is split into P3a and P3b), forcing depth $m^*$, profile, parity direction $g$, number of nonzero class constants $|c|$, and the certified margin with the method and resolution. Classes are written $(j, k, b)$ throughout, with $b$ the bin of the largest rough component ($b = 0$ if $k = 0$); P3b and P4 have the single bin $(\alpha', 1/2)$, index~$1$. ``Exact'' is the first-order certificate in exact integer arithmetic and ``second order'' the second-order engine, in integer arithmetic with directed rounding (\S\ref{sec:certificates}); ``separate'' is a separately written first-order certificate in validated binary64 arithmetic, with exact integer convolutions and validated rounding elsewhere (\S\ref{ssec:firstorder}). Where two margins are given, they come from separate implementations, and both are certificates of record. $^*$Some extended classes on the coarser grid $\{n/72{,}000\}$ (\S\ref{ssec:firstorder}).}\label{tab:rungs} \end{table} \subsection{One small prime per modulus: $(1/11, 1/10)$ and $(1/14, 1/8)$} Since $\alpha' < 2\eta$, an $\eta$-rough modulus $d \le x^\alpha$ is $1$ or a prime, and the rows are $T_0$ and $T_1(\sigma)$ for $\sigma \in [\eta, \alpha']$. The free data are $c[j, k, b] + [j = 1]\,h(s)$ with $h = h_1$. Each row $T_1(\sigma)$ is $A(\sigma)\cdot c + B(\sigma) h(\sigma)$, so $h := -A\cdot c/B$ makes every row with $d = p$ hold exactly. The bins of the largest rough component at $(1/11, 1/10)$ are $(\alpha', 1/4]$, $(1/4, 1/3]$ and $(1/3, 1/2)$; at $(1/14, 1/8)$ there is the single bin $(\alpha', 1/2)$, index~$1$. The certificates of record give: \begin{itemize} \item at $(1/11, 1/10)$, $M = 79{,}200$: $B \ge 1.347612$, $T_0(g) \in [-3.600109, -3.599155]$, $t^* \in [-0.002270, 0.004304]$, $f(1) \le -1.095124$, free values at least $-1.002270$ and extended values at least $-1.006102$, so the margin is $89022913318324471/\allowbreak 1095124185823954082 > 0.08129$; \item at $(1/14, 1/8)$, $M = 107{,}520$: $B \ge 2.091294$, $T_0(g) \in [-3.216895, -3.216306]$, $t^* \in [-0.015790, 0.009699]$, $f(1) \le -1.077374$, free values at least $-1.004527$ and extended values at least $-1.015275$, so the margin is $2822701203567884/\allowbreak 48971554457620103 > 0.05763$. \end{itemize} The certificates of record are exact-integer, first order, at the resolutions of Table~\ref{tab:rungs}. The same code also passes at lower resolutions, with the margins increasing in $M$: at $(1/11, 1/10)$, with margins at least $0.0278$, $0.0611$ and $0.0772$ at $M = 13{,}200$, $26{,}400$ and $52{,}800$; at $(1/14, 1/8)$, with margin at least $0.0167$ at $M = 53{,}760$. The function of record at $(1/14, 1/8)$ has $19$ nonzero constants, seven of them on classes of total weight about $10^{-8}$ that the linear program did not see; the variant with $c = 0$ on those seven classes is certified separately, with margins at least $0.0167$, $0.0442$ and $0.0576$ at $M = 53{,}760$, $80{,}640$ and $107{,}520$. A second computation, in binary64 with outward rounding and FFT convolutions, passes both cases, with the caveat of \S\ref{ssec:status}. \begin{remark}[The base case $(1/11, 1/11)$]\label{rem:base} The region $\nu < 1/11$, $\alpha < 1/11$ lies inside the case $(1/11, 1/10)$ of Theorem~\ref{thm:A}. It also has a simpler construction, which we describe for illustration only: Theorem~\ref{thm:lift} assumes $\eta < \alpha'$, and nothing in this paper rests on the construction. With $\eta = \alpha' = 1/11$ no forced function occurs, and every modulus $1 < d \le x^\alpha$ with $\alpha < 1/11$ has a prime factor at most $x^\alpha < (x/2)^\eta$ for large $x$ (this uses $\alpha < 1/11$ strictly), so it divides no element of the support of the perturbation; the only twisted row is $T_0$. The free data depend only on the number $k$ of components, $f = c_k$: the free values $(-1)^k$ of Ford and Maynard's $\tilde\lambda^{(1/2,\eta)}$ \cite[\S9.1]{FM} (compare the multiplicative ansatz of \cite[(3.8)]{Ford05}) replaced by general coefficients. Lemma~\ref{lem:K} reduces the extension to the one-variable functions $J_k(a) = a\int_{\eta \le u_1 < \dots < u_k,\ u_1 + \dots + u_k = a} L_{1/2}(u)\,\frac{du}{u_1\cdots u_k}$. The constants $c_3, c_4$ are solved from $f(1) = -1$ and $T_0 = 0$, with $c_5, \dots, c_{11}$ fixed; since $J_k(1) = 0$ for even $k$ ($L_{1/2}$ vanishes almost everywhere on vectors of even length and sum $1$, by Lemma~\ref{lem:K}), $c_4$ does not enter $f(1)$. At $\eta = 1/11$ an exact-integer computation made during the independent audit ($M = 4400$) gives $3.31449 < T_0(e_4) < 3.38132$, where $e_4$ is the unit vector of $c_4$, encloses $(c_3, c_4)$ in a box, and shows over that box that $f \ge -0.87595$ on free and $f \ge -0.89904$ on extended non-prime vectors $u \ne E$, with $f(1) = -1$; at $\eta = 1/12$ the bounds are $-0.75540$ and $-0.77919$. \end{remark} \subsection{Two small primes: $(1/18, 1/6)$} Here $m^* = 2$, and $3\eta = \alpha'$: level $3$ is a null level, $h_3 \equiv 0$, and moduli with three small primes exceed $x^\alpha$ only because $\alpha < 1/6$ strictly. The free data are $c[j, k, b] + [j = 1]\,h_1(s) + [j = 2,\ s_1 + s_2 \le 1/6]\,h_2(s_1 + s_2)$, with the single bin. The rows at $d = p_1 p_2$ force $h_2 = -A_2\cdot c/B_2$, with $B_2 < 0$; the rows at $d = p$ then force $h_1$. The thirteen constants come from a linear program. The case has three audited certificates, from two separate implementations (\S\ref{ssec:status}): exact first order ($\ge 0.0067$, $0.0179$, $0.0290$ at $M = 108{,}000$, $144{,}000$, $216{,}000$); the second-order engine ($\ge 0.0546$ at $M = 1800$, $NB = 10$), developed from the first-order code and so not separate from it; and the separate implementation in binary64 interval arithmetic with exact integer convolutions ($\ge 0.02921$ at $M = 144{,}000$ and $\ge 0.04587$ at $M = 288{,}000$). The three enclose different conservative quantities: the first bounds the couplings of $h_2$ over fixed blocks (\S\ref{sec:certificates}). At $M = 216{,}000$ the exact first-order certificate gives $B_1 \ge 1.306391$, $B_2 \le -1.306391$, $T_0(g) \in [-2.524087, -2.523870]$, $t^* \in [-0.012289, 0.017693]$, $f(1) \le -1.049814$, free values at least $-1.003538$ and extended values at least $-1.019267$; its margin is $30548429835746437/\allowbreak 1049814788771959394 > 0.02909$, and the lift uses $m = 0.029$. \subsection{Three small primes, one rough count: $(1/20, 1/5)$} Here $m^* = 3$, and $4\eta = \alpha'$: four small components have total at least $\alpha'$, so $h_4$ could live only at the single total $\alpha'$, a null set, and $h_4 \equiv 0$. Moduli with four small primes exceed $x^\alpha$ because $\alpha < 1/5$ strictly. The forced functions are carried only on vectors with exactly three rough components (the profile $K = \{3\}$), and the bins are $(1/5, 1/4]$, $(1/4, 1/3]$, $(1/3, 5/12]$, $(5/12, 1/2)$. The certified diagonals satisfy $|B_j| \ge 0.825079$ with alternating signs, $T_0(g) \in [-1.077245, -1.077243]$, $t^* \in [-0.012088, -0.007984]$, $f(1) \le -1.055341$, the free minimum is at least $-1.014557$ and the extended minimum at least $-1.011449$. The margin is at least $40784885613599943/\allowbreak 1055341401115063442 > 0.03864$ at $M = 7200$, and the lift uses $m = 0.038$. The separate implementation certifies the case at $M = 432{,}000$ with margin at least $0.01609$; some of its extended classes are bounded on the coarser grid $\{n/72{,}000\}$ (\S\ref{ssec:firstorder}). \subsection{Seven small primes, weighted profile: $(1/30, 1/4)$ and $(1/30, 4/15)$} Here $m^* = 7$. The profile is weighted, $w_2 = 1$ and $w_3 = -1$, so the diagonal is the weighted one of Lemma~\ref{lem:Beff}. The weights matter: the two-rough part alone has a minimum of about $0.14$ at $(1/30, 1/4)$, while the weighted diagonal is at least $0.8704$. The bins of the largest rough component are $(\alpha', 1/3]$, $(1/3, 5/12]$, $(5/12, 1/2)$ in both cases. \begin{itemize} \item At $(1/30, 1/4)$, $8\eta > \alpha'$, so there is no level $8$. The certificate at $M = 7680$ gives $|B_j| \ge 0.8704$ at every level, $T_0(g) \in [-0.883325, -0.883323]$, $t^* \in [-0.009130, 0.015907]$, $f(1) \le -1.02811366$, free values at least $-1.01440047$ and extended values at least $-1.01192797$. The margin is \[ 2742639303632839/205622732434150043 > 0.013338, \] and the lift uses $m = 0.013$. \item At $(1/30, 4/15)$, $8\eta = \alpha'$: level $8$ is a null level, $h_8 \equiv 0$, and moduli with eight small primes exceed $x^\alpha$ only because $\alpha < 4/15$ strictly. The certificate at $M = 23{,}040$ gives $|B_j| \ge 0.5669$ at every level, with signs $(-1)^j$, $T_0(g) \in [-0.556040, -0.556039]$, $t^* \in [0.013941, 0.033589]$, $f(1) \le -1.02099183$, free values at least $-1.01477745$ and extended values at least $-1.01553199$; the extended class $(0, 1)$ binds. The margin is \[ 363989972040679/68066122248838481 > 0.005347, \] and the lift uses $m = 0.005$. On $\sigma \ge 1/5$ the three-rough part of the diagonal vanishes, and the remaining two-rough part satisfies $|B_j| \ge 1.277$. On the whole forcing range the certificate gives the uniform lower bound $|B_j| \ge 0.5669$; this is an enclosure, not a claim that the value is attained. The lift uses this separation from zero to choose $\eps$ small enough that the masked diagonals remain nonzero. \end{itemize} In both cases the free bound is the superset bound of \S\ref{sec:certificates}, labelled $(5,2,1)$. At $(1/30, 1/4)$ no vector of that class carries $h$ (its small totals lie in $[1/3, 1/2)$), so the bound is conservative; the floating-point candidate for the actual minimum is about $-1.0120$ (not certified). At $(1/30, 4/15)$ the bound equals that of the realisable class $(5,2,3)$.