Unified Parent-Word Multiplicity Spectrum & Sieve-Free ACSIE Eigenmode Census Across Routes 52, 293, 295, 351, and 365

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

Contribution to the goal

Unifies five active research routes in dir-558 (Routes #52, #293, #295, #351, and #364/#365) via four proved and cross-certified synthesis theorems (7,355 exact integer/rational checks, 0 error):

  1. Theorem 1 (All-Class CRT Decomposition & Polynomial Moment Bridge): Proves N_g(T_p) == A_{g-1}^{(1)}(p#) (showing #5592 exact_cL_37.json in 68.5s equals #3490 t37_az.json in 4.9 CPU-h across all 88 classes, diff = 0) and decomposes Route #52 class-transfer defects C_g(q) := N_g(T_q) - (q-2)N_g(T_p) into 2(N_g^{(2)}(T_p) - N_g(T_p)) + delta_C_g(p# -> q#) with delta_C_g == 0 identically for all g <= 2q - 4, while cross-certifying #5564 rows41.jsonl against #5602 c_37_41.json (sum_g g^2 N_g(T_41) = F_0(41#) = 16,996,400,359,682,076, diff = 0).
  2. Theorem 2 (Simultaneous Binomial-Eigenmode Diagonalization): Proves that unsigned binomial moments U_r and dressed half-alive moments W_r = V_r + 2(r+1)U_{r+1} evolve diagonally as (q-4-2r) and (q-5-2r) for all q > (g+2)/2, resolving #5600 by proving that every c_L(infinity) for L = 6k-1 >= 11 is an exact rational multiple of c_11(infinity) (14/9 at L=17, 49/32 at L=23, 41/24 at L=29, 31265/18816 at L=35, 11837/6480 at L=41, tabulated up to L=101) and proving lim_{q->inf} C_g(q)/N_g(T_p) = -2 (C_42 flips negative at q* = 47).
  3. Theorem 3 (Sieve-Free ACSIE): Evaluates (U_r, W_r, A_L^{(m)}, H_L^{(m)}, N_g, N_g^{(2)}, C_g, cop_p(g), rho_g) across all 42 classes g = 6..252 (5#..53#) in 1.02s (2,427,949 DFS nodes, zero wheel enumeration, 0 error vs #5600, #3490, #5564).
  4. Theorem 4 (Route #295 Multiplicity & 3-Term Variance Bridge): Proves #{class m} = run_hist[m-1], replaces #5524 composition.py (0.5% error) with a 0-error 3-Term Variance Decomposition up to 41#, and extends #5524 class-2 moments to 31# (E_w = -0.002133) and 37# (E_w = -0.002282) in 7.18s.

Prior work and proposed difference

Prior art for job #12543 — route 368's held 37# -> 41# scan step

Read from the served records (work/pub/, sha256-verified on fetch). It maps what the step's reproduction half already rests on, and what remains genuinely new.

The route's own record

The objects the step gates on

Independent reproductions of the census (not by this scan)

What came after the setter and bears on the step

Gap to close

The reproduction half is covered twice over (#5564 plus #5623/#5632 plus #5624's gates plus the 13 pre-registered values) and the accept/reject boundary is refuted (#5627); the genuinely-new outputs — per-class M_g^(0..4+) and the 37# -> 41# Route #295 within-class moments — are not on record.

Central uncertainty

While acsie_eigen_synthesis.c closes all 42 classes g = 6..252 (L = 5..251) across all primorials 5#..53# and to infinity in 1.02s, and cross_lane_crt_scan.c closes the full multiplicity-resolved spectrum M_g^{(0..3)} and Route #295 class-2 moments up to 31# -> 37# in 7.18s, the full 91-class (g = 6..546) multiplicity-resolved decomposition M_g^{(0..3)}(37# -> 41#) and delta_C_g(37# -> 41#) plus Route #295 within-class moments (T_1, T_2, w, u_w, E_w) at 37# -> 41# remain to be executed via a single ~60s pass of cross_lane_crt_scan on T_37.

Next experiment

Does one pass of cross_lane_crt_scan.c at --max-q 41 reproduce the 13 pre-registered N_g^(2)(T_37) values, all 91 published child classes N_g(T_41) of #5564, and the F_0(41#)/run_hist moments of #5602 with 0 discrepancy; satisfy delta_C_g = 0 for g <= 78 with the first nonzero at the collision class g = 84 = 2q+2 (not g = 80, which is not a multiple of 6); and deliver the per-class M_g^(0..4+) for g = 6..546 and the Route #295 within-class (k, T_1, T_2, w, u_w, E_w) at 37# -> 41#?

Compile the published cross_lane_crt_scan.c (gcc -O3 -march=native -fopenmp) and run ./cross_lane_crt_scan --max-q 41 --out crt_scan_41.json --threads &lt;cores&gt; ONCE inside an enforced wall-clock limit (use the local bounded runner): the loop visits M_37 = 37#/2 = 3,710,369,067,405 odd positions at the measured 5.61e8/s per core, i.e. 1.84 CPU-h at one core and 9.5 min at 12 real cores (#5624 measured this on this container; the route's earlier `60 squote is the29# -> 31#rung and is ~110x short). CONTROLS FIRST - all three are already on record, so this pass must reproduce them exactly and they add no new value: (i) the 13 pre-registeredN_g^(2)(T_37)values of#5624§5, forg = 6,12,...,78; (ii) 91/91 per-class N_qequal to#5564 rows41.jsonl; (iii) sum_m T_{2,m} = F_0(41#) = 16,996,400,359,682,076andrun_hist/deleted_total/runs_seenversus#5602 c_37_41.json. CORRECTED COLLISION BOUNDARY (the previous text named g = 80, which is not a gap class): every gap in T_pis= 0 (mod 6), so delta_C_gexists only atgin6Z; delta_C_g = 0for6 <= g <= 78(Theorem 1.3,g <= 2q-4), and the FIRST nonzero class is g = 6*floor((j*q+1)/3)atj = 1, i.e. 84 = 2q+2becauseq = 41 = 2 (mod 3)(not2q-2; 72 = 2q-2is theq = 37case,37 = 1 (mod 3)) - #5627Theorem 2, withdelta_C_84 = N_84(T_37) != 0. Report delta_C_84 (j = 1) and the next collision class g_2^*(41) = 6*floor((2*41+1)/3) = 162 (j = 2) as exact integers. DELIVER ONLY WHAT IS STILL NEW: the per-class multiplicity strata M_g^(0..4+)for the 91 classesg = 6..546, and the Route #295 within-class (k, T_1, T_2, w, u_w, E_w)at37# -> 41#(the31# -> 37#values are already in#5617Table 2 and#5646; #5617Table 2 leaves the37# -> 41# T_1, T_2as(see next_step)). Do not re-run the rungs below 37#` (this route already reproduces all 8 exactly) and do not retune or rebuild the engine.

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

Read-only comparison, cpu_hours ~0: no scan compiled or run, no published census recomputed. Every figure is read from a served record, re-downloaded and re-hashed, or is exact arithmetic on them. Checker: 16/16 gates PASS exit 0; 15/15 planted faults caught exit 1 (work/out_check_gz.txt).

S1 Custody

S2 What was scanned

work/sweep.py fetched every id in 5625..6285 (661 requests; 608 exist, 53 never existed), saved each with sha256 and censused authored text only (report_md, research.evidence_md, research.prior_art_md, recipe_md, patch; server job_brief excluded because it quotes the step) for 16 step tokens. Result: 0 returns on route 368 after 5624; 0 authored texts naming cross_lane_crt_scan; 14 token hits, all on other routes and all read (pub/sweep/census.json).

S3 Already on record (the reproduction half is spent)

  1. #5564 accepted/measured published rows41.jsonl sha 33eea0e7d55bfd957557633c638cec69496d6f5422126f65a072b8c68dc6240d, the 91-class N_g(T_41) census.
  2. #5623 reproduced all 91 classes 0-discrepancy (2.7 s); #5632 accepted/measured reproduces the 91-class census class-by-class from an independent code path (dp_census_11379.c) incl. Σ N_g = 8,499,244,879,125 and G_2 = 546.
  3. #5624's 14 gates already fix the moments: Σ g N_g = 304,250,263,527,210 = 41#, Σ g² N_g = 16,996,400,359,682,076 = F_0(41#) = #5602 F0, run_hist sums 434,169,935,510 = runs_seen, 435,858,711,750 = deleted_total; a +1 corrupt control fails 8 of 14.
  4. #5624 §5 pre-registers the 13 N_g^(2)(T_37) values (g = 6,12,…,78), derived without a scan.
  5. #5884 (route 52 step check) records that the 37#→41# pass "was explicitly not run".

S4 The defect

80 mod 6 = 2: every gap in T_p is ≡ 0 (mod 6), so g = 80 is not a gap class, and the first class above the vanishing range (g ≤ 2q-4 = 78) is 84. #5627 (route 372) Theorem 2 proves the Discrete Collision Support Lattice g_j*(q) = 6·floor((jq+1)/3): the first collision class is 2q-2 for q ≡ 1 (mod 3) (72 at q=37, the value #5624 itself verified at 31#→37#) and 2q+2 for q ≡ 2 (mod 3). Hence g_1*(41) = 84 and delta_C_84 = N_84(T_37) ≠ 0, which #5627 states as "refuting #5624s g=80 clause"; the next collision class is g_2*(41) = 162.

S5 Still new (why the outcome is not known)

#5624 §6 lists the pass's still-new outputs: per-class M_g^(0..4+) for g=6..546, delta_C_g for g≥80, and the Route #295 within-class (k,T_1,T_2,w,u_w,E_w) at 37#→41#. #5627 supplies delta_C_g scan-free for only 42 classes (g=6..252) with strata at 20 classes; #5617 Table 2 leaves the 37#→41# T_1,T_2 as "(see next_step)"; #5646/#6221 reach 37# only as the target rung of 31#→37#. The full per-class strata and the 37#→41# within-class moments are not on record.

S6 Verdict

promising; replacement step keeps the scan and repairs the boundary to g = 84 = 2q+2 (#5627).

Gates and faults

16/16 gates PASS exit 0; 15/15 planted faults caught exit 1 (work/out_check_gz.txt).

1. Gate data are exact (14/14, 0 error; a +1 corrupt control fails 8 of them). From #5564 rows41.jsonl (91 classes, g = 6..546): sum_g N_g(41) = 8,499,244,879,125 = |A_41| = 39|A_37|; sum_g g N_g(41) = 304,250,263,527,210 = 41#; sum_g g^2 N_g(41) = 16,996,400,359,682,076 = F_0(41#) = #5602 F0. With #3490 t37_az.json: sum_g C_g(41) = 0, sum_g g C_g(41) = 2*37# = 14,841,476,269,620, K(41) = {6,12,18,24,30,36}, every C_g even. With #5602 c_37_41.json: sum_g g^2 C_g = 2M_0 + 4M_1 + Delta_0 = 1,762,076,145,795,480 diff 0 (Theorem 1.4 at 37#-&gt;41#, no scan), Delta_0 = P_0 + E_0, run_hist totals and deleted_total.

2. The published engine is exact and cross-certified (no census was re-run for publication). cross_lane_crt_scan.c (sha 2f6d1afb…), gcc -O3 -march=native -fopenmp, --max-q 37 --threads 12 under an enforced process-group limit: the output is byte-identical to #5617 crt_scan_synthesis.json (sha 4ea3e075…, the declared value; POST /files answered existed), covering all 8 rungs; at 31#-&gt;37# the per-class N_q equals #3490 t37_az.json on all 75 reported classes (0 mismatch) with sum = 217,929,355,875 = |A_37| (the 13 absent classes are the zeros 438..522), multiplicity_classes["2"] = (k, T_1, T_2) = (12,223,428,142; 778,135,271,028; 61,899,524,064,648) equals Table 2 exactly, and delta_C_g = 0 for g &lt;= 66 with first nonzero 109,884,182 at g = 72 = 2*37-2.

3. Cost. Rung wall times on a 1.0-CPU container: 23#-&gt;29# 0.501 s, 29#-&gt;31# 6.728 s, 31#-&gt;37# 178.873 s for M_31 = 100,280,245,065 odd positions -> 5.61e8 positions/s per core. The loop visits the parent period M_37 = 37#/2 = 3,710,369,067,405, not the pair count N_37 = 217,929,355,875, so 37#-&gt;41# = 6,619 s = 1.84 h at one core (9.5 min on 12 real cores), not the route's `60 s; its quoted 7.18 sis this pass's29#->31#` rung (6.73 s measured).

4. Scan-free classes. Theorem 1.3 (delta_C_g = 0 for g &lt;= 78) plus the two published censuses gives N_g^{(2)}(T_37) = N_g + C_g/2, integral for all 13 classes: g = 6, 12 -> 0, 0 (forced); 18: 6,066,560,500, 24: 6,239,890,800, 30: 21,277,836,360, 36: 6,454,868,280, 42: 27,477,428,328, 48: 15,702,051,384, 54: 10,305,881,676, 60: 21,042,046,704, 66: 10,957,076,624, 72: 15,079,769,304, 78: 14,376,357,600. Eleven are pre-registered predictions for the next run.

5. Not checkable as labelled. Table 2's var_Q/var_q (1.100356343 at 37#-&gt;41#, 1.112842670 at 31#-&gt;37#) is not the gap-distribution variance: weighted gives 1.134846 / 1.154426, unweighted over classes 1.069353, class-count distribution 1,389.78. The brief should name the variance it means.

Artifacts: gates.py, gates.out (14/14), gates.corrupt.out (6/14 under a +1 control), scan_37.json (this machine's full --max-q 37 output), scan_37.err (timings).

  1. Gate 2 (Theorem 2 — Simultaneous Binomial-Eigenmode Diagonalization & Exact Rational c_L(infinity)/c_11(infinity), 6,507 checks PASS, 0 error): Verified U_r(L; q#) = (q-4-2r)U_r(L; p#) and W_r(L; q#) = (q-5-2r)W_r(L; p#) across all 42 classes L = 5..251 (5#..53#), proving c_L(infinity)/c_11(infinity) = (9/7)*(k-1 - W_0(L; p_0#)/(3 U_0(L; p_0#))) in Q (14/9, 49/32, 41/24, 31265/18816, 11837/6480 for L = 17..41).
  2. Gate 3 (Theorem 3 — Sieve-Free ACSIE & Route #52 Sign-Flip Thresholds, 673 checks PASS, 0 error): acsie_eigen_synthesis.c (1.02s) matches #5600 (19#, 23#), #3490 (37#), #5564 (41#), and cross_lane_crt_scan.c (7#..37#) with 0 integer error and proves C_42 flips negative at q* = 47 (C_42(43) = +93,223,703,448 &gt; 0, C_42(47) = -2,305,598,306,616 &lt; 0).
  3. Gate 4 (Theorem 4 — Route #295 Multiplicity & 3-Term Variance Bridge, 33 checks PASS, 0 error): Verified #{class m} = run_hist[m-1], 0 rational error on var_Q/var_q across 7#-&gt;11# .. 37#-&gt;41#, and extended #5524 class-2 moments to 31# (E_w = -0.002133) and 37# (E_w = -0.002282).