@remnic/core 9.57.5 → 9.58.0

package/dist/{chunk-JLNBQWZ2.js → chunk-5JMAGU26.js}

@@ -1,3 +1,7 @@
+import {
+  estimateTokenCount
+} from "./chunk-TOTT6S2V.js";
+
 // src/memory-extension-host/host-discovery.ts
 import { readdir, readFile, lstat, realpath } from "fs/promises";
 import path from "path";
@@ -225,9 +229,6 @@ function resolveExtensionsRoot(config) {
 }
 
 // src/memory-extension-host/render-extensions-block.ts
-function estimateTokens(text) {
-  return Math.ceil(text.length / 4);
-}
 function renderExtensionsBlock(extensions) {
   if (extensions.length === 0) return "";
   const header = `## Active memory extensions
@@ -238,7 +239,7 @@ extension produces or curates.
 
 `;
   let budget = REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT;
-  budget -= estimateTokens(header);
+  budget -= estimateTokenCount(header);
   const inlined = [];
   const omitted = [];
   for (const ext of extensions) {
@@ -248,7 +249,7 @@ ${ext.instructions}
 \`\`\`
 
 `;
-    const cost = estimateTokens(block);
+    const cost = estimateTokenCount(block);
     if (cost <= budget) {
       inlined.push(block);
       budget -= cost;
@@ -277,4 +278,4 @@ export {
   renderExtensionsBlock,
   renderExtensionsFooter
 };
-//# sourceMappingURL=chunk-JLNBQWZ2.js.map
+//# sourceMappingURL=chunk-5JMAGU26.js.map

package/dist/{chunk-JLNBQWZ2.js.map → chunk-5JMAGU26.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/memory-extension-host/host-discovery.ts","../src/memory-extension-host/render-extensions-block.ts"],"sourcesContent":["/**\n * memory-extension-host/host-discovery.ts — Discover third-party memory extensions.\n *\n * Scans a root directory (typically ~/.remnic/memory_extensions/) for valid\n * extension subdirectories. Each extension must contain an instructions.md.\n * The discovery process is read-only and NEVER reads or executes files under\n * any extension's scripts/ directory.\n */\n\nimport { readdir, readFile, lstat, realpath } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport type { LoggerBackend } from \"../logger.js\";\nimport type { PluginConfig } from \"../types.js\";\nimport type { DiscoveredExtension, ExtensionSchema } from \"./types.js\";\n\n/** Total token budget for all discovered extension instructions combined. */\nexport const REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT = 5_000;\n\n/** Per-extension instructions read cap, using the same 4 chars/token budget heuristic. */\nexport const REMNIC_EXTENSION_INSTRUCTIONS_BYTE_LIMIT =\n  REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT * 4;\n\n/** Optional schemas are metadata only; refuse unusually large schema files. */\nexport const REMNIC_EXTENSION_SCHEMA_BYTE_LIMIT = 64 * 1024;\n\n/** Maximum number of example files collected per extension. */\nconst MAX_EXAMPLES_PER_EXTENSION = 10;\n\n/** Slug validation: lowercase letters, digits, hyphens, 1-64 chars. */\nconst VALID_SLUG_RE = /^[a-z0-9][a-z0-9-]{0,63}$/;\n\nconst VALID_MEMORY_TYPES = new Set([\"fact\", \"preference\", \"procedure\", \"reference\"]);\n\n/**\n * Discover all valid memory extensions under the given root directory.\n *\n * Returns extensions sorted by name. Skips entries with warnings when:\n * - The slug is invalid (not lowercase alphanumeric + hyphens, or > 64 chars)\n * - instructions.md is missing\n * - schema.json is malformed (extension still returned but schema is undefined)\n *\n * NEVER reads files under any extension's scripts/ directory.\n */\nexport async function discoverMemoryExtensions(\n  root: string,\n  log: Pick<LoggerBackend, \"warn\" | \"debug\">,\n): Promise<DiscoveredExtension[]> {\n  // If root doesn't exist, return empty silently (not even a warning).\n  // Use lstat() for root — a symlinked extensions root could redirect\n  // discovery to an untrusted directory tree (#428 P2).  When the root\n  // IS a symlink, resolve it and verify it still lives under the parent\n  // memory directory so that an attacker-controlled symlink can't point\n  // discovery at /etc or another user's home.\n  let rootStat;\n  try {\n    rootStat = await lstat(root);\n  } catch {\n    return [];\n  }\n  if (rootStat.isSymbolicLink()) {\n    // Resolve and verify the real path is inside the expected parent.\n    let resolved: string;\n    try {\n      resolved = await realpath(root);\n    } catch {\n      return [];\n    }\n    // Normalize the parent path through realpath so that:\n    // 1. Relative roots (e.g. \"memory_extensions\") become absolute (#431 Finding 1)\n    // 2. Intermediate symlinks (e.g. macOS /var -> /private/var) are resolved (#431 Finding 2)\n    let expectedParent: string;\n    try {\n      expectedParent = await realpath(path.resolve(path.dirname(root)));\n    } catch {\n      // Parent directory doesn't exist or is inaccessible — reject.\n      return [];\n    }\n    if (!resolved.startsWith(expectedParent + path.sep) && resolved !== expectedParent) {\n      log.warn?.(\n        `[memory-extensions] root \"${root}\" is a symlink resolving outside the expected parent directory, skipping`,\n      );\n      return [];\n    }\n    // Re-check the resolved path is a directory.\n    try {\n      rootStat = await lstat(resolved);\n    } catch {\n      return [];\n    }\n  }\n  if (!rootStat.isDirectory()) {\n    return [];\n  }\n\n  let entries: string[];\n  try {\n    entries = await readdir(root);\n  } catch {\n    return [];\n  }\n\n  const extensions: DiscoveredExtension[] = [];\n\n  for (const entry of entries) {\n    const entryPath = path.join(root, entry);\n\n    // Must be a real directory (not a symlink) — lstat() blocks symlink\n    // traversal that could escape the extensions root (#382 P2).\n    let entryStat;\n    try {\n      entryStat = await lstat(entryPath);\n    } catch {\n      continue;\n    }\n    if (entryStat.isSymbolicLink()) {\n      log.warn?.(\n        `[memory-extensions] skipping \"${entry}\": symlinks are not followed for security`,\n      );\n      continue;\n    }\n    if (!entryStat.isDirectory()) continue;\n\n    // Validate slug\n    if (!VALID_SLUG_RE.test(entry)) {\n      log.warn?.(\n        `[memory-extensions] skipping \"${entry}\": invalid slug (must be lowercase alphanumeric + hyphens, 1-64 chars)`,\n      );\n      continue;\n    }\n\n    // Require instructions.md — reject symlinked files (#428 P1)\n    const instructionsPath = path.join(entryPath, \"instructions.md\");\n    if (await isSymlink(instructionsPath)) {\n      log.warn?.(\n        `[memory-extensions] skipping \"${entry}\": instructions.md is a symlink`,\n      );\n      continue;\n    }\n    let instructions: string;\n    try {\n      instructions = await readUtf8FileWithinLimit(\n        instructionsPath,\n        REMNIC_EXTENSION_INSTRUCTIONS_BYTE_LIMIT,\n      );\n    } catch (err) {\n      const reason = err instanceof FileTooLargeError\n        ? `instructions.md exceeds ${REMNIC_EXTENSION_INSTRUCTIONS_BYTE_LIMIT} bytes`\n        : \"missing instructions.md\";\n      log.warn?.(`[memory-extensions] skipping \"${entry}\": ${reason}`);\n      continue;\n    }\n\n    // Read optional schema.json — reject symlinked files (#428 P1)\n    let schema: ExtensionSchema | undefined;\n    const schemaPath = path.join(entryPath, \"schema.json\");\n    if (await isSymlink(schemaPath)) {\n      log.warn?.(\n        `[memory-extensions] \"${entry}\": schema.json is a symlink, ignoring schema`,\n      );\n    } else {\n      try {\n        const schemaRaw = await readUtf8FileWithinLimit(\n          schemaPath,\n          REMNIC_EXTENSION_SCHEMA_BYTE_LIMIT,\n        );\n        const parsed = JSON.parse(schemaRaw);\n        if (typeof parsed === \"object\" && parsed !== null && !Array.isArray(parsed)) {\n          schema = validateSchema(parsed);\n        } else {\n          log.warn?.(\n            `[memory-extensions] \"${entry}\": schema.json is not a valid object, ignoring schema`,\n          );\n        }\n      } catch (err) {\n        // File doesn't exist → fine, no warning needed\n        if (isFileNotFoundError(err)) {\n          // schema remains undefined\n        } else if (err instanceof FileTooLargeError) {\n          log.warn?.(\n            `[memory-extensions] \"${entry}\": schema.json exceeds ${REMNIC_EXTENSION_SCHEMA_BYTE_LIMIT} bytes, ignoring schema`,\n          );\n        } else {\n          log.warn?.(\n            `[memory-extensions] \"${entry}\": malformed schema.json, ignoring schema`,\n          );\n        }\n      }\n    }\n\n    // Collect examples/*.md (cap at MAX_EXAMPLES_PER_EXTENSION)\n    // NEVER read from scripts/ directory\n    const examplesPaths: string[] = [];\n    const examplesDir = path.join(entryPath, \"examples\");\n    try {\n      const examplesStat = await lstat(examplesDir);\n      if (examplesStat.isSymbolicLink()) {\n        log.warn?.(\n          `[memory-extensions] \"${entry}\": examples/ is a symlink, ignoring examples`,\n        );\n        throw new Error(\"skip symlinked examples directory\");\n      }\n      if (!examplesStat.isDirectory()) {\n        throw new Error(\"skip non-directory examples path\");\n      }\n      const exampleEntries = await readdir(examplesDir);\n      const mdFiles = exampleEntries\n        .filter((f) => f.endsWith(\".md\"))\n        .sort()\n        .slice(0, MAX_EXAMPLES_PER_EXTENSION);\n      for (const f of mdFiles) {\n        const examplePath = path.join(examplesDir, f);\n        const exampleStat = await lstat(examplePath);\n        if (exampleStat.isSymbolicLink()) {\n          log.warn?.(\n            `[memory-extensions] \"${entry}\": examples/${f} is a symlink, ignoring example`,\n          );\n          continue;\n        }\n        if (!exampleStat.isFile()) {\n          continue;\n        }\n        examplesPaths.push(examplePath);\n      }\n    } catch {\n      // No examples dir — fine\n    }\n\n    extensions.push({\n      name: entry,\n      root: entryPath,\n      instructionsPath,\n      instructions,\n      schema,\n      examplesPaths,\n    });\n  }\n\n  // Sort by name for deterministic ordering\n  extensions.sort((a, b) => {\n    if (a.name < b.name) return -1;\n    if (a.name > b.name) return 1;\n    return 0;\n  });\n\n  return extensions;\n}\n\nclass FileTooLargeError extends Error {\n  constructor(filePath: string, limitBytes: number, actualBytes: number) {\n    super(`${filePath} is ${actualBytes} bytes; limit is ${limitBytes} bytes`);\n    this.name = \"FileTooLargeError\";\n  }\n}\n\nasync function readUtf8FileWithinLimit(filePath: string, limitBytes: number): Promise<string> {\n  const stat = await lstat(filePath);\n  if (!stat.isFile()) {\n    throw new Error(`${filePath} is not a file`);\n  }\n  if (stat.size > limitBytes) {\n    throw new FileTooLargeError(filePath, limitBytes, stat.size);\n  }\n  return readFile(filePath, \"utf-8\");\n}\n\nfunction validateSchema(raw: Record<string, unknown>): ExtensionSchema {\n  const memoryTypes: ExtensionSchema[\"memoryTypes\"] = (() => {\n    if (!Array.isArray(raw.memoryTypes)) return undefined;\n    const valid = raw.memoryTypes.filter(\n      (t): t is \"fact\" | \"preference\" | \"procedure\" | \"reference\" =>\n        typeof t === \"string\" && VALID_MEMORY_TYPES.has(t),\n    );\n    return valid.length > 0 ? valid : undefined;\n  })();\n\n  const groupingHints: ExtensionSchema[\"groupingHints\"] = (() => {\n    if (!Array.isArray(raw.groupingHints)) return undefined;\n    const valid = raw.groupingHints.filter(\n      (h): h is string => typeof h === \"string\" && h.length > 0,\n    );\n    return valid.length > 0 ? valid : undefined;\n  })();\n\n  const version: ExtensionSchema[\"version\"] =\n    typeof raw.version === \"string\" && raw.version.length > 0\n      ? raw.version\n      : undefined;\n\n  return {\n    ...(memoryTypes ? { memoryTypes } : {}),\n    ...(groupingHints ? { groupingHints } : {}),\n    ...(version ? { version } : {}),\n  };\n}\n\nfunction isFileNotFoundError(err: unknown): boolean {\n  return (\n    typeof err === \"object\" &&\n    err !== null &&\n    \"code\" in err &&\n    (err as { code: string }).code === \"ENOENT\"\n  );\n}\n\n/**\n * Returns true if the path exists and is a symlink.\n * Returns false if the path does not exist or is not a symlink.\n */\nasync function isSymlink(filePath: string): Promise<boolean> {\n  try {\n    const s = await lstat(filePath);\n    return s.isSymbolicLink();\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Resolve the memory extensions root directory from config.\n * If memoryExtensionsRoot is empty, derive from memoryDir by going up to\n * the Remnic home dir and appending memory_extensions.\n *\n * Moved here from semantic-consolidation.ts (#428 Finding 3) because this\n * is a generic config-to-path resolver with no consolidation logic.\n */\nexport function resolveExtensionsRoot(config: PluginConfig): string {\n  if (config.memoryExtensionsRoot.length > 0) {\n    return config.memoryExtensionsRoot;\n  }\n  // Default: memoryDir is typically ~/.openclaw/workspace/memory/local\n  // Go up to the parent that owns the memory tree and append memory_extensions\n  return path.join(path.dirname(config.memoryDir), \"memory_extensions\");\n}\n","/**\n * memory-extension-host/render-extensions-block.ts — Render discovered extensions\n * into a markdown block for injection into consolidation prompts.\n *\n * Respects the global token budget (REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT) and\n * truncates with a footer listing omitted extensions when over budget.\n */\n\nimport { REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT } from \"./host-discovery.js\";\nimport type { DiscoveredExtension } from \"./types.js\";\n\n/**\n * Approximate token count using the 4 chars per token heuristic.\n */\nfunction estimateTokens(text: string): number {\n  return Math.ceil(text.length / 4);\n}\n\n/**\n * Render a markdown block containing extension instructions for injection\n * into consolidation prompts.\n *\n * If the list is empty, returns \"\".\n * Inlines extensions in name order until the token budget is exhausted.\n * If the budget is exceeded, appends a truncation footer listing omitted extensions.\n */\nexport function renderExtensionsBlock(extensions: DiscoveredExtension[]): string {\n  if (extensions.length === 0) return \"\";\n\n  const header = `## Active memory extensions\n\nYou are running with the following third-party memory extensions. Each\nextension's \\`instructions.md\\` tells you how to interpret memories that\nextension produces or curates.\n\n`;\n\n  let budget = REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT;\n  budget -= estimateTokens(header);\n\n  const inlined: string[] = [];\n  const omitted: string[] = [];\n\n  for (const ext of extensions) {\n    const block = `### remnic-extension/${ext.name}\\n\\`\\`\\`\\n${ext.instructions}\\n\\`\\`\\`\\n\\n`;\n    const cost = estimateTokens(block);\n    if (cost <= budget) {\n      inlined.push(block);\n      budget -= cost;\n    } else {\n      omitted.push(ext.name);\n    }\n  }\n\n  let result = header;\n  result += inlined.join(\"\");\n\n  if (omitted.length > 0) {\n    result += `> **Note:** ${omitted.length} extension(s) omitted due to token budget: ${omitted.join(\", \")}\\n`;\n  }\n\n  return result;\n}\n\n/**\n * Render a compact one-line footer listing active extension names.\n * Used by day-summary and summary-snapshot where full instructions are not needed.\n */\nexport function renderExtensionsFooter(extensions: DiscoveredExtension[]): string {\n  if (extensions.length === 0) return \"\";\n  const names = extensions.map((ext) => ext.name).join(\", \");\n  return `Active extensions: ${names}`;\n}\n"],"mappings":";AASA,SAAS,SAAS,UAAU,OAAO,gBAAgB;AACnD,OAAO,UAAU;AAMV,IAAM,sCAAsC;AAG5C,IAAM,2CACX,sCAAsC;AAGjC,IAAM,qCAAqC,KAAK;AAGvD,IAAM,6BAA6B;AAGnC,IAAM,gBAAgB;AAEtB,IAAM,qBAAqB,oBAAI,IAAI,CAAC,QAAQ,cAAc,aAAa,WAAW,CAAC;AAYnF,eAAsB,yBACpB,MACA,KACgC;AAOhC,MAAI;AACJ,MAAI;AACF,eAAW,MAAM,MAAM,IAAI;AAAA,EAC7B,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,MAAI,SAAS,eAAe,GAAG;AAE7B,QAAI;AACJ,QAAI;AACF,iBAAW,MAAM,SAAS,IAAI;AAAA,IAChC,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAIA,QAAI;AACJ,QAAI;AACF,uBAAiB,MAAM,SAAS,KAAK,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC;AAAA,IAClE,QAAQ;AAEN,aAAO,CAAC;AAAA,IACV;AACA,QAAI,CAAC,SAAS,WAAW,iBAAiB,KAAK,GAAG,KAAK,aAAa,gBAAgB;AAClF,UAAI;AAAA,QACF,6BAA6B,IAAI;AAAA,MACnC;AACA,aAAO,CAAC;AAAA,IACV;AAEA,QAAI;AACF,iBAAW,MAAM,MAAM,QAAQ;AAAA,IACjC,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AACA,MAAI,CAAC,SAAS,YAAY,GAAG;AAC3B,WAAO,CAAC;AAAA,EACV;AAEA,MAAI;AACJ,MAAI;AACF,cAAU,MAAM,QAAQ,IAAI;AAAA,EAC9B,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,aAAoC,CAAC;AAE3C,aAAW,SAAS,SAAS;AAC3B,UAAM,YAAY,KAAK,KAAK,MAAM,KAAK;AAIvC,QAAI;AACJ,QAAI;AACF,kBAAY,MAAM,MAAM,SAAS;AAAA,IACnC,QAAQ;AACN;AAAA,IACF;AACA,QAAI,UAAU,eAAe,GAAG;AAC9B,UAAI;AAAA,QACF,iCAAiC,KAAK;AAAA,MACxC;AACA;AAAA,IACF;AACA,QAAI,CAAC,UAAU,YAAY,EAAG;AAG9B,QAAI,CAAC,cAAc,KAAK,KAAK,GAAG;AAC9B,UAAI;AAAA,QACF,iCAAiC,KAAK;AAAA,MACxC;AACA;AAAA,IACF;AAGA,UAAM,mBAAmB,KAAK,KAAK,WAAW,iBAAiB;AAC/D,QAAI,MAAM,UAAU,gBAAgB,GAAG;AACrC,UAAI;AAAA,QACF,iCAAiC,KAAK;AAAA,MACxC;AACA;AAAA,IACF;AACA,QAAI;AACJ,QAAI;AACF,qBAAe,MAAM;AAAA,QACnB;AAAA,QACA;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,YAAM,SAAS,eAAe,oBAC1B,2BAA2B,wCAAwC,WACnE;AACJ,UAAI,OAAO,iCAAiC,KAAK,MAAM,MAAM,EAAE;AAC/D;AAAA,IACF;AAGA,QAAI;AACJ,UAAM,aAAa,KAAK,KAAK,WAAW,aAAa;AACrD,QAAI,MAAM,UAAU,UAAU,GAAG;AAC/B,UAAI;AAAA,QACF,wBAAwB,KAAK;AAAA,MAC/B;AAAA,IACF,OAAO;AACL,UAAI;AACF,cAAM,YAAY,MAAM;AAAA,UACtB;AAAA,UACA;AAAA,QACF;AACA,cAAM,SAAS,KAAK,MAAM,SAAS;AACnC,YAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC3E,mBAAS,eAAe,MAAM;AAAA,QAChC,OAAO;AACL,cAAI;AAAA,YACF,wBAAwB,KAAK;AAAA,UAC/B;AAAA,QACF;AAAA,MACF,SAAS,KAAK;AAEZ,YAAI,oBAAoB,GAAG,GAAG;AAAA,QAE9B,WAAW,eAAe,mBAAmB;AAC3C,cAAI;AAAA,YACF,wBAAwB,KAAK,0BAA0B,kCAAkC;AAAA,UAC3F;AAAA,QACF,OAAO;AACL,cAAI;AAAA,YACF,wBAAwB,KAAK;AAAA,UAC/B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,UAAM,gBAA0B,CAAC;AACjC,UAAM,cAAc,KAAK,KAAK,WAAW,UAAU;AACnD,QAAI;AACF,YAAM,eAAe,MAAM,MAAM,WAAW;AAC5C,UAAI,aAAa,eAAe,GAAG;AACjC,YAAI;AAAA,UACF,wBAAwB,KAAK;AAAA,QAC/B;AACA,cAAM,IAAI,MAAM,mCAAmC;AAAA,MACrD;AACA,UAAI,CAAC,aAAa,YAAY,GAAG;AAC/B,cAAM,IAAI,MAAM,kCAAkC;AAAA,MACpD;AACA,YAAM,iBAAiB,MAAM,QAAQ,WAAW;AAChD,YAAM,UAAU,eACb,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAC/B,KAAK,EACL,MAAM,GAAG,0BAA0B;AACtC,iBAAW,KAAK,SAAS;AACvB,cAAM,cAAc,KAAK,KAAK,aAAa,CAAC;AAC5C,cAAM,cAAc,MAAM,MAAM,WAAW;AAC3C,YAAI,YAAY,eAAe,GAAG;AAChC,cAAI;AAAA,YACF,wBAAwB,KAAK,eAAe,CAAC;AAAA,UAC/C;AACA;AAAA,QACF;AACA,YAAI,CAAC,YAAY,OAAO,GAAG;AACzB;AAAA,QACF;AACA,sBAAc,KAAK,WAAW;AAAA,MAChC;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,eAAW,KAAK;AAAA,MACd,MAAM;AAAA,MACN,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAGA,aAAW,KAAK,CAAC,GAAG,MAAM;AACxB,QAAI,EAAE,OAAO,EAAE,KAAM,QAAO;AAC5B,QAAI,EAAE,OAAO,EAAE,KAAM,QAAO;AAC5B,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AACT;AAEA,IAAM,oBAAN,cAAgC,MAAM;AAAA,EACpC,YAAY,UAAkB,YAAoB,aAAqB;AACrE,UAAM,GAAG,QAAQ,OAAO,WAAW,oBAAoB,UAAU,QAAQ;AACzE,SAAK,OAAO;AAAA,EACd;AACF;AAEA,eAAe,wBAAwB,UAAkB,YAAqC;AAC5F,QAAM,OAAO,MAAM,MAAM,QAAQ;AACjC,MAAI,CAAC,KAAK,OAAO,GAAG;AAClB,UAAM,IAAI,MAAM,GAAG,QAAQ,gBAAgB;AAAA,EAC7C;AACA,MAAI,KAAK,OAAO,YAAY;AAC1B,UAAM,IAAI,kBAAkB,UAAU,YAAY,KAAK,IAAI;AAAA,EAC7D;AACA,SAAO,SAAS,UAAU,OAAO;AACnC;AAEA,SAAS,eAAe,KAA+C;AACrE,QAAM,eAA+C,MAAM;AACzD,QAAI,CAAC,MAAM,QAAQ,IAAI,WAAW,EAAG,QAAO;AAC5C,UAAM,QAAQ,IAAI,YAAY;AAAA,MAC5B,CAAC,MACC,OAAO,MAAM,YAAY,mBAAmB,IAAI,CAAC;AAAA,IACrD;AACA,WAAO,MAAM,SAAS,IAAI,QAAQ;AAAA,EACpC,GAAG;AAEH,QAAM,iBAAmD,MAAM;AAC7D,QAAI,CAAC,MAAM,QAAQ,IAAI,aAAa,EAAG,QAAO;AAC9C,UAAM,QAAQ,IAAI,cAAc;AAAA,MAC9B,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,SAAS;AAAA,IAC1D;AACA,WAAO,MAAM,SAAS,IAAI,QAAQ;AAAA,EACpC,GAAG;AAEH,QAAM,UACJ,OAAO,IAAI,YAAY,YAAY,IAAI,QAAQ,SAAS,IACpD,IAAI,UACJ;AAEN,SAAO;AAAA,IACL,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,IACrC,GAAI,gBAAgB,EAAE,cAAc,IAAI,CAAC;AAAA,IACzC,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;AAAA,EAC/B;AACF;AAEA,SAAS,oBAAoB,KAAuB;AAClD,SACE,OAAO,QAAQ,YACf,QAAQ,QACR,UAAU,OACT,IAAyB,SAAS;AAEvC;AAMA,eAAe,UAAU,UAAoC;AAC3D,MAAI;AACF,UAAM,IAAI,MAAM,MAAM,QAAQ;AAC9B,WAAO,EAAE,eAAe;AAAA,EAC1B,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAUO,SAAS,sBAAsB,QAA8B;AAClE,MAAI,OAAO,qBAAqB,SAAS,GAAG;AAC1C,WAAO,OAAO;AAAA,EAChB;AAGA,SAAO,KAAK,KAAK,KAAK,QAAQ,OAAO,SAAS,GAAG,mBAAmB;AACtE;;;AC9TA,SAAS,eAAe,MAAsB;AAC5C,SAAO,KAAK,KAAK,KAAK,SAAS,CAAC;AAClC;AAUO,SAAS,sBAAsB,YAA2C;AAC/E,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQf,MAAI,SAAS;AACb,YAAU,eAAe,MAAM;AAE/B,QAAM,UAAoB,CAAC;AAC3B,QAAM,UAAoB,CAAC;AAE3B,aAAW,OAAO,YAAY;AAC5B,UAAM,QAAQ,wBAAwB,IAAI,IAAI;AAAA;AAAA,EAAa,IAAI,YAAY;AAAA;AAAA;AAAA;AAC3E,UAAM,OAAO,eAAe,KAAK;AACjC,QAAI,QAAQ,QAAQ;AAClB,cAAQ,KAAK,KAAK;AAClB,gBAAU;AAAA,IACZ,OAAO;AACL,cAAQ,KAAK,IAAI,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,MAAI,SAAS;AACb,YAAU,QAAQ,KAAK,EAAE;AAEzB,MAAI,QAAQ,SAAS,GAAG;AACtB,cAAU,eAAe,QAAQ,MAAM,8CAA8C,QAAQ,KAAK,IAAI,CAAC;AAAA;AAAA,EACzG;AAEA,SAAO;AACT;AAMO,SAAS,uBAAuB,YAA2C;AAChF,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,QAAM,QAAQ,WAAW,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,KAAK,IAAI;AACzD,SAAO,sBAAsB,KAAK;AACpC;","names":[]}
+{"version":3,"sources":["../src/memory-extension-host/host-discovery.ts","../src/memory-extension-host/render-extensions-block.ts"],"sourcesContent":["/**\n * memory-extension-host/host-discovery.ts — Discover third-party memory extensions.\n *\n * Scans a root directory (typically ~/.remnic/memory_extensions/) for valid\n * extension subdirectories. Each extension must contain an instructions.md.\n * The discovery process is read-only and NEVER reads or executes files under\n * any extension's scripts/ directory.\n */\n\nimport { readdir, readFile, lstat, realpath } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport type { LoggerBackend } from \"../logger.js\";\nimport type { PluginConfig } from \"../types.js\";\nimport type { DiscoveredExtension, ExtensionSchema } from \"./types.js\";\n\n/** Total token budget for all discovered extension instructions combined. */\nexport const REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT = 5_000;\n\n/** Per-extension instructions read cap, using the same 4 chars/token budget heuristic. */\nexport const REMNIC_EXTENSION_INSTRUCTIONS_BYTE_LIMIT =\n  REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT * 4;\n\n/** Optional schemas are metadata only; refuse unusually large schema files. */\nexport const REMNIC_EXTENSION_SCHEMA_BYTE_LIMIT = 64 * 1024;\n\n/** Maximum number of example files collected per extension. */\nconst MAX_EXAMPLES_PER_EXTENSION = 10;\n\n/** Slug validation: lowercase letters, digits, hyphens, 1-64 chars. */\nconst VALID_SLUG_RE = /^[a-z0-9][a-z0-9-]{0,63}$/;\n\nconst VALID_MEMORY_TYPES = new Set([\"fact\", \"preference\", \"procedure\", \"reference\"]);\n\n/**\n * Discover all valid memory extensions under the given root directory.\n *\n * Returns extensions sorted by name. Skips entries with warnings when:\n * - The slug is invalid (not lowercase alphanumeric + hyphens, or > 64 chars)\n * - instructions.md is missing\n * - schema.json is malformed (extension still returned but schema is undefined)\n *\n * NEVER reads files under any extension's scripts/ directory.\n */\nexport async function discoverMemoryExtensions(\n  root: string,\n  log: Pick<LoggerBackend, \"warn\" | \"debug\">,\n): Promise<DiscoveredExtension[]> {\n  // If root doesn't exist, return empty silently (not even a warning).\n  // Use lstat() for root — a symlinked extensions root could redirect\n  // discovery to an untrusted directory tree (#428 P2).  When the root\n  // IS a symlink, resolve it and verify it still lives under the parent\n  // memory directory so that an attacker-controlled symlink can't point\n  // discovery at /etc or another user's home.\n  let rootStat;\n  try {\n    rootStat = await lstat(root);\n  } catch {\n    return [];\n  }\n  if (rootStat.isSymbolicLink()) {\n    // Resolve and verify the real path is inside the expected parent.\n    let resolved: string;\n    try {\n      resolved = await realpath(root);\n    } catch {\n      return [];\n    }\n    // Normalize the parent path through realpath so that:\n    // 1. Relative roots (e.g. \"memory_extensions\") become absolute (#431 Finding 1)\n    // 2. Intermediate symlinks (e.g. macOS /var -> /private/var) are resolved (#431 Finding 2)\n    let expectedParent: string;\n    try {\n      expectedParent = await realpath(path.resolve(path.dirname(root)));\n    } catch {\n      // Parent directory doesn't exist or is inaccessible — reject.\n      return [];\n    }\n    if (!resolved.startsWith(expectedParent + path.sep) && resolved !== expectedParent) {\n      log.warn?.(\n        `[memory-extensions] root \"${root}\" is a symlink resolving outside the expected parent directory, skipping`,\n      );\n      return [];\n    }\n    // Re-check the resolved path is a directory.\n    try {\n      rootStat = await lstat(resolved);\n    } catch {\n      return [];\n    }\n  }\n  if (!rootStat.isDirectory()) {\n    return [];\n  }\n\n  let entries: string[];\n  try {\n    entries = await readdir(root);\n  } catch {\n    return [];\n  }\n\n  const extensions: DiscoveredExtension[] = [];\n\n  for (const entry of entries) {\n    const entryPath = path.join(root, entry);\n\n    // Must be a real directory (not a symlink) — lstat() blocks symlink\n    // traversal that could escape the extensions root (#382 P2).\n    let entryStat;\n    try {\n      entryStat = await lstat(entryPath);\n    } catch {\n      continue;\n    }\n    if (entryStat.isSymbolicLink()) {\n      log.warn?.(\n        `[memory-extensions] skipping \"${entry}\": symlinks are not followed for security`,\n      );\n      continue;\n    }\n    if (!entryStat.isDirectory()) continue;\n\n    // Validate slug\n    if (!VALID_SLUG_RE.test(entry)) {\n      log.warn?.(\n        `[memory-extensions] skipping \"${entry}\": invalid slug (must be lowercase alphanumeric + hyphens, 1-64 chars)`,\n      );\n      continue;\n    }\n\n    // Require instructions.md — reject symlinked files (#428 P1)\n    const instructionsPath = path.join(entryPath, \"instructions.md\");\n    if (await isSymlink(instructionsPath)) {\n      log.warn?.(\n        `[memory-extensions] skipping \"${entry}\": instructions.md is a symlink`,\n      );\n      continue;\n    }\n    let instructions: string;\n    try {\n      instructions = await readUtf8FileWithinLimit(\n        instructionsPath,\n        REMNIC_EXTENSION_INSTRUCTIONS_BYTE_LIMIT,\n      );\n    } catch (err) {\n      const reason = err instanceof FileTooLargeError\n        ? `instructions.md exceeds ${REMNIC_EXTENSION_INSTRUCTIONS_BYTE_LIMIT} bytes`\n        : \"missing instructions.md\";\n      log.warn?.(`[memory-extensions] skipping \"${entry}\": ${reason}`);\n      continue;\n    }\n\n    // Read optional schema.json — reject symlinked files (#428 P1)\n    let schema: ExtensionSchema | undefined;\n    const schemaPath = path.join(entryPath, \"schema.json\");\n    if (await isSymlink(schemaPath)) {\n      log.warn?.(\n        `[memory-extensions] \"${entry}\": schema.json is a symlink, ignoring schema`,\n      );\n    } else {\n      try {\n        const schemaRaw = await readUtf8FileWithinLimit(\n          schemaPath,\n          REMNIC_EXTENSION_SCHEMA_BYTE_LIMIT,\n        );\n        const parsed = JSON.parse(schemaRaw);\n        if (typeof parsed === \"object\" && parsed !== null && !Array.isArray(parsed)) {\n          schema = validateSchema(parsed);\n        } else {\n          log.warn?.(\n            `[memory-extensions] \"${entry}\": schema.json is not a valid object, ignoring schema`,\n          );\n        }\n      } catch (err) {\n        // File doesn't exist → fine, no warning needed\n        if (isFileNotFoundError(err)) {\n          // schema remains undefined\n        } else if (err instanceof FileTooLargeError) {\n          log.warn?.(\n            `[memory-extensions] \"${entry}\": schema.json exceeds ${REMNIC_EXTENSION_SCHEMA_BYTE_LIMIT} bytes, ignoring schema`,\n          );\n        } else {\n          log.warn?.(\n            `[memory-extensions] \"${entry}\": malformed schema.json, ignoring schema`,\n          );\n        }\n      }\n    }\n\n    // Collect examples/*.md (cap at MAX_EXAMPLES_PER_EXTENSION)\n    // NEVER read from scripts/ directory\n    const examplesPaths: string[] = [];\n    const examplesDir = path.join(entryPath, \"examples\");\n    try {\n      const examplesStat = await lstat(examplesDir);\n      if (examplesStat.isSymbolicLink()) {\n        log.warn?.(\n          `[memory-extensions] \"${entry}\": examples/ is a symlink, ignoring examples`,\n        );\n        throw new Error(\"skip symlinked examples directory\");\n      }\n      if (!examplesStat.isDirectory()) {\n        throw new Error(\"skip non-directory examples path\");\n      }\n      const exampleEntries = await readdir(examplesDir);\n      const mdFiles = exampleEntries\n        .filter((f) => f.endsWith(\".md\"))\n        .sort()\n        .slice(0, MAX_EXAMPLES_PER_EXTENSION);\n      for (const f of mdFiles) {\n        const examplePath = path.join(examplesDir, f);\n        const exampleStat = await lstat(examplePath);\n        if (exampleStat.isSymbolicLink()) {\n          log.warn?.(\n            `[memory-extensions] \"${entry}\": examples/${f} is a symlink, ignoring example`,\n          );\n          continue;\n        }\n        if (!exampleStat.isFile()) {\n          continue;\n        }\n        examplesPaths.push(examplePath);\n      }\n    } catch {\n      // No examples dir — fine\n    }\n\n    extensions.push({\n      name: entry,\n      root: entryPath,\n      instructionsPath,\n      instructions,\n      schema,\n      examplesPaths,\n    });\n  }\n\n  // Sort by name for deterministic ordering\n  extensions.sort((a, b) => {\n    if (a.name < b.name) return -1;\n    if (a.name > b.name) return 1;\n    return 0;\n  });\n\n  return extensions;\n}\n\nclass FileTooLargeError extends Error {\n  constructor(filePath: string, limitBytes: number, actualBytes: number) {\n    super(`${filePath} is ${actualBytes} bytes; limit is ${limitBytes} bytes`);\n    this.name = \"FileTooLargeError\";\n  }\n}\n\nasync function readUtf8FileWithinLimit(filePath: string, limitBytes: number): Promise<string> {\n  const stat = await lstat(filePath);\n  if (!stat.isFile()) {\n    throw new Error(`${filePath} is not a file`);\n  }\n  if (stat.size > limitBytes) {\n    throw new FileTooLargeError(filePath, limitBytes, stat.size);\n  }\n  return readFile(filePath, \"utf-8\");\n}\n\nfunction validateSchema(raw: Record<string, unknown>): ExtensionSchema {\n  const memoryTypes: ExtensionSchema[\"memoryTypes\"] = (() => {\n    if (!Array.isArray(raw.memoryTypes)) return undefined;\n    const valid = raw.memoryTypes.filter(\n      (t): t is \"fact\" | \"preference\" | \"procedure\" | \"reference\" =>\n        typeof t === \"string\" && VALID_MEMORY_TYPES.has(t),\n    );\n    return valid.length > 0 ? valid : undefined;\n  })();\n\n  const groupingHints: ExtensionSchema[\"groupingHints\"] = (() => {\n    if (!Array.isArray(raw.groupingHints)) return undefined;\n    const valid = raw.groupingHints.filter(\n      (h): h is string => typeof h === \"string\" && h.length > 0,\n    );\n    return valid.length > 0 ? valid : undefined;\n  })();\n\n  const version: ExtensionSchema[\"version\"] =\n    typeof raw.version === \"string\" && raw.version.length > 0\n      ? raw.version\n      : undefined;\n\n  return {\n    ...(memoryTypes ? { memoryTypes } : {}),\n    ...(groupingHints ? { groupingHints } : {}),\n    ...(version ? { version } : {}),\n  };\n}\n\nfunction isFileNotFoundError(err: unknown): boolean {\n  return (\n    typeof err === \"object\" &&\n    err !== null &&\n    \"code\" in err &&\n    (err as { code: string }).code === \"ENOENT\"\n  );\n}\n\n/**\n * Returns true if the path exists and is a symlink.\n * Returns false if the path does not exist or is not a symlink.\n */\nasync function isSymlink(filePath: string): Promise<boolean> {\n  try {\n    const s = await lstat(filePath);\n    return s.isSymbolicLink();\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Resolve the memory extensions root directory from config.\n * If memoryExtensionsRoot is empty, derive from memoryDir by going up to\n * the Remnic home dir and appending memory_extensions.\n *\n * Moved here from semantic-consolidation.ts (#428 Finding 3) because this\n * is a generic config-to-path resolver with no consolidation logic.\n */\nexport function resolveExtensionsRoot(config: PluginConfig): string {\n  if (config.memoryExtensionsRoot.length > 0) {\n    return config.memoryExtensionsRoot;\n  }\n  // Default: memoryDir is typically ~/.openclaw/workspace/memory/local\n  // Go up to the parent that owns the memory tree and append memory_extensions\n  return path.join(path.dirname(config.memoryDir), \"memory_extensions\");\n}\n","/**\n * memory-extension-host/render-extensions-block.ts — Render discovered extensions\n * into a markdown block for injection into consolidation prompts.\n *\n * Respects the global token budget (REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT) and\n * truncates with a footer listing omitted extensions when over budget.\n */\n\nimport { estimateTokenCount } from \"../token-estimate.js\";\nimport { REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT } from \"./host-discovery.js\";\nimport type { DiscoveredExtension } from \"./types.js\";\n\n/**\n * Render a markdown block containing extension instructions for injection\n * into consolidation prompts.\n *\n * If the list is empty, returns \"\".\n * Inlines extensions in name order until the token budget is exhausted.\n * If the budget is exceeded, appends a truncation footer listing omitted extensions.\n */\nexport function renderExtensionsBlock(extensions: DiscoveredExtension[]): string {\n  if (extensions.length === 0) return \"\";\n\n  const header = `## Active memory extensions\n\nYou are running with the following third-party memory extensions. Each\nextension's \\`instructions.md\\` tells you how to interpret memories that\nextension produces or curates.\n\n`;\n\n  let budget = REMNIC_EXTENSIONS_TOTAL_TOKEN_LIMIT;\n  budget -= estimateTokenCount(header);\n\n  const inlined: string[] = [];\n  const omitted: string[] = [];\n\n  for (const ext of extensions) {\n    const block = `### remnic-extension/${ext.name}\\n\\`\\`\\`\\n${ext.instructions}\\n\\`\\`\\`\\n\\n`;\n    const cost = estimateTokenCount(block);\n    if (cost <= budget) {\n      inlined.push(block);\n      budget -= cost;\n    } else {\n      omitted.push(ext.name);\n    }\n  }\n\n  let result = header;\n  result += inlined.join(\"\");\n\n  if (omitted.length > 0) {\n    result += `> **Note:** ${omitted.length} extension(s) omitted due to token budget: ${omitted.join(\", \")}\\n`;\n  }\n\n  return result;\n}\n\n/**\n * Render a compact one-line footer listing active extension names.\n * Used by day-summary and summary-snapshot where full instructions are not needed.\n */\nexport function renderExtensionsFooter(extensions: DiscoveredExtension[]): string {\n  if (extensions.length === 0) return \"\";\n  const names = extensions.map((ext) => ext.name).join(\", \");\n  return `Active extensions: ${names}`;\n}\n"],"mappings":";;;;;AASA,SAAS,SAAS,UAAU,OAAO,gBAAgB;AACnD,OAAO,UAAU;AAMV,IAAM,sCAAsC;AAG5C,IAAM,2CACX,sCAAsC;AAGjC,IAAM,qCAAqC,KAAK;AAGvD,IAAM,6BAA6B;AAGnC,IAAM,gBAAgB;AAEtB,IAAM,qBAAqB,oBAAI,IAAI,CAAC,QAAQ,cAAc,aAAa,WAAW,CAAC;AAYnF,eAAsB,yBACpB,MACA,KACgC;AAOhC,MAAI;AACJ,MAAI;AACF,eAAW,MAAM,MAAM,IAAI;AAAA,EAC7B,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,MAAI,SAAS,eAAe,GAAG;AAE7B,QAAI;AACJ,QAAI;AACF,iBAAW,MAAM,SAAS,IAAI;AAAA,IAChC,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAIA,QAAI;AACJ,QAAI;AACF,uBAAiB,MAAM,SAAS,KAAK,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC;AAAA,IAClE,QAAQ;AAEN,aAAO,CAAC;AAAA,IACV;AACA,QAAI,CAAC,SAAS,WAAW,iBAAiB,KAAK,GAAG,KAAK,aAAa,gBAAgB;AAClF,UAAI;AAAA,QACF,6BAA6B,IAAI;AAAA,MACnC;AACA,aAAO,CAAC;AAAA,IACV;AAEA,QAAI;AACF,iBAAW,MAAM,MAAM,QAAQ;AAAA,IACjC,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AACA,MAAI,CAAC,SAAS,YAAY,GAAG;AAC3B,WAAO,CAAC;AAAA,EACV;AAEA,MAAI;AACJ,MAAI;AACF,cAAU,MAAM,QAAQ,IAAI;AAAA,EAC9B,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,aAAoC,CAAC;AAE3C,aAAW,SAAS,SAAS;AAC3B,UAAM,YAAY,KAAK,KAAK,MAAM,KAAK;AAIvC,QAAI;AACJ,QAAI;AACF,kBAAY,MAAM,MAAM,SAAS;AAAA,IACnC,QAAQ;AACN;AAAA,IACF;AACA,QAAI,UAAU,eAAe,GAAG;AAC9B,UAAI;AAAA,QACF,iCAAiC,KAAK;AAAA,MACxC;AACA;AAAA,IACF;AACA,QAAI,CAAC,UAAU,YAAY,EAAG;AAG9B,QAAI,CAAC,cAAc,KAAK,KAAK,GAAG;AAC9B,UAAI;AAAA,QACF,iCAAiC,KAAK;AAAA,MACxC;AACA;AAAA,IACF;AAGA,UAAM,mBAAmB,KAAK,KAAK,WAAW,iBAAiB;AAC/D,QAAI,MAAM,UAAU,gBAAgB,GAAG;AACrC,UAAI;AAAA,QACF,iCAAiC,KAAK;AAAA,MACxC;AACA;AAAA,IACF;AACA,QAAI;AACJ,QAAI;AACF,qBAAe,MAAM;AAAA,QACnB;AAAA,QACA;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,YAAM,SAAS,eAAe,oBAC1B,2BAA2B,wCAAwC,WACnE;AACJ,UAAI,OAAO,iCAAiC,KAAK,MAAM,MAAM,EAAE;AAC/D;AAAA,IACF;AAGA,QAAI;AACJ,UAAM,aAAa,KAAK,KAAK,WAAW,aAAa;AACrD,QAAI,MAAM,UAAU,UAAU,GAAG;AAC/B,UAAI;AAAA,QACF,wBAAwB,KAAK;AAAA,MAC/B;AAAA,IACF,OAAO;AACL,UAAI;AACF,cAAM,YAAY,MAAM;AAAA,UACtB;AAAA,UACA;AAAA,QACF;AACA,cAAM,SAAS,KAAK,MAAM,SAAS;AACnC,YAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC3E,mBAAS,eAAe,MAAM;AAAA,QAChC,OAAO;AACL,cAAI;AAAA,YACF,wBAAwB,KAAK;AAAA,UAC/B;AAAA,QACF;AAAA,MACF,SAAS,KAAK;AAEZ,YAAI,oBAAoB,GAAG,GAAG;AAAA,QAE9B,WAAW,eAAe,mBAAmB;AAC3C,cAAI;AAAA,YACF,wBAAwB,KAAK,0BAA0B,kCAAkC;AAAA,UAC3F;AAAA,QACF,OAAO;AACL,cAAI;AAAA,YACF,wBAAwB,KAAK;AAAA,UAC/B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,UAAM,gBAA0B,CAAC;AACjC,UAAM,cAAc,KAAK,KAAK,WAAW,UAAU;AACnD,QAAI;AACF,YAAM,eAAe,MAAM,MAAM,WAAW;AAC5C,UAAI,aAAa,eAAe,GAAG;AACjC,YAAI;AAAA,UACF,wBAAwB,KAAK;AAAA,QAC/B;AACA,cAAM,IAAI,MAAM,mCAAmC;AAAA,MACrD;AACA,UAAI,CAAC,aAAa,YAAY,GAAG;AAC/B,cAAM,IAAI,MAAM,kCAAkC;AAAA,MACpD;AACA,YAAM,iBAAiB,MAAM,QAAQ,WAAW;AAChD,YAAM,UAAU,eACb,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAC/B,KAAK,EACL,MAAM,GAAG,0BAA0B;AACtC,iBAAW,KAAK,SAAS;AACvB,cAAM,cAAc,KAAK,KAAK,aAAa,CAAC;AAC5C,cAAM,cAAc,MAAM,MAAM,WAAW;AAC3C,YAAI,YAAY,eAAe,GAAG;AAChC,cAAI;AAAA,YACF,wBAAwB,KAAK,eAAe,CAAC;AAAA,UAC/C;AACA;AAAA,QACF;AACA,YAAI,CAAC,YAAY,OAAO,GAAG;AACzB;AAAA,QACF;AACA,sBAAc,KAAK,WAAW;AAAA,MAChC;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,eAAW,KAAK;AAAA,MACd,MAAM;AAAA,MACN,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAGA,aAAW,KAAK,CAAC,GAAG,MAAM;AACxB,QAAI,EAAE,OAAO,EAAE,KAAM,QAAO;AAC5B,QAAI,EAAE,OAAO,EAAE,KAAM,QAAO;AAC5B,WAAO;AAAA,EACT,CAAC;AAED,SAAO;AACT;AAEA,IAAM,oBAAN,cAAgC,MAAM;AAAA,EACpC,YAAY,UAAkB,YAAoB,aAAqB;AACrE,UAAM,GAAG,QAAQ,OAAO,WAAW,oBAAoB,UAAU,QAAQ;AACzE,SAAK,OAAO;AAAA,EACd;AACF;AAEA,eAAe,wBAAwB,UAAkB,YAAqC;AAC5F,QAAM,OAAO,MAAM,MAAM,QAAQ;AACjC,MAAI,CAAC,KAAK,OAAO,GAAG;AAClB,UAAM,IAAI,MAAM,GAAG,QAAQ,gBAAgB;AAAA,EAC7C;AACA,MAAI,KAAK,OAAO,YAAY;AAC1B,UAAM,IAAI,kBAAkB,UAAU,YAAY,KAAK,IAAI;AAAA,EAC7D;AACA,SAAO,SAAS,UAAU,OAAO;AACnC;AAEA,SAAS,eAAe,KAA+C;AACrE,QAAM,eAA+C,MAAM;AACzD,QAAI,CAAC,MAAM,QAAQ,IAAI,WAAW,EAAG,QAAO;AAC5C,UAAM,QAAQ,IAAI,YAAY;AAAA,MAC5B,CAAC,MACC,OAAO,MAAM,YAAY,mBAAmB,IAAI,CAAC;AAAA,IACrD;AACA,WAAO,MAAM,SAAS,IAAI,QAAQ;AAAA,EACpC,GAAG;AAEH,QAAM,iBAAmD,MAAM;AAC7D,QAAI,CAAC,MAAM,QAAQ,IAAI,aAAa,EAAG,QAAO;AAC9C,UAAM,QAAQ,IAAI,cAAc;AAAA,MAC9B,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,SAAS;AAAA,IAC1D;AACA,WAAO,MAAM,SAAS,IAAI,QAAQ;AAAA,EACpC,GAAG;AAEH,QAAM,UACJ,OAAO,IAAI,YAAY,YAAY,IAAI,QAAQ,SAAS,IACpD,IAAI,UACJ;AAEN,SAAO;AAAA,IACL,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,IACrC,GAAI,gBAAgB,EAAE,cAAc,IAAI,CAAC;AAAA,IACzC,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;AAAA,EAC/B;AACF;AAEA,SAAS,oBAAoB,KAAuB;AAClD,SACE,OAAO,QAAQ,YACf,QAAQ,QACR,UAAU,OACT,IAAyB,SAAS;AAEvC;AAMA,eAAe,UAAU,UAAoC;AAC3D,MAAI;AACF,UAAM,IAAI,MAAM,MAAM,QAAQ;AAC9B,WAAO,EAAE,eAAe;AAAA,EAC1B,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAUO,SAAS,sBAAsB,QAA8B;AAClE,MAAI,OAAO,qBAAqB,SAAS,GAAG;AAC1C,WAAO,OAAO;AAAA,EAChB;AAGA,SAAO,KAAK,KAAK,KAAK,QAAQ,OAAO,SAAS,GAAG,mBAAmB;AACtE;;;ACxTO,SAAS,sBAAsB,YAA2C;AAC/E,MAAI,WAAW,WAAW,EAAG,QAAO;AAEpC,QAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQf,MAAI,SAAS;AACb,YAAU,mBAAmB,MAAM;AAEnC,QAAM,UAAoB,CAAC;AAC3B,QAAM,UAAoB,CAAC;AAE3B,aAAW,OAAO,YAAY;AAC5B,UAAM,QAAQ,wBAAwB,IAAI,IAAI;AAAA;AAAA,EAAa,IAAI,YAAY;AAAA;AAAA;AAAA;AAC3E,UAAM,OAAO,mBAAmB,KAAK;AACrC,QAAI,QAAQ,QAAQ;AAClB,cAAQ,KAAK,KAAK;AAClB,gBAAU;AAAA,IACZ,OAAO;AACL,cAAQ,KAAK,IAAI,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,MAAI,SAAS;AACb,YAAU,QAAQ,KAAK,EAAE;AAEzB,MAAI,QAAQ,SAAS,GAAG;AACtB,cAAU,eAAe,QAAQ,MAAM,8CAA8C,QAAQ,KAAK,IAAI,CAAC;AAAA;AAAA,EACzG;AAEA,SAAO;AACT;AAMO,SAAS,uBAAuB,YAA2C;AAChF,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,QAAM,QAAQ,WAAW,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,KAAK,IAAI;AACzD,SAAO,sBAAsB,KAAK;AACpC;","names":[]}

package/dist/{chunk-VDX2J7OX.js → chunk-5W7CTZ2E.js}

@@ -1,12 +1,12 @@
+import {
+  encryptCapsuleFile
+} from "./chunk-UVYI6VIX.js";
 import {
   CAPSULE_ID_PATTERN,
   CapsuleBlockSchema,
   ExportBundleV2Schema,
   ExportManifestV2Schema
 } from "./chunk-WEHSQBFR.js";
-import {
-  encryptCapsuleFile
-} from "./chunk-DQEMWVMT.js";
 import {
   CAPSULE_SCHEMA_VERSION,
   EXPORT_FORMAT
@@ -261,4 +261,4 @@ export {
   exportCapsule,
   isValidCapsuleSince
 };
-//# sourceMappingURL=chunk-VDX2J7OX.js.map
+//# sourceMappingURL=chunk-5W7CTZ2E.js.map

package/dist/{chunk-CZUHNJHX.js → chunk-6C7Q6NG3.js}

@@ -8,7 +8,7 @@ import {
 } from "./chunk-GDB4J2H3.js";
 import {
   importCapsule
-} from "./chunk-PPUTUOC3.js";
+} from "./chunk-BTHDQOF4.js";
 import {
   WriteQuarantineStore
 } from "./chunk-PJSK6OJM.js";
@@ -35,13 +35,13 @@ import {
 } from "./chunk-H7XKCNR6.js";
 import {
   toRecallExplainJson
-} from "./chunk-U7BMN33M.js";
+} from "./chunk-UBSM6TZP.js";
 import {
   estimateRecallTokens
-} from "./chunk-QKPDN325.js";
+} from "./chunk-KF75ANST.js";
 import {
   readAggregateExtractionWatermark
-} from "./chunk-5PGYCWA7.js";
+} from "./chunk-DE6YCZEE.js";
 import {
   ReplicaDivergenceMonitor
 } from "./chunk-CVILPI77.js";
@@ -71,7 +71,7 @@ import {
 } from "./chunk-NLE6TSLG.js";
 import {
   LocalLlmClient
-} from "./chunk-5ZIWRMZM.js";
+} from "./chunk-IVKIODHO.js";
 import {
   buildProcedurePersistBody,
   normalizeProcedureSteps
@@ -99,11 +99,11 @@ import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact,
   runMemoryGovernance
-} from "./chunk-6RK2X7BR.js";
+} from "./chunk-G3JFFUKR.js";
 import {
   CorpusWatermarkCache,
   computeServiceCorpusCensus
-} from "./chunk-LJJWFV2Q.js";
+} from "./chunk-VJXSAJFW.js";
 import {
   CrossNamespaceBudget,
   toBudgetWarning
@@ -127,21 +127,21 @@ import {
   enqueuePassiveCorrectionNotification,
   parseBriefingFocus,
   parseBriefingWindow
-} from "./chunk-CSV34HIW.js";
+} from "./chunk-P5OYNV7B.js";
 import {
   parseEntityFile,
   parseFrontmatter,
   qmdCollectionPathParts,
   qmdResultPathCandidates,
   selfDeps
-} from "./chunk-YTZA7U6Q.js";
+} from "./chunk-2VHCLHZ5.js";
 import {
   namespaceCollectionName
-} from "./chunk-SNW3YRO6.js";
+} from "./chunk-P6GOYLHN.js";
 import {
   DEFAULT_RECALL_DISCLOSURE,
   isRecallDisclosure
-} from "./chunk-5QHDXMXP.js";
+} from "./chunk-LLZKOSGM.js";
 import {
   normalizeProjectionPreview,
   normalizeProjectionTags
@@ -179,7 +179,7 @@ import {
 } from "./chunk-JV3C2MNQ.js";
 import {
   exportCapsule
-} from "./chunk-VDX2J7OX.js";
+} from "./chunk-5W7CTZ2E.js";
 import {
   evaluateActionConfidence
 } from "./chunk-Z2YFLXHU.js";
@@ -17672,4 +17672,4 @@ export {
   EngramAccessService,
   AccessAdminOpsSurface
 };
-//# sourceMappingURL=chunk-CZUHNJHX.js.map
+//# sourceMappingURL=chunk-6C7Q6NG3.js.map

package/dist/chunk-6TBIWIAG.js

@@ -0,0 +1,201 @@
+import {
+  estimateTokenCount
+} from "./chunk-TOTT6S2V.js";
+
+// src/chunking.ts
+var DEFAULT_CHUNKING_CONFIG = {
+  targetTokens: 200,
+  minTokens: 150,
+  overlapSentences: 2
+};
+var UNICODE_SENTENCE_TERMINATORS = "\u3002\uFF0E\uFF01\uFF1F\u061F\u06D4\u0964\u0965\uFF61\u2026";
+var ASCII_SENTENCE_TERMINATORS = ".!?";
+var CJK_NO_SPACE_TERMINATORS = "\u3002\uFF0E\uFF01\uFF1F\uFF61";
+var CLOSING_PUNCTUATION = `"'\u201D\u2019\xBB\u300D\u300F\uFF09\uFF3D\u3011\u3009\u300B)]}`;
+var DIGITS = "0123456789\uFF10\uFF11\uFF12\uFF13\uFF14\uFF15\uFF16\uFF17\uFF18\uFF19";
+var SENTENCE_SEGMENTER = typeof Intl.Segmenter === "function" ? new Intl.Segmenter(void 0, { granularity: "sentence" }) : void 0;
+function isSentenceTerminator(character) {
+  return ASCII_SENTENCE_TERMINATORS.includes(character) || UNICODE_SENTENCE_TERMINATORS.includes(character);
+}
+function isCjk(character) {
+  return /[\u3000-\u9fff\uf900-\ufaff\uac00-\ud7af]/u.test(character);
+}
+function splitSentencesFallback(text) {
+  const sentences = [];
+  Object.defineProperty(sentences, "separators", {
+    value: [],
+    writable: true
+  });
+  let start = 0;
+  let separator = "";
+  for (let i = 0; i < text.length; i++) {
+    const ch = text[i];
+    if (!isSentenceTerminator(ch)) continue;
+    let end = i;
+    let hasUnicodeTerminator = UNICODE_SENTENCE_TERMINATORS.includes(ch);
+    while (end + 1 < text.length && isSentenceTerminator(text[end + 1])) {
+      end++;
+      hasUnicodeTerminator ||= UNICODE_SENTENCE_TERMINATORS.includes(text[end]);
+    }
+    const isFullwidthDecimal = ch === "\uFF0E" && DIGITS.includes(text[i - 1] ?? "") && DIGITS.includes(text[end + 1] ?? "");
+    while (end + 1 < text.length && CLOSING_PUNCTUATION.includes(text[end + 1])) {
+      end++;
+    }
+    const after = text[end + 1];
+    const boundary = !isFullwidthDecimal && (hasUnicodeTerminator || after === void 0 || /\s/u.test(after));
+    if (boundary) {
+      const sentence = text.slice(start, end + 1).trim();
+      if (sentence.length > 0) {
+        sentences.push(sentence);
+        if (sentences.length > 1) sentences.separators.push(separator);
+      }
+      let nextStart = end + 1;
+      while (nextStart < text.length && /\s/u.test(text[nextStart])) nextStart++;
+      separator = text.slice(end + 1, nextStart);
+      start = nextStart;
+    }
+    i = end;
+  }
+  const remaining = text.slice(start).trim();
+  if (remaining.length > 0) {
+    sentences.push(remaining);
+    if (sentences.length > 1) sentences.separators.push(separator);
+  }
+  return sentences;
+}
+function splitSentences(text) {
+  const canUseSegmenter = SENTENCE_SEGMENTER !== void 0 && !/\s/u.test(text) && [...text].some((character) => UNICODE_SENTENCE_TERMINATORS.includes(character));
+  if (canUseSegmenter) {
+    const segments = Array.from(
+      SENTENCE_SEGMENTER.segment(text),
+      ({ segment }) => segment.trim()
+    ).filter((segment) => segment.length > 0);
+    if (segments.length > 1 && segments.slice(0, -1).every(
+      (segment) => [...segment].some(
+        (character) => UNICODE_SENTENCE_TERMINATORS.includes(character)
+      )
+    )) {
+      Object.defineProperty(segments, "separators", {
+        value: Array(segments.length - 1).fill(""),
+        writable: true
+      });
+      return segments;
+    }
+  }
+  return splitSentencesFallback(text);
+}
+function endsWithoutSpace(text) {
+  let index = text.length - 1;
+  while (index >= 0 && CLOSING_PUNCTUATION.includes(text[index])) index--;
+  const terminator = text[index] ?? "";
+  if (CJK_NO_SPACE_TERMINATORS.includes(terminator)) {
+    return isCjk(text[index - 1] ?? "");
+  }
+  return terminator === "\u2026" && isCjk(text[index - 1] ?? "");
+}
+function joinSentences(sentences) {
+  let result = "";
+  const separators = sentences.separators;
+  for (let i = 0; i < sentences.length; i++) {
+    const sentence = sentences[i];
+    if (result.length > 0) {
+      const separator = separators?.[i - 1];
+      result += separator ?? (endsWithoutSpace(result) ? "" : " ");
+    }
+    result += sentence;
+  }
+  return result;
+}
+function chunkContent(content, config = DEFAULT_CHUNKING_CONFIG) {
+  const totalTokens = estimateTokenCount(content);
+  if (totalTokens < config.minTokens) {
+    return {
+      chunked: false,
+      chunks: [{
+        content,
+        index: 0,
+        tokenCount: totalTokens
+      }]
+    };
+  }
+  const sentences = splitSentences(content);
+  if (sentences.length <= 1) {
+    return {
+      chunked: false,
+      chunks: [{
+        content,
+        index: 0,
+        tokenCount: totalTokens
+      }]
+    };
+  }
+  const chunks = [];
+  let currentChunkSentences = [];
+  let currentTokens = 0;
+  let chunkIndex = 0;
+  for (let i = 0; i < sentences.length; i++) {
+    const sentence = sentences[i];
+    const sentenceTokens = estimateTokenCount(sentence);
+    currentChunkSentences.push(sentence);
+    currentTokens += sentenceTokens;
+    const atTarget = currentTokens >= config.targetTokens;
+    const isLastSentence = i === sentences.length - 1;
+    if (atTarget || isLastSentence) {
+      const chunkContent2 = joinSentences(currentChunkSentences);
+      chunks.push({
+        content: chunkContent2,
+        index: chunkIndex,
+        tokenCount: estimateTokenCount(chunkContent2)
+      });
+      chunkIndex++;
+      if (!isLastSentence) {
+        const overlapCount = Math.min(config.overlapSentences, currentChunkSentences.length);
+        if (overlapCount <= 0) {
+          currentChunkSentences = [];
+          currentTokens = 0;
+        } else {
+          currentChunkSentences = currentChunkSentences.slice(-overlapCount);
+          currentTokens = currentChunkSentences.reduce((sum, s) => sum + estimateTokenCount(s), 0);
+        }
+      }
+    }
+  }
+  return {
+    chunked: chunks.length > 1,
+    chunks
+  };
+}
+function reassembleChunks(chunks) {
+  if (chunks.length === 0) return "";
+  if (chunks.length === 1) return chunks[0];
+  const result = [chunks[0]];
+  for (let i = 1; i < chunks.length; i++) {
+    const prevChunk = chunks[i - 1];
+    const currChunk = chunks[i];
+    const prevSentences = splitSentences(prevChunk);
+    const currSentences = splitSentences(currChunk);
+    let overlapCount = 0;
+    for (let j = 0; j < Math.min(prevSentences.length, currSentences.length); j++) {
+      const prevEnd = prevSentences.slice(-(j + 1));
+      const currStart = currSentences.slice(0, j + 1);
+      if (joinSentences(prevEnd) === joinSentences(currStart)) {
+        overlapCount = j + 1;
+      }
+    }
+    if (overlapCount > 0 && overlapCount < currSentences.length) {
+      result.push(joinSentences(currSentences.slice(overlapCount)));
+    } else if (overlapCount === 0) {
+      result.push(currChunk);
+    }
+  }
+  return joinSentences(result);
+}
+
+export {
+  DEFAULT_CHUNKING_CONFIG,
+  splitSentences,
+  joinSentences,
+  chunkContent,
+  reassembleChunks
+};
+//# sourceMappingURL=chunk-6TBIWIAG.js.map

package/dist/chunk-6TBIWIAG.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/chunking.ts"],"sourcesContent":["/**\n * Automatic Chunking with Overlap (Phase 2A)\n *\n * Sentence-boundary chunking for long memories.\n * Preserves coherent thoughts by never splitting mid-sentence.\n */\n\nimport { estimateTokenCount } from \"./token-estimate.js\";\n\nexport interface ChunkingConfig {\n  /** Target tokens per chunk (default 200) */\n  targetTokens: number;\n  /** Minimum tokens to trigger chunking (default 150) */\n  minTokens: number;\n  /** Number of sentences to overlap between chunks (default 2) */\n  overlapSentences: number;\n}\n\nexport interface Chunk {\n  /** Chunk content */\n  content: string;\n  /** 0-based index */\n  index: number;\n  /** Approximate token count */\n  tokenCount: number;\n}\n\nexport interface ChunkResult {\n  /** Whether content was chunked */\n  chunked: boolean;\n  /** Array of chunks (length 1 if not chunked) */\n  chunks: Chunk[];\n}\n\n/** Default chunking configuration */\nexport const DEFAULT_CHUNKING_CONFIG: ChunkingConfig = {\n  targetTokens: 200,\n  minTokens: 150,\n  overlapSentences: 2,\n};\n\n/**\n * Split text into sentences.\n *\n * The scan stays linear and does not use a backtracking regular expression.\n * ASCII punctuation keeps its old whitespace rule. Unicode terminators also\n * split when the next sentence starts immediately, as in CJK text.\n */\nconst UNICODE_SENTENCE_TERMINATORS = \"。．！？؟۔।॥｡…\";\nconst ASCII_SENTENCE_TERMINATORS = \".!?\";\nconst CJK_NO_SPACE_TERMINATORS = \"。．！？｡\";\nconst CLOSING_PUNCTUATION = \"\\\"'”’»」』）］】〉》)]}\";\nconst DIGITS = \"0123456789０１２３４５６７８９\";\nconst SENTENCE_SEGMENTER =\n  typeof Intl.Segmenter === \"function\"\n    ? new Intl.Segmenter(undefined, { granularity: \"sentence\" })\n    : undefined;\n\nfunction isSentenceTerminator(character: string): boolean {\n  return (\n    ASCII_SENTENCE_TERMINATORS.includes(character) ||\n    UNICODE_SENTENCE_TERMINATORS.includes(character)\n  );\n}\n\nfunction isCjk(character: string): boolean {\n  return /[\\u3000-\\u9fff\\uf900-\\ufaff\\uac00-\\ud7af]/u.test(character);\n}\n\ntype SentenceList = string[] & { separators: string[] };\n\nfunction splitSentencesFallback(text: string): SentenceList {\n  const sentences = [] as unknown as SentenceList;\n  Object.defineProperty(sentences, \"separators\", {\n    value: [],\n    writable: true,\n  });\n  let start = 0;\n  let separator = \"\";\n  for (let i = 0; i < text.length; i++) {\n    const ch = text[i];\n    if (!isSentenceTerminator(ch)) continue;\n\n    let end = i;\n    let hasUnicodeTerminator = UNICODE_SENTENCE_TERMINATORS.includes(ch);\n    while (end + 1 < text.length && isSentenceTerminator(text[end + 1])) {\n      end++;\n      hasUnicodeTerminator ||= UNICODE_SENTENCE_TERMINATORS.includes(text[end]);\n    }\n\n    const isFullwidthDecimal =\n      ch === \"．\" &&\n      DIGITS.includes(text[i - 1] ?? \"\") &&\n      DIGITS.includes(text[end + 1] ?? \"\");\n    while (end + 1 < text.length && CLOSING_PUNCTUATION.includes(text[end + 1])) {\n      end++;\n    }\n\n    const after = text[end + 1];\n    const boundary =\n      !isFullwidthDecimal &&\n      (hasUnicodeTerminator || after === undefined || /\\s/u.test(after));\n    if (boundary) {\n      const sentence = text.slice(start, end + 1).trim();\n      if (sentence.length > 0) {\n        sentences.push(sentence);\n        if (sentences.length > 1) sentences.separators.push(separator);\n      }\n      let nextStart = end + 1;\n      while (nextStart < text.length && /\\s/u.test(text[nextStart])) nextStart++;\n      separator = text.slice(end + 1, nextStart);\n      start = nextStart;\n    }\n    i = end;\n  }\n\n  const remaining = text.slice(start).trim();\n  if (remaining.length > 0) {\n    sentences.push(remaining);\n    if (sentences.length > 1) sentences.separators.push(separator);\n  }\n  return sentences;\n}\nexport function splitSentences(text: string): string[] {\n  const canUseSegmenter =\n    SENTENCE_SEGMENTER !== undefined &&\n    !/\\s/u.test(text) &&\n    [...text].some((character) => UNICODE_SENTENCE_TERMINATORS.includes(character));\n  if (canUseSegmenter) {\n    const segments = Array.from(SENTENCE_SEGMENTER.segment(text), ({ segment }) =>\n      segment.trim(),\n    ).filter((segment) => segment.length > 0) as SentenceList;\n    if (\n      segments.length > 1 &&\n      segments.slice(0, -1).every((segment) =>\n        [...segment].some((character) =>\n          UNICODE_SENTENCE_TERMINATORS.includes(character),\n        ),\n      )\n    ) {\n      Object.defineProperty(segments, \"separators\", {\n        value: Array(segments.length - 1).fill(\"\"),\n        writable: true,\n      });\n      return segments;\n    }\n  }\n  return splitSentencesFallback(text);\n}\n\nfunction endsWithoutSpace(text: string): boolean {\n  let index = text.length - 1;\n  while (index >= 0 && CLOSING_PUNCTUATION.includes(text[index])) index--;\n  const terminator = text[index] ?? \"\";\n  if (CJK_NO_SPACE_TERMINATORS.includes(terminator)) {\n    return isCjk(text[index - 1] ?? \"\");\n  }\n  return terminator === \"…\" && isCjk(text[index - 1] ?? \"\");\n}\nexport function joinSentences(sentences: string[]): string {\n  let result = \"\";\n  const separators = (sentences as Partial<SentenceList>).separators;\n  for (let i = 0; i < sentences.length; i++) {\n    const sentence = sentences[i];\n    if (result.length > 0) {\n      const separator = separators?.[i - 1];\n      result += separator ?? (endsWithoutSpace(result) ? \"\" : \" \");\n    }\n    result += sentence;\n  }\n  return result;\n}\n\n\n/**\n * Chunk content into overlapping segments at sentence boundaries.\n *\n * @param content - The text content to chunk\n * @param config - Chunking configuration\n * @returns ChunkResult with chunks array\n */\nexport function chunkContent(\n  content: string,\n  config: ChunkingConfig = DEFAULT_CHUNKING_CONFIG,\n): ChunkResult {\n  const totalTokens = estimateTokenCount(content);\n\n  // Don't chunk if below minimum threshold\n  if (totalTokens < config.minTokens) {\n    return {\n      chunked: false,\n      chunks: [{\n        content,\n        index: 0,\n        tokenCount: totalTokens,\n      }],\n    };\n  }\n\n  const sentences = splitSentences(content);\n\n  // If we couldn't split into multiple sentences, don't chunk\n  if (sentences.length <= 1) {\n    return {\n      chunked: false,\n      chunks: [{\n        content,\n        index: 0,\n        tokenCount: totalTokens,\n      }],\n    };\n  }\n\n  const chunks: Chunk[] = [];\n  let currentChunkSentences: string[] = [];\n  let currentTokens = 0;\n  let chunkIndex = 0;\n\n  for (let i = 0; i < sentences.length; i++) {\n    const sentence = sentences[i];\n    const sentenceTokens = estimateTokenCount(sentence);\n\n    // Add sentence to current chunk\n    currentChunkSentences.push(sentence);\n    currentTokens += sentenceTokens;\n\n    // Check if we've reached target size (with some flexibility)\n    // Allow going over by up to 50% to avoid tiny final chunks\n    const atTarget = currentTokens >= config.targetTokens;\n    const isLastSentence = i === sentences.length - 1;\n\n    if (atTarget || isLastSentence) {\n      // Create chunk from accumulated sentences\n      const chunkContent = joinSentences(currentChunkSentences);\n      chunks.push({\n        content: chunkContent,\n        index: chunkIndex,\n        tokenCount: estimateTokenCount(chunkContent),\n      });\n      chunkIndex++;\n\n      // Start new chunk with overlap (if not at end)\n      if (!isLastSentence) {\n        // Keep last N sentences for overlap.\n        // Guard: slice(-0) === slice(0), which returns the ENTIRE array\n        // (CLAUDE.md gotcha #27). When overlapSentences is 0, clear fully.\n        const overlapCount = Math.min(config.overlapSentences, currentChunkSentences.length);\n        if (overlapCount <= 0) {\n          currentChunkSentences = [];\n          currentTokens = 0;\n        } else {\n          currentChunkSentences = currentChunkSentences.slice(-overlapCount);\n          currentTokens = currentChunkSentences.reduce((sum, s) => sum + estimateTokenCount(s), 0);\n        }\n      }\n    }\n  }\n\n  // Only consider it \"chunked\" if we got multiple chunks\n  return {\n    chunked: chunks.length > 1,\n    chunks,\n  };\n}\n\n/**\n * Get parent content by reassembling chunks.\n * Useful for displaying full context when a chunk is retrieved.\n *\n * @param chunks - Array of chunk contents in order\n * @returns Reassembled parent content (with overlap removed)\n */\nexport function reassembleChunks(chunks: string[]): string {\n  if (chunks.length === 0) return \"\";\n  if (chunks.length === 1) return chunks[0];\n\n  // For overlapping chunks, we need to deduplicate\n  // Simple approach: use full first chunk, then non-overlapping parts of subsequent chunks\n  // This is imperfect but handles most cases\n  const result: string[] = [chunks[0]];\n\n  for (let i = 1; i < chunks.length; i++) {\n    const prevChunk = chunks[i - 1];\n    const currChunk = chunks[i];\n\n    // Find overlap by looking for common suffix/prefix\n    // Try to find where the previous chunk ends in the current chunk\n    const prevSentences = splitSentences(prevChunk);\n    const currSentences = splitSentences(currChunk);\n\n    // Find how many sentences from prev are at the start of curr\n    let overlapCount = 0;\n    for (let j = 0; j < Math.min(prevSentences.length, currSentences.length); j++) {\n      // Check if last N sentences of prev match first N sentences of curr\n      const prevEnd = prevSentences.slice(-(j + 1));\n      const currStart = currSentences.slice(0, j + 1);\n\n      if (joinSentences(prevEnd) === joinSentences(currStart)) {\n        overlapCount = j + 1;\n      }\n    }\n\n    // Add non-overlapping portion\n    if (overlapCount > 0 && overlapCount < currSentences.length) {\n      result.push(joinSentences(currSentences.slice(overlapCount)));\n    } else if (overlapCount === 0) {\n      // No detected overlap, add full chunk\n      result.push(currChunk);\n    }\n    // If overlapCount === currSentences.length, skip (fully contained)\n  }\n\n  return joinSentences(result);\n}\n"],"mappings":";;;;;AAmCO,IAAM,0BAA0C;AAAA,EACrD,cAAc;AAAA,EACd,WAAW;AAAA,EACX,kBAAkB;AACpB;AASA,IAAM,+BAA+B;AACrC,IAAM,6BAA6B;AACnC,IAAM,2BAA2B;AACjC,IAAM,sBAAsB;AAC5B,IAAM,SAAS;AACf,IAAM,qBACJ,OAAO,KAAK,cAAc,aACtB,IAAI,KAAK,UAAU,QAAW,EAAE,aAAa,WAAW,CAAC,IACzD;AAEN,SAAS,qBAAqB,WAA4B;AACxD,SACE,2BAA2B,SAAS,SAAS,KAC7C,6BAA6B,SAAS,SAAS;AAEnD;AAEA,SAAS,MAAM,WAA4B;AACzC,SAAO,6CAA6C,KAAK,SAAS;AACpE;AAIA,SAAS,uBAAuB,MAA4B;AAC1D,QAAM,YAAY,CAAC;AACnB,SAAO,eAAe,WAAW,cAAc;AAAA,IAC7C,OAAO,CAAC;AAAA,IACR,UAAU;AAAA,EACZ,CAAC;AACD,MAAI,QAAQ;AACZ,MAAI,YAAY;AAChB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,KAAK,KAAK,CAAC;AACjB,QAAI,CAAC,qBAAqB,EAAE,EAAG;AAE/B,QAAI,MAAM;AACV,QAAI,uBAAuB,6BAA6B,SAAS,EAAE;AACnE,WAAO,MAAM,IAAI,KAAK,UAAU,qBAAqB,KAAK,MAAM,CAAC,CAAC,GAAG;AACnE;AACA,+BAAyB,6BAA6B,SAAS,KAAK,GAAG,CAAC;AAAA,IAC1E;AAEA,UAAM,qBACJ,OAAO,YACP,OAAO,SAAS,KAAK,IAAI,CAAC,KAAK,EAAE,KACjC,OAAO,SAAS,KAAK,MAAM,CAAC,KAAK,EAAE;AACrC,WAAO,MAAM,IAAI,KAAK,UAAU,oBAAoB,SAAS,KAAK,MAAM,CAAC,CAAC,GAAG;AAC3E;AAAA,IACF;AAEA,UAAM,QAAQ,KAAK,MAAM,CAAC;AAC1B,UAAM,WACJ,CAAC,uBACA,wBAAwB,UAAU,UAAa,MAAM,KAAK,KAAK;AAClE,QAAI,UAAU;AACZ,YAAM,WAAW,KAAK,MAAM,OAAO,MAAM,CAAC,EAAE,KAAK;AACjD,UAAI,SAAS,SAAS,GAAG;AACvB,kBAAU,KAAK,QAAQ;AACvB,YAAI,UAAU,SAAS,EAAG,WAAU,WAAW,KAAK,SAAS;AAAA,MAC/D;AACA,UAAI,YAAY,MAAM;AACtB,aAAO,YAAY,KAAK,UAAU,MAAM,KAAK,KAAK,SAAS,CAAC,EAAG;AAC/D,kBAAY,KAAK,MAAM,MAAM,GAAG,SAAS;AACzC,cAAQ;AAAA,IACV;AACA,QAAI;AAAA,EACN;AAEA,QAAM,YAAY,KAAK,MAAM,KAAK,EAAE,KAAK;AACzC,MAAI,UAAU,SAAS,GAAG;AACxB,cAAU,KAAK,SAAS;AACxB,QAAI,UAAU,SAAS,EAAG,WAAU,WAAW,KAAK,SAAS;AAAA,EAC/D;AACA,SAAO;AACT;AACO,SAAS,eAAe,MAAwB;AACrD,QAAM,kBACJ,uBAAuB,UACvB,CAAC,MAAM,KAAK,IAAI,KAChB,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,cAAc,6BAA6B,SAAS,SAAS,CAAC;AAChF,MAAI,iBAAiB;AACnB,UAAM,WAAW,MAAM;AAAA,MAAK,mBAAmB,QAAQ,IAAI;AAAA,MAAG,CAAC,EAAE,QAAQ,MACvE,QAAQ,KAAK;AAAA,IACf,EAAE,OAAO,CAAC,YAAY,QAAQ,SAAS,CAAC;AACxC,QACE,SAAS,SAAS,KAClB,SAAS,MAAM,GAAG,EAAE,EAAE;AAAA,MAAM,CAAC,YAC3B,CAAC,GAAG,OAAO,EAAE;AAAA,QAAK,CAAC,cACjB,6BAA6B,SAAS,SAAS;AAAA,MACjD;AAAA,IACF,GACA;AACA,aAAO,eAAe,UAAU,cAAc;AAAA,QAC5C,OAAO,MAAM,SAAS,SAAS,CAAC,EAAE,KAAK,EAAE;AAAA,QACzC,UAAU;AAAA,MACZ,CAAC;AACD,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,uBAAuB,IAAI;AACpC;AAEA,SAAS,iBAAiB,MAAuB;AAC/C,MAAI,QAAQ,KAAK,SAAS;AAC1B,SAAO,SAAS,KAAK,oBAAoB,SAAS,KAAK,KAAK,CAAC,EAAG;AAChE,QAAM,aAAa,KAAK,KAAK,KAAK;AAClC,MAAI,yBAAyB,SAAS,UAAU,GAAG;AACjD,WAAO,MAAM,KAAK,QAAQ,CAAC,KAAK,EAAE;AAAA,EACpC;AACA,SAAO,eAAe,YAAO,MAAM,KAAK,QAAQ,CAAC,KAAK,EAAE;AAC1D;AACO,SAAS,cAAc,WAA6B;AACzD,MAAI,SAAS;AACb,QAAM,aAAc,UAAoC;AACxD,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,UAAM,WAAW,UAAU,CAAC;AAC5B,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,YAAY,aAAa,IAAI,CAAC;AACpC,gBAAU,cAAc,iBAAiB,MAAM,IAAI,KAAK;AAAA,IAC1D;AACA,cAAU;AAAA,EACZ;AACA,SAAO;AACT;AAUO,SAAS,aACd,SACA,SAAyB,yBACZ;AACb,QAAM,cAAc,mBAAmB,OAAO;AAG9C,MAAI,cAAc,OAAO,WAAW;AAClC,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ,CAAC;AAAA,QACP;AAAA,QACA,OAAO;AAAA,QACP,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,YAAY,eAAe,OAAO;AAGxC,MAAI,UAAU,UAAU,GAAG;AACzB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ,CAAC;AAAA,QACP;AAAA,QACA,OAAO;AAAA,QACP,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,SAAkB,CAAC;AACzB,MAAI,wBAAkC,CAAC;AACvC,MAAI,gBAAgB;AACpB,MAAI,aAAa;AAEjB,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,UAAM,WAAW,UAAU,CAAC;AAC5B,UAAM,iBAAiB,mBAAmB,QAAQ;AAGlD,0BAAsB,KAAK,QAAQ;AACnC,qBAAiB;AAIjB,UAAM,WAAW,iBAAiB,OAAO;AACzC,UAAM,iBAAiB,MAAM,UAAU,SAAS;AAEhD,QAAI,YAAY,gBAAgB;AAE9B,YAAMA,gBAAe,cAAc,qBAAqB;AACxD,aAAO,KAAK;AAAA,QACV,SAASA;AAAA,QACT,OAAO;AAAA,QACP,YAAY,mBAAmBA,aAAY;AAAA,MAC7C,CAAC;AACD;AAGA,UAAI,CAAC,gBAAgB;AAInB,cAAM,eAAe,KAAK,IAAI,OAAO,kBAAkB,sBAAsB,MAAM;AACnF,YAAI,gBAAgB,GAAG;AACrB,kCAAwB,CAAC;AACzB,0BAAgB;AAAA,QAClB,OAAO;AACL,kCAAwB,sBAAsB,MAAM,CAAC,YAAY;AACjE,0BAAgB,sBAAsB,OAAO,CAAC,KAAK,MAAM,MAAM,mBAAmB,CAAC,GAAG,CAAC;AAAA,QACzF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,SAAO;AAAA,IACL,SAAS,OAAO,SAAS;AAAA,IACzB;AAAA,EACF;AACF;AASO,SAAS,iBAAiB,QAA0B;AACzD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,MAAI,OAAO,WAAW,EAAG,QAAO,OAAO,CAAC;AAKxC,QAAM,SAAmB,CAAC,OAAO,CAAC,CAAC;AAEnC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,YAAY,OAAO,IAAI,CAAC;AAC9B,UAAM,YAAY,OAAO,CAAC;AAI1B,UAAM,gBAAgB,eAAe,SAAS;AAC9C,UAAM,gBAAgB,eAAe,SAAS;AAG9C,QAAI,eAAe;AACnB,aAAS,IAAI,GAAG,IAAI,KAAK,IAAI,cAAc,QAAQ,cAAc,MAAM,GAAG,KAAK;AAE7E,YAAM,UAAU,cAAc,MAAM,EAAE,IAAI,EAAE;AAC5C,YAAM,YAAY,cAAc,MAAM,GAAG,IAAI,CAAC;AAE9C,UAAI,cAAc,OAAO,MAAM,cAAc,SAAS,GAAG;AACvD,uBAAe,IAAI;AAAA,MACrB;AAAA,IACF;AAGA,QAAI,eAAe,KAAK,eAAe,cAAc,QAAQ;AAC3D,aAAO,KAAK,cAAc,cAAc,MAAM,YAAY,CAAC,CAAC;AAAA,IAC9D,WAAW,iBAAiB,GAAG;AAE7B,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,EAEF;AAEA,SAAO,cAAc,MAAM;AAC7B;","names":["chunkContent"]}

package/dist/{chunk-4O6R3GPK.js → chunk-6W2ISYUV.js}

@@ -9,14 +9,14 @@ import {
 } from "./chunk-666A3MOW.js";
 import {
   rebuildMemoryLifecycleLedger
-} from "./chunk-DNC4A7RS.js";
+} from "./chunk-OU7RWWW6.js";
 import {
   planNamespaceMaintenance,
   runNamespaceMaintenanceBatchPlan
-} from "./chunk-4YZCIK5E.js";
+} from "./chunk-EZXGJJXM.js";
 import {
   rebuildMemoryProjection
-} from "./chunk-IT57AOMC.js";
+} from "./chunk-AH2NX6S7.js";
 import {
   activityDayWindow,
   activityDigestPath,
@@ -1719,4 +1719,4 @@ export {
   ActivitySyncScheduler,
   MaintenanceScheduler
 };
-//# sourceMappingURL=chunk-4O6R3GPK.js.map
+//# sourceMappingURL=chunk-6W2ISYUV.js.map

package/dist/{chunk-3AJOJOFP.js → chunk-77DAFTUU.js}

@@ -2,10 +2,10 @@ import {
   discoverMemoryExtensions,
   renderExtensionsBlock,
   resolveExtensionsRoot
-} from "./chunk-JLNBQWZ2.js";
+} from "./chunk-5JMAGU26.js";
 import {
   runPostConsolidationMaterialize
-} from "./chunk-VYIXCMUP.js";
+} from "./chunk-KBIIE57I.js";
 import {
   isSemanticConsolidationLlmOperator
 } from "./chunk-G7D6GZ5J.js";
@@ -220,4 +220,4 @@ export {
   buildExtensionsBlockForConsolidation,
   materializeAfterSemanticConsolidation
 };
-//# sourceMappingURL=chunk-3AJOJOFP.js.map
+//# sourceMappingURL=chunk-77DAFTUU.js.map

package/dist/{chunk-IKT6ZVO7.js → chunk-7DHFB5SG.js}

@@ -1,10 +1,10 @@
 import {
   parseXrayFormat
-} from "./chunk-U7BMN33M.js";
+} from "./chunk-UBSM6TZP.js";
 import {
   RECALL_DISCLOSURE_LEVELS,
   isRecallDisclosure
-} from "./chunk-5QHDXMXP.js";
+} from "./chunk-LLZKOSGM.js";
 
 // src/recall-xray-cli.ts
 function parseXrayDisclosureFlag(value) {
@@ -50,4 +50,4 @@ export {
   parseXrayBudgetFlag,
   parseXrayCliOptions
 };
-//# sourceMappingURL=chunk-IKT6ZVO7.js.map
+//# sourceMappingURL=chunk-7DHFB5SG.js.map

package/dist/{chunk-SFR7J2G6.js → chunk-7G34CBKS.js}

@@ -2,7 +2,7 @@ import {
   SupportPassportError,
   SupportPassportOwnerCreateGrantRequestSchema,
   getOperation
-} from "./chunk-CZUHNJHX.js";
+} from "./chunk-6C7Q6NG3.js";
 
 // src/support-passport/access-http.ts
 var OWNER_ROOT = "/engram/v1/support-passport";
@@ -137,4 +137,4 @@ export {
   SUPPORT_PASSPORT_OWNER_HTTP_ROUTES,
   handleSupportPassportOwnerHttp
 };
-//# sourceMappingURL=chunk-SFR7J2G6.js.map
+//# sourceMappingURL=chunk-7G34CBKS.js.map

package/dist/{chunk-IT57AOMC.js → chunk-AH2NX6S7.js}

@@ -7,10 +7,10 @@ import {
 import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact
-} from "./chunk-6RK2X7BR.js";
+} from "./chunk-G3JFFUKR.js";
 import {
   StorageManager
-} from "./chunk-YTZA7U6Q.js";
+} from "./chunk-2VHCLHZ5.js";
 import {
   normalizeProjectionPreview,
   normalizeProjectionTags
@@ -1005,4 +1005,4 @@ export {
   verifyMemoryProjection,
   repairMemoryProjection
 };
-//# sourceMappingURL=chunk-IT57AOMC.js.map
+//# sourceMappingURL=chunk-AH2NX6S7.js.map