modelrig 0.8.1 → 0.9.0

package/dist/detect/safe-harbor.js

@@ -0,0 +1,278 @@
+"use strict";
+/**
+ * SC-2 — deterministic HIPAA Safe Harbor identifier detectors (spec-sc2 §2).
+ *
+ * These EXTEND scrub v1 (S1: extend, don't twin) as new `Detector`s over the
+ * shared interface (src/detect/detector.ts) — `kind: "deterministic"`,
+ * `confidence: 1`. They live BESIDE scrub v1's five detectors, NOT inside
+ * `scrubContent`: adding one here never widens the custody scrub floor. The
+ * composition point is the screen policy `detectors: [...]` opt-in — a route
+ * turns a Safe Harbor detector on explicitly (spec-sc2 §2, builder confirmation:
+ * "never silently added to the custody scrub floor"). `scrubContent` and the
+ * five v1 detectors stay BYTE-IDENTICAL (golden).
+ *
+ * LEAK INVARIANT (spec-sc2 §1.4): a detector emits SPANS (offsets + type +
+ * confidence) — never the matched substring. The matched value is read only to
+ * validate (Luhn / VIN checksum / octet range / age bound) and is discarded
+ * immediately; nothing here returns, logs, or persists it.
+ *
+ * SCOPE (honest limits, stated in the coverage table): US-English-shaped,
+ * deterministic regex/checksum rules — NOT a model, NOT DLP. Free-text names and
+ * street addresses need the customer-run sidecar (src/screen/sidecar.ts); those
+ * classes are `sidecar`/`out-of-scope` in the coverage table, never claimed here.
+ * Recall on synthetic PHI is MEASURED by the SC-3 probe, not asserted here.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SAFE_HARBOR_IDS = exports.SAFE_HARBOR_PACK_ID = void 0;
+exports.vinValid = vinValid;
+exports.isSafeHarborId = isSafeHarborId;
+exports.safeHarborDetectors = safeHarborDetectors;
+exports.safeHarborDetectorById = safeHarborDetectorById;
+exports.safeHarborIdentities = safeHarborIdentities;
+exports.safeHarborDetectorsFor = safeHarborDetectorsFor;
+const scrub_1 = require("../artifacts/scrub");
+/** Cap on spans emitted per detect() call ("per-result cap", spec-sc2 §2): a
+ * pathological document (a table of dates) yields COUNTS, not an unbounded span
+ * list. The count is truthful up to the cap; beyond it the receipt reads
+ * "≥ cap", which is enough to drive a policy action. */
+const MAX_SPANS_PER_TYPE = 512;
+/** Push a `{start,end,type,confidence:1}` span, capped. The matched value is the
+ * caller's local variable; it never enters the span. */
+function emit(spans, type, start, len) {
+    if (spans.length >= MAX_SPANS_PER_TYPE)
+        return;
+    spans.push({ start, end: start + len, type, confidence: 1 });
+}
+/** Iterate global-regex matches with a fresh RegExp (so /g `lastIndex` never
+ * leaks across calls), passing each match to `onMatch`. */
+function eachMatch(re, text, onMatch) {
+    const fresh = new RegExp(re.source, re.flags);
+    for (const m of text.matchAll(fresh))
+        onMatch(m[0], m.index ?? 0);
+}
+// ── date (Safe Harbor: dates except year — DOB/admit/discharge/death) ────────
+// ISO YYYY-MM-DD, US M/D/YYYY (and M/D/YY), and month-name forms. Many formats;
+// per-result cap applies. Conservative: a bare 4-digit year alone is NOT a date
+// (Safe Harbor exempts the year), so the year-only shape is deliberately unmatched.
+const MONTHS = "jan(?:uary)?|feb(?:ruary)?|mar(?:ch)?|apr(?:il)?|may|jun(?:e)?|jul(?:y)?|aug(?:ust)?|sep(?:t(?:ember)?)?|oct(?:ober)?|nov(?:ember)?|dec(?:ember)?";
+const DATE_ISO = /\b\d{4}-(?:0[1-9]|1[0-2])-(?:0[1-9]|[12]\d|3[01])\b/g;
+const DATE_NUMERIC = /\b(?:0?[1-9]|1[0-2])[/-](?:0?[1-9]|[12]\d|3[01])[/-](?:\d{4}|\d{2})\b/g;
+const DATE_MONTH_DMY = new RegExp(`\\b(?:0?[1-9]|[12]\\d|3[01])\\s+(?:${MONTHS})\\.?\\s+\\d{4}\\b`, "gi");
+const DATE_MONTH_MDY = new RegExp(`\\b(?:${MONTHS})\\.?\\s+(?:0?[1-9]|[12]\\d|3[01])(?:st|nd|rd|th)?,?\\s+\\d{4}\\b`, "gi");
+function findDates(text) {
+    const spans = [];
+    for (const re of [DATE_ISO, DATE_NUMERIC, DATE_MONTH_DMY, DATE_MONTH_MDY]) {
+        eachMatch(re, text, (v, i) => emit(spans, "pii:date", i, v.length));
+    }
+    return spans;
+}
+// ── age-over-89 (Safe Harbor: ages > 89 / dates indicating such age) ─────────
+// A numeric RULE, not a regex-of-content (spec-sc2 §2): match an age-shaped
+// phrase, then ACCEPT only when the number is 90..130 (a sane human-age bound —
+// above it the digits are almost certainly something else, e.g. a quantity).
+const AGE_CONTEXT = /\b(?:age[ds]?|aged)\b[^.\n\d]{0,12}(\d{2,3})\b|\b(\d{2,3})[ -]?(?:years?[ -]old|y(?:rs?)?[ -]?old|yo)\b/gi;
+function findAgeOver89(text) {
+    const spans = [];
+    const fresh = new RegExp(AGE_CONTEXT.source, AGE_CONTEXT.flags);
+    for (const m of text.matchAll(fresh)) {
+        const digits = m[1] ?? m[2];
+        if (digits === undefined)
+            continue;
+        const n = Number.parseInt(digits, 10);
+        if (n < 90 || n > 130)
+            continue; // Safe Harbor floor is >89; 130 caps a human age
+        emit(spans, "pii:age_over_89", m.index ?? 0, m[0].length);
+    }
+    return spans;
+}
+// ── fax (Safe Harbor: telephone / fax) — label-anchored phone shape ──────────
+const FAX = /\bfax\b[^.\n]{0,8}(?:\+?\d{1,3}[ .-]?)?(?:\(\d{3}\)|\d{3})[ .-]\d{3}[ .-]\d{4}\b/gi;
+function findFax(text) {
+    const spans = [];
+    eachMatch(FAX, text, (v, i) => emit(spans, "pii:fax", i, v.length));
+    return spans;
+}
+// ── url (Safe Harbor: URLs; also the INJ-6 egress channel) ───────────────────
+const URL_RE = /\bhttps?:\/\/[^\s"'<>)\]\\]+/gi;
+function findUrls(text) {
+    const spans = [];
+    eachMatch(URL_RE, text, (v, i) => {
+        // Trim trailing sentence punctuation from the span length (the URL proper).
+        const trimmed = v.replace(/[.,;:]+$/, "");
+        emit(spans, "pii:url", i, trimmed.length);
+    });
+    return spans;
+}
+// ── ip (Safe Harbor: IP addresses) — v4 (octet-validated) + v6 ───────────────
+const IPV4 = /\b(?:(?:25[0-5]|2[0-4]\d|1?\d?\d)\.){3}(?:25[0-5]|2[0-4]\d|1?\d?\d)\b/g;
+const IPV6 = /\b(?:[0-9A-Fa-f]{1,4}:){2,7}[0-9A-Fa-f]{1,4}\b|\b(?:[0-9A-Fa-f]{1,4}:){1,7}:\b/g;
+function findIps(text) {
+    const spans = [];
+    eachMatch(IPV4, text, (v, i) => emit(spans, "pii:ip", i, v.length));
+    eachMatch(IPV6, text, (v, i) => {
+        if (v.split(":").filter((p) => p !== "").length < 2)
+            return; // avoid a lone "a:" style false hit
+        emit(spans, "pii:ip", i, v.length);
+    });
+    return spans;
+}
+// ── zip (Safe Harbor: geographic < state) — conservative, anchored ───────────
+// A bare 5-digit run floods (SSN-comment doctrine). Claimed only when it is
+// distinctive: ZIP+4 (`12345-6789`), a `ST 12345` state+ZIP shape, or a labelled
+// `ZIP: 12345`. Street/city need the sidecar and are NOT claimed here.
+const ZIP_PLUS4 = /\b\d{5}-\d{4}\b/g;
+const ZIP_STATE = /\b[A-Z]{2}\s+\d{5}(?:-\d{4})?\b/g;
+const ZIP_LABELLED = /\bzip(?:\s*code)?\b[^.\n\d]{0,6}\d{5}(?:-\d{4})?\b/gi;
+function findZips(text) {
+    const spans = [];
+    for (const re of [ZIP_PLUS4, ZIP_STATE, ZIP_LABELLED]) {
+        eachMatch(re, text, (v, i) => emit(spans, "pii:zip", i, v.length));
+    }
+    return spans;
+}
+// ── account-id (health-plan beneficiary #, account #, member #) ──────────────
+// Label-anchored + shape — a bare id is unclaimable without a false-positive
+// flood, so the label is what makes it real (the MRN doctrine).
+const ACCOUNT_ID = /\b(?:account|acct|member|beneficiary|policy|plan|subscriber|group)\b[^.\n]{0,4}(?:id|no|number|#)?\s*[:#]?\s*[A-Za-z0-9][A-Za-z0-9-]{3,}\b/gi;
+function findAccountIds(text) {
+    const spans = [];
+    eachMatch(ACCOUNT_ID, text, (v, i) => emit(spans, "pii:account_id", i, v.length));
+    return spans;
+}
+// ── license-id (certificate / license #) — label-anchored ────────────────────
+const LICENSE_ID = /\b(?:licen[cs]e|licence|certificate|cert|permit|dl|driver'?s?\s+licen[cs]e)\b[^.\n]{0,4}(?:id|no|number|#)?\s*[:#]?\s*[A-Za-z0-9][A-Za-z0-9-]{3,}\b/gi;
+function findLicenseIds(text) {
+    const spans = [];
+    eachMatch(LICENSE_ID, text, (v, i) => emit(spans, "pii:license_id", i, v.length));
+    return spans;
+}
+// ── vin (vehicle identifier) — 17-char VIN with check-digit validation ───────
+const VIN_SHAPE = /\b[A-HJ-NPR-Z0-9]{17}\b/gi;
+const VIN_TRANSLIT = {
+    A: 1, B: 2, C: 3, D: 4, E: 5, F: 6, G: 7, H: 8, J: 1, K: 2, L: 3, M: 4, N: 5,
+    P: 7, R: 9, S: 2, T: 3, U: 4, V: 5, W: 6, X: 7, Y: 8, Z: 9,
+};
+const VIN_WEIGHTS = [8, 7, 6, 5, 4, 3, 2, 10, 0, 9, 8, 7, 6, 5, 4, 3, 2];
+/** VIN check-digit rule (position 9): weighted transliteration mod 11, where 10
+ * ⇒ 'X'. Separates a real VIN from any 17 alphanumerics — the difference between
+ * a false-positive flood and a claimable identifier. */
+function vinValid(vin) {
+    const up = vin.toUpperCase();
+    if (up.length !== 17)
+        return false;
+    let sum = 0;
+    for (let i = 0; i < 17; i += 1) {
+        const ch = up[i];
+        const val = ch >= "0" && ch <= "9" ? ch.charCodeAt(0) - 48 : VIN_TRANSLIT[ch];
+        if (val === undefined)
+            return false; // I/O/Q or other invalid char
+        sum += val * VIN_WEIGHTS[i];
+    }
+    const check = sum % 11;
+    const expected = check === 10 ? "X" : String(check);
+    return up[8] === expected;
+}
+function findVins(text) {
+    const spans = [];
+    eachMatch(VIN_SHAPE, text, (v, i) => {
+        if (!vinValid(v))
+            return;
+        emit(spans, "pii:vin", i, v.length);
+    });
+    return spans;
+}
+// ── device-id (device / serial identifiers) — MAC, IMEI, label-anchored ──────
+const MAC = /\b(?:[0-9A-Fa-f]{2}:){5}[0-9A-Fa-f]{2}\b/g;
+const IMEI_LABELLED = /\bimei\b[^.\n\d]{0,6}(\d{15})\b/gi;
+const DEVICE_LABELLED = /\b(?:device|serial|udid|s\/n|sn)\b[^.\n]{0,4}(?:id|no|number|#)?\s*[:#]?\s*[A-Za-z0-9][A-Za-z0-9-]{3,}\b/gi;
+function findDeviceIds(text) {
+    const spans = [];
+    eachMatch(MAC, text, (v, i) => emit(spans, "pii:device_id", i, v.length));
+    const fresh = new RegExp(IMEI_LABELLED.source, IMEI_LABELLED.flags);
+    for (const m of text.matchAll(fresh)) {
+        const digits = m[1];
+        if (digits === undefined || !(0, scrub_1.luhnValid)(digits))
+            continue; // IMEI is Luhn-valid
+        emit(spans, "pii:device_id", m.index ?? 0, m[0].length);
+    }
+    eachMatch(DEVICE_LABELLED, text, (v, i) => emit(spans, "pii:device_id", i, v.length));
+    return spans;
+}
+/** The SC-2 deterministic rule set (spec-sc2 §2). One rule per Safe Harbor class
+ * that has a deterministic shape; names/streets/biometrics are NOT here (they
+ * are `sidecar`/`out-of-scope` in the coverage table). */
+const RULES = [
+    { type: "pii:date", id: "pii:date@v1", find: findDates },
+    { type: "pii:age_over_89", id: "pii:age_over_89@v1", find: findAgeOver89 },
+    { type: "pii:fax", id: "pii:fax@v1", find: findFax },
+    { type: "pii:url", id: "pii:url@v1", find: findUrls },
+    { type: "pii:ip", id: "pii:ip@v1", find: findIps },
+    { type: "pii:zip", id: "pii:zip@v1", find: findZips },
+    { type: "pii:account_id", id: "pii:account_id@v1", find: findAccountIds },
+    { type: "pii:license_id", id: "pii:license_id@v1", find: findLicenseIds },
+    { type: "pii:vin", id: "pii:vin@v1", find: findVins },
+    { type: "pii:device_id", id: "pii:device_id@v1", find: findDeviceIds },
+];
+/** The registry id of the convenience PACK — configuring it in a route's
+ * `screen.detectors` opts in to ALL ten deterministic Safe Harbor detectors at
+ * once. Individual `pii:<slug>@v1` ids opt in to just that one. */
+exports.SAFE_HARBOR_PACK_ID = "safe-harbor@v1";
+/** All individual Safe Harbor detector ids, for policy validation. */
+exports.SAFE_HARBOR_IDS = new Set(RULES.map((r) => r.id));
+/** True when `id` names a Safe Harbor detector (a `pii:<slug>@v1` or the pack).
+ * The screen policy validator uses this to accept the id at load time. */
+function isSafeHarborId(id) {
+    return id === exports.SAFE_HARBOR_PACK_ID || exports.SAFE_HARBOR_IDS.has(id);
+}
+/** Collapse overlapping spans of one detector to a single span so one underlying
+ * identifier matched by two sub-patterns (e.g. a ZIP caught by both the ZIP+4 and
+ * the state+ZIP rule) COUNTS ONCE. Sorted by start; a span whose range overlaps a
+ * kept span is dropped (conservative — an adjacency undercount is cheaper than a
+ * double count). Offsets only, never a value. */
+function dedupeOverlaps(spans) {
+    const sorted = [...spans].sort((a, b) => a.start - b.start || b.end - a.end);
+    const kept = [];
+    let lastEnd = -1;
+    for (const s of sorted) {
+        if (s.start >= lastEnd) {
+            kept.push(s);
+            lastEnd = s.end;
+        }
+    }
+    return kept;
+}
+/** Wrap one rule as the shared `Detector` (kind deterministic, confidence 1). */
+function detectorFor(rule) {
+    return {
+        id: rule.id,
+        kind: "deterministic",
+        detect: (input) => Promise.resolve(dedupeOverlaps(rule.find(input.text))),
+    };
+}
+/** Every Safe Harbor detector (one per type), for the pack. */
+function safeHarborDetectors() {
+    return RULES.map(detectorFor);
+}
+/** The Safe Harbor detector for one id, or `undefined` if `id` is not one.
+ * `SAFE_HARBOR_PACK_ID` returns `undefined` here — the pack expands to
+ * {@link safeHarborDetectors}; a caller resolves the pack separately. */
+function safeHarborDetectorById(id) {
+    const rule = RULES.find((r) => r.id === id);
+    return rule === undefined ? undefined : detectorFor(rule);
+}
+/** The detector identities (id + version) for a configured id — the pack
+ * expands to all ten; a single id resolves to one. Used to populate the
+ * receipt's `detectors[]` at resolve time (counts-only, never a value). */
+function safeHarborIdentities(id) {
+    if (id === exports.SAFE_HARBOR_PACK_ID)
+        return RULES.map((r) => ({ id: r.id, version: "v1" }));
+    return exports.SAFE_HARBOR_IDS.has(id) ? [{ id, version: "v1" }] : [];
+}
+/** Build the Detector instances a configured id contributes (pack ⇒ all ten,
+ * single id ⇒ one, unknown ⇒ none). */
+function safeHarborDetectorsFor(id) {
+    if (id === exports.SAFE_HARBOR_PACK_ID)
+        return safeHarborDetectors();
+    const one = safeHarborDetectorById(id);
+    return one === undefined ? [] : [one];
+}

package/dist/feedback/coverage.d.ts

@@ -7,12 +7,12 @@
  *   rung 0 — implicit signals only: conformance / repair / refusal rates
  *            from telemetry. Enough confidence for schema-mechanical swap
  *            proposals (the bake-off gate).
- *   rung 1 — ≥ RUNG1_MIN_FEEDBACK human/agent verdicts attached: prose
+ *   rung 1 — ≥ RUNG1_MIN_GRADES grades attached: prose
  *            routes (no schema to conform to) gain proposal confidence.
  *   rung 2+ — judges; Phase 5+, out of scope by decision.
  */
-import type { FeedbackRow, TelemetryRow } from "../types/telemetry";
-export declare const RUNG1_MIN_FEEDBACK = 10;
+import type { GradeRow, TelemetryRow } from "../types/telemetry";
+export declare const RUNG1_MIN_GRADES = 10;
 export interface RouteCoverage {
     readonly route: string;
     readonly samples: number;
@@ -20,13 +20,16 @@ export interface RouteCoverage {
     readonly conformRate: number;
     readonly repairRate: number;
     readonly refusalRate: number;
-    readonly feedbackCount: number;
+    readonly gradeCount: number;
     readonly rung: 0 | 1;
     /** Teaching copy: what reaching the next rung takes and unlocks. */
     readonly nextRungUnlock: string;
 }
-/** Attribution: a feedback row joins a route via its inference id, or via
- * its episode key matching a row's run_id tag. Unmatched feedback attaches
- * to nothing (never guessed). */
-export declare function computeCoverage(rows: readonly TelemetryRow[], feedback: readonly FeedbackRow[]): RouteCoverage[];
+/** Attribution: a grade joins a route via its inference-subject id, or via its
+ * run-subject (episode) id matching a row's run_id tag. Unmatched grades attach
+ * to nothing (never guessed). Grade primitive (R6): every grade counts toward
+ * readiness — a wrapper-written feedback IS now a grade, so this is
+ * behaviour-preserving for the Rung-1 threshold. Artifact-subject grades never
+ * resolve to a route here (no artifact→route join) and simply do not count. */
+export declare function computeCoverage(rows: readonly TelemetryRow[], grades: readonly GradeRow[]): RouteCoverage[];
 //# sourceMappingURL=coverage.d.ts.map

package/dist/feedback/coverage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"coverage.d.ts","sourceRoot":"","sources":["../../src/feedback/coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAEpE,eAAO,MAAM,kBAAkB,KAAK,CAAC;AAErC,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,6EAA6E;IAC7E,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;IACrB,oEAAoE;IACpE,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CACjC;AAED;;iCAEiC;AACjC,wBAAgB,eAAe,CAC7B,IAAI,EAAE,SAAS,YAAY,EAAE,EAC7B,QAAQ,EAAE,SAAS,WAAW,EAAE,GAC/B,aAAa,EAAE,CA2EjB"}
+{"version":3,"file":"coverage.d.ts","sourceRoot":"","sources":["../../src/feedback/coverage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAEjE,eAAO,MAAM,gBAAgB,KAAK,CAAC;AAEnC,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,6EAA6E;IAC7E,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;IACrB,oEAAoE;IACpE,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CACjC;AAED;;;;;+EAK+E;AAC/E,wBAAgB,eAAe,CAC7B,IAAI,EAAE,SAAS,YAAY,EAAE,EAC7B,MAAM,EAAE,SAAS,QAAQ,EAAE,GAC1B,aAAa,EAAE,CAqFjB"}

package/dist/feedback/coverage.js

@@ -8,18 +8,21 @@
  *   rung 0 — implicit signals only: conformance / repair / refusal rates
  *            from telemetry. Enough confidence for schema-mechanical swap
  *            proposals (the bake-off gate).
- *   rung 1 — ≥ RUNG1_MIN_FEEDBACK human/agent verdicts attached: prose
+ *   rung 1 — ≥ RUNG1_MIN_GRADES grades attached: prose
  *            routes (no schema to conform to) gain proposal confidence.
  *   rung 2+ — judges; Phase 5+, out of scope by decision.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.RUNG1_MIN_FEEDBACK = void 0;
+exports.RUNG1_MIN_GRADES = void 0;
 exports.computeCoverage = computeCoverage;
-exports.RUNG1_MIN_FEEDBACK = 10;
-/** Attribution: a feedback row joins a route via its inference id, or via
- * its episode key matching a row's run_id tag. Unmatched feedback attaches
- * to nothing (never guessed). */
-function computeCoverage(rows, feedback) {
+exports.RUNG1_MIN_GRADES = 10;
+/** Attribution: a grade joins a route via its inference-subject id, or via its
+ * run-subject (episode) id matching a row's run_id tag. Unmatched grades attach
+ * to nothing (never guessed). Grade primitive (R6): every grade counts toward
+ * readiness — a wrapper-written feedback IS now a grade, so this is
+ * behaviour-preserving for the Rung-1 threshold. Artifact-subject grades never
+ * resolve to a route here (no artifact→route join) and simply do not count. */
+function computeCoverage(rows, grades) {
     const routeByInferenceId = new Map();
     const routeByEpisode = new Map();
     const byRoute = new Map();
@@ -42,7 +45,7 @@ function computeCoverage(rows, feedback) {
             conform: 0,
             repaired: 0,
             refused: 0,
-            feedback: 0,
+            grades: 0,
         };
         agg.samples += 1;
         if (row.failureClass === null)
@@ -63,22 +66,32 @@ function computeCoverage(rows, feedback) {
             // Unparseable tags never break coverage — the row still counts above.
         }
     }
-    for (const f of feedback) {
-        const route = (f.inferenceId !== null ? routeByInferenceId.get(f.inferenceId) : undefined) ??
-            (f.episodeKey !== null ? routeByEpisode.get(f.episodeKey) : undefined);
+    for (const g of grades) {
+        // R6 (grade primitive): EVERY grade counts toward Rung 1, not just the
+        // wrapper-written thumbs the pre-grade `feedback` table held. A grade counts
+        // only when its subject resolves to a route: an inference-subject id, or a
+        // run-subject (episode) id matching a row's run_id tag. Artifact-subject
+        // grades and native run verdicts (whose run-subject id is a run UUID, not an
+        // episode key) never resolve to a route here, so they do not over-count —
+        // behaviour-preserving for existing corpora while opening Rung 1 to
+        // model-judge/agent grades on inferences (the R6 intent).
+        const inferenceId = g.subjectKind === "inference" ? g.subjectId : null;
+        const episodeKey = g.subjectKind === "run" ? g.subjectId : null;
+        const route = (inferenceId !== null ? routeByInferenceId.get(inferenceId) : undefined) ??
+            (episodeKey !== null ? routeByEpisode.get(episodeKey) : undefined);
         if (route === undefined)
             continue;
         const agg = byRoute.get(route);
         if (agg !== undefined)
-            agg.feedback += 1;
+            agg.grades += 1;
     }
     return [...byRoute.entries()]
         .sort(([a], [b]) => a.localeCompare(b))
         .map(([route, agg]) => {
-        const rung = agg.feedback >= exports.RUNG1_MIN_FEEDBACK ? 1 : 0;
+        const rung = agg.grades >= exports.RUNG1_MIN_GRADES ? 1 : 0;
         const nextRungUnlock = rung === 0
-            ? `Attach ${exports.RUNG1_MIN_FEEDBACK - agg.feedback} more rig.feedback() verdicts ` +
-                `(${agg.feedback}/${exports.RUNG1_MIN_FEEDBACK}) to reach rung 1 — human-verdict confidence ` +
+            ? `Attach ${exports.RUNG1_MIN_GRADES - agg.grades} more rig.grade() grades ` +
+                `(${agg.grades}/${exports.RUNG1_MIN_GRADES}) to reach rung 1 — judged confidence ` +
                 "for routes without a schema to conform to."
             : "Rung 2 (LLM judges — value accuracy beyond mechanical conformance) arrives in Phase 5.";
         return {
@@ -87,7 +100,7 @@ function computeCoverage(rows, feedback) {
             conformRate: agg.samples === 0 ? 0 : agg.conform / agg.samples,
             repairRate: agg.samples === 0 ? 0 : agg.repaired / agg.samples,
             refusalRate: agg.samples === 0 ? 0 : agg.refused / agg.samples,
-            feedbackCount: agg.feedback,
+            gradeCount: agg.grades,
             rung,
             nextRungUnlock,
         };

package/dist/feedback/grade.d.ts

@@ -0,0 +1,51 @@
+/**
+ * rig.grade() — the unified judgment primitive (grade primitive, R1).
+ *
+ * A grade attaches a judgment to a SUBJECT (an inference / run / artifact):
+ * `{ score: 0–1 (primitive), scale?, comment?, kind, grader?, source? }`. The
+ * pass/fail VERDICT is DERIVED at read time (`pass = score >= threshold`), never
+ * stored. `rig.grade` writes one local `grades` row (synchronous SQLite insert,
+ * fire-and-forget); the exporter mirrors it to the cloud.
+ *
+ * `rig.grade` is the SOLE judgment write API. The temporary GP-1 compat wrappers
+ * (`rig.feedback` / `artifact.evaluate` / `run.evaluate`) and their adapters were
+ * removed in GP-3 — every judgment now builds a grade directly.
+ */
+import type { GradeRow, GradeSubject } from "../types/telemetry";
+/** Options for `rig.grade(subject, opts)`. `score` is the 0–1 primitive and is
+ * required; everything else is optional display / provenance. */
+export interface GradeOpts {
+    /** 0–1 primitive (always present). up/pass = 1.0, down/fail = 0.0, else graded. */
+    readonly score: number;
+    /** Optional DISPLAY scale — `{ max }` (e.g. out of 100) or `{ label }` (e.g. "B+").
+     * Never changes the derived verdict, which is a threshold on `score`. */
+    readonly scale?: {
+        readonly max: number;
+    } | {
+        readonly label: string;
+    };
+    /** Written guidance saved for a later improvement path (was note/explanation). */
+    readonly comment?: string;
+    readonly kind: "human" | "model-judge" | "deterministic";
+    /** Optional specific grader name (e.g. "gpt-5-judge", "schema-check"). */
+    readonly grader?: string;
+    /** Provenance (e.g. "sdk", "console", a review-agent name). */
+    readonly source?: string;
+    /** The grade's own org — server-supplied ONLY, already authorized (T3). Omit
+     * from application code (a rig has one org and the exporter knows it). */
+    readonly orgId?: string;
+    /** Authenticated user who recorded it — same provenance rule as `orgId`. */
+    readonly createdBy?: string | null;
+}
+/** Build a GradeRow from a subject + opts. Validates the score bound (the one
+ * primitive — a judgment with no numeric score has no place in the grade model). */
+export declare function buildGradeRow(subject: GradeSubject, opts: GradeOpts): GradeRow;
+/** Build the rig's `grade` surface over a grade writer (the telemetry store).
+ * Kept here (not inlined in index.ts) so the SDK entrypoint stays under the LOC
+ * cap and the grade write surface lives with the primitive. */
+export declare function makeGradeApi(store: {
+    recordGrade(row: GradeRow): void;
+}): {
+    grade(subject: GradeSubject, opts: GradeOpts): GradeRow;
+};
+//# sourceMappingURL=grade.d.ts.map

package/dist/feedback/grade.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"grade.d.ts","sourceRoot":"","sources":["../../src/feedback/grade.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAEjE;iEACiE;AACjE,MAAM,WAAW,SAAS;IACxB,mFAAmF;IACnF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB;6EACyE;IACzE,QAAQ,CAAC,KAAK,CAAC,EAAE;QAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,GAAG;QAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IACvE,kFAAkF;IAClF,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,aAAa,GAAG,eAAe,CAAC;IACzD,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB;8EAC0E;IAC1E,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,4EAA4E;IAC5E,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAQD;oFACoF;AACpF,wBAAgB,aAAa,CAAC,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,GAAG,QAAQ,CAuB9E;AAED;;+DAE+D;AAC/D,wBAAgB,YAAY,CAAC,KAAK,EAAE;IAAE,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAA;CAAE,GAAG;IACzE,KAAK,CAAC,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,GAAG,QAAQ,CAAC;CACzD,CAQA"}

package/dist/feedback/grade.js

@@ -0,0 +1,63 @@
+"use strict";
+/**
+ * rig.grade() — the unified judgment primitive (grade primitive, R1).
+ *
+ * A grade attaches a judgment to a SUBJECT (an inference / run / artifact):
+ * `{ score: 0–1 (primitive), scale?, comment?, kind, grader?, source? }`. The
+ * pass/fail VERDICT is DERIVED at read time (`pass = score >= threshold`), never
+ * stored. `rig.grade` writes one local `grades` row (synchronous SQLite insert,
+ * fire-and-forget); the exporter mirrors it to the cloud.
+ *
+ * `rig.grade` is the SOLE judgment write API. The temporary GP-1 compat wrappers
+ * (`rig.feedback` / `artifact.evaluate` / `run.evaluate`) and their adapters were
+ * removed in GP-3 — every judgment now builds a grade directly.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildGradeRow = buildGradeRow;
+exports.makeGradeApi = makeGradeApi;
+const node_crypto_1 = require("node:crypto");
+function scaleFields(scale) {
+    if (scale === undefined)
+        return { scaleMax: null, scaleLabel: null };
+    if ("max" in scale)
+        return { scaleMax: scale.max, scaleLabel: null };
+    return { scaleMax: null, scaleLabel: scale.label };
+}
+/** Build a GradeRow from a subject + opts. Validates the score bound (the one
+ * primitive — a judgment with no numeric score has no place in the grade model). */
+function buildGradeRow(subject, opts) {
+    if (subject.id === "") {
+        throw new Error("grade subject must have a non-empty id");
+    }
+    if (!Number.isFinite(opts.score) || opts.score < 0 || opts.score > 1) {
+        throw new Error(`grade score must be in [0, 1], got ${opts.score}`);
+    }
+    const { scaleMax, scaleLabel } = scaleFields(opts.scale);
+    return {
+        id: (0, node_crypto_1.randomUUID)(),
+        subjectKind: subject.kind,
+        subjectId: subject.id,
+        score: opts.score,
+        scaleMax,
+        scaleLabel,
+        comment: opts.comment ?? null,
+        kind: opts.kind,
+        grader: opts.grader ?? null,
+        source: opts.source ?? null,
+        orgId: opts.orgId !== undefined && opts.orgId !== "" ? opts.orgId : null,
+        createdBy: opts.createdBy ?? null,
+        ts: new Date().toISOString(),
+    };
+}
+/** Build the rig's `grade` surface over a grade writer (the telemetry store).
+ * Kept here (not inlined in index.ts) so the SDK entrypoint stays under the LOC
+ * cap and the grade write surface lives with the primitive. */
+function makeGradeApi(store) {
+    return {
+        grade(subject, opts) {
+            const row = buildGradeRow(subject, opts);
+            store.recordGrade(row);
+            return row;
+        },
+    };
+}

package/dist/gateway/http-protocol.d.ts

@@ -42,7 +42,7 @@ export declare const MODELRIG_HEADERS: {
     /** "provider/model" that repaired the output, when repair fired. */
     readonly repairedBy: "x-modelrig-repaired-by";
     readonly costUsd: "x-modelrig-cost-usd";
-    /** The `rig.feedback()` handle (telemetry inference id). */
+    /** The `rig.grade()` inference handle (telemetry inference id). */
     readonly inferenceId: "x-modelrig-inference-id";
 };
 export declare const MODELRIG_REQUEST_HEADERS: {

package/dist/gateway/http-protocol.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"http-protocol.d.ts","sourceRoot":"","sources":["../../src/gateway/http-protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAE9E,uCAAuC;AACvC,eAAO,MAAM,qBAAqB,yBAAyB,CAAC;AAC5D,2EAA2E;AAC3E,eAAO,MAAM,WAAW,eAAe,CAAC;AAExC,6DAA6D;AAC7D,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAO1C,eAAO,MAAM,gBAAgB;IAC3B,0EAA0E;;IAE1E;;;;eAIW;;;;IAIX,yEAAyE;;IAEzE,oEAAoE;;;IAGpE,4DAA4D;;CAEpD,CAAC;AAGX,eAAO,MAAM,wBAAwB;IACnC,qCAAqC;;IAErC,oCAAoC;;IAEpC,8EAA8E;;CAEtE,CAAC;AAEX,MAAM,MAAM,IAAI,GAAG,MAAM,GAAG,KAAK,CAAC;AAElC,4EAA4E;AAC5E,MAAM,MAAM,cAAc,GACtB;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAChD;IAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC3E;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAE1D;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,MAAM,EACb,eAAe,GAAE,WAAW,CAAC,MAAM,CAAa,GAC/C,cAAc,CA6BhB;AAID,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC;IACxD,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,0EAA0E;IAC1E,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC1C,0DAA0D;IAC1D,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,CAAC;IAC1C,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC3C,QAAQ,CAAC,WAAW,CAAC,EAAE,UAAU,CAAC;IAClC,4EAA4E;IAC5E,QAAQ,CAAC,eAAe,CAAC,EACrB;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GACzB;QAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;KAAE,GAChC;QACE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;QAC7B,QAAQ,CAAC,WAAW,EAAE;YAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAA;SAAE,CAAC;KACrG,CAAC;IACN,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,CAAC,EAAE;QAClB,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAC9B,CAAC;CACH;AAID,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE;QAChB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;QAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;QAChC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;KAC3C,CAAC;IACF,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,QAAQ,GAAG,YAAY,GAAG,gBAAgB,GAAG,IAAI,CAAC;CACpF;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAClD,QAAQ,CAAC,KAAK,EAAE,mBAAmB,CAAC;CACrC;AAID,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE;QACd,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC;QAC5B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACjC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;KAC3C,CAAC;IACF,QAAQ,CAAC,aAAa,EAAE,oBAAoB,CAAC,eAAe,CAAC,CAAC;CAC/D;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,uBAAuB,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,SAAS,yBAAyB,EAAE,CAAC;CACxD;AAED;;;;;;GAMG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC;IACvC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,2DAA2D;IAC3D,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,gEAAgE;AAChE,eAAO,MAAM,QAAQ,WAAW,CAAC"}
+{"version":3,"file":"http-protocol.d.ts","sourceRoot":"","sources":["../../src/gateway/http-protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAE9E,uCAAuC;AACvC,eAAO,MAAM,qBAAqB,yBAAyB,CAAC;AAC5D,2EAA2E;AAC3E,eAAO,MAAM,WAAW,eAAe,CAAC;AAExC,6DAA6D;AAC7D,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAO1C,eAAO,MAAM,gBAAgB;IAC3B,0EAA0E;;IAE1E;;;;eAIW;;;;IAIX,yEAAyE;;IAEzE,oEAAoE;;;IAGpE,mEAAmE;;CAE3D,CAAC;AAGX,eAAO,MAAM,wBAAwB;IACnC,qCAAqC;;IAErC,oCAAoC;;IAEpC,8EAA8E;;CAEtE,CAAC;AAEX,MAAM,MAAM,IAAI,GAAG,MAAM,GAAG,KAAK,CAAC;AAElC,4EAA4E;AAC5E,MAAM,MAAM,cAAc,GACtB;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAChD;IAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAC3E;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAE1D;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,MAAM,EACb,eAAe,GAAE,WAAW,CAAC,MAAM,CAAa,GAC/C,cAAc,CA6BhB;AAID,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC;IACxD,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,0EAA0E;IAC1E,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC1C,0DAA0D;IAC1D,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,CAAC;IAC1C,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,cAAc,EAAE,CAAC;IAC3C,QAAQ,CAAC,WAAW,CAAC,EAAE,UAAU,CAAC;IAClC,4EAA4E;IAC5E,QAAQ,CAAC,eAAe,CAAC,EACrB;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GACzB;QAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;KAAE,GAChC;QACE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;QAC7B,QAAQ,CAAC,WAAW,EAAE;YAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;YAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAA;SAAE,CAAC;KACrG,CAAC;IACN,wEAAwE;IACxE,QAAQ,CAAC,QAAQ,CAAC,EAAE;QAClB,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;QAC3B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAC9B,CAAC;CACH;AAID,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE;QAChB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;QAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;QAChC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;KAC3C,CAAC;IACF,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,QAAQ,GAAG,YAAY,GAAG,gBAAgB,GAAG,IAAI,CAAC;CACpF;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,iBAAiB,CAAC;IACnC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAClD,QAAQ,CAAC,KAAK,EAAE,mBAAmB,CAAC;CACrC;AAID,MAAM,WAAW,yBAAyB;IACxC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE;QACd,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC;QAC5B,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACjC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;KAC3C,CAAC;IACF,QAAQ,CAAC,aAAa,EAAE,oBAAoB,CAAC,eAAe,CAAC,CAAC;CAC/D;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,uBAAuB,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,SAAS,yBAAyB,EAAE,CAAC;CACxD;AAED;;;;;;GAMG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC;IACvC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,2DAA2D;IAC3D,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,gEAAgE;AAChE,eAAO,MAAM,QAAQ,WAAW,CAAC"}

package/dist/gateway/http-protocol.js

@@ -51,7 +51,7 @@ exports.MODELRIG_HEADERS = {
     /** "provider/model" that repaired the output, when repair fired. */
     repairedBy: "x-modelrig-repaired-by",
     costUsd: "x-modelrig-cost-usd",
-    /** The `rig.feedback()` handle (telemetry inference id). */
+    /** The `rig.grade()` inference handle (telemetry inference id). */
     inferenceId: "x-modelrig-inference-id",
 };
 // Request-side extension headers (spec §3.4).