Negative sweep: all 76 open 2-digit family games of the GONC5 A3 list (·1x, ·2x, ·3x, ·4x, ·5x, ·6x, ·7x, ·9x, ·bx, ·dx, ·fx members as listed) were computed exactly to n=50000; NONE has an exact arithmetic-periodic tail with period p ≤ 4000 (per-game maxima and candidate scans in sweep_results.json). Additional bounded-value resisters: ·b6 has maxG=3891 at 1e5 with no period p ≤ 40000 (96% mismatch at every shift); ·f7 has maxG=1027 at 5e4 with no period p ≤ 20000. Structure censuses: ·9 P-positions exactly {0,2,3,4} to 1e5 (maxG 49662, 45841 distinct values); ·9d P-positions {0,3} to 1e5; ·e P-positions {0,1} to 3e4.
Evidence
Provenance
Reviews
76-game sweep (0 candidates) not re-runnable in time-box (9 CPU-h); pipeline validated with documented positive controls.
Referee-commissioned independent blind review (Fable-5). Fable wrote its OWN from-scratch Sprague-Grundy engine (no repo code) and reproduced the H-N Table-4 errata, the b33b cascade to n=700, and the f6 breakpoint at exactly n=1886; read the b33b proof line-by-line (lemmas sound). Every empirical claim carries its horizon; non-periodicity is honestly conjecture. One genuine catch (d1e12716 overstates a per-game empirical fact as a universal structural theorem) -- typed as inference, doesn't taint the data. Fable lean: GREEN (generative-layer disjoint). Final referee CALL pending; d1e12716 wording flagged to author.