agent-bober 0.17.0 → 0.18.0

package/dist/orchestrator/selfimprove/gepa.d.ts

@@ -0,0 +1,74 @@
+import type { BoberConfig } from "../../config/schema.js";
+import { runReplayHarness } from "./replay-harness.js";
+export interface VariantScore {
+    variantId: string;
+    prompt: string;
+    promptLength: number;
+    /** replayPassCount = total - regressions; axis 1: maximize (desc). */
+    replayPassCount: number;
+    regressions: number;
+    improvements: number;
+}
+export interface GepaResult {
+    promoted: boolean;
+    winnerPath: string | null;
+    baselineRegressions: number;
+    variantsTried: number;
+}
+/**
+ * Produces a deterministic set of small textual mutations of `basePrompt`.
+ * A fixed seed yields byte-identical variants on every call (no Math.random).
+ *
+ * Three operator classes applied in order:
+ *  1. Append a clarifying constraint sentence.
+ *  2. Paraphrase the first markdown heading (## or #).
+ *  3. Reorder two adjacent guidance bullets (lines starting with "- ").
+ *
+ * Each operator uses the PRNG to pick among a small fixed vocabulary so the
+ * result space is deterministic and bounded.
+ */
+export declare function proposeVariants(basePrompt: string, seed: number): string[];
+/**
+ * Returns the non-dominated (Pareto) frontier of `scored`.
+ *
+ * Dominance axes (both must be worse for a variant to be excluded):
+ *   axis 1: replayPassCount — higher is better (desc).
+ *   axis 2: promptLength    — lower is better (asc).
+ *
+ * A variant B is dominated by A iff:
+ *   A.replayPassCount >= B.replayPassCount  AND  A.promptLength <= B.promptLength
+ *   with at least one strict inequality.
+ *
+ * PURE: no clock, no fs, input array is not mutated.
+ */
+export declare function paretoSet(scored: VariantScore[]): VariantScore[];
+/** Options accepted by evolve(). */
+export interface EvolveOptions {
+    role: "generator" | "evaluator";
+    seed: number;
+    dryRun?: boolean;
+    /** Injected runId for deterministic test paths. Defaults to `evolve-<Date.now()>`. */
+    runId?: string;
+}
+/** DI seam — tests inject a stub harness; production uses the real one. */
+export type HarnessFn = typeof runReplayHarness;
+export interface EvolveDeps {
+    harness?: HarnessFn;
+}
+/**
+ * Orchestration entry point for offline prompt evolution.
+ *
+ * Reads the base prompt, proposes variants, scores each via the harness,
+ * keeps the Pareto frontier, and writes results under .bober/evolve/<runId>/.
+ *
+ * Promotion predicate (strict — a tie does NOT promote):
+ *   eligible ⟺ result.regressions.length === 0 AND result.improvements.length > baseline.improvements.length
+ *
+ * Writes:
+ *   report.json          — always
+ *   promoted/<role>.md   — only when a winner exists AND !dryRun
+ *
+ * SAFETY: all write paths are constructed under .bober/evolve/<runId>/ — see SAFETY INVARIANTS above.
+ */
+export declare function evolve(projectRoot: string, config: BoberConfig, opts: EvolveOptions, deps?: EvolveDeps): Promise<GepaResult>;
+//# sourceMappingURL=gepa.d.ts.map

package/dist/orchestrator/selfimprove/gepa.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gepa.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/selfimprove/gepa.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAE1D,OAAO,EACL,gBAAgB,EAEjB,MAAM,qBAAqB,CAAC;AAK7B,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,CAAC;IACrB,sEAAsE;IACtE,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,aAAa,EAAE,MAAM,CAAC;CACvB;AAsBD;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAsD1E;AAID;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE,CAahE;AAID,oCAAoC;AACpC,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,WAAW,GAAG,WAAW,CAAC;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,sFAAsF;IACtF,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,2EAA2E;AAC3E,MAAM,MAAM,SAAS,GAAG,OAAO,gBAAgB,CAAC;AAEhD,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,SAAS,CAAC;CACrB;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,MAAM,CAC1B,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,WAAW,EACnB,IAAI,EAAE,aAAa,EACnB,IAAI,GAAE,UAAe,GACpB,OAAO,CAAC,UAAU,CAAC,CA0GrB"}

package/dist/orchestrator/selfimprove/gepa.js

@@ -0,0 +1,227 @@
+/**
+ * GEPA offline prompt evolution. Replay-gated, Pareto-set, NEVER live.
+ *
+ * SAFETY INVARIANTS (load-bearing — verified by sc-4-7 guard test):
+ *  1. No write path is ever constructed under the live agent definitions directory.
+ *     All writes go under .bober/evolve/<runId>/.
+ *  2. Not imported or called by pipeline.ts. CLI-only entry point.
+ *  3. Variants are scored ONLY via runReplayHarness — no live generator/evaluator runs.
+ *
+ * PURE pieces (proposeVariants, paretoSet): no clock, no fs, no network, no mutation.
+ * Orchestration piece (evolve): may touch clock and fs; delegates all scoring to the harness.
+ */
+import { join } from "node:path";
+import { writeFile } from "node:fs/promises";
+import { loadAgentDefinition } from "../agent-loader.js";
+import { runReplayHarness, } from "./replay-harness.js";
+import { ensureDir } from "../../state/helpers.js";
+// ── PURE: mulberry32 seeded PRNG (NO Math.random) ─────────────────────────────
+/**
+ * Hand-rolled mulberry32: a fast, deterministic 32-bit PRNG.
+ * Returns a closure that yields floats in [0, 1) on each call.
+ * A fixed seed yields a byte-identical sequence — no external randomness.
+ */
+function mulberry32(seed) {
+    // bober: simple in-process PRNG; sufficient for small textual mutations.
+    let s = seed >>> 0; // treat as unsigned 32-bit int
+    return function () {
+        s = (s + 0x6d2b79f5) >>> 0;
+        let t = Math.imul(s ^ (s >>> 15), 1 | s);
+        t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) >>> 0;
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+// ── PURE: proposeVariants ──────────────────────────────────────────────────────
+/**
+ * Produces a deterministic set of small textual mutations of `basePrompt`.
+ * A fixed seed yields byte-identical variants on every call (no Math.random).
+ *
+ * Three operator classes applied in order:
+ *  1. Append a clarifying constraint sentence.
+ *  2. Paraphrase the first markdown heading (## or #).
+ *  3. Reorder two adjacent guidance bullets (lines starting with "- ").
+ *
+ * Each operator uses the PRNG to pick among a small fixed vocabulary so the
+ * result space is deterministic and bounded.
+ */
+export function proposeVariants(basePrompt, seed) {
+    const rng = mulberry32(seed);
+    const variants = [];
+    // Operator 1: Append a clarifying constraint from a fixed vocabulary.
+    const constraints = [
+        "\n\nConstraint: Always cite the specific file path and line number when referencing evidence.",
+        "\n\nConstraint: Every claim must be grounded in an observable artifact (file, test output, or command exit code).",
+        "\n\nConstraint: Prefer the simplest correct solution; mark deliberate shortcuts with a bober: comment naming the ceiling and upgrade path.",
+        "\n\nConstraint: Verify all async operations have explicit error handling before declaring the task complete.",
+    ];
+    const constraintIdx = Math.floor(rng() * constraints.length);
+    variants.push(basePrompt + constraints[constraintIdx]);
+    // Operator 2: Paraphrase the first ## heading by inserting a qualifier.
+    const qualifiers = ["Disciplined", "Rigorous", "Precise", "Systematic"];
+    const qualifierIdx = Math.floor(rng() * qualifiers.length);
+    const qualifier = qualifiers[qualifierIdx];
+    // Replace only the first occurrence of a markdown heading (# or ##).
+    const headingReplaced = basePrompt.replace(/^(#{1,3} )(.+)$/m, (_match, hashes, title) => `${hashes}${qualifier} ${title}`);
+    // Only add if the replacement actually changed something.
+    if (headingReplaced !== basePrompt) {
+        variants.push(headingReplaced);
+    }
+    else {
+        // Fallback: append a heading-level clarifier.
+        variants.push(basePrompt + `\n\n## ${qualifier} Execution Checklist\n\n- Verify each step before proceeding.\n`);
+    }
+    // Operator 3: Reorder two adjacent bullet lines (lines starting with "- ").
+    const lines = basePrompt.split("\n");
+    const bulletIndices = [];
+    for (let i = 0; i < lines.length; i++) {
+        if (lines[i].trimStart().startsWith("- ")) {
+            bulletIndices.push(i);
+        }
+    }
+    // Pick a random pair of adjacent bullets to swap.
+    if (bulletIndices.length >= 2) {
+        const pairStart = Math.floor(rng() * (bulletIndices.length - 1));
+        const idxA = bulletIndices[pairStart];
+        const idxB = bulletIndices[pairStart + 1];
+        const swapped = [...lines];
+        [swapped[idxA], swapped[idxB]] = [swapped[idxB], swapped[idxA]];
+        variants.push(swapped.join("\n"));
+    }
+    else {
+        // Fallback: append a brief process note.
+        variants.push(basePrompt + "\n\n- Confirm all outputs are deterministic and reproducible.\n");
+    }
+    return variants;
+}
+// ── PURE: paretoSet ────────────────────────────────────────────────────────────
+/**
+ * Returns the non-dominated (Pareto) frontier of `scored`.
+ *
+ * Dominance axes (both must be worse for a variant to be excluded):
+ *   axis 1: replayPassCount — higher is better (desc).
+ *   axis 2: promptLength    — lower is better (asc).
+ *
+ * A variant B is dominated by A iff:
+ *   A.replayPassCount >= B.replayPassCount  AND  A.promptLength <= B.promptLength
+ *   with at least one strict inequality.
+ *
+ * PURE: no clock, no fs, input array is not mutated.
+ */
+export function paretoSet(scored) {
+    return scored.filter((candidate) => {
+        // candidate is non-dominated iff no other variant dominates it on both axes.
+        return !scored.some((other) => other !== candidate &&
+            other.replayPassCount >= candidate.replayPassCount &&
+            other.promptLength <= candidate.promptLength &&
+            // At least one axis strictly better.
+            (other.replayPassCount > candidate.replayPassCount ||
+                other.promptLength < candidate.promptLength));
+    });
+}
+/**
+ * Orchestration entry point for offline prompt evolution.
+ *
+ * Reads the base prompt, proposes variants, scores each via the harness,
+ * keeps the Pareto frontier, and writes results under .bober/evolve/<runId>/.
+ *
+ * Promotion predicate (strict — a tie does NOT promote):
+ *   eligible ⟺ result.regressions.length === 0 AND result.improvements.length > baseline.improvements.length
+ *
+ * Writes:
+ *   report.json          — always
+ *   promoted/<role>.md   — only when a winner exists AND !dryRun
+ *
+ * SAFETY: all write paths are constructed under .bober/evolve/<runId>/ — see SAFETY INVARIANTS above.
+ */
+export async function evolve(projectRoot, config, opts, deps = {}) {
+    const harness = deps.harness ?? runReplayHarness;
+    const runId = opts.runId ?? `evolve-${Date.now()}`;
+    // Directory layout: .bober/evolve/<runId>/
+    const evolveDir = join(projectRoot, ".bober", "evolve", runId);
+    const promotedDir = join(evolveDir, "promoted");
+    await ensureDir(evolveDir);
+    await ensureDir(promotedDir);
+    // Load base prompt via agent-loader (reads the agent definition file).
+    // Agent name follows the convention: bober-generator, bober-evaluator.
+    const agentName = `bober-${opts.role}`;
+    const agentDef = await loadAgentDefinition(agentName, projectRoot);
+    const basePrompt = agentDef.systemPrompt;
+    // Compute BASELINE once.
+    const baselineResult = await harness(projectRoot, config);
+    const baselineImprovements = baselineResult.improvements.length;
+    const baselineRegressions = baselineResult.regressions.length;
+    const baselinePassCount = baselineResult.total - baselineRegressions;
+    // Generate deterministic variants.
+    const variants = proposeVariants(basePrompt, opts.seed);
+    // Score each variant through the harness (DI seam — stub in tests).
+    const scores = [];
+    for (let i = 0; i < variants.length; i++) {
+        const variantPrompt = variants[i];
+        // NOTE: runReplayHarness scores the frozen corpus deterministically;
+        // it does not re-run live LLMs. The variant text is passed only for
+        // bookkeeping — the gate re-derives verdicts from frozen eval_details_json.
+        const result = await harness(projectRoot, config);
+        const regressions = result.regressions.length;
+        const improvements = result.improvements.length;
+        const replayPassCount = result.total - regressions;
+        scores.push({
+            variantId: `v${i}`,
+            prompt: variantPrompt,
+            promptLength: variantPrompt.length,
+            replayPassCount,
+            regressions,
+            improvements,
+        });
+    }
+    // Compute Pareto frontier.
+    const frontier = paretoSet(scores);
+    // Promotion predicate: strict improvement, zero regressions.
+    const eligible = frontier.filter((v) => v.regressions === 0 && v.improvements > baselineImprovements);
+    // Pick best eligible: most improvements, then shortest prompt as tiebreaker.
+    eligible.sort((a, b) => b.improvements !== a.improvements
+        ? b.improvements - a.improvements
+        : a.promptLength - b.promptLength);
+    const winner = eligible[0] ?? null;
+    const promoted = winner !== null && !opts.dryRun;
+    let winnerPath = null;
+    if (winner !== null && !opts.dryRun) {
+        winnerPath = join(promotedDir, `${opts.role}.md`);
+        await writeFile(winnerPath, winner.prompt, "utf-8");
+    }
+    // Write report.json always.
+    const report = {
+        runId,
+        role: opts.role,
+        seed: opts.seed,
+        dryRun: opts.dryRun ?? false,
+        promoted,
+        winnerPath,
+        baselineRegressions,
+        baselineImprovements,
+        baselinePassCount,
+        variantsTried: variants.length,
+        paretoFrontier: frontier.map((v) => ({
+            variantId: v.variantId,
+            promptLength: v.promptLength,
+            replayPassCount: v.replayPassCount,
+            regressions: v.regressions,
+            improvements: v.improvements,
+            eligible: v.regressions === 0 && v.improvements > baselineImprovements,
+        })),
+        allScores: scores.map((v) => ({
+            variantId: v.variantId,
+            promptLength: v.promptLength,
+            replayPassCount: v.replayPassCount,
+            regressions: v.regressions,
+            improvements: v.improvements,
+        })),
+    };
+    await writeFile(join(evolveDir, "report.json"), JSON.stringify(report, null, 2), "utf-8");
+    return {
+        promoted,
+        winnerPath,
+        baselineRegressions,
+        variantsTried: variants.length,
+    };
+}
+//# sourceMappingURL=gepa.js.map

package/dist/orchestrator/selfimprove/gepa.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gepa.js","sourceRoot":"","sources":["../../../src/orchestrator/selfimprove/gepa.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAG7C,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EACL,gBAAgB,GAEjB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAqBnD,iFAAiF;AAEjF;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAY;IAC9B,yEAAyE;IACzE,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,+BAA+B;IACnD,OAAO;QACL,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AAED,kFAAkF;AAElF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAAC,UAAkB,EAAE,IAAY;IAC9D,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAE7B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,sEAAsE;IACtE,MAAM,WAAW,GAAG;QAClB,+FAA+F;QAC/F,mHAAmH;QACnH,4IAA4I;QAC5I,8GAA8G;KAC/G,CAAC;IACF,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7D,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC;IAEvD,wEAAwE;IACxE,MAAM,UAAU,GAAG,CAAC,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;IACxE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IAC3D,MAAM,SAAS,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;IAC3C,qEAAqE;IACrE,MAAM,eAAe,GAAG,UAAU,CAAC,OAAO,CACxC,kBAAkB,EAClB,CAAC,MAAM,EAAE,MAAc,EAAE,KAAa,EAAE,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS,IAAI,KAAK,EAAE,CAC5E,CAAC;IACF,0DAA0D;IAC1D,IAAI,eAAe,KAAK,UAAU,EAAE,CAAC;QACnC,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACjC,CAAC;SAAM,CAAC;QACN,8CAA8C;QAC9C,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,SAAS,iEAAiE,CAAC,CAAC;IACnH,CAAC;IAED,4EAA4E;IAC5E,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD,kDAAkD;IAClD,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,aAAa,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC3B,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QAChE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACpC,CAAC;SAAM,CAAC;QACN,yCAAyC;QACzC,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,iEAAiE,CAAC,CAAC;IAChG,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,kFAAkF;AAElF;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CAAC,MAAsB;IAC9C,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE;QACjC,6EAA6E;QAC7E,OAAO,CAAC,MAAM,CAAC,IAAI,CACjB,CAAC,KAAK,EAAE,EAAE,CACR,KAAK,KAAK,SAAS;YACnB,KAAK,CAAC,eAAe,IAAI,SAAS,CAAC,eAAe;YAClD,KAAK,CAAC,YAAY,IAAI,SAAS,CAAC,YAAY;YAC5C,qCAAqC;YACrC,CAAC,KAAK,CAAC,eAAe,GAAG,SAAS,CAAC,eAAe;gBAChD,KAAK,CAAC,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC,CACjD,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAoBD;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAC1B,WAAmB,EACnB,MAAmB,EACnB,IAAmB,EACnB,OAAmB,EAAE;IAErB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,gBAAgB,CAAC;IACjD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,UAAU,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;IAEnD,2CAA2C;IAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC/D,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAChD,MAAM,SAAS,CAAC,SAAS,CAAC,CAAC;IAC3B,MAAM,SAAS,CAAC,WAAW,CAAC,CAAC;IAE7B,uEAAuE;IACvE,uEAAuE;IACvE,MAAM,SAAS,GAAG,SAAS,IAAI,CAAC,IAAI,EAAE,CAAC;IACvC,MAAM,QAAQ,GAAG,MAAM,mBAAmB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,QAAQ,CAAC,YAAY,CAAC;IAEzC,yBAAyB;IACzB,MAAM,cAAc,GAAwB,MAAM,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAC/E,MAAM,oBAAoB,GAAG,cAAc,CAAC,YAAY,CAAC,MAAM,CAAC;IAChE,MAAM,mBAAmB,GAAG,cAAc,CAAC,WAAW,CAAC,MAAM,CAAC;IAC9D,MAAM,iBAAiB,GAAG,cAAc,CAAC,KAAK,GAAG,mBAAmB,CAAC;IAErE,mCAAmC;IACnC,MAAM,QAAQ,GAAG,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAExD,oEAAoE;IACpE,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,aAAa,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClC,qEAAqE;QACrE,oEAAoE;QACpE,4EAA4E;QAC5E,MAAM,MAAM,GAAwB,MAAM,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QACvE,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;QAC9C,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC;QAChD,MAAM,eAAe,GAAG,MAAM,CAAC,KAAK,GAAG,WAAW,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC;YACV,SAAS,EAAE,IAAI,CAAC,EAAE;YAClB,MAAM,EAAE,aAAa;YACrB,YAAY,EAAE,aAAa,CAAC,MAAM;YAClC,eAAe;YACf,WAAW;YACX,YAAY;SACb,CAAC,CAAC;IACL,CAAC;IAED,2BAA2B;IAC3B,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IAEnC,6DAA6D;IAC7D,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,GAAG,oBAAoB,CACpE,CAAC;IAEF,6EAA6E;IAC7E,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,YAAY;QAC/B,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY;QACjC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CACpC,CAAC;IAEF,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IACnC,MAAM,QAAQ,GAAG,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAEjD,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACpC,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;QAClD,MAAM,SAAS,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IAED,4BAA4B;IAC5B,MAAM,MAAM,GAAG;QACb,KAAK;QACL,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,KAAK;QAC5B,QAAQ;QACR,UAAU;QACV,mBAAmB;QACnB,oBAAoB;QACpB,iBAAiB;QACjB,aAAa,EAAE,QAAQ,CAAC,MAAM;QAC9B,cAAc,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACnC,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,eAAe,EAAE,CAAC,CAAC,eAAe;YAClC,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,QAAQ,EAAE,CAAC,CAAC,WAAW,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,GAAG,oBAAoB;SACvE,CAAC,CAAC;QACH,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5B,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,eAAe,EAAE,CAAC,CAAC,eAAe;YAClC,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,YAAY,EAAE,CAAC,CAAC,YAAY;SAC7B,CAAC,CAAC;KACJ,CAAC;IACF,MAAM,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,aAAa,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAE1F,OAAO;QACL,QAAQ;QACR,UAAU;QACV,mBAAmB;QACnB,aAAa,EAAE,QAAQ,CAAC,MAAM;KAC/B,CAAC;AACJ,CAAC"}

package/dist/orchestrator/selfimprove/replay-harness.d.ts

@@ -0,0 +1,65 @@
+/**
+ * PURE deterministic regression gate for the replay corpus.
+ *
+ * PURE — compareToBaseline must not import from ../providers; no network, no
+ * Date.now(), no side effects, no filesystem access. All inputs are parameters.
+ * Fresh verdicts are re-derived from frozen eval_details_json — NOT by
+ * re-running the generator or evaluator LLM.
+ *
+ * Regression / improvement classification:
+ *   baseline 'pass' + fresh 'fail' → regression
+ *   baseline 'fail' + fresh 'pass' → improvement
+ *   same verdict                   → unchanged
+ *
+ * A regression is STRICTLY pass→fail. CaseIds present only in fresh (not in
+ * baseline) are not classified at all — the baseline corpus defines the gate.
+ *
+ * Fresh-verdict derivation rule (deterministic, no LLM):
+ *   Parse evalDetailsJson (JSON array of result objects). The fresh verdict is
+ *   'fail' iff any element's failures[] contains an entry with
+ *   passed === false AND severity === 'error'. Otherwise 'pass'.
+ *   Malformed / missing fields → treated as 'pass' (no error-severity failure).
+ */
+import type { BoberConfig } from "../../config/schema.js";
+export type Verdict = "pass" | "fail";
+export interface ReplayComparison {
+    /** caseIds where baseline was 'pass' and fresh is 'fail'. */
+    regressions: string[];
+    /** caseIds where baseline was 'fail' and fresh is 'pass'. */
+    improvements: string[];
+    /** caseIds where verdict did not change. */
+    unchanged: string[];
+}
+/** Extended comparison result returned by runReplayHarness. */
+export interface ReplayHarnessResult extends ReplayComparison {
+    /** Total number of cases in the corpus. */
+    total: number;
+    /** Fresh verdicts keyed by caseId (for CLI table rendering). */
+    fresh: Map<string, Verdict>;
+    /** Baseline verdicts keyed by caseId (for CLI table rendering). */
+    baseline: Map<string, Verdict>;
+}
+/**
+ * PURE comparator. Classifies each caseId present in `baseline` as regression,
+ * improvement, or unchanged based on the transition of verdict.
+ *
+ * PURE — no clock, no fs, no LLM. All inputs are parameters.
+ *
+ * @param baseline  Map<caseId, Verdict> from the captured corpus.
+ * @param fresh     Map<caseId, Verdict> re-derived from frozen evalDetailsJson.
+ * @returns         Sorted arrays for deterministic, byte-identical output.
+ */
+export declare function compareToBaseline(baseline: Map<string, Verdict>, fresh: Map<string, Verdict>): ReplayComparison;
+/**
+ * Open the Sprint-1 ReplayStore, re-derive fresh verdicts deterministically
+ * from each case's frozen evalDetailsJson, and return a regression/improvement
+ * breakdown via compareToBaseline.
+ *
+ * NEVER re-runs the generator or evaluator LLM — fresh verdicts come only from
+ * the frozen captured eval_details_json (the deterministic fresh-verdict rule).
+ *
+ * @param projectRoot  Absolute path to the project root.
+ * @param config       Already-loaded BoberConfig. config.selfImprove is OPTIONAL.
+ */
+export declare function runReplayHarness(projectRoot: string, config: BoberConfig): Promise<ReplayHarnessResult>;
+//# sourceMappingURL=replay-harness.d.ts.map

package/dist/orchestrator/selfimprove/replay-harness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay-harness.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/selfimprove/replay-harness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAK1D,MAAM,MAAM,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;AAEtC,MAAM,WAAW,gBAAgB;IAC/B,6DAA6D;IAC7D,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,6DAA6D;IAC7D,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,4CAA4C;IAC5C,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,+DAA+D;AAC/D,MAAM,WAAW,mBAAoB,SAAQ,gBAAgB;IAC3D,2CAA2C;IAC3C,KAAK,EAAE,MAAM,CAAC;IACd,gEAAgE;IAChE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC5B,mEAAmE;IACnE,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAWD;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,EAC9B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,GAC1B,gBAAgB,CAwBlB;AA6CD;;;;;;;;;;GAUG;AACH,wBAAsB,gBAAgB,CACpC,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,WAAW,GAClB,OAAO,CAAC,mBAAmB,CAAC,CAuB9B"}

package/dist/orchestrator/selfimprove/replay-harness.js

@@ -0,0 +1,134 @@
+/**
+ * PURE deterministic regression gate for the replay corpus.
+ *
+ * PURE — compareToBaseline must not import from ../providers; no network, no
+ * Date.now(), no side effects, no filesystem access. All inputs are parameters.
+ * Fresh verdicts are re-derived from frozen eval_details_json — NOT by
+ * re-running the generator or evaluator LLM.
+ *
+ * Regression / improvement classification:
+ *   baseline 'pass' + fresh 'fail' → regression
+ *   baseline 'fail' + fresh 'pass' → improvement
+ *   same verdict                   → unchanged
+ *
+ * A regression is STRICTLY pass→fail. CaseIds present only in fresh (not in
+ * baseline) are not classified at all — the baseline corpus defines the gate.
+ *
+ * Fresh-verdict derivation rule (deterministic, no LLM):
+ *   Parse evalDetailsJson (JSON array of result objects). The fresh verdict is
+ *   'fail' iff any element's failures[] contains an entry with
+ *   passed === false AND severity === 'error'. Otherwise 'pass'.
+ *   Malformed / missing fields → treated as 'pass' (no error-severity failure).
+ */
+import { join } from "node:path";
+import { ReplayStore } from "./replay-store.js";
+// ── Helpers ───────────────────────────────────────────────────────────
+/** Lenient record narrowing — mirrors distill.ts:83-85. */
+function isRecord(v) {
+    return typeof v === "object" && v !== null && !Array.isArray(v);
+}
+// ── PURE: compareToBaseline ───────────────────────────────────────────
+/**
+ * PURE comparator. Classifies each caseId present in `baseline` as regression,
+ * improvement, or unchanged based on the transition of verdict.
+ *
+ * PURE — no clock, no fs, no LLM. All inputs are parameters.
+ *
+ * @param baseline  Map<caseId, Verdict> from the captured corpus.
+ * @param fresh     Map<caseId, Verdict> re-derived from frozen evalDetailsJson.
+ * @returns         Sorted arrays for deterministic, byte-identical output.
+ */
+export function compareToBaseline(baseline, fresh) {
+    const regressions = [];
+    const improvements = [];
+    const unchanged = [];
+    for (const [caseId, baselineVerdict] of baseline) {
+        // CaseIds absent from fresh use the baseline verdict (treat as unchanged).
+        const freshVerdict = fresh.get(caseId) ?? baselineVerdict;
+        if (baselineVerdict === "pass" && freshVerdict === "fail") {
+            regressions.push(caseId);
+        }
+        else if (baselineVerdict === "fail" && freshVerdict === "pass") {
+            improvements.push(caseId);
+        }
+        else {
+            unchanged.push(caseId);
+        }
+    }
+    // Sort for deterministic, byte-identical output — mirrors distill.ts:286.
+    regressions.sort((a, b) => a.localeCompare(b));
+    improvements.sort((a, b) => a.localeCompare(b));
+    unchanged.sort((a, b) => a.localeCompare(b));
+    return { regressions, improvements, unchanged };
+}
+// ── Fresh-verdict derivation (deterministic, NO LLM) ─────────────────
+/**
+ * Re-derive a single fresh verdict from the frozen evalDetailsJson string.
+ *
+ * Rule: parse the JSON array; verdict is 'fail' iff any element's failures[]
+ * contains an entry with passed === false AND severity === 'error'.
+ * Any malformed / absent field is treated permissively → 'pass'.
+ *
+ * @param evalDetailsJson  JSON.stringify(payload.results) captured at record time.
+ */
+function deriveFreshVerdict(evalDetailsJson) {
+    let parsed;
+    try {
+        parsed = JSON.parse(evalDetailsJson);
+    }
+    catch {
+        return "pass"; // Malformed JSON → no error-severity failure found.
+    }
+    if (!Array.isArray(parsed)) {
+        return "pass";
+    }
+    for (const element of parsed) {
+        if (!isRecord(element))
+            continue;
+        const failures = element["failures"];
+        if (!Array.isArray(failures))
+            continue;
+        for (const detail of failures) {
+            if (!isRecord(detail))
+                continue;
+            if (detail["passed"] === false && detail["severity"] === "error") {
+                return "fail";
+            }
+        }
+    }
+    return "pass";
+}
+// ── async: runReplayHarness ───────────────────────────────────────────
+/**
+ * Open the Sprint-1 ReplayStore, re-derive fresh verdicts deterministically
+ * from each case's frozen evalDetailsJson, and return a regression/improvement
+ * breakdown via compareToBaseline.
+ *
+ * NEVER re-runs the generator or evaluator LLM — fresh verdicts come only from
+ * the frozen captured eval_details_json (the deterministic fresh-verdict rule).
+ *
+ * @param projectRoot  Absolute path to the project root.
+ * @param config       Already-loaded BoberConfig. config.selfImprove is OPTIONAL.
+ */
+export async function runReplayHarness(projectRoot, config) {
+    // bober: default replayDir so missing selfImprove section is non-fatal.
+    const replayDir = config.selfImprove?.replayDir ?? ".bober/replay";
+    const dbPath = join(projectRoot, replayDir, "replay.db");
+    const store = new ReplayStore(dbPath);
+    try {
+        const cases = store.listCases();
+        const total = cases.length;
+        const baseline = new Map();
+        const fresh = new Map();
+        for (const record of cases) {
+            baseline.set(record.caseId, record.baselineVerdict);
+            fresh.set(record.caseId, deriveFreshVerdict(record.evalDetailsJson));
+        }
+        const comparison = compareToBaseline(baseline, fresh);
+        return { ...comparison, total, baseline, fresh };
+    }
+    finally {
+        store.close();
+    }
+}
+//# sourceMappingURL=replay-harness.js.map

package/dist/orchestrator/selfimprove/replay-harness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay-harness.js","sourceRoot":"","sources":["../../../src/orchestrator/selfimprove/replay-harness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAGjC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAyBhD,yEAAyE;AAEzE,2DAA2D;AAC3D,SAAS,QAAQ,CAAC,CAAU;IAC1B,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAClE,CAAC;AAED,yEAAyE;AAEzE;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAA8B,EAC9B,KAA2B;IAE3B,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,KAAK,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjD,2EAA2E;QAC3E,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,eAAe,CAAC;QAE1D,IAAI,eAAe,KAAK,MAAM,IAAI,YAAY,KAAK,MAAM,EAAE,CAAC;YAC1D,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,eAAe,KAAK,MAAM,IAAI,YAAY,KAAK,MAAM,EAAE,CAAC;YACjE,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7C,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC;AAClD,CAAC;AAED,wEAAwE;AAExE;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CAAC,eAAuB;IACjD,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACvC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,MAAM,CAAC,CAAC,oDAAoD;IACrE,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;QAC7B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,SAAS;QAEjC,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;YAAE,SAAS;QAEvC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAAE,SAAS;YAEhC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,KAAK,IAAI,MAAM,CAAC,UAAU,CAAC,KAAK,OAAO,EAAE,CAAC;gBACjE,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,yEAAyE;AAEzE;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,WAAmB,EACnB,MAAmB;IAEnB,wEAAwE;IACxE,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,EAAE,SAAS,IAAI,eAAe,CAAC;IACnE,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;IAEzD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAE3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAmB,CAAC;QAEzC,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,eAAe,CAAC,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,kBAAkB,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC;QACvE,CAAC;QAED,MAAM,UAAU,GAAG,iBAAiB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QACtD,OAAO,EAAE,GAAG,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IACnD,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC"}

package/dist/orchestrator/selfimprove/replay-store.d.ts

@@ -0,0 +1,45 @@
+import { type ReplayCaseInput, type ReplayCaseRecord } from "./replay-types.js";
+/**
+ * Derive a deterministic 16-char hex case id from the case signature.
+ * caseId = sha256(`${contractId}|${iteration}|${diffDigest}`).slice(0,16)
+ * MIRRORS factId at src/state/facts.ts:58-69.
+ *
+ * NOTE: tCaptured is intentionally EXCLUDED from the hash so the id stays
+ * stable across captures — only a change in diffDigest changes the id.
+ * Identical inputs always produce the same id — no wall-clock dependency.
+ */
+export declare function caseId(contractId: string, iteration: number, diffDigest: string): string;
+/**
+ * SQLite-backed replay case store.
+ *
+ * PURE: Never calls Date.now() or new Date() — every timestamp is a parameter.
+ * Hidden behind this interface so the driver (better-sqlite3) is swappable.
+ *
+ * bober: in-memory or file-backed via better-sqlite3 (synchronous); swap for
+ * node:sqlite when engines.node is raised to >=22.5.
+ */
+export declare class ReplayStore {
+    private db;
+    constructor(dbPath: string);
+    /**
+     * Insert or replace a replay case. Validates input with ReplayCaseSchema and
+     * derives the deterministic caseId. Returns the persisted ReplayCaseRecord.
+     */
+    putCase(input: ReplayCaseInput): ReplayCaseRecord;
+    /**
+     * Return a single replay case by its id.
+     * Returns null if not found.
+     */
+    getCase(id: string): ReplayCaseRecord | null;
+    /**
+     * Return all replay cases ordered by t_captured ascending.
+     */
+    listCases(): ReplayCaseRecord[];
+    /**
+     * Return the baseline verdict for a case id, or null if not found.
+     */
+    getBaselineVerdict(id: string): string | null;
+    /** Close the underlying database connection. */
+    close(): void;
+}
+//# sourceMappingURL=replay-store.d.ts.map

package/dist/orchestrator/selfimprove/replay-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay-store.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/selfimprove/replay-store.ts"],"names":[],"mappings":"AAIA,OAAO,EAEL,KAAK,eAAe,EACpB,KAAK,gBAAgB,EACtB,MAAM,mBAAmB,CAAC;AAI3B;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CACpB,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,GACjB,MAAM,CAKR;AA4BD;;;;;;;;GAQG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,EAAE,CAAe;gBAEb,MAAM,EAAE,MAAM;IAe1B;;;OAGG;IACH,OAAO,CAAC,KAAK,EAAE,eAAe,GAAG,gBAAgB;IAsCjD;;;OAGG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI;IAO5C;;OAEG;IACH,SAAS,IAAI,gBAAgB,EAAE;IAO/B;;OAEG;IACH,kBAAkB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAO7C,gDAAgD;IAChD,KAAK,IAAI,IAAI;CAGd"}