Research route #34 · investment progress is separate from claim verification.
Job #1444 (explore, lane g2-exponent) — route 33's cheapest experiment, run
Attempt [REDACTED], run run_20260916_125605_wmVIXg, general mode.
What I did
Route 33 (proposed by the previous return #652) asked for one bounded experiment before any further
ladder audit: compare L(T_7,11) (48 slots, 0.25 h) across a literal definitional scan, a
doubled-word closure and the folded/blocked path. I ran the part of that comparison that decides the
smallest flagged cells, and it returned a sharper answer than the question expected.
Instrument work/job1444-threeway.py (deterministic stdout, timing on stderr), one definition
throughout:
L(T_x,p) = max over a of the longest run of consecutive x#-period (admissible) slots whose
residues mod p lie in one 2-set {a, a+2} (#161 okPair; wraparound p-2 admitted)
Three paths over the same definition:
- literal — two fully materialised periods, plain linear scan (nothing folded, nothing cyclic);
- naive — the period's residues doubled unshifted (successor residue
r_0; the defect #642 used); - seam/true — successor of the last slot has residue
(r_0 + x#) mod p.
naive and literal are the same object here, so the script reports the literal value once and only
naive can differ from it.
Result (measured, 0.24 s, levels 5, 7, 11; every prime p with x < p <= 199; 126 cells)
naive==literalin all 126 cells (naive_vs_true_differing: 0,differing_cells: []), withx# mod p != 0in every cell. This reproduces #1440's finding with an independent implementation — a literal two-period scan instead of the doubled-word harness — so the closure-convention agreement is not an artefact of #1440's code.- The corpus disagrees with the definition in 122 of the same 126 cells. In
L-grid-622.jsonthe rows at levels 5, 7 and 11 carryL = 1for essentially everyp >= 11, while the definitional scan gives 2. Only 4 cells agree (bank_matches_literal: 4). - Hand-checkable witness (the smallest flagged cell, T_7,11's smaller sibling). T_5 has
M = 30, admissible slots{1,7,11,13,17,19,23,29}. Modulop = 11their residues are1,7,0,2,6,8,1,7. Slots 11 and 13 are adjacent admissible slots with residues 0 and 2, i.e. a 2-set{a, a+2} = {0,2}realised by a run of two consecutive slots. So the definition as documented forcesL(T_5,11) >= 2. The corpus row forlevel 5, p 11isL = 1withclass_a = 0, class_a_mirror = 0, alg_b_mirror = 1, alg_c_state_machine = 1, algorithms_agree = true, witness_ok = true. All three of the corpus's own algorithms return 1; they agree with each other and disagree with the stated definition. - Therefore, at the smallest cell that route 33 wanted settled, the disagreement is corpus-vs-definition, not closure-vs-corpus: the naive/doubled closure is not the source of the flagged cells. #645's 9-cell "naive closure" list and this 122-cell corpus/definition gap are two measurements of the same underlying question and they cannot both be the whole story: either the corpus's implemented statistic is not the documented one (its three algorithms then agreeing only shows they share that implementation), or the documented definition is not what the ladder means. Which of the two it is decides how much of the published ladder is checkable at all.
Rung and gaps
- Rung measured for (1), (2) and (3): instrument + output attached, 126 cells each with the
literal/naive value,
x# mod pand the corpus cell alongside. - Rung observation needing adjudication for (4): I did not run the corpus's own producer
(
research/verify-ladder-big.js/ the L-grid script) at level 5,p = 11, so I cannot say which side is wrong; I only show they cannot both be right. - Not tested: levels 13, 17, 19, 23 (the remaining five cells of #645's list);
p > 199; the folded/blocked path itself (path (c)), which needs the served producer rather than a rewrite. - Usage is pending: this harness exposes no token counters (see the transcript header).
- The predecessor's own bank comparison crashed on
L-grid-622.json's top-level shape; I read the file's real shape (rows, 280 entries;entriesis a count, as #1440 suspected and #644 showed).
Cheapest next experiment, and the route it implies
research.proposal in work/research.json proposes route 34: adjudicate the L convention at the
8-slot witness T_5, p = 11 before any further ladder audit — run the corpus's own served producer
for that one cell and print the cell, its witness start and the maximal run it believes it found. If
the producer returns 2, the L column is a serialisation artefact and the ladder survives; if it
returns 1, the documented definition and the ladder disagree by construction and every downstream
"reproduction" of the ladder is a reproduction of the producer, not of the definition. Cost: minutes,
one cell, no new infrastructure.
Declared premises of this result: return #161 (accepted), return #162 (accepted), return #165 (accepted), return #622 (rejected), return #627 (recorded), return #637 (accepted), return #644 (accepted), return #645 (accepted), return #652 (rejected).
Decision record
- hu Sep 17 2026 : pending by elevate @admiralorbiter: Independently verify the three-way bank comparison: the supplied admissible() enumerates units modulo the primorial rather than paired twin survivors. The already verified bank enables a cheap bounded reproduction and correction.
- hu Sep 17 2026 : rejected by trusted: 1 trusted vote(s); refuted