@metaharness/darwin 0.1.0 → 0.2.1

package/dist/phenotype.js

@@ -0,0 +1,189 @@
+// SPDX-License-Identifier: MIT
+//
+// Hyperbolic behavioral phenotyping (ADR-091). MAP-Elites (ADR-088) bins variants
+// by a FLAT structural axis (which of the 7 surfaces was mutated). But real agent
+// behaviour is HIERARCHICAL — deep recursive backtracking vs. shallow linear tool
+// use — and hierarchies embed far more faithfully in hyperbolic space than in a
+// flat categorical grid.
+//
+// We distil a variant's run traces into a behaviour feature vector, embed it in
+// the 2-D Poincaré ball (radius ≈ hierarchical "depth/struggle", angle ≈
+// behavioural mode), and assign a niche by hyperbolic region. The result plugs
+// straight into `Archive.selectElites(limit, descriptorOf)` as the descriptor.
+//
+// Dependency-free and closed-form. NOTE on RuVector: `ruvector-wasm@2.1.x`
+// exposes a `VectorDB`/`HNSW` with euclidean/cosine/dotproduct/manhattan metrics
+// only — it has NO hyperbolic metric — so the Poincaré geometry is computed here
+// natively. A RuVector HNSW index can later back nearest-niche lookups at scale,
+// but the hyperbolic phenotyping itself does not depend on it.
+/** Squash a non-negative magnitude into [0, 1) — a smooth, bounded saturation. */
+function squash(x) {
+    return Math.tanh(Math.max(0, x));
+}
+/** Fraction of lines that are exact repeats — a proxy for loops / backtracking. */
+function repetitionFraction(text) {
+    const lines = text.split('\n').map((l) => l.trim()).filter(Boolean);
+    if (lines.length <= 1)
+        return 0;
+    const seen = new Set();
+    let repeats = 0;
+    for (const l of lines) {
+        if (seen.has(l))
+            repeats += 1;
+        else
+            seen.add(l);
+    }
+    return repeats / lines.length;
+}
+export function behaviorFeatures(traces) {
+    const n = traces.length;
+    if (n === 0) {
+        return { failRate: 0, timeoutRate: 0, blockRate: 0, verbosity: 0, repetition: 0, durationSpread: 0 };
+    }
+    let fails = 0, timeouts = 0, blocks = 0, charsSum = 0, repSum = 0;
+    const durs = [];
+    for (const t of traces) {
+        const failed = t.exitCode !== 0 || t.timedOut || t.blockedActions.length > 0;
+        if (failed)
+            fails += 1;
+        if (t.timedOut)
+            timeouts += 1;
+        if (t.blockedActions.length > 0)
+            blocks += 1;
+        const out = `${t.stdout}\n${t.stderr}`;
+        charsSum += out.length;
+        repSum += repetitionFraction(out);
+        durs.push(t.durationMs);
+    }
+    const mean = durs.reduce((s, d) => s + d, 0) / n;
+    const variance = durs.reduce((s, d) => s + (d - mean) ** 2, 0) / n;
+    const durationSpread = mean > 0 ? squash(Math.sqrt(variance) / mean) : 0;
+    return {
+        failRate: fails / n,
+        timeoutRate: timeouts / n,
+        blockRate: blocks / n,
+        verbosity: squash(charsSum / n / 2000),
+        repetition: Math.min(1, repSum / n),
+        durationSpread,
+    };
+}
+/**
+ * Embed behaviour features into the 2-D Poincaré ball (the open unit disk).
+ * RADIUS encodes hierarchical "depth/struggle" (failure, looping, timeouts) —
+ * deep recursive strugglers sit near the boundary where hyperbolic distance
+ * explodes; clean shallow agents sit near the origin. ANGLE encodes behavioural
+ * MODE (verbosity vs. safety-pressure vs. effort irregularity). The point always
+ * satisfies ‖p‖ < 1.
+ */
+export function poincareEmbed(f) {
+    const depth = squash(1.6 * f.failRate + 1.2 * f.repetition + 1.0 * f.timeoutRate);
+    const radius = Math.min(0.999, depth); // keep strictly inside the open ball
+    // Angle from the behavioural-mode features, wrapped into [0, 2π).
+    const modeRaw = 0.6 * f.verbosity + 1.0 * f.blockRate + 0.4 * f.durationSpread;
+    const theta = (modeRaw % 1) * 2 * Math.PI;
+    return [radius * Math.cos(theta), radius * Math.sin(theta)];
+}
+/**
+ * Poincaré-ball distance between two points in the open unit ball:
+ *
+ *   d(u,v) = acosh( 1 + 2 · ‖u−v‖² / ((1−‖u‖²)(1−‖v‖²)) )
+ *
+ * Returns 0 for identical points, is symmetric, and grows without bound as
+ * either point approaches the boundary. Guards the denominator for points placed
+ * exactly on the boundary (treated as just inside).
+ */
+export function poincareDistance(u, v) {
+    let diff2 = 0, nu2 = 0, nv2 = 0;
+    for (let i = 0; i < u.length; i++) {
+        diff2 += (u[i] - v[i]) ** 2;
+        nu2 += u[i] ** 2;
+        nv2 += v[i] ** 2;
+    }
+    const denom = Math.max(1e-12, (1 - Math.min(1, nu2)) * (1 - Math.min(1, nv2)));
+    return Math.acosh(1 + (2 * diff2) / denom);
+}
+/**
+ * Assign a discrete behavioural niche by hyperbolic region: a radial shell
+ * (hierarchy depth) crossed with an angular sector (behavioural mode). Same
+ * behaviour ⇒ same niche; deterministic. Plugs into `selectElites` as the
+ * descriptor: `selectElites(k, v => behavioralNiche(tracesById.get(v.id) ?? []))`.
+ */
+/** Poincaré polar niche of a disk point: radial shell (depth) × angular sector. */
+export function poincareNicheOf(x, y, shells = 4, sectors = 6) {
+    const r = Math.sqrt(x * x + y * y);
+    const shell = Math.min(shells - 1, Math.floor(r * shells));
+    let theta = Math.atan2(y, x);
+    if (theta < 0)
+        theta += 2 * Math.PI;
+    const sector = Math.min(sectors - 1, Math.floor((theta / (2 * Math.PI)) * sectors));
+    return `h${shell}_s${sector}`;
+}
+/** Flat Cartesian niche of a disk point: a uniform `bins × bins` square grid. */
+export function euclideanNicheOf(x, y, bins = 5) {
+    const cell = (v) => Math.min(bins - 1, Math.max(0, Math.floor(((v + 1) / 2) * bins)));
+    return `e${cell(x)}_${cell(y)}`;
+}
+export function behavioralNiche(traces, shells = 4, sectors = 6) {
+    const [x, y] = poincareEmbed(behaviorFeatures(traces));
+    return poincareNicheOf(x, y, shells, sectors);
+}
+/**
+ * FLAT Euclidean niche over the SAME embedded behaviour point — a square
+ * `bins × bins` grid on the disk. This is the ablation comparator for ADR-095:
+ * it bins the identical `poincareEmbed` coordinate with a uniform Cartesian grid
+ * instead of the polar/hyperbolic radial-shell grid, so a controlled run can
+ * measure what the hyperbolic geometry actually buys. Deterministic.
+ */
+export function euclideanNiche(traces, bins = 5) {
+    const [x, y] = poincareEmbed(behaviorFeatures(traces));
+    const cell = (v) => Math.min(bins - 1, Math.max(0, Math.floor(((v + 1) / 2) * bins)));
+    return `e${cell(x)}_${cell(y)}`;
+}
+// ── Active niche steering (ADR-092) — navigate the behavioural manifold ───────
+//
+// Diversity selection (ADR-091) MAINTAINS spread. Steering actively DRIVES the
+// population toward under-explored regions of the Poincaré ball: find a density
+// hole (preferring the high-radius "complex / deep-thinking" frontier), then seed
+// the next generation from the survivors nearest that hole, so their offspring
+// land in or near it. The whole mechanism is closed-form + deterministic.
+/** Geometric centroid of niche cell `(shell, sector)` in the Poincaré disk. */
+export function nicheCentroid(shell, sector, shells = 4, sectors = 6) {
+    const r = (shell + 0.5) / shells;
+    const theta = ((sector + 0.5) / sectors) * 2 * Math.PI;
+    return [r * Math.cos(theta), r * Math.sin(theta)];
+}
+/**
+ * Find an under-explored target niche: scan shells from the OUTSIDE in (prefer
+ * the high-radius complexity frontier, per open-endedness) and return the first
+ * unoccupied cell's id + centroid. Returns `null` when every niche is occupied.
+ */
+export function underExploredTarget(occupied, shells = 4, sectors = 6) {
+    for (let shell = shells - 1; shell >= 0; shell--) {
+        for (let sector = 0; sector < sectors; sector++) {
+            const niche = `h${shell}_s${sector}`;
+            if (!occupied.has(niche))
+                return { niche, centroid: nicheCentroid(shell, sector, shells, sectors) };
+        }
+    }
+    return null;
+}
+/**
+ * Rank candidates by Poincaré distance to `target` (ascending) and return the
+ * nearest `limit` ids — the survivors whose offspring are most likely to reach
+ * the under-explored region. Ties break by the candidate array order (the caller
+ * supplies a deterministic order, e.g. archive insertion).
+ */
+export function nearestToTarget(candidates, target, limit) {
+    if (limit <= 0)
+        return [];
+    return candidates
+        .map((c, i) => ({ id: c.id, d: poincareDistance(c.embed, target), i }))
+        .sort((a, b) => a.d - b.d || a.i - b.i)
+        .slice(0, limit)
+        .map((c) => c.id);
+}
+/** Convenience: the Poincaré embedding of a variant straight from its traces. */
+export function embedTraces(traces) {
+    return poincareEmbed(behaviorFeatures(traces));
+}
+//# sourceMappingURL=phenotype.js.map

package/dist/phenotype.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"phenotype.js","sourceRoot":"","sources":["../src/phenotype.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,EAAE;AACF,kFAAkF;AAClF,kFAAkF;AAClF,kFAAkF;AAClF,gFAAgF;AAChF,yBAAyB;AACzB,EAAE;AACF,gFAAgF;AAChF,yEAAyE;AACzE,+EAA+E;AAC/E,+EAA+E;AAC/E,EAAE;AACF,2EAA2E;AAC3E,iFAAiF;AACjF,iFAAiF;AACjF,iFAAiF;AACjF,+DAA+D;AAI/D,kFAAkF;AAClF,SAAS,MAAM,CAAC,CAAS;IACvB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,mFAAmF;AACnF,SAAS,kBAAkB,CAAC,IAAY;IACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACpE,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC;;YACzB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC;AAChC,CAAC;AAsBD,MAAM,UAAU,gBAAgB,CAAC,MAAkB;IACjD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC;IACvG,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;IAClE,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7E,IAAI,MAAM;YAAE,KAAK,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC,QAAQ;YAAE,QAAQ,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM,IAAI,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACvC,QAAQ,IAAI,GAAG,CAAC,MAAM,CAAC;QACvB,MAAM,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACnE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,OAAO;QACL,QAAQ,EAAE,KAAK,GAAG,CAAC;QACnB,WAAW,EAAE,QAAQ,GAAG,CAAC;QACzB,SAAS,EAAE,MAAM,GAAG,CAAC;QACrB,SAAS,EAAE,MAAM,CAAC,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC;QACtC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;QACnC,cAAc;KACf,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,CAAmB;IAC/C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,GAAG,GAAG,GAAG,CAAC,CAAC,UAAU,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IAClF,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,qCAAqC;IAC5E,kEAAkE;IAClE,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC,cAAc,CAAC;IAC/E,MAAM,KAAK,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IAC1C,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAoB,EAAE,CAAoB;IACzE,IAAI,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5B,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjB,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/E,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,mFAAmF;AACnF,MAAM,UAAU,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC;IAC3E,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC3D,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,IAAI,KAAK,GAAG,CAAC;QAAE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IACpF,OAAO,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;AAChC,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS,EAAE,IAAI,GAAG,CAAC;IAC7D,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9F,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,MAAkB,EAAE,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC;IACzE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAChD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAAC,MAAkB,EAAE,IAAI,GAAG,CAAC;IACzD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9F,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAClC,CAAC;AAED,iFAAiF;AACjF,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,kFAAkF;AAClF,+EAA+E;AAC/E,0EAA0E;AAE1E,+EAA+E;AAC/E,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,MAAc,EAAE,MAAM,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC;IAClF,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC;IACjC,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACvD,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAA6B,EAC7B,MAAM,GAAG,CAAC,EACV,OAAO,GAAG,CAAC;IAEX,KAAK,IAAI,KAAK,GAAG,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;YACrC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QACtG,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAC7B,UAA2E,EAC3E,MAAiC,EACjC,KAAa;IAEb,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC1B,OAAO,UAAU;SACd,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACtE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACtC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;SACf,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtB,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,WAAW,CAAC,MAAkB;IAC5C,OAAO,aAAa,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;AACjD,CAAC"}

package/dist/templates.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"templates.d.ts","sourceRoot":"","sources":["../src/templates.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,WAAW,GAAG,MAAM,CAkC5D;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,IAAI,MAAM,CAsC/C;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,IAAI,MAAM,CAqDzC;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,IAAI,MAAM,CAkD5C;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,IAAI,MAAM,CA+B3C;AAED;;GAEG;AACH,wBAAgB,oBAAoB,IAAI,MAAM,CA0B7C;AAED;;GAEG;AACH,wBAAgB,mBAAmB,IAAI,MAAM,CA6B5C"}
+{"version":3,"file":"templates.d.ts","sourceRoot":"","sources":["../src/templates.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,WAAW,GAAG,MAAM,CAkC5D;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,IAAI,MAAM,CA2C/C;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,IAAI,MAAM,CAqDzC;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,IAAI,MAAM,CAkD5C;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,IAAI,MAAM,CA+B3C;AAED;;GAEG;AACH,wBAAgB,oBAAoB,IAAI,MAAM,CA0B7C;AAED;;GAEG;AACH,wBAAgB,mBAAmB,IAAI,MAAM,CA6B5C"}

package/dist/templates.js

@@ -68,9 +68,14 @@ export interface ContextItem {
   score: number;
 }
 
-/** Split a string into lowercased alphanumeric terms of length >= 2. */
+/**
+ * Split a string into lowercased alphanumeric terms of length >= 2. camelCase
+ * boundaries are split first, so a bug report naming "paretoFront" matches the file
+ * "pareto.ts" (ADR-127 finding: camelCase symbols did not tokenise to path stems).
+ */
 function terms(text: string): string[] {
   return text
+    .replace(/([a-z0-9])([A-Z])/g, '$1 $2')
     .toLowerCase()
     .split(/[^a-z0-9]+/)
     .filter((t) => t.length >= 2);

package/dist/templates.js.map

@@ -1 +1 @@
-{"version":3,"file":"templates.js","sourceRoot":"","sources":["../src/templates.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,EAAE;AACF,gFAAgF;AAChF,sEAAsE;AACtE,EAAE;AACF,4EAA4E;AAC5E,iEAAiE;AACjE,4EAA4E;AAC5E,6EAA6E;AAC7E,8EAA8E;AAC9E,6EAA6E;AAC7E,0BAA0B;AAI1B;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,OAAoB;IAClD,OAAO;;;;;;;;;;;;;;;6BAeoB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;;;CAiB3D,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB;IACpC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAoCR,CAAC;AACF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB;IAC9B,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAmDR,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgDR,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA6BR,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB;IAClC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;CAwBR,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BR,CAAC;AACF,CAAC"}
+{"version":3,"file":"templates.js","sourceRoot":"","sources":["../src/templates.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,EAAE;AACF,gFAAgF;AAChF,sEAAsE;AACtE,EAAE;AACF,4EAA4E;AAC5E,iEAAiE;AACjE,4EAA4E;AAC5E,6EAA6E;AAC7E,8EAA8E;AAC9E,6EAA6E;AAC7E,0BAA0B;AAI1B;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,OAAoB;IAClD,OAAO;;;;;;;;;;;;;;;6BAeoB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;;;CAiB3D,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB;IACpC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAyCR,CAAC;AACF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB;IAC9B,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAmDR,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgDR,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA6BR,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB;IAClC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;CAwBR,CAAC;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB;IACjC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BR,CAAC;AACF,CAAC"}

package/dist/tier2-driver.d.ts

@@ -0,0 +1,10 @@
+interface AgentTask {
+    prompt: string;
+    files: string[];
+    buggyFile: string;
+    classification: 'transient' | 'repairable' | 'unknown';
+    failAttempts: number;
+    backoffMs: number;
+}
+declare function main(): Promise<void>;
+//# sourceMappingURL=tier2-driver.d.ts.map

package/dist/tier2-driver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier2-driver.d.ts","sourceRoot":"","sources":["../src/tier2-driver.ts"],"names":[],"mappings":"AAeA,UAAU,SAAS;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,WAAW,GAAG,YAAY,GAAG,SAAS,CAAC;IACvD,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,iBAAe,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAkDnC"}

package/dist/tier2-driver.js

@@ -0,0 +1,62 @@
+"use strict";
+// SPDX-License-Identifier: MIT
+//
+// Tier-2 agent driver (ADR-106). Runs in a CHILD process launched with
+// `node --experimental-strip-types`, so it can import the variant's real surface
+// `.ts` modules and execute their ACTUAL logic — not regex-extracted parameters
+// (Tier 1, ADR-102). It drives a deterministic agent loop calling the surfaces'
+// real exports and prints a JSON trace to stdout.
+//
+//   argv[2] = variant directory (contains the 7 surface .ts files)
+//   argv[3] = task JSON: { prompt, files, buggyFile, classification, failAttempts, backoffMs }
+//
+// Standalone: imports ONLY the variant surfaces + node builtins (no package
+// imports), so the child needs nothing from dist except this file. Deterministic
+// (durationMs derived from the loop, not wall-clock) ⇒ reproducible.
+async function main() {
+    const variantDir = process.argv[2];
+    const task = JSON.parse(process.argv[3]);
+    const log = [];
+    // Import the variant's REAL surface modules (types stripped by the flag).
+    const planner = await import(`${variantDir}/planner.ts`);
+    const ctxb = await import(`${variantDir}/context_builder.ts`);
+    const retry = await import(`${variantDir}/retry_policy.ts`);
+    const tools = await import(`${variantDir}/tool_policy.ts`);
+    // The agent must produce a plan that ends in verification.
+    const plan = (planner.createPlan?.(task.prompt) ?? []);
+    const planOk = plan.length > 0 && plan.some((s) => s.kind === 'verify');
+    log.push(`plan: ${plan.length} steps, verify=${planOk}`);
+    // Tool ordering is exercised (its output shapes the log / behaviour).
+    const order = (tools.orderKinds?.(['lint', 'test', 'build']) ?? []);
+    log.push(`tools: ${order.join('>')}`);
+    const maxA = (retry.maxAttempts ?? 3);
+    let solved = false;
+    let attemptsUsed = 0;
+    let ctxLen = 0;
+    for (let attempt = 0;; attempt++) {
+        attemptsUsed = attempt + 1;
+        // REAL contextBuilder: ranks files by overlap and slices to its window. The
+        // bug is "located" only if the buggy file survives into the returned window.
+        const ctx = (ctxb.buildContext?.(task.prompt, task.files) ?? []);
+        ctxLen = ctx.length;
+        const located = ctx.some((c) => c.path === task.buggyFile);
+        log.push(`attempt ${attempt}: ctx=${ctx.length} located=${located}`);
+        if (planOk && located && attempt >= task.failAttempts) {
+            solved = true;
+            log.push('verify: PASS');
+            break;
+        }
+        // REAL retryPolicy decides persistence given the failure classification.
+        const d = (retry.decideRetry?.(attempt, task.classification) ?? { retry: false, reason: 'no decideRetry' });
+        if (!d.retry || attempt + 1 >= maxA) {
+            log.push(`stop: ${d.reason}`);
+            break;
+        }
+    }
+    const durationMs = attemptsUsed * task.backoffMs + ctxLen;
+    process.stdout.write(JSON.stringify({ solved, attemptsUsed, durationMs, log: log.join('\n') }));
+}
+main().catch((e) => {
+    process.stdout.write(JSON.stringify({ solved: false, attemptsUsed: 0, durationMs: 0, log: `ERR ${e?.message ?? e}` }));
+});
+//# sourceMappingURL=tier2-driver.js.map

package/dist/tier2-driver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier2-driver.js","sourceRoot":"","sources":["../src/tier2-driver.ts"],"names":[],"mappings":";AAAA,+BAA+B;AAC/B,EAAE;AACF,uEAAuE;AACvE,iFAAiF;AACjF,gFAAgF;AAChF,gFAAgF;AAChF,kDAAkD;AAClD,EAAE;AACF,mEAAmE;AACnE,+FAA+F;AAC/F,EAAE;AACF,4EAA4E;AAC5E,iFAAiF;AACjF,qEAAqE;AAWrE,KAAK,UAAU,IAAI;IACjB,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,IAAI,GAAc,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,GAAG,GAAa,EAAE,CAAC;IAEzB,0EAA0E;IAC1E,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,GAAG,UAAU,aAAa,CAAC,CAAC;IACzD,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,GAAG,UAAU,qBAAqB,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,GAAG,UAAU,kBAAkB,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,GAAG,UAAU,iBAAiB,CAAC,CAAC;IAE3D,2DAA2D;IAC3D,MAAM,IAAI,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAA4B,CAAC;IAClF,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IACxE,GAAG,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,MAAM,kBAAkB,MAAM,EAAE,CAAC,CAAC;IAEzD,sEAAsE;IACtE,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAa,CAAC;IAChF,GAAG,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAEtC,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,IAAI,CAAC,CAAW,CAAC;IAChD,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,OAAO,GAAG,CAAC,GAAI,OAAO,EAAE,EAAE,CAAC;QAClC,YAAY,GAAG,OAAO,GAAG,CAAC,CAAC;QAC3B,4EAA4E;QAC5E,6EAA6E;QAC7E,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAA4B,CAAC;QAC5F,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;QACpB,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3D,GAAG,CAAC,IAAI,CAAC,WAAW,OAAO,SAAS,GAAG,CAAC,MAAM,YAAY,OAAO,EAAE,CAAC,CAAC;QACrE,IAAI,MAAM,IAAI,OAAO,IAAI,OAAO,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtD,MAAM,GAAG,IAAI,CAAC;YACd,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACzB,MAAM;QACR,CAAC;QACD,yEAAyE;QACzE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAGzG,CAAC;QACF,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YACpC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAC9B,MAAM;QACR,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,YAAY,GAAG,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC;IAC1D,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAClG,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE;IACjB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,GAAG,EAAE,OAAQ,CAAW,EAAE,OAAO,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AACpI,CAAC,CAAC,CAAC"}

package/dist/tier2-sandbox.d.ts

@@ -0,0 +1,18 @@
+import type { HarnessVariant, RunTrace } from './types.js';
+/** A Tier-2 agent task: locate `buggyFile` among `files` and persist past `failAttempts`. */
+export interface AgentTask {
+    id: string;
+    prompt: string;
+    files: string[];
+    buggyFile: string;
+    classification: 'transient' | 'repairable' | 'unknown';
+    failAttempts: number;
+    backoffMs: number;
+    difficulty: 1 | 2 | 3 | 4 | 5;
+}
+export declare const DEFAULT_AGENT_TASKS: readonly AgentTask[];
+/** Run ONE agent task against a variant by executing its real surface code. */
+export declare function runVariantTaskAgent(variant: HarnessVariant, task: AgentTask, timeoutMs?: number): Promise<RunTrace>;
+/** Run a variant against the agent suite (defaults to DEFAULT_AGENT_TASKS). */
+export declare function runVariantTasksAgent(variant: HarnessVariant, tasks?: readonly AgentTask[], timeoutMs?: number): Promise<RunTrace[]>;
+//# sourceMappingURL=tier2-sandbox.d.ts.map

package/dist/tier2-sandbox.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier2-sandbox.d.ts","sourceRoot":"","sources":["../src/tier2-sandbox.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAiB3D,6FAA6F;AAC7F,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,WAAW,GAAG,YAAY,GAAG,SAAS,CAAC;IACvD,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;CAC/B;AAmBD,eAAO,MAAM,mBAAmB,EAAE,SAAS,SAAS,EAInD,CAAC;AASF,+EAA+E;AAC/E,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,cAAc,EACvB,IAAI,EAAE,SAAS,EACf,SAAS,SAAS,GACjB,OAAO,CAAC,QAAQ,CAAC,CAgCnB;AAED,+EAA+E;AAC/E,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,cAAc,EACvB,KAAK,GAAE,SAAS,SAAS,EAAwB,EACjD,SAAS,SAAS,GACjB,OAAO,CAAC,QAAQ,EAAE,CAAC,CAIrB"}

package/dist/tier2-sandbox.js

@@ -0,0 +1,91 @@
+// SPDX-License-Identifier: MIT
+//
+// Tier-2 agent sandbox (ADR-106). Executes a variant's REAL surface code by
+// spawning `tier2-driver.js` in a child `node --experimental-strip-types`
+// process (so the child can import the variant's `.ts` surfaces). Shell-free
+// (`execFile`, argv split — no command injection), env-scrubbed (only PATH +
+// identifiers leak), and timeout-bounded — the same safety posture as the real
+// sandbox (ADR-071). The gate (`inspectVariant`) has already cleared the variant
+// before any execution.
+//
+// Requires Node ≥ 22 (`--experimental-strip-types`). On older Node or any child
+// error, the variant gets a clean "unsolved" trace rather than crashing the loop.
+import { execFile } from 'node:child_process';
+import { existsSync } from 'node:fs';
+import { fileURLToPath } from 'node:url';
+import { promisify } from 'node:util';
+const execFileAsync = promisify(execFile);
+/**
+ * Resolve the compiled driver. From `dist/tier2-sandbox.js` the sibling
+ * `./tier2-driver.js` exists; when this module runs from `src/` (tests/dev via a
+ * TS loader), fall back to the built `../dist/tier2-driver.js`. The driver must
+ * be compiled (`npm run build`) for the 'agent' sandbox to run.
+ */
+function resolveDriver() {
+    const sibling = fileURLToPath(new URL('./tier2-driver.js', import.meta.url));
+    if (existsSync(sibling))
+        return sibling;
+    return fileURLToPath(new URL('../dist/tier2-driver.js', import.meta.url));
+}
+const DRIVER = resolveDriver();
+/**
+ * Default agent suite. The buggy file `src/<a>_<b>.ts` is preceded by `before`
+ * distractors `src/<a>_<b>_<i>.ts` that share its EXACT two terms — so the real
+ * contextBuilder gives them all the same overlap score and falls back to input
+ * order. The buggy file therefore sits at rank `before`, surviving into the
+ * returned window only if the contextBuilder's `.slice(0, N)` window is wider
+ * than that. Solving thus depends on the REAL contextBuilder window/ranking,
+ * plus retry persistence ('transient' lets decideRetry continue to maxAttempts).
+ */
+function buggyAfter(a, b, before) {
+    const buggyFile = `src/${a}_${b}.ts`;
+    const files = [
+        ...Array.from({ length: before }, (_, i) => `src/${a}_${b}_${i}.ts`),
+        buggyFile,
+    ];
+    return { prompt: `fix ${a} ${b}`, files, buggyFile };
+}
+export const DEFAULT_AGENT_TASKS = [
+    { id: 'a-easy', ...buggyAfter('auth', 'token', 0), classification: 'transient', failAttempts: 0, backoffMs: 20, difficulty: 1 },
+    { id: 'a-mid', ...buggyAfter('cache', 'key', 35), classification: 'transient', failAttempts: 1, backoffMs: 30, difficulty: 3 },
+    { id: 'a-hard', ...buggyAfter('retry', 'budget', 60), classification: 'transient', failAttempts: 2, backoffMs: 40, difficulty: 5 },
+];
+/** Run ONE agent task against a variant by executing its real surface code. */
+export async function runVariantTaskAgent(variant, task, timeoutMs = 10_000) {
+    const scrubbedEnv = {
+        PATH: process.env.PATH,
+        METAHARNESS_VARIANT: variant.id,
+        METAHARNESS_TASK: task.id,
+    };
+    let out = { solved: false, attemptsUsed: 0, durationMs: 0, log: '' };
+    let blocked = false;
+    try {
+        const { stdout } = await execFileAsync(process.execPath, ['--experimental-strip-types', '--no-warnings', DRIVER, variant.dir, JSON.stringify(task)], { timeout: timeoutMs, env: scrubbedEnv, cwd: variant.dir, maxBuffer: 1 << 20 });
+        out = JSON.parse(stdout.trim() || '{}');
+    }
+    catch (e) {
+        out = { solved: false, attemptsUsed: 0, durationMs: 0, log: `child error: ${e.message}`.slice(0, 200) };
+        blocked = false; // a child failure is an unsolved task, not a safety block
+    }
+    const startedAt = '1970-01-01T00:00:00.000Z';
+    return {
+        variantId: variant.id,
+        taskId: task.id,
+        startedAt,
+        finishedAt: new Date(out.durationMs).toISOString(),
+        exitCode: out.solved ? 0 : 1,
+        stdout: out.log,
+        stderr: out.solved ? '' : `task ${task.id} unsolved (${out.attemptsUsed} attempts)`,
+        durationMs: out.durationMs,
+        timedOut: false,
+        blockedActions: blocked ? ['tier2 child blocked'] : [],
+    };
+}
+/** Run a variant against the agent suite (defaults to DEFAULT_AGENT_TASKS). */
+export async function runVariantTasksAgent(variant, tasks = DEFAULT_AGENT_TASKS, timeoutMs = 10_000) {
+    const traces = [];
+    for (const task of tasks)
+        traces.push(await runVariantTaskAgent(variant, task, timeoutMs));
+    return traces;
+}
+//# sourceMappingURL=tier2-sandbox.js.map

package/dist/tier2-sandbox.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier2-sandbox.js","sourceRoot":"","sources":["../src/tier2-sandbox.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,EAAE;AACF,4EAA4E;AAC5E,0EAA0E;AAC1E,6EAA6E;AAC7E,6EAA6E;AAC7E,+EAA+E;AAC/E,iFAAiF;AACjF,wBAAwB;AACxB,EAAE;AACF,gFAAgF;AAChF,kFAAkF;AAElF,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAGtC,MAAM,aAAa,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;AAE1C;;;;;GAKG;AACH,SAAS,aAAa;IACpB,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,GAAG,CAAC,mBAAmB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7E,IAAI,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IACxC,OAAO,aAAa,CAAC,IAAI,GAAG,CAAC,yBAAyB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5E,CAAC;AACD,MAAM,MAAM,GAAG,aAAa,EAAE,CAAC;AAc/B;;;;;;;;GAQG;AACH,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,MAAc;IACtD,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;IACrC,MAAM,KAAK,GAAG;QACZ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;QACpE,SAAS;KACV,CAAC;IACF,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AACvD,CAAC;AACD,MAAM,CAAC,MAAM,mBAAmB,GAAyB;IACvD,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE;IAC/H,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE;IAC9H,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAC,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE;CACnI,CAAC;AASF,+EAA+E;AAC/E,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,OAAuB,EACvB,IAAe,EACf,SAAS,GAAG,MAAM;IAElB,MAAM,WAAW,GAAsB;QACrC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI;QACtB,mBAAmB,EAAE,OAAO,CAAC,EAAE;QAC/B,gBAAgB,EAAE,IAAI,CAAC,EAAE;KAC1B,CAAC;IACF,IAAI,GAAG,GAAc,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;IAChF,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,aAAa,CACpC,OAAO,CAAC,QAAQ,EAChB,CAAC,4BAA4B,EAAE,eAAe,EAAE,MAAM,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAC1F,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAC/E,CAAC;QACF,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,CAAC;IAC1C,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,GAAG,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,GAAG,EAAE,gBAAiB,CAAW,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QACnH,OAAO,GAAG,KAAK,CAAC,CAAC,0DAA0D;IAC7E,CAAC;IACD,MAAM,SAAS,GAAG,0BAA0B,CAAC;IAC7C,OAAO;QACL,SAAS,EAAE,OAAO,CAAC,EAAE;QACrB,MAAM,EAAE,IAAI,CAAC,EAAE;QACf,SAAS;QACT,UAAU,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE;QAClD,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,CAAC,GAAG;QACf,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,EAAE,cAAc,GAAG,CAAC,YAAY,YAAY;QACnF,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,QAAQ,EAAE,KAAK;QACf,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,EAAE;KACvD,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,OAAuB,EACvB,QAA8B,mBAAmB,EACjD,SAAS,GAAG,MAAM;IAElB,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,IAAI,CAAC,MAAM,mBAAmB,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;IAC3F,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/types.d.ts

@@ -103,12 +103,111 @@ export interface EvolutionConfig {
     costBudgetSeconds?: number;
     /** Deterministic seed for mutation selection (reproducibility). Default 0. */
     seed?: number;
+    /**
+     * Evaluation substrate (ADR-101/102). 'real' (default) runs the repo's test
+     * command — surface-independent, so the behavioural manifold is degenerate.
+     * 'mock' runs the deterministic surface-driven agent loop so traces depend on
+     * the harness surfaces (activating ADR-091/092/094/097/100). Reproducible.
+     */
+    sandboxMode?: 'real' | 'mock' | 'agent';
+    /** Custom scripted suite for 'mock' mode (ADR-102); defaults to DEFAULT_MOCK_TASKS. */
+    mockTasks?: import('./mock-sandbox.js').MockTask[];
+    /**
+     * 'agent' sandbox (ADR-106, Tier 2): executes the variant's REAL surface code
+     * in a child `node --experimental-strip-types` process. Requires Node ≥ 22.
+     */
+    /** Custom agent-task suite for 'agent' mode (ADR-106); defaults to DEFAULT_AGENT_TASKS. */
+    agentTasks?: import('./tier2-sandbox.js').AgentTask[];
+    /**
+     * Parent pool (ADR-115). 'archive' (default) retains the whole archive
+     * (ADR-073). 'generation' is memoryless (μ,λ): parents come only from the
+     * current generation's children — used to ablate archive retention.
+     */
+    selectionPool?: 'archive' | 'generation';
+    /**
+     * Tie-break policy when variants share the top finalScore (ADR-072's scorer
+     * ceilings at 0.985, so ties are the common case). 'insertion' (default) is
+     * fully reproducible — earliest insertion wins. 'faster' breaks ties by lowest
+     * mean trace wall-clock, giving selection a real efficiency gradient; it is
+     * NOT reproducible by construction (wall-clock), so it is strictly opt-in.
+     */
+    tieBreaker?: 'insertion' | 'faster';
+    /**
+     * Parent-selection strategy on a stalled generation (no promoted children).
+     * 'score' (default) takes the top finalScore variants (ADR-073). 'quality-
+     * diversity' (MAP-Elites) takes the elite per behaviour niche (mutated
+     * surface) so the population keeps exploring all surfaces instead of
+     * collapsing onto one at the 0.985 ceiling. 'behavioral-diversity' (ADR-091)
+     * bins by HYPERBOLIC behavioural niche (Poincaré-ball phenotype from run
+     * traces) so diversity tracks how a variant *behaves*, not which file it
+     * touched. 'niche-steering' (ADR-092) goes further — actively seeds the next
+     * generation from survivors nearest an UNDER-EXPLORED region of the Poincaré
+     * ball (preferring the high-complexity frontier), navigating the manifold
+     * rather than just maintaining spread. 'clade' (ADR-094, Huxley-Gödel) selects
+     * parents by descendant POTENTIAL — Thompson sampling over clade
+     * metaproductivity — since the best-scoring variant is a poor parent once its
+     * subtree is exhausted; τ is scheduled from the SGM budget. All deterministic.
+     */
+    selection?: 'score' | 'quality-diversity' | 'behavioral-diversity' | 'niche-steering' | 'clade' | 'pareto';
+    /**
+     * Opt-in genetic crossover (ADR-089). When true and a generation has ≥2
+     * parents, the first child of each parent recombines that parent's surfaces
+     * with the next parent's (inherit a subset from each) instead of mutating.
+     * Default false → mutation-only. Recombination passes the same safety gate.
+     */
+    crossover?: boolean;
+    /**
+     * Opt-in epistatic linkage (ADR-093). Only meaningful with crossover. When
+     * true, evolve() learns a surface co-occurrence graph from high-fitness
+     * lineages and crossover inherits the LINKED block of the donor surface
+     * (keeping co-adapted surfaces together) instead of a random subset.
+     */
+    epistasis?: boolean;
     /**
      * Pluggable code generator (ADR-071). Default is the DeterministicMutator;
      * pass an LLM-backed one (e.g. OpenRouterMutator) to evolve via a model — it
      * still passes the same validateGeneratedCode safety gate.
      */
     generator?: import('./mutator.js').CodeGenerator;
+    /**
+     * Opt-in graded promotion (ADR-076). A hash-pinned benchmark suite. When set,
+     * each child is evaluated against its parent over the suite in the real
+     * sandbox, and the STATISTICAL promotion decision overrides the single-run
+     * ADR-072 promote flag (the decision is also written to runs/<id>.bench.json).
+     * Default unset → the lightweight single-run promotion is used.
+     */
+    benchSuite?: import('./bench/types.js').BenchSuite;
+    /** Bootstrap samples for the statistical promotion gate (ADR-076). */
+    benchSamples?: number;
+    /** Minimum mean-delta a child must clear under the bench promotion gate. */
+    benchMinDelta?: number;
+    /**
+     * Opt-in SGM cumulative risk budget (ADR-079). Only meaningful with benchSuite.
+     * Every admitted promotion spends 1 from this shared, monotonic budget; once
+     * exhausted, further promotions are refused regardless of local score — so
+     * recursive self-modification cannot accumulate unbounded risk across rounds.
+     * Also enforces the SOTA clauses (no hidden-test regression, cost-per-solve
+     * within costCeilingFactor× the parent). Unset → no risk cap.
+     */
+    riskBudgetTotal?: number;
+    /** Cost-per-solve ceiling as a multiple of the parent (SGM). Default 1.20. */
+    costCeilingFactor?: number;
+    /**
+     * Opt-in Benjamini–Hochberg FDR target (ADR-096). Only meaningful with
+     * benchSuite. When set (e.g. 0.05), promotions are corrected for multiple
+     * testing across each generation's candidates — a child stays promoted only if
+     * it survives the generation-wide BH correction. Strictly tightens promotion.
+     */
+    fdrQ?: number;
+    /**
+     * Opt-in self-directed curriculum (ADR-097). Only meaningful with a graded
+     * benchSuite (tasks carrying difficulty 1..5). Scores each generation on only
+     * the admitted difficulty tier, escalating once the population masters it —
+     * so harder tasks arrive as competence grows (a difficulty ladder).
+     */
+    curriculum?: boolean;
+    /** Mean solve rate that counts as "mastered" and escalates the tier. Default 0.9. */
+    curriculumThreshold?: number;
 }
 /** The outcome of an `evolve` run. */
 export interface EvolutionResult {

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAYA;;;;GAIG;AACH,MAAM,MAAM,eAAe,GACvB,SAAS,GACT,gBAAgB,GAChB,UAAU,GACV,aAAa,GACb,YAAY,GACZ,cAAc,GACd,aAAa,CAAC;AAElB,4EAA4E;AAC5E,MAAM,WAAW,WAAW;IAC1B,sCAAsC;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;IACpD,wEAAwE;IACxE,WAAW,EAAE,MAAM,CAAC;IACpB,+EAA+E;IAC/E,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,iFAAiF;IACjF,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,gFAAgF;AAChF,MAAM,WAAW,cAAc;IAC7B,yEAAyE;IACzE,EAAE,EAAE,MAAM,CAAC;IACX,mDAAmD;IACnD,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,wCAAwC;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,yEAAyE;IACzE,GAAG,EAAE,MAAM,CAAC;IACZ,iEAAiE;IACjE,eAAe,EAAE,eAAe,CAAC;IACjC,4CAA4C;IAC5C,eAAe,EAAE,MAAM,CAAC;IACxB,iCAAiC;IACjC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,yEAAyE;AACzE,MAAM,WAAW,QAAQ;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,+EAA+E;IAC/E,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,iFAAiF;IACjF,QAAQ,EAAE,OAAO,CAAC;IAClB,yEAAyE;IACzE,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED,8EAA8E;AAC9E,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,MAAM,CAAC;IAElB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;IAEpB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IAEpB,mDAAmD;IACnD,SAAS,EAAE,MAAM,CAAC;IAClB,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC;IACnB,yEAAyE;IACzE,QAAQ,EAAE,OAAO,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,8CAA8C;AAC9C,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,cAAc,CAAC;IACxB,4BAA4B;IAC5B,KAAK,EAAE,SAAS,GAAG,IAAI,CAAC;IACxB,0CAA0C;IAC1C,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,6CAA6C;AAC7C,MAAM,WAAW,eAAe;IAC9B,2CAA2C;IAC3C,QAAQ,EAAE,MAAM,CAAC;IACjB,qDAAqD;IACrD,QAAQ,EAAE,MAAM,CAAC;IACjB,oCAAoC;IACpC,WAAW,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,qBAAqB,EAAE,MAAM,CAAC;IAC9B,kFAAkF;IAClF,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,mFAAmF;IACnF,cAAc,EAAE,MAAM,CAAC;IACvB,6EAA6E;IAC7E,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,wEAAwE;IACxE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,uFAAuF;IACvF,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,8EAA8E;IAC9E,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,cAAc,EAAE,aAAa,CAAC;CAClD;AAED,sCAAsC;AACtC,MAAM,WAAW,eAAe;IAC9B,QAAQ,EAAE,aAAa,CAAC;IACxB,MAAM,EAAE,aAAa,GAAG,IAAI,CAAC;IAC7B,uDAAuD;IACvD,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,0DAA0D;IAC1D,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAYA;;;;GAIG;AACH,MAAM,MAAM,eAAe,GACvB,SAAS,GACT,gBAAgB,GAChB,UAAU,GACV,aAAa,GACb,YAAY,GACZ,cAAc,GACd,aAAa,CAAC;AAElB,4EAA4E;AAC5E,MAAM,WAAW,WAAW;IAC1B,sCAAsC;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;IACpD,wEAAwE;IACxE,WAAW,EAAE,MAAM,CAAC;IACpB,+EAA+E;IAC/E,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,iFAAiF;IACjF,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,gFAAgF;AAChF,MAAM,WAAW,cAAc;IAC7B,yEAAyE;IACzE,EAAE,EAAE,MAAM,CAAC;IACX,mDAAmD;IACnD,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,wCAAwC;IACxC,UAAU,EAAE,MAAM,CAAC;IACnB,yEAAyE;IACzE,GAAG,EAAE,MAAM,CAAC;IACZ,iEAAiE;IACjE,eAAe,EAAE,eAAe,CAAC;IACjC,4CAA4C;IAC5C,eAAe,EAAE,MAAM,CAAC;IACxB,iCAAiC;IACjC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,yEAAyE;AACzE,MAAM,WAAW,QAAQ;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,+EAA+E;IAC/E,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,iFAAiF;IACjF,QAAQ,EAAE,OAAO,CAAC;IAClB,yEAAyE;IACzE,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED,8EAA8E;AAC9E,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,MAAM,CAAC;IAElB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;IAEpB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IAEpB,mDAAmD;IACnD,SAAS,EAAE,MAAM,CAAC;IAClB,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC;IACnB,yEAAyE;IACzE,QAAQ,EAAE,OAAO,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,8CAA8C;AAC9C,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,cAAc,CAAC;IACxB,4BAA4B;IAC5B,KAAK,EAAE,SAAS,GAAG,IAAI,CAAC;IACxB,0CAA0C;IAC1C,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,6CAA6C;AAC7C,MAAM,WAAW,eAAe;IAC9B,2CAA2C;IAC3C,QAAQ,EAAE,MAAM,CAAC;IACjB,qDAAqD;IACrD,QAAQ,EAAE,MAAM,CAAC;IACjB,oCAAoC;IACpC,WAAW,EAAE,MAAM,CAAC;IACpB,mDAAmD;IACnD,qBAAqB,EAAE,MAAM,CAAC;IAC9B,kFAAkF;IAClF,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,mFAAmF;IACnF,cAAc,EAAE,MAAM,CAAC;IACvB,6EAA6E;IAC7E,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,wEAAwE;IACxE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,uFAAuF;IACvF,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,8EAA8E;IAC9E,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;;OAKG;IACH,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC;IACxC,uFAAuF;IACvF,SAAS,CAAC,EAAE,OAAO,mBAAmB,EAAE,QAAQ,EAAE,CAAC;IACnD;;;OAGG;IACH,2FAA2F;IAC3F,UAAU,CAAC,EAAE,OAAO,oBAAoB,EAAE,SAAS,EAAE,CAAC;IACtD;;;;OAIG;IACH,aAAa,CAAC,EAAE,SAAS,GAAG,YAAY,CAAC;IACzC;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC;IACpC;;;;;;;;;;;;;;;OAeG;IACH,SAAS,CAAC,EACN,OAAO,GACP,mBAAmB,GACnB,sBAAsB,GACtB,gBAAgB,GAChB,OAAO,GACP,QAAQ,CAAC;IACb;;;;;OAKG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,cAAc,EAAE,aAAa,CAAC;IACjD;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,OAAO,kBAAkB,EAAE,UAAU,CAAC;IACnD,sEAAsE;IACtE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,4EAA4E;IAC5E,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;;;OAOG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,8EAA8E;IAC9E,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B;;;;;OAKG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;;OAKG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,qFAAqF;IACrF,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,sCAAsC;AACtC,MAAM,WAAW,eAAe;IAC9B,QAAQ,EAAE,aAAa,CAAC;IACxB,MAAM,EAAE,aAAa,GAAG,IAAI,CAAC;IAC7B,uDAAuD;IACvD,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,0DAA0D;IAC1D,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB"}

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@metaharness/darwin",
-  "version": "0.1.0",
-  "description": "Darwin Mode (ADR-070…075) — bounded, empirical, population-based self-improvement of an agent harness. Generate child harness variants, sandbox-score them, archive the lineage, and promote only measured, safe wins. The model is frozen; the harness evolves. Dependency-free (Node built-ins only).",
+  "version": "0.2.1",
+  "description": "An LLM supercharger and cost optimizer: keep your model frozen and evolve the harness around it so a cheap model performs like an expensive one — measurably better, far cheaper. Mutate→sandbox→score→archive; promote only safe, measured wins. Validated on real SWE-bench Lite (~$0.01/instance). Dependency-free (Node built-ins).",
   "type": "module",
   "main": "./dist/index.js",
   "types": "./dist/index.d.ts",
@@ -26,15 +26,18 @@
     "lint": "tsc --noEmit"
   },
   "keywords": [
+    "llm",
+    "cost-optimization",
+    "llm-optimizer",
+    "cheap-llm",
+    "compute-arbitrage",
     "agent-harness",
-    "darwin-mode",
     "self-improvement",
     "evolutionary-search",
+    "swe-bench",
     "metaharness",
-    "dgm",
-    "archive",
-    "sandbox",
-    "benchmark"
+    "darwin-mode",
+    "sandbox"
   ],
   "author": "rUv <ruv@ruv.net>",
   "license": "MIT",