@remnic/core 1.0.1 → 1.0.3

package/dist/chunk-IQT3XTKW.js

@@ -0,0 +1,121 @@
+// src/citations.ts
+var OPEN_TAG = "<oai-mem-citation>";
+var CLOSE_TAG = "</oai-mem-citation>";
+var ENTRIES_OPEN = "<citation_entries>";
+var ENTRIES_CLOSE = "</citation_entries>";
+var ROLLOUT_OPEN = "<rollout_ids>";
+var ROLLOUT_CLOSE = "</rollout_ids>";
+var THREAD_OPEN = "<thread_ids>";
+var THREAD_CLOSE = "</thread_ids>";
+function parseOaiMemCitation(text) {
+  const openIdx = text.indexOf(OPEN_TAG);
+  if (openIdx < 0) return null;
+  const closeIdx = text.indexOf(CLOSE_TAG, openIdx + OPEN_TAG.length);
+  if (closeIdx < 0) return null;
+  const inner = text.slice(openIdx + OPEN_TAG.length, closeIdx);
+  const entries = parseEntries(inner);
+  const rolloutIds = parseIds(inner, ROLLOUT_OPEN, ROLLOUT_CLOSE) ?? parseIds(inner, THREAD_OPEN, THREAD_CLOSE) ?? [];
+  if (entries.length === 0 && rolloutIds.length === 0) return null;
+  return { entries, rolloutIds };
+}
+function parseEntries(block) {
+  const start = block.indexOf(ENTRIES_OPEN);
+  if (start < 0) return [];
+  const end = block.indexOf(ENTRIES_CLOSE, start + ENTRIES_OPEN.length);
+  if (end < 0) return [];
+  const raw = block.slice(start + ENTRIES_OPEN.length, end);
+  const lines = raw.split("\n").map((l) => l.trim()).filter((l) => l.length > 0);
+  const results = [];
+  for (const line of lines) {
+    const parsed = parseEntryLine(line);
+    if (parsed) results.push(parsed);
+  }
+  return results;
+}
+function parseEntryLine(line) {
+  const match = line.match(/^(.+):(\d+)-(\d+)\|note=\[(.*)?\]$/);
+  if (!match) return null;
+  const [, pathRaw, startRaw, endRaw, noteRaw] = match;
+  if (!pathRaw || !startRaw || !endRaw) return null;
+  const lineStart = parseInt(startRaw, 10);
+  const lineEnd = parseInt(endRaw, 10);
+  if (!Number.isFinite(lineStart) || !Number.isFinite(lineEnd)) return null;
+  if (lineStart < 0 || lineEnd < 0) return null;
+  return {
+    path: pathRaw.trim(),
+    lineStart,
+    lineEnd,
+    note: noteRaw ?? ""
+  };
+}
+function parseIds(block, openTag, closeTag) {
+  const start = block.indexOf(openTag);
+  if (start < 0) return null;
+  const end = block.indexOf(closeTag, start + openTag.length);
+  if (end < 0) return null;
+  const raw = block.slice(start + openTag.length, end);
+  const lines = raw.split("\n").map((l) => l.trim()).filter((l) => l.length > 0);
+  const seen = /* @__PURE__ */ new Set();
+  const unique = [];
+  for (const id of lines) {
+    if (!seen.has(id)) {
+      seen.add(id);
+      unique.push(id);
+    }
+  }
+  return unique.length > 0 ? unique : null;
+}
+function sanitizeNoteForCitation(note) {
+  return note.replace(/[\r\n]+/g, " ").trim();
+}
+function formatOaiMemCitation(block) {
+  const entryLines = block.entries.map((e) => `${e.path}:${e.lineStart}-${e.lineEnd}|note=[${sanitizeNoteForCitation(e.note)}]`).join("\n");
+  const idLines = block.rolloutIds.join("\n");
+  return [
+    OPEN_TAG,
+    ENTRIES_OPEN,
+    entryLines,
+    ENTRIES_CLOSE,
+    ROLLOUT_OPEN,
+    idLines,
+    ROLLOUT_CLOSE,
+    CLOSE_TAG
+  ].join("\n");
+}
+function buildCitationGuidance(citations) {
+  if (citations.length === 0) return "";
+  const entryExamples = citations.map(
+    (c) => `${c.path}:${c.lineStart}-${c.lineEnd}|note=[${sanitizeNoteForCitation(c.noteDefault)}]`
+  );
+  const rolloutExamples = citations.filter((c) => c.rolloutId != null).map((c) => c.rolloutId);
+  const seenRollouts = /* @__PURE__ */ new Set();
+  const uniqueRollouts = [];
+  for (const id of rolloutExamples) {
+    if (!seenRollouts.has(id)) {
+      seenRollouts.add(id);
+      uniqueRollouts.push(id);
+    }
+  }
+  const lines = [
+    "",
+    "[Remnic citation guidance]",
+    "If you used any of the memories above, append the following to the END of your final reply:",
+    OPEN_TAG,
+    ENTRIES_OPEN,
+    ...entryExamples,
+    ENTRIES_CLOSE,
+    ROLLOUT_OPEN,
+    ...uniqueRollouts,
+    ROLLOUT_CLOSE,
+    CLOSE_TAG
+  ];
+  return lines.join("\n");
+}
+
+export {
+  parseOaiMemCitation,
+  sanitizeNoteForCitation,
+  formatOaiMemCitation,
+  buildCitationGuidance
+};
+//# sourceMappingURL=chunk-IQT3XTKW.js.map

package/dist/chunk-IQT3XTKW.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/citations.ts"],"sourcesContent":["/**\n * OAI-mem-citation parser and formatter (issue #379).\n *\n * Mirrors the citation block format used by Codex's `citations.rs` so that\n * Remnic recall responses produce compatible citation blocks. The model\n * appends these blocks to its final reply, and downstream hooks parse them\n * to increment memory usage tracking.\n *\n * Block format:\n *\n *   <oai-mem-citation>\n *   <citation_entries>\n *   path/to/file.md:1-5|note=[short explanation]\n *   </citation_entries>\n *   <rollout_ids>\n *   rollout-abc123\n *   </rollout_ids>\n *   </oai-mem-citation>\n */\n\n/** A single citation entry referencing a memory file and line range. */\nexport interface CitationEntry {\n  path: string;\n  lineStart: number;\n  lineEnd: number;\n  note: string;\n}\n\n/** Parsed citation block containing entries and rollout/thread IDs. */\nexport interface CitationBlock {\n  entries: CitationEntry[];\n  rolloutIds: string[];\n}\n\n/** Metadata attached to a recall result for citation guidance. */\nexport interface CitationMetadata {\n  memoryId: string;\n  path: string;\n  lineStart: number;\n  lineEnd: number;\n  rolloutId?: string;\n  noteDefault: string;\n}\n\n// ---------------------------------------------------------------------------\n// Parser\n// ---------------------------------------------------------------------------\n\nconst OPEN_TAG = \"<oai-mem-citation>\";\nconst CLOSE_TAG = \"</oai-mem-citation>\";\nconst ENTRIES_OPEN = \"<citation_entries>\";\nconst ENTRIES_CLOSE = \"</citation_entries>\";\nconst ROLLOUT_OPEN = \"<rollout_ids>\";\nconst ROLLOUT_CLOSE = \"</rollout_ids>\";\n/** Legacy alias accepted during parsing (Codex historically used thread_ids). */\nconst THREAD_OPEN = \"<thread_ids>\";\nconst THREAD_CLOSE = \"</thread_ids>\";\n\n/**\n * Parse an `<oai-mem-citation>` block from arbitrary text.\n *\n * Returns `null` when no valid block is found. Malformed entry lines are\n * silently skipped; only valid lines contribute to the result. Rollout IDs\n * are deduped while preserving insertion order.\n */\nexport function parseOaiMemCitation(text: string): CitationBlock | null {\n  const openIdx = text.indexOf(OPEN_TAG);\n  if (openIdx < 0) return null;\n  const closeIdx = text.indexOf(CLOSE_TAG, openIdx + OPEN_TAG.length);\n  if (closeIdx < 0) return null;\n\n  const inner = text.slice(openIdx + OPEN_TAG.length, closeIdx);\n\n  const entries = parseEntries(inner);\n  const rolloutIds = parseIds(inner, ROLLOUT_OPEN, ROLLOUT_CLOSE)\n    ?? parseIds(inner, THREAD_OPEN, THREAD_CLOSE)\n    ?? [];\n\n  if (entries.length === 0 && rolloutIds.length === 0) return null;\n\n  return { entries, rolloutIds };\n}\n\nfunction parseEntries(block: string): CitationEntry[] {\n  const start = block.indexOf(ENTRIES_OPEN);\n  if (start < 0) return [];\n  const end = block.indexOf(ENTRIES_CLOSE, start + ENTRIES_OPEN.length);\n  if (end < 0) return [];\n\n  const raw = block.slice(start + ENTRIES_OPEN.length, end);\n  const lines = raw.split(\"\\n\").map((l) => l.trim()).filter((l) => l.length > 0);\n  const results: CitationEntry[] = [];\n  for (const line of lines) {\n    const parsed = parseEntryLine(line);\n    if (parsed) results.push(parsed);\n  }\n  return results;\n}\n\n/**\n * Parse a single citation entry line:\n *   `<path>:<line_start>-<line_end>|note=[<note>]`\n *\n * Splits on the LAST `:` before the range pattern, not the first, because\n * file paths can contain colons on some systems (e.g., Windows drive letters\n * like `C:\\` or macOS resource forks).\n */\nfunction parseEntryLine(line: string): CitationEntry | null {\n  // Match the range+note suffix anchored at the end, allowing the path prefix\n  // to contain colons. The (.+) is greedy so it consumes everything up to the\n  // LAST `:` before the `\\d+-\\d+|note=[...]` suffix.\n  const match = line.match(/^(.+):(\\d+)-(\\d+)\\|note=\\[(.*)?\\]$/);\n  if (!match) return null;\n  const [, pathRaw, startRaw, endRaw, noteRaw] = match;\n  if (!pathRaw || !startRaw || !endRaw) return null;\n  const lineStart = parseInt(startRaw, 10);\n  const lineEnd = parseInt(endRaw, 10);\n  if (!Number.isFinite(lineStart) || !Number.isFinite(lineEnd)) return null;\n  if (lineStart < 0 || lineEnd < 0) return null;\n  return {\n    path: pathRaw.trim(),\n    lineStart,\n    lineEnd,\n    note: noteRaw ?? \"\",\n  };\n}\n\nfunction parseIds(block: string, openTag: string, closeTag: string): string[] | null {\n  const start = block.indexOf(openTag);\n  if (start < 0) return null;\n  const end = block.indexOf(closeTag, start + openTag.length);\n  if (end < 0) return null;\n\n  const raw = block.slice(start + openTag.length, end);\n  const lines = raw.split(\"\\n\").map((l) => l.trim()).filter((l) => l.length > 0);\n\n  // Deduplicate preserving insertion order.\n  const seen = new Set<string>();\n  const unique: string[] = [];\n  for (const id of lines) {\n    if (!seen.has(id)) {\n      seen.add(id);\n      unique.push(id);\n    }\n  }\n  return unique.length > 0 ? unique : null;\n}\n\n// ---------------------------------------------------------------------------\n// Sanitizer\n// ---------------------------------------------------------------------------\n\n/**\n * Replace newline characters (\\n, \\r) with spaces so that note values can be\n * safely embedded in a single citation entry line without corrupting the\n * line-based parser (`parseEntryLine` splits on `\\n`).\n */\nexport function sanitizeNoteForCitation(note: string): string {\n  return note.replace(/[\\r\\n]+/g, \" \").trim();\n}\n\n// ---------------------------------------------------------------------------\n// Formatter\n// ---------------------------------------------------------------------------\n\n/**\n * Format a `CitationBlock` into the canonical `<oai-mem-citation>` XML block.\n */\nexport function formatOaiMemCitation(block: CitationBlock): string {\n  const entryLines = block.entries\n    .map((e) => `${e.path}:${e.lineStart}-${e.lineEnd}|note=[${sanitizeNoteForCitation(e.note)}]`)\n    .join(\"\\n\");\n  const idLines = block.rolloutIds.join(\"\\n\");\n\n  return [\n    OPEN_TAG,\n    ENTRIES_OPEN,\n    entryLines,\n    ENTRIES_CLOSE,\n    ROLLOUT_OPEN,\n    idLines,\n    ROLLOUT_CLOSE,\n    CLOSE_TAG,\n  ].join(\"\\n\");\n}\n\n// ---------------------------------------------------------------------------\n// Guidance builder\n// ---------------------------------------------------------------------------\n\n/**\n * Build the citation guidance text appended to recall responses so that the\n * model knows how to emit a citation block in its reply.\n *\n * Returns an empty string when `citations` is empty (no guidance needed).\n */\nexport function buildCitationGuidance(citations: CitationMetadata[]): string {\n  if (citations.length === 0) return \"\";\n\n  const entryExamples = citations.map((c) =>\n    `${c.path}:${c.lineStart}-${c.lineEnd}|note=[${sanitizeNoteForCitation(c.noteDefault)}]`,\n  );\n  const rolloutExamples = citations\n    .filter((c) => c.rolloutId != null)\n    .map((c) => c.rolloutId!);\n\n  // Dedupe rollout IDs preserving order.\n  const seenRollouts = new Set<string>();\n  const uniqueRollouts: string[] = [];\n  for (const id of rolloutExamples) {\n    if (!seenRollouts.has(id)) {\n      seenRollouts.add(id);\n      uniqueRollouts.push(id);\n    }\n  }\n\n  const lines = [\n    \"\",\n    \"[Remnic citation guidance]\",\n    \"If you used any of the memories above, append the following to the END of your final reply:\",\n    OPEN_TAG,\n    ENTRIES_OPEN,\n    ...entryExamples,\n    ENTRIES_CLOSE,\n    ROLLOUT_OPEN,\n    ...uniqueRollouts,\n    ROLLOUT_CLOSE,\n    CLOSE_TAG,\n  ];\n\n  return lines.join(\"\\n\");\n}\n"],"mappings":";AAgDA,IAAM,WAAW;AACjB,IAAM,YAAY;AAClB,IAAM,eAAe;AACrB,IAAM,gBAAgB;AACtB,IAAM,eAAe;AACrB,IAAM,gBAAgB;AAEtB,IAAM,cAAc;AACpB,IAAM,eAAe;AASd,SAAS,oBAAoB,MAAoC;AACtE,QAAM,UAAU,KAAK,QAAQ,QAAQ;AACrC,MAAI,UAAU,EAAG,QAAO;AACxB,QAAM,WAAW,KAAK,QAAQ,WAAW,UAAU,SAAS,MAAM;AAClE,MAAI,WAAW,EAAG,QAAO;AAEzB,QAAM,QAAQ,KAAK,MAAM,UAAU,SAAS,QAAQ,QAAQ;AAE5D,QAAM,UAAU,aAAa,KAAK;AAClC,QAAM,aAAa,SAAS,OAAO,cAAc,aAAa,KACzD,SAAS,OAAO,aAAa,YAAY,KACzC,CAAC;AAEN,MAAI,QAAQ,WAAW,KAAK,WAAW,WAAW,EAAG,QAAO;AAE5D,SAAO,EAAE,SAAS,WAAW;AAC/B;AAEA,SAAS,aAAa,OAAgC;AACpD,QAAM,QAAQ,MAAM,QAAQ,YAAY;AACxC,MAAI,QAAQ,EAAG,QAAO,CAAC;AACvB,QAAM,MAAM,MAAM,QAAQ,eAAe,QAAQ,aAAa,MAAM;AACpE,MAAI,MAAM,EAAG,QAAO,CAAC;AAErB,QAAM,MAAM,MAAM,MAAM,QAAQ,aAAa,QAAQ,GAAG;AACxD,QAAM,QAAQ,IAAI,MAAM,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC7E,QAAM,UAA2B,CAAC;AAClC,aAAW,QAAQ,OAAO;AACxB,UAAM,SAAS,eAAe,IAAI;AAClC,QAAI,OAAQ,SAAQ,KAAK,MAAM;AAAA,EACjC;AACA,SAAO;AACT;AAUA,SAAS,eAAe,MAAoC;AAI1D,QAAM,QAAQ,KAAK,MAAM,oCAAoC;AAC7D,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,CAAC,EAAE,SAAS,UAAU,QAAQ,OAAO,IAAI;AAC/C,MAAI,CAAC,WAAW,CAAC,YAAY,CAAC,OAAQ,QAAO;AAC7C,QAAM,YAAY,SAAS,UAAU,EAAE;AACvC,QAAM,UAAU,SAAS,QAAQ,EAAE;AACnC,MAAI,CAAC,OAAO,SAAS,SAAS,KAAK,CAAC,OAAO,SAAS,OAAO,EAAG,QAAO;AACrE,MAAI,YAAY,KAAK,UAAU,EAAG,QAAO;AACzC,SAAO;AAAA,IACL,MAAM,QAAQ,KAAK;AAAA,IACnB;AAAA,IACA;AAAA,IACA,MAAM,WAAW;AAAA,EACnB;AACF;AAEA,SAAS,SAAS,OAAe,SAAiB,UAAmC;AACnF,QAAM,QAAQ,MAAM,QAAQ,OAAO;AACnC,MAAI,QAAQ,EAAG,QAAO;AACtB,QAAM,MAAM,MAAM,QAAQ,UAAU,QAAQ,QAAQ,MAAM;AAC1D,MAAI,MAAM,EAAG,QAAO;AAEpB,QAAM,MAAM,MAAM,MAAM,QAAQ,QAAQ,QAAQ,GAAG;AACnD,QAAM,QAAQ,IAAI,MAAM,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAG7E,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,SAAmB,CAAC;AAC1B,aAAW,MAAM,OAAO;AACtB,QAAI,CAAC,KAAK,IAAI,EAAE,GAAG;AACjB,WAAK,IAAI,EAAE;AACX,aAAO,KAAK,EAAE;AAAA,IAChB;AAAA,EACF;AACA,SAAO,OAAO,SAAS,IAAI,SAAS;AACtC;AAWO,SAAS,wBAAwB,MAAsB;AAC5D,SAAO,KAAK,QAAQ,YAAY,GAAG,EAAE,KAAK;AAC5C;AASO,SAAS,qBAAqB,OAA8B;AACjE,QAAM,aAAa,MAAM,QACtB,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS,IAAI,EAAE,OAAO,UAAU,wBAAwB,EAAE,IAAI,CAAC,GAAG,EAC5F,KAAK,IAAI;AACZ,QAAM,UAAU,MAAM,WAAW,KAAK,IAAI;AAE1C,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAYO,SAAS,sBAAsB,WAAuC;AAC3E,MAAI,UAAU,WAAW,EAAG,QAAO;AAEnC,QAAM,gBAAgB,UAAU;AAAA,IAAI,CAAC,MACnC,GAAG,EAAE,IAAI,IAAI,EAAE,SAAS,IAAI,EAAE,OAAO,UAAU,wBAAwB,EAAE,WAAW,CAAC;AAAA,EACvF;AACA,QAAM,kBAAkB,UACrB,OAAO,CAAC,MAAM,EAAE,aAAa,IAAI,EACjC,IAAI,CAAC,MAAM,EAAE,SAAU;AAG1B,QAAM,eAAe,oBAAI,IAAY;AACrC,QAAM,iBAA2B,CAAC;AAClC,aAAW,MAAM,iBAAiB;AAChC,QAAI,CAAC,aAAa,IAAI,EAAE,GAAG;AACzB,mBAAa,IAAI,EAAE;AACnB,qBAAe,KAAK,EAAE;AAAA,IACxB;AAAA,EACF;AAEA,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,IACH;AAAA,IACA;AAAA,IACA,GAAG;AAAA,IACH;AAAA,IACA;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;","names":[]}

package/dist/{chunk-BDFZXRSO.js → chunk-J4IYOZZ5.js}

@@ -59,6 +59,8 @@ var CATEGORY_BOOSTS = {
   // Durable rules/values
   rule: 0.11,
   // Causal IF→THEN rules
+  procedure: 0.1,
+  // Repeatable workflows (issue #519)
   preference: 0.1,
   // User preferences matter
   commitment: 0.1,
@@ -309,10 +311,21 @@ function importanceLevel(score) {
   if (score >= 0.2) return "low";
   return "trivial";
 }
+var IMPORTANCE_LEVEL_RANK = {
+  trivial: 0,
+  low: 1,
+  normal: 2,
+  high: 3,
+  critical: 4
+};
+function isAboveImportanceThreshold(candidate, threshold) {
+  return IMPORTANCE_LEVEL_RANK[candidate] >= IMPORTANCE_LEVEL_RANK[threshold];
+}
 
 export {
   scoreImportance,
   rescoreMemoryImportance,
-  importanceLevel
+  importanceLevel,
+  isAboveImportanceThreshold
 };
-//# sourceMappingURL=chunk-BDFZXRSO.js.map
+//# sourceMappingURL=chunk-J4IYOZZ5.js.map

package/dist/chunk-J4IYOZZ5.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/importance.ts"],"sourcesContent":["/**\n * Local Importance Scoring (Phase 1B)\n *\n * Zero-LLM heuristic system that evaluates each memory's significance.\n * Analyzes content for markers like explicit importance statements,\n * personal information, instructions, emotional content, and factual density.\n */\n\nimport type { ImportanceLevel, ImportanceScore, MemoryCategory, MemoryFile } from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Marker patterns for each tier\n// ---------------------------------------------------------------------------\n\n/** Critical importance markers (0.9-1.0) */\nconst CRITICAL_PATTERNS = [\n  // Explicit importance\n  /\\b(critical|crucial|essential|must|always|never)\\b/i,\n  /\\b(important|remember this|don't forget)\\b/i,\n  // Personal identity\n  /\\b(my name is|i am|i'm called)\\b/i,\n  /\\b(my (birthday|phone|email|address|ssn|password))\\b/i,\n  // Strong preferences\n  /\\b(i (hate|love|despise|adore))\\b/i,\n  /\\b(absolutely|definitely|certainly) (not|must|should)\\b/i,\n  // Corrections (high weight)\n  /\\b(actually|no,? that's wrong|correction:?|let me correct)\\b/i,\n  /\\b(i said|i meant|i was wrong)\\b/i,\n];\n\n/** High importance markers (0.7-0.9) */\nconst HIGH_PATTERNS = [\n  // Decisions\n  /\\b(decided|decision|chose|choosing|picked|selected)\\b/i,\n  /\\b(we('ll| will) (go with|use|implement))\\b/i,\n  // Instructions\n  /\\b(make sure|ensure|always|don't|do not|never|avoid)\\b/i,\n  /\\b(you (should|must|need to))\\b/i,\n  // Temporal references (deadlines, schedules)\n  /\\b(by (monday|tuesday|wednesday|thursday|friday|saturday|sunday))\\b/i,\n  /\\b(deadline|due (date|by)|by (end of|next))\\b/i,\n  /\\b(tomorrow|next week|this week|today)\\b/i,\n  // Preferences\n  /\\b(i (prefer|like|want|need|dislike))\\b/i,\n  /\\b(my (preference|style|approach|way))\\b/i,\n  // Commitments\n  /\\b(i('ll| will)|promise|commit|guarantee)\\b/i,\n  /\\b(scheduled|appointment|meeting|call)\\b/i,\n];\n\n/** Normal importance markers (0.4-0.7) */\nconst NORMAL_PATTERNS = [\n  // Factual content\n  /\\b(is|are|was|were|has|have|does|do)\\b/i,\n  /\\b(because|since|therefore|thus|so)\\b/i,\n  // Emotional content\n  /\\b(happy|sad|frustrated|excited|worried|anxious)\\b/i,\n  /\\b(feel|feeling|felt)\\b/i,\n  // Technical details\n  /\\b(version|api|endpoint|database|server|config)\\b/i,\n  /\\b(function|class|method|variable|parameter)\\b/i,\n];\n\n/** Low importance markers (0.2-0.4) */\nconst LOW_PATTERNS = [\n  // Uncertainty\n  /\\b(maybe|perhaps|possibly|might|could be)\\b/i,\n  /\\b(i think|i guess|not sure|uncertain)\\b/i,\n  /\\b(probably|likely|seems like)\\b/i,\n  // Hedging\n  /\\b(kind of|sort of|somewhat|a bit)\\b/i,\n  /\\b(in a way|to some extent)\\b/i,\n];\n\n/** Trivial content markers (0.0-0.2) */\nconst TRIVIAL_PATTERNS = [\n  // Greetings and filler\n  /^(hi|hello|hey|yo|sup|greetings)[.!,]?\\s*$/i,\n  /^(ok|okay|k|sure|yes|no|yep|nope|yeah|nah)[.!]?\\s*$/i,\n  /^(thanks|thank you|thx|ty|cheers)[.!]?\\s*$/i,\n  /^(got it|understood|roger|copy|noted)[.!]?\\s*$/i,\n  /^(bye|goodbye|later|see ya|ttyl)[.!]?\\s*$/i,\n  /^(lol|haha|hehe|lmao|rofl)[.!]?\\s*$/i,\n  /^(hmm+|uhh*|ahh*|err*|umm*)[.!]?\\s*$/i,\n  // Very short content\n  /^.{1,10}$/,\n];\n\n// ---------------------------------------------------------------------------\n// Category-based importance boosts\n// ---------------------------------------------------------------------------\n\nconst CATEGORY_BOOSTS: Record<MemoryCategory, number> = {\n  correction: 0.15,    // Corrections are always important\n  principle: 0.12,     // Durable rules/values\n  rule: 0.11,          // Causal IF→THEN rules\n  procedure: 0.10,     // Repeatable workflows (issue #519)\n  preference: 0.10,    // User preferences matter\n  commitment: 0.10,    // Promises/obligations\n  decision: 0.08,      // Decisions with rationale\n  relationship: 0.05,  // Entity relationships\n  skill: 0.05,         // Capabilities\n  moment: 0.03,        // Emotional milestones\n  entity: 0.02,        // Entity facts\n  fact: 0.00,          // Base facts, no boost\n};\n\n// ---------------------------------------------------------------------------\n// Keyword extraction\n// ---------------------------------------------------------------------------\n\n/** Common stop words to filter out */\nconst STOP_WORDS = new Set([\n  \"a\", \"an\", \"the\", \"is\", \"are\", \"was\", \"were\", \"be\", \"been\", \"being\",\n  \"have\", \"has\", \"had\", \"do\", \"does\", \"did\", \"will\", \"would\", \"could\",\n  \"should\", \"may\", \"might\", \"must\", \"shall\", \"can\", \"need\", \"dare\",\n  \"ought\", \"used\", \"to\", \"of\", \"in\", \"for\", \"on\", \"with\", \"at\", \"by\",\n  \"from\", \"as\", \"into\", \"through\", \"during\", \"before\", \"after\", \"above\",\n  \"below\", \"between\", \"under\", \"again\", \"further\", \"then\", \"once\",\n  \"here\", \"there\", \"when\", \"where\", \"why\", \"how\", \"all\", \"each\", \"few\",\n  \"more\", \"most\", \"other\", \"some\", \"such\", \"no\", \"nor\", \"not\", \"only\",\n  \"own\", \"same\", \"so\", \"than\", \"too\", \"very\", \"just\", \"and\", \"but\",\n  \"or\", \"if\", \"because\", \"until\", \"while\", \"this\", \"that\", \"these\",\n  \"those\", \"i\", \"me\", \"my\", \"myself\", \"we\", \"our\", \"ours\", \"ourselves\",\n  \"you\", \"your\", \"yours\", \"yourself\", \"yourselves\", \"he\", \"him\", \"his\",\n  \"himself\", \"she\", \"her\", \"hers\", \"herself\", \"it\", \"its\", \"itself\",\n  \"they\", \"them\", \"their\", \"theirs\", \"themselves\", \"what\", \"which\",\n  \"who\", \"whom\", \"whose\", \"am\", \"been\", \"being\", \"about\", \"against\",\n]);\n\n/**\n * Extract salient keywords from content.\n * Returns top N keywords sorted by relevance.\n */\nfunction extractKeywords(content: string, maxKeywords: number = 5): string[] {\n  // Tokenize and normalize\n  const words = content\n    .toLowerCase()\n    .replace(/[^a-z0-9\\s-]/g, \" \")\n    .split(/\\s+/)\n    .filter((w) => w.length >= 3 && !STOP_WORDS.has(w));\n\n  // Count frequencies\n  const freq = new Map<string, number>();\n  for (const word of words) {\n    freq.set(word, (freq.get(word) ?? 0) + 1);\n  }\n\n  // Sort by frequency, take top N\n  return [...freq.entries()]\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, maxKeywords)\n    .map(([word]) => word);\n}\n\n// ---------------------------------------------------------------------------\n// Main scoring function\n// ---------------------------------------------------------------------------\n\n/**\n * Calculate importance score for a memory.\n * Pure local heuristics, zero LLM calls.\n */\nexport function scoreImportance(\n  content: string,\n  category: MemoryCategory,\n  tags: string[] = [],\n): ImportanceScore {\n  const reasons: string[] = [];\n  let score = 0.5; // Start at normal baseline\n\n  const lowerContent = content.toLowerCase();\n  const contentLength = content.length;\n\n  // Check for trivial content first (short-circuit)\n  for (const pattern of TRIVIAL_PATTERNS) {\n    if (pattern.test(content)) {\n      return {\n        score: 0.1,\n        level: \"trivial\",\n        reasons: [\"Trivial content (greeting, filler, or very short)\"],\n        keywords: [],\n      };\n    }\n  }\n\n  // Check critical patterns\n  for (const pattern of CRITICAL_PATTERNS) {\n    if (pattern.test(content)) {\n      score += 0.20;\n      reasons.push(`Critical marker: ${pattern.source.slice(0, 30)}`);\n      break; // Only count once per tier\n    }\n  }\n\n  // Check high patterns\n  for (const pattern of HIGH_PATTERNS) {\n    if (pattern.test(content)) {\n      score += 0.12;\n      reasons.push(`High importance marker detected`);\n      break;\n    }\n  }\n\n  // Check low patterns (reduces score)\n  for (const pattern of LOW_PATTERNS) {\n    if (pattern.test(content)) {\n      score -= 0.15;\n      reasons.push(`Uncertainty/hedging detected`);\n      break;\n    }\n  }\n\n  // Category boost\n  const categoryBoost = CATEGORY_BOOSTS[category] ?? 0;\n  if (categoryBoost > 0) {\n    score += categoryBoost;\n    reasons.push(`Category boost: ${category}`);\n  }\n\n  // Length bonus (longer = more substance, capped)\n  if (contentLength > 200) {\n    const lengthBonus = Math.min((contentLength - 200) / 1000, 0.1);\n    score += lengthBonus;\n    if (lengthBonus > 0.05) {\n      reasons.push(\"Substantial content length\");\n    }\n  }\n\n  // Check for personal pronouns (signals personal relevance)\n  if (/\\b(my|mine|i|i'm|i've|i'd|i'll)\\b/i.test(content)) {\n    score += 0.05;\n    reasons.push(\"Personal reference\");\n  }\n\n  // Check for numbers/specifics (concrete details)\n  if (/\\b\\d{2,}\\b/.test(content) || /\\b(version|v\\d|api|config)\\b/i.test(content)) {\n    score += 0.03;\n    reasons.push(\"Contains specific details\");\n  }\n\n  // Tag-based boosts\n  const importantTags = tags.filter((t) =>\n    [\"important\", \"critical\", \"preference\", \"decision\", \"rule\", \"principle\"].includes(t.toLowerCase())\n  );\n  if (importantTags.length > 0) {\n    score += 0.05 * importantTags.length;\n    reasons.push(`Important tags: ${importantTags.join(\", \")}`);\n  }\n\n  // Clamp score to 0-1 range\n  score = Math.max(0, Math.min(1, score));\n\n  // Determine level from score\n  let level: ImportanceLevel;\n  if (score >= 0.9) {\n    level = \"critical\";\n  } else if (score >= 0.7) {\n    level = \"high\";\n  } else if (score >= 0.4) {\n    level = \"normal\";\n  } else if (score >= 0.2) {\n    level = \"low\";\n  } else {\n    level = \"trivial\";\n  }\n\n  // Extract keywords\n  const keywords = extractKeywords(content);\n\n  return {\n    score: Math.round(score * 100) / 100, // Round to 2 decimal places\n    level,\n    reasons: reasons.slice(0, 5), // Cap at 5 reasons\n    keywords,\n  };\n}\n\n/**\n * Recompute importance for an existing memory file using current local heuristics.\n */\nexport function rescoreMemoryImportance(memory: MemoryFile): ImportanceScore {\n  return scoreImportance(memory.content, memory.frontmatter.category, memory.frontmatter.tags ?? []);\n}\n\n/**\n * Get importance level from numeric score.\n */\nexport function importanceLevel(score: number): ImportanceLevel {\n  if (score >= 0.9) return \"critical\";\n  if (score >= 0.7) return \"high\";\n  if (score >= 0.4) return \"normal\";\n  if (score >= 0.2) return \"low\";\n  return \"trivial\";\n}\n\n// ---------------------------------------------------------------------------\n// Importance threshold helper (issue #372)\n// ---------------------------------------------------------------------------\n\n/**\n * Ordering for importance levels used by the extraction write gate.\n * Higher indices mean more important.\n */\nconst IMPORTANCE_LEVEL_RANK: Record<ImportanceLevel, number> = {\n  trivial: 0,\n  low: 1,\n  normal: 2,\n  high: 3,\n  critical: 4,\n};\n\n/**\n * Return true if `candidate` meets or exceeds `threshold`. Used by the\n * extraction write gate in orchestrator.persistExtraction() to drop trivial\n * content before it is written to the memory store.\n *\n * Note: callers should pass the ALREADY-BOOSTED level returned by\n * scoreImportance(), because category boosts (e.g. corrections) are applied\n * inside scoreImportance() before the level is derived.\n */\nexport function isAboveImportanceThreshold(\n  candidate: ImportanceLevel,\n  threshold: ImportanceLevel,\n): boolean {\n  return IMPORTANCE_LEVEL_RANK[candidate] >= IMPORTANCE_LEVEL_RANK[threshold];\n}\n"],"mappings":";AAeA,IAAM,oBAAoB;AAAA;AAAA,EAExB;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAGA,IAAM,gBAAgB;AAAA;AAAA,EAEpB;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAgBA,IAAM,eAAe;AAAA;AAAA,EAEnB;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAGA,IAAM,mBAAmB;AAAA;AAAA,EAEvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AACF;AAMA,IAAM,kBAAkD;AAAA,EACtD,YAAY;AAAA;AAAA,EACZ,WAAW;AAAA;AAAA,EACX,MAAM;AAAA;AAAA,EACN,WAAW;AAAA;AAAA,EACX,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,UAAU;AAAA;AAAA,EACV,cAAc;AAAA;AAAA,EACd,OAAO;AAAA;AAAA,EACP,QAAQ;AAAA;AAAA,EACR,QAAQ;AAAA;AAAA,EACR,MAAM;AAAA;AACR;AAOA,IAAM,aAAa,oBAAI,IAAI;AAAA,EACzB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAC5D;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC5D;AAAA,EAAU;AAAA,EAAO;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAQ;AAAA,EAC1D;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAC9D;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAW;AAAA,EAAU;AAAA,EAAU;AAAA,EAAS;AAAA,EAC9D;AAAA,EAAS;AAAA,EAAW;AAAA,EAAS;AAAA,EAAS;AAAA,EAAW;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAC/D;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAC7D;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAC3D;AAAA,EAAM;AAAA,EAAM;AAAA,EAAW;AAAA,EAAS;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAS;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EAAU;AAAA,EAAM;AAAA,EAAO;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAY;AAAA,EAAc;AAAA,EAAM;AAAA,EAAO;AAAA,EAC/D;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAW;AAAA,EAAM;AAAA,EAAO;AAAA,EACzD;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAU;AAAA,EAAc;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAC1D,CAAC;AAMD,SAAS,gBAAgB,SAAiB,cAAsB,GAAa;AAE3E,QAAM,QAAQ,QACX,YAAY,EACZ,QAAQ,iBAAiB,GAAG,EAC5B,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;AAGpD,QAAM,OAAO,oBAAI,IAAoB;AACrC,aAAW,QAAQ,OAAO;AACxB,SAAK,IAAI,OAAO,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,EAC1C;AAGA,SAAO,CAAC,GAAG,KAAK,QAAQ,CAAC,EACtB,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,WAAW,EACpB,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI;AACzB;AAUO,SAAS,gBACd,SACA,UACA,OAAiB,CAAC,GACD;AACjB,QAAM,UAAoB,CAAC;AAC3B,MAAI,QAAQ;AAEZ,QAAM,eAAe,QAAQ,YAAY;AACzC,QAAM,gBAAgB,QAAQ;AAG9B,aAAW,WAAW,kBAAkB;AACtC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,aAAO;AAAA,QACL,OAAO;AAAA,QACP,OAAO;AAAA,QACP,SAAS,CAAC,mDAAmD;AAAA,QAC7D,UAAU,CAAC;AAAA,MACb;AAAA,IACF;AAAA,EACF;AAGA,aAAW,WAAW,mBAAmB;AACvC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,oBAAoB,QAAQ,OAAO,MAAM,GAAG,EAAE,CAAC,EAAE;AAC9D;AAAA,IACF;AAAA,EACF;AAGA,aAAW,WAAW,eAAe;AACnC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,iCAAiC;AAC9C;AAAA,IACF;AAAA,EACF;AAGA,aAAW,WAAW,cAAc;AAClC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,8BAA8B;AAC3C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,gBAAgB,gBAAgB,QAAQ,KAAK;AACnD,MAAI,gBAAgB,GAAG;AACrB,aAAS;AACT,YAAQ,KAAK,mBAAmB,QAAQ,EAAE;AAAA,EAC5C;AAGA,MAAI,gBAAgB,KAAK;AACvB,UAAM,cAAc,KAAK,KAAK,gBAAgB,OAAO,KAAM,GAAG;AAC9D,aAAS;AACT,QAAI,cAAc,MAAM;AACtB,cAAQ,KAAK,4BAA4B;AAAA,IAC3C;AAAA,EACF;AAGA,MAAI,qCAAqC,KAAK,OAAO,GAAG;AACtD,aAAS;AACT,YAAQ,KAAK,oBAAoB;AAAA,EACnC;AAGA,MAAI,aAAa,KAAK,OAAO,KAAK,gCAAgC,KAAK,OAAO,GAAG;AAC/E,aAAS;AACT,YAAQ,KAAK,2BAA2B;AAAA,EAC1C;AAGA,QAAM,gBAAgB,KAAK;AAAA,IAAO,CAAC,MACjC,CAAC,aAAa,YAAY,cAAc,YAAY,QAAQ,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC;AAAA,EACnG;AACA,MAAI,cAAc,SAAS,GAAG;AAC5B,aAAS,OAAO,cAAc;AAC9B,YAAQ,KAAK,mBAAmB,cAAc,KAAK,IAAI,CAAC,EAAE;AAAA,EAC5D;AAGA,UAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAGtC,MAAI;AACJ,MAAI,SAAS,KAAK;AAChB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,OAAO;AACL,YAAQ;AAAA,EACV;AAGA,QAAM,WAAW,gBAAgB,OAAO;AAExC,SAAO;AAAA,IACL,OAAO,KAAK,MAAM,QAAQ,GAAG,IAAI;AAAA;AAAA,IACjC;AAAA,IACA,SAAS,QAAQ,MAAM,GAAG,CAAC;AAAA;AAAA,IAC3B;AAAA,EACF;AACF;AAKO,SAAS,wBAAwB,QAAqC;AAC3E,SAAO,gBAAgB,OAAO,SAAS,OAAO,YAAY,UAAU,OAAO,YAAY,QAAQ,CAAC,CAAC;AACnG;AAKO,SAAS,gBAAgB,OAAgC;AAC9D,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,SAAO;AACT;AAUA,IAAM,wBAAyD;AAAA,EAC7D,SAAS;AAAA,EACT,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,UAAU;AACZ;AAWO,SAAS,2BACd,WACA,WACS;AACT,SAAO,sBAAsB,SAAS,KAAK,sBAAsB,SAAS;AAC5E;","names":[]}

package/dist/{chunk-ZKYI7UVO.js → chunk-JR4ZC3G4.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-Z5LAYHGJ.js";
 import {
   log
-} from "./chunk-KWBU5S5U.js";
+} from "./chunk-2ODBA7MQ.js";
 
 // src/session-observer-state.ts
 import path from "path";
@@ -273,4 +273,4 @@ export {
   normalizeObserverBands,
   SessionObserverState
 };
-//# sourceMappingURL=chunk-ZKYI7UVO.js.map
+//# sourceMappingURL=chunk-JR4ZC3G4.js.map

package/dist/{chunk-UCYSTFZR.js → chunk-JRNQ3RNA.js}

@@ -1,6 +1,6 @@
 import {
   log
-} from "./chunk-KWBU5S5U.js";
+} from "./chunk-2ODBA7MQ.js";
 
 // src/threading.ts
 import { readdir, readFile, writeFile, mkdir } from "fs/promises";
@@ -281,4 +281,4 @@ var ThreadingManager = class {
 export {
   ThreadingManager
 };
-//# sourceMappingURL=chunk-UCYSTFZR.js.map
+//# sourceMappingURL=chunk-JRNQ3RNA.js.map

package/dist/{chunk-UYSKNO6E.js → chunk-JROGC36Y.js}

@@ -1,6 +1,6 @@
 import {
   StorageManager
-} from "./chunk-QWUUMMIK.js";
+} from "./chunk-POMSFKTB.js";
 import {
   parseContinuityImprovementLoops,
   parseContinuityIncident
@@ -10,7 +10,7 @@ import {
 } from "./chunk-M62O4P4T.js";
 import {
   log
-} from "./chunk-KWBU5S5U.js";
+} from "./chunk-2ODBA7MQ.js";
 
 // src/compounding/engine.ts
 import { createHash } from "crypto";
@@ -840,12 +840,13 @@ var CompoundingEngine = class {
     let promotionCandidates = this.config.compoundingSemanticEnabled ? this.derivePromotionCandidates(outcomeSummary, mistakes.registry, rubrics) : [];
     if (this.config.cmcConsolidationEnabled) {
       try {
-        const { deriveCausalPromotionCandidates } = await import("./causal-consolidation.js");
+        const { deriveCausalPromotionCandidates, materializeAfterCausalConsolidation } = await import("./causal-consolidation.js");
         const causalCandidates = await deriveCausalPromotionCandidates({
           memoryDir: this.config.memoryDir,
           causalTrajectoryStoreDir: this.config.causalTrajectoryStoreDir,
           gatewayConfig: this.config.gatewayConfig,
           gatewayAgentId: this.config.modelSource === "gateway" ? this.config.gatewayAgentId || void 0 : void 0,
+          pluginConfig: this.config,
           config: {
             minRecurrence: this.config.cmcConsolidationMinRecurrence,
             minSessions: this.config.cmcConsolidationMinSessions,
@@ -855,6 +856,16 @@ var CompoundingEngine = class {
         if (causalCandidates.length > 0) {
           promotionCandidates = [...promotionCandidates, ...causalCandidates];
         }
+        try {
+          await materializeAfterCausalConsolidation({
+            config: this.config,
+            memoryDir: this.config.memoryDir
+          });
+        } catch (materializeError) {
+          log.warn(
+            `[cmc] Codex materialize post-hook failed (non-fatal): ${materializeError instanceof Error ? materializeError.message : String(materializeError)}`
+          );
+        }
       } catch (error) {
         log.warn(`[cmc] causal consolidation in synthesizeWeekly failed (non-fatal): ${error instanceof Error ? error.message : String(error)}`);
       }
@@ -1849,4 +1860,4 @@ export {
   defaultTierMigrationCycleBudget,
   CompoundingEngine
 };
-//# sourceMappingURL=chunk-UYSKNO6E.js.map
+//# sourceMappingURL=chunk-JROGC36Y.js.map