@remnic/core 1.0.3 → 1.1.1

package/dist/chunk-C4SQJZAF.js

@@ -0,0 +1,486 @@
+import {
+  extractJsonCandidates
+} from "./chunk-UZB5KHKX.js";
+import {
+  normalizeProcedureSteps
+} from "./chunk-QDW3E4RD.js";
+import {
+  log
+} from "./chunk-2ODBA7MQ.js";
+
+// src/extraction-judge.ts
+import { createHash } from "crypto";
+function getVerdictKind(verdict) {
+  const raw = verdict.kind;
+  if (raw === "accept" || raw === "reject" || raw === "defer") {
+    return raw;
+  }
+  return verdict.durable ? "accept" : "reject";
+}
+function isDurableVerdict(verdict) {
+  return getVerdictKind(verdict) === "accept";
+}
+function isValidCachedVerdict(value) {
+  if (typeof value !== "object" || value === null) return false;
+  const v = value;
+  if (typeof v.durable !== "boolean") return false;
+  if (typeof v.reason !== "string") return false;
+  if (v.kind !== void 0) {
+    if (v.kind !== "accept" && v.kind !== "reject" && v.kind !== "defer") {
+      return false;
+    }
+  }
+  return true;
+}
+function normalizeCachedVerdict(value) {
+  if (typeof value !== "object" || value === null) return null;
+  const v = value;
+  if (typeof v.durable !== "boolean") return null;
+  if (typeof v.reason !== "string") return null;
+  let kind;
+  if (v.kind !== void 0) {
+    if (typeof v.kind !== "string") return null;
+    if (v.kind === "accept" || v.kind === "reject" || v.kind === "defer") {
+      kind = v.kind;
+    }
+  }
+  const out = { durable: v.durable, reason: v.reason };
+  if (kind !== void 0) out.kind = kind;
+  return out;
+}
+var JUDGE_SYSTEM_PROMPT = `You are a memory curator evaluating whether extracted facts are **durable** \u2014 worth storing for long-term recall across sessions.
+
+A fact is **durable** if it will still be useful 30+ days from now and is relevant across multiple sessions, not just the current task.
+
+Return one of three verdicts per candidate:
+
+ACCEPT \u2014 the fact is durable, persist it:
+- Personal preferences, identities, or relationships
+- Decisions with rationale that affect future work
+- Corrections to previously held beliefs
+- Principles, rules, or constraints the user wants respected
+- Stable facts about projects, tools, or workflows
+- Commitments, deadlines, or obligations
+
+REJECT \u2014 the fact is not durable, drop it:
+- Transient task details ("currently debugging line 42")
+- Ephemeral state ("the build is running now")
+- Routine operations ("ran npm install")
+- Conversational filler or acknowledgements
+- Information that will be stale within hours
+- Step-by-step instructions for a one-time task
+
+DEFER \u2014 the fact MIGHT be durable but needs more context to decide. The candidate will be re-evaluated on a later extraction pass with fresh context; if it cannot be resolved within a small number of re-evaluations it will be rejected.
+- Ambiguous referents ("he said they'd follow up on it")
+- Partial or in-progress statements that might become durable once completed
+- Future-tense commitments whose subject or timeline is unclear
+- Facts whose durability hinges on context not present in the candidate text
+
+Do NOT use defer as a soft reject. Reject facts you are confident are transient. Only defer when another turn of context would genuinely change the verdict.
+
+Return a JSON array of objects with these fields:
+- index: number (the candidate index)
+- kind: string \u2014 one of "accept", "reject", "defer"
+- reason: string (brief explanation, under 80 characters)
+
+You may also include durable (boolean) for backwards compatibility: true for accept, false for reject or defer. If kind is omitted, durable determines the verdict.
+
+Rules:
+1. Return exactly one verdict per input candidate, matched by index.
+2. When in doubt between accept and reject, lean toward accept \u2014 false negatives (losing a useful fact) are worse than false positives (keeping a marginal one).
+3. Use defer only when another turn of context would genuinely change the verdict.
+4. Output valid JSON only. No markdown fences, no commentary.
+
+Example output:
+[{"index": 0, "kind": "accept", "durable": true, "reason": "Stable personal preference"}, {"index": 1, "kind": "reject", "durable": false, "reason": "Ephemeral build status"}, {"index": 2, "kind": "defer", "durable": false, "reason": "Ambiguous pronoun"}]`;
+var VERDICT_CACHE_MAX_SIZE = 1e4;
+var defaultVerdictCache = /* @__PURE__ */ new Map();
+var defaultDeferCounts = /* @__PURE__ */ new Map();
+var DEFER_COUNT_MAX_SIZE = 2e4;
+function cacheKey(text, category) {
+  return createHash("sha256").update(`${text}\0${category}`).digest("hex");
+}
+function resolveDeferCap(config) {
+  const raw = config.extractionJudgeMaxDeferrals;
+  if (typeof raw === "number" && Number.isFinite(raw) && raw >= 1) {
+    return Math.floor(raw);
+  }
+  return 2;
+}
+function enforceMaxCacheSize(cache) {
+  if (cache.size <= VERDICT_CACHE_MAX_SIZE) return;
+  const deleteCount = Math.floor(cache.size / 2);
+  let deleted = 0;
+  for (const key of cache.keys()) {
+    if (deleted >= deleteCount) break;
+    cache.delete(key);
+    deleted++;
+  }
+}
+var AUTO_APPROVE_CATEGORIES = /* @__PURE__ */ new Set(["correction", "principle"]);
+var PROCEDURE_TRIGGER_RE = /(when you|whenever|before you|before running|always\s|first\b.*\bthen|to deploy|to ship|run these steps|follow these steps|how (i|we)\s|recipe for|workflow|each time you)/i;
+function validateProcedureExtraction(input) {
+  const steps = normalizeProcedureSteps(input.procedureSteps);
+  if (steps.length < 2) {
+    return { durable: false, reason: "Procedure requires at least two steps with intents" };
+  }
+  const combined = [input.content, ...steps.map((s) => s.intent)].join(" ").toLowerCase();
+  if (!PROCEDURE_TRIGGER_RE.test(combined)) {
+    return { durable: false, reason: "Procedure missing explicit trigger phrasing" };
+  }
+  return { durable: true, reason: "Procedure structure validated" };
+}
+async function judgeFactDurability(candidates, config, localLlm, fallbackLlm, cache, deferCounts, onVerdict) {
+  const startMs = Date.now();
+  const verdicts = /* @__PURE__ */ new Map();
+  let cached = 0;
+  let judged = 0;
+  let deferred = 0;
+  let deferredCappedToReject = 0;
+  const verdictCache = cache ?? defaultVerdictCache;
+  const deferCountMap = deferCounts ?? defaultDeferCounts;
+  const deferCap = resolveDeferCap(config);
+  const emit = (build) => {
+    if (!onVerdict) return;
+    let observation;
+    try {
+      observation = build();
+    } catch (err) {
+      log.debug(
+        `extraction-judge: onVerdict builder threw (non-fatal): ${err instanceof Error ? err.message : String(err)}`
+      );
+      return;
+    }
+    try {
+      onVerdict(observation);
+    } catch (err) {
+      log.debug(
+        `extraction-judge: onVerdict callback threw (non-fatal): ${err instanceof Error ? err.message : String(err)}`
+      );
+    }
+  };
+  if (candidates.length === 0) {
+    return {
+      verdicts,
+      cached,
+      judged,
+      elapsed: 0,
+      deferred,
+      deferredCappedToReject
+    };
+  }
+  const pendingIndices = [];
+  for (let i = 0; i < candidates.length; i++) {
+    const c = candidates[i];
+    if (AUTO_APPROVE_CATEGORIES.has(c.category)) {
+      const v = {
+        durable: true,
+        reason: `Auto-approved: ${c.category} category bypasses judge`
+      };
+      verdicts.set(i, v);
+      emit(() => ({
+        verdict: v,
+        candidate: c,
+        contentHash: cacheKey(c.text, c.category),
+        source: "auto-approve",
+        priorDeferrals: 0,
+        elapsedMs: Date.now() - startMs
+      }));
+      continue;
+    }
+    if (c.importanceLevel === "critical") {
+      const v = {
+        durable: true,
+        reason: "Auto-approved: critical importance"
+      };
+      verdicts.set(i, v);
+      emit(() => ({
+        verdict: v,
+        candidate: c,
+        contentHash: cacheKey(c.text, c.category),
+        source: "auto-approve",
+        priorDeferrals: 0,
+        elapsedMs: Date.now() - startMs
+      }));
+      continue;
+    }
+    const key = cacheKey(c.text, c.category);
+    const cachedVerdict = verdictCache.get(key);
+    if (cachedVerdict) {
+      verdicts.set(i, cachedVerdict);
+      cached++;
+      emit(() => ({
+        verdict: cachedVerdict,
+        candidate: c,
+        contentHash: key,
+        source: "cache",
+        priorDeferrals: deferCountMap.get(key) ?? 0,
+        elapsedMs: Date.now() - startMs
+      }));
+      continue;
+    }
+    pendingIndices.push(i);
+  }
+  if (pendingIndices.length === 0) {
+    return {
+      verdicts,
+      cached,
+      judged,
+      elapsed: Date.now() - startMs,
+      deferred,
+      deferredCappedToReject
+    };
+  }
+  const batchSize = config.extractionJudgeBatchSize;
+  for (let batchStart = 0; batchStart < pendingIndices.length; batchStart += batchSize) {
+    const batchIndices = pendingIndices.slice(batchStart, batchStart + batchSize);
+    const batchPayload = batchIndices.map((idx) => ({
+      index: idx,
+      text: candidates[idx].text,
+      category: candidates[idx].category,
+      confidence: candidates[idx].confidence
+    }));
+    const userPrompt = JSON.stringify(batchPayload);
+    try {
+      const llmResponse = await callJudgeLlm(
+        userPrompt,
+        config,
+        localLlm,
+        fallbackLlm
+      );
+      if (llmResponse) {
+        const parsed = parseJudgeResponse(llmResponse, batchIndices);
+        const deferredThisBatch = /* @__PURE__ */ new Set();
+        for (const [idx, rawVerdict] of parsed.entries()) {
+          const c = candidates[idx];
+          const key = cacheKey(c.text, c.category);
+          let verdict = rawVerdict;
+          let source = "llm";
+          const priorDefers = deferCountMap.get(key) ?? 0;
+          if (getVerdictKind(verdict) === "defer") {
+            if (priorDefers >= deferCap) {
+              verdict = {
+                durable: false,
+                reason: `Defer cap reached (${deferCap} prior defers); rejecting`,
+                kind: "reject"
+              };
+              source = "llm-cap-rejected";
+              if (!deferredThisBatch.has(key)) {
+                deferCountMap.delete(key);
+                deferredCappedToReject++;
+                deferredThisBatch.add(key);
+              }
+            } else if (!deferredThisBatch.has(key)) {
+              deferCountMap.set(key, priorDefers + 1);
+              deferred++;
+              deferredThisBatch.add(key);
+              if (deferCountMap.size > DEFER_COUNT_MAX_SIZE) {
+                const drop = Math.floor(deferCountMap.size / 2);
+                let dropped = 0;
+                for (const k of deferCountMap.keys()) {
+                  if (dropped >= drop) break;
+                  deferCountMap.delete(k);
+                  dropped++;
+                }
+              }
+            }
+          } else {
+            deferCountMap.delete(key);
+          }
+          verdicts.set(idx, verdict);
+          judged++;
+          if (getVerdictKind(verdict) !== "defer") {
+            verdictCache.set(key, verdict);
+          }
+          emit(() => ({
+            verdict,
+            candidate: c,
+            contentHash: key,
+            source,
+            priorDeferrals: priorDefers,
+            elapsedMs: Date.now() - startMs
+          }));
+        }
+        enforceMaxCacheSize(verdictCache);
+      }
+    } catch (err) {
+      log.warn(
+        `extraction-judge: LLM call failed, approving batch (fail-open): ${err instanceof Error ? err.message : String(err)}`
+      );
+    }
+    for (const idx of batchIndices) {
+      if (!verdicts.has(idx)) {
+        const c = candidates[idx];
+        const hash = cacheKey(c.text, c.category);
+        const priorDefers = deferCountMap.get(hash) ?? 0;
+        deferCountMap.delete(hash);
+        const v = {
+          durable: true,
+          reason: "Approved by default (judge unavailable or parse error)"
+        };
+        verdicts.set(idx, v);
+        emit(() => {
+          return {
+            verdict: v,
+            candidate: c,
+            contentHash: hash,
+            source: "fail-open",
+            priorDeferrals: priorDefers,
+            elapsedMs: Date.now() - startMs
+          };
+        });
+      }
+    }
+  }
+  return {
+    verdicts,
+    cached,
+    judged,
+    elapsed: Date.now() - startMs,
+    deferred,
+    deferredCappedToReject
+  };
+}
+async function callJudgeLlm(userPrompt, config, localLlm, fallbackLlm) {
+  const messages = [
+    { role: "system", content: JUDGE_SYSTEM_PROMPT },
+    { role: "user", content: userPrompt }
+  ];
+  const modelOverride = config.extractionJudgeModel || void 0;
+  const skipLocal = config.modelSource === "gateway";
+  const agentId = config.modelSource === "gateway" ? config.gatewayAgentId || void 0 : void 0;
+  if (localLlm && !skipLocal) {
+    try {
+      const result = await localLlm.chatCompletion(messages, {
+        temperature: 0.1,
+        maxTokens: 2048,
+        responseFormat: { type: "json_object" },
+        timeoutMs: 1500,
+        operation: "extraction-judge",
+        ...modelOverride ? { model: modelOverride } : {}
+      });
+      if (result?.content) {
+        return result.content;
+      }
+    } catch (err) {
+      log.debug(
+        `extraction-judge: local LLM failed, trying fallback: ${err instanceof Error ? err.message : String(err)}`
+      );
+    }
+  }
+  if (fallbackLlm) {
+    try {
+      const result = await fallbackLlm.chatCompletion(
+        messages,
+        {
+          temperature: 0.1,
+          maxTokens: 2048,
+          timeoutMs: 1500,
+          ...modelOverride ? { model: modelOverride } : {},
+          ...agentId ? { agentId } : {}
+        }
+      );
+      if (result?.content) {
+        return result.content;
+      }
+    } catch (err) {
+      log.debug(
+        `extraction-judge: fallback LLM failed: ${err instanceof Error ? err.message : String(err)}`
+      );
+    }
+  }
+  return null;
+}
+function parseJudgeResponse(raw, expectedIndices) {
+  const result = /* @__PURE__ */ new Map();
+  const expectedSet = new Set(expectedIndices);
+  try {
+    let parsed;
+    try {
+      parsed = JSON.parse(raw);
+    } catch {
+      const candidates = extractJsonCandidates(raw);
+      if (candidates.length > 0) {
+        parsed = JSON.parse(candidates[0]);
+      }
+    }
+    if (!Array.isArray(parsed)) {
+      if (parsed && typeof parsed === "object" && !Array.isArray(parsed)) {
+        const values = Object.values(parsed);
+        for (const v of values) {
+          if (Array.isArray(v)) {
+            parsed = v;
+            break;
+          }
+        }
+      }
+      if (!Array.isArray(parsed)) {
+        log.debug("extraction-judge: response is not an array, cannot parse");
+        return result;
+      }
+    }
+    for (const item of parsed) {
+      if (typeof item !== "object" || item === null || typeof item.index !== "number") {
+        continue;
+      }
+      const idx = item.index;
+      if (!expectedSet.has(idx)) continue;
+      let kind;
+      const rawKind = item.kind;
+      const rawAction = item.action;
+      if (rawKind === "accept" || rawKind === "reject" || rawKind === "defer") {
+        kind = rawKind;
+      } else if (rawAction === "accept" || rawAction === "reject" || rawAction === "defer") {
+        kind = rawAction;
+      }
+      const hasDurable = typeof item.durable === "boolean";
+      const durableFromModel = hasDurable ? item.durable : void 0;
+      let durable;
+      if (kind === "accept") {
+        durable = true;
+      } else if (kind === "reject" || kind === "defer") {
+        durable = false;
+      } else if (durableFromModel !== void 0) {
+        durable = durableFromModel;
+      } else {
+        durable = true;
+      }
+      const reason = typeof item.reason === "string" ? item.reason.slice(0, 120) : "No reason provided";
+      const verdict = { durable, reason };
+      if (kind !== void 0) verdict.kind = kind;
+      result.set(idx, verdict);
+    }
+  } catch (err) {
+    log.debug(
+      `extraction-judge: failed to parse response: ${err instanceof Error ? err.message : String(err)}`
+    );
+  }
+  return result;
+}
+function clearVerdictCache() {
+  defaultVerdictCache.clear();
+  defaultDeferCounts.clear();
+}
+function verdictCacheSize() {
+  return defaultVerdictCache.size;
+}
+function createVerdictCache() {
+  return /* @__PURE__ */ new Map();
+}
+function createDeferCountMap() {
+  return /* @__PURE__ */ new Map();
+}
+
+export {
+  getVerdictKind,
+  isDurableVerdict,
+  isValidCachedVerdict,
+  normalizeCachedVerdict,
+  validateProcedureExtraction,
+  judgeFactDurability,
+  clearVerdictCache,
+  verdictCacheSize,
+  createVerdictCache,
+  createDeferCountMap
+};
+//# sourceMappingURL=chunk-C4SQJZAF.js.map

package/dist/chunk-C4SQJZAF.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/extraction-judge.ts"],"sourcesContent":["/**\n * Extraction Judge — LLM-as-judge fact-worthiness gate (issue #376).\n *\n * Evaluates extracted facts against a durability rubric before they are\n * persisted. Facts that are unlikely to be useful 30+ days from now or\n * across sessions are rejected (or shadow-logged depending on config).\n *\n * Design constraints:\n *   - Corrections and principles are auto-approved (safety bypass).\n *   - Critical-importance facts are auto-approved.\n *   - Batches respect extractionJudgeBatchSize.\n *   - Content-hash caching avoids redundant LLM calls.\n *   - Performance budget: <= 1.5s per batch.\n */\n\nimport { createHash } from \"node:crypto\";\nimport { log } from \"./logger.js\";\nimport type { PluginConfig, ImportanceLevel } from \"./types.js\";\nimport type { LocalLlmClient } from \"./local-llm.js\";\nimport type { FallbackLlmClient } from \"./fallback-llm.js\";\nimport { extractJsonCandidates } from \"./json-extract.js\";\nimport { normalizeProcedureSteps } from \"./procedural/procedure-types.js\";\n\n// ---------------------------------------------------------------------------\n// Public interfaces\n// ---------------------------------------------------------------------------\n\nexport interface JudgeCandidate {\n  text: string;\n  category: string;\n  confidence: number;\n  tags?: string[];\n  /** Local importance level, set by caller before judging. */\n  importanceLevel?: ImportanceLevel;\n}\n\n/**\n * Verdict kinds (issue #562, PR 1).\n *\n * - `\"accept\"`: fact is durable, persist it.\n * - `\"reject\"`: fact is not durable, drop it.\n * - `\"defer\"`: fact is ambiguous; push it back into the buffer for another\n *   pass with fresh context. Inspired by MemReader (arxiv 2604.07877).\n *\n * PR 1 only introduces the type. No emit path produces `\"defer\"` yet — the\n * defer-capable prompt, buffer re-routing, telemetry, and GRPO data\n * collection are landing in PRs 2, 3, and 4 respectively.\n */\nexport type JudgeVerdictKind = \"accept\" | \"reject\" | \"defer\";\n\n/**\n * Judge verdict shape.\n *\n * Back-compat note: `kind` is optional. Verdicts serialized before PR 1\n * (both in-memory cache entries and any persisted caches) only carry\n * `{ durable, reason }`. Downstream consumers must either read `durable`\n * directly, or use {@link getVerdictKind} / {@link isDurableVerdict} which\n * gracefully fall back to the boolean when `kind` is missing, and ignore\n * unknown future `kind` values rather than crashing.\n */\nexport interface JudgeVerdict {\n  /**\n   * True iff the fact should be persisted. For `\"defer\"` verdicts this is\n   * `false` — a deferred fact is not (yet) persisted, so callers that only\n   * look at `durable` will treat defer as \"skip this turn\", which matches\n   * the pre-PR-1 fail-closed behavior for non-accepted verdicts.\n   */\n  durable: boolean;\n  reason: string;\n  /**\n   * Optional explicit verdict kind. Added in PR 1 of issue #562. Legacy\n   * verdicts (including cache entries produced before this field existed)\n   * do not set `kind`; use {@link getVerdictKind} to read this safely.\n   */\n  kind?: JudgeVerdictKind;\n}\n\n/**\n * Resolve a verdict's effective kind.\n *\n * - If `kind` is explicitly set to one of the known values, return it.\n * - If `kind` is absent, infer from `durable` (back-compat with pre-PR-1\n *   cache entries and emit paths that have not been updated yet).\n * - If `kind` is set to an unrecognised value (forward-compat, e.g. a\n *   future cache entry loaded by an older build), fall back to `durable`\n *   so we never crash on unknown strings.\n */\nexport function getVerdictKind(verdict: JudgeVerdict): JudgeVerdictKind {\n  const raw = verdict.kind;\n  if (raw === \"accept\" || raw === \"reject\" || raw === \"defer\") {\n    return raw;\n  }\n  return verdict.durable ? \"accept\" : \"reject\";\n}\n\n/**\n * Type guard: returns `true` only for verdicts that should be persisted.\n * Treats both `\"reject\"` and `\"defer\"` as \"not durable\" — defer means the\n * caller should re-evaluate later, not write now.\n */\nexport function isDurableVerdict(verdict: JudgeVerdict): boolean {\n  return getVerdictKind(verdict) === \"accept\";\n}\n\n/**\n * Validate a cache entry loaded from persistence / another process.\n *\n * Strict: accepts legacy `{ durable, reason }` entries and new entries\n * whose `kind` is one of the three known `JudgeVerdictKind` values.\n * Rejects structurally wrong types and unknown `kind` strings so the\n * type-guard narrowing is sound — callers that receive\n * `value is JudgeVerdict` can safely treat `kind` as the declared\n * union.\n *\n * Forward-compat is handled by {@link normalizeCachedVerdict}, which\n * drops unknown `kind` strings before validation so a newer build's\n * cache entry still loads instead of being rejected.\n */\nexport function isValidCachedVerdict(value: unknown): value is JudgeVerdict {\n  if (typeof value !== \"object\" || value === null) return false;\n  const v = value as Record<string, unknown>;\n  if (typeof v.durable !== \"boolean\") return false;\n  if (typeof v.reason !== \"string\") return false;\n  if (v.kind !== undefined) {\n    if (v.kind !== \"accept\" && v.kind !== \"reject\" && v.kind !== \"defer\") {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Forward-compatible cache-entry loader.\n *\n * Drops unknown `kind` strings to `undefined` (so `getVerdictKind` can\n * fall back to `durable`), then validates structurally. Non-string\n * `kind` values are still treated as structural violations and rejected.\n * Returns the sanitised verdict, or `null` when the entry is structurally\n * unusable.\n */\nexport function normalizeCachedVerdict(value: unknown): JudgeVerdict | null {\n  if (typeof value !== \"object\" || value === null) return null;\n  const v = value as Record<string, unknown>;\n  if (typeof v.durable !== \"boolean\") return null;\n  if (typeof v.reason !== \"string\") return null;\n  let kind: JudgeVerdictKind | undefined;\n  if (v.kind !== undefined) {\n    if (typeof v.kind !== \"string\") return null;\n    if (v.kind === \"accept\" || v.kind === \"reject\" || v.kind === \"defer\") {\n      kind = v.kind;\n    }\n    // Unknown string `kind`: dropped to undefined for forward-compat.\n  }\n  const out: JudgeVerdict = { durable: v.durable, reason: v.reason };\n  if (kind !== undefined) out.kind = kind;\n  return out;\n}\n\nexport interface JudgeBatchResult {\n  verdicts: Map<number, JudgeVerdict>;\n  /** Number of verdicts served from cache. */\n  cached: number;\n  /** Number of verdicts produced by an LLM call. */\n  judged: number;\n  /** Total wall-clock time in milliseconds. */\n  elapsed: number;\n  /**\n   * Number of verdicts in this batch that resolved to `\"defer\"` (issue #562,\n   * PR 2). Callers can use this to decide whether to retain buffer turns for\n   * the next extraction pass.\n   */\n  deferred: number;\n  /**\n   * Number of defers that were forcibly converted to `\"reject\"` because the\n   * same candidate text had already been deferred at least\n   * `extractionJudgeMaxDeferrals` times. Rolled out of `deferred` — a\n   * candidate counted here is *not* also in `deferred`.\n   */\n  deferredCappedToReject: number;\n}\n\n/**\n * Per-verdict observation emitted by `judgeFactDurability` when an\n * `onVerdict` callback is supplied (issue #562, PR 3). Used to wire the\n * observation ledger / telemetry stream without coupling the judge module\n * directly to filesystem I/O. One event is emitted for every resolved\n * verdict, including auto-approved and cache-hit paths.\n */\nexport interface JudgeVerdictObservation {\n  verdict: JudgeVerdict;\n  /** The original `JudgeCandidate` passed in (same reference). */\n  candidate: JudgeCandidate;\n  /** SHA-256 of `text\\0category`, same key the cache/deferCounter use. */\n  contentHash: string;\n  /** Verdict resolution path. Useful for debugging + dashboards. */\n  source: \"auto-approve\" | \"cache\" | \"llm\" | \"llm-cap-rejected\" | \"fail-open\";\n  /**\n   * How many times this candidate had already been deferred before this\n   * verdict resolved. 0 when the candidate had never been deferred.\n   */\n  priorDeferrals: number;\n  /**\n   * Milliseconds from batch start to now. Shared across verdicts emitted in\n   * the same batch.\n   */\n  elapsedMs: number;\n}\n\n// ---------------------------------------------------------------------------\n// Prompt (embedded; mirrors prompts/extraction_judge.prompt.md)\n// ---------------------------------------------------------------------------\n\nconst JUDGE_SYSTEM_PROMPT = `You are a memory curator evaluating whether extracted facts are **durable** — worth storing for long-term recall across sessions.\n\nA fact is **durable** if it will still be useful 30+ days from now and is relevant across multiple sessions, not just the current task.\n\nReturn one of three verdicts per candidate:\n\nACCEPT — the fact is durable, persist it:\n- Personal preferences, identities, or relationships\n- Decisions with rationale that affect future work\n- Corrections to previously held beliefs\n- Principles, rules, or constraints the user wants respected\n- Stable facts about projects, tools, or workflows\n- Commitments, deadlines, or obligations\n\nREJECT — the fact is not durable, drop it:\n- Transient task details (\"currently debugging line 42\")\n- Ephemeral state (\"the build is running now\")\n- Routine operations (\"ran npm install\")\n- Conversational filler or acknowledgements\n- Information that will be stale within hours\n- Step-by-step instructions for a one-time task\n\nDEFER — the fact MIGHT be durable but needs more context to decide. The candidate will be re-evaluated on a later extraction pass with fresh context; if it cannot be resolved within a small number of re-evaluations it will be rejected.\n- Ambiguous referents (\"he said they'd follow up on it\")\n- Partial or in-progress statements that might become durable once completed\n- Future-tense commitments whose subject or timeline is unclear\n- Facts whose durability hinges on context not present in the candidate text\n\nDo NOT use defer as a soft reject. Reject facts you are confident are transient. Only defer when another turn of context would genuinely change the verdict.\n\nReturn a JSON array of objects with these fields:\n- index: number (the candidate index)\n- kind: string — one of \"accept\", \"reject\", \"defer\"\n- reason: string (brief explanation, under 80 characters)\n\nYou may also include durable (boolean) for backwards compatibility: true for accept, false for reject or defer. If kind is omitted, durable determines the verdict.\n\nRules:\n1. Return exactly one verdict per input candidate, matched by index.\n2. When in doubt between accept and reject, lean toward accept — false negatives (losing a useful fact) are worse than false positives (keeping a marginal one).\n3. Use defer only when another turn of context would genuinely change the verdict.\n4. Output valid JSON only. No markdown fences, no commentary.\n\nExample output:\n[{\"index\": 0, \"kind\": \"accept\", \"durable\": true, \"reason\": \"Stable personal preference\"}, {\"index\": 1, \"kind\": \"reject\", \"durable\": false, \"reason\": \"Ephemeral build status\"}, {\"index\": 2, \"kind\": \"defer\", \"durable\": false, \"reason\": \"Ambiguous pronoun\"}]`;\n\n// ---------------------------------------------------------------------------\n// Content-hash cache (in-memory, per-process fallback)\n// ---------------------------------------------------------------------------\n\n/** Maximum entries before evicting the oldest half. */\nconst VERDICT_CACHE_MAX_SIZE = 10_000;\n\n/** Module-level fallback cache, used when callers do not pass their own. */\nconst defaultVerdictCache = new Map<string, JudgeVerdict>();\n\n/**\n * Per-content-hash deferral counter (issue #562, PR 2).\n *\n * When the judge emits a `\"defer\"` verdict for a candidate whose content\n * has already been deferred `extractionJudgeMaxDeferrals` times, the verdict\n * is forcibly converted to `\"reject\"` so a pathological LLM response cannot\n * produce an infinite defer loop.\n *\n * Module-level with a size cap so stale test state cannot leak between runs\n * in the unlikely case a caller does not clear it between processes.\n */\nconst defaultDeferCounts = new Map<string, number>();\nconst DEFER_COUNT_MAX_SIZE = 20_000;\n\nfunction cacheKey(text: string, category: string): string {\n  return createHash(\"sha256\").update(`${text}\\0${category}`).digest(\"hex\");\n}\n\n/**\n * Resolve the effective defer cap from config, defaulting to 2 when the\n * config value is missing or non-positive. Matches the PR 2 spec.\n */\nfunction resolveDeferCap(config: PluginConfig): number {\n  const raw = (config as { extractionJudgeMaxDeferrals?: number })\n    .extractionJudgeMaxDeferrals;\n  if (typeof raw === \"number\" && Number.isFinite(raw) && raw >= 1) {\n    return Math.floor(raw);\n  }\n  return 2;\n}\n\n/**\n * Enforce the max-size invariant on a verdict cache. When the cache exceeds\n * VERDICT_CACHE_MAX_SIZE, the oldest half of entries are deleted (Map\n * iteration order is insertion order).\n */\nfunction enforceMaxCacheSize(cache: Map<string, JudgeVerdict>): void {\n  if (cache.size <= VERDICT_CACHE_MAX_SIZE) return;\n  const deleteCount = Math.floor(cache.size / 2);\n  let deleted = 0;\n  for (const key of cache.keys()) {\n    if (deleted >= deleteCount) break;\n    cache.delete(key);\n    deleted++;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Categories that bypass the judge (safety / correctness)\n// ---------------------------------------------------------------------------\n\nconst AUTO_APPROVE_CATEGORIES = new Set([\"correction\", \"principle\"]);\n\n/** Explicit trigger phrasing — procedures must match to persist (issue #519). */\nconst PROCEDURE_TRIGGER_RE =\n  /(when you|whenever|before you|before running|always\\s|first\\b.*\\bthen|to deploy|to ship|run these steps|follow these steps|how (i|we)\\s|recipe for|workflow|each time you)/i;\n\n/**\n * Deterministic gate for extracted `procedure` memories: ≥2 steps with non-empty\n * intents and explicit trigger wording in title and/or steps.\n */\nexport function validateProcedureExtraction(input: {\n  content: string;\n  procedureSteps?: unknown;\n}): JudgeVerdict {\n  const steps = normalizeProcedureSteps(input.procedureSteps);\n  if (steps.length < 2) {\n    return { durable: false, reason: \"Procedure requires at least two steps with intents\" };\n  }\n  const combined = [input.content, ...steps.map((s) => s.intent)].join(\" \").toLowerCase();\n  if (!PROCEDURE_TRIGGER_RE.test(combined)) {\n    return { durable: false, reason: \"Procedure missing explicit trigger phrasing\" };\n  }\n  return { durable: true, reason: \"Procedure structure validated\" };\n}\n\n// ---------------------------------------------------------------------------\n// Core judge function\n// ---------------------------------------------------------------------------\n\n/**\n * Evaluate a batch of candidate facts for durability.\n *\n * Auto-approves corrections, principles, and critical-importance facts.\n * Remaining candidates are batched (up to extractionJudgeBatchSize),\n * checked against an in-memory content-hash cache, and sent to the LLM\n * for verdict.\n */\nexport async function judgeFactDurability(\n  candidates: JudgeCandidate[],\n  config: PluginConfig,\n  localLlm: LocalLlmClient | null,\n  fallbackLlm: FallbackLlmClient | null,\n  cache?: Map<string, JudgeVerdict>,\n  deferCounts?: Map<string, number>,\n  onVerdict?: (observation: JudgeVerdictObservation) => void,\n): Promise<JudgeBatchResult> {\n  const startMs = Date.now();\n  const verdicts = new Map<number, JudgeVerdict>();\n  let cached = 0;\n  let judged = 0;\n  let deferred = 0;\n  let deferredCappedToReject = 0;\n\n  // Use caller-provided cache for per-orchestrator scoping, or fall back\n  // to the module-level default cache.\n  const verdictCache = cache ?? defaultVerdictCache;\n  const deferCountMap = deferCounts ?? defaultDeferCounts;\n  const deferCap = resolveDeferCap(config);\n\n  // Lazy emit (Codex P2): when `onVerdict` is undefined (default path —\n  // telemetry off), payload construction is skipped entirely. Callers\n  // pass a factory instead of a pre-built observation so the `sha256`\n  // `contentHash` and surrounding object allocation only run when a\n  // subscriber is present. For large batches with telemetry off this\n  // removes per-verdict overhead that would otherwise fire on every\n  // auto-approved / cache / fail-open path.\n  const emit = (build: () => JudgeVerdictObservation): void => {\n    if (!onVerdict) return;\n    let observation: JudgeVerdictObservation;\n    try {\n      observation = build();\n    } catch (err) {\n      log.debug(\n        `extraction-judge: onVerdict builder threw (non-fatal): ${err instanceof Error ? err.message : String(err)}`,\n      );\n      return;\n    }\n    try {\n      onVerdict(observation);\n    } catch (err) {\n      // Fail-open: telemetry errors must never block extraction.\n      log.debug(\n        `extraction-judge: onVerdict callback threw (non-fatal): ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  };\n\n  if (candidates.length === 0) {\n    return {\n      verdicts,\n      cached,\n      judged,\n      elapsed: 0,\n      deferred,\n      deferredCappedToReject,\n    };\n  }\n\n  // Indices that need LLM judgment\n  const pendingIndices: number[] = [];\n\n  for (let i = 0; i < candidates.length; i++) {\n    const c = candidates[i];\n\n    // Auto-approve safety categories\n    if (AUTO_APPROVE_CATEGORIES.has(c.category)) {\n      const v: JudgeVerdict = {\n        durable: true,\n        reason: `Auto-approved: ${c.category} category bypasses judge`,\n      };\n      verdicts.set(i, v);\n      emit(() => ({\n        verdict: v,\n        candidate: c,\n        contentHash: cacheKey(c.text, c.category),\n        source: \"auto-approve\",\n        priorDeferrals: 0,\n        elapsedMs: Date.now() - startMs,\n      }));\n      continue;\n    }\n\n    // Auto-approve critical importance\n    if (c.importanceLevel === \"critical\") {\n      const v: JudgeVerdict = {\n        durable: true,\n        reason: \"Auto-approved: critical importance\",\n      };\n      verdicts.set(i, v);\n      emit(() => ({\n        verdict: v,\n        candidate: c,\n        contentHash: cacheKey(c.text, c.category),\n        source: \"auto-approve\",\n        priorDeferrals: 0,\n        elapsedMs: Date.now() - startMs,\n      }));\n      continue;\n    }\n\n    // Check cache\n    const key = cacheKey(c.text, c.category);\n    const cachedVerdict = verdictCache.get(key);\n    if (cachedVerdict) {\n      verdicts.set(i, cachedVerdict);\n      cached++;\n      emit(() => ({\n        verdict: cachedVerdict,\n        candidate: c,\n        contentHash: key,\n        source: \"cache\",\n        priorDeferrals: deferCountMap.get(key) ?? 0,\n        elapsedMs: Date.now() - startMs,\n      }));\n      continue;\n    }\n\n    pendingIndices.push(i);\n  }\n\n  // If all resolved without LLM, return early\n  if (pendingIndices.length === 0) {\n    return {\n      verdicts,\n      cached,\n      judged,\n      elapsed: Date.now() - startMs,\n      deferred,\n      deferredCappedToReject,\n    };\n  }\n\n  // Batch the pending candidates up to batchSize\n  const batchSize = config.extractionJudgeBatchSize;\n  for (let batchStart = 0; batchStart < pendingIndices.length; batchStart += batchSize) {\n    const batchIndices = pendingIndices.slice(batchStart, batchStart + batchSize);\n    const batchPayload = batchIndices.map((idx) => ({\n      index: idx,\n      text: candidates[idx].text,\n      category: candidates[idx].category,\n      confidence: candidates[idx].confidence,\n    }));\n\n    const userPrompt = JSON.stringify(batchPayload);\n\n    try {\n      const llmResponse = await callJudgeLlm(\n        userPrompt,\n        config,\n        localLlm,\n        fallbackLlm,\n      );\n\n      if (llmResponse) {\n        const parsed = parseJudgeResponse(llmResponse, batchIndices);\n        // Per-batch defer-increment dedupe (codex P2): a single extraction\n        // pass must not advance the cap more than once for identical\n        // candidate content, even if the same text appears multiple times\n        // in the same LLM response. Duplicate hits share the first\n        // increment's `priorDeferrals` snapshot.\n        const deferredThisBatch = new Set<string>();\n        for (const [idx, rawVerdict] of parsed.entries()) {\n          const c = candidates[idx];\n          const key = cacheKey(c.text, c.category);\n          let verdict = rawVerdict;\n          let source: JudgeVerdictObservation[\"source\"] = \"llm\";\n          const priorDefers = deferCountMap.get(key) ?? 0;\n\n          // Defer cap (issue #562, PR 2). A candidate that has already been\n          // deferred `deferCap` times is forcibly rejected so a pathological\n          // LLM response cannot produce an infinite defer loop.\n          if (getVerdictKind(verdict) === \"defer\") {\n            if (priorDefers >= deferCap) {\n              verdict = {\n                durable: false,\n                reason: `Defer cap reached (${deferCap} prior defers); rejecting`,\n                kind: \"reject\",\n              };\n              source = \"llm-cap-rejected\";\n              // Only clear + count the cap conversion once per batch for\n              // this key — duplicates in the same response all resolve to\n              // reject but should not inflate the cap-rejection counter.\n              if (!deferredThisBatch.has(key)) {\n                deferCountMap.delete(key);\n                deferredCappedToReject++;\n                deferredThisBatch.add(key);\n              }\n            } else if (!deferredThisBatch.has(key)) {\n              deferCountMap.set(key, priorDefers + 1);\n              deferred++;\n              deferredThisBatch.add(key);\n              // Bound the per-process defer-counter map.\n              if (deferCountMap.size > DEFER_COUNT_MAX_SIZE) {\n                const drop = Math.floor(deferCountMap.size / 2);\n                let dropped = 0;\n                for (const k of deferCountMap.keys()) {\n                  if (dropped >= drop) break;\n                  deferCountMap.delete(k);\n                  dropped++;\n                }\n              }\n            }\n            // else: duplicate defer for a key already counted this batch —\n            // no additional counter increment, verdict still marked defer.\n          } else {\n            // On accept/reject, clear any outstanding defer counter so a\n            // future reappearance of the same text starts fresh.\n            deferCountMap.delete(key);\n          }\n\n          verdicts.set(idx, verdict);\n          judged++;\n          // Cache non-defer verdicts. Defer is intentionally NOT cached:\n          // caching it would short-circuit the re-evaluation pass that is\n          // the entire point of the defer verdict.\n          if (getVerdictKind(verdict) !== \"defer\") {\n            verdictCache.set(key, verdict);\n          }\n          emit(() => ({\n            verdict,\n            candidate: c,\n            contentHash: key,\n            source,\n            priorDeferrals: priorDefers,\n            elapsedMs: Date.now() - startMs,\n          }));\n        }\n        // Evict oldest entries if cache exceeds max size\n        enforceMaxCacheSize(verdictCache);\n      }\n    } catch (err) {\n      // Fail-open: if the LLM call fails, approve all candidates in this batch\n      log.warn(\n        `extraction-judge: LLM call failed, approving batch (fail-open): ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n\n    // Fill in any missing verdicts from this batch (fail-open: approve).\n    // Clear defer counts so a transient outage doesn't leave stale state\n    // that causes later defers to hit the cap early.\n    for (const idx of batchIndices) {\n      if (!verdicts.has(idx)) {\n        const c = candidates[idx];\n        const hash = cacheKey(c.text, c.category);\n        // Capture the prior deferral count BEFORE clearing so the\n        // telemetry event reflects the true state rather than always 0.\n        const priorDefers = deferCountMap.get(hash) ?? 0;\n        deferCountMap.delete(hash);\n        const v: JudgeVerdict = {\n          durable: true,\n          reason: \"Approved by default (judge unavailable or parse error)\",\n        };\n        verdicts.set(idx, v);\n        emit(() => {\n          return {\n            verdict: v,\n            candidate: c,\n            contentHash: hash,\n            source: \"fail-open\",\n            priorDeferrals: priorDefers,\n            elapsedMs: Date.now() - startMs,\n          };\n        });\n      }\n    }\n  }\n\n  return {\n    verdicts,\n    cached,\n    judged,\n    elapsed: Date.now() - startMs,\n    deferred,\n    deferredCappedToReject,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// LLM call helpers\n// ---------------------------------------------------------------------------\n\nasync function callJudgeLlm(\n  userPrompt: string,\n  config: PluginConfig,\n  localLlm: LocalLlmClient | null,\n  fallbackLlm: FallbackLlmClient | null,\n): Promise<string | null> {\n  const messages: Array<{ role: \"system\" | \"user\"; content: string }> = [\n    { role: \"system\", content: JUDGE_SYSTEM_PROMPT },\n    { role: \"user\", content: userPrompt },\n  ];\n\n  const modelOverride = config.extractionJudgeModel || undefined;\n\n  // When modelSource is \"gateway\", skip localLlm and go directly to fallback\n  // (the gateway-routed backend). This respects the operator's explicit\n  // routing preference.\n  const skipLocal = config.modelSource === \"gateway\";\n\n  // Resolve the gateway agent ID so the fallback LLM routes through the\n  // correct agent persona's model chain — identical to the pattern used\n  // by ExtractionEngine.withGatewayAgent().\n  const agentId =\n    config.modelSource === \"gateway\"\n      ? (config.gatewayAgentId || undefined)\n      : undefined;\n\n  // Try local LLM first (unless modelSource says gateway)\n  if (localLlm && !skipLocal) {\n    try {\n      const result = await (localLlm as any).chatCompletion(messages, {\n        temperature: 0.1,\n        maxTokens: 2048,\n        responseFormat: { type: \"json_object\" },\n        timeoutMs: 1500,\n        operation: \"extraction-judge\",\n        ...(modelOverride ? { model: modelOverride } : {}),\n      });\n      if (result?.content) {\n        return result.content;\n      }\n    } catch (err) {\n      log.debug(\n        `extraction-judge: local LLM failed, trying fallback: ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  }\n\n  // Try fallback LLM\n  if (fallbackLlm) {\n    try {\n      const result = await fallbackLlm.chatCompletion(\n        messages as Array<{ role: \"system\" | \"user\" | \"assistant\"; content: string }>,\n        {\n          temperature: 0.1,\n          maxTokens: 2048,\n          timeoutMs: 1500,\n          ...(modelOverride ? { model: modelOverride } : {}),\n          ...(agentId ? { agentId } : {}),\n        },\n      );\n      if (result?.content) {\n        return result.content;\n      }\n    } catch (err) {\n      log.debug(\n        `extraction-judge: fallback LLM failed: ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  }\n\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// Response parsing\n// ---------------------------------------------------------------------------\n\nfunction parseJudgeResponse(\n  raw: string,\n  expectedIndices: number[],\n): Map<number, JudgeVerdict> {\n  const result = new Map<number, JudgeVerdict>();\n  const expectedSet = new Set(expectedIndices);\n\n  try {\n    // Try direct parse first, then fall back to JSON extraction\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(raw);\n    } catch {\n      const candidates = extractJsonCandidates(raw);\n      if (candidates.length > 0) {\n        parsed = JSON.parse(candidates[0]);\n      }\n    }\n\n    if (!Array.isArray(parsed)) {\n      // Might be wrapped in an object with a key\n      if (parsed && typeof parsed === \"object\" && !Array.isArray(parsed)) {\n        const values = Object.values(parsed as Record<string, unknown>);\n        for (const v of values) {\n          if (Array.isArray(v)) {\n            parsed = v;\n            break;\n          }\n        }\n      }\n      if (!Array.isArray(parsed)) {\n        log.debug(\"extraction-judge: response is not an array, cannot parse\");\n        return result;\n      }\n    }\n\n    for (const item of parsed) {\n      if (\n        typeof item !== \"object\" ||\n        item === null ||\n        typeof (item as any).index !== \"number\"\n      ) {\n        continue;\n      }\n      const idx = (item as any).index as number;\n      if (!expectedSet.has(idx)) continue;\n\n      // Parse kind first — it's the primary signal in PR 2 and above.\n      // Fall back to durable for pre-PR-2 model responses that only return\n      // the boolean.\n      let kind: JudgeVerdictKind | undefined;\n      const rawKind = (item as any).kind;\n      const rawAction = (item as any).action;\n      if (rawKind === \"accept\" || rawKind === \"reject\" || rawKind === \"defer\") {\n        kind = rawKind;\n      } else if (\n        rawAction === \"accept\" ||\n        rawAction === \"reject\" ||\n        rawAction === \"defer\"\n      ) {\n        // Tolerate `action` as an alias — MemReader uses that word in the\n        // paper and models may echo it.\n        kind = rawAction;\n      }\n\n      const hasDurable = typeof (item as any).durable === \"boolean\";\n      const durableFromModel = hasDurable\n        ? ((item as any).durable as boolean)\n        : undefined;\n\n      // Resolve the durable flag from kind when present; otherwise trust\n      // the model's boolean; otherwise fail-open to durable=true.\n      let durable: boolean;\n      if (kind === \"accept\") {\n        durable = true;\n      } else if (kind === \"reject\" || kind === \"defer\") {\n        durable = false;\n      } else if (durableFromModel !== undefined) {\n        durable = durableFromModel;\n      } else {\n        durable = true; // fail-open\n      }\n\n      const reason =\n        typeof (item as any).reason === \"string\"\n          ? ((item as any).reason as string).slice(0, 120)\n          : \"No reason provided\";\n\n      const verdict: JudgeVerdict = { durable, reason };\n      if (kind !== undefined) verdict.kind = kind;\n      result.set(idx, verdict);\n    }\n  } catch (err) {\n    log.debug(\n      `extraction-judge: failed to parse response: ${err instanceof Error ? err.message : String(err)}`,\n    );\n  }\n\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Cache management (exposed for testing)\n// ---------------------------------------------------------------------------\n\n/** Clear the in-memory default verdict cache. Primarily for tests. */\nexport function clearVerdictCache(): void {\n  defaultVerdictCache.clear();\n  defaultDeferCounts.clear();\n}\n\n/** Return the current default verdict cache size. Primarily for tests. */\nexport function verdictCacheSize(): number {\n  return defaultVerdictCache.size;\n}\n\n/** Create a new per-instance verdict cache. Orchestrators should hold one. */\nexport function createVerdictCache(): Map<string, JudgeVerdict> {\n  return new Map();\n}\n\n/**\n * Create a new per-instance defer-counter map. Orchestrators should hold one\n * alongside their verdict cache so defer counts survive across extraction\n * passes within a single orchestrator but do not leak across orchestrators.\n */\nexport function createDeferCountMap(): Map<string, number> {\n  return new Map();\n}\n"],"mappings":";;;;;;;;;;;AAeA,SAAS,kBAAkB;AAwEpB,SAAS,eAAe,SAAyC;AACtE,QAAM,MAAM,QAAQ;AACpB,MAAI,QAAQ,YAAY,QAAQ,YAAY,QAAQ,SAAS;AAC3D,WAAO;AAAA,EACT;AACA,SAAO,QAAQ,UAAU,WAAW;AACtC;AAOO,SAAS,iBAAiB,SAAgC;AAC/D,SAAO,eAAe,OAAO,MAAM;AACrC;AAgBO,SAAS,qBAAqB,OAAuC;AAC1E,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,UAAW,QAAO;AAC3C,MAAI,OAAO,EAAE,WAAW,SAAU,QAAO;AACzC,MAAI,EAAE,SAAS,QAAW;AACxB,QAAI,EAAE,SAAS,YAAY,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AACpE,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAWO,SAAS,uBAAuB,OAAqC;AAC1E,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,UAAW,QAAO;AAC3C,MAAI,OAAO,EAAE,WAAW,SAAU,QAAO;AACzC,MAAI;AACJ,MAAI,EAAE,SAAS,QAAW;AACxB,QAAI,OAAO,EAAE,SAAS,SAAU,QAAO;AACvC,QAAI,EAAE,SAAS,YAAY,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AACpE,aAAO,EAAE;AAAA,IACX;AAAA,EAEF;AACA,QAAM,MAAoB,EAAE,SAAS,EAAE,SAAS,QAAQ,EAAE,OAAO;AACjE,MAAI,SAAS,OAAW,KAAI,OAAO;AACnC,SAAO;AACT;AAwDA,IAAM,sBAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAmD5B,IAAM,yBAAyB;AAG/B,IAAM,sBAAsB,oBAAI,IAA0B;AAa1D,IAAM,qBAAqB,oBAAI,IAAoB;AACnD,IAAM,uBAAuB;AAE7B,SAAS,SAAS,MAAc,UAA0B;AACxD,SAAO,WAAW,QAAQ,EAAE,OAAO,GAAG,IAAI,KAAK,QAAQ,EAAE,EAAE,OAAO,KAAK;AACzE;AAMA,SAAS,gBAAgB,QAA8B;AACrD,QAAM,MAAO,OACV;AACH,MAAI,OAAO,QAAQ,YAAY,OAAO,SAAS,GAAG,KAAK,OAAO,GAAG;AAC/D,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB;AACA,SAAO;AACT;AAOA,SAAS,oBAAoB,OAAwC;AACnE,MAAI,MAAM,QAAQ,uBAAwB;AAC1C,QAAM,cAAc,KAAK,MAAM,MAAM,OAAO,CAAC;AAC7C,MAAI,UAAU;AACd,aAAW,OAAO,MAAM,KAAK,GAAG;AAC9B,QAAI,WAAW,YAAa;AAC5B,UAAM,OAAO,GAAG;AAChB;AAAA,EACF;AACF;AAMA,IAAM,0BAA0B,oBAAI,IAAI,CAAC,cAAc,WAAW,CAAC;AAGnE,IAAM,uBACJ;AAMK,SAAS,4BAA4B,OAG3B;AACf,QAAM,QAAQ,wBAAwB,MAAM,cAAc;AAC1D,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,EAAE,SAAS,OAAO,QAAQ,qDAAqD;AAAA,EACxF;AACA,QAAM,WAAW,CAAC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,EAAE,YAAY;AACtF,MAAI,CAAC,qBAAqB,KAAK,QAAQ,GAAG;AACxC,WAAO,EAAE,SAAS,OAAO,QAAQ,8CAA8C;AAAA,EACjF;AACA,SAAO,EAAE,SAAS,MAAM,QAAQ,gCAAgC;AAClE;AAcA,eAAsB,oBACpB,YACA,QACA,UACA,aACA,OACA,aACA,WAC2B;AAC3B,QAAM,UAAU,KAAK,IAAI;AACzB,QAAM,WAAW,oBAAI,IAA0B;AAC/C,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,WAAW;AACf,MAAI,yBAAyB;AAI7B,QAAM,eAAe,SAAS;AAC9B,QAAM,gBAAgB,eAAe;AACrC,QAAM,WAAW,gBAAgB,MAAM;AASvC,QAAM,OAAO,CAAC,UAA+C;AAC3D,QAAI,CAAC,UAAW;AAChB,QAAI;AACJ,QAAI;AACF,oBAAc,MAAM;AAAA,IACtB,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,0DAA0D,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC5G;AACA;AAAA,IACF;AACA,QAAI;AACF,gBAAU,WAAW;AAAA,IACvB,SAAS,KAAK;AAEZ,UAAI;AAAA,QACF,2DAA2D,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC7G;AAAA,IACF;AAAA,EACF;AAEA,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,iBAA2B,CAAC;AAElC,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,UAAM,IAAI,WAAW,CAAC;AAGtB,QAAI,wBAAwB,IAAI,EAAE,QAAQ,GAAG;AAC3C,YAAM,IAAkB;AAAA,QACtB,SAAS;AAAA,QACT,QAAQ,kBAAkB,EAAE,QAAQ;AAAA,MACtC;AACA,eAAS,IAAI,GAAG,CAAC;AACjB,WAAK,OAAO;AAAA,QACV,SAAS;AAAA,QACT,WAAW;AAAA,QACX,aAAa,SAAS,EAAE,MAAM,EAAE,QAAQ;AAAA,QACxC,QAAQ;AAAA,QACR,gBAAgB;AAAA,QAChB,WAAW,KAAK,IAAI,IAAI;AAAA,MAC1B,EAAE;AACF;AAAA,IACF;AAGA,QAAI,EAAE,oBAAoB,YAAY;AACpC,YAAM,IAAkB;AAAA,QACtB,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AACA,eAAS,IAAI,GAAG,CAAC;AACjB,WAAK,OAAO;AAAA,QACV,SAAS;AAAA,QACT,WAAW;AAAA,QACX,aAAa,SAAS,EAAE,MAAM,EAAE,QAAQ;AAAA,QACxC,QAAQ;AAAA,QACR,gBAAgB;AAAA,QAChB,WAAW,KAAK,IAAI,IAAI;AAAA,MAC1B,EAAE;AACF;AAAA,IACF;AAGA,UAAM,MAAM,SAAS,EAAE,MAAM,EAAE,QAAQ;AACvC,UAAM,gBAAgB,aAAa,IAAI,GAAG;AAC1C,QAAI,eAAe;AACjB,eAAS,IAAI,GAAG,aAAa;AAC7B;AACA,WAAK,OAAO;AAAA,QACV,SAAS;AAAA,QACT,WAAW;AAAA,QACX,aAAa;AAAA,QACb,QAAQ;AAAA,QACR,gBAAgB,cAAc,IAAI,GAAG,KAAK;AAAA,QAC1C,WAAW,KAAK,IAAI,IAAI;AAAA,MAC1B,EAAE;AACF;AAAA,IACF;AAEA,mBAAe,KAAK,CAAC;AAAA,EACvB;AAGA,MAAI,eAAe,WAAW,GAAG;AAC/B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS,KAAK,IAAI,IAAI;AAAA,MACtB;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAY,OAAO;AACzB,WAAS,aAAa,GAAG,aAAa,eAAe,QAAQ,cAAc,WAAW;AACpF,UAAM,eAAe,eAAe,MAAM,YAAY,aAAa,SAAS;AAC5E,UAAM,eAAe,aAAa,IAAI,CAAC,SAAS;AAAA,MAC9C,OAAO;AAAA,MACP,MAAM,WAAW,GAAG,EAAE;AAAA,MACtB,UAAU,WAAW,GAAG,EAAE;AAAA,MAC1B,YAAY,WAAW,GAAG,EAAE;AAAA,IAC9B,EAAE;AAEF,UAAM,aAAa,KAAK,UAAU,YAAY;AAE9C,QAAI;AACF,YAAM,cAAc,MAAM;AAAA,QACxB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,UAAI,aAAa;AACf,cAAM,SAAS,mBAAmB,aAAa,YAAY;AAM3D,cAAM,oBAAoB,oBAAI,IAAY;AAC1C,mBAAW,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,GAAG;AAChD,gBAAM,IAAI,WAAW,GAAG;AACxB,gBAAM,MAAM,SAAS,EAAE,MAAM,EAAE,QAAQ;AACvC,cAAI,UAAU;AACd,cAAI,SAA4C;AAChD,gBAAM,cAAc,cAAc,IAAI,GAAG,KAAK;AAK9C,cAAI,eAAe,OAAO,MAAM,SAAS;AACvC,gBAAI,eAAe,UAAU;AAC3B,wBAAU;AAAA,gBACR,SAAS;AAAA,gBACT,QAAQ,sBAAsB,QAAQ;AAAA,gBACtC,MAAM;AAAA,cACR;AACA,uBAAS;AAIT,kBAAI,CAAC,kBAAkB,IAAI,GAAG,GAAG;AAC/B,8BAAc,OAAO,GAAG;AACxB;AACA,kCAAkB,IAAI,GAAG;AAAA,cAC3B;AAAA,YACF,WAAW,CAAC,kBAAkB,IAAI,GAAG,GAAG;AACtC,4BAAc,IAAI,KAAK,cAAc,CAAC;AACtC;AACA,gCAAkB,IAAI,GAAG;AAEzB,kBAAI,cAAc,OAAO,sBAAsB;AAC7C,sBAAM,OAAO,KAAK,MAAM,cAAc,OAAO,CAAC;AAC9C,oBAAI,UAAU;AACd,2BAAW,KAAK,cAAc,KAAK,GAAG;AACpC,sBAAI,WAAW,KAAM;AACrB,gCAAc,OAAO,CAAC;AACtB;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UAGF,OAAO;AAGL,0BAAc,OAAO,GAAG;AAAA,UAC1B;AAEA,mBAAS,IAAI,KAAK,OAAO;AACzB;AAIA,cAAI,eAAe,OAAO,MAAM,SAAS;AACvC,yBAAa,IAAI,KAAK,OAAO;AAAA,UAC/B;AACA,eAAK,OAAO;AAAA,YACV;AAAA,YACA,WAAW;AAAA,YACX,aAAa;AAAA,YACb;AAAA,YACA,gBAAgB;AAAA,YAChB,WAAW,KAAK,IAAI,IAAI;AAAA,UAC1B,EAAE;AAAA,QACJ;AAEA,4BAAoB,YAAY;AAAA,MAClC;AAAA,IACF,SAAS,KAAK;AAEZ,UAAI;AAAA,QACF,mEAAmE,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACrH;AAAA,IACF;AAKA,eAAW,OAAO,cAAc;AAC9B,UAAI,CAAC,SAAS,IAAI,GAAG,GAAG;AACtB,cAAM,IAAI,WAAW,GAAG;AACxB,cAAM,OAAO,SAAS,EAAE,MAAM,EAAE,QAAQ;AAGxC,cAAM,cAAc,cAAc,IAAI,IAAI,KAAK;AAC/C,sBAAc,OAAO,IAAI;AACzB,cAAM,IAAkB;AAAA,UACtB,SAAS;AAAA,UACT,QAAQ;AAAA,QACV;AACA,iBAAS,IAAI,KAAK,CAAC;AACnB,aAAK,MAAM;AACT,iBAAO;AAAA,YACL,SAAS;AAAA,YACT,WAAW;AAAA,YACX,aAAa;AAAA,YACb,QAAQ;AAAA,YACR,gBAAgB;AAAA,YAChB,WAAW,KAAK,IAAI,IAAI;AAAA,UAC1B;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,KAAK,IAAI,IAAI;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AACF;AAMA,eAAe,aACb,YACA,QACA,UACA,aACwB;AACxB,QAAM,WAAgE;AAAA,IACpE,EAAE,MAAM,UAAU,SAAS,oBAAoB;AAAA,IAC/C,EAAE,MAAM,QAAQ,SAAS,WAAW;AAAA,EACtC;AAEA,QAAM,gBAAgB,OAAO,wBAAwB;AAKrD,QAAM,YAAY,OAAO,gBAAgB;AAKzC,QAAM,UACJ,OAAO,gBAAgB,YAClB,OAAO,kBAAkB,SAC1B;AAGN,MAAI,YAAY,CAAC,WAAW;AAC1B,QAAI;AACF,YAAM,SAAS,MAAO,SAAiB,eAAe,UAAU;AAAA,QAC9D,aAAa;AAAA,QACb,WAAW;AAAA,QACX,gBAAgB,EAAE,MAAM,cAAc;AAAA,QACtC,WAAW;AAAA,QACX,WAAW;AAAA,QACX,GAAI,gBAAgB,EAAE,OAAO,cAAc,IAAI,CAAC;AAAA,MAClD,CAAC;AACD,UAAI,QAAQ,SAAS;AACnB,eAAO,OAAO;AAAA,MAChB;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,wDAAwD,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC1G;AAAA,IACF;AAAA,EACF;AAGA,MAAI,aAAa;AACf,QAAI;AACF,YAAM,SAAS,MAAM,YAAY;AAAA,QAC/B;AAAA,QACA;AAAA,UACE,aAAa;AAAA,UACb,WAAW;AAAA,UACX,WAAW;AAAA,UACX,GAAI,gBAAgB,EAAE,OAAO,cAAc,IAAI,CAAC;AAAA,UAChD,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;AAAA,QAC/B;AAAA,MACF;AACA,UAAI,QAAQ,SAAS;AACnB,eAAO,OAAO;AAAA,MAChB;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,0CAA0C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC5F;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,mBACP,KACA,iBAC2B;AAC3B,QAAM,SAAS,oBAAI,IAA0B;AAC7C,QAAM,cAAc,IAAI,IAAI,eAAe;AAE3C,MAAI;AAEF,QAAI;AACJ,QAAI;AACF,eAAS,KAAK,MAAM,GAAG;AAAA,IACzB,QAAQ;AACN,YAAM,aAAa,sBAAsB,GAAG;AAC5C,UAAI,WAAW,SAAS,GAAG;AACzB,iBAAS,KAAK,MAAM,WAAW,CAAC,CAAC;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAE1B,UAAI,UAAU,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,GAAG;AAClE,cAAM,SAAS,OAAO,OAAO,MAAiC;AAC9D,mBAAW,KAAK,QAAQ;AACtB,cAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,qBAAS;AACT;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,YAAI,MAAM,0DAA0D;AACpE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,eAAW,QAAQ,QAAQ;AACzB,UACE,OAAO,SAAS,YAChB,SAAS,QACT,OAAQ,KAAa,UAAU,UAC/B;AACA;AAAA,MACF;AACA,YAAM,MAAO,KAAa;AAC1B,UAAI,CAAC,YAAY,IAAI,GAAG,EAAG;AAK3B,UAAI;AACJ,YAAM,UAAW,KAAa;AAC9B,YAAM,YAAa,KAAa;AAChC,UAAI,YAAY,YAAY,YAAY,YAAY,YAAY,SAAS;AACvE,eAAO;AAAA,MACT,WACE,cAAc,YACd,cAAc,YACd,cAAc,SACd;AAGA,eAAO;AAAA,MACT;AAEA,YAAM,aAAa,OAAQ,KAAa,YAAY;AACpD,YAAM,mBAAmB,aACnB,KAAa,UACf;AAIJ,UAAI;AACJ,UAAI,SAAS,UAAU;AACrB,kBAAU;AAAA,MACZ,WAAW,SAAS,YAAY,SAAS,SAAS;AAChD,kBAAU;AAAA,MACZ,WAAW,qBAAqB,QAAW;AACzC,kBAAU;AAAA,MACZ,OAAO;AACL,kBAAU;AAAA,MACZ;AAEA,YAAM,SACJ,OAAQ,KAAa,WAAW,WAC1B,KAAa,OAAkB,MAAM,GAAG,GAAG,IAC7C;AAEN,YAAM,UAAwB,EAAE,SAAS,OAAO;AAChD,UAAI,SAAS,OAAW,SAAQ,OAAO;AACvC,aAAO,IAAI,KAAK,OAAO;AAAA,IACzB;AAAA,EACF,SAAS,KAAK;AACZ,QAAI;AAAA,MACF,+CAA+C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IACjG;AAAA,EACF;AAEA,SAAO;AACT;AAOO,SAAS,oBAA0B;AACxC,sBAAoB,MAAM;AAC1B,qBAAmB,MAAM;AAC3B;AAGO,SAAS,mBAA2B;AACzC,SAAO,oBAAoB;AAC7B;AAGO,SAAS,qBAAgD;AAC9D,SAAO,oBAAI,IAAI;AACjB;AAOO,SAAS,sBAA2C;AACzD,SAAO,oBAAI,IAAI;AACjB;","names":[]}

package/dist/{chunk-GJQPH5G3.js → chunk-CUPFXL3J.js}

@@ -7,7 +7,7 @@ import {
 } from "./chunk-DT5TVLJE.js";
 import {
   StorageManager
-} from "./chunk-POMSFKTB.js";
+} from "./chunk-F5VP6YCB.js";
 import {
   getCachedEpisodeMap,
   setCachedEpisodeMap
@@ -105,4 +105,4 @@ async function searchVerifiedEpisodes(options) {
 export {
   searchVerifiedEpisodes
 };
-//# sourceMappingURL=chunk-GJQPH5G3.js.map
+//# sourceMappingURL=chunk-CUPFXL3J.js.map