@remnic/core 9.50.2 → 9.51.0

package/dist/{chunk-L2DPF4DF.js → chunk-BIJAWZYW.js}

@@ -1,3 +1,8 @@
+import {
+  ActivationPathTracker,
+  compareActivationPathCandidates,
+  reconstructActivationPath
+} from "./chunk-LXY5VVGM.js";
 import {
   readEdgeConfidence
 } from "./chunk-2LSZVONP.js";
@@ -490,6 +495,7 @@ var GraphIndex = class _GraphIndex {
     const decay = this.cfg.graphActivationDecay;
     const floor = opts?.includeLowConfidence === true ? 0 : clampConfidenceFloor(this.cfg.graphTraversalConfidenceFloor);
     const iterations = clampPageRankIterations(this.cfg.graphTraversalPageRankIterations);
+    const recordPaths = opts?.recordPaths === true;
     const deadlineAtMs = opts?.deadlineAtMs;
     const deadlineExpired = () => typeof deadlineAtMs === "number" && Date.now() >= deadlineAtMs;
     try {
@@ -514,19 +520,35 @@ var GraphIndex = class _GraphIndex {
       const provenance = /* @__PURE__ */ new Map();
       let frontier = /* @__PURE__ */ new Map();
       const reachedBySeed = /* @__PURE__ */ new Map();
+      const pathTracker = recordPaths ? new ActivationPathTracker(seeds) : null;
+      const predecessors = pathTracker?.predecessors ?? null;
       for (const seed of seeds) {
         frontier.set(`${seed}\0${seed}`, { node: seed, seed, activation: 1 });
         reachedBySeed.set(seed, /* @__PURE__ */ new Set([seed]));
       }
-      const finalizeScores = () => Array.from(scores.entries()).map(([p, score]) => ({
-        path: p,
-        score,
-        seed: provenance.get(p)?.seed ?? "",
-        hopDepth: provenance.get(p)?.hopDepth ?? 0,
-        decayedWeight: provenance.get(p)?.decayedWeight ?? 0,
-        graphType: provenance.get(p)?.graphType ?? "entity",
-        edgeConfidence: provenance.get(p)?.edgeConfidence ?? 1
-      })).sort((a, b) => b.score - a.score);
+      const finalizeScores = () => {
+        const results = Array.from(scores.entries()).map(([p, score]) => ({
+          path: p,
+          score,
+          seed: provenance.get(p)?.seed ?? "",
+          hopDepth: provenance.get(p)?.hopDepth ?? 0,
+          decayedWeight: provenance.get(p)?.decayedWeight ?? 0,
+          graphType: provenance.get(p)?.graphType ?? "entity",
+          edgeConfidence: provenance.get(p)?.edgeConfidence ?? 1
+        })).sort((a, b) => {
+          const scoreDelta = b.score - a.score;
+          if (scoreDelta !== 0 || !recordPaths) return scoreDelta;
+          return a.path < b.path ? -1 : a.path > b.path ? 1 : 0;
+        });
+        if (!recordPaths || !predecessors) return results;
+        return results.map((result) => {
+          const seed = provenance.get(result.path)?.seed;
+          return {
+            ...result,
+            activationPath: seed === void 0 ? null : reconstructActivationPath(seed, result.path, predecessors, steps)
+          };
+        });
+      };
       for (let hop = 0; hop < steps && frontier.size > 0; hop++) {
         if (deadlineExpired()) return finalizeScores();
         const nextFrontier = /* @__PURE__ */ new Map();
@@ -543,17 +565,37 @@ var GraphIndex = class _GraphIndex {
             if (reachedForSeed?.has(neighbor)) {
               continue;
             }
+            const candidatePathKey = pathTracker && !seedSet.has(neighbor) ? pathTracker.consider(
+              sourceSeed,
+              node,
+              neighbor,
+              hop + 1,
+              score,
+              conf,
+              edge.type
+            ) : "";
             if (!seedSet.has(neighbor)) {
               const existing = scores.get(neighbor) ?? 0;
               scores.set(neighbor, existing + score);
               const prev = provenance.get(neighbor);
-              if (!prev || hop + 1 < prev.hopDepth || hop + 1 === prev.hopDepth && score > prev.decayedWeight) {
+              const candidateWinner = {
+                hopDepth: hop + 1,
+                landingStrength: score,
+                pathKey: candidatePathKey
+              };
+              const shouldReplace = !prev || (recordPaths ? compareActivationPathCandidates(candidateWinner, {
+                hopDepth: prev.hopDepth,
+                landingStrength: prev.decayedWeight,
+                pathKey: prev.pathKey
+              }) > 0 : hop + 1 < prev.hopDepth || hop + 1 === prev.hopDepth && score > prev.decayedWeight);
+              if (shouldReplace) {
                 provenance.set(neighbor, {
                   seed: sourceSeed,
                   hopDepth: hop + 1,
                   decayedWeight: score,
                   graphType: edge.type,
-                  edgeConfidence: conf
+                  edgeConfidence: conf,
+                  pathKey: candidatePathKey
                 });
               }
               if (hop + 1 < steps) {
@@ -703,4 +745,4 @@ export {
   applyPageRankRefinement,
   applyLateralInhibition
 };
-//# sourceMappingURL=chunk-L2DPF4DF.js.map
+//# sourceMappingURL=chunk-BIJAWZYW.js.map

package/dist/chunk-BIJAWZYW.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\";\nimport {\n  ActivationPathTracker,\n  compareActivationPathCandidates,\n  reconstructActivationPath,\n  type ActivationPathCandidate,\n  type ActivationPredecessor,\n} from \"./graph-path-reconstruction.js\";\nexport { reconstructActivationPath, type ActivationPredecessor };\n\nexport type GraphType = \"entity\" | \"time\" | \"causal\";\n\nexport interface ActivationPath {\n  /** Node ids from the seed (inclusive) to the reached node (inclusive). */\n  nodeIds: string[];\n  /** Edge confidences, parallel to the hops in {@link nodeIds}. */\n  edgeConfidences: number[];\n  /** Graph types, parallel to the hops in {@link nodeIds}. */\n  graphTypes: GraphType[];\n}\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      /** Record one shortest seed-to-candidate path in each result. */\n      recordPaths?: 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      activationPath?: ActivationPath | null;\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 recordPaths = opts?.recordPaths === true;\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      const seedSet = new Set(seeds);\n      const scores = new Map<string, number>(); // candidate path → accumulated activation score\n\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          pathKey: string;\n        }\n      >();\n      let frontier = new Map<string, { node: string; seed: string; activation: number }>();\n      const reachedBySeed = new Map<string, Set<string>>();\n      const pathTracker = recordPaths ? new ActivationPathTracker(seeds) : null;\n      const predecessors = pathTracker?.predecessors ?? null;\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        const results = 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) => {\n            const scoreDelta = b.score - a.score;\n            if (scoreDelta !== 0 || !recordPaths) return scoreDelta;\n            return a.path < b.path ? -1 : a.path > b.path ? 1 : 0;\n          });\n        if (!recordPaths || !predecessors) return results;\n        return results.map((result) => {\n          const seed = provenance.get(result.path)?.seed;\n          return {\n            ...result,\n            activationPath:\n              seed === undefined ? null : reconstructActivationPath(seed, result.path, predecessors, steps),\n          };\n        });\n      };\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            const candidatePathKey =\n              pathTracker && !seedSet.has(neighbor)\n                ? pathTracker.consider(\n                    sourceSeed,\n                    node,\n                    neighbor,\n                    hop + 1,\n                    score,\n                    conf,\n                    edge.type,\n                  )\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              const candidateWinner: ActivationPathCandidate = {\n                hopDepth: hop + 1,\n                landingStrength: score,\n                pathKey: candidatePathKey,\n              };\n              const shouldReplace =\n                !prev ||\n                (recordPaths\n                  ? compareActivationPathCandidates(candidateWinner, {\n                      hopDepth: prev.hopDepth,\n                      landingStrength: prev.decayedWeight,\n                      pathKey: prev.pathKey,\n                    }) > 0\n                  : hop + 1 < prev.hopDepth ||\n                    (hop + 1 === prev.hopDepth && score > prev.decayedWeight));\n              if (shouldReplace) {\n                provenance.set(neighbor, {\n                  seed: sourceSeed,\n                  hopDepth: hop + 1,\n                  decayedWeight: score,\n                  graphType: edge.type,\n                  edgeConfidence: conf,\n                  pathKey: candidatePathKey,\n                });\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;AAgFf,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,MA6BA;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,cAAc,MAAM,gBAAgB;AAC1C,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;AACA,YAAM,UAAU,IAAI,IAAI,KAAK;AAC7B,YAAM,SAAS,oBAAI,IAAoB;AAEvC,YAAM,aAAa,oBAAI,IAUrB;AACF,UAAI,WAAW,oBAAI,IAAgE;AACnF,YAAM,gBAAgB,oBAAI,IAAyB;AACnD,YAAM,cAAc,cAAc,IAAI,sBAAsB,KAAK,IAAI;AACrE,YAAM,eAAe,aAAa,gBAAgB;AAClD,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,MAAM;AAC3B,cAAM,UAAU,MAAM,KAAK,OAAO,QAAQ,CAAC,EACxC,IAAI,CAAC,CAAC,GAAG,KAAK,OAAO;AAAA,UACpB,MAAM;AAAA,UACN;AAAA,UACA,MAAM,WAAW,IAAI,CAAC,GAAG,QAAQ;AAAA,UACjC,UAAU,WAAW,IAAI,CAAC,GAAG,YAAY;AAAA,UACzC,eAAe,WAAW,IAAI,CAAC,GAAG,iBAAiB;AAAA,UACnD,WAAW,WAAW,IAAI,CAAC,GAAG,aAAa;AAAA,UAC3C,gBAAgB,WAAW,IAAI,CAAC,GAAG,kBAAkB;AAAA,QACvD,EAAE,EACD,KAAK,CAAC,GAAG,MAAM;AACd,gBAAM,aAAa,EAAE,QAAQ,EAAE;AAC/B,cAAI,eAAe,KAAK,CAAC,YAAa,QAAO;AAC7C,iBAAO,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI;AAAA,QACtD,CAAC;AACH,YAAI,CAAC,eAAe,CAAC,aAAc,QAAO;AAC1C,eAAO,QAAQ,IAAI,CAAC,WAAW;AAC7B,gBAAM,OAAO,WAAW,IAAI,OAAO,IAAI,GAAG;AAC1C,iBAAO;AAAA,YACL,GAAG;AAAA,YACH,gBACE,SAAS,SAAY,OAAO,0BAA0B,MAAM,OAAO,MAAM,cAAc,KAAK;AAAA,UAChG;AAAA,QACF,CAAC;AAAA,MACH;AAEA,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;AACA,kBAAM,mBACJ,eAAe,CAAC,QAAQ,IAAI,QAAQ,IAChC,YAAY;AAAA,cACV;AAAA,cACA;AAAA,cACA;AAAA,cACA,MAAM;AAAA,cACN;AAAA,cACA;AAAA,cACA,KAAK;AAAA,YACP,IACA;AAEN,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,oBAAM,kBAA2C;AAAA,gBAC/C,UAAU,MAAM;AAAA,gBAChB,iBAAiB;AAAA,gBACjB,SAAS;AAAA,cACX;AACA,oBAAM,gBACJ,CAAC,SACA,cACG,gCAAgC,iBAAiB;AAAA,gBAC/C,UAAU,KAAK;AAAA,gBACf,iBAAiB,KAAK;AAAA,gBACtB,SAAS,KAAK;AAAA,cAChB,CAAC,IAAI,IACL,MAAM,IAAI,KAAK,YACd,MAAM,MAAM,KAAK,YAAY,QAAQ,KAAK;AACjD,kBAAI,eAAe;AACjB,2BAAW,IAAI,UAAU;AAAA,kBACvB,MAAM;AAAA,kBACN,UAAU,MAAM;AAAA,kBAChB,eAAe;AAAA,kBACf,WAAW,KAAK;AAAA,kBAChB,gBAAgB;AAAA,kBAChB,SAAS;AAAA,gBACX,CAAC;AAAA,cACH;AAGA,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-LEJPSMKM.js → chunk-C5QLI33R.js}

@@ -9,7 +9,7 @@ import {
 } from "./chunk-D24OXEPB.js";
 import {
   validateRequest
-} from "./chunk-LYMNZZIM.js";
+} from "./chunk-NIS256NW.js";
 import {
   REMNIC_CHATGPT_MEMORY_INSPECTOR_MIME_TYPE,
   REMNIC_CHATGPT_MEMORY_INSPECTOR_TOOL,
@@ -25,7 +25,7 @@ import {
 } from "./chunk-YYQAKIDJ.js";
 import {
   getOperation
-} from "./chunk-5C2HNJMO.js";
+} from "./chunk-J5LLX6IL.js";
 import {
   assertOperationAllowed,
   capabilityAllowsOp,
@@ -3761,4 +3761,4 @@ export {
   MCP_SUPPORTED_PROTOCOL_VERSIONS,
   EngramMcpServer
 };
-//# sourceMappingURL=chunk-LEJPSMKM.js.map
+//# sourceMappingURL=chunk-C5QLI33R.js.map

package/dist/{chunk-SV3PSA7Y.js → chunk-CV6BBVYV.js}

@@ -12,17 +12,17 @@ import {
 } from "./chunk-2DQ2XREU.js";
 import {
   compareEntityTimestamps
-} from "./chunk-BOFVT6P3.js";
+} from "./chunk-VBHPOWBJ.js";
 import {
   normalizeEntityName
 } from "./chunk-YXZG5TVN.js";
+import {
+  sanitizeMemoryContent
+} from "./chunk-5GKPFL3S.js";
 import {
   normalizeEntityText,
   resolveRequestedEntitySectionKeys
 } from "./chunk-ZIKENA2C.js";
-import {
-  sanitizeMemoryContent
-} from "./chunk-5GKPFL3S.js";
 import {
   resolveNamespaceCapabilities
 } from "./chunk-2XRE6FLM.js";
@@ -887,4 +887,4 @@ export {
   entityIndexVersion,
   entityRecentTranscriptLookbackHours
 };
-//# sourceMappingURL=chunk-SV3PSA7Y.js.map
+//# sourceMappingURL=chunk-CV6BBVYV.js.map

package/dist/{chunk-V7X767RT.js → chunk-DCZBSE4F.js}

@@ -7,9 +7,6 @@ import {
 import {
   openclawReplayNormalizer
 } from "./chunk-H4CKS5B2.js";
-import {
-  exportJsonBundle
-} from "./chunk-UP6MOYCB.js";
 import {
   exportSqlite
 } from "./chunk-BV2TIZ4F.js";
@@ -28,12 +25,12 @@ import {
 import {
   backupMemoryDir
 } from "./chunk-2NLLXCJG.js";
+import {
+  exportJsonBundle
+} from "./chunk-UP6MOYCB.js";
 import {
   exportMarkdownBundle
 } from "./chunk-765K3SAT.js";
-import {
-  RoutingRulesStore
-} from "./chunk-XL24QQ63.js";
 import {
   buildReplayNormalizerRegistry,
   clampBatchSize,
@@ -43,6 +40,9 @@ import {
   isReplaySource,
   normalizeReplaySessionKey
 } from "./chunk-AJVLDJU6.js";
+import {
+  RoutingRulesStore
+} from "./chunk-XL24QQ63.js";
 import {
   TailscaleHelper
 } from "./chunk-EEC4PCG5.js";
@@ -54,7 +54,7 @@ import {
 } from "./chunk-IIFFC3RL.js";
 import {
   rebuildMemoryLifecycleLedger
-} from "./chunk-GDDGZVFI.js";
+} from "./chunk-UEVLYVNW.js";
 import {
   rebuildObservations
 } from "./chunk-DQTCGVFK.js";
@@ -70,9 +70,6 @@ import {
   registerBulkImportSource,
   runBulkImportPipeline
 } from "./chunk-HSSERO3E.js";
-import {
-  searchVerifiedEpisodes
-} from "./chunk-7PKFPLLZ.js";
 import {
   getUtilityLearningStatus,
   learnUtilityPromotionWeights
@@ -81,20 +78,23 @@ import {
   getUtilityTelemetryStatus,
   recordUtilityTelemetryEvent
 } from "./chunk-6FC3IZ26.js";
+import {
+  searchVerifiedEpisodes
+} from "./chunk-FXTYIA46.js";
 import {
   ThreadingManager
 } from "./chunk-OJP3N7UK.js";
 import {
   promoteSemanticRuleFromMemory
-} from "./chunk-GZICBRWK.js";
+} from "./chunk-4F6X3RXW.js";
 import {
   searchVerifiedSemanticRules
-} from "./chunk-GFIKG4FR.js";
+} from "./chunk-QGR6OVGT.js";
 import {
   buildResumeBundleFromState,
   getResumeBundleStatus,
   recordResumeBundle
-} from "./chunk-DATDLJAO.js";
+} from "./chunk-XAPMEU3K.js";
 import {
   getWorkProductLedgerStatus,
   recordWorkProductLedgerEntry,
@@ -105,7 +105,16 @@ import {
 } from "./chunk-HYQJQGD3.js";
 import {
   parseXrayCliOptions
-} from "./chunk-QSYL5CXK.js";
+} from "./chunk-VKXWK44Q.js";
+import {
+  collectPatternMemories,
+  explainPatternMemory,
+  parsePatternsExplainOptions,
+  parsePatternsListOptions,
+  parseStrictCliDate,
+  renderPatternExplain,
+  renderPatternsList
+} from "./chunk-3T74IZB3.js";
 import {
   readRuntimePolicySnapshot,
   sanitizeRuntimePolicyValues
@@ -118,21 +127,12 @@ import {
   runOperatorInventory,
   runOperatorRepair,
   runOperatorSetup
-} from "./chunk-JPHEOE6Z.js";
+} from "./chunk-6MTSFX7A.js";
 import {
   analyzeSessionIntegrity,
   applySessionRepair,
   planSessionRepair
 } from "./chunk-KFY3SGN7.js";
-import {
-  collectPatternMemories,
-  explainPatternMemory,
-  parsePatternsExplainOptions,
-  parsePatternsListOptions,
-  parseStrictCliDate,
-  renderPatternExplain,
-  renderPatternsList
-} from "./chunk-3T74IZB3.js";
 import {
   GITHUB_CONNECTOR_ID,
   GMAIL_CONNECTOR_ID,
@@ -150,12 +150,12 @@ import {
 import {
   listConnectorStates
 } from "./chunk-6GUG4YNM.js";
+import {
+  searchHarmonicRetrieval
+} from "./chunk-AZ2QBGYB.js";
 import {
   rescoreMemoryImportance
 } from "./chunk-JXS5PDQ7.js";
-import {
-  searchHarmonicRetrieval
-} from "./chunk-QN7NTKRC.js";
 import {
   createEvalBaselineSnapshot,
   getEvalHarnessStatus,
@@ -165,6 +165,11 @@ import {
   runEvalStoredBaselineCiGate,
   validateEvalBenchmarkPack
 } from "./chunk-MCA2X4WH.js";
+import {
+  rebuildMemoryProjection,
+  repairMemoryProjection,
+  verifyMemoryProjection
+} from "./chunk-AIUBBHSF.js";
 import {
   getCueAnchorStoreStatus
 } from "./chunk-ACPCA4NO.js";
@@ -180,11 +185,6 @@ import {
   renderConnectorsRunResult,
   runConnectorPollOnce
 } from "./chunk-OKTXM5H4.js";
-import {
-  rebuildMemoryProjection,
-  repairMemoryProjection,
-  verifyMemoryProjection
-} from "./chunk-Z3RHPGSY.js";
 import {
   applyCommitmentLedgerLifecycle,
   getCommitmentLedgerStatus,
@@ -196,11 +196,11 @@ import {
 } from "./chunk-UQ7RN5HK.js";
 import {
   parseConfig
-} from "./chunk-A4QMKFFO.js";
+} from "./chunk-O5FFBO2M.js";
 import {
   EngramAccessHttpServer,
   MeetingsInputError
-} from "./chunk-TQFHQPWD.js";
+} from "./chunk-XADV5IZ3.js";
 import {
   WearablesInputError
 } from "./chunk-V7IZKJI3.js";
@@ -213,13 +213,13 @@ import {
   createProductionChatLlmAdapter,
   loadChatSession,
   sessionBelongsToPrincipal
-} from "./chunk-LEJPSMKM.js";
+} from "./chunk-C5QLI33R.js";
 import {
   getAbstractionNodeStoreStatus
 } from "./chunk-DJUKBGAD.js";
 import {
   EngramAccessService
-} from "./chunk-5C2HNJMO.js";
+} from "./chunk-J5LLX6IL.js";
 import {
   WorkStorage
 } from "./chunk-GDB4J2H3.js";
@@ -236,43 +236,43 @@ import {
   parseRecallExplainFormat,
   renderRecallExplain,
   renderXray
-} from "./chunk-PDEKQWDV.js";
+} from "./chunk-QT2FRYI4.js";
 import {
   readAggregateExtractionWatermark
-} from "./chunk-2S72LWKX.js";
+} from "./chunk-JYL3BVVZ.js";
 import {
   getObjectiveStateStoreStatus
 } from "./chunk-HTP6XRUI.js";
-import {
-  listNamespaces,
-  runNamespaceMigration,
-  verifyNamespaces
-} from "./chunk-TS4AJ2GI.js";
 import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact,
   restoreMemoryGovernanceRun,
   runMemoryGovernance
-} from "./chunk-FXX6RQYC.js";
+} from "./chunk-TPTECFWR.js";
 import {
-  resolveNamespaceChildRoot
-} from "./chunk-4MBPIL4V.js";
+  listNamespaces,
+  runNamespaceMigration,
+  verifyNamespaces
+} from "./chunk-PA45XCUD.js";
 import {
-  analyzeGraphHealth
-} from "./chunk-L2DPF4DF.js";
+  resolveNamespaceChildRoot
+} from "./chunk-PUSLMZBQ.js";
 import {
   getCausalTrajectoryStoreStatus
-} from "./chunk-M4MP34AQ.js";
+} from "./chunk-AHZOMHWN.js";
+import {
+  analyzeGraphHealth
+} from "./chunk-BIJAWZYW.js";
 import {
   meetingIdDate
-} from "./chunk-BOFVT6P3.js";
+} from "./chunk-VBHPOWBJ.js";
 import {
   isValidTranscriptDate
 } from "./chunk-UHVXE24Y.js";
 import {
   RECALL_DISCLOSURE_LEVELS,
   isRecallDisclosure
-} from "./chunk-LAQ33B5D.js";
+} from "./chunk-UU3G6GUP.js";
 import {
   bumpMemoryCorpusVersionForDir
 } from "./chunk-KMAP7SNQ.js";
@@ -7989,4 +7989,4 @@ export {
   listMemoryMarkdownFilePaths,
   registerCli
 };
-//# sourceMappingURL=chunk-V7X767RT.js.map
+//# sourceMappingURL=chunk-DCZBSE4F.js.map

package/dist/chunk-FC67T4E6.js

@@ -0,0 +1,70 @@
+import {
+  coerceBool,
+  coerceNumber
+} from "./chunk-PQVCH2AE.js";
+
+// src/contradiction-config.ts
+function parseContradictionScanConfig(raw) {
+  if (!raw || typeof raw !== "object") {
+    return {
+      enabled: false,
+      similarityFloor: 0.82,
+      topicOverlapFloor: 0.4,
+      maxPairsPerRun: 500,
+      cooldownDays: 14,
+      autoMergeDuplicates: false
+    };
+  }
+  const src = raw;
+  const simFloor = coerceNumber(src.similarityFloor) ?? 0.82;
+  const topicFloor = coerceNumber(src.topicOverlapFloor) ?? 0.4;
+  const maxPairs = coerceNumber(src.maxPairsPerRun) ?? 500;
+  const cooldown = coerceNumber(src.cooldownDays) ?? 14;
+  return {
+    enabled: coerceBool(src.enabled) === true,
+    similarityFloor: Math.min(1, Math.max(0, simFloor)),
+    topicOverlapFloor: Math.min(1, Math.max(0, topicFloor)),
+    maxPairsPerRun: Math.max(1, maxPairs),
+    cooldownDays: Math.max(0, cooldown),
+    autoMergeDuplicates: coerceBool(src.autoMergeDuplicates) === true
+  };
+}
+function parseContradictionLocalizationConfig(raw) {
+  const defaults = {
+    anchorEnabled: true,
+    anchorCandidates: 5,
+    searchCandidates: 5,
+    maxCandidates: 8
+  };
+  if (raw === void 0 || raw === null) return defaults;
+  if (typeof raw !== "object" || Array.isArray(raw)) {
+    throw new Error("contradictionLocalization must be an object");
+  }
+  const src = raw;
+  const rawEnabled = src.anchorEnabled;
+  const anchorEnabled = rawEnabled === void 0 || rawEnabled === null ? true : coerceBool(rawEnabled);
+  if (anchorEnabled === void 0) {
+    throw new Error("contradictionLocalization.anchorEnabled must be a boolean-like value");
+  }
+  const parseCap = (key) => {
+    const rawValue = src[key];
+    if (rawValue === void 0) return defaults[key];
+    const parsed = coerceNumber(rawValue);
+    if (parsed === void 0 || !Number.isInteger(parsed) || parsed < 0) {
+      throw new Error(`contradictionLocalization.${key} must be an integer >= 0`);
+    }
+    return parsed;
+  };
+  return {
+    anchorEnabled,
+    anchorCandidates: parseCap("anchorCandidates"),
+    searchCandidates: parseCap("searchCandidates"),
+    maxCandidates: parseCap("maxCandidates")
+  };
+}
+
+export {
+  parseContradictionScanConfig,
+  parseContradictionLocalizationConfig
+};
+//# sourceMappingURL=chunk-FC67T4E6.js.map

package/dist/chunk-FC67T4E6.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/contradiction-config.ts"],"sourcesContent":["import { coerceBool, coerceNumber } from \"./connectors/coerce.js\";\n\n/** Configuration for the nightly contradiction-scan cron (issue #520). */\nexport interface ContradictionScanConfig {\n  /** Master switch for the contradiction scan cron. Default true. */\n  enabled: boolean;\n  /** Embedding cosine similarity floor for candidate pair generation. Default 0.82. */\n  similarityFloor: number;\n  /** Minimum topic-token Jaccard overlap for unstructured pairs. Default 0.4. */\n  topicOverlapFloor: number;\n  /** Cap on candidate pairs evaluated per cron run. Default 500. */\n  maxPairsPerRun: number;\n  /** Cooldown in days before re-evaluating a pair judged independent/both-valid. Default 14. */\n  cooldownDays: number;\n  /** When true, pairs judged \"duplicates\" are auto-flagged for dedup (still need user approval). Default false. */\n  autoMergeDuplicates: boolean;\n}\n\nexport interface ContradictionLocalizationConfig {\n  /** Enable the entity/category anchor pass before QMD search. */\n  anchorEnabled: boolean;\n  /** Maximum anchor candidates. Zero disables the anchor pass. */\n  anchorCandidates: number;\n  /** Maximum QMD search candidates. Zero disables text search. */\n  searchCandidates: number;\n  /** Maximum merged candidates passed to contradiction verification. */\n  maxCandidates: number;\n}\n\nexport function parseContradictionScanConfig(raw: unknown): ContradictionScanConfig {\n  if (!raw || typeof raw !== \"object\") {\n    return {\n      enabled: false,\n      similarityFloor: 0.82,\n      topicOverlapFloor: 0.4,\n      maxPairsPerRun: 500,\n      cooldownDays: 14,\n      autoMergeDuplicates: false,\n    };\n  }\n  const src = raw as Record<string, unknown>;\n  const simFloor = coerceNumber(src.similarityFloor) ?? 0.82;\n  const topicFloor = coerceNumber(src.topicOverlapFloor) ?? 0.4;\n  const maxPairs = coerceNumber(src.maxPairsPerRun) ?? 500;\n  const cooldown = coerceNumber(src.cooldownDays) ?? 14;\n  return {\n    enabled: coerceBool(src.enabled) === true,\n    similarityFloor: Math.min(1, Math.max(0, simFloor)),\n    topicOverlapFloor: Math.min(1, Math.max(0, topicFloor)),\n    maxPairsPerRun: Math.max(1, maxPairs),\n    cooldownDays: Math.max(0, cooldown),\n    autoMergeDuplicates: coerceBool(src.autoMergeDuplicates) === true,\n  };\n}\n\nexport function parseContradictionLocalizationConfig(raw: unknown): ContradictionLocalizationConfig {\n  const defaults: ContradictionLocalizationConfig = {\n    anchorEnabled: true,\n    anchorCandidates: 5,\n    searchCandidates: 5,\n    maxCandidates: 8,\n  };\n  if (raw === undefined || raw === null) return defaults;\n  if (typeof raw !== \"object\" || Array.isArray(raw)) {\n    throw new Error(\"contradictionLocalization must be an object\");\n  }\n  const src = raw as Record<string, unknown>;\n  const rawEnabled = src.anchorEnabled;\n  const anchorEnabled = rawEnabled === undefined || rawEnabled === null ? true : coerceBool(rawEnabled);\n  if (anchorEnabled === undefined) {\n    throw new Error(\"contradictionLocalization.anchorEnabled must be a boolean-like value\");\n  }\n\n  const parseCap = (\n    key: keyof Pick<ContradictionLocalizationConfig, \"anchorCandidates\" | \"searchCandidates\" | \"maxCandidates\">,\n  ): number => {\n    const rawValue = src[key];\n    if (rawValue === undefined) return defaults[key];\n    const parsed = coerceNumber(rawValue);\n    if (parsed === undefined || !Number.isInteger(parsed) || parsed < 0) {\n      throw new Error(`contradictionLocalization.${key} must be an integer >= 0`);\n    }\n    return parsed;\n  };\n\n  return {\n    anchorEnabled,\n    anchorCandidates: parseCap(\"anchorCandidates\"),\n    searchCandidates: parseCap(\"searchCandidates\"),\n    maxCandidates: parseCap(\"maxCandidates\"),\n  };\n}\n"],"mappings":";;;;;;AA6BO,SAAS,6BAA6B,KAAuC;AAClF,MAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;AACnC,WAAO;AAAA,MACL,SAAS;AAAA,MACT,iBAAiB;AAAA,MACjB,mBAAmB;AAAA,MACnB,gBAAgB;AAAA,MAChB,cAAc;AAAA,MACd,qBAAqB;AAAA,IACvB;AAAA,EACF;AACA,QAAM,MAAM;AACZ,QAAM,WAAW,aAAa,IAAI,eAAe,KAAK;AACtD,QAAM,aAAa,aAAa,IAAI,iBAAiB,KAAK;AAC1D,QAAM,WAAW,aAAa,IAAI,cAAc,KAAK;AACrD,QAAM,WAAW,aAAa,IAAI,YAAY,KAAK;AACnD,SAAO;AAAA,IACL,SAAS,WAAW,IAAI,OAAO,MAAM;AAAA,IACrC,iBAAiB,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,QAAQ,CAAC;AAAA,IAClD,mBAAmB,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,UAAU,CAAC;AAAA,IACtD,gBAAgB,KAAK,IAAI,GAAG,QAAQ;AAAA,IACpC,cAAc,KAAK,IAAI,GAAG,QAAQ;AAAA,IAClC,qBAAqB,WAAW,IAAI,mBAAmB,MAAM;AAAA,EAC/D;AACF;AAEO,SAAS,qCAAqC,KAA+C;AAClG,QAAM,WAA4C;AAAA,IAChD,eAAe;AAAA,IACf,kBAAkB;AAAA,IAClB,kBAAkB;AAAA,IAClB,eAAe;AAAA,EACjB;AACA,MAAI,QAAQ,UAAa,QAAQ,KAAM,QAAO;AAC9C,MAAI,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAAG;AACjD,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,QAAM,MAAM;AACZ,QAAM,aAAa,IAAI;AACvB,QAAM,gBAAgB,eAAe,UAAa,eAAe,OAAO,OAAO,WAAW,UAAU;AACpG,MAAI,kBAAkB,QAAW;AAC/B,UAAM,IAAI,MAAM,sEAAsE;AAAA,EACxF;AAEA,QAAM,WAAW,CACf,QACW;AACX,UAAM,WAAW,IAAI,GAAG;AACxB,QAAI,aAAa,OAAW,QAAO,SAAS,GAAG;AAC/C,UAAM,SAAS,aAAa,QAAQ;AACpC,QAAI,WAAW,UAAa,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,GAAG;AACnE,YAAM,IAAI,MAAM,6BAA6B,GAAG,0BAA0B;AAAA,IAC5E;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL;AAAA,IACA,kBAAkB,SAAS,kBAAkB;AAAA,IAC7C,kBAAkB,SAAS,kBAAkB;AAAA,IAC7C,eAAe,SAAS,eAAe;AAAA,EACzC;AACF;","names":[]}