modelrig 0.5.0 → 0.7.0

package/dist/routes/objective-loader.js

@@ -0,0 +1,286 @@
+"use strict";
+/**
+ * Route-bundle parsing for the RB-1 regret-bounded objective (near-optimal spec
+ * §3). Extracted from loader.ts (kept it under the 700-LOC cap). Each parser
+ * pushes teaching problems into the shared `problems` array — a non-empty array
+ * fails the bundle load, exactly like every other loader field. Pure functions,
+ * unit-tested directly.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parseRb1Fields = parseRb1Fields;
+exports.parseObjective = parseObjective;
+exports.parseBakeoffConfig = parseBakeoffConfig;
+exports.parseValueChecks = parseValueChecks;
+exports.missingBoundWarning = missingBoundWarning;
+/** All three RB-1 route fields parsed in one call (keeps loader.ts under the
+ * 700-LOC cap): objective, bakeoff (reference arm + judge), value_checks. Pushes
+ * any problems into the shared array; emits the missing-bound advisory. */
+function parseRb1Fields(doc, route, candidates, problems) {
+    const objective = parseObjective(doc.objective, problems);
+    const bakeoff = parseBakeoffConfig(doc.bakeoff, candidates, problems);
+    const valueChecks = parseValueChecks(doc.value_checks, problems);
+    // Only nag routes that OPT INTO RB-1 (declare objective/bakeoff) but omit a
+    // bound — a legacy route with neither block is not using regret bake-offs.
+    if (objective !== undefined || bakeoff !== undefined) {
+        const warning = missingBoundWarning(route, objective);
+        if (warning !== null)
+            console.warn(`modelrig: ${warning}`);
+    }
+    return {
+        ...(objective !== undefined ? { objective } : {}),
+        ...(bakeoff !== undefined ? { bakeoff } : {}),
+        ...(valueChecks !== undefined ? { valueChecks } : {}),
+    };
+}
+const OBJECTIVE_MODES = new Set([
+    "quality-first",
+    "balanced",
+    "cost-first",
+]);
+function isRecord(v) {
+    return typeof v === "object" && v !== null && !Array.isArray(v);
+}
+function parsePriceCeiling(raw, field, problems) {
+    if (raw === undefined || raw === null)
+        return undefined;
+    if (!isRecord(raw)) {
+        problems.push(`${field} must be an object { usd_per_1k } or { usd_per_run }`);
+        return undefined;
+    }
+    const per1k = raw.usd_per_1k;
+    const perRun = raw.usd_per_run;
+    if (per1k !== undefined && perRun !== undefined) {
+        problems.push(`${field} sets both usd_per_1k and usd_per_run — pick one unit`);
+        return undefined;
+    }
+    if (per1k === undefined && perRun === undefined) {
+        problems.push(`${field} must set usd_per_1k or usd_per_run`);
+        return undefined;
+    }
+    const value = per1k ?? perRun;
+    if (typeof value !== "number" || !Number.isFinite(value) || value <= 0) {
+        problems.push(`${field} value must be a positive number`);
+        return undefined;
+    }
+    return Object.freeze(per1k !== undefined ? { usdPer1k: value } : { usdPerRun: value });
+}
+/** Parse the `objective:` block. Absent ⇒ undefined (the engine defaults to
+ * quality-first with no bound: regret shown, nothing proposed). */
+function parseObjective(raw, problems) {
+    if (raw === undefined || raw === null)
+        return undefined;
+    if (!isRecord(raw)) {
+        problems.push("objective must be an object");
+        return undefined;
+    }
+    const mode = raw.mode ?? "quality-first";
+    if (typeof mode !== "string" || !OBJECTIVE_MODES.has(mode)) {
+        problems.push(`objective.mode "${String(mode)}" is not one of [${[...OBJECTIVE_MODES].join(", ")}]`);
+        return undefined;
+    }
+    let maxRegret;
+    if (raw.max_regret !== undefined) {
+        if (typeof raw.max_regret !== "number" || !(raw.max_regret >= 0 && raw.max_regret <= 1)) {
+            problems.push("objective.max_regret must be a number in [0, 1] (quality points)");
+        }
+        else {
+            maxRegret = raw.max_regret;
+        }
+    }
+    const priceCeiling = parsePriceCeiling(raw.price_ceiling, "objective.price_ceiling", problems);
+    let lambda;
+    if (raw.lambda !== undefined) {
+        if (typeof raw.lambda !== "number" || !Number.isFinite(raw.lambda) || raw.lambda < 0) {
+            problems.push("objective.lambda must be a non-negative number");
+        }
+        else {
+            lambda = raw.lambda;
+        }
+    }
+    if (mode !== "balanced" && lambda !== undefined) {
+        problems.push("objective.lambda only applies to mode: balanced");
+    }
+    if (mode === "balanced" && lambda === undefined) {
+        problems.push("objective.mode: balanced requires objective.lambda");
+    }
+    return Object.freeze({
+        mode: mode,
+        ...(maxRegret !== undefined ? { maxRegret } : {}),
+        ...(priceCeiling !== undefined ? { priceCeiling } : {}),
+        ...(lambda !== undefined ? { lambda } : {}),
+    });
+}
+const PROVIDERS = new Set([
+    "gemini",
+    "openai",
+    "deepseek",
+    "anthropic",
+    "grok",
+]);
+/** "provider/model" or {provider, model} → CandidateSpec (no trial flag —
+ * a reference/judge is a concrete model, never a declare-first placeholder). */
+function parseModelRef(raw, field, problems) {
+    let provider;
+    let model;
+    if (typeof raw === "string") {
+        const slash = raw.indexOf("/");
+        if (slash <= 0 || slash === raw.length - 1) {
+            problems.push(`${field} must be "provider/model" or {provider, model}`);
+            return null;
+        }
+        provider = raw.slice(0, slash);
+        model = raw.slice(slash + 1);
+    }
+    else if (isRecord(raw)) {
+        provider = raw.provider;
+        model = raw.model;
+    }
+    else {
+        problems.push(`${field} must be "provider/model" or {provider, model}`);
+        return null;
+    }
+    if (typeof provider !== "string" || !PROVIDERS.has(provider) || typeof model !== "string" || model === "") {
+        problems.push(`${field} has an unknown provider or empty model`);
+        return null;
+    }
+    return Object.freeze({ provider: provider, model });
+}
+/** Parse the `bakeoff:` block (reference arm + judge). `candidates` is the
+ * route's declared set — the candidate-set invariant is enforced here (#223 F3
+ * for the judge; the reference must be declared unless allow-external). */
+function parseBakeoffConfig(raw, candidates, problems) {
+    if (raw === undefined || raw === null)
+        return undefined;
+    if (!isRecord(raw)) {
+        problems.push("bakeoff must be an object");
+        return undefined;
+    }
+    const declared = (c) => candidates.some((rc) => rc.provider === c.provider && rc.model === c.model);
+    let referenceAllowExternal = false;
+    if (raw.reference_allow_external !== undefined) {
+        if (typeof raw.reference_allow_external !== "boolean") {
+            problems.push("bakeoff.reference_allow_external must be a boolean");
+        }
+        else {
+            referenceAllowExternal = raw.reference_allow_external;
+        }
+    }
+    let reference;
+    if (raw.reference !== undefined && raw.reference !== null) {
+        if (raw.reference === "auto") {
+            reference = "auto";
+        }
+        else {
+            const ref = parseModelRef(raw.reference, "bakeoff.reference", problems);
+            if (ref !== null) {
+                if (!declared(ref) && !referenceAllowExternal) {
+                    problems.push(`bakeoff.reference (${ref.provider}/${ref.model}) is not a declared candidate — ` +
+                        "add it to candidates, or set bakeoff.reference_allow_external: true to record the exception");
+                }
+                else {
+                    reference = { provider: ref.provider, model: ref.model };
+                }
+            }
+        }
+    }
+    let referenceEnvelopeUsd;
+    if (raw.reference_envelope_usd !== undefined) {
+        if (typeof raw.reference_envelope_usd !== "number" ||
+            !Number.isFinite(raw.reference_envelope_usd) ||
+            raw.reference_envelope_usd <= 0) {
+            problems.push("bakeoff.reference_envelope_usd must be a positive number");
+        }
+        else {
+            referenceEnvelopeUsd = raw.reference_envelope_usd;
+        }
+    }
+    let judge;
+    if (raw.judge !== undefined && raw.judge !== null) {
+        if (!isRecord(raw.judge)) {
+            problems.push("bakeoff.judge must be an object { model, max_samples }");
+        }
+        else {
+            const model = parseModelRef(raw.judge.model, "bakeoff.judge.model", problems);
+            const maxSamples = raw.judge.max_samples;
+            if (typeof maxSamples !== "number" || !Number.isInteger(maxSamples) || maxSamples < 1) {
+                problems.push("bakeoff.judge.max_samples must be a positive integer");
+            }
+            if (model !== null && !declared(model)) {
+                // #223 F3: the judge model must be a declared candidate.
+                problems.push(`bakeoff.judge.model (${model.provider}/${model.model}) is not a declared candidate ` +
+                    "(a judge model must be one of the route's declared candidates, #223 F3)");
+            }
+            else if (model !== null && typeof maxSamples === "number" && Number.isInteger(maxSamples) && maxSamples >= 1) {
+                judge = { model, maxSamples };
+            }
+        }
+    }
+    const out = {
+        ...(reference !== undefined ? { reference } : {}),
+        ...(referenceAllowExternal ? { referenceAllowExternal: true } : {}),
+        ...(referenceEnvelopeUsd !== undefined ? { referenceEnvelopeUsd } : {}),
+        ...(judge !== undefined ? { judge } : {}),
+    };
+    return Object.freeze(out);
+}
+/** Parse `value_checks:` — a list of {path, expect}. `path` is a JSON pointer;
+ * `expect` is a literal or {regex}. */
+function parseValueChecks(raw, problems) {
+    if (raw === undefined || raw === null)
+        return undefined;
+    if (!Array.isArray(raw)) {
+        problems.push("value_checks must be a list");
+        return undefined;
+    }
+    const out = [];
+    for (const [i, c] of raw.entries()) {
+        const field = `value_checks[${i}]`;
+        if (!isRecord(c)) {
+            problems.push(`${field} must be an object { path, expect }`);
+            continue;
+        }
+        if (typeof c.path !== "string" || c.path === "" || !c.path.startsWith("/")) {
+            problems.push(`${field}.path must be a non-empty JSON pointer starting with "/"`);
+            continue;
+        }
+        if (c.expect === undefined) {
+            problems.push(`${field}.expect is required (a literal value or { regex })`);
+            continue;
+        }
+        let expect;
+        if (isRecord(c.expect) && typeof c.expect.regex === "string") {
+            try {
+                // eslint-disable-next-line no-new
+                new RegExp(c.expect.regex);
+            }
+            catch (err) {
+                problems.push(`${field}.expect.regex is not a valid regular expression: ${err.message}`);
+                continue;
+            }
+            expect = { regex: c.expect.regex };
+        }
+        else {
+            expect = { literal: c.expect };
+        }
+        out.push(Object.freeze({ path: c.path, expect: Object.freeze(expect) }));
+    }
+    return Object.freeze(out);
+}
+/**
+ * Non-fatal advisory (CE-2 teaching-hint style): a route declares an objective
+ * with NEITHER a regret bound NOR a price ceiling, so a bake-off will REPORT
+ * regret but never propose anything. Warn so the missing bound is deliberate.
+ * Returns the warning line, or null. Only meaningful for quality-first/balanced
+ * (cost-first has its own gate and needs no bound).
+ */
+function missingBoundWarning(route, objective) {
+    const mode = objective?.mode ?? "quality-first";
+    if (mode === "cost-first")
+        return null;
+    const hasBound = objective?.maxRegret !== undefined || objective?.priceCeiling !== undefined;
+    if (hasBound)
+        return null;
+    return (`route "${route}" has no objective bound (neither max_regret nor price_ceiling): a bake-off ` +
+        "will REPORT regret vs the reference but propose nothing. Declare objective.max_regret and/or " +
+        "objective.price_ceiling to let a challenger be proposed under your ceiling.");
+}

package/dist/run/accept.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Accept-path builders, extracted from run.ts (which sits at the 700-LOC cap so
+ * the Q1 quality-gate seam has to pull its shared shapes out). Two pure builders:
+ *
+ *  - `successAttemptRow` — the AttemptTelemetry token/cost fields for a
+ *    SUCCESSFUL adapter result, shared by the accept path and the Q1
+ *    quality-REJECT path (which records the same billed row with a
+ *    `quality_rejected` failure instead of `null`).
+ *  - `buildSuccessMeta` — the validated `RunMeta` returned on the accept path.
+ *
+ * Behavior is byte-identical to the former inline literals; nothing new is
+ * computed here.
+ */
+import type { CandidateRef } from "../types/provider";
+import type { AdapterUsage } from "../types/provider";
+import type { FailureClass, RigFailure } from "../types/failures";
+import type { RouteBundle, RunMeta } from "../types/route";
+import type { AttemptTelemetry } from "./dispatch";
+import type { AttemptMetaSource } from "../telemetry/attempt-meta";
+/** The AttemptTelemetry for a successful adapter result. `failure` is null on the
+ * accept path and the `quality_rejected` failure on the Q1 reject path;
+ * `metaInputs` is the WI-1 attempt-meta envelope; `extraTags` carries the Q1
+ * quality tags (`quality` / `quality_score`). */
+export declare function successAttemptRow(candidate: CandidateRef, usage: AdapterUsage, costUsd: number, latencyMs: number, pricingMissing: boolean, failure: RigFailure | null, metaInputs: AttemptMetaSource, extraTags?: Record<string, string>): AttemptTelemetry;
+export interface SuccessMetaInput {
+    readonly inferenceId: string;
+    readonly route: RouteBundle;
+    readonly candidate: CandidateRef;
+    readonly usage: AdapterUsage;
+    readonly costUsd: number;
+    readonly latencyMs: number;
+    readonly attemptsByClass: Partial<Record<FailureClass, number>>;
+    readonly servedVariant: string | null;
+    readonly callId: string;
+    /** Grounding-inject citations, when the search rung served this run. */
+    readonly citations?: RunMeta["citations"];
+    /** Q1 quality verdict, when a gate ran on this run. */
+    readonly quality?: RunMeta["quality"];
+}
+/** The validated `RunMeta` for the accept path — `repairedBy` is null here (the
+ * repair path builds its own meta), `validated` is always true. */
+export declare function buildSuccessMeta(input: SuccessMetaInput): RunMeta;
+//# sourceMappingURL=accept.d.ts.map

package/dist/run/accept.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"accept.d.ts","sourceRoot":"","sources":["../../src/run/accept.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAClE,OAAO,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAC3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AACnD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAEnE;;;iDAGiD;AACjD,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,YAAY,EACvB,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,cAAc,EAAE,OAAO,EACvB,OAAO,EAAE,UAAU,GAAG,IAAI,EAC1B,UAAU,EAAE,iBAAiB,EAC7B,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GACjC,gBAAgB,CAiBlB;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;IAC7B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,wEAAwE;IACxE,QAAQ,CAAC,SAAS,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC;IAC1C,uDAAuD;IACvD,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;CACvC;AAED;mEACmE;AACnE,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAuBjE"}

package/dist/run/accept.js

@@ -0,0 +1,65 @@
+"use strict";
+/**
+ * Accept-path builders, extracted from run.ts (which sits at the 700-LOC cap so
+ * the Q1 quality-gate seam has to pull its shared shapes out). Two pure builders:
+ *
+ *  - `successAttemptRow` — the AttemptTelemetry token/cost fields for a
+ *    SUCCESSFUL adapter result, shared by the accept path and the Q1
+ *    quality-REJECT path (which records the same billed row with a
+ *    `quality_rejected` failure instead of `null`).
+ *  - `buildSuccessMeta` — the validated `RunMeta` returned on the accept path.
+ *
+ * Behavior is byte-identical to the former inline literals; nothing new is
+ * computed here.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.successAttemptRow = successAttemptRow;
+exports.buildSuccessMeta = buildSuccessMeta;
+/** The AttemptTelemetry for a successful adapter result. `failure` is null on the
+ * accept path and the `quality_rejected` failure on the Q1 reject path;
+ * `metaInputs` is the WI-1 attempt-meta envelope; `extraTags` carries the Q1
+ * quality tags (`quality` / `quality_score`). */
+function successAttemptRow(candidate, usage, costUsd, latencyMs, pricingMissing, failure, metaInputs, extraTags) {
+    return {
+        candidate,
+        servedTier: usage.servedTier,
+        tokensIn: usage.tokensIn,
+        tokensOut: usage.tokensOut,
+        tokensCached: usage.tokensCached,
+        tokensCacheWrite: usage.tokensCacheWrite ?? 0,
+        tokensCacheWrite1h: usage.tokensCacheWrite1h ?? 0,
+        costUsd,
+        latencyMs,
+        ...(usage.ttfbMs !== undefined ? { ttfbMs: usage.ttfbMs } : {}),
+        failure,
+        pricingMissing,
+        metaInputs,
+        ...(extraTags !== undefined ? { extraTags } : {}),
+    };
+}
+/** The validated `RunMeta` for the accept path — `repairedBy` is null here (the
+ * repair path builds its own meta), `validated` is always true. */
+function buildSuccessMeta(input) {
+    const { route, candidate, usage } = input;
+    return {
+        inferenceId: input.inferenceId,
+        route: route.route,
+        routeVersion: route.version,
+        provider: candidate.provider,
+        model: candidate.model,
+        requestedTier: route.policy.tier,
+        servedTier: usage.servedTier,
+        tokensIn: usage.tokensIn,
+        tokensOut: usage.tokensOut,
+        tokensCached: usage.tokensCached,
+        costEstimateUsd: input.costUsd,
+        latencyMs: input.latencyMs,
+        validated: true,
+        attemptsByClass: input.attemptsByClass,
+        servedVariant: input.servedVariant,
+        repairedBy: null,
+        callId: input.callId,
+        ...(input.citations !== undefined ? { citations: input.citations } : {}),
+        ...(input.quality !== undefined ? { quality: input.quality } : {}),
+    };
+}

package/dist/run/cost.d.ts

@@ -20,6 +20,19 @@ export interface AttemptCost {
     readonly pricingMissing: boolean;
 }
 export declare function attemptCost(provider: ProviderId, model: string, usage: AdapterUsage, unpricedRatePerTok: number): AttemptCost;
+/** USD cost broken into its components for the attempt envelope
+ * (`AttemptMeta.cost`, WI-1 spec §2). Returns null when the model has no
+ * pricing entry (absent = unknown, never an invented $0 — mirrors
+ * `attemptCost`'s `pricingMissing`). Every component uses the SAME per-token
+ * rates as {@link estimateCostUsd}, so the sum equals the recorded
+ * `cost_estimate_usd` for a priced model. `other` is reserved (0 today). */
+export declare function costComponents(provider: ProviderId, model: string, usage: Pick<AdapterUsage, "tokensIn" | "tokensOut" | "tokensCached" | "tokensCacheWrite" | "tokensCacheWrite1h">): {
+    in: number;
+    out: number;
+    cache_read: number;
+    cache_write: number;
+    other: number;
+} | null;
 /** Pre-dispatch upper-bound estimate for the envelope precheck: prompt
  * length + the full output bound, at real pricing or the conservative rate. */
 export declare function dispatchEstimateUsd(provider: ProviderId, model: string, promptChars: number, unpricedRatePerTok: number): number;

package/dist/run/cost.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cost.d.ts","sourceRoot":"","sources":["../../src/run/cost.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAElE,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAC1C,eAAO,MAAM,0BAA0B,QAAS,CAAC;AAEjD;;yEAEyE;AACzE,eAAO,MAAM,kCAAkC,MAAM,CAAC;AAEtD,MAAM,WAAW,WAAW;IAC1B,kEAAkE;IAClE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,uEAAuE;IACvE,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;CAClC;AAED,wBAAgB,WAAW,CACzB,QAAQ,EAAE,UAAU,EACpB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,YAAY,EACnB,kBAAkB,EAAE,MAAM,GACzB,WAAW,CAkBb;AAED;+EAC+E;AAC/E,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,UAAU,EACpB,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,kBAAkB,EAAE,MAAM,GACzB,MAAM,CAOR"}
+{"version":3,"file":"cost.d.ts","sourceRoot":"","sources":["../../src/run/cost.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAElE,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAC1C,eAAO,MAAM,0BAA0B,QAAS,CAAC;AAEjD;;yEAEyE;AACzE,eAAO,MAAM,kCAAkC,MAAM,CAAC;AAEtD,MAAM,WAAW,WAAW;IAC1B,kEAAkE;IAClE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,uEAAuE;IACvE,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;CAClC;AAED,wBAAgB,WAAW,CACzB,QAAQ,EAAE,UAAU,EACpB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,YAAY,EACnB,kBAAkB,EAAE,MAAM,GACzB,WAAW,CAkBb;AAED;;;;;4EAK4E;AAC5E,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,UAAU,EACpB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,IAAI,CACT,YAAY,EACZ,UAAU,GAAG,WAAW,GAAG,cAAc,GAAG,kBAAkB,GAAG,oBAAoB,CACtF,GACA;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAkB5F;AAED;+EAC+E;AAC/E,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,UAAU,EACpB,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,kBAAkB,EAAE,MAAM,GACzB,MAAM,CAOR"}

package/dist/run/cost.js

@@ -9,6 +9,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.DEFAULT_UNPRICED_RATE_USD_PER_MTOK = exports.ESTIMATE_MAX_OUTPUT_TOKENS = exports.ESTIMATE_CHARS_PER_TOKEN = void 0;
 exports.attemptCost = attemptCost;
+exports.costComponents = costComponents;
 exports.dispatchEstimateUsd = dispatchEstimateUsd;
 const pricing_1 = require("../registry/pricing");
 exports.ESTIMATE_CHARS_PER_TOKEN = 4;
@@ -29,6 +30,32 @@ function attemptCost(provider, model, usage, unpricedRatePerTok) {
     const costUsd = (0, pricing_1.estimateCostUsd)(pricing, usage.tokensIn, usage.tokensOut, usage.tokensCached, usage.tokensCacheWrite ?? 0, usage.tokensCacheWrite1h ?? 0);
     return { costUsd, envelopeChargeUsd: costUsd, pricingMissing: false };
 }
+/** USD cost broken into its components for the attempt envelope
+ * (`AttemptMeta.cost`, WI-1 spec §2). Returns null when the model has no
+ * pricing entry (absent = unknown, never an invented $0 — mirrors
+ * `attemptCost`'s `pricingMissing`). Every component uses the SAME per-token
+ * rates as {@link estimateCostUsd}, so the sum equals the recorded
+ * `cost_estimate_usd` for a priced model. `other` is reserved (0 today). */
+function costComponents(provider, model, usage) {
+    const pricing = (0, pricing_1.getPricing)(provider, model);
+    if (pricing === null)
+        return null;
+    const tokensIn = Math.max(usage.tokensIn, 0);
+    const cached = Math.min(Math.max(usage.tokensCached, 0), tokensIn);
+    const write = Math.max(usage.tokensCacheWrite ?? 0, 0);
+    const write1h = Math.min(Math.max(usage.tokensCacheWrite1h ?? 0, 0), write);
+    const uncachedIn = Math.max(tokensIn - cached - write, 0);
+    const cachedRate = pricing.cachedInputUsdPerTok ?? pricing.inputUsdPerTok;
+    const writeRate = pricing.cacheWriteUsdPerTok ?? pricing.inputUsdPerTok;
+    const write1hRate = pricing.cacheWrite1hUsdPerTok ?? writeRate;
+    return {
+        in: uncachedIn * pricing.inputUsdPerTok,
+        out: Math.max(usage.tokensOut, 0) * pricing.outputUsdPerTok,
+        cache_read: cached * cachedRate,
+        cache_write: (write - write1h) * writeRate + write1h * write1hRate,
+        other: 0,
+    };
+}
 /** Pre-dispatch upper-bound estimate for the envelope precheck: prompt
  * length + the full output bound, at real pricing or the conservative rate. */
 function dispatchEstimateUsd(provider, model, promptChars, unpricedRatePerTok) {

package/dist/run/dispatch.d.ts

@@ -8,10 +8,11 @@
  * Tool *execution* is never ours (spec §4.4); these helpers normalize the
  * protocol and surface it — nothing here runs a tool.
  */
-import type { AdapterRequest, AdapterResult, CandidateRef, ProviderAdapter } from "../types/provider";
+import type { AdapterRequest, AdapterResult, CandidateRef, ProviderAdapter, ToolDefinition } from "../types/provider";
 import type { RigFailure } from "../types/failures";
 import type { RouteBundle, RunMeta, RunOptions, RunResult, RunTags } from "../types/route";
 import type { TelemetryRung, TelemetryStore } from "../types/telemetry";
+import type { AttemptMetaSource } from "../telemetry/attempt-meta";
 import type { LadderKeyMinter } from "./ladder-key";
 /** One telemetry attempt row's inputs — shared with run.ts's recordAttempt so
  * the tool-call helper here can record through the same closure. */
@@ -39,7 +40,27 @@ export interface AttemptTelemetry {
      * (`tool_call`); every other rung is derived in the recorder from the
      * repaired_by / pre-dispatch / primary-vs-retry signals. */
     readonly rung?: TelemetryRung;
+    /** WI-1 (spec §2): the adapter's native meta + rendered request / output /
+     * declared tool names. The recorder (record-attempt.ts) hands it to
+     * `summarizeAttemptMeta` with this row's provider/model/usage. Absent ⇒ the
+     * recorder builds a minimal envelope from usage + cost alone (never null-only). */
+    readonly metaInputs?: AttemptMetaSource;
+    /** SDK-owned extra telemetry tags merged onto the row (Q1 quality gate stamps
+     * `quality` / `quality_score` here). Never carries `rung` — the recorder
+     * stamps that last so a caller cannot override it. */
+    readonly extraTags?: Record<string, string>;
 }
+/** Assemble the recorder's `metaInputs` from a completed dispatch (WI-1) — the
+ * adapter's native meta plus the rendered request (system+user+schema, hashed)
+ * and the output text (hashed). One helper so the routed lane's several record
+ * sites stay one-liners and run.ts holds under the LOC cap. */
+export declare function attemptMetaInputs(args: {
+    readonly systemPrompt: string;
+    readonly userDirective: string;
+    readonly outputSchema: object | null;
+    readonly result: AdapterResult;
+    readonly tools?: readonly ToolDefinition[];
+}): AttemptMetaSource;
 /** run.ts's recordAttempt, threaded in so the tool-call path records through
  * the same ledger/tenancy closure the rest of the loop uses. */
 export type RecordAttempt = (attempt: AttemptTelemetry) => string;
@@ -98,6 +119,8 @@ export interface ToolCallResultParts {
     /** The call's ladder-key id (spec §2.1 R0) — surfaced on the tool-call meta so
      * it matches the recorded row's `call_id`. */
     readonly callId: string;
+    /** WI-1: the attempt-envelope inputs for the recorded row (spec §2). */
+    readonly metaInputs?: AttemptMetaSource;
 }
 /**
  * Record a tool-call turn and build its RunResult (spec §4.4). A tool call is

package/dist/run/dispatch.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dispatch.d.ts","sourceRoot":"","sources":["../../src/run/dispatch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,aAAa,EACb,YAAY,EACZ,eAAe,EAChB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAC3F,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAGxE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAEpD;oEACoE;AACpE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B;6DACyD;IACzD,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;IACrC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0BACsB;IACtB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,UAAU,GAAG,IAAI,CAAC;IACpC,6EAA6E;IAC7E,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,2EAA2E;IAC3E,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAClC;;gEAE4D;IAC5D,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC;CAC/B;AAED;gEACgE;AAChE,MAAM,MAAM,aAAa,GAAG,CAAC,OAAO,EAAE,gBAAgB,KAAK,MAAM,CAAC;AAElE;;4EAE4E;AAC5E,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,cAAc,EACzB,KAAK,EAAE,WAAW,EAClB,aAAa,EAAE,OAAO,EACtB,aAAa,EAAE,MAAM,GAAG,IAAI,EAC5B,gBAAgB,EAAE,MAAM,EACxB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,eAAe,GACtB,IAAI,CAoCN;AAED;;8EAE8E;AAC9E,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAYvD;AAED;;0CAE0C;AAC1C,MAAM,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,KAAK,IAAI,CAAC;AAEzE,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,+EAA+E;IAC/E,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B;;oEAEgE;IAChE,QAAQ,CAAC,qBAAqB,CAAC,EAAE,OAAO,CAAC;CAC1C;AAED;uDACuD;AACvD,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,mBAAmB,GAAG,cAAc,CAgC9E;AAED;4CAC4C;AAC5C,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,WAAW,EAClB,SAAS,EAAE,YAAY,EACvB,YAAY,EAAE,MAAM,EACpB,eAAe,EAAE,MAAM,GACtB,cAAc,CAmBhB;AAED;;;;;;GAMG;AACH,wBAAsB,iBAAiB,CACrC,OAAO,EAAE,eAAe,EACxB,GAAG,EAAE,cAAc,EACnB,OAAO,CAAC,EAAE,eAAe,GACxB,OAAO,CAAC,aAAa,CAAC,CAuBxB;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,aAAa,EAAE;QAAE,EAAE,EAAE,IAAI,CAAA;KAAE,CAAC,CAAC;IACtD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,iBAAiB,CAAC,CAAC;IACrD,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC;kDAC8C;IAC9C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,mBAAmB,GAAG,SAAS,CAgD/F"}
+{"version":3,"file":"dispatch.d.ts","sourceRoot":"","sources":["../../src/run/dispatch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,aAAa,EACb,YAAY,EACZ,eAAe,EACf,cAAc,EACf,MAAM,mBAAmB,CAAC;AAE3B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAC;AAC3F,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACxE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAInE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAEpD;oEACoE;AACpE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B;6DACyD;IACzD,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,kBAAkB,CAAC,EAAE,MAAM,CAAC;IACrC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;0BACsB;IACtB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,UAAU,GAAG,IAAI,CAAC;IACpC,6EAA6E;IAC7E,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,2EAA2E;IAC3E,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAClC;;gEAE4D;IAC5D,QAAQ,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC;IAC9B;;;uFAGmF;IACnF,QAAQ,CAAC,UAAU,CAAC,EAAE,iBAAiB,CAAC;IACxC;;0DAEsD;IACtD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC7C;AAED;;;+DAG+D;AAC/D,wBAAgB,iBAAiB,CAAC,IAAI,EAAE;IACtC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;IAC/B,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;CAC5C,GAAG,iBAAiB,CAWpB;AAED;gEACgE;AAChE,MAAM,MAAM,aAAa,GAAG,CAAC,OAAO,EAAE,gBAAgB,KAAK,MAAM,CAAC;AAElE;;4EAE4E;AAC5E,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,cAAc,EACzB,KAAK,EAAE,WAAW,EAClB,aAAa,EAAE,OAAO,EACtB,aAAa,EAAE,MAAM,GAAG,IAAI,EAC5B,gBAAgB,EAAE,MAAM,EACxB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,eAAe,GACtB,IAAI,CAoCN;AAED;;8EAE8E;AAC9E,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAYvD;AAED;;0CAE0C;AAC1C,MAAM,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,KAAK,IAAI,CAAC;AAEzE,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,+EAA+E;IAC/E,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B;;oEAEgE;IAChE,QAAQ,CAAC,qBAAqB,CAAC,EAAE,OAAO,CAAC;CAC1C;AAED;uDACuD;AACvD,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,mBAAmB,GAAG,cAAc,CAgC9E;AAED;4CAC4C;AAC5C,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,WAAW,EAClB,SAAS,EAAE,YAAY,EACvB,YAAY,EAAE,MAAM,EACpB,eAAe,EAAE,MAAM,GACtB,cAAc,CAmBhB;AAED;;;;;;GAMG;AACH,wBAAsB,iBAAiB,CACrC,OAAO,EAAE,eAAe,EACxB,GAAG,EAAE,cAAc,EACnB,OAAO,CAAC,EAAE,eAAe,GACxB,OAAO,CAAC,aAAa,CAAC,CAuBxB;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,YAAY,CAAC;IACjC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,aAAa,EAAE;QAAE,EAAE,EAAE,IAAI,CAAA;KAAE,CAAC,CAAC;IACtD,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,iBAAiB,CAAC,CAAC;IACrD,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC;kDAC8C;IAC9C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,wEAAwE;IACxE,QAAQ,CAAC,UAAU,CAAC,EAAE,iBAAiB,CAAC;CACzC;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,mBAAmB,GAAG,SAAS,CAiD/F"}

package/dist/run/dispatch.js

@@ -10,6 +10,7 @@
  * protocol and surface it — nothing here runs a tool.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.attemptMetaInputs = attemptMetaInputs;
 exports.recordSearchCostRow = recordSearchCostRow;
 exports.jsonModeCoaching = jsonModeCoaching;
 exports.buildAdapterRequest = buildAdapterRequest;
@@ -17,8 +18,25 @@ exports.buildRepairAdapterRequest = buildRepairAdapterRequest;
 exports.dispatchCandidate = dispatchCandidate;
 exports.emitToolCallResult = emitToolCallResult;
 const node_crypto_1 = require("node:crypto");
+const attempt_meta_1 = require("../telemetry/attempt-meta");
 const cache_stamp_1 = require("./cache-stamp");
 const cache_handle_1 = require("./cache-handle");
+/** Assemble the recorder's `metaInputs` from a completed dispatch (WI-1) — the
+ * adapter's native meta plus the rendered request (system+user+schema, hashed)
+ * and the output text (hashed). One helper so the routed lane's several record
+ * sites stay one-liners and run.ts holds under the LOC cap. */
+function attemptMetaInputs(args) {
+    return {
+        ...(args.result.meta !== undefined ? { adapterMeta: args.result.meta } : {}),
+        renderedRequest: (0, attempt_meta_1.renderRequestForHash)({
+            system: args.systemPrompt,
+            user: args.userDirective,
+            schema: args.outputSchema,
+        }),
+        outputText: args.result.ok ? args.result.text : null,
+        ...(args.tools !== undefined ? { declaredToolNames: args.tools.map((t) => t.function.name) } : {}),
+    };
+}
 /** Record the grounding-inject search's own telemetry row (WS3): a $-only line
  * under the synthetic "search" provider. Extracted from run.ts to keep it under
  * the LOC cap; behaviour is byte-identical to the prior inline recorder. */
@@ -193,6 +211,7 @@ function emitToolCallResult(record, parts) {
         // is stamped explicitly. The rollup counts it as a tool-call turn, never a
         // dispatch or a serve (its cost still counts).
         rung: "tool_call",
+        ...(parts.metaInputs !== undefined ? { metaInputs: parts.metaInputs } : {}),
     });
     return {
         output: null,

package/dist/run/ladder-key.d.ts

@@ -31,6 +31,10 @@ export interface LadderKeyMinter {
     /** Stamp the next row: bump `attempt_seq` (1-based, monotonic) and read the
      * current `candidate_index`. */
     stamp(): LadderKey;
+    /** The `attempt_seq` the NEXT `stamp()` will assign — read WITHOUT consuming
+     * it, so the quality gate (Q1) can name the seq its judged candidate's row
+     * will carry before that row is recorded. */
+    peekNextSeq(): number;
 }
 /**
  * Build a ladder-key minter. `callId` defaults to a fresh uuid; the raw lane and

package/dist/run/ladder-key.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ladder-key.d.ts","sourceRoot":"","sources":["../../src/run/ladder-key.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,gFAAgF;AAChF,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;CACxC;AAED,4EAA4E;AAC5E,MAAM,WAAW,eAAe;IAC9B,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;6EACyE;IACzE,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC;IAC9C;oCACgC;IAChC,KAAK,IAAI,SAAS,CAAC;CACpB;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,GAAE,MAAqB,GAAG,eAAe,CAapF"}
+{"version":3,"file":"ladder-key.d.ts","sourceRoot":"","sources":["../../src/run/ladder-key.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,gFAAgF;AAChF,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;CACxC;AAED,4EAA4E;AAC5E,MAAM,WAAW,eAAe;IAC9B,4DAA4D;IAC5D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;6EACyE;IACzE,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC;IAC9C;oCACgC;IAChC,KAAK,IAAI,SAAS,CAAC;IACnB;;iDAE6C;IAC7C,WAAW,IAAI,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,GAAE,MAAqB,GAAG,eAAe,CAgBpF"}

package/dist/run/ladder-key.js

@@ -35,5 +35,8 @@ function createLadderKeyMinter(callId = (0, node_crypto_1.randomUUID)()) {
             attemptSeq += 1;
             return { callId, attemptSeq, candidateIndex };
         },
+        peekNextSeq() {
+            return attemptSeq + 1;
+        },
     };
 }

package/dist/run/quality-gate.d.ts

@@ -0,0 +1,39 @@
+/**
+ * The quality-gate seam (Q1, quality-gate spec §4.1). Extracted from run.ts —
+ * which sits at the 700-LOC cap — so the run loop gets ONE compact call site
+ * between `outcome.valid` and the accept branch.
+ *
+ * The gate evaluates a builder predicate on a schema-VALID output. It handles the
+ * awkward bits so the loop does not: awaiting an async verdict, normalizing an
+ * optional score/reason, and rejecting fail-closed when the predicate THROWS
+ * (spec §4.1 step 4, flag F2 — reject + warn ONCE per process). The loop keeps
+ * the control flow: a passing verdict takes the existing accept path (tagged),
+ * a failing one records `quality_rejected` and falls through on its own budget,
+ * never touching the repair rung.
+ */
+import type { QualityGate, QualityGateMeta } from "../types/quality";
+/** The gate's answer, normalized for the run loop. `score`/`reason` are null
+ * rather than undefined so the row/meta stamping is total. */
+export interface QualityGateOutcome {
+    /** True = accept (verdict.ok, or the predicate threw? no — a throw is a reject). */
+    readonly pass: boolean;
+    readonly score: number | null;
+    readonly reason: string | null;
+}
+/** Test-only: reset the once-per-process throw-warning latch so a test can
+ * assert the single-warning behavior deterministically. */
+export declare function resetQualityGateWarningForTest(): void;
+/**
+ * Evaluate a quality gate on a schema-valid output. Awaits an async verdict; a
+ * throwing predicate rejects fail-closed with a `qualityGate threw: …` reason
+ * and warns exactly once per process.
+ */
+export declare function evaluateQualityGate(gate: QualityGate, output: unknown, meta: QualityGateMeta): Promise<QualityGateOutcome>;
+/** SDK-owned telemetry tags for the attempt row (spec §2): `quality` = pass|fail
+ * and, when a score exists, `quality_score` as a decimal string. Never carries
+ * `rung` — the recorder owns that and stamps it last. */
+export declare function qualityTags(outcome: QualityGateOutcome): Record<string, string>;
+/** The `quality_rejected` failure message — carries the reason and score so a
+ * stuck engineer (and the exhausted-ladder error) sees WHY it was rejected. */
+export declare function qualityRejectedMessage(outcome: QualityGateOutcome): string;
+//# sourceMappingURL=quality-gate.d.ts.map

package/dist/run/quality-gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality-gate.d.ts","sourceRoot":"","sources":["../../src/run/quality-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAErE;8DAC8D;AAC9D,MAAM,WAAW,kBAAkB;IACjC,oFAAoF;IACpF,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAMD;2DAC2D;AAC3D,wBAAgB,8BAA8B,IAAI,IAAI,CAErD;AAMD;;;;GAIG;AACH,wBAAsB,mBAAmB,CACvC,IAAI,EAAE,WAAW,EACjB,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,eAAe,GACpB,OAAO,CAAC,kBAAkB,CAAC,CAe7B;AAOD;;yDAEyD;AACzD,wBAAgB,WAAW,CAAC,OAAO,EAAE,kBAAkB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAI/E;AAED;+EAC+E;AAC/E,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,kBAAkB,GAAG,MAAM,CAI1E"}