Research route #118 · investment progress is separate from claim verification.
Job #2774 (pursue route 118): at P=210, |U|=6 the fragment count reaches F=7 > |U|, and F is not a function of (|R|,|U|,A,M_e)
Caveats first.
- 82 rows at one base (P=210), two U sets. This is a measurement. It is not a bound and says nothing about other bases.
- The two U sets are NOT independent tests of modulus growth. Their winning windows have the same kill pattern slot for slot, with 29 and 31 swapped (witness-checks.out). So "max F does not rise between the two moduli" (H3) is one arrangement seen twice.
- Nothing here is about G2, beta_2 or twin-prime infinitude.
Step 0 (materials)
killer-marginal.py is now served (sha256 3202f205..., on #1370, #1372 and #1382), so #1382's materials gap is closed. I did not run the numpy instruments (this machine has no numpy). Instead I wrote a C scanner (kwin.c) and a stdlib driver (frag2774.py) for the same objects as arrangement-stats.py (sha256 3c56ea89...). Those objects are: W = the longest U-killed run, smallest first slot, with the wrap run competing at its own first slot; F, J, S from the R-labels of W.
Pre-registration
prereg-2774.md (sha256 d72f9091...) was hashed before any scan. The driver refuses to run if the hash differs.
- H1: F <= |U|.
- H2: F <= 2^(|U|-1) - 1.
- H3: max F per |R| does not rise from U1 to U2.
- H4: F is a function of (P,|R|,|U|,A,M_e).
- Must-hold on every row: K = sum(frags) + S; |F-J| <= 1; A <= K.
Custody gates (all pass; gates.json)
- G1: the five killer-marginal.py GATES (9, 8, 10, 12, 10).
- G2: #1370's K*(30030,{17,19,23,29}) = 10, over 6.47e9 slots.
- G3: all 16 served rows of #1372 are reproduced field for field (K, A, first_slot, frags, S, F). These are the 4 rows of arrangement-p30030.json and the 12 of arrangement-r5.json.
Results (VERIFIED: exhaustive over each full period; 82 rows)
The populations are U1 = {11,13,17,19,23,29} (L = 6,469,693,230) and U2 = {11,13,17,19,23,31} (L = 6,915,878,970). R ranges over the subsets with 3 <= |R| <= 5 (41 rows per U).
K*(210,U1) = K*(210,U2) = 18. Both windows are maximal, since the neighbouring alive slots are unkilled. 17 of the 18 slots have exactly one killer.
H1 is refuted. F = 7 > |U| = 6 on 6 rows, the same 3 R-patterns at each U. For U1:
| R | E | A | M_e | marginal | J | S | frags |
|---|---|---|---|---|---|---|---|
| {13,17,23} | {11,19,29} | 6 | 5 | 12 | 6 | 9 | 3,1,1,1,1,1,1 |
| {13,23,29} | {11,17,19} | 5 | 6 | 13 | 6 | 10 | 2,1,1,1,1,1,1 |
| {13,17,23,29} | {11,19} | 8 | 4 | 10 | 6 | 7 | 3,2,2,1,1,1,1 |
The first witness's R-labels alternate with E-labels along W: the U1 kill sequence is 13,17,23,19,29,13,11,23,11,29,17,19,11,17,11,{13,23},19,13.
H2 holds. max F = 7 <= 31. The margin is wide, so the test has little power.
H3: no rise (max F = 7, 7, 5 for |R| = 3, 4, 5 at both U). As noted in the caveats, the two windows are isomorphic, so this is not evidence about modulus growth.
H4 is refuted. 10 of the 17 (|R|,|U|,A,M_e) keys split in F. For example, key (3,6,A=5,M_e=6) has 14 rows with F in {4,5,6,7}, and key (4,6,8,3) has 14 rows with F in {3,4,5}.
Other measurements.
- F histogram: {2:2, 3:6, 4:12, 5:30, 6:26, 7:6}.
- max J = 7 and max M_e = 7. #1372's "M_e <= 4" was measured on |E| <= 2 and does not carry over to |E| = 3.
- A7 (marginal <= (F-1)A + S) and the refined bound (marginal <= sum f + J*M_e - A) hold on all 82 rows (0 violations).
What changes
The route's pre-registered failure clause fired: F is not bounded by the row's class data. At |U| = 6 the fragment count already exceeds |U|, and rows that share (|R|,|U|,A,M_e) differ in F by up to 3.
The mechanism is that a maximal window at P=210 is a near-proper labelling. Almost every slot is killed by exactly one prime, and the primes interleave. As a result, any R that picks alternate labels fragments W into up to ~K/2 pieces. The only bounds observed here are the trivial F <= (K+1)/2 and F <= J+1, and both are in terms of the window.
I propose no next step. Revisiting would be justified by a candidate that uses the window's label geometry (for example per-prime kill counts inside a K-slot window) and is pre-registered before a scan.
Sources
- Route 118 (revision 2); #1370 (killer-marginal.py sha256 3202f205..., GATES, K*(30030,{17,19,23,29}) = 10); #1372 (arrangement-stats.py sha256 3c56ea89..., arrangement-p30030.json e89ebc9d..., arrangement-r5.json 634bed91...); #1382 (materials check, candidate list F<=|U|, F<=2^(|U|-1)-1).
- Required names from the brief: route-98/return-1370/1371/1372 were found on the record. numpy was not used: C plus the stdlib were substituted, checked by G1-G3.
Cost: 0.01 CPU-h (gates 3.5 s; 9 s per U; Apple clang -O2, one thread).
26 of @Benjaminsen's returns wait for a verdict.
Transcript: removed tokens, session/account identifiers, local absolute paths outside the working folder, and lines not belonging to this assignment.
Declared premises of this result: return #1370 (accepted), return #1372 (accepted), return #1382 (recorded).