@remnic/core 9.3.693 → 9.3.695

package/dist/{chunk-ZLXGFAML.js → chunk-FZMH66NT.js}

@@ -1,6 +1,6 @@
 import {
   StorageManager
-} from "./chunk-VFVG4NS2.js";
+} from "./chunk-MOBRVKWE.js";
 import {
   getCachedRuleMemories,
   setCachedRuleMemories
@@ -117,4 +117,4 @@ export {
   compareVerifiedSemanticRuleResults,
   searchVerifiedSemanticRules
 };
-//# sourceMappingURL=chunk-ZLXGFAML.js.map
+//# sourceMappingURL=chunk-FZMH66NT.js.map

package/dist/{chunk-HXNMDPHN.js → chunk-G663XUEG.js}

@@ -3,7 +3,7 @@ import {
   readNamespaceMaintenanceLastRanStatuses,
   readNamespaceMaintenanceStatuses,
   runNamespaceMaintenancePlan
-} from "./chunk-4IQNAOP3.js";
+} from "./chunk-Q7SFJURX.js";
 
 // src/maintenance/namespace-maintenance-fanout.ts
 var NAMESPACE_MAINTENANCE_JOBS = [
@@ -146,4 +146,4 @@ export {
   summarizeNamespaceMaintenanceHealth,
   formatNamespaceMaintenanceHealthText
 };
-//# sourceMappingURL=chunk-HXNMDPHN.js.map
+//# sourceMappingURL=chunk-G663XUEG.js.map

package/dist/{chunk-TYEOAFH3.js → chunk-G6SVZWPB.js}

@@ -17,6 +17,14 @@ async function gatherConsoleState(orchestrator) {
   );
   const qmdProbe = readQmdProbe(orchestrator, errors);
   const daemon = readDaemonInfo(orchestrator, errors);
+  let faithfulness;
+  try {
+    if (typeof orchestrator.getConsoleFaithfulnessDistribution === "function") {
+      faithfulness = orchestrator.getConsoleFaithfulnessDistribution();
+    }
+  } catch (err) {
+    errors.push(`faithfulness: ${describeError(err)}`);
+  }
   return {
     capturedAt,
     bufferState,
@@ -25,6 +33,7 @@ async function gatherConsoleState(orchestrator) {
     maintenanceLedgerTail,
     qmdProbe,
     daemon,
+    ...faithfulness ? { faithfulness } : {},
     errors
   };
 }
@@ -248,4 +257,4 @@ function describeError(err) {
 export {
   gatherConsoleState
 };
-//# sourceMappingURL=chunk-TYEOAFH3.js.map
+//# sourceMappingURL=chunk-G6SVZWPB.js.map

package/dist/chunk-G6SVZWPB.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/console/state.ts"],"sourcesContent":["/**\n * Structured engine-state aggregator for the operator console (issue #688).\n *\n * This module is the data layer for the upcoming console TUI / HTTP /\n * MCP surfaces. It collects a point-in-time snapshot of the engine's\n * runtime state — buffer contents, extraction queue depth, recent\n * dedup decisions, the tail of the maintenance/observation ledger,\n * QMD probe status, and daemon metadata — into a single\n * JSON-serializable shape.\n *\n * Design contract:\n *   - Each subsystem read is wrapped in try/catch so one failure\n *     never crashes the whole snapshot. Failed reads return null /\n *     empty values and append a string to `errors`.\n *   - The output MUST be JSON-serializable so the CLI / HTTP / MCP\n *     surfaces can pipe it directly through `JSON.stringify`.\n *   - Read-only: this module never mutates orchestrator state.\n *\n * PR 1/3 of issue #688 wires only the data layer + a CLI flag. The\n * TUI (PR 2/3), HTTP `/console/state`, MCP `engram.console_state`,\n * SSE live updates, and trace replay (PR 3/3) land separately.\n */\n\nimport { promises as fs, createReadStream } from \"node:fs\";\nimport { createInterface } from \"node:readline\";\nimport path from \"node:path\";\n\n/**\n * Public state read off the orchestrator. We intentionally type this\n * as a permissive duck-typed shape rather than importing the concrete\n * `Orchestrator` class — the aggregator must tolerate missing fields\n * (e.g. tests that pass a stub) without throwing. Each accessor is\n * defensively read at call time.\n */\nexport interface ConsoleStateOrchestratorLike {\n  config?: {\n    memoryDir?: string;\n  };\n  buffer?: {\n    getTurns?: (bufferKey?: string) => Array<{ content?: string }>;\n  };\n  qmd?: {\n    debugStatus?: () => string;\n    isAvailable?: () => boolean;\n    isDaemonMode?: () => boolean;\n  };\n  /**\n   * Optional console-specific read surface added by future slices.\n   * The aggregator falls back to placeholders when these are absent\n   * so PR 1/3 ships without coupling to private orchestrator state.\n   */\n  getConsoleExtractionQueueDepth?: () => number;\n  getConsoleExtractionRecentVerdicts?: () => ReadonlyArray<ConsoleExtractionVerdict>;\n  getConsoleDedupRecentDecisions?: () => ReadonlyArray<ConsoleDedupDecision>;\n  /**\n   * Process / daemon metadata. Hosts that run remnic as a long-lived\n   * daemon (gateway, MCP server) can override these; otherwise the\n   * aggregator falls back to `process.uptime()` and the package\n   * version read from disk.\n   */\n  getConsoleDaemonInfo?: () => ConsoleDaemonInfo;\n  /**\n   * Optional faithfulness gate distribution (issue #1576). Returns the\n   * per-orchestrator running counters when the gate is active, or undefined\n   * when the gate is off (so the snapshot omits the block).\n   */\n  getConsoleFaithfulnessDistribution?: () => ConsoleFaithfulnessDistribution | undefined;\n}\n\nexport interface ConsoleBufferState {\n  /** Number of turns currently held in the default buffer slot. */\n  turnsCount: number;\n  /** Approximate byte size of buffered content (UTF-8). */\n  byteCount: number;\n}\n\nexport interface ConsoleExtractionVerdict {\n  /** ISO-8601 timestamp the verdict was recorded. */\n  ts: string;\n  /** Verdict kind — typically \"accept\" | \"reject\" | \"defer\". */\n  kind: string;\n  /** Optional short reason from the judge or fallback. */\n  reason?: string;\n}\n\nexport interface ConsoleExtractionQueueState {\n  /** Number of pending extraction tasks queued in the orchestrator. */\n  depth: number;\n  /** Most recent judge verdicts, newest last. Capped at 25 entries. */\n  recentVerdicts: ConsoleExtractionVerdict[];\n}\n\nexport interface ConsoleDedupDecision {\n  /** ISO-8601 timestamp the decision was recorded. */\n  ts: string;\n  /** Outcome of the dedup check — \"duplicate\" | \"novel\" | etc. */\n  decision: string;\n  /** Optional content fingerprint (first 16 chars of a hash). */\n  fingerprint?: string;\n  /** Optional similarity score that drove the decision. */\n  similarity?: number;\n}\n\nexport interface ConsoleMaintenanceLedgerEvent {\n  /** ISO-8601 timestamp from the ledger row. */\n  ts: string;\n  /** Event category (e.g. \"EXTRACTION_JUDGE_VERDICT\"). */\n  category: string;\n  /** Compact one-line summary. */\n  summary: string;\n}\n\nexport interface ConsoleQmdProbeState {\n  /** Whether QMD is reachable via CLI or daemon. */\n  available: boolean;\n  /** Whether the daemon transport is in use. */\n  daemonMode: boolean;\n  /** Raw debug-status string from `qmd.debugStatus()`. */\n  debug: string;\n}\n\nexport interface ConsoleDaemonInfo {\n  /** Process uptime in milliseconds. */\n  uptimeMs: number;\n  /** Package / daemon version (best-effort). */\n  version: string;\n}\n\n/**\n * Faithfulness gate verdict distribution (issue #1576). Surfaced via\n * console_state so `remnic doctor` can render how the gate is performing.\n */\nexport interface ConsoleFaithfulnessDistribution {\n  entailed: number;\n  contradicted: number;\n  unsupported: number;\n  unchecked: number;\n  skippedNoSpan: number;\n}\n\nexport interface ConsoleStateSnapshot {\n  /** ISO-8601 capture timestamp. */\n  capturedAt: string;\n  bufferState: ConsoleBufferState;\n  extractionQueue: ConsoleExtractionQueueState;\n  dedupRecent: ConsoleDedupDecision[];\n  maintenanceLedgerTail: ConsoleMaintenanceLedgerEvent[];\n  qmdProbe: ConsoleQmdProbeState;\n  daemon: ConsoleDaemonInfo;\n  /** Faithfulness gate distribution (issue #1576). Absent when the gate is off. */\n  faithfulness?: ConsoleFaithfulnessDistribution;\n  /**\n   * Subsystem read errors. One entry per failed reader keyed by\n   * subsystem name (e.g. `\"bufferState: ...\"`). An empty array means\n   * every section was read cleanly.\n   */\n  errors: string[];\n}\n\nconst MAX_LEDGER_TAIL = 50;\nconst MAX_VERDICT_TAIL = 25;\nconst MAX_DEDUP_TAIL = 10;\n\n/**\n * Gather a `ConsoleStateSnapshot` from the orchestrator. Each\n * subsystem read is independent; a thrown error in one reader is\n * captured in `errors` and the corresponding section is filled with\n * empty / placeholder values.\n */\nexport async function gatherConsoleState(\n  orchestrator: ConsoleStateOrchestratorLike,\n): Promise<ConsoleStateSnapshot> {\n  const errors: string[] = [];\n  const capturedAt = new Date().toISOString();\n\n  const bufferState = readBufferState(orchestrator, errors);\n  const extractionQueue = readExtractionQueue(orchestrator, errors);\n  const dedupRecent = readDedupRecent(orchestrator, errors);\n  const maintenanceLedgerTail = await readMaintenanceLedgerTail(\n    orchestrator,\n    errors,\n  );\n  const qmdProbe = readQmdProbe(orchestrator, errors);\n  const daemon = readDaemonInfo(orchestrator, errors);\n\n  // Faithfulness gate distribution (issue #1576). Optional — absent when\n  // the gate is off or the orchestrator does not expose the accessor.\n  let faithfulness: ConsoleFaithfulnessDistribution | undefined;\n  try {\n    if (typeof orchestrator.getConsoleFaithfulnessDistribution === \"function\") {\n      faithfulness = orchestrator.getConsoleFaithfulnessDistribution();\n    }\n  } catch (err) {\n    errors.push(`faithfulness: ${describeError(err)}`);\n  }\n\n  return {\n    capturedAt,\n    bufferState,\n    extractionQueue,\n    dedupRecent,\n    maintenanceLedgerTail,\n    qmdProbe,\n    daemon,\n    ...(faithfulness ? { faithfulness } : {}),\n    errors,\n  };\n}\n\nfunction readBufferState(\n  orchestrator: ConsoleStateOrchestratorLike,\n  errors: string[],\n): ConsoleBufferState {\n  try {\n    const getTurns = orchestrator.buffer?.getTurns;\n    if (typeof getTurns !== \"function\") {\n      return { turnsCount: 0, byteCount: 0 };\n    }\n    const turns = getTurns.call(orchestrator.buffer) ?? [];\n    let byteCount = 0;\n    for (const turn of turns) {\n      const content = typeof turn?.content === \"string\" ? turn.content : \"\";\n      byteCount += Buffer.byteLength(content, \"utf8\");\n    }\n    return { turnsCount: turns.length, byteCount };\n  } catch (err) {\n    errors.push(`bufferState: ${describeError(err)}`);\n    return { turnsCount: 0, byteCount: 0 };\n  }\n}\n\nfunction readExtractionQueue(\n  orchestrator: ConsoleStateOrchestratorLike,\n  errors: string[],\n): ConsoleExtractionQueueState {\n  try {\n    const depth =\n      typeof orchestrator.getConsoleExtractionQueueDepth === \"function\"\n        ? orchestrator.getConsoleExtractionQueueDepth()\n        : 0;\n    const verdicts =\n      typeof orchestrator.getConsoleExtractionRecentVerdicts === \"function\"\n        ? orchestrator.getConsoleExtractionRecentVerdicts()\n        : [];\n    const recentVerdicts = (verdicts ?? [])\n      .slice(-MAX_VERDICT_TAIL)\n      .map((v) => ({\n        ts: typeof v?.ts === \"string\" ? v.ts : \"\",\n        kind: typeof v?.kind === \"string\" ? v.kind : \"unknown\",\n        ...(typeof v?.reason === \"string\" ? { reason: v.reason } : {}),\n      }));\n    return { depth: Number.isFinite(depth) ? depth : 0, recentVerdicts };\n  } catch (err) {\n    errors.push(`extractionQueue: ${describeError(err)}`);\n    return { depth: 0, recentVerdicts: [] };\n  }\n}\n\nfunction readDedupRecent(\n  orchestrator: ConsoleStateOrchestratorLike,\n  errors: string[],\n): ConsoleDedupDecision[] {\n  try {\n    // Cursor Medium: call directly on `orchestrator` to preserve the\n    // `this` binding. Extracting the method into a local and invoking\n    // it bare loses `this`, so a non-arrow implementation that\n    // references `this` would fail at runtime. Mirrors how\n    // `readExtractionQueue` and `readMaintenanceLedgerTail` invoke\n    // their orchestrator methods.\n    if (typeof orchestrator.getConsoleDedupRecentDecisions !== \"function\") return [];\n    const raw = orchestrator.getConsoleDedupRecentDecisions() ?? [];\n    return raw.slice(-MAX_DEDUP_TAIL).map((d) => ({\n      ts: typeof d?.ts === \"string\" ? d.ts : \"\",\n      decision: typeof d?.decision === \"string\" ? d.decision : \"unknown\",\n      ...(typeof d?.fingerprint === \"string\"\n        ? { fingerprint: d.fingerprint }\n        : {}),\n      ...(typeof d?.similarity === \"number\" && Number.isFinite(d.similarity)\n        ? { similarity: d.similarity }\n        : {}),\n    }));\n  } catch (err) {\n    errors.push(`dedupRecent: ${describeError(err)}`);\n    return [];\n  }\n}\n\n/**\n * Stream a JSONL file line-by-line, parse each row, project it into a\n * console event, and keep only the `topN` most-recent items by `ts`\n * (descending). Memory is bounded at O(2 * topN) regardless of file\n * size — we sort-and-truncate whenever the working buffer grows past\n * `2 * topN`. This satisfies BOTH:\n *\n *   1. \"Don't load the whole file into memory\" — streaming + bounded\n *      buffer means a multi-GB ledger never blows up RAM.\n *   2. \"Don't miss recent rows just because the file isn't sorted by\n *      recency\" — `rebuilt-observations.jsonl` is written sorted by\n *      `(sessionKey, hour)`, NOT by global ts, so a byte-tail-only\n *      read silently dropped recent-but-lexicographically-earlier\n *      sessions. Streaming top-N visits every row and keeps the\n *      globally-most-recent ones.\n *\n * Returns an array sorted oldest-first within the top-N window. Rows\n * with no parseable `ts` are dropped (they would otherwise compare\n * undefined under any sort).\n */\nasync function streamLedgerTopN<T extends { ts: string }>(\n  ledgerPath: string,\n  topN: number,\n  project: (parsed: Record<string, unknown>) => T | null,\n): Promise<T[]> {\n  let stream: ReturnType<typeof createReadStream>;\n  try {\n    // `fs.access`-style probe so we can quietly return `[]` for\n    // ENOENT without hitting the readline error path.\n    await fs.stat(ledgerPath);\n  } catch (err) {\n    const code = (err as NodeJS.ErrnoException).code;\n    if (code === \"ENOENT\") return [];\n    throw err;\n  }\n  try {\n    stream = createReadStream(ledgerPath, { encoding: \"utf-8\" });\n  } catch (err) {\n    const code = (err as NodeJS.ErrnoException).code;\n    if (code === \"ENOENT\") return [];\n    throw err;\n  }\n  const rl = createInterface({ input: stream, crlfDelay: Infinity });\n  const cap = Math.max(1, topN) * 2;\n  const buf: T[] = [];\n  const truncate = () => {\n    // Sort descending by ts, keep top-N, drop the rest.\n    buf.sort((a, b) => {\n      const aMs = Date.parse(a.ts);\n      const bMs = Date.parse(b.ts);\n      if (Number.isFinite(aMs) && Number.isFinite(bMs)) return bMs - aMs;\n      if (Number.isFinite(aMs)) return -1;\n      if (Number.isFinite(bMs)) return 1;\n      return 0;\n    });\n    if (buf.length > topN) buf.length = topN;\n  };\n  try {\n    for await (const line of rl) {\n      const trimmed = line.trim();\n      if (!trimmed) continue;\n      let parsed: unknown;\n      try {\n        parsed = JSON.parse(trimmed);\n      } catch {\n        continue;\n      }\n      if (typeof parsed !== \"object\" || parsed === null || Array.isArray(parsed)) {\n        continue;\n      }\n      const event = project(parsed as Record<string, unknown>);\n      if (event === null) continue;\n      // Drop rows we couldn't even date-stamp — they can't be sorted\n      // meaningfully against the rest of the corpus.\n      if (!event.ts || !Number.isFinite(Date.parse(event.ts))) continue;\n      buf.push(event);\n      if (buf.length >= cap) truncate();\n    }\n  } finally {\n    rl.close();\n    stream.close();\n  }\n  truncate();\n  return buf.reverse(); // oldest-first within the top-N window\n}\n\nfunction projectLedgerRow(p: Record<string, unknown>): ConsoleMaintenanceLedgerEvent | null {\n  // The two canonical writers produce different row shapes:\n  //   - extraction-judge-telemetry: `{ts, verdictKind, reason, candidateCategory, ...}`\n  //   - rebuild-observations / migrate-observations:\n  //     `{sessionKey, hour, turnCount, userTurns, assistantTurns, rebuiltAt}`\n  // Map both into the canonical {ts, category, summary} shape.\n  const ts =\n    typeof p.ts === \"string\" && p.ts.length > 0\n      ? p.ts\n      : typeof p.hour === \"string\" && p.hour.length > 0\n        ? p.hour\n        : typeof p.rebuiltAt === \"string\" && p.rebuiltAt.length > 0\n          ? p.rebuiltAt\n          : \"\";\n  const category =\n    typeof p.category === \"string\" && p.category.length > 0\n      ? p.category\n      : typeof p.verdictKind === \"string\"\n        ? \"judge-verdict\"\n        : typeof p.turnCount === \"number\"\n          ? \"observation\"\n          : \"unknown\";\n  const summary = summarizeLedgerEvent(p);\n  return { ts, category, summary };\n}\n\nasync function readMaintenanceLedgerTail(\n  orchestrator: ConsoleStateOrchestratorLike,\n  errors: string[],\n): Promise<ConsoleMaintenanceLedgerEvent[]> {\n  try {\n    const memoryDir = orchestrator.config?.memoryDir;\n    if (!memoryDir || typeof memoryDir !== \"string\") return [];\n    const ledgerDir = path.join(memoryDir, \"state\", \"observation-ledger\");\n    // Codex review converged on two competing constraints:\n    //   1. Don't load the whole file into memory (multi-GB ledgers\n    //      would OOM the console surface).\n    //   2. Don't miss recent rows just because the file isn't sorted\n    //      by recency (`rebuilt-observations.jsonl` is sorted by\n    //      sessionKey/hour, so byte-tail reads silently drop recent\n    //      lexicographically-earlier sessions).\n    // The right answer is a streaming bounded top-N: visit every row,\n    // but keep only the MAX_LEDGER_TAIL most-recent in memory at any\n    // time. Memory stays O(MAX_LEDGER_TAIL); recency ordering is\n    // globally correct.\n    const verdictsTopN = await streamLedgerTopN(\n      path.join(ledgerDir, \"extraction-judge-verdicts.jsonl\"),\n      MAX_LEDGER_TAIL,\n      projectLedgerRow,\n    );\n    const rebuiltTopN = await streamLedgerTopN(\n      path.join(ledgerDir, \"rebuilt-observations.jsonl\"),\n      MAX_LEDGER_TAIL,\n      projectLedgerRow,\n    );\n    // Merge the two source top-N windows and select the global\n    // top-N. Both inputs already arrive oldest-first within their\n    // respective windows; sort the merged set descending by ts and\n    // take the most-recent MAX_LEDGER_TAIL.\n    const events: ConsoleMaintenanceLedgerEvent[] = [...verdictsTopN, ...rebuiltTopN];\n    if (events.length === 0) return [];\n    events.sort((a, b) => {\n      const aMs = Date.parse(a.ts);\n      const bMs = Date.parse(b.ts);\n      if (Number.isFinite(aMs) && Number.isFinite(bMs)) return bMs - aMs;\n      if (Number.isFinite(aMs)) return -1;\n      if (Number.isFinite(bMs)) return 1;\n      return 0;\n    });\n    const tail = events.slice(0, MAX_LEDGER_TAIL);\n    // Reverse so the caller sees oldest-first within the tail window.\n    return tail.reverse();\n  } catch (err) {\n    errors.push(`maintenanceLedgerTail: ${describeError(err)}`);\n    return [];\n  }\n}\n\nfunction summarizeLedgerEvent(p: Record<string, unknown>): string {\n  const parts: string[] = [];\n  // Judge-verdict rows.\n  if (typeof p.verdictKind === \"string\") parts.push(`verdict=${p.verdictKind}`);\n  if (typeof p.reason === \"string\" && p.reason.length > 0) {\n    const trimmed = p.reason.length > 80 ? `${p.reason.slice(0, 80)}…` : p.reason;\n    parts.push(`reason=${trimmed}`);\n  }\n  if (typeof p.candidateCategory === \"string\") {\n    parts.push(`cat=${p.candidateCategory}`);\n  }\n  // Canonical rebuilt-observations rows (codex P2).\n  if (typeof p.sessionKey === \"string\" && p.sessionKey.length > 0) {\n    parts.push(`session=${p.sessionKey}`);\n  }\n  if (typeof p.turnCount === \"number\" && Number.isFinite(p.turnCount)) {\n    parts.push(`turns=${p.turnCount}`);\n  }\n  if (typeof p.userTurns === \"number\" && Number.isFinite(p.userTurns)) {\n    parts.push(`u=${p.userTurns}`);\n  }\n  if (typeof p.assistantTurns === \"number\" && Number.isFinite(p.assistantTurns)) {\n    parts.push(`a=${p.assistantTurns}`);\n  }\n  if (parts.length === 0) {\n    return typeof p.category === \"string\" ? p.category : \"event\";\n  }\n  return parts.join(\" \");\n}\n\nfunction readQmdProbe(\n  orchestrator: ConsoleStateOrchestratorLike,\n  errors: string[],\n): ConsoleQmdProbeState {\n  try {\n    const qmd = orchestrator.qmd;\n    if (!qmd) {\n      return { available: false, daemonMode: false, debug: \"qmd unavailable\" };\n    }\n    const available =\n      typeof qmd.isAvailable === \"function\" ? qmd.isAvailable() : false;\n    const daemonMode =\n      typeof qmd.isDaemonMode === \"function\" ? qmd.isDaemonMode() : false;\n    const debug =\n      typeof qmd.debugStatus === \"function\" ? qmd.debugStatus() : \"\";\n    return { available, daemonMode, debug };\n  } catch (err) {\n    errors.push(`qmdProbe: ${describeError(err)}`);\n    return { available: false, daemonMode: false, debug: \"\" };\n  }\n}\n\nfunction readDaemonInfo(\n  orchestrator: ConsoleStateOrchestratorLike,\n  errors: string[],\n): ConsoleDaemonInfo {\n  try {\n    if (typeof orchestrator.getConsoleDaemonInfo === \"function\") {\n      const info = orchestrator.getConsoleDaemonInfo();\n      return {\n        uptimeMs: Number.isFinite(info?.uptimeMs) ? info.uptimeMs : 0,\n        version: typeof info?.version === \"string\" ? info.version : \"unknown\",\n      };\n    }\n    // Fallback: process uptime + best-effort package version. This is\n    // only meaningful when the orchestrator runs in the same process\n    // as the CLI (which is the case for `remnic console --state-only`).\n    const uptimeMs = Math.round((process.uptime?.() ?? 0) * 1000);\n    return { uptimeMs, version: resolvePackageVersion() };\n  } catch (err) {\n    errors.push(`daemon: ${describeError(err)}`);\n    return { uptimeMs: 0, version: \"unknown\" };\n  }\n}\n\nfunction resolvePackageVersion(): string {\n  // Best-effort, sync, never throws. We avoid importing package.json\n  // statically because tsup bundles into a single file at runtime.\n  try {\n    const env = process.env?.REMNIC_VERSION;\n    if (typeof env === \"string\" && env.length > 0) return env;\n  } catch {\n    // ignore\n  }\n  return \"unknown\";\n}\n\nfunction describeError(err: unknown): string {\n  if (err instanceof Error) return err.message;\n  try {\n    return String(err);\n  } catch {\n    return \"unknown error\";\n  }\n}\n"],"mappings":";AAuBA,SAAS,YAAY,IAAI,wBAAwB;AACjD,SAAS,uBAAuB;AAChC,OAAO,UAAU;AAsIjB,IAAM,kBAAkB;AACxB,IAAM,mBAAmB;AACzB,IAAM,iBAAiB;AAQvB,eAAsB,mBACpB,cAC+B;AAC/B,QAAM,SAAmB,CAAC;AAC1B,QAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAE1C,QAAM,cAAc,gBAAgB,cAAc,MAAM;AACxD,QAAM,kBAAkB,oBAAoB,cAAc,MAAM;AAChE,QAAM,cAAc,gBAAgB,cAAc,MAAM;AACxD,QAAM,wBAAwB,MAAM;AAAA,IAClC;AAAA,IACA;AAAA,EACF;AACA,QAAM,WAAW,aAAa,cAAc,MAAM;AAClD,QAAM,SAAS,eAAe,cAAc,MAAM;AAIlD,MAAI;AACJ,MAAI;AACF,QAAI,OAAO,aAAa,uCAAuC,YAAY;AACzE,qBAAe,aAAa,mCAAmC;AAAA,IACjE;AAAA,EACF,SAAS,KAAK;AACZ,WAAO,KAAK,iBAAiB,cAAc,GAAG,CAAC,EAAE;AAAA,EACnD;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,eAAe,EAAE,aAAa,IAAI,CAAC;AAAA,IACvC;AAAA,EACF;AACF;AAEA,SAAS,gBACP,cACA,QACoB;AACpB,MAAI;AACF,UAAM,WAAW,aAAa,QAAQ;AACtC,QAAI,OAAO,aAAa,YAAY;AAClC,aAAO,EAAE,YAAY,GAAG,WAAW,EAAE;AAAA,IACvC;AACA,UAAM,QAAQ,SAAS,KAAK,aAAa,MAAM,KAAK,CAAC;AACrD,QAAI,YAAY;AAChB,eAAW,QAAQ,OAAO;AACxB,YAAM,UAAU,OAAO,MAAM,YAAY,WAAW,KAAK,UAAU;AACnE,mBAAa,OAAO,WAAW,SAAS,MAAM;AAAA,IAChD;AACA,WAAO,EAAE,YAAY,MAAM,QAAQ,UAAU;AAAA,EAC/C,SAAS,KAAK;AACZ,WAAO,KAAK,gBAAgB,cAAc,GAAG,CAAC,EAAE;AAChD,WAAO,EAAE,YAAY,GAAG,WAAW,EAAE;AAAA,EACvC;AACF;AAEA,SAAS,oBACP,cACA,QAC6B;AAC7B,MAAI;AACF,UAAM,QACJ,OAAO,aAAa,mCAAmC,aACnD,aAAa,+BAA+B,IAC5C;AACN,UAAM,WACJ,OAAO,aAAa,uCAAuC,aACvD,aAAa,mCAAmC,IAChD,CAAC;AACP,UAAM,kBAAkB,YAAY,CAAC,GAClC,MAAM,CAAC,gBAAgB,EACvB,IAAI,CAAC,OAAO;AAAA,MACX,IAAI,OAAO,GAAG,OAAO,WAAW,EAAE,KAAK;AAAA,MACvC,MAAM,OAAO,GAAG,SAAS,WAAW,EAAE,OAAO;AAAA,MAC7C,GAAI,OAAO,GAAG,WAAW,WAAW,EAAE,QAAQ,EAAE,OAAO,IAAI,CAAC;AAAA,IAC9D,EAAE;AACJ,WAAO,EAAE,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ,GAAG,eAAe;AAAA,EACrE,SAAS,KAAK;AACZ,WAAO,KAAK,oBAAoB,cAAc,GAAG,CAAC,EAAE;AACpD,WAAO,EAAE,OAAO,GAAG,gBAAgB,CAAC,EAAE;AAAA,EACxC;AACF;AAEA,SAAS,gBACP,cACA,QACwB;AACxB,MAAI;AAOF,QAAI,OAAO,aAAa,mCAAmC,WAAY,QAAO,CAAC;AAC/E,UAAM,MAAM,aAAa,+BAA+B,KAAK,CAAC;AAC9D,WAAO,IAAI,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,OAAO;AAAA,MAC5C,IAAI,OAAO,GAAG,OAAO,WAAW,EAAE,KAAK;AAAA,MACvC,UAAU,OAAO,GAAG,aAAa,WAAW,EAAE,WAAW;AAAA,MACzD,GAAI,OAAO,GAAG,gBAAgB,WAC1B,EAAE,aAAa,EAAE,YAAY,IAC7B,CAAC;AAAA,MACL,GAAI,OAAO,GAAG,eAAe,YAAY,OAAO,SAAS,EAAE,UAAU,IACjE,EAAE,YAAY,EAAE,WAAW,IAC3B,CAAC;AAAA,IACP,EAAE;AAAA,EACJ,SAAS,KAAK;AACZ,WAAO,KAAK,gBAAgB,cAAc,GAAG,CAAC,EAAE;AAChD,WAAO,CAAC;AAAA,EACV;AACF;AAsBA,eAAe,iBACb,YACA,MACA,SACc;AACd,MAAI;AACJ,MAAI;AAGF,UAAM,GAAG,KAAK,UAAU;AAAA,EAC1B,SAAS,KAAK;AACZ,UAAM,OAAQ,IAA8B;AAC5C,QAAI,SAAS,SAAU,QAAO,CAAC;AAC/B,UAAM;AAAA,EACR;AACA,MAAI;AACF,aAAS,iBAAiB,YAAY,EAAE,UAAU,QAAQ,CAAC;AAAA,EAC7D,SAAS,KAAK;AACZ,UAAM,OAAQ,IAA8B;AAC5C,QAAI,SAAS,SAAU,QAAO,CAAC;AAC/B,UAAM;AAAA,EACR;AACA,QAAM,KAAK,gBAAgB,EAAE,OAAO,QAAQ,WAAW,SAAS,CAAC;AACjE,QAAM,MAAM,KAAK,IAAI,GAAG,IAAI,IAAI;AAChC,QAAM,MAAW,CAAC;AAClB,QAAM,WAAW,MAAM;AAErB,QAAI,KAAK,CAAC,GAAG,MAAM;AACjB,YAAM,MAAM,KAAK,MAAM,EAAE,EAAE;AAC3B,YAAM,MAAM,KAAK,MAAM,EAAE,EAAE;AAC3B,UAAI,OAAO,SAAS,GAAG,KAAK,OAAO,SAAS,GAAG,EAAG,QAAO,MAAM;AAC/D,UAAI,OAAO,SAAS,GAAG,EAAG,QAAO;AACjC,UAAI,OAAO,SAAS,GAAG,EAAG,QAAO;AACjC,aAAO;AAAA,IACT,CAAC;AACD,QAAI,IAAI,SAAS,KAAM,KAAI,SAAS;AAAA,EACtC;AACA,MAAI;AACF,qBAAiB,QAAQ,IAAI;AAC3B,YAAM,UAAU,KAAK,KAAK;AAC1B,UAAI,CAAC,QAAS;AACd,UAAI;AACJ,UAAI;AACF,iBAAS,KAAK,MAAM,OAAO;AAAA,MAC7B,QAAQ;AACN;AAAA,MACF;AACA,UAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,MAAM,GAAG;AAC1E;AAAA,MACF;AACA,YAAM,QAAQ,QAAQ,MAAiC;AACvD,UAAI,UAAU,KAAM;AAGpB,UAAI,CAAC,MAAM,MAAM,CAAC,OAAO,SAAS,KAAK,MAAM,MAAM,EAAE,CAAC,EAAG;AACzD,UAAI,KAAK,KAAK;AACd,UAAI,IAAI,UAAU,IAAK,UAAS;AAAA,IAClC;AAAA,EACF,UAAE;AACA,OAAG,MAAM;AACT,WAAO,MAAM;AAAA,EACf;AACA,WAAS;AACT,SAAO,IAAI,QAAQ;AACrB;AAEA,SAAS,iBAAiB,GAAkE;AAM1F,QAAM,KACJ,OAAO,EAAE,OAAO,YAAY,EAAE,GAAG,SAAS,IACtC,EAAE,KACF,OAAO,EAAE,SAAS,YAAY,EAAE,KAAK,SAAS,IAC5C,EAAE,OACF,OAAO,EAAE,cAAc,YAAY,EAAE,UAAU,SAAS,IACtD,EAAE,YACF;AACV,QAAM,WACJ,OAAO,EAAE,aAAa,YAAY,EAAE,SAAS,SAAS,IAClD,EAAE,WACF,OAAO,EAAE,gBAAgB,WACvB,kBACA,OAAO,EAAE,cAAc,WACrB,gBACA;AACV,QAAM,UAAU,qBAAqB,CAAC;AACtC,SAAO,EAAE,IAAI,UAAU,QAAQ;AACjC;AAEA,eAAe,0BACb,cACA,QAC0C;AAC1C,MAAI;AACF,UAAM,YAAY,aAAa,QAAQ;AACvC,QAAI,CAAC,aAAa,OAAO,cAAc,SAAU,QAAO,CAAC;AACzD,UAAM,YAAY,KAAK,KAAK,WAAW,SAAS,oBAAoB;AAYpE,UAAM,eAAe,MAAM;AAAA,MACzB,KAAK,KAAK,WAAW,iCAAiC;AAAA,MACtD;AAAA,MACA;AAAA,IACF;AACA,UAAM,cAAc,MAAM;AAAA,MACxB,KAAK,KAAK,WAAW,4BAA4B;AAAA,MACjD;AAAA,MACA;AAAA,IACF;AAKA,UAAM,SAA0C,CAAC,GAAG,cAAc,GAAG,WAAW;AAChF,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,WAAO,KAAK,CAAC,GAAG,MAAM;AACpB,YAAM,MAAM,KAAK,MAAM,EAAE,EAAE;AAC3B,YAAM,MAAM,KAAK,MAAM,EAAE,EAAE;AAC3B,UAAI,OAAO,SAAS,GAAG,KAAK,OAAO,SAAS,GAAG,EAAG,QAAO,MAAM;AAC/D,UAAI,OAAO,SAAS,GAAG,EAAG,QAAO;AACjC,UAAI,OAAO,SAAS,GAAG,EAAG,QAAO;AACjC,aAAO;AAAA,IACT,CAAC;AACD,UAAM,OAAO,OAAO,MAAM,GAAG,eAAe;AAE5C,WAAO,KAAK,QAAQ;AAAA,EACtB,SAAS,KAAK;AACZ,WAAO,KAAK,0BAA0B,cAAc,GAAG,CAAC,EAAE;AAC1D,WAAO,CAAC;AAAA,EACV;AACF;AAEA,SAAS,qBAAqB,GAAoC;AAChE,QAAM,QAAkB,CAAC;AAEzB,MAAI,OAAO,EAAE,gBAAgB,SAAU,OAAM,KAAK,WAAW,EAAE,WAAW,EAAE;AAC5E,MAAI,OAAO,EAAE,WAAW,YAAY,EAAE,OAAO,SAAS,GAAG;AACvD,UAAM,UAAU,EAAE,OAAO,SAAS,KAAK,GAAG,EAAE,OAAO,MAAM,GAAG,EAAE,CAAC,WAAM,EAAE;AACvE,UAAM,KAAK,UAAU,OAAO,EAAE;AAAA,EAChC;AACA,MAAI,OAAO,EAAE,sBAAsB,UAAU;AAC3C,UAAM,KAAK,OAAO,EAAE,iBAAiB,EAAE;AAAA,EACzC;AAEA,MAAI,OAAO,EAAE,eAAe,YAAY,EAAE,WAAW,SAAS,GAAG;AAC/D,UAAM,KAAK,WAAW,EAAE,UAAU,EAAE;AAAA,EACtC;AACA,MAAI,OAAO,EAAE,cAAc,YAAY,OAAO,SAAS,EAAE,SAAS,GAAG;AACnE,UAAM,KAAK,SAAS,EAAE,SAAS,EAAE;AAAA,EACnC;AACA,MAAI,OAAO,EAAE,cAAc,YAAY,OAAO,SAAS,EAAE,SAAS,GAAG;AACnE,UAAM,KAAK,KAAK,EAAE,SAAS,EAAE;AAAA,EAC/B;AACA,MAAI,OAAO,EAAE,mBAAmB,YAAY,OAAO,SAAS,EAAE,cAAc,GAAG;AAC7E,UAAM,KAAK,KAAK,EAAE,cAAc,EAAE;AAAA,EACpC;AACA,MAAI,MAAM,WAAW,GAAG;AACtB,WAAO,OAAO,EAAE,aAAa,WAAW,EAAE,WAAW;AAAA,EACvD;AACA,SAAO,MAAM,KAAK,GAAG;AACvB;AAEA,SAAS,aACP,cACA,QACsB;AACtB,MAAI;AACF,UAAM,MAAM,aAAa;AACzB,QAAI,CAAC,KAAK;AACR,aAAO,EAAE,WAAW,OAAO,YAAY,OAAO,OAAO,kBAAkB;AAAA,IACzE;AACA,UAAM,YACJ,OAAO,IAAI,gBAAgB,aAAa,IAAI,YAAY,IAAI;AAC9D,UAAM,aACJ,OAAO,IAAI,iBAAiB,aAAa,IAAI,aAAa,IAAI;AAChE,UAAM,QACJ,OAAO,IAAI,gBAAgB,aAAa,IAAI,YAAY,IAAI;AAC9D,WAAO,EAAE,WAAW,YAAY,MAAM;AAAA,EACxC,SAAS,KAAK;AACZ,WAAO,KAAK,aAAa,cAAc,GAAG,CAAC,EAAE;AAC7C,WAAO,EAAE,WAAW,OAAO,YAAY,OAAO,OAAO,GAAG;AAAA,EAC1D;AACF;AAEA,SAAS,eACP,cACA,QACmB;AACnB,MAAI;AACF,QAAI,OAAO,aAAa,yBAAyB,YAAY;AAC3D,YAAM,OAAO,aAAa,qBAAqB;AAC/C,aAAO;AAAA,QACL,UAAU,OAAO,SAAS,MAAM,QAAQ,IAAI,KAAK,WAAW;AAAA,QAC5D,SAAS,OAAO,MAAM,YAAY,WAAW,KAAK,UAAU;AAAA,MAC9D;AAAA,IACF;AAIA,UAAM,WAAW,KAAK,OAAO,QAAQ,SAAS,KAAK,KAAK,GAAI;AAC5D,WAAO,EAAE,UAAU,SAAS,sBAAsB,EAAE;AAAA,EACtD,SAAS,KAAK;AACZ,WAAO,KAAK,WAAW,cAAc,GAAG,CAAC,EAAE;AAC3C,WAAO,EAAE,UAAU,GAAG,SAAS,UAAU;AAAA,EAC3C;AACF;AAEA,SAAS,wBAAgC;AAGvC,MAAI;AACF,UAAM,MAAM,QAAQ,KAAK;AACzB,QAAI,OAAO,QAAQ,YAAY,IAAI,SAAS,EAAG,QAAO;AAAA,EACxD,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAsB;AAC3C,MAAI,eAAe,MAAO,QAAO,IAAI;AACrC,MAAI;AACF,WAAO,OAAO,GAAG;AAAA,EACnB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;","names":[]}

package/dist/chunk-HKET3ZOI.js

@@ -0,0 +1,381 @@
+import {
+  memoryStoreRequestSchema
+} from "./chunk-JI6HWBYL.js";
+import {
+  defineOperation
+} from "./chunk-NFMDHE45.js";
+import {
+  DECISION_SUBCOMMANDS,
+  DELTA_SUBCOMMANDS,
+  isCodegraphToolName
+} from "./chunk-N4PD5IY3.js";
+
+// src/access-operations.ts
+import { z } from "zod";
+var memoryGetSchema = z.object({
+  memoryId: z.string().trim().min(1, "memoryId is required").max(512),
+  namespace: z.string().trim().max(256).nullable().optional()
+});
+var memoryGetOperation = defineOperation({
+  name: "memory_get",
+  description: "Fetch one memory by id.",
+  schema: memoryGetSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.memoryGet(
+      input.memoryId,
+      input.namespace ?? void 0,
+      ctx.authenticatedPrincipal
+    );
+    return { result };
+  }
+});
+var memorySearchSchema = z.object({
+  query: z.string().trim().min(1, "query is required").max(2048),
+  namespace: z.string().trim().max(256).nullable().optional(),
+  // No upper cap: the pre-boundary MCP handler forwarded any finite number to
+  // memorySearch, and the QMD/search backends honor large limits. Capping at
+  // 100 would reject existing clients that request larger result sets.
+  maxResults: z.number().int().min(1).nullable().optional(),
+  collection: z.string().trim().min(1).max(256).nullable().optional()
+});
+var memorySearchOperation = defineOperation({
+  name: "memory_search",
+  description: "Search memories across readable namespaces.",
+  schema: memorySearchSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.memorySearch({
+      query: input.query,
+      namespace: input.namespace ?? void 0,
+      maxResults: input.maxResults ?? void 0,
+      collection: input.collection ?? void 0,
+      principal: ctx.authenticatedPrincipal
+    });
+    return { result };
+  }
+});
+var memoryStoreOperation = defineOperation({
+  name: "memory_store",
+  description: "Store an explicit memory through the access layer.",
+  // Reuse the existing schema verbatim — the migration is behavior-preserving;
+  // the schema's external contract is NOT changing in this PR (per the issue's
+  // pitfall note).
+  schema: memoryStoreRequestSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.memoryStore(
+      {
+        ...input,
+        authenticatedPrincipal: ctx.authenticatedPrincipal
+      },
+      // Forward transport-level hooks (e.g. HTTP's atomic write-quota gate)
+      // so the hook still fires inside the service's idempotent-write lock —
+      // never before, never on a replay (#1434 invariant preserved by the
+      // boundary migration).
+      ctx.hooks
+    );
+    return { result };
+  }
+});
+var codingDecisionSchema = z.preprocess(
+  (data) => {
+    if (data && typeof data === "object" && !Array.isArray(data)) {
+      const out = {};
+      for (const [k, v] of Object.entries(data)) {
+        if (v !== null) out[k] = v;
+      }
+      return out;
+    }
+    return data;
+  },
+  z.object({
+    subcommand: z.enum(DECISION_SUBCOMMANDS),
+    sessionKey: z.string().trim().max(512).optional(),
+    namespace: z.string().trim().max(256).optional(),
+    id: z.string().trim().max(512).optional(),
+    title: z.string().trim().max(512).optional(),
+    status: z.string().trim().max(64).optional(),
+    context: z.string().trim().max(8192).optional(),
+    decision: z.string().trim().max(8192).optional(),
+    consequences: z.string().trim().max(8192).optional(),
+    entityRefs: z.array(z.string().trim().min(1).max(256)).optional(),
+    supersedesId: z.string().trim().max(512).optional()
+  })
+);
+var codingDecisionOperation = defineOperation({
+  name: "coding_decision",
+  description: "List, get, record, or supersede decision records in the session's coding namespace (issue #1548 Track A).",
+  schema: codingDecisionSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codingDecision(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codingArchitectureSchema = z.preprocess(
+  (data) => {
+    if (data !== null && typeof data === "object" && !Array.isArray(data)) {
+      const obj = data;
+      const cleaned = {};
+      for (const [key, value] of Object.entries(obj)) {
+        if (value !== null) cleaned[key] = value;
+      }
+      return cleaned;
+    }
+    return data;
+  },
+  z.object({
+    subcommand: z.enum(["get", "refresh"]),
+    sessionKey: z.string().optional(),
+    namespace: z.string().optional()
+  })
+);
+var codingArchitectureOperation = defineOperation({
+  name: "coding_architecture",
+  description: "Get or refresh the architecture card for the session's coding namespace (issue #1548 Track A PR 3).",
+  schema: codingArchitectureSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codingArchitecture(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphSurfaceSchema = z.preprocess(
+  (data) => {
+    if (data !== null && typeof data === "object" && !Array.isArray(data)) {
+      const obj = data;
+      const cleaned = {};
+      for (const [key, value] of Object.entries(obj)) {
+        if (value !== null) cleaned[key] = value;
+      }
+      return cleaned;
+    }
+    return data;
+  },
+  z.object({
+    tool: z.string().refine(isCodegraphToolName, {
+      message: "tool must be one of the codegraph tool names"
+    }),
+    sessionKey: z.string().max(512).optional(),
+    principal: z.string().max(256).optional(),
+    project: z.string().max(256).optional(),
+    query: z.string().max(2048).optional(),
+    limit: z.number().int().positive().max(200).optional(),
+    start: z.string().max(512).optional(),
+    direction: z.string().max(64).optional(),
+    depth: z.number().int().positive().max(10).optional(),
+    qualifiedName: z.string().max(1024).optional(),
+    path: z.string().max(2048).optional(),
+    structuredQuery: z.record(z.string(), z.unknown()).optional(),
+    head: z.string().max(256).optional(),
+    repoRoot: z.string().max(2048).optional(),
+    mode: z.string().max(64).optional(),
+    confirm: z.boolean().optional(),
+    subcommand: z.string().max(64).optional(),
+    id: z.string().max(512).optional(),
+    title: z.string().max(512).optional(),
+    status: z.string().max(64).optional(),
+    context: z.string().max(8192).optional(),
+    decision: z.string().max(8192).optional(),
+    consequences: z.string().max(8192).optional(),
+    entityRefs: z.array(z.string().max(256)).optional(),
+    supersedesId: z.string().max(512).optional(),
+    traces: z.array(z.unknown()).optional()
+  })
+);
+var codingDeltaSchema = z.preprocess(
+  (data) => {
+    if (data !== null && typeof data === "object" && !Array.isArray(data)) {
+      const obj = data;
+      const cleaned = {};
+      for (const [key, value] of Object.entries(obj)) {
+        if (value !== null) cleaned[key] = value;
+      }
+      return cleaned;
+    }
+    return data;
+  },
+  z.object({
+    subcommand: z.enum(DELTA_SUBCOMMANDS),
+    sessionKey: z.string().trim().max(512).optional(),
+    namespace: z.string().trim().max(256).optional()
+  })
+);
+var codingDeltaOperation = defineOperation({
+  name: "coding_delta",
+  description: "Get the session delta (commits + touched files since last seen) for the session's coding namespace (issue #1548 Track A PR 4).",
+  schema: codingDeltaSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codingDelta(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphIndexOperation = defineOperation({
+  name: "codegraph_index",
+  description: "Codegraph parity tool (issue #1554): index. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphListProjectsOperation = defineOperation({
+  name: "codegraph_list_projects",
+  description: "Codegraph parity tool (issue #1554): list_projects. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphDeleteProjectOperation = defineOperation({
+  name: "codegraph_delete_project",
+  description: "Codegraph parity tool (issue #1554): delete_project. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphIndexStatusOperation = defineOperation({
+  name: "codegraph_index_status",
+  description: "Codegraph parity tool (issue #1554): index_status. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphSearchGraphOperation = defineOperation({
+  name: "codegraph_search_graph",
+  description: "Codegraph parity tool (issue #1554): search_graph. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphTracePathOperation = defineOperation({
+  name: "codegraph_trace_path",
+  description: "Codegraph parity tool (issue #1554): trace_path. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphDetectChangesOperation = defineOperation({
+  name: "codegraph_detect_changes",
+  description: "Codegraph parity tool (issue #1554): detect_changes. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphQueryGraphOperation = defineOperation({
+  name: "codegraph_query_graph",
+  description: "Codegraph parity tool (issue #1554): query_graph. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphGetSchemaOperation = defineOperation({
+  name: "codegraph_get_schema",
+  description: "Codegraph parity tool (issue #1554): get_schema. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphGetSnippetOperation = defineOperation({
+  name: "codegraph_get_snippet",
+  description: "Codegraph parity tool (issue #1554): get_snippet. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphGetArchitectureOperation = defineOperation({
+  name: "codegraph_get_architecture",
+  description: "Codegraph parity tool (issue #1554): get_architecture. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphSearchCodeOperation = defineOperation({
+  name: "codegraph_search_code",
+  description: "Codegraph parity tool (issue #1554): search_code. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphManageAdrOperation = defineOperation({
+  name: "codegraph_manage_adr",
+  description: "Codegraph parity tool (issue #1554): manage_adr. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var codegraphIngestTracesOperation = defineOperation({
+  name: "codegraph_ingest_traces",
+  description: "Codegraph parity tool (issue #1554): ingest_traces. Delegates to the shared codegraph surface handler.",
+  schema: codegraphSurfaceSchema,
+  handler: async (input, ctx) => {
+    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);
+    return { result };
+  }
+});
+var REGISTERED_OPERATIONS = [
+  memoryGetOperation.spec.name,
+  memorySearchOperation.spec.name,
+  memoryStoreOperation.spec.name,
+  codingDecisionOperation.spec.name,
+  codingArchitectureOperation.spec.name,
+  codegraphIndexOperation.spec.name,
+  codegraphListProjectsOperation.spec.name,
+  codegraphDeleteProjectOperation.spec.name,
+  codegraphIndexStatusOperation.spec.name,
+  codegraphSearchGraphOperation.spec.name,
+  codegraphTracePathOperation.spec.name,
+  codegraphDetectChangesOperation.spec.name,
+  codegraphQueryGraphOperation.spec.name,
+  codegraphGetSchemaOperation.spec.name,
+  codegraphGetSnippetOperation.spec.name,
+  codegraphGetArchitectureOperation.spec.name,
+  codegraphSearchCodeOperation.spec.name,
+  codegraphManageAdrOperation.spec.name,
+  codegraphIngestTracesOperation.spec.name,
+  codingDeltaOperation.spec.name
+];
+
+export {
+  memoryGetOperation,
+  memorySearchOperation,
+  memoryStoreOperation,
+  codingDecisionOperation,
+  codingArchitectureOperation,
+  codingDeltaOperation,
+  codegraphIndexOperation,
+  codegraphListProjectsOperation,
+  codegraphDeleteProjectOperation,
+  codegraphIndexStatusOperation,
+  codegraphSearchGraphOperation,
+  codegraphTracePathOperation,
+  codegraphDetectChangesOperation,
+  codegraphQueryGraphOperation,
+  codegraphGetSchemaOperation,
+  codegraphGetSnippetOperation,
+  codegraphGetArchitectureOperation,
+  codegraphSearchCodeOperation,
+  codegraphManageAdrOperation,
+  codegraphIngestTracesOperation,
+  REGISTERED_OPERATIONS
+};
+//# sourceMappingURL=chunk-HKET3ZOI.js.map

package/dist/chunk-HKET3ZOI.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/access-operations.ts"],"sourcesContent":["/**\n * Pilot operation definitions for the access boundary (issue #1525).\n *\n * Three operations migrate through the registry in this PR — `memory_get`,\n * `memory_search`, and the `memory_store` write op — so the boundary's\n * normalization matrix (rules 17/28/36/48/51) and shared error mapping reach\n * MCP, HTTP, and CLI from one place. Domain-group migrations (memory ops →\n * connectors → namespaces …) land as follow-up PRs that add `defineOperation`\n * calls here and delete the surface-local validation they replace.\n *\n * Importing this module for its side effects registers the pilot operations;\n * surfaces then dispatch via {@link getOperation} from `./access-boundary.js`.\n */\n\nimport { z } from \"zod\";\n\nimport { defineOperation } from \"./access-boundary.js\";\nimport { memoryStoreRequestSchema, type MemoryStoreRequest } from \"./access-schema.js\";\nimport type {\n  EngramAccessMemoryResponse,\n  EngramAccessWriteResponse,\n} from \"./access-service.js\";\nimport {\n  DECISION_SUBCOMMANDS,\n  type DecisionSurfaceRequest,\n  type DecisionSurfaceResponse,\n} from \"./coding/decision-surfaces.js\";\nimport {\n  type ArchitectureSurfaceRequest,\n  type ArchitectureSurfaceResponse,\n} from \"./coding/architecture-surfaces.js\";\nimport {\n  type CodegraphSurfaceRequest,\n  type CodegraphSurfaceResponse,\n  isCodegraphToolName,\n} from \"./coding/codegraph-surfaces.js\";\nimport {\n  DELTA_SUBCOMMANDS,\n  type DeltaSurfaceRequest,\n  type DeltaSurfaceResponse,\n} from \"./coding/session-delta-surfaces.js\";\n\n// ---------------------------------------------------------------------------\n// memory_get — fetch one memory by id\n// ---------------------------------------------------------------------------\n\n/**\n * `memoryId` is required and non-empty (rule 51: the MCP dispatcher previously\n * fell back to `typeof args.memoryId === \"string\" ? args.memoryId : \"\"`,\n * silently passing an empty id into the service). `namespace` is\n * `.nullable().optional()` because MCP clients send `null` (gotcha #2).\n * `namespace` has no `.min(1)` because the pre-boundary handlers forwarded\n * empty/whitespace strings, and `resolveNamespace` treats empty identically\n * to absent (both trim to falsy → default namespace). Rejecting empty would\n * break HTTP callers that send a bare `?namespace=` (Cursor review).\n */\nconst memoryGetSchema = z.object({\n  memoryId: z.string().trim().min(1, \"memoryId is required\").max(512),\n  namespace: z.string().trim().max(256).nullable().optional(),\n});\n\nexport interface MemoryGetInput {\n  readonly memoryId: string;\n  readonly namespace?: string | null;\n}\n\nexport interface MemoryGetOutput {\n  readonly result: EngramAccessMemoryResponse;\n}\n\nexport const memoryGetOperation = defineOperation<MemoryGetInput, MemoryGetOutput>({\n  name: \"memory_get\",\n  description: \"Fetch one memory by id.\",\n  schema: memoryGetSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.memoryGet(\n      input.memoryId,\n      input.namespace ?? undefined,\n      ctx.authenticatedPrincipal,\n    );\n    return { result };\n  },\n});\n\n// ---------------------------------------------------------------------------\n// memory_search — semantic search across memories\n// ---------------------------------------------------------------------------\n\nconst memorySearchSchema = z.object({\n  query: z.string().trim().min(1, \"query is required\").max(2048),\n  namespace: z.string().trim().max(256).nullable().optional(),\n  // No upper cap: the pre-boundary MCP handler forwarded any finite number to\n  // memorySearch, and the QMD/search backends honor large limits. Capping at\n  // 100 would reject existing clients that request larger result sets.\n  maxResults: z.number().int().min(1).nullable().optional(),\n  collection: z.string().trim().min(1).max(256).nullable().optional(),\n});\n\nexport interface MemorySearchInput {\n  readonly query: string;\n  readonly namespace?: string | null;\n  readonly maxResults?: number | null;\n  readonly collection?: string | null;\n}\n\nexport interface MemorySearchOutput {\n  readonly result: {\n    readonly query: string;\n    readonly results: ReadonlyArray<{ path: string; score: number; snippet: string }>;\n    readonly count: number;\n  };\n}\n\nexport const memorySearchOperation = defineOperation<MemorySearchInput, MemorySearchOutput>({\n  name: \"memory_search\",\n  description: \"Search memories across readable namespaces.\",\n  schema: memorySearchSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.memorySearch({\n      query: input.query,\n      namespace: input.namespace ?? undefined,\n      maxResults: input.maxResults ?? undefined,\n      collection: input.collection ?? undefined,\n      principal: ctx.authenticatedPrincipal,\n    });\n    return { result };\n  },\n});\n\n// ---------------------------------------------------------------------------\n// memory_store — the pilot WRITE op\n// ---------------------------------------------------------------------------\n\nexport type MemoryStoreInput = MemoryStoreRequest;\n\nexport interface MemoryStoreOutput {\n  readonly result: EngramAccessWriteResponse;\n}\n\nexport const memoryStoreOperation = defineOperation<MemoryStoreInput, MemoryStoreOutput>({\n  name: \"memory_store\",\n  description: \"Store an explicit memory through the access layer.\",\n  // Reuse the existing schema verbatim — the migration is behavior-preserving;\n  // the schema's external contract is NOT changing in this PR (per the issue's\n  // pitfall note).\n  schema: memoryStoreRequestSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.memoryStore(\n      {\n        ...input,\n        authenticatedPrincipal: ctx.authenticatedPrincipal,\n      },\n      // Forward transport-level hooks (e.g. HTTP's atomic write-quota gate)\n      // so the hook still fires inside the service's idempotent-write lock —\n      // never before, never on a replay (#1434 invariant preserved by the\n      // boundary migration).\n\n      ctx.hooks,\n    );\n    return { result };\n  },\n});\n\n// ---------------------------------------------------------------------------\n// coding_decision — decision-record surfaces (issue #1548 Track A PR 2)\n// ---------------------------------------------------------------------------\n\n/**\n * The subcommand field is required and MUST be one of the four valid values\n * (rule 51 — reject loudly, list the options, never silently default). The\n * remaining fields are optional because each subcommand uses a different\n * subset; the handler validates subcommand-specific requirements after\n * routing.\n */\n/**\n * MCP clients send `null` for absent optional fields. Zod `.optional()`\n * rejects `null`, so strip nulls at the object level before the inner\n * schema validates (review: cursor null-field thread).\n */\nconst codingDecisionSchema = z.preprocess(\n  (data) => {\n    if (data && typeof data === \"object\" && !Array.isArray(data)) {\n      const out: Record<string, unknown> = {};\n      for (const [k, v] of Object.entries(data as Record<string, unknown>)) {\n        if (v !== null) out[k] = v;\n      }\n      return out;\n    }\n    return data;\n  },\n  z.object({\n    subcommand: z.enum(DECISION_SUBCOMMANDS),\n    sessionKey: z.string().trim().max(512).optional(),\n    namespace: z.string().trim().max(256).optional(),\n    id: z.string().trim().max(512).optional(),\n    title: z.string().trim().max(512).optional(),\n    status: z.string().trim().max(64).optional(),\n    context: z.string().trim().max(8192).optional(),\n    decision: z.string().trim().max(8192).optional(),\n    consequences: z.string().trim().max(8192).optional(),\n    entityRefs: z.array(z.string().trim().min(1).max(256)).optional(),\n    supersedesId: z.string().trim().max(512).optional(),\n  }),\n);\n\nexport type CodingDecisionInput = DecisionSurfaceRequest;\nexport type CodingDecisionOutput = { result: DecisionSurfaceResponse };\n\nexport const codingDecisionOperation = defineOperation<\n  CodingDecisionInput,\n  CodingDecisionOutput\n>({\n  name: \"coding_decision\",\n  description:\n    \"List, get, record, or supersede decision records in the session's coding namespace (issue #1548 Track A).\",\n  schema: codingDecisionSchema as z.ZodType<CodingDecisionInput>,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codingDecision(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\n// ---------------------------------------------------------------------------\n// coding_architecture — architecture-card surfaces (issue #1548 Track A PR 3)\n// ---------------------------------------------------------------------------\n\nconst codingArchitectureSchema = z.preprocess(\n  (data) => {\n    if (data !== null && typeof data === \"object\" && !Array.isArray(data)) {\n      const obj = data as Record<string, unknown>;\n      const cleaned: Record<string, unknown> = {};\n      for (const [key, value] of Object.entries(obj)) {\n        if (value !== null) cleaned[key] = value;\n      }\n      return cleaned;\n    }\n    return data;\n  },\n  z.object({\n    subcommand: z.enum([\"get\", \"refresh\"]),\n    sessionKey: z.string().optional(),\n    namespace: z.string().optional(),\n  }),\n);\n\nexport type CodingArchitectureInput = ArchitectureSurfaceRequest;\nexport type CodingArchitectureOutput = { result: ArchitectureSurfaceResponse };\n\nexport const codingArchitectureOperation = defineOperation<\n  CodingArchitectureInput,\n  CodingArchitectureOutput\n>({\n  name: \"coding_architecture\",\n  description:\n    \"Get or refresh the architecture card for the session's coding namespace (issue #1548 Track A PR 3).\",\n  schema: codingArchitectureSchema as z.ZodType<CodingArchitectureInput>,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codingArchitecture(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nconst codegraphSurfaceSchema = z.preprocess(\n  (data) => {\n    if (data !== null && typeof data === \"object\" && !Array.isArray(data)) {\n      const obj = data as Record<string, unknown>;\n      const cleaned: Record<string, unknown> = {};\n      for (const [key, value] of Object.entries(obj)) {\n        if (value !== null) cleaned[key] = value;\n      }\n      return cleaned;\n    }\n    return data;\n  },\n  z.object({\n    tool: z.string().refine(isCodegraphToolName, {\n      message: \"tool must be one of the codegraph tool names\",\n    }),\n    sessionKey: z.string().max(512).optional(),\n    principal: z.string().max(256).optional(),\n    project: z.string().max(256).optional(),\n    query: z.string().max(2048).optional(),\n    limit: z.number().int().positive().max(200).optional(),\n    start: z.string().max(512).optional(),\n    direction: z.string().max(64).optional(),\n    depth: z.number().int().positive().max(10).optional(),\n    qualifiedName: z.string().max(1024).optional(),\n    path: z.string().max(2048).optional(),\n    structuredQuery: z.record(z.string(), z.unknown()).optional(),\n    head: z.string().max(256).optional(),\n    repoRoot: z.string().max(2048).optional(),\n    mode: z.string().max(64).optional(),\n    confirm: z.boolean().optional(),\n    subcommand: z.string().max(64).optional(),\n    id: z.string().max(512).optional(),\n    title: z.string().max(512).optional(),\n    status: z.string().max(64).optional(),\n    context: z.string().max(8192).optional(),\n    decision: z.string().max(8192).optional(),\n    consequences: z.string().max(8192).optional(),\n    entityRefs: z.array(z.string().max(256)).optional(),\n    supersedesId: z.string().max(512).optional(),\n    traces: z.array(z.unknown()).optional(),\n  }),\n) as z.ZodType<CodegraphSurfaceRequest>;\n\n// ---------------------------------------------------------------------------\n// coding_delta — session-delta surface (issue #1548 Track A PR 4)\n// ---------------------------------------------------------------------------\n\nconst codingDeltaSchema = z.preprocess(\n  (data) => {\n    if (data !== null && typeof data === \"object\" && !Array.isArray(data)) {\n      const obj = data as Record<string, unknown>;\n      const cleaned: Record<string, unknown> = {};\n      for (const [key, value] of Object.entries(obj)) {\n        if (value !== null) cleaned[key] = value;\n      }\n      return cleaned;\n    }\n    return data;\n  },\n  z.object({\n    subcommand: z.enum(DELTA_SUBCOMMANDS),\n    sessionKey: z.string().trim().max(512).optional(),\n    namespace: z.string().trim().max(256).optional(),\n  }),\n);\n\nexport type CodingDeltaInput = DeltaSurfaceRequest;\nexport type CodingDeltaOutput = { result: DeltaSurfaceResponse };\n\nexport const codingDeltaOperation = defineOperation<\n  CodingDeltaInput,\n  CodingDeltaOutput\n>({\n  name: \"coding_delta\",\n  description:\n    \"Get the session delta (commits + touched files since last seen) for the session's coding namespace (issue #1548 Track A PR 4).\",\n  schema: codingDeltaSchema as z.ZodType<CodingDeltaInput>,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codingDelta(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\n// ---------------------------------------------------------------------------\n// Surface registration map — what each transport calls the pilot ops\n// ---------------------------------------------------------------------------\n\n/**\n * The canonical short names (no `engram.`/`remnic.` prefix) of the operations\n * the boundary owns today. The fitness test treats this set as the migrated\n * set; everything else on a surface is unmigrated and counted by the ratchet.\n */\nexport const codegraphIndexOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_index\",\n  description:\n    \"Codegraph parity tool (issue #1554): index. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphListProjectsOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_list_projects\",\n  description:\n    \"Codegraph parity tool (issue #1554): list_projects. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphDeleteProjectOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_delete_project\",\n  description:\n    \"Codegraph parity tool (issue #1554): delete_project. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphIndexStatusOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_index_status\",\n  description:\n    \"Codegraph parity tool (issue #1554): index_status. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphSearchGraphOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_search_graph\",\n  description:\n    \"Codegraph parity tool (issue #1554): search_graph. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphTracePathOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_trace_path\",\n  description:\n    \"Codegraph parity tool (issue #1554): trace_path. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphDetectChangesOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_detect_changes\",\n  description:\n    \"Codegraph parity tool (issue #1554): detect_changes. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphQueryGraphOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_query_graph\",\n  description:\n    \"Codegraph parity tool (issue #1554): query_graph. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphGetSchemaOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_get_schema\",\n  description:\n    \"Codegraph parity tool (issue #1554): get_schema. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphGetSnippetOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_get_snippet\",\n  description:\n    \"Codegraph parity tool (issue #1554): get_snippet. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphGetArchitectureOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_get_architecture\",\n  description:\n    \"Codegraph parity tool (issue #1554): get_architecture. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphSearchCodeOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_search_code\",\n  description:\n    \"Codegraph parity tool (issue #1554): search_code. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphManageAdrOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_manage_adr\",\n  description:\n    \"Codegraph parity tool (issue #1554): manage_adr. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const codegraphIngestTracesOperation = defineOperation<\n  CodegraphSurfaceRequest,\n  { result: CodegraphSurfaceResponse }\n>({\n  name: \"codegraph_ingest_traces\",\n  description:\n    \"Codegraph parity tool (issue #1554): ingest_traces. Delegates to the shared codegraph surface handler.\",\n  schema: codegraphSurfaceSchema,\n  handler: async (input, ctx) => {\n    const result = await ctx.service.codegraphTool(input, ctx.authenticatedPrincipal);\n    return { result };\n  },\n});\n\nexport const REGISTERED_OPERATIONS = [\n  memoryGetOperation.spec.name,\n  memorySearchOperation.spec.name,\n  memoryStoreOperation.spec.name,\n  codingDecisionOperation.spec.name,\n  codingArchitectureOperation.spec.name,\n  codegraphIndexOperation.spec.name,\n  codegraphListProjectsOperation.spec.name,\n  codegraphDeleteProjectOperation.spec.name,\n  codegraphIndexStatusOperation.spec.name,\n  codegraphSearchGraphOperation.spec.name,\n  codegraphTracePathOperation.spec.name,\n  codegraphDetectChangesOperation.spec.name,\n  codegraphQueryGraphOperation.spec.name,\n  codegraphGetSchemaOperation.spec.name,\n  codegraphGetSnippetOperation.spec.name,\n  codegraphGetArchitectureOperation.spec.name,\n  codegraphSearchCodeOperation.spec.name,\n  codegraphManageAdrOperation.spec.name,\n  codegraphIngestTracesOperation.spec.name,\n  codingDeltaOperation.spec.name,\n] as const;\n"],"mappings":";;;;;;;;;;;;;AAcA,SAAS,SAAS;AA0ClB,IAAM,kBAAkB,EAAE,OAAO;AAAA,EAC/B,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,sBAAsB,EAAE,IAAI,GAAG;AAAA,EAClE,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS,EAAE,SAAS;AAC5D,CAAC;AAWM,IAAM,qBAAqB,gBAAiD;AAAA,EACjF,MAAM;AAAA,EACN,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ;AAAA,MAC/B,MAAM;AAAA,MACN,MAAM,aAAa;AAAA,MACnB,IAAI;AAAA,IACN;AACA,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAMD,IAAM,qBAAqB,EAAE,OAAO;AAAA,EAClC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,mBAAmB,EAAE,IAAI,IAAI;AAAA,EAC7D,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA,EAI1D,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,SAAS,EAAE,SAAS;AAAA,EACxD,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS,EAAE,SAAS;AACpE,CAAC;AAiBM,IAAM,wBAAwB,gBAAuD;AAAA,EAC1F,MAAM;AAAA,EACN,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,aAAa;AAAA,MAC5C,OAAO,MAAM;AAAA,MACb,WAAW,MAAM,aAAa;AAAA,MAC9B,YAAY,MAAM,cAAc;AAAA,MAChC,YAAY,MAAM,cAAc;AAAA,MAChC,WAAW,IAAI;AAAA,IACjB,CAAC;AACD,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAYM,IAAM,uBAAuB,gBAAqD;AAAA,EACvF,MAAM;AAAA,EACN,aAAa;AAAA;AAAA;AAAA;AAAA,EAIb,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ;AAAA,MAC/B;AAAA,QACE,GAAG;AAAA,QACH,wBAAwB,IAAI;AAAA,MAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,IAAI;AAAA,IACN;AACA,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAkBD,IAAM,uBAAuB,EAAE;AAAA,EAC7B,CAAC,SAAS;AACR,QAAI,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI,GAAG;AAC5D,YAAM,MAA+B,CAAC;AACtC,iBAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,IAA+B,GAAG;AACpE,YAAI,MAAM,KAAM,KAAI,CAAC,IAAI;AAAA,MAC3B;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EACA,EAAE,OAAO;AAAA,IACP,YAAY,EAAE,KAAK,oBAAoB;AAAA,IACvC,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IAChD,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IAC/C,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACxC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IAC3C,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,IAC3C,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IAC9C,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IAC/C,cAAc,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IACnD,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,SAAS;AAAA,IAChE,cAAc,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EACpD,CAAC;AACH;AAKO,IAAM,0BAA0B,gBAGrC;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,eAAe,OAAO,IAAI,sBAAsB;AACjF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAMD,IAAM,2BAA2B,EAAE;AAAA,EACjC,CAAC,SAAS;AACR,QAAI,SAAS,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI,GAAG;AACrE,YAAM,MAAM;AACZ,YAAM,UAAmC,CAAC;AAC1C,iBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC9C,YAAI,UAAU,KAAM,SAAQ,GAAG,IAAI;AAAA,MACrC;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EACA,EAAE,OAAO;AAAA,IACP,YAAY,EAAE,KAAK,CAAC,OAAO,SAAS,CAAC;AAAA,IACrC,YAAY,EAAE,OAAO,EAAE,SAAS;AAAA,IAChC,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,EACjC,CAAC;AACH;AAKO,IAAM,8BAA8B,gBAGzC;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,mBAAmB,OAAO,IAAI,sBAAsB;AACrF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAED,IAAM,yBAAyB,EAAE;AAAA,EAC/B,CAAC,SAAS;AACR,QAAI,SAAS,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI,GAAG;AACrE,YAAM,MAAM;AACZ,YAAM,UAAmC,CAAC;AAC1C,iBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC9C,YAAI,UAAU,KAAM,SAAQ,GAAG,IAAI;AAAA,MACrC;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EACA,EAAE,OAAO;AAAA,IACP,MAAM,EAAE,OAAO,EAAE,OAAO,qBAAqB;AAAA,MAC3C,SAAS;AAAA,IACX,CAAC;AAAA,IACD,YAAY,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACzC,WAAW,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACxC,SAAS,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACtC,OAAO,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IACrC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACrD,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACpC,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,IACvC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,IACpD,eAAe,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IAC7C,MAAM,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IACpC,iBAAiB,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,IAC5D,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACnC,UAAU,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IACxC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,IAClC,SAAS,EAAE,QAAQ,EAAE,SAAS;AAAA,IAC9B,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,IACxC,IAAI,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACjC,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IACpC,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,IACpC,SAAS,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IACvC,UAAU,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IACxC,cAAc,EAAE,OAAO,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,IAC5C,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,EAAE,SAAS;AAAA,IAClD,cAAc,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IAC3C,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,EACxC,CAAC;AACH;AAMA,IAAM,oBAAoB,EAAE;AAAA,EAC1B,CAAC,SAAS;AACR,QAAI,SAAS,QAAQ,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI,GAAG;AACrE,YAAM,MAAM;AACZ,YAAM,UAAmC,CAAC;AAC1C,iBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC9C,YAAI,UAAU,KAAM,SAAQ,GAAG,IAAI;AAAA,MACrC;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EACA,EAAE,OAAO;AAAA,IACP,YAAY,EAAE,KAAK,iBAAiB;AAAA,IACpC,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,IAChD,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EACjD,CAAC;AACH;AAKO,IAAM,uBAAuB,gBAGlC;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,YAAY,OAAO,IAAI,sBAAsB;AAC9E,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAWM,IAAM,0BAA0B,gBAGrC;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,iCAAiC,gBAG5C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,kCAAkC,gBAG7C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,gCAAgC,gBAG3C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,gCAAgC,gBAG3C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,8BAA8B,gBAGzC;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,kCAAkC,gBAG7C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,+BAA+B,gBAG1C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,8BAA8B,gBAGzC;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,+BAA+B,gBAG1C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,oCAAoC,gBAG/C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,+BAA+B,gBAG1C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,8BAA8B,gBAGzC;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,iCAAiC,gBAG5C;AAAA,EACA,MAAM;AAAA,EACN,aACE;AAAA,EACF,QAAQ;AAAA,EACR,SAAS,OAAO,OAAO,QAAQ;AAC7B,UAAM,SAAS,MAAM,IAAI,QAAQ,cAAc,OAAO,IAAI,sBAAsB;AAChF,WAAO,EAAE,OAAO;AAAA,EAClB;AACF,CAAC;AAEM,IAAM,wBAAwB;AAAA,EACnC,mBAAmB,KAAK;AAAA,EACxB,sBAAsB,KAAK;AAAA,EAC3B,qBAAqB,KAAK;AAAA,EAC1B,wBAAwB,KAAK;AAAA,EAC7B,4BAA4B,KAAK;AAAA,EACjC,wBAAwB,KAAK;AAAA,EAC7B,+BAA+B,KAAK;AAAA,EACpC,gCAAgC,KAAK;AAAA,EACrC,8BAA8B,KAAK;AAAA,EACnC,8BAA8B,KAAK;AAAA,EACnC,4BAA4B,KAAK;AAAA,EACjC,gCAAgC,KAAK;AAAA,EACrC,6BAA6B,KAAK;AAAA,EAClC,4BAA4B,KAAK;AAAA,EACjC,6BAA6B,KAAK;AAAA,EAClC,kCAAkC,KAAK;AAAA,EACvC,6BAA6B,KAAK;AAAA,EAClC,4BAA4B,KAAK;AAAA,EACjC,+BAA+B,KAAK;AAAA,EACpC,qBAAqB,KAAK;AAC5B;","names":[]}

package/dist/{chunk-YOI3ELXF.js → chunk-IF362TF6.js}

@@ -1,6 +1,6 @@
 import {
   readAllEdges
-} from "./chunk-KF74X62T.js";
+} from "./chunk-YGKUAX2B.js";
 import {
   readEdgeConfidence
 } from "./chunk-2LSZVONP.js";
@@ -162,4 +162,4 @@ export {
   parseGraphSnapshotSince,
   buildGraphSnapshot
 };
-//# sourceMappingURL=chunk-YOI3ELXF.js.map
+//# sourceMappingURL=chunk-IF362TF6.js.map

package/dist/{chunk-WIKNVFBS.js → chunk-J45OCIVH.js}

@@ -6,7 +6,7 @@ import {
 } from "./chunk-SFQ6QNL7.js";
 import {
   StorageManager
-} from "./chunk-VFVG4NS2.js";
+} from "./chunk-MOBRVKWE.js";
 import {
   buildLifecycleEventsForMemory,
   sortMemoryLifecycleEvents
@@ -74,4 +74,4 @@ export {
   backupExistingLedger,
   rebuildMemoryLifecycleLedger
 };
-//# sourceMappingURL=chunk-WIKNVFBS.js.map
+//# sourceMappingURL=chunk-J45OCIVH.js.map

package/dist/{chunk-UDJLF3BO.js → chunk-JI6HWBYL.js}

@@ -1,6 +1,6 @@
 import {
   isValidCapsuleSince
-} from "./chunk-KQAFEZQX.js";
+} from "./chunk-VDX2J7OX.js";
 import {
   CAPSULE_ID_PATTERN
 } from "./chunk-WEHSQBFR.js";
@@ -433,4 +433,4 @@ export {
   actionConfidenceRequestSchema,
   validateRequest
 };
-//# sourceMappingURL=chunk-UDJLF3BO.js.map
+//# sourceMappingURL=chunk-JI6HWBYL.js.map

package/dist/{chunk-ECZPWSB5.js → chunk-JJT3AGL4.js}

@@ -1,9 +1,9 @@
-import {
-  gatewayTaskChainOptions
-} from "./chunk-4RGWCRIJ.js";
 import {
   normalizeProcedureSteps
 } from "./chunk-QDW3E4RD.js";
+import {
+  gatewayTaskChainOptions
+} from "./chunk-5TYA4OCF.js";
 import {
   extractJsonCandidates
 } from "./chunk-RGMVMVMF.js";
@@ -486,4 +486,4 @@ export {
   createVerdictCache,
   createDeferCountMap
 };
-//# sourceMappingURL=chunk-ECZPWSB5.js.map
+//# sourceMappingURL=chunk-JJT3AGL4.js.map