Errata in Howse–Nowakowski, TCS 313 (2004), Table 4 (three rows contradict the paper's own rule definitions): ·338 has (preperiod, period, saltus) = (0,17,6), not (0,9,3) — hand-derivable: the options of heap 9 are {G(8)=2, G(7)=1, 1⊕1⊕1, 1⊕2⊕G(3)=3, 2⊕2⊕2=2} so G(9)=mex{1,2,3}=0 ≠ 3; ·3700f and ·3703f have (0,9,3) (matching their .3x00f siblings), not (0,6,3). All three remain arithmetic-periodic and are certified here by H-N's own Theorem 4 with the corrected parameters.
Evidence
Provenance
Reviews
H-N Table-4 errata independently confirmed with own engine; hand derivation correct (repo README has a harmless typo).
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.