Job #2580 (explore/discovery): the next tile of the L-ladder, computed — and the pre-registered shape falsifier fires
Verdict
measured, with one pre-registered falsifier fired (a negative finding) and one control
exact. The decision the statistic informs (does the recorded L-ladder's gap-support shape
extend one fold?) is now decided, at the next fold, and the answer is no: the shape seen at
T29 was an accident of that tile, not a law. No route is proposed (the criterion is already
recorded; the remaining increments are costs, not open questions).
What was decided, and why the retained censuses could not
Return #161 records the L-ladder L(T_x,p) only for T5..T29 and 7 <= p <= 1009. The
criterion L(T_x,p) >= 2 <=> some cyclic gap of T_x is in {0,2,p-2} mod p (a one-line
consequence of {a,a+2}-{a,a+2} = {0,+-2}, derived and checked 8/8 against #161's thresholds
by run-d, note research/l-ladder-gap-support-2578.md, return #1466) reduces the column to a
finite set: the tile's cyclic gap support. #1466 pre-registered the next step — the same
computation at T31 — with a falsifier. That is this return.
Pre-registration work/prereg.md (sha256
322c87776d5b8ef2d25cf425aa9a73300590b9f86ed1495522851c3ffeedd081) was written at 2026-09-23T01:34Z
before any run; the statistic is the T31 gap support and threshold.
Results (one pass; work/t31_support.py, 241.6 s wall, one core, < 100 MB RSS)
Control, T29 — exact. D = 214,708,725 (= #162's census = #161's D = #159's D);
G2 = 258; support exactly {6,12,...,240} U {258} (41 values); threshold 127 = #161's
recorded value; sum of gap multiplicities = D; sum gaps = W = 29# = 6,469,693,230.
New, T31. W = 31# = 200,560,490,130; D = 6,226,553,025 = 29 * D(T29) (pre-registered P1,
exact); G2 = 348; support
{6,12,...,318} U {330, 348} (55 values); every gap a multiple of 6; sum gaps = W;
sum of gap multiplicities = D; threshold 179; 27 primes p > 31 read L >= 2 (T29: 20);
no prime 353 <= p <= 1009 reads L >= 2. By the criterion the whole tail p > 350 is L = 1
as a theorem, not a measurement — the falsifier F3 (a p > G2+2 with L >= 2) did not fire.
The pre-registered falsifier F2 fires
prereg.md F2: the support must be full below G2 - 18, with at most the single top value
above it — the shape measured at T29 (full block 6..240 = G2-18, plus the one value 258 = G2).
At T31, G2 - 18 = 330 and 324 = 6*54 is absent while 318 and 330 are present: there
is a hole below the pre-registered boundary, and two values (330, 348) lie above 318
rather than one. F2 fires. The "full block plus one exceptional top gap" shape does not
continue at the next tile: it was an accident of T29, not a law of the ladder.
Scope of the negative: it refutes the shape conjecture of #1466, not the criterion of
l-ladder-gap-support-2578 (which is elementary and untouched), and not #161's measured values.
Byproduct statistic — not pre-registered (reported as measured, with the design below)
From the same multiplicities: the tile gap-size dispersion against the matched independent
thinning control the brief names. Null: keep each 6-lattice slot with rho = D/(W/6), then gaps
in units of 6 are Geometric(rho), var/mean = 6(1-rho)/rho (validated by 200 000 draws, seed
20260923: 24.148 vs analytic 24.132 at T29; 26.142 vs 26.211 at T31).
| tile | mean gap | var/mean | null | ratio |
|---|---|---|---|---|
| T29 | 30.132 | 15.256 | 24.132 | 0.632 |
| T31 | 32.211 | 17.022 | 26.211 | 0.649 |
The tile gap word is ~35 % less dispersed than matched independent thinning, consistently at
both tiles. This is the same direction as route 142's sub-Poisson consecutive-twin-gap law
(return #1456, ratio 0.903 in the top bin), but it is not the same object (a size
dispersion of a tile's gap word vs a bin-count dispersion of real twin gaps), and it was not
pre-registered here, so no claim is made. Design for a pre-registered test: fix the statistic
(var/mean of the tile word), the null, the tiles, and the falsifier ratio in [0.95, 1.05]
before the run; cost 0.02 CPU-h (the multiplicities above are already saved).
Rungs
proven: the {0,+-2} criterion (l-ladder-gap-support-2578); the L = 1 tail p > G2+2.
measured: the T29 control (exact match to #161/#162/#159); every T31 number; the F2 outcome
(negative); the dispersion byproduct. verified: #161's/#1466's recorded values, read.
heuristic: the structural reading of the tail values (43 at T29; 55, 58 units of 6 at T31).
The gap that remains
- Why
324is absent while330and348occur, and why the tail has two values at T31 and one at T29 — no explanation is offered. Cheapest discriminating step: the same support atT37,D(T37) = 35 * D(T31) = 217,929,355,875slots, ~2.4 CPU-h single core (fits the 4 CPU-h cap; does not fit a one-hour session). It decides whether the hole is a one-off. - Independent recomputation of the T31 support (0.2 CPU-h) as an instrument check — the T29 control is exact, but the T31 hole is a negative claim about a 6.2e9-slot object.
- Not attempted:
L >= 3and the exact values (needs the residue order; #161's "L has no law of its own" stands).
Note for the person: 48 of @Benjaminsen's returns wait for a verdict, the oldest since 2026-09-11.
Files
work/prereg.md, work/t31_support.py, work/t31_support.json, work/dispersion_control.py,
work/dispersion_control.json, work/report.md. Costs: 0.068 CPU-h total (bounded, one core).