@coool/opencode-adaptive 0.0.0-stage → 1.0.1

package/dist/state/receipts/bound.js

@@ -0,0 +1,77 @@
+import { MAX_RECEIPT_TEXT } from "./types.js";
+export function boundText(raw) {
+    return raw.length > MAX_RECEIPT_TEXT ? raw.slice(0, MAX_RECEIPT_TEXT) : raw;
+}
+function boundRef(ref) {
+    return {
+        providerID: boundText(ref.providerID),
+        id: boundText(ref.id),
+        ...(ref.variant !== undefined ? { variant: boundText(ref.variant) } : {}),
+    };
+}
+function boundApply(decision) {
+    return {
+        kind: "apply",
+        model: boundRef(decision.model),
+        ...(decision.tier !== undefined ? { tier: decision.tier } : {}),
+        reason: decision.reason,
+        evidence: {
+            skipped: decision.evidence.skipped.map((skip) => ({
+                ref: boundRef(skip.ref),
+                why: skip.why,
+            })),
+            ...(decision.evidence.probeId !== undefined
+                ? { probeId: boundText(decision.evidence.probeId) }
+                : {}),
+        },
+    };
+}
+function boundDefer(decision) {
+    return {
+        kind: "defer",
+        reason: decision.reason,
+        ...(decision.detail !== undefined ? { detail: boundText(decision.detail) } : {}),
+    };
+}
+function boundPark(decision) {
+    return {
+        kind: "park",
+        reason: decision.reason,
+        ...(decision.detail !== undefined ? { detail: boundText(decision.detail) } : {}),
+    };
+}
+function boundEscalate(decision) {
+    return {
+        kind: "escalate",
+        target: boundRef(decision.target),
+        step: decision.step,
+        tier: decision.tier,
+        evidence: decision.evidence.map((item) => ({
+            kind: item.kind,
+            ...(item.detail !== undefined ? { detail: boundText(item.detail) } : {}),
+        })),
+        budgetRemaining: decision.budgetRemaining,
+    };
+}
+function boundObserveOnly(decision, depth) {
+    return { kind: "observe-only", would: boundDecision(decision.would, depth + 1) };
+}
+/**
+ * Structural copy of a decision with every string bounded. `depth` guards
+ * the `observe-only` recursion (max one nesting level is ever produced).
+ */
+export function boundDecision(decision, depth = 0) {
+    switch (decision.kind) {
+        case "apply":
+            return boundApply(decision);
+        case "defer":
+            return boundDefer(decision);
+        case "park":
+            return boundPark(decision);
+        case "escalate":
+            return boundEscalate(decision);
+        case "observe-only":
+            return depth < 2 ? boundObserveOnly(decision, depth) : decision;
+    }
+}
+//# sourceMappingURL=bound.js.map

package/dist/state/receipts/bound.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bound.js","sourceRoot":"","sources":["../../../src/state/receipts/bound.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AAE7C,MAAM,UAAU,SAAS,CAAC,GAAW;IACnC,OAAO,GAAG,CAAC,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;AAC7E,CAAC;AAED,SAAS,QAAQ,CAAC,GAAa;IAC7B,OAAO;QACL,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC;QACrC,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,GAAG,CAAC,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1E,CAAA;AACH,CAAC;AAED,SAAS,UAAU,CAAC,QAAuB;IACzC,OAAO;QACL,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC;QAC/B,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/D,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,QAAQ,EAAE;YACR,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAChD,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC;gBACvB,GAAG,EAAE,IAAI,CAAC,GAAG;aACd,CAAC,CAAC;YACH,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,KAAK,SAAS;gBACzC,CAAC,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE;gBACnD,CAAC,CAAC,EAAE,CAAC;SACR;KACF,CAAA;AACH,CAAC;AAED,SAAS,UAAU,CAAC,QAAuB;IACzC,OAAO;QACL,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACjF,CAAA;AACH,CAAC;AAED,SAAS,SAAS,CAAC,QAAsB;IACvC,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACjF,CAAA;AACH,CAAC;AAED,SAAS,aAAa,CAAC,QAA0B;IAC/C,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;QACjC,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,QAAQ,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACzC,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACzE,CAAC,CAAC;QACH,eAAe,EAAE,QAAQ,CAAC,eAAe;KAC1C,CAAA;AACH,CAAC;AAED,SAAS,gBAAgB,CAAC,QAA6B,EAAE,KAAa;IACpE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,CAAA;AAClF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,QAAkB,EAAE,KAAK,GAAG,CAAC;IACzD,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,OAAO;YACV,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAA;QAC7B,KAAK,OAAO;YACV,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAA;QAC7B,KAAK,MAAM;YACT,OAAO,SAAS,CAAC,QAAQ,CAAC,CAAA;QAC5B,KAAK,UAAU;YACb,OAAO,aAAa,CAAC,QAAQ,CAAC,CAAA;QAChC,KAAK,cAAc;YACjB,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAA;IACnE,CAAC;AACH,CAAC","sourcesContent":["/**\n * Bounding for receipts (ADP-030). Receipts are built from typed scheduler\n * decisions, but every string they can carry is truncated to\n * `MAX_RECEIPT_TEXT` before persisting — including identifiers. Boundedness\n * is what makes the no-secrets invariant checkable: no field accepts\n * unbounded text, so nothing unbounded can be persisted.\n */\nimport type {\n  ApplyDecision,\n  DeferDecision,\n  Decision,\n  EscalateDecision,\n  ObserveOnlyDecision,\n  ParkDecision,\n} from \"../../core/scheduler/types.js\"\nimport type { ModelRef } from \"../../core/work-unit/types.js\"\nimport { MAX_RECEIPT_TEXT } from \"./types.js\"\n\nexport function boundText(raw: string): string {\n  return raw.length > MAX_RECEIPT_TEXT ? raw.slice(0, MAX_RECEIPT_TEXT) : raw\n}\n\nfunction boundRef(ref: ModelRef): ModelRef {\n  return {\n    providerID: boundText(ref.providerID),\n    id: boundText(ref.id),\n    ...(ref.variant !== undefined ? { variant: boundText(ref.variant) } : {}),\n  }\n}\n\nfunction boundApply(decision: ApplyDecision): ApplyDecision {\n  return {\n    kind: \"apply\",\n    model: boundRef(decision.model),\n    ...(decision.tier !== undefined ? { tier: decision.tier } : {}),\n    reason: decision.reason,\n    evidence: {\n      skipped: decision.evidence.skipped.map((skip) => ({\n        ref: boundRef(skip.ref),\n        why: skip.why,\n      })),\n      ...(decision.evidence.probeId !== undefined\n        ? { probeId: boundText(decision.evidence.probeId) }\n        : {}),\n    },\n  }\n}\n\nfunction boundDefer(decision: DeferDecision): DeferDecision {\n  return {\n    kind: \"defer\",\n    reason: decision.reason,\n    ...(decision.detail !== undefined ? { detail: boundText(decision.detail) } : {}),\n  }\n}\n\nfunction boundPark(decision: ParkDecision): ParkDecision {\n  return {\n    kind: \"park\",\n    reason: decision.reason,\n    ...(decision.detail !== undefined ? { detail: boundText(decision.detail) } : {}),\n  }\n}\n\nfunction boundEscalate(decision: EscalateDecision): EscalateDecision {\n  return {\n    kind: \"escalate\",\n    target: boundRef(decision.target),\n    step: decision.step,\n    tier: decision.tier,\n    evidence: decision.evidence.map((item) => ({\n      kind: item.kind,\n      ...(item.detail !== undefined ? { detail: boundText(item.detail) } : {}),\n    })),\n    budgetRemaining: decision.budgetRemaining,\n  }\n}\n\nfunction boundObserveOnly(decision: ObserveOnlyDecision, depth: number): ObserveOnlyDecision {\n  return { kind: \"observe-only\", would: boundDecision(decision.would, depth + 1) }\n}\n\n/**\n * Structural copy of a decision with every string bounded. `depth` guards\n * the `observe-only` recursion (max one nesting level is ever produced).\n */\nexport function boundDecision(decision: Decision, depth = 0): Decision {\n  switch (decision.kind) {\n    case \"apply\":\n      return boundApply(decision)\n    case \"defer\":\n      return boundDefer(decision)\n    case \"park\":\n      return boundPark(decision)\n    case \"escalate\":\n      return boundEscalate(decision)\n    case \"observe-only\":\n      return depth < 2 ? boundObserveOnly(decision, depth) : decision\n  }\n}\n"]}

package/dist/state/receipts/index.d.ts

@@ -0,0 +1,6 @@
+export { boundDecision, boundText } from "./bound.js";
+export { parseReceiptsPayload } from "./parse.js";
+export { ReceiptStore } from "./store.js";
+export type { ReceiptRef } from "./store.js";
+export { MAX_RECEIPTS, MAX_RECEIPT_TEXT, RECEIPTS_KEY, RECEIPTS_VERSION } from "./types.js";
+export type { Receipt, ReceiptInput, ReceiptMeta, ReceiptOutcome, ReceiptsPayload, ReceiptsStorage, } from "./types.js";

package/dist/state/receipts/index.js

@@ -0,0 +1,5 @@
+export { boundDecision, boundText } from "./bound.js";
+export { parseReceiptsPayload } from "./parse.js";
+export { ReceiptStore } from "./store.js";
+export { MAX_RECEIPTS, MAX_RECEIPT_TEXT, RECEIPTS_KEY, RECEIPTS_VERSION } from "./types.js";
+//# sourceMappingURL=index.js.map

package/dist/state/receipts/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/state/receipts/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,YAAY,CAAA;AACrD,OAAO,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAA;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAEzC,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA","sourcesContent":["export { boundDecision, boundText } from \"./bound.js\"\nexport { parseReceiptsPayload } from \"./parse.js\"\nexport { ReceiptStore } from \"./store.js\"\nexport type { ReceiptRef } from \"./store.js\"\nexport { MAX_RECEIPTS, MAX_RECEIPT_TEXT, RECEIPTS_KEY, RECEIPTS_VERSION } from \"./types.js\"\nexport type {\n  Receipt,\n  ReceiptInput,\n  ReceiptMeta,\n  ReceiptOutcome,\n  ReceiptsPayload,\n  ReceiptsStorage,\n} from \"./types.js\"\n"]}

package/dist/state/receipts/parse.d.ts

@@ -0,0 +1,6 @@
+import type { Receipt } from "./types.js";
+/**
+ * Parse a persisted receipts payload. Accepts the versioned shape and a
+ * versionless draft array; anything else yields no receipts.
+ */
+export declare function parseReceiptsPayload(raw: unknown): Receipt[];

package/dist/state/receipts/parse.js

@@ -0,0 +1,226 @@
+/**
+ * Read-side parsing for persisted receipts. Every parser is total: it accepts
+ * `unknown` and returns typed records, dropping anything invalid — a
+ * corrupted receipts file can never take the plugin down (ADP-031). Reason
+ * vocabularies are membership-checked (the write path is typed); free-text
+ * fields are re-bounded. An older plugin reading newer receipts may drop
+ * unknown-vocabulary entries — receipts are bounded diagnostics, eviction is
+ * expected behavior, and the payload version guards the schema itself.
+ */
+import { APPLY_REASONS, ESCALATION_EVIDENCE_KINDS, ESCALATION_STEPS, PARK_REASONS, SKIP_REASONS, SCHEDULER_DEFER_REASONS, } from "../../core/scheduler/types.js";
+import { TIERS } from "../../core/tier-policy/types.js";
+import { INTERRUPT_REASONS } from "../../core/work-unit/interruption.js";
+import { FAILURE_CATEGORIES } from "../../health/classifier/types.js";
+import { parseModelRef } from "../settings/parse.js";
+import { MAX_RECEIPTS, MAX_RECEIPT_TEXT, RECEIPTS_VERSION } from "./types.js";
+function isRecord(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function boundString(raw) {
+    if (typeof raw !== "string")
+        return undefined;
+    return raw.length > MAX_RECEIPT_TEXT ? raw.slice(0, MAX_RECEIPT_TEXT) : raw;
+}
+function isFiniteNonNegative(raw) {
+    return typeof raw === "number" && Number.isFinite(raw) && raw >= 0;
+}
+function parseVocab(raw, vocabulary) {
+    if (typeof raw !== "string")
+        return undefined;
+    return vocabulary.find((entry) => entry === raw);
+}
+function parseTier(raw) {
+    if (typeof raw !== "string")
+        return undefined;
+    return TIERS.find((tier) => tier === raw);
+}
+function parseOptionalBounded(raw) {
+    const value = boundString(raw);
+    return value === "" ? undefined : value;
+}
+/** Free-text detail keeps empty strings (round-trips through the store). */
+function parseDetailBounded(raw) {
+    return boundString(raw) ?? undefined;
+}
+function parseApplyEvidence(raw) {
+    if (!isRecord(raw))
+        return undefined;
+    const skippedRaw = raw["skipped"];
+    if (!Array.isArray(skippedRaw))
+        return undefined;
+    const skipped = [];
+    for (const entry of skippedRaw.slice(0, 8)) {
+        if (!isRecord(entry))
+            continue;
+        const ref = parseModelRef(entry["ref"]);
+        const why = parseVocab(entry["why"], SKIP_REASONS);
+        if (ref === undefined || why === undefined)
+            continue;
+        skipped.push({ ref, why });
+    }
+    const probeId = parseDetailBounded(raw["probeId"]);
+    return { skipped, ...(probeId !== undefined ? { probeId } : {}) };
+}
+function parseApply(raw) {
+    const model = parseModelRef(raw["model"]);
+    const reason = parseVocab(raw["reason"], APPLY_REASONS);
+    const evidence = parseApplyEvidence(raw["evidence"]);
+    if (model === undefined || reason === undefined || evidence === undefined) {
+        return undefined;
+    }
+    const tier = parseTier(raw["tier"]);
+    return {
+        kind: "apply",
+        model,
+        ...(tier !== undefined ? { tier } : {}),
+        reason,
+        evidence,
+    };
+}
+function parseDefer(raw) {
+    const reason = parseVocab(raw["reason"], SCHEDULER_DEFER_REASONS);
+    if (reason === undefined)
+        return undefined;
+    const detail = parseDetailBounded(raw["detail"]);
+    return { kind: "defer", reason, ...(detail !== undefined ? { detail } : {}) };
+}
+function parsePark(raw) {
+    const reason = parseVocab(raw["reason"], PARK_REASONS);
+    if (reason === undefined)
+        return undefined;
+    const detail = parseDetailBounded(raw["detail"]);
+    return { kind: "park", reason, ...(detail !== undefined ? { detail } : {}) };
+}
+function parseEscalate(raw) {
+    const target = parseModelRef(raw["target"]);
+    const step = parseVocab(raw["step"], ESCALATION_STEPS);
+    const tier = parseTier(raw["tier"]);
+    const budgetRemainingRaw = raw["budgetRemaining"];
+    if (target === undefined ||
+        step === undefined ||
+        tier === undefined ||
+        !isFiniteNonNegative(budgetRemainingRaw)) {
+        return undefined;
+    }
+    const evidenceRaw = raw["evidence"];
+    if (!Array.isArray(evidenceRaw))
+        return undefined;
+    const evidence = [];
+    for (const entry of evidenceRaw.slice(0, 4)) {
+        if (!isRecord(entry))
+            continue;
+        const kind = parseVocab(entry["kind"], ESCALATION_EVIDENCE_KINDS);
+        if (kind === undefined)
+            continue;
+        const detail = parseDetailBounded(entry["detail"]);
+        evidence.push({ kind, ...(detail !== undefined ? { detail } : {}) });
+    }
+    return {
+        kind: "escalate",
+        target,
+        step,
+        tier,
+        evidence,
+        budgetRemaining: budgetRemainingRaw,
+    };
+}
+/** Max `observe-only` nesting accepted on read (the scheduler produces ≤ 1). */
+const MAX_PARSE_DEPTH = 2;
+function parseObserveOnly(raw, depth) {
+    if (depth >= MAX_PARSE_DEPTH)
+        return undefined;
+    const would = parseDecision(raw["would"], depth + 1);
+    return would === undefined ? undefined : { kind: "observe-only", would };
+}
+function parseDecision(raw, depth = 0) {
+    if (!isRecord(raw))
+        return undefined;
+    switch (raw["kind"]) {
+        case "apply":
+            return parseApply(raw);
+        case "defer":
+            return parseDefer(raw);
+        case "park":
+            return parsePark(raw);
+        case "escalate":
+            return parseEscalate(raw);
+        case "observe-only":
+            return parseObserveOnly(raw, depth);
+        default:
+            return undefined;
+    }
+}
+function parseOutcome(raw) {
+    if (!isRecord(raw))
+        return undefined;
+    switch (raw["status"]) {
+        case "succeeded":
+            return { status: "succeeded" };
+        case "failed": {
+            const category = parseVocab(raw["category"], FAILURE_CATEGORIES);
+            return category === undefined ? undefined : { status: "failed", category };
+        }
+        case "interrupted": {
+            const reason = parseVocab(raw["reason"], INTERRUPT_REASONS);
+            return reason === undefined ? undefined : { status: "interrupted", reason };
+        }
+        default:
+            return undefined;
+    }
+}
+function parseReceipt(raw) {
+    if (!isRecord(raw))
+        return undefined;
+    const id = raw["id"];
+    const at = raw["at"];
+    const sessionID = parseOptionalBounded(raw["sessionID"]);
+    const decision = parseDecision(raw["decision"]);
+    if (!(isFiniteNonNegative(id) && Number.isInteger(id) && isFiniteNonNegative(at)) ||
+        sessionID === undefined ||
+        decision === undefined) {
+        return undefined;
+    }
+    const unitID = parseOptionalBounded(raw["unitID"]);
+    const tier = parseTier(raw["tier"]);
+    // A present-but-invalid outcome invalidates the whole record: stripping
+    // just the outcome would break first-outcome-wins across a restart (the
+    // receipt would accept a later, different outcome as its first).
+    let outcome;
+    if (raw["outcome"] !== undefined) {
+        outcome = parseOutcome(raw["outcome"]);
+        if (outcome === undefined)
+            return undefined;
+    }
+    return {
+        id,
+        at,
+        sessionID,
+        ...(unitID !== undefined ? { unitID } : {}),
+        ...(tier !== undefined ? { tier } : {}),
+        decision,
+        ...(outcome !== undefined ? { outcome } : {}),
+    };
+}
+/**
+ * Parse a persisted receipts payload. Accepts the versioned shape and a
+ * versionless draft array; anything else yields no receipts.
+ */
+export function parseReceiptsPayload(raw) {
+    let list;
+    if (isRecord(raw)) {
+        const version = raw["version"];
+        if (version !== RECEIPTS_VERSION && version !== undefined)
+            return [];
+        list = raw["receipts"];
+    }
+    else if (Array.isArray(raw)) {
+        list = raw;
+    }
+    if (!Array.isArray(list))
+        return [];
+    const parsed = list
+        .map(parseReceipt)
+        .filter((receipt) => receipt !== undefined);
+    return parsed.length > MAX_RECEIPTS ? parsed.slice(-MAX_RECEIPTS) : parsed;
+}
+//# sourceMappingURL=parse.js.map

package/dist/state/receipts/parse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse.js","sourceRoot":"","sources":["../../../src/state/receipts/parse.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EACL,aAAa,EACb,yBAAyB,EACzB,gBAAgB,EAChB,YAAY,EACZ,YAAY,EACZ,uBAAuB,GACxB,MAAM,+BAA+B,CAAA;AAWtC,OAAO,EAAE,KAAK,EAAE,MAAM,iCAAiC,CAAA;AAEvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,sCAAsC,CAAA;AACxE,OAAO,EAAE,kBAAkB,EAAE,MAAM,kCAAkC,CAAA;AACrE,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAA;AACpD,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AAG7E,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;AAC7E,CAAC;AAED,SAAS,WAAW,CAAC,GAAY;IAC/B,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAA;IAC7C,OAAO,GAAG,CAAC,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;AAC7E,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAY;IACvC,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAA;AACpE,CAAC;AAED,SAAS,UAAU,CACjB,GAAY,EACZ,UAAa;IAEb,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAA;IAC7C,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,GAAG,CAAC,CAAA;AAClD,CAAC;AAED,SAAS,SAAS,CAAC,GAAY;IAC7B,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAA;IAC7C,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC,CAAA;AAC3C,CAAC;AAED,SAAS,oBAAoB,CAAC,GAAY;IACxC,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAA;IAC9B,OAAO,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAA;AACzC,CAAC;AAED,4EAA4E;AAC5E,SAAS,kBAAkB,CAAC,GAAY;IACtC,OAAO,WAAW,CAAC,GAAG,CAAC,IAAI,SAAS,CAAA;AACtC,CAAC;AAED,SAAS,kBAAkB,CAAC,GAAY;IACtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAA;IACpC,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC,CAAA;IACjC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;QAAE,OAAO,SAAS,CAAA;IAChD,MAAM,OAAO,GAAuB,EAAE,CAAA;IACtC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,SAAQ;QAC9B,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;QACvC,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,YAAY,CAAC,CAAA;QAClD,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,SAAQ;QACpD,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;IAC5B,CAAC;IACD,MAAM,OAAO,GAAG,kBAAkB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAA;IAClD,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAA;AACnE,CAAC;AAED,SAAS,UAAU,CAAC,GAA4B;IAC9C,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;IACzC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,aAAa,CAAC,CAAA;IACvD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAA;IACpD,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC1E,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;IACnC,OAAO;QACL,IAAI,EAAE,OAAO;QACb,KAAK;QACL,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvC,MAAM;QACN,QAAQ;KACT,CAAA;AACH,CAAC;AAED,SAAS,UAAU,CAAC,GAA4B;IAC9C,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,uBAAuB,CAAC,CAAA;IACjE,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAA;IAC1C,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAA;IAChD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAA;AAC/E,CAAC;AAED,SAAS,SAAS,CAAC,GAA4B;IAC7C,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,YAAY,CAAC,CAAA;IACtD,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAA;IAC1C,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAA;IAChD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAA;AAC9E,CAAC;AAED,SAAS,aAAa,CAAC,GAA4B;IACjD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAA;IAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,gBAAgB,CAAC,CAAA;IACtD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;IACnC,MAAM,kBAAkB,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAA;IACjD,IACE,MAAM,KAAK,SAAS;QACpB,IAAI,KAAK,SAAS;QAClB,IAAI,KAAK,SAAS;QAClB,CAAC,mBAAmB,CAAC,kBAAkB,CAAC,EACxC,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,MAAM,WAAW,GAAG,GAAG,CAAC,UAAU,CAAC,CAAA;IACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;QAAE,OAAO,SAAS,CAAA;IACjD,MAAM,QAAQ,GAAyB,EAAE,CAAA;IACzC,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QAC5C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,SAAQ;QAC9B,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,yBAAyB,CAAC,CAAA;QACjE,IAAI,IAAI,KAAK,SAAS;YAAE,SAAQ;QAChC,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAA;QAClD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;IACtE,CAAC;IACD,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,MAAM;QACN,IAAI;QACJ,IAAI;QACJ,QAAQ;QACR,eAAe,EAAE,kBAAkB;KACpC,CAAA;AACH,CAAC;AAED,gFAAgF;AAChF,MAAM,eAAe,GAAG,CAAC,CAAA;AAEzB,SAAS,gBAAgB,CACvB,GAA4B,EAC5B,KAAa;IAEb,IAAI,KAAK,IAAI,eAAe;QAAE,OAAO,SAAS,CAAA;IAC9C,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;IACpD,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,CAAA;AAC1E,CAAC;AAED,SAAS,aAAa,CAAC,GAAY,EAAE,KAAK,GAAG,CAAC;IAC5C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAA;IACpC,QAAQ,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QACpB,KAAK,OAAO;YACV,OAAO,UAAU,CAAC,GAAG,CAAC,CAAA;QACxB,KAAK,OAAO;YACV,OAAO,UAAU,CAAC,GAAG,CAAC,CAAA;QACxB,KAAK,MAAM;YACT,OAAO,SAAS,CAAC,GAAG,CAAC,CAAA;QACvB,KAAK,UAAU;YACb,OAAO,aAAa,CAAC,GAAG,CAAC,CAAA;QAC3B,KAAK,cAAc;YACjB,OAAO,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QACrC;YACE,OAAO,SAAS,CAAA;IACpB,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,GAAY;IAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAA;IACpC,QAAQ,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtB,KAAK,WAAW;YACd,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAA;QAChC,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,kBAAkB,CAAC,CAAA;YAChE,OAAO,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAA;QAC5E,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,iBAAiB,CAAC,CAAA;YAC3D,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,CAAA;QAC7E,CAAC;QACD;YACE,OAAO,SAAS,CAAA;IACpB,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,GAAY;IAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAA;IACpC,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAA;IACpB,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,CAAA;IACpB,MAAM,SAAS,GAAG,oBAAoB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAA;IACxD,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAA;IAC/C,IACE,CAAC,CAAC,mBAAmB,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7E,SAAS,KAAK,SAAS;QACvB,QAAQ,KAAK,SAAS,EACtB,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,MAAM,MAAM,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAA;IAClD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;IACnC,wEAAwE;IACxE,wEAAwE;IACxE,iEAAiE;IACjE,IAAI,OAAmC,CAAA;IACvC,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;QACjC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAA;QACtC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,SAAS,CAAA;IAC7C,CAAC;IACD,OAAO;QACL,EAAE;QACF,EAAE;QACF,SAAS;QACT,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvC,QAAQ;QACR,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9C,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAY;IAC/C,IAAI,IAAa,CAAA;IACjB,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAClB,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,CAAA;QAC9B,IAAI,OAAO,KAAK,gBAAgB,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,EAAE,CAAA;QACpE,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAA;IACxB,CAAC;SAAM,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9B,IAAI,GAAG,GAAG,CAAA;IACZ,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAA;IACnC,MAAM,MAAM,GAAG,IAAI;SAChB,GAAG,CAAC,YAAY,CAAC;SACjB,MAAM,CAAC,CAAC,OAAO,EAAsB,EAAE,CAAC,OAAO,KAAK,SAAS,CAAC,CAAA;IACjE,OAAO,MAAM,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;AAC5E,CAAC","sourcesContent":["/**\n * Read-side parsing for persisted receipts. Every parser is total: it accepts\n * `unknown` and returns typed records, dropping anything invalid — a\n * corrupted receipts file can never take the plugin down (ADP-031). Reason\n * vocabularies are membership-checked (the write path is typed); free-text\n * fields are re-bounded. An older plugin reading newer receipts may drop\n * unknown-vocabulary entries — receipts are bounded diagnostics, eviction is\n * expected behavior, and the payload version guards the schema itself.\n */\nimport {\n  APPLY_REASONS,\n  ESCALATION_EVIDENCE_KINDS,\n  ESCALATION_STEPS,\n  PARK_REASONS,\n  SKIP_REASONS,\n  SCHEDULER_DEFER_REASONS,\n} from \"../../core/scheduler/types.js\"\nimport type {\n  ApplyDecision,\n  DeferDecision,\n  Decision,\n  EscalateDecision,\n  EscalationEvidence,\n  ObserveOnlyDecision,\n  ParkDecision,\n  SkippedCandidate,\n} from \"../../core/scheduler/types.js\"\nimport { TIERS } from \"../../core/tier-policy/types.js\"\nimport type { TierName } from \"../../core/tier-policy/types.js\"\nimport { INTERRUPT_REASONS } from \"../../core/work-unit/interruption.js\"\nimport { FAILURE_CATEGORIES } from \"../../health/classifier/types.js\"\nimport { parseModelRef } from \"../settings/parse.js\"\nimport { MAX_RECEIPTS, MAX_RECEIPT_TEXT, RECEIPTS_VERSION } from \"./types.js\"\nimport type { Receipt, ReceiptOutcome } from \"./types.js\"\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value)\n}\n\nfunction boundString(raw: unknown): string | undefined {\n  if (typeof raw !== \"string\") return undefined\n  return raw.length > MAX_RECEIPT_TEXT ? raw.slice(0, MAX_RECEIPT_TEXT) : raw\n}\n\nfunction isFiniteNonNegative(raw: unknown): raw is number {\n  return typeof raw === \"number\" && Number.isFinite(raw) && raw >= 0\n}\n\nfunction parseVocab<V extends readonly string[]>(\n  raw: unknown,\n  vocabulary: V,\n): V[number] | undefined {\n  if (typeof raw !== \"string\") return undefined\n  return vocabulary.find((entry) => entry === raw)\n}\n\nfunction parseTier(raw: unknown): TierName | undefined {\n  if (typeof raw !== \"string\") return undefined\n  return TIERS.find((tier) => tier === raw)\n}\n\nfunction parseOptionalBounded(raw: unknown): string | undefined {\n  const value = boundString(raw)\n  return value === \"\" ? undefined : value\n}\n\n/** Free-text detail keeps empty strings (round-trips through the store). */\nfunction parseDetailBounded(raw: unknown): string | undefined {\n  return boundString(raw) ?? undefined\n}\n\nfunction parseApplyEvidence(raw: unknown): ApplyDecision[\"evidence\"] | undefined {\n  if (!isRecord(raw)) return undefined\n  const skippedRaw = raw[\"skipped\"]\n  if (!Array.isArray(skippedRaw)) return undefined\n  const skipped: SkippedCandidate[] = []\n  for (const entry of skippedRaw.slice(0, 8)) {\n    if (!isRecord(entry)) continue\n    const ref = parseModelRef(entry[\"ref\"])\n    const why = parseVocab(entry[\"why\"], SKIP_REASONS)\n    if (ref === undefined || why === undefined) continue\n    skipped.push({ ref, why })\n  }\n  const probeId = parseDetailBounded(raw[\"probeId\"])\n  return { skipped, ...(probeId !== undefined ? { probeId } : {}) }\n}\n\nfunction parseApply(raw: Record<string, unknown>): ApplyDecision | undefined {\n  const model = parseModelRef(raw[\"model\"])\n  const reason = parseVocab(raw[\"reason\"], APPLY_REASONS)\n  const evidence = parseApplyEvidence(raw[\"evidence\"])\n  if (model === undefined || reason === undefined || evidence === undefined) {\n    return undefined\n  }\n  const tier = parseTier(raw[\"tier\"])\n  return {\n    kind: \"apply\",\n    model,\n    ...(tier !== undefined ? { tier } : {}),\n    reason,\n    evidence,\n  }\n}\n\nfunction parseDefer(raw: Record<string, unknown>): DeferDecision | undefined {\n  const reason = parseVocab(raw[\"reason\"], SCHEDULER_DEFER_REASONS)\n  if (reason === undefined) return undefined\n  const detail = parseDetailBounded(raw[\"detail\"])\n  return { kind: \"defer\", reason, ...(detail !== undefined ? { detail } : {}) }\n}\n\nfunction parsePark(raw: Record<string, unknown>): ParkDecision | undefined {\n  const reason = parseVocab(raw[\"reason\"], PARK_REASONS)\n  if (reason === undefined) return undefined\n  const detail = parseDetailBounded(raw[\"detail\"])\n  return { kind: \"park\", reason, ...(detail !== undefined ? { detail } : {}) }\n}\n\nfunction parseEscalate(raw: Record<string, unknown>): EscalateDecision | undefined {\n  const target = parseModelRef(raw[\"target\"])\n  const step = parseVocab(raw[\"step\"], ESCALATION_STEPS)\n  const tier = parseTier(raw[\"tier\"])\n  const budgetRemainingRaw = raw[\"budgetRemaining\"]\n  if (\n    target === undefined ||\n    step === undefined ||\n    tier === undefined ||\n    !isFiniteNonNegative(budgetRemainingRaw)\n  ) {\n    return undefined\n  }\n  const evidenceRaw = raw[\"evidence\"]\n  if (!Array.isArray(evidenceRaw)) return undefined\n  const evidence: EscalationEvidence[] = []\n  for (const entry of evidenceRaw.slice(0, 4)) {\n    if (!isRecord(entry)) continue\n    const kind = parseVocab(entry[\"kind\"], ESCALATION_EVIDENCE_KINDS)\n    if (kind === undefined) continue\n    const detail = parseDetailBounded(entry[\"detail\"])\n    evidence.push({ kind, ...(detail !== undefined ? { detail } : {}) })\n  }\n  return {\n    kind: \"escalate\",\n    target,\n    step,\n    tier,\n    evidence,\n    budgetRemaining: budgetRemainingRaw,\n  }\n}\n\n/** Max `observe-only` nesting accepted on read (the scheduler produces ≤ 1). */\nconst MAX_PARSE_DEPTH = 2\n\nfunction parseObserveOnly(\n  raw: Record<string, unknown>,\n  depth: number,\n): ObserveOnlyDecision | undefined {\n  if (depth >= MAX_PARSE_DEPTH) return undefined\n  const would = parseDecision(raw[\"would\"], depth + 1)\n  return would === undefined ? undefined : { kind: \"observe-only\", would }\n}\n\nfunction parseDecision(raw: unknown, depth = 0): Decision | undefined {\n  if (!isRecord(raw)) return undefined\n  switch (raw[\"kind\"]) {\n    case \"apply\":\n      return parseApply(raw)\n    case \"defer\":\n      return parseDefer(raw)\n    case \"park\":\n      return parsePark(raw)\n    case \"escalate\":\n      return parseEscalate(raw)\n    case \"observe-only\":\n      return parseObserveOnly(raw, depth)\n    default:\n      return undefined\n  }\n}\n\nfunction parseOutcome(raw: unknown): ReceiptOutcome | undefined {\n  if (!isRecord(raw)) return undefined\n  switch (raw[\"status\"]) {\n    case \"succeeded\":\n      return { status: \"succeeded\" }\n    case \"failed\": {\n      const category = parseVocab(raw[\"category\"], FAILURE_CATEGORIES)\n      return category === undefined ? undefined : { status: \"failed\", category }\n    }\n    case \"interrupted\": {\n      const reason = parseVocab(raw[\"reason\"], INTERRUPT_REASONS)\n      return reason === undefined ? undefined : { status: \"interrupted\", reason }\n    }\n    default:\n      return undefined\n  }\n}\n\nfunction parseReceipt(raw: unknown): Receipt | undefined {\n  if (!isRecord(raw)) return undefined\n  const id = raw[\"id\"]\n  const at = raw[\"at\"]\n  const sessionID = parseOptionalBounded(raw[\"sessionID\"])\n  const decision = parseDecision(raw[\"decision\"])\n  if (\n    !(isFiniteNonNegative(id) && Number.isInteger(id) && isFiniteNonNegative(at)) ||\n    sessionID === undefined ||\n    decision === undefined\n  ) {\n    return undefined\n  }\n  const unitID = parseOptionalBounded(raw[\"unitID\"])\n  const tier = parseTier(raw[\"tier\"])\n  // A present-but-invalid outcome invalidates the whole record: stripping\n  // just the outcome would break first-outcome-wins across a restart (the\n  // receipt would accept a later, different outcome as its first).\n  let outcome: ReceiptOutcome | undefined\n  if (raw[\"outcome\"] !== undefined) {\n    outcome = parseOutcome(raw[\"outcome\"])\n    if (outcome === undefined) return undefined\n  }\n  return {\n    id,\n    at,\n    sessionID,\n    ...(unitID !== undefined ? { unitID } : {}),\n    ...(tier !== undefined ? { tier } : {}),\n    decision,\n    ...(outcome !== undefined ? { outcome } : {}),\n  }\n}\n\n/**\n * Parse a persisted receipts payload. Accepts the versioned shape and a\n * versionless draft array; anything else yields no receipts.\n */\nexport function parseReceiptsPayload(raw: unknown): Receipt[] {\n  let list: unknown\n  if (isRecord(raw)) {\n    const version = raw[\"version\"]\n    if (version !== RECEIPTS_VERSION && version !== undefined) return []\n    list = raw[\"receipts\"]\n  } else if (Array.isArray(raw)) {\n    list = raw\n  }\n  if (!Array.isArray(list)) return []\n  const parsed = list\n    .map(parseReceipt)\n    .filter((receipt): receipt is Receipt => receipt !== undefined)\n  return parsed.length > MAX_RECEIPTS ? parsed.slice(-MAX_RECEIPTS) : parsed\n}\n"]}

package/dist/state/receipts/store.d.ts

@@ -0,0 +1,34 @@
+import type { Receipt, ReceiptInput, ReceiptOutcome, ReceiptsStorage } from "./types.js";
+export interface ReceiptRef {
+    readonly sessionID: string;
+    /** When given, only receipts of that unit are updated; otherwise only receipts without a unit. */
+    readonly unitID?: string | undefined;
+}
+export declare class ReceiptStore {
+    #private;
+    private readonly storage;
+    constructor(storage: ReceiptsStorage);
+    /** Rebuild from storage (restart behavior). A read failure yields an empty store. */
+    load(): Promise<void>;
+    /** All retained receipts, oldest → newest. */
+    snapshot(): readonly Receipt[];
+    record(input: ReceiptInput): Promise<Receipt>;
+    /**
+     * Attach a unit outcome to matching receipts that do not have one yet
+     * (first outcome wins). Returns how many receipts were updated; zero
+     * updates do not touch storage.
+     */
+    attachOutcome(ref: ReceiptRef, outcome: ReceiptOutcome): Promise<number>;
+    /**
+     * Stamps the unit that just opened onto the session's pending unit-less
+     * admission receipts (recorded in the awaited prompt hook, before the unit
+     * existed). After adoption the receipt carries the unitID, so outcomes
+     * attach to it like any unit-scoped receipt.
+     *
+     * One opened unit adopts ONE admission — the newest pending receipt. With
+     * several pending receipts (a prompt admitted but superseded before its
+     * unit ever opened), stamping all of them would attach this unit's outcome
+     * to foreign admission decisions; the older receipts stay pending instead.
+     */
+    adoptUnit(sessionID: string, unitID: string): Promise<number>;
+}

package/dist/state/receipts/store.js

@@ -0,0 +1,148 @@
+/**
+ * Bounded receipt store (ADP-030). Receipts live in a ring capped at
+ * `MAX_RECEIPTS` (newest kept, oldest evicted) and persist through the
+ * storage seam on every mutation. Ids are monotonic across restarts (they
+ * continue from the persisted maximum) so a receipt can always be told apart
+ * from its neighbors. Write failures propagate to the caller — the wiring
+ * layer's fail-open wrapper decides how to degrade (ADP-031) — and the
+ * in-memory ring is only advanced after a successful write, so memory and
+ * disk never diverge.
+ */
+import { boundDecision, boundText } from "./bound.js";
+import { parseReceiptsPayload } from "./parse.js";
+import { MAX_RECEIPTS, RECEIPTS_VERSION } from "./types.js";
+export class ReceiptStore {
+    storage;
+    #receipts = [];
+    #counter = 0;
+    #queue = Promise.resolve();
+    constructor(storage) {
+        this.storage = storage;
+    }
+    /** Rebuild from storage (restart behavior). A read failure yields an empty store. */
+    load() {
+        return this.#serialize(() => this.#load());
+    }
+    async #load() {
+        let raw;
+        try {
+            raw = await this.storage.read();
+        }
+        catch {
+            this.#receipts = [];
+            return;
+        }
+        const parsed = parseReceiptsPayload(raw);
+        this.#receipts = parsed;
+        this.#counter = parsed.reduce((max, receipt) => Math.max(max, receipt.id), 0);
+    }
+    /** All retained receipts, oldest → newest. */
+    snapshot() {
+        return this.#receipts;
+    }
+    record(input) {
+        return this.#serialize(() => this.#record(input));
+    }
+    async #record(input) {
+        // A receipt with no session can never be attributed to anything, and the
+        // read path drops empty identifiers — persisting one would make it vanish
+        // across a restart. Throw instead; the wiring layer fail-open-catches.
+        if (input.sessionID.trim() === "") {
+            throw new Error("invalid receipt: sessionID must be a non-empty string");
+        }
+        const id = this.#counter + 1;
+        const receipt = {
+            id,
+            at: input.at,
+            // Identifiers are bounded with the same bound the read path applies, so
+            // what is persisted is exactly what comes back (types.ts invariant).
+            sessionID: boundText(input.sessionID),
+            ...(input.unitID !== undefined ? { unitID: boundText(input.unitID) } : {}),
+            ...(input.tier !== undefined ? { tier: input.tier } : {}),
+            decision: boundDecision(input.decision),
+        };
+        const next = this.#receipts.length >= MAX_RECEIPTS
+            ? [...this.#receipts.slice(1 - MAX_RECEIPTS), receipt]
+            : [...this.#receipts, receipt];
+        // Persist BEFORE committing memory: a write failure must leave memory and
+        // disk consistent (the caller decides how to fail open).
+        await this.#persist(next);
+        this.#receipts = next;
+        this.#counter = id;
+        return receipt;
+    }
+    /**
+     * Attach a unit outcome to matching receipts that do not have one yet
+     * (first outcome wins). Returns how many receipts were updated; zero
+     * updates do not touch storage.
+     */
+    attachOutcome(ref, outcome) {
+        return this.#serialize(() => this.#attachOutcome(ref, outcome));
+    }
+    async #attachOutcome(ref, outcome) {
+        let updated = 0;
+        const next = this.#receipts.map((receipt) => {
+            if (receipt.outcome !== undefined)
+                return receipt;
+            if (receipt.sessionID !== ref.sessionID)
+                return receipt;
+            const matches = ref.unitID !== undefined ? receipt.unitID === ref.unitID : receipt.unitID === undefined;
+            if (!matches)
+                return receipt;
+            updated++;
+            return { ...receipt, outcome };
+        });
+        if (updated === 0)
+            return 0;
+        await this.#persist(next);
+        this.#receipts = next;
+        return updated;
+    }
+    /**
+     * Stamps the unit that just opened onto the session's pending unit-less
+     * admission receipts (recorded in the awaited prompt hook, before the unit
+     * existed). After adoption the receipt carries the unitID, so outcomes
+     * attach to it like any unit-scoped receipt.
+     *
+     * One opened unit adopts ONE admission — the newest pending receipt. With
+     * several pending receipts (a prompt admitted but superseded before its
+     * unit ever opened), stamping all of them would attach this unit's outcome
+     * to foreign admission decisions; the older receipts stay pending instead.
+     */
+    adoptUnit(sessionID, unitID) {
+        return this.#serialize(() => this.#adoptUnit(sessionID, unitID));
+    }
+    async #adoptUnit(sessionID, unitID) {
+        let target;
+        this.#receipts.forEach((receipt, index) => {
+            if (receipt.unitID !== undefined || receipt.outcome !== undefined)
+                return;
+            if (receipt.sessionID !== sessionID)
+                return;
+            target = index;
+        });
+        if (target === undefined)
+            return 0;
+        const at = target;
+        const next = this.#receipts.map((receipt, index) => index === at ? { ...receipt, unitID } : receipt);
+        await this.#persist(next);
+        this.#receipts = next;
+        return 1;
+    }
+    // Include reads in the chain so a reload cannot overwrite a newer commit.
+    // A failed write rejects its caller without blocking subsequent operations.
+    #serialize(operation) {
+        const run = this.#queue.then(operation);
+        this.#queue = run.catch(() => undefined);
+        return run;
+    }
+    /** Writes the given next state; the caller commits memory only on success. */
+    async #persist(receipts) {
+        const payload = {
+            version: RECEIPTS_VERSION,
+            receipts,
+        };
+        await this.storage.write(payload);
+    }
+}
+//# sourceMappingURL=store.js.map

package/dist/state/receipts/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../../src/state/receipts/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,YAAY,CAAA;AACrD,OAAO,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAA;AACjD,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AAe3D,MAAM,OAAO,YAAY;IAKM;IAJ7B,SAAS,GAAc,EAAE,CAAA;IACzB,QAAQ,GAAG,CAAC,CAAA;IACZ,MAAM,GAAqB,OAAO,CAAC,OAAO,EAAE,CAAA;IAE5C,YAA6B,OAAwB;QAAxB,YAAO,GAAP,OAAO,CAAiB;IAAG,CAAC;IAEzD,qFAAqF;IACrF,IAAI;QACF,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAA;IAC5C,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,GAAY,CAAA;QAChB,IAAI,CAAC;YACH,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAA;QACjC,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC,SAAS,GAAG,EAAE,CAAA;YACnB,OAAM;QACR,CAAC;QACD,MAAM,MAAM,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAA;QACxC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAA;QACvB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/E,CAAC;IAED,8CAA8C;IAC9C,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED,MAAM,CAAC,KAAmB;QACxB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;IACnD,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,KAAmB;QAC/B,yEAAyE;QACzE,0EAA0E;QAC1E,uEAAuE;QACvE,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,uDAAuD,CAAC,CAAA;QAC1E,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;QAC5B,MAAM,OAAO,GAAY;YACvB,EAAE;YACF,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,wEAAwE;YACxE,qEAAqE;YACrE,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC;YACrC,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1E,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzD,QAAQ,EAAE,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC;SACxC,CAAA;QACD,MAAM,IAAI,GACR,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,YAAY;YACnC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,YAAY,CAAC,EAAE,OAAO,CAAC;YACtD,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;QAClC,0EAA0E;QAC1E,yDAAyD;QACzD,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACzB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;QACrB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,GAAe,EAAE,OAAuB;QACpD,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAA;IACjE,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,GAAe,EAAE,OAAuB;QAC3D,IAAI,OAAO,GAAG,CAAC,CAAA;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;YAC1C,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS;gBAAE,OAAO,OAAO,CAAA;YACjD,IAAI,OAAO,CAAC,SAAS,KAAK,GAAG,CAAC,SAAS;gBAAE,OAAO,OAAO,CAAA;YACvD,MAAM,OAAO,GACX,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,CAAA;YACzF,IAAI,CAAC,OAAO;gBAAE,OAAO,OAAO,CAAA;YAC5B,OAAO,EAAE,CAAA;YACT,OAAO,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,CAAA;QAChC,CAAC,CAAC,CAAA;QACF,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,CAAC,CAAA;QAC3B,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACzB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;QACrB,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,SAAS,CAAC,SAAiB,EAAE,MAAc;QACzC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAA;IAClE,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,SAAiB,EAAE,MAAc;QAChD,IAAI,MAA0B,CAAA;QAC9B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;YACxC,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS;gBAAE,OAAM;YACzE,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;gBAAE,OAAM;YAC3C,MAAM,GAAG,KAAK,CAAA;QAChB,CAAC,CAAC,CAAA;QACF,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,CAAC,CAAA;QAClC,MAAM,EAAE,GAAG,MAAM,CAAA;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CACjD,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,OAAO,CAChD,CAAA;QACD,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACzB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;QACrB,OAAO,CAAC,CAAA;IACV,CAAC;IAED,0EAA0E;IAC1E,4EAA4E;IAC5E,UAAU,CAAI,SAA2B;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACvC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAA;QACxC,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,8EAA8E;IAC9E,KAAK,CAAC,QAAQ,CAAC,QAA4B;QACzC,MAAM,OAAO,GAAoB;YAC/B,OAAO,EAAE,gBAAgB;YACzB,QAAQ;SACT,CAAA;QACD,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IACnC,CAAC;CACF","sourcesContent":["/**\n * Bounded receipt store (ADP-030). Receipts live in a ring capped at\n * `MAX_RECEIPTS` (newest kept, oldest evicted) and persist through the\n * storage seam on every mutation. Ids are monotonic across restarts (they\n * continue from the persisted maximum) so a receipt can always be told apart\n * from its neighbors. Write failures propagate to the caller — the wiring\n * layer's fail-open wrapper decides how to degrade (ADP-031) — and the\n * in-memory ring is only advanced after a successful write, so memory and\n * disk never diverge.\n */\nimport { boundDecision, boundText } from \"./bound.js\"\nimport { parseReceiptsPayload } from \"./parse.js\"\nimport { MAX_RECEIPTS, RECEIPTS_VERSION } from \"./types.js\"\nimport type {\n  Receipt,\n  ReceiptInput,\n  ReceiptOutcome,\n  ReceiptsPayload,\n  ReceiptsStorage,\n} from \"./types.js\"\n\nexport interface ReceiptRef {\n  readonly sessionID: string\n  /** When given, only receipts of that unit are updated; otherwise only receipts without a unit. */\n  readonly unitID?: string | undefined\n}\n\nexport class ReceiptStore {\n  #receipts: Receipt[] = []\n  #counter = 0\n  #queue: Promise<unknown> = Promise.resolve()\n\n  constructor(private readonly storage: ReceiptsStorage) {}\n\n  /** Rebuild from storage (restart behavior). A read failure yields an empty store. */\n  load(): Promise<void> {\n    return this.#serialize(() => this.#load())\n  }\n\n  async #load(): Promise<void> {\n    let raw: unknown\n    try {\n      raw = await this.storage.read()\n    } catch {\n      this.#receipts = []\n      return\n    }\n    const parsed = parseReceiptsPayload(raw)\n    this.#receipts = parsed\n    this.#counter = parsed.reduce((max, receipt) => Math.max(max, receipt.id), 0)\n  }\n\n  /** All retained receipts, oldest → newest. */\n  snapshot(): readonly Receipt[] {\n    return this.#receipts\n  }\n\n  record(input: ReceiptInput): Promise<Receipt> {\n    return this.#serialize(() => this.#record(input))\n  }\n\n  async #record(input: ReceiptInput): Promise<Receipt> {\n    // A receipt with no session can never be attributed to anything, and the\n    // read path drops empty identifiers — persisting one would make it vanish\n    // across a restart. Throw instead; the wiring layer fail-open-catches.\n    if (input.sessionID.trim() === \"\") {\n      throw new Error(\"invalid receipt: sessionID must be a non-empty string\")\n    }\n    const id = this.#counter + 1\n    const receipt: Receipt = {\n      id,\n      at: input.at,\n      // Identifiers are bounded with the same bound the read path applies, so\n      // what is persisted is exactly what comes back (types.ts invariant).\n      sessionID: boundText(input.sessionID),\n      ...(input.unitID !== undefined ? { unitID: boundText(input.unitID) } : {}),\n      ...(input.tier !== undefined ? { tier: input.tier } : {}),\n      decision: boundDecision(input.decision),\n    }\n    const next =\n      this.#receipts.length >= MAX_RECEIPTS\n        ? [...this.#receipts.slice(1 - MAX_RECEIPTS), receipt]\n        : [...this.#receipts, receipt]\n    // Persist BEFORE committing memory: a write failure must leave memory and\n    // disk consistent (the caller decides how to fail open).\n    await this.#persist(next)\n    this.#receipts = next\n    this.#counter = id\n    return receipt\n  }\n\n  /**\n   * Attach a unit outcome to matching receipts that do not have one yet\n   * (first outcome wins). Returns how many receipts were updated; zero\n   * updates do not touch storage.\n   */\n  attachOutcome(ref: ReceiptRef, outcome: ReceiptOutcome): Promise<number> {\n    return this.#serialize(() => this.#attachOutcome(ref, outcome))\n  }\n\n  async #attachOutcome(ref: ReceiptRef, outcome: ReceiptOutcome): Promise<number> {\n    let updated = 0\n    const next = this.#receipts.map((receipt) => {\n      if (receipt.outcome !== undefined) return receipt\n      if (receipt.sessionID !== ref.sessionID) return receipt\n      const matches =\n        ref.unitID !== undefined ? receipt.unitID === ref.unitID : receipt.unitID === undefined\n      if (!matches) return receipt\n      updated++\n      return { ...receipt, outcome }\n    })\n    if (updated === 0) return 0\n    await this.#persist(next)\n    this.#receipts = next\n    return updated\n  }\n\n  /**\n   * Stamps the unit that just opened onto the session's pending unit-less\n   * admission receipts (recorded in the awaited prompt hook, before the unit\n   * existed). After adoption the receipt carries the unitID, so outcomes\n   * attach to it like any unit-scoped receipt.\n   *\n   * One opened unit adopts ONE admission — the newest pending receipt. With\n   * several pending receipts (a prompt admitted but superseded before its\n   * unit ever opened), stamping all of them would attach this unit's outcome\n   * to foreign admission decisions; the older receipts stay pending instead.\n   */\n  adoptUnit(sessionID: string, unitID: string): Promise<number> {\n    return this.#serialize(() => this.#adoptUnit(sessionID, unitID))\n  }\n\n  async #adoptUnit(sessionID: string, unitID: string): Promise<number> {\n    let target: number | undefined\n    this.#receipts.forEach((receipt, index) => {\n      if (receipt.unitID !== undefined || receipt.outcome !== undefined) return\n      if (receipt.sessionID !== sessionID) return\n      target = index\n    })\n    if (target === undefined) return 0\n    const at = target\n    const next = this.#receipts.map((receipt, index) =>\n      index === at ? { ...receipt, unitID } : receipt,\n    )\n    await this.#persist(next)\n    this.#receipts = next\n    return 1\n  }\n\n  // Include reads in the chain so a reload cannot overwrite a newer commit.\n  // A failed write rejects its caller without blocking subsequent operations.\n  #serialize<T>(operation: () => Promise<T>): Promise<T> {\n    const run = this.#queue.then(operation)\n    this.#queue = run.catch(() => undefined)\n    return run\n  }\n\n  /** Writes the given next state; the caller commits memory only on success. */\n  async #persist(receipts: readonly Receipt[]): Promise<void> {\n    const payload: ReceiptsPayload = {\n      version: RECEIPTS_VERSION,\n      receipts,\n    }\n    await this.storage.write(payload)\n  }\n}\n"]}

package/dist/state/receipts/types.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Decision receipts (ADP-030): small bounded local records explaining why
+ * Adaptive made each decision. Receipts exist for explainability, debugging,
+ * tests, and a future outcome-learning policy — never injected into prompts,
+ * never leaving the machine. Retention is bounded (oldest evicted).
+ */
+import type { Decision } from "../../core/scheduler/types.js";
+import type { TierName } from "../../core/tier-policy/types.js";
+import type { InterruptReason } from "../../core/work-unit/interruption.js";
+import type { FailureCategory } from "../../health/classifier/types.js";
+export declare const RECEIPTS_KEY = "coool.adaptive/receipts";
+export declare const RECEIPTS_VERSION = 1;
+/** Product bound — not a user knob. The ring keeps the newest receipts. */
+export declare const MAX_RECEIPTS = 200;
+/**
+ * Every free-text string stored in a receipt is truncated to this bound
+ * before persisting (and re-truncated on read). Boundedness is the
+ * no-secrets invariant: prompts, error bodies, and credentials have no
+ * field to live in and no room to hide in.
+ */
+export declare const MAX_RECEIPT_TEXT = 128;
+export interface ReceiptMeta {
+    /** Decision timestamp (adapter clock, ms epoch). */
+    readonly at: number;
+    readonly sessionID: string;
+    readonly unitID?: string | undefined;
+    /** Required tier when routing named one (pins carry no tier). */
+    readonly tier?: TierName | undefined;
+}
+export interface ReceiptInput extends ReceiptMeta {
+    /** The decision exactly as the scheduler/mode wrapper produced it. */
+    readonly decision: Decision;
+}
+/**
+ * Unit outcome attached after termination. Structured vocabulary only —
+ * never the raw error text (ADP-030: no secrets, bounded records).
+ */
+export type ReceiptOutcome = {
+    readonly status: "succeeded";
+} | {
+    readonly status: "failed";
+    readonly category: FailureCategory;
+} | {
+    readonly status: "interrupted";
+    readonly reason: InterruptReason;
+};
+export interface Receipt extends ReceiptMeta {
+    /** Monotonic id assigned by the store; continues across restarts. */
+    readonly id: number;
+    readonly decision: Decision;
+    readonly outcome?: ReceiptOutcome;
+}
+export interface ReceiptsPayload {
+    readonly version: typeof RECEIPTS_VERSION;
+    readonly receipts: readonly Receipt[];
+}
+/** Storage seam — the adapter binds `RECEIPTS_KEY` to `ctx.storage`. */
+export interface ReceiptsStorage {
+    read(): Promise<unknown>;
+    write(payload: ReceiptsPayload): Promise<void>;
+}