@remnic/core 9.69.22 → 9.69.24

package/dist/causal-retrieval.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/causal-retrieval.ts"],"sourcesContent":["/**\n * causal-retrieval.ts — CMC Phase 3: Causal Retrieval Channel\n *\n * Walks upstream/downstream causal chains during recall to surface\n * connected trajectories. Branching points (multiple outgoing edges\n * with different outcomes) get a counterfactual boost as they represent\n * decision points worth surfacing.\n */\n\nimport type { CausalTrajectoryRecord } from \"./causal-trajectory.js\";\nimport { readCausalTrajectoryRecords, searchCausalTrajectories } from \"./causal-trajectory.js\";\nimport {\n  readChainIndex,\n  resolveChainsDir,\n  type CausalChainIndex,\n  type CausalEdge,\n} from \"./causal-chain.js\";\nimport { log } from \"./logger.js\";\n\n// ─── Types ───────────────────────────────────────────────────────────────────\n\nexport interface CausalRetrievalConfig {\n  maxDepth: number;\n  maxChars: number;\n  counterfactualBoost: number;\n}\n\nexport interface CausalRetrievalResult {\n  trajectoryId: string;\n  direction: \"upstream\" | \"downstream\" | \"seed\";\n  depth: number;\n  score: number;\n  edgeType?: CausalEdge[\"edgeType\"];\n  edgeConfidence?: number;\n  isCounterfactual: boolean;\n  summary: string;\n}\n\n// ─── Graph Traversal ─────────────────────────────────────────────────────────\n\n/**\n * Walk upstream (incoming edges) from a seed trajectory.\n */\nfunction walkUpstream(\n  seedId: string,\n  index: CausalChainIndex,\n  maxDepth: number,\n  counterfactualBoost: number,\n): Array<{ trajectoryId: string; depth: number; score: number; edgeType: CausalEdge[\"edgeType\"]; edgeConfidence: number; isCounterfactual: boolean }> {\n  const visited = new Set<string>([seedId]);\n  const results: Array<{ trajectoryId: string; depth: number; score: number; edgeType: CausalEdge[\"edgeType\"]; edgeConfidence: number; isCounterfactual: boolean }> = [];\n\n  let frontier = [seedId];\n  for (let depth = 1; depth <= maxDepth; depth++) {\n    const nextFrontier: string[] = [];\n\n    for (const currentId of frontier) {\n      const incomingEdgeIds = index.incoming[currentId] ?? [];\n\n      for (const edgeId of incomingEdgeIds) {\n        const edge = index.edges[edgeId];\n        if (!edge) continue;\n\n        const fromId = edge.fromTrajectoryId;\n        if (visited.has(fromId)) continue;\n        visited.add(fromId);\n\n        // Check if this is a counterfactual branching point\n        const outgoingFromSource = index.outgoing[fromId] ?? [];\n        const isCounterfactual = outgoingFromSource.length > 1;\n\n        const depthDecay = 1 / depth;\n        let score = depthDecay * edge.confidence;\n        if (isCounterfactual) score += counterfactualBoost;\n\n        results.push({\n          trajectoryId: fromId,\n          depth,\n          score,\n          edgeType: edge.edgeType,\n          edgeConfidence: edge.confidence,\n          isCounterfactual,\n        });\n\n        nextFrontier.push(fromId);\n      }\n    }\n\n    frontier = nextFrontier;\n    if (frontier.length === 0) break;\n  }\n\n  return results;\n}\n\n/**\n * Walk downstream (outgoing edges) from a seed trajectory.\n * Max 2 hops downstream (less relevant than upstream context).\n */\nfunction walkDownstream(\n  seedId: string,\n  index: CausalChainIndex,\n  maxDepth: number,\n  counterfactualBoost: number,\n): Array<{ trajectoryId: string; depth: number; score: number; edgeType: CausalEdge[\"edgeType\"]; edgeConfidence: number; isCounterfactual: boolean }> {\n  const downstreamMaxDepth = Math.min(maxDepth, 2);\n  const visited = new Set<string>([seedId]);\n  const results: Array<{ trajectoryId: string; depth: number; score: number; edgeType: CausalEdge[\"edgeType\"]; edgeConfidence: number; isCounterfactual: boolean }> = [];\n\n  let frontier = [seedId];\n  for (let depth = 1; depth <= downstreamMaxDepth; depth++) {\n    const nextFrontier: string[] = [];\n\n    for (const currentId of frontier) {\n      const outgoingEdgeIds = index.outgoing[currentId] ?? [];\n\n      // Counterfactual: multiple outgoing = branching point\n      const isCounterfactual = outgoingEdgeIds.length > 1;\n\n      for (const edgeId of outgoingEdgeIds) {\n        const edge = index.edges[edgeId];\n        if (!edge) continue;\n\n        const toId = edge.toTrajectoryId;\n        if (visited.has(toId)) continue;\n        visited.add(toId);\n\n        const depthDecay = 1 / (depth + 1); // downstream penalized more\n        let score = depthDecay * edge.confidence;\n        if (isCounterfactual) score += counterfactualBoost;\n\n        results.push({\n          trajectoryId: toId,\n          depth,\n          score,\n          edgeType: edge.edgeType,\n          edgeConfidence: edge.confidence,\n          isCounterfactual,\n        });\n\n        nextFrontier.push(toId);\n      }\n    }\n\n    frontier = nextFrontier;\n    if (frontier.length === 0) break;\n  }\n\n  return results;\n}\n\n// ─── Section Formatting ──────────────────────────────────────────────────────\n\nfunction formatRetrievalResult(result: CausalRetrievalResult): string {\n  const direction = result.direction === \"upstream\" ? \"↑\" : result.direction === \"downstream\" ? \"↓\" : \"•\";\n  const counterfactual = result.isCounterfactual ? \" [branching point]\" : \"\";\n  const edgeInfo = result.edgeType ? ` (${result.edgeType})` : \"\";\n  return `- ${direction} ${result.summary}${edgeInfo}${counterfactual}`;\n}\n\nfunction formatConnectedTrajectorySummary(\n  trajectoryId: string,\n  depth: number,\n  trajectoriesById: Map<string, CausalTrajectoryRecord>,\n): string {\n  const record = trajectoriesById.get(trajectoryId);\n  if (!record) return `Depth ${depth}: trajectory ${trajectoryId.slice(0, 12)}`;\n  return `Depth ${depth}: [${record.outcomeKind}] ${record.goal} → ${record.outcomeSummary}`;\n}\n\nexport function formatCausalRetrievalSection(\n  results: CausalRetrievalResult[],\n  maxChars: number,\n): string | null {\n  if (results.length === 0) return null;\n\n  const lines: string[] = [\n    \"## Causal Chain Context\",\n    \"\",\n    \"Related causal trajectories from connected sessions:\",\n    \"\",\n  ];\n\n  let totalChars = lines.join(\"\\n\").length;\n\n  for (const result of results) {\n    const line = formatRetrievalResult(result);\n    if (totalChars + line.length + 1 > maxChars) break;\n    lines.push(line);\n    totalChars += line.length + 1;\n  }\n\n  if (lines.length <= 4) return null; // only header, no content\n  lines.push(\"\");\n  return lines.join(\"\\n\");\n}\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/**\n * Retrieve causal chain context for a recall query.\n * 1. Use existing causal trajectory search for seed trajectories\n * 2. Walk upstream/downstream from seeds\n * 3. Format as recall section\n */\nexport async function retrieveCausalChains(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  query: string;\n  sessionKey?: string;\n  config: CausalRetrievalConfig;\n}): Promise<string | null> {\n  try {\n    const { memoryDir, causalTrajectoryStoreDir, query, sessionKey, config: retrievalConfig } = options;\n\n    // 1. Search for seed trajectories matching the query\n    const seeds = await searchCausalTrajectories({\n      memoryDir,\n      causalTrajectoryStoreDir,\n      query,\n      maxResults: 3,\n      sessionKey,\n    });\n\n    if (seeds.length === 0) return null;\n\n    // 2. Load chain index\n    const chainsDir = resolveChainsDir(memoryDir, causalTrajectoryStoreDir);\n    const chainIndex = await readChainIndex(chainsDir);\n\n    if (Object.keys(chainIndex.edges).length === 0) return null;\n\n    const { trajectories } = await readCausalTrajectoryRecords({ memoryDir, causalTrajectoryStoreDir });\n    const trajectoriesById = new Map(trajectories.map((trajectory) => [trajectory.trajectoryId, trajectory]));\n\n    // 3. Walk chains from each seed\n    const allResults: CausalRetrievalResult[] = [];\n\n    for (const seed of seeds) {\n      // Add seed itself\n      allResults.push({\n        trajectoryId: seed.record.trajectoryId,\n        direction: \"seed\",\n        depth: 0,\n        score: seed.score,\n        isCounterfactual: false,\n        summary: `[${seed.record.outcomeKind}] ${seed.record.goal} → ${seed.record.outcomeSummary}`,\n      });\n\n      // Walk upstream\n      const upstream = walkUpstream(\n        seed.record.trajectoryId,\n        chainIndex,\n        retrievalConfig.maxDepth,\n        retrievalConfig.counterfactualBoost,\n      );\n      for (const u of upstream) {\n        allResults.push({\n          trajectoryId: u.trajectoryId,\n          direction: \"upstream\",\n          depth: u.depth,\n          score: u.score,\n          edgeType: u.edgeType,\n          edgeConfidence: u.edgeConfidence,\n          isCounterfactual: u.isCounterfactual,\n          summary: formatConnectedTrajectorySummary(u.trajectoryId, u.depth, trajectoriesById),\n        });\n      }\n\n      // Walk downstream\n      const downstream = walkDownstream(\n        seed.record.trajectoryId,\n        chainIndex,\n        retrievalConfig.maxDepth,\n        retrievalConfig.counterfactualBoost,\n      );\n      for (const d of downstream) {\n        allResults.push({\n          trajectoryId: d.trajectoryId,\n          direction: \"downstream\",\n          depth: d.depth,\n          score: d.score,\n          edgeType: d.edgeType,\n          edgeConfidence: d.edgeConfidence,\n          isCounterfactual: d.isCounterfactual,\n          summary: formatConnectedTrajectorySummary(d.trajectoryId, d.depth, trajectoriesById),\n        });\n      }\n    }\n\n    // 4. Sort by score and format\n    allResults.sort((a, b) => b.score - a.score);\n\n    return formatCausalRetrievalSection(allResults, retrievalConfig.maxChars);\n  } catch (error) {\n    log.warn(`[cmc] causal retrieval failed (non-fatal): ${error instanceof Error ? error.message : String(error)}`);\n    return null;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AA2CA,SAAS,aACP,QACA,OACA,UACA,qBACoJ;AACpJ,QAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAM,UAA8J,CAAC;AAErK,MAAI,WAAW,CAAC,MAAM;AACtB,WAAS,QAAQ,GAAG,SAAS,UAAU,SAAS;AAC9C,UAAM,eAAyB,CAAC;AAEhC,eAAW,aAAa,UAAU;AAChC,YAAM,kBAAkB,MAAM,SAAS,SAAS,KAAK,CAAC;AAEtD,iBAAW,UAAU,iBAAiB;AACpC,cAAM,OAAO,MAAM,MAAM,MAAM;AAC/B,YAAI,CAAC,KAAM;AAEX,cAAM,SAAS,KAAK;AACpB,YAAI,QAAQ,IAAI,MAAM,EAAG;AACzB,gBAAQ,IAAI,MAAM;AAGlB,cAAM,qBAAqB,MAAM,SAAS,MAAM,KAAK,CAAC;AACtD,cAAM,mBAAmB,mBAAmB,SAAS;AAErD,cAAM,aAAa,IAAI;AACvB,YAAI,QAAQ,aAAa,KAAK;AAC9B,YAAI,iBAAkB,UAAS;AAE/B,gBAAQ,KAAK;AAAA,UACX,cAAc;AAAA,UACd;AAAA,UACA;AAAA,UACA,UAAU,KAAK;AAAA,UACf,gBAAgB,KAAK;AAAA,UACrB;AAAA,QACF,CAAC;AAED,qBAAa,KAAK,MAAM;AAAA,MAC1B;AAAA,IACF;AAEA,eAAW;AACX,QAAI,SAAS,WAAW,EAAG;AAAA,EAC7B;AAEA,SAAO;AACT;AAMA,SAAS,eACP,QACA,OACA,UACA,qBACoJ;AACpJ,QAAM,qBAAqB,KAAK,IAAI,UAAU,CAAC;AAC/C,QAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAM,UAA8J,CAAC;AAErK,MAAI,WAAW,CAAC,MAAM;AACtB,WAAS,QAAQ,GAAG,SAAS,oBAAoB,SAAS;AACxD,UAAM,eAAyB,CAAC;AAEhC,eAAW,aAAa,UAAU;AAChC,YAAM,kBAAkB,MAAM,SAAS,SAAS,KAAK,CAAC;AAGtD,YAAM,mBAAmB,gBAAgB,SAAS;AAElD,iBAAW,UAAU,iBAAiB;AACpC,cAAM,OAAO,MAAM,MAAM,MAAM;AAC/B,YAAI,CAAC,KAAM;AAEX,cAAM,OAAO,KAAK;AAClB,YAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,gBAAQ,IAAI,IAAI;AAEhB,cAAM,aAAa,KAAK,QAAQ;AAChC,YAAI,QAAQ,aAAa,KAAK;AAC9B,YAAI,iBAAkB,UAAS;AAE/B,gBAAQ,KAAK;AAAA,UACX,cAAc;AAAA,UACd;AAAA,UACA;AAAA,UACA,UAAU,KAAK;AAAA,UACf,gBAAgB,KAAK;AAAA,UACrB;AAAA,QACF,CAAC;AAED,qBAAa,KAAK,IAAI;AAAA,MACxB;AAAA,IACF;AAEA,eAAW;AACX,QAAI,SAAS,WAAW,EAAG;AAAA,EAC7B;AAEA,SAAO;AACT;AAIA,SAAS,sBAAsB,QAAuC;AACpE,QAAM,YAAY,OAAO,cAAc,aAAa,WAAM,OAAO,cAAc,eAAe,WAAM;AACpG,QAAM,iBAAiB,OAAO,mBAAmB,uBAAuB;AACxE,QAAM,WAAW,OAAO,WAAW,KAAK,OAAO,QAAQ,MAAM;AAC7D,SAAO,KAAK,SAAS,IAAI,OAAO,OAAO,GAAG,QAAQ,GAAG,cAAc;AACrE;AAEA,SAAS,iCACP,cACA,OACA,kBACQ;AACR,QAAM,SAAS,iBAAiB,IAAI,YAAY;AAChD,MAAI,CAAC,OAAQ,QAAO,SAAS,KAAK,gBAAgB,aAAa,MAAM,GAAG,EAAE,CAAC;AAC3E,SAAO,SAAS,KAAK,MAAM,OAAO,WAAW,KAAK,OAAO,IAAI,WAAM,OAAO,cAAc;AAC1F;AAEO,SAAS,6BACd,SACA,UACe;AACf,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,QAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,aAAa,MAAM,KAAK,IAAI,EAAE;AAElC,aAAW,UAAU,SAAS;AAC5B,UAAM,OAAO,sBAAsB,MAAM;AACzC,QAAI,aAAa,KAAK,SAAS,IAAI,SAAU;AAC7C,UAAM,KAAK,IAAI;AACf,kBAAc,KAAK,SAAS;AAAA,EAC9B;AAEA,MAAI,MAAM,UAAU,EAAG,QAAO;AAC9B,QAAM,KAAK,EAAE;AACb,SAAO,MAAM,KAAK,IAAI;AACxB;AAUA,eAAsB,qBAAqB,SAMhB;AACzB,MAAI;AACF,UAAM,EAAE,WAAW,0BAA0B,OAAO,YAAY,QAAQ,gBAAgB,IAAI;AAG5F,UAAM,QAAQ,MAAM,yBAAyB;AAAA,MAC3C;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY;AAAA,MACZ;AAAA,IACF,CAAC;AAED,QAAI,MAAM,WAAW,EAAG,QAAO;AAG/B,UAAM,YAAY,iBAAiB,WAAW,wBAAwB;AACtE,UAAM,aAAa,MAAM,eAAe,SAAS;AAEjD,QAAI,OAAO,KAAK,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO;AAEvD,UAAM,EAAE,aAAa,IAAI,MAAM,4BAA4B,EAAE,WAAW,yBAAyB,CAAC;AAClG,UAAM,mBAAmB,IAAI,IAAI,aAAa,IAAI,CAAC,eAAe,CAAC,WAAW,cAAc,UAAU,CAAC,CAAC;AAGxG,UAAM,aAAsC,CAAC;AAE7C,eAAW,QAAQ,OAAO;AAExB,iBAAW,KAAK;AAAA,QACd,cAAc,KAAK,OAAO;AAAA,QAC1B,WAAW;AAAA,QACX,OAAO;AAAA,QACP,OAAO,KAAK;AAAA,QACZ,kBAAkB;AAAA,QAClB,SAAS,IAAI,KAAK,OAAO,WAAW,KAAK,KAAK,OAAO,IAAI,WAAM,KAAK,OAAO,cAAc;AAAA,MAC3F,CAAC;AAGD,YAAM,WAAW;AAAA,QACf,KAAK,OAAO;AAAA,QACZ;AAAA,QACA,gBAAgB;AAAA,QAChB,gBAAgB;AAAA,MAClB;AACA,iBAAW,KAAK,UAAU;AACxB,mBAAW,KAAK;AAAA,UACd,cAAc,EAAE;AAAA,UAChB,WAAW;AAAA,UACX,OAAO,EAAE;AAAA,UACT,OAAO,EAAE;AAAA,UACT,UAAU,EAAE;AAAA,UACZ,gBAAgB,EAAE;AAAA,UAClB,kBAAkB,EAAE;AAAA,UACpB,SAAS,iCAAiC,EAAE,cAAc,EAAE,OAAO,gBAAgB;AAAA,QACrF,CAAC;AAAA,MACH;AAGA,YAAM,aAAa;AAAA,QACjB,KAAK,OAAO;AAAA,QACZ;AAAA,QACA,gBAAgB;AAAA,QAChB,gBAAgB;AAAA,MAClB;AACA,iBAAW,KAAK,YAAY;AAC1B,mBAAW,KAAK;AAAA,UACd,cAAc,EAAE;AAAA,UAChB,WAAW;AAAA,UACX,OAAO,EAAE;AAAA,UACT,OAAO,EAAE;AAAA,UACT,UAAU,EAAE;AAAA,UACZ,gBAAgB,EAAE;AAAA,UAClB,kBAAkB,EAAE;AAAA,UACpB,SAAS,iCAAiC,EAAE,cAAc,EAAE,OAAO,gBAAgB;AAAA,QACrF,CAAC;AAAA,MACH;AAAA,IACF;AAGA,eAAW,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAE3C,WAAO,6BAA6B,YAAY,gBAAgB,QAAQ;AAAA,EAC1E,SAAS,OAAO;AACd,QAAI,KAAK,8CAA8C,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAC/G,WAAO;AAAA,EACT;AACF;","names":[]}
+{"version":3,"sources":["../src/causal-retrieval.ts"],"sourcesContent":["/**\n * causal-retrieval.ts — CMC Phase 3: Causal Retrieval Channel\n *\n * Walks upstream/downstream causal chains during recall to surface\n * connected trajectories. Branching points (multiple outgoing edges\n * with different outcomes) get a counterfactual boost as they represent\n * decision points worth surfacing.\n */\n\nimport type { CausalTrajectoryRecord } from \"./causal-trajectory.js\";\nimport { readCausalTrajectoryRecords, searchCausalTrajectories } from \"./causal-trajectory.js\";\nimport {\n  readChainIndex,\n  resolveChainsDir,\n  type CausalChainIndex,\n  type CausalEdge,\n} from \"./causal-chain.js\";\nimport { log } from \"./logger.js\";\n\n// ─── Types ───────────────────────────────────────────────────────────────────\n\nexport interface CausalRetrievalConfig {\n  maxDepth: number;\n  maxChars: number;\n  counterfactualBoost: number;\n}\n\nexport interface CausalRetrievalResult {\n  trajectoryId: string;\n  direction: \"upstream\" | \"downstream\" | \"seed\";\n  depth: number;\n  score: number;\n  edgeType?: CausalEdge[\"edgeType\"];\n  edgeConfidence?: number;\n  isCounterfactual: boolean;\n  summary: string;\n}\n\n// ─── Graph Traversal ─────────────────────────────────────────────────────────\n\n/**\n * Walk upstream (incoming edges) from a seed trajectory.\n */\nfunction walkUpstream(\n  seedId: string,\n  index: CausalChainIndex,\n  maxDepth: number,\n  counterfactualBoost: number,\n): Array<{ trajectoryId: string; depth: number; score: number; edgeType: CausalEdge[\"edgeType\"]; edgeConfidence: number; isCounterfactual: boolean }> {\n  const visited = new Set<string>([seedId]);\n  const results: Array<{ trajectoryId: string; depth: number; score: number; edgeType: CausalEdge[\"edgeType\"]; edgeConfidence: number; isCounterfactual: boolean }> = [];\n\n  let frontier = [seedId];\n  for (let depth = 1; depth <= maxDepth; depth++) {\n    const nextFrontier: string[] = [];\n\n    for (const currentId of frontier) {\n      const incomingEdgeIds = index.incoming[currentId] ?? [];\n\n      for (const edgeId of incomingEdgeIds) {\n        const edge = index.edges[edgeId];\n        if (!edge) continue;\n\n        const fromId = edge.fromTrajectoryId;\n        if (visited.has(fromId)) continue;\n        visited.add(fromId);\n\n        // Check if this is a counterfactual branching point\n        const outgoingFromSource = index.outgoing[fromId] ?? [];\n        const isCounterfactual = outgoingFromSource.length > 1;\n\n        const depthDecay = 1 / depth;\n        let score = depthDecay * edge.confidence;\n        if (isCounterfactual) score += counterfactualBoost;\n\n        results.push({\n          trajectoryId: fromId,\n          depth,\n          score,\n          edgeType: edge.edgeType,\n          edgeConfidence: edge.confidence,\n          isCounterfactual,\n        });\n\n        nextFrontier.push(fromId);\n      }\n    }\n\n    frontier = nextFrontier;\n    if (frontier.length === 0) break;\n  }\n\n  return results;\n}\n\n/**\n * Walk downstream (outgoing edges) from a seed trajectory.\n * Max 2 hops downstream (less relevant than upstream context).\n */\nfunction walkDownstream(\n  seedId: string,\n  index: CausalChainIndex,\n  maxDepth: number,\n  counterfactualBoost: number,\n): Array<{ trajectoryId: string; depth: number; score: number; edgeType: CausalEdge[\"edgeType\"]; edgeConfidence: number; isCounterfactual: boolean }> {\n  const downstreamMaxDepth = Math.min(maxDepth, 2);\n  const visited = new Set<string>([seedId]);\n  const results: Array<{ trajectoryId: string; depth: number; score: number; edgeType: CausalEdge[\"edgeType\"]; edgeConfidence: number; isCounterfactual: boolean }> = [];\n\n  let frontier = [seedId];\n  for (let depth = 1; depth <= downstreamMaxDepth; depth++) {\n    const nextFrontier: string[] = [];\n\n    for (const currentId of frontier) {\n      const outgoingEdgeIds = index.outgoing[currentId] ?? [];\n\n      // Counterfactual: multiple outgoing = branching point\n      const isCounterfactual = outgoingEdgeIds.length > 1;\n\n      for (const edgeId of outgoingEdgeIds) {\n        const edge = index.edges[edgeId];\n        if (!edge) continue;\n\n        const toId = edge.toTrajectoryId;\n        if (visited.has(toId)) continue;\n        visited.add(toId);\n\n        const depthDecay = 1 / (depth + 1); // downstream penalized more\n        let score = depthDecay * edge.confidence;\n        if (isCounterfactual) score += counterfactualBoost;\n\n        results.push({\n          trajectoryId: toId,\n          depth,\n          score,\n          edgeType: edge.edgeType,\n          edgeConfidence: edge.confidence,\n          isCounterfactual,\n        });\n\n        nextFrontier.push(toId);\n      }\n    }\n\n    frontier = nextFrontier;\n    if (frontier.length === 0) break;\n  }\n\n  return results;\n}\n\n// ─── Section Formatting ──────────────────────────────────────────────────────\n\nfunction formatRetrievalResult(result: CausalRetrievalResult): string {\n  const direction = result.direction === \"upstream\" ? \"↑\" : result.direction === \"downstream\" ? \"↓\" : \"•\";\n  const counterfactual = result.isCounterfactual ? \" [branching point]\" : \"\";\n  const edgeInfo = result.edgeType ? ` (${result.edgeType})` : \"\";\n  return `- ${direction} ${result.summary}${edgeInfo}${counterfactual}`;\n}\n\nfunction formatConnectedTrajectorySummary(\n  trajectoryId: string,\n  depth: number,\n  trajectoriesById: Map<string, CausalTrajectoryRecord>,\n): string {\n  const record = trajectoriesById.get(trajectoryId);\n  if (!record) return `Depth ${depth}: trajectory ${trajectoryId.slice(0, 12)}`;\n  return `Depth ${depth}: [${record.outcomeKind}] ${record.goal} → ${record.outcomeSummary}`;\n}\n\nexport function formatCausalRetrievalSection(\n  results: CausalRetrievalResult[],\n  maxChars: number,\n): string | null {\n  if (results.length === 0) return null;\n\n  const lines: string[] = [\n    \"## Causal Chain Context\",\n    \"\",\n    \"Related causal trajectories from connected sessions:\",\n    \"\",\n  ];\n\n  let totalChars = lines.join(\"\\n\").length;\n\n  for (const result of results) {\n    const line = formatRetrievalResult(result);\n    if (totalChars + line.length + 1 > maxChars) break;\n    lines.push(line);\n    totalChars += line.length + 1;\n  }\n\n  if (lines.length <= 4) return null; // only header, no content\n  lines.push(\"\");\n  return lines.join(\"\\n\");\n}\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/**\n * Retrieve causal chain context for a recall query.\n * 1. Use existing causal trajectory search for seed trajectories\n * 2. Walk upstream/downstream from seeds\n * 3. Format as recall section\n */\nexport async function retrieveCausalChains(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  query: string;\n  sessionKey?: string;\n  config: CausalRetrievalConfig;\n}): Promise<string | null> {\n  try {\n    const { memoryDir, causalTrajectoryStoreDir, query, sessionKey, config: retrievalConfig } = options;\n\n    // 1. Search for seed trajectories matching the query\n    const seeds = await searchCausalTrajectories({\n      memoryDir,\n      causalTrajectoryStoreDir,\n      query,\n      maxResults: 3,\n      sessionKey,\n    });\n\n    if (seeds.length === 0) return null;\n\n    // 2. Load chain index\n    const chainsDir = resolveChainsDir(memoryDir, causalTrajectoryStoreDir);\n    const chainIndex = await readChainIndex(chainsDir);\n\n    if (Object.keys(chainIndex.edges).length === 0) return null;\n\n    const { trajectories } = await readCausalTrajectoryRecords({ memoryDir, causalTrajectoryStoreDir });\n    const trajectoriesById = new Map(trajectories.map((trajectory) => [trajectory.trajectoryId, trajectory]));\n\n    // 3. Walk chains from each seed\n    const allResults: CausalRetrievalResult[] = [];\n\n    for (const seed of seeds) {\n      // Add seed itself\n      allResults.push({\n        trajectoryId: seed.record.trajectoryId,\n        direction: \"seed\",\n        depth: 0,\n        score: seed.score,\n        isCounterfactual: false,\n        summary: `[${seed.record.outcomeKind}] ${seed.record.goal} → ${seed.record.outcomeSummary}`,\n      });\n\n      // Walk upstream\n      const upstream = walkUpstream(\n        seed.record.trajectoryId,\n        chainIndex,\n        retrievalConfig.maxDepth,\n        retrievalConfig.counterfactualBoost,\n      );\n      for (const u of upstream) {\n        allResults.push({\n          trajectoryId: u.trajectoryId,\n          direction: \"upstream\",\n          depth: u.depth,\n          score: u.score,\n          edgeType: u.edgeType,\n          edgeConfidence: u.edgeConfidence,\n          isCounterfactual: u.isCounterfactual,\n          summary: formatConnectedTrajectorySummary(u.trajectoryId, u.depth, trajectoriesById),\n        });\n      }\n\n      // Walk downstream\n      const downstream = walkDownstream(\n        seed.record.trajectoryId,\n        chainIndex,\n        retrievalConfig.maxDepth,\n        retrievalConfig.counterfactualBoost,\n      );\n      for (const d of downstream) {\n        allResults.push({\n          trajectoryId: d.trajectoryId,\n          direction: \"downstream\",\n          depth: d.depth,\n          score: d.score,\n          edgeType: d.edgeType,\n          edgeConfidence: d.edgeConfidence,\n          isCounterfactual: d.isCounterfactual,\n          summary: formatConnectedTrajectorySummary(d.trajectoryId, d.depth, trajectoriesById),\n        });\n      }\n    }\n\n    // 4. Sort by score and format\n    allResults.sort((a, b) => b.score - a.score);\n\n    return formatCausalRetrievalSection(allResults, retrievalConfig.maxChars);\n  } catch (error) {\n    log.warn(`[cmc] causal retrieval failed (non-fatal): ${error instanceof Error ? error.message : String(error)}`);\n    return null;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AA2CA,SAAS,aACP,QACA,OACA,UACA,qBACoJ;AACpJ,QAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAM,UAA8J,CAAC;AAErK,MAAI,WAAW,CAAC,MAAM;AACtB,WAAS,QAAQ,GAAG,SAAS,UAAU,SAAS;AAC9C,UAAM,eAAyB,CAAC;AAEhC,eAAW,aAAa,UAAU;AAChC,YAAM,kBAAkB,MAAM,SAAS,SAAS,KAAK,CAAC;AAEtD,iBAAW,UAAU,iBAAiB;AACpC,cAAM,OAAO,MAAM,MAAM,MAAM;AAC/B,YAAI,CAAC,KAAM;AAEX,cAAM,SAAS,KAAK;AACpB,YAAI,QAAQ,IAAI,MAAM,EAAG;AACzB,gBAAQ,IAAI,MAAM;AAGlB,cAAM,qBAAqB,MAAM,SAAS,MAAM,KAAK,CAAC;AACtD,cAAM,mBAAmB,mBAAmB,SAAS;AAErD,cAAM,aAAa,IAAI;AACvB,YAAI,QAAQ,aAAa,KAAK;AAC9B,YAAI,iBAAkB,UAAS;AAE/B,gBAAQ,KAAK;AAAA,UACX,cAAc;AAAA,UACd;AAAA,UACA;AAAA,UACA,UAAU,KAAK;AAAA,UACf,gBAAgB,KAAK;AAAA,UACrB;AAAA,QACF,CAAC;AAED,qBAAa,KAAK,MAAM;AAAA,MAC1B;AAAA,IACF;AAEA,eAAW;AACX,QAAI,SAAS,WAAW,EAAG;AAAA,EAC7B;AAEA,SAAO;AACT;AAMA,SAAS,eACP,QACA,OACA,UACA,qBACoJ;AACpJ,QAAM,qBAAqB,KAAK,IAAI,UAAU,CAAC;AAC/C,QAAM,UAAU,oBAAI,IAAY,CAAC,MAAM,CAAC;AACxC,QAAM,UAA8J,CAAC;AAErK,MAAI,WAAW,CAAC,MAAM;AACtB,WAAS,QAAQ,GAAG,SAAS,oBAAoB,SAAS;AACxD,UAAM,eAAyB,CAAC;AAEhC,eAAW,aAAa,UAAU;AAChC,YAAM,kBAAkB,MAAM,SAAS,SAAS,KAAK,CAAC;AAGtD,YAAM,mBAAmB,gBAAgB,SAAS;AAElD,iBAAW,UAAU,iBAAiB;AACpC,cAAM,OAAO,MAAM,MAAM,MAAM;AAC/B,YAAI,CAAC,KAAM;AAEX,cAAM,OAAO,KAAK;AAClB,YAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,gBAAQ,IAAI,IAAI;AAEhB,cAAM,aAAa,KAAK,QAAQ;AAChC,YAAI,QAAQ,aAAa,KAAK;AAC9B,YAAI,iBAAkB,UAAS;AAE/B,gBAAQ,KAAK;AAAA,UACX,cAAc;AAAA,UACd;AAAA,UACA;AAAA,UACA,UAAU,KAAK;AAAA,UACf,gBAAgB,KAAK;AAAA,UACrB;AAAA,QACF,CAAC;AAED,qBAAa,KAAK,IAAI;AAAA,MACxB;AAAA,IACF;AAEA,eAAW;AACX,QAAI,SAAS,WAAW,EAAG;AAAA,EAC7B;AAEA,SAAO;AACT;AAIA,SAAS,sBAAsB,QAAuC;AACpE,QAAM,YAAY,OAAO,cAAc,aAAa,WAAM,OAAO,cAAc,eAAe,WAAM;AACpG,QAAM,iBAAiB,OAAO,mBAAmB,uBAAuB;AACxE,QAAM,WAAW,OAAO,WAAW,KAAK,OAAO,QAAQ,MAAM;AAC7D,SAAO,KAAK,SAAS,IAAI,OAAO,OAAO,GAAG,QAAQ,GAAG,cAAc;AACrE;AAEA,SAAS,iCACP,cACA,OACA,kBACQ;AACR,QAAM,SAAS,iBAAiB,IAAI,YAAY;AAChD,MAAI,CAAC,OAAQ,QAAO,SAAS,KAAK,gBAAgB,aAAa,MAAM,GAAG,EAAE,CAAC;AAC3E,SAAO,SAAS,KAAK,MAAM,OAAO,WAAW,KAAK,OAAO,IAAI,WAAM,OAAO,cAAc;AAC1F;AAEO,SAAS,6BACd,SACA,UACe;AACf,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,QAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,aAAa,MAAM,KAAK,IAAI,EAAE;AAElC,aAAW,UAAU,SAAS;AAC5B,UAAM,OAAO,sBAAsB,MAAM;AACzC,QAAI,aAAa,KAAK,SAAS,IAAI,SAAU;AAC7C,UAAM,KAAK,IAAI;AACf,kBAAc,KAAK,SAAS;AAAA,EAC9B;AAEA,MAAI,MAAM,UAAU,EAAG,QAAO;AAC9B,QAAM,KAAK,EAAE;AACb,SAAO,MAAM,KAAK,IAAI;AACxB;AAUA,eAAsB,qBAAqB,SAMhB;AACzB,MAAI;AACF,UAAM,EAAE,WAAW,0BAA0B,OAAO,YAAY,QAAQ,gBAAgB,IAAI;AAG5F,UAAM,QAAQ,MAAM,yBAAyB;AAAA,MAC3C;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY;AAAA,MACZ;AAAA,IACF,CAAC;AAED,QAAI,MAAM,WAAW,EAAG,QAAO;AAG/B,UAAM,YAAY,iBAAiB,WAAW,wBAAwB;AACtE,UAAM,aAAa,MAAM,eAAe,SAAS;AAEjD,QAAI,OAAO,KAAK,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO;AAEvD,UAAM,EAAE,aAAa,IAAI,MAAM,4BAA4B,EAAE,WAAW,yBAAyB,CAAC;AAClG,UAAM,mBAAmB,IAAI,IAAI,aAAa,IAAI,CAAC,eAAe,CAAC,WAAW,cAAc,UAAU,CAAC,CAAC;AAGxG,UAAM,aAAsC,CAAC;AAE7C,eAAW,QAAQ,OAAO;AAExB,iBAAW,KAAK;AAAA,QACd,cAAc,KAAK,OAAO;AAAA,QAC1B,WAAW;AAAA,QACX,OAAO;AAAA,QACP,OAAO,KAAK;AAAA,QACZ,kBAAkB;AAAA,QAClB,SAAS,IAAI,KAAK,OAAO,WAAW,KAAK,KAAK,OAAO,IAAI,WAAM,KAAK,OAAO,cAAc;AAAA,MAC3F,CAAC;AAGD,YAAM,WAAW;AAAA,QACf,KAAK,OAAO;AAAA,QACZ;AAAA,QACA,gBAAgB;AAAA,QAChB,gBAAgB;AAAA,MAClB;AACA,iBAAW,KAAK,UAAU;AACxB,mBAAW,KAAK;AAAA,UACd,cAAc,EAAE;AAAA,UAChB,WAAW;AAAA,UACX,OAAO,EAAE;AAAA,UACT,OAAO,EAAE;AAAA,UACT,UAAU,EAAE;AAAA,UACZ,gBAAgB,EAAE;AAAA,UAClB,kBAAkB,EAAE;AAAA,UACpB,SAAS,iCAAiC,EAAE,cAAc,EAAE,OAAO,gBAAgB;AAAA,QACrF,CAAC;AAAA,MACH;AAGA,YAAM,aAAa;AAAA,QACjB,KAAK,OAAO;AAAA,QACZ;AAAA,QACA,gBAAgB;AAAA,QAChB,gBAAgB;AAAA,MAClB;AACA,iBAAW,KAAK,YAAY;AAC1B,mBAAW,KAAK;AAAA,UACd,cAAc,EAAE;AAAA,UAChB,WAAW;AAAA,UACX,OAAO,EAAE;AAAA,UACT,OAAO,EAAE;AAAA,UACT,UAAU,EAAE;AAAA,UACZ,gBAAgB,EAAE;AAAA,UAClB,kBAAkB,EAAE;AAAA,UACpB,SAAS,iCAAiC,EAAE,cAAc,EAAE,OAAO,gBAAgB;AAAA,QACrF,CAAC;AAAA,MACH;AAAA,IACF;AAGA,eAAW,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAE3C,WAAO,6BAA6B,YAAY,gBAAgB,QAAQ;AAAA,EAC1E,SAAS,OAAO;AACd,QAAI,KAAK,8CAA8C,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAC/G,WAAO;AAAA,EACT;AACF;","names":[]}

package/dist/causal-trajectory-graph.d.ts

@@ -1,7 +1,7 @@
-import { a as GraphEdge } from './graph-444E-DrF.js';
+import { a as GraphEdge } from './graph-DRkl22KE.js';
 import { CausalTrajectoryRecord } from './causal-trajectory.js';
 import './capabilities.js';
-import './types-BRg3tMyp.js';
+import './types-YY-eKKU7.js';
 import './message-parts/index.js';
 import './bounded-jsonl-state.js';
 import './operator-doctor-types.js';
@@ -10,8 +10,11 @@ import './contradiction-config.js';
 import './graph-path-scoring-config.js';
 import './deep-recall-config.js';
 import './active-context-config.js';
+import './semantic-merge-config.js';
 import './types-continuity.js';
 import './objective-state.js';
+import './graph-write-lock.js';
+import './utils/serialize-mutations.js';
 
 type CausalTrajectoryGraphStage = "goal" | "action" | "observation" | "outcome" | "follow_up";
 declare function causalTrajectoryGraphNodeId(trajectoryId: string, stage: CausalTrajectoryGraphStage): string;

package/dist/causal-trajectory-graph.js

@@ -1,9 +1,13 @@
 import {
   appendEdge
-} from "./chunk-OLT3YTDH.js";
+} from "./chunk-5FAGCOZD.js";
+import "./chunk-EUT2WCWS.js";
+import "./chunk-2LSZVONP.js";
 import "./chunk-DEUNUKTD.js";
 import "./chunk-LXY5VVGM.js";
-import "./chunk-2LSZVONP.js";
+import "./chunk-GKCXTSFF.js";
+import "./chunk-FFAZ2XFU.js";
+import "./chunk-KNA3BXXL.js";
 import "./chunk-PZ5AY32C.js";
 
 // src/causal-trajectory-graph.ts

package/dist/causal-trajectory-graph.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/causal-trajectory-graph.ts"],"sourcesContent":["import { appendEdge, type GraphEdge } from \"./graph.js\";\nimport type { CausalTrajectoryRecord } from \"./causal-trajectory.js\";\n\nexport type CausalTrajectoryGraphStage = \"goal\" | \"action\" | \"observation\" | \"outcome\" | \"follow_up\";\n\nexport function causalTrajectoryGraphNodeId(trajectoryId: string, stage: CausalTrajectoryGraphStage): string {\n  return `causal-trajectory/${trajectoryId}#${stage}`;\n}\n\nexport function buildCausalTrajectoryGraphEdges(record: CausalTrajectoryRecord): GraphEdge[] {\n  const edges: GraphEdge[] = [\n    {\n      from: causalTrajectoryGraphNodeId(record.trajectoryId, \"goal\"),\n      to: causalTrajectoryGraphNodeId(record.trajectoryId, \"action\"),\n      type: \"causal\",\n      weight: 1.0,\n      label: \"goal_to_action\",\n      ts: record.recordedAt,\n    },\n    {\n      from: causalTrajectoryGraphNodeId(record.trajectoryId, \"action\"),\n      to: causalTrajectoryGraphNodeId(record.trajectoryId, \"observation\"),\n      type: \"causal\",\n      weight: 1.0,\n      label: \"action_to_observation\",\n      ts: record.recordedAt,\n    },\n    {\n      from: causalTrajectoryGraphNodeId(record.trajectoryId, \"observation\"),\n      to: causalTrajectoryGraphNodeId(record.trajectoryId, \"outcome\"),\n      type: \"causal\",\n      weight: 1.0,\n      label: `observation_to_outcome:${record.outcomeKind}`,\n      ts: record.recordedAt,\n    },\n  ];\n\n  if (record.followUpSummary) {\n    edges.push({\n      from: causalTrajectoryGraphNodeId(record.trajectoryId, \"outcome\"),\n      to: causalTrajectoryGraphNodeId(record.trajectoryId, \"follow_up\"),\n      type: \"causal\",\n      weight: 1.0,\n      label: \"outcome_to_follow_up\",\n      ts: record.recordedAt,\n    });\n  }\n\n  return edges;\n}\n\nexport async function appendCausalTrajectoryGraphEdges(options: {\n  memoryDir: string;\n  record: CausalTrajectoryRecord;\n}): Promise<void> {\n  const edges = buildCausalTrajectoryGraphEdges(options.record);\n  for (const edge of edges) {\n    await appendEdge(options.memoryDir, edge);\n  }\n}\n"],"mappings":";;;;;;;;;AAKO,SAAS,4BAA4B,cAAsB,OAA2C;AAC3G,SAAO,qBAAqB,YAAY,IAAI,KAAK;AACnD;AAEO,SAAS,gCAAgC,QAA6C;AAC3F,QAAM,QAAqB;AAAA,IACzB;AAAA,MACE,MAAM,4BAA4B,OAAO,cAAc,MAAM;AAAA,MAC7D,IAAI,4BAA4B,OAAO,cAAc,QAAQ;AAAA,MAC7D,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,IAAI,OAAO;AAAA,IACb;AAAA,IACA;AAAA,MACE,MAAM,4BAA4B,OAAO,cAAc,QAAQ;AAAA,MAC/D,IAAI,4BAA4B,OAAO,cAAc,aAAa;AAAA,MAClE,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,IAAI,OAAO;AAAA,IACb;AAAA,IACA;AAAA,MACE,MAAM,4BAA4B,OAAO,cAAc,aAAa;AAAA,MACpE,IAAI,4BAA4B,OAAO,cAAc,SAAS;AAAA,MAC9D,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO,0BAA0B,OAAO,WAAW;AAAA,MACnD,IAAI,OAAO;AAAA,IACb;AAAA,EACF;AAEA,MAAI,OAAO,iBAAiB;AAC1B,UAAM,KAAK;AAAA,MACT,MAAM,4BAA4B,OAAO,cAAc,SAAS;AAAA,MAChE,IAAI,4BAA4B,OAAO,cAAc,WAAW;AAAA,MAChE,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,IAAI,OAAO;AAAA,IACb,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,eAAsB,iCAAiC,SAGrC;AAChB,QAAM,QAAQ,gCAAgC,QAAQ,MAAM;AAC5D,aAAW,QAAQ,OAAO;AACxB,UAAM,WAAW,QAAQ,WAAW,IAAI;AAAA,EAC1C;AACF;","names":[]}
+{"version":3,"sources":["../src/causal-trajectory-graph.ts"],"sourcesContent":["import { appendEdge, type GraphEdge } from \"./graph.js\";\nimport type { CausalTrajectoryRecord } from \"./causal-trajectory.js\";\n\nexport type CausalTrajectoryGraphStage = \"goal\" | \"action\" | \"observation\" | \"outcome\" | \"follow_up\";\n\nexport function causalTrajectoryGraphNodeId(trajectoryId: string, stage: CausalTrajectoryGraphStage): string {\n  return `causal-trajectory/${trajectoryId}#${stage}`;\n}\n\nexport function buildCausalTrajectoryGraphEdges(record: CausalTrajectoryRecord): GraphEdge[] {\n  const edges: GraphEdge[] = [\n    {\n      from: causalTrajectoryGraphNodeId(record.trajectoryId, \"goal\"),\n      to: causalTrajectoryGraphNodeId(record.trajectoryId, \"action\"),\n      type: \"causal\",\n      weight: 1.0,\n      label: \"goal_to_action\",\n      ts: record.recordedAt,\n    },\n    {\n      from: causalTrajectoryGraphNodeId(record.trajectoryId, \"action\"),\n      to: causalTrajectoryGraphNodeId(record.trajectoryId, \"observation\"),\n      type: \"causal\",\n      weight: 1.0,\n      label: \"action_to_observation\",\n      ts: record.recordedAt,\n    },\n    {\n      from: causalTrajectoryGraphNodeId(record.trajectoryId, \"observation\"),\n      to: causalTrajectoryGraphNodeId(record.trajectoryId, \"outcome\"),\n      type: \"causal\",\n      weight: 1.0,\n      label: `observation_to_outcome:${record.outcomeKind}`,\n      ts: record.recordedAt,\n    },\n  ];\n\n  if (record.followUpSummary) {\n    edges.push({\n      from: causalTrajectoryGraphNodeId(record.trajectoryId, \"outcome\"),\n      to: causalTrajectoryGraphNodeId(record.trajectoryId, \"follow_up\"),\n      type: \"causal\",\n      weight: 1.0,\n      label: \"outcome_to_follow_up\",\n      ts: record.recordedAt,\n    });\n  }\n\n  return edges;\n}\n\nexport async function appendCausalTrajectoryGraphEdges(options: {\n  memoryDir: string;\n  record: CausalTrajectoryRecord;\n}): Promise<void> {\n  const edges = buildCausalTrajectoryGraphEdges(options.record);\n  for (const edge of edges) {\n    await appendEdge(options.memoryDir, edge);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AAKO,SAAS,4BAA4B,cAAsB,OAA2C;AAC3G,SAAO,qBAAqB,YAAY,IAAI,KAAK;AACnD;AAEO,SAAS,gCAAgC,QAA6C;AAC3F,QAAM,QAAqB;AAAA,IACzB;AAAA,MACE,MAAM,4BAA4B,OAAO,cAAc,MAAM;AAAA,MAC7D,IAAI,4BAA4B,OAAO,cAAc,QAAQ;AAAA,MAC7D,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,IAAI,OAAO;AAAA,IACb;AAAA,IACA;AAAA,MACE,MAAM,4BAA4B,OAAO,cAAc,QAAQ;AAAA,MAC/D,IAAI,4BAA4B,OAAO,cAAc,aAAa;AAAA,MAClE,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,IAAI,OAAO;AAAA,IACb;AAAA,IACA;AAAA,MACE,MAAM,4BAA4B,OAAO,cAAc,aAAa;AAAA,MACpE,IAAI,4BAA4B,OAAO,cAAc,SAAS;AAAA,MAC9D,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO,0BAA0B,OAAO,WAAW;AAAA,MACnD,IAAI,OAAO;AAAA,IACb;AAAA,EACF;AAEA,MAAI,OAAO,iBAAiB;AAC1B,UAAM,KAAK;AAAA,MACT,MAAM,4BAA4B,OAAO,cAAc,SAAS;AAAA,MAChE,IAAI,4BAA4B,OAAO,cAAc,WAAW;AAAA,MAChE,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,IAAI,OAAO;AAAA,IACb,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,eAAsB,iCAAiC,SAGrC;AAChB,QAAM,QAAQ,gCAAgC,QAAQ,MAAM;AAC5D,aAAW,QAAQ,OAAO;AACxB,UAAM,WAAW,QAAQ,WAAW,IAAI;AAAA,EAC1C;AACF;","names":[]}

package/dist/causal-trajectory.js

@@ -9,10 +9,11 @@ import {
   resolveCausalTrajectoryStoreDir,
   searchCausalTrajectories,
   validateCausalTrajectoryRecord
-} from "./chunk-2Z3DG5CQ.js";
+} from "./chunk-B3O3IRZN.js";
 import "./chunk-YCVB7X56.js";
 import "./chunk-A2IYSXDQ.js";
-import "./chunk-P77QX3ID.js";
+import "./chunk-B6O2YLUR.js";
+import "./chunk-KNA3BXXL.js";
 import "./chunk-PZ5AY32C.js";
 export {
   advanceCausalTrajectoryRevisionToken,

package/dist/{chunk-KTVSPFCQ.js → chunk-22FVR2KE.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-SOBJ6NEY.js";
 import {
   summarizeDisclosureTokens
-} from "./chunk-JOYC4RYC.js";
+} from "./chunk-2JVJ7UHC.js";
 import {
   summarizeRetrievedMemoryProvenance
 } from "./chunk-I4WBNM3M.js";
@@ -606,4 +606,4 @@ export {
   renderRecallExplain,
   parseRecallExplainFormat
 };
-//# sourceMappingURL=chunk-KTVSPFCQ.js.map
+//# sourceMappingURL=chunk-22FVR2KE.js.map

package/dist/{chunk-7Y5V3LAP.js → chunk-27QVNSQ3.js}

@@ -1,7 +1,7 @@
 import {
   SUPPORT_PASSPORT_DRAFT_MAX_CONTENT_CHARACTERS,
   SUPPORT_PASSPORT_DRAFT_MAX_MEMORIES
-} from "./chunk-NQFCLAYT.js";
+} from "./chunk-ICKJ52PE.js";
 import {
   SUPPORT_PASSPORT_SOURCE_MEMORY_ID_MAX_LENGTH
 } from "./chunk-EEOUMG3J.js";
@@ -343,4 +343,4 @@ export {
   parseSupportPassportModelJob,
   SupportPassportModelBridge
 };
-//# sourceMappingURL=chunk-7Y5V3LAP.js.map
+//# sourceMappingURL=chunk-27QVNSQ3.js.map

package/dist/{chunk-R7LY4YKF.js → chunk-2EKJDQZB.js}

@@ -1,6 +1,6 @@
 import {
   parseEntityFile
-} from "./chunk-OGTKQ5MJ.js";
+} from "./chunk-XSGUMQQQ.js";
 import {
   inferMemoryStatus
 } from "./chunk-7RJUVTVF.js";
@@ -253,4 +253,4 @@ export {
   WHO_KNOWS_MCP_TOOLS,
   handleWhoKnowsHttpQuery
 };
-//# sourceMappingURL=chunk-R7LY4YKF.js.map
+//# sourceMappingURL=chunk-2EKJDQZB.js.map

package/dist/{chunk-FCATYKQA.js → chunk-2IOHTUP3.js}

@@ -15,10 +15,10 @@ import {
   PRE_ACTION_GATE_DEFAULT_TIMEOUT_MS,
   normalizeActionIntent,
   sanitizePayloadString
-} from "./chunk-TA7UZZMW.js";
+} from "./chunk-Z3O53WZR.js";
 import {
   parseSubjectRuntimeConfig
-} from "./chunk-SN4JXNLL.js";
+} from "./chunk-H3TKENU4.js";
 import {
   cloneDefaultSessionObserverBands
 } from "./chunk-Z5LAYHGJ.js";
@@ -35,13 +35,13 @@ import {
 import {
   parseExternalWikiRoots
 } from "./chunk-NLDVVWCL.js";
-import {
-  parseDependencyPropagationConfig
-} from "./chunk-VUDMT5CP.js";
 import {
   resolveEmitLegacyTools,
   resolveNamespaceCatalogEnabled
 } from "./chunk-OO42R444.js";
+import {
+  parseDependencyPropagationConfig
+} from "./chunk-VUDMT5CP.js";
 import {
   parseDeepRecallConfig
 } from "./chunk-M6RORUO5.js";
@@ -66,6 +66,9 @@ import {
 import {
   parseActiveContextFields
 } from "./chunk-B32WYRXX.js";
+import {
+  MEMORY_CATEGORIES
+} from "./chunk-QLK3SL7Q.js";
 import {
   parseCodingKnowledgeConfig
 } from "./chunk-FEHIOYML.js";
@@ -96,9 +99,15 @@ import {
 import {
   parseConvergeConfig
 } from "./chunk-6MINUTGJ.js";
+import {
+  isActiveMemoryStatus
+} from "./chunk-7RJUVTVF.js";
+import {
+  sanitizeMemoryContent
+} from "./chunk-5GKPFL3S.js";
 import {
   parseOfflineSyncExcludes
-} from "./chunk-3Q6RD76J.js";
+} from "./chunk-WQZZDN5M.js";
 import {
   expandTildePath
 } from "./chunk-EYIEWJNI.js";
@@ -262,6 +271,17 @@ function parseDriftDetectionConfig(raw) {
   };
 }
 
+// src/dedup/connector-scope.ts
+function normalizeConnectorScope(value) {
+  if (typeof value !== "string") return void 0;
+  const trimmed = value.trim();
+  return trimmed.length > 0 ? trimmed : void 0;
+}
+function connectorMatchesScope(neighborConnector, scope) {
+  if (scope === void 0) return true;
+  return normalizeConnectorScope(neighborConnector) === scope;
+}
+
 // src/dedup/novelty-gate.ts
 var DEFAULT_NOVELTY_ADD_THRESHOLD = 0.55;
 var DEFAULT_NOVELTY_NOOP_THRESHOLD = 0.15;
@@ -287,6 +307,9 @@ function cosine(a, b) {
   if (raw > 1) return 1;
   return raw;
 }
+function semanticDedupThresholdFrom(cfg) {
+  return clamp01(coerceNumber(cfg.semanticDedupThreshold, "semanticDedupThreshold"), 0.92);
+}
 function parseWritePathDedupConfig(cfg) {
   const rawCandidates = coerceNumber(cfg.semanticDedupCandidates, "semanticDedupCandidates");
   let semanticDedupCandidates = 5;
@@ -296,10 +319,7 @@ function parseWritePathDedupConfig(cfg) {
   }
   return {
     semanticDedupEnabled: coerceBooleanLike(cfg.semanticDedupEnabled, "semanticDedupEnabled") !== false,
-    semanticDedupThreshold: clamp01(
-      coerceNumber(cfg.semanticDedupThreshold, "semanticDedupThreshold"),
-      0.92
-    ),
+    semanticDedupThreshold: semanticDedupThresholdFrom(cfg),
     semanticDedupCandidates,
     noveltyGateEnabled: coerceBooleanLike(cfg.noveltyGateEnabled, "noveltyGateEnabled") === true,
     noveltyAddThreshold: clamp01(
@@ -313,8 +333,8 @@ function parseWritePathDedupConfig(cfg) {
   };
 }
 function embeddingsFromCosineHits(hits, opts = {}) {
-  const candidateConnector = opts.candidateConnector?.trim() || void 0;
-  const scoped = candidateConnector ? hits.filter((hit) => (hit.sourceConnector?.trim() || void 0) === candidateConnector) : hits;
+  const scope = normalizeConnectorScope(opts.candidateConnector);
+  const scoped = hits.filter((hit) => connectorMatchesScope(hit.sourceConnector, scope));
   return {
     embedding: [1, 0],
     neighborhood: scoped.map((hit) => {
@@ -357,6 +377,231 @@ async function applyNoveltyGate(opts) {
   }
 }
 
+// src/dedup/merge-min-score.ts
+function describeValue(value) {
+  try {
+    const serialized = JSON.stringify(value);
+    return serialized === void 0 ? String(value) : serialized;
+  } catch {
+    return String(value);
+  }
+}
+function parseMinMergeScore(value) {
+  if (typeof value !== "number" || !Number.isFinite(value) || value < 0 || value > 1) {
+    throw new RangeError(
+      `merge minScore must be a finite number in [0, 1]; got ${describeValue(value)}`
+    );
+  }
+  return value;
+}
+
+// src/dedup/merge-on-write.ts
+var REFUSED_MERGE_CATEGORIES = [
+  "procedure",
+  "reasoning_trace",
+  "moment",
+  "correction"
+];
+
+// src/dedup/merge-content.ts
+var MERGE_CONTENT_LENGTH_FACTOR = 4;
+function requireString(value, field) {
+  if (typeof value !== "string") {
+    throw new RangeError(`merge ${field} must be a string`);
+  }
+  return value;
+}
+function checkMergedContent(input) {
+  const incoming = requireString(input.incomingContent, "incomingContent");
+  const target = requireString(input.targetContent, "targetContent");
+  const limit = MERGE_CONTENT_LENGTH_FACTOR * (incoming.length + target.length);
+  const merged = input.mergedContent;
+  if (typeof merged !== "string" || merged.trim() === "") {
+    return { ok: false, reason: "empty", limit };
+  }
+  if (!sanitizeMemoryContent(merged).clean) {
+    return { ok: false, reason: "unsafe", limit };
+  }
+  if (merged.length > limit) {
+    return { ok: false, reason: "oversized", limit };
+  }
+  return { ok: true, content: merged };
+}
+
+// src/dedup/merge.ts
+function compareMergeCandidates(a, b) {
+  if (a.similarity !== b.similarity) return b.similarity - a.similarity;
+  return a.memoryId < b.memoryId ? -1 : a.memoryId > b.memoryId ? 1 : 0;
+}
+async function decideSemanticMerge(options) {
+  const { config } = options;
+  if (config.enabled !== true) return { action: "create", reason: "disabled" };
+  if (!(config.maxCandidates > 0)) return { action: "create", reason: "disabled" };
+  if (!config.categories.includes(options.category)) {
+    return { action: "create", reason: "disabled" };
+  }
+  const trimmed = typeof options.content === "string" ? options.content.trim() : "";
+  if (!trimmed) return { action: "create", reason: "no_candidates" };
+  let hits;
+  try {
+    hits = await options.lookup(trimmed, config.maxCandidates * CANDIDATE_OVERFETCH_FACTOR);
+  } catch {
+    return { action: "create", reason: "backend_unavailable" };
+  }
+  if (!Array.isArray(hits) || hits.length === 0) {
+    return { action: "create", reason: "no_candidates" };
+  }
+  const scope = normalizeConnectorScope(options.sourceConnector);
+  const candidates = [];
+  for (const hit of hits) {
+    if (!hit || typeof hit.id !== "string" || hit.id.trim().length === 0 || typeof hit.score !== "number" || !Number.isFinite(hit.score)) {
+      continue;
+    }
+    if (!(hit.score >= config.minSimilarity && hit.score < options.dedupThreshold)) {
+      continue;
+    }
+    if (normalizeConnectorScope(hit.sourceConnector) !== scope) continue;
+    const meta = await options.resolveCandidate(hit.id);
+    if (!meta) continue;
+    if (meta.category !== options.category) continue;
+    if (!isActiveMemoryStatus(meta.status)) continue;
+    candidates.push({
+      memoryId: hit.id,
+      content: meta.content,
+      category: meta.category,
+      similarity: hit.score,
+      status: meta.status
+    });
+  }
+  if (candidates.length === 0) return { action: "create", reason: "no_candidates" };
+  candidates.sort(compareMergeCandidates);
+  const limited = candidates.slice(0, config.maxCandidates);
+  let verdict;
+  try {
+    verdict = await options.judge({
+      content: trimmed,
+      category: options.category,
+      candidates: limited
+    });
+  } catch {
+    return { action: "create", reason: "judge_error" };
+  }
+  if (!verdict || typeof verdict !== "object") {
+    return { action: "create", reason: "judge_invalid" };
+  }
+  if (verdict.decision === "create") return { action: "create", reason: "judge_create" };
+  if (verdict.decision === "contradicts") return { action: "create", reason: "judge_contradicts" };
+  const target = typeof verdict.targetId === "string" ? limited.find((c) => c.memoryId === verdict.targetId) : void 0;
+  if (!target) return { action: "create", reason: "judge_invalid" };
+  const content = checkMergedContent({
+    mergedContent: verdict.mergedContent,
+    incomingContent: trimmed,
+    targetContent: target.content
+  });
+  if (!content.ok) return { action: "create", reason: "judge_invalid" };
+  return {
+    action: "merge",
+    targetId: target.memoryId,
+    mergedContent: content.content,
+    targetContent: target.content,
+    reason: "judge_merge"
+  };
+}
+var DEFAULT_SEMANTIC_MERGE_CATEGORIES = [
+  "fact",
+  "preference",
+  "decision",
+  "relationship",
+  "skill"
+];
+var MERGEABLE_MEMORY_CATEGORIES = MEMORY_CATEGORIES.filter(
+  (category) => !REFUSED_MERGE_CATEGORIES.includes(category)
+);
+var DEFAULT_SEMANTIC_MERGE_MIN = 0.8;
+var DEFAULT_SEMANTIC_MERGE_CANDIDATES = 3;
+var CANDIDATE_OVERFETCH_FACTOR = 4;
+function describeValue2(value) {
+  try {
+    const serialized = JSON.stringify(value);
+    return serialized === void 0 ? String(value) : serialized;
+  } catch {
+    return String(value);
+  }
+}
+function parseSemanticMergeConfig(cfg) {
+  const blockPresent = Object.hasOwn(cfg, "semanticMerge");
+  const block = blockPresent ? cfg.semanticMerge : void 0;
+  if (block !== void 0 && (typeof block !== "object" || block === null || Array.isArray(block))) {
+    throw new Error(
+      `semanticMerge must be an object when present (got ${describeValue2(block)}). Remove the block to fall back to the defaults.`
+    );
+  }
+  if (blockPresent && block === void 0) {
+    throw new Error(
+      `semanticMerge must be an object when present (got ${describeValue2(block)}). Remove the key to fall back to the defaults.`
+    );
+  }
+  const raw = block ?? {};
+  const parseGate = (key, fallback) => {
+    if (!Object.hasOwn(raw, key)) return fallback;
+    const value = raw[key];
+    const coerced = coerceBool(value, `semanticMerge.${key}`);
+    if (coerced === void 0) {
+      throw new Error(
+        `semanticMerge.${key} must be a boolean or one of "true"/"false"/"1"/"0"/"yes"/"no"/"on"/"off" (got ${describeValue2(value)}).`
+      );
+    }
+    return coerced;
+  };
+  const minSimilarityPresent = Object.hasOwn(raw, "minSimilarity");
+  const minSimilarity = minSimilarityPresent ? parseMinMergeScore(raw.minSimilarity) : DEFAULT_SEMANTIC_MERGE_MIN;
+  const maxCandidates = (() => {
+    if (!Object.hasOwn(raw, "maxCandidates")) return DEFAULT_SEMANTIC_MERGE_CANDIDATES;
+    const rawCandidatesValue = raw.maxCandidates;
+    const rawCandidates = coerceNumber(rawCandidatesValue, "semanticMerge.maxCandidates");
+    if (rawCandidates === void 0 || !Number.isInteger(rawCandidates) || rawCandidates < 0) {
+      throw new Error(
+        `semanticMerge.maxCandidates must be an integer >= 0 (got ${describeValue2(rawCandidatesValue)}). Remove the key to use the default (${DEFAULT_SEMANTIC_MERGE_CANDIDATES}) or set 0 to disable merging entirely.`
+      );
+    }
+    return rawCandidates;
+  })();
+  const categories = (() => {
+    if (!Object.hasOwn(raw, "categories")) return [...DEFAULT_SEMANTIC_MERGE_CATEGORIES];
+    const rawCategories = raw.categories;
+    if (!Array.isArray(rawCategories) || !rawCategories.every((c) => typeof c === "string" && c.length > 0)) {
+      throw new Error(
+        `semanticMerge.categories must be an array of non-empty category names (got ${describeValue2(rawCategories)}).`
+      );
+    }
+    const invalidCategory = rawCategories.find(
+      (c) => !MERGEABLE_MEMORY_CATEGORIES.includes(c)
+    );
+    if (invalidCategory !== void 0) {
+      throw new Error(
+        `semanticMerge.categories contains an unknown or never-mergeable category: ${describeValue2(invalidCategory)}. Valid categories: ${MERGEABLE_MEMORY_CATEGORIES.join(", ")}. The episodic and immutable categories (${REFUSED_MERGE_CATEGORIES.join(", ")}) never merge and cannot be listed.`
+      );
+    }
+    return [...rawCategories];
+  })();
+  const enabled = parseGate("enabled", false);
+  const dedupThreshold = semanticDedupThresholdFrom(cfg);
+  if ((enabled || minSimilarityPresent) && minSimilarity >= dedupThreshold) {
+    throw new Error(
+      `semanticMerge.minSimilarity (${minSimilarity}) must be strictly below semanticDedupThreshold (${dedupThreshold}) \u2014 the near-duplicate skip path owns similarities at or above it.`
+    );
+  }
+  return {
+    semanticMerge: {
+      enabled,
+      minSimilarity,
+      maxCandidates,
+      categories,
+      shadowMode: parseGate("shadowMode", false)
+    }
+  };
+}
+
 // src/wearables/config.ts
 var KNOWN_WEARABLE_SOURCE_IDS = ["limitless", "bee", "omi"];
 var MEMORY_MODES = ["off", "review", "auto", "smart"];
@@ -3674,6 +3919,7 @@ function parseConfig(raw, rawOperatorConfig, runtimeSet) {
     // v6.0 Fact deduplication & archival
     factDeduplicationEnabled: cfg.factDeduplicationEnabled !== false,
     ...parseWritePathDedupConfig(cfg),
+    ...parseSemanticMergeConfig(cfg),
     factArchivalEnabled: cfg.factArchivalEnabled === true,
     factArchivalAgeDays: typeof cfg.factArchivalAgeDays === "number" ? cfg.factArchivalAgeDays : 90,
     factArchivalMaxImportance: typeof cfg.factArchivalMaxImportance === "number" ? cfg.factArchivalMaxImportance : 0.3,
@@ -4514,8 +4760,12 @@ function parseTrustScoreWeights(value) {
 export {
   DRIFT_DETECTION_DEFAULTS,
   parseDriftDetectionConfig,
+  normalizeConnectorScope,
+  connectorMatchesScope,
   embeddingsFromCosineHits,
   applyNoveltyGate,
+  REFUSED_MERGE_CATEGORIES,
+  decideSemanticMerge,
   KNOWN_WEARABLE_SOURCE_IDS,
   defaultWearableCleanupSettings,
   defaultWearableSourceSettings,
@@ -4542,4 +4792,4 @@ export {
   VALID_MEMORY_CATEGORIES,
   parseConfig
 };
-//# sourceMappingURL=chunk-FCATYKQA.js.map
+//# sourceMappingURL=chunk-2IOHTUP3.js.map