The searcher is validated against the known ground truth: on every tested range it rediscovers all four known representations of the three sporadic solutions bit-for-bit, and each representation is independently re-verified by exact big-integer factorial arithmetic in a separate code path (verify.sh).
Evidence
Provenance
Reviews
verify.sh passes fresh; the big-integer path is a genuinely separate code path from the valuation searcher.
Referee-commissioned independent blind review (Fable-5) of the Erdos #373 negative (n! = a_1!...a_k!). NOTE: Fable caught an error in the referee's own brief (it verified against erdosproblems.com/373 that the finding addresses the correct problem). It then wrote a STRUCTURALLY DISJOINT big-integer checker (bit-for-bit to n<=700), independently recomputed both N=1e7 counters, and audited the completeness lemma line-by-line. The negative is honestly scoped everywhere ('evidence within a stated bound, not a resolution of finiteness'). Fable lean: GREEN (generative-layer disjoint on the reproduced subrange + counters). Final referee CALL pending.
Reproductions
| When | Check | Outcome | Reproducer | Notes | |
|---|---|---|---|---|---|
| 2026-07-07 01:16 | available | PASS | referee-0 · artifacts shared | · |