{ "route_id": 26, "outcome": "progress", "evidence_md": "WHAT THE EVIDENCE CHANGES FOR THE JUMP LAW.\n\n(1) The law's cheapest imagined proof is refuted by the data we already own. Reading the four certified windows that establish the two reachable jumps (s=34, entering prime 67; s=36, entering prime 71) as arithmetic on their published integer positions, and recomputing for every slot whether any prime of the OLD rung kills it (q | r or q | r+2): in all four witnesses the ENTERING PRIME IS THE SOLE KILLER of k >= 2 slots strictly inside the run. s=34, L=26, span 840: 23/26 slots killable by {37,...,61}, and 67 is the only killer of 3 slots (offsets 330, 462, 732). s=34, L=27, span 840: 24/27, three sole-killer slots (offsets 12, 282, 414). s=36, L=28, span 888: 26/28 killable by {37,...,67}, 71 sole killer of 2 (offsets 132, 840). s=36, L=30, span 810: 28/30, 71 sole killer of 2 (offsets 108, 390). So the jump 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 explains why the measured jumps (delta(67) >= 2, delta(71) >= 3) exceed the law's minimum delta >= 1: the extra length is paid by the interior slots the entering prime owns alone. The law's honest proof obligation therefore becomes constructive and finite: at each entry q, exhibit a window of K*(Q)+1 consecutive slots whose residue pattern Q u {q} covers, with at least one slot for which q is the only killer. A search built on the naive end-extension picture would look for the wrong witness.\n\n(2) The reachable-rung half of the route is already decided, with no new computation, by #594 + #603 alone. Q(31)=Q(32)=Q(33)={37,...,61} in the same block P=31#, #594's complete block scan found no covering 26-window anywhere, so K*(31)=K*(32)=K*(33) <= 25; m*(31)=26 (#588: maxsum_26 = 1380 < 1392 <= 1428 = maxsum_27); and #603 certifies K*(34) >= 27. Hence the maxsum doubling certificate does not survive the FIRST fold entry in the block, and the jump there is delta >= 2, twice the law's minimum. The route's real remaining dependency is not the covering side but the profile side: a uniform bound m*(s) <= M, whose next value (T_37) costs about 35x the v=31 walk.\n\n(3) #607's offset contrast explains WHY a counting proof cannot work, and points at the right constructive quantity. At s=34, L=27, one block, full phase freedom, with identical slot count, identical per-prime kill density and identical singular series, the covering rate is lambda_2 = 924208 slots/window against 2243633 (D=32) and > 2.17e7 (D=8,16). Two systems with the same marginals differ by more than an order of magnitude, so delta cannot be produced by a density argument. The natural predictor of delta is instead the sole-killer count k, the run length the entering prime can buy on its own; k is exactly the quantity the engine's DFS already maintains per prime (umx[j]), so it is free to read at the next entry.\n\nWHAT THIS DOES NOT CHANGE. No jump is proved at any unreached entry; nothing here bounds m*(s); nothing crosses a change of block, which is the trap the route record's own uncertainty_md names. Scope: one block (P=31#), two entries, four published witnesses, arithmetic only, no engine run (this assignment's compute hint is 0 CPU-h).", "prior_art_md": "Updated online prior-work search for this experiment (2026-09-15), first step of the assignment.\n\nQUERIES THIS SESSION: the paired/two-class Jacobsthal computation line (two-class covering run, maximum length, primorial, 2026); plus the route record's own prior-art section, which is the authoritative record for this route and was read first.\n\n(e1) A144311 IS THE PROJECT'S OWN Ghat LADDER, and this is a USE of a published table, not a reproduction. A144311 = the length of the longest sequence of consecutive integers each equal to 1 or -1 modulo at least one of the first n primes: Carter 2008, a(8)-a(16) Alekseyev 2009, a(17)-a(22) Jinyuan Wang Nov 2024, 22 terms to the prime 79. That is the same object as the project's {0,-2} class pair after the shift r -> r+1; the corpus identified G2 with A144311 in #397 and the convention Ghat(p_n) = A144311(n) + 1 was verified in the route record at two independently recorded points (150 at level 19, 1710 at level 79). Consequence: Ghat is cited, not computed.\n\n(e2) THE PAIRED FAMILY IS IN PRINT AND WE ARE ITS FIXED-CLASS SLICE. OEIS 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. OEIS A288815 is the paired Jacobsthal h2 (Ziller-Morack, arXiv:1706.00317 and the computation note arXiv:1706.03668), which carries the TPC/Goldbach reduction. 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. No published source reports a fixed-class contrast of that kind: the class-geometry effect on covering density appears to be un-owned, which is the honest novelty statement for #607's statistic.\n\n(e3) ONE CLASS, ORDER m, IS IN PRINT; TWO CLASSES AT ANY ORDER ARE NOT. Costello-Watts, Math. Comp. 84 (2015) 1389-1399, Thm 4.4 gives an m-generic recursion for pi_min(m,k) (the one-class quantity), evaluated by the authors only at m = 1; the corpus's companion closed form (arXiv:1209.3464 Thm 2.3) is author-withdrawn. The classical one-class line (Iwaniec 1978; Vaughan 1977; Kanold; Stevens; Paseman) and its computations (Hagedorn, Math. Comp. 78 (2009); the Ziller/Hajdu-Saradha counterexamples to Jacobsthal's primorial-extremality conjecture from r = 24) all bound or compute ONE class per prime. The 2026 preprint 202608.1299 (Finite-Window Noncovering on Primorial Wheels) attacks the same object from the non-covering side and again supplies no two-class upper bound; it remains unread here (403 from this machine in #603, #604 and this session). So the covering-dive's ABSENT verdict for two-class upper bounds stands after this update.\n\nEXACT REMAINING GAP after this sprint: (i) no two-class order-m object in print, so m* must be computed from recorded data and calibrated on the project's own exact values; (ii) no published concentration UPPER bound on maxsum_m, which is the single missing input that would settle boundedness of m* (the averaging floor only gives an upper bracket, and it grows); (iii) the level-restricted fixed-class transition K*(s) at Q(s) = (s,2s], the certificate link K*(s)+1 <= m*(s), and now the fixed-class offset contrast of #607 all remain the project's own. Scope: arXiv, OEIS and open-web reading plus the project corpus; not an absence claim for books, nor for the German and Russian Jacobsthal lines.", "next_step": { "question": "Is the fold-entry jump interior-supported at every entry, and does the entering prime's sole-killer count k (the run length it can buy alone) predict the jump size delta?", "method": "At the next block P = 37# (where m* must be recomputed first): for the next entry q, find the first covering window at L = K*(previous rung) + 1 and classify the realization. (a) end-extension: some adjacent slot just outside a previous-rung covering window is a level-s slot killed by q's chosen phase, and no other change is needed. (b) interior: the witness has at least one slot for which q is the only killer in Q u {q}, as in all four certificates measured here. Read k directly from the engine's per-prime still-uncovered capacity table (umx[j]), which the DFS already maintains, so the classification costs one pass with no new code.", "success": "Realization (b) recurs at the next entry with k >= 1, and k predicts the observed delta (more than one entry, since a single instance cannot separate the mechanism from a coincidence). The interior statement then becomes the constructive obligation the law's proof must discharge.", "failure": "Realization (a) is found at equal or lower L, i.e. the jump is a plain end-extension after all. That kills the interior reading, returns the law to a bare measured inequality, and makes delta >= 1 purely a counting question again (which #607 already shows cannot be argued by density).", "budget_hours": 2 }, "depends_on": [607, 604, 603, 601, 599, 594, 588] }