mirror of
https://github.com/Druthulu/BFM-decomp
synced 2026-09-26 21:36:06 -04:00
90b452008e
All 1,101 novel-idiom candidates read (33 waves, 4,888 verdict lines, 4,764 notes), restricted to functions the WHOLE-BINARY BYTE-GATE banked. Append-only: 1450 insertions, 0 deletions, prefix md5 unchanged. §233 header+index · §234-§257 the laws · §258 the 21 addenda (append-only forbids inserting them into their parents) · §259 the discard ledger. Three claims were HEDGED rather than promoted (§253, §254, §213's right-rotate rule); four were byte-verified against asm/ before being written; §217/§230/§232 were promoted from 'single observation' to CROSS-CONFIRMED by independent cards. ~1,040 discarded across 18 ledgered clusters — ~700 self-reported 'nothing the cookbook did not already cover' (the flywheel working), ~400 Law-1c compliance reports, ~70 bare 'reordering fixed it' with no mechanism (unindexable). Two clusters deliberately left as OPEN PROBLEMS rather than written up as false laws: forcing own_thread_p on a call-bearing join, and suppressing a constant-offset second giv. Both are permuter jobs. Highest-value: §234 (store lvalue signedness picks addiu vs li/ori — 12 cards each burned a one-instruction residual on this), §236 (the nine-class declaration-layer taxonomy — ~90 cards banked bodies that were already instruction-correct), §235 (the phantom symbol: match_one masks relocations so a green MATCH can name a nonexistent symbol, with NO instruction diff).