@metaharness/flywheel 0.1.0

package/README.md

@@ -0,0 +1,129 @@
+# @metaharness/flywheel
+
+**A verifiable self-improvement loop for agent harnesses.**
+_Freeze the model. Evolve the harness. Promote only what proves lift._
+
+[![npm](https://img.shields.io/npm/v/@metaharness/flywheel.svg)](https://www.npmjs.com/package/@metaharness/flywheel)
+[![types](https://img.shields.io/npm/types/@metaharness/flywheel.svg)](https://www.npmjs.com/package/@metaharness/flywheel)
+[![license](https://img.shields.io/npm/l/@metaharness/flywheel.svg)](./LICENSE)
+
+The reusable engine for **run → measure → mutate → verify → promote**. It turns "self-improving agent
+harness" from a claim into an **installable primitive**: plug in your own proposer, evaluator, gate,
+holdouts, and cost/security rules and get the same **auditable, replayable** improvement loop — a signed
+promotion lineage and a compounding lift curve you (or an outside auditor) can verify with no trust in the
+machine that produced it.
+
+Part of the [MetaHarness](https://www.npmjs.com/package/metaharness) stack: **`metaharness`** mints
+harnesses, **`@metaharness/darwin`** evolves them, and **`@metaharness/flywheel`** formalizes the promotion
+loop so every host and vertical harness reuses one engine instead of copying code.
+
+---
+
+## Why
+
+Most "self-improving agent" pitches are unfalsifiable. The flywheel makes improvement **provable**:
+
+- **The gate is the product.** A promotion is only trusted if it clears a **frozen, conjunctive** gate
+  (`meetsPromotionRule`). The gate never moves during a run, and its fingerprint is recorded so anyone can
+  prove it was unchanged.
+- **Freeze the model, evolve the harness.** The expensive model stays fixed; what evolves is the cheap
+  executor's **operating policy**. (ADR-226 receipts: a read-only advisor loop produced *zero* marginal
+  lift at *5.4×* cost — the executor policy is the part that mattered. Invest in policy evolution + gates,
+  not expensive advisory loops.)
+- **Compounding, not searching.** Each generation re-bases on the previous **promoted winner**, so verified
+  wins accumulate into an immutable lineage — a *lift curve*, not a scatter of one-off tweaks.
+- **Anti-Goodhart by construction.** A candidate must clear both a **holdout** and a **frozen anchor** it is
+  never optimized against.
+- **Receipt-backed + replayable.** Every promotion is Ed25519-signed; an external reviewer replays the
+  bundle, reconstructs the lineage to gen-0, and verifies the gate — trusting the *signature*, not you.
+
+## Features
+
+- 🎯 **One tiny API** — `runFlywheelGenerations()` drives coding *and* non-coding harnesses unchanged.
+- 🧊 **Frozen, pluggable gate** — ship the default `meetsPromotionRule` or inject your own compliance/cost gate.
+- 🧬 **Compounding lineage (DAG)** — "git for operating policies": every promotion is a parent-linked commit.
+- 📈 **Lift curve** — the observable proof the wheel *climbs*, generation over generation.
+- 🧾 **Ed25519 receipts + `verifyReplayBundle()`** — independent, no-trust replay.
+- 🔒 **Gate fingerprint** — prove the promotion rule was unchanged between runs.
+- 🧩 **Zero host/benchmark coupling** — knows only candidates, scores, gates, receipts, lineage.
+- 🪶 **Thin + dependency-free** at runtime (Node `crypto` only). ESM, fully typed.
+
+## Install
+
+```bash
+npm install @metaharness/flywheel
+```
+
+## Usage
+
+```ts
+import { runFlywheelGenerations, meetsPromotionRule, makeSigner, verifyReplayBundle } from "@metaharness/flywheel";
+
+const result = await runFlywheelGenerations({
+  rootPolicy: { reasoning: "", format: "", verification: "" },   // the levers you evolve
+  proposer:   async (base, target) => improve(base.policy[target]), // your model call
+  evaluator:  async (policy, suite) => score(policy, suite),        // your host/benchmark → Score
+  promotionRule: meetsPromotionRule,   // the frozen gate (or inject your own)
+  holdout: { id: "holdout", items: myHoldoutTasks },
+  anchor:  { id: "anchor",  items: myAnchorTasks },   // never optimized against
+  maxGenerations: 10,
+  signer: makeSigner(),
+  dataSource: "LIVE",
+});
+
+console.log(result.liftCurve);      // [{ generation, primary, delta, anchor }, …] — the climb
+console.log(result.promotions);     // the promoted chain (current → gen-0 root)
+console.log(result.milestoneReached); // ≥2 anchor-surviving compounding improvements
+
+// Anyone can replay it — no trust in the producer:
+const verdict = verifyReplayBundle(result.replayBundle);
+console.log(verdict.pass, verdict.chainSummary); // true  "gen4(format) → gen2(reasoning) → gen1(…) → gen0(root)"
+```
+
+Your `Evaluator` projects whatever your domain measures onto four abstract axes — the **only** place a
+host or benchmark enters:
+
+```ts
+interface Score {
+  primary: number;     // wins / accuracy / resolved  (higher better)
+  noopRate: number;    // no-op / empty / abstained   (lower better)
+  costPerWin: number;  // resource cost per success   (lower better)
+  regressed: boolean;  // hard safety/security stop
+}
+```
+
+## API
+
+| Export | What |
+| --- | --- |
+| `runFlywheelGenerations(config)` | the promotion loop → `{ liftCurve, promotions, replayBundle, … }` |
+| `meetsPromotionRule` | the default frozen conjunctive gate (`PromotionRule`) |
+| `gateFingerprint(rule)` | sha256 of a gate's source — prove it was unchanged |
+| `makeSigner()` / `verifyReceipt` / `canon` | Ed25519 receipts |
+| `InMemoryLineageStore` / `computeLiftCurve` | lineage graph + lift curve |
+| `verifyReplayBundle(bundle, { pinnedGateFingerprint })` | the external acceptance test |
+| types | `Policy` · `PolicyGenome` · `CandidateMutation` · `Score` · `PromotionReceipt` · `LiftCurve` · `LineageStore` · `ReplayBundle` · `AnchorSuite` · `HoldoutSuite` · `Proposer` · `Evaluator` · `PromotionRule` · `Signer` |
+
+## Package boundary
+
+| Package | Job |
+| --- | --- |
+| `metaharness` | CLI, Studio, repo analysis, user entry point |
+| `@metaharness/darwin` | mutation strategy + evolutionary search |
+| **`@metaharness/flywheel`** | **promotion loop, receipts, lineage, replay, lift curve** |
+| `@metaharness/router` | model / host routing |
+| `@metaharness/hosts-*` | Claude Code, Codex, Hermes, OpenClaw, RVM adapters |
+
+**Design rule:** the flywheel must not know about Claude Code, SWE-bench, GLM, Sonnet, Fable, or any
+benchmark. If you need a benchmark-specific branch, it belongs in your `Evaluator`, not here.
+
+## Topics
+
+`agent-harness` · `self-improving-agents` · `llm-evaluation` · `holdout` · `promotion-gate` ·
+`evolutionary-optimization` · `policy-optimization` · `verifiable-ai` · `audit-trail` · `lineage` ·
+`ed25519` · `receipts` · `provenance` · `goodhart` · `anti-goodhart` · `lift-curve` · `agentic-ci` ·
+`prompt-optimization` · `metaharness` · `darwin` · `flywheel`
+
+## License
+
+MIT © MetaHarness

package/dist/gate.d.ts

@@ -0,0 +1,18 @@
+import type { PromotionEvidence, PromotionDecision, PromotionRule } from './types.js';
+/**
+ * The default frozen gate. Conjunctive — a candidate is promoted iff EVERY clause holds:
+ *   1. primary does not regress   (candidate.primary ≥ baseline.primary)
+ *   2. no-op rate strictly improves (candidate.noopRate < baseline.noopRate) — the load-bearing signal;
+ *      a policy earns a promotion by making the executor COMMIT more, not just score higher
+ *   3. cost/win does not worsen   (candidate.costPerWin ≤ baseline.costPerWin)
+ *   4. no hard safety/security regression
+ *   5. if an anchor is supplied, it must not regress (candidate ≥ baseline) — the anti-Goodhart guard
+ */
+export declare function meetsPromotionRule(e: PromotionEvidence): PromotionDecision;
+/**
+ * A fingerprint of a promotion rule's source — an external reviewer recomputes this and compares it to a
+ * pinned value to prove the gate was UNCHANGED between runs. `Function.prototype.toString` is stable for
+ * a given source; for a build-artifact-level guarantee, hash the rule's source file instead and pass it.
+ */
+export declare function gateFingerprint(rule: PromotionRule): string;
+//# sourceMappingURL=gate.d.ts.map

package/dist/gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gate.d.ts","sourceRoot":"","sources":["../src/gate.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEtF;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,iBAAiB,GAAG,iBAAiB,CAQ1E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,CAE3D"}

package/dist/gate.js

@@ -0,0 +1,39 @@
+// @metaharness/flywheel — the DEFAULT promotion gate + its fingerprint.
+//
+// "The gate is the product." A promotion is only as trustworthy as the rule that admitted it, and that
+// rule must be FROZEN for a deployment and VERIFIABLY unchanged. This is the default conjunctive rule
+// (every clause load-bearing; ALL must hold) — but it is just a `PromotionRule`, so a caller may inject
+// its own (stricter compliance gate, cost policy, etc.) and fingerprint that instead.
+import { createHash } from 'node:crypto';
+/**
+ * The default frozen gate. Conjunctive — a candidate is promoted iff EVERY clause holds:
+ *   1. primary does not regress   (candidate.primary ≥ baseline.primary)
+ *   2. no-op rate strictly improves (candidate.noopRate < baseline.noopRate) — the load-bearing signal;
+ *      a policy earns a promotion by making the executor COMMIT more, not just score higher
+ *   3. cost/win does not worsen   (candidate.costPerWin ≤ baseline.costPerWin)
+ *   4. no hard safety/security regression
+ *   5. if an anchor is supplied, it must not regress (candidate ≥ baseline) — the anti-Goodhart guard
+ */
+export function meetsPromotionRule(e) {
+    const reasons = [];
+    if (e.candidate.primary < e.baseline.primary)
+        reasons.push('primary_regressed');
+    if (!(e.candidate.noopRate < e.baseline.noopRate))
+        reasons.push('noop_rate_not_improved');
+    if (e.candidate.costPerWin > e.baseline.costPerWin)
+        reasons.push('cost_per_win_worsened');
+    if (e.candidate.regressed)
+        reasons.push('safety_regressed');
+    if (e.anchor && e.anchor.candidate < e.anchor.baseline)
+        reasons.push('anchor_regressed');
+    return { promote: reasons.length === 0, reasons };
+}
+/**
+ * A fingerprint of a promotion rule's source — an external reviewer recomputes this and compares it to a
+ * pinned value to prove the gate was UNCHANGED between runs. `Function.prototype.toString` is stable for
+ * a given source; for a build-artifact-level guarantee, hash the rule's source file instead and pass it.
+ */
+export function gateFingerprint(rule) {
+    return createHash('sha256').update(rule.toString()).digest('hex');
+}
+//# sourceMappingURL=gate.js.map

package/dist/gate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gate.js","sourceRoot":"","sources":["../src/gate.ts"],"names":[],"mappings":"AAAA,wEAAwE;AACxE,EAAE;AACF,uGAAuG;AACvG,sGAAsG;AACtG,wGAAwG;AACxG,sFAAsF;AACtF,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAGzC;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAoB;IACrD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,CAAC,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO;QAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAChF,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IAC1F,IAAI,CAAC,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,UAAU;QAAE,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAC1F,IAAI,CAAC,CAAC,SAAS,CAAC,SAAS;QAAE,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IAC5D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IACzF,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC;AACpD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAmB;IACjD,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACpE,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,9 @@
+export { runFlywheelGenerations } from './run.js';
+export type { FlywheelConfig, FlywheelResult } from './run.js';
+export { meetsPromotionRule, gateFingerprint } from './gate.js';
+export { makeSigner, verifyReceipt, canon } from './receipts.js';
+export { InMemoryLineageStore, computeLiftCurve, liftPoint } from './lineage.js';
+export { verifyReplayBundle } from './replay.js';
+export type { ReplayVerdict } from './replay.js';
+export type { Policy, PolicyGenome, CandidateMutation, Score, PromotionEvidence, PromotionDecision, PromotionRule, Suite, HoldoutSuite, AnchorSuite, Proposer, Evaluator, PromotionReceipt, Signer, LineageCommit, LineageStore, LiftPoint, LiftCurve, ReplayBundle, } from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,sBAAsB,EAAE,MAAM,UAAU,CAAC;AAClD,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,UAAU,CAAC;AAE/D,OAAO,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAChE,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AACjE,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACjF,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACjD,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAEjD,YAAY,EACV,MAAM,EACN,YAAY,EACZ,iBAAiB,EACjB,KAAK,EACL,iBAAiB,EACjB,iBAAiB,EACjB,aAAa,EACb,KAAK,EACL,YAAY,EACZ,WAAW,EACX,QAAQ,EACR,SAAS,EACT,gBAAgB,EAChB,MAAM,EACN,aAAa,EACb,YAAY,EACZ,SAAS,EACT,SAAS,EACT,YAAY,GACb,MAAM,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,12 @@
+// @metaharness/flywheel — a verifiable self-improvement loop for agent harnesses.
+// Freeze the model. Evolve the harness. Promote only what proves lift.
+//
+// The reusable engine for run → measure → mutate → verify → promote. It knows only candidates, scores,
+// gates, receipts, and promotion lineage — never a host, model, or benchmark. Plug in your own proposer,
+// evaluator, gate, holdouts, and cost/security rules; get the same auditable, replayable improvement loop.
+export { runFlywheelGenerations } from './run.js';
+export { meetsPromotionRule, gateFingerprint } from './gate.js';
+export { makeSigner, verifyReceipt, canon } from './receipts.js';
+export { InMemoryLineageStore, computeLiftCurve, liftPoint } from './lineage.js';
+export { verifyReplayBundle } from './replay.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,kFAAkF;AAClF,uEAAuE;AACvE,EAAE;AACF,uGAAuG;AACvG,yGAAyG;AACzG,2GAA2G;AAC3G,OAAO,EAAE,sBAAsB,EAAE,MAAM,UAAU,CAAC;AAGlD,OAAO,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAChE,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AACjE,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACjF,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC"}

package/dist/lineage.d.ts

@@ -0,0 +1,14 @@
+import type { LineageCommit, LineageStore, LiftCurve, LiftPoint } from './types.js';
+export declare class InMemoryLineageStore implements LineageStore {
+    private readonly commits;
+    append(commit: LineageCommit): Promise<void>;
+    get(id: string): Promise<LineageCommit | null>;
+    walkToRoot(id: string): Promise<LineageCommit[]>;
+    list(): Promise<LineageCommit[]>;
+}
+/** The compounding lift curve: root primary, then each promoted generation's primary + delta + anchor.
+ *  `chain` is current→root (as returned by walkToRoot); we reverse to read root→current. */
+export declare function computeLiftCurve(chain: LineageCommit[], rootPrimary: number): LiftCurve;
+/** Convenience: a single point (used when composing a curve incrementally). */
+export declare function liftPoint(generation: number, primary: number, delta: number, anchor: number | null): LiftPoint;
+//# sourceMappingURL=lineage.d.ts.map

package/dist/lineage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lineage.d.ts","sourceRoot":"","sources":["../src/lineage.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,aAAa,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAEpF,qBAAa,oBAAqB,YAAW,YAAY;IACvD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAoC;IAEtD,MAAM,CAAC,MAAM,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC;IAG5C,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;IAI9C,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAWhD,IAAI,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;CAGvC;AAED;4FAC4F;AAC5F,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,MAAM,GAAG,SAAS,CAavF;AAED,+EAA+E;AAC/E,wBAAgB,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAE9G"}

package/dist/lineage.js

@@ -0,0 +1,46 @@
+export class InMemoryLineageStore {
+    commits = new Map();
+    async append(commit) {
+        this.commits.set(commit.id, { ...commit });
+    }
+    async get(id) {
+        const c = this.commits.get(id);
+        return c ? { ...c } : null;
+    }
+    async walkToRoot(id) {
+        const chain = [];
+        const seen = new Set();
+        let cur = this.commits.get(id) ?? null;
+        while (cur && !seen.has(cur.id)) {
+            seen.add(cur.id);
+            chain.push({ ...cur });
+            cur = cur.parents[0] ? this.commits.get(cur.parents[0]) ?? null : null;
+        }
+        return chain;
+    }
+    async list() {
+        return [...this.commits.values()].map((c) => ({ ...c }));
+    }
+}
+/** The compounding lift curve: root primary, then each promoted generation's primary + delta + anchor.
+ *  `chain` is current→root (as returned by walkToRoot); we reverse to read root→current. */
+export function computeLiftCurve(chain, rootPrimary) {
+    const rootFirst = [...chain].reverse();
+    const curve = [];
+    let running = rootPrimary;
+    for (const c of rootFirst) {
+        if (c.verdict === 'ROOT') {
+            curve.push({ generation: c.generation, primary: rootPrimary, delta: 0, anchor: c.anchorScore });
+        }
+        else {
+            running += c.primaryDelta;
+            curve.push({ generation: c.generation, primary: running, delta: c.primaryDelta, anchor: c.anchorScore });
+        }
+    }
+    return curve;
+}
+/** Convenience: a single point (used when composing a curve incrementally). */
+export function liftPoint(generation, primary, delta, anchor) {
+    return { generation, primary, delta, anchor };
+}
+//# sourceMappingURL=lineage.js.map

package/dist/lineage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lineage.js","sourceRoot":"","sources":["../src/lineage.ts"],"names":[],"mappings":"AAMA,MAAM,OAAO,oBAAoB;IACd,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IAE5D,KAAK,CAAC,MAAM,CAAC,MAAqB;QAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC;IAC7C,CAAC;IACD,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC/B,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7B,CAAC;IACD,KAAK,CAAC,UAAU,CAAC,EAAU;QACzB,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;QACvC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;YACvB,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACzE,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,KAAK,CAAC,IAAI;QACR,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,CAAC;CACF;AAED;4FAC4F;AAC5F,MAAM,UAAU,gBAAgB,CAAC,KAAsB,EAAE,WAAmB;IAC1E,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;IACvC,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,IAAI,OAAO,GAAG,WAAW,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,OAAO,KAAK,MAAM,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QAClG,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,CAAC,YAAY,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QAC3G,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,SAAS,CAAC,UAAkB,EAAE,OAAe,EAAE,KAAa,EAAE,MAAqB;IACjG,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AAChD,CAAC"}

package/dist/receipts.d.ts

@@ -0,0 +1,9 @@
+import type { PromotionReceipt, Signer } from './types.js';
+/** Deterministic, sorted-key JSON canonicalization — the exact bytes that get signed. */
+export declare function canon(v: unknown): string;
+/** A per-process Ed25519 signer. For production, wrap a secret-backed or HSM key behind the same
+ *  {@link Signer} interface — the flywheel core never sees the private key. */
+export declare function makeSigner(): Signer;
+/** Independently verify a receipt — recompute canon, check the signature against the EMBEDDED key. */
+export declare function verifyReceipt(r: PromotionReceipt): boolean;
+//# sourceMappingURL=receipts.d.ts.map

package/dist/receipts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"receipts.d.ts","sourceRoot":"","sources":["../src/receipts.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAE3D,yFAAyF;AACzF,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAKxC;AAED;+EAC+E;AAC/E,wBAAgB,UAAU,IAAI,MAAM,CAYnC;AAED,sGAAsG;AACtG,wBAAgB,aAAa,CAAC,CAAC,EAAE,gBAAgB,GAAG,OAAO,CAO1D"}

package/dist/receipts.js

@@ -0,0 +1,39 @@
+// @metaharness/flywheel — Ed25519 receipts. Every promotion is signed; a receiver VERIFIES the
+// signature with the embedded public key. Trust comes from the verifiable signature, not from the
+// producer — so a lineage can be replayed and audited with no access to the machine that made it.
+import { generateKeyPairSync, sign as edSign, verify as edVerify, createPublicKey } from 'node:crypto';
+/** Deterministic, sorted-key JSON canonicalization — the exact bytes that get signed. */
+export function canon(v) {
+    if (v === null || typeof v !== 'object')
+        return JSON.stringify(v);
+    if (Array.isArray(v))
+        return `[${v.map(canon).join(',')}]`;
+    const o = v;
+    return `{${Object.keys(o).sort().map((k) => `${JSON.stringify(k)}:${canon(o[k])}`).join(',')}}`;
+}
+/** A per-process Ed25519 signer. For production, wrap a secret-backed or HSM key behind the same
+ *  {@link Signer} interface — the flywheel core never sees the private key. */
+export function makeSigner() {
+    const kp = generateKeyPairSync('ed25519');
+    const pub = kp.publicKey.export({ type: 'spki', format: 'der' }).toString('base64');
+    return {
+        publicKey: () => pub,
+        sign: (payload) => ({
+            payload,
+            signature: edSign(null, Buffer.from(canon(payload)), kp.privateKey).toString('base64'),
+            publicKey: pub,
+            alg: 'ed25519',
+        }),
+    };
+}
+/** Independently verify a receipt — recompute canon, check the signature against the EMBEDDED key. */
+export function verifyReceipt(r) {
+    try {
+        const pub = createPublicKey({ key: Buffer.from(r.publicKey, 'base64'), format: 'der', type: 'spki' });
+        return edVerify(null, Buffer.from(canon(r.payload)), pub, Buffer.from(r.signature, 'base64'));
+    }
+    catch {
+        return false;
+    }
+}
+//# sourceMappingURL=receipts.js.map

package/dist/receipts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"receipts.js","sourceRoot":"","sources":["../src/receipts.ts"],"names":[],"mappings":"AAAA,+FAA+F;AAC/F,kGAAkG;AAClG,kGAAkG;AAClG,OAAO,EAAE,mBAAmB,EAAE,IAAI,IAAI,MAAM,EAAE,MAAM,IAAI,QAAQ,EAAE,eAAe,EAAkB,MAAM,aAAa,CAAC;AAGvH,yFAAyF;AACzF,MAAM,UAAU,KAAK,CAAC,CAAU;IAC9B,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAC3D,MAAM,CAAC,GAAG,CAA4B,CAAC;IACvC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAClG,CAAC;AAED;+EAC+E;AAC/E,MAAM,UAAU,UAAU;IACxB,MAAM,EAAE,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAChG,OAAO;QACL,SAAS,EAAE,GAAG,EAAE,CAAC,GAAG;QACpB,IAAI,EAAE,CAAC,OAAgC,EAAoB,EAAE,CAAC,CAAC;YAC7D,OAAO;YACP,SAAS,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC;YACtF,SAAS,EAAE,GAAG;YACd,GAAG,EAAE,SAAS;SACf,CAAC;KACH,CAAC;AACJ,CAAC;AAED,sGAAsG;AACtG,MAAM,UAAU,aAAa,CAAC,CAAmB;IAC/C,IAAI,CAAC;QACH,MAAM,GAAG,GAAc,eAAe,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACjH,OAAO,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;IAChG,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC"}

package/dist/replay.d.ts

@@ -0,0 +1,17 @@
+import type { ReplayBundle } from './types.js';
+export interface ReplayVerdict {
+    pass: boolean;
+    checks: {
+        receipts: boolean;
+        reachesRoot: boolean;
+        contiguousParents: boolean;
+        allPromoted: boolean;
+        gateUnchanged: boolean;
+    };
+    failures: string[];
+    chainSummary: string;
+}
+export declare function verifyReplayBundle(bundle: ReplayBundle, opts?: {
+    pinnedGateFingerprint?: string;
+}): ReplayVerdict;
+//# sourceMappingURL=replay.d.ts.map

package/dist/replay.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay.d.ts","sourceRoot":"","sources":["../src/replay.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,OAAO,CAAC;IACd,MAAM,EAAE;QACN,QAAQ,EAAE,OAAO,CAAC;QAClB,WAAW,EAAE,OAAO,CAAC;QACrB,iBAAiB,EAAE,OAAO,CAAC;QAC3B,WAAW,EAAE,OAAO,CAAC;QACrB,aAAa,EAAE,OAAO,CAAC;KACxB,CAAC;IACF,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,GAAE;IAAE,qBAAqB,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,aAAa,CA8BrH"}

package/dist/replay.js

@@ -0,0 +1,39 @@
+// @metaharness/flywheel — independent replay. Given ONLY a ReplayBundle (and, optionally, the pinned
+// gate fingerprint), an external reviewer establishes the run with no trust in the producer:
+//   (1) every promotion receipt verifies (Ed25519, recompute canon vs the embedded key);
+//   (2) the promoted lineage reconstructs current → gen-0 immutable root, contiguously;
+//   (3) every commit on the promoted chain is actually PROMOTED (no rejected node smuggled in);
+//   (4) the gate fingerprint matches the pinned value ⇒ the promotion rule was UNCHANGED.
+import { verifyReceipt } from './receipts.js';
+export function verifyReplayBundle(bundle, opts = {}) {
+    const failures = [];
+    const chain = bundle.chain;
+    const receipts = chain.length > 0 && chain.every((c) => verifyReceipt(c.receipt));
+    if (!receipts)
+        failures.push('receipts');
+    const root = chain[chain.length - 1];
+    const reachesRoot = !!root && root.parents.length === 0 && root.id === bundle.root_id;
+    if (!reachesRoot)
+        failures.push('reachesRoot');
+    let contiguousParents = chain.length > 0;
+    for (let i = 0; i < chain.length - 1; i++) {
+        if (!chain[i].parents.includes(chain[i + 1].id))
+            contiguousParents = false;
+    }
+    if (!contiguousParents)
+        failures.push('contiguousParents');
+    const promos = chain.filter((c) => c.verdict !== 'ROOT');
+    const allPromoted = promos.length > 0 && promos.every((c) => c.verdict === 'PROMOTED');
+    if (!allPromoted)
+        failures.push('allPromoted');
+    const gateUnchanged = opts.pinnedGateFingerprint ? bundle.gate_fingerprint === opts.pinnedGateFingerprint : true;
+    if (!gateUnchanged)
+        failures.push('gateUnchanged');
+    return {
+        pass: failures.length === 0,
+        checks: { receipts, reachesRoot, contiguousParents, allPromoted, gateUnchanged },
+        failures,
+        chainSummary: chain.map((c) => `gen${c.generation}${c.mutation ? `(${c.mutation.target})` : '(root)'}`).join(' → '),
+    };
+}
+//# sourceMappingURL=replay.js.map

package/dist/replay.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay.js","sourceRoot":"","sources":["../src/replay.ts"],"names":[],"mappings":"AAAA,qGAAqG;AACrG,6FAA6F;AAC7F,yFAAyF;AACzF,wFAAwF;AACxF,gGAAgG;AAChG,0FAA0F;AAC1F,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAgB9C,MAAM,UAAU,kBAAkB,CAAC,MAAoB,EAAE,OAA2C,EAAE;IACpG,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAE3B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAClF,IAAI,CAAC,QAAQ;QAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAEzC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACrC,MAAM,WAAW,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,OAAO,CAAC;IACtF,IAAI,CAAC,WAAW;QAAE,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAE/C,IAAI,iBAAiB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;YAAE,iBAAiB,GAAG,KAAK,CAAC;IAC/E,CAAC;IACD,IAAI,CAAC,iBAAiB;QAAE,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAE3D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC;IACvF,IAAI,CAAC,WAAW;QAAE,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAE/C,MAAM,aAAa,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,KAAK,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC;IACjH,IAAI,CAAC,aAAa;QAAE,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAEnD,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC;QAC3B,MAAM,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,EAAE,WAAW,EAAE,aAAa,EAAE;QAChF,QAAQ;QACR,YAAY,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;KACpH,CAAC;AACJ,CAAC"}

package/dist/run.d.ts

@@ -0,0 +1,40 @@
+import type { Policy, Proposer, Evaluator, PromotionRule, Signer, HoldoutSuite, AnchorSuite, LineageStore, LineageCommit, LiftCurve, ReplayBundle } from './types.js';
+export interface FlywheelConfig {
+    /** The gen-0 policy — the immutable root every promotion chains back to. */
+    rootPolicy: Policy;
+    proposer: Proposer;
+    evaluator: Evaluator;
+    /** The FROZEN gate. Default: {@link meetsPromotionRule}. Inject your own compliance/cost gate here. */
+    promotionRule?: PromotionRule;
+    holdout: HoldoutSuite;
+    /** Optional frozen anchor suite — never optimized against; a winner must not regress it to count. */
+    anchor?: AnchorSuite;
+    /** Which policy levers to try each generation. Default: every key of `rootPolicy`. */
+    mutationTargets?: string[];
+    maxGenerations: number;
+    signer: Signer;
+    /** Stop early once `spent() ≥ total` (e.g. a $ budget). */
+    budget?: {
+        total: number;
+        spent: () => number;
+    };
+    /** Caller-supplied ISO/label per generation (determinism; no clock in the engine). */
+    now?: (generation: number) => string;
+    /** Stamped on the replay bundle — 'SYNTHETIC' | 'LIVE' | …. NEVER a benchmark name. */
+    dataSource?: string;
+    lineageStore?: LineageStore;
+    rootId?: string;
+}
+export interface FlywheelResult {
+    liftCurve: LiftCurve;
+    /** The promoted chain (current → root). */
+    promotions: LineageCommit[];
+    lineage: LineageStore;
+    replayBundle: ReplayBundle;
+    generationsRun: number;
+    /** ≥2 anchor-surviving verified improvements joined the immutable lineage with no human. */
+    milestoneReached: boolean;
+    finalPolicy: Policy;
+}
+export declare function runFlywheelGenerations(cfg: FlywheelConfig): Promise<FlywheelResult>;
+//# sourceMappingURL=run.d.ts.map

package/dist/run.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"run.d.ts","sourceRoot":"","sources":["../src/run.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EACV,MAAM,EAAgB,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,EAChE,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,YAAY,EAChF,MAAM,YAAY,CAAC;AAEpB,MAAM,WAAW,cAAc;IAC7B,4EAA4E;IAC5E,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,QAAQ,CAAC;IACnB,SAAS,EAAE,SAAS,CAAC;IACrB,uGAAuG;IACvG,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,OAAO,EAAE,YAAY,CAAC;IACtB,qGAAqG;IACrG,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,sFAAsF;IACtF,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,cAAc,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,2DAA2D;IAC3D,MAAM,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,MAAM,CAAA;KAAE,CAAC;IAChD,sFAAsF;IACtF,GAAG,CAAC,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,MAAM,CAAC;IACrC,uFAAuF;IACvF,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,SAAS,CAAC;IACrB,2CAA2C;IAC3C,UAAU,EAAE,aAAa,EAAE,CAAC;IAC5B,OAAO,EAAE,YAAY,CAAC;IACtB,YAAY,EAAE,YAAY,CAAC;IAC3B,cAAc,EAAE,MAAM,CAAC;IACvB,4FAA4F;IAC5F,gBAAgB,EAAE,OAAO,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,wBAAsB,sBAAsB,CAAC,GAAG,EAAE,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC,CA2FzF"}

package/dist/run.js

@@ -0,0 +1,94 @@
+// @metaharness/flywheel — runFlywheelGenerations(): the promotion LOOP. run → measure → mutate → verify
+// → promote, generation after generation, each re-basing on the previous promoted winner so verified
+// wins COMPOUND into an auditable lineage. Host- and benchmark-agnostic: everything specific enters via
+// the injected `proposer` / `evaluator` / `promotionRule`. The gate selects the winner on the HOLDOUT;
+// the FROZEN anchor is a separate survival check (never optimized against — the anti-Goodhart guard).
+import { InMemoryLineageStore, computeLiftCurve } from './lineage.js';
+import { meetsPromotionRule, gateFingerprint } from './gate.js';
+export async function runFlywheelGenerations(cfg) {
+    const rule = cfg.promotionRule ?? meetsPromotionRule;
+    const targets = cfg.mutationTargets ?? Object.keys(cfg.rootPolicy);
+    const store = cfg.lineageStore ?? new InMemoryLineageStore();
+    const now = cfg.now ?? ((g) => `gen-${g}`);
+    const rootId = cfg.rootId ?? 'root';
+    const anchorOf = async (p) => cfg.anchor ? (await cfg.evaluator(p, cfg.anchor)).primary : null;
+    // ── gen-0: the immutable root. Evaluate it once (the baseline) + its anchor (the frozen bar). ──
+    const rootScore = await cfg.evaluator(cfg.rootPolicy, cfg.holdout);
+    const rootAnchor = await anchorOf(cfg.rootPolicy);
+    await store.append({
+        id: rootId, generation: 0, parents: [], mutation: null, primaryDelta: 0, anchorScore: rootAnchor,
+        verdict: 'ROOT', failureReasons: [], receipt: cfg.signer.sign({ kind: 'root', root: rootId }), createdAt: now(0),
+    });
+    let parentId = rootId;
+    let policy = { ...cfg.rootPolicy };
+    let score = rootScore;
+    const allCommits = [];
+    let generationsRun = 0;
+    for (let gen = 1; gen <= cfg.maxGenerations; gen++) {
+        if (cfg.budget && cfg.budget.spent() >= cfg.budget.total)
+            break;
+        generationsRun = gen;
+        // propose + evaluate one candidate per mutation target, gate each on the HOLDOUT.
+        const base = { id: parentId, generation: gen, parents: [parentId], policy };
+        const cands = [];
+        for (const target of targets) {
+            const proposed = await cfg.proposer(base, target);
+            const candPolicy = { ...policy, [target]: proposed };
+            const candScore = await cfg.evaluator(candPolicy, cfg.holdout);
+            const decision = rule({ baseline: score, candidate: candScore });
+            cands.push({ target, policy: candPolicy, score: candScore, reasons: decision.reasons, promote: decision.promote });
+        }
+        // winner = highest primary among the promotable; then verify it survives the FROZEN anchor.
+        const promotable = cands.filter((c) => c.promote).sort((a, b) => b.score.primary - a.score.primary);
+        const winner = promotable[0] ?? null;
+        const winnerAnchor = winner ? await anchorOf(winner.policy) : null;
+        const anchorSurvives = winner ? (rootAnchor === null || (winnerAnchor ?? -Infinity) >= rootAnchor) : false;
+        // A winner that regresses the anchor is NOT promoted (Goodhart guard) — it becomes a rejection.
+        const promotedWinner = winner && anchorSurvives ? winner : null;
+        for (const c of cands) {
+            const isWinner = c === promotedWinner;
+            const id = `${parentId}__${c.target}_gen${gen}`;
+            const primaryDelta = c.score.primary - score.primary;
+            const commit = {
+                id, generation: gen, parents: [parentId],
+                mutation: { target: c.target, summary: `adapt ${c.target}` },
+                primaryDelta,
+                anchorScore: isWinner ? winnerAnchor : c === winner ? winnerAnchor : null,
+                verdict: isWinner ? 'PROMOTED' : 'REJECTED',
+                failureReasons: isWinner ? [] : c === winner && !anchorSurvives ? ['anchor_regressed'] : c.reasons,
+                receipt: cfg.signer.sign({ kind: 'candidate', id, target: c.target, verdict: isWinner ? 'PROMOTED' : 'REJECTED', primaryDelta }),
+                createdAt: now(gen),
+            };
+            await store.append(commit);
+            allCommits.push(commit);
+        }
+        if (promotedWinner) {
+            parentId = `${parentId}__${promotedWinner.target}_gen${gen}`;
+            policy = promotedWinner.policy;
+            score = promotedWinner.score;
+        }
+    }
+    const chain = await store.walkToRoot(parentId);
+    const liftCurve = computeLiftCurve(chain, rootScore.primary);
+    const promotions = chain.filter((c) => c.verdict === 'PROMOTED');
+    const verified = promotions.filter((c) => c.primaryDelta > 0).length;
+    const anchorSurviving = promotions.filter((c) => c.primaryDelta > 0 && (rootAnchor === null || (c.anchorScore ?? -Infinity) >= rootAnchor)).length;
+    const replayBundle = {
+        data_source: cfg.dataSource ?? 'UNSPECIFIED',
+        root_id: rootId,
+        chain,
+        all_commits: allCommits,
+        lift_curve: liftCurve,
+        gate_fingerprint: gateFingerprint(rule),
+        verified_improvements: verified,
+        anchor_surviving_improvements: anchorSurviving,
+        milestone_reached: anchorSurviving >= 2,
+        created_at: now(cfg.maxGenerations),
+    };
+    return {
+        liftCurve, promotions, lineage: store, replayBundle,
+        generationsRun,
+        milestoneReached: anchorSurviving >= 2, finalPolicy: policy,
+    };
+}
+//# sourceMappingURL=run.js.map

package/dist/run.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run.js","sourceRoot":"","sources":["../src/run.ts"],"names":[],"mappings":"AAAA,wGAAwG;AACxG,qGAAqG;AACrG,wGAAwG;AACxG,uGAAuG;AACvG,sGAAsG;AACtG,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AA0ChE,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAAC,GAAmB;IAC9D,MAAM,IAAI,GAAG,GAAG,CAAC,aAAa,IAAI,kBAAkB,CAAC;IACrD,MAAM,OAAO,GAAG,GAAG,CAAC,eAAe,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACnE,MAAM,KAAK,GAAG,GAAG,CAAC,YAAY,IAAI,IAAI,oBAAoB,EAAE,CAAC;IAC7D,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,MAAM,CAAC;IACpC,MAAM,QAAQ,GAAG,KAAK,EAAE,CAAS,EAA0B,EAAE,CAC3D,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IAEnE,kGAAkG;IAClG,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAClD,MAAM,KAAK,CAAC,MAAM,CAAC;QACjB,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,EAAE,WAAW,EAAE,UAAU;QAChG,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;KACjH,CAAC,CAAC;IAEH,IAAI,QAAQ,GAAG,MAAM,CAAC;IACtB,IAAI,MAAM,GAAW,EAAE,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC;IAC3C,IAAI,KAAK,GAAU,SAAS,CAAC;IAC7B,MAAM,UAAU,GAAoB,EAAE,CAAC;IACvC,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,cAAc,EAAE,GAAG,EAAE,EAAE,CAAC;QACnD,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK;YAAE,MAAM;QAChE,cAAc,GAAG,GAAG,CAAC;QAErB,kFAAkF;QAClF,MAAM,IAAI,GAAiB,EAAE,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;QAC1F,MAAM,KAAK,GAAiG,EAAE,CAAC;QAC/G,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAClD,MAAM,UAAU,GAAW,EAAE,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,CAAC;YAC7D,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,SAAS,CAAC,UAAU,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;YAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;YACjE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;QACrH,CAAC;QAED,4FAA4F;QAC5F,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACpG,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACrC,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACnE,MAAM,cAAc,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,KAAK,IAAI,IAAI,CAAC,YAAY,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC3G,gGAAgG;QAChG,MAAM,cAAc,GAAG,MAAM,IAAI,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;QAEhE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,CAAC,KAAK,cAAc,CAAC;YACtC,MAAM,EAAE,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;YACrD,MAAM,MAAM,GAAkB;gBAC5B,EAAE,EAAE,UAAU,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,QAAQ,CAAC;gBACxC,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;gBAC5D,YAAY;gBACZ,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI;gBACzE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU;gBAC3C,cAAc,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;gBAClG,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC;gBAChI,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC;aACpB,CAAC;YACF,MAAM,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3B,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;QAED,IAAI,cAAc,EAAE,CAAC;YAAC,QAAQ,GAAG,GAAG,QAAQ,KAAK,cAAc,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC;YAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC;YAAC,KAAK,GAAG,cAAc,CAAC,KAAK,CAAC;QAAC,CAAC;IACrJ,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC;IACjE,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;IACrE,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,IAAI,CAAC,UAAU,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC;IAEnJ,MAAM,YAAY,GAAiB;QACjC,WAAW,EAAE,GAAG,CAAC,UAAU,IAAI,aAAa;QAC5C,OAAO,EAAE,MAAM;QACf,KAAK;QACL,WAAW,EAAE,UAAU;QACvB,UAAU,EAAE,SAAS;QACrB,gBAAgB,EAAE,eAAe,CAAC,IAAI,CAAC;QACvC,qBAAqB,EAAE,QAAQ;QAC/B,6BAA6B,EAAE,eAAe;QAC9C,iBAAiB,EAAE,eAAe,IAAI,CAAC;QACvC,UAAU,EAAE,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC;KACpC,CAAC;IAEF,OAAO;QACL,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY;QACnD,cAAc;QACd,gBAAgB,EAAE,eAAe,IAAI,CAAC,EAAE,WAAW,EAAE,MAAM;KAC5D,CAAC;AACJ,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,115 @@
+/** A policy is an opaque bag of named string levers — the thing being evolved. The flywheel never
+ *  interprets a lever's meaning; the caller's Evaluator does. */
+export type Policy = Record<string, string>;
+/** A versioned policy node in the evolution graph. `parents` is a DAG (usually one parent = the winner
+ *  it re-based on); the gen-0 root has `parents: []` and never changes. */
+export interface PolicyGenome {
+    id: string;
+    generation: number;
+    parents: string[];
+    policy: Policy;
+}
+/** One mutation attempt: which lever was changed, and a short human summary of how. */
+export interface CandidateMutation {
+    target: string;
+    summary: string;
+}
+/** The abstract quality of a policy on a suite. All host/benchmark meaning is projected onto these four
+ *  axes by the Evaluator. Higher `primary` is better; lower `noopRate`/`costPerWin` is better;
+ *  `regressed` is a hard safety/security stop. (Named generically on purpose — "primary" not "gold".) */
+export interface Score {
+    /** The main quality signal (wins / accuracy / resolved) — higher is better. */
+    primary: number;
+    /** Fraction of non-committal / empty / no-op outputs — lower is better (the "never end empty" signal). */
+    noopRate: number;
+    /** Resource cost per successful outcome — lower is better. */
+    costPerWin: number;
+    /** A hard safety/security regression flag — any `true` blocks promotion outright. */
+    regressed: boolean;
+}
+/** What a promotion gate decides over. `anchor` (optional) is the FROZEN, never-optimized-against suite
+ *  score — the anti-Goodhart check. */
+export interface PromotionEvidence {
+    baseline: Score;
+    candidate: Score;
+    anchor?: {
+        baseline: number;
+        candidate: number;
+    };
+}
+export interface PromotionDecision {
+    promote: boolean;
+    reasons: string[];
+}
+/** THE GATE. Pure, deterministic, and — for a given deployment — FROZEN ("the gate is the product").
+ *  Injectable so enterprises can supply their own; {@link meetsPromotionRule} is the default. */
+export type PromotionRule = (evidence: PromotionEvidence) => PromotionDecision;
+/** An opaque evaluation suite — the flywheel treats `items` as a black box. HoldoutSuite is optimized
+ *  against; AnchorSuite is NOT (it is the frozen no-regression guard). Same shape; different role. */
+export interface Suite {
+    id: string;
+    items: unknown[];
+}
+export type HoldoutSuite = Suite;
+export type AnchorSuite = Suite;
+/** Proposes an improved value for ONE policy lever. The ONLY seam where a model/host enters propose. */
+export type Proposer = (base: PolicyGenome, target: string) => Promise<string>;
+/** Scores a policy on a suite. The ONLY seam where a host/benchmark enters evaluate. Everything
+ *  Claude-Code-, SWE-bench-, or trading-specific lives HERE, in the caller — never in the flywheel. */
+export type Evaluator = (policy: Policy, suite: Suite) => Promise<Score>;
+export interface PromotionReceipt {
+    payload: Record<string, unknown>;
+    signature: string;
+    publicKey: string;
+    alg: 'ed25519';
+}
+/** Signs a receipt + publishes its public key. Injectable (per-process, secret-backed, HSM, …). */
+export interface Signer {
+    sign(payload: Record<string, unknown>): PromotionReceipt;
+    publicKey(): string;
+}
+export interface LineageCommit {
+    id: string;
+    generation: number;
+    parents: string[];
+    mutation: CandidateMutation | null;
+    /** baseline→candidate deltas on each axis (for the knowledge base / regression ancestry). */
+    primaryDelta: number;
+    anchorScore: number | null;
+    verdict: 'ROOT' | 'PROMOTED' | 'REJECTED';
+    failureReasons: string[];
+    receipt: PromotionReceipt;
+    createdAt: string;
+}
+export interface LineageStore {
+    append(commit: LineageCommit): Promise<void>;
+    get(id: string): Promise<LineageCommit | null>;
+    /** Walk parents from `id` to the immutable gen-0 root (current → root). */
+    walkToRoot(id: string): Promise<LineageCommit[]>;
+    list(): Promise<LineageCommit[]>;
+}
+/** One point per promoted generation — the compounding curve. */
+export interface LiftPoint {
+    generation: number;
+    primary: number;
+    delta: number;
+    anchor: number | null;
+}
+export type LiftCurve = LiftPoint[];
+/** Everything an EXTERNAL reviewer needs to replay the run with no trust in the producer. */
+export interface ReplayBundle {
+    data_source: string;
+    root_id: string;
+    /** current → gen-0 root (the promoted chain). */
+    chain: LineageCommit[];
+    /** every candidate commit across all generations (promoted + rejected) — the full diagnostic ledger. */
+    all_commits: LineageCommit[];
+    lift_curve: LiftCurve;
+    /** sha256 of the PromotionRule source, when the caller supplies it — proves the gate was UNCHANGED. */
+    gate_fingerprint: string | null;
+    verified_improvements: number;
+    anchor_surviving_improvements: number;
+    milestone_reached: boolean;
+    created_at: string;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAQA;iEACiE;AACjE,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAE5C;2EAC2E;AAC3E,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,uFAAuF;AACvF,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;yGAEyG;AACzG,MAAM,WAAW,KAAK;IACpB,+EAA+E;IAC/E,OAAO,EAAE,MAAM,CAAC;IAChB,0GAA0G;IAC1G,QAAQ,EAAE,MAAM,CAAC;IACjB,8DAA8D;IAC9D,UAAU,EAAE,MAAM,CAAC;IACnB,qFAAqF;IACrF,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;uCACuC;AACvC,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,KAAK,CAAC;IAChB,SAAS,EAAE,KAAK,CAAC;IACjB,MAAM,CAAC,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;CAClD;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;iGACiG;AACjG,MAAM,MAAM,aAAa,GAAG,CAAC,QAAQ,EAAE,iBAAiB,KAAK,iBAAiB,CAAC;AAE/E;sGACsG;AACtG,MAAM,WAAW,KAAK;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,OAAO,EAAE,CAAC;CAClB;AACD,MAAM,MAAM,YAAY,GAAG,KAAK,CAAC;AACjC,MAAM,MAAM,WAAW,GAAG,KAAK,CAAC;AAEhC,wGAAwG;AACxG,MAAM,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;AAE/E;uGACuG;AACvG,MAAM,MAAM,SAAS,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,KAAK,OAAO,CAAC,KAAK,CAAC,CAAC;AAIzE,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,GAAG,EAAE,SAAS,CAAC;CAChB;AAED,mGAAmG;AACnG,MAAM,WAAW,MAAM;IACrB,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC;IACzD,SAAS,IAAI,MAAM,CAAC;CACrB;AAID,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,QAAQ,EAAE,iBAAiB,GAAG,IAAI,CAAC;IACnC,6FAA6F;IAC7F,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,OAAO,EAAE,MAAM,GAAG,UAAU,GAAG,UAAU,CAAC;IAC1C,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,OAAO,EAAE,gBAAgB,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,CAAC,MAAM,EAAE,aAAa,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC7C,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,CAAC;IAC/C,2EAA2E;IAC3E,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;IACjD,IAAI,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;CAClC;AAID,iEAAiE;AACjE,MAAM,WAAW,SAAS;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CACvB;AACD,MAAM,MAAM,SAAS,GAAG,SAAS,EAAE,CAAC;AAEpC,6FAA6F;AAC7F,MAAM,WAAW,YAAY;IAC3B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,iDAAiD;IACjD,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,wGAAwG;IACxG,WAAW,EAAE,aAAa,EAAE,CAAC;IAC7B,UAAU,EAAE,SAAS,CAAC;IACtB,uGAAuG;IACvG,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,qBAAqB,EAAE,MAAM,CAAC;IAC9B,6BAA6B,EAAE,MAAM,CAAC;IACtC,iBAAiB,EAAE,OAAO,CAAC;IAC3B,UAAU,EAAE,MAAM,CAAC;CACpB"}

package/dist/types.js

@@ -0,0 +1,9 @@
+// @metaharness/flywheel — the abstract API surface.
+//
+// DESIGN RULE (load-bearing): this package must NOT know about any host, model, or benchmark — no
+// Claude Code, no SWE-bench, no GLM/Sonnet/Fable, no code-repair. It knows only CANDIDATES, SCORES,
+// GATES, RECEIPTS, and PROMOTION LINEAGE. Everything host- or benchmark-specific enters through the
+// injected `Proposer` / `Evaluator` (and, if you like, a custom `PromotionRule`). If you find yourself
+// wanting a benchmark-specific branch in here, it belongs in the caller, not the flywheel.
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,oDAAoD;AACpD,EAAE;AACF,kGAAkG;AAClG,oGAAoG;AACpG,oGAAoG;AACpG,uGAAuG;AACvG,2FAA2F"}

package/package.json

@@ -0,0 +1,29 @@
+{
+  "name": "@metaharness/flywheel",
+  "version": "0.1.0",
+  "description": "A verifiable self-improvement loop for agent harnesses. Freeze the model. Evolve the harness. Promote only what proves lift.",
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "files": ["dist", "README.md"],
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsc",
+    "test": "vitest run",
+    "lint": "tsc --noEmit"
+  },
+  "keywords": ["agent", "harness", "self-improvement", "flywheel", "promotion", "lineage", "receipts", "metaharness"],
+  "license": "MIT",
+  "devDependencies": {
+    "typescript": "^5.4.0",
+    "vitest": "^2.0.0"
+  }
+}