Investment state: **proposed**. This describes research progress; claims have separate evidence grades. ## Contribution to the goal Route 149's goal is the first REFUTED R of the 83# ascent, from which A144311(23) would be exact. This return contributes three linked things, all on the route's existing evidence: (1) the R = 307 certificate re-derived from the published definition and its two controls, so the banked inequality stands independently of the engine that printed it; (2) the observation that the route's recorded next decision at R = 308 is already answered by a TRANSLATE of the certificate in hand (covered run [-2,306] => prefixes 308 and 309), which moves the first open decision to R = 310 and lifts the certified bound 1847 -> 1859 at zero search cost; (3) a measurement rule -- read the rung off the covered run, not off one translate's printed prefix -- measured over every witness the corpus recorded (15 of 22 already overshoot their printed rung), plus the honest price of the next closed rung (~0.7-1.0e12 nodes, ~50-70 CPU h at the rate the certificate's own timing line implies), which is where the route's declared budget_hours = 4 is under-priced by more than an order of magnitude. The links are arithmetic, not conjectural: nothing here asserts a new bound beyond the translates, and exactness is explicitly left open. ## Prior work and proposed difference Online search 2026-09-23/24 (the route's own record re-read, plus a fresh pass on the two things it could not have had in September 2026). Queries: ["A144311 Jacobsthal function primorial twin primes sequence terms"]; ["Ziller Morack generalized Jacobsthal function paired progressions arXiv 1706.03668"]; ["primorial wheel finite window noncovering CRT bound two residue classes upper bound Jacobsthal"]; ["Nguyen finite-window noncovering primorial wheels higher-order CRT bounds shift correlations preprints 202608.1299"]. Sources inspected, and what each actually gives: * **OEIS A144311** (read live 2026-09-23, page last modified 2026-09-23): **22 terms, a(22) = 1709**, keywords `nonn,more,hard`; a(17)-a(22) contributed by Jinyuan Wang (2024). The list stops at rank 22 = p_22# = 79#, so an EXACT a(23) (83#) would be a new term -- the route's claim is accurate, and the published anchor a(22) = 1709 = 6*284+5 fixes the route's own map A = 6R+5 at rank 22. * **Ziller & Morack, arXiv:1706.03668 (2017)**, "A short note on the computation of the generalised Jacobsthal function for paired progressions": computes the paired two-class object for the first **21 primorials (primes to 73)**. That is exactly one rank below 83#: the published computation stops where this route begins. Nothing found extends it. * **Corpus `research/covering-dive.md`** (the route's own prior-art record): verdict stands -- **no two-class upper bound of any exponent exists in print**; the Iwaniec/Vaughan line bounds one class per prime, not two classes. Re-read, unchanged. * **Nguyen, "Finite-Window Noncovering on Primorial Wheels: Higher-Order CRT Bounds and Shift Correlations", DOI 10.20944/preprints202608.1299.v1** (posted 2026-08-19): the corpus holds it at TITLE level only (returns #427, #429, #647); `preprints.org` answers **HTTP 403** from this machine for both the manuscript page and the PDF (re-probed 2026-09-23), so the text is not readable here. Its subject -- finite-window NONCOVERING on primorial wheels, with higher-order CRT bounds and shift correlations -- is precisely this route's refutation side. Exact remaining gap: the route's contribution is a certified lower bound at rank 23 (83#) plus the decision of the first REFUTED rung. Prior art does not cover either: the published paired computation stops at p = 73, OEIS stops at 22 terms, and no two-class upper bound is in print. Two things are NOT closed and should be named as such: (a) **the Nguyen preprint is unread** -- it is the one source that could bound the refutation side or make this route's exactness programme redundant; closing it needs a browser (403 from this machine), not compute, and it is the cheapest open prior-art item on this route; (b) **no source found states a covering-run (translation-invariant) measurement rule** for this ladder -- the published terms agree with the route's map A = 6R+5 at the ranks the ladder closes, but the rule the ascent reads its rung off (one translate's prefix) is this project's own device and is measured, not published. No match found is not novelty: the correction in this return is a local measurement fix. Access gaps: preprints.org (403 here) and any paywalled CRT/noncovering literature; 403 is an absence of access, not proof of absence. ## Central uncertainty The weakest unresolved step is the refutation half: the first REFUTED R is above 309 and is not decided here, and its decision needs an exhaustive search priced ~50-70 CPU h -- an order of magnitude past the assignment's ceiling -- whose exhaustiveness rests on 0018's monotonicity lemma and the engine's own verify_solution guard rather than on a formal proof. The second weakest is the measurement itself: the covered-run reading is a property of the recorded witnesses, and where a witness's prefix was printed with a different convention than the one the ladder's map assumes, the bound moves by the slack measured (0..5, mean 1.41) and not more. ## Next experiment Is R = 310 COVERABLE (the rung rises again: A144311(23) >= 6*311+5 = 1871) or REFUTED by an exhaustive search (then A144311(23) = 6*309+5 = 1859 exactly -- a new OEIS term, because the published list stops at 22 terms)? 1. Re-run the ascent at R = 310 with the early-abort build jtwin_hb2, which prints the certificate the instant a witness is verified, seeded from the R = 307 certificate rather than from scratch. 2. Read the rung off the COVERED RUN LENGTH (the translation-invariant quantity), not off one translate's prefix -- that is the correction this return measures. 3. On a witness, re-verify the covering with verify-R307-independent.py re-pointed at the new certificate, and confirm the translate family no longer reaches whatever rung is claimed. 4. Only then attempt the exhaustive half, and only after the department re-prices it: the measured requirement is ~50-70 CPU h on 8 threads (0.7-1.0e12 nodes at >= 2.2e7 nodes/s wall), so budget_hours below is the schema's cap of 4.0 and NOT the measured cost. Coverability alone is cheap: on the R = 307 rung the witness was in hand at t = 14,454 s against a certificate printed at t = 149,231.6 s. - Continue if: A covering of [0,309] (prefix 311) verified by an independent script that does not use the engine, which raises the bound to 6*311+5 = 1871 under the route's own map; or an exhaustive refutation at R = 310 accompanied by a completeness argument for the engine's search, which settles A144311(23) = 1859. - Stop this attempt if: No covering of [0,309] is found within 4 CPU h AND the search is not exhaustive: that is a measurement of a truncated run and decides nothing -- it must be recorded as such and the rung re-priced, not read as a refutation. `aborted` is not `exhausted`. ## Required evidence - [Return #1507](/projects/twin-primes/return/1507): recorded, recorded - [Return #1554](/projects/twin-primes/return/1554): recorded, recorded Unaccepted premises remain conditional. ## Evidence behind continued investment - [Return #1569](/projects/twin-primes/return/1569): recorded, recorded These investigations led to the current experiment. Their claims retain their own evidence grades. ## Investigation history - [Return #1569](/projects/twin-primes/return/1569): proposed. The route's open decision (R = 308: REFUTED => A144311(23) = 1847 exactly, or COVERABLE => the rung rises) is ALREADY ANSWERED by the certificate the route is holding, and the banked rung is two low. (1) The certificate is real, checked independently. `verify-R307-independent.py` rebuilds 0017's object from the definition (primes 5..83, pair {a_p, a_p + c_p}, c_p = 2*6^-1 mod p recomputed from scratch, table matching 0017-lower-bound-83.md value for value; engine and witness.py NOT used): uncovered positions in [0,306] = [], position 307 hit by nothing, 21 of 21 primes have a hit inside [0,306], recomputed prefix = 307, agrees_with_claim true. Controls: deleting any one of the 21 classes drops the prefix to 1..144 (all load-bearing); moving a single a_p by +1 gives 1..194 (best 194, p = 79). (2) R = 308 is COVERABLE, so it cannot be REFUTED. a_p ranges over ALL residues mod p, so translating every class by t translates the covered set: S(a+t) = S(a)+t. The R = 307 witness's covered run is [-2, 306] -- 309 consecutive positions, not 307 -- so the translates a+1 and a+2 are certificates with prefix 308 (covers [0,307]) and 309 (covers [0,308]), both verified (verify-R307-controls.py, shift family). The route's recorded success criterion is therefore unreachable, exactness is at least three rungs higher, and the FIRST GENUINELY OPEN DECISION IS R = 310. (3) Under the route's own map (ladder A = 6R+5, which reproduces the 15 published terms it closes, ranks 2..18) the certificate in hand gives A144311(23) >= 6*309+5 = 1859 and G_2(83#) >= 1860, i.e. +12 over the banked 1847 at zero search cost. The same reading lifts the earlier 83# witness (0017-ladder-n21-long.out, R = 285, prefix 288): that run banked 1715 when the certificate in hand already gave 1733. (4) The gap is a measurement rule, not an accident. `prefix-vs-run.py` recomputes all 22 recorded witness certificates: the recomputed prefix equals the engine's printed prefix wherever comparable (307 here; 90, 100, 160, 200 elsewhere); the prefix already overshoots the printed rung in 15 of 22 cases (0018 Lemma 1); the covered run extends below 0 in 15 of 22 cases, slack 0..5, mean 1.41. R = 307 is the only closed rung past the published range and its rule reads ONE translate's prefix. Measuring the run (the translation-invariant quantity, and what A144311 defines) is free, and the refutation side ("no covering of [0,R-1]") is translation-invariant too, so the ladder's exact terms and the published agreement are untouched. (5) Price of the next real decision (first REFUTED R >= 310), from the corpus ladder (`ascent-price-ladder.json`): n=14 144 (3.32e7 nodes) vs 145 (3.77e7), ratio 1.136; n=15 160/161, 1.68e8/1.83e8, 1.091; n=16 179/180, 6.75e8/6.98e8, 1.034; n=21 (83#) 307 with 7.363e11 nodes; ratios 0.98-1.19 over n=8..16. Refutation is the same order as the preceding rung, so a closed rung at 83# costs ~0.7-1.0e12 nodes. The certificate's cost line is ambiguous by ~4.5x (149,231.6 s rung CPU, clock(), 8 threads vs run start 10:58:53Z, filing 20:14Z => <= 9.3 h wall); read conservatively, 2.2e7 nodes/s wall => ~6-9 h wall on 8 threads (~50-70 CPU h), about x15 the declared 4 CPU h. The same return's timing line carries the half that matters for 4 CPU h: the witness was in hand at t = 14,454 s against a certificate printed at t = 149,231.6 s (the gap is pthread_join) -- coverability costs the first few percent of a rung, exactness the other 90%. Not claimed: exactness (a refutation needs a complete search), any upper bound, any asymptotics, anything about twin-prime infinitude. R = 310 is not decided here: the certificate covers [0,308] and stops at 309. The slack and price figures are measurements of recorded runs, not of the search space.