Research route #125 · investment progress is separate from claim verification.
The 2κ barrier in the one-class case: the Jacobsthal exponent
- Kind. Local research programme
research/0019/. Joblessdirectionreturn. Successor of 0017 and 0018; judged by 0016's acceptance contract A1–A8. It implements target B3 of scoping note../0019-scope-parity-and-covering.md. - Claimed target. None that is proved. The programme's object is the open statement
g(x#) = o(x²)for the Jacobsthal function, equivalently "save one logarithm in Iwaniec's bound". NoT1/T2claim, so 0016 Lemma 2.3 does not apply — and the object is parity-free by construction (a covering-system statement, not a sieve count). - Calibration. Proved: Lemma 1 (the one-class covering form), Lemma 2 (the one-class case is
the twin case's sub-case,
G₂ ≥ g), Lemma 3 (the counting certificate is vacuous forx ≥ 17). Verified: Lemma 1 againstA048670by full-period scan forn = 2…7; the capacity table atn = 64,R ≤ 1200, zero refutableR; the run/gap convention. Measured: the exponent over all 64 exact terms. Cited: Iwaniec's bound, Jacobsthal's conjecture (Erdős #970), the Maier–Pomerance shape, FGKMT's lower bound. Open: the bound itself. Nothing here is a proof ofTP, ofo(x²), or of any bound onG₂.
1. The reformulation, and why the one-class case is the right test
Lemma 1. run(n) = max{R : ∃ residues c_p with [0,R−1] ⊆ ⋃_p{c_p mod p}} and
g(P_n) = run(n) + 1. Proved by CRT — the c_p are free because any tuple is realised by a single
shift a ≡ −c_p (mod p). Verified with no covering search at all: a full-period scan gives
g = 4, 6, 10, 14, 22, 26 for n = 2…7, matching A048670 exactly (periods to 510 510). The
convention hazard 0017 found for G₂ recurs here: A048670 is the gap, A058989 the run,
differing by one.
Lemma 2. A one-class covering is a two-class covering: set a_p = c_p, so the pair
{a_p, a_p+c_p} = {c_p, 2c_p} contains c_p. Hence G₂(P_n) ≥ g(P_n) + 1 and the two-class
exponent is at least the one-class one. Therefore no method can beat the 2κ barrier for twins
without beating it here. That is why a programme on the easier problem is logically prior rather
than a detour — and the one-class case has 64 exact terms (n ≤ 64, p₆₄ = 311) against the
twin ladder's 22, so it is the only version with enough data to see a trend.
2. The target arithmetic (0016 clause A3)
g(x#) = o(x²) needs a saving ψ(x) → ∞. Iwaniec (1978, still the best; no exponent improvement
1978–2026) gives g ≪ (ω log ω)², which for x# is x²(1+o(1)) — not o(x²). A single-log
saving, g ≪ ω² log ω, already gives x²/log x = o(x²). Jacobsthal's conjecture g ≪ ω²
(Erdős #970, open) gives x²/log²x. The conjectured shape is x log^{2+o(1)}x, and the lower bound
is FGKMT's x log x log₃x/log₂x. So the first milestone is exactly one logarithm, and any
unbounded saving suffices for this lane.
3. No cheap certificate and no computational shortcut
Lemma 3. With cap(R) = Σ_{p≤x}(⌊(R−1)/p⌋+1), cap(R) < R would refute R; but
cap(R) ≥ π(x) + R·Σ_{p≤x}1/p ≥ R for x ≥ 17, so the criterion never fires. Verified at
n = 64 for R ≤ 1200: cap(R) − R ∈ [+62, +1256], zero refutable R. The linear/counting
relaxation is useless — the same finding as 0018 Lemma 4 one dimension up.
Computation is not the instrument either: randomised covering search reaches prefixes 20, 26, 27
at n = 6, 8, 10 against published runs 21, 33, 45 — a covering is an extreme configuration,
exactly as 0017's probe found for twins. The bound needs a method.
4. What the data says (all 64 exact terms)
γ(n) = log g(P_n)/log p_n: 1.1590 at n = 13, 1.2217 at n = 64, essentially flat over the
last twenty terms; g/(p log p) drifts 0.581 → 0.622; g/(p log²p) 0.127 → 0.108. The
conjectured x log^{2+o(1)}x would need γ ≈ 1.61 by p = 311; the data does not show it, so at
these sizes the ladder is consistent with g ≈ 0.6·x log x·(slowly growing) and the conjectured
extra logarithm has not appeared.
The sandwich at p = 311: Iwaniec allows x² = 96 721; the truth is g = 1110 — the theorem is
87× the truth; FGKMT's construction gives ≈ 570 — the truth is only 1.95× it. That
interval is the open problem, and it is far narrower from below than from above. The measured
exponent has been below 2 everywhere computed, so (as with the twin ladder) the barrier is a
method barrier.
5. The four mechanisms, each falsifiable
M1 sharpen the switching/error term inside Iwaniec's proof (falsifier: a proof that the
switching estimate is tight). M2 a large-sieve/second-moment bound on
N(R) = #{a mod x# : [a,a+R−1] covered} — Lemma 3 shows the first moment is useless (falsifier: a
family with more long runs than the moment model allows). M3 a structure theory of extremal
coverings, extracted from certified optima at the computed levels — the only computation-accessible
mechanism (falsifier: a certified optimum whose structure changes qualitatively). M4 transfer to
the prescribed-difference twin case c_p = 2·6⁻¹, which is the bridge and the reason the programme
exists (falsifier: a one-class improvement with no two-class analogue). The programme should be
judged by these falsifiers, not by whether it proves the bound.
6. Evidence and reproduction
out/lemma1-validation.out (Lemma 1 vs A048670, n = 2…7, full-period scan);
out/exponent.out (the 64-term table, the sandwich, the target arithmetic); out/capacity.out
(Lemma 3 vacuity); out/covering-search.out (random search is weak). Reproduce:
python3 scripts/gjacob.py brute 7; python3 scripts/gjacob.py exponent 64;
python3 scripts/gjacob.py capacity 64 1200. Deterministic, offline, stdlib only; the brute mode
is the only expensive one.
7. Honest boundary
0019 proves an exact reformulation validated against the published ladder, a one-line sub-case
relation making the one-class problem logically prior for the twin lane, and a vacuity statement
that kills counting and duality certificates. It contributes the first exponent measurement over all
64 exact terms and a sharp form of the target — one logarithm. It does not prove
g(x#) = o(x²), does not bound g or G₂, and does not touch TP; and it states
explicitly that a bound on g would not give twin primes (G₂ ≥ g is the wrong direction).
Erdős #970 and the twin prime conjecture both remain open.