@remnic/core 9.3.596 → 9.3.598

package/dist/{chunk-TYICDVQW.js → chunk-BDCCWRHR.js}

@@ -3,16 +3,16 @@ import {
 } from "./chunk-AU7Q3LSC.js";
 import {
   EngramMcpServer
-} from "./chunk-LYPDMKUT.js";
+} from "./chunk-CL3MWNNQ.js";
 import {
   EngramAccessInputError
-} from "./chunk-5BUGGPBR.js";
+} from "./chunk-WZA5Y6AC.js";
 import {
   projectTagProjectId
 } from "./chunk-EDQVAMQI.js";
 import {
   isTrustZoneName
-} from "./chunk-472U7RDF.js";
+} from "./chunk-JGSKJHF7.js";
 import {
   subscribeGraphEvents
 } from "./chunk-DEUNUKTD.js";
@@ -1846,4 +1846,4 @@ var EngramAccessHttpServer = class {
 export {
   EngramAccessHttpServer
 };
-//# sourceMappingURL=chunk-TYICDVQW.js.map
+//# sourceMappingURL=chunk-BDCCWRHR.js.map

package/dist/{chunk-LYPDMKUT.js → chunk-CL3MWNNQ.js}

@@ -11,7 +11,7 @@ import {
 } from "./chunk-D24OXEPB.js";
 import {
   EngramAccessInputError
-} from "./chunk-5BUGGPBR.js";
+} from "./chunk-WZA5Y6AC.js";
 import {
   projectTagProjectId
 } from "./chunk-EDQVAMQI.js";
@@ -2860,4 +2860,4 @@ ${body}`;
 export {
   EngramMcpServer
 };
-//# sourceMappingURL=chunk-LYPDMKUT.js.map
+//# sourceMappingURL=chunk-CL3MWNNQ.js.map

package/dist/{chunk-YQMZ7IH2.js → chunk-D4KJ74JJ.js}

@@ -3,11 +3,10 @@ import {
 } from "./chunk-HQ6NIBL6.js";
 import {
   resolveCausalTrajectoryStoreDir
-} from "./chunk-LMPHTYJC.js";
+} from "./chunk-ZZYF3BUL.js";
 import {
-  countRecallTokenOverlap,
   normalizeRecallTokens
-} from "./chunk-DT5TVLJE.js";
+} from "./chunk-ZBJMUXZH.js";
 import {
   log
 } from "./chunk-2ODBA7MQ.js";
@@ -23,9 +22,9 @@ import {
 } from "./chunk-LPSF4OQH.js";
 
 // src/causal-chain.ts
-import path from "path";
-import { mkdir, readFile, writeFile } from "fs/promises";
 import { createHash } from "crypto";
+import { mkdir, readFile, writeFile } from "fs/promises";
+import path from "path";
 var STITCH_WEIGHTS = {
   followUpToGoal: 4,
   outcomeToGoal: 2,
@@ -33,6 +32,52 @@ var STITCH_WEIGHTS = {
   tagOverlap: 1.5,
   temporalProximity: 1
 };
+function hasUnsegmentableRecallChar(token) {
+  if (token.includes("\u30FC") || token.includes("\uFF70")) return true;
+  return /[\p{Script=Han}\p{Script=Hiragana}\p{Script=Katakana}]/u.test(token);
+}
+function extractUnsegmentableStitchPhrases(value) {
+  const phrases = /* @__PURE__ */ new Set();
+  let segment = "";
+  const flushSegment = () => {
+    if ([...segment].length >= 4) {
+      phrases.add(segment);
+    }
+    segment = "";
+  };
+  for (const ch of value.toLowerCase().normalize("NFC")) {
+    if (hasUnsegmentableRecallChar(ch)) {
+      segment += ch;
+      continue;
+    }
+    if (/\p{M}/u.test(ch) && segment.length > 0) {
+      segment += ch;
+      continue;
+    }
+    if (/\s/u.test(ch) && segment.length > 0) {
+      continue;
+    }
+    flushSegment();
+  }
+  flushSegment();
+  return [...phrases];
+}
+function normalizeStitchLexicalTokens(value, extraStopWords = []) {
+  const tokens = new Set(
+    normalizeRecallTokens(value, extraStopWords).filter((token) => !hasUnsegmentableRecallChar(token))
+  );
+  for (const phrase of extractUnsegmentableStitchPhrases(value)) {
+    tokens.add(phrase);
+  }
+  return [...tokens];
+}
+function countTokenSetOverlap(queryTokens, valueTokens) {
+  let matches = 0;
+  for (const token of queryTokens) {
+    if (valueTokens.has(token)) matches += 1;
+  }
+  return matches;
+}
 function validateCausalEdge(raw) {
   if (!isRecord(raw)) throw new Error("CausalEdge must be an object");
   if (raw.schemaVersion !== 1) throw new Error("CausalEdge.schemaVersion must be 1");
@@ -58,9 +103,7 @@ function validateCausalEdge(raw) {
     stitchMethod,
     createdAt: assertIsoRecordedAt(assertString(raw.createdAt, "createdAt")),
     metadata: isRecord(raw.metadata) ? Object.fromEntries(
-      Object.entries(raw.metadata).filter(
-        (entry) => typeof entry[1] === "string"
-      )
+      Object.entries(raw.metadata).filter((entry) => typeof entry[1] === "string")
     ) : void 0
   };
 }
@@ -138,12 +181,11 @@ function scoreStitchCandidate(newTrajectory, candidate) {
   let score = 0;
   let dominantMethod = "lexical";
   let maxComponent = 0;
-  const newFollowUpTokens = new Set(
-    normalizeRecallTokens(newTrajectory.followUpSummary ?? "", [])
-  );
-  const candidateGoalTokens = normalizeRecallTokens(candidate.goal, []);
+  const newFollowUpTokens = new Set(normalizeStitchLexicalTokens(newTrajectory.followUpSummary ?? "", []));
+  const candidateGoalTokens = normalizeStitchLexicalTokens(candidate.goal, []);
+  const candidateGoalTokenSet = new Set(candidateGoalTokens);
   if (newFollowUpTokens.size > 0 && candidateGoalTokens.length > 0) {
-    const overlap = countRecallTokenOverlap(newFollowUpTokens, candidate.goal, []);
+    const overlap = countTokenSetOverlap(newFollowUpTokens, candidateGoalTokenSet);
     const normalized = overlap / Math.max(newFollowUpTokens.size, candidateGoalTokens.length);
     const component = normalized * STITCH_WEIGHTS.followUpToGoal;
     score += component;
@@ -152,12 +194,11 @@ function scoreStitchCandidate(newTrajectory, candidate) {
       dominantMethod = "lexical";
     }
   }
-  const candidateFollowUpTokens = new Set(
-    normalizeRecallTokens(candidate.followUpSummary ?? "", [])
-  );
-  const newGoalTokens = normalizeRecallTokens(newTrajectory.goal, []);
+  const candidateFollowUpTokens = new Set(normalizeStitchLexicalTokens(candidate.followUpSummary ?? "", []));
+  const newGoalTokens = normalizeStitchLexicalTokens(newTrajectory.goal, []);
+  const newGoalTokenSet = new Set(newGoalTokens);
   if (candidateFollowUpTokens.size > 0 && newGoalTokens.length > 0) {
-    const overlap = countRecallTokenOverlap(candidateFollowUpTokens, newTrajectory.goal, []);
+    const overlap = countTokenSetOverlap(candidateFollowUpTokens, newGoalTokenSet);
     const normalized = overlap / Math.max(candidateFollowUpTokens.size, newGoalTokens.length);
     const component = normalized * 3;
     score += component;
@@ -166,11 +207,9 @@ function scoreStitchCandidate(newTrajectory, candidate) {
       dominantMethod = "lexical";
     }
   }
-  const newOutcomeTokens = new Set(
-    normalizeRecallTokens(newTrajectory.outcomeSummary, [])
-  );
+  const newOutcomeTokens = new Set(normalizeStitchLexicalTokens(newTrajectory.outcomeSummary, []));
   if (newOutcomeTokens.size > 0) {
-    const overlap = countRecallTokenOverlap(newOutcomeTokens, candidate.goal, []);
+    const overlap = countTokenSetOverlap(newOutcomeTokens, candidateGoalTokenSet);
     const normalized = overlap / Math.max(newOutcomeTokens.size, candidateGoalTokens.length || 1);
     const component = normalized * STITCH_WEIGHTS.outcomeToGoal;
     score += component;
@@ -214,16 +253,15 @@ function scoreStitchCandidate(newTrajectory, candidate) {
     }
   }
   let edgeType = "continuation";
-  const goalTokens = new Set(normalizeRecallTokens(newTrajectory.goal, []));
-  const candidateGoalSet = new Set(candidateGoalTokens);
-  const goalOverlap = [...goalTokens].filter((t) => candidateGoalSet.has(t)).length;
+  const goalTokens = new Set(newGoalTokens);
+  const goalOverlap = countTokenSetOverlap(goalTokens, candidateGoalTokenSet);
   const goalSimilarity = goalTokens.size > 0 ? goalOverlap / goalTokens.size : 0;
   if (goalSimilarity > 0.7 && candidate.outcomeKind === "failure") {
     edgeType = "retry";
   } else if (goalSimilarity > 0.7 && newTrajectory.outcomeKind !== candidate.outcomeKind) {
     edgeType = "correction";
   } else if (newFollowUpTokens.size > 0 && candidateGoalTokens.length > 0) {
-    const followUpGoalOverlap = countRecallTokenOverlap(newFollowUpTokens, candidate.goal, []);
+    const followUpGoalOverlap = countTokenSetOverlap(newFollowUpTokens, candidateGoalTokenSet);
     if (followUpGoalOverlap > 0) {
       edgeType = "follow_up_to_goal";
     }
@@ -301,4 +339,4 @@ export {
   scoreStitchCandidate,
   stitchCausalChain
 };
-//# sourceMappingURL=chunk-YQMZ7IH2.js.map
+//# sourceMappingURL=chunk-D4KJ74JJ.js.map

package/dist/chunk-D4KJ74JJ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/causal-chain.ts"],"sourcesContent":["/**\n * causal-chain.ts — Cross-session causal chain persistence for CMC.\n *\n * Stitches causal trajectories across session boundaries by detecting\n * when a trajectory in one session follows up on a trajectory from\n * another session. Persists edges in a graph index for later retrieval.\n */\n\nimport { createHash } from \"node:crypto\";\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { topicOverlapScore } from \"./boxes.js\";\nimport { type CausalTrajectoryRecord, resolveCausalTrajectoryStoreDir } from \"./causal-trajectory.js\";\nimport { listJsonFiles, readJsonFile } from \"./json-store.js\";\nimport { log } from \"./logger.js\";\nimport { normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport { assertIsoRecordedAt, assertString, isRecord, recordStoreDay } from \"./store-contract.js\";\n\n// ─── Types ───────────────────────────────────────────────────────────────────\n\nexport interface CausalEdge {\n  schemaVersion: 1;\n  edgeId: string;\n  fromTrajectoryId: string;\n  toTrajectoryId: string;\n  edgeType: \"follow_up_to_goal\" | \"retry\" | \"continuation\" | \"correction\";\n  confidence: number;\n  stitchMethod: \"lexical\" | \"entity\" | \"temporal\" | \"explicit\";\n  createdAt: string;\n  metadata?: Record<string, string>;\n}\n\nexport interface CausalChainIndex {\n  outgoing: Record<string, string[]>;\n  incoming: Record<string, string[]>;\n  edges: Record<string, CausalEdge>;\n  updatedAt: string;\n}\n\nexport interface StitchConfig {\n  lookbackDays: number;\n  minScore: number;\n  maxEdgesPerTrajectory: number;\n}\n\nexport interface StitchCandidate {\n  trajectory: CausalTrajectoryRecord;\n  score: number;\n  edgeType: CausalEdge[\"edgeType\"];\n  stitchMethod: CausalEdge[\"stitchMethod\"];\n}\n\n// ─── Scoring Weights ─────────────────────────────────────────────────────────\n\nconst STITCH_WEIGHTS = {\n  followUpToGoal: 4.0,\n  outcomeToGoal: 2.0,\n  entityOverlap: 3.0,\n  tagOverlap: 1.5,\n  temporalProximity: 1.0,\n} as const;\n\nfunction hasUnsegmentableRecallChar(token: string): boolean {\n  if (token.includes(\"ー\") || token.includes(\"ｰ\")) return true;\n  return /[\\p{Script=Han}\\p{Script=Hiragana}\\p{Script=Katakana}]/u.test(token);\n}\n\nfunction extractUnsegmentableStitchPhrases(value: string): string[] {\n  const phrases = new Set<string>();\n  let segment = \"\";\n\n  const flushSegment = () => {\n    if ([...segment].length >= 4) {\n      phrases.add(segment);\n    }\n    segment = \"\";\n  };\n\n  for (const ch of value.toLowerCase().normalize(\"NFC\")) {\n    if (hasUnsegmentableRecallChar(ch)) {\n      segment += ch;\n      continue;\n    }\n    if (/\\p{M}/u.test(ch) && segment.length > 0) {\n      segment += ch;\n      continue;\n    }\n    if (/\\s/u.test(ch) && segment.length > 0) {\n      continue;\n    }\n    flushSegment();\n  }\n  flushSegment();\n\n  return [...phrases];\n}\n\nfunction normalizeStitchLexicalTokens(value: string, extraStopWords: string[] = []): string[] {\n  const tokens = new Set(\n    normalizeRecallTokens(value, extraStopWords).filter((token) => !hasUnsegmentableRecallChar(token))\n  );\n  for (const phrase of extractUnsegmentableStitchPhrases(value)) {\n    tokens.add(phrase);\n  }\n  return [...tokens];\n}\n\nfunction countTokenSetOverlap(queryTokens: Set<string>, valueTokens: Set<string>): number {\n  let matches = 0;\n  for (const token of queryTokens) {\n    if (valueTokens.has(token)) matches += 1;\n  }\n  return matches;\n}\n\n// ─── Validation ──────────────────────────────────────────────────────────────\n\nexport function validateCausalEdge(raw: unknown): CausalEdge {\n  if (!isRecord(raw)) throw new Error(\"CausalEdge must be an object\");\n  if (raw.schemaVersion !== 1) throw new Error(\"CausalEdge.schemaVersion must be 1\");\n\n  const edgeType = assertString(raw.edgeType, \"edgeType\");\n  const validEdgeTypes = [\"follow_up_to_goal\", \"retry\", \"continuation\", \"correction\"];\n  if (!validEdgeTypes.includes(edgeType)) {\n    throw new Error(`CausalEdge.edgeType must be one of ${validEdgeTypes.join(\", \")}`);\n  }\n\n  const stitchMethod = assertString(raw.stitchMethod, \"stitchMethod\");\n  const validMethods = [\"lexical\", \"entity\", \"temporal\", \"explicit\"];\n  if (!validMethods.includes(stitchMethod)) {\n    throw new Error(`CausalEdge.stitchMethod must be one of ${validMethods.join(\", \")}`);\n  }\n\n  const confidence = typeof raw.confidence === \"number\" ? raw.confidence : 0;\n  if (confidence < 0 || confidence > 1) throw new Error(\"CausalEdge.confidence must be in [0, 1]\");\n\n  return {\n    schemaVersion: 1,\n    edgeId: assertString(raw.edgeId, \"edgeId\"),\n    fromTrajectoryId: assertString(raw.fromTrajectoryId, \"fromTrajectoryId\"),\n    toTrajectoryId: assertString(raw.toTrajectoryId, \"toTrajectoryId\"),\n    edgeType: edgeType as CausalEdge[\"edgeType\"],\n    confidence: confidence,\n    stitchMethod: stitchMethod as CausalEdge[\"stitchMethod\"],\n    createdAt: assertIsoRecordedAt(assertString(raw.createdAt, \"createdAt\")),\n    metadata: isRecord(raw.metadata)\n      ? Object.fromEntries(\n          Object.entries(raw.metadata).filter((entry): entry is [string, string] => typeof entry[1] === \"string\")\n        )\n      : undefined,\n  };\n}\n\n// ─── Stable Edge ID ──────────────────────────────────────────────────────────\n\nexport function makeEdgeId(fromId: string, toId: string): string {\n  const digest = createHash(\"sha256\").update(`${fromId}\\0${toId}`).digest(\"hex\").slice(0, 12);\n  return `edge-${digest}`;\n}\n\n// ─── Storage Paths ───────────────────────────────────────────────────────────\n\nexport function resolveChainsDir(memoryDir: string, causalTrajectoryStoreDir?: string): string {\n  const root = resolveCausalTrajectoryStoreDir(memoryDir, causalTrajectoryStoreDir);\n  return path.join(root, \"chains\");\n}\n\nfunction chainIndexPath(chainsDir: string): string {\n  return path.join(chainsDir, \"chain-index.json\");\n}\n\nfunction edgeFilePath(chainsDir: string, edge: CausalEdge): string {\n  const day = recordStoreDay(edge.createdAt);\n  return path.join(chainsDir, \"edges\", day, `${edge.edgeId}.json`);\n}\n\n// ─── Chain Index CRUD ────────────────────────────────────────────────────────\n\nconst chainMutationQueues = new Map<string, Promise<unknown>>();\n\nfunction enqueueChainMutation<T>(chainsDir: string, op: () => Promise<T>): Promise<T> {\n  const key = path.resolve(chainsDir);\n  const previous = chainMutationQueues.get(key) ?? Promise.resolve();\n  const run = previous.catch(() => {}).then(op);\n  const settled = run.catch(() => {});\n  chainMutationQueues.set(key, settled);\n  void settled.finally(() => {\n    if (chainMutationQueues.get(key) === settled) {\n      chainMutationQueues.delete(key);\n    }\n  });\n  return run;\n}\n\nexport async function readChainIndex(chainsDir: string): Promise<CausalChainIndex> {\n  try {\n    const raw = JSON.parse(await readFile(chainIndexPath(chainsDir), \"utf8\"));\n    return {\n      outgoing: isRecord(raw.outgoing) ? (raw.outgoing as Record<string, string[]>) : {},\n      incoming: isRecord(raw.incoming) ? (raw.incoming as Record<string, string[]>) : {},\n      edges: isRecord(raw.edges) ? (raw.edges as Record<string, CausalEdge>) : {},\n      updatedAt: typeof raw.updatedAt === \"string\" ? raw.updatedAt : new Date().toISOString(),\n    };\n  } catch {\n    return { outgoing: {}, incoming: {}, edges: {}, updatedAt: new Date().toISOString() };\n  }\n}\n\nexport async function writeChainIndex(chainsDir: string, index: CausalChainIndex): Promise<void> {\n  await mkdir(chainsDir, { recursive: true });\n  index.updatedAt = new Date().toISOString();\n  await writeFile(chainIndexPath(chainsDir), JSON.stringify(index, null, 2), \"utf8\");\n}\n\nasync function persistEdge(chainsDir: string, edge: CausalEdge): Promise<string> {\n  const filePath = edgeFilePath(chainsDir, edge);\n  await mkdir(path.dirname(filePath), { recursive: true });\n  await writeFile(filePath, JSON.stringify(edge, null, 2), \"utf8\");\n  return filePath;\n}\n\nfunction addEdgeToIndex(index: CausalChainIndex, edge: CausalEdge): void {\n  if (!index.outgoing[edge.fromTrajectoryId]) {\n    index.outgoing[edge.fromTrajectoryId] = [];\n  }\n  if (!index.outgoing[edge.fromTrajectoryId].includes(edge.edgeId)) {\n    index.outgoing[edge.fromTrajectoryId].push(edge.edgeId);\n  }\n\n  if (!index.incoming[edge.toTrajectoryId]) {\n    index.incoming[edge.toTrajectoryId] = [];\n  }\n  if (!index.incoming[edge.toTrajectoryId].includes(edge.edgeId)) {\n    index.incoming[edge.toTrajectoryId].push(edge.edgeId);\n  }\n\n  index.edges[edge.edgeId] = edge;\n}\n\n// ─── Stitching Algorithm ─────────────────────────────────────────────────────\n\n/**\n * Score how strongly a candidate trajectory from another session\n * relates to the new trajectory being recorded.\n */\nexport function scoreStitchCandidate(\n  newTrajectory: CausalTrajectoryRecord,\n  candidate: CausalTrajectoryRecord\n): StitchCandidate {\n  let score = 0;\n  let dominantMethod: CausalEdge[\"stitchMethod\"] = \"lexical\";\n  let maxComponent = 0;\n\n  // 1. Follow-up → Goal match (token overlap)\n  const newFollowUpTokens = new Set(normalizeStitchLexicalTokens(newTrajectory.followUpSummary ?? \"\", []));\n  const candidateGoalTokens = normalizeStitchLexicalTokens(candidate.goal, []);\n  const candidateGoalTokenSet = new Set(candidateGoalTokens);\n  if (newFollowUpTokens.size > 0 && candidateGoalTokens.length > 0) {\n    const overlap = countTokenSetOverlap(newFollowUpTokens, candidateGoalTokenSet);\n    const normalized = overlap / Math.max(newFollowUpTokens.size, candidateGoalTokens.length);\n    const component = normalized * STITCH_WEIGHTS.followUpToGoal;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"lexical\";\n    }\n  }\n\n  // 1b. Candidate follow-up → New goal match (reverse direction)\n  const candidateFollowUpTokens = new Set(normalizeStitchLexicalTokens(candidate.followUpSummary ?? \"\", []));\n  const newGoalTokens = normalizeStitchLexicalTokens(newTrajectory.goal, []);\n  const newGoalTokenSet = new Set(newGoalTokens);\n  if (candidateFollowUpTokens.size > 0 && newGoalTokens.length > 0) {\n    const overlap = countTokenSetOverlap(candidateFollowUpTokens, newGoalTokenSet);\n    const normalized = overlap / Math.max(candidateFollowUpTokens.size, newGoalTokens.length);\n    const component = normalized * 3.0;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"lexical\";\n    }\n  }\n\n  // 2. Outcome → Goal match\n  const newOutcomeTokens = new Set(normalizeStitchLexicalTokens(newTrajectory.outcomeSummary, []));\n  if (newOutcomeTokens.size > 0) {\n    const overlap = countTokenSetOverlap(newOutcomeTokens, candidateGoalTokenSet);\n    const normalized = overlap / Math.max(newOutcomeTokens.size, candidateGoalTokens.length || 1);\n    const component = normalized * STITCH_WEIGHTS.outcomeToGoal;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"lexical\";\n    }\n  }\n\n  // 3. Entity overlap (Jaccard)\n  const newEntities = newTrajectory.entityRefs ?? [];\n  const candidateEntities = candidate.entityRefs ?? [];\n  if (newEntities.length > 0 && candidateEntities.length > 0) {\n    const entityJaccard = topicOverlapScore(newEntities, candidateEntities);\n    const component = entityJaccard * STITCH_WEIGHTS.entityOverlap;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"entity\";\n    }\n  }\n\n  // 4. Tag overlap (Jaccard)\n  const newTags = newTrajectory.tags ?? [];\n  const candidateTags = candidate.tags ?? [];\n  if (newTags.length > 0 && candidateTags.length > 0) {\n    const tagJaccard = topicOverlapScore(newTags, candidateTags);\n    const component = tagJaccard * STITCH_WEIGHTS.tagOverlap;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"lexical\";\n    }\n  }\n\n  // 5. Temporal proximity: 1/(1 + gapHours/24)\n  const newMs = Date.parse(newTrajectory.recordedAt);\n  const candidateMs = Date.parse(candidate.recordedAt);\n  if (Number.isFinite(newMs) && Number.isFinite(candidateMs)) {\n    const gapHours = Math.abs(newMs - candidateMs) / 3_600_000;\n    const proximity = 1 / (1 + gapHours / 24);\n    const component = proximity * STITCH_WEIGHTS.temporalProximity;\n    score += component;\n    if (component > maxComponent) {\n      maxComponent = component;\n      dominantMethod = \"temporal\";\n    }\n  }\n\n  // Determine edge type by heuristic\n  let edgeType: CausalEdge[\"edgeType\"] = \"continuation\";\n  const goalTokens = new Set(newGoalTokens);\n  const goalOverlap = countTokenSetOverlap(goalTokens, candidateGoalTokenSet);\n  const goalSimilarity = goalTokens.size > 0 ? goalOverlap / goalTokens.size : 0;\n\n  if (goalSimilarity > 0.7 && candidate.outcomeKind === \"failure\") {\n    edgeType = \"retry\";\n  } else if (goalSimilarity > 0.7 && newTrajectory.outcomeKind !== candidate.outcomeKind) {\n    edgeType = \"correction\";\n  } else if (newFollowUpTokens.size > 0 && candidateGoalTokens.length > 0) {\n    const followUpGoalOverlap = countTokenSetOverlap(newFollowUpTokens, candidateGoalTokenSet);\n    if (followUpGoalOverlap > 0) {\n      edgeType = \"follow_up_to_goal\";\n    }\n  }\n\n  return { trajectory: candidate, score, edgeType, stitchMethod: dominantMethod };\n}\n\n/**\n * Read trajectory records from the causal-trajectories store within\n * the lookback window, excluding the current session.\n */\nasync function readRecentTrajectories(\n  memoryDir: string,\n  causalTrajectoryStoreDir: string | undefined,\n  currentSessionKey: string,\n  lookbackDays: number\n): Promise<CausalTrajectoryRecord[]> {\n  const root = resolveCausalTrajectoryStoreDir(memoryDir, causalTrajectoryStoreDir);\n  const trajectoriesDir = path.join(root, \"trajectories\");\n\n  const files = await listJsonFiles(trajectoriesDir).catch(() => [] as string[]);\n  if (files.length === 0) return [];\n\n  const cutoff = Date.now() - lookbackDays * 86_400_000;\n  const results: CausalTrajectoryRecord[] = [];\n\n  for (const filePath of files) {\n    try {\n      const raw = await readJsonFile(filePath);\n      if (!isRecord(raw)) continue;\n      const sessionKey = typeof raw.sessionKey === \"string\" ? raw.sessionKey : \"\";\n      if (sessionKey === currentSessionKey) continue;\n      const recordedAt = typeof raw.recordedAt === \"string\" ? raw.recordedAt : \"\";\n      const ms = Date.parse(recordedAt);\n      if (!Number.isFinite(ms) || ms < cutoff) continue;\n      results.push(raw as unknown as CausalTrajectoryRecord);\n    } catch {\n      // skip invalid files\n    }\n  }\n\n  return results;\n}\n\n/**\n * After a new trajectory is recorded, attempt to stitch it to\n * existing trajectories from other sessions.\n */\nexport async function stitchCausalChain(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  newTrajectory: CausalTrajectoryRecord;\n  config: StitchConfig;\n}): Promise<CausalEdge[]> {\n  const { memoryDir, causalTrajectoryStoreDir, newTrajectory, config: stitchConfig } = options;\n  const chainsDir = resolveChainsDir(memoryDir, causalTrajectoryStoreDir);\n\n  const candidates = await readRecentTrajectories(\n    memoryDir,\n    causalTrajectoryStoreDir,\n    newTrajectory.sessionKey,\n    stitchConfig.lookbackDays\n  );\n\n  if (candidates.length === 0) return [];\n\n  const scored = candidates\n    .map((c) => scoreStitchCandidate(newTrajectory, c))\n    .filter((s) => s.score >= stitchConfig.minScore)\n    .sort((a, b) => b.score - a.score)\n    .slice(0, stitchConfig.maxEdgesPerTrajectory);\n\n  if (scored.length === 0) return [];\n\n  return enqueueChainMutation(chainsDir, async () => {\n    const index = await readChainIndex(chainsDir);\n    const newEdges: CausalEdge[] = [];\n\n    for (const candidate of scored) {\n      const edgeId = makeEdgeId(candidate.trajectory.trajectoryId, newTrajectory.trajectoryId);\n\n      // Skip if edge already exists\n      if (index.edges[edgeId]) continue;\n\n      const edge: CausalEdge = {\n        schemaVersion: 1,\n        edgeId,\n        fromTrajectoryId: candidate.trajectory.trajectoryId,\n        toTrajectoryId: newTrajectory.trajectoryId,\n        edgeType: candidate.edgeType,\n        confidence: Math.min(1, candidate.score / 10),\n        stitchMethod: candidate.stitchMethod,\n        createdAt: new Date().toISOString(),\n      };\n\n      addEdgeToIndex(index, edge);\n      await persistEdge(chainsDir, edge);\n      newEdges.push(edge);\n    }\n\n    if (newEdges.length > 0) {\n      await writeChainIndex(chainsDir, index);\n      log.debug(`[cmc] stitched ${newEdges.length} causal edge(s) for trajectory ${newTrajectory.trajectoryId}`);\n    }\n\n    return newEdges;\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAQA,SAAS,kBAAkB;AAC3B,SAAS,OAAO,UAAU,iBAAiB;AAC3C,OAAO,UAAU;AA4CjB,IAAM,iBAAiB;AAAA,EACrB,gBAAgB;AAAA,EAChB,eAAe;AAAA,EACf,eAAe;AAAA,EACf,YAAY;AAAA,EACZ,mBAAmB;AACrB;AAEA,SAAS,2BAA2B,OAAwB;AAC1D,MAAI,MAAM,SAAS,QAAG,KAAK,MAAM,SAAS,QAAG,EAAG,QAAO;AACvD,SAAO,0DAA0D,KAAK,KAAK;AAC7E;AAEA,SAAS,kCAAkC,OAAyB;AAClE,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,UAAU;AAEd,QAAM,eAAe,MAAM;AACzB,QAAI,CAAC,GAAG,OAAO,EAAE,UAAU,GAAG;AAC5B,cAAQ,IAAI,OAAO;AAAA,IACrB;AACA,cAAU;AAAA,EACZ;AAEA,aAAW,MAAM,MAAM,YAAY,EAAE,UAAU,KAAK,GAAG;AACrD,QAAI,2BAA2B,EAAE,GAAG;AAClC,iBAAW;AACX;AAAA,IACF;AACA,QAAI,SAAS,KAAK,EAAE,KAAK,QAAQ,SAAS,GAAG;AAC3C,iBAAW;AACX;AAAA,IACF;AACA,QAAI,MAAM,KAAK,EAAE,KAAK,QAAQ,SAAS,GAAG;AACxC;AAAA,IACF;AACA,iBAAa;AAAA,EACf;AACA,eAAa;AAEb,SAAO,CAAC,GAAG,OAAO;AACpB;AAEA,SAAS,6BAA6B,OAAe,iBAA2B,CAAC,GAAa;AAC5F,QAAM,SAAS,IAAI;AAAA,IACjB,sBAAsB,OAAO,cAAc,EAAE,OAAO,CAAC,UAAU,CAAC,2BAA2B,KAAK,CAAC;AAAA,EACnG;AACA,aAAW,UAAU,kCAAkC,KAAK,GAAG;AAC7D,WAAO,IAAI,MAAM;AAAA,EACnB;AACA,SAAO,CAAC,GAAG,MAAM;AACnB;AAEA,SAAS,qBAAqB,aAA0B,aAAkC;AACxF,MAAI,UAAU;AACd,aAAW,SAAS,aAAa;AAC/B,QAAI,YAAY,IAAI,KAAK,EAAG,YAAW;AAAA,EACzC;AACA,SAAO;AACT;AAIO,SAAS,mBAAmB,KAA0B;AAC3D,MAAI,CAAC,SAAS,GAAG,EAAG,OAAM,IAAI,MAAM,8BAA8B;AAClE,MAAI,IAAI,kBAAkB,EAAG,OAAM,IAAI,MAAM,oCAAoC;AAEjF,QAAM,WAAW,aAAa,IAAI,UAAU,UAAU;AACtD,QAAM,iBAAiB,CAAC,qBAAqB,SAAS,gBAAgB,YAAY;AAClF,MAAI,CAAC,eAAe,SAAS,QAAQ,GAAG;AACtC,UAAM,IAAI,MAAM,sCAAsC,eAAe,KAAK,IAAI,CAAC,EAAE;AAAA,EACnF;AAEA,QAAM,eAAe,aAAa,IAAI,cAAc,cAAc;AAClE,QAAM,eAAe,CAAC,WAAW,UAAU,YAAY,UAAU;AACjE,MAAI,CAAC,aAAa,SAAS,YAAY,GAAG;AACxC,UAAM,IAAI,MAAM,0CAA0C,aAAa,KAAK,IAAI,CAAC,EAAE;AAAA,EACrF;AAEA,QAAM,aAAa,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AACzE,MAAI,aAAa,KAAK,aAAa,EAAG,OAAM,IAAI,MAAM,yCAAyC;AAE/F,SAAO;AAAA,IACL,eAAe;AAAA,IACf,QAAQ,aAAa,IAAI,QAAQ,QAAQ;AAAA,IACzC,kBAAkB,aAAa,IAAI,kBAAkB,kBAAkB;AAAA,IACvE,gBAAgB,aAAa,IAAI,gBAAgB,gBAAgB;AAAA,IACjE;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,oBAAoB,aAAa,IAAI,WAAW,WAAW,CAAC;AAAA,IACvE,UAAU,SAAS,IAAI,QAAQ,IAC3B,OAAO;AAAA,MACL,OAAO,QAAQ,IAAI,QAAQ,EAAE,OAAO,CAAC,UAAqC,OAAO,MAAM,CAAC,MAAM,QAAQ;AAAA,IACxG,IACA;AAAA,EACN;AACF;AAIO,SAAS,WAAW,QAAgB,MAAsB;AAC/D,QAAM,SAAS,WAAW,QAAQ,EAAE,OAAO,GAAG,MAAM,KAAK,IAAI,EAAE,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AAC1F,SAAO,QAAQ,MAAM;AACvB;AAIO,SAAS,iBAAiB,WAAmB,0BAA2C;AAC7F,QAAM,OAAO,gCAAgC,WAAW,wBAAwB;AAChF,SAAO,KAAK,KAAK,MAAM,QAAQ;AACjC;AAEA,SAAS,eAAe,WAA2B;AACjD,SAAO,KAAK,KAAK,WAAW,kBAAkB;AAChD;AAEA,SAAS,aAAa,WAAmB,MAA0B;AACjE,QAAM,MAAM,eAAe,KAAK,SAAS;AACzC,SAAO,KAAK,KAAK,WAAW,SAAS,KAAK,GAAG,KAAK,MAAM,OAAO;AACjE;AAIA,IAAM,sBAAsB,oBAAI,IAA8B;AAE9D,SAAS,qBAAwB,WAAmB,IAAkC;AACpF,QAAM,MAAM,KAAK,QAAQ,SAAS;AAClC,QAAM,WAAW,oBAAoB,IAAI,GAAG,KAAK,QAAQ,QAAQ;AACjE,QAAM,MAAM,SAAS,MAAM,MAAM;AAAA,EAAC,CAAC,EAAE,KAAK,EAAE;AAC5C,QAAM,UAAU,IAAI,MAAM,MAAM;AAAA,EAAC,CAAC;AAClC,sBAAoB,IAAI,KAAK,OAAO;AACpC,OAAK,QAAQ,QAAQ,MAAM;AACzB,QAAI,oBAAoB,IAAI,GAAG,MAAM,SAAS;AAC5C,0BAAoB,OAAO,GAAG;AAAA,IAChC;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,eAAsB,eAAe,WAA8C;AACjF,MAAI;AACF,UAAM,MAAM,KAAK,MAAM,MAAM,SAAS,eAAe,SAAS,GAAG,MAAM,CAAC;AACxE,WAAO;AAAA,MACL,UAAU,SAAS,IAAI,QAAQ,IAAK,IAAI,WAAwC,CAAC;AAAA,MACjF,UAAU,SAAS,IAAI,QAAQ,IAAK,IAAI,WAAwC,CAAC;AAAA,MACjF,OAAO,SAAS,IAAI,KAAK,IAAK,IAAI,QAAuC,CAAC;AAAA,MAC1E,WAAW,OAAO,IAAI,cAAc,WAAW,IAAI,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,IACxF;AAAA,EACF,QAAQ;AACN,WAAO,EAAE,UAAU,CAAC,GAAG,UAAU,CAAC,GAAG,OAAO,CAAC,GAAG,YAAW,oBAAI,KAAK,GAAE,YAAY,EAAE;AAAA,EACtF;AACF;AAEA,eAAsB,gBAAgB,WAAmB,OAAwC;AAC/F,QAAM,MAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAC1C,QAAM,aAAY,oBAAI,KAAK,GAAE,YAAY;AACzC,QAAM,UAAU,eAAe,SAAS,GAAG,KAAK,UAAU,OAAO,MAAM,CAAC,GAAG,MAAM;AACnF;AAEA,eAAe,YAAY,WAAmB,MAAmC;AAC/E,QAAM,WAAW,aAAa,WAAW,IAAI;AAC7C,QAAM,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AACvD,QAAM,UAAU,UAAU,KAAK,UAAU,MAAM,MAAM,CAAC,GAAG,MAAM;AAC/D,SAAO;AACT;AAEA,SAAS,eAAe,OAAyB,MAAwB;AACvE,MAAI,CAAC,MAAM,SAAS,KAAK,gBAAgB,GAAG;AAC1C,UAAM,SAAS,KAAK,gBAAgB,IAAI,CAAC;AAAA,EAC3C;AACA,MAAI,CAAC,MAAM,SAAS,KAAK,gBAAgB,EAAE,SAAS,KAAK,MAAM,GAAG;AAChE,UAAM,SAAS,KAAK,gBAAgB,EAAE,KAAK,KAAK,MAAM;AAAA,EACxD;AAEA,MAAI,CAAC,MAAM,SAAS,KAAK,cAAc,GAAG;AACxC,UAAM,SAAS,KAAK,cAAc,IAAI,CAAC;AAAA,EACzC;AACA,MAAI,CAAC,MAAM,SAAS,KAAK,cAAc,EAAE,SAAS,KAAK,MAAM,GAAG;AAC9D,UAAM,SAAS,KAAK,cAAc,EAAE,KAAK,KAAK,MAAM;AAAA,EACtD;AAEA,QAAM,MAAM,KAAK,MAAM,IAAI;AAC7B;AAQO,SAAS,qBACd,eACA,WACiB;AACjB,MAAI,QAAQ;AACZ,MAAI,iBAA6C;AACjD,MAAI,eAAe;AAGnB,QAAM,oBAAoB,IAAI,IAAI,6BAA6B,cAAc,mBAAmB,IAAI,CAAC,CAAC,CAAC;AACvG,QAAM,sBAAsB,6BAA6B,UAAU,MAAM,CAAC,CAAC;AAC3E,QAAM,wBAAwB,IAAI,IAAI,mBAAmB;AACzD,MAAI,kBAAkB,OAAO,KAAK,oBAAoB,SAAS,GAAG;AAChE,UAAM,UAAU,qBAAqB,mBAAmB,qBAAqB;AAC7E,UAAM,aAAa,UAAU,KAAK,IAAI,kBAAkB,MAAM,oBAAoB,MAAM;AACxF,UAAM,YAAY,aAAa,eAAe;AAC9C,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,0BAA0B,IAAI,IAAI,6BAA6B,UAAU,mBAAmB,IAAI,CAAC,CAAC,CAAC;AACzG,QAAM,gBAAgB,6BAA6B,cAAc,MAAM,CAAC,CAAC;AACzE,QAAM,kBAAkB,IAAI,IAAI,aAAa;AAC7C,MAAI,wBAAwB,OAAO,KAAK,cAAc,SAAS,GAAG;AAChE,UAAM,UAAU,qBAAqB,yBAAyB,eAAe;AAC7E,UAAM,aAAa,UAAU,KAAK,IAAI,wBAAwB,MAAM,cAAc,MAAM;AACxF,UAAM,YAAY,aAAa;AAC/B,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,mBAAmB,IAAI,IAAI,6BAA6B,cAAc,gBAAgB,CAAC,CAAC,CAAC;AAC/F,MAAI,iBAAiB,OAAO,GAAG;AAC7B,UAAM,UAAU,qBAAqB,kBAAkB,qBAAqB;AAC5E,UAAM,aAAa,UAAU,KAAK,IAAI,iBAAiB,MAAM,oBAAoB,UAAU,CAAC;AAC5F,UAAM,YAAY,aAAa,eAAe;AAC9C,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,cAAc,cAAc,cAAc,CAAC;AACjD,QAAM,oBAAoB,UAAU,cAAc,CAAC;AACnD,MAAI,YAAY,SAAS,KAAK,kBAAkB,SAAS,GAAG;AAC1D,UAAM,gBAAgB,kBAAkB,aAAa,iBAAiB;AACtE,UAAM,YAAY,gBAAgB,eAAe;AACjD,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,UAAU,cAAc,QAAQ,CAAC;AACvC,QAAM,gBAAgB,UAAU,QAAQ,CAAC;AACzC,MAAI,QAAQ,SAAS,KAAK,cAAc,SAAS,GAAG;AAClD,UAAM,aAAa,kBAAkB,SAAS,aAAa;AAC3D,UAAM,YAAY,aAAa,eAAe;AAC9C,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,QAAQ,KAAK,MAAM,cAAc,UAAU;AACjD,QAAM,cAAc,KAAK,MAAM,UAAU,UAAU;AACnD,MAAI,OAAO,SAAS,KAAK,KAAK,OAAO,SAAS,WAAW,GAAG;AAC1D,UAAM,WAAW,KAAK,IAAI,QAAQ,WAAW,IAAI;AACjD,UAAM,YAAY,KAAK,IAAI,WAAW;AACtC,UAAM,YAAY,YAAY,eAAe;AAC7C,aAAS;AACT,QAAI,YAAY,cAAc;AAC5B,qBAAe;AACf,uBAAiB;AAAA,IACnB;AAAA,EACF;AAGA,MAAI,WAAmC;AACvC,QAAM,aAAa,IAAI,IAAI,aAAa;AACxC,QAAM,cAAc,qBAAqB,YAAY,qBAAqB;AAC1E,QAAM,iBAAiB,WAAW,OAAO,IAAI,cAAc,WAAW,OAAO;AAE7E,MAAI,iBAAiB,OAAO,UAAU,gBAAgB,WAAW;AAC/D,eAAW;AAAA,EACb,WAAW,iBAAiB,OAAO,cAAc,gBAAgB,UAAU,aAAa;AACtF,eAAW;AAAA,EACb,WAAW,kBAAkB,OAAO,KAAK,oBAAoB,SAAS,GAAG;AACvE,UAAM,sBAAsB,qBAAqB,mBAAmB,qBAAqB;AACzF,QAAI,sBAAsB,GAAG;AAC3B,iBAAW;AAAA,IACb;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,WAAW,OAAO,UAAU,cAAc,eAAe;AAChF;AAMA,eAAe,uBACb,WACA,0BACA,mBACA,cACmC;AACnC,QAAM,OAAO,gCAAgC,WAAW,wBAAwB;AAChF,QAAM,kBAAkB,KAAK,KAAK,MAAM,cAAc;AAEtD,QAAM,QAAQ,MAAM,cAAc,eAAe,EAAE,MAAM,MAAM,CAAC,CAAa;AAC7E,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAEhC,QAAM,SAAS,KAAK,IAAI,IAAI,eAAe;AAC3C,QAAM,UAAoC,CAAC;AAE3C,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,YAAM,MAAM,MAAM,aAAa,QAAQ;AACvC,UAAI,CAAC,SAAS,GAAG,EAAG;AACpB,YAAM,aAAa,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AACzE,UAAI,eAAe,kBAAmB;AACtC,YAAM,aAAa,OAAO,IAAI,eAAe,WAAW,IAAI,aAAa;AACzE,YAAM,KAAK,KAAK,MAAM,UAAU;AAChC,UAAI,CAAC,OAAO,SAAS,EAAE,KAAK,KAAK,OAAQ;AACzC,cAAQ,KAAK,GAAwC;AAAA,IACvD,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;AAMA,eAAsB,kBAAkB,SAKd;AACxB,QAAM,EAAE,WAAW,0BAA0B,eAAe,QAAQ,aAAa,IAAI;AACrF,QAAM,YAAY,iBAAiB,WAAW,wBAAwB;AAEtE,QAAM,aAAa,MAAM;AAAA,IACvB;AAAA,IACA;AAAA,IACA,cAAc;AAAA,IACd,aAAa;AAAA,EACf;AAEA,MAAI,WAAW,WAAW,EAAG,QAAO,CAAC;AAErC,QAAM,SAAS,WACZ,IAAI,CAAC,MAAM,qBAAqB,eAAe,CAAC,CAAC,EACjD,OAAO,CAAC,MAAM,EAAE,SAAS,aAAa,QAAQ,EAC9C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,aAAa,qBAAqB;AAE9C,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AAEjC,SAAO,qBAAqB,WAAW,YAAY;AACjD,UAAM,QAAQ,MAAM,eAAe,SAAS;AAC5C,UAAM,WAAyB,CAAC;AAEhC,eAAW,aAAa,QAAQ;AAC9B,YAAM,SAAS,WAAW,UAAU,WAAW,cAAc,cAAc,YAAY;AAGvF,UAAI,MAAM,MAAM,MAAM,EAAG;AAEzB,YAAM,OAAmB;AAAA,QACvB,eAAe;AAAA,QACf;AAAA,QACA,kBAAkB,UAAU,WAAW;AAAA,QACvC,gBAAgB,cAAc;AAAA,QAC9B,UAAU,UAAU;AAAA,QACpB,YAAY,KAAK,IAAI,GAAG,UAAU,QAAQ,EAAE;AAAA,QAC5C,cAAc,UAAU;AAAA,QACxB,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MACpC;AAEA,qBAAe,OAAO,IAAI;AAC1B,YAAM,YAAY,WAAW,IAAI;AACjC,eAAS,KAAK,IAAI;AAAA,IACpB;AAEA,QAAI,SAAS,SAAS,GAAG;AACvB,YAAM,gBAAgB,WAAW,KAAK;AACtC,UAAI,MAAM,kBAAkB,SAAS,MAAM,kCAAkC,cAAc,YAAY,EAAE;AAAA,IAC3G;AAEA,WAAO;AAAA,EACT,CAAC;AACH;","names":[]}

package/dist/{chunk-W5O2FQTZ.js → chunk-GUPISBV2.js}

@@ -8,7 +8,7 @@ import {
 import {
   countRecallTokenOverlap,
   normalizeRecallTokens
-} from "./chunk-DT5TVLJE.js";
+} from "./chunk-ZBJMUXZH.js";
 
 // src/semantic-rule-verifier.ts
 var DEFAULT_MIN_EFFECTIVE_CONFIDENCE = 0.45;
@@ -115,4 +115,4 @@ async function searchVerifiedSemanticRules(options) {
 export {
   searchVerifiedSemanticRules
 };
-//# sourceMappingURL=chunk-W5O2FQTZ.js.map
+//# sourceMappingURL=chunk-GUPISBV2.js.map

package/dist/{chunk-472U7RDF.js → chunk-JGSKJHF7.js}

@@ -1,7 +1,7 @@
 import {
   countRecallTokenOverlap,
   normalizeRecallTokens
-} from "./chunk-DT5TVLJE.js";
+} from "./chunk-ZBJMUXZH.js";
 import {
   assertIsoRecordedAt,
   assertSafePathSegment,
@@ -905,4 +905,4 @@ export {
   seedTrustZoneDemoDataset,
   getTrustZoneStoreStatus
 };
-//# sourceMappingURL=chunk-472U7RDF.js.map
+//# sourceMappingURL=chunk-JGSKJHF7.js.map

package/dist/{chunk-IEFHBIU2.js → chunk-KDUVQU6Y.js}

@@ -19,7 +19,7 @@ import {
 import {
   CompoundingEngine,
   defaultTierMigrationCycleBudget
-} from "./chunk-OD5LFAPZ.js";
+} from "./chunk-V67GWXM2.js";
 import {
   SharedContextManager
 } from "./chunk-DRD2Q7HQ.js";
@@ -70,7 +70,7 @@ import {
   runDirectAgent,
   runTemporalAgent,
   shouldRunAgent
-} from "./chunk-D2MMMTDV.js";
+} from "./chunk-5SQ5CQJP.js";
 import {
   clearIndexes,
   deindexMemory,
@@ -82,7 +82,7 @@ import {
   queryByTagsAsync,
   recencyWindowFromPrompt,
   resolvePromptTagPrefilterAsync
-} from "./chunk-WXACKLKP.js";
+} from "./chunk-75O6YQ63.js";
 import {
   applyRuntimeRetrievalPolicy
 } from "./chunk-5IZL4DCV.js";
@@ -181,7 +181,7 @@ import {
 } from "./chunk-WLEB7WCG.js";
 import {
   tryDirectAnswer
-} from "./chunk-5NXIJZFX.js";
+} from "./chunk-WR64DQFE.js";
 import {
   EmbeddingFallback
 } from "./chunk-XCAZF7KQ.js";
@@ -203,7 +203,7 @@ import {
   materializeAfterSemanticConsolidation,
   parseConsolidationResponse,
   parseOperatorAwareConsolidationResponse
-} from "./chunk-D65TSG24.js";
+} from "./chunk-7DZRO2DC.js";
 import {
   normalizeReplaySessionKey
 } from "./chunk-2PRQG7PV.js";
@@ -212,16 +212,16 @@ import {
 } from "./chunk-HPWVAEET.js";
 import {
   searchVerifiedEpisodes
-} from "./chunk-MA5MWGKP.js";
+} from "./chunk-ZT3EGNLR.js";
 import {
   ThreadingManager
 } from "./chunk-W4RVMTHR.js";
 import {
   searchVerifiedSemanticRules
-} from "./chunk-W5O2FQTZ.js";
+} from "./chunk-GUPISBV2.js";
 import {
   searchWorkProductLedgerEntries
-} from "./chunk-XPXEJRUB.js";
+} from "./chunk-ZRWB5D4H.js";
 import {
   TranscriptManager
 } from "./chunk-A6D7A2FW.js";
@@ -249,14 +249,14 @@ import {
 } from "./chunk-PCI747N2.js";
 import {
   PolicyRuntimeManager
-} from "./chunk-A2Z6UCWT.js";
+} from "./chunk-33JBK2XP.js";
 import {
   isAboveImportanceThreshold,
   scoreImportance
 } from "./chunk-JXS5PDQ7.js";
 import {
   searchHarmonicRetrieval
-} from "./chunk-SKGV326D.js";
+} from "./chunk-6GDHLVJC.js";
 import {
   collectNativeKnowledgeChunks,
   formatNativeKnowledgeSection,
@@ -287,7 +287,7 @@ import {
 } from "./chunk-CSKLPDN6.js";
 import {
   buildRecallQueryPolicy
-} from "./chunk-6HZ6AO2P.js";
+} from "./chunk-LBJBNWS2.js";
 import {
   buildBehaviorSignalsForMemory,
   dedupeBehaviorSignalsByMemoryAndHash
@@ -314,7 +314,7 @@ import {
 import {
   listTrustZoneRecords,
   searchTrustZoneRecords
-} from "./chunk-472U7RDF.js";
+} from "./chunk-JGSKJHF7.js";
 import {
   buildXraySnapshot
 } from "./chunk-FXKPZ3H6.js";
@@ -363,7 +363,7 @@ import {
 } from "./chunk-FVQJYWH7.js";
 import {
   searchCausalTrajectories
-} from "./chunk-LMPHTYJC.js";
+} from "./chunk-ZZYF3BUL.js";
 import {
   canReadNamespace,
   defaultNamespaceForPrincipal,
@@ -12405,4 +12405,4 @@ export {
   resolvePersistedMemoryRelativePath,
   Orchestrator
 };
-//# sourceMappingURL=chunk-IEFHBIU2.js.map
+//# sourceMappingURL=chunk-KDUVQU6Y.js.map

package/dist/{chunk-6HZ6AO2P.js → chunk-LBJBNWS2.js}

@@ -1,5 +1,9 @@
+import {
+  normalizeRecallTokens
+} from "./chunk-ZBJMUXZH.js";
+
 // src/recall-query-policy.ts
-var DEFAULT_STOPWORDS = /* @__PURE__ */ new Set([
+var DEFAULT_STOPWORDS = [
   "the",
   "and",
   "for",
@@ -55,13 +59,27 @@ var DEFAULT_STOPWORDS = /* @__PURE__ */ new Set([
   "data",
   "gathering",
   "context"
-]);
+];
+var MAX_COMPACT_TOKENS_PER_SOURCE_TERM = 8;
+var COMPACT_IDENTIFIER_RE = /^[a-z0-9]+(?:[:_-][a-z0-9]+)+$/i;
 function collapseWhitespace(text) {
   return text.replace(/\s+/g, " ").trim();
 }
 function stripFilesystemLikePaths(text) {
   return text.replace(/(?:^|\s)(~\/[^\s)]+)(?=\s|$)/g, " ").replace(/(?:^|\s)(\/[A-Za-z0-9._\-\/]+)(?=\s|$)/g, " ").replace(/(?:^|\s)([A-Za-z]:\\[^\s)]+)(?=\s|$)/g, " ");
 }
+function trimCompactSourceTerm(term) {
+  return term.replace(/^[^\p{L}\p{N}\p{M}]+|[^\p{L}\p{N}\p{M}]+$/gu, "");
+}
+function splitCompactSourceTerm(term) {
+  return term.split(/[^\p{L}\p{N}\p{M}:_-]+/gu).map((part) => trimCompactSourceTerm(part)).filter((part) => part.length > 0);
+}
+function capCompactSourceTermTokens(tokens) {
+  if (tokens.length <= MAX_COMPACT_TOKENS_PER_SOURCE_TERM) return tokens;
+  const last = tokens.at(-1);
+  if (!last) return tokens.slice(0, MAX_COMPACT_TOKENS_PER_SOURCE_TERM);
+  return [...tokens.slice(0, MAX_COMPACT_TOKENS_PER_SOURCE_TERM - 1), last];
+}
 function isBulletOrNumberedLine(line) {
   if (line.startsWith("-") || line.startsWith("*")) {
     return true;
@@ -103,16 +121,25 @@ function classifyRecallPromptShape(prompt) {
   return score >= 5 ? "instruction_heavy" : "standard";
 }
 function tokenizeForCompactQuery(text) {
-  const raw = text.toLowerCase().replace(/[^a-z0-9\s:_-]+/g, " ").split(/\s+/).filter((token) => token.length >= 3);
-  const deduped = [];
+  const tokens = [];
   const seen = /* @__PURE__ */ new Set();
-  for (const token of raw) {
-    if (DEFAULT_STOPWORDS.has(token)) continue;
-    if (seen.has(token)) continue;
+  const addToken = (token) => {
+    if (token.length === 0 || seen.has(token)) return;
     seen.add(token);
-    deduped.push(token);
+    tokens.push(token);
+  };
+  for (const rawTerm of text.split(/\s+/)) {
+    for (const sourceTerm of splitCompactSourceTerm(trimCompactSourceTerm(rawTerm))) {
+      if (COMPACT_IDENTIFIER_RE.test(sourceTerm)) {
+        addToken(sourceTerm.toLowerCase());
+        continue;
+      }
+      for (const token of capCompactSourceTermTokens(normalizeRecallTokens(sourceTerm, DEFAULT_STOPWORDS))) {
+        addToken(token);
+      }
+    }
   }
-  return deduped;
+  return tokens;
 }
 function buildInstructionHeavyQuery(prompt, tokenCap, maxChars) {
   const cleaned = stripFilesystemLikePaths(prompt);
@@ -161,4 +188,4 @@ export {
   clampInstructionHeavyTokenCap,
   buildRecallQueryPolicy
 };
-//# sourceMappingURL=chunk-6HZ6AO2P.js.map
+//# sourceMappingURL=chunk-LBJBNWS2.js.map

package/dist/chunk-LBJBNWS2.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/recall-query-policy.ts"],"sourcesContent":["import { normalizeRecallTokens } from \"./recall-tokenization.js\";\n\nexport type RecallPromptShape = \"standard\" | \"instruction_heavy\";\nexport type CronConversationRecallMode = \"auto\" | \"always\" | \"never\";\nexport type RecallBudgetMode = \"full\" | \"minimal\";\n\nexport interface RecallQueryPolicyConfig {\n  cronRecallPolicyEnabled: boolean;\n  cronRecallNormalizedQueryMaxChars: number;\n  cronRecallInstructionHeavyTokenCap: number;\n  cronConversationRecallMode: CronConversationRecallMode;\n}\n\nexport interface RecallQueryPolicyResult {\n  promptShape: RecallPromptShape;\n  retrievalQuery: string;\n  skipConversationRecall: boolean;\n  retrievalBudgetMode: RecallBudgetMode;\n}\n\nconst DEFAULT_STOPWORDS = [\n  \"the\",\n  \"and\",\n  \"for\",\n  \"with\",\n  \"from\",\n  \"that\",\n  \"this\",\n  \"your\",\n  \"you\",\n  \"are\",\n  \"was\",\n  \"were\",\n  \"have\",\n  \"has\",\n  \"had\",\n  \"not\",\n  \"but\",\n  \"its\",\n  \"into\",\n  \"only\",\n  \"use\",\n  \"run\",\n  \"then\",\n  \"when\",\n  \"what\",\n  \"where\",\n  \"which\",\n  \"will\",\n  \"would\",\n  \"should\",\n  \"could\",\n  \"goal\",\n  \"output\",\n  \"format\",\n  \"rules\",\n  \"section\",\n  \"sections\",\n  \"skip\",\n  \"today\",\n  \"yesterday\",\n  \"return\",\n  \"summary\",\n  \"plain\",\n  \"text\",\n  \"before\",\n  \"after\",\n  \"time\",\n  \"date\",\n  \"daily\",\n  \"cron\",\n  \"agent\",\n  \"mode\",\n  \"data\",\n  \"gathering\",\n  \"context\",\n];\nconst MAX_COMPACT_TOKENS_PER_SOURCE_TERM = 8;\nconst COMPACT_IDENTIFIER_RE = /^[a-z0-9]+(?:[:_-][a-z0-9]+)+$/i;\n\nfunction collapseWhitespace(text: string): string {\n  return text.replace(/\\s+/g, \" \").trim();\n}\n\nfunction stripFilesystemLikePaths(text: string): string {\n  return text\n    .replace(/(?:^|\\s)(~\\/[^\\s)]+)(?=\\s|$)/g, \" \")\n    .replace(/(?:^|\\s)(\\/[A-Za-z0-9._\\-\\/]+)(?=\\s|$)/g, \" \")\n    .replace(/(?:^|\\s)([A-Za-z]:\\\\[^\\s)]+)(?=\\s|$)/g, \" \");\n}\n\nfunction trimCompactSourceTerm(term: string): string {\n  return term.replace(/^[^\\p{L}\\p{N}\\p{M}]+|[^\\p{L}\\p{N}\\p{M}]+$/gu, \"\");\n}\n\nfunction splitCompactSourceTerm(term: string): string[] {\n  return term\n    .split(/[^\\p{L}\\p{N}\\p{M}:_-]+/gu)\n    .map((part) => trimCompactSourceTerm(part))\n    .filter((part) => part.length > 0);\n}\n\nfunction capCompactSourceTermTokens(tokens: string[]): string[] {\n  if (tokens.length <= MAX_COMPACT_TOKENS_PER_SOURCE_TERM) return tokens;\n  const last = tokens.at(-1);\n  if (!last) return tokens.slice(0, MAX_COMPACT_TOKENS_PER_SOURCE_TERM);\n  return [...tokens.slice(0, MAX_COMPACT_TOKENS_PER_SOURCE_TERM - 1), last];\n}\n\nfunction isBulletOrNumberedLine(line: string): boolean {\n  if (line.startsWith(\"-\") || line.startsWith(\"*\")) {\n    return true;\n  }\n\n  let i = 0;\n  while (i < line.length) {\n    const code = line.charCodeAt(i);\n    if (code < 48 || code > 57) {\n      break;\n    }\n    i += 1;\n  }\n  return i > 0 && i < line.length && line.charAt(i) === \".\";\n}\n\nfunction scoreInstructionHeavyShape(prompt: string): number {\n  const lines = prompt\n    .split(/\\r?\\n/)\n    .map((line) => line.trim())\n    .filter((line) => line.length > 0);\n  const lineCount = lines.length;\n  if (lineCount === 0) return 0;\n\n  const headingLineCount = lines.filter(\n    (line) =>\n      /^(goal|output format|tone rules|grounding rules|data gathering|date computation|crm context|follow-up|social|current time|return)\\b/i.test(\n        line\n      ) || /^[A-Z][A-Z\\s/-]{4,}:$/.test(line)\n  ).length;\n  const bulletLineCount = lines.filter((line) => isBulletOrNumberedLine(line)).length;\n  const longLineCount = lines.filter((line) => line.length >= 180).length;\n  const hasPathDensity = (prompt.match(/(?:~\\/|\\/Users\\/|[A-Za-z]:\\\\)/g)?.length ?? 0) >= 2;\n  const hasImperativeDensity =\n    (prompt.match(/\\b(run|extract|read|parse|determine|include|omit|skip)\\b/gi)?.length ?? 0) >= 8;\n\n  let score = 0;\n  if (lineCount >= 24) score += 2;\n  if (headingLineCount >= 4) score += 2;\n  if (bulletLineCount >= 8) score += 1;\n  if (longLineCount >= 3) score += 1;\n  if (hasPathDensity) score += 1;\n  if (hasImperativeDensity) score += 1;\n  return score;\n}\n\nexport function classifyRecallPromptShape(prompt: string): RecallPromptShape {\n  const score = scoreInstructionHeavyShape(prompt);\n  return score >= 5 ? \"instruction_heavy\" : \"standard\";\n}\n\nfunction tokenizeForCompactQuery(text: string): string[] {\n  const tokens: string[] = [];\n  const seen = new Set<string>();\n  const addToken = (token: string) => {\n    if (token.length === 0 || seen.has(token)) return;\n    seen.add(token);\n    tokens.push(token);\n  };\n\n  for (const rawTerm of text.split(/\\s+/)) {\n    for (const sourceTerm of splitCompactSourceTerm(trimCompactSourceTerm(rawTerm))) {\n      if (COMPACT_IDENTIFIER_RE.test(sourceTerm)) {\n        addToken(sourceTerm.toLowerCase());\n        continue;\n      }\n      for (const token of capCompactSourceTermTokens(normalizeRecallTokens(sourceTerm, DEFAULT_STOPWORDS))) {\n        addToken(token);\n      }\n    }\n  }\n  return tokens;\n}\n\nfunction buildInstructionHeavyQuery(prompt: string, tokenCap: number, maxChars: number): string {\n  const cleaned = stripFilesystemLikePaths(prompt);\n  const tokens = tokenizeForCompactQuery(cleaned).slice(0, Math.max(8, tokenCap));\n  const joined = tokens.join(\" \");\n  const compact = collapseWhitespace(joined);\n  if (compact.length <= maxChars) return compact;\n  return compact.slice(0, maxChars).trim();\n}\n\nexport function clampInstructionHeavyTokenCap(value: number): number {\n  if (!Number.isFinite(value)) return 8;\n  return Math.max(8, Math.round(value));\n}\n\nfunction buildStandardQuery(prompt: string, maxChars: number): string {\n  const trimmed = collapseWhitespace(prompt);\n  if (trimmed.length <= maxChars) return trimmed;\n  return trimmed.slice(0, maxChars).trim();\n}\n\nexport function buildRecallQueryPolicy(\n  prompt: string,\n  sessionKey: string | undefined,\n  cfg: RecallQueryPolicyConfig\n): RecallQueryPolicyResult {\n  const normalizedPrompt = collapseWhitespace(prompt);\n  const isCron = (sessionKey ?? \"\").includes(\":cron:\");\n  if (!cfg.cronRecallPolicyEnabled || !isCron) {\n    return {\n      promptShape: \"standard\",\n      retrievalQuery: prompt,\n      skipConversationRecall: false,\n      retrievalBudgetMode: \"full\",\n    };\n  }\n\n  const promptShape = classifyRecallPromptShape(prompt);\n  const maxChars = Math.max(120, cfg.cronRecallNormalizedQueryMaxChars);\n  const tokenCap = clampInstructionHeavyTokenCap(cfg.cronRecallInstructionHeavyTokenCap);\n  const retrievalQuery =\n    promptShape === \"instruction_heavy\"\n      ? buildInstructionHeavyQuery(prompt, tokenCap, maxChars)\n      : buildStandardQuery(prompt, maxChars);\n\n  const skipConversationRecall =\n    cfg.cronConversationRecallMode === \"never\"\n      ? true\n      : cfg.cronConversationRecallMode === \"always\"\n        ? false\n        : promptShape === \"instruction_heavy\";\n\n  const retrievalBudgetMode = promptShape === \"instruction_heavy\" ? \"minimal\" : \"full\";\n\n  return {\n    promptShape,\n    retrievalQuery: retrievalQuery.length > 0 ? retrievalQuery : normalizedPrompt.slice(0, maxChars),\n    skipConversationRecall,\n    retrievalBudgetMode,\n  };\n}\n"],"mappings":";;;;;AAoBA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAM,qCAAqC;AAC3C,IAAM,wBAAwB;AAE9B,SAAS,mBAAmB,MAAsB;AAChD,SAAO,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACxC;AAEA,SAAS,yBAAyB,MAAsB;AACtD,SAAO,KACJ,QAAQ,iCAAiC,GAAG,EAC5C,QAAQ,2CAA2C,GAAG,EACtD,QAAQ,yCAAyC,GAAG;AACzD;AAEA,SAAS,sBAAsB,MAAsB;AACnD,SAAO,KAAK,QAAQ,+CAA+C,EAAE;AACvE;AAEA,SAAS,uBAAuB,MAAwB;AACtD,SAAO,KACJ,MAAM,0BAA0B,EAChC,IAAI,CAAC,SAAS,sBAAsB,IAAI,CAAC,EACzC,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AACrC;AAEA,SAAS,2BAA2B,QAA4B;AAC9D,MAAI,OAAO,UAAU,mCAAoC,QAAO;AAChE,QAAM,OAAO,OAAO,GAAG,EAAE;AACzB,MAAI,CAAC,KAAM,QAAO,OAAO,MAAM,GAAG,kCAAkC;AACpE,SAAO,CAAC,GAAG,OAAO,MAAM,GAAG,qCAAqC,CAAC,GAAG,IAAI;AAC1E;AAEA,SAAS,uBAAuB,MAAuB;AACrD,MAAI,KAAK,WAAW,GAAG,KAAK,KAAK,WAAW,GAAG,GAAG;AAChD,WAAO;AAAA,EACT;AAEA,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,QAAQ;AACtB,UAAM,OAAO,KAAK,WAAW,CAAC;AAC9B,QAAI,OAAO,MAAM,OAAO,IAAI;AAC1B;AAAA,IACF;AACA,SAAK;AAAA,EACP;AACA,SAAO,IAAI,KAAK,IAAI,KAAK,UAAU,KAAK,OAAO,CAAC,MAAM;AACxD;AAEA,SAAS,2BAA2B,QAAwB;AAC1D,QAAM,QAAQ,OACX,MAAM,OAAO,EACb,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,EACzB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AACnC,QAAM,YAAY,MAAM;AACxB,MAAI,cAAc,EAAG,QAAO;AAE5B,QAAM,mBAAmB,MAAM;AAAA,IAC7B,CAAC,SACC,uIAAuI;AAAA,MACrI;AAAA,IACF,KAAK,wBAAwB,KAAK,IAAI;AAAA,EAC1C,EAAE;AACF,QAAM,kBAAkB,MAAM,OAAO,CAAC,SAAS,uBAAuB,IAAI,CAAC,EAAE;AAC7E,QAAM,gBAAgB,MAAM,OAAO,CAAC,SAAS,KAAK,UAAU,GAAG,EAAE;AACjE,QAAM,kBAAkB,OAAO,MAAM,gCAAgC,GAAG,UAAU,MAAM;AACxF,QAAM,wBACH,OAAO,MAAM,4DAA4D,GAAG,UAAU,MAAM;AAE/F,MAAI,QAAQ;AACZ,MAAI,aAAa,GAAI,UAAS;AAC9B,MAAI,oBAAoB,EAAG,UAAS;AACpC,MAAI,mBAAmB,EAAG,UAAS;AACnC,MAAI,iBAAiB,EAAG,UAAS;AACjC,MAAI,eAAgB,UAAS;AAC7B,MAAI,qBAAsB,UAAS;AACnC,SAAO;AACT;AAEO,SAAS,0BAA0B,QAAmC;AAC3E,QAAM,QAAQ,2BAA2B,MAAM;AAC/C,SAAO,SAAS,IAAI,sBAAsB;AAC5C;AAEA,SAAS,wBAAwB,MAAwB;AACvD,QAAM,SAAmB,CAAC;AAC1B,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,WAAW,CAAC,UAAkB;AAClC,QAAI,MAAM,WAAW,KAAK,KAAK,IAAI,KAAK,EAAG;AAC3C,SAAK,IAAI,KAAK;AACd,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,aAAW,WAAW,KAAK,MAAM,KAAK,GAAG;AACvC,eAAW,cAAc,uBAAuB,sBAAsB,OAAO,CAAC,GAAG;AAC/E,UAAI,sBAAsB,KAAK,UAAU,GAAG;AAC1C,iBAAS,WAAW,YAAY,CAAC;AACjC;AAAA,MACF;AACA,iBAAW,SAAS,2BAA2B,sBAAsB,YAAY,iBAAiB,CAAC,GAAG;AACpG,iBAAS,KAAK;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,2BAA2B,QAAgB,UAAkB,UAA0B;AAC9F,QAAM,UAAU,yBAAyB,MAAM;AAC/C,QAAM,SAAS,wBAAwB,OAAO,EAAE,MAAM,GAAG,KAAK,IAAI,GAAG,QAAQ,CAAC;AAC9E,QAAM,SAAS,OAAO,KAAK,GAAG;AAC9B,QAAM,UAAU,mBAAmB,MAAM;AACzC,MAAI,QAAQ,UAAU,SAAU,QAAO;AACvC,SAAO,QAAQ,MAAM,GAAG,QAAQ,EAAE,KAAK;AACzC;AAEO,SAAS,8BAA8B,OAAuB;AACnE,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;AACtC;AAEA,SAAS,mBAAmB,QAAgB,UAA0B;AACpE,QAAM,UAAU,mBAAmB,MAAM;AACzC,MAAI,QAAQ,UAAU,SAAU,QAAO;AACvC,SAAO,QAAQ,MAAM,GAAG,QAAQ,EAAE,KAAK;AACzC;AAEO,SAAS,uBACd,QACA,YACA,KACyB;AACzB,QAAM,mBAAmB,mBAAmB,MAAM;AAClD,QAAM,UAAU,cAAc,IAAI,SAAS,QAAQ;AACnD,MAAI,CAAC,IAAI,2BAA2B,CAAC,QAAQ;AAC3C,WAAO;AAAA,MACL,aAAa;AAAA,MACb,gBAAgB;AAAA,MAChB,wBAAwB;AAAA,MACxB,qBAAqB;AAAA,IACvB;AAAA,EACF;AAEA,QAAM,cAAc,0BAA0B,MAAM;AACpD,QAAM,WAAW,KAAK,IAAI,KAAK,IAAI,iCAAiC;AACpE,QAAM,WAAW,8BAA8B,IAAI,kCAAkC;AACrF,QAAM,iBACJ,gBAAgB,sBACZ,2BAA2B,QAAQ,UAAU,QAAQ,IACrD,mBAAmB,QAAQ,QAAQ;AAEzC,QAAM,yBACJ,IAAI,+BAA+B,UAC/B,OACA,IAAI,+BAA+B,WACjC,QACA,gBAAgB;AAExB,QAAM,sBAAsB,gBAAgB,sBAAsB,YAAY;AAE9E,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB,eAAe,SAAS,IAAI,iBAAiB,iBAAiB,MAAM,GAAG,QAAQ;AAAA,IAC/F;AAAA,IACA;AAAA,EACF;AACF;","names":[]}

package/dist/{chunk-Z4R6RI2N.js → chunk-NSKYFGDL.js}

@@ -1,7 +1,7 @@
 import {
   resolveWorkProductLedgerDir,
   validateWorkProductLedgerEntry
-} from "./chunk-XPXEJRUB.js";
+} from "./chunk-ZRWB5D4H.js";
 import {
   TranscriptManager
 } from "./chunk-A6D7A2FW.js";
@@ -268,4 +268,4 @@ export {
   recordResumeBundle,
   getResumeBundleStatus
 };
-//# sourceMappingURL=chunk-Z4R6RI2N.js.map
+//# sourceMappingURL=chunk-NSKYFGDL.js.map

package/dist/{chunk-OD5LFAPZ.js → chunk-V67GWXM2.js}

@@ -1259,4 +1259,4 @@ export {
   defaultTierMigrationCycleBudget,
   CompoundingEngine
 };
-//# sourceMappingURL=chunk-OD5LFAPZ.js.map
+//# sourceMappingURL=chunk-V67GWXM2.js.map

package/dist/{chunk-5NXIJZFX.js → chunk-WR64DQFE.js}

@@ -1,12 +1,12 @@
 import {
   isDirectAnswerEligible
-} from "./chunk-Y4FHOFJ2.js";
+} from "./chunk-6HEM6HTQ.js";
 import {
   throwIfAborted
 } from "./chunk-PVGDJXVK.js";
 import {
   normalizeRecallTokens
-} from "./chunk-DT5TVLJE.js";
+} from "./chunk-ZBJMUXZH.js";
 
 // src/taxonomy/resolver.ts
 var DEFAULT_CATEGORY_ID = "facts";
@@ -177,4 +177,4 @@ export {
   resolveCategory,
   tryDirectAnswer
 };
-//# sourceMappingURL=chunk-5NXIJZFX.js.map
+//# sourceMappingURL=chunk-WR64DQFE.js.map

package/dist/{chunk-5BUGGPBR.js → chunk-WZA5Y6AC.js}

@@ -41,7 +41,7 @@ import {
   scoreTrustZoneProvenance,
   seedTrustZoneDemoDataset,
   summarizeTrustZonePromotionReadiness
-} from "./chunk-472U7RDF.js";
+} from "./chunk-JGSKJHF7.js";
 import {
   estimateRecallTokens
 } from "./chunk-FXKPZ3H6.js";
@@ -105,7 +105,7 @@ import {
 import {
   filterTrajectoriesByLookbackDays,
   readCausalTrajectoryRecords
-} from "./chunk-LMPHTYJC.js";
+} from "./chunk-ZZYF3BUL.js";
 import {
   canReadNamespace,
   canWriteNamespace,
@@ -4238,4 +4238,4 @@ export {
   shapeMemorySummary,
   EngramAccessService
 };
-//# sourceMappingURL=chunk-5BUGGPBR.js.map
+//# sourceMappingURL=chunk-WZA5Y6AC.js.map