@miller-tech/uap 1.26.6 → 1.28.0

package/dist/delivery/explorer.js

@@ -0,0 +1,166 @@
+/**
+ * Explorer — best-of-N candidate exploration (Phase 2)
+ *
+ * Instead of committing to a single attempt per turn, the explorer:
+ *  1. generates N candidates concurrently, each steered by a distinct
+ *     strategy seed (diversity by prompt, not temperature — small-model
+ *     profiles pin temperature low for stability)
+ *  2. evaluates each candidate against the real gates on the same baseline
+ *     tree via apply → verify → rollback
+ *  3. ranks objectively (gates passed, then score); a judge tie-breaks
+ *     candidates tied at the top
+ *  4. commits only the winner to the tree
+ *
+ * Candidate verification is sequential by design: gates (npm test, builds)
+ * cannot safely run concurrently in one tree. Worktree-isolated parallel
+ * verification is a planned optimization (inject via `revertibleApplier` +
+ * a per-candidate workspace), not a Phase 2 requirement.
+ *
+ * Fairness caveat: rollback reverts files the model wrote, but gate commands
+ * also mutate the tree (dist/ output, snapshots, caches). Candidate N+1 may
+ * therefore see candidate N's gate side effects. The committed winner is
+ * re-verified after commit so its reported ladder reflects real on-disk
+ * state. Full per-candidate isolation requires the workspace seam above.
+ */
+import { runLadder } from './verifier-ladder.js';
+import { applyFileBlocks, applyFileBlocksWithRollback } from './applier.js';
+/** Hard ceiling on candidates per turn — guards direct library callers
+ * (the CLI caps lower); each candidate costs a model call + a full gate run. */
+export const MAX_CANDIDATES = 8;
+export const DEFAULT_STRATEGY_SEEDS = [
+    {
+        id: 'direct',
+        hint: 'STRATEGY: Make the most direct, minimal change that satisfies the task. Touch as few files as possible.',
+    },
+    {
+        id: 'test-first',
+        hint: 'STRATEGY: Reason from the failing gates first. Identify exactly what the gates check, then implement precisely that.',
+    },
+    {
+        id: 'defensive',
+        hint: 'STRATEGY: Implement with rigorous edge-case handling — empty inputs, wrong types, boundary values.',
+    },
+    {
+        id: 'rewrite',
+        hint: 'STRATEGY: Re-derive the solution from scratch rather than patching the previous attempt.',
+    },
+];
+const DEFAULT_CANDIDATES = 3;
+/**
+ * Generate, evaluate, and commit the best candidate for one loop turn.
+ * The base prompt comes from the loop's prompt builder; each candidate
+ * appends its strategy seed.
+ */
+export async function exploreAndCommit(task, basePrompt, executor, config) {
+    const count = Math.min(MAX_CANDIDATES, Math.max(1, config.candidates ?? DEFAULT_CANDIDATES));
+    const seeds = config.seeds && config.seeds.length > 0 ? config.seeds : DEFAULT_STRATEGY_SEEDS;
+    const ladderRunner = config.ladderRunner ?? runLadder;
+    const apply = config.applier ?? applyFileBlocks;
+    const applyRevertible = config.revertibleApplier ?? applyFileBlocksWithRollback;
+    // 1. Generate all candidates concurrently (model calls parallelize fine)
+    const generations = await Promise.all(Array.from({ length: count }, async (_, i) => {
+        const seed = seeds[i % seeds.length];
+        const prompt = `${basePrompt}\n\n${seed.hint}`;
+        try {
+            return { seed, output: await executor(prompt), error: undefined };
+        }
+        catch (err) {
+            return { seed, output: '', error: err instanceof Error ? err.message : String(err) };
+        }
+    }));
+    // 2. Evaluate sequentially on the same baseline via apply → verify → rollback
+    const candidates = [];
+    for (let i = 0; i < generations.length; i++) {
+        const { seed, output, error } = generations[i];
+        const id = `c${i + 1}`;
+        if (error) {
+            const candidate = {
+                id,
+                strategy: seed.id,
+                output: '',
+                applyResult: null,
+                ladder: null,
+                error,
+                passed: false,
+                score: 0,
+            };
+            candidates.push(candidate);
+            config.onCandidate?.(candidate);
+            continue;
+        }
+        const { result: applyResult, restore } = applyRevertible(output, config.projectRoot);
+        let ladder = null;
+        try {
+            if (!applyResult.error && applyResult.filesWritten.length > 0) {
+                ladder = await ladderRunner(config.rungs, config.projectRoot, config.ladderOptions);
+            }
+        }
+        finally {
+            restore();
+        }
+        const candidate = {
+            id,
+            strategy: seed.id,
+            output,
+            applyResult,
+            ladder,
+            passed: ladder?.passed ?? false,
+            score: ladder?.score ?? 0,
+        };
+        candidates.push(candidate);
+        config.onCandidate?.(candidate);
+    }
+    // Only candidates that wrote files and reached a real ladder run are
+    // committable; anything else (executor error, no/rejected blocks) cannot
+    // win regardless of its zero score.
+    const committable = (c) => c.ladder !== null && (c.applyResult?.filesWritten.length ?? 0) > 0;
+    // 3. Rank by evaluation tier, then pass/score. A committable candidate
+    //    always outranks a non-committable one (fixes error candidates with
+    //    score 0 tying with evaluated candidates that scored 0).
+    const ranked = [...candidates].sort((a, b) => {
+        const ca = committable(a);
+        const cb = committable(b);
+        if (ca !== cb)
+            return ca ? -1 : 1;
+        if (a.passed !== b.passed)
+            return a.passed ? -1 : 1;
+        return b.score - a.score;
+    });
+    const top = ranked[0];
+    if (!top || !committable(top)) {
+        return { winner: null, candidates, ladder: null };
+    }
+    // Judge tie-break among committable candidates tied with the top result
+    let winner = top;
+    let judgeRationale;
+    const tied = ranked.filter((c) => committable(c) && c.passed === top.passed && c.score === top.score);
+    if (tied.length > 1 && config.judge) {
+        try {
+            const verdict = await config.judge(task, tied.map((c) => ({
+                id: c.id,
+                strategy: c.strategy,
+                output: c.output,
+                ladderFeedback: c.ladder?.feedback ?? '',
+                score: c.score,
+            })));
+            const chosen = tied.find((c) => c.id === verdict.winnerId);
+            if (chosen) {
+                winner = chosen;
+                judgeRationale = verdict.rationale;
+            }
+        }
+        catch {
+            // Judge is a public seam; a throwing judge falls back to objective top.
+        }
+    }
+    // 4. Commit the winner by re-applying. Re-verify the committed tree so the
+    //    reported ladder reflects on-disk state (losers' gate side effects may
+    //    have perturbed it between the winner's evaluation and now).
+    const committed = await apply(winner.output, config.projectRoot);
+    let finalLadder = winner.ladder;
+    if (committed.filesWritten.length > 0) {
+        finalLadder = await ladderRunner(config.rungs, config.projectRoot, config.ladderOptions);
+    }
+    return { winner: { ...winner, ladder: finalLadder }, candidates, judgeRationale, ladder: finalLadder };
+}
+//# sourceMappingURL=explorer.js.map

package/dist/delivery/explorer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"explorer.js","sourceRoot":"","sources":["../../src/delivery/explorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAGH,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,2BAA2B,EAAE,MAAM,cAAc,CAAC;AAI5E;gFACgF;AAChF,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAOhC,MAAM,CAAC,MAAM,sBAAsB,GAAmB;IACpD;QACE,EAAE,EAAE,QAAQ;QACZ,IAAI,EAAE,yGAAyG;KAChH;IACD;QACE,EAAE,EAAE,YAAY;QAChB,IAAI,EAAE,sHAAsH;KAC7H;IACD;QACE,EAAE,EAAE,WAAW;QACf,IAAI,EAAE,oGAAoG;KAC3G;IACD;QACE,EAAE,EAAE,SAAS;QACb,IAAI,EAAE,0FAA0F;KACjG;CACF,CAAC;AAuCF,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAE7B;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,IAAY,EACZ,UAAkB,EAClB,QAAsB,EACtB,MAAsB;IAEtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,IAAI,kBAAkB,CAAC,CAAC,CAAC;IAC7F,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,sBAAsB,CAAC;IAC9F,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,IAAI,SAAS,CAAC;IACtD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,IAAI,eAAe,CAAC;IAChD,MAAM,eAAe,GAAG,MAAM,CAAC,iBAAiB,IAAI,2BAA2B,CAAC;IAEhF,yEAAyE;IACzE,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,GAAG,CACnC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,GAAG,UAAU,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;QAC/C,IAAI,CAAC;YACH,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QACpE,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;QACvF,CAAC;IACH,CAAC,CAAC,CACH,CAAC;IAEF,8EAA8E;IAC9E,MAAM,UAAU,GAAsB,EAAE,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAEvB,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,SAAS,GAAoB;gBACjC,EAAE;gBACF,QAAQ,EAAE,IAAI,CAAC,EAAE;gBACjB,MAAM,EAAE,EAAE;gBACV,WAAW,EAAE,IAAI;gBACjB,MAAM,EAAE,IAAI;gBACZ,KAAK;gBACL,MAAM,EAAE,KAAK;gBACb,KAAK,EAAE,CAAC;aACT,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3B,MAAM,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC;YAChC,SAAS;QACX,CAAC;QAED,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,GAAG,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;QACrF,IAAI,MAAM,GAAwB,IAAI,CAAC;QACvC,IAAI,CAAC;YACH,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,WAAW,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9D,MAAM,GAAG,MAAM,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;YACtF,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,SAAS,GAAoB;YACjC,EAAE;YACF,QAAQ,EAAE,IAAI,CAAC,EAAE;YACjB,MAAM;YACN,WAAW;YACX,MAAM;YACN,MAAM,EAAE,MAAM,EAAE,MAAM,IAAI,KAAK;YAC/B,KAAK,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC;SAC1B,CAAC;QACF,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3B,MAAM,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC;IAClC,CAAC;IAED,qEAAqE;IACrE,yEAAyE;IACzE,oCAAoC;IACpC,MAAM,WAAW,GAAG,CAAC,CAAkB,EAAW,EAAE,CAClD,CAAC,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,YAAY,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAErE,uEAAuE;IACvE,wEAAwE;IACxE,6DAA6D;IAC7D,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3C,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACpD,CAAC;IAED,wEAAwE;IACxE,IAAI,MAAM,GAAG,GAAG,CAAC;IACjB,IAAI,cAAkC,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CACxB,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,CAC1E,CAAC;IACF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,KAAK,CAChC,IAAI,EACJ,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACf,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,IAAI,EAAE;gBACxC,KAAK,EAAE,CAAC,CAAC,KAAK;aACf,CAAC,CAAC,CACJ,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC3D,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,GAAG,MAAM,CAAC;gBAChB,cAAc,GAAG,OAAO,CAAC,SAAS,CAAC;YACrC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,wEAAwE;QAC1E,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,2EAA2E;IAC3E,iEAAiE;IACjE,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;IACjE,IAAI,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC;IAChC,IAAI,SAAS,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,WAAW,GAAG,MAAM,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;IAC3F,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACzG,CAAC"}

package/dist/delivery/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Delivery harness — Fable-parity convergence loop.
+ *
+ * Drives underlying models through execute → apply → verify → feedback
+ * iterations against the project's real completion gates until delivery
+ * is achieved.
+ */
+export { ConvergenceLoop, defaultPromptBuilder, type CandidateSummary, type ConvergenceConfig, type DeliveryResult, type ExplorerSettings, type IterationRecord, type LoopExecutor, type LadderRunner, type PromptBuilder, type PromptContext, } from './convergence-loop.js';
+export { exploreAndCommit, DEFAULT_STRATEGY_SEEDS, MAX_CANDIDATES, type CandidateResult, type ExplorationResult, type ExplorerConfig, type StrategySeed, } from './explorer.js';
+export { createModelJudge, extractJson, type Judge, type JudgeCandidate, type JudgeVerdict, } from './judge.js';
+export { createModelCritic, parseFixList, type Critic, type Critique, type CritiqueInput, } from './critic.js';
+export { detectRungs, runLadder, runRung, formatFeedback, type GateRung, type RungResult, type RungFailureReason, type LadderResult, type LadderOptions, } from './verifier-ladder.js';
+export { applyFileBlocks, applyFileBlocksWithRollback, parseFileBlocks, type Applier, type ApplyResult, type FileBlock, type RevertibleApply, } from './applier.js';
+export { OpenAICompatClient, type OpenAICompatClientOptions } from '../models/openai-compat-client.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/delivery/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/delivery/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,eAAe,EACf,oBAAoB,EACpB,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACtB,KAAK,cAAc,EACnB,KAAK,gBAAgB,EACrB,KAAK,eAAe,EACpB,KAAK,YAAY,EACjB,KAAK,YAAY,EACjB,KAAK,aAAa,EAClB,KAAK,aAAa,GACnB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,gBAAgB,EAChB,sBAAsB,EACtB,cAAc,EACd,KAAK,eAAe,EACpB,KAAK,iBAAiB,EACtB,KAAK,cAAc,EACnB,KAAK,YAAY,GAClB,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,KAAK,KAAK,EACV,KAAK,cAAc,EACnB,KAAK,YAAY,GAClB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,KAAK,MAAM,EACX,KAAK,QAAQ,EACb,KAAK,aAAa,GACnB,MAAM,aAAa,CAAC;AAErB,OAAO,EACL,WAAW,EACX,SAAS,EACT,OAAO,EACP,cAAc,EACd,KAAK,QAAQ,EACb,KAAK,UAAU,EACf,KAAK,iBAAiB,EACtB,KAAK,YAAY,EACjB,KAAK,aAAa,GACnB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,eAAe,EACf,2BAA2B,EAC3B,eAAe,EACf,KAAK,OAAO,EACZ,KAAK,WAAW,EAChB,KAAK,SAAS,EACd,KAAK,eAAe,GACrB,MAAM,cAAc,CAAC;AAEtB,OAAO,EAAE,kBAAkB,EAAE,KAAK,yBAAyB,EAAE,MAAM,mCAAmC,CAAC"}

package/dist/delivery/index.js

@@ -0,0 +1,15 @@
+/**
+ * Delivery harness — Fable-parity convergence loop.
+ *
+ * Drives underlying models through execute → apply → verify → feedback
+ * iterations against the project's real completion gates until delivery
+ * is achieved.
+ */
+export { ConvergenceLoop, defaultPromptBuilder, } from './convergence-loop.js';
+export { exploreAndCommit, DEFAULT_STRATEGY_SEEDS, MAX_CANDIDATES, } from './explorer.js';
+export { createModelJudge, extractJson, } from './judge.js';
+export { createModelCritic, parseFixList, } from './critic.js';
+export { detectRungs, runLadder, runRung, formatFeedback, } from './verifier-ladder.js';
+export { applyFileBlocks, applyFileBlocksWithRollback, parseFileBlocks, } from './applier.js';
+export { OpenAICompatClient } from '../models/openai-compat-client.js';
+//# sourceMappingURL=index.js.map

package/dist/delivery/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/delivery/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,eAAe,EACf,oBAAoB,GAUrB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,gBAAgB,EAChB,sBAAsB,EACtB,cAAc,GAKf,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,gBAAgB,EAChB,WAAW,GAIZ,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,iBAAiB,EACjB,YAAY,GAIb,MAAM,aAAa,CAAC;AAErB,OAAO,EACL,WAAW,EACX,SAAS,EACT,OAAO,EACP,cAAc,GAMf,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,eAAe,EACf,2BAA2B,EAC3B,eAAe,GAKhB,MAAM,cAAc,CAAC;AAEtB,OAAO,EAAE,kBAAkB,EAAkC,MAAM,mCAAmC,CAAC"}

package/dist/delivery/judge.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Candidate Judge
+ *
+ * Tie-breaks exploration candidates whose objective (gate) scores are equal.
+ * Objective verification always outranks judgment — the judge is consulted
+ * only among candidates tied at the top of the ladder ranking.
+ */
+import type { LoopExecutor } from './convergence-loop.js';
+export interface JudgeCandidate {
+    /** Stable candidate id, e.g. 'c1' */
+    id: string;
+    /** Strategy seed that produced this candidate */
+    strategy: string;
+    /** Model output (the judge prompt truncates it before embedding) */
+    output: string;
+    /** Gate feedback for this candidate */
+    ladderFeedback: string;
+    /** Objective gate score */
+    score: number;
+}
+export interface JudgeVerdict {
+    winnerId: string;
+    rationale: string;
+}
+export type Judge = (task: string, candidates: JudgeCandidate[]) => Promise<JudgeVerdict>;
+/** Extract the first JSON object from model output (tolerates prose/fences). */
+export declare function extractJson(text: string): Record<string, unknown> | null;
+/**
+ * Model-backed judge. Falls back to the first candidate (caller's ranking
+ * order) when the verdict is unparseable or names an unknown candidate.
+ */
+export declare function createModelJudge(executor: LoopExecutor): Judge;
+//# sourceMappingURL=judge.d.ts.map

package/dist/delivery/judge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"judge.d.ts","sourceRoot":"","sources":["../../src/delivery/judge.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAE1D,MAAM,WAAW,cAAc;IAC7B,qCAAqC;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,iDAAiD;IACjD,QAAQ,EAAE,MAAM,CAAC;IACjB,oEAAoE;IACpE,MAAM,EAAE,MAAM,CAAC;IACf,uCAAuC;IACvC,cAAc,EAAE,MAAM,CAAC;IACvB,2BAA2B;IAC3B,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,cAAc,EAAE,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC;AA4B1F,gFAAgF;AAChF,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAQxE;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,YAAY,GAAG,KAAK,CA0B9D"}

package/dist/delivery/judge.js

@@ -0,0 +1,70 @@
+/**
+ * Candidate Judge
+ *
+ * Tie-breaks exploration candidates whose objective (gate) scores are equal.
+ * Objective verification always outranks judgment — the judge is consulted
+ * only among candidates tied at the top of the ladder ranking.
+ */
+const CANDIDATE_OUTPUT_CHARS = 2_000;
+function buildJudgePrompt(task, candidates) {
+    const sections = [
+        'You are a strict senior code reviewer judging competing solutions to the same task.',
+        'Rate on: correctness, completeness, simplicity, and how well gate feedback was addressed.',
+        '',
+        `TASK: ${task}`,
+        '',
+    ];
+    for (const c of candidates) {
+        sections.push(`=== CANDIDATE ${c.id} (strategy: ${c.strategy}, gate score: ${Math.round(c.score * 100)}%) ===`);
+        sections.push(c.output.slice(0, CANDIDATE_OUTPUT_CHARS));
+        if (c.ladderFeedback) {
+            sections.push(`Gate feedback: ${c.ladderFeedback.slice(0, 500)}`);
+        }
+        sections.push('');
+    }
+    sections.push(`Respond with ONLY a JSON object: {"winner": "<candidate id>", "rationale": "<one sentence>"}`);
+    return sections.join('\n');
+}
+/** Extract the first JSON object from model output (tolerates prose/fences). */
+export function extractJson(text) {
+    const match = text.match(/\{[\s\S]*?\}/);
+    if (!match)
+        return null;
+    try {
+        return JSON.parse(match[0]);
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Model-backed judge. Falls back to the first candidate (caller's ranking
+ * order) when the verdict is unparseable or names an unknown candidate.
+ */
+export function createModelJudge(executor) {
+    return async (task, candidates) => {
+        const fallback = {
+            winnerId: candidates[0].id,
+            rationale: 'judge fallback: kept objective ranking',
+        };
+        if (candidates.length < 2)
+            return fallback;
+        let raw;
+        try {
+            raw = await executor(buildJudgePrompt(task, candidates));
+        }
+        catch {
+            return fallback;
+        }
+        const parsed = extractJson(raw);
+        const winner = typeof parsed?.winner === 'string' ? parsed.winner : undefined;
+        if (!winner || !candidates.some((c) => c.id === winner)) {
+            return fallback;
+        }
+        return {
+            winnerId: winner,
+            rationale: typeof parsed?.rationale === 'string' ? parsed.rationale : '',
+        };
+    };
+}
+//# sourceMappingURL=judge.js.map

package/dist/delivery/judge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"judge.js","sourceRoot":"","sources":["../../src/delivery/judge.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAwBH,MAAM,sBAAsB,GAAG,KAAK,CAAC;AAErC,SAAS,gBAAgB,CAAC,IAAY,EAAE,UAA4B;IAClE,MAAM,QAAQ,GAAG;QACf,qFAAqF;QACrF,2FAA2F;QAC3F,EAAE;QACF,SAAS,IAAI,EAAE;QACf,EAAE;KACH,CAAC;IAEF,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,QAAQ,iBAAiB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChH,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC,CAAC;QACzD,IAAI,CAAC,CAAC,cAAc,EAAE,CAAC;YACrB,QAAQ,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED,QAAQ,CAAC,IAAI,CACX,8FAA8F,CAC/F,CAAC;IACF,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,WAAW,CAAC,IAAY;IACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACzC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAA4B,CAAC;IACzD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAsB;IACrD,OAAO,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE;QAChC,MAAM,QAAQ,GAAiB;YAC7B,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;YAC1B,SAAS,EAAE,wCAAwC;SACpD,CAAC;QACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,QAAQ,CAAC;QAE3C,IAAI,GAAW,CAAC;QAChB,IAAI,CAAC;YACH,GAAG,GAAG,MAAM,QAAQ,CAAC,gBAAgB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;QAC3D,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,OAAO,MAAM,EAAE,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QAC9E,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;YACxD,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,MAAM;YAChB,SAAS,EAAE,OAAO,MAAM,EAAE,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;SACzE,CAAC;IACJ,CAAC,CAAC;AACJ,CAAC"}

package/dist/delivery/verifier-ladder.d.ts

@@ -0,0 +1,78 @@
+/**
+ * Verifier Ladder
+ *
+ * Turns the repository's completion gates (build, type-check, test, lint)
+ * into a programmatic verifier that the convergence loop can call after each
+ * model iteration. Each rung runs a real command in the project root; the
+ * ladder reports a pass/fail per rung, an aggregate score (fraction of rungs
+ * passed), and structured feedback sized for small-model context budgets.
+ *
+ * Detection is npm-centric (package.json scripts); callers targeting other
+ * ecosystems can pass explicit rungs.
+ */
+export interface GateRung {
+    /** Stable identifier, e.g. 'build', 'typecheck', 'test', 'lint' */
+    id: string;
+    /** Human-readable name shown in feedback */
+    name: string;
+    /** Executable to run (no shell interpolation) */
+    command: string;
+    /** Arguments passed verbatim */
+    args: string[];
+    /**
+     * Required rungs gate delivery: the ladder only passes when all required
+     * rungs pass, and a required failure stops later rungs (fail-fast).
+     * Optional rungs are reported but never block delivery.
+     */
+    required: boolean;
+    /** Per-rung timeout in milliseconds */
+    timeoutMs: number;
+}
+export type RungFailureReason = 'exit' | 'timeout' | 'signal' | 'spawn-error';
+export interface RungResult {
+    id: string;
+    name: string;
+    passed: boolean;
+    /** True when the rung never ran because an earlier required rung failed */
+    skipped: boolean;
+    exitCode: number | null;
+    /** Why the rung failed; undefined when it passed or was skipped */
+    failureReason?: RungFailureReason;
+    durationMs: number;
+    /** Tail of combined stdout+stderr, truncated for prompt injection */
+    outputTail: string;
+}
+export interface LadderResult {
+    /** True when every required rung passed */
+    passed: boolean;
+    /** Fraction of all rungs that passed (skipped rungs count as not passed) */
+    score: number;
+    results: RungResult[];
+    /** Structured feedback for the next loop iteration */
+    feedback: string;
+}
+export interface LadderOptions {
+    /** Stop at the first failing required rung (default true — cheaper feedback) */
+    failFast?: boolean;
+    /** Max characters of command output included per failing rung (default 2000) */
+    outputTailChars?: number;
+    /** Default per-rung timeout in ms (default 300000) */
+    timeoutMs?: number;
+}
+/**
+ * Detect the gate rungs available in a project from its package.json scripts.
+ * Order matters: cheap/structural gates run before expensive ones so failure
+ * feedback arrives fast.
+ */
+export declare function detectRungs(projectRoot: string, timeoutMs?: number): GateRung[];
+/** Run a single rung synchronously in the project root. */
+export declare function runRung(rung: GateRung, projectRoot: string, tailChars?: number): RungResult;
+/**
+ * Build feedback text from rung results. Only the first failing required
+ * rung's output is included in detail — small models do better with one
+ * concrete problem at a time than with a wall of every failure.
+ */
+export declare function formatFeedback(results: RungResult[], rungs: GateRung[]): string;
+/** Run the full ladder, honoring fail-fast for required rungs. */
+export declare function runLadder(rungs: GateRung[], projectRoot: string, options?: LadderOptions): LadderResult;
+//# sourceMappingURL=verifier-ladder.d.ts.map

package/dist/delivery/verifier-ladder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"verifier-ladder.d.ts","sourceRoot":"","sources":["../../src/delivery/verifier-ladder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAMH,MAAM,WAAW,QAAQ;IACvB,mEAAmE;IACnE,EAAE,EAAE,MAAM,CAAC;IACX,4CAA4C;IAC5C,IAAI,EAAE,MAAM,CAAC;IACb,iDAAiD;IACjD,OAAO,EAAE,MAAM,CAAC;IAChB,gCAAgC;IAChC,IAAI,EAAE,MAAM,EAAE,CAAC;IACf;;;;OAIG;IACH,QAAQ,EAAE,OAAO,CAAC;IAClB,uCAAuC;IACvC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,MAAM,iBAAiB,GAAG,MAAM,GAAG,SAAS,GAAG,QAAQ,GAAG,aAAa,CAAC;AAE9E,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,OAAO,CAAC;IAChB,2EAA2E;IAC3E,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,mEAAmE;IACnE,aAAa,CAAC,EAAE,iBAAiB,CAAC;IAClC,UAAU,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,YAAY;IAC3B,2CAA2C;IAC3C,MAAM,EAAE,OAAO,CAAC;IAChB,4EAA4E;IAC5E,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,sDAAsD;IACtD,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,aAAa;IAC5B,gFAAgF;IAChF,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,gFAAgF;IAChF,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,sDAAsD;IACtD,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAmBD;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,GAAE,MAA2B,GAAG,QAAQ,EAAE,CAmEnG;AAQD,2DAA2D;AAC3D,wBAAgB,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,GAAE,MAA2B,GAAG,UAAU,CA+C/G;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,CAqB/E;AAED,kEAAkE;AAClE,wBAAgB,SAAS,CACvB,KAAK,EAAE,QAAQ,EAAE,EACjB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,aAAkB,GAC1B,YAAY,CA8Cd"}

package/dist/delivery/verifier-ladder.js

@@ -0,0 +1,213 @@
+/**
+ * Verifier Ladder
+ *
+ * Turns the repository's completion gates (build, type-check, test, lint)
+ * into a programmatic verifier that the convergence loop can call after each
+ * model iteration. Each rung runs a real command in the project root; the
+ * ladder reports a pass/fail per rung, an aggregate score (fraction of rungs
+ * passed), and structured feedback sized for small-model context budgets.
+ *
+ * Detection is npm-centric (package.json scripts); callers targeting other
+ * ecosystems can pass explicit rungs.
+ */
+import { spawnSync } from 'child_process';
+import { existsSync, readFileSync } from 'fs';
+import { join } from 'path';
+const DEFAULT_TIMEOUT_MS = 300_000;
+const DEFAULT_TAIL_CHARS = 2_000;
+/** Env vars matching these patterns are stripped before running gate
+ * commands — project scripts (and npm lifecycle hooks) in arbitrary
+ * --project-root checkouts must not inherit provider credentials. */
+const SECRET_ENV_RE = /(API_KEY|TOKEN|SECRET|PASSWORD|CREDENTIAL)/i;
+function sanitizedEnv() {
+    const env = { CI: 'true' };
+    for (const [key, value] of Object.entries(process.env)) {
+        if (SECRET_ENV_RE.test(key))
+            continue;
+        env[key] = value;
+    }
+    return env;
+}
+/**
+ * Detect the gate rungs available in a project from its package.json scripts.
+ * Order matters: cheap/structural gates run before expensive ones so failure
+ * feedback arrives fast.
+ */
+export function detectRungs(projectRoot, timeoutMs = DEFAULT_TIMEOUT_MS) {
+    const pkgPath = join(projectRoot, 'package.json');
+    if (!existsSync(pkgPath)) {
+        return [];
+    }
+    let scripts = {};
+    try {
+        const pkg = JSON.parse(readFileSync(pkgPath, 'utf-8'));
+        scripts = pkg.scripts ?? {};
+    }
+    catch {
+        return [];
+    }
+    const rungs = [];
+    if (scripts['build']) {
+        rungs.push({
+            id: 'build',
+            name: 'Build (npm run build)',
+            command: 'npm',
+            args: ['run', 'build'],
+            required: true,
+            timeoutMs,
+        });
+    }
+    // Type-check is meaningful for TypeScript projects even when build exists
+    // (build may use a bundler that skips type errors). --no-install fails
+    // closed instead of letting npx fetch the registry package named 'tsc'.
+    if (existsSync(join(projectRoot, 'tsconfig.json')) &&
+        existsSync(join(projectRoot, 'node_modules', '.bin', 'tsc'))) {
+        rungs.push({
+            id: 'typecheck',
+            name: 'Type-check (tsc --noEmit)',
+            command: 'npx',
+            args: ['--no-install', 'tsc', '--noEmit'],
+            required: true,
+            timeoutMs,
+        });
+    }
+    if (scripts['test']) {
+        rungs.push({
+            id: 'test',
+            name: 'Tests (npm test)',
+            command: 'npm',
+            args: ['test'],
+            required: true,
+            timeoutMs,
+        });
+    }
+    if (scripts['lint']) {
+        rungs.push({
+            id: 'lint',
+            name: 'Lint (npm run lint)',
+            command: 'npm',
+            args: ['run', 'lint'],
+            required: false,
+            timeoutMs,
+        });
+    }
+    return rungs;
+}
+function truncateTail(text, maxChars) {
+    const trimmed = text.trim();
+    if (trimmed.length <= maxChars)
+        return trimmed;
+    return `…(truncated)…\n${trimmed.slice(-maxChars)}`;
+}
+/** Run a single rung synchronously in the project root. */
+export function runRung(rung, projectRoot, tailChars = DEFAULT_TAIL_CHARS) {
+    const start = Date.now();
+    const res = spawnSync(rung.command, rung.args, {
+        cwd: projectRoot,
+        encoding: 'utf-8',
+        timeout: rung.timeoutMs,
+        maxBuffer: 16 * 1024 * 1024,
+        env: sanitizedEnv(),
+    });
+    const durationMs = Date.now() - start;
+    const exitCode = res.status;
+    const passed = exitCode === 0;
+    // spawnSync reports timeouts/missing binaries via res.error (+ res.signal),
+    // with status null and empty output — without this the model would get a
+    // bare "FAIL" and burn its turn budget against an unexplained gate.
+    let failureReason;
+    let diagnostic = '';
+    if (!passed) {
+        const errCode = res.error?.code;
+        if (errCode === 'ETIMEDOUT' || (res.error && res.signal === 'SIGTERM')) {
+            failureReason = 'timeout';
+            diagnostic = `Gate timed out after ${rung.timeoutMs}ms.`;
+        }
+        else if (res.error) {
+            failureReason = 'spawn-error';
+            diagnostic = `Gate could not run: ${res.error.message}`;
+        }
+        else if (res.signal) {
+            failureReason = 'signal';
+            diagnostic = `Gate was killed by signal ${res.signal}.`;
+        }
+        else {
+            failureReason = 'exit';
+        }
+    }
+    const combined = `${diagnostic}\n${res.stdout ?? ''}\n${res.stderr ?? ''}`;
+    return {
+        id: rung.id,
+        name: rung.name,
+        passed,
+        skipped: false,
+        exitCode,
+        failureReason,
+        durationMs,
+        outputTail: passed ? '' : truncateTail(combined, tailChars),
+    };
+}
+/**
+ * Build feedback text from rung results. Only the first failing required
+ * rung's output is included in detail — small models do better with one
+ * concrete problem at a time than with a wall of every failure.
+ */
+export function formatFeedback(results, rungs) {
+    const requiredIds = new Set(rungs.filter((r) => r.required).map((r) => r.id));
+    const lines = ['Gate results:'];
+    for (const r of results) {
+        const status = r.skipped ? 'SKIPPED (earlier gate failed)' : r.passed ? 'PASS' : 'FAIL';
+        const optional = requiredIds.has(r.id) ? '' : ' (optional)';
+        lines.push(`- ${r.name}${optional}: ${status}`);
+    }
+    const firstFailure = results.find((r) => !r.passed && !r.skipped && requiredIds.has(r.id)) ??
+        results.find((r) => !r.passed && !r.skipped);
+    if (firstFailure && firstFailure.outputTail) {
+        lines.push('');
+        lines.push(`Fix this gate first — ${firstFailure.name} output:`);
+        lines.push('```');
+        lines.push(firstFailure.outputTail);
+        lines.push('```');
+    }
+    return lines.join('\n');
+}
+/** Run the full ladder, honoring fail-fast for required rungs. */
+export function runLadder(rungs, projectRoot, options = {}) {
+    const failFast = options.failFast ?? true;
+    const tailChars = options.outputTailChars ?? DEFAULT_TAIL_CHARS;
+    const results = [];
+    let stop = false;
+    for (const rung of rungs) {
+        if (stop) {
+            results.push({
+                id: rung.id,
+                name: rung.name,
+                passed: false,
+                skipped: true,
+                exitCode: null,
+                durationMs: 0,
+                outputTail: '',
+            });
+            continue;
+        }
+        const result = runRung(rung, projectRoot, tailChars);
+        results.push(result);
+        if (!result.passed && rung.required && failFast) {
+            stop = true;
+        }
+    }
+    const passedCount = results.filter((r) => r.passed).length;
+    const score = rungs.length > 0 ? passedCount / rungs.length : 1;
+    // Delivery is gated on required rungs only; optional gates (lint) are
+    // reported but never block convergence.
+    const requiredRungs = rungs.filter((r) => r.required);
+    const requiredPassed = results.filter((r) => r.passed && requiredRungs.some((rung) => rung.id === r.id)).length;
+    const passed = requiredPassed === requiredRungs.length;
+    return {
+        passed,
+        score,
+        results,
+        feedback: formatFeedback(results, rungs),
+    };
+}
+//# sourceMappingURL=verifier-ladder.js.map

package/dist/delivery/verifier-ladder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"verifier-ladder.js","sourceRoot":"","sources":["../../src/delivery/verifier-ladder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAwD5B,MAAM,kBAAkB,GAAG,OAAO,CAAC;AACnC,MAAM,kBAAkB,GAAG,KAAK,CAAC;AAEjC;;qEAEqE;AACrE,MAAM,aAAa,GAAG,6CAA6C,CAAC;AAEpE,SAAS,YAAY;IACnB,MAAM,GAAG,GAAsB,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC;IAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACvD,IAAI,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,SAAS;QACtC,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,WAAmB,EAAE,YAAoB,kBAAkB;IACrF,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;IAClD,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,OAAO,GAA2B,EAAE,CAAC;IACzC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAyC,CAAC;QAC/F,OAAO,GAAG,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC;IAC9B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,KAAK,GAAe,EAAE,CAAC;IAE7B,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,OAAO;YACX,IAAI,EAAE,uBAAuB;YAC7B,OAAO,EAAE,KAAK;YACd,IAAI,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC;YACtB,QAAQ,EAAE,IAAI;YACd,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAED,0EAA0E;IAC1E,uEAAuE;IACvE,wEAAwE;IACxE,IACE,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;QAC9C,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,EAC5D,CAAC;QACD,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,WAAW;YACf,IAAI,EAAE,2BAA2B;YACjC,OAAO,EAAE,KAAK;YACd,IAAI,EAAE,CAAC,cAAc,EAAE,KAAK,EAAE,UAAU,CAAC;YACzC,QAAQ,EAAE,IAAI;YACd,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,kBAAkB;YACxB,OAAO,EAAE,KAAK;YACd,IAAI,EAAE,CAAC,MAAM,CAAC;YACd,QAAQ,EAAE,IAAI;YACd,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,qBAAqB;YAC3B,OAAO,EAAE,KAAK;YACd,IAAI,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC;YACrB,QAAQ,EAAE,KAAK;YACf,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,IAAY,EAAE,QAAgB;IAClD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ;QAAE,OAAO,OAAO,CAAC;IAC/C,OAAO,kBAAkB,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;AACtD,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,OAAO,CAAC,IAAc,EAAE,WAAmB,EAAE,YAAoB,kBAAkB;IACjG,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE;QAC7C,GAAG,EAAE,WAAW;QAChB,QAAQ,EAAE,OAAO;QACjB,OAAO,EAAE,IAAI,CAAC,SAAS;QACvB,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI;QAC3B,GAAG,EAAE,YAAY,EAAE;KACpB,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;IACtC,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC;IAC5B,MAAM,MAAM,GAAG,QAAQ,KAAK,CAAC,CAAC;IAE9B,4EAA4E;IAC5E,yEAAyE;IACzE,oEAAoE;IACpE,IAAI,aAA4C,CAAC;IACjD,IAAI,UAAU,GAAG,EAAE,CAAC;IACpB,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,OAAO,GAAI,GAAG,CAAC,KAA2C,EAAE,IAAI,CAAC;QACvE,IAAI,OAAO,KAAK,WAAW,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,EAAE,CAAC;YACvE,aAAa,GAAG,SAAS,CAAC;YAC1B,UAAU,GAAG,wBAAwB,IAAI,CAAC,SAAS,KAAK,CAAC;QAC3D,CAAC;aAAM,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YACrB,aAAa,GAAG,aAAa,CAAC;YAC9B,UAAU,GAAG,uBAAuB,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QAC1D,CAAC;aAAM,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YACtB,aAAa,GAAG,QAAQ,CAAC;YACzB,UAAU,GAAG,6BAA6B,GAAG,CAAC,MAAM,GAAG,CAAC;QAC1D,CAAC;aAAM,CAAC;YACN,aAAa,GAAG,MAAM,CAAC;QACzB,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,GAAG,UAAU,KAAK,GAAG,CAAC,MAAM,IAAI,EAAE,KAAK,GAAG,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;IAE3E,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM;QACN,OAAO,EAAE,KAAK;QACd,QAAQ;QACR,aAAa;QACb,UAAU;QACV,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC;KAC5D,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,OAAqB,EAAE,KAAiB;IACrE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9E,MAAM,KAAK,GAAa,CAAC,eAAe,CAAC,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QACxF,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC;QAC5D,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,QAAQ,KAAK,MAAM,EAAE,CAAC,CAAC;IAClD,CAAC;IAED,MAAM,YAAY,GAChB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAC/C,IAAI,YAAY,IAAI,YAAY,CAAC,UAAU,EAAE,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,yBAAyB,YAAY,CAAC,IAAI,UAAU,CAAC,CAAC;QACjE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,SAAS,CACvB,KAAiB,EACjB,WAAmB,EACnB,UAAyB,EAAE;IAE3B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC;IAC1C,MAAM,SAAS,GAAG,OAAO,CAAC,eAAe,IAAI,kBAAkB,CAAC;IAEhE,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,IAAI,IAAI,GAAG,KAAK,CAAC;IAEjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,CAAC,IAAI,CAAC;gBACX,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,MAAM,EAAE,KAAK;gBACb,OAAO,EAAE,IAAI;gBACb,QAAQ,EAAE,IAAI;gBACd,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,EAAE;aACf,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QACrD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAErB,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,IAAI,QAAQ,EAAE,CAAC;YAChD,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhE,sEAAsE;IACtE,wCAAwC;IACxC,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACtD,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAClE,CAAC,MAAM,CAAC;IACT,MAAM,MAAM,GAAG,cAAc,KAAK,aAAa,CAAC,MAAM,CAAC;IAEvD,OAAO;QACL,MAAM;QACN,KAAK;QACL,OAAO;QACP,QAAQ,EAAE,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC;KACzC,CAAC;AACJ,CAAC"}