@remnic/core 9.7.13 → 9.7.15

package/dist/chunk-2S6QHZGJ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph.ts"],"sourcesContent":["/**\n * Multi-Graph Memory (MAGMA/SYNAPSE-inspired, v8.2)\n *\n * Maintains three typed edge graphs:\n *   entity.jsonl  — memories sharing a named entity (entityRef)\n *   time.jsonl    — consecutive memories in the same thread/session\n *   causal.jsonl  — memories linked by causal language heuristics\n *\n * Stored under `<memoryDir>/state/graphs/`.\n * All writes are fail-open: errors are caught/logged, never thrown.\n */\n\nimport { appendFile, mkdir, readFile, stat } from \"node:fs/promises\";\nimport * as path from \"node:path\";\n\nimport { readEdgeConfidence } from \"./graph-edge-reinforcement.js\";\nimport { emitGraphEvent } from \"./graph-events.js\";\nimport type { GraphConstructionCapabilitySet } from \"./capabilities.js\";\n\nexport type GraphType = \"entity\" | \"time\" | \"causal\";\n\nexport interface GraphEdge {\n  from: string; // relative memory path (e.g. \"facts/2026-02-22/abc.md\")\n  to: string; // relative memory path\n  type: GraphType;\n  weight: number; // 1.0 default, decay applied during traversal\n  label: string; // entity name, threadId, or matched causal phrase\n  ts: string; // ISO timestamp of edge creation\n\n  // Issue #681 — edge confidence + reinforcement (PR 1/3: schema + primitive only).\n  // Both fields are optional so existing edges without confidence still validate.\n  // Treat a missing `confidence` as 1.0 (legacy behavior) at read sites.\n  // PR 2/3 wires the maintenance decay job; PR 3/3 weights PageRank traversal by confidence.\n  confidence?: number; // [0, 1]; missing = 1.0\n  lastReinforcedAt?: string; // ISO timestamp of most recent reinforcement\n}\n\nexport interface GraphConfig {\n  multiGraphMemoryEnabled: boolean;\n  entityGraphEnabled: boolean;\n  timeGraphEnabled: boolean;\n  causalGraphEnabled: boolean;\n  maxGraphTraversalSteps: number;\n  graphActivationDecay: number;\n  maxEntityGraphEdgesPerMemory: number;\n  graphLateralInhibitionEnabled: boolean;\n  graphLateralInhibitionBeta: number;\n  graphLateralInhibitionTopM: number;\n  /**\n   * Issue #681 PR 3/3 — minimum edge confidence required for traversal.\n   * Edges with confidence below this floor are pruned. Legacy edges\n   * (no `confidence` field) are treated as 1.0 and always pass.\n   * Range `[0, 1]`. Default 0.2.\n   */\n  graphTraversalConfidenceFloor: number;\n  /**\n   * Issue #681 PR 3/3 — number of PageRank-style refinement iterations\n   * applied on top of BFS activation. Set to 0 to disable refinement\n   * and return raw BFS scores. Default 8.\n   */\n  graphTraversalPageRankIterations: number;\n  /**\n   * Issue #1904 — incremental GraphIndex edge cache. When true (the default,\n   * and the value when omitted), a single-writer edge append is pushed into the\n   * warm edge cache in place (revalidated by file size for cross-process\n   * coherence) instead of nulling the cache and paying a full 6 MB re-read +\n   * parse on the next traversal. Set false to restore the pre-#1904\n   * null-on-every-write behavior. Optional here (unlike the required\n   * PluginConfig field parseConfig always sets) so GraphConfig can still be\n   * constructed directly with a partial config; only an explicit `false` opts\n   * out, so an omitted field keeps the incremental default.\n   */\n  graphEdgeCacheIncrementalEnabled?: boolean;\n}\n\n/** Default minimum edge confidence required for traversal (issue #681 PR 3/3). */\nexport const DEFAULT_GRAPH_TRAVERSAL_CONFIDENCE_FLOOR = 0.2;\n/** Default PageRank-style refinement iteration count (issue #681 PR 3/3). */\nexport const DEFAULT_GRAPH_TRAVERSAL_PAGERANK_ITERATIONS = 8;\n\n// Causal signal phrases — order matters (most specific first)\nexport const CAUSAL_PHRASES = [\"as a result\", \"led to\", \"because of\", \"therefore\", \"caused\", \"because\"];\n\nexport function graphsDir(memoryDir: string): string {\n  return path.join(memoryDir, \"state\", \"graphs\");\n}\n\nexport function graphFilePath(memoryDir: string, type: GraphType): string {\n  return path.join(graphsDir(memoryDir), `${type}.jsonl`);\n}\n\nexport async function ensureGraphsDir(memoryDir: string): Promise<void> {\n  await mkdir(graphsDir(memoryDir), { recursive: true });\n}\n\n// ---------------------------------------------------------------------------\n// Per-graph-file write lock (gotcha #40 promise-chain pattern).\n//\n// Both the append path (`appendEdge`) and the rewrite path used by the\n// decay maintenance job must serialize on the same lock keyed by the\n// JSONL file path. Without this, an extraction can append a new edge\n// between the decay job's read-snapshot and rewrite, silently dropping\n// the appended edge during active traffic (issue #729 / Codex P1).\n// ---------------------------------------------------------------------------\nconst graphWriteLocks = new Map<string, Promise<void>>();\n\n/**\n * Run `fn` while holding the write lock for the given graph JSONL file.\n *\n * The lock is keyed by absolute file path so concurrent writes to\n * different graph types proceed independently. The chain recovers from\n * rejection (gotcha #40) so a single I/O failure does not poison all\n * future writers, but the original error is still surfaced to the\n * caller of `withGraphWriteLock`.\n */\nexport function withGraphWriteLock<T>(filePath: string, fn: () => Promise<T>): Promise<T> {\n  const prev = graphWriteLocks.get(filePath) ?? Promise.resolve();\n  const next = prev.then(fn, fn);\n  graphWriteLocks.set(\n    filePath,\n    next.then(\n      () => undefined,\n      () => undefined\n    )\n  );\n  return next;\n}\n\nexport async function appendEdge(memoryDir: string, edge: GraphEdge): Promise<void> {\n  await ensureGraphsDir(memoryDir);\n  const filePath = graphFilePath(memoryDir, edge.type);\n  const line = `${JSON.stringify(edge)}\\n`;\n  await withGraphWriteLock(filePath, async () => {\n    await appendFile(filePath, line, \"utf8\");\n  });\n  // Emit edge-added event for SSE subscribers (issue #691 PR 5/5).\n  // Fail-open: emitGraphEvent catches listener errors so a bad SSE client\n  // can never surface into the extraction pipeline.\n  emitGraphEvent(memoryDir, \"edge-added\", {\n    source: edge.from,\n    target: edge.to,\n    kind: edge.type,\n    weight: edge.weight,\n    label: edge.label,\n    confidence: typeof edge.confidence === \"number\" ? edge.confidence : 1.0,\n  });\n}\n\nfunction isNodeError(err: unknown): err is NodeJS.ErrnoException {\n  return typeof err === \"object\" && err !== null && \"code\" in err;\n}\n\nfunction parseEdgesJsonl(raw: string, expectedType: GraphType): GraphEdge[] {\n  const edges: GraphEdge[] = [];\n  for (const line of raw.split(\"\\n\")) {\n    const trimmed = line.trim();\n    if (!trimmed) continue;\n    try {\n      const parsed = JSON.parse(trimmed) as unknown;\n      if (isValidGraphEdge(parsed, expectedType)) {\n        edges.push(parsed);\n      }\n    } catch {\n      // skip corrupt lines — fail-open for partial JSONL recovery\n    }\n  }\n  return edges;\n}\n\n/**\n * Read all edges of a given type from the JSONL file.\n * Returns [] if the file doesn't exist or any read error occurs (fail-open).\n *\n * Production traversal callers (recall/PageRank) depend on this fail-open\n * posture so a temporarily missing or unreadable graph file never blocks\n * a recall. Maintenance jobs that need to distinguish ENOENT from real\n * I/O failures must use {@link readEdgesStrict} instead.\n */\nexport async function readEdges(memoryDir: string, type: GraphType): Promise<GraphEdge[]> {\n  const filePath = graphFilePath(memoryDir, type);\n  try {\n    const raw = await readFile(filePath, \"utf8\");\n    return parseEdgesJsonl(raw, type);\n  } catch {\n    return [];\n  }\n}\n\n/**\n * Same as {@link readEdges} but only swallows `ENOENT`; all other read\n * errors (`EACCES`, `EIO`, …) are propagated. Used by the graph-edge\n * decay maintenance job so I/O outages surface as a failed run instead\n * of being silently reported as \"no edges to decay\" (issue #729 /\n * Codex P1, line 120).\n */\nexport async function readEdgesStrict(memoryDir: string, type: GraphType): Promise<GraphEdge[]> {\n  const filePath = graphFilePath(memoryDir, type);\n  try {\n    const raw = await readFile(filePath, \"utf8\");\n    return parseEdgesJsonl(raw, type);\n  } catch (err) {\n    if (isNodeError(err) && err.code === \"ENOENT\") {\n      return [];\n    }\n    throw err;\n  }\n}\n\n/**\n * Read edges from all enabled graph types.\n */\nexport async function readAllEdges(\n  memoryDir: string,\n  graphCaps: Pick<GraphConstructionCapabilitySet, \"entityGraph\" | \"timeGraph\" | \"causalGraph\">,\n): Promise<GraphEdge[]> {\n  const parts: GraphEdge[][] = await Promise.all([\n    graphCaps.entityGraph ? readEdges(memoryDir, \"entity\") : Promise.resolve([]),\n    graphCaps.timeGraph ? readEdges(memoryDir, \"time\") : Promise.resolve([]),\n    graphCaps.causalGraph ? readEdges(memoryDir, \"causal\") : Promise.resolve([]),\n  ]);\n  return parts.flat();\n}\n\nexport interface GraphHealthFileStats {\n  type: GraphType;\n  filePath: string;\n  exists: boolean;\n  totalLines: number;\n  validEdges: number;\n  corruptLines: number;\n  uniqueNodes: number;\n}\n\nexport interface GraphHealthReport {\n  generatedAt: string;\n  enabledTypes: GraphType[];\n  totals: {\n    totalLines: number;\n    validEdges: number;\n    corruptLines: number;\n    uniqueNodes: number;\n  };\n  files: GraphHealthFileStats[];\n  repairGuidance?: string[];\n}\n\nfunction isValidGraphEdge(raw: unknown, expectedType: GraphType): raw is GraphEdge {\n  if (!raw || typeof raw !== \"object\") return false;\n  const edge = raw as Record<string, unknown>;\n  return (\n    edge.type === expectedType &&\n    typeof edge.from === \"string\" &&\n    edge.from.length > 0 &&\n    typeof edge.to === \"string\" &&\n    edge.to.length > 0 &&\n    typeof edge.weight === \"number\" &&\n    Number.isFinite(edge.weight) &&\n    typeof edge.label === \"string\" &&\n    typeof edge.ts === \"string\"\n  );\n}\n\nexport async function analyzeGraphHealth(\n  memoryDir: string,\n  options?: {\n    entityGraphEnabled?: boolean;\n    timeGraphEnabled?: boolean;\n    causalGraphEnabled?: boolean;\n    includeRepairGuidance?: boolean;\n  }\n): Promise<GraphHealthReport> {\n  const enabledTypes: GraphType[] = [];\n  if (options?.entityGraphEnabled !== false) enabledTypes.push(\"entity\");\n  if (options?.timeGraphEnabled !== false) enabledTypes.push(\"time\");\n  if (options?.causalGraphEnabled !== false) enabledTypes.push(\"causal\");\n\n  const files: GraphHealthFileStats[] = [];\n  const globalNodes = new Set<string>();\n\n  for (const type of enabledTypes) {\n    const filePath = graphFilePath(memoryDir, type);\n    let exists = true;\n    let totalLines = 0;\n    let validEdges = 0;\n    let corruptLines = 0;\n    const nodes = new Set<string>();\n\n    try {\n      const raw = await readFile(filePath, \"utf8\");\n      for (const line of raw.split(\"\\n\")) {\n        const trimmed = line.trim();\n        if (!trimmed) continue;\n        totalLines += 1;\n        try {\n          const parsed = JSON.parse(trimmed) as unknown;\n          if (!isValidGraphEdge(parsed, type)) {\n            corruptLines += 1;\n            continue;\n          }\n          validEdges += 1;\n          nodes.add(parsed.from);\n          nodes.add(parsed.to);\n          globalNodes.add(parsed.from);\n          globalNodes.add(parsed.to);\n        } catch {\n          corruptLines += 1;\n        }\n      }\n    } catch {\n      exists = false;\n    }\n\n    files.push({\n      type,\n      filePath,\n      exists,\n      totalLines,\n      validEdges,\n      corruptLines,\n      uniqueNodes: nodes.size,\n    });\n  }\n\n  const totals = files.reduce(\n    (acc, item) => {\n      acc.totalLines += item.totalLines;\n      acc.validEdges += item.validEdges;\n      acc.corruptLines += item.corruptLines;\n      return acc;\n    },\n    {\n      totalLines: 0,\n      validEdges: 0,\n      corruptLines: 0,\n      uniqueNodes: globalNodes.size,\n    }\n  );\n  totals.uniqueNodes = globalNodes.size;\n\n  const report: GraphHealthReport = {\n    generatedAt: new Date().toISOString(),\n    enabledTypes,\n    totals,\n    files,\n  };\n\n  if (options?.includeRepairGuidance === true) {\n    const guidance: string[] = [];\n    if (totals.corruptLines > 0) {\n      guidance.push(\n        \"Corrupt graph lines detected: back up memory/state/graphs, then rebuild graphs from clean memory replay/extraction runs.\"\n      );\n    }\n    if (totals.validEdges === 0) {\n      guidance.push(\n        \"No valid edges detected yet: run normal extraction traffic (or replay ingestion) to seed graph files.\"\n      );\n    }\n    if (guidance.length > 0) report.repairGuidance = guidance;\n  }\n\n  return report;\n}\n\n/**\n * Detect causal signal phrases in text. Returns the first matched phrase, or null.\n */\nexport function detectCausalPhrase(text: string): string | null {\n  const lower = text.toLowerCase();\n  for (const phrase of CAUSAL_PHRASES) {\n    if (lower.includes(phrase)) return phrase;\n  }\n  return null;\n}\n\n/**\n * GraphIndex — builds and updates the three memory graphs.\n *\n * Usage (orchestrator):\n *   this.graphIndex = new GraphIndex(config.memoryDir, config);\n *\n *   // After each memory write:\n *   await this.graphIndex.onMemoryWritten(memoryPath, frontmatter, threadId, recentInThread);\n */\n/**\n * Identity of one graph JSONL file used to validate the incremental edge cache\n * (issue #1904). An absent file (ENOENT) is recorded as the all-zero sentinel\n * `{ size: 0, mtimeMs: 0, ino: 0 }` so a later peer creation (ino becomes\n * non-zero) is detected as a change.\n */\ninterface GraphFileMeta {\n  size: number;\n  mtimeMs: number;\n  ino: number;\n}\n\nexport class GraphIndex {\n  private readonly memoryDir: string;\n  private readonly cfg: GraphConfig;\n\n  // Cache for readAllEdges() result.  With 30k+ entity edges (6 MB JSONL) the\n  // file read + JSON parse takes 2-4 s per call.  This instance-level cache\n  // eliminates that overhead on every spreadingActivation() call; it is\n  // invalidated (set to null) in onMemoryWritten() so new edges appear promptly.\n  private edgeCache: {\n    allEdges: GraphEdge[];\n    loadedAt: number;\n    // Per-file identity of each enabled graph file observed at load (issue\n    // #1904). An incremental push is trusted only when every file's identity is\n    // explained entirely by OUR own append: size grows by exactly the bytes we\n    // appended and the inode is unchanged (a local append keeps the inode; an\n    // external atomic temp+rename rewrite — e.g. the edge-decay job — changes\n    // it). Untouched files must match size AND mtime AND inode exactly. This\n    // closes the size-only holes Codex flagged: a peer append racing cache\n    // construction, and an equal-length atomic rewrite (e.g. confidence\n    // 0.9->0.8) that preserves byte length. Any divergence forces a full reload.\n    meta: Partial<Record<GraphType, GraphFileMeta>>;\n  } | null = null;\n  private static readonly EDGE_CACHE_TTL_MS = 300_000; // 5 minutes\n\n  constructor(memoryDir: string, cfg: GraphConfig) {\n    this.memoryDir = memoryDir;\n    this.cfg = cfg;\n  }\n\n  /** Clear the edge cache so the next spreadingActivation() re-reads from disk.\n   *  Call after any code path that appends edges outside of onMemoryWritten(). */\n  invalidateEdgeCache(): void {\n    this.edgeCache = null;\n  }\n\n  private async loadEdgesCached(): Promise<GraphEdge[]> {\n    if (this.edgeCache && Date.now() - this.edgeCache.loadedAt < GraphIndex.EDGE_CACHE_TTL_MS) {\n      return this.edgeCache.allEdges;\n    }\n    // Consistent snapshot (issue #1904, Codex): capture file identity BEFORE and\n    // AFTER reading edges and retry if it changed, so `allEdges` and the recorded\n    // `meta` baseline reflect the SAME on-disk state. Without this a peer append\n    // landing mid-read would leave the cache holding edges that exclude the peer\n    // edge while the baseline already counts its bytes — a later local append\n    // would then pass the size-delta check and silently omit the peer edge.\n    let allEdges: GraphEdge[] = [];\n    let meta = await this.readEnabledGraphFileMeta();\n    let stable = false;\n    for (let attempt = 0; attempt < 3; attempt++) {\n      const before = meta;\n      allEdges = await readAllEdges(this.memoryDir, {\n        entityGraph: this.cfg.entityGraphEnabled,\n        timeGraph: this.cfg.timeGraphEnabled,\n        causalGraph: this.cfg.causalGraphEnabled,\n      });\n      meta = await this.readEnabledGraphFileMeta();\n      if (this.graphFileMetaEqual(before, meta)) {\n        stable = true;\n        break;\n      }\n      // A write landed during the read; the just-captured `meta` is the new\n      // baseline for the next attempt's before-snapshot.\n    }\n    if (stable) {\n      this.edgeCache = { allEdges, loadedAt: Date.now(), meta };\n    } else {\n      // Contended: a peer kept writing across every attempt, so the final\n      // allEdges/meta pair is not guaranteed consistent. Serve THIS read's edges\n      // (best effort) but do NOT poison the cache — leave it null so the next\n      // call re-reads, instead of installing a baseline that could hide a peer\n      // edge for the TTL (Codex).\n      this.edgeCache = null;\n    }\n    return allEdges;\n  }\n\n  /**\n   * Identity ({ size, mtimeMs, ino }) of each ENABLED graph file (issue #1904).\n   * Missing files (ENOENT) and any stat error map to the all-zero sentinel so\n   * the baseline is fail-open: a later revalidation sees a mismatch (or a peer\n   * creation flipping ino from 0 to non-zero) and forces a full reload rather\n   * than trusting a stale incremental push.\n   */\n  private async readEnabledGraphFileMeta(): Promise<Partial<Record<GraphType, GraphFileMeta>>> {\n    const enabled: GraphType[] = [];\n    if (this.cfg.entityGraphEnabled) enabled.push(\"entity\");\n    if (this.cfg.timeGraphEnabled) enabled.push(\"time\");\n    if (this.cfg.causalGraphEnabled) enabled.push(\"causal\");\n    const meta: Partial<Record<GraphType, GraphFileMeta>> = {};\n    for (const type of enabled) {\n      try {\n        const st = await stat(graphFilePath(this.memoryDir, type));\n        meta[type] = { size: st.size, mtimeMs: st.mtimeMs, ino: Number(st.ino) };\n      } catch {\n        meta[type] = { size: 0, mtimeMs: 0, ino: 0 };\n      }\n    }\n    return meta;\n  }\n\n  /** True iff both metadata maps carry identical identity for every key. */\n  private graphFileMetaEqual(\n    a: Partial<Record<GraphType, GraphFileMeta>>,\n    b: Partial<Record<GraphType, GraphFileMeta>>,\n  ): boolean {\n    const types: GraphType[] = [\"entity\", \"time\", \"causal\"];\n    for (const type of types) {\n      const x = a[type];\n      const y = b[type];\n      if (!x && !y) continue;\n      if (!x || !y) return false;\n      if (x.size !== y.size || x.mtimeMs !== y.mtimeMs || x.ino !== y.ino) return false;\n    }\n    return true;\n  }\n\n  /**\n   * Re-stat every graph file whose identity the cache just committed and return\n   * false if any has moved since (issue #1904, Codex). Closes the validation→\n   * in-place-push TOCTOU window: a peer process (concurrent CLI / daemon /\n   * decay job) can append between edgeFilesUnchangedExceptOurAppends()'s final\n   * stat and the allEdges.push(...). Without this re-check the cache would be\n   * accepted with identity predating the peer write and miss the peer edge for\n   * the TTL. A residual infinitesimal window (peer writes during this re-stat)\n   * remains and is TTL-bounded.\n   */\n  private async edgeCacheIdentityUnchangedSinceCommit(): Promise<boolean> {\n    if (!this.edgeCache) return false;\n    for (const type of Object.keys(this.edgeCache.meta) as GraphType[]) {\n      const committed = this.edgeCache.meta[type];\n      if (!committed) continue;\n      let cur: GraphFileMeta;\n      try {\n        const st = await stat(graphFilePath(this.memoryDir, type));\n        cur = { size: st.size, mtimeMs: st.mtimeMs, ino: Number(st.ino) };\n      } catch (err) {\n        if ((err as NodeJS.ErrnoException)?.code === \"ENOENT\") {\n          cur = { size: 0, mtimeMs: 0, ino: 0 };\n        } else {\n          return false;\n        }\n      }\n      if (\n        cur.size !== committed.size ||\n        cur.mtimeMs !== committed.mtimeMs ||\n        cur.ino !== committed.ino\n      ) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * Called after a memory is written to disk.\n   *\n   * @param memoryPath - relative path from memoryDir (e.g. \"facts/2026-02-22/abc.md\")\n   * @param entityRef  - entityRef frontmatter field (if any)\n   * @param content    - full memory text (for causal detection)\n   * @param created    - ISO timestamp of this memory\n   * @param threadId   - current thread ID (for time graph)\n   * @param recentInThread - paths of the N most-recent memories in this thread (for time graph)\n   * @param entitySiblings - paths of other memories that share the same entityRef (for entity graph)\n   */\n  async onMemoryWritten(opts: {\n    memoryPath: string;\n    entityRef?: string;\n    content: string;\n    created: string;\n    threadId?: string;\n    recentInThread?: string[];\n    entitySiblings?: string[];\n    causalPredecessor?: string;\n    /**\n     * Optional frozen gate overrides (from GraphConstructionCapabilitySet).\n     * When provided, these take precedence over `this.cfg` so the caller's\n     * operation-scoped snapshot is the single source of truth (#1566).\n     */\n    graphCapsOverride?: {\n      entityGraph: boolean;\n      timeGraph: boolean;\n      causalGraph: boolean;\n      multiGraphMemory: boolean;\n    };\n  }): Promise<void> {\n    const g = opts.graphCapsOverride;\n    const multiGraphOn = g ? g.multiGraphMemory : this.cfg.multiGraphMemoryEnabled;\n    if (!multiGraphOn) return;\n    const entityOn = g ? g.entityGraph : this.cfg.entityGraphEnabled;\n    const timeOn = g ? g.timeGraph : this.cfg.timeGraphEnabled;\n    const causalOn = g ? g.causalGraph : this.cfg.causalGraphEnabled;\n    const ts = new Date().toISOString();\n    // Collect the edges appended this call so a coherent single-writer push can\n    // extend the warm edge cache in place instead of nulling it (issue #1904).\n    const appended: GraphEdge[] = [];\n\n    try {\n      // Entity graph\n      if (entityOn && opts.entityRef && opts.entitySiblings?.length) {\n        const siblings = opts.entitySiblings.slice(0, this.cfg.maxEntityGraphEdgesPerMemory);\n        for (const sibling of siblings) {\n          const edge: GraphEdge = {\n            from: opts.memoryPath,\n            to: sibling,\n            type: \"entity\",\n            weight: 1.0,\n            label: opts.entityRef,\n            ts,\n          };\n          appended.push(edge);\n          await appendEdge(this.memoryDir, edge);\n        }\n      }\n\n      // Time graph — link to most recent memory in same thread\n      if (timeOn && opts.threadId && opts.recentInThread?.length) {\n        const predecessor = opts.recentInThread[opts.recentInThread.length - 1];\n        if (predecessor && predecessor !== opts.memoryPath) {\n          const edge: GraphEdge = {\n            from: predecessor,\n            to: opts.memoryPath,\n            type: \"time\",\n            weight: 1.0,\n            label: opts.threadId,\n            ts,\n          };\n          appended.push(edge);\n          await appendEdge(this.memoryDir, edge);\n        }\n      }\n\n      // Causal graph\n      if (causalOn && opts.causalPredecessor) {\n        const phrase = detectCausalPhrase(opts.content);\n        if (phrase) {\n          const edge: GraphEdge = {\n            from: opts.causalPredecessor,\n            to: opts.memoryPath,\n            type: \"causal\",\n            weight: 1.0,\n            label: phrase,\n            ts,\n          };\n          appended.push(edge);\n          await appendEdge(this.memoryDir, edge);\n        }\n      }\n    } catch (err) {\n      // Fail-open: graph write errors must never surface to caller\n      const { log } = await import(\"./logger.js\");\n      log.warn(`[graph] onMemoryWritten error: ${err}`);\n    } finally {\n      // Edge-cache coherence (issue #1904). Legacy behavior nulled the cache on\n      // every write, paying a 2-4 s full re-read + parse on the next traversal.\n      if (!this.edgeCache || Date.now() - this.edgeCache.loadedAt >= GraphIndex.EDGE_CACHE_TTL_MS) {\n        // Nothing warm, or the entry is past its 5-min TTL backstop — reload.\n        this.edgeCache = null;\n      } else if (this.cfg.graphEdgeCacheIncrementalEnabled === false) {\n        // Rollback lever: restore the pre-#1904 null-on-every-write behavior.\n        this.edgeCache = null;\n      } else {\n        // Trust an in-place push ONLY when WE are the sole writer since load:\n        // every enabled graph file's on-disk size must equal our baseline plus\n        // exactly the bytes we appended to it. A divergence means a peer process\n        // (backup daemon / CLI / decay job) also wrote — force a full reload for\n        // cross-process coherence. Any stat error fails open to a full reload.\n        try {\n          if (await this.edgeFilesUnchangedExceptOurAppends(appended)) {\n            if (appended.length > 0) {\n              this.edgeCache.allEdges.push(...appended);\n              // Close the validation→push TOCTOU window (#1904, Codex): a peer\n              // process can append between the validation stat above and this\n              // in-place push. Re-verify every committed identity; if any file\n              // moved, the cache would miss the peer edge for the TTL, so null\n              // it and let the next traversal reload. (Skipped when this call\n              // pushed nothing — no new window was opened, and the validation\n              // already confirmed no peer wrote.)\n              if (this.edgeCache && !(await this.edgeCacheIdentityUnchangedSinceCommit())) {\n                this.edgeCache = null;\n              }\n            }\n          } else {\n            this.edgeCache = null;\n          }\n        } catch {\n          this.edgeCache = null;\n        }\n      }\n    }\n  }\n\n  /**\n   * Cross-process coherence check for the incremental edge cache (issue #1904).\n   *\n   * Returns true iff every ENABLED graph file's current identity is explained\n   * ENTIRELY by THIS call's own append — no other process wrote to any graph\n   * file since load. Per file:\n   *   - inode must be unchanged. A local append (`appendFile`) keeps the inode;\n   *     an external atomic temp+rename rewrite (e.g. the edge-decay job) changes\n   *     it, so an inode change — even one that preserves byte length, such as\n   *     decaying confidence 0.9->0.8 — forces a reload (Codex).\n   *   - a file WE appended to (delta > 0): size must equal baseline + our exact\n   *     appended bytes. If it was absent at load (sentinel ino 0), our append\n   *     created it, so we accept size === delta and adopt the new identity.\n   *   - a file we did NOT touch (delta 0): size AND mtime must be unchanged, so\n   *     an in-place equal-length rewrite (mtime bump) or a peer append (size\n   *     bump) both force a reload.\n   * On success it commits the new identity baseline so the next append\n   * revalidates against post-this-write truth. Fail-open: an unreadable file\n   * (non-ENOENT) returns false, forcing a full reload.\n   */\n  private async edgeFilesUnchangedExceptOurAppends(appended: GraphEdge[]): Promise<boolean> {\n    if (!this.edgeCache) return false;\n    const expectedDelta: Partial<Record<GraphType, number>> = {};\n    for (const edge of appended) {\n      const bytes = Buffer.byteLength(`${JSON.stringify(edge)}\\n`, \"utf8\");\n      expectedDelta[edge.type] = (expectedDelta[edge.type] ?? 0) + bytes;\n    }\n    const enabled: GraphType[] = [];\n    if (this.cfg.entityGraphEnabled) enabled.push(\"entity\");\n    if (this.cfg.timeGraphEnabled) enabled.push(\"time\");\n    if (this.cfg.causalGraphEnabled) enabled.push(\"causal\");\n    const observed: Partial<Record<GraphType, GraphFileMeta>> = {};\n    for (const type of enabled) {\n      let cur: GraphFileMeta;\n      try {\n        const st = await stat(graphFilePath(this.memoryDir, type));\n        cur = { size: st.size, mtimeMs: st.mtimeMs, ino: Number(st.ino) };\n      } catch (err) {\n        // An absent graph file (ENOENT) is the normal partially-populated state\n        // (e.g. entity edges written before any causal edge): treat it as the\n        // all-zero sentinel so the incremental cache stays warm. Only a genuine\n        // stat failure forces a full reload (#1904, Codex).\n        if ((err as NodeJS.ErrnoException)?.code === \"ENOENT\") {\n          cur = { size: 0, mtimeMs: 0, ino: 0 };\n        } else {\n          return false;\n        }\n      }\n      const base = this.edgeCache.meta[type] ?? { size: 0, mtimeMs: 0, ino: 0 };\n      const delta = expectedDelta[type] ?? 0;\n      if (delta > 0) {\n        if (base.ino === 0) {\n          // File was absent at load; our append created it. Accept iff its whole\n          // size is exactly our appended bytes (nothing else wrote it).\n          if (cur.ino === 0 || cur.size !== delta) return false;\n        } else {\n          // Existing file: our append keeps the inode and grows size by exactly\n          // our bytes. An atomic rewrite (ino change) or a peer append (size\n          // mismatch) both fail here.\n          if (cur.ino !== base.ino || cur.size !== base.size + delta) return false;\n        }\n      } else {\n        // Untouched file: identity must be byte-for-byte unchanged.\n        if (cur.ino !== base.ino || cur.size !== base.size || cur.mtimeMs !== base.mtimeMs) {\n          return false;\n        }\n      }\n      observed[type] = cur;\n    }\n    this.edgeCache.meta = observed;\n    return true;\n  }\n\n  /**\n   * Spreading activation BFS (SYNAPSE-inspired).\n   *\n   * Starting from `seeds`, traverse the combined graph for up to `maxSteps` hops.\n   * Each candidate gets an activation score = edge.weight × edgeConfidence × decay^hop.\n   *\n   * Issue #681 PR 3/3 — confidence-aware traversal:\n   *   - Each edge's `weight` is multiplied by its `confidence` (legacy edges\n   *     missing `confidence` are treated as 1.0, preserving prior behavior).\n   *   - Edges with `confidence < graphTraversalConfidenceFloor` are pruned and\n   *     contribute neither activation nor downstream neighbors.\n   *   - When `graphTraversalPageRankIterations > 0`, an additional PageRank-\n   *     style refinement pass redistributes activation along confidence-weighted\n   *     edges, sharpening the ranking among multi-hop candidates.\n   *   - Per-result provenance includes the highest-confidence edge that landed\n   *     on each candidate, so the X-ray surface can attribute pruning and\n   *     ranking decisions back to specific edges.\n   *\n   * @param seeds    - initial memory paths to expand from (e.g. QMD top results)\n   * @param maxSteps - max BFS hops (from config: maxGraphTraversalSteps)\n   * @returns Array of {path, score, edgeConfidence, ...} sorted descending, not including seed paths\n   */\n  async spreadingActivation(\n    seeds: string[],\n    maxSteps?: number,\n    opts?: {\n      /**\n       * Issue #681 — when `true`, bypasses the configured\n       * `graphTraversalConfidenceFloor` and includes low-confidence\n       * edges in traversal.  Equivalent to forcing the floor to `0`.\n       * Default `false` (floor from config is applied).\n       */\n      includeLowConfidence?: boolean;\n      /** Absolute deadline in ms-since-epoch for post-retrieval assembly. */\n      deadlineAtMs?: number;\n    }\n  ): Promise<\n    Array<{\n      path: string;\n      score: number;\n      seed: string;\n      hopDepth: number;\n      decayedWeight: number;\n      graphType: \"entity\" | \"time\" | \"causal\";\n      /**\n       * Confidence of the edge that produced this candidate's recorded\n       * provenance (the strongest edge along the chosen entry path).\n       * In `[0, 1]`. Legacy edges without `confidence` surface as 1.0.\n       */\n      edgeConfidence: number;\n    }>\n  > {\n    if (!this.cfg.multiGraphMemoryEnabled) return [];\n    const steps = maxSteps ?? this.cfg.maxGraphTraversalSteps;\n    const decay = this.cfg.graphActivationDecay;\n    // When `includeLowConfidence` is set, use floor=0 so all edges\n    // participate in traversal regardless of their decay state.\n    // Otherwise clamp the configured floor into [0, 1] so misconfiguration\n    // cannot (a) admit edges with negative confidence or (b) reject every\n    // edge.\n    const floor =\n      opts?.includeLowConfidence === true ? 0 : clampConfidenceFloor(this.cfg.graphTraversalConfidenceFloor);\n    const iterations = clampPageRankIterations(this.cfg.graphTraversalPageRankIterations);\n    const deadlineAtMs = opts?.deadlineAtMs;\n    const deadlineExpired = (): boolean =>\n      typeof deadlineAtMs === \"number\" && Date.now() >= deadlineAtMs;\n\n    try {\n      if (deadlineExpired()) return [];\n      const allEdges = await this.loadEdgesCached();\n      if (deadlineExpired()) return [];\n\n      // Build adjacency index: from → edges, to → edges (bidirectional for entity/time, directional for causal).\n      // Edges below the confidence floor are pruned at index time so neither\n      // direct activation nor downstream BFS expansion can re-introduce them.\n      const adj = new Map<string, GraphEdge[]>();\n      for (let i = 0; i < allEdges.length; i += 1) {\n        if ((i & 1023) === 0 && deadlineExpired()) return [];\n        const edge = allEdges[i];\n        const conf = readEdgeConfidence(edge);\n        if (conf < floor) continue;\n        if (!adj.has(edge.from)) adj.set(edge.from, []);\n        adj.get(edge.from)!.push(edge);\n        // Entity and time edges are bidirectional\n        if (edge.type !== \"causal\") {\n          if (!adj.has(edge.to)) adj.set(edge.to, []);\n          adj.get(edge.to)!.push({ ...edge, from: edge.to, to: edge.from });\n        }\n      }\n\n      const seedSet = new Set(seeds);\n      const scores = new Map<string, number>(); // candidate path → accumulated activation score\n      const provenance = new Map<\n        string,\n        {\n          seed: string;\n          hopDepth: number;\n          decayedWeight: number;\n          graphType: \"entity\" | \"time\" | \"causal\";\n          edgeConfidence: number;\n        }\n      >();\n      let frontier = new Map<string, { node: string; seed: string; activation: number }>();\n      const reachedBySeed = new Map<string, Set<string>>();\n      for (const seed of seeds) {\n        frontier.set(`${seed}\\0${seed}`, { node: seed, seed, activation: 1 });\n        reachedBySeed.set(seed, new Set([seed]));\n      }\n      const finalizeScores = () =>\n        Array.from(scores.entries())\n          .map(([p, score]) => ({\n            path: p,\n            score,\n            seed: provenance.get(p)?.seed ?? \"\",\n            hopDepth: provenance.get(p)?.hopDepth ?? 0,\n            decayedWeight: provenance.get(p)?.decayedWeight ?? 0,\n            graphType: provenance.get(p)?.graphType ?? \"entity\",\n            edgeConfidence: provenance.get(p)?.edgeConfidence ?? 1,\n          }))\n          .sort((a, b) => b.score - a.score);\n\n      for (let hop = 0; hop < steps && frontier.size > 0; hop++) {\n        if (deadlineExpired()) return finalizeScores();\n        const nextFrontier = new Map<string, { node: string; seed: string; activation: number }>();\n\n        for (const { node, seed: sourceSeed, activation } of frontier.values()) {\n          const edges = adj.get(node) ?? [];\n          for (let i = 0; i < edges.length; i += 1) {\n            if ((i & 1023) === 0 && deadlineExpired()) return finalizeScores();\n            const edge = edges[i];\n            const neighbor = edge.to === node ? edge.from : edge.to;\n            const conf = readEdgeConfidence(edge);\n            // Defense in depth: the adjacency build already drops sub-floor\n            // edges, but if a synthesized reverse edge ever bypassed that\n            // path, this guard keeps spreading activation honest.\n            if (conf < floor) continue;\n            const score = activation * edge.weight * conf * decay;\n            const reachedForSeed = reachedBySeed.get(sourceSeed);\n            if (reachedForSeed?.has(neighbor)) {\n              continue;\n            }\n\n            if (!seedSet.has(neighbor)) {\n              const existing = scores.get(neighbor) ?? 0;\n              scores.set(neighbor, existing + score);\n\n              const prev = provenance.get(neighbor);\n              if (!prev || hop + 1 < prev.hopDepth || (hop + 1 === prev.hopDepth && score > prev.decayedWeight)) {\n                provenance.set(neighbor, {\n                  seed: sourceSeed,\n                  hopDepth: hop + 1,\n                  decayedWeight: score,\n                  graphType: edge.type,\n                  edgeConfidence: conf,\n                });\n              }\n\n              if (hop + 1 < steps) {\n                const frontierKey = `${sourceSeed}\\0${neighbor}`;\n                const existingFrontier = nextFrontier.get(frontierKey);\n                if (existingFrontier) {\n                  existingFrontier.activation += score;\n                } else {\n                  nextFrontier.set(frontierKey, {\n                    node: neighbor,\n                    seed: sourceSeed,\n                    activation: score,\n                  });\n                }\n              }\n            }\n          }\n        }\n\n        for (const { node, seed } of nextFrontier.values()) {\n          reachedBySeed.get(seed)?.add(node);\n        }\n        frontier = nextFrontier;\n      }\n\n      // Issue #681 PR 3/3 — optional PageRank-style refinement.\n      // Redistributes a node's accumulated activation along its outgoing\n      // edges, weighted by edge confidence. Damping is fixed at the\n      // canonical 0.85 so the ranking stays comparable across queries;\n      // the `iterations` knob bounds compute, not behavior shape.\n      if (!deadlineExpired() && iterations > 0 && scores.size > 1) {\n        applyPageRankRefinement(scores, adj, {\n          iterations,\n          floor,\n          damping: 0.85,\n          deadlineAtMs,\n        });\n      }\n\n      // Apply lateral inhibition if enabled (Synapse-inspired competitive suppression)\n      if (deadlineExpired()) return finalizeScores();\n      if (this.cfg.graphLateralInhibitionEnabled && scores.size > 1) {\n        const inhibited = applyLateralInhibition(scores, {\n          beta: this.cfg.graphLateralInhibitionBeta,\n          topM: this.cfg.graphLateralInhibitionTopM,\n        });\n        for (const [k, v] of inhibited) {\n          scores.set(k, v);\n        }\n      }\n\n      return finalizeScores();\n    } catch (err) {\n      const { log } = await import(\"./logger.js\");\n      log.warn(`[graph] spreadingActivation error: ${err}`);\n      return [];\n    }\n  }\n}\n\n/**\n * Clamp `graphTraversalConfidenceFloor` into the legal range `[0, 1]`.\n * Non-finite or non-numeric values fall back to the documented default\n * so misconfiguration cannot silently disable the floor or reject every edge.\n *\n * Exported for tests; call sites in `spreadingActivation` use it to make\n * the contract explicit at every boundary.\n */\nexport function clampConfidenceFloor(raw: unknown): number {\n  if (typeof raw !== \"number\" || !Number.isFinite(raw)) {\n    return DEFAULT_GRAPH_TRAVERSAL_CONFIDENCE_FLOOR;\n  }\n  if (raw < 0) return 0;\n  if (raw > 1) return 1;\n  return raw;\n}\n\n/**\n * Clamp `graphTraversalPageRankIterations` into a non-negative integer.\n * Negative or non-finite values fall back to 0 (disable refinement) so\n * misconfiguration cannot stall recall in an unbounded loop.\n */\nexport function clampPageRankIterations(raw: unknown): number {\n  if (typeof raw !== \"number\" || !Number.isFinite(raw)) return 0;\n  if (raw <= 0) return 0;\n  return Math.floor(raw);\n}\n\n/**\n * PageRank-style refinement on top of the BFS activation map.\n *\n * Each iteration redistributes a fraction of every node's score along\n * its outgoing edges, scaled by edge confidence. Confidence below\n * `floor` is filtered out before redistribution, mirroring the BFS\n * pruning rule. Mutates `scores` in place.\n *\n * Exported for tests; in production, call sites pass the same adjacency\n * map already used by BFS so behavior stays consistent.\n */\nexport function applyPageRankRefinement(\n  scores: Map<string, number>,\n  adj: Map<string, GraphEdge[]>,\n  opts: { iterations: number; floor: number; damping: number; deadlineAtMs?: number }\n): void {\n  const { iterations, floor, damping, deadlineAtMs } = opts;\n  if (iterations <= 0 || scores.size === 0) return;\n  const safeDamping = Math.min(1, Math.max(0, damping));\n  const deadlineExpired = (): boolean =>\n    typeof deadlineAtMs === \"number\" && Date.now() >= deadlineAtMs;\n\n  // Pre-compute confidence-weighted out-edge totals for normalization.\n  // Done once per refinement, not per iteration, since adjacency is\n  // immutable inside the loop.\n  //\n  // Codex P1 (#735): the denominator MUST be computed over the same\n  // eligible-neighbor set the iteration redistributes into — i.e.\n  // edges whose neighbor is in `scores`. Counting edges-to-seeds (or\n  // edges-to-unseen-nodes) in the denominator while dropping their\n  // flow during iteration leaks `safeDamping × score` every pass and\n  // collapses leaf candidates' scores instead of just re-ranking them.\n  const eligible = (edge: GraphEdge, fromNode: string): boolean => {\n    if (readEdgeConfidence(edge) < floor) return false;\n    const neighbor = edge.to === fromNode ? edge.from : edge.to;\n    return scores.has(neighbor);\n  };\n  const outboundTotal = new Map<string, number>();\n  for (const [node, edges] of adj.entries()) {\n    if (deadlineExpired()) return;\n    if (!scores.has(node)) continue; // only candidate nodes redistribute\n    let sum = 0;\n    for (const edge of edges) {\n      if (!eligible(edge, node)) continue;\n      sum += readEdgeConfidence(edge) * edge.weight;\n    }\n    if (sum > 0) outboundTotal.set(node, sum);\n  }\n\n  for (let i = 0; i < iterations; i += 1) {\n    if (deadlineExpired()) return;\n    const next = new Map<string, number>();\n    // Teleport / damping floor: every node retains `(1 - damping) * score`\n    // of its current activation so dangling nodes do not bleed to zero.\n    for (const [node, score] of scores) {\n      next.set(node, (1 - safeDamping) * score);\n    }\n    for (const [node, score] of scores) {\n      const outEdges = adj.get(node);\n      const total = outboundTotal.get(node);\n      // Dangling-node fallback: when a candidate has zero eligible\n      // outflow (no in-scores neighbors above the floor), the\n      // `safeDamping × score` portion would otherwise evaporate. Keep\n      // it on `node` so total mass is conserved and the score reflects\n      // the candidate's standing rather than its in-degree topology.\n      if (!outEdges || outEdges.length === 0 || !total || total <= 0) {\n        next.set(node, (next.get(node) ?? 0) + safeDamping * score);\n        continue;\n      }\n      for (let edgeIndex = 0; edgeIndex < outEdges.length; edgeIndex += 1) {\n        if ((edgeIndex & 1023) === 0 && deadlineExpired()) return;\n        const edge = outEdges[edgeIndex];\n        if (!eligible(edge, node)) continue;\n        const conf = readEdgeConfidence(edge);\n        const neighbor = edge.to === node ? edge.from : edge.to;\n        const flow = safeDamping * score * ((conf * edge.weight) / total);\n        next.set(neighbor, (next.get(neighbor) ?? 0) + flow);\n      }\n    }\n    for (const [node, score] of next) {\n      scores.set(node, score);\n    }\n  }\n}\n\n/**\n * Lateral inhibition (Synapse-inspired).\n *\n * For each node, the top-M higher-activation competitors exert inhibition\n * proportional to their activation difference. Output is clamped to [0, ∞).\n *\n * No sigmoid is applied here — downstream `normalizeGraphActivationScore`\n * already applies x/(1+x) soft squash, so adding a sigmoid would double-\n * normalize and cap graph influence at ~50%.\n *\n * Formula: u_hat_i = max(0, u_i - beta * sum_{k in top-M where u_k > u_i}(u_k - u_i))\n *\n * When beta=0 or topM=0, returns original scores unchanged (no-op).\n */\nexport function applyLateralInhibition(\n  scores: Map<string, number>,\n  opts: { beta: number; topM: number }\n): Map<string, number> {\n  const { beta, topM } = opts;\n  if (beta === 0 || topM === 0) return new Map(scores);\n\n  const sorted = Array.from(scores.entries()).sort((a, b) => b[1] - a[1]);\n  const topCompetitors = sorted.slice(0, topM);\n\n  const result = new Map<string, number>();\n  for (const [node, u] of scores) {\n    let inhibition = 0;\n    for (const [, uK] of topCompetitors) {\n      if (uK > u) {\n        inhibition += uK - u;\n      }\n    }\n    result.set(node, Math.max(0, u - beta * inhibition));\n  }\n\n  return result;\n}\n"],"mappings":";;;;;;;;AAYA,SAAS,YAAY,OAAO,UAAU,YAAY;AAClD,YAAY,UAAU;AA+Df,IAAM,2CAA2C;AAEjD,IAAM,8CAA8C;AAGpD,IAAM,iBAAiB,CAAC,eAAe,UAAU,cAAc,aAAa,UAAU,SAAS;AAE/F,SAAS,UAAU,WAA2B;AACnD,SAAY,UAAK,WAAW,SAAS,QAAQ;AAC/C;AAEO,SAAS,cAAc,WAAmB,MAAyB;AACxE,SAAY,UAAK,UAAU,SAAS,GAAG,GAAG,IAAI,QAAQ;AACxD;AAEA,eAAsB,gBAAgB,WAAkC;AACtE,QAAM,MAAM,UAAU,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACvD;AAWA,IAAM,kBAAkB,oBAAI,IAA2B;AAWhD,SAAS,mBAAsB,UAAkB,IAAkC;AACxF,QAAM,OAAO,gBAAgB,IAAI,QAAQ,KAAK,QAAQ,QAAQ;AAC9D,QAAM,OAAO,KAAK,KAAK,IAAI,EAAE;AAC7B,kBAAgB;AAAA,IACd;AAAA,IACA,KAAK;AAAA,MACH,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,WAAW,WAAmB,MAAgC;AAClF,QAAM,gBAAgB,SAAS;AAC/B,QAAM,WAAW,cAAc,WAAW,KAAK,IAAI;AACnD,QAAM,OAAO,GAAG,KAAK,UAAU,IAAI,CAAC;AAAA;AACpC,QAAM,mBAAmB,UAAU,YAAY;AAC7C,UAAM,WAAW,UAAU,MAAM,MAAM;AAAA,EACzC,CAAC;AAID,iBAAe,WAAW,cAAc;AAAA,IACtC,QAAQ,KAAK;AAAA,IACb,QAAQ,KAAK;AAAA,IACb,MAAM,KAAK;AAAA,IACX,QAAQ,KAAK;AAAA,IACb,OAAO,KAAK;AAAA,IACZ,YAAY,OAAO,KAAK,eAAe,WAAW,KAAK,aAAa;AAAA,EACtE,CAAC;AACH;AAEA,SAAS,YAAY,KAA4C;AAC/D,SAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU;AAC9D;AAEA,SAAS,gBAAgB,KAAa,cAAsC;AAC1E,QAAM,QAAqB,CAAC;AAC5B,aAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,CAAC,QAAS;AACd,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,OAAO;AACjC,UAAI,iBAAiB,QAAQ,YAAY,GAAG;AAC1C,cAAM,KAAK,MAAM;AAAA,MACnB;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAWA,eAAsB,UAAU,WAAmB,MAAuC;AACxF,QAAM,WAAW,cAAc,WAAW,IAAI;AAC9C,MAAI;AACF,UAAM,MAAM,MAAM,SAAS,UAAU,MAAM;AAC3C,WAAO,gBAAgB,KAAK,IAAI;AAAA,EAClC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AASA,eAAsB,gBAAgB,WAAmB,MAAuC;AAC9F,QAAM,WAAW,cAAc,WAAW,IAAI;AAC9C,MAAI;AACF,UAAM,MAAM,MAAM,SAAS,UAAU,MAAM;AAC3C,WAAO,gBAAgB,KAAK,IAAI;AAAA,EAClC,SAAS,KAAK;AACZ,QAAI,YAAY,GAAG,KAAK,IAAI,SAAS,UAAU;AAC7C,aAAO,CAAC;AAAA,IACV;AACA,UAAM;AAAA,EACR;AACF;AAKA,eAAsB,aACpB,WACA,WACsB;AACtB,QAAM,QAAuB,MAAM,QAAQ,IAAI;AAAA,IAC7C,UAAU,cAAc,UAAU,WAAW,QAAQ,IAAI,QAAQ,QAAQ,CAAC,CAAC;AAAA,IAC3E,UAAU,YAAY,UAAU,WAAW,MAAM,IAAI,QAAQ,QAAQ,CAAC,CAAC;AAAA,IACvE,UAAU,cAAc,UAAU,WAAW,QAAQ,IAAI,QAAQ,QAAQ,CAAC,CAAC;AAAA,EAC7E,CAAC;AACD,SAAO,MAAM,KAAK;AACpB;AAyBA,SAAS,iBAAiB,KAAc,cAA2C;AACjF,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,QAAM,OAAO;AACb,SACE,KAAK,SAAS,gBACd,OAAO,KAAK,SAAS,YACrB,KAAK,KAAK,SAAS,KACnB,OAAO,KAAK,OAAO,YACnB,KAAK,GAAG,SAAS,KACjB,OAAO,KAAK,WAAW,YACvB,OAAO,SAAS,KAAK,MAAM,KAC3B,OAAO,KAAK,UAAU,YACtB,OAAO,KAAK,OAAO;AAEvB;AAEA,eAAsB,mBACpB,WACA,SAM4B;AAC5B,QAAM,eAA4B,CAAC;AACnC,MAAI,SAAS,uBAAuB,MAAO,cAAa,KAAK,QAAQ;AACrE,MAAI,SAAS,qBAAqB,MAAO,cAAa,KAAK,MAAM;AACjE,MAAI,SAAS,uBAAuB,MAAO,cAAa,KAAK,QAAQ;AAErE,QAAM,QAAgC,CAAC;AACvC,QAAM,cAAc,oBAAI,IAAY;AAEpC,aAAW,QAAQ,cAAc;AAC/B,UAAM,WAAW,cAAc,WAAW,IAAI;AAC9C,QAAI,SAAS;AACb,QAAI,aAAa;AACjB,QAAI,aAAa;AACjB,QAAI,eAAe;AACnB,UAAM,QAAQ,oBAAI,IAAY;AAE9B,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,UAAU,MAAM;AAC3C,iBAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,cAAM,UAAU,KAAK,KAAK;AAC1B,YAAI,CAAC,QAAS;AACd,sBAAc;AACd,YAAI;AACF,gBAAM,SAAS,KAAK,MAAM,OAAO;AACjC,cAAI,CAAC,iBAAiB,QAAQ,IAAI,GAAG;AACnC,4BAAgB;AAChB;AAAA,UACF;AACA,wBAAc;AACd,gBAAM,IAAI,OAAO,IAAI;AACrB,gBAAM,IAAI,OAAO,EAAE;AACnB,sBAAY,IAAI,OAAO,IAAI;AAC3B,sBAAY,IAAI,OAAO,EAAE;AAAA,QAC3B,QAAQ;AACN,0BAAgB;AAAA,QAClB;AAAA,MACF;AAAA,IACF,QAAQ;AACN,eAAS;AAAA,IACX;AAEA,UAAM,KAAK;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,MAAM;AAAA,IACrB,CAAC;AAAA,EACH;AAEA,QAAM,SAAS,MAAM;AAAA,IACnB,CAAC,KAAK,SAAS;AACb,UAAI,cAAc,KAAK;AACvB,UAAI,cAAc,KAAK;AACvB,UAAI,gBAAgB,KAAK;AACzB,aAAO;AAAA,IACT;AAAA,IACA;AAAA,MACE,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,aAAa,YAAY;AAAA,IAC3B;AAAA,EACF;AACA,SAAO,cAAc,YAAY;AAEjC,QAAM,SAA4B;AAAA,IAChC,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,IACpC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,SAAS,0BAA0B,MAAM;AAC3C,UAAM,WAAqB,CAAC;AAC5B,QAAI,OAAO,eAAe,GAAG;AAC3B,eAAS;AAAA,QACP;AAAA,MACF;AAAA,IACF;AACA,QAAI,OAAO,eAAe,GAAG;AAC3B,eAAS;AAAA,QACP;AAAA,MACF;AAAA,IACF;AACA,QAAI,SAAS,SAAS,EAAG,QAAO,iBAAiB;AAAA,EACnD;AAEA,SAAO;AACT;AAKO,SAAS,mBAAmB,MAA6B;AAC9D,QAAM,QAAQ,KAAK,YAAY;AAC/B,aAAW,UAAU,gBAAgB;AACnC,QAAI,MAAM,SAAS,MAAM,EAAG,QAAO;AAAA,EACrC;AACA,SAAO;AACT;AAuBO,IAAM,aAAN,MAAM,YAAW;AAAA,EACL;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMT,YAaG;AAAA,EACX,OAAwB,oBAAoB;AAAA;AAAA,EAE5C,YAAY,WAAmB,KAAkB;AAC/C,SAAK,YAAY;AACjB,SAAK,MAAM;AAAA,EACb;AAAA;AAAA;AAAA,EAIA,sBAA4B;AAC1B,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,MAAc,kBAAwC;AACpD,QAAI,KAAK,aAAa,KAAK,IAAI,IAAI,KAAK,UAAU,WAAW,YAAW,mBAAmB;AACzF,aAAO,KAAK,UAAU;AAAA,IACxB;AAOA,QAAI,WAAwB,CAAC;AAC7B,QAAI,OAAO,MAAM,KAAK,yBAAyB;AAC/C,QAAI,SAAS;AACb,aAAS,UAAU,GAAG,UAAU,GAAG,WAAW;AAC5C,YAAM,SAAS;AACf,iBAAW,MAAM,aAAa,KAAK,WAAW;AAAA,QAC5C,aAAa,KAAK,IAAI;AAAA,QACtB,WAAW,KAAK,IAAI;AAAA,QACpB,aAAa,KAAK,IAAI;AAAA,MACxB,CAAC;AACD,aAAO,MAAM,KAAK,yBAAyB;AAC3C,UAAI,KAAK,mBAAmB,QAAQ,IAAI,GAAG;AACzC,iBAAS;AACT;AAAA,MACF;AAAA,IAGF;AACA,QAAI,QAAQ;AACV,WAAK,YAAY,EAAE,UAAU,UAAU,KAAK,IAAI,GAAG,KAAK;AAAA,IAC1D,OAAO;AAML,WAAK,YAAY;AAAA,IACnB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAc,2BAA+E;AAC3F,UAAM,UAAuB,CAAC;AAC9B,QAAI,KAAK,IAAI,mBAAoB,SAAQ,KAAK,QAAQ;AACtD,QAAI,KAAK,IAAI,iBAAkB,SAAQ,KAAK,MAAM;AAClD,QAAI,KAAK,IAAI,mBAAoB,SAAQ,KAAK,QAAQ;AACtD,UAAM,OAAkD,CAAC;AACzD,eAAW,QAAQ,SAAS;AAC1B,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,cAAc,KAAK,WAAW,IAAI,CAAC;AACzD,aAAK,IAAI,IAAI,EAAE,MAAM,GAAG,MAAM,SAAS,GAAG,SAAS,KAAK,OAAO,GAAG,GAAG,EAAE;AAAA,MACzE,QAAQ;AACN,aAAK,IAAI,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,KAAK,EAAE;AAAA,MAC7C;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGQ,mBACN,GACA,GACS;AACT,UAAM,QAAqB,CAAC,UAAU,QAAQ,QAAQ;AACtD,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,EAAE,IAAI;AAChB,YAAM,IAAI,EAAE,IAAI;AAChB,UAAI,CAAC,KAAK,CAAC,EAAG;AACd,UAAI,CAAC,KAAK,CAAC,EAAG,QAAO;AACrB,UAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,QAAQ,EAAE,IAAK,QAAO;AAAA,IAC9E;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAc,wCAA0D;AACtE,QAAI,CAAC,KAAK,UAAW,QAAO;AAC5B,eAAW,QAAQ,OAAO,KAAK,KAAK,UAAU,IAAI,GAAkB;AAClE,YAAM,YAAY,KAAK,UAAU,KAAK,IAAI;AAC1C,UAAI,CAAC,UAAW;AAChB,UAAI;AACJ,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,cAAc,KAAK,WAAW,IAAI,CAAC;AACzD,cAAM,EAAE,MAAM,GAAG,MAAM,SAAS,GAAG,SAAS,KAAK,OAAO,GAAG,GAAG,EAAE;AAAA,MAClE,SAAS,KAAK;AACZ,YAAK,KAA+B,SAAS,UAAU;AACrD,gBAAM,EAAE,MAAM,GAAG,SAAS,GAAG,KAAK,EAAE;AAAA,QACtC,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,UACE,IAAI,SAAS,UAAU,QACvB,IAAI,YAAY,UAAU,WAC1B,IAAI,QAAQ,UAAU,KACtB;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,gBAAgB,MAoBJ;AAChB,UAAM,IAAI,KAAK;AACf,UAAM,eAAe,IAAI,EAAE,mBAAmB,KAAK,IAAI;AACvD,QAAI,CAAC,aAAc;AACnB,UAAM,WAAW,IAAI,EAAE,cAAc,KAAK,IAAI;AAC9C,UAAM,SAAS,IAAI,EAAE,YAAY,KAAK,IAAI;AAC1C,UAAM,WAAW,IAAI,EAAE,cAAc,KAAK,IAAI;AAC9C,UAAM,MAAK,oBAAI,KAAK,GAAE,YAAY;AAGlC,UAAM,WAAwB,CAAC;AAE/B,QAAI;AAEF,UAAI,YAAY,KAAK,aAAa,KAAK,gBAAgB,QAAQ;AAC7D,cAAM,WAAW,KAAK,eAAe,MAAM,GAAG,KAAK,IAAI,4BAA4B;AACnF,mBAAW,WAAW,UAAU;AAC9B,gBAAM,OAAkB;AAAA,YACtB,MAAM,KAAK;AAAA,YACX,IAAI;AAAA,YACJ,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,OAAO,KAAK;AAAA,YACZ;AAAA,UACF;AACA,mBAAS,KAAK,IAAI;AAClB,gBAAM,WAAW,KAAK,WAAW,IAAI;AAAA,QACvC;AAAA,MACF;AAGA,UAAI,UAAU,KAAK,YAAY,KAAK,gBAAgB,QAAQ;AAC1D,cAAM,cAAc,KAAK,eAAe,KAAK,eAAe,SAAS,CAAC;AACtE,YAAI,eAAe,gBAAgB,KAAK,YAAY;AAClD,gBAAM,OAAkB;AAAA,YACtB,MAAM;AAAA,YACN,IAAI,KAAK;AAAA,YACT,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,OAAO,KAAK;AAAA,YACZ;AAAA,UACF;AACA,mBAAS,KAAK,IAAI;AAClB,gBAAM,WAAW,KAAK,WAAW,IAAI;AAAA,QACvC;AAAA,MACF;AAGA,UAAI,YAAY,KAAK,mBAAmB;AACtC,cAAM,SAAS,mBAAmB,KAAK,OAAO;AAC9C,YAAI,QAAQ;AACV,gBAAM,OAAkB;AAAA,YACtB,MAAM,KAAK;AAAA,YACX,IAAI,KAAK;AAAA,YACT,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,OAAO;AAAA,YACP;AAAA,UACF;AACA,mBAAS,KAAK,IAAI;AAClB,gBAAM,WAAW,KAAK,WAAW,IAAI;AAAA,QACvC;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AAEZ,YAAM,EAAE,IAAI,IAAI,MAAM,OAAO,aAAa;AAC1C,UAAI,KAAK,kCAAkC,GAAG,EAAE;AAAA,IAClD,UAAE;AAGA,UAAI,CAAC,KAAK,aAAa,KAAK,IAAI,IAAI,KAAK,UAAU,YAAY,YAAW,mBAAmB;AAE3F,aAAK,YAAY;AAAA,MACnB,WAAW,KAAK,IAAI,qCAAqC,OAAO;AAE9D,aAAK,YAAY;AAAA,MACnB,OAAO;AAML,YAAI;AACF,cAAI,MAAM,KAAK,mCAAmC,QAAQ,GAAG;AAC3D,gBAAI,SAAS,SAAS,GAAG;AACvB,mBAAK,UAAU,SAAS,KAAK,GAAG,QAAQ;AAQxC,kBAAI,KAAK,aAAa,CAAE,MAAM,KAAK,sCAAsC,GAAI;AAC3E,qBAAK,YAAY;AAAA,cACnB;AAAA,YACF;AAAA,UACF,OAAO;AACL,iBAAK,YAAY;AAAA,UACnB;AAAA,QACF,QAAQ;AACN,eAAK,YAAY;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAsBA,MAAc,mCAAmC,UAAyC;AACxF,QAAI,CAAC,KAAK,UAAW,QAAO;AAC5B,UAAM,gBAAoD,CAAC;AAC3D,eAAW,QAAQ,UAAU;AAC3B,YAAM,QAAQ,OAAO,WAAW,GAAG,KAAK,UAAU,IAAI,CAAC;AAAA,GAAM,MAAM;AACnE,oBAAc,KAAK,IAAI,KAAK,cAAc,KAAK,IAAI,KAAK,KAAK;AAAA,IAC/D;AACA,UAAM,UAAuB,CAAC;AAC9B,QAAI,KAAK,IAAI,mBAAoB,SAAQ,KAAK,QAAQ;AACtD,QAAI,KAAK,IAAI,iBAAkB,SAAQ,KAAK,MAAM;AAClD,QAAI,KAAK,IAAI,mBAAoB,SAAQ,KAAK,QAAQ;AACtD,UAAM,WAAsD,CAAC;AAC7D,eAAW,QAAQ,SAAS;AAC1B,UAAI;AACJ,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,cAAc,KAAK,WAAW,IAAI,CAAC;AACzD,cAAM,EAAE,MAAM,GAAG,MAAM,SAAS,GAAG,SAAS,KAAK,OAAO,GAAG,GAAG,EAAE;AAAA,MAClE,SAAS,KAAK;AAKZ,YAAK,KAA+B,SAAS,UAAU;AACrD,gBAAM,EAAE,MAAM,GAAG,SAAS,GAAG,KAAK,EAAE;AAAA,QACtC,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,YAAM,OAAO,KAAK,UAAU,KAAK,IAAI,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,KAAK,EAAE;AACxE,YAAM,QAAQ,cAAc,IAAI,KAAK;AACrC,UAAI,QAAQ,GAAG;AACb,YAAI,KAAK,QAAQ,GAAG;AAGlB,cAAI,IAAI,QAAQ,KAAK,IAAI,SAAS,MAAO,QAAO;AAAA,QAClD,OAAO;AAIL,cAAI,IAAI,QAAQ,KAAK,OAAO,IAAI,SAAS,KAAK,OAAO,MAAO,QAAO;AAAA,QACrE;AAAA,MACF,OAAO;AAEL,YAAI,IAAI,QAAQ,KAAK,OAAO,IAAI,SAAS,KAAK,QAAQ,IAAI,YAAY,KAAK,SAAS;AAClF,iBAAO;AAAA,QACT;AAAA,MACF;AACA,eAAS,IAAI,IAAI;AAAA,IACnB;AACA,SAAK,UAAU,OAAO;AACtB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBA,MAAM,oBACJ,OACA,UACA,MA0BA;AACA,QAAI,CAAC,KAAK,IAAI,wBAAyB,QAAO,CAAC;AAC/C,UAAM,QAAQ,YAAY,KAAK,IAAI;AACnC,UAAM,QAAQ,KAAK,IAAI;AAMvB,UAAM,QACJ,MAAM,yBAAyB,OAAO,IAAI,qBAAqB,KAAK,IAAI,6BAA6B;AACvG,UAAM,aAAa,wBAAwB,KAAK,IAAI,gCAAgC;AACpF,UAAM,eAAe,MAAM;AAC3B,UAAM,kBAAkB,MACtB,OAAO,iBAAiB,YAAY,KAAK,IAAI,KAAK;AAEpD,QAAI;AACF,UAAI,gBAAgB,EAAG,QAAO,CAAC;AAC/B,YAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,UAAI,gBAAgB,EAAG,QAAO,CAAC;AAK/B,YAAM,MAAM,oBAAI,IAAyB;AACzC,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;AAC3C,aAAK,IAAI,UAAU,KAAK,gBAAgB,EAAG,QAAO,CAAC;AACnD,cAAM,OAAO,SAAS,CAAC;AACvB,cAAM,OAAO,mBAAmB,IAAI;AACpC,YAAI,OAAO,MAAO;AAClB,YAAI,CAAC,IAAI,IAAI,KAAK,IAAI,EAAG,KAAI,IAAI,KAAK,MAAM,CAAC,CAAC;AAC9C,YAAI,IAAI,KAAK,IAAI,EAAG,KAAK,IAAI;AAE7B,YAAI,KAAK,SAAS,UAAU;AAC1B,cAAI,CAAC,IAAI,IAAI,KAAK,EAAE,EAAG,KAAI,IAAI,KAAK,IAAI,CAAC,CAAC;AAC1C,cAAI,IAAI,KAAK,EAAE,EAAG,KAAK,EAAE,GAAG,MAAM,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,QAClE;AAAA,MACF;AAEA,YAAM,UAAU,IAAI,IAAI,KAAK;AAC7B,YAAM,SAAS,oBAAI,IAAoB;AACvC,YAAM,aAAa,oBAAI,IASrB;AACF,UAAI,WAAW,oBAAI,IAAgE;AACnF,YAAM,gBAAgB,oBAAI,IAAyB;AACnD,iBAAW,QAAQ,OAAO;AACxB,iBAAS,IAAI,GAAG,IAAI,KAAK,IAAI,IAAI,EAAE,MAAM,MAAM,MAAM,YAAY,EAAE,CAAC;AACpE,sBAAc,IAAI,MAAM,oBAAI,IAAI,CAAC,IAAI,CAAC,CAAC;AAAA,MACzC;AACA,YAAM,iBAAiB,MACrB,MAAM,KAAK,OAAO,QAAQ,CAAC,EACxB,IAAI,CAAC,CAAC,GAAG,KAAK,OAAO;AAAA,QACpB,MAAM;AAAA,QACN;AAAA,QACA,MAAM,WAAW,IAAI,CAAC,GAAG,QAAQ;AAAA,QACjC,UAAU,WAAW,IAAI,CAAC,GAAG,YAAY;AAAA,QACzC,eAAe,WAAW,IAAI,CAAC,GAAG,iBAAiB;AAAA,QACnD,WAAW,WAAW,IAAI,CAAC,GAAG,aAAa;AAAA,QAC3C,gBAAgB,WAAW,IAAI,CAAC,GAAG,kBAAkB;AAAA,MACvD,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAErC,eAAS,MAAM,GAAG,MAAM,SAAS,SAAS,OAAO,GAAG,OAAO;AACzD,YAAI,gBAAgB,EAAG,QAAO,eAAe;AAC7C,cAAM,eAAe,oBAAI,IAAgE;AAEzF,mBAAW,EAAE,MAAM,MAAM,YAAY,WAAW,KAAK,SAAS,OAAO,GAAG;AACtE,gBAAM,QAAQ,IAAI,IAAI,IAAI,KAAK,CAAC;AAChC,mBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACxC,iBAAK,IAAI,UAAU,KAAK,gBAAgB,EAAG,QAAO,eAAe;AACjE,kBAAM,OAAO,MAAM,CAAC;AACpB,kBAAM,WAAW,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK;AACrD,kBAAM,OAAO,mBAAmB,IAAI;AAIpC,gBAAI,OAAO,MAAO;AAClB,kBAAM,QAAQ,aAAa,KAAK,SAAS,OAAO;AAChD,kBAAM,iBAAiB,cAAc,IAAI,UAAU;AACnD,gBAAI,gBAAgB,IAAI,QAAQ,GAAG;AACjC;AAAA,YACF;AAEA,gBAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,oBAAM,WAAW,OAAO,IAAI,QAAQ,KAAK;AACzC,qBAAO,IAAI,UAAU,WAAW,KAAK;AAErC,oBAAM,OAAO,WAAW,IAAI,QAAQ;AACpC,kBAAI,CAAC,QAAQ,MAAM,IAAI,KAAK,YAAa,MAAM,MAAM,KAAK,YAAY,QAAQ,KAAK,eAAgB;AACjG,2BAAW,IAAI,UAAU;AAAA,kBACvB,MAAM;AAAA,kBACN,UAAU,MAAM;AAAA,kBAChB,eAAe;AAAA,kBACf,WAAW,KAAK;AAAA,kBAChB,gBAAgB;AAAA,gBAClB,CAAC;AAAA,cACH;AAEA,kBAAI,MAAM,IAAI,OAAO;AACnB,sBAAM,cAAc,GAAG,UAAU,KAAK,QAAQ;AAC9C,sBAAM,mBAAmB,aAAa,IAAI,WAAW;AACrD,oBAAI,kBAAkB;AACpB,mCAAiB,cAAc;AAAA,gBACjC,OAAO;AACL,+BAAa,IAAI,aAAa;AAAA,oBAC5B,MAAM;AAAA,oBACN,MAAM;AAAA,oBACN,YAAY;AAAA,kBACd,CAAC;AAAA,gBACH;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,mBAAW,EAAE,MAAM,KAAK,KAAK,aAAa,OAAO,GAAG;AAClD,wBAAc,IAAI,IAAI,GAAG,IAAI,IAAI;AAAA,QACnC;AACA,mBAAW;AAAA,MACb;AAOA,UAAI,CAAC,gBAAgB,KAAK,aAAa,KAAK,OAAO,OAAO,GAAG;AAC3D,gCAAwB,QAAQ,KAAK;AAAA,UACnC;AAAA,UACA;AAAA,UACA,SAAS;AAAA,UACT;AAAA,QACF,CAAC;AAAA,MACH;AAGA,UAAI,gBAAgB,EAAG,QAAO,eAAe;AAC7C,UAAI,KAAK,IAAI,iCAAiC,OAAO,OAAO,GAAG;AAC7D,cAAM,YAAY,uBAAuB,QAAQ;AAAA,UAC/C,MAAM,KAAK,IAAI;AAAA,UACf,MAAM,KAAK,IAAI;AAAA,QACjB,CAAC;AACD,mBAAW,CAAC,GAAG,CAAC,KAAK,WAAW;AAC9B,iBAAO,IAAI,GAAG,CAAC;AAAA,QACjB;AAAA,MACF;AAEA,aAAO,eAAe;AAAA,IACxB,SAAS,KAAK;AACZ,YAAM,EAAE,IAAI,IAAI,MAAM,OAAO,aAAa;AAC1C,UAAI,KAAK,sCAAsC,GAAG,EAAE;AACpD,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AACF;AAUO,SAAS,qBAAqB,KAAsB;AACzD,MAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,SAAS,GAAG,GAAG;AACpD,WAAO;AAAA,EACT;AACA,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,MAAM,EAAG,QAAO;AACpB,SAAO;AACT;AAOO,SAAS,wBAAwB,KAAsB;AAC5D,MAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO;AAC7D,MAAI,OAAO,EAAG,QAAO;AACrB,SAAO,KAAK,MAAM,GAAG;AACvB;AAaO,SAAS,wBACd,QACA,KACA,MACM;AACN,QAAM,EAAE,YAAY,OAAO,SAAS,aAAa,IAAI;AACrD,MAAI,cAAc,KAAK,OAAO,SAAS,EAAG;AAC1C,QAAM,cAAc,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,OAAO,CAAC;AACpD,QAAM,kBAAkB,MACtB,OAAO,iBAAiB,YAAY,KAAK,IAAI,KAAK;AAYpD,QAAM,WAAW,CAAC,MAAiB,aAA8B;AAC/D,QAAI,mBAAmB,IAAI,IAAI,MAAO,QAAO;AAC7C,UAAM,WAAW,KAAK,OAAO,WAAW,KAAK,OAAO,KAAK;AACzD,WAAO,OAAO,IAAI,QAAQ;AAAA,EAC5B;AACA,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,aAAW,CAAC,MAAM,KAAK,KAAK,IAAI,QAAQ,GAAG;AACzC,QAAI,gBAAgB,EAAG;AACvB,QAAI,CAAC,OAAO,IAAI,IAAI,EAAG;AACvB,QAAI,MAAM;AACV,eAAW,QAAQ,OAAO;AACxB,UAAI,CAAC,SAAS,MAAM,IAAI,EAAG;AAC3B,aAAO,mBAAmB,IAAI,IAAI,KAAK;AAAA,IACzC;AACA,QAAI,MAAM,EAAG,eAAc,IAAI,MAAM,GAAG;AAAA,EAC1C;AAEA,WAAS,IAAI,GAAG,IAAI,YAAY,KAAK,GAAG;AACtC,QAAI,gBAAgB,EAAG;AACvB,UAAM,OAAO,oBAAI,IAAoB;AAGrC,eAAW,CAAC,MAAM,KAAK,KAAK,QAAQ;AAClC,WAAK,IAAI,OAAO,IAAI,eAAe,KAAK;AAAA,IAC1C;AACA,eAAW,CAAC,MAAM,KAAK,KAAK,QAAQ;AAClC,YAAM,WAAW,IAAI,IAAI,IAAI;AAC7B,YAAM,QAAQ,cAAc,IAAI,IAAI;AAMpC,UAAI,CAAC,YAAY,SAAS,WAAW,KAAK,CAAC,SAAS,SAAS,GAAG;AAC9D,aAAK,IAAI,OAAO,KAAK,IAAI,IAAI,KAAK,KAAK,cAAc,KAAK;AAC1D;AAAA,MACF;AACA,eAAS,YAAY,GAAG,YAAY,SAAS,QAAQ,aAAa,GAAG;AACnE,aAAK,YAAY,UAAU,KAAK,gBAAgB,EAAG;AACnD,cAAM,OAAO,SAAS,SAAS;AAC/B,YAAI,CAAC,SAAS,MAAM,IAAI,EAAG;AAC3B,cAAM,OAAO,mBAAmB,IAAI;AACpC,cAAM,WAAW,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK;AACrD,cAAM,OAAO,cAAc,SAAU,OAAO,KAAK,SAAU;AAC3D,aAAK,IAAI,WAAW,KAAK,IAAI,QAAQ,KAAK,KAAK,IAAI;AAAA,MACrD;AAAA,IACF;AACA,eAAW,CAAC,MAAM,KAAK,KAAK,MAAM;AAChC,aAAO,IAAI,MAAM,KAAK;AAAA,IACxB;AAAA,EACF;AACF;AAgBO,SAAS,uBACd,QACA,MACqB;AACrB,QAAM,EAAE,MAAM,KAAK,IAAI;AACvB,MAAI,SAAS,KAAK,SAAS,EAAG,QAAO,IAAI,IAAI,MAAM;AAEnD,QAAM,SAAS,MAAM,KAAK,OAAO,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACtE,QAAM,iBAAiB,OAAO,MAAM,GAAG,IAAI;AAE3C,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,MAAM,CAAC,KAAK,QAAQ;AAC9B,QAAI,aAAa;AACjB,eAAW,CAAC,EAAE,EAAE,KAAK,gBAAgB;AACnC,UAAI,KAAK,GAAG;AACV,sBAAc,KAAK;AAAA,MACrB;AAAA,IACF;AACA,WAAO,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,OAAO,UAAU,CAAC;AAAA,EACrD;AAEA,SAAO;AACT;","names":[]}

package/dist/{chunk-5S7Z5SHA.js → chunk-34RC5RT7.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-G7D6GZ5J.js";
 import {
   sidecarKey
-} from "./chunk-VZ5OJE4X.js";
+} from "./chunk-5VQJBH2G.js";
 import {
   RECALL_FALLBACK_DIRS
 } from "./chunk-VS2IYZRU.js";
@@ -342,4 +342,4 @@ function isPathWithin(candidate, root) {
 export {
   runConsolidationProvenanceCheck
 };
-//# sourceMappingURL=chunk-5S7Z5SHA.js.map
+//# sourceMappingURL=chunk-34RC5RT7.js.map

package/dist/{chunk-JKLJ6A7W.js → chunk-3D6AFGQR.js}

@@ -8,7 +8,7 @@ import {
 } from "./chunk-KAWTOYAW.js";
 import {
   LocalLlmClient
-} from "./chunk-VY6LKKVN.js";
+} from "./chunk-NWTGD4AN.js";
 import {
   sessionStoragePaths
 } from "./chunk-S4DDLTPX.js";
@@ -690,4 +690,4 @@ ${truncatedConversation}`;
 export {
   HourlySummarizer
 };
-//# sourceMappingURL=chunk-JKLJ6A7W.js.map
+//# sourceMappingURL=chunk-3D6AFGQR.js.map

package/dist/{chunk-2AL7N3BH.js → chunk-3IY64MV6.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-EGGE52UU.js";
 import {
   StorageManager
-} from "./chunk-TRH533CA.js";
+} from "./chunk-K7LOWSLU.js";
 import {
   MutationSerializer
 } from "./chunk-LTJAMRGI.js";
@@ -190,6 +190,8 @@ var NamespaceStorageRouter = class {
       this.config.hotMemoriesCacheEnabled,
       this.config.hotMemoriesCacheTtlMs
     );
+    const { scopedCacheInvalidationEnabled } = this.config;
+    StorageManager.setScopedCacheInvalidationDefault(root, scopedCacheInvalidationEnabled);
     sm.citationTemplate = this.config.inlineSourceAttributionFormat;
     this.bindCatalogWriteHook(sm, ns);
     this.applyTombstonesConfig(sm, ns);
@@ -350,4 +352,4 @@ export {
   resolveNamespaceStorageRoot,
   NamespaceStorageRouter
 };
-//# sourceMappingURL=chunk-2AL7N3BH.js.map
+//# sourceMappingURL=chunk-3IY64MV6.js.map

package/dist/chunk-3IY64MV6.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/namespaces/storage.ts"],"sourcesContent":["import { resolveNamespaceCapabilities } from \"../capabilities.js\";\nimport path from \"node:path\";\nimport { access, lstat, readdir } from \"node:fs/promises\";\nimport { isSafeRouteNamespace } from \"../routing/engine.js\";\nimport { StorageManager } from \"../storage.js\";\nimport type { PluginConfig } from \"../types.js\";\nimport { ALL_CATEGORY_DIRS } from \"../utils/category-dir.js\";\nimport { namespaceIdentityToken, normalizeNamespaceIdentity } from \"./identity.js\";\nimport type { NamespaceCatalog } from \"./catalog.js\";\nimport { MutationSerializer } from \"../utils/serialize-mutations.js\";\n\nasync function exists(p: string): Promise<boolean> {\n  try {\n    await access(p);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\nasync function hasStoredEntries(p: string): Promise<boolean> {\n  try {\n    const entry = await lstat(p);\n    if (entry.isSymbolicLink()) return true;\n    if (!entry.isDirectory()) return true;\n    const children = await readdir(p, { withFileTypes: true });\n    for (const child of children) {\n      const childPath = path.join(p, child.name);\n      if (child.isSymbolicLink() || child.isFile()) return true;\n      if (child.isDirectory() && (await hasStoredEntries(childPath))) return true;\n    }\n    return false;\n  } catch {\n    return false;\n  }\n}\n\n// Build a per-namespace directory under `<memoryDir>/namespaces` and assert the\n// resolved path stays inside that base. Namespace identifiers can originate from\n// operator config (config.defaultNamespace) and request-derived routing, so this\n// containment check prevents directory traversal (CodeQL js/path-injection).\n// For safe segments this returns exactly `path.join(base, segment)`, so there is\n// no behavioral change for valid namespaces.\nfunction resolveNamespaceDir(memoryDir: string, segment: string): string {\n  // Mirror isSafeRouteNamespace's separator/parent-ref rejection (without its\n  // 64-char cap, so identity tokens still pass). Rejecting separators and \"..\"\n  // up front keeps the value a single contained child of <memoryDir>/namespaces.\n  if (\n    segment.length === 0 ||\n    segment.includes(\"/\") ||\n    segment.includes(\"\\\\\") ||\n    segment.includes(\"..\") ||\n    path.isAbsolute(segment)\n  ) {\n    throw new Error(`unsafe namespace path segment: ${segment}`);\n  }\n  return path.join(memoryDir, \"namespaces\", segment);\n}\n\nconst LEGACY_NAMESPACE_CONTENT_CHILDREN = [\n  ...ALL_CATEGORY_DIRS,\n  \"entities\",\n  \"artifacts\",\n  \"identity\",\n  \"config\",\n  \"summaries\",\n  \"profile.md\",\n] as const;\n\nconst LEGACY_NAMESPACE_RUNTIME_CHILDREN = [\"state\"] as const;\n\nasync function hasAnyLegacyData(\n  rootDir: string,\n  options: { includeRuntimeState?: boolean } = {},\n): Promise<boolean> {\n  const children = options.includeRuntimeState === true\n    ? [...LEGACY_NAMESPACE_CONTENT_CHILDREN, ...LEGACY_NAMESPACE_RUNTIME_CHILDREN]\n    : LEGACY_NAMESPACE_CONTENT_CHILDREN;\n  for (const child of children) {\n    if (await hasStoredEntries(path.join(rootDir, child))) return true;\n  }\n  return false;\n}\n\nasync function hasAnyNamespaceStorageMarker(\n  rootDir: string,\n  options: { includeRuntimeState?: boolean } = {},\n): Promise<boolean> {\n  const children = options.includeRuntimeState === true\n    ? [...LEGACY_NAMESPACE_CONTENT_CHILDREN, ...LEGACY_NAMESPACE_RUNTIME_CHILDREN]\n    : LEGACY_NAMESPACE_CONTENT_CHILDREN;\n  for (const child of children) {\n    if (await exists(path.join(rootDir, child))) return true;\n  }\n  return false;\n}\n\n/**\n * Storage routing for namespaces.\n *\n * Compatibility note:\n * - When namespaces are enabled, existing raw namespace roots are preserved.\n *   New namespace roots use tokenized names under `memoryDir/namespaces/<token>`.\n * - The default namespace continues to use the legacy `memoryDir` root unless the caller\n *   has created `memoryDir/namespaces/<defaultNamespace>` (in which case we use that).\n *\n * This avoids surprising \"lost memories\" when an install flips namespaces on without\n * migrating existing data.\n */\n/**\n * Optional hooks for the storage router. `onResolve` fires whenever a namespace's\n * storage is resolved/created, so a downstream consumer (e.g. the namespace\n * catalog, issue #1499) can register the namespace. The hook MUST NOT throw into\n * the router; the router invokes it defensively and a hook failure never affects\n * storage resolution.\n *\n * The hook MAY return (or resolve to) a boolean indicating whether the\n * registration actually PERSISTED (round 6, codex P2 — NEFoX). When it resolves\n * to `false` (a dropped/no-op registration), the router does NOT mark the\n * (namespace, storageDir) pair as notified, so the next resolve RETRIES it\n * instead of suppressing it forever. A `void`/`undefined` result is treated as\n * success (legacy hooks).\n */\nexport interface NamespaceStorageRouterHooks {\n  onResolve?: (\n    namespace: string,\n    storageDir: string,\n  ) => void | boolean | Promise<void | boolean>;\n}\n\n/**\n * Resolve the runtime storage root for the configured DEFAULT namespace.\n *\n * Shared between the live router (`NamespaceStorageRouter.defaultNamespaceRoot`)\n * and the rebuildable catalog (`NamespaceCatalog.rebuildFromDisk`) so the two\n * can never diverge (CLAUDE.md rule #22/#42 — read & write paths resolve through\n * the same logic). The contract is: while legacy memory data still lives\n * directly under `memoryDir`, the default root stays `memoryDir`; only once the\n * legacy root is empty and a `namespaces/<default|token>` dir holds data does\n * the default migrate into that tokenized/legacy-named dir.\n */\nexport async function resolveDefaultNamespaceRoot(config: PluginConfig): Promise<string> {\n  if (!resolveNamespaceCapabilities(config).namespaces) {\n    return config.memoryDir;\n  }\n\n  // Build the legacy default root from the NORMALIZED (trimmed) name so a\n  // whitespace-padded `defaultNamespace` still finds the live `namespaces/default`\n  // root (NIabe). `storageFor()` classifies the trimmed value as the default, and\n  // the on-disk legacy dir is created under the trimmed name; using the raw spaced\n  // name here would look for `namespaces/<spaced>` and miss the real root, falling\n  // back to memoryDir/tokenized. `namespaceIdentityToken` already normalizes\n  // internally, so the tokenized path is unaffected.\n  const defaultIdentity = normalizeNamespaceIdentity(config.defaultNamespace);\n  const legacyNsDir = resolveNamespaceDir(config.memoryDir, defaultIdentity);\n  const tokenizedNsDir = resolveNamespaceDir(\n    config.memoryDir,\n    namespaceIdentityToken(config.defaultNamespace),\n  );\n  const tokenizedHasData =\n    (await exists(tokenizedNsDir)) &&\n    (await hasAnyNamespaceStorageMarker(tokenizedNsDir, { includeRuntimeState: true }));\n  const nsDir = tokenizedHasData\n    ? tokenizedNsDir\n    : (await exists(legacyNsDir))\n      ? legacyNsDir\n      : tokenizedNsDir;\n  return (await exists(nsDir)) && !(await hasAnyLegacyData(config.memoryDir))\n    ? nsDir\n    : config.memoryDir;\n}\n\n/**\n * Resolve the runtime storage root for ANY namespace exactly as the live router\n * would (`NamespaceStorageRouter.namespaceRoot`). Shared so the rebuildable\n * catalog records the SAME on-disk root the router routes to — a recall/read\n * touch must not guess `namespaces/<token>` when the router actually serves a\n * legacy raw-name dir or a migrated default root (CLAUDE.md rule #22/#42; round\n * 4, cursor Medium). The default namespace delegates to `resolveDefaultNamespaceRoot`;\n * every other namespace prefers the tokenized root when it has a storage marker,\n * else a legacy raw-name dir when present, else the tokenized root.\n */\nexport async function resolveNamespaceStorageRoot(\n  config: PluginConfig,\n  namespace: string,\n): Promise<string> {\n  if (!resolveNamespaceCapabilities(config).namespaces) return config.memoryDir;\n  // Compare on NORMALIZED identity so a whitespace-padded configured default name\n  // still routes to the default root rather than a tokenized non-default dir\n  // (NH-FH). The catalog keys records by the same normalized identity.\n  if (normalizeNamespaceIdentity(namespace) === normalizeNamespaceIdentity(config.defaultNamespace)) {\n    return resolveDefaultNamespaceRoot(config);\n  }\n  const legacyRoot = resolveNamespaceDir(config.memoryDir, namespace);\n  const tokenizedRoot = resolveNamespaceDir(config.memoryDir, namespaceIdentityToken(namespace));\n  if (\n    (await exists(tokenizedRoot)) &&\n    (await hasAnyNamespaceStorageMarker(tokenizedRoot, { includeRuntimeState: true }))\n  ) {\n    return tokenizedRoot;\n  }\n  return (await exists(legacyRoot)) ? legacyRoot : tokenizedRoot;\n}\n\nexport class NamespaceStorageRouter {\n  private readonly cache = new Map<string, StorageManager>();\n  private defaultNsRootResolved: string | null = null;\n  // Dedup the resolve hook (round 6, cursor Medium — NCNL2). Recall/extraction\n  // call `storageFor` repeatedly; firing `onResolve` (→ catalog loadCompacted +\n  // append) on every cache hit grows `namespaces.jsonl` without bound between\n  // rebuilds. We fire the hook only when the (namespace, storageDir) pair is new\n  // or its dir changed, so a steady-state cache hit is a no-op for the catalog.\n  private readonly notifiedResolved = new Map<string, string>();\n  // Instance-scoped serializer for the resolve hook (issue #1524 adoption).\n  // Replaces the bespoke `inFlightResolved` marker-then-clear pattern: the\n  // serializer's per-key chain strictly orders concurrent notifications for the\n  // SAME namespace, and the task re-checks `notifiedResolved` once it runs, so a\n  // burst of cache hits before the first hook settles collapses to a single\n  // hook invocation (the once-per-namespace intent). Recovery is preserved —\n  // one rejected hook never poisons subsequent notifications for that key.\n  private readonly resolveSerializer = new MutationSerializer();\n  // (namespace, storageDir) pairs whose resolve hook is currently pending. Set SYNCHRONOUSLY in\n  // notifyResolved (before queueing) so a burst of concurrent storageFor()\n  // cache hits collapses onto the one in-flight hook instead of each enqueuing\n  // its own task. Cleared when the queued hook settles. Without this, a dropped\n  // hook (returns false on a rebuild-lock timeout) leaves notifiedResolved\n  // unset, so every queued sibling task would re-run the hook — N serial lock\n  // waits (cursor Medium 06f58a7c, codex P2).\n  private readonly inFlightResolveHooks = new Set<string>();\n  // Tracks every in-flight resolve-hook promise so callers can deterministically\n  // await the fire-and-forget registrations that `storageFor()` kicks off (see\n  // `whenResolveHooksSettled`). Entries are removed as each hook settles, so the\n  // set holds at most one promise per concurrently-resolving namespace.\n  private readonly pendingResolveHooks = new Set<Promise<unknown>>();\n  // Pending post-write catalog touch promises (#1522). Like pendingResolveHooks,\n  // lets tests await fire-and-forget write touches deterministically.\n  private readonly pendingWriteTouches = new Set<Promise<unknown>>();\n\n  // Normalized (trimmed) default namespace identity (NH-FH). `storageFor`\n  // normalizes its input, so default-namespace branches must compare against the\n  // normalized config default too — otherwise a whitespace-padded configured\n  // default name routes the default namespace to a tokenized non-default root.\n  private readonly defaultNamespaceIdentity: string;\n\n  constructor(\n    private readonly config: PluginConfig,\n    private readonly hooks: NamespaceStorageRouterHooks = {},\n    /** Catalog reference for post-write/read touches (issue #1522 chokepoint). */\n    private readonly catalog?: NamespaceCatalog,\n  ) {\n    this.defaultNamespaceIdentity = normalizeNamespaceIdentity(config.defaultNamespace);\n  }\n\n  private async defaultNamespaceRoot(): Promise<string> {\n    this.defaultNsRootResolved = await resolveDefaultNamespaceRoot(this.config);\n    return this.defaultNsRootResolved;\n  }\n\n  private async namespaceRoot(namespace: string): Promise<string> {\n    // NOTE: only used after defaultNamespaceRoot() resolution.\n    if (!resolveNamespaceCapabilities(this.config).namespaces) return this.config.memoryDir;\n    if (normalizeNamespaceIdentity(namespace) === this.defaultNamespaceIdentity) {\n      return this.defaultNsRootResolved ?? this.config.memoryDir;\n    }\n    return resolveNamespaceStorageRoot(this.config, namespace);\n  }\n\n  async storageFor(namespace: string): Promise<StorageManager> {\n    const ns = normalizeNamespaceIdentity(namespace || this.config.defaultNamespace);\n    if (ns !== this.defaultNamespaceIdentity && !isSafeRouteNamespace(ns)) {\n      throw new Error(`unsafe namespace: ${ns}`);\n    }\n    // Even when the default namespace is exempt from the check above, every\n    // on-disk path is built through resolveNamespaceDir(), which rejects\n    // traversal segments — so an unsafe configured default still cannot escape\n    // <memoryDir>/namespaces (CodeQL js/path-injection).\n\n    let root: string;\n    if (ns === this.defaultNamespaceIdentity) {\n      root = await this.defaultNamespaceRoot();\n      const cached = this.cache.get(ns);\n      if (cached && cached.dir === root) {\n        this.notifyResolved(ns, root);\n        return cached;\n      }\n    } else {\n      const cached = this.cache.get(ns);\n      root = await this.namespaceRoot(ns);\n      if (cached && cached.dir === root) {\n        this.notifyResolved(ns, root);\n        return cached;\n      }\n    }\n\n    // Pass the hot-memories cache gate explicitly (issue #1902, Codex P2): a\n    // per-namespace child root is never registered in the per-dir default map,\n    // so without this it would fall back to the process-wide default and ignore\n    // THIS daemon's hotMemoriesCacheEnabled config. Threading it from config\n    // keeps every namespace storage aligned with its owning orchestrator.\n    const sm = new StorageManager(\n      root,\n      this.config.entitySchemas,\n      this.config.hotMemoriesCacheEnabled,\n    );\n    // Register this child root's gate AND TTL in the per-dir maps (issue #1902,\n    // Codex P2). The constructor override above fixes the child's own gate, but\n    // its TTL is resolved via the per-dir map (hotCacheTtlMs); an unregistered\n    // child root would fall back to the last process-wide TTL and could inherit\n    // another daemon's value. Registering keyed by root keeps both per-dir.\n    StorageManager.setHotMemoriesCacheDefault(\n      root,\n      this.config.hotMemoriesCacheEnabled,\n      this.config.hotMemoriesCacheTtlMs,\n    );\n    const { scopedCacheInvalidationEnabled } = this.config;\n    StorageManager.setScopedCacheInvalidationDefault(root, scopedCacheInvalidationEnabled);\n    // Propagate the inline-attribution template so that router-created storages\n    // (used by extraction and shared-promotion paths) strip citations consistently,\n    // matching the behaviour of the primary this.storage instance in the orchestrator.\n    sm.citationTemplate = this.config.inlineSourceAttributionFormat;\n    // #1522: install the post-write catalog touch at the chokepoint — every\n    // successful write on this StorageManager records the namespace touch.\n    this.bindCatalogWriteHook(sm, ns);\n    // #1579: apply the tombstone non-resurrection config so every namespace\n    // storage enforces the invariant at its own writeMemory chokepoint.\n    this.applyTombstonesConfig(sm, ns);\n    this.cache.set(ns, sm);\n    this.notifyResolved(ns, root);\n    return sm;\n  }\n\n  /**\n   * Fire the resolve hook defensively. A hook failure (e.g. a catalog write\n   * error) MUST NOT crash storage resolution — see CLAUDE.md gotcha #13.\n   *\n   * Issue #1524 adoption: hook invocations for the SAME namespace are now\n   * strictly ordered through the shared `MutationSerializer` rather than the\n   * bespoke `inFlightResolved` marker-then-clear pattern. The serializer\n   * guarantees one in-flight hook per namespace; a concurrent burst of\n   * `storageFor()` cache hits collapses to a single hook invocation because\n   * each queued task re-checks `notifiedResolved` before invoking the hook. A\n   * dropped (`false`) or rejected hook leaves `notifiedResolved` unset so the\n   * next `storageFor()` retries — the serializer recovers from the rejection,\n   * so a failed hook never poisons later notifications.\n   */\n  private notifyResolved(namespace: string, storageDir: string): void {\n    const hook = this.hooks.onResolve;\n    if (!hook) return;\n    // Permanent dedup: skip once we've SUCCESSFULLY notified this exact\n    // (namespace, storageDir). A changed dir (rare: migration/realignment)\n    // still re-fires once. The mark is set ONLY AFTER the hook succeeds, so a\n    // dropped registration (e.g. rebuild-lock timeout) is RETRIED on the next\n    // cache hit instead of being suppressed forever (round 6, cursor Medium —\n    // ND3EJ).\n    if (this.notifiedResolved.get(namespace) === storageDir) return;\n    // In-flight dedup (cursor Medium 06f58a7c, codex P2): if a hook for THIS\n    // namespace is already pending, collapse this call onto it instead of\n    // enqueueing another task. The serializer strictly orders queued tasks, but\n    // ordering alone is not enough — when the first hook returns `false`\n    // (dropped touch, e.g. rebuild-lock timeout), `notifiedResolved` stays\n    // unset, so each queued sibling task would pass its re-check and re-run the\n    // hook. With the real catalog hook each retry can spend the full lock wait,\n    // so N cache hits during a rebuild leave N serial background lock attempts.\n    // Collapsing here means at most ONE hook runs per in-flight registration;\n    // its result (set `notifiedResolved` on success, leave unset on drop)\n    // decides whether a LATER `storageFor()` retries — collapsing loses\n    // nothing because the drop is already retried on the next cache hit.\n    // Keyed by the composite (namespace, storageDir) so a CHANGED dir\n    // (migration/realignment) for the same namespace still gets its own hook —\n    // it is NOT collapsed onto the old dir's pending registration (cursor\n    // Medium, codex P2).\n    const inFlightKey = namespace + \"\\u0000\" + storageDir;\n    if (this.inFlightResolveHooks.has(inFlightKey)) return;\n    this.inFlightResolveHooks.add(inFlightKey);\n    // Queue through the serializer. Concurrent calls for the same namespace\n    // strictly order here; the 2nd call's task runs only after the 1st's hook\n    // settles, by which point `notifiedResolved` is either set (no-op) or still\n    // unset (retry). The returned promise is tracked for\n    // `whenResolveHooksSettled()`. Rejections from the task body are caught so\n    // they never reach the caller (best-effort hook contract); the serializer's\n    // recovered tail still lets subsequent notifications run.\n    const task = async (): Promise<void> => {\n      // Re-check after queueing: a prior task in this same chain may have just\n      // marked the pair as notified.\n      if (this.notifiedResolved.get(namespace) === storageDir) return;\n      try {\n        // Hook may be sync or async; Promise.resolve normalizes both. A result\n        // of `false` means the registration was dropped/no-op (e.g. rebuild-lock\n        // timeout) — leave notifiedResolved UNSET so the next storageFor retries\n        // (round 6, codex P2 — NEFoX). `void`/`undefined` is success for legacy\n        // hooks. A rejection leaves notifiedResolved unset for the same reason.\n        const persisted = await Promise.resolve(hook(namespace, storageDir));\n        if (persisted !== false) {\n          this.notifiedResolved.set(namespace, storageDir);\n        }\n      } catch {\n        // Best-effort: a hook failure MUST NOT crash storage resolution. Leave\n        // notifiedResolved unset so a later storageFor retries the registration.\n      }\n    };\n    const queued = this.resolveSerializer.serialize(namespace, task);\n    this.pendingResolveHooks.add(queued);\n    // Clear the in-flight marker when the hook settles so a subsequent\n    // storageFor() can retry after a drop, or short-circuit via notifiedResolved\n    // after a success.\n    const cleanup = (): void => {\n      this.inFlightResolveHooks.delete(inFlightKey);\n      this.pendingResolveHooks.delete(queued);\n    };\n    void queued.then(cleanup, cleanup);\n  }\n\n  /**\n   * Install the post-write catalog touch hook on an externally-constructed\n   * StorageManager (issue #1522). Used by the orchestrator for the legacy\n   * default-namespace storage (`this.storage`) that bypasses the router.\n   */\n  bindCatalogWriteHook(sm: StorageManager, namespace: string): void {\n    // Issue #1903: pure state-file writes only touch the catalog when explicitly\n    // opted in. Router-created storages (storageFor) and the legacy default\n    // storage both flow through here, so this is the single wiring point.\n    sm.touchStateWrites = this.config.namespacesCatalogTouchStateWrites === true;\n    sm.onCatalogWrite = () => this.touchCatalogWrite(namespace, sm.dir);\n  }\n\n  /**\n   * Install the tombstone config on an externally-constructed StorageManager\n   * (issue #1579). Mirrors `bindCatalogWriteHook` — used for the legacy\n   * default-namespace storage that bypasses the router. Router-created\n   * storages are wired inline in `storageFor()` via `applyTombstonesConfig`.\n   */\n  bindTombstonesConfig(\n    sm: StorageManager,\n    namespace: string,\n    config: { enabled: boolean; semanticMatch: boolean; semanticThreshold: number },\n  ): void {\n    this.tombstonesGlobalConfig = { ...config };\n    sm.setTombstonesConfig({ ...config, namespace });\n  }\n\n  private tombstonesGlobalConfig: {\n    enabled: boolean;\n    semanticMatch: boolean;\n    semanticThreshold: number;\n  } = { enabled: false, semanticMatch: false, semanticThreshold: 0.9 };\n\n  /**\n   * Apply the tombstone config to a router-created StorageManager. Called\n   * inline in `storageFor()` so every namespace storage enforces the\n   * non-resurrection invariant, namespace-scoped (rule 42).\n   */\n  private applyTombstonesConfig(sm: StorageManager, namespace: string): void {\n    sm.setTombstonesConfig({ ...this.tombstonesGlobalConfig, namespace });\n  }\n\n  /**\n   * Post-write catalog touch (issue #1522 chokepoint). Called by every\n   * StorageManager's post-write hook AFTER a successful write. Best-effort\n   * and failure-tolerant — a catalog error MUST NOT affect the primary write\n   * (gotcha #13, rule #40). Fire-and-forget by design.\n   */\n  private touchCatalogWrite(namespace: string, storageDir: string): void {\n    if (!this.catalog) return;\n    const touch = this.catalog\n      .markWrite(namespace, { discoveredBy: \"write\", storageDir })\n      .catch(() => undefined);\n    this.pendingWriteTouches.add(touch);\n    void touch.then(\n      () => { this.pendingWriteTouches.delete(touch); },\n      () => { this.pendingWriteTouches.delete(touch); },\n    );\n  }\n\n  /**\n   * Record a namespace read in the catalog (issue #1522 chokepoint move).\n   * Best-effort and failure-tolerant. Used by recall paths so the read touch\n   * lives in the storage layer, not at the caller.\n   */\n  recordRead(namespace: string, storageDir?: string): void {\n    if (!this.catalog) return;\n    const ns = normalizeNamespaceIdentity(namespace || this.config.defaultNamespace);\n    void this.catalog\n      .markRead(ns, { discoveredBy: \"read\", storageDir })\n      .catch(() => undefined);\n  }\n  /**\n   * Record a namespace write touch in the catalog (issue #1522). Best-effort\n   * and failure-tolerant. Used by consolidation/cleanup passes that may mutate\n   * the store via delete-only paths (e.g. entity-file merges, TTL cleanup) so\n   * the namespace's lastWriteAt stays fresh even when no explicit write went\n   * through the storage chokepoint. This is NOT a substitute for the chokepoint\n   * — it's a belt-and-suspenders for paths the chokepoint doesn't cover.\n   */\n  recordWrite(namespace: string, storageDir?: string): void {\n    if (!this.catalog) return;\n    const ns = normalizeNamespaceIdentity(namespace || this.config.defaultNamespace);\n    const touch = this.catalog\n      .markWrite(ns, { discoveredBy: \"write\", storageDir })\n      .catch(() => undefined);\n    this.pendingWriteTouches.add(touch);\n    void touch.then(\n      () => { this.pendingWriteTouches.delete(touch); },\n      () => { this.pendingWriteTouches.delete(touch); },\n    );\n  }\n\n  /**\n   * Resolve once every in-flight post-write catalog touch has settled (#1522).\n   * Mirrors `whenResolveHooksSettled()`: the StorageManager's post-write hook\n   * fires the catalog touch fire-and-forget, so tests asserting lastWriteAt\n   * moved should await this instead of racing a timer.\n   */\n  async whenWriteTouchesSettled(): Promise<void> {\n    // Flush any coalesced (buffered) touches first so their appends join the\n    // pending set below — otherwise this could resolve while a buffered touch's\n    // lastWriteAt is still unwritten on disk (#1903, Cursor). No-op when\n    // coalescing is disabled (window 0) or the catalog is inert.\n    await this.catalog?.flushPendingTouches().catch(() => undefined);\n    while (this.pendingWriteTouches.size > 0) {\n      await Promise.allSettled([...this.pendingWriteTouches]);\n    }\n  }\n\n  /**\n   * Resolve once every in-flight `onResolve` registration has settled.\n   *\n   * `storageFor()` fires the resolve hook fire-and-forget, so its catalog side\n   * effect (e.g. `registerResolved(...)`) is not observable the moment\n   * `storageFor()` returns. Callers that must act on that side effect — notably\n   * tests asserting the catalog was updated — should await this instead of\n   * racing a timer. Resolves immediately when no hook is registered or nothing\n   * is in flight. The loop re-checks because a settling hook could, in\n   * principle, trigger a follow-on resolution.\n   */\n  async whenResolveHooksSettled(): Promise<void> {\n    while (this.pendingResolveHooks.size > 0) {\n      await Promise.allSettled([...this.pendingResolveHooks]);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AACA,OAAO,UAAU;AACjB,SAAS,QAAQ,OAAO,eAAe;AASvC,eAAe,OAAO,GAA6B;AACjD,MAAI;AACF,UAAM,OAAO,CAAC;AACd,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,iBAAiB,GAA6B;AAC3D,MAAI;AACF,UAAM,QAAQ,MAAM,MAAM,CAAC;AAC3B,QAAI,MAAM,eAAe,EAAG,QAAO;AACnC,QAAI,CAAC,MAAM,YAAY,EAAG,QAAO;AACjC,UAAM,WAAW,MAAM,QAAQ,GAAG,EAAE,eAAe,KAAK,CAAC;AACzD,eAAW,SAAS,UAAU;AAC5B,YAAM,YAAY,KAAK,KAAK,GAAG,MAAM,IAAI;AACzC,UAAI,MAAM,eAAe,KAAK,MAAM,OAAO,EAAG,QAAO;AACrD,UAAI,MAAM,YAAY,KAAM,MAAM,iBAAiB,SAAS,EAAI,QAAO;AAAA,IACzE;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQA,SAAS,oBAAoB,WAAmB,SAAyB;AAIvE,MACE,QAAQ,WAAW,KACnB,QAAQ,SAAS,GAAG,KACpB,QAAQ,SAAS,IAAI,KACrB,QAAQ,SAAS,IAAI,KACrB,KAAK,WAAW,OAAO,GACvB;AACA,UAAM,IAAI,MAAM,kCAAkC,OAAO,EAAE;AAAA,EAC7D;AACA,SAAO,KAAK,KAAK,WAAW,cAAc,OAAO;AACnD;AAEA,IAAM,oCAAoC;AAAA,EACxC,GAAG;AAAA,EACH;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,oCAAoC,CAAC,OAAO;AAElD,eAAe,iBACb,SACA,UAA6C,CAAC,GAC5B;AAClB,QAAM,WAAW,QAAQ,wBAAwB,OAC7C,CAAC,GAAG,mCAAmC,GAAG,iCAAiC,IAC3E;AACJ,aAAW,SAAS,UAAU;AAC5B,QAAI,MAAM,iBAAiB,KAAK,KAAK,SAAS,KAAK,CAAC,EAAG,QAAO;AAAA,EAChE;AACA,SAAO;AACT;AAEA,eAAe,6BACb,SACA,UAA6C,CAAC,GAC5B;AAClB,QAAM,WAAW,QAAQ,wBAAwB,OAC7C,CAAC,GAAG,mCAAmC,GAAG,iCAAiC,IAC3E;AACJ,aAAW,SAAS,UAAU;AAC5B,QAAI,MAAM,OAAO,KAAK,KAAK,SAAS,KAAK,CAAC,EAAG,QAAO;AAAA,EACtD;AACA,SAAO;AACT;AA8CA,eAAsB,4BAA4B,QAAuC;AACvF,MAAI,CAAC,6BAA6B,MAAM,EAAE,YAAY;AACpD,WAAO,OAAO;AAAA,EAChB;AASA,QAAM,kBAAkB,2BAA2B,OAAO,gBAAgB;AAC1E,QAAM,cAAc,oBAAoB,OAAO,WAAW,eAAe;AACzE,QAAM,iBAAiB;AAAA,IACrB,OAAO;AAAA,IACP,uBAAuB,OAAO,gBAAgB;AAAA,EAChD;AACA,QAAM,mBACH,MAAM,OAAO,cAAc,KAC3B,MAAM,6BAA6B,gBAAgB,EAAE,qBAAqB,KAAK,CAAC;AACnF,QAAM,QAAQ,mBACV,iBACC,MAAM,OAAO,WAAW,IACvB,cACA;AACN,SAAQ,MAAM,OAAO,KAAK,KAAM,CAAE,MAAM,iBAAiB,OAAO,SAAS,IACrE,QACA,OAAO;AACb;AAYA,eAAsB,4BACpB,QACA,WACiB;AACjB,MAAI,CAAC,6BAA6B,MAAM,EAAE,WAAY,QAAO,OAAO;AAIpE,MAAI,2BAA2B,SAAS,MAAM,2BAA2B,OAAO,gBAAgB,GAAG;AACjG,WAAO,4BAA4B,MAAM;AAAA,EAC3C;AACA,QAAM,aAAa,oBAAoB,OAAO,WAAW,SAAS;AAClE,QAAM,gBAAgB,oBAAoB,OAAO,WAAW,uBAAuB,SAAS,CAAC;AAC7F,MACG,MAAM,OAAO,aAAa,KAC1B,MAAM,6BAA6B,eAAe,EAAE,qBAAqB,KAAK,CAAC,GAChF;AACA,WAAO;AAAA,EACT;AACA,SAAQ,MAAM,OAAO,UAAU,IAAK,aAAa;AACnD;AAEO,IAAM,yBAAN,MAA6B;AAAA,EAwClC,YACmB,QACA,QAAqC,CAAC,GAEtC,SACjB;AAJiB;AACA;AAEA;AAEjB,SAAK,2BAA2B,2BAA2B,OAAO,gBAAgB;AAAA,EACpF;AAAA,EANmB;AAAA,EACA;AAAA,EAEA;AAAA,EA3CF,QAAQ,oBAAI,IAA4B;AAAA,EACjD,wBAAuC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM9B,mBAAmB,oBAAI,IAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ3C,oBAAoB,IAAI,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ3C,uBAAuB,oBAAI,IAAY;AAAA;AAAA;AAAA;AAAA;AAAA,EAKvC,sBAAsB,oBAAI,IAAsB;AAAA;AAAA;AAAA,EAGhD,sBAAsB,oBAAI,IAAsB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMhD;AAAA,EAWjB,MAAc,uBAAwC;AACpD,SAAK,wBAAwB,MAAM,4BAA4B,KAAK,MAAM;AAC1E,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAc,cAAc,WAAoC;AAE9D,QAAI,CAAC,6BAA6B,KAAK,MAAM,EAAE,WAAY,QAAO,KAAK,OAAO;AAC9E,QAAI,2BAA2B,SAAS,MAAM,KAAK,0BAA0B;AAC3E,aAAO,KAAK,yBAAyB,KAAK,OAAO;AAAA,IACnD;AACA,WAAO,4BAA4B,KAAK,QAAQ,SAAS;AAAA,EAC3D;AAAA,EAEA,MAAM,WAAW,WAA4C;AAC3D,UAAM,KAAK,2BAA2B,aAAa,KAAK,OAAO,gBAAgB;AAC/E,QAAI,OAAO,KAAK,4BAA4B,CAAC,qBAAqB,EAAE,GAAG;AACrE,YAAM,IAAI,MAAM,qBAAqB,EAAE,EAAE;AAAA,IAC3C;AAMA,QAAI;AACJ,QAAI,OAAO,KAAK,0BAA0B;AACxC,aAAO,MAAM,KAAK,qBAAqB;AACvC,YAAM,SAAS,KAAK,MAAM,IAAI,EAAE;AAChC,UAAI,UAAU,OAAO,QAAQ,MAAM;AACjC,aAAK,eAAe,IAAI,IAAI;AAC5B,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AACL,YAAM,SAAS,KAAK,MAAM,IAAI,EAAE;AAChC,aAAO,MAAM,KAAK,cAAc,EAAE;AAClC,UAAI,UAAU,OAAO,QAAQ,MAAM;AACjC,aAAK,eAAe,IAAI,IAAI;AAC5B,eAAO;AAAA,MACT;AAAA,IACF;AAOA,UAAM,KAAK,IAAI;AAAA,MACb;AAAA,MACA,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AAMA,mBAAe;AAAA,MACb;AAAA,MACA,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AACA,UAAM,EAAE,+BAA+B,IAAI,KAAK;AAChD,mBAAe,kCAAkC,MAAM,8BAA8B;AAIrF,OAAG,mBAAmB,KAAK,OAAO;AAGlC,SAAK,qBAAqB,IAAI,EAAE;AAGhC,SAAK,sBAAsB,IAAI,EAAE;AACjC,SAAK,MAAM,IAAI,IAAI,EAAE;AACrB,SAAK,eAAe,IAAI,IAAI;AAC5B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBQ,eAAe,WAAmB,YAA0B;AAClE,UAAM,OAAO,KAAK,MAAM;AACxB,QAAI,CAAC,KAAM;AAOX,QAAI,KAAK,iBAAiB,IAAI,SAAS,MAAM,WAAY;AAiBzD,UAAM,cAAc,YAAY,OAAW;AAC3C,QAAI,KAAK,qBAAqB,IAAI,WAAW,EAAG;AAChD,SAAK,qBAAqB,IAAI,WAAW;AAQzC,UAAM,OAAO,YAA2B;AAGtC,UAAI,KAAK,iBAAiB,IAAI,SAAS,MAAM,WAAY;AACzD,UAAI;AAMF,cAAM,YAAY,MAAM,QAAQ,QAAQ,KAAK,WAAW,UAAU,CAAC;AACnE,YAAI,cAAc,OAAO;AACvB,eAAK,iBAAiB,IAAI,WAAW,UAAU;AAAA,QACjD;AAAA,MACF,QAAQ;AAAA,MAGR;AAAA,IACF;AACA,UAAM,SAAS,KAAK,kBAAkB,UAAU,WAAW,IAAI;AAC/D,SAAK,oBAAoB,IAAI,MAAM;AAInC,UAAM,UAAU,MAAY;AAC1B,WAAK,qBAAqB,OAAO,WAAW;AAC5C,WAAK,oBAAoB,OAAO,MAAM;AAAA,IACxC;AACA,SAAK,OAAO,KAAK,SAAS,OAAO;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,qBAAqB,IAAoB,WAAyB;AAIhE,OAAG,mBAAmB,KAAK,OAAO,sCAAsC;AACxE,OAAG,iBAAiB,MAAM,KAAK,kBAAkB,WAAW,GAAG,GAAG;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,qBACE,IACA,WACA,QACM;AACN,SAAK,yBAAyB,EAAE,GAAG,OAAO;AAC1C,OAAG,oBAAoB,EAAE,GAAG,QAAQ,UAAU,CAAC;AAAA,EACjD;AAAA,EAEQ,yBAIJ,EAAE,SAAS,OAAO,eAAe,OAAO,mBAAmB,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAO3D,sBAAsB,IAAoB,WAAyB;AACzE,OAAG,oBAAoB,EAAE,GAAG,KAAK,wBAAwB,UAAU,CAAC;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,kBAAkB,WAAmB,YAA0B;AACrE,QAAI,CAAC,KAAK,QAAS;AACnB,UAAM,QAAQ,KAAK,QAChB,UAAU,WAAW,EAAE,cAAc,SAAS,WAAW,CAAC,EAC1D,MAAM,MAAM,MAAS;AACxB,SAAK,oBAAoB,IAAI,KAAK;AAClC,SAAK,MAAM;AAAA,MACT,MAAM;AAAE,aAAK,oBAAoB,OAAO,KAAK;AAAA,MAAG;AAAA,MAChD,MAAM;AAAE,aAAK,oBAAoB,OAAO,KAAK;AAAA,MAAG;AAAA,IAClD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,WAAmB,YAA2B;AACvD,QAAI,CAAC,KAAK,QAAS;AACnB,UAAM,KAAK,2BAA2B,aAAa,KAAK,OAAO,gBAAgB;AAC/E,SAAK,KAAK,QACP,SAAS,IAAI,EAAE,cAAc,QAAQ,WAAW,CAAC,EACjD,MAAM,MAAM,MAAS;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY,WAAmB,YAA2B;AACxD,QAAI,CAAC,KAAK,QAAS;AACnB,UAAM,KAAK,2BAA2B,aAAa,KAAK,OAAO,gBAAgB;AAC/E,UAAM,QAAQ,KAAK,QAChB,UAAU,IAAI,EAAE,cAAc,SAAS,WAAW,CAAC,EACnD,MAAM,MAAM,MAAS;AACxB,SAAK,oBAAoB,IAAI,KAAK;AAClC,SAAK,MAAM;AAAA,MACT,MAAM;AAAE,aAAK,oBAAoB,OAAO,KAAK;AAAA,MAAG;AAAA,MAChD,MAAM;AAAE,aAAK,oBAAoB,OAAO,KAAK;AAAA,MAAG;AAAA,IAClD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,0BAAyC;AAK7C,UAAM,KAAK,SAAS,oBAAoB,EAAE,MAAM,MAAM,MAAS;AAC/D,WAAO,KAAK,oBAAoB,OAAO,GAAG;AACxC,YAAM,QAAQ,WAAW,CAAC,GAAG,KAAK,mBAAmB,CAAC;AAAA,IACxD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,0BAAyC;AAC7C,WAAO,KAAK,oBAAoB,OAAO,GAAG;AACxC,YAAM,QAAQ,WAAW,CAAC,GAAG,KAAK,mBAAmB,CAAC;AAAA,IACxD;AAAA,EACF;AACF;","names":[]}

package/dist/{chunk-VZ5OJE4X.js → chunk-5VQJBH2G.js}

@@ -1,6 +1,6 @@
 import {
   bumpMemoryCorpusVersionForDir
-} from "./chunk-OKUEZOGW.js";
+} from "./chunk-AITCS2RC.js";
 import {
   ALL_CATEGORY_DIRS,
   RECALL_FALLBACK_DIRS
@@ -271,4 +271,4 @@ export {
   revertToVersion,
   diffVersions
 };
-//# sourceMappingURL=chunk-VZ5OJE4X.js.map
+//# sourceMappingURL=chunk-5VQJBH2G.js.map

package/dist/{chunk-N3JDIRBW.js → chunk-74F5STS4.js}

@@ -8,7 +8,7 @@ import {
 import {
   reportSearchDegradation,
   resolveEnsureCollectionArgs
-} from "./chunk-WU46YPY6.js";
+} from "./chunk-RAR2BSEM.js";
 import {
   log
 } from "./chunk-37CTGERM.js";
@@ -499,4 +499,4 @@ function isMissingVectorProviderColumnError(err) {
 export {
   LanceDbBackend
 };
-//# sourceMappingURL=chunk-N3JDIRBW.js.map
+//# sourceMappingURL=chunk-74F5STS4.js.map

package/dist/{chunk-OC35KQIN.js → chunk-A5UXZRRM.js}

@@ -1,9 +1,9 @@
 import {
   createVersion
-} from "./chunk-VZ5OJE4X.js";
+} from "./chunk-5VQJBH2G.js";
 import {
   bumpMemoryCorpusVersionForDir
-} from "./chunk-OKUEZOGW.js";
+} from "./chunk-AITCS2RC.js";
 import {
   parseExportBundle
 } from "./chunk-WEHSQBFR.js";
@@ -231,4 +231,4 @@ function mintForkId(capsuleId, originalId, now) {
 export {
   importCapsule
 };
-//# sourceMappingURL=chunk-OC35KQIN.js.map
+//# sourceMappingURL=chunk-A5UXZRRM.js.map

package/dist/{chunk-OKUEZOGW.js → chunk-AITCS2RC.js}

@@ -1,6 +1,6 @@
 import {
   invalidateDerivedAndGlobalForDir
-} from "./chunk-X47LWMKA.js";
+} from "./chunk-XMMESCPD.js";
 import {
   deleteInFlightReadsForDir
 } from "./chunk-PDJTHRAW.js";
@@ -24,4 +24,4 @@ export {
   MEMORY_CORPUS_VERSION_SENTINEL,
   bumpMemoryCorpusVersionForDir
 };
-//# sourceMappingURL=chunk-OKUEZOGW.js.map
+//# sourceMappingURL=chunk-AITCS2RC.js.map

package/dist/{chunk-7XGSIUP5.js → chunk-AJLLIIML.js}

@@ -216,4 +216,4 @@ export {
   getCausalTrajectoryStoreStatus,
   searchCausalTrajectories
 };
-//# sourceMappingURL=chunk-7XGSIUP5.js.map
+//# sourceMappingURL=chunk-AJLLIIML.js.map

package/dist/{chunk-CE3GMHT4.js → chunk-BS4SGLWV.js}

@@ -5,7 +5,7 @@ import {
 } from "./chunk-D7FOKIY5.js";
 import {
   EngramAccessInputError
-} from "./chunk-QPZCAVDC.js";
+} from "./chunk-LZOV7MX7.js";
 import {
   expandTildePath
 } from "./chunk-EYIEWJNI.js";
@@ -276,4 +276,4 @@ export {
   listRegisteredOperations,
   __resetRegistryForTest
 };
-//# sourceMappingURL=chunk-CE3GMHT4.js.map
+//# sourceMappingURL=chunk-BS4SGLWV.js.map

package/dist/{chunk-2V5QI6NQ.js → chunk-DCFV7A7H.js}

@@ -13,10 +13,10 @@ import {
   processChatMessage,
   sessionBelongsToPrincipal,
   subscribeChatTranscript
-} from "./chunk-OCY3CRPG.js";
+} from "./chunk-PBNZVPFS.js";
 import {
   RelayMissionStoreError
-} from "./chunk-Z6WN2KSH.js";
+} from "./chunk-OAZVR2BV.js";
 import {
   validateRequest
 } from "./chunk-2MR3MFQB.js";
@@ -31,7 +31,7 @@ import {
 } from "./chunk-35NN3ZFA.js";
 import {
   getOperation
-} from "./chunk-CE3GMHT4.js";
+} from "./chunk-BS4SGLWV.js";
 import {
   assertOperationAllowed,
   enforceNamespaceAllowList,
@@ -41,7 +41,7 @@ import {
 import {
   CorrectionContractError,
   EngramAccessInputError
-} from "./chunk-QPZCAVDC.js";
+} from "./chunk-LZOV7MX7.js";
 import {
   isTrustZoneName
 } from "./chunk-JGSKJHF7.js";
@@ -53,7 +53,7 @@ import {
 } from "./chunk-DEUNUKTD.js";
 import {
   isRecallDisclosure
-} from "./chunk-G5PVJJRA.js";
+} from "./chunk-PBSAPHHA.js";
 import {
   expandTildePath
 } from "./chunk-EYIEWJNI.js";
@@ -3122,4 +3122,4 @@ function positiveIntQueryParam(value, label) {
 export {
   EngramAccessHttpServer
 };
-//# sourceMappingURL=chunk-2V5QI6NQ.js.map
+//# sourceMappingURL=chunk-DCFV7A7H.js.map

package/dist/{chunk-I3GKTDM2.js → chunk-DMSDUGDM.js}

@@ -10,10 +10,10 @@ import {
 import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact
-} from "./chunk-2RSL6YRA.js";
+} from "./chunk-2AZXIZEN.js";
 import {
   StorageManager
-} from "./chunk-TRH533CA.js";
+} from "./chunk-K7LOWSLU.js";
 import {
   MEMORY_LIFECYCLE_EVENT_SORT_ORDER,
   buildLifecycleEventsForMemory,
@@ -1023,4 +1023,4 @@ export {
   verifyMemoryProjection,
   repairMemoryProjection
 };
-//# sourceMappingURL=chunk-I3GKTDM2.js.map
+//# sourceMappingURL=chunk-DMSDUGDM.js.map

package/dist/{chunk-D4TLWDYR.js → chunk-DPAENM7O.js}

@@ -1,6 +1,6 @@
 import {
   isRecallDisclosure
-} from "./chunk-G5PVJJRA.js";
+} from "./chunk-PBSAPHHA.js";
 import {
   normalizeRetrievedMemoryProvenance
 } from "./chunk-I4WBNM3M.js";
@@ -292,4 +292,4 @@ export {
   RecallXrayBuilder,
   summarizeDisclosureTokens
 };
-//# sourceMappingURL=chunk-D4TLWDYR.js.map
+//# sourceMappingURL=chunk-DPAENM7O.js.map

package/dist/{chunk-AHLPZ2SF.js → chunk-DYP3YYJJ.js}

@@ -1,6 +1,6 @@
 import {
   resolveEnsureCollectionArgs
-} from "./chunk-WU46YPY6.js";
+} from "./chunk-RAR2BSEM.js";
 import {
   QMD_PROBE_RETRY_BACKOFF_MS,
   QMD_PROBE_TIMEOUT_MS,
@@ -17,9 +17,10 @@ import {
   launchProcess
 } from "./chunk-O75CRYGF.js";
 import {
+  clearQmdResultCaches,
   getCachedQmdSearch,
   setCachedQmdSearch
-} from "./chunk-X47LWMKA.js";
+} from "./chunk-XMMESCPD.js";
 import {
   mergeEnv
 } from "./chunk-JUC24CTX.js";
@@ -1979,6 +1980,7 @@ var QmdClient = class _QmdClient {
         this.lastUpdateRunAtMs = at;
         globalState.lastGlobalUpdateRunAtMs = at;
       }
+      clearQmdResultCaches();
       log.debug(`QMD update completed for collection=${name}`);
     } catch (err) {
       const at = Date.now();
@@ -2067,6 +2069,7 @@ var QmdClient = class _QmdClient {
         globalState.lastEmbedByCollectionMs[name] = at;
       }
       globalState.lastGlobalEmbedRunAtMs = at;
+      clearQmdResultCaches();
       log.debug(`QMD embed completed for collection=${name}`);
     } catch (err) {
       let failure = err;
@@ -2083,6 +2086,7 @@ var QmdClient = class _QmdClient {
           }
           globalState.lastGlobalEmbedRunAtMs = recoveredAt;
           globalState.lastGlobalEmbedFailAtMs = null;
+          clearQmdResultCaches();
           log.warn(`QMD embed for collection ${name} recovered by forcing a full vector rebuild`);
           return;
         } catch (retryErr) {
@@ -2190,4 +2194,4 @@ export {
   sharedDaemonSessionCountForTest,
   QmdClient
 };
-//# sourceMappingURL=chunk-AHLPZ2SF.js.map
+//# sourceMappingURL=chunk-DYP3YYJJ.js.map