@jinn-network/client 0.1.7 → 0.1.8-canary.026c5503

package/dist/eval/slope.js

@@ -0,0 +1,46 @@
+/**
+ * Ordinary least-squares slope of resolved-rate vs cycle index for the
+ * train-arm slope measurement (issue #822, AC#1).
+ *
+ * The train-arm e2e evaluates a checkpoint against the held-out slate (#817)
+ * at intervals via the eval orchestrator (#818), collecting one
+ * `{ cycleIndex, rate }` point per interval (`rate` = passed / scorable, the
+ * Wilson point estimate). The slope of the least-squares fit is the headline
+ * "is the learner improving across the training sequence" number.
+ *
+ * It is deliberately a thin helper over the closed-form OLS slope
+ * (`cov(x,y) / var(x)`); the per-point confidence intervals come from
+ * `wilson.ts` — this module does NOT reimplement them. The slope sign alone is
+ * never a verdict at small N: a flat or slightly negative slope is "within
+ * noise", which the e2e surfaces via the §4.1 honesty caveat.
+ */
+/**
+ * Least-squares slope of `rate` regressed on `cycleIndex`. Returns 0 for fewer
+ * than two points (no line to fit) and for a degenerate fit where every x is
+ * identical (zero variance — division would be NaN). A flat sequence yields
+ * exactly 0.
+ */
+export function leastSquaresSlope(points) {
+    const n = points.length;
+    if (n < 2)
+        return 0;
+    let sumX = 0;
+    let sumY = 0;
+    for (const { cycleIndex, rate } of points) {
+        sumX += cycleIndex;
+        sumY += rate;
+    }
+    const meanX = sumX / n;
+    const meanY = sumY / n;
+    let cov = 0;
+    let varX = 0;
+    for (const { cycleIndex, rate } of points) {
+        const dx = cycleIndex - meanX;
+        cov += dx * (rate - meanY);
+        varX += dx * dx;
+    }
+    if (varX === 0)
+        return 0;
+    return cov / varX;
+}
+//# sourceMappingURL=slope.js.map

package/dist/eval/slope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"slope.js","sourceRoot":"","sources":["../../src/eval/slope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AASH;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAmB;IACnD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC;QAC1C,IAAI,IAAI,UAAU,CAAC;QACnB,IAAI,IAAI,IAAI,CAAC;IACf,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IACvB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC;QAC1C,MAAM,EAAE,GAAG,UAAU,GAAG,KAAK,CAAC;QAC9B,GAAG,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;QAC3B,IAAI,IAAI,EAAE,GAAG,EAAE,CAAC;IAClB,CAAC;IACD,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzB,OAAO,GAAG,GAAG,IAAI,CAAC;AACpB,CAAC"}

package/dist/eval/train-sequence.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Train-sequence builder with the no-train/test-overlap guard for the
+ * train-arm slope e2e (issue #822, AC#2).
+ *
+ * The learner-full-cycle e2e drives `runCycle` DIRECTLY (it does not post tasks
+ * through the generator), so the generator's `excludeHeldOutSlate` train-stream
+ * chokepoint (#817) is BYPASSED. This builder is therefore the load-bearing
+ * AC#2 mechanism for the e2e: it selects the N distinct training instances from
+ * the pool with the held-out slate excluded, and asserts the resulting
+ * sequence is disjoint from the slate (fail-loud, never a silent drop).
+ *
+ * It reuses `excludeHeldOutSlate` from the #817 primitive rather than
+ * reimplementing the exclusion. Selection is deterministic (instance-id sorted)
+ * so a given pool yields a stable sequence across runs.
+ */
+import type { PoolTask } from '../solver-types/_swe-rebench-v2-pool.js';
+/** Thrown when a chosen training sequence intersects the held-out slate (AC#2). */
+export declare class TrainTestOverlapError extends Error {
+    readonly overlap: string[];
+    constructor(overlap: string[]);
+}
+/** Assert a set of training ids is disjoint from the slate, else throw loud. */
+export declare function assertNoOverlap(trainIds: string[], slateIds: Set<string>): void;
+export declare function buildTrainSequence(args: {
+    pool: PoolTask[];
+    slateIds: Set<string>;
+    /** Number of distinct training tasks (= N training cycles). */
+    count: number;
+    /**
+     * Optional explicit, hand-picked instance_ids (in order). When set, the
+     * builder still runs the no-overlap guard and resolves each id against the
+     * pool — used to fail-loud on a hand-edited sequence that overlaps the slate.
+     */
+    explicitIds?: string[];
+}): PoolTask[];

package/dist/eval/train-sequence.js

@@ -0,0 +1,59 @@
+/**
+ * Train-sequence builder with the no-train/test-overlap guard for the
+ * train-arm slope e2e (issue #822, AC#2).
+ *
+ * The learner-full-cycle e2e drives `runCycle` DIRECTLY (it does not post tasks
+ * through the generator), so the generator's `excludeHeldOutSlate` train-stream
+ * chokepoint (#817) is BYPASSED. This builder is therefore the load-bearing
+ * AC#2 mechanism for the e2e: it selects the N distinct training instances from
+ * the pool with the held-out slate excluded, and asserts the resulting
+ * sequence is disjoint from the slate (fail-loud, never a silent drop).
+ *
+ * It reuses `excludeHeldOutSlate` from the #817 primitive rather than
+ * reimplementing the exclusion. Selection is deterministic (instance-id sorted)
+ * so a given pool yields a stable sequence across runs.
+ */
+import { excludeHeldOutSlate } from '../solver-types/_swe-rebench-v2-held-out-slate.js';
+/** Thrown when a chosen training sequence intersects the held-out slate (AC#2). */
+export class TrainTestOverlapError extends Error {
+    overlap;
+    constructor(overlap) {
+        super(`train/test overlap: training sequence includes held-out slate instance(s) ` +
+            `${overlap.join(', ')} — refusing to train on the eval slate (AC#2). ` +
+            `The slate must stay out-of-sample for the slope to mean anything.`);
+        this.overlap = overlap;
+        this.name = 'TrainTestOverlapError';
+    }
+}
+/** Assert a set of training ids is disjoint from the slate, else throw loud. */
+export function assertNoOverlap(trainIds, slateIds) {
+    const overlap = trainIds.filter((id) => slateIds.has(id));
+    if (overlap.length > 0)
+        throw new TrainTestOverlapError(overlap);
+}
+export function buildTrainSequence(args) {
+    const eligible = excludeHeldOutSlate(args.pool, args.slateIds);
+    const byId = new Map(eligible.map((t) => [t.instance_id, t]));
+    if (args.explicitIds) {
+        // Guard the hand-picked sequence against the slate BEFORE resolving, so a
+        // slate-overlapping id is a TrainTestOverlapError, not a "not eligible".
+        assertNoOverlap(args.explicitIds, args.slateIds);
+        return args.explicitIds.map((id) => {
+            const task = byId.get(id);
+            if (!task) {
+                throw new Error(`explicit training instance ${id} not in the eligible pool`);
+            }
+            return task;
+        });
+    }
+    // Deterministic selection: instance-id sorted, first `count`.
+    const sorted = [...eligible].sort((a, b) => a.instance_id.localeCompare(b.instance_id));
+    if (sorted.length < args.count) {
+        throw new Error(`train sequence needs ${args.count} distinct tasks but only ${sorted.length} eligible ` +
+            `(pool size ${args.pool.length} minus ${args.slateIds.size} held-out slate instance(s))`);
+    }
+    const picked = sorted.slice(0, args.count);
+    assertNoOverlap(picked.map((t) => t.instance_id), args.slateIds);
+    return picked;
+}
+//# sourceMappingURL=train-sequence.js.map

package/dist/eval/train-sequence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"train-sequence.js","sourceRoot":"","sources":["../../src/eval/train-sequence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,EAAE,mBAAmB,EAAE,MAAM,mDAAmD,CAAC;AAExF,mFAAmF;AACnF,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAClB;IAA5B,YAA4B,OAAiB;QAC3C,KAAK,CACH,4EAA4E;YAC1E,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,iDAAiD;YACtE,mEAAmE,CACtE,CAAC;QALwB,YAAO,GAAP,OAAO,CAAU;QAM3C,IAAI,CAAC,IAAI,GAAG,uBAAuB,CAAC;IACtC,CAAC;CACF;AAED,gFAAgF;AAChF,MAAM,UAAU,eAAe,CAAC,QAAkB,EAAE,QAAqB;IACvE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,qBAAqB,CAAC,OAAO,CAAC,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,IAWlC;IACC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9D,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,0EAA0E;QAC1E,yEAAyE;QACzE,eAAe,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;YACjC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,MAAM,IAAI,KAAK,CAAC,8BAA8B,EAAE,2BAA2B,CAAC,CAAC;YAC/E,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAED,8DAA8D;IAC9D,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IACxF,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CACb,wBAAwB,IAAI,CAAC,KAAK,4BAA4B,MAAM,CAAC,MAAM,YAAY;YACrF,cAAc,IAAI,CAAC,IAAI,CAAC,MAAM,UAAU,IAAI,CAAC,QAAQ,CAAC,IAAI,8BAA8B,CAC3F,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjE,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/eval/wilson.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Wilson score interval + resolved-rate comparison for the `jinn eval`
+ * held-out checkpoint orchestrator (issue #818, AC#2).
+ *
+ * The Wilson score interval is a binomial proportion confidence interval that
+ * behaves well at the extremes (p=0, p=1) and for small n — unlike the naive
+ * normal-approximation interval. We write it small (no stats dependency, per
+ * repo convention): the formula is ~10 lines.
+ *
+ * Per log/decisions/2026-05-28-rl-eval-measurement.md §4: this is v1-simple.
+ * Only *large* deltas are trustworthy — we encode that as "the child and
+ * parent intervals do not overlap." No seed control, no multi-run averaging.
+ */
+export interface Interval {
+    /** Observed point estimate, passed / scorable (0 when scorable=0). */
+    p: number;
+    /** Lower bound, clamped to [0, 1]. */
+    lo: number;
+    /** Upper bound, clamped to [0, 1]. */
+    hi: number;
+}
+/**
+ * Wilson score interval for `passed` successes out of `scorable` trials.
+ * `scorable === 0` returns a degenerate `{ p: 0, lo: 0, hi: 0 }` (no NaN).
+ */
+export declare function wilsonInterval(passed: number, scorable: number, z?: number): Interval;
+export type RateVerdict = 'trustworthy' | 'within-noise';
+export interface RateComparison {
+    child: Interval;
+    parent: Interval;
+    /** child.p − parent.p (point-estimate difference, can be negative). */
+    delta: number;
+    /**
+     * 'trustworthy' iff the two Wilson intervals do NOT overlap; otherwise
+     * 'within-noise'. v1-simple: only disjoint intervals justify a claim.
+     */
+    verdict: RateVerdict;
+}
+export declare function compareRates(child: {
+    passed: number;
+    scorable: number;
+}, parent: {
+    passed: number;
+    scorable: number;
+}): RateComparison;

package/dist/eval/wilson.js

@@ -0,0 +1,48 @@
+/**
+ * Wilson score interval + resolved-rate comparison for the `jinn eval`
+ * held-out checkpoint orchestrator (issue #818, AC#2).
+ *
+ * The Wilson score interval is a binomial proportion confidence interval that
+ * behaves well at the extremes (p=0, p=1) and for small n — unlike the naive
+ * normal-approximation interval. We write it small (no stats dependency, per
+ * repo convention): the formula is ~10 lines.
+ *
+ * Per log/decisions/2026-05-28-rl-eval-measurement.md §4: this is v1-simple.
+ * Only *large* deltas are trustworthy — we encode that as "the child and
+ * parent intervals do not overlap." No seed control, no multi-run averaging.
+ */
+/** Two-sided z for a 95% interval (1.96 ≈ Φ⁻¹(0.975)). */
+const DEFAULT_Z = 1.96;
+/**
+ * Wilson score interval for `passed` successes out of `scorable` trials.
+ * `scorable === 0` returns a degenerate `{ p: 0, lo: 0, hi: 0 }` (no NaN).
+ */
+export function wilsonInterval(passed, scorable, z = DEFAULT_Z) {
+    if (scorable === 0)
+        return { p: 0, lo: 0, hi: 0 };
+    const n = scorable;
+    const p = passed / n;
+    const z2 = z * z;
+    const denom = 1 + z2 / n;
+    const centre = p + z2 / (2 * n);
+    const margin = z * Math.sqrt((p * (1 - p)) / n + z2 / (4 * n * n));
+    const lo = (centre - margin) / denom;
+    const hi = (centre + margin) / denom;
+    return {
+        p,
+        lo: Math.max(0, lo),
+        hi: Math.min(1, hi),
+    };
+}
+export function compareRates(child, parent) {
+    const c = wilsonInterval(child.passed, child.scorable);
+    const p = wilsonInterval(parent.passed, parent.scorable);
+    const disjoint = c.lo > p.hi || p.lo > c.hi;
+    return {
+        child: c,
+        parent: p,
+        delta: c.p - p.p,
+        verdict: disjoint ? 'trustworthy' : 'within-noise',
+    };
+}
+//# sourceMappingURL=wilson.js.map

package/dist/eval/wilson.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"wilson.js","sourceRoot":"","sources":["../../src/eval/wilson.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,0DAA0D;AAC1D,MAAM,SAAS,GAAG,IAAI,CAAC;AAWvB;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,QAAgB,EAAE,IAAY,SAAS;IACpF,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IAClD,MAAM,CAAC,GAAG,QAAQ,CAAC;IACnB,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACnE,MAAM,EAAE,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC;IACrC,MAAM,EAAE,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC;IACrC,OAAO;QACL,CAAC;QACD,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;QACnB,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC;KACpB,CAAC;AACJ,CAAC;AAgBD,MAAM,UAAU,YAAY,CAC1B,KAA2C,EAC3C,MAA4C;IAE5C,MAAM,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IACvD,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACzD,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;IAC5C,OAAO;QACL,KAAK,EAAE,CAAC;QACR,MAAM,EAAE,CAAC;QACT,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChB,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc;KACnD,CAAC;AACJ,CAAC"}

package/dist/events/types.d.ts

@@ -21,7 +21,7 @@ export declare const StructuredEventSchema: z.ZodObject<{
 }, "strip", z.ZodTypeAny, {
     message: string;
     id: string;
-    kind: "reward" | "error" | "system" | "log" | "fleet" | "intent";
+    kind: "reward" | "error" | "intent" | "fleet" | "system" | "log";
     schemaVersion: 1;
     ts: string;
     details?: Record<string, unknown> | undefined;
@@ -31,7 +31,7 @@ export declare const StructuredEventSchema: z.ZodObject<{
 }, {
     message: string;
     id: string;
-    kind: "reward" | "error" | "system" | "log" | "fleet" | "intent";
+    kind: "reward" | "error" | "intent" | "fleet" | "system" | "log";
     schemaVersion: 1;
     ts: string;
     details?: Record<string, unknown> | undefined;

package/dist/harnesses/cost-estimates.d.ts

@@ -17,14 +17,15 @@
  * Heuristic shape per the spec:
  *   per-1k-token rate × typical task length, by model id.
  *
- * Subscription harnesses (Claude Code, Codex) are flagged via
- * `subscriptionPath: true` on the harness; in that case the surface shows
- * "Included in subscription, no per-task API cost" and **does not** trigger
- * the confirmation gate, regardless of the model selected.
+ * Subscription billing paths (`usesPaidApiKey: false` from daemon
+ * `/v1/status` `costSurface`) show "Included in subscription, no per-task
+ * API cost" and **do not** trigger the confirmation gate.
  *
  * To add a new model: append an entry to `MODEL_COST_TABLE`. The id is the
- * exact `model` string persisted to `joinedSolverNets[<cid>].model`. To
- * shape a new harness: append to `HARNESS_BILLING`. Keep the units
+ * exact `model` string persisted to `joinedSolverNets[<cid>].model`. Paid
+ * vs subscription is resolved on the daemon via `resolveCredentialId` and
+ * exposed on `GET /v1/status` as `costSurface.harnesses[<canonical>]`.
+ * Keep the units
  * consistent: token counts in tokens, rates in USD-per-1k-tokens.
  *
  * Units note: Anthropic + OpenAI publish prices per million tokens; we
@@ -69,21 +70,6 @@ export interface ModelCostEntry {
  * `claudeModels.ts` is the source of truth for which ids appear here.
  */
 export declare const MODEL_COST_TABLE: Readonly<Record<string, ModelCostEntry>>;
-/**
- * Harness-level billing classification.
- *
- * `subscriptionPath: true` means the harness shells out to a
- * subscription-billed CLI (Claude Code, Codex) and the operator does NOT
- * incur per-task API charges — the cost surface is suppressed entirely
- * and the confirmation gate is never triggered.
- *
- * `subscriptionPath: false` means the harness routes to a paid API key
- * (Hermes via OpenRouter / Anthropic API / Nous Portal). The cost surface
- * is shown and the gate fires above the configured threshold.
- */
-export declare const HARNESS_BILLING: Readonly<Record<string, {
-    subscriptionPath: boolean;
-}>>;
 /** Default per-task USD threshold above which the confirmation gate fires. */
 export declare const DEFAULT_HIGH_COST_THRESHOLD_USD = 1;
 export interface CostEstimate {
@@ -106,13 +92,6 @@ export interface CostEstimate {
  * that as "unknown, don't surface a number" rather than rendering $0.
  */
 export declare function estimateModelCost(modelId: string): CostEstimate | null;
-/**
- * `true` when the harness routes through a paid API key. Subscription
- * harnesses (Claude Code, Codex) return `false`; unknown harnesses
- * conservatively return `true` so a misnamed harness doesn't silently
- * skip the cost surface.
- */
-export declare function harnessUsesPaidApiKey(harness: string | undefined): boolean;
 export interface CostSurfaceDecision {
     /** Whether to show a numeric cost-per-task estimate at all. */
     showEstimate: boolean;
@@ -133,11 +112,11 @@ export interface CostSurfaceDecision {
  *
  * Defaults:
  *   - threshold: $1 / task (see DEFAULT_HIGH_COST_THRESHOLD_USD).
- *   - subscription harness → suppress surface + skip gate.
- *   - unknown model on a paid harness → show estimate slot (caller may
+ *   - `usesPaidApiKey: false` → suppress surface + skip gate.
+ *   - unknown model on a paid path → show estimate slot (caller may
  *     render "estimate unavailable") but DO NOT trigger the gate.
  */
-export declare function decideCostSurface(harness: string | undefined, modelId: string | undefined, thresholdUsd?: number): CostSurfaceDecision;
+export declare function decideCostSurface(usesPaidApiKey: boolean, modelId: string | undefined, thresholdUsd?: number): CostSurfaceDecision;
 /**
  * Format a USD amount for compact display in the dashboard. Picks the
  * smallest fraction count that still distinguishes the value from $0.

package/dist/harnesses/cost-estimates.js

@@ -17,14 +17,15 @@
  * Heuristic shape per the spec:
  *   per-1k-token rate × typical task length, by model id.
  *
- * Subscription harnesses (Claude Code, Codex) are flagged via
- * `subscriptionPath: true` on the harness; in that case the surface shows
- * "Included in subscription, no per-task API cost" and **does not** trigger
- * the confirmation gate, regardless of the model selected.
+ * Subscription billing paths (`usesPaidApiKey: false` from daemon
+ * `/v1/status` `costSurface`) show "Included in subscription, no per-task
+ * API cost" and **do not** trigger the confirmation gate.
  *
  * To add a new model: append an entry to `MODEL_COST_TABLE`. The id is the
- * exact `model` string persisted to `joinedSolverNets[<cid>].model`. To
- * shape a new harness: append to `HARNESS_BILLING`. Keep the units
+ * exact `model` string persisted to `joinedSolverNets[<cid>].model`. Paid
+ * vs subscription is resolved on the daemon via `resolveCredentialId` and
+ * exposed on `GET /v1/status` as `costSurface.harnesses[<canonical>]`.
+ * Keep the units
  * consistent: token counts in tokens, rates in USD-per-1k-tokens.
  *
  * Units note: Anthropic + OpenAI publish prices per million tokens; we
@@ -43,7 +44,6 @@
  * These are heuristics. Provider-API reconciliation (actual usage) is
  * deferred to the P1 follow-up tracked in #331.
  */
-import { CLAUDE_CODE_HARNESS, CODEX_HARNESS, HERMES_AGENT_HARNESS, canonicalHarnessName, } from './names.js';
 /**
  * Per-model cost entries. Keyed by the exact `model` id persisted to
  * `joinedSolverNets[<cid>].model`. The dashboard model dropdown in
@@ -187,23 +187,6 @@ export const MODEL_COST_TABLE = {
         typicalOutputTokens: 20_000,
     },
 };
-/**
- * Harness-level billing classification.
- *
- * `subscriptionPath: true` means the harness shells out to a
- * subscription-billed CLI (Claude Code, Codex) and the operator does NOT
- * incur per-task API charges — the cost surface is suppressed entirely
- * and the confirmation gate is never triggered.
- *
- * `subscriptionPath: false` means the harness routes to a paid API key
- * (Hermes via OpenRouter / Anthropic API / Nous Portal). The cost surface
- * is shown and the gate fires above the configured threshold.
- */
-export const HARNESS_BILLING = {
-    [CLAUDE_CODE_HARNESS]: { subscriptionPath: true },
-    [CODEX_HARNESS]: { subscriptionPath: true },
-    [HERMES_AGENT_HARNESS]: { subscriptionPath: false },
-};
 /** Default per-task USD threshold above which the confirmation gate fires. */
 export const DEFAULT_HIGH_COST_THRESHOLD_USD = 1;
 /**
@@ -226,33 +209,18 @@ export function estimateModelCost(modelId) {
         entry,
     };
 }
-/**
- * `true` when the harness routes through a paid API key. Subscription
- * harnesses (Claude Code, Codex) return `false`; unknown harnesses
- * conservatively return `true` so a misnamed harness doesn't silently
- * skip the cost surface.
- */
-export function harnessUsesPaidApiKey(harness) {
-    if (!harness)
-        return false;
-    const canonical = canonicalHarnessName(harness);
-    const billing = HARNESS_BILLING[canonical];
-    if (!billing)
-        return true;
-    return !billing.subscriptionPath;
-}
 /**
  * Decide what the cost surface should render for a given harness + model
  * combination, plus whether the confirmation gate fires.
  *
  * Defaults:
  *   - threshold: $1 / task (see DEFAULT_HIGH_COST_THRESHOLD_USD).
- *   - subscription harness → suppress surface + skip gate.
- *   - unknown model on a paid harness → show estimate slot (caller may
+ *   - `usesPaidApiKey: false` → suppress surface + skip gate.
+ *   - unknown model on a paid path → show estimate slot (caller may
  *     render "estimate unavailable") but DO NOT trigger the gate.
  */
-export function decideCostSurface(harness, modelId, thresholdUsd = DEFAULT_HIGH_COST_THRESHOLD_USD) {
-    if (!harnessUsesPaidApiKey(harness)) {
+export function decideCostSurface(usesPaidApiKey, modelId, thresholdUsd = DEFAULT_HIGH_COST_THRESHOLD_USD) {
+    if (!usesPaidApiKey) {
         return {
             showEstimate: false,
             estimate: null,

package/dist/harnesses/cost-estimates.js.map

@@ -1 +1 @@
-{"version":3,"file":"cost-estimates.js","sourceRoot":"","sources":["../../src/harnesses/cost-estimates.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAEH,OAAO,EACL,mBAAmB,EACnB,aAAa,EACb,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,YAAY,CAAC;AAwBpB;;;;GAIG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAA6C;IACxE,mEAAmE;IACnE,iBAAiB,EAAE;QACjB,QAAQ,EAAE,WAAW;QACrB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,mBAAmB,EAAE;QACnB,QAAQ,EAAE,WAAW;QACrB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,2BAA2B,EAAE;QAC3B,QAAQ,EAAE,WAAW;QACrB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,uEAAuE;IACvE,2BAA2B,EAAE;QAC3B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,6BAA6B,EAAE;QAC7B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IAED,sCAAsC;IACtC,SAAS,EAAE;QACT,QAAQ,EAAE,QAAQ;QAClB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,cAAc,EAAE;QACd,QAAQ,EAAE,QAAQ;QAClB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,SAAS,EAAE;QACT,QAAQ,EAAE,QAAQ;QAClB,oEAAoE;QACpE,kEAAkE;QAClE,kCAAkC;QAClC,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,eAAe,EAAE;QACf,QAAQ,EAAE,QAAQ;QAClB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,qBAAqB,EAAE;QACrB,QAAQ,EAAE,QAAQ;QAClB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IAED,sDAAsD;IACtD,uEAAuE;IACvE,oEAAoE;IACpE,iEAAiE;IACjE,qBAAqB,EAAE;QACrB,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,0BAA0B,EAAE;QAC1B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,4BAA4B,EAAE;QAC5B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,8BAA8B,EAAE;QAC9B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,sBAAsB,EAAE;QACtB,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,sBAAsB,EAAE;QACtB,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,sBAAsB,EAAE;QACtB,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,4BAA4B,EAAE;QAC5B,QAAQ,EAAE,MAAM;QAChB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;CACF,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,eAAe,GAA4D;IACtF,CAAC,mBAAmB,CAAC,EAAE,EAAE,gBAAgB,EAAE,IAAI,EAAE;IACjD,CAAC,aAAa,CAAC,EAAE,EAAE,gBAAgB,EAAE,IAAI,EAAE;IAC3C,CAAC,oBAAoB,CAAC,EAAE,EAAE,gBAAgB,EAAE,KAAK,EAAE;CACpD,CAAC;AAEF,8EAA8E;AAC9E,MAAM,CAAC,MAAM,+BAA+B,GAAG,CAAC,CAAC;AAiBjD;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAe;IAC/C,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,kBAAkB,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC;IAC5E,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,mBAAmB,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,iBAAiB,CAAC;IAC/E,OAAO;QACL,GAAG,EAAE,QAAQ,GAAG,SAAS;QACzB,QAAQ;QACR,SAAS;QACT,kBAAkB,EAAE,KAAK,CAAC,kBAAkB;QAC5C,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;QAC9C,KAAK;KACN,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAA2B;IAC/D,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,MAAM,SAAS,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;IAC3C,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAC1B,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC;AACnC,CAAC;AAiBD;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAA2B,EAC3B,OAA2B,EAC3B,eAAuB,+BAA+B;IAEtD,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC;QACpC,OAAO;YACL,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,IAAI;YACd,oBAAoB,EAAE,KAAK;YAC3B,gBAAgB,EAAE,iDAAiD;SACpE,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7D,MAAM,0BAA0B,GAC9B,QAAQ,EAAE,KAAK,CAAC,gBAAgB,KAAK,IAAI,CAAC;IAC5C,IAAI,0BAA0B,EAAE,CAAC;QAC/B,OAAO;YACL,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,IAAI;YACd,oBAAoB,EAAE,KAAK;YAC3B,gBAAgB,EAAE,iDAAiD;SACpE,CAAC;IACJ,CAAC;IACD,OAAO;QACL,YAAY,EAAE,IAAI;QAClB,QAAQ;QACR,oBAAoB,EAAE,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,GAAG,YAAY;QACtE,gBAAgB,EAAE,IAAI;KACvB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,MAAc;IACtC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,GAAG,CAAC;IACzC,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,MAAM,GAAG,IAAI;QAAE,OAAO,QAAQ,CAAC;IACnC,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/C,IAAI,MAAM,GAAG,EAAE;QAAE,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAChD,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;AACjC,CAAC"}
+{"version":3,"file":"cost-estimates.js","sourceRoot":"","sources":["../../src/harnesses/cost-estimates.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAwBH;;;;GAIG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAA6C;IACxE,mEAAmE;IACnE,iBAAiB,EAAE;QACjB,QAAQ,EAAE,WAAW;QACrB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,mBAAmB,EAAE;QACnB,QAAQ,EAAE,WAAW;QACrB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,2BAA2B,EAAE;QAC3B,QAAQ,EAAE,WAAW;QACrB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,uEAAuE;IACvE,2BAA2B,EAAE;QAC3B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,6BAA6B,EAAE;QAC7B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IAED,sCAAsC;IACtC,SAAS,EAAE;QACT,QAAQ,EAAE,QAAQ;QAClB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,cAAc,EAAE;QACd,QAAQ,EAAE,QAAQ;QAClB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,SAAS,EAAE;QACT,QAAQ,EAAE,QAAQ;QAClB,oEAAoE;QACpE,kEAAkE;QAClE,kCAAkC;QAClC,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,eAAe,EAAE;QACf,QAAQ,EAAE,QAAQ;QAClB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,qBAAqB,EAAE;QACrB,QAAQ,EAAE,QAAQ;QAClB,gBAAgB,EAAE,OAAO;QACzB,iBAAiB,EAAE,IAAI;QACvB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IAED,sDAAsD;IACtD,uEAAuE;IACvE,oEAAoE;IACpE,iEAAiE;IACjE,qBAAqB,EAAE;QACrB,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,0BAA0B,EAAE;QAC1B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,4BAA4B,EAAE;QAC5B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,8BAA8B,EAAE;QAC9B,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,sBAAsB,EAAE;QACtB,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,sBAAsB,EAAE;QACtB,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,KAAK;QACvB,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,sBAAsB,EAAE;QACtB,QAAQ,EAAE,YAAY;QACtB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;IACD,4BAA4B,EAAE;QAC5B,QAAQ,EAAE,MAAM;QAChB,gBAAgB,EAAE,MAAM;QACxB,iBAAiB,EAAE,MAAM;QACzB,kBAAkB,EAAE,MAAM;QAC1B,mBAAmB,EAAE,MAAM;KAC5B;CACF,CAAC;AAEF,8EAA8E;AAC9E,MAAM,CAAC,MAAM,+BAA+B,GAAG,CAAC,CAAC;AAiBjD;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAe;IAC/C,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,kBAAkB,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC;IAC5E,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,mBAAmB,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,iBAAiB,CAAC;IAC/E,OAAO;QACL,GAAG,EAAE,QAAQ,GAAG,SAAS;QACzB,QAAQ;QACR,SAAS;QACT,kBAAkB,EAAE,KAAK,CAAC,kBAAkB;QAC5C,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;QAC9C,KAAK;KACN,CAAC;AACJ,CAAC;AAiBD;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,cAAuB,EACvB,OAA2B,EAC3B,eAAuB,+BAA+B;IAEtD,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,OAAO;YACL,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,IAAI;YACd,oBAAoB,EAAE,KAAK;YAC3B,gBAAgB,EAAE,iDAAiD;SACpE,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7D,MAAM,0BAA0B,GAC9B,QAAQ,EAAE,KAAK,CAAC,gBAAgB,KAAK,IAAI,CAAC;IAC5C,IAAI,0BAA0B,EAAE,CAAC;QAC/B,OAAO;YACL,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,IAAI;YACd,oBAAoB,EAAE,KAAK;YAC3B,gBAAgB,EAAE,iDAAiD;SACpE,CAAC;IACJ,CAAC;IACD,OAAO;QACL,YAAY,EAAE,IAAI;QAClB,QAAQ;QACR,oBAAoB,EAAE,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,GAAG,YAAY;QACtE,gBAAgB,EAAE,IAAI;KACvB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,MAAc;IACtC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,GAAG,CAAC;IACzC,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,MAAM,GAAG,IAAI;QAAE,OAAO,QAAQ,CAAC;IACnC,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/C,IAAI,MAAM,GAAG,EAAE;QAAE,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAChD,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;AACjC,CAAC"}

package/dist/harnesses/engine/canonical-json.js

@@ -22,9 +22,11 @@
  * Used for manifest signing: produce a deterministic byte string that two
  * independent parties can reproduce from the same object graph.
  */
-import { createRequire } from 'node:module';
-const require = createRequire(import.meta.url);
-const canonicalize = require('canonicalize');
+// canonicalize v3 is ESM-only (no CJS entry); the client is `"type": "module"`
+// so a native ESM default import is the correct interop (replaces the v2-era
+// createRequire shim). v3 is packaging-only vs v2 — its RFC 8785 output is
+// byte-identical, so existing content hashes / manifest signatures are stable.
+import canonicalize from 'canonicalize';
 /**
  * Recursively replace NaN / ±Infinity with null so that canonicalize does not
  * throw — matching the JSON.stringify behaviour that the rest of the codebase

package/dist/harnesses/engine/canonical-json.js.map

@@ -1 +1 @@
-{"version":3,"file":"canonical-json.js","sourceRoot":"","sources":["../../../src/harnesses/engine/canonical-json.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC/C,MAAM,YAAY,GAAG,OAAO,CAAC,cAAc,CAA2C,CAAC;AAEvF;;;;;GAKG;AACH,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAC5D,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAChD,mEAAmE;QACnE,qEAAqE;QACrE,sEAAsE;QACtE,WAAW;QACX,MAAM,MAAM,GAAI,KAAoC,CAAC,MAAM,CAAC;QAC5D,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;YACjC,OAAO,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACxE,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAc;IAC1C,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAEvC,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACrC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,wEAAwE;QACxE,uEAAuE;QACvE,kCAAkC;QAClC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"canonical-json.js","sourceRoot":"","sources":["../../../src/harnesses/engine/canonical-json.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,+EAA+E;AAC/E,6EAA6E;AAC7E,2EAA2E;AAC3E,+EAA+E;AAC/E,OAAO,YAAY,MAAM,cAAc,CAAC;AAExC;;;;;GAKG;AACH,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IAC5D,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAChD,mEAAmE;QACnE,qEAAqE;QACrE,sEAAsE;QACtE,WAAW;QACX,MAAM,MAAM,GAAI,KAAoC,CAAC,MAAM,CAAC;QAC5D,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;YACjC,OAAO,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACxE,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAc;IAC1C,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAEvC,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACrC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,wEAAwE;QACxE,uEAAuE;QACvE,kCAAkC;QAClC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/harnesses/engine/engine.d.ts

@@ -329,9 +329,15 @@ export declare class TaskEngine {
      * Performance contract (issue #398): this runs once per task announcement,
      * on the engine-watcher hot path, for every observed task. It MUST NOT
      * perform per-task blocking I/O. In particular it does not probe
-     * `impl.isReady()` — for the Hermes harness that runs two blocking
-     * `spawnSync` child processes, so a backlog would pay per-task blocking
-     * spawns and starve the daemon event loop.
+     * `impl.isReady()` — historically the Hermes harness ran child processes
+     * inside its readiness probe, so a backlog would pay per-task blocking
+     * spawns and starve the daemon event loop. (#778 converted the matching
+     * post-execution `git diff` wedge in harvest.ts to async + 60s timeout;
+     * the #778 follow-up converted the readiness-probe spawns themselves —
+     * Hermes `doctor` / `auth list` and the codex-doctor `--version` probe —
+     * to async, so the registry's background refresh loop no longer blocks the
+     * main thread either. The readiness path remains O(1) here via the cache
+     * below.)
      *
      * Harness readiness for the claim gate is instead served O(1) from the
      * daemon's cached `HarnessReadinessRegistry` snapshot: the engine-watcher
@@ -561,9 +567,36 @@ export declare class TaskEngine {
      * when a previous run already produced the data.
      */
     private dataDrivenAdvance;
+    /**
+     * Classify a transition error and mark the task terminal accordingly.
+     *
+     * - `SafeInnerRevertError` with a non-recoverable inner name (the same
+     *   set the daemon's pre-claim catch in `emitTickErrorOrRaceLost` uses):
+     *   the on-chain slot is already pruned (TCMaxVerdictsReached,
+     *   TCAttemptAlreadyFinalized, …). We mark the row RACE_LOST and emit a
+     *   `kind=race_lost` activity event so operators can audit prunes
+     *   without inflating the FAILED counter (#896).
+     * - A transport-transient error (e.g. `AllRpcsFailedError` — every provider
+     *   in the L2 fallback chain failed at once) on a task whose delivery window
+     *   is still open: leave the row in its current in-flight state so the next
+     *   tick re-drives it once the RPCs recover, and emit a `tick_error` (warn)
+     *   event instead of inflating the FAILED counter. Without this the daemon
+     *   stamped the row FAILED, dropping it from `getInFlight()` permanently, so
+     *   L2 work went silent until a manual restart (#912). Past-window transient
+     *   errors still terminalize to avoid churning on work that can no longer
+     *   settle.
+     * - Everything else: existing markFailed behaviour. When invoked from
+     *   recovery, `contextLabel === 'recovery'` so the failure_reason
+     *   carries the `recovery:` prefix the original code path used.
+     *
+     * Returns the classification so callers can log appropriately.
+     */
+    private _classifyAndMarkTerminal;
     /**
      * Wraps a transition method call with error handling: if the transition
-     * throws, the task is marked FAILED with the error message.
+     * throws, the task is marked terminal (FAILED or RACE_LOST per
+     * `_classifyAndMarkTerminal`) and the error is rethrown so the caller can
+     * surface it.
      */
     private _runTransition;
     /**