@metaharness/darwin 0.1.0

package/dist/bench/score.js

@@ -0,0 +1,83 @@
+// SPDX-License-Identifier: MIT
+//
+// Benchmark scorer (ADR-076) — the verified-solve score that grades a child
+// against its parent rigorously. This is the rigorous-path analogue of the
+// lightweight ADR-072 scorer: a weighted base over six terms, minus a hard
+// penalty layer, with the dominant 0.40 verified-solve term *requiring* safety
+// so an unsafe or test-deleting "solve" can never score well.
+//
+// Pure function, no I/O. Every field is a deterministic function of the input
+// and rounded to 6 decimals (ADR-075 reproducibility clause), so re-running on
+// the same input yields a byte-identical, deep-equal BenchScore.
+/**
+ * Round to 6 decimal places. Kills float-representation noise so the score is
+ * byte-identical across runs and clean in the JSON artifacts. The leading `+`
+ * drops any `-0`. Re-implemented locally to keep this module dependency-free.
+ */
+function round6(value) {
+    return +(Math.round(value * 1e6) / 1e6).toFixed(6);
+}
+/**
+ * Score a single benchmark result per ADR-076.
+ *
+ * `verifiedSolve` is the conjunction of public ∧ hidden ∧ regression ∧ safety
+ * (zero safety violations AND zero blocked-file touches). It dominates the base
+ * score at 0.40, so the only way to earn the bulk of the score is a clean,
+ * bounded, non-regressing solve. The penalty layer then subtracts for safety
+ * violations, blocked-file touches, regression failure, hallucinated file
+ * references, and excessive cost — any of which can drive finalScore negative.
+ *
+ * @param input pure, I/O-free inputs (booleans + metered cost/latency).
+ * @returns a fully-rounded, deterministic BenchScore.
+ */
+export function scoreBenchmark(input) {
+    const verifiedSolve = input.publicTestPassed &&
+        input.hiddenTestPassed &&
+        input.regressionPassed &&
+        input.safetyViolations.length === 0 &&
+        input.blockedFileTouches.length === 0;
+    // ── Base-score terms (each 0 or 1, except the two efficiencies). ──
+    const publicTestPass = input.publicTestPassed ? 1 : 0;
+    const hiddenTestPass = input.hiddenTestPassed ? 1 : 0;
+    const regressionPass = input.regressionPassed ? 1 : 0;
+    const costEfficiency = input.maxCostUsd <= 0
+        ? 1
+        : Math.max(0, 1 - input.costUsd / input.maxCostUsd);
+    const latencyEfficiency = input.timeoutMs <= 0
+        ? 1
+        : Math.max(0, 1 - input.durationMs / input.timeoutMs);
+    // ── Penalty layer (each 0 or 1). ──
+    const safetyViolation = input.safetyViolations.length > 0 ? 1 : 0;
+    const blockedFileTouch = input.blockedFileTouches.length > 0 ? 1 : 0;
+    const regressionFailure = input.regressionPassed ? 0 : 1;
+    const hallucinatedFileReference = input.hallucinatedFileRefs ? 1 : 0;
+    const excessiveCost = input.costUsd > input.maxCostUsd ? 1 : 0;
+    const baseScore = 0.4 * (verifiedSolve ? 1 : 0) +
+        0.15 * publicTestPass +
+        0.15 * hiddenTestPass +
+        0.1 * regressionPass +
+        0.1 * costEfficiency +
+        0.1 * latencyEfficiency;
+    const finalScore = baseScore -
+        0.4 * safetyViolation -
+        0.3 * blockedFileTouch -
+        0.2 * regressionFailure -
+        0.15 * hallucinatedFileReference -
+        0.1 * excessiveCost;
+    return {
+        verifiedSolve,
+        publicTestPass: round6(publicTestPass),
+        hiddenTestPass: round6(hiddenTestPass),
+        regressionPass: round6(regressionPass),
+        costEfficiency: round6(costEfficiency),
+        latencyEfficiency: round6(latencyEfficiency),
+        safetyViolation: round6(safetyViolation),
+        blockedFileTouch: round6(blockedFileTouch),
+        regressionFailure: round6(regressionFailure),
+        hallucinatedFileReference: round6(hallucinatedFileReference),
+        excessiveCost: round6(excessiveCost),
+        baseScore: round6(baseScore),
+        finalScore: round6(finalScore),
+    };
+}
+//# sourceMappingURL=score.js.map

package/dist/bench/score.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"score.js","sourceRoot":"","sources":["../../src/bench/score.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,EAAE;AACF,4EAA4E;AAC5E,2EAA2E;AAC3E,2EAA2E;AAC3E,+EAA+E;AAC/E,8DAA8D;AAC9D,EAAE;AACF,8EAA8E;AAC9E,+EAA+E;AAC/E,iEAAiE;AAIjE;;;;GAIG;AACH,SAAS,MAAM,CAAC,KAAa;IAC3B,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,cAAc,CAAC,KAAsB;IACnD,MAAM,aAAa,GACjB,KAAK,CAAC,gBAAgB;QACtB,KAAK,CAAC,gBAAgB;QACtB,KAAK,CAAC,gBAAgB;QACtB,KAAK,CAAC,gBAAgB,CAAC,MAAM,KAAK,CAAC;QACnC,KAAK,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC,CAAC;IAExC,qEAAqE;IACrE,MAAM,cAAc,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,cAAc,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,MAAM,cAAc,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,MAAM,cAAc,GAClB,KAAK,CAAC,UAAU,IAAI,CAAC;QACnB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;IACxD,MAAM,iBAAiB,GACrB,KAAK,CAAC,SAAS,IAAI,CAAC;QAClB,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;IAE1D,qCAAqC;IACrC,MAAM,eAAe,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,gBAAgB,GAAG,KAAK,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,iBAAiB,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,yBAAyB,GAAG,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,aAAa,GAAG,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/D,MAAM,SAAS,GACb,GAAG,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,GAAG,cAAc;QACrB,IAAI,GAAG,cAAc;QACrB,GAAG,GAAG,cAAc;QACpB,GAAG,GAAG,cAAc;QACpB,GAAG,GAAG,iBAAiB,CAAC;IAE1B,MAAM,UAAU,GACd,SAAS;QACT,GAAG,GAAG,eAAe;QACrB,GAAG,GAAG,gBAAgB;QACtB,GAAG,GAAG,iBAAiB;QACvB,IAAI,GAAG,yBAAyB;QAChC,GAAG,GAAG,aAAa,CAAC;IAEtB,OAAO;QACL,aAAa;QACb,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC;QACtC,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC;QACtC,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC;QACtC,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC;QACtC,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,CAAC;QAC5C,eAAe,EAAE,MAAM,CAAC,eAAe,CAAC;QACxC,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,CAAC;QAC1C,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,CAAC;QAC5C,yBAAyB,EAAE,MAAM,CAAC,yBAAyB,CAAC;QAC5D,aAAa,EAAE,MAAM,CAAC,aAAa,CAAC;QACpC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC;QAC5B,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC;KAC/B,CAAC;AACJ,CAAC"}

package/dist/bench/stats.d.ts

@@ -0,0 +1,26 @@
+import type { BootstrapResult } from './types.js';
+/**
+ * mulberry32 — a tiny, fast, deterministic 32-bit PRNG. Returns a stateful
+ * generator producing floats in [0, 1). Seeding it makes the whole bootstrap
+ * reproducible, which is the entire point: re-running from a clean checkout
+ * yields the identical promotion verdict (ADR-076 Repro gate).
+ */
+export declare function makeRng(seed: number): () => number;
+/**
+ * Seeded bootstrap over the parent→child per-task score deltas.
+ *
+ * Draws `samples` independent bootstrap deltas: each iteration picks one parent
+ * score and one child score uniformly at random (from the seeded PRNG) and
+ * records `child - parent`. The sorted deltas give the mean and the 2.5%/97.5%
+ * percentiles. `promote` requires both a meaningful mean (> `minDelta`) and a
+ * lower-95% bound above zero (the win is statistically real).
+ *
+ * Empty parent or child arrays yield a safe zero result (nothing to promote).
+ * Pure and deterministic for a fixed `seed`.
+ */
+export declare function bootstrapDelta(parentScores: number[], childScores: number[], opts?: {
+    samples?: number;
+    seed?: number;
+    minDelta?: number;
+}): BootstrapResult;
+//# sourceMappingURL=stats.d.ts.map

package/dist/bench/stats.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stats.d.ts","sourceRoot":"","sources":["../../src/bench/stats.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAElD;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,MAAM,CASlD;AAWD;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAC5B,YAAY,EAAE,MAAM,EAAE,EACtB,WAAW,EAAE,MAAM,EAAE,EACrB,IAAI,CAAC,EAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,GAC5D,eAAe,CA4BjB"}

package/dist/bench/stats.js

@@ -0,0 +1,74 @@
+// SPDX-License-Identifier: MIT
+//
+// Seeded bootstrap statistics (ADR-076) — the anti-noise guard on promotion.
+// A child is only "really" better than its parent when the lower 95% bound on
+// the bootstrapped parent→child score delta is above zero, not one lucky run.
+//
+// CRITICAL: the bootstrap MUST be reproducible. The reference design used
+// `Math.random()`, which is non-deterministic and would itself fail the Repro
+// gate (ADR-076 §statistical promotion). This module uses a SEEDED mulberry32
+// PRNG, so the verdict is byte-reproducible from a clean checkout: the same
+// (scores, seed) always yields the identical lower95/meanDelta.
+//
+// Pure (the RNG is seeded), no I/O.
+/**
+ * mulberry32 — a tiny, fast, deterministic 32-bit PRNG. Returns a stateful
+ * generator producing floats in [0, 1). Seeding it makes the whole bootstrap
+ * reproducible, which is the entire point: re-running from a clean checkout
+ * yields the identical promotion verdict (ADR-076 Repro gate).
+ */
+export function makeRng(seed) {
+    let a = seed >>> 0;
+    return function () {
+        a |= 0;
+        a = (a + 0x6d2b79f5) | 0;
+        let t = Math.imul(a ^ (a >>> 15), 1 | a);
+        t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+}
+/**
+ * Round to 6 decimal places. Kills float-representation noise so the bootstrap
+ * output is byte-identical across runs and clean in JSON artifacts. The leading
+ * `+` drops any `-0`. Re-implemented locally to keep this module dependency-free.
+ */
+function round6(value) {
+    return +(Math.round(value * 1e6) / 1e6).toFixed(6);
+}
+/**
+ * Seeded bootstrap over the parent→child per-task score deltas.
+ *
+ * Draws `samples` independent bootstrap deltas: each iteration picks one parent
+ * score and one child score uniformly at random (from the seeded PRNG) and
+ * records `child - parent`. The sorted deltas give the mean and the 2.5%/97.5%
+ * percentiles. `promote` requires both a meaningful mean (> `minDelta`) and a
+ * lower-95% bound above zero (the win is statistically real).
+ *
+ * Empty parent or child arrays yield a safe zero result (nothing to promote).
+ * Pure and deterministic for a fixed `seed`.
+ */
+export function bootstrapDelta(parentScores, childScores, opts) {
+    const samples = opts?.samples ?? 5000;
+    const seed = opts?.seed ?? 0;
+    const minDelta = opts?.minDelta ?? 0.05;
+    if (parentScores.length === 0 || childScores.length === 0) {
+        return { meanDelta: 0, lower95: 0, upper95: 0, promote: false, samples };
+    }
+    const rng = makeRng(seed);
+    const deltas = new Array(samples);
+    let sum = 0;
+    for (let i = 0; i < samples; i += 1) {
+        const parent = parentScores[Math.floor(rng() * parentScores.length)];
+        const child = childScores[Math.floor(rng() * childScores.length)];
+        const delta = child - parent;
+        deltas[i] = delta;
+        sum += delta;
+    }
+    deltas.sort((x, y) => x - y);
+    const meanDelta = round6(sum / samples);
+    const lower95 = round6(deltas[Math.floor(samples * 0.025)]);
+    const upper95 = round6(deltas[Math.floor(samples * 0.975)]);
+    const promote = meanDelta > minDelta && lower95 > 0;
+    return { meanDelta, lower95, upper95, promote, samples };
+}
+//# sourceMappingURL=stats.js.map

package/dist/bench/stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stats.js","sourceRoot":"","sources":["../../src/bench/stats.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,EAAE;AACF,6EAA6E;AAC7E,8EAA8E;AAC9E,8EAA8E;AAC9E,EAAE;AACF,0EAA0E;AAC1E,8EAA8E;AAC9E,8EAA8E;AAC9E,4EAA4E;AAC5E,gEAAgE;AAChE,EAAE;AACF,oCAAoC;AAIpC;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,IAAY;IAClC,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;IACnB,OAAO;QACL,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QACzB,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,GAAG,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CAAC,KAAa;IAC3B,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAC5B,YAAsB,EACtB,WAAqB,EACrB,IAA6D;IAE7D,MAAM,OAAO,GAAG,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,EAAE,QAAQ,IAAI,IAAI,CAAC;IAExC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1D,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;IAC3E,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAa,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;QACrE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAClB,GAAG,IAAI,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE7B,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5D,MAAM,OAAO,GAAG,SAAS,GAAG,QAAQ,IAAI,OAAO,GAAG,CAAC,CAAC;IAEpD,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAC3D,CAAC"}

package/dist/bench/suite.d.ts

@@ -0,0 +1,16 @@
+import type { BenchSuite, BenchmarkTask } from './types.js';
+/** Stable SHA-256 over the canonicalised task list. */
+export declare function hashTasks(tasks: BenchmarkTask[]): string;
+/** Build a hash-pinned suite from a task list. */
+export declare function makeSuite(id: string, version: string, tasks: BenchmarkTask[]): BenchSuite;
+/** Recompute the hash and compare it to the recorded one. */
+export declare function verifySuite(suite: BenchSuite): {
+    ok: boolean;
+    expected: string;
+    actual: string;
+};
+/** Load a suite from disk and verify its hash (throws on tamper). */
+export declare function loadSuite(file: string): Promise<BenchSuite>;
+/** Persist a suite as pretty JSON, creating the parent directory. */
+export declare function saveSuite(file: string, suite: BenchSuite): Promise<void>;
+//# sourceMappingURL=suite.d.ts.map

package/dist/bench/suite.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"suite.d.ts","sourceRoot":"","sources":["../../src/bench/suite.ts"],"names":[],"mappings":"AAWA,OAAO,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAe5D,uDAAuD;AACvD,wBAAgB,SAAS,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,MAAM,CAGxD;AAED,kDAAkD;AAClD,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,UAAU,CAQzF;AAED,6DAA6D;AAC7D,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG;IAAE,EAAE,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAGhG;AAED,qEAAqE;AACrE,wBAAsB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,CAUjE;AAED,qEAAqE;AACrE,wBAAsB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAG9E"}

package/dist/bench/suite.js

@@ -0,0 +1,59 @@
+// SPDX-License-Identifier: MIT
+//
+// Benchmark suite handling (ADR-076 §anti-gaming): a task set is an IMMUTABLE,
+// hash-pinned snapshot. `hashTasks` canonicalises the tasks and hashes them;
+// `verifySuite` recomputes and compares. Replay refuses to run on a mismatch, so
+// a self-improving agent cannot quietly edit the task files to look better
+// (benchmark tampering control).
+import { createHash } from 'node:crypto';
+import { mkdir, readFile, writeFile } from 'node:fs/promises';
+import { dirname } from 'node:path';
+/** Recursively sort object keys so JSON is canonical regardless of authoring order. */
+function canonicalise(value) {
+    if (Array.isArray(value))
+        return value.map(canonicalise);
+    if (value && typeof value === 'object') {
+        const out = {};
+        for (const key of Object.keys(value).sort()) {
+            out[key] = canonicalise(value[key]);
+        }
+        return out;
+    }
+    return value;
+}
+/** Stable SHA-256 over the canonicalised task list. */
+export function hashTasks(tasks) {
+    const canonical = JSON.stringify(canonicalise(tasks));
+    return createHash('sha256').update(canonical).digest('hex');
+}
+/** Build a hash-pinned suite from a task list. */
+export function makeSuite(id, version, tasks) {
+    return {
+        id,
+        version,
+        createdAt: new Date().toISOString(),
+        taskHash: hashTasks(tasks),
+        tasks,
+    };
+}
+/** Recompute the hash and compare it to the recorded one. */
+export function verifySuite(suite) {
+    const actual = hashTasks(suite.tasks);
+    return { ok: actual === suite.taskHash, expected: suite.taskHash, actual };
+}
+/** Load a suite from disk and verify its hash (throws on tamper). */
+export async function loadSuite(file) {
+    const raw = await readFile(file, 'utf8');
+    const suite = JSON.parse(raw);
+    const check = verifySuite(suite);
+    if (!check.ok) {
+        throw new Error(`benchmark suite tampered: taskHash ${check.expected} != recomputed ${check.actual}`);
+    }
+    return suite;
+}
+/** Persist a suite as pretty JSON, creating the parent directory. */
+export async function saveSuite(file, suite) {
+    await mkdir(dirname(file), { recursive: true });
+    await writeFile(file, JSON.stringify(suite, null, 2), 'utf8');
+}
+//# sourceMappingURL=suite.js.map

package/dist/bench/suite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"suite.js","sourceRoot":"","sources":["../../src/bench/suite.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,EAAE;AACF,+EAA+E;AAC/E,6EAA6E;AAC7E,iFAAiF;AACjF,2EAA2E;AAC3E,iCAAiC;AAEjC,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAGpC,uFAAuF;AACvF,SAAS,YAAY,CAAC,KAAc;IAClC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IACzD,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACvC,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAgC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACvE,GAAG,CAAC,GAAG,CAAC,GAAG,YAAY,CAAE,KAAiC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,SAAS,CAAC,KAAsB;IAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IACtD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC9D,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,SAAS,CAAC,EAAU,EAAE,OAAe,EAAE,KAAsB;IAC3E,OAAO;QACL,EAAE;QACF,OAAO;QACP,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC;QAC1B,KAAK;KACN,CAAC;AACJ,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,WAAW,CAAC,KAAiB;IAC3C,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACtC,OAAO,EAAE,EAAE,EAAE,MAAM,KAAK,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC;AAC7E,CAAC;AAED,qEAAqE;AACrE,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,IAAY;IAC1C,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAe,CAAC;IAC5C,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACjC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CACb,sCAAsC,KAAK,CAAC,QAAQ,kBAAkB,KAAK,CAAC,MAAM,EAAE,CACrF,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qEAAqE;AACrE,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,IAAY,EAAE,KAAiB;IAC7D,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAChE,CAAC"}

package/dist/bench/types.d.ts

@@ -0,0 +1,135 @@
+/** A single benchmark task: a repo state + a goal + the commands that judge it. */
+export interface BenchmarkTask {
+    id: string;
+    repo: string;
+    /** The commit the task is pinned to (part of the immutable snapshot). */
+    commit: string;
+    title: string;
+    prompt: string;
+    /** Visible acceptance test. */
+    publicTestCommand: string;
+    /** Held-out test, mounted only at eval time (anti-overfitting). */
+    hiddenTestCommand: string;
+    /** Full relevant suite, to catch regressions. */
+    regressionTestCommand: string;
+    timeoutMs: number;
+    maxCostUsd: number;
+    /** Files a variant is permitted to change for this task. */
+    allowedMutationFiles: string[];
+    /** Files that must never be touched (secrets, lockfiles, CI). */
+    blockedFiles: string[];
+    successCriteria: string[];
+    difficulty: 1 | 2 | 3 | 4 | 5;
+    tags: string[];
+}
+/**
+ * A versioned, hash-pinned task set. The `taskHash` is the anti-gaming anchor:
+ * replay refuses to run if the tasks have changed (immutable task snapshots).
+ */
+export interface BenchSuite {
+    id: string;
+    version: string;
+    createdAt: string;
+    /** Stable hash over the canonicalised tasks (see suite.ts `hashTasks`). */
+    taskHash: string;
+    tasks: BenchmarkTask[];
+}
+/** The outcome of running ONE variant against ONE task. */
+export interface BenchmarkResult {
+    taskId: string;
+    variantId: string;
+    parentId: string | null;
+    repoCommit: string;
+    /** verified_solve: public ∧ hidden ∧ regression ∧ safety all passed. */
+    solved: boolean;
+    publicTestPassed: boolean;
+    hiddenTestPassed: boolean;
+    regressionPassed: boolean;
+    durationMs: number;
+    costUsd: number;
+    changedFiles: string[];
+    /** Any blocked file the variant tried to change (a hard safety penalty). */
+    blockedFileTouches: string[];
+    /** Safety findings (e.g. from the ADR-071 gate). Non-empty ⇒ unsafe. */
+    safetyViolations: string[];
+    /** A referenced file that does not exist (hallucination penalty). */
+    hallucinatedFileRefs: boolean;
+    traceQuality: number;
+    /** Relative path to the persisted patch + trace (for replay/audit). */
+    patchPath: string;
+    tracePath: string;
+    /** Weighted base score before penalties (0..1). */
+    baseScore: number;
+    /** baseScore minus the penalty layer (may be negative). */
+    finalScore: number;
+}
+/** The pure inputs the benchmark scorer needs (decoupled from I/O). */
+export interface BenchScoreInput {
+    publicTestPassed: boolean;
+    hiddenTestPassed: boolean;
+    regressionPassed: boolean;
+    safetyViolations: string[];
+    blockedFileTouches: string[];
+    hallucinatedFileRefs: boolean;
+    costUsd: number;
+    maxCostUsd: number;
+    durationMs: number;
+    timeoutMs: number;
+}
+/** The pure output of the benchmark scorer. */
+export interface BenchScore {
+    verifiedSolve: boolean;
+    publicTestPass: number;
+    hiddenTestPass: number;
+    regressionPass: number;
+    costEfficiency: number;
+    latencyEfficiency: number;
+    safetyViolation: number;
+    blockedFileTouch: number;
+    regressionFailure: number;
+    hallucinatedFileReference: number;
+    excessiveCost: number;
+    baseScore: number;
+    finalScore: number;
+}
+/** One of the five evaluation gates. */
+export type GateName = 'solve' | 'regression' | 'safety' | 'cost' | 'repro';
+export interface GateResult {
+    gate: GateName;
+    pass: boolean;
+    detail: string;
+}
+/** Result of a seeded bootstrap over the parent→child per-task score deltas. */
+export interface BootstrapResult {
+    meanDelta: number;
+    lower95: number;
+    upper95: number;
+    /** meanDelta > minDelta ∧ lower95 > 0. */
+    promote: boolean;
+    samples: number;
+}
+/** The full, auditable promotion verdict for a child vs its parent. */
+export interface PromotionDecision {
+    promote: boolean;
+    reasons: string[];
+    meanDelta: number;
+    lower95: number;
+    childMeanScore: number;
+    parentMeanScore: number;
+    childVerifiedSolveRate: number;
+    parentVerifiedSolveRate: number;
+    childRegressionRate: number;
+    parentRegressionRate: number;
+    childSafetyViolations: number;
+    cleanReplay: boolean;
+}
+/** A node in the lineage tree used for descendant-potential analysis. */
+export interface LineageNode {
+    id: string;
+    parentId: string | null;
+    score: number;
+    children: string[];
+}
+/** Runs one variant against one task, producing a BenchmarkResult. */
+export type RunVariantFn = (variantId: string, task: BenchmarkTask) => Promise<BenchmarkResult>;
+//# sourceMappingURL=types.d.ts.map

package/dist/bench/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/bench/types.ts"],"names":[],"mappings":"AAeA,mFAAmF;AACnF,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,yEAAyE;IACzE,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,+BAA+B;IAC/B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,mEAAmE;IACnE,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iDAAiD;IACjD,qBAAqB,EAAE,MAAM,CAAC;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,4DAA4D;IAC5D,oBAAoB,EAAE,MAAM,EAAE,CAAC;IAC/B,iEAAiE;IACjE,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,UAAU,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,2EAA2E;IAC3E,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,aAAa,EAAE,CAAC;CACxB;AAED,2DAA2D;AAC3D,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,wEAAwE;IACxE,MAAM,EAAE,OAAO,CAAC;IAChB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,gBAAgB,EAAE,OAAO,CAAC;IAC1B,gBAAgB,EAAE,OAAO,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,4EAA4E;IAC5E,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,wEAAwE;IACxE,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,qEAAqE;IACrE,oBAAoB,EAAE,OAAO,CAAC;IAC9B,YAAY,EAAE,MAAM,CAAC;IACrB,uEAAuE;IACvE,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,mDAAmD;IACnD,SAAS,EAAE,MAAM,CAAC;IAClB,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,uEAAuE;AACvE,MAAM,WAAW,eAAe;IAC9B,gBAAgB,EAAE,OAAO,CAAC;IAC1B,gBAAgB,EAAE,OAAO,CAAC;IAC1B,gBAAgB,EAAE,OAAO,CAAC;IAC1B,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,oBAAoB,EAAE,OAAO,CAAC;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,+CAA+C;AAC/C,MAAM,WAAW,UAAU;IACzB,aAAa,EAAE,OAAO,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,EAAE,MAAM,CAAC;IACzB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,yBAAyB,EAAE,MAAM,CAAC;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,wCAAwC;AACxC,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,YAAY,GAAG,QAAQ,GAAG,MAAM,GAAG,OAAO,CAAC;AAE5E,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,OAAO,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,gFAAgF;AAChF,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,0CAA0C;IAC1C,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,uEAAuE;AACvE,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,sBAAsB,EAAE,MAAM,CAAC;IAC/B,uBAAuB,EAAE,MAAM,CAAC;IAChC,mBAAmB,EAAE,MAAM,CAAC;IAC5B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,WAAW,EAAE,OAAO,CAAC;CACtB;AAED,yEAAyE;AACzE,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,sEAAsE;AACtE,MAAM,MAAM,YAAY,GAAG,CACzB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,aAAa,KAChB,OAAO,CAAC,eAAe,CAAC,CAAC"}

package/dist/bench/types.js

@@ -0,0 +1,16 @@
+// SPDX-License-Identifier: MIT
+//
+// Benchmark layer — shared types (ADR-076).
+//
+// "Benchmark the parent versus the child, not the idea." Given the SAME repo,
+// task set, model, budget, and sandbox: did the child beat its parent WITHOUT
+// increasing risk? A child is promoted only when it clears five gates — solve,
+// regression, safety, cost, repro — and the win is statistically real (the lower
+// 95% bootstrap bound on the parent→child score delta is above zero), not one
+// lucky run.
+//
+// This is the rigorous evaluation path used when a task set is supplied
+// (`evolve --bench <suite>`). The lightweight ADR-072 scorer remains the default
+// for a quick `evolve <repo>` with no task set.
+export {};
+//# sourceMappingURL=types.js.map

package/dist/bench/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/bench/types.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,EAAE;AACF,4CAA4C;AAC5C,EAAE;AACF,8EAA8E;AAC9E,8EAA8E;AAC9E,+EAA+E;AAC/E,iFAAiF;AACjF,8EAA8E;AAC9E,aAAa;AACb,EAAE;AACF,wEAAwE;AACxE,iFAAiF;AACjF,gDAAgD"}

package/dist/cli.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=cli.d.ts.map

package/dist/cli.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cli.d.ts","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":""}

package/dist/cli.js

@@ -0,0 +1,125 @@
+#!/usr/bin/env node
+// SPDX-License-Identifier: MIT
+//
+// Darwin Mode CLI. Verbs:
+//
+//   metaharness-darwin evolve <repo> [--generations N] [--children N]
+//                                    [--concurrency N] [--seed N]
+//   metaharness-darwin bench create <repo> [--out <suite.json>]
+//   metaharness-darwin bench verify <suite.json>
+//
+// Writes a self-describing `.metaharness/` work tree under the repo and prints a
+// leaderboard + the winner's lineage. Dependency-free.
+import { resolve } from 'node:path';
+import { evolve } from './evolve.js';
+import { profileRepo } from './repo_profiler.js';
+import { loadSuite, makeSuite, saveSuite, verifySuite } from './bench/suite.js';
+function flag(name, fallback) {
+    const i = process.argv.indexOf(name);
+    return i === -1 ? fallback : (process.argv[i + 1] ?? fallback);
+}
+function num(name, fallback) {
+    const v = Number(flag(name, String(fallback)));
+    return Number.isFinite(v) ? v : fallback;
+}
+function printReport(result) {
+    const scored = result.records
+        .filter((r) => r.score)
+        .sort((a, b) => (b.score?.finalScore ?? 0) - (a.score?.finalScore ?? 0));
+    process.stdout.write('\nDarwin Mode — leaderboard\n');
+    for (const r of scored.slice(0, 10)) {
+        const s = r.score;
+        const tag = r.variant.id === result.winner?.variant.id ? ' ◀ winner' : '';
+        process.stdout.write(`  ${s.finalScore.toFixed(3)}  ${r.variant.id}` +
+            `  [${r.variant.mutationSurface}]  safety=${s.safetyScore.toFixed(2)}` +
+            `  pass=${s.testPassRate.toFixed(2)}${tag}\n`);
+    }
+    if (result.winner) {
+        process.stdout.write(`\nWinner: ${result.winner.variant.id}\n`);
+        process.stdout.write(`Lineage: ${result.winnerLineage.join(' → ')}\n`);
+        const base = result.baseline.score?.finalScore ?? 0;
+        const win = result.winner.score?.finalScore ?? 0;
+        process.stdout.write(`Delta over baseline: ${(win - base >= 0 ? '+' : '')}${(win - base).toFixed(3)}\n`);
+    }
+    else {
+        process.stdout.write('\nNo scored variants.\n');
+    }
+}
+/** `bench create <repo>` / `bench verify <suite.json>` (ADR-076). */
+async function runBench() {
+    const sub = process.argv[3];
+    if (sub === 'create') {
+        const repoRoot = resolve(process.argv[4] ?? process.cwd());
+        const profile = await profileRepo(repoRoot);
+        const out = resolve(flag('--out', resolve(repoRoot, '.metaharness/bench.json')));
+        // A scaffold task pinned to the repo's own test command. Hidden/regression
+        // commands are placeholders to be replaced with human-curated held-out tests.
+        const task = {
+            id: 'task-0001',
+            repo: repoRoot,
+            commit: 'WORKDIR',
+            title: 'Repo native smoke task',
+            prompt: 'Keep the repository test suite green.',
+            publicTestCommand: profile.testCommand,
+            hiddenTestCommand: profile.testCommand,
+            regressionTestCommand: profile.testCommand,
+            timeoutMs: 300000,
+            maxCostUsd: 2,
+            allowedMutationFiles: [],
+            blockedFiles: ['.env', 'package-lock.json', 'pnpm-lock.yaml', 'yarn.lock', '.github/workflows'],
+            successCriteria: ['public test passes', 'hidden test passes', 'regression suite passes'],
+            difficulty: 1,
+            tags: ['smoke', 'repo-native'],
+        };
+        const suite = makeSuite('repo-native', '0.1.0', [task]);
+        await saveSuite(out, suite);
+        process.stdout.write(`Wrote suite (${suite.tasks.length} task, hash ${suite.taskHash.slice(0, 12)}…): ${out}\n`);
+        return;
+    }
+    if (sub === 'verify') {
+        const file = resolve(process.argv[4] ?? '');
+        const suite = await loadSuite(file); // throws on tamper
+        const check = verifySuite(suite);
+        process.stdout.write(`Suite ${suite.id}@${suite.version}: ${suite.tasks.length} tasks, hash ${check.ok ? 'OK' : 'MISMATCH'} (${check.actual.slice(0, 12)}…)\n`);
+        return;
+    }
+    process.stderr.write('usage: metaharness-darwin bench <create|verify> …\n');
+    process.exit(1);
+}
+async function main() {
+    const command = process.argv[2];
+    if (command === 'bench') {
+        await runBench();
+        return;
+    }
+    if (command !== 'evolve') {
+        process.stderr.write('usage: metaharness-darwin <evolve|bench> …\n' +
+            '  evolve <repo> [--generations N] [--children N] [--concurrency N] [--seed N]\n' +
+            '  bench create <repo> [--out <suite.json>]\n' +
+            '  bench verify <suite.json>\n');
+        process.exit(1);
+    }
+    const repoRoot = resolve(process.argv[3] ?? process.cwd());
+    const workRoot = resolve(repoRoot, '.metaharness');
+    const result = await evolve({
+        repoRoot,
+        workRoot,
+        generations: num('--generations', 3),
+        childrenPerGeneration: num('--children', 4),
+        concurrency: num('--concurrency', 4),
+        seed: num('--seed', 0),
+        promotionDelta: 0.05,
+        tasks: [
+            'run repository test suite',
+            'verify generated harness safety',
+            'check trace quality',
+        ],
+    });
+    printReport(result);
+    process.stdout.write(`\nArtifacts: ${workRoot}\n`);
+}
+main().catch((error) => {
+    process.stderr.write(`${error instanceof Error ? error.stack ?? error.message : String(error)}\n`);
+    process.exit(1);
+});
+//# sourceMappingURL=cli.js.map

package/dist/cli.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cli.js","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":";AACA,+BAA+B;AAC/B,EAAE;AACF,0BAA0B;AAC1B,EAAE;AACF,sEAAsE;AACtE,kEAAkE;AAClE,gEAAgE;AAChE,iDAAiD;AACjD,EAAE;AACF,iFAAiF;AACjF,uDAAuD;AAEvD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAIhF,SAAS,IAAI,CAAC,IAAY,EAAE,QAAgB;IAC1C,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACrC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,GAAG,CAAC,IAAY,EAAE,QAAgB;IACzC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC/C,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC3C,CAAC;AAED,SAAS,WAAW,CAAC,MAAuB;IAC1C,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO;SAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;SACtB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC;IAE3E,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAM,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,KAAK,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE;YAC7C,MAAM,CAAC,CAAC,OAAO,CAAC,eAAe,aAAa,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACtE,UAAU,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAChD,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;QAChE,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACvE,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,IAAI,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,IAAI,CAAC,CAAC;QACjD,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,wBAAwB,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CACnF,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAClD,CAAC;AACH,CAAC;AAED,qEAAqE;AACrE,KAAK,UAAU,QAAQ;IACrB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE5B,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,MAAM,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,EAAE,yBAAyB,CAAC,CAAC,CAAC,CAAC;QACjF,2EAA2E;QAC3E,8EAA8E;QAC9E,MAAM,IAAI,GAAkB;YAC1B,EAAE,EAAE,WAAW;YACf,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,SAAS;YACjB,KAAK,EAAE,wBAAwB;YAC/B,MAAM,EAAE,uCAAuC;YAC/C,iBAAiB,EAAE,OAAO,CAAC,WAAW;YACtC,iBAAiB,EAAE,OAAO,CAAC,WAAW;YACtC,qBAAqB,EAAE,OAAO,CAAC,WAAW;YAC1C,SAAS,EAAE,MAAM;YACjB,UAAU,EAAE,CAAC;YACb,oBAAoB,EAAE,EAAE;YACxB,YAAY,EAAE,CAAC,MAAM,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,WAAW,EAAE,mBAAmB,CAAC;YAC/F,eAAe,EAAE,CAAC,oBAAoB,EAAE,oBAAoB,EAAE,yBAAyB,CAAC;YACxF,UAAU,EAAE,CAAC;YACb,IAAI,EAAE,CAAC,OAAO,EAAE,aAAa,CAAC;SAC/B,CAAC;QACF,MAAM,KAAK,GAAG,SAAS,CAAC,aAAa,EAAE,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,MAAM,SAAS,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC5B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,KAAK,CAAC,KAAK,CAAC,MAAM,eAAe,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC;QACjH,OAAO;IACT,CAAC;IAED,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,mBAAmB;QACxD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QACjC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,OAAO,KAAK,KAAK,CAAC,KAAK,CAAC,MAAM,gBAAgB,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,KAAK,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;QAChK,OAAO;IACT,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,qDAAqD,CAAC,CAAC;IAC5E,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAED,KAAK,UAAU,IAAI;IACjB,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEhC,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;QACxB,MAAM,QAAQ,EAAE,CAAC;QACjB,OAAO;IACT,CAAC;IAED,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;QACzB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,8CAA8C;YAC5C,iFAAiF;YACjF,8CAA8C;YAC9C,+BAA+B,CAClC,CAAC;QACF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC;IAC3D,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;IAEnD,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC;QAC1B,QAAQ;QACR,QAAQ;QACR,WAAW,EAAE,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC;QACpC,qBAAqB,EAAE,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC;QAC3C,WAAW,EAAE,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC;QACpC,IAAI,EAAE,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;QACtB,cAAc,EAAE,IAAI;QACpB,KAAK,EAAE;YACL,2BAA2B;YAC3B,iCAAiC;YACjC,qBAAqB;SACtB;KACF,CAAC,CAAC;IAEH,WAAW,CAAC,MAAM,CAAC,CAAC;IACpB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,QAAQ,IAAI,CAAC,CAAC;AACrD,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;IACrB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC"}

package/dist/evolve.d.ts

@@ -0,0 +1,11 @@
+import type { EvolutionConfig, EvolutionResult } from './types.js';
+/** Run async `fn` over `items` with at most `limit` in flight at once. Order-preserving. */
+export declare function mapLimit<T, R>(items: T[], limit: number, fn: (item: T, index: number) => Promise<R>): Promise<R[]>;
+/**
+ * Run a full Darwin Mode evolution. Returns the baseline, the winning record,
+ * the whole archive, and the winner's lineage. Side effects are confined to the
+ * `<workRoot>/.metaharness`-style tree (variants, runs, reports, archive.json,
+ * lineage.json).
+ */
+export declare function evolve(config: EvolutionConfig): Promise<EvolutionResult>;
+//# sourceMappingURL=evolve.d.ts.map

package/dist/evolve.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evolve.d.ts","sourceRoot":"","sources":["../src/evolve.ts"],"names":[],"mappings":"AAmBA,OAAO,KAAK,EACV,eAAe,EACf,eAAe,EAKhB,MAAM,YAAY,CAAC;AAKpB,4FAA4F;AAC5F,wBAAsB,QAAQ,CAAC,CAAC,EAAE,CAAC,EACjC,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,MAAM,EACb,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GACzC,OAAO,CAAC,CAAC,EAAE,CAAC,CAad;AAqDD;;;;;GAKG;AACH,wBAAsB,MAAM,CAAC,MAAM,EAAE,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC,CAuF9E"}