@remnic/core 9.63.9 → 9.63.10

package/dist/{chunk-5TF5STAV.js → chunk-K477BTF4.js}

@@ -1,16 +1,16 @@
 import {
   externalWikiSearchOperation
-} from "./chunk-KXWE62IH.js";
+} from "./chunk-IOE75NA4.js";
 import {
   memoryStoreRequestSchema
-} from "./chunk-DGUVXXAU.js";
+} from "./chunk-XFJUPJD7.js";
 import {
   CorrectionContractError,
   DECISION_SUBCOMMANDS,
   DELTA_SUBCOMMANDS,
   defineOperation,
   isCodegraphToolName
-} from "./chunk-BPQ7L27U.js";
+} from "./chunk-MIM7QT6H.js";
 import {
   serializeMutations,
   withHeldFileLock
@@ -1818,4 +1818,4 @@ export {
   codegraphIngestTracesOperation,
   REGISTERED_OPERATIONS
 };
-//# sourceMappingURL=chunk-5TF5STAV.js.map
+//# sourceMappingURL=chunk-K477BTF4.js.map

package/dist/{chunk-ML3U4KPR.js → chunk-K547KS3X.js}

@@ -1,10 +1,10 @@
-import {
-  scanMemoryDir
-} from "./chunk-W7IGLX4G.js";
 import {
   isSearchAborted,
   throwIfSearchAborted
 } from "./chunk-GUMZC2BO.js";
+import {
+  scanMemoryDir
+} from "./chunk-W7IGLX4G.js";
 import {
   reportSearchDegradation,
   resolveEnsureCollectionArgs
@@ -776,4 +776,4 @@ export {
   resolveOramaCollectionDbFilePath,
   OramaBackend
 };
-//# sourceMappingURL=chunk-ML3U4KPR.js.map
+//# sourceMappingURL=chunk-K547KS3X.js.map

package/dist/{chunk-UHGBNIOS.js → chunk-KVDUKH5E.js}

@@ -1,3 +1,7 @@
+import {
+  cjkBigrams
+} from "./chunk-CIO7GCWE.js";
+
 // src/topics.ts
 var STOP_WORDS = /* @__PURE__ */ new Set([
   "a",
@@ -134,7 +138,8 @@ var STOP_WORDS = /* @__PURE__ */ new Set([
   "use"
 ]);
 function extractTerms(content) {
-  return content.toLowerCase().replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((w) => w.length >= 3 && !STOP_WORDS.has(w));
+  const latin = content.toLowerCase().replace(/[^a-z0-9\s-]/g, " ").split(/\s+/).filter((w) => w.length >= 3 && !STOP_WORDS.has(w));
+  return [...latin, ...cjkBigrams(content)];
 }
 function extractTopics(memories, topN = 50) {
   if (memories.length === 0) return [];
@@ -202,4 +207,4 @@ export {
   extractTopics,
   findTrendingTopics
 };
-//# sourceMappingURL=chunk-UHGBNIOS.js.map
+//# sourceMappingURL=chunk-KVDUKH5E.js.map

package/dist/chunk-KVDUKH5E.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/topics.ts"],"sourcesContent":["/**\n * Topic Extraction (Phase 4B)\n *\n * Extract key topics from all memories using TF-IDF weighting.\n * Runs as a batch process during consolidation.\n */\n\nimport type { MemoryFile, TopicScore } from \"./types.js\";\nimport { cjkBigrams } from \"./utils/script-aware-text.js\";\n\n/** Stop words to exclude from topic extraction */\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\", \"to\", \"of\",\n  \"in\", \"for\", \"on\", \"with\", \"at\", \"by\", \"from\", \"as\", \"into\", \"through\",\n  \"during\", \"before\", \"after\", \"above\", \"below\", \"between\", \"this\", \"that\",\n  \"these\", \"those\", \"i\", \"me\", \"my\", \"we\", \"our\", \"you\", \"your\", \"he\",\n  \"she\", \"it\", \"they\", \"them\", \"their\", \"what\", \"which\", \"who\", \"how\",\n  \"when\", \"where\", \"why\", \"and\", \"but\", \"or\", \"if\", \"because\", \"so\",\n  \"just\", \"about\", \"like\", \"also\", \"very\", \"really\", \"here\", \"there\",\n  \"now\", \"then\", \"only\", \"even\", \"still\", \"already\", \"always\", \"never\",\n  \"often\", \"sometimes\", \"usually\", \"well\", \"much\", \"more\", \"most\", \"some\",\n  \"any\", \"all\", \"each\", \"every\", \"both\", \"few\", \"many\", \"other\", \"same\",\n  \"such\", \"own\", \"than\", \"too\", \"very\", \"just\", \"over\", \"under\", \"again\",\n  \"further\", \"once\", \"here\", \"there\", \"when\", \"where\", \"why\", \"how\",\n  \"user\", \"agent\", \"memory\", \"fact\", \"preference\", \"using\", \"used\", \"use\",\n]);\n\n/**\n * Extract terms from content.\n * Returns normalized lowercase terms >= 3 chars, plus CJK bigrams so\n * non-Latin memories contribute topics instead of none (issue #2192).\n */\nfunction extractTerms(content: string): string[] {\n  const latin = content\n    .toLowerCase()\n    .replace(/[^a-z0-9\\s-]/g, \" \")\n    .split(/\\s+/)\n    .filter((w) => w.length >= 3 && !STOP_WORDS.has(w));\n  return [...latin, ...cjkBigrams(content)];\n}\n\n/**\n * Calculate TF-IDF scores for terms across all memories.\n *\n * TF (term frequency) = count of term in document / total terms in document\n * IDF (inverse document frequency) = log(total documents / documents containing term)\n * TF-IDF = TF * IDF\n *\n * Terms with high TF-IDF are frequent in specific memories but rare overall.\n */\nexport function extractTopics(\n  memories: MemoryFile[],\n  topN: number = 50,\n): TopicScore[] {\n  if (memories.length === 0) return [];\n\n  // Count term frequency per document and document frequency\n  const docFreq = new Map<string, number>(); // term -> number of documents containing it\n  const termFreqPerDoc: Map<string, number>[] = []; // per-doc term frequencies\n\n  for (const memory of memories) {\n    const terms = extractTerms(memory.content);\n    const termFreq = new Map<string, number>();\n\n    for (const term of terms) {\n      termFreq.set(term, (termFreq.get(term) ?? 0) + 1);\n    }\n\n    // Track which terms appear in this document\n    for (const term of termFreq.keys()) {\n      docFreq.set(term, (docFreq.get(term) ?? 0) + 1);\n    }\n\n    termFreqPerDoc.push(termFreq);\n  }\n\n  const totalDocs = memories.length;\n\n  // Calculate TF-IDF for each term\n  const tfidfScores = new Map<string, { score: number; count: number }>();\n\n  for (let i = 0; i < memories.length; i++) {\n    const termFreq = termFreqPerDoc[i];\n    const totalTerms = [...termFreq.values()].reduce((a, b) => a + b, 0);\n\n    for (const [term, count] of termFreq) {\n      const tf = count / totalTerms;\n      const df = docFreq.get(term) ?? 1;\n      const idf = Math.log(totalDocs / df);\n      const tfidf = tf * idf;\n\n      const existing = tfidfScores.get(term);\n      if (existing) {\n        existing.score += tfidf;\n        existing.count += count;\n      } else {\n        tfidfScores.set(term, { score: tfidf, count });\n      }\n    }\n  }\n\n  // Convert to array and sort by score\n  const topics: TopicScore[] = [...tfidfScores.entries()]\n    .map(([term, { score, count }]) => ({ term, score, count }))\n    .sort((a, b) => b.score - a.score)\n    .slice(0, topN);\n\n  return topics;\n}\n\n/**\n * Compare two topic lists to find trending changes.\n * Returns topics that are new or significantly increased.\n */\nexport function findTrendingTopics(\n  currentTopics: TopicScore[],\n  previousTopics: TopicScore[],\n  threshold: number = 0.5,\n): { rising: TopicScore[]; falling: TopicScore[] } {\n  const prevMap = new Map(previousTopics.map((t) => [t.term, t.score]));\n  const currMap = new Map(currentTopics.map((t) => [t.term, t.score]));\n\n  const rising: TopicScore[] = [];\n  const falling: TopicScore[] = [];\n\n  for (const topic of currentTopics) {\n    const prevScore = prevMap.get(topic.term) ?? 0;\n    const change = topic.score - prevScore;\n\n    if (change > threshold) {\n      rising.push({ ...topic, score: change });\n    }\n  }\n\n  for (const topic of previousTopics) {\n    const currScore = currMap.get(topic.term) ?? 0;\n    const change = topic.score - currScore;\n\n    if (change > threshold && currScore < topic.score * 0.5) {\n      falling.push({ ...topic, score: change });\n    }\n  }\n\n  return {\n    rising: rising.sort((a, b) => b.score - a.score).slice(0, 10),\n    falling: falling.sort((a, b) => b.score - a.score).slice(0, 10),\n  };\n}\n"],"mappings":";;;;;AAWA,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,EAAM;AAAA,EAChE;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAC7D;AAAA,EAAU;AAAA,EAAU;AAAA,EAAS;AAAA,EAAS;AAAA,EAAS;AAAA,EAAW;AAAA,EAAQ;AAAA,EAClE;AAAA,EAAS;AAAA,EAAS;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAC/D;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAC9D;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAW;AAAA,EAC7D;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAU;AAAA,EAAQ;AAAA,EAC3D;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAW;AAAA,EAAU;AAAA,EAC7D;AAAA,EAAS;AAAA,EAAa;AAAA,EAAW;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACjE;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC/D;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC/D;AAAA,EAAW;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAC5D;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAc;AAAA,EAAS;AAAA,EAAQ;AACpE,CAAC;AAOD,SAAS,aAAa,SAA2B;AAC/C,QAAM,QAAQ,QACX,YAAY,EACZ,QAAQ,iBAAiB,GAAG,EAC5B,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;AACpD,SAAO,CAAC,GAAG,OAAO,GAAG,WAAW,OAAO,CAAC;AAC1C;AAWO,SAAS,cACd,UACA,OAAe,IACD;AACd,MAAI,SAAS,WAAW,EAAG,QAAO,CAAC;AAGnC,QAAM,UAAU,oBAAI,IAAoB;AACxC,QAAM,iBAAwC,CAAC;AAE/C,aAAW,UAAU,UAAU;AAC7B,UAAM,QAAQ,aAAa,OAAO,OAAO;AACzC,UAAM,WAAW,oBAAI,IAAoB;AAEzC,eAAW,QAAQ,OAAO;AACxB,eAAS,IAAI,OAAO,SAAS,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IAClD;AAGA,eAAW,QAAQ,SAAS,KAAK,GAAG;AAClC,cAAQ,IAAI,OAAO,QAAQ,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IAChD;AAEA,mBAAe,KAAK,QAAQ;AAAA,EAC9B;AAEA,QAAM,YAAY,SAAS;AAG3B,QAAM,cAAc,oBAAI,IAA8C;AAEtE,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,UAAM,WAAW,eAAe,CAAC;AACjC,UAAM,aAAa,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAEnE,eAAW,CAAC,MAAM,KAAK,KAAK,UAAU;AACpC,YAAM,KAAK,QAAQ;AACnB,YAAM,KAAK,QAAQ,IAAI,IAAI,KAAK;AAChC,YAAM,MAAM,KAAK,IAAI,YAAY,EAAE;AACnC,YAAM,QAAQ,KAAK;AAEnB,YAAM,WAAW,YAAY,IAAI,IAAI;AACrC,UAAI,UAAU;AACZ,iBAAS,SAAS;AAClB,iBAAS,SAAS;AAAA,MACpB,OAAO;AACL,oBAAY,IAAI,MAAM,EAAE,OAAO,OAAO,MAAM,CAAC;AAAA,MAC/C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAAuB,CAAC,GAAG,YAAY,QAAQ,CAAC,EACnD,IAAI,CAAC,CAAC,MAAM,EAAE,OAAO,MAAM,CAAC,OAAO,EAAE,MAAM,OAAO,MAAM,EAAE,EAC1D,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,IAAI;AAEhB,SAAO;AACT;AAMO,SAAS,mBACd,eACA,gBACA,YAAoB,KAC6B;AACjD,QAAM,UAAU,IAAI,IAAI,eAAe,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AACpE,QAAM,UAAU,IAAI,IAAI,cAAc,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AAEnE,QAAM,SAAuB,CAAC;AAC9B,QAAM,UAAwB,CAAC;AAE/B,aAAW,SAAS,eAAe;AACjC,UAAM,YAAY,QAAQ,IAAI,MAAM,IAAI,KAAK;AAC7C,UAAM,SAAS,MAAM,QAAQ;AAE7B,QAAI,SAAS,WAAW;AACtB,aAAO,KAAK,EAAE,GAAG,OAAO,OAAO,OAAO,CAAC;AAAA,IACzC;AAAA,EACF;AAEA,aAAW,SAAS,gBAAgB;AAClC,UAAM,YAAY,QAAQ,IAAI,MAAM,IAAI,KAAK;AAC7C,UAAM,SAAS,MAAM,QAAQ;AAE7B,QAAI,SAAS,aAAa,YAAY,MAAM,QAAQ,KAAK;AACvD,cAAQ,KAAK,EAAE,GAAG,OAAO,OAAO,OAAO,CAAC;AAAA,IAC1C;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,EAAE;AAAA,IAC5D,SAAS,QAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,GAAG,EAAE;AAAA,EAChE;AACF;","names":[]}

package/dist/{chunk-XTMYB2HY.js → chunk-LJQGQUNS.js}

@@ -1,6 +1,6 @@
 import {
   rebuildMemoryProjection
-} from "./chunk-6UKSOXAO.js";
+} from "./chunk-WQ6TRWAE.js";
 
 // src/convergence-refresh.ts
 async function refreshConvergedNamespaces(namespaces, namespaceSearchRouter, getStorage, searchEnabled) {
@@ -32,4 +32,4 @@ async function refreshConvergedNamespaces(namespaces, namespaceSearchRouter, get
 export {
   refreshConvergedNamespaces
 };
-//# sourceMappingURL=chunk-XTMYB2HY.js.map
+//# sourceMappingURL=chunk-LJQGQUNS.js.map

package/dist/{chunk-WAS4HV46.js → chunk-LNH76ZJX.js}

@@ -282,9 +282,9 @@ var GROUNDING_COMMON_VERB_FORMS = {
   works: true
 };
 function groundingLexemes(text) {
-  const rawTokens = text.normalize("NFKC").match(
+  const rawTokens = (text.normalize("NFKC").match(
     /[\p{L}\p{N}]+(?:['’][\p{L}\p{N}]+)?(?:\+\+[\p{L}\p{N}]*|#[\p{L}\p{N}]*)?/gu
-  ) ?? [];
+  ) ?? []).flatMap(splitSpacelessScriptToken);
   const tokens = rawTokens.map((rawToken) => rawToken.replaceAll("\u2019", "'").toLocaleLowerCase());
   let predicateIndex = tokens.findIndex((token, index) => {
     const previousToken = tokens[index - 1];
@@ -388,6 +388,89 @@ function tokenize(text) {
   }
   return tokens;
 }
+var SPACELESS_SCRIPT_CHARACTER_PATTERN = new RegExp(
+  "[\\p{Script=Han}\\p{Script=Hiragana}\\p{Script=Katakana}\\p{Script=Hangul}\\p{Script=Thai}\\p{Script=Lao}\\p{Script=Khmer}\\p{Script=Myanmar}]",
+  "u"
+);
+var SPACELESS_SCRIPT_LCS_SOURCE_LIMIT = 4096;
+function containsSpacelessScriptCharacter(text) {
+  return SPACELESS_SCRIPT_CHARACTER_PATTERN.test(text);
+}
+function splitSpacelessScriptToken(rawToken) {
+  if (!containsSpacelessScriptCharacter(rawToken)) return [rawToken];
+  const parts = [];
+  let otherScriptRun = "";
+  for (const character of rawToken) {
+    if (containsSpacelessScriptCharacter(character)) {
+      if (otherScriptRun.length > 0) {
+        parts.push(otherScriptRun);
+        otherScriptRun = "";
+      }
+      parts.push(character);
+    } else {
+      otherScriptRun += character;
+    }
+  }
+  if (otherScriptRun.length > 0) parts.push(otherScriptRun);
+  return parts;
+}
+function spacelessScriptCharacterSequence(text) {
+  const characters = [];
+  for (const character of text.normalize("NFKC")) {
+    if (containsSpacelessScriptCharacter(character)) characters.push(character);
+  }
+  return characters;
+}
+function spacelessScriptCharacterNgrams(text) {
+  const grams = /* @__PURE__ */ new Set();
+  let previousCharacter = "";
+  for (const character of spacelessScriptCharacterSequence(text)) {
+    if (previousCharacter !== "") grams.add(previousCharacter + character);
+    previousCharacter = character;
+  }
+  return grams;
+}
+function longestCommonSubstringLength(left, right) {
+  if (left.length === 0 || right.length === 0) return 0;
+  let longest = 0;
+  let previousRow = new Array(right.length).fill(0);
+  for (const leftCharacter of left) {
+    const currentRow = new Array(right.length).fill(0);
+    for (let index = 0; index < right.length; index += 1) {
+      if (leftCharacter !== right[index]) continue;
+      currentRow[index] = (index > 0 ? previousRow[index - 1] : 0) + 1;
+      if (currentRow[index] > longest) longest = currentRow[index];
+    }
+    previousRow = currentRow;
+  }
+  return longest;
+}
+function spacelessScriptGroundedTokenScore(candidate, source) {
+  const candidateGrams = spacelessScriptCharacterNgrams(candidate);
+  if (candidateGrams.size === 0) return null;
+  const sourceGrams = spacelessScriptCharacterNgrams(source);
+  let sharedGrams = 0;
+  for (const gram of candidateGrams) {
+    if (sourceGrams.has(gram)) sharedGrams += 1;
+  }
+  if (sharedGrams < GROUNDING_MIN_SHARED_TOKENS) return 0;
+  const coverage = sharedGrams / candidateGrams.size;
+  if (coverage < GROUNDING_MIN_COVERAGE) return 0;
+  const candidateCharacters = spacelessScriptCharacterSequence(candidate);
+  const sourceCharacters = spacelessScriptCharacterSequence(source);
+  if (sourceCharacters.length <= SPACELESS_SCRIPT_LCS_SOURCE_LIMIT) {
+    const anchoredFraction = longestCommonSubstringLength(candidateCharacters, sourceCharacters) / candidateCharacters.length;
+    if (anchoredFraction < GROUNDING_MIN_COVERAGE) return 0;
+  }
+  const sourceTokens = tokenize(source);
+  for (const token of tokenize(candidate)) {
+    if (containsSpacelessScriptCharacter(token)) continue;
+    if (![...sourceTokens].some((sourceToken) => areGroundingTokensCompatible(token, sourceToken))) {
+      return 0;
+    }
+  }
+  return coverage;
+}
 function normalizeForExactMatch(text) {
   return text.normalize("NFKC").toLocaleLowerCase().replace(/\s+/gu, " ").trim();
 }
@@ -648,6 +731,7 @@ export {
   GROUNDING_MIN_COVERAGE,
   stemToken,
   tokenize,
+  spacelessScriptGroundedTokenScore,
   normalizeForExactMatch,
   sourceSentences,
   groundingTokenSequence,
@@ -656,4 +740,4 @@ export {
   areGroundingTokensCompatible,
   hasContradictoryPolarity
 };
-//# sourceMappingURL=chunk-WAS4HV46.js.map
+//# sourceMappingURL=chunk-LNH76ZJX.js.map

package/dist/chunk-LNH76ZJX.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/extraction-source-grounding-helpers.ts"],"sourcesContent":["export function isInterrogativeSourceSentence(sentence: string): boolean {\n  const normalized = sentence.trim();\n  const embeddedQuestionVerbIndex = normalized.search(\n    /\\b(?:determine|know|wonder|ask(?:ed)?|question|decide|check|confirm|find|figure|understand|unclear)\\b/iu,\n  );\n  const embeddedQuestionMarkerIndex = normalized.search(/\\b(?:whether|if)\\b/iu);\n  const hasEmbeddedQuestion = embeddedQuestionVerbIndex >= 0\n    && embeddedQuestionMarkerIndex > embeddedQuestionVerbIndex;\n  return normalized.endsWith(\"?\")\n    || hasEmbeddedQuestion\n    || (\n      !normalized.includes(\":\")\n      && /^(?:suppose|assuming|assume|maybe|perhaps|hypothetically|if|whether|imagine|imagining|presume|presuming|supposing|is|are|am|was|were|do|does|did|can|could|will|would|should|has|have|had|what|which|when|where|why|how|who|whom)\\b/iu.test(\n        normalized,\n      )\n    );\n}\n\nexport function containsContiguousGroundingTokens(\n  candidateTokens: ReadonlyArray<string>,\n  sourceTokens: ReadonlyArray<string>,\n): boolean {\n  if (candidateTokens.length === 0 || candidateTokens.length > sourceTokens.length) return false;\n  return sourceTokens.some((_, start) =>\n    candidateTokens.every((token, offset) => sourceTokens[start + offset] === token),\n  );\n}\n\nexport function hasExplicitRoleSubjectToken(\n  candidateRole: string | undefined,\n  sourceTokensBySentence: ReadonlyArray<ReadonlyArray<string>>,\n): boolean {\n  return candidateRole !== undefined\n    && sourceTokensBySentence.some((tokens) =>\n      tokens.some((token) => token.replace(/^[\\u0000\\u0001]/u, \"\") === candidateRole));\n}\n\nexport function splitGroundingClauses(\n  sentences: ReadonlyArray<string>,\n  inheritCoordinatedSubjects = false,\n): string[] {\n  return sentences.flatMap((sentence) => {\n    const clauses = sentence\n      .split(/,\\s+(?=[\\p{L}][\\p{L}\\p{N}'’-]*\\s+\\S)/gu)\n      .flatMap((commaClause) =>\n        commaClause\n          .split(/\\s*(?::|[—–])\\s+|\\s+\\/\\s+/u)\n          .flatMap((delimiterClause) =>\n            delimiterClause\n              .split(/\\s+(?:and|but|or|while|although|because)\\s+/gu)\n              .map((clause) => clause.trim())\n              .filter((clause) => clause.length > 0),\n          ),\n      );\n    if (!inheritCoordinatedSubjects || clauses.length < 2) return clauses;\n\n    const firstLexemes = groundingLexemes(clauses[0]!)\n      .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true);\n    const firstPredicateIndex = firstLexemes.findIndex(({ isPredicate }) => isPredicate);\n    let subjectLexemes = firstLexemes\n      .slice(0, firstPredicateIndex < 1 ? 1 : firstPredicateIndex)\n      .filter(({ token }) => !token.endsWith(\"ly\"));\n    let subject = subjectLexemes.map(({ surface }) => surface).join(\" \");\n    let predicate = firstLexemes[firstPredicateIndex < 1 ? 1 : firstPredicateIndex]?.surface;\n    if (subject.length === 0 || predicate === undefined) return clauses;\n\n    const sourceSpans = [clauses[0]!];\n    for (const clause of clauses.slice(1)) {\n      const clauseLexemes = groundingLexemes(clause)\n        .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true);\n      const clausePredicateIndex = clauseLexemes.findIndex(({ isPredicate }) => isPredicate);\n      const clauseSubjectLexemes = clausePredicateIndex > 0\n        ? clauseLexemes\n          .slice(0, clausePredicateIndex)\n          .filter(({ token }) => !token.endsWith(\"ly\"))\n        : [];\n      const repeatsSubject = clauseSubjectLexemes.length === subjectLexemes.length\n        && subjectLexemes.every(\n          ({ token }, index) => clauseSubjectLexemes[index]?.token === token,\n        );\n      if (repeatsSubject) {\n        sourceSpans.push(clause);\n        continue;\n      }\n      if (clauseSubjectLexemes.length > 0) {\n        subjectLexemes = clauseSubjectLexemes;\n        subject = subjectLexemes.map(({ surface }) => surface).join(\" \");\n        predicate = clauseLexemes[clausePredicateIndex]?.surface;\n        sourceSpans.push(clause);\n        continue;\n      }\n      const prefix = clausePredicateIndex === -1 ? `${subject} ${predicate}` : subject;\n      sourceSpans.push(clause, `${prefix} ${clause}`);\n    }\n    return sourceSpans;\n  });\n}\n\nexport const GROUNDING_STOPWORDS: Record<string, true> = {\n  a: true,\n  an: true,\n  and: true,\n  are: true,\n  as: true,\n  at: true,\n  be: true,\n  been: true,\n  being: true,\n  but: true,\n  by: true,\n  can: true,\n  could: true,\n  did: true,\n  do: true,\n  does: true,\n  for: true,\n  from: true,\n  had: true,\n  has: true,\n  have: true,\n  he: true,\n  her: true,\n  here: true,\n  hers: true,\n  him: true,\n  his: true,\n  how: true,\n  i: true,\n  if: true,\n  in: true,\n  into: true,\n  is: true,\n  it: true,\n  its: true,\n  just: true,\n  me: true,\n  my: true,\n  no: true,\n  not: true,\n  of: true,\n  on: true,\n  only: true,\n  or: true,\n  our: true,\n  ours: true,\n  she: true,\n  so: true,\n  than: true,\n  that: true,\n  the: true,\n  their: true,\n  them: true,\n  then: true,\n  there: true,\n  these: true,\n  they: true,\n  this: true,\n  those: true,\n  to: true,\n  too: true,\n  under: true,\n  up: true,\n  us: true,\n  very: true,\n  was: true,\n  we: true,\n  were: true,\n  what: true,\n  when: true,\n  why: true,\n  where: true,\n  which: true,\n  who: true,\n  whom: true,\n  will: true,\n  with: true,\n  would: true,\n  you: true,\n  your: true,\n};\n\nexport const GROUNDING_NEGATION_TOKENS = new Set([\n  \"no\",\n  \"not\",\n  \"false\",\n  \"untrue\",\n  \"incorrect\",\n  \"wrong\",\n  \"never\",\n  \"without\",\n  \"neither\",\n  \"nor\",\n  \"none\",\n  \"cannot\",\n  \"cant\",\n  \"can't\",\n  \"don't\",\n  \"doesn't\",\n  \"didn't\",\n  \"isn't\",\n  \"aren't\",\n  \"wasn't\",\n  \"weren't\",\n  \"won't\",\n  \"wouldn't\",\n  \"couldn't\",\n  \"shouldn't\",\n  \"haven't\",\n  \"hasn't\",\n  \"hadn't\",\n]);\n\nexport const GROUNDING_AUXILIARY_TOKENS = new Set([\n  \"am\",\n  \"are\",\n  \"be\",\n  \"been\",\n  \"being\",\n  \"can\",\n  \"could\",\n  \"did\",\n  \"do\",\n  \"does\",\n  \"had\",\n  \"has\",\n  \"have\",\n  \"is\",\n  \"was\",\n  \"were\",\n  \"will\",\n  \"would\",\n  \"should\",\n]);\n\nexport const GROUNDING_COPULAR_FORMS = new Set([\n  \"am\",\n  \"are\",\n  \"be\",\n  \"been\",\n  \"being\",\n  \"is\",\n  \"was\",\n  \"were\",\n]);\n\nexport const GROUNDING_SUBJECT_PRONOUNS = new Set([\n  \"he\",\n  \"she\",\n  \"they\",\n  \"it\",\n  \"i\",\n  \"we\",\n  \"you\",\n]);\nexport const GROUNDING_ENTITY_TYPE_PREFIXES = new Set([\n  \"person\",\n  \"project\",\n  \"tool\",\n  \"company\",\n  \"place\",\n  \"other\",\n]);\n\nexport const GROUNDING_COMMON_VERB_FORMS: Record<string, true> = {\n  add: true,\n  adds: true,\n  call: true,\n  calls: true,\n  contain: true,\n  contains: true,\n  employ: true,\n  deploy: true,\n  deploys: true,\n  design: true,\n  designs: true,\n  employs: true,\n  fill: true,\n  fills: true,\n  go: true,\n  goes: true,\n  gone: true,\n  went: true,\n  give: true,\n  gives: true,\n  has: true,\n  host: true,\n  hosts: true,\n  like: true,\n  likes: true,\n  manage: true,\n  manages: true,\n  make: true,\n  makes: true,\n  need: true,\n  needs: true,\n  own: true,\n  owns: true,\n  plan: true,\n  plans: true,\n  prefer: true,\n  prefers: true,\n  require: true,\n  requires: true,\n  run: true,\n  runs: true,\n  sleep: true,\n  sleeps: true,\n  stop: true,\n  stops: true,\n  swim: true,\n  swims: true,\n  share: true,\n  shares: true,\n  support: true,\n  supports: true,\n  take: true,\n  takes: true,\n  try: true,\n  tries: true,\n  use: true,\n  uses: true,\n  want: true,\n  wants: true,\n  work: true,\n  works: true,\n};\n\n\nexport interface GroundingLexeme {\n  token: string;\n  surface: string;\n  isPredicate: boolean;\n  preserveTerminalS: boolean;\n}\n\nexport function groundingLexemes(text: string): GroundingLexeme[] {\n  const rawTokens = (text.normalize(\"NFKC\").match(\n    /[\\p{L}\\p{N}]+(?:['’][\\p{L}\\p{N}]+)?(?:\\+\\+[\\p{L}\\p{N}]*|#[\\p{L}\\p{N}]*)?/gu,\n  ) ?? []).flatMap(splitSpacelessScriptToken);\n  const tokens = rawTokens.map((rawToken) =>\n    rawToken.replaceAll(\"’\", \"'\").toLocaleLowerCase());\n  let predicateIndex = tokens.findIndex((token, index) => {\n    const previousToken = tokens[index - 1];\n    const followsAuxiliary = previousToken !== undefined\n      && GROUNDING_AUXILIARY_TOKENS.has(previousToken);\n    let previousMeaningfulIndex = index - 1;\n    while (\n      previousMeaningfulIndex >= 0\n      && !GROUNDING_COPULAR_FORMS.has(tokens[previousMeaningfulIndex] ?? \"\")\n      && (\n        GROUNDING_STOPWORDS[tokens[previousMeaningfulIndex] ?? \"\"] === true\n        || (tokens[previousMeaningfulIndex] ?? \"\").endsWith(\"ly\")\n      )\n    ) {\n      previousMeaningfulIndex -= 1;\n    }\n    const followsCopularAuxiliary = GROUNDING_COPULAR_FORMS.has(\n      tokens[previousMeaningfulIndex] ?? \"\",\n    );\n    const capitalized = /^\\p{Lu}/u.test(rawTokens[index] ?? \"\");\n    const terminalSInflection = index > 0\n      && token.endsWith(\"s\")\n      && !token.endsWith(\"ss\")\n      && !GROUNDING_AUXILIARY_TOKENS.has(token);\n    const capitalizedSubjectHasLaterPredicate = index === 0\n      && tokens.some((laterToken, laterIndex) =>\n        laterIndex > 0\n        && !/^\\p{Lu}/u.test(rawTokens[laterIndex] ?? \"\")\n        && (\n          GROUNDING_AUXILIARY_TOKENS.has(laterToken)\n          || GROUNDING_COMMON_VERB_FORMS[laterToken] === true\n          || laterToken.endsWith(\"ed\")\n          || laterToken.endsWith(\"ing\")\n        ));\n    if (capitalized && (index !== 0 || capitalizedSubjectHasLaterPredicate)) return false;\n    if (followsCopularAuxiliary && terminalSInflection) return false;\n    return GROUNDING_COMMON_VERB_FORMS[token] === true\n      || token.endsWith(\"ed\")\n      || token.endsWith(\"ing\")\n      || (followsAuxiliary && !followsCopularAuxiliary)\n      || terminalSInflection;\n  });\n  if (predicateIndex === -1) {\n    const leadingSubjectLength = rawTokens.findIndex((rawToken) => !/^\\p{Lu}/u.test(rawToken));\n    if (leadingSubjectLength > 0) {\n      predicateIndex = tokens.findIndex((token, index) =>\n        index >= leadingSubjectLength\n        && (\n          GROUNDING_AUXILIARY_TOKENS.has(token)\n          || (\n            GROUNDING_STOPWORDS[token] !== true\n            && !/^\\p{Lu}/u.test(rawTokens[index] ?? \"\")\n          )\n        ));\n    }\n  }\n  return rawTokens.map((rawToken, index) => {\n    const token = tokens[index]!;\n    const isPredicate = index === predicateIndex;\n    return {\n      token,\n      surface: rawToken,\n      preserveTerminalS: !isPredicate && (\n        /^\\p{Lu}/u.test(rawToken)\n        || token.endsWith(\"s\")\n      ),\n      isPredicate,\n    };\n  });\n}\n\nexport function tokenSequence(text: string): string[] {\n  return groundingLexemes(text).map(({ token }) => token);\n}\n\nexport function containsExactTokenSequence(candidate: string, source: string): boolean {\n  const candidateTokens = tokenSequence(candidate);\n  const sourceTokens = tokenSequence(source);\n  if (candidateTokens.length === 0 || candidateTokens.length > sourceTokens.length) return false;\n  return sourceTokens.some((_, index) =>\n    candidateTokens.every((token, offset) => sourceTokens[index + offset] === token),\n  );\n\n}\n\nexport function isNegationCue(token: string): boolean {\n  return GROUNDING_NEGATION_TOKENS.has(token) || token.endsWith(\"n't\");\n}\n\nexport function isAttachedNegatedAuxiliary(token: string): boolean {\n  return token.endsWith(\"n't\")\n    || token === \"cannot\"\n    || token === \"cant\"\n    || token === \"can't\";\n}\n\nexport function isNegatedAt(tokens: ReadonlyArray<string>, index: number): boolean {\n  if (tokens[index - 1] === \"only\" && tokens[index - 2] === \"not\") return false;\n  const previousStart = Math.max(0, index - 2);\n  for (let i = previousStart; i < index; i += 1) {\n    if (isNegationCue(tokens[i])) return true;\n  }\n\n  if (tokens[index - 1] === \"than\" && tokens[index - 2] === \"rather\") return true;\n  if (tokens[index - 1] === \"of\" && tokens[index - 2] === \"instead\") return true;\n\n  const next = tokens[index + 1];\n  if (next !== undefined && isAttachedNegatedAuxiliary(next)) return true;\n  const nextNext = tokens[index + 2];\n  return next !== undefined\n    && nextNext !== undefined\n    && GROUNDING_AUXILIARY_TOKENS.has(next)\n    && isNegationCue(nextNext);\n}\n\nexport const GROUNDING_MIN_SHARED_TOKENS = 2;\nexport const GROUNDING_MIN_COVERAGE = 0.5;\n\nconst STRICT_GROUNDING_TOKEN_PREFIX = \"\\u0000\";\nconst INFLECTED_GROUNDING_TOKEN_PREFIX = \"\\u0001\";\n\nexport function stemToken(\n  token: string,\n  preserveTerminalS = false,\n  markExact = false,\n): string {\n  if (token.endsWith(\"'s\")) return token.slice(0, -2);\n  if (preserveTerminalS) {\n    if (!markExact) return token;\n    return `${STRICT_GROUNDING_TOKEN_PREFIX}${token}`;\n  }\n  if (token.length > 5 && token.endsWith(\"ing\")) {\n    const stem = token.slice(0, -3);\n    const inflectionDoubled = /(.)\\1$/u.test(stem) && stem.length > 3 && !/[lsz]$/u.test(stem);\n    const normalized = inflectionDoubled ? stem.slice(0, -1) : stem;\n    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;\n  }\n  if (token.length > 4 && token.endsWith(\"ied\")) {\n    const normalized = `${token.slice(0, -3)}y`;\n    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;\n  }\n  if (token.length > 4 && token.endsWith(\"ed\")) {\n    const stem = token.slice(0, -2);\n    const inflectionDoubled = /(.)\\1$/u.test(stem) && stem.length > 3 && !/[lsz]$/u.test(stem);\n    const normalized = inflectionDoubled ? stem.slice(0, -1) : stem;\n    return markExact ? `${INFLECTED_GROUNDING_TOKEN_PREFIX}${normalized}` : normalized;\n  }\n  if (token.length > 3 && token.endsWith(\"s\") && !token.endsWith(\"ss\")) {\n    return token.endsWith(\"ies\") ? `${token.slice(0, -3)}y` : token.slice(0, -1);\n  }\n  return token;\n}\n\n\nexport function tokenize(text: string): Set<string> {\n  const tokens = new Set<string>();\n  for (const { token, preserveTerminalS } of groundingLexemes(text)) {\n    if (GROUNDING_STOPWORDS[token] !== true) tokens.add(stemToken(token, preserveTerminalS, true));\n  }\n  return tokens;\n}\n\nconst SPACELESS_SCRIPT_CHARACTER_PATTERN = new RegExp(\n  \"[\\\\p{Script=Han}\\\\p{Script=Hiragana}\\\\p{Script=Katakana}\\\\p{Script=Hangul}\"\n    + \"\\\\p{Script=Thai}\\\\p{Script=Lao}\\\\p{Script=Khmer}\\\\p{Script=Myanmar}]\",\n  \"u\",\n);\nconst SPACELESS_SCRIPT_LCS_SOURCE_LIMIT = 4096;\n\nfunction containsSpacelessScriptCharacter(text: string): boolean {\n  return SPACELESS_SCRIPT_CHARACTER_PATTERN.test(text);\n}\n\n/**\n * Scripts without word separators (CJK, Hangul, Thai, ...) must not become one\n * whitespace-delimited token: a paraphrase never matches a whole-run token, so\n * grounded CJK facts and entity names were dropped. Split those runs into\n * per-character lexemes so contiguous-token matching behaves as substring\n * matching for these scripts.\n */\nfunction splitSpacelessScriptToken(rawToken: string): string[] {\n  if (!containsSpacelessScriptCharacter(rawToken)) return [rawToken];\n  const parts: string[] = [];\n  let otherScriptRun = \"\";\n  for (const character of rawToken) {\n    if (containsSpacelessScriptCharacter(character)) {\n      if (otherScriptRun.length > 0) {\n        parts.push(otherScriptRun);\n        otherScriptRun = \"\";\n      }\n      parts.push(character);\n    } else {\n      otherScriptRun += character;\n    }\n  }\n  if (otherScriptRun.length > 0) parts.push(otherScriptRun);\n  return parts;\n}\n\nfunction spacelessScriptCharacterSequence(text: string): string[] {\n  const characters: string[] = [];\n  for (const character of text.normalize(\"NFKC\")) {\n    if (containsSpacelessScriptCharacter(character)) characters.push(character);\n  }\n  return characters;\n}\n\nfunction spacelessScriptCharacterNgrams(text: string): Set<string> {\n  const grams = new Set<string>();\n  let previousCharacter = \"\";\n  for (const character of spacelessScriptCharacterSequence(text)) {\n    if (previousCharacter !== \"\") grams.add(previousCharacter + character);\n    previousCharacter = character;\n  }\n  return grams;\n}\n\nfunction longestCommonSubstringLength(\n  left: ReadonlyArray<string>,\n  right: ReadonlyArray<string>,\n): number {\n  if (left.length === 0 || right.length === 0) return 0;\n  let longest = 0;\n  let previousRow = new Array<number>(right.length).fill(0);\n  for (const leftCharacter of left) {\n    const currentRow = new Array<number>(right.length).fill(0);\n    for (let index = 0; index < right.length; index += 1) {\n      if (leftCharacter !== right[index]) continue;\n      currentRow[index] = (index > 0 ? previousRow[index - 1] : 0) + 1;\n      if (currentRow[index] > longest) longest = currentRow[index];\n    }\n    previousRow = currentRow;\n  }\n  return longest;\n}\n\n/**\n * Script-aware grounding score for candidates written in scripts without word\n * separators. Returns null when the candidate has no such characters, so\n * whitespace-delimited candidates keep the default scorer. The longest-common-\n * span gate rejects topical overlap that shares mostly function characters.\n * ponytail: n-grams and the common-span gate ignore argument order; swap in a\n * segmentation-aware matcher if CJK role confusion surfaces.\n */\nexport function spacelessScriptGroundedTokenScore(candidate: string, source: string): number | null {\n  const candidateGrams = spacelessScriptCharacterNgrams(candidate);\n  if (candidateGrams.size === 0) return null;\n  const sourceGrams = spacelessScriptCharacterNgrams(source);\n  let sharedGrams = 0;\n  for (const gram of candidateGrams) {\n    if (sourceGrams.has(gram)) sharedGrams += 1;\n  }\n  if (sharedGrams < GROUNDING_MIN_SHARED_TOKENS) return 0;\n  const coverage = sharedGrams / candidateGrams.size;\n  if (coverage < GROUNDING_MIN_COVERAGE) return 0;\n  const candidateCharacters = spacelessScriptCharacterSequence(candidate);\n  const sourceCharacters = spacelessScriptCharacterSequence(source);\n  if (sourceCharacters.length <= SPACELESS_SCRIPT_LCS_SOURCE_LIMIT) {\n    const anchoredFraction = longestCommonSubstringLength(candidateCharacters, sourceCharacters)\n      / candidateCharacters.length;\n    if (anchoredFraction < GROUNDING_MIN_COVERAGE) return 0;\n  }\n  const sourceTokens = tokenize(source);\n  for (const token of tokenize(candidate)) {\n    if (containsSpacelessScriptCharacter(token)) continue;\n    if (![...sourceTokens].some((sourceToken) => areGroundingTokensCompatible(token, sourceToken))) {\n      return 0;\n    }\n  }\n  return coverage;\n}\n\nexport function normalizeForExactMatch(text: string): string {\n  return text.normalize(\"NFKC\").toLocaleLowerCase().replace(/\\s+/gu, \" \").trim();\n}\n\nexport function sourceSentences(source: string): string[] {\n  const sentences: string[] = [];\n  let sentenceStart = 0;\n  for (let index = 0; index < source.length; index += 1) {\n    const character = source[index];\n    const nextCharacter = source[index + 1];\n    const boundary = character === \"!\"\n      || character === \"?\"\n      || character === \";\"\n      || character === \"\\n\"\n      || (character === \".\" && (\n        nextCharacter === undefined\n        || /\\s/u.test(nextCharacter)\n        || /[\"')\\]}]/u.test(nextCharacter)\n      ));\n    if (!boundary) continue;\n    let sentenceEnd = character === \"\\n\" ? index : index + 1;\n    while (/[.!?;\\n]/u.test(source[sentenceEnd] ?? \"\")) sentenceEnd += 1;\n    const sentence = source.slice(sentenceStart, sentenceEnd).trim();\n    if (sentence.length > 0) sentences.push(sentence);\n    sentenceStart = sentenceEnd;\n    index = sentenceEnd - 1;\n  }\n  const trailingSentence = source.slice(sentenceStart).trim();\n  if (trailingSentence.length > 0) sentences.push(trailingSentence);\n  return sentences.length > 0 ? sentences : [source];\n}\n\n\nexport function groundingTokenSequence(text: string): string[] {\n  let lexemes = groundingLexemes(text);\n  while (lexemes.length > 0 && GROUNDING_AUXILIARY_TOKENS.has(lexemes[0]!.token)) {\n    lexemes = lexemes.slice(1);\n  }\n  return lexemes\n    .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true)\n    .map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS, true));\n}\nexport function normalizedGroundingAlignmentTokenSequence(text: string): string[] {\n  const normalized = normalizedGroundingTokenSequence(text);\n  const firstLexeme = groundingLexemes(text)[0];\n  if (firstLexeme === undefined || !GROUNDING_SUBJECT_PRONOUNS.has(firstLexeme.token)) {\n    return normalized;\n  }\n  return [stemToken(firstLexeme.token, firstLexeme.preserveTerminalS, true), ...normalized];\n}\n\n\nexport function normalizedGroundingTokenSequence(text: string): string[] {\n  return groundingTokenSequence(text).map((token) => token.replace(/'$/u, \"\"));\n}\n\nexport function areGroundingTokensCompatible(left: string, right: string): boolean {\n  const leftPrefix = left[0];\n  const rightPrefix = right[0];\n  const leftMarked = leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX\n    || leftPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX;\n  const rightMarked = rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX\n    || rightPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX;\n  const leftToken = leftMarked ? left.slice(1) : left;\n  const rightToken = rightMarked ? right.slice(1) : right;\n  if (leftToken === rightToken) {\n    const strictToInflected = (\n      leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX\n      && rightPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX\n    ) || (\n      rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX\n      && leftPrefix === INFLECTED_GROUNDING_TOKEN_PREFIX\n    );\n    return !strictToInflected;\n  }\n  if (leftPrefix === STRICT_GROUNDING_TOKEN_PREFIX || rightPrefix === STRICT_GROUNDING_TOKEN_PREFIX) {\n    return false;\n  }\n  return `${leftToken}e` === rightToken || leftToken === `${rightToken}e`;\n}\nconst GROUNDING_DENIAL_REPORTING_VERBS = new Set([\n  \"deny\",\n  \"denied\",\n  \"denies\",\n  \"denying\",\n  \"dispute\",\n  \"disputed\",\n  \"disputes\",\n  \"disputing\",\n  \"reject\",\n  \"rejected\",\n  \"rejects\",\n  \"rejecting\",\n  \"refute\",\n  \"refuted\",\n  \"refutes\",\n  \"refuting\",\n  \"contradict\",\n  \"contradicted\",\n  \"contradicts\",\n  \"contradicting\",\n  \"disprove\",\n  \"disproved\",\n  \"disproves\",\n  \"disproving\",\n]);\n\nfunction isDenialReportingVerb(token: string): boolean {\n  return GROUNDING_DENIAL_REPORTING_VERBS.has(token);\n}\nconst GROUNDING_NON_ASSERTIVE_REPORTING_VERBS = new Set([\n  \"allege\",\n  \"alleged\",\n  \"alleges\",\n  \"alleging\",\n  \"allegedly\",\n  \"assert\",\n  \"asserted\",\n  \"asserts\",\n  \"asserting\",\n  \"believe\",\n  \"believed\",\n  \"believes\",\n  \"believing\",\n  \"claim\",\n  \"claimed\",\n  \"claims\",\n  \"claiming\",\n  \"doubt\",\n  \"doubted\",\n  \"doubts\",\n  \"doubting\",\n  \"uncertain\",\n  \"unsure\",\n  \"unclear\",\n  \"unknown\",\n  \"possibly\",\n  \"probably\",\n  \"imagine\",\n  \"imagined\",\n  \"imagines\",\n  \"imagining\",\n  \"report\",\n  \"reported\",\n  \"reports\",\n  \"reporting\",\n  \"reportedly\",\n  \"say\",\n  \"said\",\n  \"says\",\n  \"saying\",\n  \"speculate\",\n  \"speculated\",\n  \"speculates\",\n  \"speculating\",\n  \"suspect\",\n  \"suspected\",\n  \"suspects\",\n  \"suspecting\",\n  \"suppose\",\n  \"supposed\",\n  \"supposes\",\n  \"supposing\",\n  \"supposedly\",\n  \"think\",\n  \"thought\",\n  \"thinks\",\n  \"thinking\",\n]);\n\nfunction isNonAssertiveReportingVerb(token: string): boolean {\n  return GROUNDING_NON_ASSERTIVE_REPORTING_VERBS.has(token);\n}\n\nfunction isGroundingClauseBoundary(token: string): boolean {\n  return token === \"and\"\n    || token === \"but\"\n    || token === \"or\"\n    || token === \"while\"\n    || token === \"although\"\n    || token === \"because\";\n}\n\nfunction isNonAssertiveReportingAt(tokens: ReadonlyArray<string>, index: number): boolean {\n  let boundary = 0;\n  for (let cursor = 0; cursor < index; cursor += 1) {\n    if (isGroundingClauseBoundary(tokens[cursor]!)) boundary = cursor + 1;\n  }\n  for (let cursor = index - 1; cursor >= boundary; cursor -= 1) {\n    if (\n      tokens[cursor] === \"that\"\n      && cursor > boundary\n      && isNonAssertiveReportingVerb(tokens[cursor - 1]!)\n    ) {\n      return true;\n    }\n    if (isNonAssertiveReportingVerb(tokens[cursor]!) && index - cursor <= 5) return true;\n  }\n  return false;\n}\n\nfunction isDeniedAt(tokens: ReadonlyArray<string>, index: number): boolean {\n  let boundary = 0;\n  for (let cursor = 0; cursor < index; cursor += 1) {\n    if (isGroundingClauseBoundary(tokens[cursor]!)) boundary = cursor + 1;\n  }\n  for (let cursor = index - 1; cursor >= boundary; cursor -= 1) {\n    const token = tokens[cursor];\n    if (token === \"that\" && cursor > boundary && isDenialReportingVerb(tokens[cursor - 1]!)) {\n      return true;\n    }\n    if (isDenialReportingVerb(token) && index - cursor <= 5) return true;\n  }\n  return false;\n}\n\nexport function hasContradictoryPolarity(candidate: string, source: string): boolean {\n  const candidateLexemes = groundingLexemes(candidate);\n  const candidateTokens = candidateLexemes.map(({ token }) => token);\n  let coherentContradiction = false;\n  for (const clause of sourceSentences(source).flatMap((sentence) =>\n    sentence.split(/\\s+(?:and|but|or|while|although|because)\\s+/gu))) {\n    const sourceLexemes = groundingLexemes(clause);\n    const sourceTokens = sourceLexemes.map(({ token }) => token);\n    let sourceCursor = 0;\n    let allTokensFound = true;\n    let contradiction = false;\n    for (const [candidateIndex, candidateToken] of candidateTokens.entries()) {\n      if (GROUNDING_STOPWORDS[candidateToken] === true) continue;\n      const sourceIndex = sourceTokens.findIndex(\n        (sourceToken, index) =>\n          index >= sourceCursor\n          && stemToken(sourceToken, sourceLexemes[index]?.preserveTerminalS === true)\n            === stemToken(candidateToken, candidateLexemes[candidateIndex]?.preserveTerminalS === true),\n      );\n      if (sourceIndex === -1) {\n        allTokensFound = false;\n        break;\n      }\n      const candidateNegated = isNegatedAt(candidateTokens, candidateIndex)\n        || isDeniedAt(candidateTokens, candidateIndex);\n      const sourceNegated = isNegatedAt(sourceTokens, sourceIndex)\n        || isDeniedAt(sourceTokens, sourceIndex);\n      const candidateNonAssertive = isNonAssertiveReportingAt(candidateTokens, candidateIndex);\n      const sourceNonAssertive = isNonAssertiveReportingAt(sourceTokens, sourceIndex);\n      if (\n        candidateNegated !== sourceNegated\n        || candidateNonAssertive !== sourceNonAssertive\n      ) {\n        contradiction = true;\n      }\n      sourceCursor = sourceIndex + 1;\n    }\n    if (allTokensFound) {\n      if (!contradiction) return false;\n      coherentContradiction = true;\n    }\n  }\n  if (coherentContradiction) return true;\n\n  const sourceLexemes = groundingLexemes(source);\n  const sourceTokens = sourceLexemes.map(({ token }) => token);\n  const sourcePositions = new Map<string, number[]>();\n  sourceLexemes.forEach(({ token, preserveTerminalS }, index) => {\n    const key = stemToken(token, preserveTerminalS);\n    const positions = sourcePositions.get(key);\n    if (positions) positions.push(index);\n    else sourcePositions.set(key, [index]);\n  });\n  for (const [candidateIndex, token] of candidateTokens.entries()) {\n    if (GROUNDING_STOPWORDS[token] === true) continue;\n    const positions = sourcePositions.get(\n      stemToken(token, candidateLexemes[candidateIndex]?.preserveTerminalS === true),\n    );\n    if (!positions || positions.length === 0) continue;\n    const sourceIndex = positions[positions.length - 1];\n    const candidateNegated = isNegatedAt(candidateTokens, candidateIndex)\n      || isDeniedAt(candidateTokens, candidateIndex);\n    const sourceNegated = isNegatedAt(sourceTokens, sourceIndex)\n      || isDeniedAt(sourceTokens, sourceIndex);\n    const candidateNonAssertive = isNonAssertiveReportingAt(candidateTokens, candidateIndex);\n    const sourceNonAssertive = isNonAssertiveReportingAt(sourceTokens, sourceIndex);\n    if (\n      candidateNegated !== sourceNegated\n      || candidateNonAssertive !== sourceNonAssertive\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n"],"mappings":";AAAO,SAAS,8BAA8B,UAA2B;AACvE,QAAM,aAAa,SAAS,KAAK;AACjC,QAAM,4BAA4B,WAAW;AAAA,IAC3C;AAAA,EACF;AACA,QAAM,8BAA8B,WAAW,OAAO,sBAAsB;AAC5E,QAAM,sBAAsB,6BAA6B,KACpD,8BAA8B;AACnC,SAAO,WAAW,SAAS,GAAG,KACzB,uBAED,CAAC,WAAW,SAAS,GAAG,KACrB,wOAAwO;AAAA,IACzO;AAAA,EACF;AAEN;AAEO,SAAS,kCACd,iBACA,cACS;AACT,MAAI,gBAAgB,WAAW,KAAK,gBAAgB,SAAS,aAAa,OAAQ,QAAO;AACzF,SAAO,aAAa;AAAA,IAAK,CAAC,GAAG,UAC3B,gBAAgB,MAAM,CAAC,OAAO,WAAW,aAAa,QAAQ,MAAM,MAAM,KAAK;AAAA,EACjF;AACF;AAEO,SAAS,4BACd,eACA,wBACS;AACT,SAAO,kBAAkB,UACpB,uBAAuB,KAAK,CAAC,WAC9B,OAAO,KAAK,CAAC,UAAU,MAAM,QAAQ,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACrF;AAEO,SAAS,sBACd,WACA,6BAA6B,OACnB;AACV,SAAO,UAAU,QAAQ,CAAC,aAAa;AACrC,UAAM,UAAU,SACb,MAAM,wCAAwC,EAC9C;AAAA,MAAQ,CAAC,gBACR,YACG,MAAM,4BAA4B,EAClC;AAAA,QAAQ,CAAC,oBACR,gBACG,MAAM,+CAA+C,EACrD,IAAI,CAAC,WAAW,OAAO,KAAK,CAAC,EAC7B,OAAO,CAAC,WAAW,OAAO,SAAS,CAAC;AAAA,MACzC;AAAA,IACJ;AACF,QAAI,CAAC,8BAA8B,QAAQ,SAAS,EAAG,QAAO;AAE9D,UAAM,eAAe,iBAAiB,QAAQ,CAAC,CAAE,EAC9C,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI;AAC5D,UAAM,sBAAsB,aAAa,UAAU,CAAC,EAAE,YAAY,MAAM,WAAW;AACnF,QAAI,iBAAiB,aAClB,MAAM,GAAG,sBAAsB,IAAI,IAAI,mBAAmB,EAC1D,OAAO,CAAC,EAAE,MAAM,MAAM,CAAC,MAAM,SAAS,IAAI,CAAC;AAC9C,QAAI,UAAU,eAAe,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO,EAAE,KAAK,GAAG;AACnE,QAAI,YAAY,aAAa,sBAAsB,IAAI,IAAI,mBAAmB,GAAG;AACjF,QAAI,QAAQ,WAAW,KAAK,cAAc,OAAW,QAAO;AAE5D,UAAM,cAAc,CAAC,QAAQ,CAAC,CAAE;AAChC,eAAW,UAAU,QAAQ,MAAM,CAAC,GAAG;AACrC,YAAM,gBAAgB,iBAAiB,MAAM,EAC1C,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI;AAC5D,YAAM,uBAAuB,cAAc,UAAU,CAAC,EAAE,YAAY,MAAM,WAAW;AACrF,YAAM,uBAAuB,uBAAuB,IAChD,cACC,MAAM,GAAG,oBAAoB,EAC7B,OAAO,CAAC,EAAE,MAAM,MAAM,CAAC,MAAM,SAAS,IAAI,CAAC,IAC5C,CAAC;AACL,YAAM,iBAAiB,qBAAqB,WAAW,eAAe,UACjE,eAAe;AAAA,QAChB,CAAC,EAAE,MAAM,GAAG,UAAU,qBAAqB,KAAK,GAAG,UAAU;AAAA,MAC/D;AACF,UAAI,gBAAgB;AAClB,oBAAY,KAAK,MAAM;AACvB;AAAA,MACF;AACA,UAAI,qBAAqB,SAAS,GAAG;AACnC,yBAAiB;AACjB,kBAAU,eAAe,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO,EAAE,KAAK,GAAG;AAC/D,oBAAY,cAAc,oBAAoB,GAAG;AACjD,oBAAY,KAAK,MAAM;AACvB;AAAA,MACF;AACA,YAAM,SAAS,yBAAyB,KAAK,GAAG,OAAO,IAAI,SAAS,KAAK;AACzE,kBAAY,KAAK,QAAQ,GAAG,MAAM,IAAI,MAAM,EAAE;AAAA,IAChD;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEO,IAAM,sBAA4C;AAAA,EACvD,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,OAAO;AAAA,EACP,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,KAAK;AAAA,EACL,KAAK;AAAA,EACL,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,KAAK;AAAA,EACL,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,OAAO;AAAA,EACP,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AACR;AAEO,IAAM,4BAA4B,oBAAI,IAAI;AAAA,EAC/C;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,CAAC;AAEM,IAAM,6BAA6B,oBAAI,IAAI;AAAA,EAChD;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,CAAC;AAEM,IAAM,0BAA0B,oBAAI,IAAI;AAAA,EAC7C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,6BAA6B,oBAAI,IAAI;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACM,IAAM,iCAAiC,oBAAI,IAAI;AAAA,EACpD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,IAAM,8BAAoD;AAAA,EAC/D,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,SAAS;AAAA,EACT,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,MAAM;AAAA,EACN,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AAAA,EACV,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,UAAU;AAAA,EACV,MAAM;AAAA,EACN,OAAO;AAAA,EACP,KAAK;AAAA,EACL,OAAO;AAAA,EACP,KAAK;AAAA,EACL,MAAM;AAAA,EACN,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,OAAO;AACT;AAUO,SAAS,iBAAiB,MAAiC;AAChE,QAAM,aAAa,KAAK,UAAU,MAAM,EAAE;AAAA,IACxC;AAAA,EACF,KAAK,CAAC,GAAG,QAAQ,yBAAyB;AAC1C,QAAM,SAAS,UAAU,IAAI,CAAC,aAC5B,SAAS,WAAW,UAAK,GAAG,EAAE,kBAAkB,CAAC;AACnD,MAAI,iBAAiB,OAAO,UAAU,CAAC,OAAO,UAAU;AACtD,UAAM,gBAAgB,OAAO,QAAQ,CAAC;AACtC,UAAM,mBAAmB,kBAAkB,UACtC,2BAA2B,IAAI,aAAa;AACjD,QAAI,0BAA0B,QAAQ;AACtC,WACE,2BAA2B,KACxB,CAAC,wBAAwB,IAAI,OAAO,uBAAuB,KAAK,EAAE,MAEnE,oBAAoB,OAAO,uBAAuB,KAAK,EAAE,MAAM,SAC3D,OAAO,uBAAuB,KAAK,IAAI,SAAS,IAAI,IAE1D;AACA,iCAA2B;AAAA,IAC7B;AACA,UAAM,0BAA0B,wBAAwB;AAAA,MACtD,OAAO,uBAAuB,KAAK;AAAA,IACrC;AACA,UAAM,cAAc,WAAW,KAAK,UAAU,KAAK,KAAK,EAAE;AAC1D,UAAM,sBAAsB,QAAQ,KAC/B,MAAM,SAAS,GAAG,KAClB,CAAC,MAAM,SAAS,IAAI,KACpB,CAAC,2BAA2B,IAAI,KAAK;AAC1C,UAAM,sCAAsC,UAAU,KACjD,OAAO,KAAK,CAAC,YAAY,eAC1B,aAAa,KACV,CAAC,WAAW,KAAK,UAAU,UAAU,KAAK,EAAE,MAE7C,2BAA2B,IAAI,UAAU,KACtC,4BAA4B,UAAU,MAAM,QAC5C,WAAW,SAAS,IAAI,KACxB,WAAW,SAAS,KAAK,EAC7B;AACL,QAAI,gBAAgB,UAAU,KAAK,qCAAsC,QAAO;AAChF,QAAI,2BAA2B,oBAAqB,QAAO;AAC3D,WAAO,4BAA4B,KAAK,MAAM,QACzC,MAAM,SAAS,IAAI,KACnB,MAAM,SAAS,KAAK,KACnB,oBAAoB,CAAC,2BACtB;AAAA,EACP,CAAC;AACD,MAAI,mBAAmB,IAAI;AACzB,UAAM,uBAAuB,UAAU,UAAU,CAAC,aAAa,CAAC,WAAW,KAAK,QAAQ,CAAC;AACzF,QAAI,uBAAuB,GAAG;AAC5B,uBAAiB,OAAO,UAAU,CAAC,OAAO,UACxC,SAAS,yBAEP,2BAA2B,IAAI,KAAK,KAElC,oBAAoB,KAAK,MAAM,QAC5B,CAAC,WAAW,KAAK,UAAU,KAAK,KAAK,EAAE,EAE7C;AAAA,IACL;AAAA,EACF;AACA,SAAO,UAAU,IAAI,CAAC,UAAU,UAAU;AACxC,UAAM,QAAQ,OAAO,KAAK;AAC1B,UAAM,cAAc,UAAU;AAC9B,WAAO;AAAA,MACL;AAAA,MACA,SAAS;AAAA,MACT,mBAAmB,CAAC,gBAClB,WAAW,KAAK,QAAQ,KACrB,MAAM,SAAS,GAAG;AAAA,MAEvB;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEO,SAAS,cAAc,MAAwB;AACpD,SAAO,iBAAiB,IAAI,EAAE,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK;AACxD;AAEO,SAAS,2BAA2B,WAAmB,QAAyB;AACrF,QAAM,kBAAkB,cAAc,SAAS;AAC/C,QAAM,eAAe,cAAc,MAAM;AACzC,MAAI,gBAAgB,WAAW,KAAK,gBAAgB,SAAS,aAAa,OAAQ,QAAO;AACzF,SAAO,aAAa;AAAA,IAAK,CAAC,GAAG,UAC3B,gBAAgB,MAAM,CAAC,OAAO,WAAW,aAAa,QAAQ,MAAM,MAAM,KAAK;AAAA,EACjF;AAEF;AAEO,SAAS,cAAc,OAAwB;AACpD,SAAO,0BAA0B,IAAI,KAAK,KAAK,MAAM,SAAS,KAAK;AACrE;AAEO,SAAS,2BAA2B,OAAwB;AACjE,SAAO,MAAM,SAAS,KAAK,KACtB,UAAU,YACV,UAAU,UACV,UAAU;AACjB;AAEO,SAAS,YAAY,QAA+B,OAAwB;AACjF,MAAI,OAAO,QAAQ,CAAC,MAAM,UAAU,OAAO,QAAQ,CAAC,MAAM,MAAO,QAAO;AACxE,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,CAAC;AAC3C,WAAS,IAAI,eAAe,IAAI,OAAO,KAAK,GAAG;AAC7C,QAAI,cAAc,OAAO,CAAC,CAAC,EAAG,QAAO;AAAA,EACvC;AAEA,MAAI,OAAO,QAAQ,CAAC,MAAM,UAAU,OAAO,QAAQ,CAAC,MAAM,SAAU,QAAO;AAC3E,MAAI,OAAO,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,UAAW,QAAO;AAE1E,QAAM,OAAO,OAAO,QAAQ,CAAC;AAC7B,MAAI,SAAS,UAAa,2BAA2B,IAAI,EAAG,QAAO;AACnE,QAAM,WAAW,OAAO,QAAQ,CAAC;AACjC,SAAO,SAAS,UACX,aAAa,UACb,2BAA2B,IAAI,IAAI,KACnC,cAAc,QAAQ;AAC7B;AAEO,IAAM,8BAA8B;AACpC,IAAM,yBAAyB;AAEtC,IAAM,gCAAgC;AACtC,IAAM,mCAAmC;AAElC,SAAS,UACd,OACA,oBAAoB,OACpB,YAAY,OACJ;AACR,MAAI,MAAM,SAAS,IAAI,EAAG,QAAO,MAAM,MAAM,GAAG,EAAE;AAClD,MAAI,mBAAmB;AACrB,QAAI,CAAC,UAAW,QAAO;AACvB,WAAO,GAAG,6BAA6B,GAAG,KAAK;AAAA,EACjD;AACA,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG;AAC7C,UAAM,OAAO,MAAM,MAAM,GAAG,EAAE;AAC9B,UAAM,oBAAoB,UAAU,KAAK,IAAI,KAAK,KAAK,SAAS,KAAK,CAAC,UAAU,KAAK,IAAI;AACzF,UAAM,aAAa,oBAAoB,KAAK,MAAM,GAAG,EAAE,IAAI;AAC3D,WAAO,YAAY,GAAG,gCAAgC,GAAG,UAAU,KAAK;AAAA,EAC1E;AACA,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG;AAC7C,UAAM,aAAa,GAAG,MAAM,MAAM,GAAG,EAAE,CAAC;AACxC,WAAO,YAAY,GAAG,gCAAgC,GAAG,UAAU,KAAK;AAAA,EAC1E;AACA,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,IAAI,GAAG;AAC5C,UAAM,OAAO,MAAM,MAAM,GAAG,EAAE;AAC9B,UAAM,oBAAoB,UAAU,KAAK,IAAI,KAAK,KAAK,SAAS,KAAK,CAAC,UAAU,KAAK,IAAI;AACzF,UAAM,aAAa,oBAAoB,KAAK,MAAM,GAAG,EAAE,IAAI;AAC3D,WAAO,YAAY,GAAG,gCAAgC,GAAG,UAAU,KAAK;AAAA,EAC1E;AACA,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI,GAAG;AACpE,WAAO,MAAM,SAAS,KAAK,IAAI,GAAG,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,MAAM,MAAM,GAAG,EAAE;AAAA,EAC7E;AACA,SAAO;AACT;AAGO,SAAS,SAAS,MAA2B;AAClD,QAAM,SAAS,oBAAI,IAAY;AAC/B,aAAW,EAAE,OAAO,kBAAkB,KAAK,iBAAiB,IAAI,GAAG;AACjE,QAAI,oBAAoB,KAAK,MAAM,KAAM,QAAO,IAAI,UAAU,OAAO,mBAAmB,IAAI,CAAC;AAAA,EAC/F;AACA,SAAO;AACT;AAEA,IAAM,qCAAqC,IAAI;AAAA,EAC7C;AAAA,EAEA;AACF;AACA,IAAM,oCAAoC;AAE1C,SAAS,iCAAiC,MAAuB;AAC/D,SAAO,mCAAmC,KAAK,IAAI;AACrD;AASA,SAAS,0BAA0B,UAA4B;AAC7D,MAAI,CAAC,iCAAiC,QAAQ,EAAG,QAAO,CAAC,QAAQ;AACjE,QAAM,QAAkB,CAAC;AACzB,MAAI,iBAAiB;AACrB,aAAW,aAAa,UAAU;AAChC,QAAI,iCAAiC,SAAS,GAAG;AAC/C,UAAI,eAAe,SAAS,GAAG;AAC7B,cAAM,KAAK,cAAc;AACzB,yBAAiB;AAAA,MACnB;AACA,YAAM,KAAK,SAAS;AAAA,IACtB,OAAO;AACL,wBAAkB;AAAA,IACpB;AAAA,EACF;AACA,MAAI,eAAe,SAAS,EAAG,OAAM,KAAK,cAAc;AACxD,SAAO;AACT;AAEA,SAAS,iCAAiC,MAAwB;AAChE,QAAM,aAAuB,CAAC;AAC9B,aAAW,aAAa,KAAK,UAAU,MAAM,GAAG;AAC9C,QAAI,iCAAiC,SAAS,EAAG,YAAW,KAAK,SAAS;AAAA,EAC5E;AACA,SAAO;AACT;AAEA,SAAS,+BAA+B,MAA2B;AACjE,QAAM,QAAQ,oBAAI,IAAY;AAC9B,MAAI,oBAAoB;AACxB,aAAW,aAAa,iCAAiC,IAAI,GAAG;AAC9D,QAAI,sBAAsB,GAAI,OAAM,IAAI,oBAAoB,SAAS;AACrE,wBAAoB;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,6BACP,MACA,OACQ;AACR,MAAI,KAAK,WAAW,KAAK,MAAM,WAAW,EAAG,QAAO;AACpD,MAAI,UAAU;AACd,MAAI,cAAc,IAAI,MAAc,MAAM,MAAM,EAAE,KAAK,CAAC;AACxD,aAAW,iBAAiB,MAAM;AAChC,UAAM,aAAa,IAAI,MAAc,MAAM,MAAM,EAAE,KAAK,CAAC;AACzD,aAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,UAAI,kBAAkB,MAAM,KAAK,EAAG;AACpC,iBAAW,KAAK,KAAK,QAAQ,IAAI,YAAY,QAAQ,CAAC,IAAI,KAAK;AAC/D,UAAI,WAAW,KAAK,IAAI,QAAS,WAAU,WAAW,KAAK;AAAA,IAC7D;AACA,kBAAc;AAAA,EAChB;AACA,SAAO;AACT;AAUO,SAAS,kCAAkC,WAAmB,QAA+B;AAClG,QAAM,iBAAiB,+BAA+B,SAAS;AAC/D,MAAI,eAAe,SAAS,EAAG,QAAO;AACtC,QAAM,cAAc,+BAA+B,MAAM;AACzD,MAAI,cAAc;AAClB,aAAW,QAAQ,gBAAgB;AACjC,QAAI,YAAY,IAAI,IAAI,EAAG,gBAAe;AAAA,EAC5C;AACA,MAAI,cAAc,4BAA6B,QAAO;AACtD,QAAM,WAAW,cAAc,eAAe;AAC9C,MAAI,WAAW,uBAAwB,QAAO;AAC9C,QAAM,sBAAsB,iCAAiC,SAAS;AACtE,QAAM,mBAAmB,iCAAiC,MAAM;AAChE,MAAI,iBAAiB,UAAU,mCAAmC;AAChE,UAAM,mBAAmB,6BAA6B,qBAAqB,gBAAgB,IACvF,oBAAoB;AACxB,QAAI,mBAAmB,uBAAwB,QAAO;AAAA,EACxD;AACA,QAAM,eAAe,SAAS,MAAM;AACpC,aAAW,SAAS,SAAS,SAAS,GAAG;AACvC,QAAI,iCAAiC,KAAK,EAAG;AAC7C,QAAI,CAAC,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,gBAAgB,6BAA6B,OAAO,WAAW,CAAC,GAAG;AAC9F,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,uBAAuB,MAAsB;AAC3D,SAAO,KAAK,UAAU,MAAM,EAAE,kBAAkB,EAAE,QAAQ,SAAS,GAAG,EAAE,KAAK;AAC/E;AAEO,SAAS,gBAAgB,QAA0B;AACxD,QAAM,YAAsB,CAAC;AAC7B,MAAI,gBAAgB;AACpB,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrD,UAAM,YAAY,OAAO,KAAK;AAC9B,UAAM,gBAAgB,OAAO,QAAQ,CAAC;AACtC,UAAM,WAAW,cAAc,OAC1B,cAAc,OACd,cAAc,OACd,cAAc,QACb,cAAc,QAChB,kBAAkB,UACf,MAAM,KAAK,aAAa,KACxB,YAAY,KAAK,aAAa;AAErC,QAAI,CAAC,SAAU;AACf,QAAI,cAAc,cAAc,OAAO,QAAQ,QAAQ;AACvD,WAAO,YAAY,KAAK,OAAO,WAAW,KAAK,EAAE,EAAG,gBAAe;AACnE,UAAM,WAAW,OAAO,MAAM,eAAe,WAAW,EAAE,KAAK;AAC/D,QAAI,SAAS,SAAS,EAAG,WAAU,KAAK,QAAQ;AAChD,oBAAgB;AAChB,YAAQ,cAAc;AAAA,EACxB;AACA,QAAM,mBAAmB,OAAO,MAAM,aAAa,EAAE,KAAK;AAC1D,MAAI,iBAAiB,SAAS,EAAG,WAAU,KAAK,gBAAgB;AAChE,SAAO,UAAU,SAAS,IAAI,YAAY,CAAC,MAAM;AACnD;AAGO,SAAS,uBAAuB,MAAwB;AAC7D,MAAI,UAAU,iBAAiB,IAAI;AACnC,SAAO,QAAQ,SAAS,KAAK,2BAA2B,IAAI,QAAQ,CAAC,EAAG,KAAK,GAAG;AAC9E,cAAU,QAAQ,MAAM,CAAC;AAAA,EAC3B;AACA,SAAO,QACJ,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI,EACzD,IAAI,CAAC,EAAE,OAAO,kBAAkB,MAAM,UAAU,OAAO,mBAAmB,IAAI,CAAC;AACpF;AACO,SAAS,0CAA0C,MAAwB;AAChF,QAAM,aAAa,iCAAiC,IAAI;AACxD,QAAM,cAAc,iBAAiB,IAAI,EAAE,CAAC;AAC5C,MAAI,gBAAgB,UAAa,CAAC,2BAA2B,IAAI,YAAY,KAAK,GAAG;AACnF,WAAO;AAAA,EACT;AACA,SAAO,CAAC,UAAU,YAAY,OAAO,YAAY,mBAAmB,IAAI,GAAG,GAAG,UAAU;AAC1F;AAGO,SAAS,iCAAiC,MAAwB;AACvE,SAAO,uBAAuB,IAAI,EAAE,IAAI,CAAC,UAAU,MAAM,QAAQ,OAAO,EAAE,CAAC;AAC7E;AAEO,SAAS,6BAA6B,MAAc,OAAwB;AACjF,QAAM,aAAa,KAAK,CAAC;AACzB,QAAM,cAAc,MAAM,CAAC;AAC3B,QAAM,aAAa,eAAe,iCAC7B,eAAe;AACpB,QAAM,cAAc,gBAAgB,iCAC/B,gBAAgB;AACrB,QAAM,YAAY,aAAa,KAAK,MAAM,CAAC,IAAI;AAC/C,QAAM,aAAa,cAAc,MAAM,MAAM,CAAC,IAAI;AAClD,MAAI,cAAc,YAAY;AAC5B,UAAM,oBACJ,eAAe,iCACZ,gBAAgB,oCAEnB,gBAAgB,iCACb,eAAe;AAEpB,WAAO,CAAC;AAAA,EACV;AACA,MAAI,eAAe,iCAAiC,gBAAgB,+BAA+B;AACjG,WAAO;AAAA,EACT;AACA,SAAO,GAAG,SAAS,QAAQ,cAAc,cAAc,GAAG,UAAU;AACtE;AACA,IAAM,mCAAmC,oBAAI,IAAI;AAAA,EAC/C;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,CAAC;AAED,SAAS,sBAAsB,OAAwB;AACrD,SAAO,iCAAiC,IAAI,KAAK;AACnD;AACA,IAAM,0CAA0C,oBAAI,IAAI;AAAA,EACtD;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;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,4BAA4B,OAAwB;AAC3D,SAAO,wCAAwC,IAAI,KAAK;AAC1D;AAEA,SAAS,0BAA0B,OAAwB;AACzD,SAAO,UAAU,SACZ,UAAU,SACV,UAAU,QACV,UAAU,WACV,UAAU,cACV,UAAU;AACjB;AAEA,SAAS,0BAA0B,QAA+B,OAAwB;AACxF,MAAI,WAAW;AACf,WAAS,SAAS,GAAG,SAAS,OAAO,UAAU,GAAG;AAChD,QAAI,0BAA0B,OAAO,MAAM,CAAE,EAAG,YAAW,SAAS;AAAA,EACtE;AACA,WAAS,SAAS,QAAQ,GAAG,UAAU,UAAU,UAAU,GAAG;AAC5D,QACE,OAAO,MAAM,MAAM,UAChB,SAAS,YACT,4BAA4B,OAAO,SAAS,CAAC,CAAE,GAClD;AACA,aAAO;AAAA,IACT;AACA,QAAI,4BAA4B,OAAO,MAAM,CAAE,KAAK,QAAQ,UAAU,EAAG,QAAO;AAAA,EAClF;AACA,SAAO;AACT;AAEA,SAAS,WAAW,QAA+B,OAAwB;AACzE,MAAI,WAAW;AACf,WAAS,SAAS,GAAG,SAAS,OAAO,UAAU,GAAG;AAChD,QAAI,0BAA0B,OAAO,MAAM,CAAE,EAAG,YAAW,SAAS;AAAA,EACtE;AACA,WAAS,SAAS,QAAQ,GAAG,UAAU,UAAU,UAAU,GAAG;AAC5D,UAAM,QAAQ,OAAO,MAAM;AAC3B,QAAI,UAAU,UAAU,SAAS,YAAY,sBAAsB,OAAO,SAAS,CAAC,CAAE,GAAG;AACvF,aAAO;AAAA,IACT;AACA,QAAI,sBAAsB,KAAK,KAAK,QAAQ,UAAU,EAAG,QAAO;AAAA,EAClE;AACA,SAAO;AACT;AAEO,SAAS,yBAAyB,WAAmB,QAAyB;AACnF,QAAM,mBAAmB,iBAAiB,SAAS;AACnD,QAAM,kBAAkB,iBAAiB,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK;AACjE,MAAI,wBAAwB;AAC5B,aAAW,UAAU,gBAAgB,MAAM,EAAE,QAAQ,CAAC,aACpD,SAAS,MAAM,+CAA+C,CAAC,GAAG;AAClE,UAAMA,iBAAgB,iBAAiB,MAAM;AAC7C,UAAMC,gBAAeD,eAAc,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK;AAC3D,QAAI,eAAe;AACnB,QAAI,iBAAiB;AACrB,QAAI,gBAAgB;AACpB,eAAW,CAAC,gBAAgB,cAAc,KAAK,gBAAgB,QAAQ,GAAG;AACxE,UAAI,oBAAoB,cAAc,MAAM,KAAM;AAClD,YAAM,cAAcC,cAAa;AAAA,QAC/B,CAAC,aAAa,UACZ,SAAS,gBACN,UAAU,aAAaD,eAAc,KAAK,GAAG,sBAAsB,IAAI,MACpE,UAAU,gBAAgB,iBAAiB,cAAc,GAAG,sBAAsB,IAAI;AAAA,MAChG;AACA,UAAI,gBAAgB,IAAI;AACtB,yBAAiB;AACjB;AAAA,MACF;AACA,YAAM,mBAAmB,YAAY,iBAAiB,cAAc,KAC/D,WAAW,iBAAiB,cAAc;AAC/C,YAAM,gBAAgB,YAAYC,eAAc,WAAW,KACtD,WAAWA,eAAc,WAAW;AACzC,YAAM,wBAAwB,0BAA0B,iBAAiB,cAAc;AACvF,YAAM,qBAAqB,0BAA0BA,eAAc,WAAW;AAC9E,UACE,qBAAqB,iBAClB,0BAA0B,oBAC7B;AACA,wBAAgB;AAAA,MAClB;AACA,qBAAe,cAAc;AAAA,IAC/B;AACA,QAAI,gBAAgB;AAClB,UAAI,CAAC,cAAe,QAAO;AAC3B,8BAAwB;AAAA,IAC1B;AAAA,EACF;AACA,MAAI,sBAAuB,QAAO;AAElC,QAAM,gBAAgB,iBAAiB,MAAM;AAC7C,QAAM,eAAe,cAAc,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK;AAC3D,QAAM,kBAAkB,oBAAI,IAAsB;AAClD,gBAAc,QAAQ,CAAC,EAAE,OAAO,kBAAkB,GAAG,UAAU;AAC7D,UAAM,MAAM,UAAU,OAAO,iBAAiB;AAC9C,UAAM,YAAY,gBAAgB,IAAI,GAAG;AACzC,QAAI,UAAW,WAAU,KAAK,KAAK;AAAA,QAC9B,iBAAgB,IAAI,KAAK,CAAC,KAAK,CAAC;AAAA,EACvC,CAAC;AACD,aAAW,CAAC,gBAAgB,KAAK,KAAK,gBAAgB,QAAQ,GAAG;AAC/D,QAAI,oBAAoB,KAAK,MAAM,KAAM;AACzC,UAAM,YAAY,gBAAgB;AAAA,MAChC,UAAU,OAAO,iBAAiB,cAAc,GAAG,sBAAsB,IAAI;AAAA,IAC/E;AACA,QAAI,CAAC,aAAa,UAAU,WAAW,EAAG;AAC1C,UAAM,cAAc,UAAU,UAAU,SAAS,CAAC;AAClD,UAAM,mBAAmB,YAAY,iBAAiB,cAAc,KAC/D,WAAW,iBAAiB,cAAc;AAC/C,UAAM,gBAAgB,YAAY,cAAc,WAAW,KACtD,WAAW,cAAc,WAAW;AACzC,UAAM,wBAAwB,0BAA0B,iBAAiB,cAAc;AACvF,UAAM,qBAAqB,0BAA0B,cAAc,WAAW;AAC9E,QACE,qBAAqB,iBAClB,0BAA0B,oBAC7B;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;","names":["sourceLexemes","sourceTokens"]}

package/dist/{chunk-VYMICVRA.js → chunk-LQNBQEMC.js}

@@ -1,7 +1,7 @@
 import {
   SupportPassportCreateGrantRequestSchema,
   defineOperation
-} from "./chunk-BPQ7L27U.js";
+} from "./chunk-MIM7QT6H.js";
 import {
   SupportPassportCardCategorySchema,
   SupportPassportMemoryIdSchema,
@@ -220,4 +220,4 @@ var supportPassportGrantAskOperation = defineOperation({
     result: await ctx.service.supportPassportAskGrant(grantId, secret, question, ctx.abortSignal)
   })
 });
-//# sourceMappingURL=chunk-VYMICVRA.js.map
+//# sourceMappingURL=chunk-LQNBQEMC.js.map

package/dist/{chunk-J6QIAYNR.js → chunk-LVXBC6YB.js}

@@ -92,6 +92,11 @@ async function loadDaySummaryPrompt() {
   }
   return EMBEDDED_DAY_SUMMARY_PROMPT;
 }
+var FSI = "\u2068";
+var PDI = "\u2069";
+function bidiIsolate(text) {
+  return `${FSI}${text}${PDI}`;
+}
 function formatDaySummaryMemories(memories) {
   if (typeof memories === "string") {
     return memories.trim();
@@ -100,7 +105,7 @@ function formatDaySummaryMemories(memories) {
     const category = memory.frontmatter.category || "fact";
     const created = memory.frontmatter.created || "unknown";
     return `[${memory.frontmatter.id}] (${category}, ${created})
-${memory.content}`;
+${bidiIsolate(memory.content)}`;
   }).join("\n\n").trim();
 }
 async function buildExtensionsFooterForSummary(config) {
@@ -116,4 +121,4 @@ export {
   formatDaySummaryMemories,
   buildExtensionsFooterForSummary
 };
-//# sourceMappingURL=chunk-J6QIAYNR.js.map
+//# sourceMappingURL=chunk-LVXBC6YB.js.map

package/dist/{chunk-J6QIAYNR.js.map → chunk-LVXBC6YB.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/day-summary.ts"],"sourcesContent":["import path from \"node:path\";\nimport { fileURLToPath } from \"node:url\";\nimport { log } from \"./logger.js\";\nimport type { MemoryFile, PluginConfig } from \"./types.js\";\nimport { discoverMemoryExtensions, renderExtensionsFooter, resolveExtensionsRoot } from \"./memory-extension-host/index.js\";\nimport { resolvePipelineProcessingCapabilities } from \"./capabilities.js\";\n\nconst PROMPT_RELATIVE_PATH = path.join(\"prompts\", \"day_summary.prompt.md\");\n\n// Embedded fallback prompt for packaged/plugin-install builds where\n// prompts/day_summary.prompt.md may not be present in the runtime bundle.\nconst EMBEDDED_DAY_SUMMARY_PROMPT = `# Baseline day-summary prompt\n\nYou are writing an Engram end-of-day summary.\n\nYour job:\n- compress the day into a short, useful recap\n- prioritize concrete events, decisions, mood/energy signals, and open loops\n- include a few practical next actions for tomorrow\n- avoid hype, fluff, therapy-speak, and invented facts\n\nOutput JSON with these keys:\n- \\`summary\\` — one short paragraph\n- \\`bullets\\` — 2 to 5 bullets with the most important moments\n- \\`next_actions\\` — 1 to 3 concrete actions\n- \\`risks_or_open_loops\\` — 0 to 3 things that still need attention\n\nRules:\n- stay grounded in the input only\n- if the day was mixed, say so plainly\n- do not overstate confidence or importance\n- prefer specific verbs over vague abstractions\n\nBrevity:\n- keep the summary under 90 words\n- keep bullets short and information-dense\n- omit anything that does not change what tomorrow should care about\n\nStructure:\n- \\`summary\\` should be one paragraph only\n- \\`bullets\\` should contain the most important moments, not generic restatements\n- \\`next_actions\\` and \\`risks_or_open_loops\\` should be distinct and non-overlapping\n\nRisk:\n- explicitly surface unresolved blockers, dependencies, or fragile assumptions\n- do not bury open loops inside the summary if they deserve separate attention\n\nTone:\n- sound like a clear internal daily note, not a report template\n- stay natural and direct while remaining compact`;\n\nfunction candidateRoots(): string[] {\n  const currentFile = fileURLToPath(import.meta.url);\n  const here = path.dirname(currentFile);\n  const candidates = [path.resolve(here, \"..\"), path.resolve(here, \"..\", \"..\")];\n\n  const seen = new Set<string>();\n  return candidates.filter((candidate) => {\n    const normalized = path.resolve(candidate);\n    if (seen.has(normalized)) return false;\n    seen.add(normalized);\n    return true;\n  });\n}\n\nasync function resolvePromptPath(): Promise<string | null> {\n  const { existsSync } = await import(\"node:fs\");\n  for (const root of candidateRoots()) {\n    const candidate = path.join(root, PROMPT_RELATIVE_PATH);\n    if (existsSync(candidate)) {\n      return candidate;\n    }\n  }\n  return null;\n}\n\nexport async function loadDaySummaryPrompt(): Promise<string> {\n  const promptPath = await resolvePromptPath();\n  if (promptPath) {\n    try {\n      const { readFile } = await import(\"node:fs/promises\");\n      const raw = await readFile(promptPath, \"utf-8\");\n      // CRLF-compatible regex: allow \\r\\n or \\n line endings\n      const match = raw.match(/```(?:[a-zA-Z0-9_-]+)?\\r?\\n([\\s\\S]*?)\\r?\\n```/);\n      if (match?.[1]) {\n        return match[1].trim();\n      }\n      log.warn(\"day summary prompt file does not contain a fenced prompt block; using embedded fallback\");\n    } catch (err) {\n      log.warn(`day summary prompt file read failed; using embedded fallback: ${err}`);\n    }\n  }\n  return EMBEDDED_DAY_SUMMARY_PROMPT;\n}\n\nexport function formatDaySummaryMemories(memories: string | MemoryFile[]): string {\n  if (typeof memories === \"string\") {\n    return memories.trim();\n  }\n\n  return memories\n    .map((memory) => {\n      const category = memory.frontmatter.category || \"fact\";\n      const created = memory.frontmatter.created || \"unknown\";\n      return `[${memory.frontmatter.id}] (${category}, ${created})\\n${memory.content}`;\n    })\n    .join(\"\\n\\n\")\n    .trim();\n}\n\n/**\n * Build a one-line extension footer for day-summary and summary-snapshot contexts.\n * Returns \"\" when extensions are disabled or none are found.\n */\nexport async function buildExtensionsFooterForSummary(\n  config: PluginConfig,\n): Promise<string> {\n  if (!resolvePipelineProcessingCapabilities(config).memoryExtensions) return \"\";\n  const root = resolveExtensionsRoot(config);\n  const extensions = await discoverMemoryExtensions(root, log);\n  if (extensions.length === 0) return \"\";\n  return renderExtensionsFooter(extensions);\n}\n"],"mappings":";;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,qBAAqB;AAM9B,IAAM,uBAAuB,KAAK,KAAK,WAAW,uBAAuB;AAIzE,IAAM,8BAA8B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAwCpC,SAAS,iBAA2B;AAClC,QAAM,cAAc,cAAc,YAAY,GAAG;AACjD,QAAM,OAAO,KAAK,QAAQ,WAAW;AACrC,QAAM,aAAa,CAAC,KAAK,QAAQ,MAAM,IAAI,GAAG,KAAK,QAAQ,MAAM,MAAM,IAAI,CAAC;AAE5E,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO,WAAW,OAAO,CAAC,cAAc;AACtC,UAAM,aAAa,KAAK,QAAQ,SAAS;AACzC,QAAI,KAAK,IAAI,UAAU,EAAG,QAAO;AACjC,SAAK,IAAI,UAAU;AACnB,WAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAe,oBAA4C;AACzD,QAAM,EAAE,WAAW,IAAI,MAAM,OAAO,IAAS;AAC7C,aAAW,QAAQ,eAAe,GAAG;AACnC,UAAM,YAAY,KAAK,KAAK,MAAM,oBAAoB;AACtD,QAAI,WAAW,SAAS,GAAG;AACzB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,uBAAwC;AAC5D,QAAM,aAAa,MAAM,kBAAkB;AAC3C,MAAI,YAAY;AACd,QAAI;AACF,YAAM,EAAE,SAAS,IAAI,MAAM,OAAO,aAAkB;AACpD,YAAM,MAAM,MAAM,SAAS,YAAY,OAAO;AAE9C,YAAM,QAAQ,IAAI,MAAM,+CAA+C;AACvE,UAAI,QAAQ,CAAC,GAAG;AACd,eAAO,MAAM,CAAC,EAAE,KAAK;AAAA,MACvB;AACA,UAAI,KAAK,yFAAyF;AAAA,IACpG,SAAS,KAAK;AACZ,UAAI,KAAK,iEAAiE,GAAG,EAAE;AAAA,IACjF;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,yBAAyB,UAAyC;AAChF,MAAI,OAAO,aAAa,UAAU;AAChC,WAAO,SAAS,KAAK;AAAA,EACvB;AAEA,SAAO,SACJ,IAAI,CAAC,WAAW;AACf,UAAM,WAAW,OAAO,YAAY,YAAY;AAChD,UAAM,UAAU,OAAO,YAAY,WAAW;AAC9C,WAAO,IAAI,OAAO,YAAY,EAAE,MAAM,QAAQ,KAAK,OAAO;AAAA,EAAM,OAAO,OAAO;AAAA,EAChF,CAAC,EACA,KAAK,MAAM,EACX,KAAK;AACV;AAMA,eAAsB,gCACpB,QACiB;AACjB,MAAI,CAAC,sCAAsC,MAAM,EAAE,iBAAkB,QAAO;AAC5E,QAAM,OAAO,sBAAsB,MAAM;AACzC,QAAM,aAAa,MAAM,yBAAyB,MAAM,GAAG;AAC3D,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,SAAO,uBAAuB,UAAU;AAC1C;","names":[]}
+{"version":3,"sources":["../src/day-summary.ts"],"sourcesContent":["import path from \"node:path\";\nimport { fileURLToPath } from \"node:url\";\nimport { log } from \"./logger.js\";\nimport type { MemoryFile, PluginConfig } from \"./types.js\";\nimport { discoverMemoryExtensions, renderExtensionsFooter, resolveExtensionsRoot } from \"./memory-extension-host/index.js\";\nimport { resolvePipelineProcessingCapabilities } from \"./capabilities.js\";\n\nconst PROMPT_RELATIVE_PATH = path.join(\"prompts\", \"day_summary.prompt.md\");\n\n// Embedded fallback prompt for packaged/plugin-install builds where\n// prompts/day_summary.prompt.md may not be present in the runtime bundle.\nconst EMBEDDED_DAY_SUMMARY_PROMPT = `# Baseline day-summary prompt\n\nYou are writing an Engram end-of-day summary.\n\nYour job:\n- compress the day into a short, useful recap\n- prioritize concrete events, decisions, mood/energy signals, and open loops\n- include a few practical next actions for tomorrow\n- avoid hype, fluff, therapy-speak, and invented facts\n\nOutput JSON with these keys:\n- \\`summary\\` — one short paragraph\n- \\`bullets\\` — 2 to 5 bullets with the most important moments\n- \\`next_actions\\` — 1 to 3 concrete actions\n- \\`risks_or_open_loops\\` — 0 to 3 things that still need attention\n\nRules:\n- stay grounded in the input only\n- if the day was mixed, say so plainly\n- do not overstate confidence or importance\n- prefer specific verbs over vague abstractions\n\nBrevity:\n- keep the summary under 90 words\n- keep bullets short and information-dense\n- omit anything that does not change what tomorrow should care about\n\nStructure:\n- \\`summary\\` should be one paragraph only\n- \\`bullets\\` should contain the most important moments, not generic restatements\n- \\`next_actions\\` and \\`risks_or_open_loops\\` should be distinct and non-overlapping\n\nRisk:\n- explicitly surface unresolved blockers, dependencies, or fragile assumptions\n- do not bury open loops inside the summary if they deserve separate attention\n\nTone:\n- sound like a clear internal daily note, not a report template\n- stay natural and direct while remaining compact`;\n\nfunction candidateRoots(): string[] {\n  const currentFile = fileURLToPath(import.meta.url);\n  const here = path.dirname(currentFile);\n  const candidates = [path.resolve(here, \"..\"), path.resolve(here, \"..\", \"..\")];\n\n  const seen = new Set<string>();\n  return candidates.filter((candidate) => {\n    const normalized = path.resolve(candidate);\n    if (seen.has(normalized)) return false;\n    seen.add(normalized);\n    return true;\n  });\n}\n\nasync function resolvePromptPath(): Promise<string | null> {\n  const { existsSync } = await import(\"node:fs\");\n  for (const root of candidateRoots()) {\n    const candidate = path.join(root, PROMPT_RELATIVE_PATH);\n    if (existsSync(candidate)) {\n      return candidate;\n    }\n  }\n  return null;\n}\n\nexport async function loadDaySummaryPrompt(): Promise<string> {\n  const promptPath = await resolvePromptPath();\n  if (promptPath) {\n    try {\n      const { readFile } = await import(\"node:fs/promises\");\n      const raw = await readFile(promptPath, \"utf-8\");\n      // CRLF-compatible regex: allow \\r\\n or \\n line endings\n      const match = raw.match(/```(?:[a-zA-Z0-9_-]+)?\\r?\\n([\\s\\S]*?)\\r?\\n```/);\n      if (match?.[1]) {\n        return match[1].trim();\n      }\n      log.warn(\"day summary prompt file does not contain a fenced prompt block; using embedded fallback\");\n    } catch (err) {\n      log.warn(`day summary prompt file read failed; using embedded fallback: ${err}`);\n    }\n  }\n  return EMBEDDED_DAY_SUMMARY_PROMPT;\n}\n\nconst FSI = \"\\u2068\"; // FIRST STRONG ISOLATE\nconst PDI = \"\\u2069\"; // POP DIRECTIONAL ISOLATE\n\n/**\n * Wrap user content in Unicode bidi isolates so RTL text (Arabic, Hebrew)\n * cannot reorder the surrounding Latin labels on the same composed line.\n * No visible change for LTR content (issue #2198).\n */\nfunction bidiIsolate(text: string): string {\n  return `${FSI}${text}${PDI}`;\n}\n\nexport function formatDaySummaryMemories(memories: string | MemoryFile[]): string {\n  if (typeof memories === \"string\") {\n    return memories.trim();\n  }\n\n  return memories\n    .map((memory) => {\n      const category = memory.frontmatter.category || \"fact\";\n      const created = memory.frontmatter.created || \"unknown\";\n      return `[${memory.frontmatter.id}] (${category}, ${created})\\n${bidiIsolate(memory.content)}`;\n    })\n    .join(\"\\n\\n\")\n    .trim();\n}\n\n/**\n * Build a one-line extension footer for day-summary and summary-snapshot contexts.\n * Returns \"\" when extensions are disabled or none are found.\n */\nexport async function buildExtensionsFooterForSummary(\n  config: PluginConfig,\n): Promise<string> {\n  if (!resolvePipelineProcessingCapabilities(config).memoryExtensions) return \"\";\n  const root = resolveExtensionsRoot(config);\n  const extensions = await discoverMemoryExtensions(root, log);\n  if (extensions.length === 0) return \"\";\n  return renderExtensionsFooter(extensions);\n}\n"],"mappings":";;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,qBAAqB;AAM9B,IAAM,uBAAuB,KAAK,KAAK,WAAW,uBAAuB;AAIzE,IAAM,8BAA8B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAwCpC,SAAS,iBAA2B;AAClC,QAAM,cAAc,cAAc,YAAY,GAAG;AACjD,QAAM,OAAO,KAAK,QAAQ,WAAW;AACrC,QAAM,aAAa,CAAC,KAAK,QAAQ,MAAM,IAAI,GAAG,KAAK,QAAQ,MAAM,MAAM,IAAI,CAAC;AAE5E,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO,WAAW,OAAO,CAAC,cAAc;AACtC,UAAM,aAAa,KAAK,QAAQ,SAAS;AACzC,QAAI,KAAK,IAAI,UAAU,EAAG,QAAO;AACjC,SAAK,IAAI,UAAU;AACnB,WAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAe,oBAA4C;AACzD,QAAM,EAAE,WAAW,IAAI,MAAM,OAAO,IAAS;AAC7C,aAAW,QAAQ,eAAe,GAAG;AACnC,UAAM,YAAY,KAAK,KAAK,MAAM,oBAAoB;AACtD,QAAI,WAAW,SAAS,GAAG;AACzB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,uBAAwC;AAC5D,QAAM,aAAa,MAAM,kBAAkB;AAC3C,MAAI,YAAY;AACd,QAAI;AACF,YAAM,EAAE,SAAS,IAAI,MAAM,OAAO,aAAkB;AACpD,YAAM,MAAM,MAAM,SAAS,YAAY,OAAO;AAE9C,YAAM,QAAQ,IAAI,MAAM,+CAA+C;AACvE,UAAI,QAAQ,CAAC,GAAG;AACd,eAAO,MAAM,CAAC,EAAE,KAAK;AAAA,MACvB;AACA,UAAI,KAAK,yFAAyF;AAAA,IACpG,SAAS,KAAK;AACZ,UAAI,KAAK,iEAAiE,GAAG,EAAE;AAAA,IACjF;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,MAAM;AACZ,IAAM,MAAM;AAOZ,SAAS,YAAY,MAAsB;AACzC,SAAO,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG;AAC5B;AAEO,SAAS,yBAAyB,UAAyC;AAChF,MAAI,OAAO,aAAa,UAAU;AAChC,WAAO,SAAS,KAAK;AAAA,EACvB;AAEA,SAAO,SACJ,IAAI,CAAC,WAAW;AACf,UAAM,WAAW,OAAO,YAAY,YAAY;AAChD,UAAM,UAAU,OAAO,YAAY,WAAW;AAC9C,WAAO,IAAI,OAAO,YAAY,EAAE,MAAM,QAAQ,KAAK,OAAO;AAAA,EAAM,YAAY,OAAO,OAAO,CAAC;AAAA,EAC7F,CAAC,EACA,KAAK,MAAM,EACX,KAAK;AACV;AAMA,eAAsB,gCACpB,QACiB;AACjB,MAAI,CAAC,sCAAsC,MAAM,EAAE,iBAAkB,QAAO;AAC5E,QAAM,OAAO,sBAAsB,MAAM;AACzC,QAAM,aAAa,MAAM,yBAAyB,MAAM,GAAG;AAC3D,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,SAAO,uBAAuB,UAAU;AAC1C;","names":[]}

package/dist/{chunk-IVKIODHO.js → chunk-MB6GLPRY.js}

@@ -1,3 +1,6 @@
+import {
+  ChatTransport
+} from "./chunk-JUXOTY6J.js";
 import {
   SingleFlightProbe,
   extractNonRecoverableBackendReason,
@@ -8,9 +11,6 @@ import {
   resolveUnavailableVerdict,
   waitForRetryBackoff
 } from "./chunk-WKDFJXW5.js";
-import {
-  ChatTransport
-} from "./chunk-JUXOTY6J.js";
 import {
   estimateTokenCount
 } from "./chunk-TOTT6S2V.js";
@@ -1096,4 +1096,4 @@ var LocalLlmClient = class _LocalLlmClient {
 export {
   LocalLlmClient
 };
-//# sourceMappingURL=chunk-IVKIODHO.js.map
+//# sourceMappingURL=chunk-MB6GLPRY.js.map

package/dist/{chunk-BPQ7L27U.js → chunk-MIM7QT6H.js}

@@ -8,7 +8,7 @@ import {
 } from "./chunk-GDB4J2H3.js";
 import {
   importCapsule
-} from "./chunk-6433HV72.js";
+} from "./chunk-MVIYRRVJ.js";
 import {
   buildCodingGraphInstallHint,
   tryLoadCodingGraphModule
@@ -34,18 +34,18 @@ import {
 import {
   planSessionTranscriptMigration
 } from "./chunk-P5FPO2BR.js";
-import {
-  decideDisclosureEscalation
-} from "./chunk-H7XKCNR6.js";
 import {
   toRecallExplainJson
 } from "./chunk-3F3CVVDS.js";
 import {
   estimateRecallTokens
 } from "./chunk-QICOU4RY.js";
+import {
+  decideDisclosureEscalation
+} from "./chunk-H7XKCNR6.js";
 import {
   readAggregateExtractionWatermark
-} from "./chunk-QTXNS3HB.js";
+} from "./chunk-WCWIV2JH.js";
 import {
   ReplicaDivergenceMonitor
 } from "./chunk-CVILPI77.js";
@@ -81,19 +81,19 @@ import {
 } from "./chunk-NLE6TSLG.js";
 import {
   LocalLlmClient
-} from "./chunk-IVKIODHO.js";
+} from "./chunk-MB6GLPRY.js";
 import {
   buildProcedurePersistBody,
   normalizeProcedureSteps
 } from "./chunk-QDW3E4RD.js";
+import {
+  lcmEvidenceIdentity
+} from "./chunk-C37ZRXX7.js";
 import {
   persistExplicitCapture,
   queueExplicitCaptureForReview,
   validateExplicitCaptureInput
 } from "./chunk-NS5ETDYD.js";
-import {
-  lcmEvidenceIdentity
-} from "./chunk-C37ZRXX7.js";
 import {
   boundRecallContextComposition,
   composeRecallContext,
@@ -106,11 +106,11 @@ import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact,
   runMemoryGovernance
-} from "./chunk-3TDAA7VA.js";
+} from "./chunk-6NMZXEJ7.js";
 import {
   CorpusWatermarkCache,
   computeServiceCorpusCensus
-} from "./chunk-MYI3RKI6.js";
+} from "./chunk-SYU5JOBQ.js";
 import {
   CrossNamespaceBudget,
   toBudgetWarning
@@ -134,17 +134,17 @@ import {
   enqueuePassiveCorrectionNotification,
   parseBriefingFocus,
   parseBriefingWindow
-} from "./chunk-YTXNDEUS.js";
+} from "./chunk-FEP45MYY.js";
 import {
   parseEntityFile,
   parseFrontmatter,
   qmdCollectionPathParts,
   qmdResultPathCandidates,
   selfDeps
-} from "./chunk-Q5XKKDFQ.js";
+} from "./chunk-5SZ6CLGJ.js";
 import {
   namespaceCollectionName
-} from "./chunk-AJRJDXYR.js";
+} from "./chunk-E7MYSCSL.js";
 import {
   DEFAULT_RECALL_DISCLOSURE,
   isRecallDisclosure
@@ -189,7 +189,7 @@ import {
 } from "./chunk-JV3C2MNQ.js";
 import {
   exportCapsule
-} from "./chunk-VDX2J7OX.js";
+} from "./chunk-5W7CTZ2E.js";
 import {
   evaluateActionConfidence
 } from "./chunk-Z2YFLXHU.js";
@@ -17670,4 +17670,4 @@ export {
   EngramAccessService,
   AccessAdminOpsSurface
 };
-//# sourceMappingURL=chunk-BPQ7L27U.js.map
+//# sourceMappingURL=chunk-MIM7QT6H.js.map