mirror of
https://github.com/Druthulu/BFM-decomp
synced 2026-09-28 23:00:29 -04:00
Drew T
cf10d28459
- CALIBRATION (25 stratified targets: 12 head-by-weight + 13 sampled across the band, so the
measurement captures the DECAY, not just the head): 28 agents -> 22 claimed -> gate BANKED 22/25
(88%) -> propagated 67 member-matches / 13 failed across 38 overlays. 89 instances.
**22,937 templatable instructions banked in one wave.**
HEAD 9/12 -> 19,492 of 28,584 templ ins
BODY 13/13 -> 3,445 of 3,445 templ ins (the small ones are EASY; all 3 misses were 611-793 ins)
- FIRST SONNET DATA (§136i ladder's new middle rung): **Sonnet 6/6 · Haiku 6/6 · Opus 10/13.**
The two cheap tiers went 12/12 and Opus absorbed every hard failure — consistent with correct
size-routing rather than luck. Small n; the controlled A/B stays parked (task #12).
- THE PROJECTION for the >=95% instr bar (Drew's decision input): 411 of 1,872 families cover the
212,594-instruction gap = ~19 waves optimistic, 20-30 realistic. Mean templ ins/family decays
1,844 (top-25) -> 1,046 (top-100) -> 525 (top-400) -> 193 (band-wide), so early waves look like
this one and later ones bank MORE functions for FEWER instructions.
- DECISION (Drew): NO phase close — keep grinding. Campaign tracked as task #15.
- Carried failures -> next lanes: func_8017D174 (793 ins, closeness 5 after ~90 variants; diagnosed
a backward-scheduler priority race -> permuter, correctly NOT ledgered a wall), func_80186E24
(611 ins, 133 of 139 diffs pure register numbers -> a natural §137 test), func_8017E2EC.
- §136c sibling-first paid again: func_8017DF84 (766 ins) MATCHED because a banked byte-matched twin
existed in the same TU; its 697 index-diffs traced to ONE root cause (a bare 0xFFFFFF literal that
loop.c hoisted to the OUTER preheader, stealing $s3) — closed by binding it to a local declared as
the FIRST statement of the inner loop body. Verified via rtu_match (real-TU), not just match_one.
146 lines
20 KiB
JavaScript
146 lines
20 KiB
JavaScript
export const meta = {
|
|
name: 'p30-s9-x29-calibration',
|
|
description: 'P30 wave 4b: draft the volume-lane B-shape families (10-19 members, <=60 ins)',
|
|
phases: [
|
|
{ title: 'Draft', detail: 'one agent per target, size-routed per the §136i ladder (haiku/sonnet/opus)' },
|
|
{ title: 'Escalate', detail: 'next rung up (haiku->sonnet, sonnet->opus) on any non-MATCH' },
|
|
],
|
|
}
|
|
|
|
// args = { targets: [...compact records...], extra: "<idioms promoted from the previous wave>" }
|
|
// Accept a JSON string too — an invocation can deliver args stringified and pipeline() then dies.
|
|
const A = {targets: [{"fn": "func_8017D174", "ov": "ov_SC03_103", "sub": "asm/ov_SC03_103/nonmatchings/ov_SC03_103_jr_8017C294", "tu": "src/ov_SC03_103/ov_SC03_103_jr_8017C294.c", "n": 793, "m": 5, "ti": 3965, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_8017DF84", "ov": "ov_SC03_014", "sub": "asm/ov_SC03_014/nonmatchings/ov_SC03_014_jr_8017AE2C", "tu": "src/ov_SC03_014/ov_SC03_014_jr_8017AE2C.c", "n": 766, "m": 5, "ti": 3830, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_80186E24", "ov": "ov_SC04_018", "sub": "asm/ov_SC04_018/nonmatchings/ov_SC04_018_jr_8017AE2C", "tu": "src/ov_SC04_018/ov_SC04_018_jr_8017AE2C.c", "n": 611, "m": 5, "ti": 3055, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_80186B78", "ov": "ov_SC03_118", "sub": "asm/ov_SC03_118/nonmatchings/ov_SC03_118_jr_8017FB84", "tu": "src/ov_SC03_118/ov_SC03_118_jr_8017FB84.c", "n": 386, "m": 7, "ti": 2702, "stratum": "head", "model": "opus", "seed": 0}, {"fn": "func_8018165C", "ov": "ov_SC06_008", "sub": "asm/ov_SC06_008/nonmatchings/ov_SC06_008_jr_8017C294", "tu": "src/ov_SC06_008/ov_SC06_008_jr_8017C294.c", "n": 305, "m": 7, "ti": 2135, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_8017E2EC", "ov": "ov_SC03_114", "sub": "asm/ov_SC03_114/nonmatchings/ov_SC03_114_jr_8017BEBC", "tu": "src/ov_SC03_114/ov_SC03_114_jr_8017BEBC.c", "n": 296, "m": 7, "ti": 2072, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_801823F0", "ov": "ov_SC06_008", "sub": "asm/ov_SC06_008/nonmatchings/ov_SC06_008_jr_8017C294", "tu": "src/ov_SC06_008/ov_SC06_008_jr_8017C294.c", "n": 274, "m": 7, "ti": 1918, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_80182A48", "ov": "ov_SC06_008", "sub": "asm/ov_SC06_008/nonmatchings/ov_SC06_008_jr_8017C294", "tu": "src/ov_SC06_008/ov_SC06_008_jr_8017C294.c", "n": 273, "m": 7, "ti": 1911, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_80183E04", "ov": "ov_SC03_028", "sub": "asm/ov_SC03_028/nonmatchings/ov_SC03_028_jr_8017AE2C", "tu": "src/ov_SC03_028/ov_SC03_028_jr_8017AE2C.c", "n": 265, "m": 7, "ti": 1855, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_80180CA8", "ov": "ov_SC06_008", "sub": "asm/ov_SC06_008/nonmatchings/ov_SC06_008_jr_8017C294", "tu": "src/ov_SC06_008/ov_SC06_008_jr_8017C294.c", "n": 257, "m": 7, "ti": 1799, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_801894F0", "ov": "ov_SC06_018", "sub": "asm/ov_SC06_018/nonmatchings/ov_SC06_018_jr_8017C24C", "tu": "src/ov_SC06_018/ov_SC06_018_jr_8017C24C.c", "n": 281, "m": 6, "ti": 1686, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_801886B0", "ov": "ov_SC06_018", "sub": "asm/ov_SC06_018/nonmatchings/ov_SC06_018_jr_8017C24C", "tu": "src/ov_SC06_018/ov_SC06_018_jr_8017C24C.c", "n": 276, "m": 6, "ti": 1656, "stratum": "head", "model": "opus", "seed": 1}, {"fn": "func_8017C290", "ov": "ov_SC03_014", "sub": "asm/ov_SC03_014/nonmatchings/ov_SC03_014_jr_8017AE2C", "tu": "src/ov_SC03_014/ov_SC03_014_jr_8017AE2C.c", "n": 229, "m": 7, "ti": 1603, "stratum": "body", "model": "opus", "seed": 0}, {"fn": "func_8017E170", "ov": "ov_SC03_114", "sub": "asm/ov_SC03_114/nonmatchings/ov_SC03_114_jr_8017BEBC", "tu": "src/ov_SC03_114/ov_SC03_114_jr_8017BEBC.c", "n": 64, "m": 7, "ti": 448, "stratum": "body", "model": "sonnet", "seed": 1}, {"fn": "func_8017E3E0", "ov": "ov_SC01_074", "sub": "asm/ov_SC01_074/nonmatchings/ov_SC01_074_jr_8017BE9C", "tu": "src/ov_SC01_074/ov_SC01_074_jr_8017BE9C.c", "n": 58, "m": 5, "ti": 290, "stratum": "body", "model": "sonnet", "seed": 1}, {"fn": "func_8018E780", "ov": "ov_SC02_011", "sub": "asm/ov_SC02_011/nonmatchings/ov_SC02_011_jr_8017AE2C", "tu": "src/ov_SC02_011/ov_SC02_011_jr_8017AE2C.c", "n": 72, "m": 3, "ti": 216, "stratum": "body", "model": "sonnet", "seed": 1}, {"fn": "func_80181CDC", "ov": "ov_SC05_003", "sub": "asm/ov_SC05_003/nonmatchings/ov_SC05_003_jr_8017BEBC", "tu": "src/ov_SC05_003/ov_SC05_003_jr_8017BEBC.c", "n": 89, "m": 2, "ti": 178, "stratum": "body", "model": "sonnet", "seed": 1}, {"fn": "func_8018C518", "ov": "ov_SC04_018", "sub": "asm/ov_SC04_018/nonmatchings/ov_SC04_018_jr_8017AE2C", "tu": "src/ov_SC04_018/ov_SC04_018_jr_8017AE2C.c", "n": 37, "m": 4, "ti": 148, "stratum": "body", "model": "haiku", "seed": 0}, {"fn": "func_80182058", "ov": "ov_SC02_000", "sub": "asm/ov_SC02_000/nonmatchings/ov_SC02_000_jr_8017FCB0", "tu": "src/ov_SC02_000/ov_SC02_000_jr_8017FCB0.c", "n": 63, "m": 2, "ti": 126, "stratum": "body", "model": "sonnet", "seed": 1}, {"fn": "func_8018AF88", "ov": "ov_SC06_018", "sub": "asm/ov_SC06_018/nonmatchings/ov_SC06_018_jr_8017C24C", "tu": "src/ov_SC06_018/ov_SC06_018_jr_8017C24C.c", "n": 54, "m": 2, "ti": 108, "stratum": "body", "model": "sonnet", "seed": 1}, {"fn": "func_801839C4", "ov": "ov_SC02_000", "sub": "asm/ov_SC02_000/nonmatchings/ov_SC02_000_jr_8017FCB0", "tu": "src/ov_SC02_000/ov_SC02_000_jr_8017FCB0.c", "n": 45, "m": 2, "ti": 90, "stratum": "body", "model": "haiku", "seed": 1}, {"fn": "func_801812F8", "ov": "ov_SC06_022", "sub": "asm/ov_SC06_022/nonmatchings/ov_SC06_022_jr_8017BEBC", "tu": "src/ov_SC06_022/ov_SC06_022_jr_8017BEBC.c", "n": 39, "m": 2, "ti": 78, "stratum": "body", "model": "haiku", "seed": 1}, {"fn": "func_8018BC40", "ov": "ov_SC06_018", "sub": "asm/ov_SC06_018/nonmatchings/ov_SC06_018_jr_8017C24C", "tu": "src/ov_SC06_018/ov_SC06_018_jr_8017C24C.c", "n": 33, "m": 2, "ti": 66, "stratum": "body", "model": "haiku", "seed": 1}, {"fn": "func_8017D5EC", "ov": "ov_SC07_009", "sub": "asm/ov_SC07_009/nonmatchings/ov_SC07_009_jr_8017AE2C", "tu": "src/ov_SC07_009/ov_SC07_009_jr_8017AE2C.c", "n": 18, "m": 3, "ti": 54, "stratum": "body", "model": "haiku", "seed": 1}, {"fn": "func_8017EC90", "ov": "ov_SC04_016", "sub": "asm/ov_SC04_016/nonmatchings/ov_SC04_016_jr_8017BEBC", "tu": "src/ov_SC04_016/ov_SC04_016_jr_8017BEBC.c", "n": 20, "m": 2, "ti": 40, "stratum": "body", "model": "haiku", "seed": 1}], extra: "START HERE \u2014 SIBLING-FIRST IS THE FASTEST ROUTE (\u00a7136c, measured this session: it produced several\nFIRST-DRAFT matches). Before you derive anything from the .s:\n 1. grep src/shared/engine_core.h for a `DEFINE_func_*` macro body that is a NEAR-TWIN of your\n target (same struct-offset chain, same shape, differing only in constants/one call). This is a\n family wave \u2014 the twin usually EXISTS, because that is what a family is.\n 2. grep your own TU for an already-BANKED sibling (a real function definition, not an INCLUDE_ASM).\n 3. Reuse its EXPRESSION FORMS and its DECLARATION FORMS verbatim. They are already byte-proven to\n produce the gcc-2.7.2 schedule and register assignment you need.\nSearch order: engine_core.h near-twin -> same-TU banked sibling -> the .s -> the Ghidra seed LAST\n(the seed was byte-proven to be an ENTIRELY DIFFERENT body twice this session).\n\nTHE LOCAL-VARIABLE LEVER (\u00a7136 \u2014 highest-yield finding, 25 banks). gcc-2.7.2 allocates ONE PSEUDO\nPER C LOCAL, and local-alloc.c:472 REFUSES a local allocno whose REG_N_DEATHS > 1 \u2014 promoting it to\na GLOBAL allocno that loses the low register. The number and scope of your locals moves whole\nregister assignments. REACH FOR THIS BEFORE register __asm__ PINS.\n L1. Same $v0/$v1 pair swapped in ONE arm only => you reused ONE local across N arms. SPLIT it into\n per-arm block-scoped locals.\n L2. One extra `sw $sN` in the prologue, frame otherwise identical => SPLIT a compound initializer:\n `x = *(u8*)p << k;` makes TWO pseudos; `x = *(u8*)p; x = x << k;` reuses one.\n L3. An extra `addu $vX,$v0,$zero` after a `jal` AND a later copy of the same value => the source\n had TWO variables with the first PINNED (an unpinned pseudo coalesces the pair away).\n L4. LENGTH-DRIFT short by `addiu $sN,$sp,K` + a save/restore pair => write a POINTER local assigned\n before the loop and used only inside it.\n L5. Local stack slots are assigned in DECLARATION order ascending from 0x10, independent of use\n order. Frame-offset drift with correct code is a declaration-ORDER problem.\n\nTYPE-FORM RULES:\n T1. A real `mult $rX,$rY` with a small constant => the multiplier is a NON-CONST LOCAL, not a\n literal (a literal goes through synth_mult's sll/addu chain). `s32 r = K;` as its own statement.\n T2. `li $sN,0xfff0` + `addu` where the target has `addiu $vN,$vN,-0x10` => gcc narrowed to HImode.\n Hoist the call to its own statement; put the load+subtract in a BLOCK-SCOPED s32 temp.\n T3. `andi $vN,0xffff` after a `jal` the target lacks => the TU declares that callee u16/s16-\n returning. Do NOT change the decl \u2014 cast at the call (idiom 9 on the RETURN axis).\n T4. Unexplained `addu $vX,$aY,$zero` near a conditional branch (including in its DELAY SLOT,\n consumed only by the fall-through arm) + the feeding `lh` loads out of order => the value is an\n s16 LOCAL, not s32; LOAD_EXTEND_OP folded the widening extend into a plain move.\n T5. LENGTH-DRIFT +1 with a narrow load of the SAME stack slot => gcc narrowed a memory-operand\n `local >> 16`. Bind the local to an s32 temp used twice.\n T6. A symbol read once at a constant offset but built into $s1 by lui/addiu => cache it in a\n POINTER LOCAL. A direct D_xxx[k] folds %lo per use and shrinks the frame.\n T7. BRANCH POLARITY: if match_one prints BRANCH-POLARITY, invert the source condition \u2014 gcc-2.7.2\n flips the branch to place the longer block as the fall-through. (Closed 8 mismatches in one\n edit this wave; the index keys the literal string \"BRANCH-POLARITY\" straight to \u00a73-T4.)\n\nSCHEDULING:\n S1. The MEM_IN_STRUCT_P escape does NOT apply when the blocking store has a VARYING (register-base)\n address \u2014 true_dependence() only drops the edge for a CONSTANT-address store. Then the lever is\n SOURCE ORDER: assign the load to a temp ABOVE the stores. (But same-base `reg+const` addresses\n ARE disambiguated by memrefs_conflict_p, so those hoists are free.)\n S2. An unfilled load-delay nop where the target fills it with a trailing call's arg setup => hoist a\n LOAD: split `*p = *p + 1` into `v = *p + 1; ... *p = v;`.\n S3. NEVER pin an incoming PARAMETER \u2014 it turns the param's `move` into a schedulable body insn and\n reshuffles the whole prologue. Pin loop variables only.\n S4. If no C lever moves a 3-6 instruction schedule/regalloc residual, a \u00a721 ZERO-BYTE RE-TIE\n barrier can anchor it: `__asm__ __volatile__(\"\" : \"=r\"(v) : \"0\"(v));` between the loads and the\n use. Try the source-level levers first; this closed one case after six other variants failed.\n\nDECLARATION SURFACE (decides whether a byte-correct draft BANKS):\n D1. `conflicting types` for a D_ symbol you cannot find declared in the split .c => the decl lives\n inside a DEFINE_func_*() MACRO BODY in src/shared/engine_core.h. Reuse its canonical type.\n An 8-byte-stride table declared `s32 D_x[][2]` must be indexed [i][0]/[i][1].\n D2. cc1 reports only the FIRST conflict. EVERY reconciled draft this session had a SECOND hidden\n conflict, sometimes BELOW the splice point. grep the WHOLE TU in ONE pass for every symbol.\n D3. A DECLARATION CONFLICT ABORTS THE COMPILE, so it hides the byte question entirely. If you are\n handed a draft as \"byte-correct, only declaration-blocked\", RUN match_one ON IT FIRST \u2014 two of\n three such drafts this session also had a real codegen residual behind the conflict.\n D4. If you compile anything, use a PROCESS-UNIQUE scratch path. A shared one silently compiled\n another agent's file and returned a meaningless success this session.\n\n\nTHIS IS A x2-9 FAMILY (2-9 members), not a x100+ family. Two consequences:\n * \u00a7136c SIBLING-FIRST still applies but is LESS likely to hit \u2014 check whether a banked sibling or an\n engine_core.h DEFINE_func_* near-twin actually EXISTS before spending greps on it (\u00a7136e). If the\n whole family is in nonmatchings, go straight to the .s.\n * \u00a7136j: on this band expect a MIX \u2014 sub-120-ins targets tend to fail on DECLARATIONS, 120+ on real\n codegen. Do the whole-TU one-pass symbol grep (D2) regardless; it is the cheapest thing you can do.\n"}
|
|
const T = Array.isArray(A) ? A : A.targets
|
|
const EXTRA = (Array.isArray(A) ? '' : A.extra) || ''
|
|
if (!Array.isArray(T)) throw new Error('args.targets must be an array')
|
|
|
|
const VERDICT = {
|
|
type: 'object',
|
|
additionalProperties: false,
|
|
required: ['fn', 'status', 'summary'],
|
|
properties: {
|
|
fn: { type: 'string' },
|
|
status: { type: 'string', enum: ['MATCH', 'DIFF', 'BLOCKED'] },
|
|
closeness: { type: 'number', description: 'mismatching instructions remaining; 0 for MATCH' },
|
|
klass: { type: 'string', description: 'residual class if not MATCH' },
|
|
summary: { type: 'string', description: 'what you did and what the residual is, <=4 sentences' },
|
|
levers: { type: 'string', description: 'cookbook sections / idioms that CLOSED the residual' },
|
|
index_hit: { type: 'boolean' },
|
|
index_gap: { type: 'string' },
|
|
},
|
|
}
|
|
|
|
function prompt(t, escalated) {
|
|
const asm = `${t.sub}/${t.fn}.s`
|
|
return `You are matching ONE PS1 function to byte-identical gcc-2.7.2 output for the Brave Fencer
|
|
Musashi decompilation. Your ONLY deliverable is a C file at \`.run/s9/${t.ov}/${t.fn}.c\`.
|
|
|
|
TARGET
|
|
function ${t.fn}
|
|
binary ${t.ov}
|
|
target asm ${asm} <- THE GROUND TRUTH. Read this FIRST and in full.
|
|
TU it lands in ${t.tu}
|
|
asm-subdir ${t.sub}
|
|
size ${t.n} instructions
|
|
leverage family of ${t.m} members / ${t.ti} templatable instructions — a byte-match here
|
|
propagates ${t.m}x across the fleet.
|
|
${t.seed ? ` ghidra seed .run/ghidra_c/${t.fn}.c <- A HINT ONLY. It is sometimes an ENTIRELY
|
|
DIFFERENT body (byte-proven this phase). If it disagrees with the .s, THE .s WINS.` : ` ghidra seed (none cached — work from the .s)`}
|
|
${t.retry ? ` ** RETRY ** A previous wave recorded: "${t.retry}". That is a data point, not a
|
|
verdict. Re-derive from the .s; do not assume the earlier verdict was right.` : ''}
|
|
|
|
HOW TO WORK (this order is the measured-fastest)
|
|
1. \`docs/cookbook-index.md\` is a SYMPTOM-KEYED index of 364 byte-verified idioms. Grep it for your
|
|
residual's symptom BEFORE deriving anything. Measured: index-first took a wave's bank rate from
|
|
57% to 100%. Then read the section it names in \`docs/matching-cookbook.md\`.
|
|
\`docs/gcc-2.7.2-map/{sched,regalloc,loop,cse_expr}.md\` is the compiler-source-derived map for
|
|
scheduling / register-allocation residuals.
|
|
2. Read the target \`.s\` completely: frame size, callee-saved registers, jal targets, every
|
|
\`%hi/%lo\` symbol.
|
|
3. Read the TU (${t.tu}) for EVERY symbol your draft will name. cc1 reports only the FIRST conflict,
|
|
so a draft can look one edit from done and hold three more. grep the whole TU in ONE pass.
|
|
Match its existing declarations EXACTLY; push any type disagreement to a CAST AT THE USE SITE
|
|
rather than redeclaring the symbol.
|
|
4. Write the draft, then verify:
|
|
.venv/bin/python tools/match_one.py ${t.fn} --c .run/s9/${t.ov}/${t.fn}.c --asm-subdir ${t.sub}
|
|
Iterate until it prints MATCH; it names the exact mismatching instructions.
|
|
|
|
IDIOMS THAT CLOSED RESIDUALS IN THE LAST WAVES (cookbook §135 — all byte-verified)
|
|
1. UNSIGNED switch index => pure equality chain, NO range test. No \`slti\` bound check in the
|
|
target's switch means the index is u32, not s32.
|
|
2. \`a0[0x46]\` (ARRAY_REF) sets MEM_IN_STRUCT_P and lets a load HOIST past a constant-address
|
|
store; \`*(s16 *)((s32)a0 + 0x8C)\` (INDIRECT_REF) keeps the dependence. Many 4-instruction
|
|
"scheduling residuals" are just this type-form choice.
|
|
3. A constant store whose top bit is set in the STORED width needs an UNSIGNED destination:
|
|
\`*(u16 *)p = 0x8C00\` emits \`ori\`; through \`s16\` it folds negative and emits \`addiu\`.
|
|
4. The list scheduler PRESERVES the relative order of disambiguable stores. A store written late
|
|
in source SINKS. If a store lands too late, move it EARLIER IN SOURCE (not a permuter job).
|
|
5. A \`short\` loop counter blocks strength reduction; walking explicit pointers (\`p++\`)
|
|
reproduces the original biv/giv set.
|
|
6. Frame size off by a constant => DEAD LOCALS. If ALL diffs are \`sp\`-relative immediates off by
|
|
one constant delta, add the padding declaration.
|
|
7. An INTERIOR address has no symbol — a \`lui/addiu\` pair can build an offset INTO a symbol.
|
|
Find the containing symbol in the data \`.s\` and index into it; declaring the interior address
|
|
as its own extern link-fails.
|
|
8. NEVER redeclare a C-library name (\`memcpy\` etc.).
|
|
9. Loose typing is pervasive: if the TU declares \`void f(void)\` but the asm passes \`$a0\`, call
|
|
through a cast — \`((void(*)(s32))f)(a0)\` — do NOT change the declaration.
|
|
${EXTRA ? `\nPROMOTED FROM THE PREVIOUS BATCH (fresh, byte-verified this session)\n${EXTRA}\n` : ''}
|
|
HARD RULES
|
|
* Write ONLY \`.run/s9/${t.ov}/${t.fn}.c\`. NEVER edit \`src/\`, \`asm/\`, \`config/\`, \`include/\`,
|
|
the Makefile, or any tracked file.
|
|
* Do NOT run \`make\`, \`make build\`, \`make extract\`, or \`tools/harvest_verify.py\`. The
|
|
whole-binary gate is the orchestrator's job and the sole arbiter of a match.
|
|
* \`match_one\` MATCH is NECESSARY BUT NOT SUFFICIENT — it compiles standalone and cannot see the
|
|
TU's other declarations. Step 3 is what makes a MATCH actually BANK.
|
|
* Report honestly. A DIFF with a precise residual class routes the next attempt; a false MATCH
|
|
just gets caught by the byte-gate and wastes a cycle.
|
|
* ${escalated ? 'A cheaper rung of the model ladder already attempted this and did not reach MATCH. Read its draft at the path above, but re-derive from the .s rather than trusting it.' : 'Work economically — most functions this size close from the .s plus one or two index lookups.'}
|
|
|
|
Return the structured verdict.`
|
|
}
|
|
|
|
phase('Draft')
|
|
|
|
const results = await pipeline(
|
|
T,
|
|
(t) => agent(prompt(t, false), {
|
|
label: `draft:${t.fn}(${t.n}i,x${t.m})`,
|
|
phase: 'Draft',
|
|
model: t.model,
|
|
schema: VERDICT,
|
|
}).then((v) => ({ t, v })),
|
|
|
|
async ({ t, v }) => {
|
|
if (!v) return { t, v: { fn: t.fn, status: 'BLOCKED', summary: 'agent returned no verdict' }, tier: t.model }
|
|
if (v.status === 'MATCH' || t.model === 'opus') return { t, v, tier: t.model }
|
|
// §136i ladder: haiku -> SONNET -> opus. Never haiku -> opus directly.
|
|
const nextTier = t.model === 'haiku' ? 'sonnet' : 'opus'
|
|
const v2 = await agent(prompt(t, true), {
|
|
label: `escalate:${t.fn}`,
|
|
phase: 'Escalate',
|
|
model: nextTier,
|
|
schema: VERDICT,
|
|
})
|
|
return { t, v: v2 && v2.status === 'MATCH' ? v2 : (v2 || v), tier: nextTier + '-escalated' }
|
|
},
|
|
)
|
|
|
|
const ok = results.filter(Boolean)
|
|
const matched = ok.filter((r) => r.v && r.v.status === 'MATCH')
|
|
log(`wave4b: ${matched.length}/${T.length} claim MATCH (the gate is the arbiter)`)
|
|
|
|
return {
|
|
claimed_match: matched.map((r) => r.t.fn),
|
|
verdicts: ok.map((r) => ({
|
|
fn: r.t.fn, ov: r.t.ov, nins: r.t.n, members: r.t.m, tier: r.tier,
|
|
status: r.v ? r.v.status : 'NONE',
|
|
closeness: r.v ? r.v.closeness : null,
|
|
klass: r.v ? r.v.klass : null,
|
|
levers: r.v ? r.v.levers : null,
|
|
index_hit: r.v ? r.v.index_hit : null,
|
|
index_gap: r.v ? r.v.index_gap : null,
|
|
summary: r.v ? r.v.summary : null,
|
|
})),
|
|
}
|