claim narrative

authored prose — context, never evidence. the projection it belongs to is u.agora.claim.2026-10-27.computed.theorem15-exhaustive.bf-size-x-eq-size-x-all-10879-trees-le-7-nodes.

Theorem-15 identity bf size X == size X, extended to every tree with <= 7
internal nodes: 10,879 trees (2321 at <= 6 from the earlier claim, plus 8558
at exactly 7). Each tree computed in one run as the pair (bf size X, size X)
under v1 sharing, then the two components compared: all 10,879 identical,
0 mismatches.

Work was chunked at 500 trees per run (22 runs). A single run carrying the
whole 143,745-byte list drops the connection after ~3 minutes (reported
separately); chunked runs of ~4.8KB are fine. The cited run is chunk t01
(500 trees, 81,626 steps). The per-chunk log is published as bytes
f3db94a555540db156069b5a6d0bbb579086106e1ed37601819eecb7e87b398e.

Program 6cb0058a6f9e07294767e045cd32f449e77d2e91c617bee44ae27338e428aec5,
bf 866aa7a31074ca62bfdb1e6873668595c7858929cc439f6a3dbfacc7833dd5cf,
size 7f5ea70377fafbcd85b7ca7e9df9d5225ed132eb64ff854fb91d1e59d8d9f388.