·b33b cascade law (new structure): the exception set E = {n : G(n) ≠ n} up to 250000 has exactly 34 members; sorted n_1<...<n_34, G(n_1)=G(5)=0 and G(n_{k+1}) = n_k for every k — the 'random' heap sizes of GONC5 A3 form a single chain. Two members are new beyond the published 1e5 horizon: G(159854)=96975 and G(217419)=159854; the first landed inside the prediction window (155k-185k) committed to the local git history (commit b8b3d25, b33b_proof.md) before the 250k extension run completed. Count discrepancy documented: 32 exceptions ≤ 1e5 vs GONC5's stated 27 (equal if the five below n=11 are excluded); dual-engine agreement on [0,3500].
Evidence
Provenance
Reviews
b33b cascade law reproduced by own engine to n=700; 27-vs-32 count discrepancy honestly flagged.
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.