modelrig 0.5.0 → 0.7.0

package/dist/bakeoff/quality.js

@@ -0,0 +1,126 @@
+"use strict";
+/**
+ * Per-sample value-accuracy resolution for a bake-off (RB-1, near-optimal spec
+ * §4.3). DETERMINISTIC tiers only — the judge tier lives in judge.ts because it
+ * dispatches a metered inference. Precedence:
+ *
+ *   1. eval-case expected value (a corrected/golden artifact) ⇒ exact/normalized
+ *      match for a primitive, or schema-aware field accuracy in [0,1] for an
+ *      object/array.
+ *   2. declared `value_checks` (JSON-pointer assertions) ⇒ fraction passing.
+ *   3. null (the caller falls back to the judge, then to conformance).
+ *
+ * Pure; unit-tested directly. F5 (deterministic before judge) is exactly this
+ * ordering.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fieldAccuracy = fieldAccuracy;
+exports.resolveJsonPointer = resolveJsonPointer;
+exports.checkPasses = checkPasses;
+exports.resolveDeterministicQuality = resolveDeterministicQuality;
+/** Normalize a scalar for comparison: trim strings; leave numbers/booleans as-is.
+ * "normalized match" (spec §4.3) means insensitivity to surrounding whitespace,
+ * never a fuzzy match — a wrong value is still wrong. */
+function normalizeScalar(v) {
+    return typeof v === "string" ? v.trim() : v;
+}
+function scalarEqual(a, b) {
+    return normalizeScalar(a) === normalizeScalar(b);
+}
+function isObject(v) {
+    return typeof v === "object" && v !== null && !Array.isArray(v);
+}
+/**
+ * Schema-aware field accuracy in [0,1]: the fraction of the EXPECTED value's leaf
+ * fields that the actual output matches. Recurses into objects/arrays keyed by
+ * the expected shape (extra keys in `actual` are ignored — the golden defines
+ * what "correct" covers). A scalar expected ⇒ 1 or 0. An empty object/array
+ * expected ⇒ 1 (nothing to be wrong about).
+ */
+function fieldAccuracy(expected, actual) {
+    if (isObject(expected)) {
+        const keys = Object.keys(expected);
+        if (keys.length === 0)
+            return 1;
+        let sum = 0;
+        for (const k of keys)
+            sum += fieldAccuracy(expected[k], isObject(actual) ? actual[k] : undefined);
+        return sum / keys.length;
+    }
+    if (Array.isArray(expected)) {
+        if (expected.length === 0)
+            return 1;
+        const act = Array.isArray(actual) ? actual : [];
+        let sum = 0;
+        for (let i = 0; i < expected.length; i += 1)
+            sum += fieldAccuracy(expected[i], act[i]);
+        return sum / expected.length;
+    }
+    return scalarEqual(expected, actual) ? 1 : 0;
+}
+/** Resolve an RFC 6901 JSON pointer against a value. Returns `undefined` when any
+ * segment is missing (a missing field fails its value check). */
+function resolveJsonPointer(value, pointer) {
+    if (pointer === "")
+        return value;
+    const segments = pointer
+        .split("/")
+        .slice(1)
+        .map((s) => s.replace(/~1/g, "/").replace(/~0/g, "~"));
+    let cur = value;
+    for (const seg of segments) {
+        if (isObject(cur)) {
+            cur = cur[seg];
+        }
+        else if (Array.isArray(cur)) {
+            const idx = Number(seg);
+            cur = Number.isInteger(idx) && idx >= 0 ? cur[idx] : undefined;
+        }
+        else {
+            return undefined;
+        }
+        if (cur === undefined)
+            return undefined;
+    }
+    return cur;
+}
+/** True when `output` satisfies one value check (RFC 6901 pointer + literal|regex). */
+function checkPasses(output, check) {
+    const actual = resolveJsonPointer(output, check.path);
+    if (actual === undefined)
+        return false;
+    if ("regex" in check.expect) {
+        return new RegExp(check.expect.regex).test(typeof actual === "string" ? actual : JSON.stringify(actual));
+    }
+    const lit = check.expect.literal;
+    if (isObject(lit) || Array.isArray(lit)) {
+        return JSON.stringify(normalizeDeep(lit)) === JSON.stringify(normalizeDeep(actual));
+    }
+    return scalarEqual(lit, actual);
+}
+function normalizeDeep(v) {
+    if (Array.isArray(v))
+        return v.map(normalizeDeep);
+    if (isObject(v)) {
+        const out = {};
+        for (const k of Object.keys(v).sort())
+            out[k] = normalizeDeep(v[k]);
+        return out;
+    }
+    return normalizeScalar(v);
+}
+/**
+ * Deterministic value accuracy for one sample, or null when neither an eval-case
+ * expected value nor a value check applies (the caller then tries the judge).
+ */
+function resolveDeterministicQuality(input) {
+    if (input.hasExpected === true) {
+        return fieldAccuracy(input.expected, input.output);
+    }
+    const checks = input.valueChecks;
+    if (checks !== undefined && checks.length > 0) {
+        const passing = checks.filter((c) => checkPasses(input.output, c)).length;
+        return passing / checks.length;
+    }
+    return null;
+}

package/dist/bakeoff/reference.d.ts

@@ -0,0 +1,34 @@
+/**
+ * `reference: auto` resolution (RB-1, near-optimal spec §2/§3). The reference arm
+ * defines "optimal" for a bake-off: the strongest DECLARED candidate for the
+ * route's task.
+ *
+ * WHAT SIGNAL WE USE — and why it is what it is. The RigIndex Bradley-Terry layer
+ * (the truest per-task strength) is NOT shipped in the SDK package, and nothing
+ * at SDK runtime is keyed by a route's schema fingerprint cell. The strongest
+ * MEASURED quality signal that ships offline is each model's probed schema
+ * conformance in `registry.json` (surfaced on ModelSelectRow.conformRate). So the
+ * deterministic rule is:
+ *
+ *   among the route's declared candidates with a probed conformance:
+ *     rank by conformRate DESC, then effectiveUsdPer1k ASC, then provider/model ASC
+ *   → the top row is the reference; null when no declared candidate is probed.
+ *
+ * This is pure, offline, deterministic, and reuses the exact registry number the
+ * capability gates already trust (select.ts CONFORMANCE_BAR). The report NAMES
+ * this rule and its source ("registry.json probed conformance") so the choice is
+ * never mistaken for a frontier oracle. An explicit `reference: provider/model`
+ * bypasses this entirely (validated in the loader).
+ */
+import type { CandidateSpec, RouteBundle } from "../types/route";
+import type { ModelSelectRow } from "../registry/select";
+/** The rule name + source, surfaced on the report so `auto` is legible. */
+export declare const REFERENCE_AUTO_RULE: string;
+export declare function pickReferenceCandidate(candidates: readonly CandidateSpec[], rows: readonly ModelSelectRow[]): CandidateSpec | null;
+/**
+ * A `reference: auto` resolver bound to the packaged registry (createRig wires
+ * this). Registry rows load once, lazily, and cache; a missing/unreadable
+ * registry ⇒ [] ⇒ null (no reference arm, graceful).
+ */
+export declare function makeReferenceAutoResolver(registryPath?: string): (route: RouteBundle) => CandidateSpec | null;
+//# sourceMappingURL=reference.d.ts.map

package/dist/bakeoff/reference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reference.d.ts","sourceRoot":"","sources":["../../src/bakeoff/reference.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACjE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAGzD,2EAA2E;AAC3E,eAAO,MAAM,mBAAmB,QAEiC,CAAC;AAElE,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,SAAS,aAAa,EAAE,EACpC,IAAI,EAAE,SAAS,cAAc,EAAE,GAC9B,aAAa,GAAG,IAAI,CAmBtB;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CACvC,YAAY,CAAC,EAAE,MAAM,GACpB,CAAC,KAAK,EAAE,WAAW,KAAK,aAAa,GAAG,IAAI,CAY9C"}

package/dist/bakeoff/reference.js

@@ -0,0 +1,68 @@
+"use strict";
+/**
+ * `reference: auto` resolution (RB-1, near-optimal spec §2/§3). The reference arm
+ * defines "optimal" for a bake-off: the strongest DECLARED candidate for the
+ * route's task.
+ *
+ * WHAT SIGNAL WE USE — and why it is what it is. The RigIndex Bradley-Terry layer
+ * (the truest per-task strength) is NOT shipped in the SDK package, and nothing
+ * at SDK runtime is keyed by a route's schema fingerprint cell. The strongest
+ * MEASURED quality signal that ships offline is each model's probed schema
+ * conformance in `registry.json` (surfaced on ModelSelectRow.conformRate). So the
+ * deterministic rule is:
+ *
+ *   among the route's declared candidates with a probed conformance:
+ *     rank by conformRate DESC, then effectiveUsdPer1k ASC, then provider/model ASC
+ *   → the top row is the reference; null when no declared candidate is probed.
+ *
+ * This is pure, offline, deterministic, and reuses the exact registry number the
+ * capability gates already trust (select.ts CONFORMANCE_BAR). The report NAMES
+ * this rule and its source ("registry.json probed conformance") so the choice is
+ * never mistaken for a frontier oracle. An explicit `reference: provider/model`
+ * bypasses this entirely (validated in the loader).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.REFERENCE_AUTO_RULE = void 0;
+exports.pickReferenceCandidate = pickReferenceCandidate;
+exports.makeReferenceAutoResolver = makeReferenceAutoResolver;
+const rows_1 = require("../registry/rows");
+/** The rule name + source, surfaced on the report so `auto` is legible. */
+exports.REFERENCE_AUTO_RULE = "strongest declared candidate by probed schema conformance " +
+    "(registry.json), tie-break effective $/1k then provider/model";
+function pickReferenceCandidate(candidates, rows) {
+    const byKey = new Map(rows.map((r) => [r.key, r]));
+    const ranked = candidates
+        .map((c) => ({ candidate: c, row: byKey.get(`${c.provider}/${c.model}`) }))
+        .filter((x) => x.row !== undefined && x.row.conformRate !== null)
+        .sort((a, b) => {
+        const conf = (b.row.conformRate ?? 0) - (a.row.conformRate ?? 0);
+        if (conf !== 0)
+            return conf;
+        const ea = a.row.effectiveUsdPer1k ?? Number.POSITIVE_INFINITY;
+        const eb = b.row.effectiveUsdPer1k ?? Number.POSITIVE_INFINITY;
+        if (ea !== eb)
+            return ea - eb;
+        return `${a.candidate.provider}/${a.candidate.model}`.localeCompare(`${b.candidate.provider}/${b.candidate.model}`);
+    });
+    const top = ranked[0];
+    return top === undefined ? null : { provider: top.candidate.provider, model: top.candidate.model };
+}
+/**
+ * A `reference: auto` resolver bound to the packaged registry (createRig wires
+ * this). Registry rows load once, lazily, and cache; a missing/unreadable
+ * registry ⇒ [] ⇒ null (no reference arm, graceful).
+ */
+function makeReferenceAutoResolver(registryPath) {
+    let rows = null;
+    return (route) => {
+        if (rows === null) {
+            try {
+                rows = (0, rows_1.loadRegistryRows)(registryPath);
+            }
+            catch {
+                rows = [];
+            }
+        }
+        return pickReferenceCandidate(route.candidates, rows);
+    };
+}

package/dist/bakeoff/replay.d.ts

@@ -19,6 +19,8 @@
  */
 import type { CaptureStore } from "../telemetry/capture";
 import type { RunDeps } from "../run/run";
+import type { JudgeScorer } from "./judge";
+import type { QualityGate } from "../types/quality";
 export interface ReplayRequest {
     readonly route: string;
     readonly variant: string;
@@ -28,12 +30,35 @@ export interface ReplayRequest {
      * sample for the human value review. Off by default (bounds memory + keeps
      * the pure-metrics path clean). */
     readonly keepOutputs?: boolean;
+    /** RB-1: corrected/golden expected outputs keyed by captureId (eval-case path).
+     * Presence in the map ⇒ this sample has an expected value; `value` may be any
+     * JSON (including null). Quality tier 1 (eval case) when present. */
+    readonly expected?: ReadonlyMap<string, {
+        readonly value: unknown;
+    }>;
+    /** RB-1: an opt-in judge scorer (tier 3), used only when neither an eval-case
+     * expected value nor a declared value check yields a score. Capped internally. */
+    readonly judge?: JudgeScorer;
+    /** Q1 quality gate (spec §4.2): scored on each replayed sample's output to
+     * populate `valueAccuracy` + `qualityPassed`. NOT passed into the inner
+     * `run()` — a bake-off MEASURES quality, it does not gate serving; injecting
+     * the gate into the run would reject samples and corrupt the conformance
+     * numbers it is trying to compare. Runs in the SAME value tier as the RB-1
+     * judge — whichever is supplied wins after the deterministic checks (F5). */
+    readonly qualityGate?: QualityGate;
 }
 export interface ReplaySampleResult {
     readonly captureId: string;
     readonly conform: boolean;
     readonly repaired: boolean;
+    /** Q1: the gate's score (or 1/0 from `ok` when it returned no score); null
+     * when no gate ran or the sample produced no output (a failure). */
     readonly valueAccuracy: number | null;
+    /** Q1: whether the gate PASSED this sample (`verdict.ok`); null when no gate
+     * ran or the sample failed. Drives the bake-off's quality pass-rate CI and
+     * `effectiveUsdPer1kPassing` (stats.ts) — distinct from `valueAccuracy`, which
+     * may be a continuous score. */
+    readonly qualityPassed: boolean | null;
     readonly costUsd: number;
     /** Portion of costUsd spent on repair calls (repaired_by rows). */
     readonly repairCostUsd: number;

package/dist/bakeoff/replay.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"replay.d.ts","sourceRoot":"","sources":["../../src/bakeoff/replay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAGzD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAI1C,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B;;uCAEmC;IACnC,QAAQ,CAAC,WAAW,CAAC,EAAE,OAAO,CAAC;CAChC;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,mEAAmE;IACnE,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B;yDACqD;IACrD,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,oEAAoE;IACpE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;sDACkD;IAClD,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACrC;AAED,wBAAsB,aAAa,CACjC,IAAI,EAAE,OAAO,EACb,QAAQ,EAAE,YAAY,EACtB,GAAG,EAAE,aAAa,GACjB,OAAO,CAAC,SAAS,kBAAkB,EAAE,CAAC,CAwFxC"}
+{"version":3,"file":"replay.d.ts","sourceRoot":"","sources":["../../src/bakeoff/replay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAGzD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAI1C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAE3C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAGpD,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B;;uCAEmC;IACnC,QAAQ,CAAC,WAAW,CAAC,EAAE,OAAO,CAAC;IAC/B;;yEAEqE;IACrE,QAAQ,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;KAAE,CAAC,CAAC;IACrE;sFACkF;IAClF,QAAQ,CAAC,KAAK,CAAC,EAAE,WAAW,CAAC;IAC7B;;;;;iFAK6E;IAC7E,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;CACpC;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B;wEACoE;IACpE,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC;;;oCAGgC;IAChC,QAAQ,CAAC,aAAa,EAAE,OAAO,GAAG,IAAI,CAAC;IACvC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,mEAAmE;IACnE,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B;yDACqD;IACrD,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IACrC,oEAAoE;IACpE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B;sDACkD;IAClD,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACrC;AAED,wBAAsB,aAAa,CACjC,IAAI,EAAE,OAAO,EACb,QAAQ,EAAE,YAAY,EACtB,GAAG,EAAE,aAAa,GACjB,OAAO,CAAC,SAAS,kBAAkB,EAAE,CAAC,CAoIxC"}

package/dist/bakeoff/replay.js

@@ -24,6 +24,8 @@ const node_crypto_1 = require("node:crypto");
 const failures_1 = require("../types/failures");
 const run_1 = require("../run/run");
 const variant_1 = require("../run/variant");
+const quality_1 = require("./quality");
+const quality_gate_1 = require("../run/quality-gate");
 async function replayVariant(deps, captures, req) {
     const rows = captures.readLast(req.route, req.lastN);
     const replayId = (0, node_crypto_1.randomUUID)();
@@ -55,6 +57,12 @@ async function replayVariant(deps, captures, req) {
         let repaired = false;
         let failureClass = null;
         let outputText = null;
+        let outputValue = undefined;
+        let produced = false;
+        // Q1 (spec §4.2): the gate scores the arm's output OUTSIDE the run loop —
+        // captured here so it can be evaluated after the try without leaking the
+        // (envelope-typed) failure path into the gate.
+        let gated = null;
         try {
             // Through the REAL run loop: the variant's template re-renders against
             // the replay candidate's capability flags (never the captured prompt
@@ -71,8 +79,13 @@ async function replayVariant(deps, captures, req) {
             });
             conform = result.meta.validated;
             repaired = result.meta.repairedBy !== null;
+            outputValue = result.output;
+            produced = true;
             if (req.keepOutputs)
                 outputText = JSON.stringify(result.output, null, 2);
+            if (req.qualityGate !== undefined) {
+                gated = { output: result.output, provider: result.meta.provider, model: result.meta.model, servedVariant: result.meta.servedVariant };
+            }
         }
         catch (err) {
             if (!(err instanceof failures_1.RigFailureError))
@@ -80,6 +93,39 @@ async function replayVariant(deps, captures, req) {
             failureClass = err.failure.class;
         }
         const latencyMs = Date.now() - started;
+        // Unified value tier (RB-1 §4.3 + Q1 §4.2, F5 deterministic-first). Only on a
+        // produced output; a failed sample stays unscored (its per-sample quality is
+        // then 1/0 conformance). Precedence for `valueAccuracy` (the regret quality):
+        // eval-case expected → declared value_checks → Q1 SDK gate score → RB-1
+        // declared judge → null. The Q1 gate, when supplied, ALWAYS runs to set
+        // `qualityPassed` (the boolean verdict that drives the cost-first pass-rate
+        // gate), independent of which tier won `valueAccuracy`.
+        let valueAccuracy = null;
+        let qualityPassed = null;
+        if (produced) {
+            const expected = req.expected?.get(capture.inferenceId);
+            const det = (0, quality_1.resolveDeterministicQuality)({
+                output: outputValue,
+                ...(route.valueChecks !== undefined ? { valueChecks: route.valueChecks } : {}),
+                ...(expected !== undefined ? { hasExpected: true, expected: expected.value } : {}),
+            });
+            let gateScore = null;
+            if (req.qualityGate !== undefined && gated !== null) {
+                const verdict = await (0, quality_gate_1.evaluateQualityGate)(req.qualityGate, gated.output, {
+                    route: req.route, provider: gated.provider, model: gated.model,
+                    candidateIndex: 0, attemptSeq: 1, servedVariant: gated.servedVariant,
+                });
+                qualityPassed = verdict.pass;
+                gateScore = verdict.score !== null ? verdict.score : verdict.pass ? 1 : 0;
+            }
+            if (det !== null)
+                valueAccuracy = det;
+            else if (gateScore !== null)
+                valueAccuracy = gateScore;
+            else if (req.judge !== undefined) {
+                valueAccuracy = await req.judge.score(outputValue, JSON.parse(capture.variablesJson));
+            }
+        }
         // Per-sample cost from the tagged attempt rows — base + retries + repair
         // + search, exactly what telemetry billed (F1-corrected).
         const attemptRows = deps.telemetry.queryByTag("replay_capture", sampleTag);
@@ -92,7 +138,8 @@ async function replayVariant(deps, captures, req) {
             captureId: capture.inferenceId,
             conform,
             repaired,
-            valueAccuracy: null, // golden-set hook — expected values are Phase 4's judge/goldens work
+            valueAccuracy, // eval-case / value-check / Q1 gate / RB-1 judge, else null (→ conformance)
+            qualityPassed, // Q1: boolean gate verdict; null when no gate ran or the sample failed
             costUsd,
             repairCostUsd,
             pricingMissing,

package/dist/bakeoff/report.d.ts

@@ -8,6 +8,13 @@ import type { RigConfig } from "../config";
 import type { CacheSimAssumptions } from "./cache-sim";
 import type { KeepOutputsMode } from "./samples";
 import type { BakeoffArtifact } from "./types";
+import type { ObjectiveMode } from "../types/route";
+/**
+ * RB-1 headline (spec §4.5): one line stating the proposed arm's regret with CI
+ * vs the reference, its cost, and the ceiling. Returns null when there is no
+ * proposal or no reference (the plain matrix stands). Exported for the PR body.
+ */
+export declare function bakeoffHeadline(artifact: BakeoffArtifact): string | null;
 /**
  * One variant's measured-cold vs cache-adjusted input cost (cache-aware-routing
  * spec §5.4). Built by the caller from `simulateCache` + the candidate's rates;
@@ -37,5 +44,5 @@ export declare function printMatrix(artifact: BakeoffArtifact, cacheAdjusted?: r
  * Returns the process exit code: 0 on a run (or an empty suite), 1 when cases
  * existed but NONE could be rehydrated (an actionable non-zero, not a crash).
  */
-export declare function runEvalCaseBakeoffCli(config: RigConfig, task: string, variants: readonly string[], envelope: number | undefined, keep: KeepOutputsMode | undefined, asJson: boolean): Promise<number>;
+export declare function runEvalCaseBakeoffCli(config: RigConfig, task: string, variants: readonly string[], envelope: number | undefined, keep: KeepOutputsMode | undefined, asJson: boolean, objectiveMode?: ObjectiveMode): Promise<number>;
 //# sourceMappingURL=report.d.ts.map

package/dist/bakeoff/report.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"report.d.ts","sourceRoot":"","sources":["../../src/bakeoff/report.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAG3C,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,KAAK,EAAE,eAAe,EAAkB,MAAM,SAAS,CAAC;AAM/D;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,+EAA+E;IAC/E,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,gFAAgF;IAChF,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,WAAW,EAAE,mBAAmB,CAAC;CAC3C;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,SAAS,gBAAgB,EAAE,GAAG,MAAM,EAAE,CAgCtF;AAED,wBAAgB,WAAW,CAAC,QAAQ,EAAE,eAAe,EAAE,aAAa,GAAE,SAAS,gBAAgB,EAAO,GAAG,IAAI,CAgC5G;AAED;;;;;;GAMG;AACH,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,SAAS,EACjB,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,IAAI,EAAE,eAAe,GAAG,SAAS,EACjC,MAAM,EAAE,OAAO,GACd,OAAO,CAAC,MAAM,CAAC,CA8CjB"}
+{"version":3,"file":"report.d.ts","sourceRoot":"","sources":["../../src/bakeoff/report.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAG3C,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,KAAK,EAAE,eAAe,EAAkB,MAAM,SAAS,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAkCpD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,eAAe,GAAG,MAAM,GAAG,IAAI,CAexE;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,+EAA+E;IAC/E,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,gFAAgF;IAChF,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,WAAW,EAAE,mBAAmB,CAAC;CAC3C;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,SAAS,gBAAgB,EAAE,GAAG,MAAM,EAAE,CAgCtF;AAED,wBAAgB,WAAW,CAAC,QAAQ,EAAE,eAAe,EAAE,aAAa,GAAE,SAAS,gBAAgB,EAAO,GAAG,IAAI,CAkD5G;AAED;;;;;;GAMG;AACH,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,SAAS,EACjB,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,QAAQ,EAAE,MAAM,GAAG,SAAS,EAC5B,IAAI,EAAE,eAAe,GAAG,SAAS,EACjC,MAAM,EAAE,OAAO,EACf,aAAa,CAAC,EAAE,aAAa,GAC5B,OAAO,CAAC,MAAM,CAAC,CA+CjB"}

package/dist/bakeoff/report.js

@@ -6,6 +6,7 @@
  * with a reason before any bake-off runs — never a silent subset (spec §3.3).
  */
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.bakeoffHeadline = bakeoffHeadline;
 exports.formatCacheAdjustedSection = formatCacheAdjustedSection;
 exports.printMatrix = printMatrix;
 exports.runEvalCaseBakeoffCli = runEvalCaseBakeoffCli;
@@ -17,6 +18,55 @@ const engine_1 = require("./engine");
 function fmtEff(usd) {
     return Number.isFinite(usd) ? `$${usd.toFixed(4)}` : "∞ (0 conformant)";
 }
+/** RB-1: quality points (a 0..1 metric shown as pts, ×100). */
+function fmtPts(v) {
+    return (v * 100).toFixed(1);
+}
+/** RB-1: an arm's regret cell — "0.8 [−0.4…2.1] n=212", "ref", or "—". */
+function fmtRegret(m) {
+    if (m.isReference === true)
+        return "ref";
+    const r = m.regret;
+    if (r == null)
+        return "—";
+    return `${fmtPts(r.regretMean)} [${fmtPts(r.regretCi95[0])}…${fmtPts(r.regretCi95[1])}] n=${r.nPaired}`;
+}
+/** RB-1: an arm's quality cell — "94% value_accuracy" or "—". */
+function fmtQuality(m) {
+    return m.qualityMean === null ? "—" : `${(m.qualityMean * 100).toFixed(0)}% ${m.qualityMetric}`;
+}
+/** The reference $/1k or per-run ceiling from the objective, formatted, or null
+ * when no ceiling is declared. */
+function fmtCeiling(artifact) {
+    const c = artifact.objective?.priceCeiling;
+    if (c == null)
+        return null;
+    if (c.usdPer1k !== undefined)
+        return `$${c.usdPer1k.toFixed(2)}/1k`;
+    if (c.usdPerRun !== undefined)
+        return `$${c.usdPerRun.toFixed(4)}/run`;
+    return null;
+}
+/**
+ * RB-1 headline (spec §4.5): one line stating the proposed arm's regret with CI
+ * vs the reference, its cost, and the ceiling. Returns null when there is no
+ * proposal or no reference (the plain matrix stands). Exported for the PR body.
+ */
+function bakeoffHeadline(artifact) {
+    const p = artifact.proposal;
+    const ref = artifact.reference;
+    if (p == null || ref == null || p.regret == null)
+        return null;
+    const arm = artifact.variants.find((v) => v.variant === p.variant);
+    const cost = arm !== undefined && Number.isFinite(arm.effectiveUsdPer1kConformant)
+        ? `$${arm.effectiveUsdPer1kConformant.toFixed(2)}/1k`
+        : "cost n/a";
+    const ceiling = fmtCeiling(artifact);
+    const r = p.regret;
+    return (`${p.variant} — regret ${fmtPts(r.regretMean)} pts ` +
+        `(CI ${fmtPts(r.regretCi95[0])}…${fmtPts(r.regretCi95[1])}, n=${r.nPaired}) vs reference ${ref.model}, ` +
+        `${cost}${ceiling !== null ? ` vs ceiling ${ceiling}` : ""} — proposed`);
+}
 /**
  * Render the cache-adjusted section (spec §5.4) as lines — measured-cold AND
  * cache-adjusted input cost side by side, with the simulator's assumptions
@@ -59,27 +109,47 @@ function formatCacheAdjustedSection(rows) {
 }
 function printMatrix(artifact, cacheAdjusted = []) {
     console.log(`bakeoff ${artifact.id}\nroute ${artifact.route}@${artifact.routeVersion} · replayed ${artifact.replayN} captured inputs · ${artifact.ranAt}`);
+    // RB-1: a reference arm is present ⇒ show quality + regret columns and badge
+    // the reference row; otherwise the pre-RB-1 matrix stands byte-for-byte.
+    const hasReference = artifact.variants.some((m) => m.isReference === true);
     const header = ["variant", "n", "conform", "ci95", "repair", "repair$", "lat(ms)", "eff-$/1K-conf"];
-    const rows = artifact.variants.map((m) => [
-        m.variant,
-        String(m.samples),
-        `${(m.conformRate * 100).toFixed(0)}%`,
-        `[${(m.conformCi95[0] * 100).toFixed(0)},${(m.conformCi95[1] * 100).toFixed(0)}]`,
-        `${(m.repairRate * 100).toFixed(0)}%`,
-        `$${m.meanRepairCostUsd.toFixed(4)}`,
-        m.meanLatencyMs.toFixed(0),
-        m.pricingMissing ? "UNPRICED (no ranking)" : fmtEff(m.effectiveUsdPer1kConformant),
-    ]);
+    if (hasReference)
+        header.push("quality", "regret(pts)");
+    const rows = artifact.variants.map((m) => {
+        const base = [
+            m.isReference === true ? `${m.variant} [ref]` : m.variant,
+            String(m.samples),
+            `${(m.conformRate * 100).toFixed(0)}%`,
+            `[${(m.conformCi95[0] * 100).toFixed(0)},${(m.conformCi95[1] * 100).toFixed(0)}]`,
+            `${(m.repairRate * 100).toFixed(0)}%`,
+            `$${m.meanRepairCostUsd.toFixed(4)}`,
+            m.meanLatencyMs.toFixed(0),
+            m.pricingMissing ? "UNPRICED (no ranking)" : fmtEff(m.effectiveUsdPer1kConformant),
+        ];
+        if (hasReference)
+            base.push(fmtQuality(m), fmtRegret(m));
+        return base;
+    });
     const widths = header.map((h, c) => Math.max(h.length, ...rows.map((r) => r[c].length)));
     const line = (cells) => cells.map((cell, c) => cell.padEnd(widths[c])).join("  ");
     console.log(line(header));
     for (const row of rows)
         console.log(line(row));
-    if (artifact.proposal !== null) {
+    const headline = bakeoffHeadline(artifact);
+    if (headline !== null) {
+        console.log(`PROPOSAL: ${headline} — human decision required; nothing is executed.`);
+    }
+    else if (artifact.proposal !== null) {
         console.log(`PROPOSAL: variant "${artifact.proposal.variant}" beats the incumbent by ` +
             `${artifact.proposal.vsIncumbentSavingsPct.toFixed(1)}% effective cost — human decision required; ` +
             "nothing is executed.");
     }
+    else if (hasReference && artifact.objective !== undefined) {
+        const bound = artifact.objective.maxRegret === null && artifact.objective.priceCeiling === null;
+        console.log(bound
+            ? "proposal: none — regret reported; declare objective.max_regret or price_ceiling to propose."
+            : "proposal: none (no arm is within the objective's bounds and better than the incumbent)");
+    }
     else {
         console.log("proposal: none (no variant beats the incumbent's gates)");
     }
@@ -95,7 +165,7 @@ function printMatrix(artifact, cacheAdjusted = []) {
  * Returns the process exit code: 0 on a run (or an empty suite), 1 when cases
  * existed but NONE could be rehydrated (an actionable non-zero, not a crash).
  */
-async function runEvalCaseBakeoffCli(config, task, variants, envelope, keep, asJson) {
+async function runEvalCaseBakeoffCli(config, task, variants, envelope, keep, asJson, objectiveMode) {
     const mirrorTarget = config.export?.mode === "direct" ? config.export : undefined;
     const rig = (0, index_1.createRig)(config);
     try {
@@ -103,6 +173,7 @@ async function runEvalCaseBakeoffCli(config, task, variants, envelope, keep, asJ
             variants,
             ...(envelope !== undefined ? { envelopeUsdPerVariant: envelope } : {}),
             ...(keep !== undefined ? { keepOutputs: keep } : {}),
+            ...(objectiveMode !== undefined ? { objectiveMode } : {}),
         });
         console.log(`eval cases for "${task}": ${selection.total} total · ` +
             `${selection.rehydratable.length} rehydratable · ${selection.refusals.length} refused`);

package/dist/bakeoff/samples.d.ts

@@ -8,8 +8,19 @@
  * key; read server-side only; deny-anon RLS. NEVER the anon staging posture.
  *
  * Transport is raw PostgREST over fetch (same pattern as the exporter).
+ *
+ * ── SCRUB BEFORE PERSIST (S7, screening B0-a) ───────────────────────────────
+ * `bakeoff_samples` is the largest server-side customer-content path, so the
+ * task's scrub setting — the SAME `ScrubMode` the content-custody + capture-write
+ * paths honor — runs on `inputText` AND `outputText` BEFORE any row is built or
+ * POSTed (mirrors src/run/capture-write.ts). off/detect ⇒ verbatim (detect still
+ * COUNTS findings onto the row's `arm_meta.scrub`, never values); redact ⇒ masked
+ * copy; block ⇒ a sample with any finding becomes metadata-only (input/output
+ * dropped) and counted. Findings are `{type,count}` only — never a matched value.
  */
 import type { BakeoffSamplesSink } from "./engine";
+import { type ScrubMode } from "../artifacts/scrub";
+import type { TaskSettingsResolver } from "../settings/task-settings";
 /** 256KB per output, per the architect's caps; TOAST compresses at rest. */
 export declare const OUTPUT_MAX_BYTES: number;
 export type KeepOutputsMode = "winner" | "all";
@@ -19,7 +30,9 @@ export interface BakeoffSample {
     readonly arm: string;
     readonly armMeta: Record<string, unknown> | null;
     readonly inputRef: string;
-    readonly inputText: string;
+    /** Null when `block`-mode scrub dropped it (metadata-only sample). At persist
+     * the NOT-NULL `input_text` column coalesces null → "" (see the insert body). */
+    readonly inputText: string | null;
     readonly outputText: string | null;
     readonly conform: boolean;
     readonly costUsd: number;
@@ -45,7 +58,13 @@ export declare function truncateOutput(text: string | null): string | null;
 /** Default retention: 90 days from now (or pass a sooner stamp). Pure over
  * an injected `now` so it stays testable and workflow-safe. */
 export declare function retentionExpiry(nowMs: number, days?: number): string;
-export declare function buildBakeoffSamples(bakeoffId: string, route: string, arms: readonly ArmSamples[], expiresAt: string): BakeoffSample[];
+/**
+ * Flatten arms×samples into rows, scrubbing input + output with the task's
+ * `mode` (S7, default `off` ⇒ verbatim, byte-identical). Scrub findings ride the
+ * row's `arm_meta.scrub` as counts-by-type (never values); a `block`-mode sample
+ * with any finding is stored metadata-only (input/output dropped).
+ */
+export declare function buildBakeoffSamples(bakeoffId: string, route: string, arms: readonly ArmSamples[], expiresAt: string, mode?: ScrubMode): BakeoffSample[];
 export interface BakeoffSamplesClientConfig {
     readonly supabaseUrl: string;
     readonly serviceRoleKey: string;
@@ -73,5 +92,19 @@ export declare function createBakeoffSamplesClient(config: BakeoffSamplesClientC
 export declare function buildDirectSamplesSink(cfg: {
     readonly supabaseUrl: string;
     readonly serviceRoleKey: string;
+    /** Control-plane task-settings resolver (settings-plane §1.5). Null local-only
+     * / direct-mode rigs have none — then `defaultScrub` governs. */
+    readonly resolver?: TaskSettingsResolver | null;
+    /** The rig-level scrub default (config content-custody scrub) — the fallback
+     * when no resolver answers for the route. Defaults `off` ⇒ verbatim. */
+    readonly defaultScrub?: ScrubMode;
 }): BakeoffSamplesSink;
+/**
+ * The effective scrub mode for a bake-off sample write — resolved EXACTLY as
+ * capture-write.ts does: a configured control plane WINS (`resolver.get(route)`),
+ * else the rig's config default. A local-only / direct-mode rig has no resolver,
+ * so it falls to `configDefault`. Pure and synchronous (the resolver read is
+ * cache-only, never a network hop).
+ */
+export declare function resolveSampleScrubMode(resolver: TaskSettingsResolver | null, route: string, configDefault: ScrubMode): ScrubMode;
 //# sourceMappingURL=samples.d.ts.map

package/dist/bakeoff/samples.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"samples.d.ts","sourceRoot":"","sources":["../../src/bakeoff/samples.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAEnD,4EAA4E;AAC5E,eAAO,MAAM,gBAAgB,QAAa,CAAC;AAE3C,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,KAAK,CAAC;AAE/C,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACjD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,qDAAqD;AACrD,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACjD,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;QAC9B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;QACnC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;QAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAC5B,CAAC,CAAC;CACJ;AAED,0EAA0E;AAC1E,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,eAAe,EACrB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,GAAG,IAAI,EACxB,OAAO,EAAE,SAAS,MAAM,EAAE,GACzB,MAAM,EAAE,CAKV;AAED,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAOjE;AAED;+DAC+D;AAC/D,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,SAAK,GAAG,MAAM,CAEhE;AAED,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,SAAS,UAAU,EAAE,EAC3B,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,CAoBjB;AAED,MAAM,WAAW,0BAA0B;IACzC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,KAAK,CAAC;CACjC;AAED,MAAM,WAAW,oBAAoB;IACnC,MAAM,CAAC,OAAO,EAAE,SAAS,aAAa,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACzD,2EAA2E;IAC3E,KAAK,CAAC,IAAI,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CACxE;AAED,wBAAgB,0BAA0B,CAAC,MAAM,EAAE,0BAA0B,GAAG,oBAAoB,CAoEnG;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE;IAC1C,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CACjC,GAAG,kBAAkB,CAQrB"}
+{"version":3,"file":"samples.d.ts","sourceRoot":"","sources":["../../src/bakeoff/samples.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AACnD,OAAO,EAA2D,KAAK,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC7G,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAEtE,4EAA4E;AAC5E,eAAO,MAAM,gBAAgB,QAAa,CAAC;AAE3C,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,KAAK,CAAC;AAE/C,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACjD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;qFACiF;IACjF,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,qDAAqD;AACrD,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;IACjD,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;QAC9B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;QACnC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;QAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;KAC5B,CAAC,CAAC;CACJ;AAED,0EAA0E;AAC1E,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,eAAe,EACrB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,GAAG,IAAI,EACxB,OAAO,EAAE,SAAS,MAAM,EAAE,GACzB,MAAM,EAAE,CAKV;AAED,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAOjE;AAED;+DAC+D;AAC/D,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,SAAK,GAAG,MAAM,CAEhE;AA+BD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,SAAS,UAAU,EAAE,EAC3B,SAAS,EAAE,MAAM,EACjB,IAAI,GAAE,SAAiB,GACtB,aAAa,EAAE,CAyBjB;AAED,MAAM,WAAW,0BAA0B;IACzC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,KAAK,CAAC;CACjC;AAED,MAAM,WAAW,oBAAoB;IACnC,MAAM,CAAC,OAAO,EAAE,SAAS,aAAa,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACzD,2EAA2E;IAC3E,KAAK,CAAC,IAAI,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CACxE;AAED,wBAAgB,0BAA0B,CAAC,MAAM,EAAE,0BAA0B,GAAG,oBAAoB,CAwEnG;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE;IAC1C,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC;qEACiE;IACjE,QAAQ,CAAC,QAAQ,CAAC,EAAE,oBAAoB,GAAG,IAAI,CAAC;IAChD;4EACwE;IACxE,QAAQ,CAAC,YAAY,CAAC,EAAE,SAAS,CAAC;CACnC,GAAG,kBAAkB,CASrB;AAED;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,oBAAoB,GAAG,IAAI,EACrC,KAAK,EAAE,MAAM,EACb,aAAa,EAAE,SAAS,GACvB,SAAS,CAEX"}