{ "route_id": 67, "outcome": "progress", "evidence_md": "The route's open half — the LOOSE form's support — is bounded and is NOT near LMAX = 8, by a measurement plus a small proof.\n\nDefinitions used, both read at source. #159 (return #159, job 14): K = {0, q-2}, S_m = G_m(i) = g_i + ... + g_{i+m-1}, a slot dead for anchor r iff r + S_m in K. #161 (return #161, job 32): L(T_x,q) = longest run of consecutive slots whose residues mod q lie in a 2-set {a, a+2}. #162's run census is the same object (longest component of the kill graph on nodes (i,sigma), sigma in K).\n\nREFINED FORM — the two sides are the same number. On the true tile T23 (D = 7,952,175, G2 = 204) my independent kill-graph census gives longest component 2 (q=29), 3 (q=31), 2 (q=37); #159's own recorded 'max L' field, read from its out/b.log, is 3 at T23 by 31 and 2 at T23 by 37 — identical. So #159's largest untruncated L = L(T_x,q), hence <= LMAX = 8, at every pair with a number (the quoted folds T31 by 37 give max L = 4 and T37 by 41 give 3).\n\nLOOSE FORM — support = R + 1, where R is the longest cyclic run of consecutive QUALIFYING gaps (g mod q in {0, 2, q-2}). Why: Q^loose_L(theta) requires g_{i+1}..g_{i+L-1} qualifying, so L-1 <= R; the span condition G_{L+1}(i) >= theta only deletes starts, so R+1 bounds the support for every theta and is attained for small theta. Measured on T23: R = 2 at q = 29, 31, 37 (support 3), and max R = 2 over ALL 170 primes 29 <= q <= 1009, so support <= 3 there. #159's own recorded 'longest qualifying gap run' is 2 at T23 by 31 and 2 at T23 by 37 (identical to mine) and 3 at T31 by 37 and T37 by 41, i.e. support 4. Nothing measured or quoted reaches 8.\n\nSTRUCTURAL STATEMENT (proof, not extrapolation): if q > G2(T_x) + 2 then no tile gap satisfies g = q-2 (g <= G2), g = 0 mod q (0 < g < q) or g = 2 (two survivors 2 apart would force a multiple of 3), so R = 0 and the loose support is EXACTLY 1. Verified for all 123 primes q > 206 up to 1009 at T23.\n\nCONTROLS reproduced (independent implementation, 23/23 checks, exit 0, 30.87 s wall, <= 0.01 CPU-h): #161's published diagonal L(T_{p-},p) = 2,1,2,2,2,3 at folds 7..23; #162's T19 by 23 runs-of-3 = 62; D(T23) = 7,952,175 and G2(T23) = 204; #159's two recorded fields at each of its two T23 folds.\n\nCONSEQUENCE: the producer's LMAX = 8 truncation is idle for the loose form too at every pair with a number, and the reason is sparsity (a 3-class condition on a word whose gaps are multiples of 6), not tightness. The route's registered failure condition did not fire: no pair disagrees, none exceeds 8.", "prior_art_md": "Updated online search, 2026-09-18, from this run (job #1840). Channel state measured, never assumed: web_search ANSWERED (control query 'twin primes' returned the ordinary Wikipedia/MathWorld/arXiv set), so the negatives below are real negatives, not channel failures. Queries: the control, plus 'longest run of consecutive residues modulo p in a two-element set covering congruence Jacobsthal function maximal run'.\n\nWhat the search returns: consecutive QUADRATIC RESIDUES modulo p (MathStackExchange 4390950; arXiv:2607.11068 on exact frequencies of consecutive character patterns; Gun, 'Distribution of residues modulo p'), covering systems and one-class covering (Ford-Green-Konyagin-Maynard-Tao for large gaps; Kanold/Stevens/Hagedorn; Costello arXiv:1208.5342; a 2026 Integers note on a covering-system question of Erdos), and MathOverflow on residue classes of primes covering intervals. None of these is a PER-PRIME longest-run statistic on the fold word T_x, and none bounds the support of a correction term of the Tail-Count Transport shape (a bound on the number of correction terms in a proven inequality). So the external search does not cover this experiment.\n\nThis matches the route's own recorded search (#965, #968): the coverage of this contribution is INTERNAL. #159 (job 14) carries the proven Tail-Count Transport inequality and its refined and loose correction forms; #161 (job 32) carries L(T_x,p) rows for T29 with 7 <= p <= 1009 plus the diagonal and the negative 'nothing here fits a law to L'; #162 (job 33) independently reproduced the census totals (D(T29), D(T31), D(T37)); #968 (deepseek-v4-pro) proves the definitional identity for the refined form.\n\nEXACT REMAINING GAP, updated by this run: (a) the identity of the refined form is now measured as well as proved, at the reachable pairs; (b) the loose support is bounded as R+1 at T23 (<= 3 over 170 primes) and quoted at #159's other folds (<= 4), with a proof that it is exactly 1 for q > G2(T_x)+2; (c) NOT covered: the loose support measured at T29-indexed rows (D = 214,708,725, word not rebuilt here), and any statement for T31/T37 other than the two quoted values. Channels not queried this turn (bounded by the assignment's 0.5 h budget): arXiv API, OEIS. No external claim is made from this search, and no novelty claim is made in this return.", "next_step": { "question": "Is the LOOSE form's support still <= 8 at the T29-indexed rows of #161's table (in particular where L(T29,q) = 4), or does a qualifying-gap run of length >= 8 exist there?", "method": "Rebuild T29 with the constant-memory segmented numpy sieve already validated in this department (2^24-position chunks, bool array, two strided marks per odd prime, one full period P29 = 6,469,693,230 in ~11 s, D(T29) = 214,708,725), then compute R_loose = longest cyclic run of consecutive gaps with g mod q in {0,2,q-2} for every prime 29 <= q <= 1009, with the pure-Python and numpy implementations cross-checked at q = 29, 31, 37, 41, 43 and the published T29/p=31 census spectrum as control. Report R_loose + 1 against LMAX = 8 and against the refined L(T29,q).", "success": "All 170 primes give R_loose + 1 <= 8 at T29 (and the refined L(T29,q) <= 4), so LMAX = 8 is idle for both forms on the tile where the route's proven numbers were computed.", "failure": "Any q with R_loose >= 8 (loose support reaching the producer's cut-off) or a T29 control mismatch against the published spectrum {1: 413380422, 2: 7999018, 3: 12992, 4: 4}, which would invalidate the measurement rather than the claim.", "budget_hours": 0.5, "compute": {"cpu_hours": 0.05, "ram_gb": 2, "disk_gb": 1}, "required_tools": ["segmented-sieve", "bounded-exec"], "required_sources": ["return-159", "return-161", "return-162"] }, "depends_on": [159, 161, 162, 968] }