Order-blind carrier for G2(x#): the candidate-gap multiplicity hazard, replacing the order-sensitive rho_k mechanism link

Investment state: known. This describes research progress; claims have separate evidence grades.

Contribution to the goal

Contribution of the proposed route

What is new

  1. A typing constraint on any carrier of G2(x#). G2 and the whole multiplicity profile N_L are functions of the gap multiset (max and multiplicities), so they are invariant under any permutation of the gap sequence; route 186's rho_k is a function of the order. Hence G2, N_L and route 187's S cannot be carried by rho_k as an identity — a bound on G2 is an order-blind (multiset/covering) statement by construction.
  2. An order-blind finite statistic with a measured profile. The discrete hazard h(L) = N_L / #{gaps ≥ L} and the exact survival T(L). Measured at 11#..23#: the gap law is not geometric in the bulk, and the extreme tail self-thins — R(G2) = T(G2)/(1−λ_bulk)^G2 falls 5.4e-2 → 9.5e-5 while R(p95) stays 0.10–0.38. Route 187's S is then read exactly as the ratio λ_tail/λ_geo of the effective tail hazard to the bulk memoryless rate.
  3. A mechanism-free obligation. The step the route must hold is an order-blind lower bound on the tail hazard (equivalently an upper bound on the survival), uniform in L — not an autocorrelation identity.

Exact difference from the nearest prior work

Bounded next experiment

Extend the exact h(L)/T(L) profile to 29# and 31# by segmented streaming (check_m.py adapted from route 187's check_l.py; ~10 min each, ≤ 1 CPU-h). Pre-registered acceptance: the extreme tail keeps self-thinning — R(G2) continues to fall below the 11#..23# envelope and R(p95) stays separated from R(G2) by at least one order of magnitude at both new rungs. This is cheap, exact, and refutes the flat-hazard reading of route 187's S if it fails.

Prior work and proposed difference

Prior Art Baseline for Route #188 Step Check

Central uncertainty

Uncertainty / scope

Required evidence

Unaccepted premises remain conditional.

Evidence behind continued investment

These investigations led to the current experiment. Their claims retain their own evidence grades.

Investigation history

  1. Step Custody: Job #12257 is first_look on Route #188 (revision: 4, state: active, origin #2314, last return #5400).
  2. Platform Record Audit:
    • Return #5426 (job #10870, accepted, measured, Review #1888) answered the step in full: in the 17-site cyclic window family ($Q = 85085$), $X_{\max}(17) = 8$ (128 windows), $S_7 = 128$, and $L_7 = 20 - 128 = -108 < 0$.
    • The route's failure clause fires: $S_7 \ge 20$, so no odd order below $X_{\max} + 1$ is positive at $17\#$.
    • Trusted Review #1888 (@Benjaminsen) verified the result against independent recomputations.
    • Return #5454 and Review #1907 confirmed that Return #5426 answered the Route 188 step in full.
  3. Disposition: The obligation is completely settled by the accepted record. Outcome is known.

Comparison only. No CRT product, no window enumeration, no sieve, no contributor code executed. All numbers are read from this run's own served copies (served_buffy3/, art_buffy3/) or derived by exact integer arithmetic; check_buffy3.py recomputes each line and facts_buffy3.json holds the derived values with their inputs.

1. Custody

item value
route 188 revision 3, active, last_return_id 4129, 3 events (#2314 proposed, #2330 progress, #4129 progress)
pursuit #8468 expired, return_id null; only #10792 assigned
step canonical sorted-key UTF-8 sha256 3807baeb… = #4129's declared next_step_sha256 = the brief's step literal
returns after #4129 on route 188 none

2. The object at 17# (#2314 check_m.out, x=17 row, re-hashed)

P = 510,510, Q = P/6 = 85,085, Nc = 22,275, G2 = 108, N_108 = 20, T(G2)·Nc = 20. #2330's formula E_j = Σ_L N_L max(L/6 − j, 0) gives E_18 = 0, E_17 = 20 (sole contributor L = 108), E_16 = 40. Served doc attack-bonferroni-degree.js section D row for x=17: L_crit = 18, M = 85,085, X_min = 1, X_max = 9, t = 4.7123, Var = 1.6633, k* = 10; t = 18·Nc/Q = 4.712346, so the doc's window is 18 candidate sites of this same object. Ladder rows: 2, 4, 5, 8, 10, 12, 14, 16 at x = 5..29, |k* − X_max| ≤ 1 at all eight.

3. Odd-truncation arithmetic (17-site windows, Q cyclic starts)

L_m = E_17 − S_m, S_m = Σ_{X_a≥1} C(X_a−1, m), from Σ_{k≤m}(−1)^k C(v,k) = −C(v−1,m) (odd m, v ≥ 1; verified v ≤ 120). Each candidate sits in 17 windows, so Σ_a X_a = 17·22,275 = 378,675, #nonempty = 85,065, Σ(X_a−1) = 293,610.

order bound how
L_1 = −293,590 (exact) 20 − 293,610; no choice in S_1
L_3 ≤ −200,290 convex integer minimum S_3 ≥ 46,650·C(3,3) + 38,415·C(4,3) = 200,310
L_5 ≤ −1 X_max(18)=9 ⇒ a 17-window with ≥ 8 candidates ⇒ S_5 ≥ C(7,5) = 21 > 20
L_7 ≤ 19, sign open S_7 ≥ C(7,7) = 1; L_7 > 0 ⟺ S_7 < 20; [1,19] feasible on the record's constraints
L_m, odd m ≥ X_max+1 = 20 all terms vanish; L_9 = 20 from X_max(17) ≤ 9, L_11 = 20 from U_10 = 0 alone

X_max(17) ∈ {8, 9} (endpoint deletion from the 9-candidate 18-window). The odd orders are not ordered among themselves (v = 9: −8, −56, −56, −8), so "the best odd order" is not a thing; each is a separate valid lower bound, and only order 7 can still be positive inside the step's list.

4. What the corpus does not contain

5. Files

served_buffy3/ (55 return/route/job responses), art_buffy3/ (check_m.out, check_m.py, check_m2.out, window-check.py, window-results.json, audit-results.json, docs/), facts_buffy3.json, journal_screen_buffy3.json, analyse_buffy3.py, check_buffy3.py, check_buffy3.out, check_buffy3.corrupt_exit.txt, payload_buffy3.json, upload_buffy3.json.

Comparison only. No wheel scan, no CRT window computation, no contributor code executed; every number is read from this run's own served copies (all fetched by content hash, served_bi/) or derived by exact integer algebra. check_bi.py — 10/10 PASS, exit 0; --corrupt 1..10 each exits 1 with exactly its own named FAIL (check_bi.corrupt_exit.txt).

(1) The family identity the step's even half rests on

For a window of j slots let X_a = candidates in it, and let term_k = sum_{|J|=k} I(J) be #2330's exact CRT product (I(J) = prod_{5<=p<=x}(p - nu_p(J))). Counting pairs (window, k-subset of its occupied sites) gives term_k = sum_a C(X_a, k), so the step's even truncation is

U_2r = sum_{k=0..2r} (-1)^k term_k = sum_a P_2r(X_a),
P_2r(z) = sum_{k=0..2r} (-1)^k C(z,k).

Exact identity (checked for v<=60, m<=20): sum_{k<=m}(-1)^k C(v,k) = (-1)^m C(v-1,m) for v>=1 (and = 1 at v=0, the empty-set term). Hence for r >= 1

U_2r = sum_a C(X_a - 1, 2r)  >= 0 is an INTEGER, so
U_2r < 1  <=>  U_2r = 0  <=>  every X_a <= 2r  <=>  X_max <= 2r,

and in that case every term of order > 2r vanishes, so U_2r = E_j exactly (C05, C04).

(2) Consequence at x = 17, j = 18 (the step's even half)

The served doc docs/research/attack-bonferroni-degree.js (section D) reports for x = 17, L_crit = 18: X_min = 1, X_max = 9, t = 4.7123, k* = 10; its section A row (M = 85085, survivors 22275, L_crit = 18, 6*L_crit = 108, G2 = 108) is byte-checked against #2314's own served counts P = 510510, Nc = 22275, G2 = 108 (C02, C03). Therefore

U_8 >= C(X_max-1, 8) = C(8,8) = 1   and   U_6 >= C(8,6) = 28,

so the step's orders 6 and 8 cannot produce "an even upper bound below 1 at j18" (C06). The first even order that can certify is 2r = 10 >= X_max, where the value is degenerate: U_10 = 0 is the exact E_18 = 0, not a weaker bound. This agrees with the doc's sharp-family ladder (k* = 2,4,5,8,10,12,14,16 at x = 5..29, |k* - X_max| <= 1, C10): the degree needed tracks the termination order X_max+1, so no certificate of degree <= 9 exists in that family either.

(3) The record's own rows obey the identity

#2330's served job4999-window-results.json (11#, j=7): U_6 = 0 (so X_max <= 6; doc: 5), U_4 = 2 > 0 (so X_max >= 5); at 13#, j=11: U_6 = 4 > 0 (so X_max >= 7 = the doc's 7) with exact E = 0 — the failure #2330 reported. So the identity reproduces both endpoints of the record's own window table.

(4) The step's numeric targets are exactly on record

From #2314's published check_m.out row at x = 17 (top10 counts, max length 108 with count 20): E_18 = sum_L N_L max(L/6-18,0) = 20*max(0,18-18) = 0 and E_17 = 20*max(18-17,0) = 20, matching the step's stated targets and #2314's independent "#{gaps >= G2} = 4,12,20,20,4" ladder (17# entry 20) (C07).

(5) The odd half is the only strict-inequality content, and it is not on record

L_2r+1 = sum_{k<=2r+1}(-1)^k term_k = E_j - sum_a C(X_a-1, 2r+1) is a valid lower bound and can be positive without being exact, so the step's orders 5 and 7 at j=17 are genuinely open. No fetched return carries it (no return's report/evidence/recipe states them; #2330's own text says "The proposed order-eight test is unrun"), and #2330's instrument cannot be pointed at 17# unchanged: its primes are hardcoded to [5,7,11,13] and its assert len(counts) == distinct_gap_lengths holds at 11#/13# but fails at 17# (10 vs 17) (C08, C09).

Limits

Rung measured: the load-bearing X_max = 9 and k* = 10 are the served doc's own published measurements; the identity and the >= 1 lower bounds are exact integer algebra on top of them. No claim is made about orders >= 10, the odd orders, or twin primes.

Instrument

work/check_m.py and work/check_m2.py (python3 + numpy). Full-period boolean sieve over [0, x#) marking n ≡ 0 and n ≡ −2 (mod p) for every prime p ≤ x; survivors are the paired candidates gcd(n(n+2), x#) = 1; consecutive differences with wraparound are the candidate gaps g_1..g_Nc, and N_L = #{gaps = L} is the multiplicity profile. Exact, no sampling. Both run under sah.py bounded (exit 0, group cleared). check_m.out, check_m.out.

Validation (digit-for-digit)

max gap reproduces the served paired-Jacobsthal ladder G2(11#,13#,17#,19#,23#) = 42, 66, 108, 150, 204, so the object and instrument are validated.

Finding 1 — the carrier must be order-blind (receipt)

G2 and N_L are the max and the multiset of the gap multiset, hence invariant under any permutation of the gap sequence; route 186's rho_k is a function of the order and is not. check_m2.py permutes the multiset at 19#,23# with a fixed seed: G2 and the whole profile are identical, permutation rho_1/2/3 ≈ 0 (|.| ≤ 0.002), while the true sequence has rho_1/2/3 = (−0.042, −0.045, −0.173) at 19# and (−0.045, −0.074, −0.153) at 23#. Therefore G2, N_L and route 187's S cannot be carried by rho_k as an identity: the order-sensitive statistic is not needed for, and does not determine, the order-blind one.

Finding 2 — the suppression is a tail-hazard growth (order-blind)

Exact per-rung quantities (check_m.out); λ_tail = ln(Nc)/G2; S = λ_tail/λ_geo; λ_bulk is the geometric rate fitted from the median length; R(L) = T(L)/(1−λ_bulk)^L.

x G2 Nc λ_geo λ_mean λ_tail S λ_bulk R(p95) R(G2)
11 42 135 .06022 .05844 .11679 1.939 .01409 .099 5.4e-2
13 66 1485 .05072 .04945 .11065 2.182 .03492 .384 8.4e-2
17 108 22275 .04461 .04363 .09270 2.078 .02879 .253 2.1e-2
19 150 378675 .03982 .03904 .08563 2.150 .02877 .384 4.2e-3
23 204 7952175 .03630 .03565 .07789 2.146 .02538 .345 9.5e-5

The gap law is not geometric in the bulk (λ_bulk ≈ 0.014–0.035 vs λ_geo ≈ 0.036–0.060), and the extreme tail self-thins: R(G2) falls from 5.4e-2 to 9.5e-5 while R(p95) stays 0.10–0.38. The effective tail hazard therefore increases toward L = G2 rather than staying constant, and S ≈ 2.1 is the ratio of that effective tail hazard to the bulk memoryless rate. The number of maximal gaps is small: #{gaps ≥ G2} = 4, 12, 20, 20, 4.

What it changes

  1. A recorded connection: route 187's item-4 mechanism link to route 186's rho_k is ill-posed as an identity (order-sensitive vs order-blind), so it is made redundant.
  2. The admissible carrier is the order-blind survival T(L) / hazard h(L), and the finite data show tail self-thinning, not a flat hazard.
  3. It supplies the finite statistic the proposed route's first experiment extends.

Limitations

Five rungs only (11..23); 29#/31# not run here; R(G2) is noisy (19# spike); λ_bulk from the median alone; the order-blindness receipt is a permutation (logical) statement, not a causal claim; see uncertainty_md.md.