@miller-tech/uap 1.26.6 → 1.28.0

package/dist/delivery/convergence-loop.js

@@ -0,0 +1,301 @@
+/**
+ * Convergence Loop
+ *
+ * Drives an underlying model through execute → apply → verify → feedback
+ * iterations until the project's completion gates (verifier ladder) pass or
+ * the turn budget is exhausted.
+ *
+ * The loop owns pluggable seams so phases extend without breaking changes:
+ *  - executor: how a prompt becomes model output
+ *  - applier: how model output is materialized into the project tree
+ *  - promptBuilder: how instruction/feedback/critique compose a prompt
+ *  - ladderRunner: how gates are verified
+ *  - explorer (Phase 2): best-of-N candidate exploration with judge tie-break
+ *  - critic (Phase 3): structured repair plans replacing raw gate dumps
+ *  - onIteration: per-turn control hook (Phase 5 escalation controllers)
+ */
+import { detectRungs, runLadder } from './verifier-ladder.js';
+import { applyFileBlocks } from './applier.js';
+import { exploreAndCommit } from './explorer.js';
+const DEFAULT_MAX_TURNS = 5;
+const DEFAULT_PREVIOUS_OUTPUT_CHARS = 3_000;
+const OUTPUT_CONTRACT = [
+    'You are an autonomous software delivery agent. Complete the task by emitting complete file contents.',
+    '',
+    'OUTPUT FORMAT — emit every file you create or modify as a fenced block:',
+    '```file:relative/path/from/project/root',
+    '<entire file content>',
+    '```',
+    'Use a longer fence (````file:path) when the file itself contains ``` sequences.',
+    'Files are written to disk verbatim, then real gates (build, type-check, tests) run.',
+    'Emit only file blocks plus brief reasoning.',
+].join('\n');
+function truncateHead(text, maxChars) {
+    if (text.length <= maxChars)
+        return text;
+    return `${text.slice(0, maxChars)}\n…(truncated)…`;
+}
+/** Default prompt strategy: lean contract + structured retry context. */
+export const defaultPromptBuilder = (ctx) => {
+    if (ctx.turn === 1) {
+        return [OUTPUT_CONTRACT, '', `TASK: ${ctx.instruction}`].join('\n');
+    }
+    const sections = [OUTPUT_CONTRACT, '', `TASK: ${ctx.instruction}`, ''];
+    sections.push(`PREVIOUS ATTEMPT (turn ${ctx.turn - 1}):`);
+    if (ctx.previousFiles && ctx.previousFiles.length > 0) {
+        sections.push(`Files you emitted: ${ctx.previousFiles.join(', ')}`);
+    }
+    if (ctx.applyError) {
+        sections.push(`Your output could not be applied: ${ctx.applyError}`);
+    }
+    // A structured repair plan outranks the raw gate dump: one concrete action
+    // per line is what small models can actually execute.
+    if (ctx.critique && ctx.critique.length > 0) {
+        sections.push('');
+        sections.push('REPAIR PLAN — apply these fixes exactly:');
+        ctx.critique.forEach((step, i) => sections.push(`${i + 1}. ${step}`));
+    }
+    if (ctx.feedback) {
+        sections.push('');
+        sections.push(ctx.feedback);
+    }
+    if (ctx.previousOutput) {
+        sections.push('');
+        sections.push('Your previous output (truncated):');
+        sections.push(truncateHead(ctx.previousOutput, DEFAULT_PREVIOUS_OUTPUT_CHARS));
+    }
+    sections.push('');
+    sections.push('Fix the issues and emit corrected file blocks.');
+    return sections.join('\n');
+};
+export class ConvergenceLoop {
+    config;
+    executor;
+    ladderRunner;
+    applier;
+    promptBuilder;
+    constructor(config, executor, seams = {}) {
+        this.config = config;
+        this.executor = executor;
+        this.ladderRunner = seams.ladderRunner ?? runLadder;
+        this.applier = seams.applier ?? applyFileBlocks;
+        this.promptBuilder = seams.promptBuilder ?? defaultPromptBuilder;
+    }
+    /** Single-candidate turn: execute → apply → verify. */
+    async runSingleTurn(prompt, rungs) {
+        let output = '';
+        let executorError;
+        try {
+            output = await this.executor(prompt);
+        }
+        catch (err) {
+            executorError = err instanceof Error ? err.message : String(err);
+        }
+        let applyResult = null;
+        let applyError;
+        if (!executorError) {
+            applyResult = await this.applier(output, this.config.projectRoot);
+            if (applyResult.error) {
+                applyError = applyResult.error;
+            }
+            else if (applyResult.rejected.length > 0) {
+                applyError = `Rejected blocks: ${applyResult.rejected
+                    .map((r) => `${r.path} (${r.reason})`)
+                    .join('; ')}`;
+            }
+        }
+        // Verify — only when something was applied; otherwise the tree is
+        // unchanged and re-running gates would waste minutes for no signal.
+        const filesApplied = applyResult?.filesWritten ?? [];
+        let ladder = null;
+        if (!executorError && filesApplied.length > 0) {
+            ladder = await this.ladderRunner(rungs, this.config.projectRoot, this.config.ladderOptions);
+        }
+        return { output, filesApplied, ladder, executorError, applyError };
+    }
+    /** Explorer turn: best-of-N candidates, commit the winner (Phase 2). */
+    async runExplorerTurn(instruction, prompt, rungs, settings) {
+        const exploration = await exploreAndCommit(instruction, prompt, this.executor, {
+            candidates: settings.candidates,
+            seeds: settings.seeds,
+            judge: settings.judge,
+            projectRoot: this.config.projectRoot,
+            rungs,
+            ladderOptions: this.config.ladderOptions,
+            ladderRunner: this.ladderRunner,
+        });
+        const summaries = exploration.candidates.map((c) => ({
+            id: c.id,
+            strategy: c.strategy,
+            passed: c.passed,
+            score: c.score,
+            error: c.error,
+        }));
+        const winner = exploration.winner;
+        if (!winner) {
+            // Distinguish executor failure (no usable model output) from apply
+            // failure (output produced but no file blocks) so the retry prompt
+            // carries the right guidance — matching single-turn feedback quality.
+            const execErrors = exploration.candidates.map((c) => c.error).filter(Boolean);
+            if (execErrors.length === exploration.candidates.length && execErrors.length > 0) {
+                return {
+                    output: '',
+                    filesApplied: [],
+                    ladder: null,
+                    executorError: execErrors.join('; '),
+                    candidates: summaries,
+                };
+            }
+            const applyErr = exploration.candidates.map((c) => c.applyResult?.error).find(Boolean) ??
+                'No candidate produced applicable file blocks.';
+            return {
+                output: '',
+                filesApplied: [],
+                ladder: null,
+                applyError: applyErr,
+                candidates: summaries,
+            };
+        }
+        let applyError;
+        if (winner.applyResult?.error) {
+            applyError = winner.applyResult.error;
+        }
+        else if (winner.applyResult && winner.applyResult.rejected.length > 0) {
+            applyError = `Rejected blocks: ${winner.applyResult.rejected
+                .map((r) => `${r.path} (${r.reason})`)
+                .join('; ')}`;
+        }
+        return {
+            output: winner.output,
+            filesApplied: winner.applyResult?.filesWritten ?? [],
+            ladder: exploration.ladder,
+            applyError,
+            strategy: winner.strategy,
+            candidates: summaries,
+            judgeRationale: exploration.judgeRationale,
+        };
+    }
+    /**
+     * Run the loop for an instruction until all required gates pass or the
+     * turn budget is exhausted. Returns the full iteration history so callers
+     * can record outcomes and inspect convergence behavior.
+     */
+    async deliver(instruction) {
+        const start = Date.now();
+        const maxTurns = this.config.maxTurns ?? DEFAULT_MAX_TURNS;
+        const rungs = this.config.rungs && this.config.rungs.length > 0
+            ? this.config.rungs
+            : detectRungs(this.config.projectRoot);
+        if (rungs.length === 0) {
+            throw new Error(`No verifiable gates for ${this.config.projectRoot} — pass explicit rungs or add package.json scripts.`);
+        }
+        if (!Number.isInteger(maxTurns) || maxTurns < 1) {
+            throw new Error(`maxTurns must be a positive integer, got ${String(this.config.maxTurns)}`);
+        }
+        const history = [];
+        const previousOutputChars = this.config.previousOutputChars ?? DEFAULT_PREVIOUS_OUTPUT_CHARS;
+        // Baseline: a green tree means there is nothing for the loop to deliver.
+        if (this.config.baselineCheck ?? true) {
+            const baseline = await this.ladderRunner(rungs, this.config.projectRoot, this.config.ladderOptions);
+            if (baseline.passed) {
+                return {
+                    success: true,
+                    alreadyDelivered: true,
+                    turns: 0,
+                    bestScore: baseline.score,
+                    bestTurn: 0,
+                    history,
+                    finalFeedback: baseline.feedback,
+                    finalOutput: '',
+                    totalDurationMs: Date.now() - start,
+                };
+            }
+        }
+        let success = false;
+        let finalOutput = '';
+        let finalFeedback = '';
+        let prevContext = {};
+        for (let turn = 1; turn <= maxTurns; turn++) {
+            const turnStart = Date.now();
+            const prompt = this.promptBuilder({ instruction, turn, ...prevContext });
+            const outcome = this.config.explorer
+                ? await this.runExplorerTurn(instruction, prompt, rungs, this.config.explorer)
+                : await this.runSingleTurn(prompt, rungs);
+            finalOutput = outcome.output || finalOutput;
+            if (outcome.ladder) {
+                finalFeedback = outcome.ladder.feedback;
+            }
+            const record = {
+                turn,
+                passed: outcome.ladder?.passed ?? false,
+                score: outcome.ladder?.score ?? 0,
+                gateResults: outcome.ladder?.results ?? [],
+                filesApplied: outcome.filesApplied,
+                executorError: outcome.executorError,
+                applyError: outcome.applyError,
+                strategy: outcome.strategy,
+                candidates: outcome.candidates,
+                judgeRationale: outcome.judgeRationale,
+                durationMs: Date.now() - turnStart,
+            };
+            history.push(record);
+            const directive = this.config.onIteration?.(record);
+            if (outcome.ladder?.passed) {
+                success = true;
+                break;
+            }
+            if (directive === 'stop') {
+                break;
+            }
+            // Phase 3: structured critique of the failed turn (fail-soft). Skipped
+            // on the last turn — prevContext is never consumed, so it would waste
+            // a model call.
+            let critique;
+            if (this.config.critic && !outcome.executorError && turn < maxTurns) {
+                try {
+                    const result = await this.config.critic({
+                        instruction,
+                        record,
+                        feedback: outcome.ladder?.feedback ?? outcome.applyError ?? '',
+                        attemptOutput: truncateHead(outcome.output, previousOutputChars),
+                    });
+                    critique = result.fixList.length > 0 ? result.fixList : undefined;
+                }
+                catch {
+                    critique = undefined;
+                }
+            }
+            prevContext = {
+                previousOutput: outcome.executorError
+                    ? undefined
+                    : truncateHead(outcome.output, previousOutputChars),
+                feedback: outcome.executorError
+                    ? `Model call failed: ${outcome.executorError}`
+                    : outcome.ladder?.feedback,
+                applyError: outcome.applyError,
+                previousFiles: outcome.filesApplied.length > 0 ? outcome.filesApplied : undefined,
+                critique,
+            };
+        }
+        let bestScore = 0;
+        let bestTurn = 0;
+        for (const record of history) {
+            if (record.score > bestScore) {
+                bestScore = record.score;
+                bestTurn = record.turn;
+            }
+        }
+        return {
+            success,
+            alreadyDelivered: false,
+            turns: history.length,
+            bestScore,
+            bestTurn,
+            history,
+            finalFeedback,
+            finalOutput,
+            totalDurationMs: Date.now() - start,
+        };
+    }
+}
+//# sourceMappingURL=convergence-loop.js.map

package/dist/delivery/convergence-loop.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"convergence-loop.js","sourceRoot":"","sources":["../../src/delivery/convergence-loop.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAE9D,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAE/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AAkHjD,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,6BAA6B,GAAG,KAAK,CAAC;AAE5C,MAAM,eAAe,GAAG;IACtB,sGAAsG;IACtG,EAAE;IACF,yEAAyE;IACzE,yCAAyC;IACzC,uBAAuB;IACvB,KAAK;IACL,iFAAiF;IACjF,qFAAqF;IACrF,6CAA6C;CAC9C,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAEb,SAAS,YAAY,CAAC,IAAY,EAAE,QAAgB;IAClD,IAAI,IAAI,CAAC,MAAM,IAAI,QAAQ;QAAE,OAAO,IAAI,CAAC;IACzC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,iBAAiB,CAAC;AACrD,CAAC;AAED,yEAAyE;AACzE,MAAM,CAAC,MAAM,oBAAoB,GAAkB,CAAC,GAAG,EAAE,EAAE;IACzD,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,CAAC,eAAe,EAAE,EAAE,EAAE,SAAS,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtE,CAAC;IAED,MAAM,QAAQ,GAAG,CAAC,eAAe,EAAE,EAAE,EAAE,SAAS,GAAG,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;IACvE,QAAQ,CAAC,IAAI,CAAC,0BAA0B,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAE1D,IAAI,GAAG,CAAC,aAAa,IAAI,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtD,QAAQ,CAAC,IAAI,CAAC,sBAAsB,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;QACnB,QAAQ,CAAC,IAAI,CAAC,qCAAqC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,2EAA2E;IAC3E,sDAAsD;IACtD,IAAI,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,QAAQ,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;QAC1D,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QACjB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IACD,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC;QACvB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,QAAQ,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;QACnD,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,cAAc,EAAE,6BAA6B,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;IAChE,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC,CAAC;AAaF,MAAM,OAAO,eAAe;IACT,MAAM,CAAoB;IAC1B,QAAQ,CAAe;IACvB,YAAY,CAAe;IAC3B,OAAO,CAAU;IACjB,aAAa,CAAgB;IAE9C,YACE,MAAyB,EACzB,QAAsB,EACtB,QAII,EAAE;QAEN,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,IAAI,SAAS,CAAC;QACpD,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,eAAe,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,oBAAoB,CAAC;IACnE,CAAC;IAED,uDAAuD;IAC/C,KAAK,CAAC,aAAa,CAAC,MAAc,EAAE,KAAiB;QAC3D,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,aAAiC,CAAC;QACtC,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,aAAa,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnE,CAAC;QAED,IAAI,WAAW,GAAuB,IAAI,CAAC;QAC3C,IAAI,UAA8B,CAAC;QACnC,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAClE,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;gBACtB,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC;YACjC,CAAC;iBAAM,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3C,UAAU,GAAG,oBAAoB,WAAW,CAAC,QAAQ;qBAClD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;qBACrC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,CAAC;QACH,CAAC;QAED,kEAAkE;QAClE,oEAAoE;QACpE,MAAM,YAAY,GAAG,WAAW,EAAE,YAAY,IAAI,EAAE,CAAC;QACrD,IAAI,MAAM,GAAwB,IAAI,CAAC;QACvC,IAAI,CAAC,aAAa,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAC9F,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,CAAC;IACrE,CAAC;IAED,wEAAwE;IAChE,KAAK,CAAC,eAAe,CAC3B,WAAmB,EACnB,MAAc,EACd,KAAiB,EACjB,QAA0B;QAE1B,MAAM,WAAW,GAAG,MAAM,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE;YAC7E,UAAU,EAAE,QAAQ,CAAC,UAAU;YAC/B,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW;YACpC,KAAK;YACL,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa;YACxC,YAAY,EAAE,IAAI,CAAC,YAAY;SAChC,CAAC,CAAC;QAEH,MAAM,SAAS,GAAuB,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvE,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,KAAK,EAAE,CAAC,CAAC,KAAK;SACf,CAAC,CAAC,CAAC;QAEJ,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,mEAAmE;YACnE,mEAAmE;YACnE,sEAAsE;YACtE,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9E,IAAI,UAAU,CAAC,MAAM,KAAK,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACjF,OAAO;oBACL,MAAM,EAAE,EAAE;oBACV,YAAY,EAAE,EAAE;oBAChB,MAAM,EAAE,IAAI;oBACZ,aAAa,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;oBACpC,UAAU,EAAE,SAAS;iBACtB,CAAC;YACJ,CAAC;YACD,MAAM,QAAQ,GACZ,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;gBACrE,+CAA+C,CAAC;YAClD,OAAO;gBACL,MAAM,EAAE,EAAE;gBACV,YAAY,EAAE,EAAE;gBAChB,MAAM,EAAE,IAAI;gBACZ,UAAU,EAAE,QAAQ;gBACpB,UAAU,EAAE,SAAS;aACtB,CAAC;QACJ,CAAC;QAED,IAAI,UAA8B,CAAC;QACnC,IAAI,MAAM,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC;YAC9B,UAAU,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC;QACxC,CAAC;aAAM,IAAI,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxE,UAAU,GAAG,oBAAoB,MAAM,CAAC,WAAW,CAAC,QAAQ;iBACzD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;iBACrC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,CAAC;QAED,OAAO;YACL,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,YAAY,EAAE,MAAM,CAAC,WAAW,EAAE,YAAY,IAAI,EAAE;YACpD,MAAM,EAAE,WAAW,CAAC,MAAM;YAC1B,UAAU;YACV,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,UAAU,EAAE,SAAS;YACrB,cAAc,EAAE,WAAW,CAAC,cAAc;SAC3C,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,OAAO,CAAC,WAAmB;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,iBAAiB,CAAC;QAC3D,MAAM,KAAK,GACT,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YAC/C,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK;YACnB,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE3C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CACb,2BAA2B,IAAI,CAAC,MAAM,CAAC,WAAW,qDAAqD,CACxG,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,4CAA4C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9F,CAAC;QAED,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,MAAM,mBAAmB,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,IAAI,6BAA6B,CAAC;QAE7F,yEAAyE;QACzE,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,IAAI,IAAI,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;YACpG,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACpB,OAAO;oBACL,OAAO,EAAE,IAAI;oBACb,gBAAgB,EAAE,IAAI;oBACtB,KAAK,EAAE,CAAC;oBACR,SAAS,EAAE,QAAQ,CAAC,KAAK;oBACzB,QAAQ,EAAE,CAAC;oBACX,OAAO;oBACP,aAAa,EAAE,QAAQ,CAAC,QAAQ;oBAChC,WAAW,EAAE,EAAE;oBACf,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;iBACpC,CAAC;YACJ,CAAC;QACH,CAAC;QAED,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,WAAW,GAAG,EAAE,CAAC;QACrB,IAAI,aAAa,GAAG,EAAE,CAAC;QACvB,IAAI,WAAW,GAAgD,EAAE,CAAC;QAElE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;YAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,WAAW,EAAE,CAAC,CAAC;YAEzE,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ;gBAClC,CAAC,CAAC,MAAM,IAAI,CAAC,eAAe,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;gBAC9E,CAAC,CAAC,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAE5C,WAAW,GAAG,OAAO,CAAC,MAAM,IAAI,WAAW,CAAC;YAC5C,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnB,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC;YAC1C,CAAC;YAED,MAAM,MAAM,GAAoB;gBAC9B,IAAI;gBACJ,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,IAAI,KAAK;gBACvC,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC;gBACjC,WAAW,EAAE,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,EAAE;gBAC1C,YAAY,EAAE,OAAO,CAAC,YAAY;gBAClC,aAAa,EAAE,OAAO,CAAC,aAAa;gBACpC,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,QAAQ,EAAE,OAAO,CAAC,QAAQ;gBAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,cAAc,EAAE,OAAO,CAAC,cAAc;gBACtC,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACnC,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC;YAEpD,IAAI,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;gBAC3B,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;YACD,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBACzB,MAAM;YACR,CAAC;YAED,uEAAuE;YACvE,sEAAsE;YACtE,gBAAgB;YAChB,IAAI,QAA8B,CAAC;YACnC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;gBACpE,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;wBACtC,WAAW;wBACX,MAAM;wBACN,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,QAAQ,IAAI,OAAO,CAAC,UAAU,IAAI,EAAE;wBAC9D,aAAa,EAAE,YAAY,CAAC,OAAO,CAAC,MAAM,EAAE,mBAAmB,CAAC;qBACjE,CAAC,CAAC;oBACH,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;gBACpE,CAAC;gBAAC,MAAM,CAAC;oBACP,QAAQ,GAAG,SAAS,CAAC;gBACvB,CAAC;YACH,CAAC;YAED,WAAW,GAAG;gBACZ,cAAc,EAAE,OAAO,CAAC,aAAa;oBACnC,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,EAAE,mBAAmB,CAAC;gBACrD,QAAQ,EAAE,OAAO,CAAC,aAAa;oBAC7B,CAAC,CAAC,sBAAsB,OAAO,CAAC,aAAa,EAAE;oBAC/C,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ;gBAC5B,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,aAAa,EAAE,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS;gBACjF,QAAQ;aACT,CAAC;QACJ,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,MAAM,CAAC,KAAK,GAAG,SAAS,EAAE,CAAC;gBAC7B,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC;gBACzB,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO;YACL,OAAO;YACP,gBAAgB,EAAE,KAAK;YACvB,KAAK,EAAE,OAAO,CAAC,MAAM;YACrB,SAAS;YACT,QAAQ;YACR,OAAO;YACP,aAAa;YACb,WAAW;YACX,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;SACpC,CAAC;IACJ,CAAC;CACF"}

package/dist/delivery/critic.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Structured Critic (Phase 3)
+ *
+ * Replaces raw gate-output dumps with a decomposed repair plan. After a
+ * failed iteration, the critic analyzes the gate feedback through a
+ * gate-specific lens and emits a numbered, file-scoped fix list sized for
+ * small-model context budgets — one concrete action per line beats a wall
+ * of compiler output.
+ */
+import type { LoopExecutor } from './convergence-loop.js';
+import type { IterationRecord } from './convergence-loop.js';
+export interface CritiqueInput {
+    instruction: string;
+    /** The failed iteration being critiqued */
+    record: IterationRecord;
+    /** Gate feedback from the ladder (already truncated) */
+    feedback: string;
+    /** Model output from the failed attempt (already truncated) */
+    attemptOutput: string;
+}
+export interface Critique {
+    /** Numbered, file-scoped repair steps */
+    fixList: string[];
+    /** Gate the critique focuses on (first failing required gate) */
+    focusGate?: string;
+}
+export type Critic = (input: CritiqueInput) => Promise<Critique>;
+/** Parse numbered lines ("1. ...", "2) ...") out of model output. */
+export declare function parseFixList(text: string): string[];
+/**
+ * Model-backed critic. Fail-soft: on executor error or unparseable output
+ * it returns an empty fix list, and the loop falls back to raw feedback.
+ */
+export declare function createModelCritic(executor: LoopExecutor): Critic;
+//# sourceMappingURL=critic.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"critic.d.ts","sourceRoot":"","sources":["../../src/delivery/critic.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAE7D,MAAM,WAAW,aAAa;IAC5B,WAAW,EAAE,MAAM,CAAC;IACpB,2CAA2C;IAC3C,MAAM,EAAE,eAAe,CAAC;IACxB,wDAAwD;IACxD,QAAQ,EAAE,MAAM,CAAC;IACjB,+DAA+D;IAC/D,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,QAAQ;IACvB,yCAAyC;IACzC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,iEAAiE;IACjE,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,MAAM,MAAM,GAAG,CAAC,KAAK,EAAE,aAAa,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC;AAmDjE,qEAAqE;AACrE,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CASnD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,YAAY,GAAG,MAAM,CAUhE"}

package/dist/delivery/critic.js

@@ -0,0 +1,77 @@
+/**
+ * Structured Critic (Phase 3)
+ *
+ * Replaces raw gate-output dumps with a decomposed repair plan. After a
+ * failed iteration, the critic analyzes the gate feedback through a
+ * gate-specific lens and emits a numbered, file-scoped fix list sized for
+ * small-model context budgets — one concrete action per line beats a wall
+ * of compiler output.
+ */
+/** Gate-specific analyst personas — the lens shapes what the critic looks for. */
+const GATE_PERSONAS = {
+    build: 'You are a compiler-error analyst. Map each error to its file and the exact change that resolves it.',
+    typecheck: 'You are a TypeScript type-system expert. For each type error, state the file, the conflicting types, and the precise fix.',
+    test: 'You are a test-failure analyst. For each failing test, state what behavior it expects, which source file implements that behavior, and what must change.',
+    lint: 'You are a code-style reviewer. List the mechanical fixes per file.',
+};
+const DEFAULT_PERSONA = 'You are a senior engineer diagnosing why a change failed verification.';
+const MAX_FIX_STEPS = 8;
+function firstFailingGate(record) {
+    return record.gateResults.find((g) => !g.passed && !g.skipped)?.id;
+}
+function buildCriticPrompt(input) {
+    const gate = firstFailingGate(input.record);
+    const persona = (gate && GATE_PERSONAS[gate]) ?? DEFAULT_PERSONA;
+    return [
+        persona,
+        '',
+        `TASK BEING ATTEMPTED: ${input.instruction}`,
+        '',
+        input.record.filesApplied.length > 0
+            ? `FILES CHANGED BY THE ATTEMPT: ${input.record.filesApplied.join(', ')}`
+            : 'THE ATTEMPT CHANGED NO FILES.',
+        '',
+        'VERIFICATION FEEDBACK:',
+        input.feedback,
+        '',
+        'THE ATTEMPT (truncated):',
+        input.attemptOutput,
+        '',
+        `Produce a repair plan: at most ${MAX_FIX_STEPS} numbered steps, each naming a specific file and a specific change.`,
+        'Format strictly as numbered lines ("1. <file>: <change>"). No prose before or after.',
+    ].join('\n');
+}
+/** Max characters of critic output parsed (bounds work on untrusted text). */
+const MAX_CRITIC_CHARS = 20_000;
+/** Linear, anchored matcher — no overlapping quantifiers (avoids ReDoS). */
+const FIX_LINE_RE = /^\s{0,8}(\d{1,3})[.)]\s+(\S[^\n]*?)\s*$/;
+/** Parse numbered lines ("1. ...", "2) ...") out of model output. */
+export function parseFixList(text) {
+    const steps = [];
+    const bounded = text.length > MAX_CRITIC_CHARS ? text.slice(0, MAX_CRITIC_CHARS) : text;
+    for (const line of bounded.split('\n')) {
+        const match = FIX_LINE_RE.exec(line);
+        if (match)
+            steps.push(match[2]);
+        if (steps.length >= MAX_FIX_STEPS)
+            break;
+    }
+    return steps;
+}
+/**
+ * Model-backed critic. Fail-soft: on executor error or unparseable output
+ * it returns an empty fix list, and the loop falls back to raw feedback.
+ */
+export function createModelCritic(executor) {
+    return async (input) => {
+        const focusGate = firstFailingGate(input.record);
+        try {
+            const raw = await executor(buildCriticPrompt(input));
+            return { fixList: parseFixList(raw), focusGate };
+        }
+        catch {
+            return { fixList: [], focusGate };
+        }
+    };
+}
+//# sourceMappingURL=critic.js.map

package/dist/delivery/critic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"critic.js","sourceRoot":"","sources":["../../src/delivery/critic.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAwBH,kFAAkF;AAClF,MAAM,aAAa,GAA2B;IAC5C,KAAK,EACH,qGAAqG;IACvG,SAAS,EACP,2HAA2H;IAC7H,IAAI,EACF,0JAA0J;IAC5J,IAAI,EAAE,oEAAoE;CAC3E,CAAC;AAEF,MAAM,eAAe,GACnB,wEAAwE,CAAC;AAE3E,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB,SAAS,gBAAgB,CAAC,MAAuB;IAC/C,OAAO,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;AACrE,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAoB;IAC7C,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,CAAC,IAAI,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,eAAe,CAAC;IAEjE,OAAO;QACL,OAAO;QACP,EAAE;QACF,yBAAyB,KAAK,CAAC,WAAW,EAAE;QAC5C,EAAE;QACF,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;YAClC,CAAC,CAAC,iCAAiC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACzE,CAAC,CAAC,+BAA+B;QACnC,EAAE;QACF,wBAAwB;QACxB,KAAK,CAAC,QAAQ;QACd,EAAE;QACF,0BAA0B;QAC1B,KAAK,CAAC,aAAa;QACnB,EAAE;QACF,kCAAkC,aAAa,qEAAqE;QACpH,sFAAsF;KACvF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAChC,4EAA4E;AAC5E,MAAM,WAAW,GAAG,yCAAyC,CAAC;AAE9D,qEAAqE;AACrE,MAAM,UAAU,YAAY,CAAC,IAAY;IACvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACxF,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,IAAI,aAAa;YAAE,MAAM;IAC3C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAsB;IACtD,OAAO,KAAK,EAAE,KAAK,EAAE,EAAE;QACrB,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACjD,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC;YACrD,OAAO,EAAE,OAAO,EAAE,YAAY,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC;QACnD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC;QACpC,CAAC;IACH,CAAC,CAAC;AACJ,CAAC"}

package/dist/delivery/explorer.d.ts

@@ -0,0 +1,77 @@
+/**
+ * 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 type { GateRung, LadderResult, LadderOptions } from './verifier-ladder.js';
+import type { LadderRunner, LoopExecutor } from './convergence-loop.js';
+import type { Applier, ApplyResult, RevertibleApply } from './applier.js';
+import type { Judge } from './judge.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 declare const MAX_CANDIDATES = 8;
+export interface StrategySeed {
+    id: string;
+    hint: string;
+}
+export declare const DEFAULT_STRATEGY_SEEDS: StrategySeed[];
+export interface CandidateResult {
+    id: string;
+    strategy: string;
+    output: string;
+    applyResult: ApplyResult | null;
+    ladder: LadderResult | null;
+    /** Executor failure for this candidate, if any */
+    error?: string;
+    passed: boolean;
+    score: number;
+}
+export interface ExplorationResult {
+    winner: CandidateResult | null;
+    candidates: CandidateResult[];
+    /** Judge rationale when a tie-break occurred */
+    judgeRationale?: string;
+    /** Ladder result of the committed winner (from its evaluation run) */
+    ladder: LadderResult | null;
+}
+export interface ExplorerConfig {
+    /** Number of candidates per turn (default 3) */
+    candidates?: number;
+    seeds?: StrategySeed[];
+    judge?: Judge;
+    projectRoot: string;
+    rungs: GateRung[];
+    ladderOptions?: LadderOptions;
+    ladderRunner?: LadderRunner;
+    /** Override the commit applier (defaults to applyFileBlocks) */
+    applier?: Applier;
+    /** Override the per-candidate revertible applier (defaults to applyFileBlocksWithRollback) */
+    revertibleApplier?: (output: string, projectRoot: string) => RevertibleApply;
+    onCandidate?: (candidate: CandidateResult) => void;
+}
+/**
+ * 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 declare function exploreAndCommit(task: string, basePrompt: string, executor: LoopExecutor, config: ExplorerConfig): Promise<ExplorationResult>;
+//# sourceMappingURL=explorer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"explorer.d.ts","sourceRoot":"","sources":["../../src/delivery/explorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAElF,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAExE,OAAO,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAC1E,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;gFACgF;AAChF,eAAO,MAAM,cAAc,IAAI,CAAC;AAEhC,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACd;AAED,eAAO,MAAM,sBAAsB,EAAE,YAAY,EAiBhD,CAAC;AAEF,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,WAAW,GAAG,IAAI,CAAC;IAChC,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;IAC5B,kDAAkD;IAClD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,OAAO,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,eAAe,GAAG,IAAI,CAAC;IAC/B,UAAU,EAAE,eAAe,EAAE,CAAC;IAC9B,gDAAgD;IAChD,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,sEAAsE;IACtE,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;CAC7B;AAED,MAAM,WAAW,cAAc;IAC7B,gDAAgD;IAChD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC;IACvB,KAAK,CAAC,EAAE,KAAK,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,gEAAgE;IAChE,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,8FAA8F;IAC9F,iBAAiB,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,KAAK,eAAe,CAAC;IAC7E,WAAW,CAAC,EAAE,CAAC,SAAS,EAAE,eAAe,KAAK,IAAI,CAAC;CACpD;AAID;;;;GAIG;AACH,wBAAsB,gBAAgB,CACpC,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,YAAY,EACtB,MAAM,EAAE,cAAc,GACrB,OAAO,CAAC,iBAAiB,CAAC,CA6H5B"}