BFM-decomp/docs/cookbook-index.md

Cookbook index — find the entry by the SYMPTOM you are looking at

Generated by tools/cookbook_index.py — do not hand-edit (R33). Regenerate after adding a cookbook section.

docs/matching-cookbook.md is ~716 KB / 888 sections. Grepping it blind is how three P30 wave-1 agents each "discovered" an idiom that was already written down. Start here, then read the section. A section appears under every symptom it addresses.

How to use: name what you SEE in the diff (a stolen delay slot, an extra la, a swapped register pair, a conflicting types error), find that symptom below, read those sections first. If nothing fits, THEN grind — and add a section when you win.

Start here — the symptoms that come up most, with the section that fixes them

Hand-curated from what agents actually hit and, in several cases, RE-DERIVED because keyword matching alone did not surface the entry (P30 wave-2 feedback). If your symptom is here, read the named section before anything else.

• wrong branch sense / arms swapped / beq where the target has bne (match_one prints this class as BRANCH-POLARITY) → §3-T4 (invert the source condition) + §32.2; for a trailing return 0 vs an early return see the shared-ret0 note (cookbook L1344)
• conflicting types on YOUR OWN function's definition, where the fleet canon is (void) → §73 (the PARAMS axis) + §42 — keep the (void) signature and read the incoming arg via register s32 a0v __asm__("$4"); §42 is otherwise indexed only under regalloc
• a shared global declared at a conflicting type (u8 vs s32, signedness) blocking your draft → §37 asm-label alias extern T X __asm__("D_x") — beats *(T*)&X, whose address-of perturbs regalloc. Works for FUNCTION definitions too (P30 wave 2)
• target reuses ONE address register across two different offsets of the same global → §20 (the pointer-var-to-the-global bullet, cookbook L1907-1918) — take T *p = &D_x; and index off p, never the bare symbol twice
• an extra la / the address hoisted into a callee-saved register across calls → §20 + gcc-2.7.2-map/cse_expr.md §H — *(T*)&sym force_regs the address; the asm-label alias (§37) keeps the direct %lo mem form
• andi $x,0xFF folded away in your output but present in the target → §1/I2 + §12 name the family; if the prescribed & 0xff at the use folds, hold the masked byte in a u16 local so only a QI->HI extend survives (P30 wave 2, byte-tested)
• slti where the target has sltiu (or vice versa) → §35 — a separate SIGNED int copy of an unsigned load keeps slti; chained bounds get range-folded, so write each bound as its own if/goto (§21)
• you are about to hand-derive a body that some overlay already matched → §71 — grep the callees/globals for an already-matched SIBLING first; in wave 2 this alone produced iteration-1 MATCHes on 4 of 19 targets
• gcc stole an instruction into a branch delay slot that the target leaves as nop → §5a + the zero-byte __asm__("") fence (§34 toolkit) — reorg.c stop_search_p halts the eager filler on an asm insn
• void vs s32 return — is promoting it byte-neutral? → NO, not always: §41d (byte-proven; a void body with no return gains an instruction). P30 adds a second mechanism: an s32 return keeps $v0 live-out and blocks dbr from filling a loop-back delay slot
• match_one says SIZE-MISMATCH/short and the target has a frame-pointer prologue (addu $fp,$sp,$zero / 21F0A003) → The target is -O0. Pass --o0 to match_one/rtu_match — nothing else will ever match (§116: opt level is a property of the FILE). Known -O0 regions: boot, ov_SC01_077_o0*, the whale _o0b, and 0x8013B568..0x8013C98C — a target outside all four still needs checking
• same instruction multiset, one contiguous window, loads/registers ROTATED inside it → pure sched1 statement-order (gcc-2.7.2-map/sched.md §S1/§S4). Cheapest lever: brute-force it — N independent statements, script all N! orders through match_one (24 runs ≈ 2 min) instead of reasoning about rank_for_schedule
• a two-constant if/else or ?: result lands in $v1 where the target reuses the condition's $v0 → §76 — fold the condition into a NAMED local and overwrite that SAME variable with the two constants (an s16 temp, a fresh temp, an inner scope, and both ternary polarities all stay $v1; only reusing one s32 local coalesces onto $v0). §76 reads as behemoth-only; it is not
• a load HOISTED above a store (match_one may call it a WIDTH class) → usually §76 regalloc, not a width bug: a missing WAR dependency lets sched2 hoist it. Same fix — one variable for the compare temp and the result
• ori $v0,0xffd8 in yours vs addiu $v0,-0x28 in the target → a NEGATIVE constant stored into an unsigned narrow local materialises via zero-extended ori; make the local signed to get addiu. It does NOT cost you the lhu on readback — gcc-2.7.2 emits lhu for any plain HImode load feeding an sh (P30 wave 4, byte-tested)
• LENGTH-DRIFT −1 and the missing instruction is a reg-to-reg COPY in a jal delay slot → a narrow prototyped param (plain ANSI s16 arg3) — §43 is indexed as the K&R-definition lever, but the ANSI form is the fix as often
• your narrow load lost its load-delay nop right after an inline block move → an lwl/lwr+swl/swr pair is a delay-slot SPONGE for the following load — the inverse of the §5a/§34 fence case. Align-1 4×u8 struct assign emits the inline form (§38 covers only the -O0 memcpy-call form)
• your e = param_1 copy VANISHED (target addresses every field off a copy at a join block) → cse.c make_regs_eqv keeps a param copy only when the new pseudo's live range escapes the cse block AND outlives the param's last mention — reach that by REUSING the same variable in a later block. Copy-in-the-arms gets hoisted into the delay slot; copy-assigned-in-an-arm goes global allocno → callee-saved + 2 prologue insns
• ⚠️ the .run/ghidra_c/<fn>.c seed looks like a DIFFERENT function entirely → it may be — overlays share VAs, so a seed can be decompiled from another overlay mapped at the same address. Trust the target .s, not the seed (P30 wave 4)

By symptom

delay slots & branches (46)

• §3-T4 — Branch polarity: invert the source condition to flip gcc's chosen branch _L90
• §5a — Cross-jump tail-merge — gcc collapses two byte-identical blocks the original kept separate (FIX FOUND) _L211
• §3-D. — THE CROSS-JUMP RATCHET (the sharpest new trap — func_80131340 L-C) _L3508
• §3-C. — Inner-block declaration does NOT delay slot allocation — BYTE-REFUTED _L10068
• §162 — CROSS-JUMP DIRECTION: the surviving copy is always the LATER one, so a BACKWARD j into a sibling arm is a source goto (P30 S48) _L11266
• §162 — The cross-jump "CALL veto" is a COUNT law, not a CALL law (BOUNDS §88a; P30 S48, func_80189540) _L11302
• §177 — 🔴 THE EPILOGUE RETURN-DELAY SLOT IS DECIDED BY YOUR SAVED-REGISTER SET, NOT BY SCHEDULING _L17169
• §176-A — "SCHEDULE / DELAY-SLOT / LENGTH-DRIFT ±1" ⇒ check STATEMENT ORDER around the call first _L17626
• §186 — CROSS-JUMPING RUNS AFTER SCHEDULING, SO NO C-LEVEL BARRIER CAN STEER IT _L18073
• §194-H — §164-29's WAR fence runs again at SCHED2 ON HARD REGISTERS: an in-place v &= K before a branch fences the store that reads v, and when TWO independent stores compete for the one delay slot the fence picks the winner at ZERO length drift (a WIDTH/sh!=sw swap, not a nop). Corrects §167-42's reconstruction (pseudo arm → hard-reg arm) and supplies its first re-runnable A/B. _L19292
• §194-M — A STORE in a CONDITIONAL branch's delay slot proves its C statement DOMINATES the branch — reorg can never pull a store out of either thread (gcc-2.7.2, -mips1) _L19551
• §195-D — §195 — masked_diff.mask_for returns 0 for EVERY j/jal word, so an internal j destination is invisible to match_one, the permuter scorer AND every similarity tier: a control-flow semantic error (which calls execute) surfaces as a 1-instruction residual mislabelled DELAY-SLOT / profile=schedule, or as an outright false MATCH _L19862
• §195-E — A 0/1 materialised at a JOIN immediately before the controlling beqz/bnez proves the source NAMED the condition — a truth expression in an if's controlling position reaches do_jump, which has no value path _L19930
• §195-F — fold-const.c:4825 canonicalises a ?: whose THEN arm is zero (or constant against a non-constant ELSE) by inverting the condition and swapping the arms — so a ternary's written arm order is byte-inert there, and c ? 0 : X is unspellable: it always compiles as !c ? X : 0 _L19988
• §195-G — §NEW — TWO ARMS CALLING THE SAME CALLEE MERGE INTO ONE jal UNLESS EACH ARM'S OWN CODE CONSUMES THE RESULT: the C dial that keeps two call sites apart is WHERE the consumer test lives, and the branch SENSE you spell it with is byte-inert (jump.c:1737 canonicalises it) _L20040
• §195-J — GTE / PsyQ op CALL-vs-INLINE is a PER-SITE SOURCE FACT, not a TU style — both forms coexist in one TU (measured in 2 TUs), and the tell is the target's own opcodes (lwc2/sqr/swc2 vs jal), not the sibling. Costs -8 ins on func_8018505C. Corollary: the game's inline sqr macro emits TWO hazard nops, the SDK's Square0 body emits ONE — so the inline form is provably not Square0 inlined (a second instance of §187's SDK-vs-game GTE nop divergence). _L20200
• §195-N — In a call-bearing chain of N≥2 if (f(...)) return 1; tests closed by return 0;, the LAST test must stay in STATEMENT form — the value form (return f() != 0; / ? 1 : 0 / !!f()) costs +1 j and empties the other N−1 delay slots. The cause is REORG block placement, not jump.c's delete_jump. _L20392
• §197-B — A REPEATED COMPARE OF ONE VALUE AGAINST ONE CONSTANT IS DELETED BY cse's qty_comparison_code CHANNEL (the non-EQ complement of §165-03) — and a front-end-opaque mask on EITHER compare is a pure-C dial that keeps the target's second branch _L20592
• §199-F — §164-36b — THE TARGET-HEAD FENCE IS A DELAY-SLOT THREAD SELECTOR, AND IT ONLY FIRES WHEN mostly_true_jump > 0 (amendment to §164-36; its "−1 instruction" tell is falsified) _L20952
• §199-G — At TWO case nodes the switch-vs-if oracle is not blind — but the tell is ALL tests positive + a trailing j default, NOT the first test's polarity _L21006
• §201-C — §X — A CALL'S OWN DELAY SLOT AND THE UPSTREAM CONDITIONAL BRANCH'S SLOT COMPETE FOR ONE INSN (the call's argument copy), AND ONE STATEMENT'S POSITION RELATIVE TO THE CALL DECIDES BOTH — the residual is visible at the BRANCH, not at the call _L21243
• §204-A — A COMPARE THAT APPEARS BOTH IN A BRANCH'S DELAY SLOT AND AGAIN ON THE FALL-THROUGH IS A JOIN WITH TWO INCOMING EDGES: THE TWO GUARDS ARE SEQUENTIAL ifs, NEVER if/else if _L21539
• §211 — HOIST THE LOOP INIT ABOVE THE DOMINATING GUARD: it fills the guard's delay slot AND flips the counter/pointer register pair (P31 S58) _L22347
• §221 — A CONSTANT SHARED BY TWO STORES DIES AT THE CALL WHOSE DELAY SLOT REFILLS ITS REGISTER (single observation — not yet cross-confirmed) (P31 S58) _L22734
• §223 — READING A jal DELAY SLOT: the value in it was produced BEFORE the call, so it is NEVER that call's return (P31 S58) _L22792
• §224 — CROSS-JUMP: WRITE THE DUPLICATE, AND READ A SHARED DELAY SLOT AS THE MERGE SIGNATURE (P31 S58) _L22854
• §232 — WHEN THE jr DELAY SLOT'S STORE STORES THE RETURN VALUE, TIE THEM WITH ONE PSEUDO (single observation — not yet cross-confirmed) (P31 S58) _L23136
• §243 — SPELL THE CSE BARRIER AS A REASSIGNED POINTER; AND THE nop-AFTER-EVERY-lh SIGNATURE (P31 S58b) _L23636
• §247 — TWO BRANCHES TO ONE LABEL MEANS THE SOURCE CONDITION IS NEGATED (P31 S58b) _L23788
• §224 — addendum (P31 S58b) — CROSS-JUMP MERGES CALLS, AND THE DELAY SLOT IS THE DISCRIMINATOR _L24475
• §263 — A STOLEN DELAY SLOT WHOSE INSTRUCTION IS AN ARG-REGISTER COPY IS AN ARITY ERROR, NOT A SCHEDULE (P31 S59, byte-proven) _L24842
• ADD-4 — → §225-3/-4 addendum — THE MIRROR ROW: VALUE-RETURN IN THE TAKEN ARM + TRAILING BARE return 0 _L25071
• ADD-5 — → §1/I1 addendum — THE INVERTED RANGE TEST: (u32)(x-lo) >= N WITH THE ZERO-ARM AS THE TRAILING else _L25085
• ADD-5 — → §267-ADD-6 / §172b-1 addendum — THE SIGN-TEST FACE: (s16)v < 0 IS sll 16 + bgez ON THE SHIFTED COPY, RAW STAYS LIVE — AND THE HALFWORD-ABS SHAPE NEEDS NO RITUAL _L25323
• ADDENDUM — to §224 — CROSS-JUMP: THE DUPLICATE CAN BE A PLAIN STORE, NOT ONLY A CALL _L25916
• ADDENDUM — to §172a — RE-READING MEMORY (NOT NAMING A TEMP) IS WHAT KEEPS AN INCREMENT'S DELAY-SLOT FILL ALIVE _L26216
• ADDENDUM — to §225 / §256 — A GOTO TO A SHARED SET-POINT PREVENTS IF-CONVERSION FROM COLLAPSING A LATER BRANCH TEST _L26247
• §277 — RETURN-TAIL C SPELLING PICKS THE DELAY-SLOT-FILL vs TRAILING-MOVE TOPOLOGY, AND A NARROWER SECOND VARIABLE KEEPS TWO PSEUDOS INSTEAD OF ONE (P31 S60; func_801846F0 ov_SC03_104, func_801A44C4 md_SC07_004, both byte-proven) _L26473
• ADDENDUM — to §22 (volatile-qualified-global reload lever, cookbook ~L1922) — for a NON-constant, same-address double RMW, a plain memory clobber beats volatile, and volatile actively breaks a delay-slot fill _L27138
• ADDENDUM — to §220 — REFERENCING THE RAW PARAMETER (NO NAMED COPY, NOT EVEN A PIN) LETS THE CALLEE-SAVED SPILL LAND IN THE FIRST CALL'S OWN DELAY SLOT _L27392
• ADDENDUM — to §252 — a >=0/<0 split on an unconditionally-decremented value needs the POSTFIX operator INSIDE the branch condition, not a prior statement _L27450
• ADDENDUM — to §20's cross-jump EXPLOIT bullet (func_8017E360, ov_SC05_007 — wave dg) _L27744
• ADDENDUM — §NNN — sharpens §55a / §164-37 / §165-28 (switch-vs-tree cluster): A SHAPE THAT LOOKS LIKE A SWITCH DISPATCH CAN BE PLAIN NESTED ifs WHOSE SHARED BODY WAS TRIPLICATED BY THE SOURCE AND THEN CROSS-JUMP-MERGED BACK DOWN _L28135
• §285 — PRE-INITIALIZING A VARIABLE WITH A SHARED CONSTANT BEFORE A BRANCH MAKES BOTH ARMS OF THE FOLLOWING if/else DESTRUCTIVELY REUSE THE SAME DESTINATION REGISTER FOR THEIR BITWISE RESULT (byte-proven; func_801811F0, ov_SC03_102, independently rediscovered across waves di/dj) (P31 S60; waves #, byte-proven) _L28990
• §286 — FOLD A STATEMENT'S SIDE EFFECT INTO A COMMA-EXPRESSION IN AN ARGUMENT POSITION TO PLACE ITS RTL RELATIVE TO A CALL'S OWN DELAY SLOT (P31 S60/dj; func_80180A88, ov_SC06_010, byte-proven 411/411) (P31 S60; waves #, byte-proven) _L28994
• §291 — THE DELAY-SLOT FALSE-VALUE: A CONDITIONAL BRANCH'S ZERO ARM MUST BE A FALL-THROUGH-ADJACENT BLOCK ENDING IN AN EXPLICIT JUMP, OR REORG CANNOT MATERIALIZE IT INSIDE THE BRANCH'S OWN DELAY SLOT (P31 S60; waves #, byte-proven) _L29014

instruction scheduling (55)

• §3-T2 — Source statement order drives instruction scheduling _L78
• §3 — When a diff is pure scheduling → decomp-permuter (harness built, Phase 6) _L107
• §10 — Closing the regalloc/scheduling hard tail by hand (LZSS, Phase 7 session F — the full close) _L835
• §25 — The "schedule" class is mostly COALESCING (pin-crackable), not scheduling; + the gate two-stage + h_exact over-counts ×134 (Phase 21, cont.6) _L2132
• §3-The — crack: the residual was gcc-2.7.2 COPY-COALESCING, not the instruction scheduler _L2144
• §3-The — genuine scheduler — rank_for_schedule (sched.c), for when it IS scheduling _L2160
• §3-The — genuine schedule WALLS (do NOT re-grind — stub) _L2169
• §32 — The region-a CAMERA-GIANT idiom set: struct-base hoisting + 4 sibling levers (Phase 24 T7, Fable5-cracked on func_80129CF8 191 ins, match_one MATCH; transferable to the 6 sibling giants) _L2422
• §34 — The func_80138ED0 giant crack: gcc-2.7.2's 3-qty sort bug + the zero-byte asm allocation toolkit + the giv-init fence (Phase 24 T5; Opus→close=21, Fable5→MATCH ×134) _L2454
• §35 — The region-a sibling-giant harvest: difficulty ≠ $s-reg count (it's global-array hoisting) + the banking recipe + new loop idioms (Phase 24 T7, 5 parallel Opus-Max agents) _L2471
• §3-A4 — SINK THE CONSUMER CALL INTO THE ARMS (the inverse of A1; func_8016AB6C, byte-proven) _L3444
• §49 — The LUID DIAL: a zero-byte SCHEDULING dial (the sched.c analogue of §47) — func_8017A4AC (536 ins ×134), Phase 26 session 8 _L3527
• §66d-5 — residual_class's "structural ⇒ permuter CPU is waste" is WRONG for schedule permutations (measured, Phase 29 SESSION-18) _L5491
• §3-The — attribution primitive (use this before calling anything a scheduling residual) _L6057
• §3-The — scheduling rules (refining §135-2 and §135-4) _L8912
• Consequence — for the family (a real scheduling decision) _L10095
• §148 — The loop.c hoisting THRESHOLD is arithmetic you can compute, and the ?: clamp that folds to MIN_EXPR (P30 S42, func_8017C6F4, 947 ins) _L10145
• §3-A. — move_movables hoists iff threshold × savings × lifetime ≥ insn_count — and you can read it _L10151
• §16Z — SHARPENS (sharpens §37 "the /s-DEP LATTICE", §136-13, §136-14, §16Xy, §162q, gcc-2.7.2-map/sched.md §64) _L14340
• §175 — A CALLER-SAVED REGISTER PIN CAN BE A CORRECTNESS BUG, NOT JUST A SCHEDULING CHOICE (P31 wave H, 2026-08-15) _L16722
• §177 — 🔴 THE EPILOGUE RETURN-DELAY SLOT IS DECIDED BY YOUR SAVED-REGISTER SET, NOT BY SCHEDULING _L17169
• §3-B. — A return <const> IS A PRIORITY-1 HARD-REG SET THE SCHEDULER PLACES FIRST (func_8001BE30, 92 ins) _L17254
• §176-A — "SCHEDULE / DELAY-SLOT / LENGTH-DRIFT ±1" ⇒ check STATEMENT ORDER around the call first _L17626
• §176-C — 🔴 WALL REFUTATION: a hard-register pin CANNOT schedule around a call, because of a genuine gcc-2.7.2 bug _L17690
• §186 — CROSS-JUMPING RUNS AFTER SCHEDULING, SO NO C-LEVEL BARRIER CAN STEER IT _L18073
• §193-C — gcc-2.7.2 cross_jump merges the SCHEDULED common SUFFIX only — there is no prefix/head merge, so §8/§48-A1's "duplicate into both arms and cross_jump refunds it" is a TAIL-only lever _L18528
• §193-D — A COMPILER-GENERATED ARGUMENT COPY IS A optimize_reg_copy_1 TRIGGER: when the pointer's LAST use in a block precedes a call that takes the pointer as a register, sched1 hoists the implicit move $aN,$sN to the block top and local-alloc re-bases the WHOLE block's memory operands onto $aN. The only C dial is a label (the §165-24 goto-join) between the block and the call. _L18562
• §193-F — §148-A2 — The threshold -= 3 STAIRCASE: move_movables admits a COUNT of invariants, not a boolean — two identical merged constants split hoisted/not-hoisted by LIST ORDER, and insn_count picks the rank cutoff _L18663
• §194-A — A zero-byte scheduling fence goes AFTER the defining statement to make that computation emit FIRST in its block — and the barrier predicate is volatile-or-colon-less, not the "memory" clobber (COMPLEMENTS §165-40; does not refute it) _L18931
• §194-D — Declared width of a computed-value local is a sched1 dial (count-neutral) — a replication + attribution correction of §165-17, NOT a new argument-register law _L19098
• §194-H — §164-29's WAR fence runs again at SCHED2 ON HARD REGISTERS: an in-place v &= K before a branch fences the store that reads v, and when TWO independent stores compete for the one delay slot the fence picks the winner at ZERO length drift (a WIDTH/sh!=sw swap, not a nop). Corrects §167-42's reconstruction (pseudo arm → hard-reg arm) and supplies its first re-runnable A/B. _L19292
• §194-K — Blind sched1's alias oracle with a second SET of a pointer pseudo — the first zero-byte, non-volatile, dependence-CREATING lever (corrects §167-05's "volatile is the only door"; fourth consumer of reg_n_sets) _L19425
• §194-N — §193-D's C dial is misstated: the lever is a SURVIVING CODE_LABEL (a label with a real incoming edge), not "a label between the block and the call" — a bare label, or a goto L; L: pair whose target is the next active insn, is deleted by jump1 (jump.c:663-669 → delete_insn → jump.c:3458-3461, and jump.c:243 for the bare case) long before sched1/local-alloc, and costs exactly zero bytes _L19606
• §195-D — §195 — masked_diff.mask_for returns 0 for EVERY j/jal word, so an internal j destination is invisible to match_one, the permuter scorer AND every similarity tier: a control-flow semantic error (which calls execute) surfaces as a 1-instruction residual mislabelled DELAY-SLOT / profile=schedule, or as an outright false MATCH _L19862
• §199-A — §189-A's asm→source inference is byte-FALSE: an interloper between a split constant's lui/ori is a SCHEDULE fact, not a source fact — and the separator is the BIRTHING BOOST, not a "priority floor" (§189-A's split-timing half survives; its "no statement order / no pin" absolute and the candidate's own forward-scheduler narrative both fall) _L20691
• §199-F — §164-36b — THE TARGET-HEAD FENCE IS A DELAY-SLOT THREAD SELECTOR, AND IT ONLY FIRES WHEN mostly_true_jump > 0 (amendment to §164-36; its "−1 instruction" tell is falsified) _L20952
• §205 — THE CHAINED ASSIGNMENT IS ITS OWN SCHEDULING DIAL: *b = *a = v; moves an argument copy that no local, no pin and no statement reorder will move (P31 S56) _L22030
• §211 — HOIST THE LOOP INIT ABOVE THE DOMINATING GUARD: it fills the guard's delay slot AND flips the counter/pointer register pair (P31 S58) _L22347
• §219 — COMPOUND +=, FULL ASSIGNMENT, AND AN EXPLICIT TEMP ARE THREE DIFFERENT SCHEDULES OF ONE READ-MODIFY-WRITE (P31 S58) _L22673
• §30 — addendum (P31 S58) — the /s grant closes a SCHEDULING residual and a REGISTER residual with one edit _L23172
• §165-40 — addendum (P31 S58) — the barrier goes at the COPY SITE, not inside the region it protects _L23204
• §239 — TWO-STATEMENT INTEGER-SPACE MATERIALISATION REORDERS la vs sll; AND THE PLUS-TREE OPERAND ORDER (P31 S58b) _L23516
• §243 — SPELL THE CSE BARRIER AS A REASSIGNED POINTER; AND THE nop-AFTER-EVERY-lh SIGNATURE (P31 S58b) _L23636
• §245 — THE CALL'S ARGUMENT LIST IS A SCHEDULING SLOT (P31 S58b) _L23701
• §211 — addendum (P31 S58b) — INIT PLACEMENT: FIVE MORE DIALS BEYOND THE GUARD HOIST _L24231
• §263 — A STOLEN DELAY SLOT WHOSE INSTRUCTION IS AN ARG-REGISTER COPY IS AN ARITY ERROR, NOT A SCHEDULE (P31 S59, byte-proven) _L24842
• ADD-8 — → §245 addendum — THE RE-TIE BARRIER PINS CALL-ARG SETUP TO SOURCE ORDER (construct 6) _L25115
• ADDENDUM — to §244 — THE COMPILER BARRIER, NOT volatile, BLOCKS A STORE→LOAD HOIST THROUGH A POINTER-OFFSET FIELD _L25981
• §281 — GROUP COPY-THEN-RMW BY OPERATION KIND, NOT FIELD BY FIELD: sched1 does the interleaving, the source must not (P31 S60; wave cf, func_80180FB4, ov_SC03_111, byte-proven) _L26902
• §NNN — A DEPENDENT COPY-THEN-RMW BLOCK MUST BE SOURCE-GROUPED BY OPERATION KIND, NOT BY FIELD, AND SCHED1 DOES THE INTERLEAVING (P31 S60; func_80180FB4, ov_SC03_111, byte-proven) _L26903
• §282 — gcc's OWN LOOP REVERSAL PUTS THE COUNTER INIT AFTER THE HOISTED MOVABLES — a position no hand-written down-count can reach (P31 S60; wave cf, func_80180DD8, ov_SC04_005, byte-proven) _L26948
• §NNN — WRITE THE UP-COUNT LOOP: gcc's OWN REVERSAL PRODUCES A COUNTER-INIT INSTRUCTION THAT LANDS AFTER HOISTED MOVABLES, WHICH A HAND-WRITTEN DOWN-COUNT LOOP CANNOT REPRODUCE (P31 S60; func_80180DD8, ov_SC04_005, byte-proven) _L26949
• ADDENDUM — to §195-N — a GNU statement-expression slider must sit INSIDE the conditional arm's value position, not as a post-hoc barrier, to block the store-flag transform on a ternary chain _L27219
• ADDENDUM — §NNN — sharpens §167-13's boundary: CHAINING TWO IDENTICAL SIDE-BY-SIDE STORES INTO ONE C ASSIGNMENT STATEMENT IS A MID-BLOCK SCHEDULING-PRIORITY DIAL, NOT ONLY A STORE-ORDER SPELLING _L28172
• §284 — COMBINE CAN REASSOCIATE TWO SEQUENTIAL BITWISE-AND MASKS INTO ONE AGAINST THE PRE-MASK VALUE; AN ASM IN/OUT FENCE RIGHT AFTER THE FIRST MASK BLOCKS IT (P31, wave dd, func_8018087C, ov_SC04_020, byte-proven) (P31 S60; waves #, byte-proven) _L28986

register allocation & pins (100)

• §10 — Closing the regalloc/scheduling hard tail by hand (LZSS, Phase 7 session F — the full close) _L835
• Residual — A — commutative |/&/+ result lands in the wrong source-operand register _L856
• Register-allocation — ORDER (call-crossing $s0/$s1 swap) → FORCE it with register pins (byte-proven) _L1384
• §3-The — LOOSE-TYPING wall is real for narrow params (Phase 16, reconfirmed) _L1428
• §3-THE — CAP: at this tail the match_one→gate gap is the LOOSE-TYPING CALL-GRAPH wall (not cheap plumbing) _L1637
• §22 — DEF-side loose-typing recovery + grinder blacklist (Phase 21) _L2005
• §24 — The ov_SC01_077_a.c split-file vein: split-aware propagation, but loose-typing-gated (Phase 21) _L2085
• §25 — The "schedule" class is mostly COALESCING (pin-crackable), not scheduling; + the gate two-stage + h_exact over-counts ×134 (Phase 21, cont.6) _L2132
• §42 — The F-band ≤28 regalloc crack wave: register-pin/DENSITY levers beat the permuter (Phase 25 T7 F-band, 2026-07-10; Ultracode 9-worker wave, 4/9 banked byte-identical, 266 swept ×134) _L2900
• §43 — The K&R s16-param definition DISSOLVES the "narrow-param wall" for by-value register args (Phase 25 task A, Fable5 crack of the 369-ins giant func_80166994 ×134, 2026-07-11) _L3195
• §45 — The flagship func_80133CD4 crack (399 ins ×134): the merged-variable permutation-breaker + the 1-death local-alloc gate (Phase 25 task A giant escalation, Fable5 gdb-on-cc1, 2026-07-11) _L3298
• §47 — The live-length SLIDER: splitting a global.c allocno-priority TIE with one zero-byte asm (Phase 26 session 8, Fable5 Max, byte-proven on func_8017BEBC 952 ins ×113) _L3365
• §48 — The 12-core jr crack wave: the ALLOCNO-PRICING dials and the EBB rule (Phase 26 session 8, Ultracode, 9/12 MATCH first pass) _L3405
• §3-A. — ALLOCNO-PRICING DIALS — move a value into the register you want, byte-neutrally _L3413
• §52 — The WALKER-FAMILY skeleton: 6 regalloc-order levers + a deeply-characterized intrinsic wall (func_80178004, 165 ins ×134; Phase 26, Fable5, 2026-07-15) _L3913
• §52a — The regalloc sibling wave: new levers + two new wall classes (cheap-Opus applying §52, 2026-07-15) _L3959
• §52b — Sibling wave 2: more de-pin levers, a third wall class, and the match_one→whole-binary gap at scale (2026-07-15) _L3997
• §66d-1 — What transfers between giants is the LOOP, not the PIN _L5280
• §70 — The giv-init base register: walk the PARAMETER, not a copy of it (Phase 29 SESSION-18, func_801777BC) _L5619
• §71 — Before mapping a giant, look for an already-matched SIBLING beside it (Phase 29 SESSION-18, func_8017D960, 3,338 ins) _L5660
• §72 — A register __asm__ pin is a PREFERENCE, not a reservation (Phase 29 SESSION-18, func_8017F510) _L5726
• §74 — Auditing a pinned draft: the §72 hazard is CALLER-SAVED pins spanning a call, and only the disassembly can tell you (Phase 29 SESSION-19, func_8017D960 b2, 5 pins) _L5822
• §76 — The allocno CLASS (local vs global) is the dominant regalloc lever, and C reaches it ONLY through declaration scope and variable reuse (Phase 29 SESSION-19, behemoth #3 func_8017F510 1,511 ins, 97 → MATCH, pin-free) _L6028
• §78 — A LENGTH drift can be a register grant in disguise; and fold never leaves a literal first in an | chain (Phase 29 SESSION-19, behemoth #2 func_8017D960 3,338 ins, 1806 → 0, pin-free) _L6174
• §76 — confirmed at scale, and a pin nuance _L6251
• §80 — A do-not-re-buy entry is scoped to its BASE, not to the function; and the pin's hidden cost is an unconditional qty_phys_sugg (Phase 29 SESSION-19, func_8017BF14 45 → 0) _L6270
• §3-The — pin's hidden cost, with the citation _L6291
• §83 — The parameterised-repeat law, the spill-area trap, and why a per-case edit cannot move a per-case symptom (Phase 29 SESSION-20, func_80183814 5,122 ins, cold-ish start → 36 structural / 99.3%) _L6412
• §83c — TRAP: a "dead local" in a prior draft may be gcc's OWN spill area _L6445
• §86 — Pinned-exemplar templatability is a PER-FAMILY property, not a per-member rate; and the §42e pin guard is now over-conservative (Phase 29 SESSION-20) _L6589
• §3-Two — further notes worth keeping _L8248
• §137 — REGALLOC-PERM is a TWO-COMPILE ARITHMETIC PROBLEM, not a permuter job _L9344
• §3-The — same swallow, twice more, in the integration spine _L9709
• §3-B. — A ?: on MEMORY operands costs ~16 bytes of invisible frame; on REGISTER operands, zero _L10057
• §3-D. — A lone $t8/$t9 in the target is RELOAD SCRATCH — reproduce the spill, don't pin the register _L10073
• §3-C. — A zero-byte ALLOCNO-PRIORITY slider _L10184
• §150 — A register ROTATION across symmetric blocks is VARIABLE-IDENTITY evidence, not an allocator tie (P30 S43, func_8017C6F4, 947 ins ×4) _L10312
• §152 — BYTE SIZE is the family key that name- and h_seq-grouping both miss (P30 S43, the 0xECC family: 1 crack → 12 overlays → 11,364 ins) _L10418
• §155 — hi/lo literal scanning MUST track base registers (S45) _L10558
• §158 — The RANGE-EXTENDER: a fourth zero-emission asm lever completes the allocno toolkit (P30 S46 tier-3, func_8017CE58, 733 ins) _L10712
• Bonus — facts worth keeping _L10757
• §156 — THE PREFERENCE-DONOR MERGE: cross-region variable reuse is what fills a0-a3, and a call-arg use in ONE region steers the fill in ALL of them (P30 S46 tier-3, func_80186E24, 611 ins: 236-off "S11 regalloc-order" → MATCH, zero new pins) _L10772
• §175 — A CALLER-SAVED REGISTER PIN CAN BE A CORRECTNESS BUG, NOT JUST A SCHEDULING CHOICE (P31 wave H, 2026-08-15) _L16722
• §176j — STOPPING A WAVE MID-FLIGHT COSTS THE IN-FLIGHT TAIL (and how much is recoverable) _L17106
• §177 — 🔴 THE EPILOGUE RETURN-DELAY SLOT IS DECIDED BY YOUR SAVED-REGISTER SET, NOT BY SCHEDULING _L17169
• §179-A — 🔴 A LOOP-WALKED POINTER PARAMETER HANDS ITS ARGUMENT REGISTER TO THE GIV (9 byte-proofs) _L17323
• §179-F — PINNING A LOOP-WALKED POINTER IS A TOTAL OFF-SWITCH FOR STRENGTH REDUCTION _L17519
• §179-G — 🟡 A PIN CAN CREATE A COMBINE LOG_LINK AND DELETE AN andi (sixth RC-5 channel, n=1) _L17542
• §176 — SEVEN LEVERS FROM THE P31 OVERNIGHT WAVES (2026-08-15): statement order, false regalloc, and the pin that fights back _L17620
• §176-B — "REGALLOC-PERM, 1-4 instructions off" ⇒ it is usually NOT register allocation _L17650
• §176-C — 🔴 WALL REFUTATION: a hard-register pin CANNOT schedule around a call, because of a genuine gcc-2.7.2 bug _L17690
• §3-18 — of 20 reconciled while keeping the match. The two that did not are mechanism, not effort. _L17943
• §186 — CROSS-JUMPING RUNS AFTER SCHEDULING, SO NO C-LEVEL BARRIER CAN STEER IT _L18073
• §186c — WHERE A VALUE IS LOADED DECIDES WHICH ALLOCATOR OWNS IT, AND THEREFORE ITS REGISTER _L18102
• §193-B — A NARROW CAST OF A WIDE PARAMETER COSTS ONE EXTRA INSTRUCTION WHEN ITS STATEMENT SITS AFTER AN INTERVENING jal — AND THE DECIDER IS combine.c:929's CROSS-CALL GUARD, NOT REGISTER ALLOCATION _L18490
• §193-D — A COMPILER-GENERATED ARGUMENT COPY IS A optimize_reg_copy_1 TRIGGER: when the pointer's LAST use in a block precedes a call that takes the pointer as a register, sched1 hoists the implicit move $aN,$sN to the block top and local-alloc re-bases the WHOLE block's memory operands onto $aN. The only C dial is a label (the §165-24 goto-join) between the block and the call. _L18562
• §194-B — A addu $rA,$rB,$zero copy feeding ≥2 sh stores is a SECOND, 16-BIT-DECLARED local — the width, not the clamp or the join liveness, is what keeps the copy (and func_80183094's pin + "memory" clobber are both provably inert) _L18997
• §194-C — A CALLER-SAVED loop counter proves its live range crosses ZERO calls — so it cannot share a pseudo with any value LIVE ACROSS a call (but it may freely share one with values that merely sit between calls) _L19035
• §194-D — Declared width of a computed-value local is a sched1 dial (count-neutral) — a replication + attribution correction of §165-17, NOT a new argument-register law _L19098
• §194-G — Reading the integer half of a 16.16 stack aggregate: REGISTER-LIVENESS, not the C spelling, decides sra vs lhu — and the break is count-neutral _L19249
• §194-H — §164-29's WAR fence runs again at SCHED2 ON HARD REGISTERS: an in-place v &= K before a branch fences the store that reads v, and when TWO independent stores compete for the one delay slot the fence picks the winner at ZERO length drift (a WIDTH/sh!=sw swap, not a nop). Corrects §167-42's reconstruction (pseudo arm → hard-reg arm) and supplies its first re-runnable A/B. _L19292
• §194-N — §193-D's C dial is misstated: the lever is a SURVIVING CODE_LABEL (a label with a real incoming edge), not "a label between the block and the call" — a bare label, or a goto L; L: pair whose target is the next active insn, is deleted by jump1 (jump.c:663-669 → delete_insn → jump.c:3458-3461, and jump.c:243 for the bare case) long before sched1/local-alloc, and costs exactly zero bytes _L19606
• §195-B — A CALL_INSN does not start a basic block in gcc-2.7.2 — so a call-crossing temp can be a LOCAL-alloc quantity (the missing precondition under §48-A2 / §52 / regalloc.md K8) _L19772
• §195-F — fold-const.c:4825 canonicalises a ?: whose THEN arm is zero (or constant against a non-constant ELSE) by inverting the condition and swapping the arms — so a ternary's written arm order is byte-inert there, and c ? 0 : X is unspellable: it always compiles as !c ? X : 0 _L19988
• §197-C — Fix A1 (operand order) cannot move a commutative destination whose .greg conflict set already contains BOTH operand hard registers — split the accumulate so the destination IS the load's pseudo _L20620
• §199-A — §189-A's asm→source inference is byte-FALSE: an interloper between a split constant's lui/ori is a SCHEDULE fact, not a source fact — and the separator is the BIRTHING BOOST, not a "priority floor" (§189-A's split-timing half survives; its "no statement order / no pin" absolute and the candidate's own forward-scheduler narrative both fall) _L20691
• §199-B — A permutation sweep that holds ANY statement fixed is not a sweep: the statement an agent pins as "obviously load-bearing" is the one carrying the signal, and the partial sweep returns a FLAT residual that reads as proof of order-invariance _L20740
• §199-E — §189-A BOUNDED AND CORRECTED — the discriminator is INSN_PRIORITY, not "is the interloper a constant": an insn between a lui/ori pair proves NOTHING about the source spelling unless it TIES the ori on priority, and on the pinned -mcpu=3000 triple a dependent load never does _L20893
• §205 — THE CHAINED ASSIGNMENT IS ITS OWN SCHEDULING DIAL: *b = *a = v; moves an argument copy that no local, no pin and no statement reorder will move (P31 S56) _L22030
• §208 — TWO NAMED LOCALS FOR ONE RELOADED EXPRESSION BUY TWO ALLOCNOS — the naming granularity owns the REGISTER SPLIT, not just the load count (P31 S58) _L22175
• §211 — HOIST THE LOOP INIT ABOVE THE DOMINATING GUARD: it fills the guard's delay slot AND flips the counter/pointer register pair (P31 S58) _L22347
• §215 — PIN ECONOMY: the twin's pins are NOT part of the shape, and §17's "pin every call-crossing value" is over-broad (P31 S58) _L22522
• §220 — THE PARAMETER ITSELF IS A REGALLOC DIAL: use it directly, prefer s32 to void*, and place the save-copy AFTER the first call (P31 S58) _L22700
• §221 — A CONSTANT SHARED BY TWO STORES DIES AT THE CALL WHOSE DELAY SLOT REFILLS ITS REGISTER (single observation — not yet cross-confirmed) (P31 S58) _L22734
• §30 — addendum (P31 S58) — the /s grant closes a SCHEDULING residual and a REGISTER residual with one edit _L23172
• §244 — volatile IS A COUNTING INSTRUMENT, A STORE-ORDER PIN, AND MUST SOMETIMES BE ASYMMETRIC (P31 S58b) _L23666
• §248 — SPLIT THE LOAD FROM THE ARITHMETIC: A FUSED g + K DENIES THE CALLEE-SAVED REGISTER ITS DIRECT HOME (P31 S58b) _L23822
• §253 — POSTFIX ++ vs += 1 PICKS A DIFFERENT SCRATCH REGISTER (single observation — not yet cross-confirmed) (P31 S58b) _L23968
• §254 — THE DEAD PARAMETER IS A REGISTER-PLACEMENT TOOL (single observation — not yet cross-confirmed) (P31 S58b) _L23982
• §215 — addendum (P31 S58b) — PIN ECONOMY, PART 2: NINE REFINEMENTS _L24339
• §223 — addendum (P31 S58b) — FIVE MORE CONFIRMATIONS, AND THE CONSTANT-IN-$v0 CASE _L24451
• §263 — A STOLEN DELAY SLOT WHOSE INSTRUCTION IS AN ARG-REGISTER COPY IS AN ARITY ERROR, NOT A SCHEDULE (P31 S59, byte-proven) _L24842
• ADD-8 — → §245 addendum — THE RE-TIE BARRIER PINS CALL-ARG SETUP TO SOURCE ORDER (construct 6) _L25115
• §268 — A register __asm__ PIN ON A CALL-CLOBBERED REGISTER IS HONORED EXACTLY WHEN THE PINNED RANGE CROSSES NO CALL (P31 S59c; three A/B'd cards, unifying §257-2's two) _L25197
• ADD-6 — → §220-addendum — THE FOURTH FACE: WHEN THE NAMED COPY ITSELF BUYS THE EXTRA CALLEE-SAVED, PIN THE COPY TO $16 _L25339
• ADD-7 — → §229 addendum — THE VALUE FACE: A LOOP-STORE CONSTANT SPELLED AS A LITERAL HAS NO SOURCE POSITION; NAME IT TO PIN THE PROLOGUE INIT ORDER _L25355
• ADDENDUM — to §82 — struct copies must stay MEMBER-WISE, not block-moved, to match a spill-slot save _L25655
• ADDENDUM — to §136d-1 (RC-12, the $0-add / opaque-copy family) — two symptoms beyond "compare reads the wrong register" _L25693
• ADDENDUM — to §164-64 — AN EMPTY CLOBBER ON AN ARGUMENT REGISTER CAN BE THE DELIBERATE FIX, NOT JUST THE ACCIDENTAL BUG _L25950
• §275 — THE LEFTOVER-REGISTER READ _L26324
• §NNN — A DO-WHILE'S GUARD AND LATCH MUST REPEAT THE SAME BOUND EXPRESSION, NOT SHARE ONE LOCAL: THE REPETITION IS WHAT BUYS THE CSE'D COPY INTO A SECOND REGISTER (P31 S60; func_8017F2A4, ov_SC03_096, byte-proven 25/25) _L26835
• ADDENDUM — to §176-B2 — in a micro-function with no long/short lifetime asymmetry, BOTH contending pseudos need their own hard-register pin _L27276
• ADDENDUM — to §220 — REFERENCING THE RAW PARAMETER (NO NAMED COPY, NOT EVEN A PIN) LETS THE CALLEE-SAVED SPILL LAND IN THE FIRST CALL'S OWN DELAY SLOT _L27392
• ADDENDUM — to §215 — FIFTH SHAPE: reused mask constants across two call-free merge sites each get their own whole-function hard-register pin, and a shared sub-expression at the second site must be its own statement _L27477
• ADDENDUM — to §194-B (func_8017EB34, ov_SC03_117 — wave dk; distinct from the §74 co-pinning finding on the SAME function below) _L27885
• ADDENDUM — §NNN — sharpens §162a3/§60b: A sll $v0,16 / sltiu $v0,1 ZERO-TEST OF A JUST-DECREMENTED HALFWORD IS A SIGNED-TEMP WIDTH TELL OUTSIDE ANY SWITCH/RANGE-TEST CONTEXT _L28205
• §285 — PRE-INITIALIZING A VARIABLE WITH A SHARED CONSTANT BEFORE A BRANCH MAKES BOTH ARMS OF THE FOLLOWING if/else DESTRUCTIVELY REUSE THE SAME DESTINATION REGISTER FOR THEIR BITWISE RESULT (byte-proven; func_801811F0, ov_SC03_102, independently rediscovered across waves di/dj) (P31 S60; waves #, byte-proven) _L28990
• §287 — A STACK-FRAME HOLE BELOW TWO ADDRESS-TAKEN AGGREGATE LOCALS IS A LEADING PAD MEMBER OF ONE COMBINED STRUCT, NOT SEPARATE LOCALS OR A REGISTER PIN (P31 S60/dj; func_8017D104, ov_SC06_027, byte-proven 47/47) (P31 S60; waves #, byte-proven) _L28998
• §288 — A REGISTER PIN DECLARED UNINITIALIZED AND ASSIGNED ONLY AT ITS LATE, SOLE USE STILL FORCES THE FIXED REGISTER'S SAVE/RESTORE, AND THE ASSIGNMENT'S SOURCE POSITION CONTROLS WHERE THE VALUE MATERIALIZES (P31; func_80186530, ov_SC02_017, byte-proven, match_one MATCH re-verified) (P31 S60; waves #, byte-proven) _L29002
• §290 — A SINGLE STRENGTH-REDUCED GIV CAN DRIVE STORES TO SEVERAL DISTINCT RELOCATABLE SYMBOLS, EACH KEEPING ITS OWN %hi/%lo ANCHOR (P31 S60; waves #, byte-proven) _L29010

CSE / redundancy / rematerialization (26)

• §46 — The func_80178D40 crack (890 ins ×134, the heaviest core in the game): four LOOP-STRUCTURE levers cheap-Opus found by reading loop.c/jump.c/cse.c (Phase 26 session 8, 2026-07-13) _L3313
• §83d — CSE's quantity budget is WHOLE-FUNCTION, so a local rewrite cannot fix a local symptom _L6452
• §153 — THE ADDRESS-REMATERIALISATION LAUNDER: a third zero-emission asm lever (P30 S43, func_8018D98C, 710 ins) _L10466
• §176-D — CSE-class levers used in reverse (two sharpenings of §153 and cse_expr §2) _L17716
• §193-E — A varying-address (pointer) load is re-emitted once per CSE-LIVE INTERVAL, and naming it in a C local is the only C-level lever over that count — no store SPELLING has any reach _L18633
• §193-F — §148-A2 — The threshold -= 3 STAIRCASE: move_movables admits a COUNT of invariants, not a boolean — two identical merged constants split hoisted/not-hoisted by LIST ORDER, and insn_count picks the rank cutoff _L18663
• §193-H — A pointer-derived base load *(s32*)(p+K) is uncacheable across ANY memory write or call (cse's third kill disjunct) — so the target emits one lw per store-separated RUN of spellings, and a run of stores sharing one lw is a C local you must declare _L18788
• §194-A — A zero-byte scheduling fence goes AFTER the defining statement to make that computation emit FIRST in its block — and the barrier predicate is volatile-or-colon-less, not the "memory" clobber (COMPLEMENTS §165-40; does not refute it) _L18931
• §194-J — Back-to-back identical stores: flow.c's last_mem_set deletes the first, and only volatile saves it _L19373
• §194-K — Blind sched1's alias oracle with a second SET of a pointer pseudo — the first zero-byte, non-volatile, dependence-CREATING lever (corrects §167-05's "volatile is the only door"; fourth consumer of reg_n_sets) _L19425
• §195-H — §165-27g — ON A FIXED-SYMBOL GLOBAL, extern T D[]; + D[0] IS THE CSE RELOAD DIAL, AT ZERO ADDRESSING COST, AND THE ELEMENT COUNT IS INERT (§165-27's T v[2] CAVEAT IS A LOCAL-FRAME FACT AND DOES NOT TRANSFER) _L20088
• §195-I — §145(b) AMENDED — the pointer-bump addiu is saved by cse, not combine: ANY second SET of a pseudo in the address's equivalence chain (in-place p += K, §145(b)'s p = r; copy, or an asm re-tie) kills the fold; the pass is cse and the gate is invalidate's reg_tick++ _L20135
• §195-L — The cse store-re-seed does not cross a JOIN LABEL: per-arm stores + a join read keep the reload that one join store deletes (bounds §193-E BOUND 1/BOUND 3 with §48-B's EBB boundary) _L20296
• §197-A — A NARROW SIGNED MEMORY READ FEEDING A CONSTANT >> LOSES ITS lh, AND THE CURE IS AN ASM RE-TIE (attribution CONTESTED: cse vs combine) _L20554
• §197-B — A REPEATED COMPARE OF ONE VALUE AGAINST ONE CONSTANT IS DELETED BY cse's qty_comparison_code CHANNEL (the non-EQ complement of §165-03) — and a front-end-opaque mask on EITHER compare is a pure-C dial that keeps the target's second branch _L20592
• §199-D — A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is the WIDTH of a real object, and a widening (s32) cast is inert — AMENDS §35 (whose stated "only CSE-reuse canonicalizes" mechanism is byte-wrong) and does NOT apply inside a switch _L20833
• §201-E — §194-J-2 — The last_mem_set deletion window is measured in SOURCE/expand order, not in the printed stream; a foreign store moved between the pair in C source is a real lever, and volatile is not always the better one _L21341
• §204-D — A LOOP-INVARIANT LOAD IS ADMITTED AS A MOVABLE ONLY IF ITS ADDRESS CANNOT TRAP: local.field PASSES, THE SAME READ THROUGH A POINTER LOCAL IS REFUSED _L21736
• §243 — SPELL THE CSE BARRIER AS A REASSIGNED POINTER; AND THE nop-AFTER-EVERY-lh SIGNATURE (P31 S58b) _L23636
• §244 — volatile IS A COUNTING INSTRUMENT, A STORE-ORDER PIN, AND MUST SOMETIMES BE ASYMMETRIC (P31 S58b) _L23666
• ADD-1 — → §257-8 addendum — THE INTERPOSED ASM'S __volatile__ IS A PER-SHAPE DIAL, AND THE "NO-OUTPUT ASM IS IMPLICITLY VOLATILE" LORE IS BYTE-FALSE IN gcc-2.7.2 _L25266
• ADDENDUM — to §244 — THE COMPILER BARRIER, NOT volatile, BLOCKS A STORE→LOAD HOIST THROUGH A POINTER-OFFSET FIELD _L25981
• ADDENDUM — to §211 — AN IN-LOOP ACCUMULATOR WANTS A CLOSED-FORM EXPRESSION WHEN THE TARGET REMATERIALISES ITS CONSTANT AFTER EVERY CALL _L26289
• §276 — MIXED ADDRESS-EXPRESSION SPELLING FOR ADJACENT RELOCATABLE SYMBOLS IS A CSE-UNIFICATION DIAL, NOT JUST A BYTE-ENCODING CHOICE (P31 S60; func_80180FE8, ov_SC06_006, byte-proven) _L26364
• §NNN — A DO-WHILE'S GUARD AND LATCH MUST REPEAT THE SAME BOUND EXPRESSION, NOT SHARE ONE LOCAL: THE REPETITION IS WHAT BUYS THE CSE'D COPY INTO A SECOND REGISTER (P31 S60; func_8017F2A4, ov_SC03_096, byte-proven 25/25) _L26835
• ADDENDUM — to §22 (volatile-qualified-global reload lever, cookbook ~L1922) — for a NON-constant, same-address double RMW, a plain memory clobber beats volatile, and volatile actively breaks a delay-slot fill _L27138

loops & induction variables (28)

• §3-T1 — Loop pointer: top-of-body for addu induction, not constant-folded addiu _L71
• §34 — The func_80138ED0 giant crack: gcc-2.7.2's 3-qty sort bug + the zero-byte asm allocation toolkit + the giv-init fence (Phase 24 T5; Opus→close=21, Fable5→MATCH ×134) _L2454
• §35 — The region-a sibling-giant harvest: difficulty ≠ $s-reg count (it's global-array hoisting) + the banking recipe + new loop idioms (Phase 24 T7, 5 parallel Opus-Max agents) _L2471
• §46 — The func_80178D40 crack (890 ins ×134, the heaviest core in the game): four LOOP-STRUCTURE levers cheap-Opus found by reading loop.c/jump.c/cse.c (Phase 26 session 8, 2026-07-13) _L3313
• §66d — The permuter⇄reader loop: alternate a random search with a byte-verified idiom, and let residual_class decide whose turn it is (Phase 29 SESSION-17) _L5245
• §66d-1 — What transfers between giants is the LOOP, not the PIN _L5280
• §70 — The giv-init base register: walk the PARAMETER, not a copy of it (Phase 29 SESSION-18, func_801777BC) _L5619
• §145 — Three loop/combine levers from the S40 wave-2 drafters (16/16 match_one) _L9927
• §148 — The loop.c hoisting THRESHOLD is arithmetic you can compute, and the ?: clamp that folds to MIN_EXPR (P30 S42, func_8017C6F4, 947 ins) _L10145
• §171a — THE MECHANICAL A-PROP DRAFT (P30 S50): 256 members banked with no agent in the loop _L16420
• §179-A — 🔴 A LOOP-WALKED POINTER PARAMETER HANDS ITS ARGUMENT REGISTER TO THE GIV (9 byte-proofs) _L17323
• §179-E — A >2*MAX_MOVE_BYTES BLOCK COPY IS A STRUCT ASSIGNMENT, NOT A HAND LOOP _L17493
• §179-F — PINNING A LOOP-WALKED POINTER IS A TOTAL OFF-SWITCH FOR STRENGTH REDUCTION _L17519
• §194-C — A CALLER-SAVED loop counter proves its live range crosses ZERO calls — so it cannot share a pseudo with any value LIVE ACROSS a call (but it may freely share one with values that merely sit between calls) _L19035
• §204-B — A LOOP COUNT THAT ARRIVES ON THE STACK IS DECREMENTED IN PLACE: a fresh counter local can cost a real move AND permute the whole callee-saved file _L21614
• §204-D — A LOOP-INVARIANT LOAD IS ADMITTED AS A MOVABLE ONLY IF ITS ADDRESS CANNOT TRAP: local.field PASSES, THE SAME READ THROUGH A POINTER LOCAL IS REFUSED _L21736
• §211 — HOIST THE LOOP INIT ABOVE THE DOMINATING GUARD: it fills the guard's delay slot AND flips the counter/pointer register pair (P31 S58) _L22347
• §246 — THREE-LIVE-VALUE SCAN LOOPS WANT ADDRESS-FROM-INDEX; AND TWO SYMBOLS CAN SHARE ONE giv (P31 S58b) _L23748
• ADD-7 — → §229 addendum — THE VALUE FACE: A LOOP-STORE CONSTANT SPELLED AS A LITERAL HAS NO SOURCE POSITION; NAME IT TO PIN THE PROLOGUE INIT ORDER _L25355
• ADD-8 — → §30a addendum — THE THIRD COLUMN: *p++ IS ALSO SERIALIZED BUT BURNS addiu; ONLY CAST-PLUS GIVES SERIALIZATION AND DISPLACEMENT FOLDING _L25368
• ADDENDUM — to §172b-1 — TWO PLACEMENT DIALS THE PROMOTION LAW DOESN'T NAME: NARROW THE COUNTER'S DECLARED TYPE, AND MOVE THE CAST INTO THE LOOP BODY _L26012
• ADDENDUM — to §211 — AN IN-LOOP ACCUMULATOR WANTS A CLOSED-FORM EXPRESSION WHEN THE TARGET REMATERIALISES ITS CONSTANT AFTER EVERY CALL _L26289
• §279 — A do/while (p < end) LOOP UNDER AN ENTRY GUARD: the guard decides the compare, not the loop (P31 S60; wave cf, func_8017F2A4, ov_SC03_096, byte-proven) _L26834
• §NNN — A DO-WHILE'S GUARD AND LATCH MUST REPEAT THE SAME BOUND EXPRESSION, NOT SHARE ONE LOCAL: THE REPETITION IS WHAT BUYS THE CSE'D COPY INTO A SECOND REGISTER (P31 S60; func_8017F2A4, ov_SC03_096, byte-proven 25/25) _L26835
• §NNN — A LOOP CURSOR'S C TYPE (POINTER vs PLAIN INTEGER) SELECTS sltu vs slt FOR ITS BOUND TEST, INDEPENDENT OF THE VALUES INVOLVED (P31 S60; func_800CAE74, md_MAIN_031, byte-proven; cross-confirmed same wave by func_8017F2A4, ov_SC03_096) _L26869
• §282 — gcc's OWN LOOP REVERSAL PUTS THE COUNTER INIT AFTER THE HOISTED MOVABLES — a position no hand-written down-count can reach (P31 S60; wave cf, func_80180DD8, ov_SC04_005, byte-proven) _L26948
• §NNN — WRITE THE UP-COUNT LOOP: gcc's OWN REVERSAL PRODUCES A COUNTER-INIT INSTRUCTION THAT LANDS AFTER HOISTED MOVABLES, WHICH A HAND-WRITTEN DOWN-COUNT LOOP CANNOT REPRODUCE (P31 S60; func_80180DD8, ov_SC04_005, byte-proven) _L26949
• §290 — A SINGLE STRENGTH-REDUCED GIV CAN DRIVE STORES TO SEVERAL DISTINCT RELOCATABLE SYMBOLS, EACH KEEPING ITS OWN %hi/%lo ANCHOR (P31 S60; waves #, byte-proven) _L29010

structs, block moves & memcpy (68)

• §3-T2 — Source statement order drives instruction scheduling _L78
• §5 — Known hard-residual classes (instruction-identical, one byte-exact blocker) _L199
• §13 — Add a location overlay — the canonical runbook (Phase 13; the Phase-15 fleet recipe) _L1056
• §15 — Struct-heavy shared-core pipeline (Phase 16) — empirical determinations (S0) _L1313
• §16 — Guided hand-matching the struct-heavy core (Phase 17 — beats the §15 brute-force) _L1335
• §3-The — crack: the residual was gcc-2.7.2 COPY-COALESCING, not the instruction scheduler _L2144
• §28 — Banking a "close=0 gate-rejected" giant: the canonical-extern recovery (Phase 22 T1, byte-proven on func_8015126C ×134) _L2325
• §28b — The struct-walled close=0 giant (§28 case #3) IS bankable: the engine_types.h type-lift (Phase 22 T2, byte-proven on func_80156B74 ×134) _L2357
• §30 — Fable5Max cracks §20/§10 "unsteerable" from the gcc SOURCE: store-vs-load is a /s aliasing flag, the def-side wall has a macro escape, + the birthing-boost (Phase 23, byte-proven on giant func_8014EE14 248 ins ×134) _L2382
• §32 — The region-a CAMERA-GIANT idiom set: struct-base hoisting + 4 sibling levers (Phase 24 T7, Fable5-cracked on func_80129CF8 191 ins, match_one MATCH; transferable to the 6 sibling giants) _L2422
• §38 — The WHALE func_80144B9C (770 ins): the -O0 struct-assign memcpy idiom + the -O0 reach-134 ×134 rollout (Phase 24 T7 §G, cheap Opus — no Fable5, no calls.c) _L2527
• §40 — Structural families: the MECHANICAL symbol-remap (crack one exemplar → remap the rest, ~0 tokens) (Phase 25 T3/T7, 2026-07-08) _L2553
• §41 — The DEF-SIDE canonical-sig wall: mechanically banking a drafted giant past conflicting types (Phase 25 T5b batch-2, 2026-07-09; tools/canon_sig_reconcile.py, byte-proven on func_8013B274) _L2710
• §42a — addendum — wave 2 (residuals + 29-100 band): iso-MATCH ≠ real-TU bank, the memcpy→struct-assign fix, +5 levers (2026-07-10b) _L2953
• §44 — The Phase-25 cheap-Opus giant batch: 5 structural levers + the §43 extension (2026-07-11, 6 crackers over the frontier giants) _L3242
• §46 — The func_80178D40 crack (890 ins ×134, the heaviest core in the game): four LOOP-STRUCTURE levers cheap-Opus found by reading loop.c/jump.c/cse.c (Phase 26 session 8, 2026-07-13) _L3313
• §3-Why — 0/8 was structural, and predictable from two words _L4045
• §54 — --fix-def-sig: the member's CANONICAL DECLARATION is a build step too (tiny-IMM mega-pools, +4,801, Phase 29 T6, 2026-07-16) _L4163
• §56b — PROPAGATING an h_seq giant: the exemplar's externs MUST be fleet-canonical, not the draft's types _L4232
• §65a — The blast-radius taxonomy (makes §61's law structural instead of remembered) _L5030
• §66d-5 — residual_class's "structural ⇒ permuter CPU is waste" is WRONG for schedule permutations (measured, Phase 29 SESSION-18) _L5491
• §83 — The parameterised-repeat law, the spill-area trap, and why a per-case edit cannot move a per-case symptom (Phase 29 SESSION-20, func_80183814 5,122 ins, cold-ish start → 36 structural / 99.3%) _L6412
• §84 — The DERIVED-OFFSET remap bug: a hand-computed literal that encodes the DISTANCE between two per-overlay symbols, and why match_one is structurally blind to it (Phase 29 SESSION-20, func_8013D53C) _L6472
• §3-The — construct _L6477
• §91 — A structure-TRANSFER is only valid where the structure corresponds: the --like role trap (Phase 29 SESSION-21, func_8012AAAC ×137) _L6842
• §3-The — three-hypothesis trail, because two of them were wrong and the wrongness is instructive _L6871
• §129 — Post-carve, rtu_match/match_one COUNT THE JUMP TABLE AS INSTRUCTIONS; and a carve must never be committed without its owner (P30 S28, func_8013BD74) _L8437
• §129a — the target instruction count is INFLATED after a carve _L8441
• §3-The — DEFINITION-side alias is the only escape when the fleet canon disagrees on a promoting param _L9473
• §3-Two — errors of mine, both instructive _L10009
• §160 — THE REACH-15 WAVE HARVEST: an align-1 block move, and the instrument that called it a wall (P30 S47) _L10893
• §16Xy — SHARPENS (sharpens §136d-3, §37 /s-DEP LATTICE, §135-2, §136-13, §162q) _L12300
• §3-The — /s drop clause is in ALL THREE dependence predicates, so the FIXED-ADDRESS STORE is what floats (P30 S48, func_8017CA18, ov_MAIN_012) _L12302
• §16Z — SHARPENS (sharpens §37 "the /s-DEP LATTICE", §136-13, §136-14, §16Xy, §162q, gcc-2.7.2-map/sched.md §64) _L14340
• §3-The — ADDRESS-CLASS TABLE: which load/store pairs even REACH the /s clause (P30 S48 wave 4, func_80185B44, ov_SC03_014) _L14342
• §176g — SIZE A WAVE BY INSTRUCTIONS, NOT BY CARDS (P31 S52 — the adopted doctrine) _L16940
• §3-F. — MEM_IN_STRUCT_P ASYMMETRY IN true_dependence (func_80037144, 124 ins) _L17291
• §179-E — A >2*MAX_MOVE_BYTES BLOCK COPY IS A STRUCT ASSIGNMENT, NOT A HAND LOOP _L17493
• §176-B — "REGALLOC-PERM, 1-4 instructions off" ⇒ it is usually NOT register allocation _L17650
• §189 — FIVE COMPILER LAWS MINED FROM THE WAVE R/S JOURNALS (P31 S53), each source-cited and re-derived by a second agent _L18207
• §193-A — The wave card ships only OPEN-set pointers and discards the atlas's BANKED one — exemplar/sibs are stubs 100% by construction (tools/atlas.py:96/657), while seed.ref (matched pool, atlas.py:505-536) is dropped at build_wave_atlas.py:143 _L18423
• §193-B — A NARROW CAST OF A WIDE PARAMETER COSTS ONE EXTRA INSTRUCTION WHEN ITS STATEMENT SITS AFTER AN INTERVENING jal — AND THE DECIDER IS combine.c:929's CROSS-CALL GUARD, NOT REGISTER ALLOCATION _L18490
• §193-I — A DECLARED AGGREGATE LOCAL HAS AN 8-BYTE FRAME STRIDE — CEIL(size,8), NOT size. N ARRAYS THEREFORE COST 8·k MORE THAN ONE HAND-LAID STRUCT (k = how many of them have size mod 8 ≠ 0), AND THE TELL IS IDENTICAL INSTRUCTION COUNT WITH EVERY $sp DISPLACEMENT SHIFTED BY THE SAME CONSTANT. _L18828
• §194-E — The wave card's exemplar is the TARGET ITSELF on 42/73 wave-U and 36/71 wave-T cards — a construction consequence of atlas.py:657 (exemplar = max-nins OPEN member) meeting build_wave_atlas.py:166 (one card per gid); and the shipped §193-A seed_ref is same-binary on 0/51, so no card field can ever name a destination-TU sibling _L19139
• §194-H — §164-29's WAR fence runs again at SCHED2 ON HARD REGISTERS: an in-place v &= K before a branch fences the store that reads v, and when TWO independent stores compete for the one delay slot the fence picks the winner at ZERO length drift (a WIDTH/sh!=sw swap, not a nop). Corrects §167-42's reconstruction (pseudo arm → hard-reg arm) and supplies its first re-runnable A/B. _L19292
• §195-D — §195 — masked_diff.mask_for returns 0 for EVERY j/jal word, so an internal j destination is invisible to match_one, the permuter scorer AND every similarity tier: a control-flow semantic error (which calls execute) surfaces as a 1-instruction residual mislabelled DELAY-SLOT / profile=schedule, or as an outright false MATCH _L19862
• §195-F — fold-const.c:4825 canonicalises a ?: whose THEN arm is zero (or constant against a non-constant ELSE) by inverting the condition and swapping the arms — so a ternary's written arm order is byte-inert there, and c ? 0 : X is unspellable: it always compiles as !c ? X : 0 _L19988
• §195-G — §NEW — TWO ARMS CALLING THE SAME CALLEE MERGE INTO ONE jal UNLESS EACH ARM'S OWN CODE CONSUMES THE RESULT: the C dial that keeps two call sites apart is WHERE the consumer test lives, and the branch SENSE you spell it with is byte-inert (jump.c:1737 canonicalises it) _L20040
• §195-K — At -O2 the §18 array-of-struct lever is a FRAME lever, not a length lever — but only when the N reads carry DISTINCT index expressions; with a SHARED index §18's +2-instruction residual is still alive at -O2 (the submitted "memory-loaded narrow index" precondition and unconditional length-neutrality are both falsified) _L20244
• §199-D — A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is the WIDTH of a real object, and a widening (s32) cast is inert — AMENDS §35 (whose stated "only CSE-reuse canonicalizes" mechanism is byte-wrong) and does NOT apply inside a switch _L20833
• §199-F — §164-36b — THE TARGET-HEAD FENCE IS A DELAY-SLOT THREAD SELECTOR, AND IT ONLY FIRES WHEN mostly_true_jump > 0 (amendment to §164-36; its "−1 instruction" tell is falsified) _L20952
• §204-D — A LOOP-INVARIANT LOAD IS ADMITTED AS A MOVABLE ONLY IF ITS ADDRESS CANNOT TRAP: local.field PASSES, THE SAME READ THROUGH A POINTER LOCAL IS REFUSED _L21736
• §225 — THREE CONTROL-FLOW SHAPES NO STRUCTURED SPELLING REACHES (P31 S58) _L22890
• §30 — addendum (P31 S58) — the /s grant closes a SCHEDULING residual and a REGISTER residual with one edit _L23172
• §249 — THE SELF-ASSIGN, THE DEAD RE-ASSIGN, AND THE + zr COPY: THREE WAYS TO MAKE A DELETED INSTRUCTION REAL (P31 S58b) _L23846
• §30 — addendum (P31 S58b) — THE ANONYMOUS STRUCT MEMBER REF GRANTS /s, AND THAT IS A TWO-FOR-ONE _L24114
• §263 — A STOLEN DELAY SLOT WHOSE INSTRUCTION IS AN ARG-REGISTER COPY IS AN ARITY ERROR, NOT A SCHEDULE (P31 S59, byte-proven) _L24842
• ADD-8 — → §245 addendum — THE RE-TIE BARRIER PINS CALL-ARG SETUP TO SOURCE ORDER (construct 6) _L25115
• ADD-11 — → Cross-confirmation card block (per §259's standing instruction: confirmation, not news) _L25146
• ADD-4 — → §167-37 addendum — THE FIFTH PRECONDITION, NOW MEASURED: DOWNSTREAM FIELD RE-READS ⇒ NAME IT AND STORE INSIDE THE ARM _L25306
• ADD-10 — → Cross-confirmation card block (per §259's standing instruction: confirmation, not news) _L25397
• ADDENDUM — to §82 — struct copies must stay MEMBER-WISE, not block-moved, to match a spill-slot save _L25655
• ADDENDUM — to §244 — THE COMPILER BARRIER, NOT volatile, BLOCKS A STORE→LOAD HOIST THROUGH A POINTER-OFFSET FIELD _L25981
• §281 — GROUP COPY-THEN-RMW BY OPERATION KIND, NOT FIELD BY FIELD: sched1 does the interleaving, the source must not (P31 S60; wave cf, func_80180FB4, ov_SC03_111, byte-proven) _L26902
• §NNN — A DEPENDENT COPY-THEN-RMW BLOCK MUST BE SOURCE-GROUPED BY OPERATION KIND, NOT BY FIELD, AND SCHED1 DOES THE INTERLEAVING (P31 S60; func_80180FB4, ov_SC03_111, byte-proven) _L26903
• §NNN — WRITE THE UP-COUNT LOOP: gcc's OWN REVERSAL PRODUCES A COUNTER-INIT INSTRUCTION THAT LANDS AFTER HOISTED MOVABLES, WHICH A HAND-WRITTEN DOWN-COUNT LOOP CANNOT REPRODUCE (P31 S60; func_80180DD8, ov_SC04_005, byte-proven) _L26949
• §285 — PRE-INITIALIZING A VARIABLE WITH A SHARED CONSTANT BEFORE A BRANCH MAKES BOTH ARMS OF THE FOLLOWING if/else DESTRUCTIVELY REUSE THE SAME DESTINATION REGISTER FOR THEIR BITWISE RESULT (byte-proven; func_801811F0, ov_SC03_102, independently rediscovered across waves di/dj) (P31 S60; waves #, byte-proven) _L28990
• §287 — A STACK-FRAME HOLE BELOW TWO ADDRESS-TAKEN AGGREGATE LOCALS IS A LEADING PAD MEMBER OF ONE COMBINED STRUCT, NOT SEPARATE LOCALS OR A REGISTER PIN (P31 S60/dj; func_8017D104, ov_SC06_027, byte-proven 47/47) (P31 S60; waves #, byte-proven) _L28998

types, signedness & load/store width (74)

• §3-I1 — Unsigned range check: (x - lo) < (hi-lo) → addiu+sltiu _L41
• §3-I2 — Byte mask forces andi even after lbu _L47
• §3-T3 — Types _L85
• §7 — PsyQ SDK types & symbols (the library-call prerequisite) _L303
• §14c — Callee-signature-aware harvest — breaking the extern-type-conflict wall (Phase 15, T6) _L1213
• Phase-20 — RESOLUTION — tools/cast_call_sites.py BUILT + the cap re-diagnosed (R14, byte-proven) _L1701
• §23 — Giant func_80153E00 cracked (scalar-data CAST); BUT most giant drafts are STALE+INCOMPLETE, and a diag MUST remove artifacts (Phase 21 — byte-proven + a self-correction) _L2032
• §28b — The struct-walled close=0 giant (§28 case #3) IS bankable: the engine_types.h type-lift (Phase 22 T2, byte-proven on func_80156B74 ×134) _L2357
• §33 — Automating the giant decl-reconcile: tools/reconcile_decls.py (the DATA analog of §20's cast_call_sites) + a fleet-majority type oracle (Phase 24 T7b, byte-proven on func_80129CF8) _L2434
• §40a — The DECL-RECONCILE pass (type-lift so remapped drafts compile in the sibling TU) (Phase 25 T7.2, 2026-07-08) _L2601
• §41 — The DEF-SIDE canonical-sig wall: mechanically banking a drafted giant past conflicting types (Phase 25 T5b batch-2, 2026-07-09; tools/canon_sig_reconcile.py, byte-proven on func_8013B274) _L2710
• §41d — void→s32 is NOT always byte-neutral: gate the RAW draft FIRST (Phase 26 session 6, byte-proven) _L2878
• §42b — addendum — wave 3 (Max, 2026-07-10c): THE STALE-OBJECT GATE TRAP + the read-global &-cast drift + fix _L2994
• §43 — The K&R s16-param definition DISSOLVES the "narrow-param wall" for by-value register args (Phase 25 task A, Fable5 crack of the 369-ins giant func_80166994 ×134, 2026-07-11) _L3195
• §3-C. — TYPE- AND SHAPE-DRIVEN CODEGEN (the C type literally selects the addressing mode) _L3484
• §56b — PROPAGATING an h_seq giant: the exemplar's externs MUST be fleet-canonical, not the draft's types _L4232
• §64 — The §20 type-lift's three laws: fold the tagged typedef, check VISIBILITY, and strip only what is TEXTUALLY IDENTICAL (lift_types.py, Phase 29 SESSION-14, 2026-07-23) _L4908
• §64a — VARIANT types: UNIQUIFY the camps, do not reconcile them (uniquify_type.py, Phase 29 SESSION-14) _L4957
• §65g — Where the cheap levers STOP: the local-type and in-TU-self-decl classes did not yield _L5139
• §68 — A comment-only line halted the extern scan, and the skip label blamed the type cap (Phase 29 SESSION-18) _L5524
• §73 — A def-side self-decl conflict has TWO axes: RETURN (fleet widen, T2) and PARAMS (casts at each use, T0). Diagnose which before paying for the expensive one (Phase 29 SESSION-19, func_8014F3E8 + func_8014D4C0) _L5783
• §75c — Class-B's remedy is the FULL §17a-1 PAIR (decl and call-site cast); a decl-only fix moves the error and looks like a new wall (Phase 29 SESSION-19, func_8012F14C) _L5997
• §3-The — defect this exposed: a shared type that is present but invisible _L6354
• §92 — Conforming a DECLARATION: pointer changes are caller-neutral, scalar-WIDTH changes are not (Phase 29 SESSION-21, tools/conform_decls.py) _L6891
• §94 — A family sweep's 0/N is a TYPE-CARRY failure until proven otherwise: lift the exemplar's local types, ALL of them, transitively (Phase 29 SESSION-21, func_8016B6BC 0/137 → 137/137) _L6947
• §100 — Prefer the DRAFT-LOCAL fix: a type only one function uses belongs in its BODY, not in a shared header (Phase 29 SESSION-22, func_80175DA8 0/137 → 137/137) _L7216
• §120 — Uniquify draft-defined TYPE names; and check which of N staging sites you actually patched (Phase 29 T93) _L8026
• §3-Do — NOT "strip the duplicate typedef" — it breaks the extern that uses it _L8037
• §3-The — type-form rules _L8879
• §143 — cast_call_sites read a RETURN STATEMENT as a prototype and deleted it. A 0/39 sweep became 18/39. (P30 S40) _L9834
• Then — propagation returned 0/137 TWICE — both times a missing TYPE _L10000
• §154 — Reading a disc payload: the module-id word, static base derivation, and "type 1 = uncompressed overlay" (P30 S44) _L10522
• §3-C. — PAC type 1 = the same payload class as type 4, just NOT compressed _L10548
• §155b — check the TYPE your oracle returns before comparing against it (S45 p5) _L10587
• §3-B. — Typedef handling — the only strategy that survives contact _L17004
• §3-D. — A NARROW TYPE BLOCKS COPY ELISION (func_8001D3FC — new idiom) _L17275
• §185 — EDIT THE SIDE THAT IS CHEAP TO VERIFY, AND CHECK A TU RETYPE AT ITS USE SITES _L18041
• §186b — A NO-SAVE 16-BYTE FRAME IN A LEAF FUNCTION MEANS s16 LOCALS, NOT A HIDDEN CALL _L18094
• §193-B — A NARROW CAST OF A WIDE PARAMETER COSTS ONE EXTRA INSTRUCTION WHEN ITS STATEMENT SITS AFTER AN INTERVENING jal — AND THE DECIDER IS combine.c:929's CROSS-CALL GUARD, NOT REGISTER ALLOCATION _L18490
• §193-G — §164-54's "scope to ≥4 arms" bound is byte-wrong — the dispatch-topology oracle goes live at THREE case nodes (balance_case_nodes splits at i > 2), but only for a signed-after-promotion index _L18727
• §193-H — A pointer-derived base load *(s32*)(p+K) is uncacheable across ANY memory write or call (cse's third kill disjunct) — so the target emits one lw per store-separated RUN of spellings, and a run of stores sharing one lw is a C local you must declare _L18788
• §194-B — A addu $rA,$rB,$zero copy feeding ≥2 sh stores is a SECOND, 16-BIT-DECLARED local — the width, not the clamp or the join liveness, is what keeps the copy (and func_80183094's pin + "memory" clobber are both provably inert) _L18997
• §194-D — Declared width of a computed-value local is a sched1 dial (count-neutral) — a replication + attribution correction of §165-17, NOT a new argument-register law _L19098
• §194-G — Reading the integer half of a 16.16 stack aggregate: REGISTER-LIVENESS, not the C spelling, decides sra vs lhu — and the break is count-neutral _L19249
• §194-H — §164-29's WAR fence runs again at SCHED2 ON HARD REGISTERS: an in-place v &= K before a branch fences the store that reads v, and when TWO independent stores compete for the one delay slot the fence picks the winner at ZERO length drift (a WIDTH/sh!=sw swap, not a nop). Corrects §167-42's reconstruction (pseudo arm → hard-reg arm) and supplies its first re-runnable A/B. _L19292
• §194-I — §16N+2's magic-per-odd-part ladder has exactly one broken row — read the divisor arithmetically instead: d = round(2^(32 + post_shift) / magic_read_as_unsigned) _L19330
• §197-A — A NARROW SIGNED MEMORY READ FEEDING A CONSTANT >> LOSES ITS lh, AND THE CURE IS AN ASM RE-TIE (attribution CONTESTED: cse vs combine) _L20554
• §199-D — A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is the WIDTH of a real object, and a widening (s32) cast is inert — AMENDS §35 (whose stated "only CSE-reuse canonicalizes" mechanism is byte-wrong) and does NOT apply inside a switch _L20833
• §201-D — THE SIGNEDNESS OF A div/mod MAGIC IS DECIDED BY THE STATIC TYPE OF THE DIVIDEND TREE AFTER get_narrower STRIPS WIDENING CONVERSIONS — NEVER BY A PROVABLE RANGE. AN & 0xFF IS NOT A CONVERSION, SO IT NEVER FLIPS THE MAGIC; A DECLARED-UNSIGNED LOCAL OR A NARROWING CAST WRITTEN AT THE DIVIDE BOTH DO. _L21294
• §203 — A DEDUPED TYPEDEF MUST PRECEDE EVERY SPLICE POINT, NOT JUST ITS OWN (P31 S56) _L21459
• §204-E — decl_prior's %hi/%lo ARM HAS NEVER FIRED: the card's promised GLOBAL-TYPE row is 0 of 1,210 _L21811
• §218 — A NARROW TYPE AT THE ABI BOUNDARY COSTS AN IN-PLACE sll/sra PAIR — on the RETURN as well as on the PARAMETER (P31 S58) _L22644
• §220 — THE PARAMETER ITSELF IS A REGALLOC DIAL: use it directly, prefer s32 to void*, and place the save-copy AFTER the first call (P31 S58) _L22700
• §227 — TYPE THE SOURCE BY THE LOAD WIDTH, NOT BY THE STORE WIDTH (P31 S58) _L22974
• §234 — CONSTANT MATERIALISATION: THE STORE LVALUE'S SIGNEDNESS PICKS addiu vs li/ori (P31 S58b) _L23272
• §237 — THE CAST-AT-CALL-SITE DECISION TABLE: WHAT §17a-1 FIXES, WHAT IT CANNOT, AND THE FOUR ESCAPES (P31 S58b) _L23421
• §242 — *k vs <<n, AND /2^n vs >>n: EXPRESSION SPELLING OWNS THE LOAD WIDTH AND THE ROUNDING CHAIN (P31 S58b) _L23608
• §243 — SPELL THE CSE BARRIER AS A REASSIGNED POINTER; AND THE nop-AFTER-EVERY-lh SIGNATURE (P31 S58b) _L23636
• §251 — IMMEDIATE-SPELLING TRIGGERS: += 0xFF, FULL-WIDTH ~K, AND THE TWO-OR SPLIT (P31 S58b) _L23925
• ADD-5 — → §1/I1 addendum — THE INVERTED RANGE TEST: (u32)(x-lo) >= N WITH THE ZERO-ARM AS THE TRAILING else _L25085
• ADD-2 — → §236 addendum (item 1 corollary) — THE SILENT-SPLICE DECLARATION LADDER: WHERE THE TU HAS NO SPELLING, UNPROTOTYPED () BEATS THE FLEET VOTE _L25279
• ADD-5 — → §267-ADD-6 / §172b-1 addendum — THE SIGN-TEST FACE: (s16)v < 0 IS sll 16 + bgez ON THE SHIFTED COPY, RAW STAYS LIVE — AND THE HALFWORD-ABS SHAPE NEEDS NO RITUAL _L25323
• ADD-8 — → §30a addendum — THE THIRD COLUMN: *p++ IS ALSO SERIALIZED BUT BURNS addiu; ONLY CAST-PLUS GIVES SERIALIZATION AND DISPLACEMENT FOLDING _L25368
• ADDENDUM — to §179-C — the .type NAME, @function requirement _L25552
• ADDENDUM — to §134 — a typedef defined BELOW the splice point is stripped anyway _L25599
• ADDENDUM — to §172b-1 — TWO PLACEMENT DIALS THE PROMOTION LAW DOESN'T NAME: NARROW THE COUNTER'S DECLARED TYPE, AND MOVE THE CAST INTO THE LOOP BODY _L26012
• ADDENDUM — to §172b-4 — THE PLAIN CAST-DIVISION ALREADY PRODUCES THE PATTERN; DON'T HAND-ROLL THE BIAS, AND KEEP THE OPERAND WIDE _L26104
• §280 — THE CURSOR'S DECLARED TYPE PICKS sltu vs slt: a T* bound test is UNSIGNED by C rule, an integer cursor is signed (P31 S60; wave cf, func_800CAE74, md_MAIN_031, byte-proven) _L26868
• §NNN — A LOOP CURSOR'S C TYPE (POINTER vs PLAIN INTEGER) SELECTS sltu vs slt FOR ITS BOUND TEST, INDEPENDENT OF THE VALUES INVOLVED (P31 S60; func_800CAE74, md_MAIN_031, byte-proven; cross-confirmed same wave by func_8017F2A4, ov_SC03_096) _L26869
• ADDENDUM — to §21 — the bltz+slti (or N-separate-compares) signed-range-split bullet is now CONFIRMED on three independent functions, and generalizes beyond lbu/u8 _L27069
• ADDENDUM — to §202 — the DEF-SIDE ALIAS also resolves a function-vs-DATA-symbol identifier clash, not only a function-vs-function prototype clash _L27115
• ADDENDUM — §NNN — sharpens §162a3/§60b: A sll $v0,16 / sltiu $v0,1 ZERO-TEST OF A JUST-DECREMENTED HALFWORD IS A SIGNED-TEMP WIDTH TELL OUTSIDE ANY SWITCH/RANGE-TEST CONTEXT _L28205
• §288 — A REGISTER PIN DECLARED UNINITIALIZED AND ASSIGNED ONLY AT ITS LATE, SOLE USE STILL FORCES THE FIXED REGISTER'S SAVE/RESTORE, AND THE ASSIGNMENT'S SOURCE POSITION CONTROLS WHERE THE VALUE MATERIALIZES (P31; func_80186530, ov_SC02_017, byte-proven, match_one MATCH re-verified) (P31 S60; waves #, byte-proven) _L29002
• §292 — DECLARING A SYMBOL UPSTREAM OF AN ALREADY-BANKED SIBLING THAT RELIES ON THAT SYMBOL'S IMPLICIT (K&R) DECLARATION CAN SILENTLY REPROTOTYPE THE SIBLING'S OWN CALL SITE (P31 S60; waves #, byte-proven) _L29018

declarations, prototypes & K&R (99)

• §3-T4 — Branch polarity: invert the source condition to flip gcc's chosen branch _L90
• §8c — Splitting a TU means rebuilding its DECLARATION ENVIRONMENT, not moving text (Phase 26 session 6) _L437
• §8d — Templating a body INTO a TU must not CHANGE its declaration environment — demote the carried data externs (Phase 26 session 8, byte-proven on func_8015AE2C ×133) _L483
• §13 — Add a location overlay — the canonical runbook (Phase 13; the Phase-15 fleet recipe) _L1056
• §14c — Callee-signature-aware harvest — breaking the extern-type-conflict wall (Phase 15, T6) _L1213
• §3-The — pipeline gotcha — match_one ≠ the gate; sig_unify is MANDATORY _L1421
• §3-The — gate two-stage — sig_unify is a FALLBACK, not unconditional (gate_stage.py, §19 folded in) _L2189
• §28 — Banking a "close=0 gate-rejected" giant: the canonical-extern recovery (Phase 22 T1, byte-proven on func_8015126C ×134) _L2325
• §28d — The "macro-extern-injection" lever: freeing reach-134 inline matches dedup_propagate skips as "not self-contained" (Phase 23, tools/inject_capped_externs.py) _L2366
• §33 — Automating the giant decl-reconcile: tools/reconcile_decls.py (the DATA analog of §20's cast_call_sites) + a fleet-majority type oracle (Phase 24 T7b, byte-proven on func_80129CF8) _L2434
• §40a — The DECL-RECONCILE pass (type-lift so remapped drafts compile in the sibling TU) (Phase 25 T7.2, 2026-07-08) _L2601
• §41 — The DEF-SIDE canonical-sig wall: mechanically banking a drafted giant past conflicting types (Phase 25 T5b batch-2, 2026-07-09; tools/canon_sig_reconcile.py, byte-proven on func_8013B274) _L2710
• §41b — addendum — M4 "reconcile_decls" tier is ALSO a probe over-count: 0/8 mechanical (Phase 25 T7-M4, 2026-07-10) _L2858
• §41d — void→s32 is NOT always byte-neutral: gate the RAW draft FIRST (Phase 26 session 6, byte-proven) _L2878
• §43 — The K&R s16-param definition DISSOLVES the "narrow-param wall" for by-value register args (Phase 25 task A, Fable5 crack of the 369-ins giant func_80166994 ×134, 2026-07-11) _L3195
• §51g — When the thing you are scanning has a GRAMMAR, parse the grammar (tools/cdecl.py) _L3769
• §54 — --fix-def-sig: the member's CANONICAL DECLARATION is a build step too (tiny-IMM mega-pools, +4,801, Phase 29 T6, 2026-07-16) _L4163
• §56 — Banking a hand-drafted GIANT into its exemplar TU: self-contained draft vs live-TU decls, 4 reconciliation tactics (func_8013FAF8, 312 ins ×138, Phase 29 T4, 2026-07-17) _L4187
• §56b — PROPAGATING an h_seq giant: the exemplar's externs MUST be fleet-canonical, not the draft's types _L4232
• §57 — The SELF-decl normalize: the sibling's OWN caller declares the templated fn divergently (the third §17a-1 direction; tools/normalize_self_decls.py, func_801670E4 ×137, Phase 29, 2026-07-18) _L4256
• §61 — Task 14: the gate ladder's missing stage is the ARITY pre-pass, and it is TU-side not draft-side (Phase 29, 2026-07-21) _L4545
• §63 — The fresh-138 DEF-SIDE blocker: fix the HEADER decl, not the draft (fix_header_decl.py, Phase 29 SESSION-13, 2026-07-23) _L4877
• §63 — UPDATE (Phase 29 SESSION-14) — fix_header_decl's "SAFE" verdict is FLEET-BLIND; it MUST be R22-validated _L5000
• §65c — rtu_match MATCH → bank held 13/13 on self-decl, but broke on the FIRST callee-decl case _L5081
• §65g — Where the cheap levers STOP: the local-type and in-TU-self-decl classes did not yield _L5139
• §66a — The widest write in a pipeline is the one most likely to be UNDECLARED _L5181
• §68 — A comment-only line halted the extern scan, and the skip label blamed the type cap (Phase 29 SESSION-18) _L5524
• §73 — A def-side self-decl conflict has TWO axes: RETURN (fleet widen, T2) and PARAMS (casts at each use, T0). Diagnose which before paying for the expensive one (Phase 29 SESSION-19, func_8014F3E8 + func_8014D4C0) _L5783
• §75 — A propagation cap is usually a MINORITY-SPELLING SOURCE OVERLAY, not a wall: census the carried extern before believing the exclusion message (Phase 29 SESSION-19, func_8014F3E8 ×4 → ×138) _L5866
• §75b — A body's preamble can carry #defines, not just externs; extraction lifts only the externs (Phase 29 SESSION-19, func_80165CA0 ×3 → fleet) _L5948
• §75c — Class-B's remedy is the FULL §17a-1 PAIR (decl and call-site cast); a decl-only fix moves the error and looks like a new wall (Phase 29 SESSION-19, func_8012F14C) _L5997
• §76 — The allocno CLASS (local vs global) is the dominant regalloc lever, and C reaches it ONLY through declaration scope and variable reuse (Phase 29 SESSION-19, behemoth #3 func_8017F510 1,511 ins, 97 → MATCH, pin-free) _L6028
• §79 — For a 0-callee giant, fingerprint by DATA symbols (§71 cannot fire); and the STACK-SLOT ORDER is a declaration-order oracle (Phase 29 SESSION-19, func_8017BF14 4,763 ins, cold start → 45/4763) _L6220
• §3-NEW — LEVER — the frame layout reads back the original declaration order _L6240
• §3-1. — The inlined-helper signature _L6375
• §92 — Conforming a DECLARATION: pointer changes are caller-neutral, scalar-WIDTH changes are not (Phase 29 SESSION-21, tools/conform_decls.py) _L6891
• §95 — reconcile_tu dropped the SIBLING declarators of a multi-symbol extern line (Phase 29 SESSION-21, func_80176218) _L6983
• §96 — The same rewrite, one shape down: reconcile_tu matched statements to lines by TEXT, so every COMMENTED declaration was silently skipped (Phase 29 SESSION-22, func_80176218 banked) _L7018
• §98 — conform_decls had three defects, and only the third needed R22 to find (Phase 29 SESSION-22, func_8014CF04) _L7113
• §99 — The narrow-param wall is a DEF-side problem with a ZERO-blast-radius fix: convert the definition to K&R (Phase 29 SESSION-22, func_80175AB8 + func_80175DA8) _L7167
• §102 — A PLUMBING verdict can MASK a DIFF; and K&R is not always a codegen change (Phase 29 SESSION-22, func_8016EC0C) _L7272
• §103 — A FILE-scope extern in a shared overlay TU is a GLOBAL constraint on every LATER function; move the DECL, not the draft (Phase 29 T48/T51, func_80135260 — the fleet-wide half) _L7307
• §104 — Two silent-skip defects in one scan: match on MASKED text, emit from the ORIGINAL (Phase 29 T53, gather_externs) _L7395
• §112 — A macro-scoped declaration only collides where the macro is INSTANTIATED (Phase 29 T67/T69, audit_header_sigs.py) _L7730
• §113 — An ARITY blocker only exists if the macro CALLS the function; an address-taken use has no call site (Phase 29 T72) _L7776
• §114 — The THIRD decl axis: a CALLEE the draft declares differently from the target TU (Phase 29 T76/T77) _L7808
• §3-Do — NOT "strip the duplicate typedef" — it breaks the extern that uses it _L8037
• §121 — Synthesise externs for macro-DEFINED callees from the macro's own definition head (Phase 29 T95) _L8061
• §3-The — declaration surface (integration, not codegen) _L8941
• §136f — Two declaration sub-cases the reconcile lane surfaced (lane now 15/15 lifetime) _L9186
• §138 — The propagation lanes: a gate refusal is a DECLARATION, and which lever you owe depends on blast radius _L9415
• Reconciling — a gate-refused draft: which way you edit depends on WHERE the TU's decl is _L9565
• §141 — The §134 class is CLOSED: every line-shape decision now routes through cdecl._mask (P30 S39) _L9740
• §143 — cast_call_sites read a RETURN STATEMENT as a prototype and deleted it. A 0/39 sweep became 18/39. (P30 S40) _L9834
• §3-C. — Inner-block declaration does NOT delay slot allocation — BYTE-REFUTED _L10068
• §159 — THE DECLARATION AXIS: conform to byte-truth, and make every guard state its COVERAGE (P30 S47; ~10,930 sites across 8 axes, fleet byte-identical) _L10828
• §168 — THE COUSIN TIER (P30 S49, 2026-08-12): h_seq's exact-hash brittleness, measured — and the similarity map above it _L16211
• §176f — THE DECLARATION FORM IS A MATCHING LEVER, SO RECONCILE TOWARD THE FORM THE MATCH NEEDS (P31 S52) _L16909
• §183 — THE DECLARATION-RECONCILIATION PLAYBOOK (P31 S53, measured on 20 byte-verified drafts) _L17942
• §193-H — A pointer-derived base load *(s32*)(p+K) is uncacheable across ANY memory write or call (cse's third kill disjunct) — so the target emits one lw per store-separated RUN of spellings, and a run of stores sharing one lw is a C local you must declare _L18788
• §193-I — A DECLARED AGGREGATE LOCAL HAS AN 8-BYTE FRAME STRIDE — CEIL(size,8), NOT size. N ARRAYS THEREFORE COST 8·k MORE THAN ONE HAND-LAID STRUCT (k = how many of them have size mod 8 ≠ 0), AND THE TELL IS IDENTICAL INSTRUCTION COUNT WITH EVERY $sp DISPLACEMENT SHIFTED BY THE SAME CONSTANT. _L18828
• §194-B — A addu $rA,$rB,$zero copy feeding ≥2 sh stores is a SECOND, 16-BIT-DECLARED local — the width, not the clamp or the join liveness, is what keeps the copy (and func_80183094's pin + "memory" clobber are both provably inert) _L18997
• §194-D — Declared width of a computed-value local is a sched1 dial (count-neutral) — a replication + attribution correction of §165-17, NOT a new argument-register law _L19098
• §195-A — §167-08's "an $aN READ before the jal is scratch" has a byte-proven FALSE-NEGATIVE class: an argument that DIES at the call is allocated straight into $aN, so its only def is a plain load far above the jal and every intervening use reads $aN — there is no positive tell in either direction, only the two-arity A/B _L19701
• §195-C — A call-argument %hi/%lo pair sitting at the block head, far above its jal, is a load-delay-gap filler chosen by SOURCE STATEMENT ORDER — swap the two independent statements nearest the call; a single-use void *p = &SYM; call-arg temp is OUTPUT-inert against it (but NOT expand-stream-inert) _L19814
• §195-D — §195 — masked_diff.mask_for returns 0 for EVERY j/jal word, so an internal j destination is invisible to match_one, the permuter scorer AND every similarity tier: a control-flow semantic error (which calls execute) surfaces as a 1-instruction residual mislabelled DELAY-SLOT / profile=schedule, or as an outright false MATCH _L19862
• §195-F — fold-const.c:4825 canonicalises a ?: whose THEN arm is zero (or constant against a non-constant ELSE) by inverting the condition and swapping the arms — so a ternary's written arm order is byte-inert there, and c ? 0 : X is unspellable: it always compiles as !c ? X : 0 _L19988
• §195-G — §NEW — TWO ARMS CALLING THE SAME CALLEE MERGE INTO ONE jal UNLESS EACH ARM'S OWN CODE CONSUMES THE RESULT: the C dial that keeps two call sites apart is WHERE the consumer test lives, and the branch SENSE you spell it with is byte-inert (jump.c:1737 canonicalises it) _L20040
• §195-H — §165-27g — ON A FIXED-SYMBOL GLOBAL, extern T D[]; + D[0] IS THE CSE RELOAD DIAL, AT ZERO ADDRESSING COST, AND THE ELEMENT COUNT IS INERT (§165-27's T v[2] CAVEAT IS A LOCAL-FRAME FACT AND DOES NOT TRANSFER) _L20088
• §196 — PUT ON THE CARD WHAT THE TREE ALREADY KNOWS: the fleet's declaration consensus (P31 S54) _L20485
• §199-D — A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is the WIDTH of a real object, and a widening (s32) cast is inert — AMENDS §35 (whose stated "only CSE-reuse canonicalizes" mechanism is byte-wrong) and does NOT apply inside a switch _L20833
• §199-G — At TWO case nodes the switch-vs-if oracle is not blind — but the tell is ALL tests positive + a trailing j default, NOT the first test's polarity _L21006
• §200 — THE ALIAS IS THE UNIVERSAL DECLARATION ESCAPE: stop negotiating with the TU's spelling (P31 S55) _L21072
• §201-A — §150-B applies to decl_prior's DEF row: for an overlay-window symbol the banked "definition" is usually another overlay's function, and the card ranks it ABOVE the destination TU _L21131
• §201-D — THE SIGNEDNESS OF A div/mod MAGIC IS DECIDED BY THE STATIC TYPE OF THE DIVIDEND TREE AFTER get_narrower STRIPS WIDENING CONVERSIONS — NEVER BY A PROVABLE RANGE. AN & 0xFF IS NOT A CONVERSION, SO IT NEVER FLIPS THE MAGIC; A DECLARED-UNSIGNED LOCAL OR A NARROWING CAST WRITTEN AT THE DIVIDE BOTH DO. _L21294
• §202 — THE ALIAS CARRIES A DEFINITION, NOT JUST A DECLARATION: the DEF-SIDE-RETURN wall (P31 S56) _L21422
• §204-C — WHEN A LOCAL BUFFER'S ADDRESS IS PASSED TO A CALL, ITS SIZE IS A FACT ABOUT THE CALLEE'S BODY, NOT ABOUT THE CALL SITE: grep the callee's proven definition and count the stores through the pointer parameter before you declare the local _L21678
• §204-E — decl_prior's %hi/%lo ARM HAS NEVER FIRED: the card's promised GLOBAL-TYPE row is 0 of 1,210 _L21811
• §208 — TWO NAMED LOCALS FOR ONE RELOADED EXPRESSION BUY TWO ALLOCNOS — the naming granularity owns the REGISTER SPLIT, not just the load count (P31 S58) _L22175
• §214 — THE BANKED TWIN MAY BE A MACRO, A DELETED .s, OR A SEMANTIC INVERSE — six ways a ≥0.9 similarity lies (P31 S58) _L22476
• §216 — DISTINCT ADJACENT SCALARS vs ONE ARRAY: one lui per access is the tell, and the array decl is UNUSABLE (P31 S58) _L22578
• §220 — THE PARAMETER ITSELF IS A REGALLOC DIAL: use it directly, prefer s32 to void*, and place the save-copy AFTER the first call (P31 S58) _L22700
• §224 — CROSS-JUMP: WRITE THE DUPLICATE, AND READ A SHARED DELAY SLOT AS THE MERGE SIGNATURE (P31 S58) _L22854
• §236 — THE DECLARATION LAYER IS THE DOMINANT BANK-BLOCKER: NINE WAYS A BYTE-PERFECT BODY FAILS THE GATE (P31 S58b) _L23342
• §243 — SPELL THE CSE BARRIER AS A REASSIGNED POINTER; AND THE nop-AFTER-EVERY-lh SIGNATURE (P31 S58b) _L23636
• §250 — %hi/%lo vs lw: THE EXTERN'S ARRAY-vs-SCALAR SHAPE DECIDES ADDRESS MATERIALISATION (P31 S58b) _L23888
• §214 — addendum (P31 S58b) — FOUR MORE WAYS A HIGH-SIMILARITY TWIN LIES _L24303
• §226 — addendum (P31 S58b) — THE FRAME CATALOGUE: SEVEN MORE LEVERS, AND SLOT ORDER IS DECLARATION ORDER _L24532
• §263 — A STOLEN DELAY SLOT WHOSE INSTRUCTION IS AN ARG-REGISTER COPY IS AN ARITY ERROR, NOT A SCHEDULE (P31 S59, byte-proven) _L24842
• ADD-10 — → §237 addendum (arity-evidence paragraph) — AN la PAIR ABOVE THE PROLOGUE sw $ra IS AN OUTGOING-ARGUMENT MATERIALISATION _L25137
• ADD-2 — → §236 addendum (item 1 corollary) — THE SILENT-SPLICE DECLARATION LADDER: WHERE THE TU HAS NO SPELLING, UNPROTOTYPED () BEATS THE FLEET VOTE _L25279
• §272 — The (void)-decl + empty-call wall: K&R the DEFINITION, not just the decls (P31 S59) _L25511
• ADDENDUM — to §20 — a global declared as T * may itself BE the array base, not a pointer to dereference _L25732
• ADDENDUM — to §172b-1 — TWO PLACEMENT DIALS THE PROMOTION LAW DOESN'T NAME: NARROW THE COUNTER'S DECLARED TYPE, AND MOVE THE CAST INTO THE LOOP BODY _L26012
• §280 — THE CURSOR'S DECLARED TYPE PICKS sltu vs slt: a T* bound test is UNSIGNED by C rule, an integer cursor is signed (P31 S60; wave cf, func_800CAE74, md_MAIN_031, byte-proven) _L26868
• ADDENDUM — to §202 — the DEF-SIDE ALIAS also resolves a function-vs-DATA-symbol identifier clash, not only a function-vs-function prototype clash _L27115
• ADDENDUM — §NNN — sharpens §37/§124 (unspecified-parameter-list family): DERIVE A CALLEE'S ARITY LOWER BOUND FROM ITS OWN .s STACK-ARGUMENT READS, NOT FROM ANY SINGLE CALL SITE _L28238
• §288 — A REGISTER PIN DECLARED UNINITIALIZED AND ASSIGNED ONLY AT ITS LATE, SOLE USE STILL FORCES THE FIXED REGISTER'S SAVE/RESTORE, AND THE ASSIGNMENT'S SOURCE POSITION CONTROLS WHERE THE VALUE MATERIALIZES (P31; func_80186530, ov_SC02_017, byte-proven, match_one MATCH re-verified) (P31 S60; waves #, byte-proven) _L29002
• §292 — DECLARING A SYMBOL UPSTREAM OF AN ALREADY-BANKED SIBLING THAT RELIES ON THAT SYMBOL'S IMPLICIT (K&R) DECLARATION CAN SILENTLY REPROTOTYPE THE SIBLING'S OWN CALL SITE (P31 S60; waves #, byte-proven) _L29018

jump tables & switches (40)

• §8 — rodata island (compiler jump tables) — the .data→.rodata→.data sandwich (Phase 7) _L320
• §8a — rodata island in a flat OVERLAY — the tail sandwich, per matched jr-function (Phase 26 — PoC PROVEN) _L342
• §8a-pad — a trailing .word 0x00000000 under a jtbl dlabel is .align PAD, not an entry (Phase 26 session 6, byte-proven) _L380
• §8b — MULTI-jtbl per overlay — the ld_interleave --order sandwich + the same-subseg cases (Phase 26 session 4) _L404
• §8e — The jtbl ALIGNMENT LAW + the pad-spec filter — multi-table .rodata spans (Phase 29, byte-proven; .run/probe_jtbl/verdict.md) _L530
• §3-The — clean object-level metric (use this, not the permuter score, for jtbl/rodata functions) _L844
• §41b — T7 execution: the object-only probe OVER-counts BANKABLE by two link/rodata classes (Phase 25 T7-M1, 2026-07-10) _L2809
• §48 — The 12-core jr crack wave: the ALLOCNO-PRICING dials and the EBB rule (Phase 26 session 8, Ultracode, 9/12 MATCH first pass) _L3405
• §53 — SWEEP A FAMILY WITH THE TOOL ITS EXEMPLAR NEEDED: the jr/switch carve, and how omitting it manufactured the "families don't template" doctrine (Phase 28 T1, 2026-07-15) _L4028
• §61b — The jtbl gate stage: built, and the ORDERING law it exposed (Phase 29 Task-14 stage 4, 2026-07-21) _L4658
• §61c — The jtbl bank is INCREMENTALLY valid and CLEAN-INVALID (Phase 29, 2026-07-21) — the blocking finding _L4713
• §62 — The jtbl RECONCILE must also follow the carve: the post-carve draft reconcile (harvest_verify._jtbl_reconcile, Phase 29 SESSION-11, 2026-07-22) _L4833
• §81 — Banking a jr (jump-table) function: the 3-step carve chain, and why match_one cannot see the problem (Phase 29 SESSION-19, func_8017C954) _L6323
• §88d — BANKING ORDER: run the §81 carve chain BEFORE banking, never after _L6701
• §97 — The gate's own tree hygiene: a refused carve, an unchecked recovery, and a snapshot that captured a dirty tree (Phase 29 SESSION-22) _L7066
• §105 — A gate's revert must survive an EXCEPTION, not just a failure (Phase 29 T53, jtbl_family_bank) _L7431
• §125 — Split the CARVE from the BODY before calling a jr residue a wall — and measure it by SHA from a CLEAN tree (P30 SESSION-28; this section's first draft was WRONG and the method caught it) _L8206
• §126 — The carve-within-a-carve: an ADDRESS RANGE is not an OPTIMIZATION REGION (P30 T2, byte-proven end-to-end) _L8264
• §129 — Post-carve, rtu_match/match_one COUNT THE JUMP TABLE AS INSTRUCTIONS; and a carve must never be committed without its owner (P30 S28, func_8013BD74) _L8437
• §129a — the target instruction count is INFLATED after a carve _L8441
• §129b — never commit a carve whose owner is still a stub (it strands the carve) _L8462
• §130 — An INCREMENTAL build can report BYTE-IDENTICAL for a change the CLEAN build cannot even LINK (P30 S28, the jr pair) _L8486
• §131 — The jtbl OVER-SPAN: sltiu N is ground truth in BOTH directions, and the zero-word rule only guards one (P30 S28, func_80191C50) _L8533
• §132 — The JR-PAIR-IN-ONE-O0-OBJECT "wall" was TWO instrument defects: a merged-double span the carve could not see, and a truncated object no rule deleted (P30 S29, func_8013B83C + func_8013BD74) _L8570
• §132b — When the span's already-matched owner is ITSELF multi-switch: --span-rel (P30 S1, func_8014032C) _L8660
• §139 — A GATE THAT GREPS FOR VERDICTS MUST ASSERT 1:1 ACCOUNTING; and a --src filter must not survive a carve (P30 S38, wave 6: 10 of 16 drafts vanished) _L9594
• §161 — THE RETRY-WAVE HARVEST: a jump table indexed from zero, and two allocator traps (P30 S47) _L10969
• §179-F — PINNING A LOOP-WALKED POINTER IS A TOTAL OFF-SWITCH FOR STRENGTH REDUCTION _L17519
• §188 — 🔴 THE jr $ra + addiu $sp TAIL IS AN ASSEMBLER ARTIFACT, NOT A FRAME SHAPE _L18157
• §199-D — A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is the WIDTH of a real object, and a widening (s32) cast is inert — AMENDS §35 (whose stated "only CSE-reuse canonicalizes" mechanism is byte-wrong) and does NOT apply inside a switch _L20833
• §199-G — At TWO case nodes the switch-vs-if oracle is not blind — but the tell is ALL tests positive + a trailing j default, NOT the first test's polarity _L21006
• §206 — THE JTBL-CARVE DRAFTING IDIOM: the bounds check is the entry count, and an EMPTY case owns a slot (P31 S56) _L22085
• §222 — SWITCH vs IF-CHAIN, PART 3: source arm order IS emission order, a leading EMPTY case buys the median split, and a 2-way dispatch with a shared post-block is a switch (P31 S58) _L22750
• §232 — WHEN THE jr DELAY SLOT'S STORE STORES THE RETURN VALUE, TIE THEM WITH ONE PSEUDO (single observation — not yet cross-confirmed) (P31 S58) _L23136
• §256 — GOTOS IN THE TARGET'S BLOCK ORDER REPRODUCE SWITCH PLACEMENT WITHOUT SWITCH'S SIDE EFFECTS (P31 S58b) _L24029
• §222 — addendum (P31 S58b) — IF-CHAIN vs SWITCH: THREE MORE DISCRIMINATORS _L24433
• §260-A — STAGE 2 IS PROVEN, AND THE WHOLE jtbl PIPELINE IS AUTOMATED AT THE GATE (P31 S59, same day) _L24728
• ADDENDUM — to §8 — WHEN INCLUDE_RODATA NEEDS A STANDALONE .s YOU CAN'T CREATE, CARRY THE FRAGMENT AS A FILE-SCOPE __asm__ BLOB _L26134
• ADDENDUM — §NNN — sharpens §55a / §164-37 / §165-28 (switch-vs-tree cluster): A SHAPE THAT LOOKS LIKE A SWITCH DISPATCH CAN BE PLAIN NESTED ifs WHOSE SHARED BODY WAS TRIPLICATED BY THE SOURCE AND THEN CROSS-JUMP-MERGED BACK DOWN _L28135
• ADDENDUM — §NNN — sharpens §162a3/§60b: A sll $v0,16 / sltiu $v0,1 ZERO-TEST OF A JUST-DECREMENTED HALFWORD IS A SIGNED-TEMP WIDTH TELL OUTSIDE ANY SWITCH/RANGE-TEST CONTEXT _L28205

optimisation level (-O0/-O2) (16)

• §6 — Per-module optimization mixing — the -O0 boot module (Phase 7) _L246
• Detecting — the opt level (do this first) _L254
• Build — mechanism — per-file opt override (splat resegmentation) _L288
• §18 — Per-file -O0 split inside an overlay/blob (Phase 19 T1) _L1519
• §38 — The WHALE func_80144B9C (770 ins): the -O0 struct-assign memcpy idiom + the -O0 reach-134 ×134 rollout (Phase 24 T7 §G, cheap Opus — no Fable5, no calls.c) _L2527
• §39 — The ×1→×134 giant-endgame: propagate a matched -O2 giant via the NATIVE DEFINE-macro path (Phase 24 T7 §G close, 2026-07-08) _L2537
• §116 — Optimization level is a property of the FILE, not the function: read a family 0/N against the member's stub HOME (Phase 29 T79) _L7877
• §3-The — finding: opt level is per FILE, so the file's contents must be opt-HOMOGENEOUS _L8279
• §127 — The -O0 regime: the CONSTANT-OFFSET FOLD, and why -O0 needs its own idiom set (P30 T3 wave, 15 targets) _L8349
• §3-The — rest of the -O0 regime (write PLAIN C, and mean it) _L8367
• §127a — §71 (sibling-first) is the strongest -O0 lever, and it beats the index _L8377
• §132 — The JR-PAIR-IN-ONE-O0-OBJECT "wall" was TWO instrument defects: a merged-double span the carve could not see, and a truncated object no rule deleted (P30 S29, func_8013B83C + func_8013BD74) _L8570
• §195-K — At -O2 the §18 array-of-struct lever is a FRAME lever, not a length lever — but only when the N reads carry DISTINCT index expressions; with a SHARED index §18's +2-instruction residual is still alive at -O2 (the submitted "memory-loaded narrow index" precondition and unconditional length-neutrality are both falsified) _L20244
• §261 — THE -O0 ORACLE: DERIVE THE OPT LEVEL FROM THE TARGET, AND $fp IS NOT THE TELL (P31 S59) _L24764
• §261a — THE -O0 FRAME-RELOAD GRAMMAR: reload COUNT disambiguates the C spelling (P31 S59, byte-proven) _L24790
• §265 — THE VERBATIM-ASM BANK LANE: A FUNCTION NO -O2 C CAN EVER MATCH BANKS AS A RAW __asm__ BODY (P31 S59b; two banked cards, two in-tree precedents) _L24930

family propagation & sweeps (104)

• §8d — Templating a body INTO a TU must not CHANGE its declaration environment — demote the carried data externs (Phase 26 session 8, byte-proven on func_8015AE2C ×133) _L483
• §11 — Cross-binary dedup & code-sharing (Phase 11 — "one match unlocks many") _L908
• §3-The — mechanism: game-code dedup is SOURCE-LEVEL, not an object swap (R-D1, the key lesson) _L926
• §3-The — flat-blob overlay config (what the template encodes) _L1071
• §3-THE — NON-4-ALIGNED-OVERLAY GOTCHA (≈75% of the fleet; fixed in the template + Makefile, automatic) _L1079
• §14 — Propagate a matched function across the fleet — tools/dedup_propagate.py (Phase 15) _L1126
• §19 — Scaling the toolkit waves — the recovery PIPELINE + the propagation CAP (Phase 19 T3) _L1597
• §24 — The ov_SC01_077_a.c split-file vein: split-aware propagation, but loose-typing-gated (Phase 21) _L2085
• §25 — The "schedule" class is mostly COALESCING (pin-crackable), not scheduling; + the gate two-stage + h_exact over-counts ×134 (Phase 21, cont.6) _L2132
• §3-h — _exact OVER-COUNTS ×134 — verify shareability before crediting a class's "reach-134" (R14) _L2177
• Where — this leaves the reach-134 tail (cont.6 option-3, now CONFIRMED byte-backed) _L2233
• §28 — Banking a "close=0 gate-rejected" giant: the canonical-extern recovery (Phase 22 T1, byte-proven on func_8015126C ×134) _L2325
• §28c — The close=0 recovery is NOT fully exhausted (§26 corrected, R14); + the dedup_propagate registry-skip recovery (Phase 22 T2) _L2352
• §28b — The struct-walled close=0 giant (§28 case #3) IS bankable: the engine_types.h type-lift (Phase 22 T2, byte-proven on func_80156B74 ×134) _L2357
• §28d — The "macro-extern-injection" lever: freeing reach-134 inline matches dedup_propagate skips as "not self-contained" (Phase 23, tools/inject_capped_externs.py) _L2366
• §30 — Fable5Max cracks §20/§10 "unsteerable" from the gcc SOURCE: store-vs-load is a /s aliasing flag, the def-side wall has a macro escape, + the birthing-boost (Phase 23, byte-proven on giant func_8014EE14 248 ins ×134) _L2382
• §34 — The func_80138ED0 giant crack: gcc-2.7.2's 3-qty sort bug + the zero-byte asm allocation toolkit + the giv-init fence (Phase 24 T5; Opus→close=21, Fable5→MATCH ×134) _L2454
• §38 — The WHALE func_80144B9C (770 ins): the -O0 struct-assign memcpy idiom + the -O0 reach-134 ×134 rollout (Phase 24 T7 §G, cheap Opus — no Fable5, no calls.c) _L2527
• §39 — The ×1→×134 giant-endgame: propagate a matched -O2 giant via the NATIVE DEFINE-macro path (Phase 24 T7 §G close, 2026-07-08) _L2537
• §40 — Structural families: the MECHANICAL symbol-remap (crack one exemplar → remap the rest, ~0 tokens) (Phase 25 T3/T7, 2026-07-08) _L2553
• §40a — The DECL-RECONCILE pass (type-lift so remapped drafts compile in the sibling TU) (Phase 25 T7.2, 2026-07-08) _L2601
• §40b — The reloc-tracker blind spot: the indexed-global idiom that hid the "reach-1 tail" (Phase 26 Task 1, 2026-07-11, byte-verified V0/V1) _L2634
• §40c — The h_seq per-sibling reconcile: templating a reconcile-class crack ×134 (Phase 26 Task 8, 2026-07-12, byte-proven) _L2676
• §41c — T7-M2: the ×134 def-side-wall sweep via per-sibling RE-reconcile (Phase 25, 2026-07-10; 4,389 banks, ~0 agent tokens) _L2839
• §42 — The F-band ≤28 regalloc crack wave: register-pin/DENSITY levers beat the permuter (Phase 25 T7 F-band, 2026-07-10; Ultracode 9-worker wave, 4/9 banked byte-identical, 266 swept ×134) _L2900
• §42e — propagating a CRACK ×134: the def-finder bug + the byte-drift residual (the "remap-fail" misdiagnosis) _L3121
• §43 — The K&R s16-param definition DISSOLVES the "narrow-param wall" for by-value register args (Phase 25 task A, Fable5 crack of the 369-ins giant func_80166994 ×134, 2026-07-11) _L3195
• §45 — The flagship func_80133CD4 crack (399 ins ×134): the merged-variable permutation-breaker + the 1-death local-alloc gate (Phase 25 task A giant escalation, Fable5 gdb-on-cc1, 2026-07-11) _L3298
• §46 — The func_80178D40 crack (890 ins ×134, the heaviest core in the game): four LOOP-STRUCTURE levers cheap-Opus found by reading loop.c/jump.c/cse.c (Phase 26 session 8, 2026-07-13) _L3313
• §47 — The live-length SLIDER: splitting a global.c allocno-priority TIE with one zero-byte asm (Phase 26 session 8, Fable5 Max, byte-proven on func_8017BEBC 952 ins ×113) _L3365
• §49 — The LUID DIAL: a zero-byte SCHEDULING dial (the sched.c analogue of §47) — func_8017A4AC (536 ins ×134), Phase 26 session 8 _L3527
• §52 — The WALKER-FAMILY skeleton: 6 regalloc-order levers + a deeply-characterized intrinsic wall (func_80178004, 165 ins ×134; Phase 26, Fable5, 2026-07-15) _L3913
• §3-The — 6 levers (the "walker-family skeleton" — apply to the 12 siblings; levers 1-5 retire ~half the residual) _L3924
• §53 — SWEEP A FAMILY WITH THE TOOL ITS EXEMPLAR NEEDED: the jr/switch carve, and how omitting it manufactured the "families don't template" doctrine (Phase 28 T1, 2026-07-15) _L4028
• §55c — Sizing the propagate: a TARGETED propagate is ~4 min/core, and "it's slow" was a BROKEN-TREE ARTIFACT _L4141
• §54 — --fix-def-sig: the member's CANONICAL DECLARATION is a build step too (tiny-IMM mega-pools, +4,801, Phase 29 T6, 2026-07-16) _L4163
• §56 — Banking a hand-drafted GIANT into its exemplar TU: self-contained draft vs live-TU decls, 4 reconciliation tactics (func_8013FAF8, 312 ins ×138, Phase 29 T4, 2026-07-17) _L4187
• §56b — PROPAGATING an h_seq giant: the exemplar's externs MUST be fleet-canonical, not the draft's types _L4232
• §57 — The SELF-decl normalize: the sibling's OWN caller declares the templated fn divergently (the third §17a-1 direction; tools/normalize_self_decls.py, func_801670E4 ×137, Phase 29, 2026-07-18) _L4256
• §57a — Two NSD corrections + the SURGICAL-ONLY law + the honest broad-sweep yield (Phase 29, 2026-07-18) _L4303
• §59 — Three h_seq sweep-residual classes match_one/the-exemplar-bank don't reveal (Phase 29 crack-wave close, 2026-07-18) _L4377
• §3-Two — corollaries worth remembering _L4450
• §65a — The blast-radius taxonomy (makes §61's law structural instead of remembered) _L5030
• §3-Giv — record order (the §70 family) _L5760
• §75 — A propagation cap is usually a MINORITY-SPELLING SOURCE OVERLAY, not a wall: census the carried extern before believing the exclusion message (Phase 29 SESSION-19, func_8014F3E8 ×4 → ×138) _L5866
• §75a — The exclusion classes, enumerated with named causes (Phase 29 SESSION-19, the 134-binary dedup_extend sweep) _L5925
• §75b — A body's preamble can carry #defines, not just externs; extraction lifts only the externs (Phase 29 SESSION-19, func_80165CA0 ×3 → fleet) _L5948
• §76 — The allocno CLASS (local vs global) is the dominant regalloc lever, and C reaches it ONLY through declaration scope and variable reuse (Phase 29 SESSION-19, behemoth #3 func_8017F510 1,511 ins, 97 → MATCH, pin-free) _L6028
• §77 — Every extraction tool carries a NARROW hard-coded preamble set; anything outside it silently caps the body's reach. Diff the preamble before you gate. (Phase 29 SESSION-19 — three variants in one session, two different tools) _L6084
• §84 — The DERIVED-OFFSET remap bug: a hand-computed literal that encodes the DISTANCE between two per-overlay symbols, and why match_one is structurally blind to it (Phase 29 SESSION-20, func_8013D53C) _L6472
• §86 — Pinned-exemplar templatability is a PER-FAMILY property, not a per-member rate; and the §42e pin guard is now over-conservative (Phase 29 SESSION-20) _L6589
• §3-THE — LAW: all-or-nothing PER FAMILY _L6600
• §3-Why — the two live families differ from the three dead ones — the open question _L6627
• §3-The — cheap discriminator, before spending a sweep _L6666
• §89b — the parallel gate farm existed; the family path could not reach it (tools/sweep_parallel.py) _L6745
• §91 — A structure-TRANSFER is only valid where the structure corresponds: the --like role trap (Phase 29 SESSION-21, func_8012AAAC ×137) _L6842
• §94 — A family sweep's 0/N is a TYPE-CARRY failure until proven otherwise: lift the exemplar's local types, ALL of them, transitively (Phase 29 SESSION-21, func_8016B6BC 0/137 → 137/137) _L6947
• §105 — A gate's revert must survive an EXCEPTION, not just a failure (Phase 29 T53, jtbl_family_bank) _L7431
• §107 — A lever wired into ONE gate path is a lever most families cannot reach (Phase 29 T56, func_80144090 0/136 → 136/136) _L7513
• §108 — Diagnosing a family 0/N: the four causes, and the third opt-in lever (Phase 29 T59) _L7551
• §111 — The distinct-code metric is not noisy: a family pays it only if its members are byte-VARIANT (Phase 29 T66) _L7681
• §116 — Optimization level is a property of the FILE, not the function: read a family 0/N against the member's stub HOME (Phase 29 T79) _L7877
• §123 — PROPAGATE A FAMILY WITH THE TOOL ITS TIER NEEDS: dedup_propagate is h_exact-only; its refusals are statements about the TOOL (P30 wave 1, 2026-07-30) _L8116
• §124 — A "not matched" verdict can mean the definition is there under a DIFFERENT C NAME: the asm-label alias blind spot (P30 SESSION-28, func_8016191C ×137) _L8153
• §124a — a family sweep's 0 matched-exemplar families may be a FILTER, not a wall _L8198
• §134 — MULTI-LINE BLINDNESS: one root cause, four faces, in family_remap's preamble scanner (P30 S6, 190 zero-crack families) _L8711
• §136c — SIBLING-FIRST is a DERIVATION shortcut, not just a conflict fix (the fastest route in a family wave) _L9069
• §138 — The propagation lanes: a gate refusal is a DECLARATION, and which lever you owe depends on blast radius _L9415
• §142 — An open stub whose h_exact class is MATCHED elsewhere is FREE. Propagate the body; do not gate a draft. (P30 S39, +7,710 ins in two commands) _L9778
• §143 — cast_call_sites read a RETURN STATEMENT as a prototype and deleted it. A 0/39 sweep became 18/39. (P30 S40) _L9834
• Then — propagation returned 0/137 TWICE — both times a missing TYPE _L10000
• §3-A. — The frame has THREE strata, and stratum 3 is unreachable from C _L10041
• §3-E. — A qty_compare TIE is not spelling-reachable — recognise it and stop _L10083
• Consequence — for the family (a real scheduling decision) _L10095
• §150 — A register ROTATION across symmetric blocks is VARIABLE-IDENTITY evidence, not an allocator tie (P30 S43, func_8017C6F4, 947 ins ×4) _L10312
• §151 — THE GHOST WEDGE: when a load-before-store transposition is unreachable by ANY statement order (P30 S43, func_8017EF68, 969 ins) _L10367
• When — to reach for it _L10407
• §152 — BYTE SIZE is the family key that name- and h_seq-grouping both miss (P30 S43, the 0xECC family: 1 crack → 12 overlays → 11,364 ins) _L10418
• §156 — an ORPHANED reconcile poisons the fleet: dedup_propagate's kept edit (S45 p6/p7) _L10640
• §160 — THE REACH-15 WAVE HARVEST: an align-1 block move, and the instrument that called it a wall (P30 S47) _L10893
• §162 — S48 WAVE-1 HARVEST (P30, 2026-08-11): the reach-ordered sibling campaign's first 12 targets _L11014
• §163z — THE UNVETTED REMAINDER (do not cite as law; each needs a dedupe pass) _L11828
• §3-The — ADDRESS-CLASS TABLE: which load/store pairs even REACH the /s clause (P30 S48 wave 4, func_80185B44, ov_SC03_014) _L14342
• §168 — THE COUSIN TIER (P30 S49, 2026-08-12): h_seq's exact-hash brittleness, measured — and the similarity map above it _L16211
• §171a — THE MECHANICAL A-PROP DRAFT (P30 S50): 256 members banked with no agent in the loop _L16420
• §171b — THREE CARRIES THE MECHANICAL DRAFT NEEDS (P30 S50, banking the top-reach families) _L16470
• §3-G. — TWO MODELLING TRAPS THAT COST THESE AGENTS SWEEPS OF HUNDREDS OF COMPILES _L17297
• §193-E — A varying-address (pointer) load is re-emitted once per CSE-LIVE INTERVAL, and naming it in a C local is the only C-level lever over that count — no store SPELLING has any reach _L18633
• §194-E — The wave card's exemplar is the TARGET ITSELF on 42/73 wave-U and 36/71 wave-T cards — a construction consequence of atlas.py:657 (exemplar = max-nins OPEN member) meeting build_wave_atlas.py:166 (one card per gid); and the shipped §193-A seed_ref is same-binary on 0/51, so no card field can ever name a destination-TU sibling _L19139
• §195-E — A 0/1 materialised at a JOIN immediately before the controlling beqz/bnez proves the source NAMED the condition — a truth expression in an if's controlling position reaches do_jump, which has no value path _L19930
• §199-B — A permutation sweep that holds ANY statement fixed is not a sweep: the statement an agent pins as "obviously load-bearing" is the one carrying the signal, and the partial sweep returns a FLAT residual that reads as proof of order-invariance _L20740
• §203 — A DEDUPED TYPEDEF MUST PRECEDE EVERY SPLICE POINT, NOT JUST ITS OWN (P31 S56) _L21459
• §225 — THREE CONTROL-FLOW SHAPES NO STRUCTURED SPELLING REACHES (P31 S58) _L22890
• §30 — addendum (P31 S58b) — THE ANONYMOUS STRUCT MEMBER REF GRANTS /s, AND THAT IS A TWO-FOR-ONE _L24114
• §3-1a. — The §266 sweep — every solo-lever A/B run for this batch _L25438
• ADDENDUM — to §179-D (GTE macro reference family) — gte_SetRotMatrix/gte_SetTransMatrix bodies _L25629
• ADDENDUM — to §82 — struct copies must stay MEMBER-WISE, not block-moved, to match a spill-slot save _L25655
• ADDENDUM — to §136d-1 (RC-12, the $0-add / opaque-copy family) — two symptoms beyond "compare reads the wrong register" _L25693
• §282 — gcc's OWN LOOP REVERSAL PUTS THE COUNTER INIT AFTER THE HOISTED MOVABLES — a position no hand-written down-count can reach (P31 S60; wave cf, func_80180DD8, ov_SC04_005, byte-proven) _L26948
• ADDENDUM — to the zero-byte-asm-slider family (§47 / §148-C / §153) (func_800CB874, md_MAIN_040 — wave dj; open tension with a more cautious dm-wave card — see closing) _L27867
• ADDENDUM — the zero-emission-asm family gains a REF-SLIDER PLACEMENT LAW and a paired RESTORER (func_800CB900, md_MAIN_026) _L28077
• ADDENDUM — §NNN — sharpens §37/§124 (unspecified-parameter-list family): DERIVE A CALLEE'S ARITY LOWER BOUND FROM ITS OWN .s STACK-ARGUMENT READS, NOT FROM ANY SINGLE CALL SITE _L28238
• ADDENDUM — to §199-F family (func_8017EFB0, ov_SC02_021, wave cu) _L28390
• §287 — A STACK-FRAME HOLE BELOW TWO ADDRESS-TAKEN AGGREGATE LOCALS IS A LEADING PAD MEMBER OF ONE COMBINED STRUCT, NOT SEPARATE LOCALS OR A REGISTER PIN (P31 S60/dj; func_8017D104, ov_SC06_027, byte-proven 47/47) (P31 S60; waves #, byte-proven) _L28998

integration / TU plumbing (59)

• §8c — Splitting a TU means rebuilding its DECLARATION ENVIRONMENT, not moving text (Phase 26 session 6) _L437
• §8d — Templating a body INTO a TU must not CHANGE its declaration environment — demote the carried data externs (Phase 26 session 8, byte-proven on func_8015AE2C ×133) _L483
• §9.3 — Make it the build: resegment + swap + resolve (tools/psyq_integrate.py, libcd DONE) _L685
• §9.4 — Integrating a SECOND library (libgs block 6 after libcd) — multi-library gotchas _L712
• §9.5 — Integrating a WHOLE multi-block library in one call (full libgs — Phase 7 session G) _L740
• §17a — The TOOLKIT at WAVE scale (Phase-18 Step-3b/Step-1 — measured) + the pipeline-integration gotchas _L1445
• §3-THE — CAP: at this tail the match_one→gate gap is the LOOSE-TYPING CALL-GRAPH wall (not cheap plumbing) _L1637
• Diagnostic — lesson: a failed in-TU build leaves a STALE .o _L1654
• §28d — The "macro-extern-injection" lever: freeing reach-134 inline matches dedup_propagate skips as "not self-contained" (Phase 23, tools/inject_capped_externs.py) _L2366
• §30a — §30 generalizes to the FULL near-miss backlog (via STANDARD Opus agents, not just Fable5) + 2 more steer levers + the mechanical-integration throughput unlock (Phase 23 (a)) _L2394
• §40a — The DECL-RECONCILE pass (type-lift so remapped drafts compile in the sibling TU) (Phase 25 T7.2, 2026-07-08) _L2601
• §42a — addendum — wave 2 (residuals + 29-100 band): iso-MATCH ≠ real-TU bank, the memcpy→struct-assign fix, +5 levers (2026-07-10b) _L2953
• §42c — addendum — wave 3 (Max orchestrator + CORRECTED Ultracode fan-out, 2026-07-10c): the real-TU-faithful parallel harness (rtu_match) + 7/9 crack, ZERO iso-drift _L3033
• §56 — Banking a hand-drafted GIANT into its exemplar TU: self-contained draft vs live-TU decls, 4 reconciliation tactics (func_8013FAF8, 312 ins ×138, Phase 29 T4, 2026-07-17) _L4187
• §61 — Task 14: the gate ladder's missing stage is the ARITY pre-pass, and it is TU-side not draft-side (Phase 29, 2026-07-21) _L4545
• §61a — The Task-5 wave: 11/12 MATCH, 0 banked — three DISTINCT integration walls, each now named (Phase 29, 2026-07-21) _L4606
• §63 — The fresh-138 DEF-SIDE blocker: fix the HEADER decl, not the draft (fix_header_decl.py, Phase 29 SESSION-13, 2026-07-23) _L4877
• §63 — UPDATE (Phase 29 SESSION-14) — fix_header_decl's "SAFE" verdict is FLEET-BLIND; it MUST be R22-validated _L5000
• §65 — The stranded-draft recovery: BLAST-RADIUS TIERS, and the per-overlay de-macroize that refutes §20's DEF-conflict wall (tools/demacroize.py + tools/blocker_probe.py, Phase 29 SESSION-16, 2026-07-24) _L5015
• §65b — The escape: de-macroize the instantiation, don't touch the shared header _L5045
• §65f — The de-macroize lever's BOUNDARY, measured: byte-neutral 14 times of 15, and the 15th is why the gate exists _L5118
• §65g — Where the cheap levers STOP: the local-type and in-TU-self-decl classes did not yield _L5139
• §85 — The RETURN-axis fleet widen is ALL-OR-NOTHING: widening the shared header alone guarantees a conflict in the source overlay (Phase 29 SESSION-20, func_8012CC88 / func_8014D12C) _L6539
• §95 — reconcile_tu dropped the SIBLING declarators of a multi-symbol extern line (Phase 29 SESSION-21, func_80176218) _L6983
• §96 — The same rewrite, one shape down: reconcile_tu matched statements to lines by TEXT, so every COMMENTED declaration was silently skipped (Phase 29 SESSION-22, func_80176218 banked) _L7018
• §3-Two — reconcile_tu bugs found underneath, one introduced while fixing the other _L7190
• §100 — Prefer the DRAFT-LOCAL fix: a type only one function uses belongs in its BODY, not in a shared header (Phase 29 SESSION-22, func_80175DA8 0/137 → 137/137) _L7216
• §102 — A PLUMBING verdict can MASK a DIFF; and K&R is not always a codegen change (Phase 29 SESSION-22, func_8016EC0C) _L7272
• §103 — A FILE-scope extern in a shared overlay TU is a GLOBAL constraint on every LATER function; move the DECL, not the draft (Phase 29 T48/T51, func_80135260 — the fleet-wide half) _L7307
• §109 — Conforming a definition to a shared header: fix the NAMES, then check the RETURN precondition (Phase 29 T60) _L7600
• §112 — A macro-scoped declaration only collides where the macro is INSTANTIATED (Phase 29 T67/T69, audit_header_sigs.py) _L7730
• §114 — The THIRD decl axis: a CALLEE the draft declares differently from the target TU (Phase 29 T76/T77) _L7808
• §3-The — integration idioms (these decide whether a byte-correct draft BANKS) _L8804
• §3-The — declaration surface (integration, not codegen) _L8941
• Reconciling — a gate-refused draft: which way you edit depends on WHERE the TU's decl is _L9565
• §3-The — same swallow, twice more, in the integration spine _L9709
• §3-A. — Payload word0 is a global MODULE ID; code starts after the header _L10527
• §162 — THE LICM PAIR: what makes an address a movable AT ALL, and why the preheader order is the body order (P30 S47, ov_MAIN_012) _L11143
• §166 — THE DESTINATION-TU ORACLE (P30 S48): the seven-attempt bug that was never codegen _L14902
• §173 — THE STORED-PLUMBING RECOVERY RECIPE (P31 T6): symfix-first, per-group isolation, and where the verdicts have no drafts _L16616
• §176d — THE CONFLICT TABLE MUST BE SEEDED FROM THE TU, AND KEYED PER FILE (P31 S52, 2026-08-15) _L16813
• §180b — WHAT THE PRE-GATE LADDER ACTUALLY FINDS IN A COLD PILE (the shape of integration debt) _L17823
• §185 — EDIT THE SIDE THAT IS CHEAP TO VERIFY, AND CHECK A TU RETYPE AT ITS USE SITES _L18041
• §194-E — The wave card's exemplar is the TARGET ITSELF on 42/73 wave-U and 36/71 wave-T cards — a construction consequence of atlas.py:657 (exemplar = max-nins OPEN member) meeting build_wave_atlas.py:166 (one card per gid); and the shipped §193-A seed_ref is same-binary on 0/51, so no card field can ever name a destination-TU sibling _L19139
• §195-J — GTE / PsyQ op CALL-vs-INLINE is a PER-SITE SOURCE FACT, not a TU style — both forms coexist in one TU (measured in 2 TUs), and the tell is the target's own opcodes (lwc2/sqr/swc2 vs jal), not the sibling. Costs -8 ins on func_8018505C. Corollary: the game's inline sqr macro emits TWO hazard nops, the SDK's Square0 body emits ONE — so the inline form is provably not Square0 inlined (a second instance of §187's SDK-vs-game GTE nop divergence). _L20200
• §199-D — A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is the WIDTH of a real object, and a widening (s32) cast is inert — AMENDS §35 (whose stated "only CSE-reuse canonicalizes" mechanism is byte-wrong) and does NOT apply inside a switch _L20833
• §200 — THE ALIAS IS THE UNIVERSAL DECLARATION ESCAPE: stop negotiating with the TU's spelling (P31 S55) _L21072
• §201-A — §150-B applies to decl_prior's DEF row: for an overlay-window symbol the banked "definition" is usually another overlay's function, and the card ranks it ABOVE the destination TU _L21131
• §203 — A DEDUPED TYPEDEF MUST PRECEDE EVERY SPLICE POINT, NOT JUST ITS OWN (P31 S56) _L21459
• §210 — THE SINGLE-BIT MASK IN A BOOLEAN TAIL: andi K ; sltu $zero,v vs srl n ; andi 1 is a STATEMENT-SHAPE dial, not an operator choice (P31 S58) _L22301
• ADD-2 — → §42a addendum — A SHARED CONSTANT NAMED IN A LOCAL ACROSS A jal IS AN ISO→TU DRIFT HAZARD; WRITE BARE LITERALS _L25049
• ADD-3 — → §236, item 10 — THE UN-DELETED INCLUDE_ASM STUB IS A DUPLICATE DEFINITION _L25061
• ADD-2 — → §236 addendum (item 1 corollary) — THE SILENT-SPLICE DECLARATION LADDER: WHERE THE TU HAS NO SPELLING, UNPROTOTYPED () BEATS THE FLEET VOTE _L25279
• §273 — A standalone compile is the WRONG oracle for a TU-destined draft (P31 S59) _L25531
• ADDENDUM — to §134 — a typedef defined BELOW the splice point is stripped anyway _L25599
• ADDENDUM — to §8 — WHEN INCLUDE_RODATA NEEDS A STANDALONE .s YOU CAN'T CREATE, CARRY THE FRAGMENT AS A FILE-SCOPE __asm__ BLOB _L26134
• §280 — THE CURSOR'S DECLARED TYPE PICKS sltu vs slt: a T* bound test is UNSIGNED by C rule, an integer cursor is signed (P31 S60; wave cf, func_800CAE74, md_MAIN_031, byte-proven) _L26868
• §NNN — A LOOP CURSOR'S C TYPE (POINTER vs PLAIN INTEGER) SELECTS sltu vs slt FOR ITS BOUND TEST, INDEPENDENT OF THE VALUES INVOLVED (P31 S60; func_800CAE74, md_MAIN_031, byte-proven; cross-confirmed same wave by func_8017F2A4, ov_SC03_096) _L26869
• ADDENDUM — to §199-G — A default: LABEL GROUPED ONTO THE LAST CASE REMOVES THE j default TAIL, EVEN THOUGH THE 2-NODE HEADER STAYS ALL-POSITIVE _L27323

build graph, splat & the harness (163)

• §4 — Flag/toolchain gotchas _L190
• Build — mechanism — per-file opt override (splat resegmentation) _L288
• §8c — Splitting a TU means rebuilding its DECLARATION ENVIRONMENT, not moving text (Phase 26 session 6) _L437
• §9 — Link real PsyQ library objects byte-exact (Phase 7 — GO proven) _L613
• §9.1 — Generalised per-object linker — tools/psyq_link.py (+ psyq_link_lib.py), 18/18 libcd byte-exact _L642
• §9.2 — Wire a library region into the build with NOLOAD — no data carving (tools/psyq_link_region.py) _L666
• §9.3 — Make it the build: resegment + swap + resolve (tools/psyq_integrate.py, libcd DONE) _L685
• §9.6 — Scaling library linking to the whole EXE (Phase 8 — 8 libs linked, 20%→50% byte-identical) _L766
• §9.7 — Binary-agnostic toolchain refactor (Phase 9) — the reusable pattern for Gen2 _L802
• §3-The — clean object-level metric (use this, not the permuter score, for jtbl/rodata functions) _L844
• §3-The — mechanism: game-code dedup is SOURCE-LEVEL, not an object swap (R-D1, the key lesson) _L926
• Per-binary — toolchain provenance (R24) _L959
• §12 — Ultracode harvest — parallel-draft + byte-gate at scale (Phase 12, resident: 1.4%→71.7% in one session) _L964
• One-command — onboarding — tools/new_overlay.sh <SCxx> <FILE_nnn> _L1062
• §3-THE — NON-4-ALIGNED-OVERLAY GOTCHA (≈75% of the fleet; fixed in the template + Makefile, automatic) _L1079
• Fleet — build — make build-all / make check-all _L1120
• §14 — Propagate a matched function across the fleet — tools/dedup_propagate.py (Phase 15) _L1126
• §14b — Harvesting the UNMATCHED shared core — the match_one wall (Phase 15) _L1192
• §14c — Callee-signature-aware harvest — breaking the extern-type-conflict wall (Phase 15, T6) _L1213
• §17 — The compiler-quirk wall — the matching TOOLKIT (Phase 18; gcc-2.7.2 source + byte-gated) _L1376
• §3-The — pipeline gotcha — match_one ≠ the gate; sig_unify is MANDATORY _L1421
• §17a — The TOOLKIT at WAVE scale (Phase-18 Step-3b/Step-1 — measured) + the pipeline-integration gotchas _L1445
• §19 — Scaling the toolkit waves — the recovery PIPELINE + the propagation CAP (Phase 19 T3) _L1597
• §20 — The wave-at-scale GATE CAP + residual-class verdicts (Phase 20) _L1632
• §3-THE — CAP: at this tail the match_one→gate gap is the LOOSE-TYPING CALL-GRAPH wall (not cheap plumbing) _L1637
• Diagnostic — lesson: a failed in-TU build leaves a STALE .o _L1654
• Phase-20 — RESOLUTION — tools/cast_call_sites.py BUILT + the cap re-diagnosed (R14, byte-proven) _L1701
• §24 — The ov_SC01_077_a.c split-file vein: split-aware propagation, but loose-typing-gated (Phase 21) _L2085
• §25 — The "schedule" class is mostly COALESCING (pin-crackable), not scheduling; + the gate two-stage + h_exact over-counts ×134 (Phase 21, cont.6) _L2132
• §3-The — gate two-stage — sig_unify is a FALLBACK, not unconditional (gate_stage.py, §19 folded in) _L2189
• §28 — Banking a "close=0 gate-rejected" giant: the canonical-extern recovery (Phase 22 T1, byte-proven on func_8015126C ×134) _L2325
• §28c — The close=0 recovery is NOT fully exhausted (§26 corrected, R14); + the dedup_propagate registry-skip recovery (Phase 22 T2) _L2352
• §28d — The "macro-extern-injection" lever: freeing reach-134 inline matches dedup_propagate skips as "not self-contained" (Phase 23, tools/inject_capped_externs.py) _L2366
• §29 — Reasoning-model (GLM5.2) DEF-side reconciliation idioms + the wall's hard limit (Phase 23 T10.7, tools/glm_reconcile.py) _L2374
• §33 — Automating the giant decl-reconcile: tools/reconcile_decls.py (the DATA analog of §20's cast_call_sites) + a fleet-majority type oracle (Phase 24 T7b, byte-proven on func_80129CF8) _L2434
• §34 — The func_80138ED0 giant crack: gcc-2.7.2's 3-qty sort bug + the zero-byte asm allocation toolkit + the giv-init fence (Phase 24 T5; Opus→close=21, Fable5→MATCH ×134) _L2454
• §35 — The region-a sibling-giant harvest: difficulty ≠ $s-reg count (it's global-array hoisting) + the banking recipe + new loop idioms (Phase 24 T7, 5 parallel Opus-Max agents) _L2471
• §37 — The T7 §G giant endgame: 6/8 cracked, meta-laws + transferable levers (Phase 24, 2026-07-07; FULL byte-verified detail + gcc-2.7.2 line cites in docs/gcc-2.7.2-map/t7g-giant-harvest.md) _L2506
• §39 — The ×1→×134 giant-endgame: propagate a matched -O2 giant via the NATIVE DEFINE-macro path (Phase 24 T7 §G close, 2026-07-08) _L2537
• §41 — The DEF-SIDE canonical-sig wall: mechanically banking a drafted giant past conflicting types (Phase 25 T5b batch-2, 2026-07-09; tools/canon_sig_reconcile.py, byte-proven on func_8013B274) _L2710
• §41a — v3.1: the def-side wall was ~71% TOOL-shaped — the five measured defects + the laws that dissolve them (Phase 25 T6, Fable5, 2026-07-09) _L2754
• §41b — T7 execution: the object-only probe OVER-counts BANKABLE by two link/rodata classes (Phase 25 T7-M1, 2026-07-10) _L2809
• §41d — void→s32 is NOT always byte-neutral: gate the RAW draft FIRST (Phase 26 session 6, byte-proven) _L2878
• §42b — addendum — wave 3 (Max, 2026-07-10c): THE STALE-OBJECT GATE TRAP + the read-global &-cast drift + fix _L2994
• §45 — The flagship func_80133CD4 crack (399 ins ×134): the merged-variable permutation-breaker + the 1-death local-alloc gate (Phase 25 task A giant escalation, Fable5 gdb-on-cc1, 2026-07-11) _L3298
• §51 — TOOLING INTEGRITY: the silent skip, and how to hunt it _L3630
• §51b — Why the byte-gate cannot save you _L3652
• §51f — Checklist for any new corpus-scanning tool _L3755
• §51g — When the thing you are scanning has a GRAMMAR, parse the grammar (tools/cdecl.py) _L3769
• §53 — SWEEP A FAMILY WITH THE TOOL ITS EXEMPLAR NEEDED: the jr/switch carve, and how omitting it manufactured the "families don't template" doctrine (Phase 28 T1, 2026-07-15) _L4028
• §55 — Core-crack wave levers + the GATE-ORCHESTRATION law (Phase 29 T3, 13-agent ultracode wave, 2026-07-17) _L4093
• §55b — THE GATE-ORCHESTRATION LAW (3 traps, ~3.5h lost; all recovered, 0 data lost) _L4122
• §55c — Sizing the propagate: a TARGETED propagate is ~4 min/core, and "it's slow" was a BROKEN-TREE ARTIFACT _L4141
• §54 — --fix-def-sig: the member's CANONICAL DECLARATION is a build step too (tiny-IMM mega-pools, +4,801, Phase 29 T6, 2026-07-16) _L4163
• §57 — The SELF-decl normalize: the sibling's OWN caller declares the templated fn divergently (the third §17a-1 direction; tools/normalize_self_decls.py, func_801670E4 ×137, Phase 29, 2026-07-18) _L4256
• §61 — Task 14: the gate ladder's missing stage is the ARITY pre-pass, and it is TU-side not draft-side (Phase 29, 2026-07-21) _L4545
• §61b — The jtbl gate stage: built, and the ORDERING law it exposed (Phase 29 Task-14 stage 4, 2026-07-21) _L4658
• §61d — The undo was eating the tree: two tools, one defect, invisible to the byte-gate (Phase 29, 2026-07-22) _L4779
• §62 — The jtbl RECONCILE must also follow the carve: the post-carve draft reconcile (harvest_verify._jtbl_reconcile, Phase 29 SESSION-11, 2026-07-22) _L4833
• §65 — The stranded-draft recovery: BLAST-RADIUS TIERS, and the per-overlay de-macroize that refutes §20's DEF-conflict wall (tools/demacroize.py + tools/blocker_probe.py, Phase 29 SESSION-16, 2026-07-24) _L5015
• §65d — Existing-ladder baseline, measured (do this before building a recovery stage) _L5091
• §65e — Two oracles, and the disagreement is the finding (R34 in practice) _L5101
• §65f — The de-macroize lever's BOUNDARY, measured: byte-neutral 14 times of 15, and the 15th is why the gate exists _L5118
• §66b — A metric parsed out of another tool's prose goes NULL silently when the label changes _L5200
• §67a — Run the symbol-set guard BEFORE you pay for a gate (tools/symcheck.py, Phase 29 SESSION-18) _L5405
• §77 — Every extraction tool carries a NARROW hard-coded preamble set; anything outside it silently caps the body's reach. Diff the preamble before you gate. (Phase 29 SESSION-19 — three variants in one session, two different tools) _L6084
• §3-The — CANDIDATE gate and the REAL gate need DIFFERENT preambles — keep the difference out of the bank _L6124
• §79 — For a 0-callee giant, fingerprint by DATA symbols (§71 cannot fire); and the STACK-SLOT ORDER is a declaration-order oracle (Phase 29 SESSION-19, func_8017BF14 4,763 ins, cold start → 45/4763) _L6220
• §82 — Two source-shape oracles from behemoth #6: a duplicated addiu $aN,$sp,K across a jal means the block was INLINED, and scalar-vs-aggregate decides WHEN a stack slot is allocated (Phase 29 SESSION-19, func_8017C730 1,061 ins) _L6370
• §3-2. — Scalar vs aggregate decides when the slot is allocated _L6389
• §3-Why — it survived every candidate gate _L6495
• §3-THE — FIX IS MECHANICAL — the tool already holds the answer _L6510
• §87 — match_one COMPILES but never LINKS, so an unresolvable data symbol reads as MATCH; and stored drafts go STALE against the tree (Phase 29 SESSION-20) _L6633
• §88f — the missing rung: a RELOCATION gate between match_one and the binary _L6718
• §89a — MEASURE the write set; do not assert its tier (tools/blast_radius.py) _L6732
• §89b — the parallel gate farm existed; the family path could not reach it (tools/sweep_parallel.py) _L6745
• §90 — Five tool-integrity laws from one session, each of which changed an answer (Phase 29 SESSION-21, 2026-07-27) _L6766
• §90a — A comparison tool MUST share its reference oracle's index space, exactly _L6772
• §92 — Conforming a DECLARATION: pointer changes are caller-neutral, scalar-WIDTH changes are not (Phase 29 SESSION-21, tools/conform_decls.py) _L6891
• §97 — The gate's own tree hygiene: a refused carve, an unchecked recovery, and a snapshot that captured a dirty tree (Phase 29 SESSION-22) _L7066
• §105 — A gate's revert must survive an EXCEPTION, not just a failure (Phase 29 T53, jtbl_family_bank) _L7431
• §107 — A lever wired into ONE gate path is a lever most families cannot reach (Phase 29 T56, func_80144090 0/136 → 136/136) _L7513
• §3-Why — it survived so long: a MASKED oracle will MATCH a wrong symbol _L7953
• §122 — GATE RAW BEFORE TRANSFORMING; the undo belongs to the WRITER, as a per-edit journal (P30 T0a, 2026-07-30) _L8084
• §123 — PROPAGATE A FAMILY WITH THE TOOL ITS TIER NEEDS: dedup_propagate is h_exact-only; its refusals are statements about the TOOL (P30 wave 1, 2026-07-30) _L8116
• §126a — a bare except: continue around a coverage-asserting oracle re-creates the silent skip (P30 S28) _L8317
• §130 — An INCREMENTAL build can report BYTE-IDENTICAL for a change the CLEAN build cannot even LINK (P30 S28, the jr pair) _L8486
• §132 — The JR-PAIR-IN-ONE-O0-OBJECT "wall" was TWO instrument defects: a merged-double span the carve could not see, and a truncated object no rule deleted (P30 S29, func_8013B83C + func_8013BD74) _L8570
• §133 — The DEFAULT-FILTER class: three times in one session, a tool silently answered a narrower question than the one asked (P30 S1–S3) _L8685
• §134 — MULTI-LINE BLINDNESS: one root cause, four faces, in family_remap's preamble scanner (P30 S6, 190 zero-crack families) _L8711
• §3-The — splitting/merging rules (each closed a residual, byte-gated) _L8853
• §137a — A gate verdict has a TIMESTAMP; re-check it against the draft's mtime _L9386
• §138 — The propagation lanes: a gate refusal is a DECLARATION, and which lever you owe depends on blast radius _L9415
• §134 — again, in a second tool — and the waiter rule corrected _L9526
• Reconciling — a gate-refused draft: which way you edit depends on WHERE the TU's decl is _L9565
• §139 — A GATE THAT GREPS FOR VERDICTS MUST ASSERT 1:1 ACCOUNTING; and a --src filter must not survive a carve (P30 S38, wave 6: 10 of 16 drafts vanished) _L9594
• §140 — A METRIC IS NOT A MEASUREMENT UNTIL IT IS REPRODUCIBLE FROM THE COMMITTED TREE (P30 S1e: a phantom regression that gated the session's best lever) _L9660
• §142 — An open stub whose h_exact class is MATCHED elsewhere is FREE. Propagate the body; do not gate a draft. (P30 S39, +7,710 ins in two commands) _L9778
• §3-The — measurement (do this before any wave; it is ~20 lines and needs no builds) _L9790
• §155b — check the TYPE your oracle returns before comparing against it (S45 p5) _L10587
• §156 — an ORPHANED reconcile poisons the fleet: dedup_propagate's kept edit (S45 p6/p7) _L10640
• §158 — The RANGE-EXTENDER: a fourth zero-emission asm lever completes the allocno toolkit (P30 S46 tier-3, func_8017CE58, 733 ins) _L10712
• §160 — THE REACH-15 WAVE HARVEST: an align-1 block move, and the instrument that called it a wall (P30 S47) _L10893
• §161 — THE RETRY-WAVE HARVEST: a jump table indexed from zero, and two allocator traps (P30 S47) _L10969
• §162 — S48 WAVE-1 HARVEST (P30, 2026-08-11): the reach-ordered sibling campaign's first 12 targets _L11014
• §163 — S48 WAVES 2-3 HARVEST (P30, 2026-08-11/12): the five that were byte-probed and are actionable _L11760
• §165 — S48 WAVE-4 HARVEST (P30, 2026-08-12): banked the same day the wave landed _L13689
• §166 — THE DESTINATION-TU ORACLE (P30 S48): the seven-attempt bug that was never codegen _L14902
• §167 — S48 WAVE-5/6 HARVEST (P30, 2026-08-12): the saturation point _L14958
• §176e — SYMBOL IDENTITY IS COMPUTABLE OFFLINE (P31 S52): tools/reloc_identity.py _L16852
• §3-A. — The seven under-reporting holes (all in gate_main, all the same shape) _L16986
• §3-C2. — RECONCILE BEFORE THE FIRST GATE — a parked draft gets HARDER to bank, not easier _L17033
• §3-D. — The measured cost shape, and what to build next _L17056
• §176i — WHAT A STATIC PRE-GATE CHECK CAN AND CANNOT PROVE (P31 S52, wave Q) _L17074
• §179 — IDIOMS MINED FROM THE WAVE P/Q JOURNALS (P31 S52, harvest pass) _L17313
• §179-G — 🟡 A PIN CAN CREATE A COMBINE LOG_LINK AND DELETE AN andi (sixth RC-5 channel, n=1) _L17542
• §176c — MAIN (SLUS_007.26) CANNOT BE GATED INCREMENTALLY _L17609
• §180 — THE LEFTOVER-DRAFT HARVEST: RE-VERIFY WHAT YOU ALREADY HAVE BEFORE DRAFTING ANYTHING NEW _L17794
• §180b — WHAT THE PRE-GATE LADDER ACTUALLY FINDS IN A COLD PILE (the shape of integration debt) _L17823
• §181 — WHAT A WAVE'S GATE ACTUALLY REJECTS (P31 S53, measured on wave R's 45-draft main pile) _L17860
• §184 — COMMENT-BLINDNESS IS A DEFECT CLASS, NOT A BUG (P31 S53: three tools, one root cause, one session) _L18013
• §187 — 🔴 "SAME SOURCE" IS NOT "SAME OBJECT": THE SDK BUILD AND THE GAME BUILD DISAGREE ON GTE NOPS _L18119
• §190 — THREE PRESCRIPTIONS FROM THE SAME HARVEST (weaker evidence than §189, honestly labelled) _L18282
• §191 — WHAT THIS HARVEST DID NOT BANK (4 rejected, 4 narrowed) — recorded so it is not re-derived _L18319
• §192 — THE PRE-GATE LADDER WAS MAIN-ONLY, AND NOBODY COULD SEE IT (P31 S54) _L18341
• §193 — THE WAVE-T HARVEST (P31 S54): 71 index_gap reports -> 9 laws, 5 rejected, 61 already-covered _L18406
• §193-A — The wave card ships only OPEN-set pointers and discards the atlas's BANKED one — exemplar/sibs are stubs 100% by construction (tools/atlas.py:96/657), while seed.ref (matched pool, atlas.py:505-536) is dropped at build_wave_atlas.py:143 _L18423
• §193-G — §164-54's "scope to ≥4 arms" bound is byte-wrong — the dispatch-topology oracle goes live at THREE case nodes (balance_case_nodes splits at i > 2), but only for a signed-after-promotion index _L18727
• §193-I — A DECLARED AGGREGATE LOCAL HAS AN 8-BYTE FRAME STRIDE — CEIL(size,8), NOT size. N ARRAYS THEREFORE COST 8·k MORE THAN ONE HAND-LAID STRUCT (k = how many of them have size mod 8 ≠ 0), AND THE TELL IS IDENTICAL INSTRUCTION COUNT WITH EVERY $sp DISPLACEMENT SHIFTED BY THE SAME CONSTANT. _L18828
• §193-REJECTED — what this harvest did NOT bank (recorded so it is not re-derived) _L18887
• §194 — THE WAVE-U HARVEST (P31 S54): 64 index_gap reports -> 14 laws, 5 rejected, 44 already-covered _L18914
• §194-E — The wave card's exemplar is the TARGET ITSELF on 42/73 wave-U and 36/71 wave-T cards — a construction consequence of atlas.py:657 (exemplar = max-nins OPEN member) meeting build_wave_atlas.py:166 (one card per gid); and the shipped §193-A seed_ref is same-binary on 0/51, so no card field can ever name a destination-TU sibling _L19139
• §194-G — Reading the integer half of a 16.16 stack aggregate: REGISTER-LIVENESS, not the C spelling, decides sra vs lhu — and the break is count-neutral _L19249
• §194-K — Blind sched1's alias oracle with a second SET of a pointer pseudo — the first zero-byte, non-volatile, dependence-CREATING lever (corrects §167-05's "volatile is the only door"; fourth consumer of reg_n_sets) _L19425
• §194-REJECTED — what this harvest did NOT bank (recorded so it is not re-derived) _L19666
• §195 — THE WAVE-V HARVEST (P31 S54): 67 index_gap reports -> 14 laws, 9 rejected, 76 already-covered _L19687
• §195-I — §145(b) AMENDED — the pointer-bump addiu is saved by cse, not combine: ANY second SET of a pseudo in the address's equivalence chain (in-place p += K, §145(b)'s p = r; copy, or an asm re-tie) kills the fold; the pass is cse and the gate is invalidate's reg_tick++ _L20135
• §195-M — Frame vars is a SEQUENTIAL bump-allocation, not a flat sum: §193-I's CEIL(aggregate,8) term and §165-03/§167-06's 8×orphan term are the SAME frame_offset walk at two different compiler stages, and each stage re-CEILs frame_offset to 8 before it allocates _L20343
• §195-REJECTED — what this harvest did NOT bank (recorded so it is not re-derived) _L20439
• §197 — THE WAVE-W HARVEST (P31 S54): 68 index_gap reports -> 4 laws, 3 rejected, 41 already-covered _L20540
• §199 — THE WAVE-X HARVEST (P31 S54/S55): 63 index_gap reports -> 7 laws, 2 rejected, 56 already-covered _L20680
• §199-C — A NEGATIVE CONSTANT MULTIPLY ALWAYS TAKES expmed's negate_variant — but whether you ever SEE the neg is decided by COMBINE, and for an EVEN |K| it never disappears _L20785
• §199-D — A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is the WIDTH of a real object, and a widening (s32) cast is inert — AMENDS §35 (whose stated "only CSE-reuse canonicalizes" mechanism is byte-wrong) and does NOT apply inside a switch _L20833
• §199-G — At TWO case nodes the switch-vs-if oracle is not blind — but the tell is ALL tests positive + a trailing j default, NOT the first test's polarity _L21006
• §201 — THE WAVE-Y HARVEST (P31 S55): 67 gap reports -> 5 laws, 8 rejected, 53 already-covered _L21121
• §204 — THE WAVE-Z HARVEST (P31 S56): 82 gap reports -> 5 laws, 16 rejected, 30 already-covered _L21520
• §207 — THE WAVE ab–ag HARVEST (P31 S58): 278 byte-banked notes → 25 laws, 103 self-reported no-gap _L22154
• §233 — THE WAVE aa–bg HARVEST (P31 S58b): 1,101 byte-banked notes → 24 new laws, 21 addenda, ~700 already-covered _L23228
• §236 — THE DECLARATION LAYER IS THE DOMINANT BANK-BLOCKER: NINE WAYS A BYTE-PERFECT BODY FAILS THE GATE (P31 S58b) _L23342
• §247 — TWO BRANCHES TO ONE LABEL MEANS THE SOURCE CONDITION IS NEGATED (P31 S58b) _L23788
• §254 — THE DEAD PARAMETER IS A REGISTER-PLACEMENT TOOL (single observation — not yet cross-confirmed) (P31 S58b) _L23982
• §259 — THE DISCARD LEDGER FOR THE aa–bg HARVEST (P31 S58b): WHAT WAS MINED AND REJECTED, AND WHY _L24639
• §260-A — STAGE 2 IS PROVEN, AND THE WHOLE jtbl PIPELINE IS AUTOMATED AT THE GATE (P31 S59, same day) _L24728
• §261 — THE -O0 ORACLE: DERIVE THE OPT LEVEL FROM THE TARGET, AND $fp IS NOT THE TELL (P31 S59) _L24764
• §267 — ADDENDA HARVESTED FROM WAVES at/bh/bk/bl (P31 S59b) _L25032
• ADD-9 — → §213-3 / §217 addendum — ADJACENT PRE-CALL FRAME STORES ARE ONE AGGREGATE; THE UNESCAPED SCALAR NEIGHBOR IS DEAD-STORED _L25127
• §269 — ADDENDA HARVESTED FROM WAVES ax/bm (P31 S59c) _L25251
• §271 — Ordinal IMM pairing: text order is NOT emission order; emit CANDIDATES, let the oracle pick (P31 S59) _L25489
• §273 — A standalone compile is the WRONG oracle for a TU-destined draft (P31 S59) _L25531
• §274 — ADDENDA HARVESTED FROM 18 WAVES (P31 S60): 315 candidates, 255 already covered, 21 sharpenings, 3 new laws _L25546
• §278 — ADDENDA HARVESTED FROM WAVE cf (P31 S60): 34 candidates, 13 already covered, 8 sharpenings, 4 new laws _L26537
• §283 — ADDENDA HARVESTED FROM THE 36-WAVE BATCH (P31 S60): 1,216 candidates, 859 already covered, 46 sharpenings, 9 new laws _L27033
• §287 — A STACK-FRAME HOLE BELOW TWO ADDRESS-TAKEN AGGREGATE LOCALS IS A LEADING PAD MEMBER OF ONE COMBINED STRUCT, NOT SEPARATE LOCALS OR A REGISTER PIN (P31 S60/dj; func_8017D104, ov_SC06_027, byte-proven 47/47) (P31 S60; waves #, byte-proven) _L28998

process, measurement & doctrine (105)

• §8e — The jtbl ALIGNMENT LAW + the pad-spec filter — multi-table .rodata spans (Phase 29, byte-proven; .run/probe_jtbl/verdict.md) _L530
• §3-The — mechanism: game-code dedup is SOURCE-LEVEL, not an object swap (R-D1, the key lesson) _L926
• Per-binary — toolchain provenance (R24) _L959
• §17a — The TOOLKIT at WAVE scale (Phase-18 Step-3b/Step-1 — measured) + the pipeline-integration gotchas _L1445
• Diagnostic — lesson: a failed in-TU build leaves a STALE .o _L1654
• Phase-20 — RESOLUTION — tools/cast_call_sites.py BUILT + the cap re-diagnosed (R14, byte-proven) _L1701
• §23 — Giant func_80153E00 cracked (scalar-data CAST); BUT most giant drafts are STALE+INCOMPLETE, and a diag MUST remove artifacts (Phase 21 — byte-proven + a self-correction) _L2032
• §3-h — _exact OVER-COUNTS ×134 — verify shareability before crediting a class's "reach-134" (R14) _L2177
• §28c — The close=0 recovery is NOT fully exhausted (§26 corrected, R14); + the dedup_propagate registry-skip recovery (Phase 22 T2) _L2352
• §31-triage — R17 applies to CODEGEN residuals, never to a compile ERROR (Phase 26 session 7, Drew asked) _L2693
• §41a — v3.1: the def-side wall was ~71% TOOL-shaped — the five measured defects + the laws that dissolve them (Phase 25 T6, Fable5, 2026-07-09) _L2754
• §41b — T7 execution: the object-only probe OVER-counts BANKABLE by two link/rodata classes (Phase 25 T7-M1, 2026-07-10) _L2809
• §41b — addendum — M4 "reconcile_decls" tier is ALSO a probe over-count: 0/8 mechanical (Phase 25 T7-M4, 2026-07-10) _L2858
• §53 — SWEEP A FAMILY WITH THE TOOL ITS EXEMPLAR NEEDED: the jr/switch carve, and how omitting it manufactured the "families don't template" doctrine (Phase 28 T1, 2026-07-15) _L4028
• §3-The — meta-lesson (R35, and why this one is expensive) _L4078
• §55 — Core-crack wave levers + the GATE-ORCHESTRATION law (Phase 29 T3, 13-agent ultracode wave, 2026-07-17) _L4093
• §55b — THE GATE-ORCHESTRATION LAW (3 traps, ~3.5h lost; all recovered, 0 data lost) _L4122
• §57a — Two NSD corrections + the SURGICAL-ONLY law + the honest broad-sweep yield (Phase 29, 2026-07-18) _L4303
• §58 — match_one MATCH ≠ BANK: the four blind spots + the crack-wave reconcile-before-bank law (Phase 29 crack-wave, 2026-07-18) _L4343
• §60 — Classify the residual, don't rank it: the deterministic residual→class classifier and what it measured about the backlog (Phase 29 Task-13A, 2026-07-21) _L4407
• What — it measured — the whole open backlog, byte-grounded _L4431
• §3-The — parallel-probe race this surfaced _L4463
• §61b — The jtbl gate stage: built, and the ORDERING law it exposed (Phase 29 Task-14 stage 4, 2026-07-21) _L4658
• §62 — The jtbl RECONCILE must also follow the carve: the post-carve draft reconcile (harvest_verify._jtbl_reconcile, Phase 29 SESSION-11, 2026-07-22) _L4833
• §63 — UPDATE (Phase 29 SESSION-14) — fix_header_decl's "SAFE" verdict is FLEET-BLIND; it MUST be R22-validated _L5000
• §65 — The stranded-draft recovery: BLAST-RADIUS TIERS, and the per-overlay de-macroize that refutes §20's DEF-conflict wall (tools/demacroize.py + tools/blocker_probe.py, Phase 29 SESSION-16, 2026-07-24) _L5015
• §65a — The blast-radius taxonomy (makes §61's law structural instead of remembered) _L5030
• §65d — Existing-ladder baseline, measured (do this before building a recovery stage) _L5091
• §65e — Two oracles, and the disagreement is the finding (R34 in practice) _L5101
• §65f — The de-macroize lever's BOUNDARY, measured: byte-neutral 14 times of 15, and the 15th is why the gate exists _L5118
• §66c — Before a wave, verify the FUEL exists; an "already attempted" set built from the wrong directory lies in BOTH directions _L5217
• §66d-5 — residual_class's "structural ⇒ permuter CPU is waste" is WRONG for schedule permutations (measured, Phase 29 SESSION-18) _L5491
• §3-The — honest fix was source-level and cheap _L5750
• §3-The — residual, and the honest read _L6260
• §83 — The parameterised-repeat law, the spill-area trap, and why a per-case edit cannot move a per-case symptom (Phase 29 SESSION-20, func_80183814 5,122 ins, cold-ish start → 36 structural / 99.3%) _L6412
• Scope — , measured (do not over-generalise — §80) _L6518
• §3-Two — ladder lessons banked with it _L6528
• §3-Do — the WHOLE axis in one edit, then R22 once _L6567
• §3-THE — LAW: all-or-nothing PER FAMILY _L6600
• §88b — the slti literal-position law (extends §78 to comparisons) _L6686
• §88e — a wrong diagnosis, refuted properly (the model for how to treat an inherited lever) _L6708
• §89a — MEASURE the write set; do not assert its tier (tools/blast_radius.py) _L6732
• §90d — Do not measure a live wave's drafts (§87 in real time) _L6810
• §98 — conform_decls had three defects, and only the third needed R22 to find (Phase 29 SESSION-22, func_8014CF04) _L7113
• §106 — Persist the MEASUREMENT, derive the POLICY: a stored route let a stale file out-vote the live table (Phase 29 T54, residual_class._ROUTE) _L7470
• §125 — Split the CARVE from the BODY before calling a jr residue a wall — and measure it by SHA from a CLEAN tree (P30 SESSION-28; this section's first draft was WRONG and the method caught it) _L8206
• §3-The — meta-lesson _L8257
• Wave — economics (measured, for the next batch's sizing) _L8953
• §136b — A prior wave's "genuine byte-DIFF" verdict is NOT reliable evidence (4 of 4 refuted) _L9033
• §136g — When the index points at the WRONG lever: two byte-refuted routings (func_801863B4) _L9211
• §136h — CORRECTION: the zero-crack pool does NOT "refill with cheap work" (my error, byte-measured) _L9240
• §136j — The failure MIX flips with function size (measured across four bands, one session) _L9302
• Rank — the lane by measured concentration, not by class count _L9481
• §140 — A METRIC IS NOT A MEASUREMENT UNTIL IT IS REPRODUCIBLE FROM THE COMMITTED TREE (P30 S1e: a phantom regression that gated the session's best lever) _L9660
• §3-The — measurement (do this before any wave; it is ~20 lines and needs no builds) _L9790
• §3-And — the report-vs-bytes lesson attached to it _L9822
• §146 — RE-MEASURE A WALL BEFORE YOU RESPECT IT. Both "permanent" giants fell to drafts already on disk. (P30 S6, +50,094 ins) _L9977
• §147 — The three-stratum FRAME LAW, and four "stop searching" verdicts (P30 S42, func_8017C294, serial run) _L10036
• §3-C. — Inner-block declaration does NOT delay slot allocation — BYTE-REFUTED _L10068
• §3-D. — "Cheap fuel" that was never probed: 0 of 31 templatable _L10293
• §3-Two — corrections to the record _L10345
• §3-The — two fallouts, and how to close them (both measured, in order) _L10395
• What — does NOT work (14 byte-measured probes) _L10486
• §157 — the cheap-tier size cliff, measured (S45 p6) _L10687
• §162 — The cross-jump "CALL veto" is a COUNT law, not a CALL law (BOUNDS §88a; P30 S48, func_80189540) _L11302
• §3-The — law _L11549
• DIAGNOSTIC — TELL — two faces, one law _L11591
• §163 — S48 WAVES 2-3 HARVEST (P30, 2026-08-11/12): the five that were byte-probed and are actionable _L11760
• §163z — THE UNVETTED REMAINDER (do not cite as law; each needs a dedupe pass) _L11828
• §164z — REFUTED CLAIMS: do NOT re-derive these _L13623
• §165z — REFUTED THIS WAVE: do NOT re-derive _L14858
• §167z — REFUTED IN WAVES 5/6: do NOT re-derive _L16154
• §168 — THE COUSIN TIER (P30 S49, 2026-08-12): h_seq's exact-hash brittleness, measured — and the similarity map above it _L16211
• §176g — SIZE A WAVE BY INSTRUCTIONS, NOT BY CARDS (P31 S52 — the adopted doctrine) _L16940
• §176h — THE BATCH-SUBSTITUTION HAZARD MAP (P31 S52): seven holes, three wrong fixes, one law _L16978
• §3-D. — The measured cost shape, and what to build next _L17056
• §176j-2 — THE REPAIR PASS, MEASURED (do this instead of resuming) _L17132
• §176-C — 🔴 WALL REFUTATION: a hard-register pin CANNOT schedule around a call, because of a genuine gcc-2.7.2 bug _L17690
• §176-E — Two cheap source spellings, both cc1-probed _L17742
• §180 — THE LEFTOVER-DRAFT HARVEST: RE-VERIFY WHAT YOU ALREADY HAVE BEFORE DRAFTING ANYTHING NEW _L17794
• §181 — WHAT A WAVE'S GATE ACTUALLY REJECTS (P31 S53, measured on wave R's 45-draft main pile) _L17860
• §182 — §177's HONEST NEGATIVE: the epilogue lever cracked 4 of 16, and the 800c3 cluster held _L17916
• §183 — THE DECLARATION-RECONCILIATION PLAYBOOK (P31 S53, measured on 20 byte-verified drafts) _L17942
• §185 — EDIT THE SIDE THAT IS CHEAP TO VERIFY, AND CHECK A TU RETYPE AT ITS USE SITES _L18041
• §190 — THREE PRESCRIPTIONS FROM THE SAME HARVEST (weaker evidence than §189, honestly labelled) _L18282
• §194-A — A zero-byte scheduling fence goes AFTER the defining statement to make that computation emit FIRST in its block — and the barrier predicate is volatile-or-colon-less, not the "memory" clobber (COMPLEMENTS §165-40; does not refute it) _L18931
• §194-D — Declared width of a computed-value local is a sched1 dial (count-neutral) — a replication + attribution correction of §165-17, NOT a new argument-register law _L19098
• §195-J — GTE / PsyQ op CALL-vs-INLINE is a PER-SITE SOURCE FACT, not a TU style — both forms coexist in one TU (measured in 2 TUs), and the tell is the target's own opcodes (lwc2/sqr/swc2 vs jal), not the sibling. Costs -8 ins on func_8018505C. Corollary: the game's inline sqr macro emits TWO hazard nops, the SDK's Square0 body emits ONE — so the inline form is provably not Square0 inlined (a second instance of §187's SDK-vs-game GTE nop divergence). _L20200
• §201-E — §194-J-2 — The last_mem_set deletion window is measured in SOURCE/expand order, not in the printed stream; a foreign store moved between the pair in C source is a real lever, and volatile is not always the better one _L21341
• §230 — THE ANCHOR PROBE: with %hi/%lo masked, the surviving addiu deltas tell you which assignment was written first (single observation — not yet cross-confirmed) (P31 S58) _L23080
• §257 — THE DEAD-END LEDGER (P31 S58b): ELEVEN LEVERS THAT MEASURED NULL OR BACKFIRED _L24066
• §194-B — / §209 addendum (P31 S58b) — TWO MORE INSTANCES, AND THE BOUND IS NOW REFUTED FOUR WAYS _L24135
• §266 — THE INERT-RIDER LAW: A LEVER IS ONLY CITABLE WHEN ITS SOLO REMOVAL BREAKS THE MATCH (P31 S59b; measured 4-of-8 on this batch) _L24992
• ADD-4 — → §167-37 addendum — THE FIFTH PRECONDITION, NOW MEASURED: DOWNSTREAM FIELD RE-READS ⇒ NAME IT AND STORE INSIDE THE ARM _L25306
• ADD-9 — → §255 "AND CASE-BODY PLACEMENT" bound / §222-addendum-3 — ON A LARGE SPARSE TREE, BODIES FOLLOW SOURCE ORDER (measured by a one-word probe) _L25383
• ADDENDUM — to §172b-1 — TWO PLACEMENT DIALS THE PROMOTION LAW DOESN'T NAME: NARROW THE COUNTER'S DECLARED TYPE, AND MOVE THE CAST INTO THE LOOP BODY _L26012
• What — I could not verify _L26986
• ADDENDUM — to §164-75 — the fold-reassociation law also fires at a variable's INITIALIZER, not only a later expression _L27043
• What — I could not verify _L27560
• ADDENDUM — to §153 / §236-5 (func_801A419C, md_SC07_003 — waves di and dl, corroborating; refutes a contradicted dj-wave card) _L27777
• What — I could not verify _L28017
• ADDENDUM — to §174 Law 4 (func_8017E9A8, ov_SC06_015) _L28037
• ADDENDUM — the zero-emission-asm family gains a REF-SLIDER PLACEMENT LAW and a paired RESTORER (func_800CB900, md_MAIN_026) _L28077
• What — I could not verify _L28575
• What — I could not verify _L28881

(unbucketed — title matched no symptom vocabulary) (283)

• §3-How — to use this _L30
• §1 — Idiom catalog (asm pattern → C that produces it) _L39
• §3-I3 — Division by a constant → magic multiply _L54
• §3-I4 — Runtime (variable) division → divu + zero-check break (NEEDS --expand-div) _L60
• §2 — Writing matching C (what makes gcc emit X) _L69
• §3a — Escalation TIER above the permuter — web-research the compiler internals (HIGH VALUE, proven) _L128
• §3b — §31-directed permuter mutation — bias the search over the class's levers (Phase 24 T5) _L147
• Residual — B — a return <const> materialised late / merged instead of distributed per-site _L867
• §3-The — A→B→C per-overlay workflow _L1091
• Dedup-credit — (§11) for overlays — two shapes _L1108
• §14a — The fleet bulk run (Phase 15 — --auto-from, 947 REAL → 74,527; 3.82% → 22.14% in one pass) _L1169
• §14d — Deterministic recovery beats agent waves on the hard tail (Phase 15, the final-session finding) _L1269
• §14e — Two hard-tail dead-ends (Phase 15 — documented so they aren't re-attempted) _L1298
• §3-The — STEERABLE idioms (byte-confirmed this phase) _L1404
• Strategic — conclusion — the match-% lever post-research _L1435
• §3-NEW — / CONFIRMED residual classes (this session) _L1660
• Operational — gotchas (cost real time) _L1681
• What — WORKED — the Phase-20 reusable wins _L1689
• §21 — wave-distilled idioms (Phase 21) _L1752
• §26 — The cheap close=0 recovery lever is EXHAUSTED; idiom_loop --assess was DOUBLY inflated (Phase 21, cont.7) _L2199
• §3-The — _a close=0 recovery banks 0/20 — same def-side wall as MAIN (0/40) _L2205
• §27 — Giant matching recipe (Phase 21 cont.7b — validated on func_80176D94, 152 ins) _L2259
• §28a — decomp.wiki GCC patterns worth trying on BFM giants (decomp.wiki/compilers/GCC, raw at decompals/decompedia; PS1-applicable subset) _L2345
• §31 — THE gcc-2.7.2 CODEGEN MAP: pass → residual → C-lever catalog (Phase 23; 4 Fable5 agents read the compiler source) _L2402
• §36 — Fable5 giant-crack levers (Phase 24 T7 Fable5 batch; accumulates as each lands — full RTL dumps in .run/t7/fable/) _L2487
• §42d — addendum — wave 4 (rtu_match fan-out over the mapped frontier, 2026-07-10c): 24/26 MATCH, +5 durable levers _L3082
• §3-B. — THE EBB RULE — the general form of §46-L2 _L3468
• §3-E. — Meta _L3518
• §50 — Refinements that BOUND §47/§48 (from the func_80135EB0 wall, 21→6; Phase 26 session 8) _L3576
• §51a — The bug class _L3636
• §51c — THE METHOD (do not audit by reading the regex) _L3662
• §51d — THE LAWS _L3677
• §51e — The false-wall pipeline (why this is not just hygiene) _L3739
• §3-Why — the wall is (probably) intrinsic _L3945
• §3-The — case _L4033
• §3-The — rule _L4062
• §55a — New byte-proven levers (each from a banked or near draft) _L4098
• §60a — What the first DIRECTED grinder run exposed (Phase 29 Task-13B, 2026-07-21) _L4472
• §60b — The plateau autopsy's verdict: a partial drift is a WRONG DRAFT, not a missing transform (Phase 29 Task-13B close, 2026-07-21) _L4510
• §66 — Exercise a banking driver's SUCCESS path before pointing it at a wave: the free re-bank test (Phase 29 SESSION-17, 2026-07-24) _L5159
• §66d-2 — Two operational sharp edges _L5289
• §66d-3 — Read the ILS per-cycle SERIES, not its final best: a repeated score and a still-falling one look identical in a summary line and mean opposite things _L5300
• §67 — The arg-copy PLACEMENT lever: launder a parameter into a fresh pseudo AT the statement where the target's copy lands (Phase 29 SESSION-18, func_8014D820 25 → 16) _L5315
• §66d-4 — "ILS converged" means converged FOR THAT WEIGHT PROFILE, not a floor (amends §66d-3; Phase 29 SESSION-18) _L5438
• §69 — How to attack a behemoth: map it, don't draft it (Phase 29 SESSION-18, func_80183814, 5,122 ins) _L5569
• What — is left, and what is byte-recorded as SPENT _L5766
• §3-The — mechanism, with citations _L6037
• §3-Two — diagnosis traps this function proved _L6064
• Practice — Practice _L6074
• §3-The — drift was an allocation decision, not missing code _L6180
• §3-The — economics _L6211
• §71 — has a blind spot, and this is it _L6226
• §3-The — flagged "#1 move" LOST — and why the failure is informative _L6302
• §78 — 's attribution primitive, run and reproduced _L6312
• Cold-start — economics, now complete _L6318
• Also — reproduced on this function _L6401
• §3-And — the banking footnote (§75a class A, one line) _L6405
• §83a — READ THE HEADLINE NUMBER CORRECTLY: a LENGTH drift makes match_one's count meaningless _L6419
• §83b — THE LEVER: find the parameterised REPEAT before decoding case-by-case _L6427
• §83e — §80 vindicated again, on the same day it was written _L6466
• §3-The — conflict _L6544
• §3-THE — FAILURE MODE — widening only engine_core.h is worse than not starting _L6552
• §3-The — precondition, and how to check it in one grep _L6559
• Reading — , for the next person _L6576
• §3-The — guard refuses a class that largely works _L6591
• §3-The — blindness ladder, now complete — FOUR classes match_one cannot see _L6649
• Consequence — for the backlog ledger _L6659
• §88 — cross_jump will not merge a common suffix containing a CALL; and §78 is scoped to ORDERED comparisons only (Phase 29 SESSION-20, the behemoth close-out) _L6674
• §88a — repeated CALL-shaped blocks are left UNMERGED; call-free tails are merged for you _L6679
• §89 — Two throughput rules the project already had written down and was not following (Phase 29 SESSION-20) _L6726
• §3-The — standing sequence _L6758
• §90b — "Byte-neutral" is not "wanted": undo on the SUCCESS path too _L6789
• §90c — A library-callable function must FAIL CLOSED on an unconfigured module _L6799
• §90e — An agent's CONCLUSION and its EVIDENCE fail independently — re-derive the premise, not the fix _L6818
• §93 — set -o pipefail attributes a pipeline failure to the LAST stage, not the failing one (Phase 29 SESSION-21, func_8014D820) _L6922
• §101 — The STALE DEFAULT class: a guard whose cause was removed is a silent skip wearing a safety label (Phase 29 SESSION-22, three instances in one session) _L7245
• §110 — A unit must define exactly ONE function, and "ends in ;" does not tell you which line defines it (Phase 29 T65) _L7640
• §115 — A func_XXXXXXXX predicate rots by design: the same name-form assumption in THREE places (Phase 29 T78) _L7850
• §3-The — fix moves the DEFINITION, not the stub — and here is why the obvious shortcut fails _L7895
• §117 — Spell the sibling's symbol from the SIBLING's address, not the exemplar's kind (Phase 29 T82) _L7926
• §118 — Ordinal (positional) immediate resolution: compare C tokens to the DIFFERING asm uses (Phase 29 T87) _L7963
• §119 — Two levers on the SAME axis, opposite directions: test the off-diagonal (Phase 29 T89) _L7997
• §3-The — wiring trap that cost two attempts _L8043
• §3-The — method (keep this) _L8213
• §3-The — instrument rules that make its answer trustworthy (this is where I failed) _L8223
• §3-The — corrected results (each SHA-verified, from a clean tree, restore re-verified) _L8238
• §3-The — instrument trap that hid it (and it is §124's shape again) _L8290
• §3-The — mechanics _L8299
• §3-The — idiom they kept re-deriving: the constant-offset fold _L8356
• §127b — the knowledge was in a SOURCE COMMENT, not the cookbook _L8386
• §128 — A raw NUL in C source makes grep SILENTLY SKIP the file (P30 S28, 137 files) _L8393
• §128a — a negative control must corrupt a SCRATCH COPY, never the tracked file _L8425
• §3-The — real blocker underneath, for the record _L8477
• §3-The — diagnostic ladder that finally located it (reusable) _L8523
• Defect — 1 — a pre-§8e MERGED DOUBLE is not a single-table predecessor _L8579
• Defect — 2 — as writes a corpse and nothing deletes it _L8597
• §3-The — fingerprint, and the 30-second ladder that found it _L8607
• §3-The — transferable rule _L8628
• §132a — --like is for a sibling with NO record; against one that HAS a record it over-derives (P30 S29, ov_SC07_010) _L8635
• §135 — Six byte-verified gcc-2.7.2 idioms from the P30 S6f-h waves (and the two-lane wave shape that found them) _L8765
• §3-The — codegen idioms _L8770
• §3-The — wave shape that produced these _L8819
• §136 — The LOCAL-VARIABLE lever: how many C locals, at what scope (P30 wave 4a, 25 byte-verified banks) _L8837
• §136a — Blocker capture: classify on the OUTPUT, never on the exit status _L8976
• §136d — Four gcc-2.7.2 levers the redraft lane found (each closed a residual no other lever moved) _L9094
• §136e — §136c's PRECONDITION, and two more symptom keys (wave 4b batch 3) _L9138
• §136i — The drafter model LADDER: Haiku → Sonnet → Opus → Fable5 (Drew, 2026-08-03) _L9270
• §3-The — triage, cheapest first _L9421
• THREE — carry variants hide in one "CARRY-FIXABLE" bucket — and they need different fixes _L9490
• STEP — 0 of sibling-first: grep src/ for a distinctive LITERAL from the .s _L9546
• §3-The — generalisation — three corollaries worth more than the bug _L9626
• §3-And — the inverse-lookup trap, same session _L9643
• §3-The — three-line proof (do this before diagnosing any metric movement) _L9680
• §3-The — two instrument defects it exposed _L9689
• §3-Two — wrong mechanisms I chased first, and why they were wrong _L9720
• §3-The — trap that hid it — SAME FUNCTION, TWO ROUTES, ONLY ONE IS FREE _L9805
• Route — selection (why --addr sometimes says "nothing changed") _L9814
• §144 — THE LITERAL'S SPELLING PICKS THE IMMEDIATE ENCODING (P30 S40 wave 1, func_801822E0) _L9888
• §3-Why — a correct draft can read as an intrinsic wall _L9988
• §3-The — rule _L10023
• §3-B. — (v < 0x40) ? v : 0x3F is folded to MIN_EXPR and expands to the WRONG SHAPE _L10170
• §3-D. — Reproduce the original's BUGS verbatim _L10194
• §149 — Four instrument defects in one session, and the two questions they were hiding (P30 S43) _L10243
• §3-A. — A prep step that returns its input on failure is indistinguishable from a search that found nothing _L10249
• §3-B. — Same address + same name ≠ same body — and the ledger keys on address _L10267
• §3-C. — make: *** [...] Error N is a summary, never a diagnosis _L10283
• §3-The — fix _L10319
• §3-The — method that found it (this is the transferable part) _L10329
• Diagnostic — order (adopt this) _L10356
• §3-The — mechanism (read from cc1's own -dR trace, not inferred) _L10372
• §3-The — lever — a zero-emission insn that absorbs the blocked tick _L10387
• §3-The — finding _L10423
• §3-The — key _L10432
• §3-Two — cautions that must travel with this technique _L10443
• §3-The — companion defect (open) _L10454
• Symptom — Symptom _L10474
• Mechanism — (gcc source + RTL dumps, not inferred) _L10479
• §3-The — cure — a fresh launder per site, each in its own block _L10492
• Companion — levers from the same function _L10502
• §3-B. — Two static base-derivation methods that must AGREE (use both) _L10536
• §155a — the same failure class, one level up: SHAPE-blind table scanning (S45 p5) _L10567
• §155c — the ZERO-REFERENCE trap: gcc splits a global-array address across the lui and the LOAD (S46) _L10610
• Symptom — Symptom _L10721
• §3-Why — the fork is chained (gcc source, validated insn-by-insn against -dS/-dR dumps) _L10727
• §3-The — method (dump-arithmetic first, then place — no probing) _L10740
• §162a — SHARPENS (sharpens §161a, §131, §8a-pad, §129a) _L11041
• §162b — SHARPENS (sharpens §48-A3, §156, §150, §76) _L11070
• §162d — SHARPENS (sharpens §31, §21, §30, §55a) _L11099
• §162e — NEW _L11141
• §162f — SHARPENS (sharpens §42d, §41d, §73, §10) _L11209
• §162g — NEW _L11264
• §162h — SHARPENS (sharpens §88, §88a, §50-B, §8) _L11300
• §162i — SHARPENS (sharpens §135, §21, §42, §32) _L11368
• §162j — SHARPENS (sharpens §25, §136d-1, §48-B, §46-L2) _L11393
• §162k — SHARPENS (sharpens §1-I2, §12, §160d, §21) _L11422
• §162l — SHARPENS (sharpens §48-B, §48-C1, §20, §21) _L11485
• §162m — SHARPENS (sharpens §36, §158, §148, §153) _L11540
• §158a — THE FIFTH LEVER IS NOT AN ASM: do { } while (0) is a REGION ref-multiplier you MINT (P30 S48, func_8017CBC8, ov_MAIN_012 / jr_801789AC, 188 ins → MATCH) _L11542
• Size — it before you write it (§158 step 1-2, applied) _L11560
• §3-The — wrap BOUNDARY is the dial — and it is indiscriminate _L11581
• §3-Not — a pure dial _L11587
• §162n — NEW _L11613
• §162o — SHARPENS (sharpens §158, §136-1, §136-6, §79) _L11646
• §162p — SHARPENS (sharpens §48-B, §46-L2, §156, §136d-1) _L11705
• §162q — SHARPENS (sharpens §30, §30a, §135-2, §136-13) _L11722
• §164 — S48 §163z SKEPTIC PASS (P30, 2026-08-12): 190 claims vetted, 82 banked _L11848
• §169 — THE MICRO-ADAPT LANE (P30 S49): edit a proven body, don't crack a new one _L16263
• §170 — THE A-PROP WORD-DIFF CARD (P30 S49): the lane that had no owner _L16310
• §171 — THE STALE SEED SYMBOL (P30 S50, 2026-08-13): why §170's 91%→57% was never codegen _L16354
• §172 — THE ORPHAN-SLOT MECHANISM v2 (P30 S50-Max): the complete frame-residue model for gcc-2.7.2 MIPS _L16503
• §172a — TWO DECOMPILATION TELLS FROM THE SAME DIG (P30 S50-Max) _L16557
• §172b — THREE MORE TELLS FROM THE GCC READ (P30 S50-Max, banked on Drew's ask) _L16573
• §174 — THE ADAPT-CARD WAVE RECIPE (P31 waves A/B, 2026-08-14): prevention beats recovery _L16652
• §176a — THE VERIFICATION-LAYER LAWS (P31 overnight, 2026-08-15). What each check can and cannot prove. _L16747
• §176b — BATCH-GATING MECHANICS (P31): what changes when N drafts land in ONE .c _L16787
• §3-C. — The limit that remains (recorded, not solved) _L17026
• §176k — TWO SELECTOR BUGS THAT SILENTLY SHRINK A WAVE _L17152
• §178 — SIX LEVERS MINED FROM THE WAVE-P JOURNALS (P31 S52), each byte-proven and source-cited _L17226
• §3-A. — THE $0-ADD OPAQUE COPY defeats make_regs_eqv (func_80033398, 93 ins) _L17238
• §3-C. — SINGLE-SET TEMPS GET THE BIRTHING BOOST (func_8001D3FC, 196 ins) _L17267
• §3-E. — THE ZERO-OFFSET ALIAS HOLE (func_80037028, 71 ins) _L17282
• §179-B — 🔴 THE HAND-WRITTEN-ASM TRANSCRIPTION CHECKLIST (maspsx + masked_diff; 10 byte-proofs) _L17372
• §179-C — 🔴 A FUNCTION WITH NO EPILOGUE (falls into a sibling's shared tail) MUST BE FILE-SCOPE __asm__ _L17422
• §179-D — gte_stflg MUST CLOBBER "$12" OR THE WHOLE TEMP FILE ROTATES BY ONE _L17473
• §179-H — A MID-BODY .global LABEL PAIR SLICES A BYTE-COMPARABLE FRAGMENT OUT OF A LARGER ROUTINE _L17569
• Considered — and NOT banked _L17592
• §176-F — Misdiagnosis triage: four residual verdicts that were lying _L17764
• What — is NOT banked here _L17781
• §180c — WHEN A BINARY'S MASS BAND IS SPENT, THE FLEET-WIDE DRAW IS STRICTLY BETTER _L17842
• Only — ONE of 27 blocked drafts was wrong. The other 26 were correct and unbankable. _L17861
• §180d — THE pgrep BRACKET TRICK PROTECTS THE PATTERN, NOT THE COMMAND LINE _L17930
• Three — defects in one call path; the overlay slates that carry most of the wave work were being waved through _L18342
• §194-F — if ((*p = v = f()) == 0) is an expand-time pseudo SPLITTER (store_expr's want_value && MEM path), not a fold — it partitions one value between local_alloc and global_alloc. BOUNDS §21's L1872 bullet, whose stated direction is byte-wrong on 3 of 4 instances, and CLOSES the control §167-37 asked for. _L19176
• §194-L — §88b and §189-E are BOTH half-wrong, but not the way the candidate says: the compare-constant shape is a 2-D lookup (cmp_info ROW × constant-in-window), and naming matters on OPPOSITE sides of the window for the GE/LT rows vs the GT/LE rows _L19503
• §197-REJECTED — §197-REJECTED _L20665
• §199-REJECTED — §199-REJECTED _L21061
• §201-B — In a narrowed PLUS/MINUS/AND/IOR/XOR expression the destination pointee is INERT — the sign of the materialized constant is decided by an OR over the UNWIDENED operands (convert.c trunc1), which bounds §1841 to direct constant stores _L21163
• §201-REJECTED — eight, the session's highest _L21397
• §204-CONFIRMED — 30 reports that the index already answered _L21863
• §204-REJECTED — sixteen, twice the previous record _L21957
• §209 — THE NARROW LOCAL IS A DIAL IN TWO OPPOSITE DIRECTIONS, AND §194-B's "≥2 sh STORES" BOUND IS BYTE-WRONG (P31 S58) _L22224
• §212 — THE WALKING CURSOR IS COUNTABLE: *wp++ emits one addiu PER STORE, wp[0..2] emits one (P31 S58) _L22395
• §213 — INDEPENDENT SAME-BASE STORES: THE EMISSION ORDER IS A PERMUTATION OF SOURCE ORDER, AND THE PERMUTATION IS NOT ALWAYS THE IDENTITY (P31 S58) _L22440
• §217 — DECODING A CALL'S STACK ARGUMENT SLOTS: sw at 0x10/0x14/0x18 are params 5/6/7 (single observation — not yet cross-confirmed) (P31 S58) _L22618
• §226 — FRAME PADS: FOUR WAYS §162i1/§2429's DEAD-LOCAL LEVER MISFIRES (P31 S58) _L22933
• §228 — READING THE DIVIDE, PART N: the off-by-one compare is % K == 1, and three more discriminators (P31 S58) _L22994
• §229 — THE ADDRESS IS A VALUE: NAMING IT MOVES THE lui/addiu PAIR — AND §L14410 SAYS THE OPPOSITE FOR A REASON (P31 S58) _L23031
• §231 — TRANSCRIPTION AND SEMANTIC-READ HYGIENE: six ways the listing misleads (P31 S58) _L23095
• §194-B — addendum (P31 S58) — BOUND 2 is byte-wrong; see §209 Direction A _L23192
• §176-B — addendum (P31 S58) — the misdiagnosis direction _L23198
• §164-63 — addendum (P31 S58) — the interposed asm works when the SECOND value is an ordinary assignment _L23213
• §193-A — / §194-E addendum (P31 S58) — where the twin's body actually lives _L23222
• §235 — THE PHANTOM SYMBOL: A MASKED MATCH CAN CARRY A RELOCATION THAT DOES NOT EXIST (P31 S58b) _L23313
• §238 — SAME NAME, DIFFERENT FUNCTION: THE OVERLAY-HOMONYM TRAP (P31 S58b) _L23476
• §240 — A + K + B: WRITE THE CONSTANT BETWEEN THE TWO RUNTIME TERMS (P31 S58b) _L23550
• §241 — THE FOLDED SIGN-EXTEND-AND-SCALE: sll 16 ; sra (16 − log2 scale) (P31 S58b) _L23579
• §252 — THE GUARDED PRE-DECREMENT: (x != 0) && (--x == 0) (P31 S58b) _L23947
• §255 — THE EMPTY CASE, PART 2: FOUR TREE SHAPES IT BUYS (P31 S58b) _L23994
• §258 — ADDENDA TO EXISTING SECTIONS (P31 S58b) _L24109
• §202 — addendum (P31 S58b) — THE DEF-SIDE ALIAS ALSO CLEARS A RETURN+PARAM DOUBLE CONFLICT _L24158
• §205 — addendum (P31 S58b) — CHAINED ASSIGNMENT: N≥3 IS INNERMOST-FIRST, AND THE TEXT MIRRORS EMISSION _L24169
• §208 — addendum (P31 S58b) — IT SCALES TO SIX SITES, AND IT HAS AN EXACT INVERSE _L24186
• §210 — addendum (P31 S58b) — THREE CONFIRMED SPELLINGS OF THE BOOLEAN TAIL _L24215
• §213 — addendum (P31 S58b) — THREE MORE PERMUTATION LAWS FOR INDEPENDENT SAME-BASE STORES _L24274
• §217 — CROSS-CONFIRMED (P31 S58b) — AND THE INCOMING HOME SLOT IS THE MIRROR _L24391
• §220 — addendum (P31 S58b) — THE PARAMETER, NOT A COPY (SEVEN CARDS) _L24408
• §225 — addendum (P31 S58b) — THE GUARD-CLAUSE FINGERPRINT, AND THREE MORE SHAPES _L24505
• §229 — addendum (P31 S58b) — NAME IT INSIDE THE ARM _L24577
• §230 — CROSS-CONFIRMED (P31 S58b) _L24588
• §231 — addendum (P31 S58b) — FOUR MORE WAYS THE LISTING MISLEADS _L24597
• §232 — CROSS-CONFIRMED (P31 S58b) _L24628
• §260 — THE §154-A LEADING-ISLAND SPLIT: ONE CONFIG LINE, AND THE ISLAND PEELS FROM THE END (P31 S59, byte-proven) _L24678
• §262 — A LANE'S YIELD IS ONLY A LANE FACT IF IT IS SIZE-MATCHED (P31 S59) _L24812
• §264 — FOUR TELLS-LANE C RECIPES, EACH DRIVEN TO MATCH (P31 S59) _L24883
• ADD-1 — → §231 addendum (also cross-ref from §195-D) — THE MASKED-jal "MISSING CALL" ILLUSION _L25040
• ADD-6 — → §172b-1 / §264 addendum — SHIFT-AS-TEST: (x << 16) != 0 TESTS THE LOW HALF WITHOUT TRUNCATING THE PSEUDO _L25094
• ADD-7 — → §256 addendum — THE SINGLE-GUARD GOTO: THEN-BLOCK OUT OF LINE AT THE TAIL _L25103
• ADD-3 — → §238 addendum — TWO BINARIES CAN EACH DEFINE THE SAME func_ NAME WITH DIFFERENT BYTES, AND NO GENERATED REPORT SHOWS IT _L25293
• §270 — The A-prop 0-bank anatomy: a byte-correct body still needs FOUR layers to agree (P31 S59) _L25471
• ADDENDUM — to §1-I5 _L25761
• ADDENDUM — to §164-51 _L25826
• ADDENDUM — to §176-F5 _L25842
• ADDENDUM — to §225 _L25871
• ADDENDUM — to §229 — A POINTER'S NUMBER OF USES DECIDES WHETHER ITS ADDRESS FOLDS OR SURVIVES A CALL _L26059
• ADDENDUM — to §226 — A DEAD LOCAL SCOPED TO A NESTED BLOCK BUYS A MID-FUNCTION addiu sp PAIR, NOT A FRAME-SIZE CHANGE _L26177
• ADDENDUM — to §74 (func_800D0E30, resident) _L26545
• ADDENDUM — to §172b-4 (func_80185054, ov_SC03_097) _L26581
• ADDENDUM — to §265 (func_8017DC80, ov_SC07_002) _L26619
• ADDENDUM — to §17 (func_800CB794, md_MAIN_036) _L26658
• ADDENDUM — to §162p (func_8017C120, ov_MAIN_012) _L26706
• ADDENDUM — to §20 (~L1947) (func_80186AD0, ov_SC06_032) _L26740
• ADDENDUM — to §164-56 (func_8017F644, ov_SC04_005) _L26770
• ADDENDUM — to §237 (func_8017F7FC, ov_SC03_092) _L26805
• ADDENDUM — to §195-E — a goto-ladder's STORES must sit AT the labels, after the gotos, not inline before them _L27157
• Harness-defect — flags _L27631
• ADDENDUM — to §167-40 (func_8017E2CC, ov_SC04_015 — wave dg) _L27724
• ADDENDUM — to §87 (func_801815F4 ov_SC06_032; corroborating func_801840DC ov_SC05_017, func_80189C68 ov_SC03_006 — wave dg) _L27758
• ADDENDUM — to §263 (func_801E83AC, md_SC04_029 — wave dj) _L27797
• ADDENDUM — to §265 (func_8017D878, ov_SC03_107 — wave dj; corroborated by a REJECTED, contradicted card in wave dm — see closing) _L27811
• ADDENDUM — to §6 (func_801811F0, ov_SC03_102 — waves dj and dl, corroborated by a self-reported "nothing new" dm-wave card) _L27825
• ADDENDUM — to §195-G (func_80183BB0, ov_SC05_001 — wave dj) _L27839
• ADDENDUM — to §74 (func_8017EB34, ov_SC03_117 — counter/clamp variant; wave dj, corroborated by dk/dl/dm cards on the same function) _L27917
• ADDENDUM — §37 — merged into the §153/§236-5 entry above (func_801A419C, wave dl) _L27937
• ADDENDUM — §6 — merged into the §6 entry above (func_801811F0, wave dl) _L27945
• ADDENDUM — to §238 (func_80182CB4, ov_SC02_000 — wave dl) _L27953
• ADDENDUM — to §137a (func_801684B4, ov_MAIN_012; corroborated independently by func_80189E68, func_8017FF9C, func_801822B4, func_8018DA8C — wave dl) _L27971
• ADDENDUM — to §8c / §88d (func_8016AB6C, ov_MAIN_012 — wave dm) _L27987
• ADDENDUM — to §73 / §30#2 (func_800D1984, resident — wave dm) _L28001
• From — ck + cl + cm _L28129
• ADDENDUM — to §5a (func_80181F74, ov_SC03_112, wave cn) _L28271
• ADDENDUM — to §265 (func_8017E26C, ov_SC04_016, wave cn) _L28321
• ADDENDUM — to §42b (func_8018247C, ov_SC07_002, waves cu + cw) _L28359
• ADDENDUM — to §195-E (func_800CFC1C, md_MAIN_003, wave cv) _L28445
• ADDENDUM — to §215 addendum (func_800CB2C8, md_MAIN_033, waves cv + cw) _L28490
• ADDENDUM — to §236 item 4 (func_8017D268, ov_SC04_006, wave cw) _L28546
• Harness-defect — flags (not idioms — flagged for the operator) _L28607
• ADDENDUM — to §250 (func_8017D7CC, ov_SC03_115 — cx/cy/cz/dr) _L28648
• ADDENDUM — to §225 (func_8017E190, ov_SC03_115 — cx/cy/cz) _L28693
• ADDENDUM — to §45-A (func_8017F6A4, ov_SC02_016 — cy/cz) _L28746
• ADDENDUM — to §249 (func_80182ED4, ov_SC04_004 — dp/dr/dt) _L28790
• ADDENDUM — to §199-A (func_801816FC, ov_SC02_005 — dp/dr/dt) _L28835
• Harness-defect — flags _L28924
• §289 — an array local's address-taken base keeps every element's store alive, even though only one pointer escapes (func_80189EFC, ov_SC04_011) (P31 S60; waves #, byte-proven) _L29006

All sections, in order

• §3-How — to use this _L30
• §1 — Idiom catalog (asm pattern → C that produces it) _L39
• §3-I1 — Unsigned range check: (x - lo) < (hi-lo) → addiu+sltiu _L41
• §3-I2 — Byte mask forces andi even after lbu _L47
• §3-I3 — Division by a constant → magic multiply _L54
• §3-I4 — Runtime (variable) division → divu + zero-check break (NEEDS --expand-div) _L60
• §2 — Writing matching C (what makes gcc emit X) _L69
• §3-T1 — Loop pointer: top-of-body for addu induction, not constant-folded addiu _L71
• §3-T2 — Source statement order drives instruction scheduling _L78
• §3-T3 — Types _L85
• §3-T4 — Branch polarity: invert the source condition to flip gcc's chosen branch _L90
• §3 — When a diff is pure scheduling → decomp-permuter (harness built, Phase 6) _L107
• §3a — Escalation TIER above the permuter — web-research the compiler internals (HIGH VALUE, proven) _L128
• §3b — §31-directed permuter mutation — bias the search over the class's levers (Phase 24 T5) _L147
• §4 — Flag/toolchain gotchas _L190
• §5 — Known hard-residual classes (instruction-identical, one byte-exact blocker) _L199
• §5a — Cross-jump tail-merge — gcc collapses two byte-identical blocks the original kept separate (FIX FOUND) _L211
• §6 — Per-module optimization mixing — the -O0 boot module (Phase 7) _L246
• Detecting — the opt level (do this first) _L254
• Build — mechanism — per-file opt override (splat resegmentation) _L288
• §7 — PsyQ SDK types & symbols (the library-call prerequisite) _L303
• §8 — rodata island (compiler jump tables) — the .data→.rodata→.data sandwich (Phase 7) _L320
• §8a — rodata island in a flat OVERLAY — the tail sandwich, per matched jr-function (Phase 26 — PoC PROVEN) _L342
• §8a-pad — a trailing .word 0x00000000 under a jtbl dlabel is .align PAD, not an entry (Phase 26 session 6, byte-proven) _L380
• §8b — MULTI-jtbl per overlay — the ld_interleave --order sandwich + the same-subseg cases (Phase 26 session 4) _L404
• §8c — Splitting a TU means rebuilding its DECLARATION ENVIRONMENT, not moving text (Phase 26 session 6) _L437
• §8d — Templating a body INTO a TU must not CHANGE its declaration environment — demote the carried data externs (Phase 26 session 8, byte-proven on func_8015AE2C ×133) _L483
• §8e — The jtbl ALIGNMENT LAW + the pad-spec filter — multi-table .rodata spans (Phase 29, byte-proven; .run/probe_jtbl/verdict.md) _L530
• §9 — Link real PsyQ library objects byte-exact (Phase 7 — GO proven) _L613
• §9.1 — Generalised per-object linker — tools/psyq_link.py (+ psyq_link_lib.py), 18/18 libcd byte-exact _L642
• §9.2 — Wire a library region into the build with NOLOAD — no data carving (tools/psyq_link_region.py) _L666
• §9.3 — Make it the build: resegment + swap + resolve (tools/psyq_integrate.py, libcd DONE) _L685
• §9.4 — Integrating a SECOND library (libgs block 6 after libcd) — multi-library gotchas _L712
• §9.5 — Integrating a WHOLE multi-block library in one call (full libgs — Phase 7 session G) _L740
• §9.6 — Scaling library linking to the whole EXE (Phase 8 — 8 libs linked, 20%→50% byte-identical) _L766
• §9.7 — Binary-agnostic toolchain refactor (Phase 9) — the reusable pattern for Gen2 _L802
• §10 — Closing the regalloc/scheduling hard tail by hand (LZSS, Phase 7 session F — the full close) _L835
• §3-The — clean object-level metric (use this, not the permuter score, for jtbl/rodata functions) _L844
• Residual — A — commutative |/&/+ result lands in the wrong source-operand register _L856
• Residual — B — a return <const> materialised late / merged instead of distributed per-site _L867
• §11 — Cross-binary dedup & code-sharing (Phase 11 — "one match unlocks many") _L908
• §3-The — mechanism: game-code dedup is SOURCE-LEVEL, not an object swap (R-D1, the key lesson) _L926
• Per-binary — toolchain provenance (R24) _L959
• §12 — Ultracode harvest — parallel-draft + byte-gate at scale (Phase 12, resident: 1.4%→71.7% in one session) _L964
• §13 — Add a location overlay — the canonical runbook (Phase 13; the Phase-15 fleet recipe) _L1056
• One-command — onboarding — tools/new_overlay.sh <SCxx> <FILE_nnn> _L1062
• §3-The — flat-blob overlay config (what the template encodes) _L1071
• §3-THE — NON-4-ALIGNED-OVERLAY GOTCHA (≈75% of the fleet; fixed in the template + Makefile, automatic) _L1079
• §3-The — A→B→C per-overlay workflow _L1091
• Dedup-credit — (§11) for overlays — two shapes _L1108
• Fleet — build — make build-all / make check-all _L1120
• §14 — Propagate a matched function across the fleet — tools/dedup_propagate.py (Phase 15) _L1126
• §14a — The fleet bulk run (Phase 15 — --auto-from, 947 REAL → 74,527; 3.82% → 22.14% in one pass) _L1169
• §14b — Harvesting the UNMATCHED shared core — the match_one wall (Phase 15) _L1192
• §14c — Callee-signature-aware harvest — breaking the extern-type-conflict wall (Phase 15, T6) _L1213
• §14d — Deterministic recovery beats agent waves on the hard tail (Phase 15, the final-session finding) _L1269
• §14e — Two hard-tail dead-ends (Phase 15 — documented so they aren't re-attempted) _L1298
• §15 — Struct-heavy shared-core pipeline (Phase 16) — empirical determinations (S0) _L1313
• §16 — Guided hand-matching the struct-heavy core (Phase 17 — beats the §15 brute-force) _L1335
• §17 — The compiler-quirk wall — the matching TOOLKIT (Phase 18; gcc-2.7.2 source + byte-gated) _L1376
• Register-allocation — ORDER (call-crossing $s0/$s1 swap) → FORCE it with register pins (byte-proven) _L1384
• §3-The — STEERABLE idioms (byte-confirmed this phase) _L1404
• §3-The — pipeline gotcha — match_one ≠ the gate; sig_unify is MANDATORY _L1421
• §3-The — LOOSE-TYPING wall is real for narrow params (Phase 16, reconfirmed) _L1428
• Strategic — conclusion — the match-% lever post-research _L1435
• §17a — The TOOLKIT at WAVE scale (Phase-18 Step-3b/Step-1 — measured) + the pipeline-integration gotchas _L1445
• §18 — Per-file -O0 split inside an overlay/blob (Phase 19 T1) _L1519
• §19 — Scaling the toolkit waves — the recovery PIPELINE + the propagation CAP (Phase 19 T3) _L1597
• §20 — The wave-at-scale GATE CAP + residual-class verdicts (Phase 20) _L1632
• §3-THE — CAP: at this tail the match_one→gate gap is the LOOSE-TYPING CALL-GRAPH wall (not cheap plumbing) _L1637
• Diagnostic — lesson: a failed in-TU build leaves a STALE .o _L1654
• §3-NEW — / CONFIRMED residual classes (this session) _L1660
• Operational — gotchas (cost real time) _L1681
• What — WORKED — the Phase-20 reusable wins _L1689
• Phase-20 — RESOLUTION — tools/cast_call_sites.py BUILT + the cap re-diagnosed (R14, byte-proven) _L1701
• §21 — wave-distilled idioms (Phase 21) _L1752
• §22 — DEF-side loose-typing recovery + grinder blacklist (Phase 21) _L2005
• §23 — Giant func_80153E00 cracked (scalar-data CAST); BUT most giant drafts are STALE+INCOMPLETE, and a diag MUST remove artifacts (Phase 21 — byte-proven + a self-correction) _L2032
• §24 — The ov_SC01_077_a.c split-file vein: split-aware propagation, but loose-typing-gated (Phase 21) _L2085
• §25 — The "schedule" class is mostly COALESCING (pin-crackable), not scheduling; + the gate two-stage + h_exact over-counts ×134 (Phase 21, cont.6) _L2132
• §3-The — crack: the residual was gcc-2.7.2 COPY-COALESCING, not the instruction scheduler _L2144
• §3-The — genuine scheduler — rank_for_schedule (sched.c), for when it IS scheduling _L2160
• §3-The — genuine schedule WALLS (do NOT re-grind — stub) _L2169
• §3-h — _exact OVER-COUNTS ×134 — verify shareability before crediting a class's "reach-134" (R14) _L2177
• §3-The — gate two-stage — sig_unify is a FALLBACK, not unconditional (gate_stage.py, §19 folded in) _L2189
• §26 — The cheap close=0 recovery lever is EXHAUSTED; idiom_loop --assess was DOUBLY inflated (Phase 21, cont.7) _L2199
• §3-The — _a close=0 recovery banks 0/20 — same def-side wall as MAIN (0/40) _L2205
• Where — this leaves the reach-134 tail (cont.6 option-3, now CONFIRMED byte-backed) _L2233
• §27 — Giant matching recipe (Phase 21 cont.7b — validated on func_80176D94, 152 ins) _L2259
• §28 — Banking a "close=0 gate-rejected" giant: the canonical-extern recovery (Phase 22 T1, byte-proven on func_8015126C ×134) _L2325
• §28a — decomp.wiki GCC patterns worth trying on BFM giants (decomp.wiki/compilers/GCC, raw at decompals/decompedia; PS1-applicable subset) _L2345
• §28c — The close=0 recovery is NOT fully exhausted (§26 corrected, R14); + the dedup_propagate registry-skip recovery (Phase 22 T2) _L2352
• §28b — The struct-walled close=0 giant (§28 case #3) IS bankable: the engine_types.h type-lift (Phase 22 T2, byte-proven on func_80156B74 ×134) _L2357
• §28d — The "macro-extern-injection" lever: freeing reach-134 inline matches dedup_propagate skips as "not self-contained" (Phase 23, tools/inject_capped_externs.py) _L2366
• §29 — Reasoning-model (GLM5.2) DEF-side reconciliation idioms + the wall's hard limit (Phase 23 T10.7, tools/glm_reconcile.py) _L2374
• §30 — Fable5Max cracks §20/§10 "unsteerable" from the gcc SOURCE: store-vs-load is a /s aliasing flag, the def-side wall has a macro escape, + the birthing-boost (Phase 23, byte-proven on giant func_8014EE14 248 ins ×134) _L2382
• §30a — §30 generalizes to the FULL near-miss backlog (via STANDARD Opus agents, not just Fable5) + 2 more steer levers + the mechanical-integration throughput unlock (Phase 23 (a)) _L2394
• §31 — THE gcc-2.7.2 CODEGEN MAP: pass → residual → C-lever catalog (Phase 23; 4 Fable5 agents read the compiler source) _L2402
• §32 — The region-a CAMERA-GIANT idiom set: struct-base hoisting + 4 sibling levers (Phase 24 T7, Fable5-cracked on func_80129CF8 191 ins, match_one MATCH; transferable to the 6 sibling giants) _L2422
• §33 — Automating the giant decl-reconcile: tools/reconcile_decls.py (the DATA analog of §20's cast_call_sites) + a fleet-majority type oracle (Phase 24 T7b, byte-proven on func_80129CF8) _L2434
• §34 — The func_80138ED0 giant crack: gcc-2.7.2's 3-qty sort bug + the zero-byte asm allocation toolkit + the giv-init fence (Phase 24 T5; Opus→close=21, Fable5→MATCH ×134) _L2454
• §35 — The region-a sibling-giant harvest: difficulty ≠ $s-reg count (it's global-array hoisting) + the banking recipe + new loop idioms (Phase 24 T7, 5 parallel Opus-Max agents) _L2471
• §36 — Fable5 giant-crack levers (Phase 24 T7 Fable5 batch; accumulates as each lands — full RTL dumps in .run/t7/fable/) _L2487
• §37 — The T7 §G giant endgame: 6/8 cracked, meta-laws + transferable levers (Phase 24, 2026-07-07; FULL byte-verified detail + gcc-2.7.2 line cites in docs/gcc-2.7.2-map/t7g-giant-harvest.md) _L2506
• §38 — The WHALE func_80144B9C (770 ins): the -O0 struct-assign memcpy idiom + the -O0 reach-134 ×134 rollout (Phase 24 T7 §G, cheap Opus — no Fable5, no calls.c) _L2527
• §39 — The ×1→×134 giant-endgame: propagate a matched -O2 giant via the NATIVE DEFINE-macro path (Phase 24 T7 §G close, 2026-07-08) _L2537
• §40 — Structural families: the MECHANICAL symbol-remap (crack one exemplar → remap the rest, ~0 tokens) (Phase 25 T3/T7, 2026-07-08) _L2553
• §40a — The DECL-RECONCILE pass (type-lift so remapped drafts compile in the sibling TU) (Phase 25 T7.2, 2026-07-08) _L2601
• §40b — The reloc-tracker blind spot: the indexed-global idiom that hid the "reach-1 tail" (Phase 26 Task 1, 2026-07-11, byte-verified V0/V1) _L2634
• §40c — The h_seq per-sibling reconcile: templating a reconcile-class crack ×134 (Phase 26 Task 8, 2026-07-12, byte-proven) _L2676
• §31-triage — R17 applies to CODEGEN residuals, never to a compile ERROR (Phase 26 session 7, Drew asked) _L2693
• §41 — The DEF-SIDE canonical-sig wall: mechanically banking a drafted giant past conflicting types (Phase 25 T5b batch-2, 2026-07-09; tools/canon_sig_reconcile.py, byte-proven on func_8013B274) _L2710
• §41a — v3.1: the def-side wall was ~71% TOOL-shaped — the five measured defects + the laws that dissolve them (Phase 25 T6, Fable5, 2026-07-09) _L2754
• §41b — T7 execution: the object-only probe OVER-counts BANKABLE by two link/rodata classes (Phase 25 T7-M1, 2026-07-10) _L2809
• §41c — T7-M2: the ×134 def-side-wall sweep via per-sibling RE-reconcile (Phase 25, 2026-07-10; 4,389 banks, ~0 agent tokens) _L2839
• §41b — addendum — M4 "reconcile_decls" tier is ALSO a probe over-count: 0/8 mechanical (Phase 25 T7-M4, 2026-07-10) _L2858
• §41d — void→s32 is NOT always byte-neutral: gate the RAW draft FIRST (Phase 26 session 6, byte-proven) _L2878
• §42 — The F-band ≤28 regalloc crack wave: register-pin/DENSITY levers beat the permuter (Phase 25 T7 F-band, 2026-07-10; Ultracode 9-worker wave, 4/9 banked byte-identical, 266 swept ×134) _L2900
• §42a — addendum — wave 2 (residuals + 29-100 band): iso-MATCH ≠ real-TU bank, the memcpy→struct-assign fix, +5 levers (2026-07-10b) _L2953
• §42b — addendum — wave 3 (Max, 2026-07-10c): THE STALE-OBJECT GATE TRAP + the read-global &-cast drift + fix _L2994
• §42c — addendum — wave 3 (Max orchestrator + CORRECTED Ultracode fan-out, 2026-07-10c): the real-TU-faithful parallel harness (rtu_match) + 7/9 crack, ZERO iso-drift _L3033
• §42d — addendum — wave 4 (rtu_match fan-out over the mapped frontier, 2026-07-10c): 24/26 MATCH, +5 durable levers _L3082
• §42e — propagating a CRACK ×134: the def-finder bug + the byte-drift residual (the "remap-fail" misdiagnosis) _L3121
• §43 — The K&R s16-param definition DISSOLVES the "narrow-param wall" for by-value register args (Phase 25 task A, Fable5 crack of the 369-ins giant func_80166994 ×134, 2026-07-11) _L3195
• §44 — The Phase-25 cheap-Opus giant batch: 5 structural levers + the §43 extension (2026-07-11, 6 crackers over the frontier giants) _L3242
• §45 — The flagship func_80133CD4 crack (399 ins ×134): the merged-variable permutation-breaker + the 1-death local-alloc gate (Phase 25 task A giant escalation, Fable5 gdb-on-cc1, 2026-07-11) _L3298
• §46 — The func_80178D40 crack (890 ins ×134, the heaviest core in the game): four LOOP-STRUCTURE levers cheap-Opus found by reading loop.c/jump.c/cse.c (Phase 26 session 8, 2026-07-13) _L3313
• §47 — The live-length SLIDER: splitting a global.c allocno-priority TIE with one zero-byte asm (Phase 26 session 8, Fable5 Max, byte-proven on func_8017BEBC 952 ins ×113) _L3365
• §48 — The 12-core jr crack wave: the ALLOCNO-PRICING dials and the EBB rule (Phase 26 session 8, Ultracode, 9/12 MATCH first pass) _L3405
• §3-A. — ALLOCNO-PRICING DIALS — move a value into the register you want, byte-neutrally _L3413
• §3-A4 — SINK THE CONSUMER CALL INTO THE ARMS (the inverse of A1; func_8016AB6C, byte-proven) _L3444
• §3-B. — THE EBB RULE — the general form of §46-L2 _L3468
• §3-C. — TYPE- AND SHAPE-DRIVEN CODEGEN (the C type literally selects the addressing mode) _L3484
• §3-D. — THE CROSS-JUMP RATCHET (the sharpest new trap — func_80131340 L-C) _L3508
• §3-E. — Meta _L3518
• §49 — The LUID DIAL: a zero-byte SCHEDULING dial (the sched.c analogue of §47) — func_8017A4AC (536 ins ×134), Phase 26 session 8 _L3527
• §50 — Refinements that BOUND §47/§48 (from the func_80135EB0 wall, 21→6; Phase 26 session 8) _L3576
• §51 — TOOLING INTEGRITY: the silent skip, and how to hunt it _L3630
• §51a — The bug class _L3636
• §51b — Why the byte-gate cannot save you _L3652
• §51c — THE METHOD (do not audit by reading the regex) _L3662
• §51d — THE LAWS _L3677
• §51e — The false-wall pipeline (why this is not just hygiene) _L3739
• §51f — Checklist for any new corpus-scanning tool _L3755
• §51g — When the thing you are scanning has a GRAMMAR, parse the grammar (tools/cdecl.py) _L3769
• §52 — The WALKER-FAMILY skeleton: 6 regalloc-order levers + a deeply-characterized intrinsic wall (func_80178004, 165 ins ×134; Phase 26, Fable5, 2026-07-15) _L3913
• §3-The — 6 levers (the "walker-family skeleton" — apply to the 12 siblings; levers 1-5 retire ~half the residual) _L3924
• §3-Why — the wall is (probably) intrinsic _L3945
• §52a — The regalloc sibling wave: new levers + two new wall classes (cheap-Opus applying §52, 2026-07-15) _L3959
• §52b — Sibling wave 2: more de-pin levers, a third wall class, and the match_one→whole-binary gap at scale (2026-07-15) _L3997
• §53 — SWEEP A FAMILY WITH THE TOOL ITS EXEMPLAR NEEDED: the jr/switch carve, and how omitting it manufactured the "families don't template" doctrine (Phase 28 T1, 2026-07-15) _L4028
• §3-The — case _L4033
• §3-Why — 0/8 was structural, and predictable from two words _L4045
• §3-The — rule _L4062
• §3-The — meta-lesson (R35, and why this one is expensive) _L4078
• §55 — Core-crack wave levers + the GATE-ORCHESTRATION law (Phase 29 T3, 13-agent ultracode wave, 2026-07-17) _L4093
• §55a — New byte-proven levers (each from a banked or near draft) _L4098
• §55b — THE GATE-ORCHESTRATION LAW (3 traps, ~3.5h lost; all recovered, 0 data lost) _L4122
• §55c — Sizing the propagate: a TARGETED propagate is ~4 min/core, and "it's slow" was a BROKEN-TREE ARTIFACT _L4141
• §54 — --fix-def-sig: the member's CANONICAL DECLARATION is a build step too (tiny-IMM mega-pools, +4,801, Phase 29 T6, 2026-07-16) _L4163
• §56 — Banking a hand-drafted GIANT into its exemplar TU: self-contained draft vs live-TU decls, 4 reconciliation tactics (func_8013FAF8, 312 ins ×138, Phase 29 T4, 2026-07-17) _L4187
• §56b — PROPAGATING an h_seq giant: the exemplar's externs MUST be fleet-canonical, not the draft's types _L4232
• §57 — The SELF-decl normalize: the sibling's OWN caller declares the templated fn divergently (the third §17a-1 direction; tools/normalize_self_decls.py, func_801670E4 ×137, Phase 29, 2026-07-18) _L4256
• §57a — Two NSD corrections + the SURGICAL-ONLY law + the honest broad-sweep yield (Phase 29, 2026-07-18) _L4303
• §58 — match_one MATCH ≠ BANK: the four blind spots + the crack-wave reconcile-before-bank law (Phase 29 crack-wave, 2026-07-18) _L4343
• §59 — Three h_seq sweep-residual classes match_one/the-exemplar-bank don't reveal (Phase 29 crack-wave close, 2026-07-18) _L4377
• §60 — Classify the residual, don't rank it: the deterministic residual→class classifier and what it measured about the backlog (Phase 29 Task-13A, 2026-07-21) _L4407
• What — it measured — the whole open backlog, byte-grounded _L4431
• §3-Two — corollaries worth remembering _L4450
• §3-The — parallel-probe race this surfaced _L4463
• §60a — What the first DIRECTED grinder run exposed (Phase 29 Task-13B, 2026-07-21) _L4472
• §60b — The plateau autopsy's verdict: a partial drift is a WRONG DRAFT, not a missing transform (Phase 29 Task-13B close, 2026-07-21) _L4510
• §61 — Task 14: the gate ladder's missing stage is the ARITY pre-pass, and it is TU-side not draft-side (Phase 29, 2026-07-21) _L4545
• §61a — The Task-5 wave: 11/12 MATCH, 0 banked — three DISTINCT integration walls, each now named (Phase 29, 2026-07-21) _L4606
• §61b — The jtbl gate stage: built, and the ORDERING law it exposed (Phase 29 Task-14 stage 4, 2026-07-21) _L4658
• §61c — The jtbl bank is INCREMENTALLY valid and CLEAN-INVALID (Phase 29, 2026-07-21) — the blocking finding _L4713
• §61d — The undo was eating the tree: two tools, one defect, invisible to the byte-gate (Phase 29, 2026-07-22) _L4779
• §62 — The jtbl RECONCILE must also follow the carve: the post-carve draft reconcile (harvest_verify._jtbl_reconcile, Phase 29 SESSION-11, 2026-07-22) _L4833
• §63 — The fresh-138 DEF-SIDE blocker: fix the HEADER decl, not the draft (fix_header_decl.py, Phase 29 SESSION-13, 2026-07-23) _L4877
• §64 — The §20 type-lift's three laws: fold the tagged typedef, check VISIBILITY, and strip only what is TEXTUALLY IDENTICAL (lift_types.py, Phase 29 SESSION-14, 2026-07-23) _L4908
• §64a — VARIANT types: UNIQUIFY the camps, do not reconcile them (uniquify_type.py, Phase 29 SESSION-14) _L4957
• §63 — UPDATE (Phase 29 SESSION-14) — fix_header_decl's "SAFE" verdict is FLEET-BLIND; it MUST be R22-validated _L5000
• §65 — The stranded-draft recovery: BLAST-RADIUS TIERS, and the per-overlay de-macroize that refutes §20's DEF-conflict wall (tools/demacroize.py + tools/blocker_probe.py, Phase 29 SESSION-16, 2026-07-24) _L5015
• §65a — The blast-radius taxonomy (makes §61's law structural instead of remembered) _L5030
• §65b — The escape: de-macroize the instantiation, don't touch the shared header _L5045
• §65c — rtu_match MATCH → bank held 13/13 on self-decl, but broke on the FIRST callee-decl case _L5081
• §65d — Existing-ladder baseline, measured (do this before building a recovery stage) _L5091
• §65e — Two oracles, and the disagreement is the finding (R34 in practice) _L5101
• §65f — The de-macroize lever's BOUNDARY, measured: byte-neutral 14 times of 15, and the 15th is why the gate exists _L5118
• §65g — Where the cheap levers STOP: the local-type and in-TU-self-decl classes did not yield _L5139
• §66 — Exercise a banking driver's SUCCESS path before pointing it at a wave: the free re-bank test (Phase 29 SESSION-17, 2026-07-24) _L5159
• §66a — The widest write in a pipeline is the one most likely to be UNDECLARED _L5181
• §66b — A metric parsed out of another tool's prose goes NULL silently when the label changes _L5200
• §66c — Before a wave, verify the FUEL exists; an "already attempted" set built from the wrong directory lies in BOTH directions _L5217
• §66d — The permuter⇄reader loop: alternate a random search with a byte-verified idiom, and let residual_class decide whose turn it is (Phase 29 SESSION-17) _L5245
• §66d-1 — What transfers between giants is the LOOP, not the PIN _L5280
• §66d-2 — Two operational sharp edges _L5289
• §66d-3 — Read the ILS per-cycle SERIES, not its final best: a repeated score and a still-falling one look identical in a summary line and mean opposite things _L5300
• §67 — The arg-copy PLACEMENT lever: launder a parameter into a fresh pseudo AT the statement where the target's copy lands (Phase 29 SESSION-18, func_8014D820 25 → 16) _L5315
• §67a — Run the symbol-set guard BEFORE you pay for a gate (tools/symcheck.py, Phase 29 SESSION-18) _L5405
• §66d-4 — "ILS converged" means converged FOR THAT WEIGHT PROFILE, not a floor (amends §66d-3; Phase 29 SESSION-18) _L5438
• §66d-5 — residual_class's "structural ⇒ permuter CPU is waste" is WRONG for schedule permutations (measured, Phase 29 SESSION-18) _L5491
• §68 — A comment-only line halted the extern scan, and the skip label blamed the type cap (Phase 29 SESSION-18) _L5524
• §69 — How to attack a behemoth: map it, don't draft it (Phase 29 SESSION-18, func_80183814, 5,122 ins) _L5569
• §70 — The giv-init base register: walk the PARAMETER, not a copy of it (Phase 29 SESSION-18, func_801777BC) _L5619
• §71 — Before mapping a giant, look for an already-matched SIBLING beside it (Phase 29 SESSION-18, func_8017D960, 3,338 ins) _L5660
• §72 — A register __asm__ pin is a PREFERENCE, not a reservation (Phase 29 SESSION-18, func_8017F510) _L5726
• §3-The — honest fix was source-level and cheap _L5750
• §3-Giv — record order (the §70 family) _L5760
• What — is left, and what is byte-recorded as SPENT _L5766
• §73 — A def-side self-decl conflict has TWO axes: RETURN (fleet widen, T2) and PARAMS (casts at each use, T0). Diagnose which before paying for the expensive one (Phase 29 SESSION-19, func_8014F3E8 + func_8014D4C0) _L5783
• §74 — Auditing a pinned draft: the §72 hazard is CALLER-SAVED pins spanning a call, and only the disassembly can tell you (Phase 29 SESSION-19, func_8017D960 b2, 5 pins) _L5822
• §75 — A propagation cap is usually a MINORITY-SPELLING SOURCE OVERLAY, not a wall: census the carried extern before believing the exclusion message (Phase 29 SESSION-19, func_8014F3E8 ×4 → ×138) _L5866
• §75a — The exclusion classes, enumerated with named causes (Phase 29 SESSION-19, the 134-binary dedup_extend sweep) _L5925
• §75b — A body's preamble can carry #defines, not just externs; extraction lifts only the externs (Phase 29 SESSION-19, func_80165CA0 ×3 → fleet) _L5948
• §75c — Class-B's remedy is the FULL §17a-1 PAIR (decl and call-site cast); a decl-only fix moves the error and looks like a new wall (Phase 29 SESSION-19, func_8012F14C) _L5997
• §76 — The allocno CLASS (local vs global) is the dominant regalloc lever, and C reaches it ONLY through declaration scope and variable reuse (Phase 29 SESSION-19, behemoth #3 func_8017F510 1,511 ins, 97 → MATCH, pin-free) _L6028
• §3-The — mechanism, with citations _L6037
• §3-The — attribution primitive (use this before calling anything a scheduling residual) _L6057
• §3-Two — diagnosis traps this function proved _L6064
• Practice — Practice _L6074
• §77 — Every extraction tool carries a NARROW hard-coded preamble set; anything outside it silently caps the body's reach. Diff the preamble before you gate. (Phase 29 SESSION-19 — three variants in one session, two different tools) _L6084
• §3-The — CANDIDATE gate and the REAL gate need DIFFERENT preambles — keep the difference out of the bank _L6124
• §78 — A LENGTH drift can be a register grant in disguise; and fold never leaves a literal first in an | chain (Phase 29 SESSION-19, behemoth #2 func_8017D960 3,338 ins, 1806 → 0, pin-free) _L6174
• §3-The — drift was an allocation decision, not missing code _L6180
• §3-The — economics _L6211
• §79 — For a 0-callee giant, fingerprint by DATA symbols (§71 cannot fire); and the STACK-SLOT ORDER is a declaration-order oracle (Phase 29 SESSION-19, func_8017BF14 4,763 ins, cold start → 45/4763) _L6220
• §71 — has a blind spot, and this is it _L6226
• §3-NEW — LEVER — the frame layout reads back the original declaration order _L6240
• §76 — confirmed at scale, and a pin nuance _L6251
• §3-The — residual, and the honest read _L6260
• §80 — A do-not-re-buy entry is scoped to its BASE, not to the function; and the pin's hidden cost is an unconditional qty_phys_sugg (Phase 29 SESSION-19, func_8017BF14 45 → 0) _L6270
• §3-The — pin's hidden cost, with the citation _L6291
• §3-The — flagged "#1 move" LOST — and why the failure is informative _L6302
• §78 — 's attribution primitive, run and reproduced _L6312
• Cold-start — economics, now complete _L6318
• §81 — Banking a jr (jump-table) function: the 3-step carve chain, and why match_one cannot see the problem (Phase 29 SESSION-19, func_8017C954) _L6323
• §3-The — defect this exposed: a shared type that is present but invisible _L6354
• §82 — Two source-shape oracles from behemoth #6: a duplicated addiu $aN,$sp,K across a jal means the block was INLINED, and scalar-vs-aggregate decides WHEN a stack slot is allocated (Phase 29 SESSION-19, func_8017C730 1,061 ins) _L6370
• §3-1. — The inlined-helper signature _L6375
• §3-2. — Scalar vs aggregate decides when the slot is allocated _L6389
• Also — reproduced on this function _L6401
• §3-And — the banking footnote (§75a class A, one line) _L6405
• §83 — The parameterised-repeat law, the spill-area trap, and why a per-case edit cannot move a per-case symptom (Phase 29 SESSION-20, func_80183814 5,122 ins, cold-ish start → 36 structural / 99.3%) _L6412
• §83a — READ THE HEADLINE NUMBER CORRECTLY: a LENGTH drift makes match_one's count meaningless _L6419
• §83b — THE LEVER: find the parameterised REPEAT before decoding case-by-case _L6427
• §83c — TRAP: a "dead local" in a prior draft may be gcc's OWN spill area _L6445
• §83d — CSE's quantity budget is WHOLE-FUNCTION, so a local rewrite cannot fix a local symptom _L6452
• §83e — §80 vindicated again, on the same day it was written _L6466
• §84 — The DERIVED-OFFSET remap bug: a hand-computed literal that encodes the DISTANCE between two per-overlay symbols, and why match_one is structurally blind to it (Phase 29 SESSION-20, func_8013D53C) _L6472
• §3-The — construct _L6477
• §3-Why — it survived every candidate gate _L6495
• §3-THE — FIX IS MECHANICAL — the tool already holds the answer _L6510
• Scope — , measured (do not over-generalise — §80) _L6518
• §3-Two — ladder lessons banked with it _L6528
• §85 — The RETURN-axis fleet widen is ALL-OR-NOTHING: widening the shared header alone guarantees a conflict in the source overlay (Phase 29 SESSION-20, func_8012CC88 / func_8014D12C) _L6539
• §3-The — conflict _L6544
• §3-THE — FAILURE MODE — widening only engine_core.h is worse than not starting _L6552
• §3-The — precondition, and how to check it in one grep _L6559
• §3-Do — the WHOLE axis in one edit, then R22 once _L6567
• Reading — , for the next person _L6576
• §86 — Pinned-exemplar templatability is a PER-FAMILY property, not a per-member rate; and the §42e pin guard is now over-conservative (Phase 29 SESSION-20) _L6589
• §3-The — guard refuses a class that largely works _L6591
• §3-THE — LAW: all-or-nothing PER FAMILY _L6600
• §3-Why — the two live families differ from the three dead ones — the open question _L6627
• §87 — match_one COMPILES but never LINKS, so an unresolvable data symbol reads as MATCH; and stored drafts go STALE against the tree (Phase 29 SESSION-20) _L6633
• §3-The — blindness ladder, now complete — FOUR classes match_one cannot see _L6649
• Consequence — for the backlog ledger _L6659
• §3-The — cheap discriminator, before spending a sweep _L6666
• §88 — cross_jump will not merge a common suffix containing a CALL; and §78 is scoped to ORDERED comparisons only (Phase 29 SESSION-20, the behemoth close-out) _L6674
• §88a — repeated CALL-shaped blocks are left UNMERGED; call-free tails are merged for you _L6679
• §88b — the slti literal-position law (extends §78 to comparisons) _L6686
• §88d — BANKING ORDER: run the §81 carve chain BEFORE banking, never after _L6701
• §88e — a wrong diagnosis, refuted properly (the model for how to treat an inherited lever) _L6708
• §88f — the missing rung: a RELOCATION gate between match_one and the binary _L6718
• §89 — Two throughput rules the project already had written down and was not following (Phase 29 SESSION-20) _L6726
• §89a — MEASURE the write set; do not assert its tier (tools/blast_radius.py) _L6732
• §89b — the parallel gate farm existed; the family path could not reach it (tools/sweep_parallel.py) _L6745
• §3-The — standing sequence _L6758
• §90 — Five tool-integrity laws from one session, each of which changed an answer (Phase 29 SESSION-21, 2026-07-27) _L6766
• §90a — A comparison tool MUST share its reference oracle's index space, exactly _L6772
• §90b — "Byte-neutral" is not "wanted": undo on the SUCCESS path too _L6789
• §90c — A library-callable function must FAIL CLOSED on an unconfigured module _L6799
• §90d — Do not measure a live wave's drafts (§87 in real time) _L6810
• §90e — An agent's CONCLUSION and its EVIDENCE fail independently — re-derive the premise, not the fix _L6818
• §91 — A structure-TRANSFER is only valid where the structure corresponds: the --like role trap (Phase 29 SESSION-21, func_8012AAAC ×137) _L6842
• §3-The — three-hypothesis trail, because two of them were wrong and the wrongness is instructive _L6871
• §92 — Conforming a DECLARATION: pointer changes are caller-neutral, scalar-WIDTH changes are not (Phase 29 SESSION-21, tools/conform_decls.py) _L6891
• §93 — set -o pipefail attributes a pipeline failure to the LAST stage, not the failing one (Phase 29 SESSION-21, func_8014D820) _L6922
• §94 — A family sweep's 0/N is a TYPE-CARRY failure until proven otherwise: lift the exemplar's local types, ALL of them, transitively (Phase 29 SESSION-21, func_8016B6BC 0/137 → 137/137) _L6947
• §95 — reconcile_tu dropped the SIBLING declarators of a multi-symbol extern line (Phase 29 SESSION-21, func_80176218) _L6983
• §96 — The same rewrite, one shape down: reconcile_tu matched statements to lines by TEXT, so every COMMENTED declaration was silently skipped (Phase 29 SESSION-22, func_80176218 banked) _L7018
• §97 — The gate's own tree hygiene: a refused carve, an unchecked recovery, and a snapshot that captured a dirty tree (Phase 29 SESSION-22) _L7066
• §98 — conform_decls had three defects, and only the third needed R22 to find (Phase 29 SESSION-22, func_8014CF04) _L7113
• §99 — The narrow-param wall is a DEF-side problem with a ZERO-blast-radius fix: convert the definition to K&R (Phase 29 SESSION-22, func_80175AB8 + func_80175DA8) _L7167
• §3-Two — reconcile_tu bugs found underneath, one introduced while fixing the other _L7190
• §100 — Prefer the DRAFT-LOCAL fix: a type only one function uses belongs in its BODY, not in a shared header (Phase 29 SESSION-22, func_80175DA8 0/137 → 137/137) _L7216
• §101 — The STALE DEFAULT class: a guard whose cause was removed is a silent skip wearing a safety label (Phase 29 SESSION-22, three instances in one session) _L7245
• §102 — A PLUMBING verdict can MASK a DIFF; and K&R is not always a codegen change (Phase 29 SESSION-22, func_8016EC0C) _L7272
• §103 — A FILE-scope extern in a shared overlay TU is a GLOBAL constraint on every LATER function; move the DECL, not the draft (Phase 29 T48/T51, func_80135260 — the fleet-wide half) _L7307
• §104 — Two silent-skip defects in one scan: match on MASKED text, emit from the ORIGINAL (Phase 29 T53, gather_externs) _L7395
• §105 — A gate's revert must survive an EXCEPTION, not just a failure (Phase 29 T53, jtbl_family_bank) _L7431
• §106 — Persist the MEASUREMENT, derive the POLICY: a stored route let a stale file out-vote the live table (Phase 29 T54, residual_class._ROUTE) _L7470
• §107 — A lever wired into ONE gate path is a lever most families cannot reach (Phase 29 T56, func_80144090 0/136 → 136/136) _L7513
• §108 — Diagnosing a family 0/N: the four causes, and the third opt-in lever (Phase 29 T59) _L7551
• §109 — Conforming a definition to a shared header: fix the NAMES, then check the RETURN precondition (Phase 29 T60) _L7600
• §110 — A unit must define exactly ONE function, and "ends in ;" does not tell you which line defines it (Phase 29 T65) _L7640
• §111 — The distinct-code metric is not noisy: a family pays it only if its members are byte-VARIANT (Phase 29 T66) _L7681
• §112 — A macro-scoped declaration only collides where the macro is INSTANTIATED (Phase 29 T67/T69, audit_header_sigs.py) _L7730
• §113 — An ARITY blocker only exists if the macro CALLS the function; an address-taken use has no call site (Phase 29 T72) _L7776
• §114 — The THIRD decl axis: a CALLEE the draft declares differently from the target TU (Phase 29 T76/T77) _L7808
• §115 — A func_XXXXXXXX predicate rots by design: the same name-form assumption in THREE places (Phase 29 T78) _L7850
• §116 — Optimization level is a property of the FILE, not the function: read a family 0/N against the member's stub HOME (Phase 29 T79) _L7877
• §3-The — fix moves the DEFINITION, not the stub — and here is why the obvious shortcut fails _L7895
• §117 — Spell the sibling's symbol from the SIBLING's address, not the exemplar's kind (Phase 29 T82) _L7926
• §3-Why — it survived so long: a MASKED oracle will MATCH a wrong symbol _L7953
• §118 — Ordinal (positional) immediate resolution: compare C tokens to the DIFFERING asm uses (Phase 29 T87) _L7963
• §119 — Two levers on the SAME axis, opposite directions: test the off-diagonal (Phase 29 T89) _L7997
• §120 — Uniquify draft-defined TYPE names; and check which of N staging sites you actually patched (Phase 29 T93) _L8026
• §3-Do — NOT "strip the duplicate typedef" — it breaks the extern that uses it _L8037
• §3-The — wiring trap that cost two attempts _L8043
• §121 — Synthesise externs for macro-DEFINED callees from the macro's own definition head (Phase 29 T95) _L8061
• §122 — GATE RAW BEFORE TRANSFORMING; the undo belongs to the WRITER, as a per-edit journal (P30 T0a, 2026-07-30) _L8084
• §123 — PROPAGATE A FAMILY WITH THE TOOL ITS TIER NEEDS: dedup_propagate is h_exact-only; its refusals are statements about the TOOL (P30 wave 1, 2026-07-30) _L8116
• §124 — A "not matched" verdict can mean the definition is there under a DIFFERENT C NAME: the asm-label alias blind spot (P30 SESSION-28, func_8016191C ×137) _L8153
• §124a — a family sweep's 0 matched-exemplar families may be a FILTER, not a wall _L8198
• §125 — Split the CARVE from the BODY before calling a jr residue a wall — and measure it by SHA from a CLEAN tree (P30 SESSION-28; this section's first draft was WRONG and the method caught it) _L8206
• §3-The — method (keep this) _L8213
• §3-The — instrument rules that make its answer trustworthy (this is where I failed) _L8223
• §3-The — corrected results (each SHA-verified, from a clean tree, restore re-verified) _L8238
• §3-Two — further notes worth keeping _L8248
• §3-The — meta-lesson _L8257
• §126 — The carve-within-a-carve: an ADDRESS RANGE is not an OPTIMIZATION REGION (P30 T2, byte-proven end-to-end) _L8264
• §3-The — finding: opt level is per FILE, so the file's contents must be opt-HOMOGENEOUS _L8279
• §3-The — instrument trap that hid it (and it is §124's shape again) _L8290
• §3-The — mechanics _L8299
• §126a — a bare except: continue around a coverage-asserting oracle re-creates the silent skip (P30 S28) _L8317
• §127 — The -O0 regime: the CONSTANT-OFFSET FOLD, and why -O0 needs its own idiom set (P30 T3 wave, 15 targets) _L8349
• §3-The — idiom they kept re-deriving: the constant-offset fold _L8356
• §3-The — rest of the -O0 regime (write PLAIN C, and mean it) _L8367
• §127a — §71 (sibling-first) is the strongest -O0 lever, and it beats the index _L8377
• §127b — the knowledge was in a SOURCE COMMENT, not the cookbook _L8386
• §128 — A raw NUL in C source makes grep SILENTLY SKIP the file (P30 S28, 137 files) _L8393
• §128a — a negative control must corrupt a SCRATCH COPY, never the tracked file _L8425
• §129 — Post-carve, rtu_match/match_one COUNT THE JUMP TABLE AS INSTRUCTIONS; and a carve must never be committed without its owner (P30 S28, func_8013BD74) _L8437
• §129a — the target instruction count is INFLATED after a carve _L8441
• §129b — never commit a carve whose owner is still a stub (it strands the carve) _L8462
• §3-The — real blocker underneath, for the record _L8477
• §130 — An INCREMENTAL build can report BYTE-IDENTICAL for a change the CLEAN build cannot even LINK (P30 S28, the jr pair) _L8486
• §3-The — diagnostic ladder that finally located it (reusable) _L8523
• §131 — The jtbl OVER-SPAN: sltiu N is ground truth in BOTH directions, and the zero-word rule only guards one (P30 S28, func_80191C50) _L8533
• §132 — The JR-PAIR-IN-ONE-O0-OBJECT "wall" was TWO instrument defects: a merged-double span the carve could not see, and a truncated object no rule deleted (P30 S29, func_8013B83C + func_8013BD74) _L8570
• Defect — 1 — a pre-§8e MERGED DOUBLE is not a single-table predecessor _L8579
• Defect — 2 — as writes a corpse and nothing deletes it _L8597
• §3-The — fingerprint, and the 30-second ladder that found it _L8607
• §3-The — transferable rule _L8628
• §132a — --like is for a sibling with NO record; against one that HAS a record it over-derives (P30 S29, ov_SC07_010) _L8635
• §132b — When the span's already-matched owner is ITSELF multi-switch: --span-rel (P30 S1, func_8014032C) _L8660
• §133 — The DEFAULT-FILTER class: three times in one session, a tool silently answered a narrower question than the one asked (P30 S1–S3) _L8685
• §134 — MULTI-LINE BLINDNESS: one root cause, four faces, in family_remap's preamble scanner (P30 S6, 190 zero-crack families) _L8711
• §135 — Six byte-verified gcc-2.7.2 idioms from the P30 S6f-h waves (and the two-lane wave shape that found them) _L8765
• §3-The — codegen idioms _L8770
• §3-The — integration idioms (these decide whether a byte-correct draft BANKS) _L8804
• §3-The — wave shape that produced these _L8819
• §136 — The LOCAL-VARIABLE lever: how many C locals, at what scope (P30 wave 4a, 25 byte-verified banks) _L8837
• §3-The — splitting/merging rules (each closed a residual, byte-gated) _L8853
• §3-The — type-form rules _L8879
• §3-The — scheduling rules (refining §135-2 and §135-4) _L8912
• §3-The — declaration surface (integration, not codegen) _L8941
• Wave — economics (measured, for the next batch's sizing) _L8953
• §136a — Blocker capture: classify on the OUTPUT, never on the exit status _L8976
• §136b — A prior wave's "genuine byte-DIFF" verdict is NOT reliable evidence (4 of 4 refuted) _L9033
• §136c — SIBLING-FIRST is a DERIVATION shortcut, not just a conflict fix (the fastest route in a family wave) _L9069
• §136d — Four gcc-2.7.2 levers the redraft lane found (each closed a residual no other lever moved) _L9094
• §136e — §136c's PRECONDITION, and two more symptom keys (wave 4b batch 3) _L9138
• §136f — Two declaration sub-cases the reconcile lane surfaced (lane now 15/15 lifetime) _L9186
• §136g — When the index points at the WRONG lever: two byte-refuted routings (func_801863B4) _L9211
• §136h — CORRECTION: the zero-crack pool does NOT "refill with cheap work" (my error, byte-measured) _L9240
• §136i — The drafter model LADDER: Haiku → Sonnet → Opus → Fable5 (Drew, 2026-08-03) _L9270
• §136j — The failure MIX flips with function size (measured across four bands, one session) _L9302
• §137 — REGALLOC-PERM is a TWO-COMPILE ARITHMETIC PROBLEM, not a permuter job _L9344
• §137a — A gate verdict has a TIMESTAMP; re-check it against the draft's mtime _L9386
• §138 — The propagation lanes: a gate refusal is a DECLARATION, and which lever you owe depends on blast radius _L9415
• §3-The — triage, cheapest first _L9421
• §3-The — DEFINITION-side alias is the only escape when the fleet canon disagrees on a promoting param _L9473
• Rank — the lane by measured concentration, not by class count _L9481
• THREE — carry variants hide in one "CARRY-FIXABLE" bucket — and they need different fixes _L9490
• §134 — again, in a second tool — and the waiter rule corrected _L9526
• STEP — 0 of sibling-first: grep src/ for a distinctive LITERAL from the .s _L9546
• Reconciling — a gate-refused draft: which way you edit depends on WHERE the TU's decl is _L9565
• §139 — A GATE THAT GREPS FOR VERDICTS MUST ASSERT 1:1 ACCOUNTING; and a --src filter must not survive a carve (P30 S38, wave 6: 10 of 16 drafts vanished) _L9594
• §3-The — generalisation — three corollaries worth more than the bug _L9626
• §3-And — the inverse-lookup trap, same session _L9643
• §140 — A METRIC IS NOT A MEASUREMENT UNTIL IT IS REPRODUCIBLE FROM THE COMMITTED TREE (P30 S1e: a phantom regression that gated the session's best lever) _L9660
• §3-The — three-line proof (do this before diagnosing any metric movement) _L9680
• §3-The — two instrument defects it exposed _L9689
• §3-The — same swallow, twice more, in the integration spine _L9709
• §3-Two — wrong mechanisms I chased first, and why they were wrong _L9720
• §141 — The §134 class is CLOSED: every line-shape decision now routes through cdecl._mask (P30 S39) _L9740
• §142 — An open stub whose h_exact class is MATCHED elsewhere is FREE. Propagate the body; do not gate a draft. (P30 S39, +7,710 ins in two commands) _L9778
• §3-The — measurement (do this before any wave; it is ~20 lines and needs no builds) _L9790
• §3-The — trap that hid it — SAME FUNCTION, TWO ROUTES, ONLY ONE IS FREE _L9805
• Route — selection (why --addr sometimes says "nothing changed") _L9814
• §3-And — the report-vs-bytes lesson attached to it _L9822
• §143 — cast_call_sites read a RETURN STATEMENT as a prototype and deleted it. A 0/39 sweep became 18/39. (P30 S40) _L9834
• §144 — THE LITERAL'S SPELLING PICKS THE IMMEDIATE ENCODING (P30 S40 wave 1, func_801822E0) _L9888
• §145 — Three loop/combine levers from the S40 wave-2 drafters (16/16 match_one) _L9927
• §146 — RE-MEASURE A WALL BEFORE YOU RESPECT IT. Both "permanent" giants fell to drafts already on disk. (P30 S6, +50,094 ins) _L9977
• §3-Why — a correct draft can read as an intrinsic wall _L9988
• Then — propagation returned 0/137 TWICE — both times a missing TYPE _L10000
• §3-Two — errors of mine, both instructive _L10009
• §3-The — rule _L10023
• §147 — The three-stratum FRAME LAW, and four "stop searching" verdicts (P30 S42, func_8017C294, serial run) _L10036
• §3-A. — The frame has THREE strata, and stratum 3 is unreachable from C _L10041
• §3-B. — A ?: on MEMORY operands costs ~16 bytes of invisible frame; on REGISTER operands, zero _L10057
• §3-C. — Inner-block declaration does NOT delay slot allocation — BYTE-REFUTED _L10068
• §3-D. — A lone $t8/$t9 in the target is RELOAD SCRATCH — reproduce the spill, don't pin the register _L10073
• §3-E. — A qty_compare TIE is not spelling-reachable — recognise it and stop _L10083
• Consequence — for the family (a real scheduling decision) _L10095
• §148 — The loop.c hoisting THRESHOLD is arithmetic you can compute, and the ?: clamp that folds to MIN_EXPR (P30 S42, func_8017C6F4, 947 ins) _L10145
• §3-A. — move_movables hoists iff threshold × savings × lifetime ≥ insn_count — and you can read it _L10151
• §3-B. — (v < 0x40) ? v : 0x3F is folded to MIN_EXPR and expands to the WRONG SHAPE _L10170
• §3-C. — A zero-byte ALLOCNO-PRIORITY slider _L10184
• §3-D. — Reproduce the original's BUGS verbatim _L10194
• §149 — Four instrument defects in one session, and the two questions they were hiding (P30 S43) _L10243
• §3-A. — A prep step that returns its input on failure is indistinguishable from a search that found nothing _L10249
• §3-B. — Same address + same name ≠ same body — and the ledger keys on address _L10267
• §3-C. — make: *** [...] Error N is a summary, never a diagnosis _L10283
• §3-D. — "Cheap fuel" that was never probed: 0 of 31 templatable _L10293
• §150 — A register ROTATION across symmetric blocks is VARIABLE-IDENTITY evidence, not an allocator tie (P30 S43, func_8017C6F4, 947 ins ×4) _L10312
• §3-The — fix _L10319
• §3-The — method that found it (this is the transferable part) _L10329
• §3-Two — corrections to the record _L10345
• Diagnostic — order (adopt this) _L10356
• §151 — THE GHOST WEDGE: when a load-before-store transposition is unreachable by ANY statement order (P30 S43, func_8017EF68, 969 ins) _L10367
• §3-The — mechanism (read from cc1's own -dR trace, not inferred) _L10372
• §3-The — lever — a zero-emission insn that absorbs the blocked tick _L10387
• §3-The — two fallouts, and how to close them (both measured, in order) _L10395
• When — to reach for it _L10407
• §152 — BYTE SIZE is the family key that name- and h_seq-grouping both miss (P30 S43, the 0xECC family: 1 crack → 12 overlays → 11,364 ins) _L10418
• §3-The — finding _L10423
• §3-The — key _L10432
• §3-Two — cautions that must travel with this technique _L10443
• §3-The — companion defect (open) _L10454
• §153 — THE ADDRESS-REMATERIALISATION LAUNDER: a third zero-emission asm lever (P30 S43, func_8018D98C, 710 ins) _L10466
• Symptom — Symptom _L10474
• Mechanism — (gcc source + RTL dumps, not inferred) _L10479
• What — does NOT work (14 byte-measured probes) _L10486
• §3-The — cure — a fresh launder per site, each in its own block _L10492
• Companion — levers from the same function _L10502
• §154 — Reading a disc payload: the module-id word, static base derivation, and "type 1 = uncompressed overlay" (P30 S44) _L10522
• §3-A. — Payload word0 is a global MODULE ID; code starts after the header _L10527
• §3-B. — Two static base-derivation methods that must AGREE (use both) _L10536
• §3-C. — PAC type 1 = the same payload class as type 4, just NOT compressed _L10548
• §155 — hi/lo literal scanning MUST track base registers (S45) _L10558
• §155a — the same failure class, one level up: SHAPE-blind table scanning (S45 p5) _L10567
• §155b — check the TYPE your oracle returns before comparing against it (S45 p5) _L10587
• §155c — the ZERO-REFERENCE trap: gcc splits a global-array address across the lui and the LOAD (S46) _L10610
• §156 — an ORPHANED reconcile poisons the fleet: dedup_propagate's kept edit (S45 p6/p7) _L10640
• §157 — the cheap-tier size cliff, measured (S45 p6) _L10687
• §158 — The RANGE-EXTENDER: a fourth zero-emission asm lever completes the allocno toolkit (P30 S46 tier-3, func_8017CE58, 733 ins) _L10712
• Symptom — Symptom _L10721
• §3-Why — the fork is chained (gcc source, validated insn-by-insn against -dS/-dR dumps) _L10727
• §3-The — method (dump-arithmetic first, then place — no probing) _L10740
• Bonus — facts worth keeping _L10757
• §156 — THE PREFERENCE-DONOR MERGE: cross-region variable reuse is what fills a0-a3, and a call-arg use in ONE region steers the fill in ALL of them (P30 S46 tier-3, func_80186E24, 611 ins: 236-off "S11 regalloc-order" → MATCH, zero new pins) _L10772
• §159 — THE DECLARATION AXIS: conform to byte-truth, and make every guard state its COVERAGE (P30 S47; ~10,930 sites across 8 axes, fleet byte-identical) _L10828
• §160 — THE REACH-15 WAVE HARVEST: an align-1 block move, and the instrument that called it a wall (P30 S47) _L10893
• §161 — THE RETRY-WAVE HARVEST: a jump table indexed from zero, and two allocator traps (P30 S47) _L10969
• §162 — S48 WAVE-1 HARVEST (P30, 2026-08-11): the reach-ordered sibling campaign's first 12 targets _L11014
• §162a — SHARPENS (sharpens §161a, §131, §8a-pad, §129a) _L11041
• §162b — SHARPENS (sharpens §48-A3, §156, §150, §76) _L11070
• §162d — SHARPENS (sharpens §31, §21, §30, §55a) _L11099
• §162e — NEW _L11141
• §162 — THE LICM PAIR: what makes an address a movable AT ALL, and why the preheader order is the body order (P30 S47, ov_MAIN_012) _L11143
• §162f — SHARPENS (sharpens §42d, §41d, §73, §10) _L11209
• §162g — NEW _L11264
• §162 — CROSS-JUMP DIRECTION: the surviving copy is always the LATER one, so a BACKWARD j into a sibling arm is a source goto (P30 S48) _L11266
• §162h — SHARPENS (sharpens §88, §88a, §50-B, §8) _L11300
• §162 — The cross-jump "CALL veto" is a COUNT law, not a CALL law (BOUNDS §88a; P30 S48, func_80189540) _L11302
• §162i — SHARPENS (sharpens §135, §21, §42, §32) _L11368
• §162j — SHARPENS (sharpens §25, §136d-1, §48-B, §46-L2) _L11393
• §162k — SHARPENS (sharpens §1-I2, §12, §160d, §21) _L11422
• §162l — SHARPENS (sharpens §48-B, §48-C1, §20, §21) _L11485
• §162m — SHARPENS (sharpens §36, §158, §148, §153) _L11540
• §158a — THE FIFTH LEVER IS NOT AN ASM: do { } while (0) is a REGION ref-multiplier you MINT (P30 S48, func_8017CBC8, ov_MAIN_012 / jr_801789AC, 188 ins → MATCH) _L11542
• §3-The — law _L11549
• Size — it before you write it (§158 step 1-2, applied) _L11560
• §3-The — wrap BOUNDARY is the dial — and it is indiscriminate _L11581
• §3-Not — a pure dial _L11587
• DIAGNOSTIC — TELL — two faces, one law _L11591
• §162n — NEW _L11613
• §162o — SHARPENS (sharpens §158, §136-1, §136-6, §79) _L11646
• §162p — SHARPENS (sharpens §48-B, §46-L2, §156, §136d-1) _L11705
• §162q — SHARPENS (sharpens §30, §30a, §135-2, §136-13) _L11722
• §163 — S48 WAVES 2-3 HARVEST (P30, 2026-08-11/12): the five that were byte-probed and are actionable _L11760
• §163z — THE UNVETTED REMAINDER (do not cite as law; each needs a dedupe pass) _L11828
• §164 — S48 §163z SKEPTIC PASS (P30, 2026-08-12): 190 claims vetted, 82 banked _L11848
• §16Xy — SHARPENS (sharpens §136d-3, §37 /s-DEP LATTICE, §135-2, §136-13, §162q) _L12300
• §3-The — /s drop clause is in ALL THREE dependence predicates, so the FIXED-ADDRESS STORE is what floats (P30 S48, func_8017CA18, ov_MAIN_012) _L12302
• §164z — REFUTED CLAIMS: do NOT re-derive these _L13623
• §165 — S48 WAVE-4 HARVEST (P30, 2026-08-12): banked the same day the wave landed _L13689
• §16Z — SHARPENS (sharpens §37 "the /s-DEP LATTICE", §136-13, §136-14, §16Xy, §162q, gcc-2.7.2-map/sched.md §64) _L14340
• §3-The — ADDRESS-CLASS TABLE: which load/store pairs even REACH the /s clause (P30 S48 wave 4, func_80185B44, ov_SC03_014) _L14342
• §165z — REFUTED THIS WAVE: do NOT re-derive _L14858
• §166 — THE DESTINATION-TU ORACLE (P30 S48): the seven-attempt bug that was never codegen _L14902
• §167 — S48 WAVE-5/6 HARVEST (P30, 2026-08-12): the saturation point _L14958
• §167z — REFUTED IN WAVES 5/6: do NOT re-derive _L16154
• §168 — THE COUSIN TIER (P30 S49, 2026-08-12): h_seq's exact-hash brittleness, measured — and the similarity map above it _L16211
• §169 — THE MICRO-ADAPT LANE (P30 S49): edit a proven body, don't crack a new one _L16263
• §170 — THE A-PROP WORD-DIFF CARD (P30 S49): the lane that had no owner _L16310
• §171 — THE STALE SEED SYMBOL (P30 S50, 2026-08-13): why §170's 91%→57% was never codegen _L16354
• §171a — THE MECHANICAL A-PROP DRAFT (P30 S50): 256 members banked with no agent in the loop _L16420
• §171b — THREE CARRIES THE MECHANICAL DRAFT NEEDS (P30 S50, banking the top-reach families) _L16470
• §172 — THE ORPHAN-SLOT MECHANISM v2 (P30 S50-Max): the complete frame-residue model for gcc-2.7.2 MIPS _L16503
• §172a — TWO DECOMPILATION TELLS FROM THE SAME DIG (P30 S50-Max) _L16557
• §172b — THREE MORE TELLS FROM THE GCC READ (P30 S50-Max, banked on Drew's ask) _L16573
• §173 — THE STORED-PLUMBING RECOVERY RECIPE (P31 T6): symfix-first, per-group isolation, and where the verdicts have no drafts _L16616
• §174 — THE ADAPT-CARD WAVE RECIPE (P31 waves A/B, 2026-08-14): prevention beats recovery _L16652
• §175 — A CALLER-SAVED REGISTER PIN CAN BE A CORRECTNESS BUG, NOT JUST A SCHEDULING CHOICE (P31 wave H, 2026-08-15) _L16722
• §176a — THE VERIFICATION-LAYER LAWS (P31 overnight, 2026-08-15). What each check can and cannot prove. _L16747
• §176b — BATCH-GATING MECHANICS (P31): what changes when N drafts land in ONE .c _L16787
• §176d — THE CONFLICT TABLE MUST BE SEEDED FROM THE TU, AND KEYED PER FILE (P31 S52, 2026-08-15) _L16813
• §176e — SYMBOL IDENTITY IS COMPUTABLE OFFLINE (P31 S52): tools/reloc_identity.py _L16852
• §176f — THE DECLARATION FORM IS A MATCHING LEVER, SO RECONCILE TOWARD THE FORM THE MATCH NEEDS (P31 S52) _L16909
• §176g — SIZE A WAVE BY INSTRUCTIONS, NOT BY CARDS (P31 S52 — the adopted doctrine) _L16940
• §176h — THE BATCH-SUBSTITUTION HAZARD MAP (P31 S52): seven holes, three wrong fixes, one law _L16978
• §3-A. — The seven under-reporting holes (all in gate_main, all the same shape) _L16986
• §3-B. — Typedef handling — the only strategy that survives contact _L17004
• §3-C. — The limit that remains (recorded, not solved) _L17026
• §3-C2. — RECONCILE BEFORE THE FIRST GATE — a parked draft gets HARDER to bank, not easier _L17033
• §3-D. — The measured cost shape, and what to build next _L17056
• §176i — WHAT A STATIC PRE-GATE CHECK CAN AND CANNOT PROVE (P31 S52, wave Q) _L17074
• §176j — STOPPING A WAVE MID-FLIGHT COSTS THE IN-FLIGHT TAIL (and how much is recoverable) _L17106
• §176j-2 — THE REPAIR PASS, MEASURED (do this instead of resuming) _L17132
• §176k — TWO SELECTOR BUGS THAT SILENTLY SHRINK A WAVE _L17152
• §177 — 🔴 THE EPILOGUE RETURN-DELAY SLOT IS DECIDED BY YOUR SAVED-REGISTER SET, NOT BY SCHEDULING _L17169
• §178 — SIX LEVERS MINED FROM THE WAVE-P JOURNALS (P31 S52), each byte-proven and source-cited _L17226
• §3-A. — THE $0-ADD OPAQUE COPY defeats make_regs_eqv (func_80033398, 93 ins) _L17238
• §3-B. — A return <const> IS A PRIORITY-1 HARD-REG SET THE SCHEDULER PLACES FIRST (func_8001BE30, 92 ins) _L17254
• §3-C. — SINGLE-SET TEMPS GET THE BIRTHING BOOST (func_8001D3FC, 196 ins) _L17267
• §3-D. — A NARROW TYPE BLOCKS COPY ELISION (func_8001D3FC — new idiom) _L17275
• §3-E. — THE ZERO-OFFSET ALIAS HOLE (func_80037028, 71 ins) _L17282
• §3-F. — MEM_IN_STRUCT_P ASYMMETRY IN true_dependence (func_80037144, 124 ins) _L17291
• §3-G. — TWO MODELLING TRAPS THAT COST THESE AGENTS SWEEPS OF HUNDREDS OF COMPILES _L17297
• §179 — IDIOMS MINED FROM THE WAVE P/Q JOURNALS (P31 S52, harvest pass) _L17313
• §179-A — 🔴 A LOOP-WALKED POINTER PARAMETER HANDS ITS ARGUMENT REGISTER TO THE GIV (9 byte-proofs) _L17323
• §179-B — 🔴 THE HAND-WRITTEN-ASM TRANSCRIPTION CHECKLIST (maspsx + masked_diff; 10 byte-proofs) _L17372
• §179-C — 🔴 A FUNCTION WITH NO EPILOGUE (falls into a sibling's shared tail) MUST BE FILE-SCOPE __asm__ _L17422
• §179-D — gte_stflg MUST CLOBBER "$12" OR THE WHOLE TEMP FILE ROTATES BY ONE _L17473
• §179-E — A >2*MAX_MOVE_BYTES BLOCK COPY IS A STRUCT ASSIGNMENT, NOT A HAND LOOP _L17493
• §179-F — PINNING A LOOP-WALKED POINTER IS A TOTAL OFF-SWITCH FOR STRENGTH REDUCTION _L17519
• §179-G — 🟡 A PIN CAN CREATE A COMBINE LOG_LINK AND DELETE AN andi (sixth RC-5 channel, n=1) _L17542
• §179-H — A MID-BODY .global LABEL PAIR SLICES A BYTE-COMPARABLE FRAGMENT OUT OF A LARGER ROUTINE _L17569
• Considered — and NOT banked _L17592
• §176c — MAIN (SLUS_007.26) CANNOT BE GATED INCREMENTALLY _L17609
• §176 — SEVEN LEVERS FROM THE P31 OVERNIGHT WAVES (2026-08-15): statement order, false regalloc, and the pin that fights back _L17620
• §176-A — "SCHEDULE / DELAY-SLOT / LENGTH-DRIFT ±1" ⇒ check STATEMENT ORDER around the call first _L17626
• §176-B — "REGALLOC-PERM, 1-4 instructions off" ⇒ it is usually NOT register allocation _L17650
• §176-C — 🔴 WALL REFUTATION: a hard-register pin CANNOT schedule around a call, because of a genuine gcc-2.7.2 bug _L17690
• §176-D — CSE-class levers used in reverse (two sharpenings of §153 and cse_expr §2) _L17716
• §176-E — Two cheap source spellings, both cc1-probed _L17742
• §176-F — Misdiagnosis triage: four residual verdicts that were lying _L17764
• What — is NOT banked here _L17781
• §180 — THE LEFTOVER-DRAFT HARVEST: RE-VERIFY WHAT YOU ALREADY HAVE BEFORE DRAFTING ANYTHING NEW _L17794
• §180b — WHAT THE PRE-GATE LADDER ACTUALLY FINDS IN A COLD PILE (the shape of integration debt) _L17823
• §180c — WHEN A BINARY'S MASS BAND IS SPENT, THE FLEET-WIDE DRAW IS STRICTLY BETTER _L17842
• §181 — WHAT A WAVE'S GATE ACTUALLY REJECTS (P31 S53, measured on wave R's 45-draft main pile) _L17860
• Only — ONE of 27 blocked drafts was wrong. The other 26 were correct and unbankable. _L17861
• §182 — §177's HONEST NEGATIVE: the epilogue lever cracked 4 of 16, and the 800c3 cluster held _L17916
• §180d — THE pgrep BRACKET TRICK PROTECTS THE PATTERN, NOT THE COMMAND LINE _L17930
• §183 — THE DECLARATION-RECONCILIATION PLAYBOOK (P31 S53, measured on 20 byte-verified drafts) _L17942
• §3-18 — of 20 reconciled while keeping the match. The two that did not are mechanism, not effort. _L17943
• §184 — COMMENT-BLINDNESS IS A DEFECT CLASS, NOT A BUG (P31 S53: three tools, one root cause, one session) _L18013
• §185 — EDIT THE SIDE THAT IS CHEAP TO VERIFY, AND CHECK A TU RETYPE AT ITS USE SITES _L18041
• §186 — CROSS-JUMPING RUNS AFTER SCHEDULING, SO NO C-LEVEL BARRIER CAN STEER IT _L18073
• §186b — A NO-SAVE 16-BYTE FRAME IN A LEAF FUNCTION MEANS s16 LOCALS, NOT A HIDDEN CALL _L18094
• §186c — WHERE A VALUE IS LOADED DECIDES WHICH ALLOCATOR OWNS IT, AND THEREFORE ITS REGISTER _L18102
• §187 — 🔴 "SAME SOURCE" IS NOT "SAME OBJECT": THE SDK BUILD AND THE GAME BUILD DISAGREE ON GTE NOPS _L18119
• §188 — 🔴 THE jr $ra + addiu $sp TAIL IS AN ASSEMBLER ARTIFACT, NOT A FRAME SHAPE _L18157
• §189 — FIVE COMPILER LAWS MINED FROM THE WAVE R/S JOURNALS (P31 S53), each source-cited and re-derived by a second agent _L18207
• §190 — THREE PRESCRIPTIONS FROM THE SAME HARVEST (weaker evidence than §189, honestly labelled) _L18282
• §191 — WHAT THIS HARVEST DID NOT BANK (4 rejected, 4 narrowed) — recorded so it is not re-derived _L18319
• §192 — THE PRE-GATE LADDER WAS MAIN-ONLY, AND NOBODY COULD SEE IT (P31 S54) _L18341
• Three — defects in one call path; the overlay slates that carry most of the wave work were being waved through _L18342
• §193 — THE WAVE-T HARVEST (P31 S54): 71 index_gap reports -> 9 laws, 5 rejected, 61 already-covered _L18406
• §193-A — The wave card ships only OPEN-set pointers and discards the atlas's BANKED one — exemplar/sibs are stubs 100% by construction (tools/atlas.py:96/657), while seed.ref (matched pool, atlas.py:505-536) is dropped at build_wave_atlas.py:143 _L18423
• §193-B — A NARROW CAST OF A WIDE PARAMETER COSTS ONE EXTRA INSTRUCTION WHEN ITS STATEMENT SITS AFTER AN INTERVENING jal — AND THE DECIDER IS combine.c:929's CROSS-CALL GUARD, NOT REGISTER ALLOCATION _L18490
• §193-C — gcc-2.7.2 cross_jump merges the SCHEDULED common SUFFIX only — there is no prefix/head merge, so §8/§48-A1's "duplicate into both arms and cross_jump refunds it" is a TAIL-only lever _L18528
• §193-D — A COMPILER-GENERATED ARGUMENT COPY IS A optimize_reg_copy_1 TRIGGER: when the pointer's LAST use in a block precedes a call that takes the pointer as a register, sched1 hoists the implicit move $aN,$sN to the block top and local-alloc re-bases the WHOLE block's memory operands onto $aN. The only C dial is a label (the §165-24 goto-join) between the block and the call. _L18562
• §193-E — A varying-address (pointer) load is re-emitted once per CSE-LIVE INTERVAL, and naming it in a C local is the only C-level lever over that count — no store SPELLING has any reach _L18633
• §193-F — §148-A2 — The threshold -= 3 STAIRCASE: move_movables admits a COUNT of invariants, not a boolean — two identical merged constants split hoisted/not-hoisted by LIST ORDER, and insn_count picks the rank cutoff _L18663
• §193-G — §164-54's "scope to ≥4 arms" bound is byte-wrong — the dispatch-topology oracle goes live at THREE case nodes (balance_case_nodes splits at i > 2), but only for a signed-after-promotion index _L18727
• §193-H — A pointer-derived base load *(s32*)(p+K) is uncacheable across ANY memory write or call (cse's third kill disjunct) — so the target emits one lw per store-separated RUN of spellings, and a run of stores sharing one lw is a C local you must declare _L18788
• §193-I — A DECLARED AGGREGATE LOCAL HAS AN 8-BYTE FRAME STRIDE — CEIL(size,8), NOT size. N ARRAYS THEREFORE COST 8·k MORE THAN ONE HAND-LAID STRUCT (k = how many of them have size mod 8 ≠ 0), AND THE TELL IS IDENTICAL INSTRUCTION COUNT WITH EVERY $sp DISPLACEMENT SHIFTED BY THE SAME CONSTANT. _L18828
• §193-REJECTED — what this harvest did NOT bank (recorded so it is not re-derived) _L18887
• §194 — THE WAVE-U HARVEST (P31 S54): 64 index_gap reports -> 14 laws, 5 rejected, 44 already-covered _L18914
• §194-A — A zero-byte scheduling fence goes AFTER the defining statement to make that computation emit FIRST in its block — and the barrier predicate is volatile-or-colon-less, not the "memory" clobber (COMPLEMENTS §165-40; does not refute it) _L18931
• §194-B — A addu $rA,$rB,$zero copy feeding ≥2 sh stores is a SECOND, 16-BIT-DECLARED local — the width, not the clamp or the join liveness, is what keeps the copy (and func_80183094's pin + "memory" clobber are both provably inert) _L18997
• §194-C — A CALLER-SAVED loop counter proves its live range crosses ZERO calls — so it cannot share a pseudo with any value LIVE ACROSS a call (but it may freely share one with values that merely sit between calls) _L19035
• §194-D — Declared width of a computed-value local is a sched1 dial (count-neutral) — a replication + attribution correction of §165-17, NOT a new argument-register law _L19098
• §194-E — The wave card's exemplar is the TARGET ITSELF on 42/73 wave-U and 36/71 wave-T cards — a construction consequence of atlas.py:657 (exemplar = max-nins OPEN member) meeting build_wave_atlas.py:166 (one card per gid); and the shipped §193-A seed_ref is same-binary on 0/51, so no card field can ever name a destination-TU sibling _L19139
• §194-F — if ((*p = v = f()) == 0) is an expand-time pseudo SPLITTER (store_expr's want_value && MEM path), not a fold — it partitions one value between local_alloc and global_alloc. BOUNDS §21's L1872 bullet, whose stated direction is byte-wrong on 3 of 4 instances, and CLOSES the control §167-37 asked for. _L19176
• §194-G — Reading the integer half of a 16.16 stack aggregate: REGISTER-LIVENESS, not the C spelling, decides sra vs lhu — and the break is count-neutral _L19249
• §194-H — §164-29's WAR fence runs again at SCHED2 ON HARD REGISTERS: an in-place v &= K before a branch fences the store that reads v, and when TWO independent stores compete for the one delay slot the fence picks the winner at ZERO length drift (a WIDTH/sh!=sw swap, not a nop). Corrects §167-42's reconstruction (pseudo arm → hard-reg arm) and supplies its first re-runnable A/B. _L19292
• §194-I — §16N+2's magic-per-odd-part ladder has exactly one broken row — read the divisor arithmetically instead: d = round(2^(32 + post_shift) / magic_read_as_unsigned) _L19330
• §194-J — Back-to-back identical stores: flow.c's last_mem_set deletes the first, and only volatile saves it _L19373
• §194-K — Blind sched1's alias oracle with a second SET of a pointer pseudo — the first zero-byte, non-volatile, dependence-CREATING lever (corrects §167-05's "volatile is the only door"; fourth consumer of reg_n_sets) _L19425
• §194-L — §88b and §189-E are BOTH half-wrong, but not the way the candidate says: the compare-constant shape is a 2-D lookup (cmp_info ROW × constant-in-window), and naming matters on OPPOSITE sides of the window for the GE/LT rows vs the GT/LE rows _L19503
• §194-M — A STORE in a CONDITIONAL branch's delay slot proves its C statement DOMINATES the branch — reorg can never pull a store out of either thread (gcc-2.7.2, -mips1) _L19551
• §194-N — §193-D's C dial is misstated: the lever is a SURVIVING CODE_LABEL (a label with a real incoming edge), not "a label between the block and the call" — a bare label, or a goto L; L: pair whose target is the next active insn, is deleted by jump1 (jump.c:663-669 → delete_insn → jump.c:3458-3461, and jump.c:243 for the bare case) long before sched1/local-alloc, and costs exactly zero bytes _L19606
• §194-REJECTED — what this harvest did NOT bank (recorded so it is not re-derived) _L19666
• §195 — THE WAVE-V HARVEST (P31 S54): 67 index_gap reports -> 14 laws, 9 rejected, 76 already-covered _L19687
• §195-A — §167-08's "an $aN READ before the jal is scratch" has a byte-proven FALSE-NEGATIVE class: an argument that DIES at the call is allocated straight into $aN, so its only def is a plain load far above the jal and every intervening use reads $aN — there is no positive tell in either direction, only the two-arity A/B _L19701
• §195-B — A CALL_INSN does not start a basic block in gcc-2.7.2 — so a call-crossing temp can be a LOCAL-alloc quantity (the missing precondition under §48-A2 / §52 / regalloc.md K8) _L19772
• §195-C — A call-argument %hi/%lo pair sitting at the block head, far above its jal, is a load-delay-gap filler chosen by SOURCE STATEMENT ORDER — swap the two independent statements nearest the call; a single-use void *p = &SYM; call-arg temp is OUTPUT-inert against it (but NOT expand-stream-inert) _L19814
• §195-D — §195 — masked_diff.mask_for returns 0 for EVERY j/jal word, so an internal j destination is invisible to match_one, the permuter scorer AND every similarity tier: a control-flow semantic error (which calls execute) surfaces as a 1-instruction residual mislabelled DELAY-SLOT / profile=schedule, or as an outright false MATCH _L19862
• §195-E — A 0/1 materialised at a JOIN immediately before the controlling beqz/bnez proves the source NAMED the condition — a truth expression in an if's controlling position reaches do_jump, which has no value path _L19930
• §195-F — fold-const.c:4825 canonicalises a ?: whose THEN arm is zero (or constant against a non-constant ELSE) by inverting the condition and swapping the arms — so a ternary's written arm order is byte-inert there, and c ? 0 : X is unspellable: it always compiles as !c ? X : 0 _L19988
• §195-G — §NEW — TWO ARMS CALLING THE SAME CALLEE MERGE INTO ONE jal UNLESS EACH ARM'S OWN CODE CONSUMES THE RESULT: the C dial that keeps two call sites apart is WHERE the consumer test lives, and the branch SENSE you spell it with is byte-inert (jump.c:1737 canonicalises it) _L20040
• §195-H — §165-27g — ON A FIXED-SYMBOL GLOBAL, extern T D[]; + D[0] IS THE CSE RELOAD DIAL, AT ZERO ADDRESSING COST, AND THE ELEMENT COUNT IS INERT (§165-27's T v[2] CAVEAT IS A LOCAL-FRAME FACT AND DOES NOT TRANSFER) _L20088
• §195-I — §145(b) AMENDED — the pointer-bump addiu is saved by cse, not combine: ANY second SET of a pseudo in the address's equivalence chain (in-place p += K, §145(b)'s p = r; copy, or an asm re-tie) kills the fold; the pass is cse and the gate is invalidate's reg_tick++ _L20135
• §195-J — GTE / PsyQ op CALL-vs-INLINE is a PER-SITE SOURCE FACT, not a TU style — both forms coexist in one TU (measured in 2 TUs), and the tell is the target's own opcodes (lwc2/sqr/swc2 vs jal), not the sibling. Costs -8 ins on func_8018505C. Corollary: the game's inline sqr macro emits TWO hazard nops, the SDK's Square0 body emits ONE — so the inline form is provably not Square0 inlined (a second instance of §187's SDK-vs-game GTE nop divergence). _L20200
• §195-K — At -O2 the §18 array-of-struct lever is a FRAME lever, not a length lever — but only when the N reads carry DISTINCT index expressions; with a SHARED index §18's +2-instruction residual is still alive at -O2 (the submitted "memory-loaded narrow index" precondition and unconditional length-neutrality are both falsified) _L20244
• §195-L — The cse store-re-seed does not cross a JOIN LABEL: per-arm stores + a join read keep the reload that one join store deletes (bounds §193-E BOUND 1/BOUND 3 with §48-B's EBB boundary) _L20296
• §195-M — Frame vars is a SEQUENTIAL bump-allocation, not a flat sum: §193-I's CEIL(aggregate,8) term and §165-03/§167-06's 8×orphan term are the SAME frame_offset walk at two different compiler stages, and each stage re-CEILs frame_offset to 8 before it allocates _L20343
• §195-N — In a call-bearing chain of N≥2 if (f(...)) return 1; tests closed by return 0;, the LAST test must stay in STATEMENT form — the value form (return f() != 0; / ? 1 : 0 / !!f()) costs +1 j and empties the other N−1 delay slots. The cause is REORG block placement, not jump.c's delete_jump. _L20392
• §195-REJECTED — what this harvest did NOT bank (recorded so it is not re-derived) _L20439
• §196 — PUT ON THE CARD WHAT THE TREE ALREADY KNOWS: the fleet's declaration consensus (P31 S54) _L20485
• §197 — THE WAVE-W HARVEST (P31 S54): 68 index_gap reports -> 4 laws, 3 rejected, 41 already-covered _L20540
• §197-A — A NARROW SIGNED MEMORY READ FEEDING A CONSTANT >> LOSES ITS lh, AND THE CURE IS AN ASM RE-TIE (attribution CONTESTED: cse vs combine) _L20554
• §197-B — A REPEATED COMPARE OF ONE VALUE AGAINST ONE CONSTANT IS DELETED BY cse's qty_comparison_code CHANNEL (the non-EQ complement of §165-03) — and a front-end-opaque mask on EITHER compare is a pure-C dial that keeps the target's second branch _L20592
• §197-C — Fix A1 (operand order) cannot move a commutative destination whose .greg conflict set already contains BOTH operand hard registers — split the accumulate so the destination IS the load's pseudo _L20620
• §197-REJECTED — §197-REJECTED _L20665
• §199 — THE WAVE-X HARVEST (P31 S54/S55): 63 index_gap reports -> 7 laws, 2 rejected, 56 already-covered _L20680
• §199-A — §189-A's asm→source inference is byte-FALSE: an interloper between a split constant's lui/ori is a SCHEDULE fact, not a source fact — and the separator is the BIRTHING BOOST, not a "priority floor" (§189-A's split-timing half survives; its "no statement order / no pin" absolute and the candidate's own forward-scheduler narrative both fall) _L20691
• §199-B — A permutation sweep that holds ANY statement fixed is not a sweep: the statement an agent pins as "obviously load-bearing" is the one carrying the signal, and the partial sweep returns a FLAT residual that reads as proof of order-invariance _L20740
• §199-C — A NEGATIVE CONSTANT MULTIPLY ALWAYS TAKES expmed's negate_variant — but whether you ever SEE the neg is decided by COMBINE, and for an EVEN |K| it never disappears _L20785
• §199-D — A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is the WIDTH of a real object, and a widening (s32) cast is inert — AMENDS §35 (whose stated "only CSE-reuse canonicalizes" mechanism is byte-wrong) and does NOT apply inside a switch _L20833
• §199-E — §189-A BOUNDED AND CORRECTED — the discriminator is INSN_PRIORITY, not "is the interloper a constant": an insn between a lui/ori pair proves NOTHING about the source spelling unless it TIES the ori on priority, and on the pinned -mcpu=3000 triple a dependent load never does _L20893
• §199-F — §164-36b — THE TARGET-HEAD FENCE IS A DELAY-SLOT THREAD SELECTOR, AND IT ONLY FIRES WHEN mostly_true_jump > 0 (amendment to §164-36; its "−1 instruction" tell is falsified) _L20952
• §199-G — At TWO case nodes the switch-vs-if oracle is not blind — but the tell is ALL tests positive + a trailing j default, NOT the first test's polarity _L21006
• §199-REJECTED — §199-REJECTED _L21061
• §200 — THE ALIAS IS THE UNIVERSAL DECLARATION ESCAPE: stop negotiating with the TU's spelling (P31 S55) _L21072
• §201 — THE WAVE-Y HARVEST (P31 S55): 67 gap reports -> 5 laws, 8 rejected, 53 already-covered _L21121
• §201-A — §150-B applies to decl_prior's DEF row: for an overlay-window symbol the banked "definition" is usually another overlay's function, and the card ranks it ABOVE the destination TU _L21131
• §201-B — In a narrowed PLUS/MINUS/AND/IOR/XOR expression the destination pointee is INERT — the sign of the materialized constant is decided by an OR over the UNWIDENED operands (convert.c trunc1), which bounds §1841 to direct constant stores _L21163
• §201-C — §X — A CALL'S OWN DELAY SLOT AND THE UPSTREAM CONDITIONAL BRANCH'S SLOT COMPETE FOR ONE INSN (the call's argument copy), AND ONE STATEMENT'S POSITION RELATIVE TO THE CALL DECIDES BOTH — the residual is visible at the BRANCH, not at the call _L21243
• §201-D — THE SIGNEDNESS OF A div/mod MAGIC IS DECIDED BY THE STATIC TYPE OF THE DIVIDEND TREE AFTER get_narrower STRIPS WIDENING CONVERSIONS — NEVER BY A PROVABLE RANGE. AN & 0xFF IS NOT A CONVERSION, SO IT NEVER FLIPS THE MAGIC; A DECLARED-UNSIGNED LOCAL OR A NARROWING CAST WRITTEN AT THE DIVIDE BOTH DO. _L21294
• §201-E — §194-J-2 — The last_mem_set deletion window is measured in SOURCE/expand order, not in the printed stream; a foreign store moved between the pair in C source is a real lever, and volatile is not always the better one _L21341
• §201-REJECTED — eight, the session's highest _L21397
• §202 — THE ALIAS CARRIES A DEFINITION, NOT JUST A DECLARATION: the DEF-SIDE-RETURN wall (P31 S56) _L21422
• §203 — A DEDUPED TYPEDEF MUST PRECEDE EVERY SPLICE POINT, NOT JUST ITS OWN (P31 S56) _L21459
• §204 — THE WAVE-Z HARVEST (P31 S56): 82 gap reports -> 5 laws, 16 rejected, 30 already-covered _L21520
• §204-A — A COMPARE THAT APPEARS BOTH IN A BRANCH'S DELAY SLOT AND AGAIN ON THE FALL-THROUGH IS A JOIN WITH TWO INCOMING EDGES: THE TWO GUARDS ARE SEQUENTIAL ifs, NEVER if/else if _L21539
• §204-B — A LOOP COUNT THAT ARRIVES ON THE STACK IS DECREMENTED IN PLACE: a fresh counter local can cost a real move AND permute the whole callee-saved file _L21614
• §204-C — WHEN A LOCAL BUFFER'S ADDRESS IS PASSED TO A CALL, ITS SIZE IS A FACT ABOUT THE CALLEE'S BODY, NOT ABOUT THE CALL SITE: grep the callee's proven definition and count the stores through the pointer parameter before you declare the local _L21678
• §204-D — A LOOP-INVARIANT LOAD IS ADMITTED AS A MOVABLE ONLY IF ITS ADDRESS CANNOT TRAP: local.field PASSES, THE SAME READ THROUGH A POINTER LOCAL IS REFUSED _L21736
• §204-E — decl_prior's %hi/%lo ARM HAS NEVER FIRED: the card's promised GLOBAL-TYPE row is 0 of 1,210 _L21811
• §204-CONFIRMED — 30 reports that the index already answered _L21863
• §204-REJECTED — sixteen, twice the previous record _L21957
• §205 — THE CHAINED ASSIGNMENT IS ITS OWN SCHEDULING DIAL: *b = *a = v; moves an argument copy that no local, no pin and no statement reorder will move (P31 S56) _L22030
• §206 — THE JTBL-CARVE DRAFTING IDIOM: the bounds check is the entry count, and an EMPTY case owns a slot (P31 S56) _L22085
• §207 — THE WAVE ab–ag HARVEST (P31 S58): 278 byte-banked notes → 25 laws, 103 self-reported no-gap _L22154
• §208 — TWO NAMED LOCALS FOR ONE RELOADED EXPRESSION BUY TWO ALLOCNOS — the naming granularity owns the REGISTER SPLIT, not just the load count (P31 S58) _L22175
• §209 — THE NARROW LOCAL IS A DIAL IN TWO OPPOSITE DIRECTIONS, AND §194-B's "≥2 sh STORES" BOUND IS BYTE-WRONG (P31 S58) _L22224
• §210 — THE SINGLE-BIT MASK IN A BOOLEAN TAIL: andi K ; sltu $zero,v vs srl n ; andi 1 is a STATEMENT-SHAPE dial, not an operator choice (P31 S58) _L22301
• §211 — HOIST THE LOOP INIT ABOVE THE DOMINATING GUARD: it fills the guard's delay slot AND flips the counter/pointer register pair (P31 S58) _L22347
• §212 — THE WALKING CURSOR IS COUNTABLE: *wp++ emits one addiu PER STORE, wp[0..2] emits one (P31 S58) _L22395
• §213 — INDEPENDENT SAME-BASE STORES: THE EMISSION ORDER IS A PERMUTATION OF SOURCE ORDER, AND THE PERMUTATION IS NOT ALWAYS THE IDENTITY (P31 S58) _L22440
• §214 — THE BANKED TWIN MAY BE A MACRO, A DELETED .s, OR A SEMANTIC INVERSE — six ways a ≥0.9 similarity lies (P31 S58) _L22476
• §215 — PIN ECONOMY: the twin's pins are NOT part of the shape, and §17's "pin every call-crossing value" is over-broad (P31 S58) _L22522
• §216 — DISTINCT ADJACENT SCALARS vs ONE ARRAY: one lui per access is the tell, and the array decl is UNUSABLE (P31 S58) _L22578
• §217 — DECODING A CALL'S STACK ARGUMENT SLOTS: sw at 0x10/0x14/0x18 are params 5/6/7 (single observation — not yet cross-confirmed) (P31 S58) _L22618
• §218 — A NARROW TYPE AT THE ABI BOUNDARY COSTS AN IN-PLACE sll/sra PAIR — on the RETURN as well as on the PARAMETER (P31 S58) _L22644
• §219 — COMPOUND +=, FULL ASSIGNMENT, AND AN EXPLICIT TEMP ARE THREE DIFFERENT SCHEDULES OF ONE READ-MODIFY-WRITE (P31 S58) _L22673
• §220 — THE PARAMETER ITSELF IS A REGALLOC DIAL: use it directly, prefer s32 to void*, and place the save-copy AFTER the first call (P31 S58) _L22700
• §221 — A CONSTANT SHARED BY TWO STORES DIES AT THE CALL WHOSE DELAY SLOT REFILLS ITS REGISTER (single observation — not yet cross-confirmed) (P31 S58) _L22734
• §222 — SWITCH vs IF-CHAIN, PART 3: source arm order IS emission order, a leading EMPTY case buys the median split, and a 2-way dispatch with a shared post-block is a switch (P31 S58) _L22750
• §223 — READING A jal DELAY SLOT: the value in it was produced BEFORE the call, so it is NEVER that call's return (P31 S58) _L22792
• §224 — CROSS-JUMP: WRITE THE DUPLICATE, AND READ A SHARED DELAY SLOT AS THE MERGE SIGNATURE (P31 S58) _L22854
• §225 — THREE CONTROL-FLOW SHAPES NO STRUCTURED SPELLING REACHES (P31 S58) _L22890
• §226 — FRAME PADS: FOUR WAYS §162i1/§2429's DEAD-LOCAL LEVER MISFIRES (P31 S58) _L22933
• §227 — TYPE THE SOURCE BY THE LOAD WIDTH, NOT BY THE STORE WIDTH (P31 S58) _L22974
• §228 — READING THE DIVIDE, PART N: the off-by-one compare is % K == 1, and three more discriminators (P31 S58) _L22994
• §229 — THE ADDRESS IS A VALUE: NAMING IT MOVES THE lui/addiu PAIR — AND §L14410 SAYS THE OPPOSITE FOR A REASON (P31 S58) _L23031
• §230 — THE ANCHOR PROBE: with %hi/%lo masked, the surviving addiu deltas tell you which assignment was written first (single observation — not yet cross-confirmed) (P31 S58) _L23080
• §231 — TRANSCRIPTION AND SEMANTIC-READ HYGIENE: six ways the listing misleads (P31 S58) _L23095
• §232 — WHEN THE jr DELAY SLOT'S STORE STORES THE RETURN VALUE, TIE THEM WITH ONE PSEUDO (single observation — not yet cross-confirmed) (P31 S58) _L23136
• §30 — addendum (P31 S58) — the /s grant closes a SCHEDULING residual and a REGISTER residual with one edit _L23172
• §194-B — addendum (P31 S58) — BOUND 2 is byte-wrong; see §209 Direction A _L23192
• §176-B — addendum (P31 S58) — the misdiagnosis direction _L23198
• §165-40 — addendum (P31 S58) — the barrier goes at the COPY SITE, not inside the region it protects _L23204
• §164-63 — addendum (P31 S58) — the interposed asm works when the SECOND value is an ordinary assignment _L23213
• §193-A — / §194-E addendum (P31 S58) — where the twin's body actually lives _L23222
• §233 — THE WAVE aa–bg HARVEST (P31 S58b): 1,101 byte-banked notes → 24 new laws, 21 addenda, ~700 already-covered _L23228
• §234 — CONSTANT MATERIALISATION: THE STORE LVALUE'S SIGNEDNESS PICKS addiu vs li/ori (P31 S58b) _L23272
• §235 — THE PHANTOM SYMBOL: A MASKED MATCH CAN CARRY A RELOCATION THAT DOES NOT EXIST (P31 S58b) _L23313
• §236 — THE DECLARATION LAYER IS THE DOMINANT BANK-BLOCKER: NINE WAYS A BYTE-PERFECT BODY FAILS THE GATE (P31 S58b) _L23342
• §237 — THE CAST-AT-CALL-SITE DECISION TABLE: WHAT §17a-1 FIXES, WHAT IT CANNOT, AND THE FOUR ESCAPES (P31 S58b) _L23421
• §238 — SAME NAME, DIFFERENT FUNCTION: THE OVERLAY-HOMONYM TRAP (P31 S58b) _L23476
• §239 — TWO-STATEMENT INTEGER-SPACE MATERIALISATION REORDERS la vs sll; AND THE PLUS-TREE OPERAND ORDER (P31 S58b) _L23516
• §240 — A + K + B: WRITE THE CONSTANT BETWEEN THE TWO RUNTIME TERMS (P31 S58b) _L23550
• §241 — THE FOLDED SIGN-EXTEND-AND-SCALE: sll 16 ; sra (16 − log2 scale) (P31 S58b) _L23579
• §242 — *k vs <<n, AND /2^n vs >>n: EXPRESSION SPELLING OWNS THE LOAD WIDTH AND THE ROUNDING CHAIN (P31 S58b) _L23608
• §243 — SPELL THE CSE BARRIER AS A REASSIGNED POINTER; AND THE nop-AFTER-EVERY-lh SIGNATURE (P31 S58b) _L23636
• §244 — volatile IS A COUNTING INSTRUMENT, A STORE-ORDER PIN, AND MUST SOMETIMES BE ASYMMETRIC (P31 S58b) _L23666
• §245 — THE CALL'S ARGUMENT LIST IS A SCHEDULING SLOT (P31 S58b) _L23701
• §246 — THREE-LIVE-VALUE SCAN LOOPS WANT ADDRESS-FROM-INDEX; AND TWO SYMBOLS CAN SHARE ONE giv (P31 S58b) _L23748
• §247 — TWO BRANCHES TO ONE LABEL MEANS THE SOURCE CONDITION IS NEGATED (P31 S58b) _L23788
• §248 — SPLIT THE LOAD FROM THE ARITHMETIC: A FUSED g + K DENIES THE CALLEE-SAVED REGISTER ITS DIRECT HOME (P31 S58b) _L23822
• §249 — THE SELF-ASSIGN, THE DEAD RE-ASSIGN, AND THE + zr COPY: THREE WAYS TO MAKE A DELETED INSTRUCTION REAL (P31 S58b) _L23846
• §250 — %hi/%lo vs lw: THE EXTERN'S ARRAY-vs-SCALAR SHAPE DECIDES ADDRESS MATERIALISATION (P31 S58b) _L23888
• §251 — IMMEDIATE-SPELLING TRIGGERS: += 0xFF, FULL-WIDTH ~K, AND THE TWO-OR SPLIT (P31 S58b) _L23925
• §252 — THE GUARDED PRE-DECREMENT: (x != 0) && (--x == 0) (P31 S58b) _L23947
• §253 — POSTFIX ++ vs += 1 PICKS A DIFFERENT SCRATCH REGISTER (single observation — not yet cross-confirmed) (P31 S58b) _L23968
• §254 — THE DEAD PARAMETER IS A REGISTER-PLACEMENT TOOL (single observation — not yet cross-confirmed) (P31 S58b) _L23982
• §255 — THE EMPTY CASE, PART 2: FOUR TREE SHAPES IT BUYS (P31 S58b) _L23994
• §256 — GOTOS IN THE TARGET'S BLOCK ORDER REPRODUCE SWITCH PLACEMENT WITHOUT SWITCH'S SIDE EFFECTS (P31 S58b) _L24029
• §257 — THE DEAD-END LEDGER (P31 S58b): ELEVEN LEVERS THAT MEASURED NULL OR BACKFIRED _L24066
• §258 — ADDENDA TO EXISTING SECTIONS (P31 S58b) _L24109
• §30 — addendum (P31 S58b) — THE ANONYMOUS STRUCT MEMBER REF GRANTS /s, AND THAT IS A TWO-FOR-ONE _L24114
• §194-B — / §209 addendum (P31 S58b) — TWO MORE INSTANCES, AND THE BOUND IS NOW REFUTED FOUR WAYS _L24135
• §202 — addendum (P31 S58b) — THE DEF-SIDE ALIAS ALSO CLEARS A RETURN+PARAM DOUBLE CONFLICT _L24158
• §205 — addendum (P31 S58b) — CHAINED ASSIGNMENT: N≥3 IS INNERMOST-FIRST, AND THE TEXT MIRRORS EMISSION _L24169
• §208 — addendum (P31 S58b) — IT SCALES TO SIX SITES, AND IT HAS AN EXACT INVERSE _L24186
• §210 — addendum (P31 S58b) — THREE CONFIRMED SPELLINGS OF THE BOOLEAN TAIL _L24215
• §211 — addendum (P31 S58b) — INIT PLACEMENT: FIVE MORE DIALS BEYOND THE GUARD HOIST _L24231
• §213 — addendum (P31 S58b) — THREE MORE PERMUTATION LAWS FOR INDEPENDENT SAME-BASE STORES _L24274
• §214 — addendum (P31 S58b) — FOUR MORE WAYS A HIGH-SIMILARITY TWIN LIES _L24303
• §215 — addendum (P31 S58b) — PIN ECONOMY, PART 2: NINE REFINEMENTS _L24339
• §217 — CROSS-CONFIRMED (P31 S58b) — AND THE INCOMING HOME SLOT IS THE MIRROR _L24391
• §220 — addendum (P31 S58b) — THE PARAMETER, NOT A COPY (SEVEN CARDS) _L24408
• §222 — addendum (P31 S58b) — IF-CHAIN vs SWITCH: THREE MORE DISCRIMINATORS _L24433
• §223 — addendum (P31 S58b) — FIVE MORE CONFIRMATIONS, AND THE CONSTANT-IN-$v0 CASE _L24451
• §224 — addendum (P31 S58b) — CROSS-JUMP MERGES CALLS, AND THE DELAY SLOT IS THE DISCRIMINATOR _L24475
• §225 — addendum (P31 S58b) — THE GUARD-CLAUSE FINGERPRINT, AND THREE MORE SHAPES _L24505
• §226 — addendum (P31 S58b) — THE FRAME CATALOGUE: SEVEN MORE LEVERS, AND SLOT ORDER IS DECLARATION ORDER _L24532
• §229 — addendum (P31 S58b) — NAME IT INSIDE THE ARM _L24577
• §230 — CROSS-CONFIRMED (P31 S58b) _L24588
• §231 — addendum (P31 S58b) — FOUR MORE WAYS THE LISTING MISLEADS _L24597
• §232 — CROSS-CONFIRMED (P31 S58b) _L24628
• §259 — THE DISCARD LEDGER FOR THE aa–bg HARVEST (P31 S58b): WHAT WAS MINED AND REJECTED, AND WHY _L24639
• §260 — THE §154-A LEADING-ISLAND SPLIT: ONE CONFIG LINE, AND THE ISLAND PEELS FROM THE END (P31 S59, byte-proven) _L24678
• §260-A — STAGE 2 IS PROVEN, AND THE WHOLE jtbl PIPELINE IS AUTOMATED AT THE GATE (P31 S59, same day) _L24728
• §261 — THE -O0 ORACLE: DERIVE THE OPT LEVEL FROM THE TARGET, AND $fp IS NOT THE TELL (P31 S59) _L24764
• §261a — THE -O0 FRAME-RELOAD GRAMMAR: reload COUNT disambiguates the C spelling (P31 S59, byte-proven) _L24790
• §262 — A LANE'S YIELD IS ONLY A LANE FACT IF IT IS SIZE-MATCHED (P31 S59) _L24812
• §263 — A STOLEN DELAY SLOT WHOSE INSTRUCTION IS AN ARG-REGISTER COPY IS AN ARITY ERROR, NOT A SCHEDULE (P31 S59, byte-proven) _L24842
• §264 — FOUR TELLS-LANE C RECIPES, EACH DRIVEN TO MATCH (P31 S59) _L24883
• §265 — THE VERBATIM-ASM BANK LANE: A FUNCTION NO -O2 C CAN EVER MATCH BANKS AS A RAW __asm__ BODY (P31 S59b; two banked cards, two in-tree precedents) _L24930
• §266 — THE INERT-RIDER LAW: A LEVER IS ONLY CITABLE WHEN ITS SOLO REMOVAL BREAKS THE MATCH (P31 S59b; measured 4-of-8 on this batch) _L24992
• §267 — ADDENDA HARVESTED FROM WAVES at/bh/bk/bl (P31 S59b) _L25032
• ADD-1 — → §231 addendum (also cross-ref from §195-D) — THE MASKED-jal "MISSING CALL" ILLUSION _L25040
• ADD-2 — → §42a addendum — A SHARED CONSTANT NAMED IN A LOCAL ACROSS A jal IS AN ISO→TU DRIFT HAZARD; WRITE BARE LITERALS _L25049
• ADD-3 — → §236, item 10 — THE UN-DELETED INCLUDE_ASM STUB IS A DUPLICATE DEFINITION _L25061
• ADD-4 — → §225-3/-4 addendum — THE MIRROR ROW: VALUE-RETURN IN THE TAKEN ARM + TRAILING BARE return 0 _L25071
• ADD-5 — → §1/I1 addendum — THE INVERTED RANGE TEST: (u32)(x-lo) >= N WITH THE ZERO-ARM AS THE TRAILING else _L25085
• ADD-6 — → §172b-1 / §264 addendum — SHIFT-AS-TEST: (x << 16) != 0 TESTS THE LOW HALF WITHOUT TRUNCATING THE PSEUDO _L25094
• ADD-7 — → §256 addendum — THE SINGLE-GUARD GOTO: THEN-BLOCK OUT OF LINE AT THE TAIL _L25103
• ADD-8 — → §245 addendum — THE RE-TIE BARRIER PINS CALL-ARG SETUP TO SOURCE ORDER (construct 6) _L25115
• ADD-9 — → §213-3 / §217 addendum — ADJACENT PRE-CALL FRAME STORES ARE ONE AGGREGATE; THE UNESCAPED SCALAR NEIGHBOR IS DEAD-STORED _L25127
• ADD-10 — → §237 addendum (arity-evidence paragraph) — AN la PAIR ABOVE THE PROLOGUE sw $ra IS AN OUTGOING-ARGUMENT MATERIALISATION _L25137
• ADD-11 — → Cross-confirmation card block (per §259's standing instruction: confirmation, not news) _L25146
• §268 — A register __asm__ PIN ON A CALL-CLOBBERED REGISTER IS HONORED EXACTLY WHEN THE PINNED RANGE CROSSES NO CALL (P31 S59c; three A/B'd cards, unifying §257-2's two) _L25197
• §269 — ADDENDA HARVESTED FROM WAVES ax/bm (P31 S59c) _L25251
• ADD-1 — → §257-8 addendum — THE INTERPOSED ASM'S __volatile__ IS A PER-SHAPE DIAL, AND THE "NO-OUTPUT ASM IS IMPLICITLY VOLATILE" LORE IS BYTE-FALSE IN gcc-2.7.2 _L25266
• ADD-2 — → §236 addendum (item 1 corollary) — THE SILENT-SPLICE DECLARATION LADDER: WHERE THE TU HAS NO SPELLING, UNPROTOTYPED () BEATS THE FLEET VOTE _L25279
• ADD-3 — → §238 addendum — TWO BINARIES CAN EACH DEFINE THE SAME func_ NAME WITH DIFFERENT BYTES, AND NO GENERATED REPORT SHOWS IT _L25293
• ADD-4 — → §167-37 addendum — THE FIFTH PRECONDITION, NOW MEASURED: DOWNSTREAM FIELD RE-READS ⇒ NAME IT AND STORE INSIDE THE ARM _L25306
• ADD-5 — → §267-ADD-6 / §172b-1 addendum — THE SIGN-TEST FACE: (s16)v < 0 IS sll 16 + bgez ON THE SHIFTED COPY, RAW STAYS LIVE — AND THE HALFWORD-ABS SHAPE NEEDS NO RITUAL _L25323
• ADD-6 — → §220-addendum — THE FOURTH FACE: WHEN THE NAMED COPY ITSELF BUYS THE EXTRA CALLEE-SAVED, PIN THE COPY TO $16 _L25339
• ADD-7 — → §229 addendum — THE VALUE FACE: A LOOP-STORE CONSTANT SPELLED AS A LITERAL HAS NO SOURCE POSITION; NAME IT TO PIN THE PROLOGUE INIT ORDER _L25355
• ADD-8 — → §30a addendum — THE THIRD COLUMN: *p++ IS ALSO SERIALIZED BUT BURNS addiu; ONLY CAST-PLUS GIVES SERIALIZATION AND DISPLACEMENT FOLDING _L25368
• ADD-9 — → §255 "AND CASE-BODY PLACEMENT" bound / §222-addendum-3 — ON A LARGE SPARSE TREE, BODIES FOLLOW SOURCE ORDER (measured by a one-word probe) _L25383
• ADD-10 — → Cross-confirmation card block (per §259's standing instruction: confirmation, not news) _L25397
• §3-1a. — The §266 sweep — every solo-lever A/B run for this batch _L25438
• §270 — The A-prop 0-bank anatomy: a byte-correct body still needs FOUR layers to agree (P31 S59) _L25471
• §271 — Ordinal IMM pairing: text order is NOT emission order; emit CANDIDATES, let the oracle pick (P31 S59) _L25489
• §272 — The (void)-decl + empty-call wall: K&R the DEFINITION, not just the decls (P31 S59) _L25511
• §273 — A standalone compile is the WRONG oracle for a TU-destined draft (P31 S59) _L25531
• §274 — ADDENDA HARVESTED FROM 18 WAVES (P31 S60): 315 candidates, 255 already covered, 21 sharpenings, 3 new laws _L25546
• ADDENDUM — to §179-C — the .type NAME, @function requirement _L25552
• ADDENDUM — to §134 — a typedef defined BELOW the splice point is stripped anyway _L25599
• ADDENDUM — to §179-D (GTE macro reference family) — gte_SetRotMatrix/gte_SetTransMatrix bodies _L25629
• ADDENDUM — to §82 — struct copies must stay MEMBER-WISE, not block-moved, to match a spill-slot save _L25655
• ADDENDUM — to §136d-1 (RC-12, the $0-add / opaque-copy family) — two symptoms beyond "compare reads the wrong register" _L25693
• ADDENDUM — to §20 — a global declared as T * may itself BE the array base, not a pointer to dereference _L25732
• ADDENDUM — to §1-I5 _L25761
• ADDENDUM — to §164-51 _L25826
• ADDENDUM — to §176-F5 _L25842
• ADDENDUM — to §225 _L25871
• ADDENDUM — to §224 — CROSS-JUMP: THE DUPLICATE CAN BE A PLAIN STORE, NOT ONLY A CALL _L25916
• ADDENDUM — to §164-64 — AN EMPTY CLOBBER ON AN ARGUMENT REGISTER CAN BE THE DELIBERATE FIX, NOT JUST THE ACCIDENTAL BUG _L25950
• ADDENDUM — to §244 — THE COMPILER BARRIER, NOT volatile, BLOCKS A STORE→LOAD HOIST THROUGH A POINTER-OFFSET FIELD _L25981
• ADDENDUM — to §172b-1 — TWO PLACEMENT DIALS THE PROMOTION LAW DOESN'T NAME: NARROW THE COUNTER'S DECLARED TYPE, AND MOVE THE CAST INTO THE LOOP BODY _L26012
• ADDENDUM — to §229 — A POINTER'S NUMBER OF USES DECIDES WHETHER ITS ADDRESS FOLDS OR SURVIVES A CALL _L26059
• ADDENDUM — to §172b-4 — THE PLAIN CAST-DIVISION ALREADY PRODUCES THE PATTERN; DON'T HAND-ROLL THE BIAS, AND KEEP THE OPERAND WIDE _L26104
• ADDENDUM — to §8 — WHEN INCLUDE_RODATA NEEDS A STANDALONE .s YOU CAN'T CREATE, CARRY THE FRAGMENT AS A FILE-SCOPE __asm__ BLOB _L26134
• ADDENDUM — to §226 — A DEAD LOCAL SCOPED TO A NESTED BLOCK BUYS A MID-FUNCTION addiu sp PAIR, NOT A FRAME-SIZE CHANGE _L26177
• ADDENDUM — to §172a — RE-READING MEMORY (NOT NAMING A TEMP) IS WHAT KEEPS AN INCREMENT'S DELAY-SLOT FILL ALIVE _L26216
• ADDENDUM — to §225 / §256 — A GOTO TO A SHARED SET-POINT PREVENTS IF-CONVERSION FROM COLLAPSING A LATER BRANCH TEST _L26247
• ADDENDUM — to §211 — AN IN-LOOP ACCUMULATOR WANTS A CLOSED-FORM EXPRESSION WHEN THE TARGET REMATERIALISES ITS CONSTANT AFTER EVERY CALL _L26289
• §275 — THE LEFTOVER-REGISTER READ _L26324
• §276 — MIXED ADDRESS-EXPRESSION SPELLING FOR ADJACENT RELOCATABLE SYMBOLS IS A CSE-UNIFICATION DIAL, NOT JUST A BYTE-ENCODING CHOICE (P31 S60; func_80180FE8, ov_SC06_006, byte-proven) _L26364
• §277 — RETURN-TAIL C SPELLING PICKS THE DELAY-SLOT-FILL vs TRAILING-MOVE TOPOLOGY, AND A NARROWER SECOND VARIABLE KEEPS TWO PSEUDOS INSTEAD OF ONE (P31 S60; func_801846F0 ov_SC03_104, func_801A44C4 md_SC07_004, both byte-proven) _L26473
• §278 — ADDENDA HARVESTED FROM WAVE cf (P31 S60): 34 candidates, 13 already covered, 8 sharpenings, 4 new laws _L26537
• ADDENDUM — to §74 (func_800D0E30, resident) _L26545
• ADDENDUM — to §172b-4 (func_80185054, ov_SC03_097) _L26581
• ADDENDUM — to §265 (func_8017DC80, ov_SC07_002) _L26619
• ADDENDUM — to §17 (func_800CB794, md_MAIN_036) _L26658
• ADDENDUM — to §162p (func_8017C120, ov_MAIN_012) _L26706
• ADDENDUM — to §20 (~L1947) (func_80186AD0, ov_SC06_032) _L26740
• ADDENDUM — to §164-56 (func_8017F644, ov_SC04_005) _L26770
• ADDENDUM — to §237 (func_8017F7FC, ov_SC03_092) _L26805
• §279 — A do/while (p < end) LOOP UNDER AN ENTRY GUARD: the guard decides the compare, not the loop (P31 S60; wave cf, func_8017F2A4, ov_SC03_096, byte-proven) _L26834
• §NNN — A DO-WHILE'S GUARD AND LATCH MUST REPEAT THE SAME BOUND EXPRESSION, NOT SHARE ONE LOCAL: THE REPETITION IS WHAT BUYS THE CSE'D COPY INTO A SECOND REGISTER (P31 S60; func_8017F2A4, ov_SC03_096, byte-proven 25/25) _L26835
• §280 — THE CURSOR'S DECLARED TYPE PICKS sltu vs slt: a T* bound test is UNSIGNED by C rule, an integer cursor is signed (P31 S60; wave cf, func_800CAE74, md_MAIN_031, byte-proven) _L26868
• §NNN — A LOOP CURSOR'S C TYPE (POINTER vs PLAIN INTEGER) SELECTS sltu vs slt FOR ITS BOUND TEST, INDEPENDENT OF THE VALUES INVOLVED (P31 S60; func_800CAE74, md_MAIN_031, byte-proven; cross-confirmed same wave by func_8017F2A4, ov_SC03_096) _L26869
• §281 — GROUP COPY-THEN-RMW BY OPERATION KIND, NOT FIELD BY FIELD: sched1 does the interleaving, the source must not (P31 S60; wave cf, func_80180FB4, ov_SC03_111, byte-proven) _L26902
• §NNN — A DEPENDENT COPY-THEN-RMW BLOCK MUST BE SOURCE-GROUPED BY OPERATION KIND, NOT BY FIELD, AND SCHED1 DOES THE INTERLEAVING (P31 S60; func_80180FB4, ov_SC03_111, byte-proven) _L26903
• §282 — gcc's OWN LOOP REVERSAL PUTS THE COUNTER INIT AFTER THE HOISTED MOVABLES — a position no hand-written down-count can reach (P31 S60; wave cf, func_80180DD8, ov_SC04_005, byte-proven) _L26948
• §NNN — WRITE THE UP-COUNT LOOP: gcc's OWN REVERSAL PRODUCES A COUNTER-INIT INSTRUCTION THAT LANDS AFTER HOISTED MOVABLES, WHICH A HAND-WRITTEN DOWN-COUNT LOOP CANNOT REPRODUCE (P31 S60; func_80180DD8, ov_SC04_005, byte-proven) _L26949
• What — I could not verify _L26986
• §283 — ADDENDA HARVESTED FROM THE 36-WAVE BATCH (P31 S60): 1,216 candidates, 859 already covered, 46 sharpenings, 9 new laws _L27033
• ADDENDUM — to §164-75 — the fold-reassociation law also fires at a variable's INITIALIZER, not only a later expression _L27043
• ADDENDUM — to §21 — the bltz+slti (or N-separate-compares) signed-range-split bullet is now CONFIRMED on three independent functions, and generalizes beyond lbu/u8 _L27069
• ADDENDUM — to §202 — the DEF-SIDE ALIAS also resolves a function-vs-DATA-symbol identifier clash, not only a function-vs-function prototype clash _L27115
• ADDENDUM — to §22 (volatile-qualified-global reload lever, cookbook ~L1922) — for a NON-constant, same-address double RMW, a plain memory clobber beats volatile, and volatile actively breaks a delay-slot fill _L27138
• ADDENDUM — to §195-E — a goto-ladder's STORES must sit AT the labels, after the gotos, not inline before them _L27157
• ADDENDUM — to §195-N — a GNU statement-expression slider must sit INSIDE the conditional arm's value position, not as a post-hoc barrier, to block the store-flag transform on a ternary chain _L27219
• ADDENDUM — to §176-B2 — in a micro-function with no long/short lifetime asymmetry, BOTH contending pseudos need their own hard-register pin _L27276
• ADDENDUM — to §199-G — A default: LABEL GROUPED ONTO THE LAST CASE REMOVES THE j default TAIL, EVEN THOUGH THE 2-NODE HEADER STAYS ALL-POSITIVE _L27323
• ADDENDUM — to §220 — REFERENCING THE RAW PARAMETER (NO NAMED COPY, NOT EVEN A PIN) LETS THE CALLEE-SAVED SPILL LAND IN THE FIRST CALL'S OWN DELAY SLOT _L27392
• ADDENDUM — to §252 — a >=0/<0 split on an unconditionally-decremented value needs the POSTFIX operator INSIDE the branch condition, not a prior statement _L27450
• ADDENDUM — to §215 — FIFTH SHAPE: reused mask constants across two call-free merge sites each get their own whole-function hard-register pin, and a shared sub-expression at the second site must be its own statement _L27477
• What — I could not verify _L27560
• Harness-defect — flags _L27631
• ADDENDUM — to §167-40 (func_8017E2CC, ov_SC04_015 — wave dg) _L27724
• ADDENDUM — to §20's cross-jump EXPLOIT bullet (func_8017E360, ov_SC05_007 — wave dg) _L27744
• ADDENDUM — to §87 (func_801815F4 ov_SC06_032; corroborating func_801840DC ov_SC05_017, func_80189C68 ov_SC03_006 — wave dg) _L27758
• ADDENDUM — to §153 / §236-5 (func_801A419C, md_SC07_003 — waves di and dl, corroborating; refutes a contradicted dj-wave card) _L27777
• ADDENDUM — to §263 (func_801E83AC, md_SC04_029 — wave dj) _L27797
• ADDENDUM — to §265 (func_8017D878, ov_SC03_107 — wave dj; corroborated by a REJECTED, contradicted card in wave dm — see closing) _L27811
• ADDENDUM — to §6 (func_801811F0, ov_SC03_102 — waves dj and dl, corroborated by a self-reported "nothing new" dm-wave card) _L27825
• ADDENDUM — to §195-G (func_80183BB0, ov_SC05_001 — wave dj) _L27839
• ADDENDUM — to the zero-byte-asm-slider family (§47 / §148-C / §153) (func_800CB874, md_MAIN_040 — wave dj; open tension with a more cautious dm-wave card — see closing) _L27867
• ADDENDUM — to §194-B (func_8017EB34, ov_SC03_117 — wave dk; distinct from the §74 co-pinning finding on the SAME function below) _L27885
• ADDENDUM — to §74 (func_8017EB34, ov_SC03_117 — counter/clamp variant; wave dj, corroborated by dk/dl/dm cards on the same function) _L27917
• ADDENDUM — §37 — merged into the §153/§236-5 entry above (func_801A419C, wave dl) _L27937
• ADDENDUM — §6 — merged into the §6 entry above (func_801811F0, wave dl) _L27945
• ADDENDUM — to §238 (func_80182CB4, ov_SC02_000 — wave dl) _L27953
• ADDENDUM — to §137a (func_801684B4, ov_MAIN_012; corroborated independently by func_80189E68, func_8017FF9C, func_801822B4, func_8018DA8C — wave dl) _L27971
• ADDENDUM — to §8c / §88d (func_8016AB6C, ov_MAIN_012 — wave dm) _L27987
• ADDENDUM — to §73 / §30#2 (func_800D1984, resident — wave dm) _L28001
• What — I could not verify _L28017
• ADDENDUM — to §174 Law 4 (func_8017E9A8, ov_SC06_015) _L28037
• ADDENDUM — the zero-emission-asm family gains a REF-SLIDER PLACEMENT LAW and a paired RESTORER (func_800CB900, md_MAIN_026) _L28077
• From — ck + cl + cm _L28129
• ADDENDUM — §NNN — sharpens §55a / §164-37 / §165-28 (switch-vs-tree cluster): A SHAPE THAT LOOKS LIKE A SWITCH DISPATCH CAN BE PLAIN NESTED ifs WHOSE SHARED BODY WAS TRIPLICATED BY THE SOURCE AND THEN CROSS-JUMP-MERGED BACK DOWN _L28135
• ADDENDUM — §NNN — sharpens §167-13's boundary: CHAINING TWO IDENTICAL SIDE-BY-SIDE STORES INTO ONE C ASSIGNMENT STATEMENT IS A MID-BLOCK SCHEDULING-PRIORITY DIAL, NOT ONLY A STORE-ORDER SPELLING _L28172
• ADDENDUM — §NNN — sharpens §162a3/§60b: A sll $v0,16 / sltiu $v0,1 ZERO-TEST OF A JUST-DECREMENTED HALFWORD IS A SIGNED-TEMP WIDTH TELL OUTSIDE ANY SWITCH/RANGE-TEST CONTEXT _L28205
• ADDENDUM — §NNN — sharpens §37/§124 (unspecified-parameter-list family): DERIVE A CALLEE'S ARITY LOWER BOUND FROM ITS OWN .s STACK-ARGUMENT READS, NOT FROM ANY SINGLE CALL SITE _L28238
• ADDENDUM — to §5a (func_80181F74, ov_SC03_112, wave cn) _L28271
• ADDENDUM — to §265 (func_8017E26C, ov_SC04_016, wave cn) _L28321
• ADDENDUM — to §42b (func_8018247C, ov_SC07_002, waves cu + cw) _L28359
• ADDENDUM — to §199-F family (func_8017EFB0, ov_SC02_021, wave cu) _L28390
• ADDENDUM — to §195-E (func_800CFC1C, md_MAIN_003, wave cv) _L28445
• ADDENDUM — to §215 addendum (func_800CB2C8, md_MAIN_033, waves cv + cw) _L28490
• ADDENDUM — to §236 item 4 (func_8017D268, ov_SC04_006, wave cw) _L28546
• What — I could not verify _L28575
• Harness-defect — flags (not idioms — flagged for the operator) _L28607
• ADDENDUM — to §250 (func_8017D7CC, ov_SC03_115 — cx/cy/cz/dr) _L28648
• ADDENDUM — to §225 (func_8017E190, ov_SC03_115 — cx/cy/cz) _L28693
• ADDENDUM — to §45-A (func_8017F6A4, ov_SC02_016 — cy/cz) _L28746
• ADDENDUM — to §249 (func_80182ED4, ov_SC04_004 — dp/dr/dt) _L28790
• ADDENDUM — to §199-A (func_801816FC, ov_SC02_005 — dp/dr/dt) _L28835
• What — I could not verify _L28881
• Harness-defect — flags _L28924
• §284 — COMBINE CAN REASSOCIATE TWO SEQUENTIAL BITWISE-AND MASKS INTO ONE AGAINST THE PRE-MASK VALUE; AN ASM IN/OUT FENCE RIGHT AFTER THE FIRST MASK BLOCKS IT (P31, wave dd, func_8018087C, ov_SC04_020, byte-proven) (P31 S60; waves #, byte-proven) _L28986
• §285 — PRE-INITIALIZING A VARIABLE WITH A SHARED CONSTANT BEFORE A BRANCH MAKES BOTH ARMS OF THE FOLLOWING if/else DESTRUCTIVELY REUSE THE SAME DESTINATION REGISTER FOR THEIR BITWISE RESULT (byte-proven; func_801811F0, ov_SC03_102, independently rediscovered across waves di/dj) (P31 S60; waves #, byte-proven) _L28990
• §286 — FOLD A STATEMENT'S SIDE EFFECT INTO A COMMA-EXPRESSION IN AN ARGUMENT POSITION TO PLACE ITS RTL RELATIVE TO A CALL'S OWN DELAY SLOT (P31 S60/dj; func_80180A88, ov_SC06_010, byte-proven 411/411) (P31 S60; waves #, byte-proven) _L28994
• §287 — A STACK-FRAME HOLE BELOW TWO ADDRESS-TAKEN AGGREGATE LOCALS IS A LEADING PAD MEMBER OF ONE COMBINED STRUCT, NOT SEPARATE LOCALS OR A REGISTER PIN (P31 S60/dj; func_8017D104, ov_SC06_027, byte-proven 47/47) (P31 S60; waves #, byte-proven) _L28998
• §288 — A REGISTER PIN DECLARED UNINITIALIZED AND ASSIGNED ONLY AT ITS LATE, SOLE USE STILL FORCES THE FIXED REGISTER'S SAVE/RESTORE, AND THE ASSIGNMENT'S SOURCE POSITION CONTROLS WHERE THE VALUE MATERIALIZES (P31; func_80186530, ov_SC02_017, byte-proven, match_one MATCH re-verified) (P31 S60; waves #, byte-proven) _L29002
• §289 — an array local's address-taken base keeps every element's store alive, even though only one pointer escapes (func_80189EFC, ov_SC04_011) (P31 S60; waves #, byte-proven) _L29006
• §290 — A SINGLE STRENGTH-REDUCED GIV CAN DRIVE STORES TO SEVERAL DISTINCT RELOCATABLE SYMBOLS, EACH KEEPING ITS OWN %hi/%lo ANCHOR (P31 S60; waves #, byte-proven) _L29010
• §291 — THE DELAY-SLOT FALSE-VALUE: A CONDITIONAL BRANCH'S ZERO ARM MUST BE A FALL-THROUGH-ADJACENT BLOCK ENDING IN AN EXPLICIT JUMP, OR REORG CANNOT MATERIALIZE IT INSIDE THE BRANCH'S OWN DELAY SLOT (P31 S60; waves #, byte-proven) _L29014
• §292 — DECLARING A SYMBOL UPSTREAM OF AN ALREADY-BANKED SIBLING THAT RELIES ON THAT SYMBOL'S IMPLICIT (K&R) DECLARATION CAN SILENTLY REPROTOTYPE THE SIBLING'S OWN CALL SITE (P31 S60; waves #, byte-proven) _L29018

---

L-number → section (if you cited §1234 and the grep failed, it was a LINE number)

Index rows carry a <sub>L…</sub> anchor = the section's line in docs/matching-cookbook.md. Notes routinely quote that as a section id. This table resolves it. Grep bait: L-number, line number cited as section, § grep failed.

L	section	title
L30	§3-How	to use this
L39	§1	Idiom catalog (asm pattern → C that produces it)
L41	§3-I1	Unsigned range check: (x - lo) < (hi-lo) → addiu+sltiu
L47	§3-I2	Byte mask forces andi even after lbu
L54	§3-I3	Division by a constant → magic multiply
L60	§3-I4	Runtime (variable) division → divu + zero-check break (NEEDS --expand-div)
L69	§2	Writing matching C (what makes gcc emit X)
L71	§3-T1	Loop pointer: top-of-body for addu induction, not constant-folded addiu
L78	§3-T2	Source statement order drives instruction scheduling
L85	§3-T3	Types
L90	§3-T4	Branch polarity: invert the source condition to flip gcc's chosen branch
L107	§3	When a diff is pure scheduling → decomp-permuter (harness built, Phase 6)
L128	§3a	Escalation TIER above the permuter — web-research the compiler internals (HIGH VALUE, prov
L147	§3b	§31-directed permuter mutation — bias the search over the class's levers (Phase 24 T5)
L190	§4	Flag/toolchain gotchas
L199	§5	Known hard-residual classes (instruction-identical, one byte-exact blocker)
L211	§5a	Cross-jump tail-merge — gcc collapses two byte-identical blocks the original kept separate
L246	§6	Per-module optimization mixing — the -O0 boot module (Phase 7)
L254	Detecting	the opt level (do this first)
L288	Build	mechanism — per-file opt override (splat resegmentation)
L303	§7	PsyQ SDK types & symbols (the library-call prerequisite)
L320	§8	rodata island (compiler jump tables) — the .data→.rodata→.data sandwich (Phase 7)
L342	§8a	rodata island in a flat OVERLAY — the tail sandwich, per matched jr-function (Phase 26 — P
L380	§8a-pad	a trailing .word 0x00000000 under a jtbl dlabel is .align PAD, not an entry (Phase 26
L404	§8b	MULTI-jtbl per overlay — the ld_interleave --order sandwich + the same-subseg cases (Pha
L437	§8c	Splitting a TU means rebuilding its DECLARATION ENVIRONMENT, not moving text (Phase 26 ses
L483	§8d	Templating a body INTO a TU must not CHANGE its declaration environment — demote the carri
L530	§8e	The jtbl ALIGNMENT LAW + the pad-spec filter — multi-table .rodata spans (Phase 29, byte-p
L613	§9	Link real PsyQ library objects byte-exact (Phase 7 — GO proven)
L642	§9.1	Generalised per-object linker — tools/psyq_link.py (+ psyq_link_lib.py), 18/18 libcd b
L666	§9.2	Wire a library region into the build with NOLOAD — no data carving (`tools/psyq_link_regio
L685	§9.3	Make it the build: resegment + swap + resolve (tools/psyq_integrate.py, libcd DONE)
L712	§9.4	Integrating a SECOND library (libgs block 6 after libcd) — multi-library gotchas
L740	§9.5	Integrating a WHOLE multi-block library in one call (full libgs — Phase 7 session G)
L766	§9.6	Scaling library linking to the whole EXE (Phase 8 — 8 libs linked, 20%→50% byte-identical)
L802	§9.7	Binary-agnostic toolchain refactor (Phase 9) — the reusable pattern for Gen2
L835	§10	Closing the regalloc/scheduling hard tail by hand (LZSS, Phase 7 session F — the full clos
L844	§3-The	clean object-level metric (use this, not the permuter score, for jtbl/rodata functions)
L856	Residual	A — commutative `
L867	Residual	B — a return <const> materialised late / merged instead of distributed per-site
L908	§11	Cross-binary dedup & code-sharing (Phase 11 — "one match unlocks many")
L926	§3-The	mechanism: game-code dedup is SOURCE-LEVEL, not an object swap (R-D1, the key lesson)
L959	Per-binary	toolchain provenance (R24)
L964	§12	Ultracode harvest — parallel-draft + byte-gate at scale (Phase 12, resident: 1.4%→71.7% in
L1056	§13	Add a location overlay — the canonical runbook (Phase 13; the Phase-15 fleet recipe)
L1062	One-command	onboarding — tools/new_overlay.sh <SCxx> <FILE_nnn>
L1071	§3-The	flat-blob overlay config (what the template encodes)
L1079	§3-THE	NON-4-ALIGNED-OVERLAY GOTCHA (≈75% of the fleet; fixed in the template + Makefile, automat
L1091	§3-The	A→B→C per-overlay workflow
L1108	Dedup-credit	(§11) for overlays — two shapes
L1120	Fleet	build — make build-all / make check-all
L1126	§14	Propagate a matched function across the fleet — tools/dedup_propagate.py (Phase 15)
L1169	§14a	The fleet bulk run (Phase 15 — --auto-from, 947 REAL → 74,527; 3.82% → 22.14% in one pas
L1192	§14b	Harvesting the UNMATCHED shared core — the match_one wall (Phase 15)
L1213	§14c	Callee-signature-aware harvest — breaking the extern-type-conflict wall (Phase 15, T6)
L1269	§14d	Deterministic recovery beats agent waves on the hard tail (Phase 15, the final-session fin
L1298	§14e	Two hard-tail dead-ends (Phase 15 — documented so they aren't re-attempted)
L1313	§15	Struct-heavy shared-core pipeline (Phase 16) — empirical determinations (S0)
L1335	§16	Guided hand-matching the struct-heavy core (Phase 17 — beats the §15 brute-force)
L1376	§17	The compiler-quirk wall — the matching TOOLKIT (Phase 18; gcc-2.7.2 source + byte-gated)
L1384	Register-allocation	ORDER (call-crossing $s0/$s1 swap) → FORCE it with register pins (byte-proven)
L1404	§3-The	STEERABLE idioms (byte-confirmed this phase)
L1421	§3-The	pipeline gotcha — match_one ≠ the gate; sig_unify is MANDATORY
L1428	§3-The	LOOSE-TYPING wall is real for narrow params (Phase 16, reconfirmed)
L1435	Strategic	conclusion — the match-% lever post-research
L1445	§17a	The TOOLKIT at WAVE scale (Phase-18 Step-3b/Step-1 — measured) + the pipeline-integration
L1519	§18	Per-file -O0 split inside an overlay/blob (Phase 19 T1)
L1597	§19	Scaling the toolkit waves — the recovery PIPELINE + the propagation CAP (Phase 19 T3)
L1632	§20	The wave-at-scale GATE CAP + residual-class verdicts (Phase 20)
L1637	§3-THE	CAP: at this tail the match_one→gate gap is the LOOSE-TYPING CALL-GRAPH wall (not cheap pl
L1654	Diagnostic	lesson: a failed in-TU build leaves a STALE .o
L1660	§3-NEW	/ CONFIRMED residual classes (this session)
L1681	Operational	gotchas (cost real time)
L1689	What	WORKED — the Phase-20 reusable wins
L1701	Phase-20	RESOLUTION — tools/cast_call_sites.py BUILT + the cap re-diagnosed (R14, byte-proven)
L1752	§21	wave-distilled idioms (Phase 21)
L2005	§22	DEF-side loose-typing recovery + grinder blacklist (Phase 21)
L2032	§23	Giant func_80153E00 cracked (scalar-data CAST); BUT most giant drafts are STALE+INCOMPLE
L2085	§24	The ov_SC01_077_a.c split-file vein: split-aware propagation, but loose-typing-gated (Ph
L2132	§25	The "schedule" class is mostly COALESCING (pin-crackable), not scheduling; + the gate two-
L2144	§3-The	crack: the residual was gcc-2.7.2 COPY-COALESCING, not the instruction scheduler
L2160	§3-The	genuine scheduler — rank_for_schedule (sched.c), for when it IS scheduling
L2169	§3-The	genuine schedule WALLS (do NOT re-grind — stub)
L2177	§3-h	_exact OVER-COUNTS ×134 — verify shareability before crediting a class's "reach-134" (R14)
L2189	§3-The	gate two-stage — sig_unify is a FALLBACK, not unconditional (gate_stage.py, §19 folded i
L2199	§26	The cheap close=0 recovery lever is EXHAUSTED; idiom_loop --assess was DOUBLY inflated (
L2205	§3-The	_a close=0 recovery banks 0/20 — same def-side wall as MAIN (0/40)
L2233	Where	this leaves the reach-134 tail (cont.6 option-3, now CONFIRMED byte-backed)
L2259	§27	Giant matching recipe (Phase 21 cont.7b — validated on func_80176D94, 152 ins)
L2325	§28	Banking a "close=0 gate-rejected" giant: the canonical-extern recovery (Phase 22 T1, byte-
L2345	§28a	decomp.wiki GCC patterns worth trying on BFM giants (decomp.wiki/compilers/GCC, raw at dec
L2352	§28c	The close=0 recovery is NOT fully exhausted (§26 corrected, R14); + the dedup_propagate re
L2357	§28b	The struct-walled close=0 giant (§28 case #3) IS bankable: the engine_types.h type-lift (P
L2366	§28d	The "macro-extern-injection" lever: freeing reach-134 inline matches dedup_propagate skips
L2374	§29	Reasoning-model (GLM5.2) DEF-side reconciliation idioms + the wall's hard limit (Phase 23
L2382	§30	Fable5Max cracks §20/§10 "unsteerable" from the gcc SOURCE: store-vs-load is a /s aliasi
L2394	§30a	§30 generalizes to the FULL near-miss backlog (via STANDARD Opus agents, not just Fable5)
L2402	§31	THE gcc-2.7.2 CODEGEN MAP: pass → residual → C-lever catalog (Phase 23; 4 Fable5 agents re
L2422	§32	The region-a CAMERA-GIANT idiom set: struct-base hoisting + 4 sibling levers (Phase 24 T7,
L2434	§33	Automating the giant decl-reconcile: tools/reconcile_decls.py (the DATA analog of §20's
L2454	§34	The func_80138ED0 giant crack: gcc-2.7.2's 3-qty sort bug + the **zero-byte asm allo
L2471	§35	The region-a sibling-giant harvest: difficulty ≠ $s-reg count (it's global-array hoisting)
L2487	§36	Fable5 giant-crack levers (Phase 24 T7 Fable5 batch; accumulates as each lands — full RTL
L2506	§37	The T7 §G giant endgame: 6/8 cracked, meta-laws + transferable levers (Phase 24, 2026-07-0
L2527	§38	The WHALE func_80144B9C (770 ins): the -O0 struct-assign memcpy idiom + the -O0 reach-13
L2537	§39	The ×1→×134 giant-endgame: propagate a matched -O2 giant via the NATIVE DEFINE-macro p
L2553	§40	Structural families: the MECHANICAL symbol-remap (crack one exemplar → remap the rest, ~0
L2601	§40a	The DECL-RECONCILE pass (type-lift so remapped drafts compile in the sibling TU) (Phase 25
L2634	§40b	The reloc-tracker blind spot: the indexed-global idiom that hid the "reach-1 tail" (Phase
L2676	§40c	The h_seq per-sibling reconcile: templating a reconcile-class crack ×134 (Phase 26 Task 8,
L2693	§31-triage	R17 applies to CODEGEN residuals, never to a compile ERROR (Phase 26 session 7, Drew asked
L2710	§41	The DEF-SIDE canonical-sig wall: mechanically banking a drafted giant past `conflicting ty
L2754	§41a	v3.1: the def-side wall was ~71% TOOL-shaped — the five measured defects + the laws that d
L2809	§41b	T7 execution: the object-only probe OVER-counts BANKABLE by two link/rodata classes (Phase
L2839	§41c	T7-M2: the ×134 def-side-wall sweep via per-sibling RE-reconcile (Phase 25, 2026-07-10; 4,
L2858	§41b	addendum — M4 "reconcile_decls" tier is ALSO a probe over-count: 0/8 mechanical (Phase 25
L2878	§41d	void→s32 is NOT always byte-neutral: gate the RAW draft FIRST (Phase 26 session 6, byt
L2900	§42	The F-band ≤28 regalloc crack wave: register-pin/DENSITY levers beat the permuter (Phase 2
L2953	§42a	addendum — wave 2 (residuals + 29-100 band): iso-MATCH ≠ real-TU bank, the memcpy→struct-a
L2994	§42b	addendum — wave 3 (Max, 2026-07-10c): THE STALE-OBJECT GATE TRAP + the read-global &-cas
L3033	§42c	addendum — wave 3 (Max orchestrator + CORRECTED Ultracode fan-out, 2026-07-10c): the real-
L3082	§42d	addendum — wave 4 (rtu_match fan-out over the mapped frontier, 2026-07-10c): 24/26 MATCH,
L3121	§42e	propagating a CRACK ×134: the def-finder bug + the byte-drift residual (the "remap-fail" m
L3195	§43	The K&R s16-param definition DISSOLVES the "narrow-param wall" for by-value register args
L3242	§44	The Phase-25 cheap-Opus giant batch: 5 structural levers + the §43 extension (2026-07-11,
L3298	§45	The flagship func_80133CD4 crack (399 ins ×134): the merged-variable permutation-breaker
L3313	§46	The func_80178D40 crack (890 ins ×134, the heaviest core in the game): four LOOP-STRUCTU
L3365	§47	The live-length SLIDER: splitting a global.c allocno-priority TIE with one zero-byte asm (
L3405	§48	The 12-core jr crack wave: the ALLOCNO-PRICING dials and the EBB rule (Phase 26 session 8,
L3413	§3-A.	ALLOCNO-PRICING DIALS — move a value into the register you want, byte-neutrally
L3444	§3-A4	SINK THE CONSUMER CALL INTO THE ARMS (the inverse of A1; func_8016AB6C, byte-proven)
L3468	§3-B.	THE EBB RULE — the general form of §46-L2
L3484	§3-C.	TYPE- AND SHAPE-DRIVEN CODEGEN (the C type literally selects the addressing mode)
L3508	§3-D.	THE CROSS-JUMP RATCHET (the sharpest new trap — func_80131340 L-C)
L3518	§3-E.	Meta
L3527	§49	The LUID DIAL: a zero-byte SCHEDULING dial (the sched.c analogue of §47) — func_8017A4AC
L3576	§50	Refinements that BOUND §47/§48 (from the func_80135EB0 wall, 21→6; Phase 26 session 8)
L3630	§51	TOOLING INTEGRITY: the silent skip, and how to hunt it
L3636	§51a	The bug class
L3652	§51b	Why the byte-gate cannot save you
L3662	§51c	THE METHOD (do not audit by reading the regex)
L3677	§51d	THE LAWS
L3739	§51e	The false-wall pipeline (why this is not just hygiene)
L3755	§51f	Checklist for any new corpus-scanning tool
L3769	§51g	When the thing you are scanning has a GRAMMAR, parse the grammar (tools/cdecl.py)
L3913	§52	The WALKER-FAMILY skeleton: 6 regalloc-order levers + a deeply-characterized intrinsic wal
L3924	§3-The	6 levers (the "walker-family skeleton" — apply to the 12 siblings; levers 1-5 retire ~half
L3945	§3-Why	the wall is (probably) intrinsic
L3959	§52a	The regalloc sibling wave: new levers + two new wall classes (cheap-Opus applying §52, 202
L3997	§52b	Sibling wave 2: more de-pin levers, a third wall class, and the match_one→whole-binary gap
L4028	§53	SWEEP A FAMILY WITH THE TOOL ITS EXEMPLAR NEEDED: the jr/switch carve, and how omitting it
L4033	§3-The	case
L4045	§3-Why	0/8 was structural, and predictable from two words
L4062	§3-The	rule
L4078	§3-The	meta-lesson (R35, and why this one is expensive)
L4093	§55	Core-crack wave levers + the GATE-ORCHESTRATION law (Phase 29 T3, 13-agent ultracode wave,
L4098	§55a	New byte-proven levers (each from a banked or near draft)
L4122	§55b	THE GATE-ORCHESTRATION LAW (3 traps, ~3.5h lost; all recovered, 0 data lost)
L4141	§55c	Sizing the propagate: a TARGETED propagate is ~4 min/core, and "it's slow" was a BROKEN-TR
L4163	§54	--fix-def-sig: the member's CANONICAL DECLARATION is a build step too (tiny-IMM mega-poo
L4187	§56	Banking a hand-drafted GIANT into its exemplar TU: self-contained draft vs live-TU decls,
L4232	§56b	PROPAGATING an h_seq giant: the exemplar's externs MUST be fleet-canonical, not the draft'
L4256	§57	The SELF-decl normalize: the sibling's OWN caller declares the templated fn divergently (t
L4303	§57a	Two NSD corrections + the SURGICAL-ONLY law + the honest broad-sweep yield (Phase 29, 2026
L4343	§58	match_one MATCH ≠ BANK: the four blind spots + the crack-wave reconcile-before-bank law (P
L4377	§59	Three h_seq sweep-residual classes match_one/the-exemplar-bank don't reveal (Phase 29 crac
L4407	§60	Classify the residual, don't rank it: the deterministic residual→class classifier and what
L4431	What	it measured — the whole open backlog, byte-grounded
L4450	§3-Two	corollaries worth remembering
L4463	§3-The	parallel-probe race this surfaced
L4472	§60a	What the first DIRECTED grinder run exposed (Phase 29 Task-13B, 2026-07-21)
L4510	§60b	The plateau autopsy's verdict: a partial drift is a WRONG DRAFT, not a missing transform
L4545	§61	Task 14: the gate ladder's missing stage is the ARITY pre-pass, and it is TU-side not draf
L4606	§61a	The Task-5 wave: 11/12 MATCH, 0 banked — three DISTINCT integration walls, each now named
L4658	§61b	The jtbl gate stage: built, and the ORDERING law it exposed (Phase 29 Task-14 stage 4, 202
L4713	§61c	The jtbl bank is INCREMENTALLY valid and CLEAN-INVALID (Phase 29, 2026-07-21) — the blocki
L4779	§61d	The undo was eating the tree: two tools, one defect, invisible to the byte-gate (Phase 29,
L4833	§62	The jtbl RECONCILE must also follow the carve: the post-carve draft reconcile (`harvest_ve
L4877	§63	The fresh-138 DEF-SIDE blocker: fix the HEADER decl, not the draft (fix_header_decl.py,
L4908	§64	The §20 type-lift's three laws: fold the tagged typedef, check VISIBILITY, and strip only
L4957	§64a	VARIANT types: UNIQUIFY the camps, do not reconcile them (uniquify_type.py, Phase 29 SES
L5000	§63	UPDATE (Phase 29 SESSION-14) — fix_header_decl's "SAFE" verdict is FLEET-BLIND; it MUST
L5015	§65	The stranded-draft recovery: BLAST-RADIUS TIERS, and the per-overlay de-macroize that refu
L5030	§65a	The blast-radius taxonomy (makes §61's law structural instead of remembered)
L5045	§65b	The escape: de-macroize the instantiation, don't touch the shared header
L5081	§65c	rtu_match MATCH → bank held 13/13 on self-decl, but broke on the FIRST callee-decl case
L5091	§65d	Existing-ladder baseline, measured (do this before building a recovery stage)
L5101	§65e	Two oracles, and the disagreement is the finding (R34 in practice)
L5118	§65f	The de-macroize lever's BOUNDARY, measured: byte-neutral 14 times of 15, and the 15th is w
L5139	§65g	Where the cheap levers STOP: the local-type and in-TU-self-decl classes did not yield
L5159	§66	Exercise a banking driver's SUCCESS path before pointing it at a wave: the free re-bank te
L5181	§66a	The widest write in a pipeline is the one most likely to be UNDECLARED
L5200	§66b	A metric parsed out of another tool's prose goes NULL silently when the label changes
L5217	§66c	Before a wave, verify the FUEL exists; an "already attempted" set built from the wrong dir
L5245	§66d	The permuter⇄reader loop: alternate a random search with a byte-verified idiom, and let `r
L5280	§66d-1	What transfers between giants is the LOOP, not the PIN
L5289	§66d-2	Two operational sharp edges
L5300	§66d-3	Read the ILS per-cycle SERIES, not its final best: a repeated score and a still-falling on
L5315	§67	The arg-copy PLACEMENT lever: launder a parameter into a fresh pseudo AT the statement whe
L5405	§67a	Run the symbol-set guard BEFORE you pay for a gate (tools/symcheck.py, Phase 29 SESSION-
L5438	§66d-4	"ILS converged" means converged FOR THAT WEIGHT PROFILE, not a floor (amends §66d-3; Phase
L5491	§66d-5	residual_class's "structural ⇒ permuter CPU is waste" is WRONG for schedule permutations
L5524	§68	A comment-only line halted the extern scan, and the skip label blamed the type cap (Phase
L5569	§69	How to attack a behemoth: map it, don't draft it (Phase 29 SESSION-18, func_80183814, 5,
L5619	§70	The giv-init base register: walk the PARAMETER, not a copy of it (Phase 29 SESSION-18, `fu
L5660	§71	Before mapping a giant, look for an already-matched SIBLING beside it (Phase 29 SESSION-18
L5726	§72	A register __asm__ pin is a PREFERENCE, not a reservation (Phase 29 SESSION-18, `func_80
L5750	§3-The	honest fix was source-level and cheap
L5760	§3-Giv	record order (the §70 family)
L5766	What	is left, and what is byte-recorded as SPENT
L5783	§73	A def-side self-decl conflict has TWO axes: RETURN (fleet widen, T2) and PARAMS (casts at
L5822	§74	Auditing a pinned draft: the §72 hazard is CALLER-SAVED pins spanning a call, and only the
L5866	§75	A propagation cap is usually a MINORITY-SPELLING SOURCE OVERLAY, not a wall: census the ca
L5925	§75a	The exclusion classes, enumerated with named causes (Phase 29 SESSION-19, the 134-binary `
L5948	§75b	A body's preamble can carry #defines, not just externs; extraction lifts only the exte
L5997	§75c	Class-B's remedy is the FULL §17a-1 PAIR (decl and call-site cast); a decl-only fix mo
L6028	§76	The allocno CLASS (local vs global) is the dominant regalloc lever, and C reaches it ONLY
L6037	§3-The	mechanism, with citations
L6057	§3-The	attribution primitive (use this before calling anything a scheduling residual)
L6064	§3-Two	diagnosis traps this function proved
L6074	Practice	Practice
L6084	§77	Every extraction tool carries a NARROW hard-coded preamble set; anything outside it silent
L6124	§3-The	CANDIDATE gate and the REAL gate need DIFFERENT preambles — keep the difference out of the
L6174	§78	A LENGTH drift can be a register grant in disguise; and fold never leaves a literal firs
L6180	§3-The	drift was an allocation decision, not missing code
L6211	§3-The	economics
L6220	§79	For a 0-callee giant, fingerprint by DATA symbols (§71 cannot fire); and the STACK-SLOT OR
L6226	§71	has a blind spot, and this is it
L6240	§3-NEW	LEVER — the frame layout reads back the original declaration order
L6251	§76	confirmed at scale, and a pin nuance
L6260	§3-The	residual, and the honest read
L6270	§80	A do-not-re-buy entry is scoped to its BASE, not to the function; and the pin's hidden cos
L6291	§3-The	pin's hidden cost, with the citation
L6302	§3-The	flagged "#1 move" LOST — and why the failure is informative
L6312	§78	's attribution primitive, run and reproduced
L6318	Cold-start	economics, now complete
L6323	§81	Banking a jr (jump-table) function: the 3-step carve chain, and why match_one cannot see
L6354	§3-The	defect this exposed: a shared type that is present but invisible
L6370	§82	Two source-shape oracles from behemoth #6: a duplicated addiu $aN,$sp,K across a jal m
L6375	§3-1.	The inlined-helper signature
L6389	§3-2.	Scalar vs aggregate decides when the slot is allocated
L6401	Also	reproduced on this function
L6405	§3-And	the banking footnote (§75a class A, one line)
L6412	§83	The parameterised-repeat law, the spill-area trap, and why a per-case edit cannot move a p
L6419	§83a	READ THE HEADLINE NUMBER CORRECTLY: a LENGTH drift makes match_one's count meaningless
L6427	§83b	THE LEVER: find the parameterised REPEAT before decoding case-by-case
L6445	§83c	TRAP: a "dead local" in a prior draft may be gcc's OWN spill area
L6452	§83d	CSE's quantity budget is WHOLE-FUNCTION, so a local rewrite cannot fix a local symptom
L6466	§83e	§80 vindicated again, on the same day it was written
L6472	§84	The DERIVED-OFFSET remap bug: a hand-computed literal that encodes the DISTANCE between tw
L6477	§3-The	construct
L6495	§3-Why	it survived every candidate gate
L6510	§3-THE	FIX IS MECHANICAL — the tool already holds the answer
L6518	Scope	, measured (do not over-generalise — §80)
L6528	§3-Two	ladder lessons banked with it
L6539	§85	The RETURN-axis fleet widen is ALL-OR-NOTHING: widening the shared header alone guarantees
L6544	§3-The	conflict
L6552	§3-THE	FAILURE MODE — widening only engine_core.h is worse than not starting
L6559	§3-The	precondition, and how to check it in one grep
L6567	§3-Do	the WHOLE axis in one edit, then R22 once
L6576	Reading	, for the next person
L6589	§86	Pinned-exemplar templatability is a PER-FAMILY property, not a per-member rate; and the §4
L6591	§3-The	guard refuses a class that largely works
L6600	§3-THE	LAW: all-or-nothing PER FAMILY
L6627	§3-Why	the two live families differ from the three dead ones — the open question
L6633	§87	match_one COMPILES but never LINKS, so an unresolvable data symbol reads as MATCH; and s
L6649	§3-The	blindness ladder, now complete — FOUR classes match_one cannot see
L6659	Consequence	for the backlog ledger
L6666	§3-The	cheap discriminator, before spending a sweep
L6674	§88	cross_jump will not merge a common suffix containing a CALL; and §78 is scoped to ORDERE
L6679	§88a	repeated CALL-shaped blocks are left UNMERGED; call-free tails are merged for you
L6686	§88b	the slti literal-position law (extends §78 to comparisons)
L6701	§88d	BANKING ORDER: run the §81 carve chain BEFORE banking, never after
L6708	§88e	a wrong diagnosis, refuted properly (the model for how to treat an inherited lever)
L6718	§88f	the missing rung: a RELOCATION gate between match_one and the binary
L6726	§89	Two throughput rules the project already had written down and was not following (Phase 29
L6732	§89a	MEASURE the write set; do not assert its tier (tools/blast_radius.py)
L6745	§89b	the parallel gate farm existed; the family path could not reach it (`tools/sweep_parallel.
L6758	§3-The	standing sequence
L6766	§90	Five tool-integrity laws from one session, each of which changed an answer (Phase 29 SESSI
L6772	§90a	A comparison tool MUST share its reference oracle's index space, exactly
L6789	§90b	"Byte-neutral" is not "wanted": undo on the SUCCESS path too
L6799	§90c	A library-callable function must FAIL CLOSED on an unconfigured module
L6810	§90d	Do not measure a live wave's drafts (§87 in real time)
L6818	§90e	An agent's CONCLUSION and its EVIDENCE fail independently — re-derive the premise, not the
L6842	§91	A structure-TRANSFER is only valid where the structure corresponds: the --like role trap
L6871	§3-The	three-hypothesis trail, because two of them were wrong and the wrongness is instructive
L6891	§92	Conforming a DECLARATION: pointer changes are caller-neutral, scalar-WIDTH changes are not
L6922	§93	set -o pipefail attributes a pipeline failure to the LAST stage, not the failing one (Ph
L6947	§94	A family sweep's 0/N is a TYPE-CARRY failure until proven otherwise: lift the exemplar's
L6983	§95	reconcile_tu dropped the SIBLING declarators of a multi-symbol extern line (Phase 29 S
L7018	§96	The same rewrite, one shape down: reconcile_tu matched statements to lines by TEXT, so e
L7066	§97	The gate's own tree hygiene: a refused carve, an unchecked recovery, and a snapshot that c
L7113	§98	conform_decls had three defects, and only the third needed R22 to find (Phase 29 SESSION
L7167	§99	The narrow-param wall is a DEF-side problem with a ZERO-blast-radius fix: convert the defi
L7190	§3-Two	reconcile_tu bugs found underneath, one introduced while fixing the other
L7216	§100	Prefer the DRAFT-LOCAL fix: a type only one function uses belongs in its BODY, not in a sh
L7245	§101	The STALE DEFAULT class: a guard whose cause was removed is a silent skip wearing a safety
L7272	§102	A PLUMBING verdict can MASK a DIFF; and K&R is not always a codegen change (Phase 29 SESSI
L7307	§103	A FILE-scope extern in a shared overlay TU is a GLOBAL constraint on every LATER functio
L7395	§104	Two silent-skip defects in one scan: match on MASKED text, emit from the ORIGINAL (Phase 2
L7431	§105	A gate's revert must survive an EXCEPTION, not just a failure (Phase 29 T53, `jtbl_family_
L7470	§106	Persist the MEASUREMENT, derive the POLICY: a stored route let a stale file out-vote the l
L7513	§107	A lever wired into ONE gate path is a lever most families cannot reach (Phase 29 T56, `fun
L7551	§108	Diagnosing a family 0/N: the four causes, and the third opt-in lever (Phase 29 T59)
L7600	§109	Conforming a definition to a shared header: fix the NAMES, then check the RETURN precondit
L7640	§110	A unit must define exactly ONE function, and "ends in ;" does not tell you which line de
L7681	§111	The distinct-code metric is not noisy: a family pays it only if its members are byte-VARIA
L7730	§112	A macro-scoped declaration only collides where the macro is INSTANTIATED (Phase 29 T67/T69
L7776	§113	An ARITY blocker only exists if the macro CALLS the function; an address-taken use has no
L7808	§114	The THIRD decl axis: a CALLEE the draft declares differently from the target TU (Phase 29
L7850	§115	A func_XXXXXXXX predicate rots by design: the same name-form assumption in THREE places
L7877	§116	Optimization level is a property of the FILE, not the function: read a family 0/N against
L7895	§3-The	fix moves the DEFINITION, not the stub — and here is why the obvious shortcut fails
L7926	§117	Spell the sibling's symbol from the SIBLING's address, not the exemplar's kind (Phase 29 T
L7953	§3-Why	it survived so long: a MASKED oracle will MATCH a wrong symbol
L7963	§118	Ordinal (positional) immediate resolution: compare C tokens to the DIFFERING asm uses (Pha
L7997	§119	Two levers on the SAME axis, opposite directions: test the off-diagonal (Phase 29 T89)
L8026	§120	Uniquify draft-defined TYPE names; and check which of N staging sites you actually patched
L8037	§3-Do	NOT "strip the duplicate typedef" — it breaks the extern that uses it
L8043	§3-The	wiring trap that cost two attempts
L8061	§121	Synthesise externs for macro-DEFINED callees from the macro's own definition head (Phase 2
L8084	§122	GATE RAW BEFORE TRANSFORMING; the undo belongs to the WRITER, as a per-edit journal (P30 T
L8116	§123	PROPAGATE A FAMILY WITH THE TOOL ITS TIER NEEDS: dedup_propagate is h_exact-only; its re
L8153	§124	A "not matched" verdict can mean the definition is there under a DIFFERENT C NAME: the asm
L8198	§124a	a family sweep's 0 matched-exemplar families may be a FILTER, not a wall
L8206	§125	Split the CARVE from the BODY before calling a jr residue a wall — and measure it by SHA f
L8213	§3-The	method (keep this)
L8223	§3-The	instrument rules that make its answer trustworthy (this is where I failed)
L8238	§3-The	corrected results (each SHA-verified, from a clean tree, restore re-verified)
L8248	§3-Two	further notes worth keeping
L8257	§3-The	meta-lesson
L8264	§126	The carve-within-a-carve: an ADDRESS RANGE is not an OPTIMIZATION REGION (P30 T2, byte-pro
L8279	§3-The	finding: opt level is per FILE, so the file's contents must be opt-HOMOGENEOUS
L8290	§3-The	instrument trap that hid it (and it is §124's shape again)
L8299	§3-The	mechanics
L8317	§126a	a bare except: continue around a coverage-asserting oracle re-creates the silent skip (P
L8349	§127	The -O0 regime: the CONSTANT-OFFSET FOLD, and why -O0 needs its own idiom set (P30 T3
L8356	§3-The	idiom they kept re-deriving: the constant-offset fold
L8367	§3-The	rest of the -O0 regime (write PLAIN C, and mean it)
L8377	§127a	§71 (sibling-first) is the strongest -O0 lever, and it beats the index
L8386	§127b	the knowledge was in a SOURCE COMMENT, not the cookbook
L8393	§128	A raw NUL in C source makes grep SILENTLY SKIP the file (P30 S28, 137 files)
L8425	§128a	a negative control must corrupt a SCRATCH COPY, never the tracked file
L8437	§129	Post-carve, rtu_match/match_one COUNT THE JUMP TABLE AS INSTRUCTIONS; and a carve must
L8441	§129a	the target instruction count is INFLATED after a carve
L8462	§129b	never commit a carve whose owner is still a stub (it strands the carve)
L8477	§3-The	real blocker underneath, for the record
L8486	§130	An INCREMENTAL build can report BYTE-IDENTICAL for a change the CLEAN build cannot even LI
L8523	§3-The	diagnostic ladder that finally located it (reusable)
L8533	§131	The jtbl OVER-SPAN: sltiu N is ground truth in BOTH directions, and the zero-word rule o
L8570	§132	The JR-PAIR-IN-ONE-O0-OBJECT "wall" was TWO instrument defects: a merged-double span the
L8579	Defect	1 — a pre-§8e MERGED DOUBLE is not a single-table predecessor
L8597	Defect	2 — as writes a corpse and nothing deletes it
L8607	§3-The	fingerprint, and the 30-second ladder that found it
L8628	§3-The	transferable rule
L8635	§132a	--like is for a sibling with NO record; against one that HAS a record it over-derives (P
L8660	§132b	When the span's already-matched owner is ITSELF multi-switch: --span-rel (P30 S1, `func_
L8685	§133	The DEFAULT-FILTER class: three times in one session, a tool silently answered a narrower
L8711	§134	MULTI-LINE BLINDNESS: one root cause, four faces, in family_remap's preamble scanner (P3
L8765	§135	Six byte-verified gcc-2.7.2 idioms from the P30 S6f-h waves (and the two-lane wave shape t
L8770	§3-The	codegen idioms
L8804	§3-The	integration idioms (these decide whether a byte-correct draft BANKS)
L8819	§3-The	wave shape that produced these
L8837	§136	The LOCAL-VARIABLE lever: how many C locals, at what scope (P30 wave 4a, 25 byte-verified
L8853	§3-The	splitting/merging rules (each closed a residual, byte-gated)
L8879	§3-The	type-form rules
L8912	§3-The	scheduling rules (refining §135-2 and §135-4)
L8941	§3-The	declaration surface (integration, not codegen)
L8953	Wave	economics (measured, for the next batch's sizing)
L8976	§136a	Blocker capture: classify on the OUTPUT, never on the exit status
L9033	§136b	A prior wave's "genuine byte-DIFF" verdict is NOT reliable evidence (4 of 4 refuted)
L9069	§136c	SIBLING-FIRST is a DERIVATION shortcut, not just a conflict fix (the fastest route in a fa
L9094	§136d	Four gcc-2.7.2 levers the redraft lane found (each closed a residual no other lever moved)
L9138	§136e	§136c's PRECONDITION, and two more symptom keys (wave 4b batch 3)
L9186	§136f	Two declaration sub-cases the reconcile lane surfaced (lane now 15/15 lifetime)
L9211	§136g	When the index points at the WRONG lever: two byte-refuted routings (func_801863B4)
L9240	§136h	CORRECTION: the zero-crack pool does NOT "refill with cheap work" (my error, byte-measured
L9270	§136i	The drafter model LADDER: Haiku → Sonnet → Opus → Fable5 (Drew, 2026-08-03)
L9302	§136j	The failure MIX flips with function size (measured across four bands, one session)
L9344	§137	REGALLOC-PERM is a TWO-COMPILE ARITHMETIC PROBLEM, not a permuter job
L9386	§137a	A gate verdict has a TIMESTAMP; re-check it against the draft's mtime
L9415	§138	The propagation lanes: a gate refusal is a DECLARATION, and which lever you owe depends on
L9421	§3-The	triage, cheapest first
L9473	§3-The	DEFINITION-side alias is the only escape when the fleet canon disagrees on a promoting par
L9481	Rank	the lane by measured concentration, not by class count
L9490	THREE	carry variants hide in one "CARRY-FIXABLE" bucket — and they need different fixes
L9526	§134	again, in a second tool — and the waiter rule corrected
L9546	STEP	0 of sibling-first: grep src/ for a distinctive LITERAL from the .s
L9565	Reconciling	a gate-refused draft: which way you edit depends on WHERE the TU's decl is
L9594	§139	A GATE THAT GREPS FOR VERDICTS MUST ASSERT 1:1 ACCOUNTING; and a --src filter must not s
L9626	§3-The	generalisation — three corollaries worth more than the bug
L9643	§3-And	the inverse-lookup trap, same session
L9660	§140	A METRIC IS NOT A MEASUREMENT UNTIL IT IS REPRODUCIBLE FROM THE COMMITTED TREE (P30 S1e: a
L9680	§3-The	three-line proof (do this before diagnosing any metric movement)
L9689	§3-The	two instrument defects it exposed
L9709	§3-The	same swallow, twice more, in the integration spine
L9720	§3-Two	wrong mechanisms I chased first, and why they were wrong
L9740	§141	The §134 class is CLOSED: every line-shape decision now routes through cdecl._mask (P30
L9778	§142	An open stub whose h_exact class is MATCHED elsewhere is FREE. Propagate the body; do no
L9790	§3-The	measurement (do this before any wave; it is ~20 lines and needs no builds)
L9805	§3-The	trap that hid it — SAME FUNCTION, TWO ROUTES, ONLY ONE IS FREE
L9814	Route	selection (why --addr sometimes says "nothing changed")
L9822	§3-And	the report-vs-bytes lesson attached to it
L9834	§143	cast_call_sites read a RETURN STATEMENT as a prototype and deleted it. A 0/39 sweep beca
L9888	§144	THE LITERAL'S SPELLING PICKS THE IMMEDIATE ENCODING (P30 S40 wave 1, func_801822E0)
L9927	§145	Three loop/combine levers from the S40 wave-2 drafters (16/16 match_one)
L9977	§146	RE-MEASURE A WALL BEFORE YOU RESPECT IT. Both "permanent" giants fell to drafts already on
L9988	§3-Why	a correct draft can read as an intrinsic wall
L10000	Then	propagation returned 0/137 TWICE — both times a missing TYPE
L10009	§3-Two	errors of mine, both instructive
L10023	§3-The	rule
L10036	§147	The three-stratum FRAME LAW, and four "stop searching" verdicts (P30 S42, func_8017C294,
L10041	§3-A.	The frame has THREE strata, and stratum 3 is unreachable from C
L10057	§3-B.	A ?: on MEMORY operands costs ~16 bytes of invisible frame; on REGISTER operands, zero
L10068	§3-C.	Inner-block declaration does NOT delay slot allocation — BYTE-REFUTED
L10073	§3-D.	A lone $t8/$t9 in the target is RELOAD SCRATCH — reproduce the spill, don't pin the re
L10083	§3-E.	A qty_compare TIE is not spelling-reachable — recognise it and stop
L10095	Consequence	for the family (a real scheduling decision)
L10145	§148	The loop.c hoisting THRESHOLD is arithmetic you can compute, and the ?: clamp that folds
L10151	§3-A.	move_movables hoists iff threshold × savings × lifetime ≥ insn_count — and you can rea
L10170	§3-B.	(v < 0x40) ? v : 0x3F is folded to MIN_EXPR and expands to the WRONG SHAPE
L10184	§3-C.	A zero-byte ALLOCNO-PRIORITY slider
L10194	§3-D.	Reproduce the original's BUGS verbatim
L10243	§149	Four instrument defects in one session, and the two questions they were hiding (P30 S43)
L10249	§3-A.	A prep step that returns its input on failure is indistinguishable from a search that foun
L10267	§3-B.	Same address + same name ≠ same body — and the ledger keys on address
L10283	§3-C.	make: *** [...] Error N is a summary, never a diagnosis
L10293	§3-D.	"Cheap fuel" that was never probed: 0 of 31 templatable
L10312	§150	A register ROTATION across symmetric blocks is VARIABLE-IDENTITY evidence, not an allocato
L10319	§3-The	fix
L10329	§3-The	method that found it (this is the transferable part)
L10345	§3-Two	corrections to the record
L10356	Diagnostic	order (adopt this)
L10367	§151	THE GHOST WEDGE: when a load-before-store transposition is unreachable by ANY statement or
L10372	§3-The	mechanism (read from cc1's own -dR trace, not inferred)
L10387	§3-The	lever — a zero-emission insn that absorbs the blocked tick
L10395	§3-The	two fallouts, and how to close them (both measured, in order)
L10407	When	to reach for it
L10418	§152	BYTE SIZE is the family key that name- and h_seq-grouping both miss (P30 S43, the 0xECC fa
L10423	§3-The	finding
L10432	§3-The	key
L10443	§3-Two	cautions that must travel with this technique
L10454	§3-The	companion defect (open)
L10466	§153	THE ADDRESS-REMATERIALISATION LAUNDER: a third zero-emission asm lever (P30 S43, `func_801
L10474	Symptom	Symptom
L10479	Mechanism	(gcc source + RTL dumps, not inferred)
L10486	What	does NOT work (14 byte-measured probes)
L10492	§3-The	cure — a fresh launder per site, each in its own block
L10502	Companion	levers from the same function
L10522	§154	Reading a disc payload: the module-id word, static base derivation, and "type 1 = uncompre
L10527	§3-A.	Payload word0 is a global MODULE ID; code starts after the header
L10536	§3-B.	Two static base-derivation methods that must AGREE (use both)
L10548	§3-C.	PAC type 1 = the same payload class as type 4, just NOT compressed
L10558	§155	hi/lo literal scanning MUST track base registers (S45)
L10567	§155a	the same failure class, one level up: SHAPE-blind table scanning (S45 p5)
L10587	§155b	check the TYPE your oracle returns before comparing against it (S45 p5)
L10610	§155c	the ZERO-REFERENCE trap: gcc splits a global-array address across the lui and the LOAD (
L10640	§156	an ORPHANED reconcile poisons the fleet: dedup_propagate's kept edit (S45 p6/p7)
L10687	§157	the cheap-tier size cliff, measured (S45 p6)
L10712	§158	The RANGE-EXTENDER: a fourth zero-emission asm lever completes the allocno toolkit (P30 S4
L10721	Symptom	Symptom
L10727	§3-Why	the fork is chained (gcc source, validated insn-by-insn against -dS/-dR dumps)
L10740	§3-The	method (dump-arithmetic first, then place — no probing)
L10757	Bonus	facts worth keeping
L10772	§156	THE PREFERENCE-DONOR MERGE: cross-region variable reuse is what fills a0-a3, and a call-ar
L10828	§159	THE DECLARATION AXIS: conform to byte-truth, and make every guard state its COVERAGE (P30
L10893	§160	THE REACH-15 WAVE HARVEST: an align-1 block move, and the instrument that called it a wall
L10969	§161	THE RETRY-WAVE HARVEST: a jump table indexed from zero, and two allocator traps (P30 S47)
L11014	§162	S48 WAVE-1 HARVEST (P30, 2026-08-11): the reach-ordered sibling campaign's first 12 target
L11041	§162a	SHARPENS (sharpens §161a, §131, §8a-pad, §129a)
L11070	§162b	SHARPENS (sharpens §48-A3, §156, §150, §76)
L11099	§162d	SHARPENS (sharpens §31, §21, §30, §55a)
L11141	§162e	NEW
L11143	§162	THE LICM PAIR: what makes an address a movable AT ALL, and why the preheader order is the
L11209	§162f	SHARPENS (sharpens §42d, §41d, §73, §10)
L11264	§162g	NEW
L11266	§162	CROSS-JUMP DIRECTION: the surviving copy is always the LATER one, so a BACKWARD j into a
L11300	§162h	SHARPENS (sharpens §88, §88a, §50-B, §8)
L11302	§162	The cross-jump "CALL veto" is a COUNT law, not a CALL law (BOUNDS §88a; P30 S48, `func_801
L11368	§162i	SHARPENS (sharpens §135, §21, §42, §32)
L11393	§162j	SHARPENS (sharpens §25, §136d-1, §48-B, §46-L2)
L11422	§162k	SHARPENS (sharpens §1-I2, §12, §160d, §21)
L11485	§162l	SHARPENS (sharpens §48-B, §48-C1, §20, §21)
L11540	§162m	SHARPENS (sharpens §36, §158, §148, §153)
L11542	§158a	THE FIFTH LEVER IS NOT AN ASM: do { } while (0) is a REGION ref-multiplier you MINT (P30
L11549	§3-The	law
L11560	Size	it before you write it (§158 step 1-2, applied)
L11581	§3-The	wrap BOUNDARY is the dial — and it is indiscriminate
L11587	§3-Not	a pure dial
L11591	DIAGNOSTIC	TELL — two faces, one law
L11613	§162n	NEW
L11646	§162o	SHARPENS (sharpens §158, §136-1, §136-6, §79)
L11705	§162p	SHARPENS (sharpens §48-B, §46-L2, §156, §136d-1)
L11722	§162q	SHARPENS (sharpens §30, §30a, §135-2, §136-13)
L11760	§163	S48 WAVES 2-3 HARVEST (P30, 2026-08-11/12): the five that were byte-probed and are actiona
L11828	§163z	THE UNVETTED REMAINDER (do not cite as law; each needs a dedupe pass)
L11848	§164	S48 §163z SKEPTIC PASS (P30, 2026-08-12): 190 claims vetted, 82 banked
L12300	§16Xy	SHARPENS (sharpens §136d-3, §37 /s-DEP LATTICE, §135-2, §136-13, §162q)
L12302	§3-The	/s drop clause is in ALL THREE dependence predicates, so the FIXED-ADDRESS STORE is what
L13623	§164z	REFUTED CLAIMS: do NOT re-derive these
L13689	§165	S48 WAVE-4 HARVEST (P30, 2026-08-12): banked the same day the wave landed
L14340	§16Z	SHARPENS *(sharpens §37 "the /s-DEP LATTICE", §136-13, §136-14, §16Xy, §162q, `gcc-2.7.2-
L14342	§3-The	ADDRESS-CLASS TABLE: which load/store pairs even REACH the /s clause (P30 S48 wave 4, `f
L14858	§165z	REFUTED THIS WAVE: do NOT re-derive
L14902	§166	THE DESTINATION-TU ORACLE (P30 S48): the seven-attempt bug that was never codegen
L14958	§167	S48 WAVE-5/6 HARVEST (P30, 2026-08-12): the saturation point
L16154	§167z	REFUTED IN WAVES 5/6: do NOT re-derive
L16211	§168	THE COUSIN TIER (P30 S49, 2026-08-12): h_seq's exact-hash brittleness, measured — and the
L16263	§169	THE MICRO-ADAPT LANE (P30 S49): edit a proven body, don't crack a new one
L16310	§170	THE A-PROP WORD-DIFF CARD (P30 S49): the lane that had no owner
L16354	§171	THE STALE SEED SYMBOL (P30 S50, 2026-08-13): why §170's 91%→57% was never codegen
L16420	§171a	THE MECHANICAL A-PROP DRAFT (P30 S50): 256 members banked with no agent in the loop
L16470	§171b	THREE CARRIES THE MECHANICAL DRAFT NEEDS (P30 S50, banking the top-reach families)
L16503	§172	THE ORPHAN-SLOT MECHANISM v2 (P30 S50-Max): the complete frame-residue model for gcc-2.7.2
L16557	§172a	TWO DECOMPILATION TELLS FROM THE SAME DIG (P30 S50-Max)
L16573	§172b	THREE MORE TELLS FROM THE GCC READ (P30 S50-Max, banked on Drew's ask)
L16616	§173	THE STORED-PLUMBING RECOVERY RECIPE (P31 T6): symfix-first, per-group isolation, and where
L16652	§174	THE ADAPT-CARD WAVE RECIPE (P31 waves A/B, 2026-08-14): prevention beats recovery
L16722	§175	A CALLER-SAVED REGISTER PIN CAN BE A CORRECTNESS BUG, NOT JUST A SCHEDULING CHOICE (P31 wa
L16747	§176a	THE VERIFICATION-LAYER LAWS (P31 overnight, 2026-08-15). What each check can and cannot pr
L16787	§176b	BATCH-GATING MECHANICS (P31): what changes when N drafts land in ONE .c
L16813	§176d	THE CONFLICT TABLE MUST BE SEEDED FROM THE TU, AND KEYED PER FILE (P31 S52, 2026-08-15)
L16852	§176e	SYMBOL IDENTITY IS COMPUTABLE OFFLINE (P31 S52): tools/reloc_identity.py
L16909	§176f	THE DECLARATION FORM IS A MATCHING LEVER, SO RECONCILE TOWARD THE FORM THE MATCH NEEDS (P3
L16940	§176g	SIZE A WAVE BY INSTRUCTIONS, NOT BY CARDS (P31 S52 — the adopted doctrine)
L16978	§176h	THE BATCH-SUBSTITUTION HAZARD MAP (P31 S52): seven holes, three wrong fixes, one law
L16986	§3-A.	The seven under-reporting holes (all in gate_main, all the same shape)
L17004	§3-B.	Typedef handling — the only strategy that survives contact
L17026	§3-C.	The limit that remains (recorded, not solved)
L17033	§3-C2.	RECONCILE BEFORE THE FIRST GATE — a parked draft gets HARDER to bank, not easier
L17056	§3-D.	The measured cost shape, and what to build next
L17074	§176i	WHAT A STATIC PRE-GATE CHECK CAN AND CANNOT PROVE (P31 S52, wave Q)
L17106	§176j	STOPPING A WAVE MID-FLIGHT COSTS THE IN-FLIGHT TAIL (and how much is recoverable)
L17132	§176j-2	THE REPAIR PASS, MEASURED (do this instead of resuming)
L17152	§176k	TWO SELECTOR BUGS THAT SILENTLY SHRINK A WAVE
L17169	§177	🔴 THE EPILOGUE RETURN-DELAY SLOT IS DECIDED BY YOUR SAVED-REGISTER SET, NOT BY SCHEDULING
L17226	§178	SIX LEVERS MINED FROM THE WAVE-P JOURNALS (P31 S52), each byte-proven and source-cited
L17238	§3-A.	THE $0-ADD OPAQUE COPY defeats make_regs_eqv (func_80033398, 93 ins)
L17254	§3-B.	A return <const> IS A PRIORITY-1 HARD-REG SET THE SCHEDULER PLACES FIRST (func_8001BE30,
L17267	§3-C.	SINGLE-SET TEMPS GET THE BIRTHING BOOST (func_8001D3FC, 196 ins)
L17275	§3-D.	A NARROW TYPE BLOCKS COPY ELISION (func_8001D3FC — new idiom)
L17282	§3-E.	THE ZERO-OFFSET ALIAS HOLE (func_80037028, 71 ins)
L17291	§3-F.	MEM_IN_STRUCT_P ASYMMETRY IN true_dependence (func_80037144, 124 ins)
L17297	§3-G.	TWO MODELLING TRAPS THAT COST THESE AGENTS SWEEPS OF HUNDREDS OF COMPILES
L17313	§179	IDIOMS MINED FROM THE WAVE P/Q JOURNALS (P31 S52, harvest pass)
L17323	§179-A	🔴 A LOOP-WALKED POINTER PARAMETER HANDS ITS ARGUMENT REGISTER TO THE GIV (9 byte-proof
L17372	§179-B	🔴 THE HAND-WRITTEN-ASM TRANSCRIPTION CHECKLIST (maspsx + masked_diff; 10 byte-proofs)
L17422	§179-C	🔴 A FUNCTION WITH NO EPILOGUE (falls into a sibling's shared tail) MUST BE FILE-SCOPE `__a
L17473	§179-D	gte_stflg MUST CLOBBER "$12" OR THE WHOLE TEMP FILE ROTATES BY ONE
L17493	§179-E	A >2*MAX_MOVE_BYTES BLOCK COPY IS A STRUCT ASSIGNMENT, NOT A HAND LOOP
L17519	§179-F	PINNING A LOOP-WALKED POINTER IS A TOTAL OFF-SWITCH FOR STRENGTH REDUCTION
L17542	§179-G	🟡 A PIN CAN CREATE A COMBINE LOG_LINK AND DELETE AN andi (sixth RC-5 channel, n=1)
L17569	§179-H	A MID-BODY .global LABEL PAIR SLICES A BYTE-COMPARABLE FRAGMENT OUT OF A LARGER ROUTINE
L17592	Considered	and NOT banked
L17609	§176c	MAIN (SLUS_007.26) CANNOT BE GATED INCREMENTALLY
L17620	§176	SEVEN LEVERS FROM THE P31 OVERNIGHT WAVES (2026-08-15): statement order, false regalloc, a
L17626	§176-A	"SCHEDULE / DELAY-SLOT / LENGTH-DRIFT ±1" ⇒ check STATEMENT ORDER around the call first
L17650	§176-B	"REGALLOC-PERM, 1-4 instructions off" ⇒ it is usually NOT register allocation
L17690	§176-C	🔴 WALL REFUTATION: a hard-register pin CANNOT schedule around a call, because of a genuine
L17716	§176-D	CSE-class levers used in reverse (two sharpenings of §153 and cse_expr §2)
L17742	§176-E	Two cheap source spellings, both cc1-probed
L17764	§176-F	Misdiagnosis triage: four residual verdicts that were lying
L17781	What	is NOT banked here
L17794	§180	THE LEFTOVER-DRAFT HARVEST: RE-VERIFY WHAT YOU ALREADY HAVE BEFORE DRAFTING ANYTHING NEW
L17823	§180b	WHAT THE PRE-GATE LADDER ACTUALLY FINDS IN A COLD PILE (the shape of integration debt)
L17842	§180c	WHEN A BINARY'S MASS BAND IS SPENT, THE FLEET-WIDE DRAW IS STRICTLY BETTER
L17860	§181	WHAT A WAVE'S GATE ACTUALLY REJECTS (P31 S53, measured on wave R's 45-draft main pile)
L17861	Only	ONE of 27 blocked drafts was wrong. The other 26 were correct and unbankable.
L17916	§182	§177's HONEST NEGATIVE: the epilogue lever cracked 4 of 16, and the 800c3 cluster held
L17930	§180d	THE pgrep BRACKET TRICK PROTECTS THE PATTERN, NOT THE COMMAND LINE
L17942	§183	THE DECLARATION-RECONCILIATION PLAYBOOK (P31 S53, measured on 20 byte-verified drafts)
L17943	§3-18	of 20 reconciled while keeping the match. The two that did not are mechanism, not effort.
L18013	§184	COMMENT-BLINDNESS IS A DEFECT CLASS, NOT A BUG (P31 S53: three tools, one root cause, one
L18041	§185	EDIT THE SIDE THAT IS CHEAP TO VERIFY, AND CHECK A TU RETYPE AT ITS USE SITES
L18073	§186	CROSS-JUMPING RUNS AFTER SCHEDULING, SO NO C-LEVEL BARRIER CAN STEER IT
L18094	§186b	A NO-SAVE 16-BYTE FRAME IN A LEAF FUNCTION MEANS s16 LOCALS, NOT A HIDDEN CALL
L18102	§186c	WHERE A VALUE IS LOADED DECIDES WHICH ALLOCATOR OWNS IT, AND THEREFORE ITS REGISTER
L18119	§187	🔴 "SAME SOURCE" IS NOT "SAME OBJECT": THE SDK BUILD AND THE GAME BUILD DISAGREE ON GTE NOP
L18157	§188	🔴 THE jr $ra + addiu $sp TAIL IS AN ASSEMBLER ARTIFACT, NOT A FRAME SHAPE
L18207	§189	FIVE COMPILER LAWS MINED FROM THE WAVE R/S JOURNALS (P31 S53), each source-cited and re-de
L18282	§190	THREE PRESCRIPTIONS FROM THE SAME HARVEST (weaker evidence than §189, honestly labelled)
L18319	§191	WHAT THIS HARVEST DID NOT BANK (4 rejected, 4 narrowed) — recorded so it is not re-der
L18341	§192	THE PRE-GATE LADDER WAS MAIN-ONLY, AND NOBODY COULD SEE IT (P31 S54)
L18342	Three	defects in one call path; the overlay slates that carry most of the wave work were being w
L18406	§193	THE WAVE-T HARVEST (P31 S54): 71 index_gap reports -> 9 laws, 5 rejected, 61 already-cover
L18423	§193-A	The wave card ships only OPEN-set pointers and discards the atlas's BANKED one — `exemplar
L18490	§193-B	A NARROW CAST OF A WIDE PARAMETER COSTS ONE EXTRA INSTRUCTION WHEN ITS STATEMENT SITS AFTE
L18528	§193-C	gcc-2.7.2 cross_jump merges the SCHEDULED common SUFFIX only — there is no prefix/head mer
L18562	§193-D	A COMPILER-GENERATED ARGUMENT COPY IS A optimize_reg_copy_1 TRIGGER: when the pointer's
L18633	§193-E	A varying-address (pointer) load is re-emitted once per CSE-LIVE INTERVAL, and naming it i
L18663	§193-F	§148-A2 — The threshold -= 3 STAIRCASE: move_movables admits a COUNT of invariants, no
L18727	§193-G	§164-54's "scope to ≥4 arms" bound is byte-wrong — the dispatch-topology oracle goes live
L18788	§193-H	A pointer-derived base load *(s32*)(p+K) is uncacheable across ANY memory write or call
L18828	§193-I	A DECLARED AGGREGATE LOCAL HAS AN 8-BYTE FRAME STRIDE — CEIL(size,8), NOT size. N ARRAYS T
L18887	§193-REJECTED	what this harvest did NOT bank (recorded so it is not re-derived)
L18914	§194	THE WAVE-U HARVEST (P31 S54): 64 index_gap reports -> 14 laws, 5 rejected, 44 already-cove
L18931	§194-A	A zero-byte scheduling fence goes AFTER the defining statement to make that computation em
L18997	§194-B	A addu $rA,$rB,$zero copy feeding ≥2 sh stores is a SECOND, 16-BIT-DECLARED local — th
L19035	§194-C	A CALLER-SAVED loop counter proves its live range crosses ZERO calls — so it cannot share
L19098	§194-D	Declared width of a computed-value local is a sched1 dial (count-neutral) — a replication
L19139	§194-E	The wave card's exemplar is the TARGET ITSELF on 42/73 wave-U and 36/71 wave-T cards — a
L19176	§194-F	if ((*p = v = f()) == 0) is an expand-time pseudo SPLITTER (store_expr's `want_value &&
L19249	§194-G	Reading the integer half of a 16.16 stack aggregate: REGISTER-LIVENESS, not the C spelling
L19292	§194-H	§164-29's WAR fence runs again at SCHED2 ON HARD REGISTERS: an in-place v &= K before a
L19330	§194-I	§16N+2's magic-per-odd-part ladder has exactly one broken row — read the divisor arithmeti
L19373	§194-J	Back-to-back identical stores: flow.c's last_mem_set deletes the first, and only `volati
L19425	§194-K	Blind sched1's alias oracle with a second SET of a pointer pseudo — the first zero-byte, n
L19503	§194-L	§88b and §189-E are BOTH half-wrong, but not the way the candidate says: the compare-const
L19551	§194-M	A STORE in a CONDITIONAL branch's delay slot proves its C statement DOMINATES the branch —
L19606	§194-N	§193-D's C dial is misstated: the lever is a SURVIVING CODE_LABEL (a label with a real inc
L19666	§194-REJECTED	what this harvest did NOT bank (recorded so it is not re-derived)
L19687	§195	THE WAVE-V HARVEST (P31 S54): 67 index_gap reports -> 14 laws, 9 rejected, 76 already-cove
L19701	§195-A	§167-08's "an $aN READ before the jal is scratch" has a byte-proven FALSE-NEGATIVE class:
L19772	§195-B	A CALL_INSN does not start a basic block in gcc-2.7.2 — so a call-crossing temp can be a L
L19814	§195-C	A call-argument %hi/%lo pair sitting at the block head, far above its jal, is a load-d
L19862	§195-D	§195 — masked_diff.mask_for returns 0 for EVERY j/jal word, so an internal j desti
L19930	§195-E	A 0/1 materialised at a JOIN immediately before the controlling beqz/bnez proves the s
L19988	§195-F	fold-const.c:4825 canonicalises a ?: whose THEN arm is zero (or constant against a non-c
L20040	§195-G	§NEW — TWO ARMS CALLING THE SAME CALLEE MERGE INTO ONE jal UNLESS EACH ARM'S OWN CODE CO
L20088	§195-H	§165-27g — ON A FIXED-SYMBOL GLOBAL, extern T D[]; + D[0] IS THE CSE RELOAD DIAL, AT Z
L20135	§195-I	§145(b) AMENDED — the pointer-bump addiu is saved by cse, not combine: ANY second SET of
L20200	§195-J	GTE / PsyQ op CALL-vs-INLINE is a PER-SITE SOURCE FACT, not a TU style — both forms coexis
L20244	§195-K	At -O2 the §18 array-of-struct lever is a FRAME lever, not a length lever — but only when
L20296	§195-L	The cse store-re-seed does not cross a JOIN LABEL: per-arm stores + a join read keep the r
L20343	§195-M	Frame vars is a SEQUENTIAL bump-allocation, not a flat sum: §193-I's CEIL(aggregate,8) t
L20392	§195-N	In a call-bearing chain of N≥2 if (f(...)) return 1; tests closed by return 0;, the LA
L20439	§195-REJECTED	what this harvest did NOT bank (recorded so it is not re-derived)
L20485	§196	PUT ON THE CARD WHAT THE TREE ALREADY KNOWS: the fleet's declaration consensus (P31 S54)
L20540	§197	THE WAVE-W HARVEST (P31 S54): 68 index_gap reports -> 4 laws, 3 rejected, 41 already-cover
L20554	§197-A	A NARROW SIGNED MEMORY READ FEEDING A CONSTANT >> LOSES ITS lh, AND THE CURE IS AN ASM
L20592	§197-B	A REPEATED COMPARE OF ONE VALUE AGAINST ONE CONSTANT IS DELETED BY cse's `qty_comparison_c
L20620	§197-C	Fix A1 (operand order) cannot move a commutative destination whose .greg conflict set alre
L20665	§197-REJECTED	§197-REJECTED
L20680	§199	THE WAVE-X HARVEST (P31 S54/S55): 63 index_gap reports -> 7 laws, 2 rejected, 56 already-c
L20691	§199-A	§189-A's asm→source inference is byte-FALSE: an interloper between a split constant's `lui
L20740	§199-B	A permutation sweep that holds ANY statement fixed is not a sweep: the statement an agent
L20785	§199-C	A NEGATIVE CONSTANT MULTIPLY ALWAYS TAKES expmed's negate_variant — but whether you ever S
L20833	§199-D	A narrow UNSIGNED value compared in an ordered if emits sltiu/sltu; the only dial is
L20893	§199-E	§189-A BOUNDED AND CORRECTED — the discriminator is INSN_PRIORITY, not "is the interloper
L20952	§199-F	§164-36b — THE TARGET-HEAD FENCE IS A DELAY-SLOT THREAD SELECTOR, AND IT ONLY FIRES WHEN `
L21006	§199-G	At TWO case nodes the switch-vs-if oracle is not blind — but the tell is ALL tests positiv
L21061	§199-REJECTED	§199-REJECTED
L21072	§200	THE ALIAS IS THE UNIVERSAL DECLARATION ESCAPE: stop negotiating with the TU's spelling (P3
L21121	§201	THE WAVE-Y HARVEST (P31 S55): 67 gap reports -> 5 laws, 8 rejected, 53 already-covered
L21131	§201-A	§150-B applies to decl_prior's DEF row: for an overlay-window symbol the banked "definit
L21163	§201-B	In a narrowed PLUS/MINUS/AND/IOR/XOR expression the destination pointee is INERT — the sig
L21243	§201-C	§X — A CALL'S OWN DELAY SLOT AND THE UPSTREAM CONDITIONAL BRANCH'S SLOT COMPETE FOR ONE IN
L21294	§201-D	THE SIGNEDNESS OF A div/mod MAGIC IS DECIDED BY THE STATIC TYPE OF THE DIVIDEND TREE AFTER
L21341	§201-E	§194-J-2 — The last_mem_set deletion window is measured in SOURCE/expand order, not in t
L21397	§201-REJECTED	eight, the session's highest
L21422	§202	THE ALIAS CARRIES A DEFINITION, NOT JUST A DECLARATION: the DEF-SIDE-RETURN wall (P31 S56)
L21459	§203	A DEDUPED TYPEDEF MUST PRECEDE EVERY SPLICE POINT, NOT JUST ITS OWN (P31 S56)
L21520	§204	THE WAVE-Z HARVEST (P31 S56): 82 gap reports -> 5 laws, 16 rejected, 30 already-covered
L21539	§204-A	A COMPARE THAT APPEARS BOTH IN A BRANCH'S DELAY SLOT AND AGAIN ON THE FALL-THROUGH IS A JO
L21614	§204-B	A LOOP COUNT THAT ARRIVES ON THE STACK IS DECREMENTED IN PLACE: a fresh counter local can
L21678	§204-C	WHEN A LOCAL BUFFER'S ADDRESS IS PASSED TO A CALL, ITS SIZE IS A FACT ABOUT THE CALLEE'S B
L21736	§204-D	A LOOP-INVARIANT LOAD IS ADMITTED AS A MOVABLE ONLY IF ITS ADDRESS CANNOT TRAP: `local.fie
L21811	§204-E	decl_prior's %hi/%lo ARM HAS NEVER FIRED: the card's promised GLOBAL-TYPE row is 0 of
L21863	§204-CONFIRMED	30 reports that the index already answered
L21957	§204-REJECTED	sixteen, twice the previous record
L22030	§205	THE CHAINED ASSIGNMENT IS ITS OWN SCHEDULING DIAL: *b = *a = v; moves an argument copy t
L22085	§206	THE JTBL-CARVE DRAFTING IDIOM: the bounds check is the entry count, and an EMPTY case owns
L22154	§207	THE WAVE ab–ag HARVEST (P31 S58): 278 byte-banked notes → 25 laws, 103 self-reported no-ga
L22175	§208	TWO NAMED LOCALS FOR ONE RELOADED EXPRESSION BUY TWO ALLOCNOS — the naming granularity own
L22224	§209	THE NARROW LOCAL IS A DIAL IN TWO OPPOSITE DIRECTIONS, AND §194-B's "≥2 sh STORES" BOUND
L22301	§210	THE SINGLE-BIT MASK IN A BOOLEAN TAIL: andi K ; sltu $zero,v vs srl n ; andi 1 is a ST
L22347	§211	HOIST THE LOOP INIT ABOVE THE DOMINATING GUARD: it fills the guard's delay slot AND flips
L22395	§212	THE WALKING CURSOR IS COUNTABLE: *wp++ emits one addiu PER STORE, wp[0..2] emits one
L22440	§213	INDEPENDENT SAME-BASE STORES: THE EMISSION ORDER IS A PERMUTATION OF SOURCE ORDER, AND THE
L22476	§214	THE BANKED TWIN MAY BE A MACRO, A DELETED .s, OR A SEMANTIC INVERSE — six ways a ≥0.9 si
L22522	§215	PIN ECONOMY: the twin's pins are NOT part of the shape, and §17's "pin every call-crossing
L22578	§216	DISTINCT ADJACENT SCALARS vs ONE ARRAY: one lui per access is the tell, and the array de
L22618	§217	DECODING A CALL'S STACK ARGUMENT SLOTS: sw at 0x10/0x14/0x18 are params 5/6/7 **(s
L22644	§218	A NARROW TYPE AT THE ABI BOUNDARY COSTS AN IN-PLACE sll/sra PAIR — on the RETURN as well
L22673	§219	COMPOUND +=, FULL ASSIGNMENT, AND AN EXPLICIT TEMP ARE THREE DIFFERENT SCHEDULES OF ONE
L22700	§220	THE PARAMETER ITSELF IS A REGALLOC DIAL: use it directly, prefer s32 to void*, and pla
L22734	§221	A CONSTANT SHARED BY TWO STORES DIES AT THE CALL WHOSE DELAY SLOT REFILLS ITS REGISTER **(
L22750	§222	SWITCH vs IF-CHAIN, PART 3: source arm order IS emission order, a leading EMPTY case buys
L22792	§223	READING A jal DELAY SLOT: the value in it was produced BEFORE the call, so it is NEVER t
L22854	§224	CROSS-JUMP: WRITE THE DUPLICATE, AND READ A SHARED DELAY SLOT AS THE MERGE SIGNATURE (P31
L22890	§225	THREE CONTROL-FLOW SHAPES NO STRUCTURED SPELLING REACHES (P31 S58)
L22933	§226	FRAME PADS: FOUR WAYS §162i1/§2429's DEAD-LOCAL LEVER MISFIRES (P31 S58)
L22974	§227	TYPE THE SOURCE BY THE LOAD WIDTH, NOT BY THE STORE WIDTH (P31 S58)
L22994	§228	READING THE DIVIDE, PART N: the off-by-one compare is % K == 1, and three more discrimin
L23031	§229	THE ADDRESS IS A VALUE: NAMING IT MOVES THE lui/addiu PAIR — AND §L14410 SAYS THE OPPO
L23080	§230	THE ANCHOR PROBE: with %hi/%lo masked, the surviving addiu deltas tell you which ass
L23095	§231	TRANSCRIPTION AND SEMANTIC-READ HYGIENE: six ways the listing misleads (P31 S58)
L23136	§232	WHEN THE jr DELAY SLOT'S STORE STORES THE RETURN VALUE, TIE THEM WITH ONE PSEUDO **(sing
L23172	§30	addendum (P31 S58) — the /s grant closes a SCHEDULING residual and a REGISTER residual w
L23192	§194-B	addendum (P31 S58) — BOUND 2 is byte-wrong; see §209 Direction A
L23198	§176-B	addendum (P31 S58) — the misdiagnosis direction
L23204	§165-40	addendum (P31 S58) — the barrier goes at the COPY SITE, not inside the region it protects
L23213	§164-63	addendum (P31 S58) — the interposed asm works when the SECOND value is an ordinary assignm
L23222	§193-A	/ §194-E addendum (P31 S58) — where the twin's body actually lives
L23228	§233	THE WAVE aa–bg HARVEST (P31 S58b): 1,101 byte-banked notes → 24 new laws, 21 addenda, ~700
L23272	§234	CONSTANT MATERIALISATION: THE STORE LVALUE'S SIGNEDNESS PICKS addiu vs li/ori (P31 S
L23313	§235	THE PHANTOM SYMBOL: A MASKED MATCH CAN CARRY A RELOCATION THAT DOES NOT EXIST (P31 S58b)
L23342	§236	THE DECLARATION LAYER IS THE DOMINANT BANK-BLOCKER: NINE WAYS A BYTE-PERFECT BODY FAILS TH
L23421	§237	THE CAST-AT-CALL-SITE DECISION TABLE: WHAT §17a-1 FIXES, WHAT IT CANNOT, AND THE FOUR ESCA
L23476	§238	SAME NAME, DIFFERENT FUNCTION: THE OVERLAY-HOMONYM TRAP (P31 S58b)
L23516	§239	TWO-STATEMENT INTEGER-SPACE MATERIALISATION REORDERS la vs sll; AND THE PLUS-TREE OPER
L23550	§240	A + K + B: WRITE THE CONSTANT BETWEEN THE TWO RUNTIME TERMS (P31 S58b)
L23579	§241	THE FOLDED SIGN-EXTEND-AND-SCALE: sll 16 ; sra (16 − log2 scale) (P31 S58b)
L23608	§242	*k vs <<n, AND /2^n vs >>n: EXPRESSION SPELLING OWNS THE LOAD WIDTH AND THE ROUNDI
L23636	§243	SPELL THE CSE BARRIER AS A REASSIGNED POINTER; AND THE nop-AFTER-EVERY-lh SIGNATURE (P
L23666	§244	volatile IS A COUNTING INSTRUMENT, A STORE-ORDER PIN, AND MUST SOMETIMES BE ASYMMETRIC (
L23701	§245	THE CALL'S ARGUMENT LIST IS A SCHEDULING SLOT (P31 S58b)
L23748	§246	THREE-LIVE-VALUE SCAN LOOPS WANT ADDRESS-FROM-INDEX; AND TWO SYMBOLS CAN SHARE ONE giv (P3
L23788	§247	TWO BRANCHES TO ONE LABEL MEANS THE SOURCE CONDITION IS NEGATED (P31 S58b)
L23822	§248	SPLIT THE LOAD FROM THE ARITHMETIC: A FUSED g + K DENIES THE CALLEE-SAVED REGISTER ITS D
L23846	§249	THE SELF-ASSIGN, THE DEAD RE-ASSIGN, AND THE + zr COPY: THREE WAYS TO MAKE A DELETED INS
L23888	§250	%hi/%lo vs lw: THE EXTERN'S ARRAY-vs-SCALAR SHAPE DECIDES ADDRESS MATERIALISATION (P31
L23925	§251	IMMEDIATE-SPELLING TRIGGERS: += 0xFF, FULL-WIDTH ~K, AND THE TWO-OR SPLIT (P31 S58b)
L23947	§252	THE GUARDED PRE-DECREMENT: (x != 0) && (--x == 0) (P31 S58b)
L23968	§253	POSTFIX ++ vs += 1 PICKS A DIFFERENT SCRATCH REGISTER **(single observation — not yet
L23982	§254	THE DEAD PARAMETER IS A REGISTER-PLACEMENT TOOL **(single observation — not yet cross-conf
L23994	§255	THE EMPTY CASE, PART 2: FOUR TREE SHAPES IT BUYS (P31 S58b)
L24029	§256	GOTOS IN THE TARGET'S BLOCK ORDER REPRODUCE SWITCH PLACEMENT WITHOUT SWITCH'S SIDE EFFECTS
L24066	§257	THE DEAD-END LEDGER (P31 S58b): ELEVEN LEVERS THAT MEASURED NULL OR BACKFIRED
L24109	§258	ADDENDA TO EXISTING SECTIONS (P31 S58b)
L24114	§30	addendum (P31 S58b) — THE ANONYMOUS STRUCT MEMBER REF GRANTS /s, AND THAT IS A TWO-FOR-O
L24135	§194-B	/ §209 addendum (P31 S58b) — TWO MORE INSTANCES, AND THE BOUND IS NOW REFUTED FOUR WAYS
L24158	§202	addendum (P31 S58b) — THE DEF-SIDE ALIAS ALSO CLEARS A RETURN+PARAM DOUBLE CONFLICT
L24169	§205	addendum (P31 S58b) — CHAINED ASSIGNMENT: N≥3 IS INNERMOST-FIRST, AND THE TEXT MIRRORS EMI
L24186	§208	addendum (P31 S58b) — IT SCALES TO SIX SITES, AND IT HAS AN EXACT INVERSE
L24215	§210	addendum (P31 S58b) — THREE CONFIRMED SPELLINGS OF THE BOOLEAN TAIL
L24231	§211	addendum (P31 S58b) — INIT PLACEMENT: FIVE MORE DIALS BEYOND THE GUARD HOIST
L24274	§213	addendum (P31 S58b) — THREE MORE PERMUTATION LAWS FOR INDEPENDENT SAME-BASE STORES
L24303	§214	addendum (P31 S58b) — FOUR MORE WAYS A HIGH-SIMILARITY TWIN LIES
L24339	§215	addendum (P31 S58b) — PIN ECONOMY, PART 2: NINE REFINEMENTS
L24391	§217	CROSS-CONFIRMED (P31 S58b) — AND THE INCOMING HOME SLOT IS THE MIRROR
L24408	§220	addendum (P31 S58b) — THE PARAMETER, NOT A COPY (SEVEN CARDS)
L24433	§222	addendum (P31 S58b) — IF-CHAIN vs SWITCH: THREE MORE DISCRIMINATORS
L24451	§223	addendum (P31 S58b) — FIVE MORE CONFIRMATIONS, AND THE CONSTANT-IN-$v0 CASE
L24475	§224	addendum (P31 S58b) — CROSS-JUMP MERGES CALLS, AND THE DELAY SLOT IS THE DISCRIMINATOR
L24505	§225	addendum (P31 S58b) — THE GUARD-CLAUSE FINGERPRINT, AND THREE MORE SHAPES
L24532	§226	addendum (P31 S58b) — THE FRAME CATALOGUE: SEVEN MORE LEVERS, AND SLOT ORDER IS DECLARATIO
L24577	§229	addendum (P31 S58b) — NAME IT INSIDE THE ARM
L24588	§230	CROSS-CONFIRMED (P31 S58b)
L24597	§231	addendum (P31 S58b) — FOUR MORE WAYS THE LISTING MISLEADS
L24628	§232	CROSS-CONFIRMED (P31 S58b)
L24639	§259	THE DISCARD LEDGER FOR THE aa–bg HARVEST (P31 S58b): WHAT WAS MINED AND REJECTED, AND WHY
L24678	§260	THE §154-A LEADING-ISLAND SPLIT: ONE CONFIG LINE, AND THE ISLAND PEELS FROM THE END (P31 S
L24728	§260-A	STAGE 2 IS PROVEN, AND THE WHOLE jtbl PIPELINE IS AUTOMATED AT THE GATE (P31 S59, same day
L24764	§261	THE -O0 ORACLE: DERIVE THE OPT LEVEL FROM THE TARGET, AND $fp IS NOT THE TELL (P31 S59)
L24790	§261a	THE -O0 FRAME-RELOAD GRAMMAR: reload COUNT disambiguates the C spelling (P31 S59, byte-pro
L24812	§262	A LANE'S YIELD IS ONLY A LANE FACT IF IT IS SIZE-MATCHED (P31 S59)
L24842	§263	A STOLEN DELAY SLOT WHOSE INSTRUCTION IS AN ARG-REGISTER COPY IS AN ARITY ERROR, NOT A SCH
L24883	§264	FOUR TELLS-LANE C RECIPES, EACH DRIVEN TO MATCH (P31 S59)
L24930	§265	THE VERBATIM-ASM BANK LANE: A FUNCTION NO -O2 C CAN EVER MATCH BANKS AS A RAW __asm__ BO
L24992	§266	THE INERT-RIDER LAW: A LEVER IS ONLY CITABLE WHEN ITS SOLO REMOVAL BREAKS THE MATCH (P31 S
L25032	§267	ADDENDA HARVESTED FROM WAVES at/bh/bk/bl (P31 S59b)
L25040	ADD-1	→ §231 addendum (also cross-ref from §195-D) — THE MASKED-jal "MISSING CALL" ILLUSION
L25049	ADD-2	→ §42a addendum — A SHARED CONSTANT NAMED IN A LOCAL ACROSS A jal IS AN ISO→TU DRIFT H
L25061	ADD-3	→ §236, item 10 — THE UN-DELETED INCLUDE_ASM STUB IS A DUPLICATE DEFINITION
L25071	ADD-4	→ §225-3/-4 addendum — THE MIRROR ROW: VALUE-RETURN IN THE TAKEN ARM + TRAILING BARE `re
L25085	ADD-5	→ §1/I1 addendum — THE INVERTED RANGE TEST: (u32)(x-lo) >= N WITH THE ZERO-ARM AS THE TR
L25094	ADD-6	→ §172b-1 / §264 addendum — SHIFT-AS-TEST: (x << 16) != 0 TESTS THE LOW HALF WITHOUT TRU
L25103	ADD-7	→ §256 addendum — THE SINGLE-GUARD GOTO: THEN-BLOCK OUT OF LINE AT THE TAIL
L25115	ADD-8	→ §245 addendum — THE RE-TIE BARRIER PINS CALL-ARG SETUP TO SOURCE ORDER (construct 6)
L25127	ADD-9	→ §213-3 / §217 addendum — ADJACENT PRE-CALL FRAME STORES ARE ONE AGGREGATE; THE UNESCAPED
L25137	ADD-10	→ §237 addendum (arity-evidence paragraph) — AN la PAIR ABOVE THE PROLOGUE sw $ra IS A
L25146	ADD-11	→ Cross-confirmation card block (per §259's standing instruction: confirmation, not news)
L25197	§268	A register __asm__ PIN ON A CALL-CLOBBERED REGISTER IS HONORED EXACTLY WHEN THE PINNED R
L25251	§269	ADDENDA HARVESTED FROM WAVES ax/bm (P31 S59c)
L25266	ADD-1	→ §257-8 addendum — THE INTERPOSED ASM'S __volatile__ IS A PER-SHAPE DIAL, AND THE "NO-O
L25279	ADD-2	→ §236 addendum (item 1 corollary) — THE SILENT-SPLICE DECLARATION LADDER: WHERE THE TU HA
L25293	ADD-3	→ §238 addendum — TWO BINARIES CAN EACH DEFINE THE SAME func_ NAME WITH DIFFERENT BYTES,
L25306	ADD-4	→ §167-37 addendum — THE FIFTH PRECONDITION, NOW MEASURED: DOWNSTREAM FIELD RE-READS ⇒ NAM
L25323	ADD-5	→ §267-ADD-6 / §172b-1 addendum — THE SIGN-TEST FACE: (s16)v < 0 IS sll 16 + bgez ON
L25339	ADD-6	→ §220-addendum — THE FOURTH FACE: WHEN THE NAMED COPY ITSELF BUYS THE EXTRA CALLEE-SAVED,
L25355	ADD-7	→ §229 addendum — THE VALUE FACE: A LOOP-STORE CONSTANT SPELLED AS A LITERAL HAS NO SOURCE
L25368	ADD-8	→ §30a addendum — THE THIRD COLUMN: *p++ IS ALSO SERIALIZED BUT BURNS addiu; ONLY CAST
L25383	ADD-9	→ §255 "AND CASE-BODY PLACEMENT" bound / §222-addendum-3 — ON A LARGE SPARSE TREE, BODIES
L25397	ADD-10	→ Cross-confirmation card block (per §259's standing instruction: confirmation, not news)
L25438	§3-1a.	The §266 sweep — every solo-lever A/B run for this batch
L25471	§270	The A-prop 0-bank anatomy: a byte-correct body still needs FOUR layers to agree (P31 S59)
L25489	§271	Ordinal IMM pairing: text order is NOT emission order; emit CANDIDATES, let the oracle pic
L25511	§272	The (void)-decl + empty-call wall: K&R the DEFINITION, not just the decls (P31 S59)
L25531	§273	A standalone compile is the WRONG oracle for a TU-destined draft (P31 S59)
L25546	§274	ADDENDA HARVESTED FROM 18 WAVES (P31 S60): 315 candidates, 255 already covered, 21 sharpen
L25552	ADDENDUM	to §179-C — the .type NAME, @function requirement
L25599	ADDENDUM	to §134 — a typedef defined BELOW the splice point is stripped anyway
L25629	ADDENDUM	to §179-D (GTE macro reference family) — gte_SetRotMatrix/gte_SetTransMatrix bodies
L25655	ADDENDUM	to §82 — struct copies must stay MEMBER-WISE, not block-moved, to match a spill-slot save
L25693	ADDENDUM	to §136d-1 (RC-12, the $0-add / opaque-copy family) — two symptoms beyond "compare reads
L25732	ADDENDUM	to §20 — a global declared as T * may itself BE the array base, not a pointer to derefer
L25761	ADDENDUM	to §1-I5
L25826	ADDENDUM	to §164-51
L25842	ADDENDUM	to §176-F5
L25871	ADDENDUM	to §225
L25916	ADDENDUM	to §224 — CROSS-JUMP: THE DUPLICATE CAN BE A PLAIN STORE, NOT ONLY A CALL
L25950	ADDENDUM	to §164-64 — AN EMPTY CLOBBER ON AN ARGUMENT REGISTER CAN BE THE DELIBERATE FIX, NOT JUST
L25981	ADDENDUM	to §244 — THE COMPILER BARRIER, NOT volatile, BLOCKS A STORE→LOAD HOIST THROUGH A POINTE
L26012	ADDENDUM	to §172b-1 — TWO PLACEMENT DIALS THE PROMOTION LAW DOESN'T NAME: NARROW THE COUNTER'S DECL
L26059	ADDENDUM	to §229 — A POINTER'S NUMBER OF USES DECIDES WHETHER ITS ADDRESS FOLDS OR SURVIVES A CALL
L26104	ADDENDUM	to §172b-4 — THE PLAIN CAST-DIVISION ALREADY PRODUCES THE PATTERN; DON'T HAND-ROLL THE BIA
L26134	ADDENDUM	to §8 — WHEN INCLUDE_RODATA NEEDS A STANDALONE .s YOU CAN'T CREATE, CARRY THE FRAGMENT
L26177	ADDENDUM	to §226 — A DEAD LOCAL SCOPED TO A NESTED BLOCK BUYS A MID-FUNCTION addiu sp PAIR, NOT A
L26216	ADDENDUM	to §172a — RE-READING MEMORY (NOT NAMING A TEMP) IS WHAT KEEPS AN INCREMENT'S DELAY-SLOT F
L26247	ADDENDUM	to §225 / §256 — A GOTO TO A SHARED SET-POINT PREVENTS IF-CONVERSION FROM COLLAPSING A LAT
L26289	ADDENDUM	to §211 — AN IN-LOOP ACCUMULATOR WANTS A CLOSED-FORM EXPRESSION WHEN THE TARGET REMATERIAL
L26324	§275	THE LEFTOVER-REGISTER READ
L26364	§276	MIXED ADDRESS-EXPRESSION SPELLING FOR ADJACENT RELOCATABLE SYMBOLS IS A CSE-UNIFICATION DI
L26473	§277	RETURN-TAIL C SPELLING PICKS THE DELAY-SLOT-FILL vs TRAILING-MOVE TOPOLOGY, AND A NARROWER
L26537	§278	ADDENDA HARVESTED FROM WAVE cf (P31 S60): 34 candidates, 13 already covered, 8 sharpenings
L26545	ADDENDUM	to §74 (func_800D0E30, resident)
L26581	ADDENDUM	to §172b-4 (func_80185054, ov_SC03_097)
L26619	ADDENDUM	to §265 (func_8017DC80, ov_SC07_002)
L26658	ADDENDUM	to §17 (func_800CB794, md_MAIN_036)
L26706	ADDENDUM	to §162p (func_8017C120, ov_MAIN_012)
L26740	ADDENDUM	to §20 (~L1947) (func_80186AD0, ov_SC06_032)
L26770	ADDENDUM	to §164-56 (func_8017F644, ov_SC04_005)
L26805	ADDENDUM	to §237 (func_8017F7FC, ov_SC03_092)
L26834	§279	A do/while (p < end) LOOP UNDER AN ENTRY GUARD: the guard decides the compare, not the l
L26835	§NNN	A DO-WHILE'S GUARD AND LATCH MUST REPEAT THE SAME BOUND EXPRESSION, NOT SHARE ONE LOCAL: T
L26868	§280	THE CURSOR'S DECLARED TYPE PICKS sltu vs slt: a T* bound test is UNSIGNED by C rule,
L26869	§NNN	A LOOP CURSOR'S C TYPE (POINTER vs PLAIN INTEGER) SELECTS sltu vs slt FOR ITS BOUND TE
L26902	§281	GROUP COPY-THEN-RMW BY OPERATION KIND, NOT FIELD BY FIELD: sched1 does the interleaving, t
L26903	§NNN	A DEPENDENT COPY-THEN-RMW BLOCK MUST BE SOURCE-GROUPED BY OPERATION KIND, NOT BY FIELD, AN
L26948	§282	gcc's OWN LOOP REVERSAL PUTS THE COUNTER INIT AFTER THE HOISTED MOVABLES — a position no h
L26949	§NNN	WRITE THE UP-COUNT LOOP: gcc's OWN REVERSAL PRODUCES A COUNTER-INIT INSTRUCTION THAT LANDS
L26986	What	I could not verify
L27033	§283	ADDENDA HARVESTED FROM THE 36-WAVE BATCH (P31 S60): 1,216 candidates, 859 already covered,
L27043	ADDENDUM	to §164-75 — the fold-reassociation law also fires at a variable's INITIALIZER, not only a
L27069	ADDENDUM	to §21 — the bltz+slti (or N-separate-compares) signed-range-split bullet is now CONFI
L27115	ADDENDUM	to §202 — the DEF-SIDE ALIAS also resolves a function-vs-DATA-symbol identifier clash, not
L27138	ADDENDUM	to §22 (volatile-qualified-global reload lever, cookbook ~L1922) — for a NON-constant, s
L27157	ADDENDUM	to §195-E — a goto-ladder's STORES must sit AT the labels, after the gotos, not inline bef
L27219	ADDENDUM	to §195-N — a GNU statement-expression slider must sit INSIDE the conditional arm's value
L27276	ADDENDUM	to §176-B2 — in a micro-function with no long/short lifetime asymmetry, BOTH contending ps
L27323	ADDENDUM	to §199-G — A default: LABEL GROUPED ONTO THE LAST CASE REMOVES THE j default TAIL, EV
L27392	ADDENDUM	to §220 — REFERENCING THE RAW PARAMETER (NO NAMED COPY, NOT EVEN A PIN) LETS THE CALLEE-SA
L27450	ADDENDUM	to §252 — a >=0/<0 split on an unconditionally-decremented value needs the POSTFIX ope
L27477	ADDENDUM	to §215 — FIFTH SHAPE: reused mask constants across two call-free merge sites each get the
L27560	What	I could not verify
L27631	Harness-defect	flags
L27724	ADDENDUM	to §167-40 (func_8017E2CC, ov_SC04_015 — wave dg)
L27744	ADDENDUM	to §20's cross-jump EXPLOIT bullet (func_8017E360, ov_SC05_007 — wave dg)
L27758	ADDENDUM	to §87 (func_801815F4 ov_SC06_032; corroborating func_801840DC ov_SC05_017, func_80189C68
L27777	ADDENDUM	to §153 / §236-5 (func_801A419C, md_SC07_003 — waves di and dl, corroborating; refutes a c
L27797	ADDENDUM	to §263 (func_801E83AC, md_SC04_029 — wave dj)
L27811	ADDENDUM	to §265 (func_8017D878, ov_SC03_107 — wave dj; corroborated by a REJECTED, contradicted ca
L27825	ADDENDUM	to §6 (func_801811F0, ov_SC03_102 — waves dj and dl, corroborated by a self-reported "noth
L27839	ADDENDUM	to §195-G (func_80183BB0, ov_SC05_001 — wave dj)
L27867	ADDENDUM	to the zero-byte-asm-slider family (§47 / §148-C / §153) (func_800CB874, md_MAIN_040 — wav
L27885	ADDENDUM	to §194-B (func_8017EB34, ov_SC03_117 — wave dk; distinct from the §74 co-pinning finding
L27917	ADDENDUM	to §74 (func_8017EB34, ov_SC03_117 — counter/clamp variant; wave dj, corroborated by dk/dl
L27937	ADDENDUM	§37 — merged into the §153/§236-5 entry above (func_801A419C, wave dl)
L27945	ADDENDUM	§6 — merged into the §6 entry above (func_801811F0, wave dl)
L27953	ADDENDUM	to §238 (func_80182CB4, ov_SC02_000 — wave dl)
L27971	ADDENDUM	to §137a (func_801684B4, ov_MAIN_012; corroborated independently by func_80189E68, func_80
L27987	ADDENDUM	to §8c / §88d (func_8016AB6C, ov_MAIN_012 — wave dm)
L28001	ADDENDUM	to §73 / §30#2 (func_800D1984, resident — wave dm)
L28017	What	I could not verify
L28037	ADDENDUM	to §174 Law 4 (func_8017E9A8, ov_SC06_015)
L28077	ADDENDUM	the zero-emission-asm family gains a REF-SLIDER PLACEMENT LAW and a paired RESTORER (func_
L28129	From	ck + cl + cm
L28135	ADDENDUM	§NNN — sharpens §55a / §164-37 / §165-28 (switch-vs-tree cluster): A SHAPE THAT LOOKS LIKE
L28172	ADDENDUM	§NNN — sharpens §167-13's boundary: CHAINING TWO IDENTICAL SIDE-BY-SIDE STORES INTO ONE C
L28205	ADDENDUM	§NNN — sharpens §162a3/§60b: A sll $v0,16 / sltiu $v0,1 ZERO-TEST OF A JUST-DECREMENTED
L28238	ADDENDUM	§NNN — sharpens §37/§124 (unspecified-parameter-list family): DERIVE A CALLEE'S ARITY LOWE
L28271	ADDENDUM	to §5a (func_80181F74, ov_SC03_112, wave cn)
L28321	ADDENDUM	to §265 (func_8017E26C, ov_SC04_016, wave cn)
L28359	ADDENDUM	to §42b (func_8018247C, ov_SC07_002, waves cu + cw)
L28390	ADDENDUM	to §199-F family (func_8017EFB0, ov_SC02_021, wave cu)
L28445	ADDENDUM	to §195-E (func_800CFC1C, md_MAIN_003, wave cv)
L28490	ADDENDUM	to §215 addendum (func_800CB2C8, md_MAIN_033, waves cv + cw)
L28546	ADDENDUM	to §236 item 4 (func_8017D268, ov_SC04_006, wave cw)
L28575	What	I could not verify
L28607	Harness-defect	flags (not idioms — flagged for the operator)
L28648	ADDENDUM	to §250 (func_8017D7CC, ov_SC03_115 — cx/cy/cz/dr)
L28693	ADDENDUM	to §225 (func_8017E190, ov_SC03_115 — cx/cy/cz)
L28746	ADDENDUM	to §45-A (func_8017F6A4, ov_SC02_016 — cy/cz)
L28790	ADDENDUM	to §249 (func_80182ED4, ov_SC04_004 — dp/dr/dt)
L28835	ADDENDUM	to §199-A (func_801816FC, ov_SC02_005 — dp/dr/dt)
L28881	What	I could not verify
L28924	Harness-defect	flags
L28986	§284	COMBINE CAN REASSOCIATE TWO SEQUENTIAL BITWISE-AND MASKS INTO ONE AGAINST THE PRE-MASK VAL
L28990	§285	PRE-INITIALIZING A VARIABLE WITH A SHARED CONSTANT BEFORE A BRANCH MAKES BOTH ARMS OF THE
L28994	§286	FOLD A STATEMENT'S SIDE EFFECT INTO A COMMA-EXPRESSION IN AN ARGUMENT POSITION TO PLACE IT
L28998	§287	A STACK-FRAME HOLE BELOW TWO ADDRESS-TAKEN AGGREGATE LOCALS IS A LEADING PAD MEMBER OF ONE
L29002	§288	A REGISTER PIN DECLARED UNINITIALIZED AND ASSIGNED ONLY AT ITS LATE, SOLE USE STILL FORCES
L29006	§289	an array local's address-taken base keeps every element's store alive, even though only on
L29010	§290	A SINGLE STRENGTH-REDUCED GIV CAN DRIVE STORES TO SEVERAL DISTINCT RELOCATABLE SYMBOLS, EA
L29014	§291	THE DELAY-SLOT FALSE-VALUE: A CONDITIONAL BRANCH'S ZERO ARM MUST BE A FALL-THROUGH-ADJACEN
L29018	§292	DECLARING A SYMBOL UPSTREAM OF AN ALREADY-BANKED SIBLING THAT RELIES ON THAT SYMBOL'S IMPL