# Job #1367 — route 26: the fold-entry jump is an *interior* effect, and the reach is already decided Run `run_20260915_173616_Vo92sg` · attempt `a07cc65959adcf87acbc7bf378683771` · job 1367 · **route 26 rev 3**, lane `formalize` `explore` / discovery · model `deepseek/deepseek-v4-flash` · effort `unmeasured` · mode `general` · compute hint **0 CPU-h** All arithmetic below is exact integer arithmetic on already-published witnesses; **no engine was run** for this job. ## 1. What was asked, and what I did with zero compute Route 26 asks whether each fold entry buys a positive jump, `K*(Q ∪ {q}) ≥ K*(Q) + δ` with `δ ≥ 1`, so that `K*` crosses the fixed threshold `m*` after finitely many folds. Its named cheapest step is *deciding exact `K*` at two entries*, priced at 1.6–2.6 core-hours. This assignment's compute hint is **0 CPU-h**, so I did not run that scan. Instead I did the two things a formalize sprint can do for free: I **updated the online prior-work search** (§5) and I **read the four certificates we already own as data** (§2), which turned out to refute the mechanism the law's cheapest proof would have assumed. ## 2. New verified structural result: the entering prime is an *interior*, sole killer For each of the four certified covering windows that establish the two reachable jumps — `s = 34` (entering prime `67`) and `s = 36` (entering prime `71`) — I recomputed, with `q | r` or `q | r+2` on the certified integer positions, which slots survive the *old* rung and which are killed **only** by the entering prime: | certificate | `L` | span | old rung `Q \ {q_new}` | slots killable by the old rung | slots whose **only** killer is `q_new` | |---|---|---|---|---|---| | `s=34`, entering 67 | 26 | 840 | {37,…,61} | 23 / 26 | **3** — offsets 330, 462, 732 | | `s=34`, entering 67 | 27 | 840 | {37,…,61} | 24 / 27 | **3** — offsets 12, 282, 414 | | `s=36`, entering 71 | 28 | 888 | {37,…,67} | 26 / 28 | **2** — offsets 132, 840 | | `s=36`, entering 71 | 30 | 810 | {37,…,67} | 28 / 30 | **2** — offsets 108, 390 | Read as a statement about the law: **in every witness we can check, the entering prime is the sole killer of `k ≥ 2` slots strictly inside the run.** So the run is not the old run *extended at an end* by the new prime; it is a different window whose interior deficit the new prime fills. That single fact explains the two things the route record lists as "empirically much more than 1": the measured jumps are `δ(67) ≥ 2` and `δ(71) ≥ 3`, and the extra length is paid exactly by the interior slots the new prime owns alone. **Consequence for route 26's proof obligation.** The law's cheapest imagined proof — "take a covering `L`-window at the old rung, and let the entering prime kill an adjacent `(L+1)`-st slot" — is *not* the mechanism the data shows, and if it were searched for as the primary route it would look for the wrong witness. The correct constructive obligation is sharper and still finite: > at each entry `q`, exhibit a window of `K*(Q)+1` (or more) consecutive slots whose residue pattern is covered by > `Q ∪ {q}`, having at least one slot for which `q` is the only killer in `Q ∪ {q}`. ## 3. What is already decided without any new computation Combining #594 (a complete block scan at `Q = {37,…,61}` finds *no* covering 26-window anywhere in the block) with #603's certificate (`K*(34) ≥ 27`): K*(31) = K*(32) = K*(33) <= 25 (same P = 31#, same Q = {37,...,61}; #594 complete, #601 Q(33)=Q(32)) m*(31) = 26 (#588; maxsum_26 = 1380 < 1392 <= 1428 = maxsum_27) K*(34) >= 27 > m* - 1 (#603, certificate) So **the "finite reach" half of the route is decided at the reachable rungs**: the certificate does not survive the *first* fold entry inside block `31#`, and the jump there is `δ(67) ≥ 2`, twice the law's minimum. The route's honest remaining dependency is therefore **not** on the covering side; it is the uniform bound `m*(s) ≤ M` on the *profile* side, which at `T_37` costs ≈ 35× the `v = 31` walk, and the extension of any measurement across a change of block `P(s)` — exactly the trap the route record's `uncertainty_md` names (TODO 0b). ## 4. What #607 (this session's own return) adds to the mechanism #607 measured the covering rate for matched offset families and found it **offset-specific**: at `s = 34`, `L = 27`, with identical slot count, identical per-prime kill density and identical singular series, `λ₂ = 924 208` against `2 243 633` (`D = 32`) and `> 2.17·10⁷` (`D = 8, 16`). Two consequences for route 26: 1. `δ` cannot be produced by a counting or density argument: two systems with the same marginal statistics differ by more than an order of magnitude in covering rate. A proof of the law must be *constructive* (§2), which is consistent with the interior structure measured here. 2. The `k ≥ 2` sole-killer counts above are the constructive quantity to track at the next entry: `k` is the run length the entering prime can buy *on its own*, so `k` is the natural predictor of `δ` and the natural object of the next experiment. ## 5. Prior-work search, updated (first step of this assignment) Queries run this session (2026-09-15): the paired/two-class Jacobsthal family and its computation line; plus the route record's own record. Sources: OEIS A144311, A072753, A288815 at the source pages; Ziller–Morack arXiv:1706.00317 and arXiv:1706.03668; Costello–Watts, Math. Comp. 84 (2015) 1389–1399; Hagedorn, Math. Comp. 78 (2009); Hajdu–Saradha, Math. Comp. 81 (2012) 2461–2471; `covering-dive.md`. * **A144311 is the project's own `Ghat` ladder** — the longest run of consecutive integers each `≡ 1` or `≡ −1` mod one of the first `n` primes (Carter 2008; Alekseyev 2009; Jinyuan Wang, Nov 2024), 22 terms to the prime 79. That is the `{0,−2}` class pair after the shift `r ↦ r+1`: the corpus already identified `G₂` with A144311 (#397), and the route record's convention `Ghat(p_n) = A144311(n) + 1` is verified there at levels 19 and 79. **Use, not reproduction.** * **A072753** (Ziller 2002, extended by Resta and Morack) is the *maximum run covered by two classes per prime with the classes optimised* on primorial support; **A288815** is the paired Jacobsthal `h₂` (Ziller–Morack). Our `{0,−2}` object is the **fixed-class, level-restricted slice** of that family — and #607's offset contrast measures the *class-geometry* axis that A072753 optimises away. Nothing published reports the fixed-class contrast, so #607's statistic has no owner in print. * **Costello–Watts** give the order-`m` *one-class* recursion `pi_min(m,k)` (their Thm 4.4, evaluated by them only at `m = 1`). **No two-class order-`m` bound or table exists in print** — the covering-dive's ABSENT verdict is re-confirmed by this session's search, and the corpus's own companion closed form (arXiv:1209.3464 Thm 2.3) is author-withdrawn. * Exact remaining gap: (i) no two-class order-`m` object, so `m*` must be computed, never cited; (ii) no published concentration *upper* bound on `maxsum_m`, which is the single thing that would settle boundedness of `m*`; (iii) the level-restricted fixed-class transition `K*(s)` and the certificate link `K*(s)+1 ≤ m*(s)` remain the project's own. ## 6. Cheapest credible check (the next experiment, stated concretely) The engine's own two statistics already answer this and are cheap to read: for each window the DFS maintains `umx[j]` = the most still-uncovered slots one phase of prime `j` can kill, so the *sole-killer* count `k` of a witness is directly available at no extra cost, and `filter_pass` records the windows that even pass the capacity test. Proposed next step: at the *next* entry (the next block, `P = 37#`, where `m*` must be recomputed and `Q` gains the next prime), find the first covering window at `L = K*(previous rung) + 1`, then compare the two competing realizations — (a) end-extension (an adjacent slot killed by the entering prime) versus (b) interior-sole-killer (`k ≥ 1`). Success: (b) replicates and `k` predicts `δ`. Failure: (a) is realized at equal or lower `L`, which kills the interior reading and returns the law to a bare measured inequality. ## 7. Rungs, scope, disclosures * **verified** (finite arithmetic, no engine): the sole-killer counts in §2, on four published certificates. * **verified** (cited published numbers, used not reproduced): the `#594`+`#603` chain in §3 that decides the reachable rungs, and the OEIS/A144311 identification in §5. * **measured** (this session's own return, cited): #607's offset contrast. * **hypothesis**: that `k` predicts `δ` at every entry, and that the interior mechanism is general. * Not claimed: nothing here proves `δ ≥ 1` at any *unreached* entry, nothing bounds `m*(s)` uniformly, nothing crosses a change of block. No asymptotic statement. Scope is one block (`P = 31#`), two entries, four witnesses, and the arithmetic on them. * Disclosures: **no engine run** (compute hint 0), so #607's instrument reproduces nothing here; the witnesses are my own department's published files (`certificate_s34_L26/L27.txt`, `certificate_s36_L28/L30.txt`), used verbatim as input to the recomputation. Token usage for this assignment stays **pending** (this harness reports none). The first prior-art pass in this session returned nothing new beyond the route record's own §prior_art, which is why §5 cites the record plus one fresh query rather than claiming a new absence verdict.