@illuma-ai/agents 1.5.1 → 2.1.1

package/dist/cjs/memory/constants.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"constants.cjs","sources":["../../../src/memory/constants.ts"],"sourcesContent":["/**\n * Autonomous memory — shared constants.\n *\n * Single source of truth for defaults, limits, and magic strings used across\n * the memory store, tools, flush phase, and tests. Changing a value here\n * changes it everywhere — no hunting through files.\n */\n\n/** Default embedding provider when {@link process.env.MEMORY_EMBEDDINGS_PROVIDER} is unset. */\nexport const DEFAULT_MEMORY_PROVIDER = 'bedrock' as const;\n\n/** Default embedding model (Titan v2 — AWS-native, 6× cheaper than Cohere v4). */\nexport const DEFAULT_MEMORY_MODEL = 'amazon.titan-embed-text-v2:0';\n\n/** Default vector width (Titan v2 supports 256 / 512 / 1024). */\nexport const DEFAULT_MEMORY_DIMENSIONS = 1024;\n\n/** Default Postgres table name; can be overridden via env for dev/prod sharing. */\nexport const DEFAULT_MEMORY_TABLE = 'agent_memories';\n\n/** Default Postgres schema. */\nexport const DEFAULT_MEMORY_SCHEMA = 'public';\n\n/** Phase values used by the flush-phase gate. */\nexport const MEMORY_PHASE_NORMAL = 'normal';\nexport const MEMORY_PHASE_FLUSHING = 'memory_flushing';\n\n/**\n * Search defaults — aligned with the standard defaults.\n *\n * Sources:\n * - `reference` → maxResults=6\n * - `reference` → maxInjectedChars=4000\n *\n * Keeping these in lockstep with means the mandatory-recall tool\n * description, budget clamps, and eval corpora line up with the standard\n * tuning — we inherit their calibration instead of re-tuning from scratch.\n */\nexport const DEFAULT_MAX_SEARCH_RESULTS = 6;\nexport const DEFAULT_MIN_SCORE = 0.1;\nexport const DEFAULT_MAX_INJECTED_CHARS = 4000;\n\n/** Hybrid retrieval weights — 70% vector cosine, 30% BM25 / ts_rank text score. */\nexport const HYBRID_VECTOR_WEIGHT = 0.7;\nexport const HYBRID_TEXT_WEIGHT = 0.3;\n\n/**\n * Phase 2 rerank defaults — ported from a reference implementation.\n *\n * Sources:\n * - `reference` → lambda=0.7\n * - `reference` → halfLifeDays=30\n *\n * Both features are opt-in (enabled=false by default) — the Phase 2\n * features are layered on top of hybrid search and don't change default\n * behavior for callers that upgrade in place.\n */\nexport const DEFAULT_MMR_ENABLED = false;\nexport const DEFAULT_MMR_LAMBDA = 0.7;\nexport const DEFAULT_TEMPORAL_DECAY_ENABLED = false;\nexport const DEFAULT_TEMPORAL_DECAY_HALF_LIFE_DAYS = 30;\nexport const DEFAULT_RECALL_TRACKING_ENABLED = false;\nexport const DEFAULT_CITATIONS_MODE = 'auto' as const;\n\n/**\n * Flush trigger margins (token counts) — aligned with standard.\n *\n * Sources:\n * - `reference` → softThreshold=4000\n * - `reference` → reserveFloor=20000\n */\nexport const DEFAULT_FLUSH_SOFT_THRESHOLD_TOKENS = 4000;\nexport const DEFAULT_FLUSH_RESERVE_FLOOR_TOKENS = 20000;\n\n/** Hard cap on append calls per flush phase — prevents runaway writes. */\nexport const DEFAULT_MAX_APPENDS_PER_FLUSH = 20;\n\n/**\n * Hard cap on agentic loop iterations inside {@link runMemoryFlush}.\n *\n * Each iteration = one model.invoke() followed by execution of any\n * `memory_append` tool_calls it emits. Mirrors the standard flush-plan\n * loop cap; 8 is enough for ~2–3 reflections of batched notes while\n * protecting against runaway cycles if the model refuses to stop.\n */\nexport const DEFAULT_MAX_FLUSH_ITERATIONS = 8;\n\n/** Path prefix enforced on every append. Paths outside this are rejected. */\nexport const MEMORY_PATH_PREFIX = 'memory/';\n\n/** Tool names — kept as constants so server code + tests never drift. */\nexport const MEMORY_SEARCH_TOOL_NAME = 'memory_search';\nexport const MEMORY_GET_TOOL_NAME = 'memory_get';\nexport const MEMORY_APPEND_TOOL_NAME = 'memory_append';\n\n/**\n * Mandatory-recall description — the single most load-bearing line in the\n * whole memory system. Do not soften, shorten, or reword without an eval run.\n *\n * Ported VERBATIM from a reference implementation `extensions/memory-core/src/tools.ts:186`.\n * The wiki/corpus clause is retained even though Phase 1 doesn't ship\n * compiled-wiki supplements — keeping the string identical means the standard\n * eval corpora remain drop-in valid.\n */\nexport const MEMORY_SEARCH_DESCRIPTION =\n  'Mandatory recall step: semantically search MEMORY.md + memory/*.md ' +\n  '(and optional session transcripts) before answering questions about ' +\n  'prior work, decisions, dates, people, preferences, or todos. Optional ' +\n  '`corpus=wiki` or `corpus=all` also searches registered compiled-wiki ' +\n  'supplements. If response has disabled=true, memory retrieval is ' +\n  'unavailable and should be surfaced to the user.';\n\n/**\n * Ported VERBATIM from a reference implementation `extensions/memory-core/src/tools.ts:322`.\n */\nexport const MEMORY_GET_DESCRIPTION =\n  'Safe snippet read from MEMORY.md or memory/*.md with optional from/lines; ' +\n  '`corpus=wiki` reads from registered compiled-wiki supplements. Use after ' +\n  'search to pull only the needed lines and keep context small.';\n\n/**\n * `memory_append` tool description.\n *\n * Phase 1 historically wrote to a single date-keyed file\n * (`memory/YYYY-MM-DD.md`), ported verbatim from a reference implementation. That scheme\n * is now replaced by an 8-path canonical whitelist — see\n * {@link ./paths.MEMORY_ALL_PATHS}. The tool description no longer\n * names a specific file; the flush-turn prompt renders the full rubric\n * inline so the model sees every writable path at inference time.\n */\nexport const MEMORY_APPEND_DESCRIPTION =\n  \"Append a durable note to one of the agent's canonical memory documents. \" +\n  'The `path` argument MUST be one of the whitelisted paths listed in the ' +\n  'flush prompt rubric — unknown paths are rejected. Content is merged into ' +\n  'the existing row for that document via UPSERT, so the same document ' +\n  'accumulates across sessions.';\n\n/**\n * Reply token that signals the flush turn produced no user-visible output.\n * Ported VERBATIM from a reference implementation `src/auto-reply/tokens.ts:4`.\n */\nexport const SILENT_REPLY_TOKEN = 'NO_REPLY';\n\n/**\n * Placeholder replaced at flush time with the rendered path-rubric for\n * the caller's scope. See `renderPathsRubric()` in `./paths.ts` and\n * `resolveFlushPrompts()` in `../prompts/memoryFlushPrompt.ts`.\n *\n * Kept as a unique sentinel so `replaceAll` is safe even if the rubric\n * content happens to contain regex metacharacters.\n */\nexport const FLUSH_PROMPT_RUBRIC_PLACEHOLDER = '{{MEMORY_PATHS_RUBRIC}}';\n\n/**\n * Memory-flush prompts — canonical-document model.\n *\n * Every durable memory routes into one of 8 stable canonical documents\n * (4 agent-tier + 4 user-tier). The rubric is injected at flush time so\n * the model reads the authoritative path list with descriptions, and for\n * isolated/autonomous agents the user-tier rows are transparently omitted\n * from the rubric — making \"user-tier writes require a scoped caller\" a\n * compile-time guarantee rather than a runtime check alone.\n *\n * Two-tier semantics the prompt enforces:\n *   - **agent/** — shared operational knowledge; every user of this agent\n *     benefits from rows written here. Do NOT put personal facts here.\n *   - **user/** — personalization for the specific caller only. Row is\n *     private to that user; other users never see it.\n */\nconst MEMORY_FLUSH_ROUTING_HINT =\n  'Route every note into exactly one of the canonical documents below by ' +\n  'picking the best match. Do NOT invent new paths; do NOT create date-keyed ' +\n  'files; unknown paths are rejected by the store.';\n\nconst MEMORY_FLUSH_TIER_HINT =\n  'Two tiers: `memory/agent/*` is SHARED operational knowledge visible to ' +\n  'every user of this agent — put successful patterns, pitfalls, domain ' +\n  'facts, and house-style there. `memory/user/*` is PRIVATE to the specific ' +\n  'caller — put their identity, preferences, projects, and references there. ' +\n  'Never put user-specific facts in an agent/* document.';\n\nconst MEMORY_FLUSH_READ_ONLY_HINT =\n  'Treat workspace bootstrap/reference files such as MEMORY.md, DREAMS.md, SOUL.md, TOOLS.md, and AGENTS.md as read-only during this flush; never overwrite, replace, or edit them.';\n\n/**\n * Learning hint — steers the flush turn to capture the things that\n * matter most for future turns: reusable patterns, tool failures\n * (so the same mistake is not repeated), explicit corrections, and\n * durable user-specific facts. Append-only via `memory_append`; one\n * note per lesson.\n */\nconst MEMORY_FLUSH_LEARNING_HINT =\n  'Capture durable lessons the agent (and future turns) should retain: ' +\n  '(a) successful task patterns and workflows → memory/agent/playbook.md; ' +\n  '(b) tool failures and schema mistakes → memory/agent/pitfalls.md; ' +\n  '(c) stable domain facts about the systems/APIs → memory/agent/domain.md; ' +\n  \"(d) this user's preferences, tone, and corrections → memory/user/preferences.md; \" +\n  \"(e) this user's identity and role → memory/user/profile.md. \" +\n  'Write one note per distinct lesson. Do not log conversation summaries ' +\n  'or anything derivable from the code or recent history.';\n\nconst MEMORY_FLUSH_RUBRIC_BLOCK =\n  'Canonical documents available for this turn (path — tag — description):\\n' +\n  FLUSH_PROMPT_RUBRIC_PLACEHOLDER;\n\nexport const DEFAULT_MEMORY_FLUSH_PROMPT = [\n  'Pre-compaction memory flush.',\n  MEMORY_FLUSH_ROUTING_HINT,\n  MEMORY_FLUSH_TIER_HINT,\n  MEMORY_FLUSH_READ_ONLY_HINT,\n  MEMORY_FLUSH_LEARNING_HINT,\n  'Call the `memory_append` tool for every note you want to persist, passing one of the whitelisted paths as the `path` argument. Do NOT describe what you are about to write; just call the tool.',\n  `If nothing worth storing, reply with exactly ${SILENT_REPLY_TOKEN}.`,\n  '',\n  MEMORY_FLUSH_RUBRIC_BLOCK,\n].join('\\n');\n\nexport const DEFAULT_MEMORY_FLUSH_SYSTEM_PROMPT = [\n  'Pre-compaction memory flush turn.',\n  'The session is near auto-compaction; capture durable memories to disk.',\n  MEMORY_FLUSH_ROUTING_HINT,\n  MEMORY_FLUSH_TIER_HINT,\n  MEMORY_FLUSH_READ_ONLY_HINT,\n  MEMORY_FLUSH_LEARNING_HINT,\n  'Use the `memory_append` tool for every durable note, with `path` set to one of the whitelisted canonical documents. Never claim you wrote a note without actually calling the tool.',\n  `If there is nothing worth storing, reply with exactly ${SILENT_REPLY_TOKEN}.`,\n  '',\n  MEMORY_FLUSH_RUBRIC_BLOCK,\n].join('\\n');\n"],"names":[],"mappings":";;AAAA;;;;;;AAMG;AAEH;AACO,MAAM,uBAAuB,GAAG;AAEvC;AACO,MAAM,oBAAoB,GAAG;AAEpC;AACO,MAAM,yBAAyB,GAAG;AAEzC;AACO,MAAM,oBAAoB,GAAG;AAEpC;AACO,MAAM,qBAAqB,GAAG;AAErC;AACO,MAAM,mBAAmB,GAAG;AAC5B,MAAM,qBAAqB,GAAG;AAErC;;;;;;;;;;AAUG;AACI,MAAM,0BAA0B,GAAG;AACnC,MAAM,iBAAiB,GAAG;AAC1B,MAAM,0BAA0B,GAAG;AAE1C;AACO,MAAM,oBAAoB,GAAG;AAC7B,MAAM,kBAAkB,GAAG;AAElC;;;;;;;;;;AAUG;AACI,MAAM,mBAAmB,GAAG;AAC5B,MAAM,kBAAkB,GAAG;AAC3B,MAAM,8BAA8B,GAAG;AACvC,MAAM,qCAAqC,GAAG;AAC9C,MAAM,+BAA+B,GAAG;AACxC,MAAM,sBAAsB,GAAG;AAEtC;;;;;;AAMG;AACI,MAAM,mCAAmC,GAAG;AAC5C,MAAM,kCAAkC,GAAG;AAElD;AACO,MAAM,6BAA6B,GAAG;AAE7C;;;;;;;AAOG;AACI,MAAM,4BAA4B,GAAG;AAE5C;AACO,MAAM,kBAAkB,GAAG;AAElC;AACO,MAAM,uBAAuB,GAAG;AAChC,MAAM,oBAAoB,GAAG;AAC7B,MAAM,uBAAuB,GAAG;AAEvC;;;;;;;;AAQG;AACI,MAAM,yBAAyB,GACpC,qEAAqE;IACrE,sEAAsE;IACtE,wEAAwE;IACxE,uEAAuE;IACvE,kEAAkE;AAClE,IAAA;AAEF;;AAEG;AACI,MAAM,sBAAsB,GACjC,4EAA4E;IAC5E,2EAA2E;AAC3E,IAAA;AAEF;;;;;;;;;AASG;AACI,MAAM,yBAAyB,GACpC,0EAA0E;IAC1E,yEAAyE;IACzE,2EAA2E;IAC3E,sEAAsE;AACtE,IAAA;AAEF;;;AAGG;AACI,MAAM,kBAAkB,GAAG;AAElC;;;;;;;AAOG;AACI,MAAM,+BAA+B,GAAG;AAE/C;;;;;;;;;;;;;;;AAeG;AACH,MAAM,yBAAyB,GAC7B,wEAAwE;IACxE,4EAA4E;AAC5E,IAAA,iDAAiD;AAEnD,MAAM,sBAAsB,GAC1B,yEAAyE;IACzE,uEAAuE;IACvE,2EAA2E;IAC3E,4EAA4E;AAC5E,IAAA,uDAAuD;AAEzD,MAAM,2BAA2B,GAC/B,kLAAkL;AAEpL;;;;;;AAMG;AACH,MAAM,0BAA0B,GAC9B,sEAAsE;IACtE,yEAAyE;IACzE,oEAAoE;IACpE,2EAA2E;IAC3E,mFAAmF;IACnF,8DAA8D;IAC9D,wEAAwE;AACxE,IAAA,wDAAwD;AAE1D,MAAM,yBAAyB,GAC7B,2EAA2E;AAC3E,IAAA,+BAA+B;AAE1B,MAAM,2BAA2B,GAAG;IACzC,8BAA8B;IAC9B,yBAAyB;IACzB,sBAAsB;IACtB,2BAA2B;IAC3B,0BAA0B;IAC1B,iMAAiM;AACjM,IAAA,CAAA,6CAAA,EAAgD,kBAAkB,CAAA,CAAA,CAAG;IACrE,EAAE;IACF,yBAAyB;AAC1B,CAAA,CAAC,IAAI,CAAC,IAAI;AAEJ,MAAM,kCAAkC,GAAG;IAChD,mCAAmC;IACnC,wEAAwE;IACxE,yBAAyB;IACzB,sBAAsB;IACtB,2BAA2B;IAC3B,0BAA0B;IAC1B,qLAAqL;AACrL,IAAA,CAAA,sDAAA,EAAyD,kBAAkB,CAAA,CAAA,CAAG;IAC9E,EAAE;IACF,yBAAyB;AAC1B,CAAA,CAAC,IAAI,CAAC,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"constants.cjs","sources":["../../../src/memory/constants.ts"],"sourcesContent":["/**\n * Autonomous memory — shared constants.\n *\n * Single source of truth for defaults, limits, and magic strings used across\n * the memory store, tools, flush phase, and tests. Changing a value here\n * changes it everywhere — no hunting through files.\n */\n\n/** Default embedding provider when {@link process.env.MEMORY_EMBEDDINGS_PROVIDER} is unset. */\nexport const DEFAULT_MEMORY_PROVIDER = 'bedrock' as const;\n\n/** Default embedding model (Titan v2 — AWS-native, 6× cheaper than Cohere v4). */\nexport const DEFAULT_MEMORY_MODEL = 'amazon.titan-embed-text-v2:0';\n\n/** Default vector width (Titan v2 supports 256 / 512 / 1024). */\nexport const DEFAULT_MEMORY_DIMENSIONS = 1024;\n\n/** Default Postgres table name; can be overridden via env for dev/prod sharing. */\nexport const DEFAULT_MEMORY_TABLE = 'agent_memories';\n\n/** Default Postgres schema. */\nexport const DEFAULT_MEMORY_SCHEMA = 'public';\n\n/** Phase values used by the flush-phase gate. */\nexport const MEMORY_PHASE_NORMAL = 'normal';\nexport const MEMORY_PHASE_FLUSHING = 'memory_flushing';\n\n/**\n * Search defaults — aligned with upstream's upstream defaults.\n *\n * Sources:\n * - `upstream reference` → maxResults=6\n * - `upstream reference` → maxInjectedChars=4000\n *\n * Keeping these in lockstep with upstream means the mandatory-recall tool\n * description, budget clamps, and eval corpora line up with upstream's\n * tuning — we inherit their calibration instead of re-tuning from scratch.\n */\nexport const DEFAULT_MAX_SEARCH_RESULTS = 6;\nexport const DEFAULT_MIN_SCORE = 0.1;\nexport const DEFAULT_MAX_INJECTED_CHARS = 4000;\n\n/** Hybrid retrieval weights — 70% vector cosine, 30% BM25 / ts_rank text score. */\nexport const HYBRID_VECTOR_WEIGHT = 0.7;\nexport const HYBRID_TEXT_WEIGHT = 0.3;\n\n/**\n * Phase 2 rerank defaults — ported from upstream.\n *\n * Sources:\n * - `upstream reference` → lambda=0.7\n * - `upstream reference` → halfLifeDays=30\n *\n * Both features are opt-in (enabled=false by default) — the Phase 2\n * features are layered on top of hybrid search and don't change default\n * behavior for callers that upgrade in place.\n */\nexport const DEFAULT_MMR_ENABLED = false;\nexport const DEFAULT_MMR_LAMBDA = 0.7;\nexport const DEFAULT_TEMPORAL_DECAY_ENABLED = false;\nexport const DEFAULT_TEMPORAL_DECAY_HALF_LIFE_DAYS = 30;\nexport const DEFAULT_RECALL_TRACKING_ENABLED = false;\nexport const DEFAULT_CITATIONS_MODE = 'auto' as const;\n\n/**\n * Flush trigger margins (token counts) — aligned with upstream upstream.\n *\n * Sources:\n * - `upstream reference` → softThreshold=4000\n * - `upstream reference` → reserveFloor=20000\n */\nexport const DEFAULT_FLUSH_SOFT_THRESHOLD_TOKENS = 4000;\nexport const DEFAULT_FLUSH_RESERVE_FLOOR_TOKENS = 20000;\n\n/** Hard cap on append calls per flush phase — prevents runaway writes. */\nexport const DEFAULT_MAX_APPENDS_PER_FLUSH = 20;\n\n/**\n * Hard cap on agentic loop iterations inside {@link runMemoryFlush}.\n *\n * Each iteration = one model.invoke() followed by execution of any\n * `memory_append` tool_calls it emits. Mirrors upstream's flush-plan\n * loop cap; 8 is enough for ~2–3 reflections of batched notes while\n * protecting against runaway cycles if the model refuses to stop.\n */\nexport const DEFAULT_MAX_FLUSH_ITERATIONS = 8;\n\n/** Path prefix enforced on every append. Paths outside this are rejected. */\nexport const MEMORY_PATH_PREFIX = 'memory/';\n\n/** Tool names — kept as constants so server code + tests never drift. */\nexport const MEMORY_SEARCH_TOOL_NAME = 'memory_search';\nexport const MEMORY_GET_TOOL_NAME = 'memory_get';\nexport const MEMORY_APPEND_TOOL_NAME = 'memory_append';\n\n/**\n * Mandatory-recall description — the single most load-bearing line in the\n * whole memory system. Do not soften, shorten, or reword without an eval run.\n *\n * Ported VERBATIM from upstream `extensions/memory-core/src/tools.ts:186`.\n * The wiki/corpus clause is retained even though Phase 1 doesn't ship\n * compiled-wiki supplements — keeping the string identical means upstream's\n * eval corpora remain drop-in valid.\n */\nexport const MEMORY_SEARCH_DESCRIPTION =\n  'Mandatory recall step: semantically search MEMORY.md + memory/*.md ' +\n  '(and optional session transcripts) before answering questions about ' +\n  'prior work, decisions, dates, people, preferences, or todos. Optional ' +\n  '`corpus=wiki` or `corpus=all` also searches registered compiled-wiki ' +\n  'supplements. If response has disabled=true, memory retrieval is ' +\n  'unavailable and should be surfaced to the user.';\n\n/**\n * Ported VERBATIM from upstream `extensions/memory-core/src/tools.ts:322`.\n */\nexport const MEMORY_GET_DESCRIPTION =\n  'Safe snippet read from MEMORY.md or memory/*.md with optional from/lines; ' +\n  '`corpus=wiki` reads from registered compiled-wiki supplements. Use after ' +\n  'search to pull only the needed lines and keep context small.';\n\n/**\n * `memory_append` tool description.\n *\n * Phase 1 historically wrote to a single date-keyed file\n * (`memory/YYYY-MM-DD.md`), ported verbatim from upstream. That scheme\n * is now replaced by an 8-path canonical whitelist — see\n * {@link ./paths.MEMORY_ALL_PATHS}. The tool description no longer\n * names a specific file; the flush-turn prompt renders the full rubric\n * inline so the model sees every writable path at inference time.\n */\nexport const MEMORY_APPEND_DESCRIPTION =\n  \"Append a durable note to one of the agent's canonical memory documents. \" +\n  'The `path` argument MUST be one of the whitelisted paths listed in the ' +\n  'flush prompt rubric — unknown paths are rejected. Content is merged into ' +\n  'the existing row for that document via UPSERT, so the same document ' +\n  'accumulates across sessions.';\n\n/**\n * Reply token that signals the flush turn produced no user-visible output.\n * Ported VERBATIM from upstream `src/auto-reply/tokens.ts:4`.\n */\nexport const SILENT_REPLY_TOKEN = 'NO_REPLY';\n\n/**\n * Placeholder replaced at flush time with the rendered path-rubric for\n * the caller's scope. See `renderPathsRubric()` in `./paths.ts` and\n * `resolveFlushPrompts()` in `../prompts/memoryFlushPrompt.ts`.\n *\n * Kept as a unique sentinel so `replaceAll` is safe even if the rubric\n * content happens to contain regex metacharacters.\n */\nexport const FLUSH_PROMPT_RUBRIC_PLACEHOLDER = '{{MEMORY_PATHS_RUBRIC}}';\n\n/**\n * Memory-flush prompts — canonical-document model.\n *\n * Every durable memory routes into one of 8 stable canonical documents\n * (4 agent-tier + 4 user-tier). The rubric is injected at flush time so\n * the model reads the authoritative path list with descriptions, and for\n * isolated/autonomous agents the user-tier rows are transparently omitted\n * from the rubric — making \"user-tier writes require a scoped caller\" a\n * compile-time guarantee rather than a runtime check alone.\n *\n * Two-tier semantics the prompt enforces:\n *   - **agent/** — shared operational knowledge; every user of this agent\n *     benefits from rows written here. Do NOT put personal facts here.\n *   - **user/** — personalization for the specific caller only. Row is\n *     private to that user; other users never see it.\n */\nconst MEMORY_FLUSH_ROUTING_HINT =\n  'Route every note into exactly one of the canonical documents below by ' +\n  'picking the best match. Do NOT invent new paths; do NOT create date-keyed ' +\n  'files; unknown paths are rejected by the store.';\n\nconst MEMORY_FLUSH_TIER_HINT =\n  'Two tiers: `memory/agent/*` is SHARED operational knowledge visible to ' +\n  'every user of this agent — put successful patterns, pitfalls, domain ' +\n  'facts, and house-style there. `memory/user/*` is PRIVATE to the specific ' +\n  'caller — put their identity, preferences, projects, and references there. ' +\n  'Never put user-specific facts in an agent/* document.';\n\nconst MEMORY_FLUSH_READ_ONLY_HINT =\n  'Treat workspace bootstrap/reference files such as MEMORY.md, DREAMS.md, SOUL.md, TOOLS.md, and AGENTS.md as read-only during this flush; never overwrite, replace, or edit them.';\n\n/**\n * Learning hint — steers the flush turn to capture the things that\n * matter most for future turns: reusable patterns, tool failures\n * (so the same mistake is not repeated), explicit corrections, and\n * durable user-specific facts. Append-only via `memory_append`; one\n * note per lesson.\n */\nconst MEMORY_FLUSH_LEARNING_HINT =\n  'Capture durable lessons the agent (and future turns) should retain: ' +\n  '(a) successful task patterns and workflows → memory/agent/playbook.md; ' +\n  '(b) tool failures and schema mistakes → memory/agent/pitfalls.md; ' +\n  '(c) stable domain facts about the systems/APIs → memory/agent/domain.md; ' +\n  \"(d) this user's preferences, tone, and corrections → memory/user/preferences.md; \" +\n  \"(e) this user's identity and role → memory/user/profile.md. \" +\n  'Write one note per distinct lesson. Do not log conversation summaries ' +\n  'or anything derivable from the code or recent history.';\n\nconst MEMORY_FLUSH_RUBRIC_BLOCK =\n  'Canonical documents available for this turn (path — tag — description):\\n' +\n  FLUSH_PROMPT_RUBRIC_PLACEHOLDER;\n\nexport const DEFAULT_MEMORY_FLUSH_PROMPT = [\n  'Pre-compaction memory flush.',\n  MEMORY_FLUSH_ROUTING_HINT,\n  MEMORY_FLUSH_TIER_HINT,\n  MEMORY_FLUSH_READ_ONLY_HINT,\n  MEMORY_FLUSH_LEARNING_HINT,\n  'Call the `memory_append` tool for every note you want to persist, passing one of the whitelisted paths as the `path` argument. Do NOT describe what you are about to write; just call the tool.',\n  `If nothing worth storing, reply with exactly ${SILENT_REPLY_TOKEN}.`,\n  '',\n  MEMORY_FLUSH_RUBRIC_BLOCK,\n].join('\\n');\n\nexport const DEFAULT_MEMORY_FLUSH_SYSTEM_PROMPT = [\n  'Pre-compaction memory flush turn.',\n  'The session is near auto-compaction; capture durable memories to disk.',\n  MEMORY_FLUSH_ROUTING_HINT,\n  MEMORY_FLUSH_TIER_HINT,\n  MEMORY_FLUSH_READ_ONLY_HINT,\n  MEMORY_FLUSH_LEARNING_HINT,\n  'Use the `memory_append` tool for every durable note, with `path` set to one of the whitelisted canonical documents. Never claim you wrote a note without actually calling the tool.',\n  `If there is nothing worth storing, reply with exactly ${SILENT_REPLY_TOKEN}.`,\n  '',\n  MEMORY_FLUSH_RUBRIC_BLOCK,\n].join('\\n');\n"],"names":[],"mappings":";;AAAA;;;;;;AAMG;AAEH;AACO,MAAM,uBAAuB,GAAG;AAEvC;AACO,MAAM,oBAAoB,GAAG;AAEpC;AACO,MAAM,yBAAyB,GAAG;AAEzC;AACO,MAAM,oBAAoB,GAAG;AAEpC;AACO,MAAM,qBAAqB,GAAG;AAErC;AACO,MAAM,mBAAmB,GAAG;AAC5B,MAAM,qBAAqB,GAAG;AAErC;;;;;;;;;;AAUG;AACI,MAAM,0BAA0B,GAAG;AACnC,MAAM,iBAAiB,GAAG;AAC1B,MAAM,0BAA0B,GAAG;AAE1C;AACO,MAAM,oBAAoB,GAAG;AAC7B,MAAM,kBAAkB,GAAG;AAElC;;;;;;;;;;AAUG;AACI,MAAM,mBAAmB,GAAG;AAC5B,MAAM,kBAAkB,GAAG;AAC3B,MAAM,8BAA8B,GAAG;AACvC,MAAM,qCAAqC,GAAG;AAC9C,MAAM,+BAA+B,GAAG;AACxC,MAAM,sBAAsB,GAAG;AAEtC;;;;;;AAMG;AACI,MAAM,mCAAmC,GAAG;AAC5C,MAAM,kCAAkC,GAAG;AAElD;AACO,MAAM,6BAA6B,GAAG;AAE7C;;;;;;;AAOG;AACI,MAAM,4BAA4B,GAAG;AAE5C;AACO,MAAM,kBAAkB,GAAG;AAElC;AACO,MAAM,uBAAuB,GAAG;AAChC,MAAM,oBAAoB,GAAG;AAC7B,MAAM,uBAAuB,GAAG;AAEvC;;;;;;;;AAQG;AACI,MAAM,yBAAyB,GACpC,qEAAqE;IACrE,sEAAsE;IACtE,wEAAwE;IACxE,uEAAuE;IACvE,kEAAkE;AAClE,IAAA;AAEF;;AAEG;AACI,MAAM,sBAAsB,GACjC,4EAA4E;IAC5E,2EAA2E;AAC3E,IAAA;AAEF;;;;;;;;;AASG;AACI,MAAM,yBAAyB,GACpC,0EAA0E;IAC1E,yEAAyE;IACzE,2EAA2E;IAC3E,sEAAsE;AACtE,IAAA;AAEF;;;AAGG;AACI,MAAM,kBAAkB,GAAG;AAElC;;;;;;;AAOG;AACI,MAAM,+BAA+B,GAAG;AAE/C;;;;;;;;;;;;;;;AAeG;AACH,MAAM,yBAAyB,GAC7B,wEAAwE;IACxE,4EAA4E;AAC5E,IAAA,iDAAiD;AAEnD,MAAM,sBAAsB,GAC1B,yEAAyE;IACzE,uEAAuE;IACvE,2EAA2E;IAC3E,4EAA4E;AAC5E,IAAA,uDAAuD;AAEzD,MAAM,2BAA2B,GAC/B,kLAAkL;AAEpL;;;;;;AAMG;AACH,MAAM,0BAA0B,GAC9B,sEAAsE;IACtE,yEAAyE;IACzE,oEAAoE;IACpE,2EAA2E;IAC3E,mFAAmF;IACnF,8DAA8D;IAC9D,wEAAwE;AACxE,IAAA,wDAAwD;AAE1D,MAAM,yBAAyB,GAC7B,2EAA2E;AAC3E,IAAA,+BAA+B;AAE1B,MAAM,2BAA2B,GAAG;IACzC,8BAA8B;IAC9B,yBAAyB;IACzB,sBAAsB;IACtB,2BAA2B;IAC3B,0BAA0B;IAC1B,iMAAiM;AACjM,IAAA,CAAA,6CAAA,EAAgD,kBAAkB,CAAA,CAAA,CAAG;IACrE,EAAE;IACF,yBAAyB;AAC1B,CAAA,CAAC,IAAI,CAAC,IAAI;AAEJ,MAAM,kCAAkC,GAAG;IAChD,mCAAmC;IACnC,wEAAwE;IACxE,yBAAyB;IACzB,sBAAsB;IACtB,2BAA2B;IAC3B,0BAA0B;IAC1B,qLAAqL;AACrL,IAAA,CAAA,sDAAA,EAAyD,kBAAkB,CAAA,CAAA,CAAG;IAC9E,EAAE;IACF,yBAAyB;AAC1B,CAAA,CAAC,IAAI,CAAC,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/cjs/memory/mmr.cjs

@@ -3,7 +3,7 @@
 /**
  * Maximal Marginal Relevance (MMR) re-ranking — Phase 2.
  *
- * Ported from a reference implementation `extensions/memory-core/src/memory/mmr.ts` with
+ * Ported from upstream `extensions/memory-core/src/memory/mmr.ts` with
  * minor adaptation for our `MemoryEntry` shape (content vs snippet, id vs
  * path+startLine). Behavior is identical: normalize scores, iteratively
  * pick the item that maximizes `λ * relevance - (1-λ) * max_similarity`

package/dist/cjs/memory/mmr.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"mmr.cjs","sources":["../../../src/memory/mmr.ts"],"sourcesContent":["/**\n * Maximal Marginal Relevance (MMR) re-ranking — Phase 2.\n *\n * Ported from a reference implementation `extensions/memory-core/src/memory/mmr.ts` with\n * minor adaptation for our `MemoryEntry` shape (content vs snippet, id vs\n * path+startLine). Behavior is identical: normalize scores, iteratively\n * pick the item that maximizes `λ * relevance - (1-λ) * max_similarity`\n * using Jaccard on tokenized content.\n *\n * @see Carbonell & Goldstein, \"The Use of MMR, Diversity-Based Reranking\" (1998)\n */\n\nexport interface MMRConfig {\n  /** Opt-in. Default is false. */\n  enabled: boolean;\n  /** 0 = max diversity, 1 = max relevance. Default 0.7. */\n  lambda: number;\n}\n\nexport const DEFAULT_MMR_CONFIG: MMRConfig = {\n  enabled: false,\n  lambda: 0.7,\n};\n\n/**\n * CJK Unified Ideographs + Extension A, Hiragana/Katakana, Hangul.\n * These lack whitespace boundaries so we must tokenize them differently.\n */\nconst CJK_RE =\n  /[\\u3040-\\u309f\\u30a0-\\u30ff\\u3400-\\u4dbf\\u4e00-\\u9fff\\uac00-\\ud7af\\u1100-\\u11ff]/;\n\n/**\n * Tokenize content into a set for Jaccard similarity.\n *\n * ASCII: alphanumeric + underscore runs, lowercased.\n * CJK: each char becomes a unigram; consecutive pairs become a bigram.\n * Non-adjacent CJK chars (e.g. `我a好`) do NOT form a bigram.\n */\nexport function tokenize(text: string): Set<string> {\n  const lower = (text ?? '').toLowerCase();\n  const ascii = lower.match(/[a-z0-9_]+/g) ?? [];\n\n  const chars = Array.from(lower);\n  const cjkData: Array<{ char: string; index: number }> = [];\n  for (let i = 0; i < chars.length; i++) {\n    if (CJK_RE.test(chars[i])) cjkData.push({ char: chars[i], index: i });\n  }\n\n  const bigrams: string[] = [];\n  for (let i = 0; i < cjkData.length - 1; i++) {\n    if (cjkData[i + 1].index === cjkData[i].index + 1) {\n      bigrams.push(cjkData[i].char + cjkData[i + 1].char);\n    }\n  }\n\n  return new Set([...ascii, ...bigrams, ...cjkData.map((d) => d.char)]);\n}\n\nexport function jaccardSimilarity(a: Set<string>, b: Set<string>): number {\n  if (a.size === 0 && b.size === 0) return 1;\n  if (a.size === 0 || b.size === 0) return 0;\n\n  const [smaller, larger] = a.size <= b.size ? [a, b] : [b, a];\n  let intersection = 0;\n  for (const t of smaller) if (larger.has(t)) intersection++;\n  const union = a.size + b.size - intersection;\n  return union === 0 ? 0 : intersection / union;\n}\n\nexport function textSimilarity(a: string, b: string): number {\n  return jaccardSimilarity(tokenize(a), tokenize(b));\n}\n\nexport function computeMMRScore(\n  relevance: number,\n  maxSimilarity: number,\n  lambda: number\n): number {\n  return lambda * relevance - (1 - lambda) * maxSimilarity;\n}\n\nexport interface MMRItem {\n  id: string;\n  score: number;\n  content: string;\n}\n\n/**\n * Re-rank items using MMR. Returns a new array in MMR order.\n */\nexport function mmrRerank<T extends MMRItem>(\n  items: T[],\n  config: Partial<MMRConfig> = {}\n): T[] {\n  const enabled = config.enabled ?? DEFAULT_MMR_CONFIG.enabled;\n  const rawLambda = config.lambda ?? DEFAULT_MMR_CONFIG.lambda;\n\n  if (!enabled || items.length <= 1) return [...items];\n\n  const lambda = Math.max(0, Math.min(1, rawLambda));\n  if (lambda === 1) return [...items].sort((a, b) => b.score - a.score);\n\n  const tokenCache = new Map<string, Set<string>>();\n  for (const item of items) tokenCache.set(item.id, tokenize(item.content));\n\n  const scores = items.map((i) => i.score);\n  const maxScore = Math.max(...scores);\n  const minScore = Math.min(...scores);\n  const range = maxScore - minScore;\n  const normalize = (s: number): number =>\n    range === 0 ? 1 : (s - minScore) / range;\n\n  const selected: T[] = [];\n  const remaining = new Set(items);\n\n  while (remaining.size > 0) {\n    let best: T | null = null;\n    let bestMMR = -Infinity;\n    for (const cand of remaining) {\n      const rel = normalize(cand.score);\n      const candTokens = tokenCache.get(cand.id)!;\n      let maxSim = 0;\n      for (const sel of selected) {\n        const sim = jaccardSimilarity(candTokens, tokenCache.get(sel.id)!);\n        if (sim > maxSim) maxSim = sim;\n      }\n      const mmr = computeMMRScore(rel, maxSim, lambda);\n      if (\n        mmr > bestMMR ||\n        (mmr === bestMMR && cand.score > (best?.score ?? -Infinity))\n      ) {\n        bestMMR = mmr;\n        best = cand;\n      }\n    }\n    if (!best) break;\n    selected.push(best);\n    remaining.delete(best);\n  }\n\n  return selected;\n}\n\n/**\n * Adapter: apply MMR to an array of MemoryEntry-shaped hits.\n *\n * Uses (path|id|index) as the stable ID so two hits from the same file at\n * different content still get distinct MMR identities.\n */\nexport function applyMMRToMemoryHits<\n  T extends { id: string; path: string; content: string; score: number },\n>(results: T[], config: Partial<MMRConfig> = {}): T[] {\n  if (results.length <= 1) return results;\n  const byId = new Map<string, T>();\n  const items: MMRItem[] = results.map((r, i) => {\n    const id = `${r.path}#${r.id}#${i}`;\n    byId.set(id, r);\n    return { id, score: r.score, content: r.content };\n  });\n  return mmrRerank(items, config).map((m) => byId.get(m.id)!);\n}\n"],"names":[],"mappings":";;AAAA;;;;;;;;;;AAUG;AASI,MAAM,kBAAkB,GAAc;AAC3C,IAAA,OAAO,EAAE,KAAK;AACd,IAAA,MAAM,EAAE,GAAG;;AAGb;;;AAGG;AACH,MAAM,MAAM,GACV,kFAAkF;AAEpF;;;;;;AAMG;AACG,SAAU,QAAQ,CAAC,IAAY,EAAA;IACnC,MAAM,KAAK,GAAG,CAAC,IAAI,IAAI,EAAE,EAAE,WAAW,EAAE;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE;IAE9C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;IAC/B,MAAM,OAAO,GAA2C,EAAE;AAC1D,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IACvE;IAEA,MAAM,OAAO,GAAa,EAAE;AAC5B,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC3C,QAAA,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE;AACjD,YAAA,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QACrD;IACF;IAEA,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACvE;AAEM,SAAU,iBAAiB,CAAC,CAAc,EAAE,CAAc,EAAA;IAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;AAAE,QAAA,OAAO,CAAC;IAC1C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;AAAE,QAAA,OAAO,CAAC;AAE1C,IAAA,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5D,IAAI,YAAY,GAAG,CAAC;IACpB,KAAK,MAAM,CAAC,IAAI,OAAO;AAAE,QAAA,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAAE,YAAA,YAAY,EAAE;IAC1D,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY;AAC5C,IAAA,OAAO,KAAK,KAAK,CAAC,GAAG,CAAC,GAAG,YAAY,GAAG,KAAK;AAC/C;AAEM,SAAU,cAAc,CAAC,CAAS,EAAE,CAAS,EAAA;AACjD,IAAA,OAAO,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;AACpD;SAEgB,eAAe,CAC7B,SAAiB,EACjB,aAAqB,EACrB,MAAc,EAAA;IAEd,OAAO,MAAM,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,MAAM,IAAI,aAAa;AAC1D;AAQA;;AAEG;SACa,SAAS,CACvB,KAAU,EACV,SAA6B,EAAE,EAAA;IAE/B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,kBAAkB,CAAC,OAAO;IAC5D,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,IAAI,kBAAkB,CAAC,MAAM;AAE5D,IAAA,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;AAAE,QAAA,OAAO,CAAC,GAAG,KAAK,CAAC;AAEpD,IAAA,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAClD,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;AAErE,IAAA,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK;AAAE,QAAA,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAEzE,IAAA,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;AACpC,IAAA,MAAM,KAAK,GAAG,QAAQ,GAAG,QAAQ;IACjC,MAAM,SAAS,GAAG,CAAC,CAAS,KAC1B,KAAK,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,IAAI,KAAK;IAE1C,MAAM,QAAQ,GAAQ,EAAE;AACxB,IAAA,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC;AAEhC,IAAA,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE;QACzB,IAAI,IAAI,GAAa,IAAI;AACzB,QAAA,IAAI,OAAO,GAAG,CAAC,QAAQ;AACvB,QAAA,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;YAC5B,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;YACjC,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE;YAC3C,IAAI,MAAM,GAAG,CAAC;AACd,YAAA,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;AAC1B,gBAAA,MAAM,GAAG,GAAG,iBAAiB,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBAClE,IAAI,GAAG,GAAG,MAAM;oBAAE,MAAM,GAAG,GAAG;YAChC;YACA,MAAM,GAAG,GAAG,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC;YAChD,IACE,GAAG,GAAG,OAAO;AACb,iBAAC,GAAG,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,EAC5D;gBACA,OAAO,GAAG,GAAG;gBACb,IAAI,GAAG,IAAI;YACb;QACF;AACA,QAAA,IAAI,CAAC,IAAI;YAAE;AACX,QAAA,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AACnB,QAAA,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;IACxB;AAEA,IAAA,OAAO,QAAQ;AACjB;AAEA;;;;;AAKG;SACa,oBAAoB,CAElC,OAAY,EAAE,SAA6B,EAAE,EAAA;AAC7C,IAAA,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;AAAE,QAAA,OAAO,OAAO;AACvC,IAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa;IACjC,MAAM,KAAK,GAAc,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;AAC5C,QAAA,MAAM,EAAE,GAAG,CAAA,EAAG,CAAC,CAAC,IAAI,CAAA,CAAA,EAAI,CAAC,CAAC,EAAE,CAAA,CAAA,EAAI,CAAC,EAAE;AACnC,QAAA,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;AACf,QAAA,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE;AACnD,IAAA,CAAC,CAAC;IACF,OAAO,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;AAC7D;;;;;;;;;;"}
+{"version":3,"file":"mmr.cjs","sources":["../../../src/memory/mmr.ts"],"sourcesContent":["/**\n * Maximal Marginal Relevance (MMR) re-ranking — Phase 2.\n *\n * Ported from upstream `extensions/memory-core/src/memory/mmr.ts` with\n * minor adaptation for our `MemoryEntry` shape (content vs snippet, id vs\n * path+startLine). Behavior is identical: normalize scores, iteratively\n * pick the item that maximizes `λ * relevance - (1-λ) * max_similarity`\n * using Jaccard on tokenized content.\n *\n * @see Carbonell & Goldstein, \"The Use of MMR, Diversity-Based Reranking\" (1998)\n */\n\nexport interface MMRConfig {\n  /** Opt-in. Upstream default is false. */\n  enabled: boolean;\n  /** 0 = max diversity, 1 = max relevance. Upstream default 0.7. */\n  lambda: number;\n}\n\nexport const DEFAULT_MMR_CONFIG: MMRConfig = {\n  enabled: false,\n  lambda: 0.7,\n};\n\n/**\n * CJK Unified Ideographs + Extension A, Hiragana/Katakana, Hangul.\n * These lack whitespace boundaries so we must tokenize them differently.\n */\nconst CJK_RE =\n  /[\\u3040-\\u309f\\u30a0-\\u30ff\\u3400-\\u4dbf\\u4e00-\\u9fff\\uac00-\\ud7af\\u1100-\\u11ff]/;\n\n/**\n * Tokenize content into a set for Jaccard similarity.\n *\n * ASCII: alphanumeric + underscore runs, lowercased.\n * CJK: each char becomes a unigram; consecutive pairs become a bigram.\n * Non-adjacent CJK chars (e.g. `我a好`) do NOT form a bigram.\n */\nexport function tokenize(text: string): Set<string> {\n  const lower = (text ?? '').toLowerCase();\n  const ascii = lower.match(/[a-z0-9_]+/g) ?? [];\n\n  const chars = Array.from(lower);\n  const cjkData: Array<{ char: string; index: number }> = [];\n  for (let i = 0; i < chars.length; i++) {\n    if (CJK_RE.test(chars[i])) cjkData.push({ char: chars[i], index: i });\n  }\n\n  const bigrams: string[] = [];\n  for (let i = 0; i < cjkData.length - 1; i++) {\n    if (cjkData[i + 1].index === cjkData[i].index + 1) {\n      bigrams.push(cjkData[i].char + cjkData[i + 1].char);\n    }\n  }\n\n  return new Set([...ascii, ...bigrams, ...cjkData.map((d) => d.char)]);\n}\n\nexport function jaccardSimilarity(a: Set<string>, b: Set<string>): number {\n  if (a.size === 0 && b.size === 0) return 1;\n  if (a.size === 0 || b.size === 0) return 0;\n\n  const [smaller, larger] = a.size <= b.size ? [a, b] : [b, a];\n  let intersection = 0;\n  for (const t of smaller) if (larger.has(t)) intersection++;\n  const union = a.size + b.size - intersection;\n  return union === 0 ? 0 : intersection / union;\n}\n\nexport function textSimilarity(a: string, b: string): number {\n  return jaccardSimilarity(tokenize(a), tokenize(b));\n}\n\nexport function computeMMRScore(\n  relevance: number,\n  maxSimilarity: number,\n  lambda: number\n): number {\n  return lambda * relevance - (1 - lambda) * maxSimilarity;\n}\n\nexport interface MMRItem {\n  id: string;\n  score: number;\n  content: string;\n}\n\n/**\n * Re-rank items using MMR. Returns a new array in MMR order.\n */\nexport function mmrRerank<T extends MMRItem>(\n  items: T[],\n  config: Partial<MMRConfig> = {}\n): T[] {\n  const enabled = config.enabled ?? DEFAULT_MMR_CONFIG.enabled;\n  const rawLambda = config.lambda ?? DEFAULT_MMR_CONFIG.lambda;\n\n  if (!enabled || items.length <= 1) return [...items];\n\n  const lambda = Math.max(0, Math.min(1, rawLambda));\n  if (lambda === 1) return [...items].sort((a, b) => b.score - a.score);\n\n  const tokenCache = new Map<string, Set<string>>();\n  for (const item of items) tokenCache.set(item.id, tokenize(item.content));\n\n  const scores = items.map((i) => i.score);\n  const maxScore = Math.max(...scores);\n  const minScore = Math.min(...scores);\n  const range = maxScore - minScore;\n  const normalize = (s: number): number =>\n    range === 0 ? 1 : (s - minScore) / range;\n\n  const selected: T[] = [];\n  const remaining = new Set(items);\n\n  while (remaining.size > 0) {\n    let best: T | null = null;\n    let bestMMR = -Infinity;\n    for (const cand of remaining) {\n      const rel = normalize(cand.score);\n      const candTokens = tokenCache.get(cand.id)!;\n      let maxSim = 0;\n      for (const sel of selected) {\n        const sim = jaccardSimilarity(candTokens, tokenCache.get(sel.id)!);\n        if (sim > maxSim) maxSim = sim;\n      }\n      const mmr = computeMMRScore(rel, maxSim, lambda);\n      if (\n        mmr > bestMMR ||\n        (mmr === bestMMR && cand.score > (best?.score ?? -Infinity))\n      ) {\n        bestMMR = mmr;\n        best = cand;\n      }\n    }\n    if (!best) break;\n    selected.push(best);\n    remaining.delete(best);\n  }\n\n  return selected;\n}\n\n/**\n * Adapter: apply MMR to an array of MemoryEntry-shaped hits.\n *\n * Uses (path|id|index) as the stable ID so two hits from the same file at\n * different content still get distinct MMR identities.\n */\nexport function applyMMRToMemoryHits<\n  T extends { id: string; path: string; content: string; score: number },\n>(results: T[], config: Partial<MMRConfig> = {}): T[] {\n  if (results.length <= 1) return results;\n  const byId = new Map<string, T>();\n  const items: MMRItem[] = results.map((r, i) => {\n    const id = `${r.path}#${r.id}#${i}`;\n    byId.set(id, r);\n    return { id, score: r.score, content: r.content };\n  });\n  return mmrRerank(items, config).map((m) => byId.get(m.id)!);\n}\n"],"names":[],"mappings":";;AAAA;;;;;;;;;;AAUG;AASI,MAAM,kBAAkB,GAAc;AAC3C,IAAA,OAAO,EAAE,KAAK;AACd,IAAA,MAAM,EAAE,GAAG;;AAGb;;;AAGG;AACH,MAAM,MAAM,GACV,kFAAkF;AAEpF;;;;;;AAMG;AACG,SAAU,QAAQ,CAAC,IAAY,EAAA;IACnC,MAAM,KAAK,GAAG,CAAC,IAAI,IAAI,EAAE,EAAE,WAAW,EAAE;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE;IAE9C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;IAC/B,MAAM,OAAO,GAA2C,EAAE;AAC1D,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IACvE;IAEA,MAAM,OAAO,GAAa,EAAE;AAC5B,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC3C,QAAA,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE;AACjD,YAAA,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QACrD;IACF;IAEA,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACvE;AAEM,SAAU,iBAAiB,CAAC,CAAc,EAAE,CAAc,EAAA;IAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;AAAE,QAAA,OAAO,CAAC;IAC1C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;AAAE,QAAA,OAAO,CAAC;AAE1C,IAAA,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5D,IAAI,YAAY,GAAG,CAAC;IACpB,KAAK,MAAM,CAAC,IAAI,OAAO;AAAE,QAAA,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAAE,YAAA,YAAY,EAAE;IAC1D,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY;AAC5C,IAAA,OAAO,KAAK,KAAK,CAAC,GAAG,CAAC,GAAG,YAAY,GAAG,KAAK;AAC/C;AAEM,SAAU,cAAc,CAAC,CAAS,EAAE,CAAS,EAAA;AACjD,IAAA,OAAO,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;AACpD;SAEgB,eAAe,CAC7B,SAAiB,EACjB,aAAqB,EACrB,MAAc,EAAA;IAEd,OAAO,MAAM,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,MAAM,IAAI,aAAa;AAC1D;AAQA;;AAEG;SACa,SAAS,CACvB,KAAU,EACV,SAA6B,EAAE,EAAA;IAE/B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,kBAAkB,CAAC,OAAO;IAC5D,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,IAAI,kBAAkB,CAAC,MAAM;AAE5D,IAAA,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;AAAE,QAAA,OAAO,CAAC,GAAG,KAAK,CAAC;AAEpD,IAAA,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAClD,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;AAErE,IAAA,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK;AAAE,QAAA,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAEzE,IAAA,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;AACpC,IAAA,MAAM,KAAK,GAAG,QAAQ,GAAG,QAAQ;IACjC,MAAM,SAAS,GAAG,CAAC,CAAS,KAC1B,KAAK,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,IAAI,KAAK;IAE1C,MAAM,QAAQ,GAAQ,EAAE;AACxB,IAAA,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC;AAEhC,IAAA,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE;QACzB,IAAI,IAAI,GAAa,IAAI;AACzB,QAAA,IAAI,OAAO,GAAG,CAAC,QAAQ;AACvB,QAAA,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;YAC5B,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;YACjC,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE;YAC3C,IAAI,MAAM,GAAG,CAAC;AACd,YAAA,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;AAC1B,gBAAA,MAAM,GAAG,GAAG,iBAAiB,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBAClE,IAAI,GAAG,GAAG,MAAM;oBAAE,MAAM,GAAG,GAAG;YAChC;YACA,MAAM,GAAG,GAAG,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC;YAChD,IACE,GAAG,GAAG,OAAO;AACb,iBAAC,GAAG,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,EAC5D;gBACA,OAAO,GAAG,GAAG;gBACb,IAAI,GAAG,IAAI;YACb;QACF;AACA,QAAA,IAAI,CAAC,IAAI;YAAE;AACX,QAAA,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AACnB,QAAA,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;IACxB;AAEA,IAAA,OAAO,QAAQ;AACjB;AAEA;;;;;AAKG;SACa,oBAAoB,CAElC,OAAY,EAAE,SAA6B,EAAE,EAAA;AAC7C,IAAA,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;AAAE,QAAA,OAAO,OAAO;AACvC,IAAA,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa;IACjC,MAAM,KAAK,GAAc,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;AAC5C,QAAA,MAAM,EAAE,GAAG,CAAA,EAAG,CAAC,CAAC,IAAI,CAAA,CAAA,EAAI,CAAC,CAAC,EAAE,CAAA,CAAA,EAAI,CAAC,EAAE;AACnC,QAAA,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;AACf,QAAA,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE;AACnD,IAAA,CAAC,CAAC;IACF,OAAO,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;AAC7D;;;;;;;;;;"}

package/dist/cjs/memory/paths.cjs

@@ -12,7 +12,7 @@ var constants = require('./constants.cjs');
  *
  * ## Why a whitelist?
  *
- * Earlier historical designs used date-keyed files
+ * Earlier upstream-faithful designs used date-keyed files
  * (`memory/YYYY-MM-DD.md`), which have three problems for a persistent
  * multi-user agent:
  *

package/dist/cjs/memory/paths.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"paths.cjs","sources":["../../../src/memory/paths.ts"],"sourcesContent":["/**\n * Autonomous memory — canonical path whitelist + tier utilities.\n *\n * Single source of truth for the 8 stable memory documents. Every write\n * goes through {@link assertWritablePath}; every reader can ask\n * {@link getTierForPath} what a row belongs to. Adding or removing a\n * path means editing this file — and exactly this file.\n *\n * ## Why a whitelist?\n *\n * Earlier historical designs used date-keyed files\n * (`memory/YYYY-MM-DD.md`), which have three problems for a persistent\n * multi-user agent:\n *\n * 1. **Unbounded growth** — one row per day per agent per user, forever.\n * 2. **LLM routing ambiguity** — \"which date file do I read?\" has no\n *    good answer, so the model reads (and ranks against) all of them.\n * 3. **No natural deduplication** — the same fact written across three\n *    days returns three near-identical hits.\n *\n * With 8 stable canonical documents the LLM knows *exactly* where to\n * write (\"is this a preference? → `memory/user/preferences.md`\") and\n * each row accumulates via UPSERT instead of piling up new rows.\n *\n * ## Two tiers\n *\n * - **Agent tier** (`memory/agent/*`) — operational knowledge that\n *   every caller of the agent benefits from. Stored with `user_id = NULL`.\n *   Shared across all users of a collaborative agent; the only tier that\n *   exists for isolated/autonomous agents with no invoker.\n *\n * - **User tier** (`memory/user/*`) — per-invoker personalization.\n *   Stored with `user_id = <caller>`. Read path filters so User A never\n *   sees User B's rows, even for the same agent. Not writable unless the\n *   flush scope carries a non-empty `userId`.\n *\n * The tier of a path is a function of its prefix (`memory/agent/` vs\n * `memory/user/`), so adding a new document is one line here + the\n * constant array entry; no store or route code has to change.\n */\n\nimport { MEMORY_PATH_PREFIX } from './constants';\nimport type { MemoryScope } from './types';\n\n/** Tier discriminator — the two kinds of memory a row can belong to. */\nexport type MemoryTier = 'agent' | 'user';\n\n/** Every canonical document the flush phase is allowed to write. */\nexport interface MemoryPathDescriptor {\n  /** Full path including the `memory/` prefix. */\n  path: string;\n  /** Which tier the path lives under. */\n  tier: MemoryTier;\n  /** Short label shown in UI tier badges and the flush prompt rubric. */\n  label: string;\n  /** One-line description — fed to the LLM to make routing unambiguous. */\n  description: string;\n}\n\n/** Agent-tier documents — shared across all users of the agent. */\nexport const MEMORY_AGENT_PATHS: readonly MemoryPathDescriptor[] =\n  Object.freeze([\n    Object.freeze({\n      path: 'memory/agent/playbook.md',\n      tier: 'agent' as const,\n      label: 'Playbook',\n      description:\n        'Successful task patterns and workflows that have worked for this agent — ' +\n        'reusable recipes, known-good tool sequences, approaches that consistently ' +\n        'produce the right result.',\n    }),\n    Object.freeze({\n      path: 'memory/agent/pitfalls.md',\n      tier: 'agent' as const,\n      label: 'Pitfalls',\n      description:\n        'Tool failures, error recoveries, schema mistakes, and invalid argument ' +\n        'shapes the agent has seen — so the same mistake is not repeated on future ' +\n        'turns. One note per distinct failure mode.',\n    }),\n    Object.freeze({\n      path: 'memory/agent/domain.md',\n      tier: 'agent' as const,\n      label: 'Domain',\n      description:\n        'Durable facts about the systems, APIs, data models, and business rules ' +\n        'this agent operates on — things that are true independent of any one user ' +\n        'and that the agent repeatedly needs to know.',\n    }),\n    Object.freeze({\n      path: 'memory/agent/style.md',\n      tier: 'agent' as const,\n      label: 'Style',\n      description:\n        'Tone, formatting, and response-shape conventions the agent has converged ' +\n        'on across the whole user base. Do NOT write user-specific preferences here ' +\n        '(those belong under the user tier).',\n    }),\n  ]);\n\n/** User-tier documents — per-invoker, never shared across users. */\nexport const MEMORY_USER_PATHS: readonly MemoryPathDescriptor[] = Object.freeze(\n  [\n    Object.freeze({\n      path: 'memory/user/profile.md',\n      tier: 'user' as const,\n      label: 'Profile',\n      description:\n        \"This specific user's identity — name, role, team, sign-off name, \" +\n        'responsibilities, stable facts about who they are. Only facts ' +\n        'volunteered by the user themselves.',\n    }),\n    Object.freeze({\n      path: 'memory/user/preferences.md',\n      tier: 'user' as const,\n      label: 'Preferences',\n      description:\n        'How THIS user wants things done — preferred formats, verbosity, tone, ' +\n        'cadence, output length, language conventions. Explicit corrections they ' +\n        'have given count as preferences.',\n    }),\n    Object.freeze({\n      path: 'memory/user/projects.md',\n      tier: 'user' as const,\n      label: 'Projects',\n      description:\n        \"This user's current initiatives, ongoing work, deadlines, and active \" +\n        'project context. Include dates in the prose when relevant. Retire entries ' +\n        'by overwriting them on future flushes when the user indicates a project is done.',\n    }),\n    Object.freeze({\n      path: 'memory/user/references.md',\n      tier: 'user' as const,\n      label: 'References',\n      description:\n        'External systems, dashboards, accounts, links, channels, and resources ' +\n        \"THIS user has pointed the agent at — the 'where to look' pointers that \" +\n        'make later turns more efficient.',\n    }),\n  ]\n);\n\n/** All 8 canonical documents in display order: agent tier first, user tier second. */\nexport const MEMORY_ALL_PATHS: readonly MemoryPathDescriptor[] = Object.freeze([\n  ...MEMORY_AGENT_PATHS,\n  ...MEMORY_USER_PATHS,\n]);\n\n/** Fast O(1) lookup map: path → descriptor. */\nconst PATH_INDEX: ReadonlyMap<string, MemoryPathDescriptor> = new Map(\n  MEMORY_ALL_PATHS.map((p) => [p.path, p])\n);\n\n/** Set of all whitelisted paths — for `has()` lookups. */\nexport const MEMORY_WRITABLE_PATHS: ReadonlySet<string> = new Set(\n  MEMORY_ALL_PATHS.map((p) => p.path)\n);\n\n/** Returns the descriptor for a canonical path, or `undefined` if not on the whitelist. */\nexport function getPathDescriptor(\n  path: string\n): MemoryPathDescriptor | undefined {\n  return PATH_INDEX.get(path);\n}\n\n/**\n * Returns the tier a given path belongs to.\n *\n * For unknown paths (e.g. legacy date-keyed rows that predate this schema),\n * falls back to inspecting the `memory/agent/` or `memory/user/` prefix.\n * Anything that matches neither is classified as `agent` — it will surface\n * in the admin UI under the agent-tier header and stay read-only there.\n */\nexport function getTierForPath(path: string): MemoryTier {\n  const descriptor = PATH_INDEX.get(path);\n  if (descriptor) return descriptor.tier;\n  if (path.startsWith('memory/user/')) return 'user';\n  return 'agent';\n}\n\n/**\n * Paths that are legal to write **for this caller's scope**.\n *\n * If `scope.userId` is absent (isolated/autonomous agent), the user-tier\n * paths are dropped. This is the list the flush prompt renders into its\n * rubric — the LLM never sees paths it cannot write to.\n */\nexport function getWritablePathsForScope(\n  scope: Pick<MemoryScope, 'userId'>\n): readonly MemoryPathDescriptor[] {\n  if (scope.userId == null || scope.userId === '') {\n    return MEMORY_AGENT_PATHS;\n  }\n  return MEMORY_ALL_PATHS;\n}\n\n/**\n * Validates a write path against the whitelist AND the caller's scope.\n *\n * Throws with an actionable message when:\n * - the path is missing the `memory/` prefix\n * - the path is not on the 8-doc whitelist\n * - the path is user-tier but `scope.userId` is missing\n *\n * The store's append() is the single call site; other callers should\n * never hit this directly. Kept as a standalone function for testability.\n */\nexport function assertWritablePath(\n  path: string,\n  scope: Pick<MemoryScope, 'userId'>\n): MemoryPathDescriptor {\n  if (!path || !path.startsWith(MEMORY_PATH_PREFIX)) {\n    throw new Error(\n      `memory_append path must start with \"${MEMORY_PATH_PREFIX}\" (received \"${path}\")`\n    );\n  }\n  const descriptor = PATH_INDEX.get(path);\n  if (!descriptor) {\n    throw new Error(\n      `memory_append path \"${path}\" is not on the canonical whitelist. ` +\n        `Allowed: ${MEMORY_ALL_PATHS.map((p) => p.path).join(', ')}`\n    );\n  }\n  if (\n    descriptor.tier === 'user' &&\n    (scope.userId == null || scope.userId === '')\n  ) {\n    throw new Error(\n      `memory_append to user-tier path \"${path}\" requires a caller userId in scope, ` +\n        `but scope.userId is missing. This path is private to a specific user and ` +\n        `cannot be written from an isolated/autonomous context.`\n    );\n  }\n  return descriptor;\n}\n\n/**\n * Renders the whitelist as a compact bullet list, used inside the flush\n * prompt so the LLM sees the authoritative rubric at inference time.\n *\n * Output shape:\n *   - memory/agent/playbook.md [Playbook, shared] — <description>\n *   - memory/agent/pitfalls.md [Pitfalls, shared] — <description>\n *   ...\n *\n * The `[Label, shared|private]` tag tells the model whether the doc is\n * visible to all users (agent tier) or only to the caller (user tier).\n * Filtered to only the paths writable for the given scope.\n */\nexport function renderPathsRubric(scope: Pick<MemoryScope, 'userId'>): string {\n  const writable = getWritablePathsForScope(scope);\n  return writable\n    .map((p) => {\n      const visibility = p.tier === 'agent' ? 'shared' : 'private';\n      return `- ${p.path} [${p.label}, ${visibility}] — ${p.description}`;\n    })\n    .join('\\n');\n}\n"],"names":["MEMORY_PATH_PREFIX"],"mappings":";;;;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCG;AAoBH;AACO,MAAM,kBAAkB,GAC7B,MAAM,CAAC,MAAM,CAAC;IACZ,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,0BAA0B;AAChC,QAAA,IAAI,EAAE,OAAgB;AACtB,QAAA,KAAK,EAAE,UAAU;AACjB,QAAA,WAAW,EACT,2EAA2E;YAC3E,4EAA4E;YAC5E,2BAA2B;KAC9B,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,0BAA0B;AAChC,QAAA,IAAI,EAAE,OAAgB;AACtB,QAAA,KAAK,EAAE,UAAU;AACjB,QAAA,WAAW,EACT,yEAAyE;YACzE,4EAA4E;YAC5E,4CAA4C;KAC/C,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,wBAAwB;AAC9B,QAAA,IAAI,EAAE,OAAgB;AACtB,QAAA,KAAK,EAAE,QAAQ;AACf,QAAA,WAAW,EACT,yEAAyE;YACzE,4EAA4E;YAC5E,8CAA8C;KACjD,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,uBAAuB;AAC7B,QAAA,IAAI,EAAE,OAAgB;AACtB,QAAA,KAAK,EAAE,OAAO;AACd,QAAA,WAAW,EACT,2EAA2E;YAC3E,6EAA6E;YAC7E,qCAAqC;KACxC,CAAC;AACH,CAAA;AAEH;AACO,MAAM,iBAAiB,GAAoC,MAAM,CAAC,MAAM,CAC7E;IACE,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,wBAAwB;AAC9B,QAAA,IAAI,EAAE,MAAe;AACrB,QAAA,KAAK,EAAE,SAAS;AAChB,QAAA,WAAW,EACT,mEAAmE;YACnE,gEAAgE;YAChE,qCAAqC;KACxC,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,4BAA4B;AAClC,QAAA,IAAI,EAAE,MAAe;AACrB,QAAA,KAAK,EAAE,aAAa;AACpB,QAAA,WAAW,EACT,wEAAwE;YACxE,0EAA0E;YAC1E,kCAAkC;KACrC,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,yBAAyB;AAC/B,QAAA,IAAI,EAAE,MAAe;AACrB,QAAA,KAAK,EAAE,UAAU;AACjB,QAAA,WAAW,EACT,uEAAuE;YACvE,4EAA4E;YAC5E,kFAAkF;KACrF,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,2BAA2B;AACjC,QAAA,IAAI,EAAE,MAAe;AACrB,QAAA,KAAK,EAAE,YAAY;AACnB,QAAA,WAAW,EACT,yEAAyE;YACzE,yEAAyE;YACzE,kCAAkC;KACrC,CAAC;AACH,CAAA;AAGH;AACO,MAAM,gBAAgB,GAAoC,MAAM,CAAC,MAAM,CAAC;AAC7E,IAAA,GAAG,kBAAkB;AACrB,IAAA,GAAG,iBAAiB;AACrB,CAAA;AAED;AACA,MAAM,UAAU,GAA8C,IAAI,GAAG,CACnE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CACzC;AAED;MACa,qBAAqB,GAAwB,IAAI,GAAG,CAC/D,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;AAGrC;AACM,SAAU,iBAAiB,CAC/B,IAAY,EAAA;AAEZ,IAAA,OAAO,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;AAC7B;AAEA;;;;;;;AAOG;AACG,SAAU,cAAc,CAAC,IAAY,EAAA;IACzC,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;AACvC,IAAA,IAAI,UAAU;QAAE,OAAO,UAAU,CAAC,IAAI;AACtC,IAAA,IAAI,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC;AAAE,QAAA,OAAO,MAAM;AAClD,IAAA,OAAO,OAAO;AAChB;AAEA;;;;;;AAMG;AACG,SAAU,wBAAwB,CACtC,KAAkC,EAAA;AAElC,IAAA,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE,EAAE;AAC/C,QAAA,OAAO,kBAAkB;IAC3B;AACA,IAAA,OAAO,gBAAgB;AACzB;AAEA;;;;;;;;;;AAUG;AACG,SAAU,kBAAkB,CAChC,IAAY,EACZ,KAAkC,EAAA;IAElC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAACA,4BAAkB,CAAC,EAAE;QACjD,MAAM,IAAI,KAAK,CACb,CAAA,oCAAA,EAAuCA,4BAAkB,CAAA,aAAA,EAAgB,IAAI,CAAA,EAAA,CAAI,CAClF;IACH;IACA,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;IACvC,IAAI,CAAC,UAAU,EAAE;AACf,QAAA,MAAM,IAAI,KAAK,CACb,CAAA,oBAAA,EAAuB,IAAI,CAAA,qCAAA,CAAuC;YAChE,CAAA,SAAA,EAAY,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA,CAAE,CAC/D;IACH;AACA,IAAA,IACE,UAAU,CAAC,IAAI,KAAK,MAAM;AAC1B,SAAC,KAAK,CAAC,MAAM,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,EAC7C;AACA,QAAA,MAAM,IAAI,KAAK,CACb,CAAA,iCAAA,EAAoC,IAAI,CAAA,qCAAA,CAAuC;YAC7E,CAAA,yEAAA,CAA2E;AAC3E,YAAA,CAAA,sDAAA,CAAwD,CAC3D;IACH;AACA,IAAA,OAAO,UAAU;AACnB;AAEA;;;;;;;;;;;;AAYG;AACG,SAAU,iBAAiB,CAAC,KAAkC,EAAA;AAClE,IAAA,MAAM,QAAQ,GAAG,wBAAwB,CAAC,KAAK,CAAC;AAChD,IAAA,OAAO;AACJ,SAAA,GAAG,CAAC,CAAC,CAAC,KAAI;AACT,QAAA,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,KAAK,OAAO,GAAG,QAAQ,GAAG,SAAS;AAC5D,QAAA,OAAO,CAAA,EAAA,EAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAA,EAAA,EAAK,UAAU,CAAA,IAAA,EAAO,CAAC,CAAC,WAAW,EAAE;AACrE,IAAA,CAAC;SACA,IAAI,CAAC,IAAI,CAAC;AACf;;;;;;;;;;;;"}
+{"version":3,"file":"paths.cjs","sources":["../../../src/memory/paths.ts"],"sourcesContent":["/**\n * Autonomous memory — canonical path whitelist + tier utilities.\n *\n * Single source of truth for the 8 stable memory documents. Every write\n * goes through {@link assertWritablePath}; every reader can ask\n * {@link getTierForPath} what a row belongs to. Adding or removing a\n * path means editing this file — and exactly this file.\n *\n * ## Why a whitelist?\n *\n * Earlier upstream-faithful designs used date-keyed files\n * (`memory/YYYY-MM-DD.md`), which have three problems for a persistent\n * multi-user agent:\n *\n * 1. **Unbounded growth** — one row per day per agent per user, forever.\n * 2. **LLM routing ambiguity** — \"which date file do I read?\" has no\n *    good answer, so the model reads (and ranks against) all of them.\n * 3. **No natural deduplication** — the same fact written across three\n *    days returns three near-identical hits.\n *\n * With 8 stable canonical documents the LLM knows *exactly* where to\n * write (\"is this a preference? → `memory/user/preferences.md`\") and\n * each row accumulates via UPSERT instead of piling up new rows.\n *\n * ## Two tiers\n *\n * - **Agent tier** (`memory/agent/*`) — operational knowledge that\n *   every caller of the agent benefits from. Stored with `user_id = NULL`.\n *   Shared across all users of a collaborative agent; the only tier that\n *   exists for isolated/autonomous agents with no invoker.\n *\n * - **User tier** (`memory/user/*`) — per-invoker personalization.\n *   Stored with `user_id = <caller>`. Read path filters so User A never\n *   sees User B's rows, even for the same agent. Not writable unless the\n *   flush scope carries a non-empty `userId`.\n *\n * The tier of a path is a function of its prefix (`memory/agent/` vs\n * `memory/user/`), so adding a new document is one line here + the\n * constant array entry; no store or route code has to change.\n */\n\nimport { MEMORY_PATH_PREFIX } from './constants';\nimport type { MemoryScope } from './types';\n\n/** Tier discriminator — the two kinds of memory a row can belong to. */\nexport type MemoryTier = 'agent' | 'user';\n\n/** Every canonical document the flush phase is allowed to write. */\nexport interface MemoryPathDescriptor {\n  /** Full path including the `memory/` prefix. */\n  path: string;\n  /** Which tier the path lives under. */\n  tier: MemoryTier;\n  /** Short label shown in UI tier badges and the flush prompt rubric. */\n  label: string;\n  /** One-line description — fed to the LLM to make routing unambiguous. */\n  description: string;\n}\n\n/** Agent-tier documents — shared across all users of the agent. */\nexport const MEMORY_AGENT_PATHS: readonly MemoryPathDescriptor[] =\n  Object.freeze([\n    Object.freeze({\n      path: 'memory/agent/playbook.md',\n      tier: 'agent' as const,\n      label: 'Playbook',\n      description:\n        'Successful task patterns and workflows that have worked for this agent — ' +\n        'reusable recipes, known-good tool sequences, approaches that consistently ' +\n        'produce the right result.',\n    }),\n    Object.freeze({\n      path: 'memory/agent/pitfalls.md',\n      tier: 'agent' as const,\n      label: 'Pitfalls',\n      description:\n        'Tool failures, error recoveries, schema mistakes, and invalid argument ' +\n        'shapes the agent has seen — so the same mistake is not repeated on future ' +\n        'turns. One note per distinct failure mode.',\n    }),\n    Object.freeze({\n      path: 'memory/agent/domain.md',\n      tier: 'agent' as const,\n      label: 'Domain',\n      description:\n        'Durable facts about the systems, APIs, data models, and business rules ' +\n        'this agent operates on — things that are true independent of any one user ' +\n        'and that the agent repeatedly needs to know.',\n    }),\n    Object.freeze({\n      path: 'memory/agent/style.md',\n      tier: 'agent' as const,\n      label: 'Style',\n      description:\n        'Tone, formatting, and response-shape conventions the agent has converged ' +\n        'on across the whole user base. Do NOT write user-specific preferences here ' +\n        '(those belong under the user tier).',\n    }),\n  ]);\n\n/** User-tier documents — per-invoker, never shared across users. */\nexport const MEMORY_USER_PATHS: readonly MemoryPathDescriptor[] = Object.freeze(\n  [\n    Object.freeze({\n      path: 'memory/user/profile.md',\n      tier: 'user' as const,\n      label: 'Profile',\n      description:\n        \"This specific user's identity — name, role, team, sign-off name, \" +\n        'responsibilities, stable facts about who they are. Only facts ' +\n        'volunteered by the user themselves.',\n    }),\n    Object.freeze({\n      path: 'memory/user/preferences.md',\n      tier: 'user' as const,\n      label: 'Preferences',\n      description:\n        'How THIS user wants things done — preferred formats, verbosity, tone, ' +\n        'cadence, output length, language conventions. Explicit corrections they ' +\n        'have given count as preferences.',\n    }),\n    Object.freeze({\n      path: 'memory/user/projects.md',\n      tier: 'user' as const,\n      label: 'Projects',\n      description:\n        \"This user's current initiatives, ongoing work, deadlines, and active \" +\n        'project context. Include dates in the prose when relevant. Retire entries ' +\n        'by overwriting them on future flushes when the user indicates a project is done.',\n    }),\n    Object.freeze({\n      path: 'memory/user/references.md',\n      tier: 'user' as const,\n      label: 'References',\n      description:\n        'External systems, dashboards, accounts, links, channels, and resources ' +\n        \"THIS user has pointed the agent at — the 'where to look' pointers that \" +\n        'make later turns more efficient.',\n    }),\n  ]\n);\n\n/** All 8 canonical documents in display order: agent tier first, user tier second. */\nexport const MEMORY_ALL_PATHS: readonly MemoryPathDescriptor[] = Object.freeze([\n  ...MEMORY_AGENT_PATHS,\n  ...MEMORY_USER_PATHS,\n]);\n\n/** Fast O(1) lookup map: path → descriptor. */\nconst PATH_INDEX: ReadonlyMap<string, MemoryPathDescriptor> = new Map(\n  MEMORY_ALL_PATHS.map((p) => [p.path, p])\n);\n\n/** Set of all whitelisted paths — for `has()` lookups. */\nexport const MEMORY_WRITABLE_PATHS: ReadonlySet<string> = new Set(\n  MEMORY_ALL_PATHS.map((p) => p.path)\n);\n\n/** Returns the descriptor for a canonical path, or `undefined` if not on the whitelist. */\nexport function getPathDescriptor(\n  path: string\n): MemoryPathDescriptor | undefined {\n  return PATH_INDEX.get(path);\n}\n\n/**\n * Returns the tier a given path belongs to.\n *\n * For unknown paths (e.g. legacy date-keyed rows that predate this schema),\n * falls back to inspecting the `memory/agent/` or `memory/user/` prefix.\n * Anything that matches neither is classified as `agent` — it will surface\n * in the admin UI under the agent-tier header and stay read-only there.\n */\nexport function getTierForPath(path: string): MemoryTier {\n  const descriptor = PATH_INDEX.get(path);\n  if (descriptor) return descriptor.tier;\n  if (path.startsWith('memory/user/')) return 'user';\n  return 'agent';\n}\n\n/**\n * Paths that are legal to write **for this caller's scope**.\n *\n * If `scope.userId` is absent (isolated/autonomous agent), the user-tier\n * paths are dropped. This is the list the flush prompt renders into its\n * rubric — the LLM never sees paths it cannot write to.\n */\nexport function getWritablePathsForScope(\n  scope: Pick<MemoryScope, 'userId'>\n): readonly MemoryPathDescriptor[] {\n  if (scope.userId == null || scope.userId === '') {\n    return MEMORY_AGENT_PATHS;\n  }\n  return MEMORY_ALL_PATHS;\n}\n\n/**\n * Validates a write path against the whitelist AND the caller's scope.\n *\n * Throws with an actionable message when:\n * - the path is missing the `memory/` prefix\n * - the path is not on the 8-doc whitelist\n * - the path is user-tier but `scope.userId` is missing\n *\n * The store's append() is the single call site; other callers should\n * never hit this directly. Kept as a standalone function for testability.\n */\nexport function assertWritablePath(\n  path: string,\n  scope: Pick<MemoryScope, 'userId'>\n): MemoryPathDescriptor {\n  if (!path || !path.startsWith(MEMORY_PATH_PREFIX)) {\n    throw new Error(\n      `memory_append path must start with \"${MEMORY_PATH_PREFIX}\" (received \"${path}\")`\n    );\n  }\n  const descriptor = PATH_INDEX.get(path);\n  if (!descriptor) {\n    throw new Error(\n      `memory_append path \"${path}\" is not on the canonical whitelist. ` +\n        `Allowed: ${MEMORY_ALL_PATHS.map((p) => p.path).join(', ')}`\n    );\n  }\n  if (\n    descriptor.tier === 'user' &&\n    (scope.userId == null || scope.userId === '')\n  ) {\n    throw new Error(\n      `memory_append to user-tier path \"${path}\" requires a caller userId in scope, ` +\n        `but scope.userId is missing. This path is private to a specific user and ` +\n        `cannot be written from an isolated/autonomous context.`\n    );\n  }\n  return descriptor;\n}\n\n/**\n * Renders the whitelist as a compact bullet list, used inside the flush\n * prompt so the LLM sees the authoritative rubric at inference time.\n *\n * Output shape:\n *   - memory/agent/playbook.md [Playbook, shared] — <description>\n *   - memory/agent/pitfalls.md [Pitfalls, shared] — <description>\n *   ...\n *\n * The `[Label, shared|private]` tag tells the model whether the doc is\n * visible to all users (agent tier) or only to the caller (user tier).\n * Filtered to only the paths writable for the given scope.\n */\nexport function renderPathsRubric(scope: Pick<MemoryScope, 'userId'>): string {\n  const writable = getWritablePathsForScope(scope);\n  return writable\n    .map((p) => {\n      const visibility = p.tier === 'agent' ? 'shared' : 'private';\n      return `- ${p.path} [${p.label}, ${visibility}] — ${p.description}`;\n    })\n    .join('\\n');\n}\n"],"names":["MEMORY_PATH_PREFIX"],"mappings":";;;;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCG;AAoBH;AACO,MAAM,kBAAkB,GAC7B,MAAM,CAAC,MAAM,CAAC;IACZ,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,0BAA0B;AAChC,QAAA,IAAI,EAAE,OAAgB;AACtB,QAAA,KAAK,EAAE,UAAU;AACjB,QAAA,WAAW,EACT,2EAA2E;YAC3E,4EAA4E;YAC5E,2BAA2B;KAC9B,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,0BAA0B;AAChC,QAAA,IAAI,EAAE,OAAgB;AACtB,QAAA,KAAK,EAAE,UAAU;AACjB,QAAA,WAAW,EACT,yEAAyE;YACzE,4EAA4E;YAC5E,4CAA4C;KAC/C,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,wBAAwB;AAC9B,QAAA,IAAI,EAAE,OAAgB;AACtB,QAAA,KAAK,EAAE,QAAQ;AACf,QAAA,WAAW,EACT,yEAAyE;YACzE,4EAA4E;YAC5E,8CAA8C;KACjD,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,uBAAuB;AAC7B,QAAA,IAAI,EAAE,OAAgB;AACtB,QAAA,KAAK,EAAE,OAAO;AACd,QAAA,WAAW,EACT,2EAA2E;YAC3E,6EAA6E;YAC7E,qCAAqC;KACxC,CAAC;AACH,CAAA;AAEH;AACO,MAAM,iBAAiB,GAAoC,MAAM,CAAC,MAAM,CAC7E;IACE,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,wBAAwB;AAC9B,QAAA,IAAI,EAAE,MAAe;AACrB,QAAA,KAAK,EAAE,SAAS;AAChB,QAAA,WAAW,EACT,mEAAmE;YACnE,gEAAgE;YAChE,qCAAqC;KACxC,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,4BAA4B;AAClC,QAAA,IAAI,EAAE,MAAe;AACrB,QAAA,KAAK,EAAE,aAAa;AACpB,QAAA,WAAW,EACT,wEAAwE;YACxE,0EAA0E;YAC1E,kCAAkC;KACrC,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,yBAAyB;AAC/B,QAAA,IAAI,EAAE,MAAe;AACrB,QAAA,KAAK,EAAE,UAAU;AACjB,QAAA,WAAW,EACT,uEAAuE;YACvE,4EAA4E;YAC5E,kFAAkF;KACrF,CAAC;IACF,MAAM,CAAC,MAAM,CAAC;AACZ,QAAA,IAAI,EAAE,2BAA2B;AACjC,QAAA,IAAI,EAAE,MAAe;AACrB,QAAA,KAAK,EAAE,YAAY;AACnB,QAAA,WAAW,EACT,yEAAyE;YACzE,yEAAyE;YACzE,kCAAkC;KACrC,CAAC;AACH,CAAA;AAGH;AACO,MAAM,gBAAgB,GAAoC,MAAM,CAAC,MAAM,CAAC;AAC7E,IAAA,GAAG,kBAAkB;AACrB,IAAA,GAAG,iBAAiB;AACrB,CAAA;AAED;AACA,MAAM,UAAU,GAA8C,IAAI,GAAG,CACnE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CACzC;AAED;MACa,qBAAqB,GAAwB,IAAI,GAAG,CAC/D,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;AAGrC;AACM,SAAU,iBAAiB,CAC/B,IAAY,EAAA;AAEZ,IAAA,OAAO,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;AAC7B;AAEA;;;;;;;AAOG;AACG,SAAU,cAAc,CAAC,IAAY,EAAA;IACzC,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;AACvC,IAAA,IAAI,UAAU;QAAE,OAAO,UAAU,CAAC,IAAI;AACtC,IAAA,IAAI,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC;AAAE,QAAA,OAAO,MAAM;AAClD,IAAA,OAAO,OAAO;AAChB;AAEA;;;;;;AAMG;AACG,SAAU,wBAAwB,CACtC,KAAkC,EAAA;AAElC,IAAA,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE,EAAE;AAC/C,QAAA,OAAO,kBAAkB;IAC3B;AACA,IAAA,OAAO,gBAAgB;AACzB;AAEA;;;;;;;;;;AAUG;AACG,SAAU,kBAAkB,CAChC,IAAY,EACZ,KAAkC,EAAA;IAElC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAACA,4BAAkB,CAAC,EAAE;QACjD,MAAM,IAAI,KAAK,CACb,CAAA,oCAAA,EAAuCA,4BAAkB,CAAA,aAAA,EAAgB,IAAI,CAAA,EAAA,CAAI,CAClF;IACH;IACA,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;IACvC,IAAI,CAAC,UAAU,EAAE;AACf,QAAA,MAAM,IAAI,KAAK,CACb,CAAA,oBAAA,EAAuB,IAAI,CAAA,qCAAA,CAAuC;YAChE,CAAA,SAAA,EAAY,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA,CAAE,CAC/D;IACH;AACA,IAAA,IACE,UAAU,CAAC,IAAI,KAAK,MAAM;AAC1B,SAAC,KAAK,CAAC,MAAM,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,EAC7C;AACA,QAAA,MAAM,IAAI,KAAK,CACb,CAAA,iCAAA,EAAoC,IAAI,CAAA,qCAAA,CAAuC;YAC7E,CAAA,yEAAA,CAA2E;AAC3E,YAAA,CAAA,sDAAA,CAAwD,CAC3D;IACH;AACA,IAAA,OAAO,UAAU;AACnB;AAEA;;;;;;;;;;;;AAYG;AACG,SAAU,iBAAiB,CAAC,KAAkC,EAAA;AAClE,IAAA,MAAM,QAAQ,GAAG,wBAAwB,CAAC,KAAK,CAAC;AAChD,IAAA,OAAO;AACJ,SAAA,GAAG,CAAC,CAAC,CAAC,KAAI;AACT,QAAA,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,KAAK,OAAO,GAAG,QAAQ,GAAG,SAAS;AAC5D,QAAA,OAAO,CAAA,EAAA,EAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAA,EAAA,EAAK,UAAU,CAAA,IAAA,EAAO,CAAC,CAAC,WAAW,EAAE;AACrE,IAAA,CAAC;SACA,IAAI,CAAC,IAAI,CAAC;AACf;;;;;;;;;;;;"}

package/dist/cjs/memory/recallTracking.cjs

@@ -5,9 +5,9 @@ var crypto = require('crypto');
 /**
  * Recall tracking — Phase 2.
  *
- * Lightweight adaptation of an external recall-tracking module
+ * Lightweight adaptation of upstream
  * `extensions/memory-core/src/short-term-promotion.ts::recordShortTermRecalls`.
- * The reference implementation stores recalls in a JSON file under `memory/.dreams/`; we store
+ * Upstream stores recalls in a JSON file under `memory/.dreams/`; we store
  * them in a Postgres table `agent_memory_recalls`. Schema captures what the
  * future Phase 3 dreaming/promotion algorithm will need:
  *   - which memory row was surfaced (`memory_id`)
@@ -67,7 +67,7 @@ class PgvectorRecallTracker {
         const qhash = hashQuery(params.query);
         const bucket = dayBucket(nowMs);
         // [recall-tracking] debug: upsert one row per (agent, memory, query, day)
-        // The reference implementation dedupes per-day per-query so repeated searches don't inflate counts.
+        // Upstream dedupes per-day per-query so repeated searches don't inflate counts.
         const values = [];
         const args = [];
         let i = 1;

package/dist/cjs/memory/recallTracking.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"recallTracking.cjs","sources":["../../../src/memory/recallTracking.ts"],"sourcesContent":["/**\n * Recall tracking — Phase 2.\n *\n * Lightweight adaptation of an external recall-tracking module\n * `extensions/memory-core/src/short-term-promotion.ts::recordShortTermRecalls`.\n * The reference implementation stores recalls in a JSON file under `memory/.dreams/`; we store\n * them in a Postgres table `agent_memory_recalls`. Schema captures what the\n * future Phase 3 dreaming/promotion algorithm will need:\n *   - which memory row was surfaced (`memory_id`)\n *   - the query that surfaced it (raw + SHA-256 hash for dedupe)\n *   - hybrid score at the time of recall\n *   - the day bucket (for per-day dedupe / frequency counting)\n *   - the recorded timestamp\n *\n * Best-effort: failures never block memory_search. The caller fires\n * {@link RecallTracker.record} without awaiting the result and ignores errors.\n */\nimport { createHash } from 'crypto';\nimport type { Pool } from 'pg';\n\nexport interface RecallTracker {\n  /** Record that the given memory ids were surfaced to the model for a query. */\n  record(params: RecallRecordParams): Promise<void>;\n  /** Backend-specific schema migration. Idempotent. */\n  migrate(): Promise<void>;\n}\n\nexport interface RecallRecordParams {\n  agentId: string;\n  query: string;\n  hits: Array<{ id: string; path: string; score: number }>;\n  nowMs?: number;\n}\n\nexport const RECALL_TABLE = 'agent_memory_recalls';\n\nfunction hashQuery(query: string): string {\n  return createHash('sha256')\n    .update(query.trim().toLowerCase())\n    .digest('hex')\n    .slice(0, 32);\n}\n\nfunction dayBucket(nowMs: number): string {\n  const d = new Date(nowMs);\n  const y = d.getUTCFullYear();\n  const m = String(d.getUTCMonth() + 1).padStart(2, '0');\n  const day = String(d.getUTCDate()).padStart(2, '0');\n  return `${y}-${m}-${day}`;\n}\n\nexport class PgvectorRecallTracker implements RecallTracker {\n  constructor(\n    private readonly pool: Pool,\n    private readonly table: string = RECALL_TABLE\n  ) {}\n\n  async migrate(): Promise<void> {\n    // [recall-tracking] debug: create table + indexes if missing\n    await this.pool.query(`\n      CREATE TABLE IF NOT EXISTS ${this.table} (\n        id           BIGSERIAL   PRIMARY KEY,\n        agent_id     TEXT        NOT NULL,\n        memory_id    TEXT        NOT NULL,\n        memory_path  TEXT        NOT NULL,\n        query        TEXT        NOT NULL,\n        query_hash   TEXT        NOT NULL,\n        score        DOUBLE PRECISION NOT NULL,\n        day_bucket   TEXT        NOT NULL,\n        recorded_at  TIMESTAMPTZ NOT NULL DEFAULT NOW()\n      )\n    `);\n    await this.pool.query(\n      `CREATE INDEX IF NOT EXISTS ${this.table}_agent_day_idx ON ${this.table} (agent_id, day_bucket)`\n    );\n    await this.pool.query(\n      `CREATE INDEX IF NOT EXISTS ${this.table}_memory_idx ON ${this.table} (agent_id, memory_id)`\n    );\n    await this.pool.query(\n      `CREATE UNIQUE INDEX IF NOT EXISTS ${this.table}_dedupe_idx\n       ON ${this.table} (agent_id, memory_id, query_hash, day_bucket)`\n    );\n  }\n\n  async record(params: RecallRecordParams): Promise<void> {\n    if (!params.agentId || !params.query.trim() || params.hits.length === 0)\n      return;\n    const nowMs = params.nowMs ?? Date.now();\n    const qhash = hashQuery(params.query);\n    const bucket = dayBucket(nowMs);\n\n    // [recall-tracking] debug: upsert one row per (agent, memory, query, day)\n    // The reference implementation dedupes per-day per-query so repeated searches don't inflate counts.\n    const values: string[] = [];\n    const args: unknown[] = [];\n    let i = 1;\n    for (const hit of params.hits) {\n      values.push(\n        `($${i++}, $${i++}, $${i++}, $${i++}, $${i++}, $${i++}, $${i++}, NOW())`\n      );\n      args.push(\n        params.agentId,\n        hit.id,\n        hit.path,\n        params.query,\n        qhash,\n        hit.score,\n        bucket\n      );\n    }\n    const sql = `\n      INSERT INTO ${this.table}\n        (agent_id, memory_id, memory_path, query, query_hash, score, day_bucket, recorded_at)\n      VALUES ${values.join(', ')}\n      ON CONFLICT (agent_id, memory_id, query_hash, day_bucket) DO UPDATE\n      SET score       = GREATEST(${this.table}.score, EXCLUDED.score),\n          recorded_at = NOW()\n    `;\n    await this.pool.query(sql, args);\n  }\n}\n\n/** No-op tracker — used when recall tracking is disabled or the backend isn't pgvector. */\nexport class NullRecallTracker implements RecallTracker {\n  async record(): Promise<void> {}\n  async migrate(): Promise<void> {}\n}\n"],"names":["createHash"],"mappings":";;;;AAAA;;;;;;;;;;;;;;;;AAgBG;AAkBI,MAAM,YAAY,GAAG;AAE5B,SAAS,SAAS,CAAC,KAAa,EAAA;IAC9B,OAAOA,iBAAU,CAAC,QAAQ;SACvB,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;SACjC,MAAM,CAAC,KAAK;AACZ,SAAA,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;AACjB;AAEA,SAAS,SAAS,CAAC,KAAa,EAAA;AAC9B,IAAA,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC;AACzB,IAAA,MAAM,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE;AAC5B,IAAA,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC;AACtD,IAAA,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC;AACnD,IAAA,OAAO,GAAG,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,GAAG,EAAE;AAC3B;MAEa,qBAAqB,CAAA;AAEb,IAAA,IAAA;AACA,IAAA,KAAA;IAFnB,WAAA,CACmB,IAAU,EACV,KAAA,GAAgB,YAAY,EAAA;QAD5B,IAAA,CAAA,IAAI,GAAJ,IAAI;QACJ,IAAA,CAAA,KAAK,GAAL,KAAK;IACrB;AAEH,IAAA,MAAM,OAAO,GAAA;;AAEX,QAAA,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;AACS,iCAAA,EAAA,IAAI,CAAC,KAAK,CAAA;;;;;;;;;;;AAWxC,IAAA,CAAA,CAAC;AACF,QAAA,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CACnB,CAAA,2BAAA,EAA8B,IAAI,CAAC,KAAK,qBAAqB,IAAI,CAAC,KAAK,CAAA,uBAAA,CAAyB,CACjG;AACD,QAAA,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CACnB,CAAA,2BAAA,EAA8B,IAAI,CAAC,KAAK,kBAAkB,IAAI,CAAC,KAAK,CAAA,sBAAA,CAAwB,CAC7F;QACD,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CACnB,CAAA,kCAAA,EAAqC,IAAI,CAAC,KAAK,CAAA;AACzC,UAAA,EAAA,IAAI,CAAC,KAAK,CAAA,8CAAA,CAAgD,CACjE;IACH;IAEA,MAAM,MAAM,CAAC,MAA0B,EAAA;AACrC,QAAA,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACrE;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE;QACxC,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC;AACrC,QAAA,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC;;;QAI/B,MAAM,MAAM,GAAa,EAAE;QAC3B,MAAM,IAAI,GAAc,EAAE;QAC1B,IAAI,CAAC,GAAG,CAAC;AACT,QAAA,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE;YAC7B,MAAM,CAAC,IAAI,CACT,CAAA,EAAA,EAAK,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,QAAA,CAAU,CACzE;YACD,IAAI,CAAC,IAAI,CACP,MAAM,CAAC,OAAO,EACd,GAAG,CAAC,EAAE,EACN,GAAG,CAAC,IAAI,EACR,MAAM,CAAC,KAAK,EACZ,KAAK,EACL,GAAG,CAAC,KAAK,EACT,MAAM,CACP;QACH;AACA,QAAA,MAAM,GAAG,GAAG;AACI,kBAAA,EAAA,IAAI,CAAC,KAAK;;AAEf,aAAA,EAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;;AAEG,iCAAA,EAAA,IAAI,CAAC,KAAK,CAAA;;KAExC;QACD,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC;IAClC;AACD;AAED;MACa,iBAAiB,CAAA;IAC5B,MAAM,MAAM,GAAA,EAAmB;IAC/B,MAAM,OAAO,GAAA,EAAmB;AACjC;;;;;;"}
+{"version":3,"file":"recallTracking.cjs","sources":["../../../src/memory/recallTracking.ts"],"sourcesContent":["/**\n * Recall tracking — Phase 2.\n *\n * Lightweight adaptation of upstream\n * `extensions/memory-core/src/short-term-promotion.ts::recordShortTermRecalls`.\n * Upstream stores recalls in a JSON file under `memory/.dreams/`; we store\n * them in a Postgres table `agent_memory_recalls`. Schema captures what the\n * future Phase 3 dreaming/promotion algorithm will need:\n *   - which memory row was surfaced (`memory_id`)\n *   - the query that surfaced it (raw + SHA-256 hash for dedupe)\n *   - hybrid score at the time of recall\n *   - the day bucket (for per-day dedupe / frequency counting)\n *   - the recorded timestamp\n *\n * Best-effort: failures never block memory_search. The caller fires\n * {@link RecallTracker.record} without awaiting the result and ignores errors.\n */\nimport { createHash } from 'crypto';\nimport type { Pool } from 'pg';\n\nexport interface RecallTracker {\n  /** Record that the given memory ids were surfaced to the model for a query. */\n  record(params: RecallRecordParams): Promise<void>;\n  /** Backend-specific schema migration. Idempotent. */\n  migrate(): Promise<void>;\n}\n\nexport interface RecallRecordParams {\n  agentId: string;\n  query: string;\n  hits: Array<{ id: string; path: string; score: number }>;\n  nowMs?: number;\n}\n\nexport const RECALL_TABLE = 'agent_memory_recalls';\n\nfunction hashQuery(query: string): string {\n  return createHash('sha256')\n    .update(query.trim().toLowerCase())\n    .digest('hex')\n    .slice(0, 32);\n}\n\nfunction dayBucket(nowMs: number): string {\n  const d = new Date(nowMs);\n  const y = d.getUTCFullYear();\n  const m = String(d.getUTCMonth() + 1).padStart(2, '0');\n  const day = String(d.getUTCDate()).padStart(2, '0');\n  return `${y}-${m}-${day}`;\n}\n\nexport class PgvectorRecallTracker implements RecallTracker {\n  constructor(\n    private readonly pool: Pool,\n    private readonly table: string = RECALL_TABLE\n  ) {}\n\n  async migrate(): Promise<void> {\n    // [recall-tracking] debug: create table + indexes if missing\n    await this.pool.query(`\n      CREATE TABLE IF NOT EXISTS ${this.table} (\n        id           BIGSERIAL   PRIMARY KEY,\n        agent_id     TEXT        NOT NULL,\n        memory_id    TEXT        NOT NULL,\n        memory_path  TEXT        NOT NULL,\n        query        TEXT        NOT NULL,\n        query_hash   TEXT        NOT NULL,\n        score        DOUBLE PRECISION NOT NULL,\n        day_bucket   TEXT        NOT NULL,\n        recorded_at  TIMESTAMPTZ NOT NULL DEFAULT NOW()\n      )\n    `);\n    await this.pool.query(\n      `CREATE INDEX IF NOT EXISTS ${this.table}_agent_day_idx ON ${this.table} (agent_id, day_bucket)`\n    );\n    await this.pool.query(\n      `CREATE INDEX IF NOT EXISTS ${this.table}_memory_idx ON ${this.table} (agent_id, memory_id)`\n    );\n    await this.pool.query(\n      `CREATE UNIQUE INDEX IF NOT EXISTS ${this.table}_dedupe_idx\n       ON ${this.table} (agent_id, memory_id, query_hash, day_bucket)`\n    );\n  }\n\n  async record(params: RecallRecordParams): Promise<void> {\n    if (!params.agentId || !params.query.trim() || params.hits.length === 0)\n      return;\n    const nowMs = params.nowMs ?? Date.now();\n    const qhash = hashQuery(params.query);\n    const bucket = dayBucket(nowMs);\n\n    // [recall-tracking] debug: upsert one row per (agent, memory, query, day)\n    // Upstream dedupes per-day per-query so repeated searches don't inflate counts.\n    const values: string[] = [];\n    const args: unknown[] = [];\n    let i = 1;\n    for (const hit of params.hits) {\n      values.push(\n        `($${i++}, $${i++}, $${i++}, $${i++}, $${i++}, $${i++}, $${i++}, NOW())`\n      );\n      args.push(\n        params.agentId,\n        hit.id,\n        hit.path,\n        params.query,\n        qhash,\n        hit.score,\n        bucket\n      );\n    }\n    const sql = `\n      INSERT INTO ${this.table}\n        (agent_id, memory_id, memory_path, query, query_hash, score, day_bucket, recorded_at)\n      VALUES ${values.join(', ')}\n      ON CONFLICT (agent_id, memory_id, query_hash, day_bucket) DO UPDATE\n      SET score       = GREATEST(${this.table}.score, EXCLUDED.score),\n          recorded_at = NOW()\n    `;\n    await this.pool.query(sql, args);\n  }\n}\n\n/** No-op tracker — used when recall tracking is disabled or the backend isn't pgvector. */\nexport class NullRecallTracker implements RecallTracker {\n  async record(): Promise<void> {}\n  async migrate(): Promise<void> {}\n}\n"],"names":["createHash"],"mappings":";;;;AAAA;;;;;;;;;;;;;;;;AAgBG;AAkBI,MAAM,YAAY,GAAG;AAE5B,SAAS,SAAS,CAAC,KAAa,EAAA;IAC9B,OAAOA,iBAAU,CAAC,QAAQ;SACvB,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE;SACjC,MAAM,CAAC,KAAK;AACZ,SAAA,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;AACjB;AAEA,SAAS,SAAS,CAAC,KAAa,EAAA;AAC9B,IAAA,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC;AACzB,IAAA,MAAM,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE;AAC5B,IAAA,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC;AACtD,IAAA,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC;AACnD,IAAA,OAAO,GAAG,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,GAAG,EAAE;AAC3B;MAEa,qBAAqB,CAAA;AAEb,IAAA,IAAA;AACA,IAAA,KAAA;IAFnB,WAAA,CACmB,IAAU,EACV,KAAA,GAAgB,YAAY,EAAA;QAD5B,IAAA,CAAA,IAAI,GAAJ,IAAI;QACJ,IAAA,CAAA,KAAK,GAAL,KAAK;IACrB;AAEH,IAAA,MAAM,OAAO,GAAA;;AAEX,QAAA,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;AACS,iCAAA,EAAA,IAAI,CAAC,KAAK,CAAA;;;;;;;;;;;AAWxC,IAAA,CAAA,CAAC;AACF,QAAA,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CACnB,CAAA,2BAAA,EAA8B,IAAI,CAAC,KAAK,qBAAqB,IAAI,CAAC,KAAK,CAAA,uBAAA,CAAyB,CACjG;AACD,QAAA,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CACnB,CAAA,2BAAA,EAA8B,IAAI,CAAC,KAAK,kBAAkB,IAAI,CAAC,KAAK,CAAA,sBAAA,CAAwB,CAC7F;QACD,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CACnB,CAAA,kCAAA,EAAqC,IAAI,CAAC,KAAK,CAAA;AACzC,UAAA,EAAA,IAAI,CAAC,KAAK,CAAA,8CAAA,CAAgD,CACjE;IACH;IAEA,MAAM,MAAM,CAAC,MAA0B,EAAA;AACrC,QAAA,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACrE;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE;QACxC,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC;AACrC,QAAA,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC;;;QAI/B,MAAM,MAAM,GAAa,EAAE;QAC3B,MAAM,IAAI,GAAc,EAAE;QAC1B,IAAI,CAAC,GAAG,CAAC;AACT,QAAA,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE;YAC7B,MAAM,CAAC,IAAI,CACT,CAAA,EAAA,EAAK,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,GAAA,EAAM,CAAC,EAAE,CAAA,QAAA,CAAU,CACzE;YACD,IAAI,CAAC,IAAI,CACP,MAAM,CAAC,OAAO,EACd,GAAG,CAAC,EAAE,EACN,GAAG,CAAC,IAAI,EACR,MAAM,CAAC,KAAK,EACZ,KAAK,EACL,GAAG,CAAC,KAAK,EACT,MAAM,CACP;QACH;AACA,QAAA,MAAM,GAAG,GAAG;AACI,kBAAA,EAAA,IAAI,CAAC,KAAK;;AAEf,aAAA,EAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;;AAEG,iCAAA,EAAA,IAAI,CAAC,KAAK,CAAA;;KAExC;QACD,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC;IAClC;AACD;AAED;MACa,iBAAiB,CAAA;IAC5B,MAAM,MAAM,GAAA,EAAmB;IAC/B,MAAM,OAAO,GAAA,EAAmB;AACjC;;;;;;"}

package/dist/cjs/memory/temporalDecay.cjs

@@ -3,14 +3,14 @@
 /**
  * Temporal decay — Phase 2.
  *
- * Ported from a reference implementation `extensions/memory-core/src/memory/temporal-decay.ts`.
+ * Ported from upstream `extensions/memory-core/src/memory/temporal-decay.ts`.
  * Ages dated memory files (`memory/YYYY-MM-DD.md`) using exponential decay
  * `multiplier = exp(-ln(2) / halfLifeDays * ageInDays)`. At half-life, the
  * score is exactly halved.
  *
  * Evergreen files (MEMORY.md, memory/topics.md, any non-dated file inside
  * memory/) do NOT decay — they represent durable knowledge and should stay
- * hot regardless of age. This mirrors the standard `isEvergreenMemoryPath`.
+ * hot regardless of age. This mirrors upstream's `isEvergreenMemoryPath`.
  *
  * Since our pgvector rows carry `createdAt`, we don't need filesystem stat
  * fallback — the row timestamp is authoritative for any file without a

package/dist/cjs/memory/temporalDecay.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"temporalDecay.cjs","sources":["../../../src/memory/temporalDecay.ts"],"sourcesContent":["/**\n * Temporal decay — Phase 2.\n *\n * Ported from a reference implementation `extensions/memory-core/src/memory/temporal-decay.ts`.\n * Ages dated memory files (`memory/YYYY-MM-DD.md`) using exponential decay\n * `multiplier = exp(-ln(2) / halfLifeDays * ageInDays)`. At half-life, the\n * score is exactly halved.\n *\n * Evergreen files (MEMORY.md, memory/topics.md, any non-dated file inside\n * memory/) do NOT decay — they represent durable knowledge and should stay\n * hot regardless of age. This mirrors the standard `isEvergreenMemoryPath`.\n *\n * Since our pgvector rows carry `createdAt`, we don't need filesystem stat\n * fallback — the row timestamp is authoritative for any file without a\n * date in the path.\n */\n\nexport interface TemporalDecayConfig {\n  enabled: boolean;\n  halfLifeDays: number;\n}\n\nexport const DEFAULT_TEMPORAL_DECAY_CONFIG: TemporalDecayConfig = {\n  enabled: false,\n  halfLifeDays: 30,\n};\n\nconst DAY_MS = 24 * 60 * 60 * 1000;\nconst DATED_MEMORY_PATH_RE = /(?:^|\\/)memory\\/(\\d{4})-(\\d{2})-(\\d{2})\\.md$/;\n\nexport function toDecayLambda(halfLifeDays: number): number {\n  if (!Number.isFinite(halfLifeDays) || halfLifeDays <= 0) return 0;\n  return Math.LN2 / halfLifeDays;\n}\n\nexport function calculateTemporalDecayMultiplier(params: {\n  ageInDays: number;\n  halfLifeDays: number;\n}): number {\n  const lambda = toDecayLambda(params.halfLifeDays);\n  const age = Math.max(0, params.ageInDays);\n  if (lambda <= 0 || !Number.isFinite(age)) return 1;\n  return Math.exp(-lambda * age);\n}\n\nexport function applyTemporalDecayToScore(params: {\n  score: number;\n  ageInDays: number;\n  halfLifeDays: number;\n}): number {\n  return params.score * calculateTemporalDecayMultiplier(params);\n}\n\nfunction normalizePath(p: string): string {\n  return (p ?? '').replace(/\\\\/g, '/').replace(/^\\.\\//, '');\n}\n\n/** Parse a date out of `memory/YYYY-MM-DD.md` — returns null on non-match or invalid date. */\nexport function parseMemoryDateFromPath(filePath: string): Date | null {\n  const m = DATED_MEMORY_PATH_RE.exec(normalizePath(filePath));\n  if (!m) return null;\n  const y = Number(m[1]);\n  const mo = Number(m[2]);\n  const d = Number(m[3]);\n  if (!Number.isInteger(y) || !Number.isInteger(mo) || !Number.isInteger(d))\n    return null;\n  const ts = Date.UTC(y, mo - 1, d);\n  const parsed = new Date(ts);\n  if (\n    parsed.getUTCFullYear() !== y ||\n    parsed.getUTCMonth() !== mo - 1 ||\n    parsed.getUTCDate() !== d\n  ) {\n    return null;\n  }\n  return parsed;\n}\n\n/**\n * Evergreen = durable knowledge file that should not decay.\n * - `MEMORY.md` / `memory.md` at root\n * - anything inside `memory/` that is NOT a dated `YYYY-MM-DD.md` file\n */\nexport function isEvergreenMemoryPath(filePath: string): boolean {\n  const n = normalizePath(filePath);\n  if (n === 'MEMORY.md' || n === 'memory.md') return true;\n  if (!n.startsWith('memory/')) return false;\n  return !DATED_MEMORY_PATH_RE.test(n);\n}\n\nfunction ageInDays(timestamp: Date, nowMs: number): number {\n  return Math.max(0, nowMs - timestamp.getTime()) / DAY_MS;\n}\n\nexport interface DecayCandidate {\n  path: string;\n  score: number;\n  createdAt?: Date;\n}\n\n/**\n * Apply temporal decay to a list of memory hits.\n *\n * Priority for the effective timestamp:\n *   1. Dated path (`memory/YYYY-MM-DD.md`) — use the date in the path\n *   2. Otherwise, if the path is evergreen — NO decay\n *   3. Otherwise, use the row's `createdAt`\n */\nexport function applyTemporalDecayToHits<T extends DecayCandidate>(\n  hits: T[],\n  config: Partial<TemporalDecayConfig> = {},\n  nowMs: number = Date.now()\n): T[] {\n  const merged = { ...DEFAULT_TEMPORAL_DECAY_CONFIG, ...config };\n  if (!merged.enabled) return [...hits];\n\n  return hits.map((h) => {\n    const datedTs = parseMemoryDateFromPath(h.path);\n    let ts: Date | null = datedTs;\n    if (!ts) {\n      if (isEvergreenMemoryPath(h.path)) return h;\n      ts = h.createdAt ?? null;\n    }\n    if (!ts) return h;\n    return {\n      ...h,\n      score: applyTemporalDecayToScore({\n        score: h.score,\n        ageInDays: ageInDays(ts, nowMs),\n        halfLifeDays: merged.halfLifeDays,\n      }),\n    };\n  });\n}\n"],"names":[],"mappings":";;AAAA;;;;;;;;;;;;;;;AAeG;AAOI,MAAM,6BAA6B,GAAwB;AAChE,IAAA,OAAO,EAAE,KAAK;AACd,IAAA,YAAY,EAAE,EAAE;;AAGlB,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAClC,MAAM,oBAAoB,GAAG,8CAA8C;AAErE,SAAU,aAAa,CAAC,YAAoB,EAAA;IAChD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,YAAY,IAAI,CAAC;AAAE,QAAA,OAAO,CAAC;AACjE,IAAA,OAAO,IAAI,CAAC,GAAG,GAAG,YAAY;AAChC;AAEM,SAAU,gCAAgC,CAAC,MAGhD,EAAA;IACC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC;AACjD,IAAA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,CAAC;IACzC,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;AAAE,QAAA,OAAO,CAAC;IAClD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC;AAChC;AAEM,SAAU,yBAAyB,CAAC,MAIzC,EAAA;IACC,OAAO,MAAM,CAAC,KAAK,GAAG,gCAAgC,CAAC,MAAM,CAAC;AAChE;AAEA,SAAS,aAAa,CAAC,CAAS,EAAA;AAC9B,IAAA,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;AAC3D;AAEA;AACM,SAAU,uBAAuB,CAAC,QAAgB,EAAA;IACtD,MAAM,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;AAC5D,IAAA,IAAI,CAAC,CAAC;AAAE,QAAA,OAAO,IAAI;IACnB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;AACvE,QAAA,OAAO,IAAI;AACb,IAAA,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AACjC,IAAA,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;AAC3B,IAAA,IACE,MAAM,CAAC,cAAc,EAAE,KAAK,CAAC;AAC7B,QAAA,MAAM,CAAC,WAAW,EAAE,KAAK,EAAE,GAAG,CAAC;AAC/B,QAAA,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,EACzB;AACA,QAAA,OAAO,IAAI;IACb;AACA,IAAA,OAAO,MAAM;AACf;AAEA;;;;AAIG;AACG,SAAU,qBAAqB,CAAC,QAAgB,EAAA;AACpD,IAAA,MAAM,CAAC,GAAG,aAAa,CAAC,QAAQ,CAAC;AACjC,IAAA,IAAI,CAAC,KAAK,WAAW,IAAI,CAAC,KAAK,WAAW;AAAE,QAAA,OAAO,IAAI;AACvD,IAAA,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;AAAE,QAAA,OAAO,KAAK;AAC1C,IAAA,OAAO,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC;AACtC;AAEA,SAAS,SAAS,CAAC,SAAe,EAAE,KAAa,EAAA;AAC/C,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM;AAC1D;AAQA;;;;;;;AAOG;AACG,SAAU,wBAAwB,CACtC,IAAS,EACT,MAAA,GAAuC,EAAE,EACzC,KAAA,GAAgB,IAAI,CAAC,GAAG,EAAE,EAAA;IAE1B,MAAM,MAAM,GAAG,EAAE,GAAG,6BAA6B,EAAE,GAAG,MAAM,EAAE;IAC9D,IAAI,CAAC,MAAM,CAAC,OAAO;AAAE,QAAA,OAAO,CAAC,GAAG,IAAI,CAAC;AAErC,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAI;QACpB,MAAM,OAAO,GAAG,uBAAuB,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,IAAI,EAAE,GAAgB,OAAO;QAC7B,IAAI,CAAC,EAAE,EAAE;AACP,YAAA,IAAI,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC;AAAE,gBAAA,OAAO,CAAC;AAC3C,YAAA,EAAE,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI;QAC1B;AACA,QAAA,IAAI,CAAC,EAAE;AAAE,YAAA,OAAO,CAAC;QACjB,OAAO;AACL,YAAA,GAAG,CAAC;YACJ,KAAK,EAAE,yBAAyB,CAAC;gBAC/B,KAAK,EAAE,CAAC,CAAC,KAAK;AACd,gBAAA,SAAS,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC;gBAC/B,YAAY,EAAE,MAAM,CAAC,YAAY;aAClC,CAAC;SACH;AACH,IAAA,CAAC,CAAC;AACJ;;;;;;;;;;"}
+{"version":3,"file":"temporalDecay.cjs","sources":["../../../src/memory/temporalDecay.ts"],"sourcesContent":["/**\n * Temporal decay — Phase 2.\n *\n * Ported from upstream `extensions/memory-core/src/memory/temporal-decay.ts`.\n * Ages dated memory files (`memory/YYYY-MM-DD.md`) using exponential decay\n * `multiplier = exp(-ln(2) / halfLifeDays * ageInDays)`. At half-life, the\n * score is exactly halved.\n *\n * Evergreen files (MEMORY.md, memory/topics.md, any non-dated file inside\n * memory/) do NOT decay — they represent durable knowledge and should stay\n * hot regardless of age. This mirrors upstream's `isEvergreenMemoryPath`.\n *\n * Since our pgvector rows carry `createdAt`, we don't need filesystem stat\n * fallback — the row timestamp is authoritative for any file without a\n * date in the path.\n */\n\nexport interface TemporalDecayConfig {\n  enabled: boolean;\n  halfLifeDays: number;\n}\n\nexport const DEFAULT_TEMPORAL_DECAY_CONFIG: TemporalDecayConfig = {\n  enabled: false,\n  halfLifeDays: 30,\n};\n\nconst DAY_MS = 24 * 60 * 60 * 1000;\nconst DATED_MEMORY_PATH_RE = /(?:^|\\/)memory\\/(\\d{4})-(\\d{2})-(\\d{2})\\.md$/;\n\nexport function toDecayLambda(halfLifeDays: number): number {\n  if (!Number.isFinite(halfLifeDays) || halfLifeDays <= 0) return 0;\n  return Math.LN2 / halfLifeDays;\n}\n\nexport function calculateTemporalDecayMultiplier(params: {\n  ageInDays: number;\n  halfLifeDays: number;\n}): number {\n  const lambda = toDecayLambda(params.halfLifeDays);\n  const age = Math.max(0, params.ageInDays);\n  if (lambda <= 0 || !Number.isFinite(age)) return 1;\n  return Math.exp(-lambda * age);\n}\n\nexport function applyTemporalDecayToScore(params: {\n  score: number;\n  ageInDays: number;\n  halfLifeDays: number;\n}): number {\n  return params.score * calculateTemporalDecayMultiplier(params);\n}\n\nfunction normalizePath(p: string): string {\n  return (p ?? '').replace(/\\\\/g, '/').replace(/^\\.\\//, '');\n}\n\n/** Parse a date out of `memory/YYYY-MM-DD.md` — returns null on non-match or invalid date. */\nexport function parseMemoryDateFromPath(filePath: string): Date | null {\n  const m = DATED_MEMORY_PATH_RE.exec(normalizePath(filePath));\n  if (!m) return null;\n  const y = Number(m[1]);\n  const mo = Number(m[2]);\n  const d = Number(m[3]);\n  if (!Number.isInteger(y) || !Number.isInteger(mo) || !Number.isInteger(d))\n    return null;\n  const ts = Date.UTC(y, mo - 1, d);\n  const parsed = new Date(ts);\n  if (\n    parsed.getUTCFullYear() !== y ||\n    parsed.getUTCMonth() !== mo - 1 ||\n    parsed.getUTCDate() !== d\n  ) {\n    return null;\n  }\n  return parsed;\n}\n\n/**\n * Evergreen = durable knowledge file that should not decay.\n * - `MEMORY.md` / `memory.md` at root\n * - anything inside `memory/` that is NOT a dated `YYYY-MM-DD.md` file\n */\nexport function isEvergreenMemoryPath(filePath: string): boolean {\n  const n = normalizePath(filePath);\n  if (n === 'MEMORY.md' || n === 'memory.md') return true;\n  if (!n.startsWith('memory/')) return false;\n  return !DATED_MEMORY_PATH_RE.test(n);\n}\n\nfunction ageInDays(timestamp: Date, nowMs: number): number {\n  return Math.max(0, nowMs - timestamp.getTime()) / DAY_MS;\n}\n\nexport interface DecayCandidate {\n  path: string;\n  score: number;\n  createdAt?: Date;\n}\n\n/**\n * Apply temporal decay to a list of memory hits.\n *\n * Priority for the effective timestamp:\n *   1. Dated path (`memory/YYYY-MM-DD.md`) — use the date in the path\n *   2. Otherwise, if the path is evergreen — NO decay\n *   3. Otherwise, use the row's `createdAt`\n */\nexport function applyTemporalDecayToHits<T extends DecayCandidate>(\n  hits: T[],\n  config: Partial<TemporalDecayConfig> = {},\n  nowMs: number = Date.now()\n): T[] {\n  const merged = { ...DEFAULT_TEMPORAL_DECAY_CONFIG, ...config };\n  if (!merged.enabled) return [...hits];\n\n  return hits.map((h) => {\n    const datedTs = parseMemoryDateFromPath(h.path);\n    let ts: Date | null = datedTs;\n    if (!ts) {\n      if (isEvergreenMemoryPath(h.path)) return h;\n      ts = h.createdAt ?? null;\n    }\n    if (!ts) return h;\n    return {\n      ...h,\n      score: applyTemporalDecayToScore({\n        score: h.score,\n        ageInDays: ageInDays(ts, nowMs),\n        halfLifeDays: merged.halfLifeDays,\n      }),\n    };\n  });\n}\n"],"names":[],"mappings":";;AAAA;;;;;;;;;;;;;;;AAeG;AAOI,MAAM,6BAA6B,GAAwB;AAChE,IAAA,OAAO,EAAE,KAAK;AACd,IAAA,YAAY,EAAE,EAAE;;AAGlB,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAClC,MAAM,oBAAoB,GAAG,8CAA8C;AAErE,SAAU,aAAa,CAAC,YAAoB,EAAA;IAChD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,YAAY,IAAI,CAAC;AAAE,QAAA,OAAO,CAAC;AACjE,IAAA,OAAO,IAAI,CAAC,GAAG,GAAG,YAAY;AAChC;AAEM,SAAU,gCAAgC,CAAC,MAGhD,EAAA;IACC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC;AACjD,IAAA,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,CAAC;IACzC,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;AAAE,QAAA,OAAO,CAAC;IAClD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC;AAChC;AAEM,SAAU,yBAAyB,CAAC,MAIzC,EAAA;IACC,OAAO,MAAM,CAAC,KAAK,GAAG,gCAAgC,CAAC,MAAM,CAAC;AAChE;AAEA,SAAS,aAAa,CAAC,CAAS,EAAA;AAC9B,IAAA,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;AAC3D;AAEA;AACM,SAAU,uBAAuB,CAAC,QAAgB,EAAA;IACtD,MAAM,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;AAC5D,IAAA,IAAI,CAAC,CAAC;AAAE,QAAA,OAAO,IAAI;IACnB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;AACvE,QAAA,OAAO,IAAI;AACb,IAAA,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;AACjC,IAAA,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;AAC3B,IAAA,IACE,MAAM,CAAC,cAAc,EAAE,KAAK,CAAC;AAC7B,QAAA,MAAM,CAAC,WAAW,EAAE,KAAK,EAAE,GAAG,CAAC;AAC/B,QAAA,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,EACzB;AACA,QAAA,OAAO,IAAI;IACb;AACA,IAAA,OAAO,MAAM;AACf;AAEA;;;;AAIG;AACG,SAAU,qBAAqB,CAAC,QAAgB,EAAA;AACpD,IAAA,MAAM,CAAC,GAAG,aAAa,CAAC,QAAQ,CAAC;AACjC,IAAA,IAAI,CAAC,KAAK,WAAW,IAAI,CAAC,KAAK,WAAW;AAAE,QAAA,OAAO,IAAI;AACvD,IAAA,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;AAAE,QAAA,OAAO,KAAK;AAC1C,IAAA,OAAO,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC;AACtC;AAEA,SAAS,SAAS,CAAC,SAAe,EAAE,KAAa,EAAA;AAC/C,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM;AAC1D;AAQA;;;;;;;AAOG;AACG,SAAU,wBAAwB,CACtC,IAAS,EACT,MAAA,GAAuC,EAAE,EACzC,KAAA,GAAgB,IAAI,CAAC,GAAG,EAAE,EAAA;IAE1B,MAAM,MAAM,GAAG,EAAE,GAAG,6BAA6B,EAAE,GAAG,MAAM,EAAE;IAC9D,IAAI,CAAC,MAAM,CAAC,OAAO;AAAE,QAAA,OAAO,CAAC,GAAG,IAAI,CAAC;AAErC,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAI;QACpB,MAAM,OAAO,GAAG,uBAAuB,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,IAAI,EAAE,GAAgB,OAAO;QAC7B,IAAI,CAAC,EAAE,EAAE;AACP,YAAA,IAAI,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC;AAAE,gBAAA,OAAO,CAAC;AAC3C,YAAA,EAAE,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI;QAC1B;AACA,QAAA,IAAI,CAAC,EAAE;AAAE,YAAA,OAAO,CAAC;QACjB,OAAO;AACL,YAAA,GAAG,CAAC;YACJ,KAAK,EAAE,yBAAyB,CAAC;gBAC/B,KAAK,EAAE,CAAC,CAAC,KAAK;AACd,gBAAA,SAAS,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC;gBAC/B,YAAY,EAAE,MAAM,CAAC,YAAY;aAClC,CAAC;SACH;AACH,IAAA,CAAC,CAAC;AACJ;;;;;;;;;;"}

package/dist/cjs/messages/cache.cjs

@@ -3,47 +3,6 @@
 var messages = require('@langchain/core/messages');
 var _enum = require('../common/enum.cjs');
 
-/**
- * Strips Anthropic-style `cache_control` markers from every block in the
- * given content array. Returns the (possibly cloned) content and a flag
- * indicating whether anything was actually modified — so callers can avoid
- * unnecessary message clones.
- *
- * Used to sanitize a system message's content array before adding Bedrock
- * cache points, so stray Anthropic markers (e.g. left over from a previous
- * Anthropic-provider turn) don't prevent the Bedrock provider from caching
- * the system prefix.
- */
-function stripAnthropicCacheControlFromBlocks(content) {
-    let modified = false;
-    const strippedContent = content.map((block) => {
-        if (!('cache_control' in block)) {
-            return block;
-        }
-        const cloned = { ...block };
-        delete cloned.cache_control;
-        modified = true;
-        return cloned;
-    });
-    return { content: strippedContent, modified };
-}
-/**
- * For the Bedrock cache pass, system messages must NOT carry Anthropic
- * cache_control markers (those are an Anthropic-specific encoding and
- * Bedrock uses cachePoint blocks instead). Strip them before the cache
- * point insertion logic walks the message.
- */
-function sanitizeBedrockSystemMessage(message) {
-    const content = message.content;
-    if (!Array.isArray(content)) {
-        return message;
-    }
-    const stripped = stripAnthropicCacheControlFromBlocks(content);
-    if (!stripped.modified) {
-        return message;
-    }
-    return cloneMessage(message, stripped.content);
-}
 /** Debug logger for cache operations - set ILLUMA_DEBUG_CACHE=true to enable */
 const debugCache = (message, data) => {
     if (process.env.ILLUMA_DEBUG_CACHE === 'true') {
@@ -311,33 +270,8 @@ function addBedrockCacheControl(messages) {
     });
     // Clone messages to avoid mutating originals
     const updatedMessages = messages.map((msg) => {
-        /* PRESERVE cachePoint on system messages — they're added inline by
-         * AgentContext.buildSystemRunnable to mark the cacheable system prefix
-         * for account-level caching. Only strip stray Anthropic cache_control
-         * (which Bedrock ignores). For non-system messages keep the existing
-         * behaviour: full strip + repopulate based on last-2 strategy. */
-        const msgType = 'getType' in msg && typeof msg.getType === 'function'
-            ? msg.getType()
-            : undefined;
-        const msgRole = msg.role;
-        const isSystem = msgType === 'system' || msgRole === 'system';
         const content = msg.content;
         if (Array.isArray(content)) {
-            if (isSystem) {
-                /* System: keep cachePoint, only strip Anthropic cache_control. */
-                if (hasAnthropicCacheControl(content)) {
-                    const stripped = content.map((block) => {
-                        const rec = block;
-                        if ('cache_control' in rec) {
-                            const { cache_control: _, ...rest } = rec;
-                            return rest;
-                        }
-                        return block;
-                    });
-                    return cloneMessage(msg, stripped);
-                }
-                return cloneMessage(msg, content);
-            }
             // Strip existing cachePoint blocks and Anthropic-style cache_control
             const stripped = content
                 .filter((block) => !isCachePoint(block))
@@ -417,29 +351,6 @@ function addBedrockCacheControl(messages) {
     for (let i = updatedMessages.length - 1; i >= 0 && applied < MAX_CACHE_POINTS; i--) {
         const message = updatedMessages[i];
         const msgContent = message.content;
-        /* System messages are handled by AgentContext.buildSystemRunnable —
-         * the cachePoint is emitted INLINE in the system message content array
-         * so the cacheable system prefix gets a marker every turn (not just
-         * when the system message happens to be in the last 2 eligible). The
-         * Bedrock converter (src/llm/bedrock/utils/message_inputs.ts:261-294)
-         * passes through cachePoint blocks in system content arrays.
-         *
-         * If we ALSO marked system here, we'd: (a) waste one of the two
-         * cachePoint budget slots that Bedrock honours per-request, starving
-         * the conversation tail, and (b) potentially double-mark a stable
-         * prefix that already has its own cachePoint.
-         *
-         * As a defensive cleanup, strip stray Anthropic-style cache_control
-         * markers from the system message — Bedrock ignores them and they
-         * can confuse provider validation. */
-        const _msgType = 'getType' in message && typeof message.getType === 'function'
-            ? message.getType()
-            : undefined;
-        const _msgRole = message.role;
-        if (_msgType === 'system' || _msgRole === 'system') {
-            updatedMessages[i] = sanitizeBedrockSystemMessage(message);
-            continue;
-        }
         // Skip empty/whitespace-only content
         if (msgContent == null)
             continue;

package/dist/cjs/messages/cache.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"cache.cjs","sources":["../../../src/messages/cache.ts"],"sourcesContent":["import {\n  AIMessage,\n  BaseMessage,\n  ToolMessage,\n  HumanMessage,\n  SystemMessage,\n  MessageContentComplex,\n} from '@langchain/core/messages';\nimport type { AnthropicMessage } from '@/types/messages';\nimport type Anthropic from '@anthropic-ai/sdk';\nimport { ContentTypes } from '@/common/enum';\n\ntype MessageWithContent = {\n  content?: string | MessageContentComplex[];\n};\n\ntype MessageContentWithCacheControl = MessageContentComplex & {\n  cache_control?: unknown;\n};\n\n/**\n * Strips Anthropic-style `cache_control` markers from every block in the\n * given content array. Returns the (possibly cloned) content and a flag\n * indicating whether anything was actually modified — so callers can avoid\n * unnecessary message clones.\n *\n * Used to sanitize a system message's content array before adding Bedrock\n * cache points, so stray Anthropic markers (e.g. left over from a previous\n * Anthropic-provider turn) don't prevent the Bedrock provider from caching\n * the system prefix.\n */\nfunction stripAnthropicCacheControlFromBlocks(\n  content: MessageContentComplex[]\n): { content: MessageContentComplex[]; modified: boolean } {\n  let modified = false;\n  const strippedContent = content.map((block) => {\n    if (!('cache_control' in block)) {\n      return block;\n    }\n\n    const cloned: MessageContentWithCacheControl = { ...block };\n    delete cloned.cache_control;\n    modified = true;\n    return cloned;\n  });\n\n  return { content: strippedContent, modified };\n}\n\n/**\n * For the Bedrock cache pass, system messages must NOT carry Anthropic\n * cache_control markers (those are an Anthropic-specific encoding and\n * Bedrock uses cachePoint blocks instead). Strip them before the cache\n * point insertion logic walks the message.\n */\nfunction sanitizeBedrockSystemMessage<T extends MessageWithContent>(\n  message: T\n): T {\n  const content = message.content;\n  if (!Array.isArray(content)) {\n    return message;\n  }\n\n  const stripped = stripAnthropicCacheControlFromBlocks(content);\n  if (!stripped.modified) {\n    return message;\n  }\n\n  return cloneMessage(message, stripped.content);\n}\n\n/** Debug logger for cache operations - set ILLUMA_DEBUG_CACHE=true to enable */\nconst debugCache = (message: string, data?: unknown): void => {\n  if (process.env.ILLUMA_DEBUG_CACHE === 'true') {\n    // eslint-disable-next-line no-console\n    console.log(\n      `[Cache] ${message}`,\n      data !== undefined ? JSON.stringify(data, null, 2) : ''\n    );\n  }\n};\n\n/**\n * Deep clones a message's content to prevent mutation of the original.\n */\nfunction deepCloneContent<T extends string | MessageContentComplex[]>(\n  content: T\n): T {\n  if (typeof content === 'string') {\n    return content;\n  }\n  if (Array.isArray(content)) {\n    return content.map((block) => ({ ...block })) as T;\n  }\n  return content;\n}\n\n/**\n * Clones a message with new content. For LangChain BaseMessage instances,\n * constructs a proper class instance so that `instanceof` checks are preserved\n * in downstream code (e.g., ensureThinkingBlockInMessages).\n * For plain objects (AnthropicMessage), uses object spread.\n */\nfunction cloneMessage<T extends MessageWithContent>(\n  message: T,\n  content: string | MessageContentComplex[]\n): T {\n  if (message instanceof BaseMessage) {\n    const baseParams = {\n      content,\n      additional_kwargs: { ...message.additional_kwargs },\n      response_metadata: { ...message.response_metadata },\n      id: message.id,\n      name: message.name,\n    };\n\n    const msgType = message.getType();\n    switch (msgType) {\n    case 'ai':\n      return new AIMessage({\n        ...baseParams,\n        tool_calls: (message as unknown as AIMessage).tool_calls,\n      }) as unknown as T;\n    case 'human':\n      return new HumanMessage(baseParams) as unknown as T;\n    case 'system':\n      return new SystemMessage(baseParams) as unknown as T;\n    case 'tool':\n      return new ToolMessage({\n        ...baseParams,\n        tool_call_id: (message as unknown as ToolMessage).tool_call_id,\n      }) as unknown as T;\n    default:\n      break;\n    }\n  }\n\n  const {\n    lc_kwargs: _lc_kwargs,\n    lc_serializable: _lc_serializable,\n    lc_namespace: _lc_namespace,\n    ...rest\n  } = message as T & {\n    lc_kwargs?: unknown;\n    lc_serializable?: unknown;\n    lc_namespace?: unknown;\n  };\n\n  const cloned = { ...rest, content } as T;\n\n  // Sync lc_kwargs.content with the new content to prevent LangChain coercion issues\n  const lcKwargs = (message as Record<string, unknown>).lc_kwargs as\n    | Record<string, unknown>\n    | undefined;\n  if (lcKwargs != null) {\n    (cloned as Record<string, unknown>).lc_kwargs = {\n      ...lcKwargs,\n      content: content,\n    };\n  }\n\n  // LangChain messages don't have a direct 'role' property - derive it from getType()\n  if (\n    'getType' in message &&\n    typeof message.getType === 'function' &&\n    !('role' in cloned)\n  ) {\n    const msgType = (message as unknown as BaseMessage).getType();\n    const roleMap: Record<string, string> = {\n      human: 'user',\n      ai: 'assistant',\n      system: 'system',\n      tool: 'tool',\n    };\n    (cloned as Record<string, unknown>).role = roleMap[msgType] || msgType;\n  }\n\n  return cloned;\n}\n\n/**\n * Checks if a content block is a cache point\n */\nfunction isCachePoint(block: MessageContentComplex): boolean {\n  return 'cachePoint' in block && !('type' in block);\n}\n\n/**\n * Checks if a message's content needs cache control stripping.\n * Returns true if content has cachePoint blocks or cache_control fields.\n */\nfunction needsCacheStripping(content: MessageContentComplex[]): boolean {\n  for (let i = 0; i < content.length; i++) {\n    const block = content[i];\n    if (isCachePoint(block)) return true;\n    if ('cache_control' in block) return true;\n  }\n  return false;\n}\n\n/**\n * Checks if a message's content has Anthropic cache_control fields.\n */\nfunction hasAnthropicCacheControl(content: MessageContentComplex[]): boolean {\n  for (let i = 0; i < content.length; i++) {\n    if ('cache_control' in content[i]) return true;\n  }\n  return false;\n}\n\n/**\n * Checks if a message's content has Bedrock cachePoint blocks.\n */\nfunction hasBedrockCachePoint(content: MessageContentComplex[]): boolean {\n  for (let i = 0; i < content.length; i++) {\n    if (isCachePoint(content[i])) return true;\n  }\n  return false;\n}\n\n/**\n * Anthropic API: Adds cache control to the appropriate user messages in the payload.\n * Strips ALL existing cache control (both Anthropic and Bedrock formats) from all messages,\n * then adds fresh cache control to the last 2 user messages in a single backward pass.\n * This ensures we don't accumulate stale cache points across multiple turns.\n * Returns a new array - only clones messages that require modification.\n * @param messages - The array of message objects.\n * @returns - A new array of message objects with cache control added.\n */\nexport function addCacheControl<T extends AnthropicMessage | BaseMessage>(\n  messages: T[]\n): T[] {\n  if (!Array.isArray(messages) || messages.length < 2) {\n    return messages;\n  }\n\n  const updatedMessages: T[] = [...messages];\n  let userMessagesModified = 0;\n\n  for (let i = updatedMessages.length - 1; i >= 0; i--) {\n    const originalMessage = updatedMessages[i];\n    const content = originalMessage.content;\n    const isUserMessage =\n      ('getType' in originalMessage && originalMessage.getType() === 'human') ||\n      ('role' in originalMessage && originalMessage.role === 'user');\n\n    const hasArrayContent = Array.isArray(content);\n    const needsStripping =\n      hasArrayContent &&\n      needsCacheStripping(content as MessageContentComplex[]);\n    const needsCacheAdd =\n      userMessagesModified < 2 &&\n      isUserMessage &&\n      (typeof content === 'string' || hasArrayContent);\n\n    if (!needsStripping && !needsCacheAdd) {\n      continue;\n    }\n\n    let workingContent: MessageContentComplex[];\n\n    if (hasArrayContent) {\n      workingContent = deepCloneContent(\n        content as MessageContentComplex[]\n      ).filter((block) => !isCachePoint(block as MessageContentComplex));\n\n      for (let j = 0; j < workingContent.length; j++) {\n        const block = workingContent[j] as Record<string, unknown>;\n        if ('cache_control' in block) {\n          delete block.cache_control;\n        }\n      }\n    } else if (typeof content === 'string') {\n      workingContent = [\n        { type: 'text', text: content },\n      ] as MessageContentComplex[];\n    } else {\n      workingContent = [];\n    }\n\n    if (userMessagesModified >= 2 || !isUserMessage) {\n      updatedMessages[i] = cloneMessage(\n        originalMessage as MessageWithContent,\n        workingContent\n      ) as T;\n      continue;\n    }\n\n    for (let j = workingContent.length - 1; j >= 0; j--) {\n      const contentPart = workingContent[j];\n      if ('type' in contentPart && contentPart.type === 'text') {\n        (contentPart as Anthropic.TextBlockParam).cache_control = {\n          type: 'ephemeral',\n        };\n        userMessagesModified++;\n        break;\n      }\n    }\n\n    updatedMessages[i] = cloneMessage(\n      originalMessage as MessageWithContent,\n      workingContent\n    ) as T;\n  }\n\n  return updatedMessages;\n}\n\n/**\n * Removes all Anthropic cache_control fields from messages\n * Used when switching from Anthropic to Bedrock provider\n * Returns a new array - only clones messages that require modification.\n */\nexport function stripAnthropicCacheControl<T extends MessageWithContent>(\n  messages: T[]\n): T[] {\n  if (!Array.isArray(messages)) {\n    return messages;\n  }\n\n  const updatedMessages: T[] = [...messages];\n\n  for (let i = 0; i < updatedMessages.length; i++) {\n    const originalMessage = updatedMessages[i];\n    const content = originalMessage.content;\n\n    if (!Array.isArray(content) || !hasAnthropicCacheControl(content)) {\n      continue;\n    }\n\n    const clonedContent = deepCloneContent(content);\n    for (let j = 0; j < clonedContent.length; j++) {\n      const block = clonedContent[j] as Record<string, unknown>;\n      if ('cache_control' in block) {\n        delete block.cache_control;\n      }\n    }\n    updatedMessages[i] = cloneMessage(originalMessage, clonedContent) as T;\n  }\n\n  return updatedMessages;\n}\n\n/**\n * Removes all Bedrock cachePoint blocks from messages\n * Used when switching from Bedrock to Anthropic provider\n * Returns a new array - only clones messages that require modification.\n */\nexport function stripBedrockCacheControl<T extends MessageWithContent>(\n  messages: T[]\n): T[] {\n  if (!Array.isArray(messages)) {\n    return messages;\n  }\n\n  const updatedMessages: T[] = [...messages];\n\n  for (let i = 0; i < updatedMessages.length; i++) {\n    const originalMessage = updatedMessages[i];\n    const content = originalMessage.content;\n\n    if (!Array.isArray(content) || !hasBedrockCachePoint(content)) {\n      continue;\n    }\n\n    const clonedContent = deepCloneContent(content).filter(\n      (block) => !isCachePoint(block as MessageContentComplex)\n    );\n    updatedMessages[i] = cloneMessage(originalMessage, clonedContent) as T;\n  }\n\n  return updatedMessages;\n}\n\n/**\n * Adds Bedrock Converse API cache points using \"Stable Prefix Caching\" strategy.\n *\n * STRATEGY: Place cache point after the LAST ASSISTANT message only.\n * This ensures the prefix (everything before the cache point) remains STABLE\n * as the conversation grows, maximizing cache hits.\n *\n * Why this works:\n * - System message has its own cachePoint (added in AgentContext)\n * - Tools have their own cachePoint (added in IllumaBedrockConverse)\n * - Conversation history grows, but the PREFIX stays the same\n * - Only the NEW user message is uncached (it's always different)\n *\n * Example conversation flow:\n * Request 1: [System+cachePoint][Tools+cachePoint][User1] → No conversation cache yet\n * Request 2: [System][Tools][User1][Assistant1+cachePoint][User2] → Cache User1+Assistant1\n * Request 3: [System][Tools][User1][Assistant1][User2][Assistant2+cachePoint][User3]\n *            → Cache reads User1+A1+User2+A2, cache writes new portion\n *\n * Claude's \"Simplified Cache Management\" automatically looks back up to 20 content\n * blocks from the cache checkpoint to find the longest matching prefix.\n *\n * @param messages - The array of message objects (excluding system message).\n * @returns - The updated array with a single cache point after the last assistant message.\n */\nexport function addBedrockCacheControl<\n  T extends Partial<BaseMessage> & MessageWithContent,\n>(messages: T[]): T[] {\n  if (!Array.isArray(messages) || messages.length < 1) {\n    debugCache('addBedrockCacheControl: Skipping - no messages', {\n      count: messages.length,\n    });\n    return messages;\n  }\n\n  debugCache(\n    'addBedrockCacheControl: Processing messages with stable prefix strategy',\n    {\n      count: messages.length,\n    }\n  );\n\n  // Clone messages to avoid mutating originals\n  const updatedMessages: T[] = messages.map((msg) => {\n    /* PRESERVE cachePoint on system messages — they're added inline by\n     * AgentContext.buildSystemRunnable to mark the cacheable system prefix\n     * for account-level caching. Only strip stray Anthropic cache_control\n     * (which Bedrock ignores). For non-system messages keep the existing\n     * behaviour: full strip + repopulate based on last-2 strategy. */\n    const msgType =\n      'getType' in msg && typeof msg.getType === 'function'\n        ? msg.getType()\n        : undefined;\n    const msgRole = (msg as Record<string, unknown>).role as string | undefined;\n    const isSystem = msgType === 'system' || msgRole === 'system';\n\n    const content = msg.content;\n    if (Array.isArray(content)) {\n      if (isSystem) {\n        /* System: keep cachePoint, only strip Anthropic cache_control. */\n        if (hasAnthropicCacheControl(content)) {\n          const stripped = content.map((block) => {\n            const rec = block as Record<string, unknown>;\n            if ('cache_control' in rec) {\n              const { cache_control: _, ...rest } = rec;\n              return rest as MessageContentComplex;\n            }\n            return block;\n          });\n          return cloneMessage(msg, stripped) as T;\n        }\n        return cloneMessage(msg, content) as T;\n      }\n\n      // Strip existing cachePoint blocks and Anthropic-style cache_control\n      const stripped = content\n        .filter((block) => !isCachePoint(block))\n        .map((block) => {\n          const rec = block as Record<string, unknown>;\n          if ('cache_control' in rec) {\n            const { cache_control: _, ...rest } = rec;\n            return rest as MessageContentComplex;\n          }\n          return block;\n        });\n      if (needsCacheStripping(content) || hasAnthropicCacheControl(content)) {\n        return cloneMessage(msg, stripped) as T;\n      }\n    }\n    return cloneMessage(msg, content as string | MessageContentComplex[]) as T;\n  });\n\n  // Helper function to check if a message contains reasoning/thinking blocks\n  const hasReasoningBlock = (message: T): boolean => {\n    const content = message.content;\n    if (!Array.isArray(content)) {\n      return false;\n    }\n    for (const block of content) {\n      const type = (block as { type?: string }).type;\n      if (\n        type === 'reasoning_content' ||\n        type === 'reasoning' ||\n        type === 'thinking' ||\n        type === 'redacted_thinking'\n      ) {\n        return true;\n      }\n    }\n    return false;\n  };\n\n  /**\n   * Helper to add a cachePoint to a message's content.\n   * For strings: wraps into [{type: 'text', text}, {cachePoint}]\n   * For arrays: inserts cachePoint after the last non-whitespace text block\n   * Returns the new message or null if no suitable insertion point.\n   */\n  const addCachePointToMessage = (message: T): T | null => {\n    const msgContent = message.content;\n\n    if (typeof msgContent === 'string' && msgContent !== '') {\n      const newContent = [\n        { type: ContentTypes.TEXT, text: msgContent },\n        { cachePoint: { type: 'default' } },\n      ] as MessageContentComplex[];\n      return cloneMessage(message, newContent) as T;\n    }\n\n    if (Array.isArray(msgContent) && msgContent.length > 0) {\n      if (hasReasoningBlock(message)) {\n        return null;\n      }\n      // Find the last text block and insert cache point after it\n      for (let j = msgContent.length - 1; j >= 0; j--) {\n        const type = (msgContent[j] as { type?: string }).type;\n        if (type === ContentTypes.TEXT || type === 'text') {\n          const text = (msgContent[j] as { text?: string }).text;\n          if (text != null && text.trim() !== '') {\n            const newContent = [\n              ...msgContent.slice(0, j + 1),\n              { cachePoint: { type: 'default' } } as MessageContentComplex,\n              ...msgContent.slice(j + 1),\n            ];\n            return cloneMessage(message, newContent) as T;\n          }\n        }\n      }\n    }\n\n    return null;\n  };\n\n  // Add cache points to the last 2 messages (from the end) that have eligible content.\n  // This mirrors Anthropic's two-breakpoint strategy for Bedrock's cache API.\n  // Skip messages with only whitespace, empty content, or reasoning blocks.\n  const MAX_CACHE_POINTS = 2;\n  let applied = 0;\n\n  for (\n    let i = updatedMessages.length - 1;\n    i >= 0 && applied < MAX_CACHE_POINTS;\n    i--\n  ) {\n    const message = updatedMessages[i];\n    const msgContent = message.content;\n\n    /* System messages are handled by AgentContext.buildSystemRunnable —\n     * the cachePoint is emitted INLINE in the system message content array\n     * so the cacheable system prefix gets a marker every turn (not just\n     * when the system message happens to be in the last 2 eligible). The\n     * Bedrock converter (src/llm/bedrock/utils/message_inputs.ts:261-294)\n     * passes through cachePoint blocks in system content arrays.\n     *\n     * If we ALSO marked system here, we'd: (a) waste one of the two\n     * cachePoint budget slots that Bedrock honours per-request, starving\n     * the conversation tail, and (b) potentially double-mark a stable\n     * prefix that already has its own cachePoint.\n     *\n     * As a defensive cleanup, strip stray Anthropic-style cache_control\n     * markers from the system message — Bedrock ignores them and they\n     * can confuse provider validation. */\n    const _msgType =\n      'getType' in message && typeof message.getType === 'function'\n        ? message.getType()\n        : undefined;\n    const _msgRole = (message as Record<string, unknown>).role as\n      | string\n      | undefined;\n    if (_msgType === 'system' || _msgRole === 'system') {\n      updatedMessages[i] = sanitizeBedrockSystemMessage(\n        message as MessageWithContent\n      ) as T;\n      continue;\n    }\n\n    // Skip empty/whitespace-only content\n    if (msgContent == null) continue;\n    if (typeof msgContent === 'string' && msgContent.trim() === '') continue;\n    if (Array.isArray(msgContent) && msgContent.length === 0) continue;\n\n    // Skip non-string, non-array content (e.g., number, object without type)\n    if (typeof msgContent !== 'string' && !Array.isArray(msgContent)) continue;\n\n    // Skip AI messages with only whitespace text and reasoning blocks (tool-call scenario)\n    const messageType =\n      'getType' in message && typeof message.getType === 'function'\n        ? message.getType()\n        : 'unknown';\n    const role = (message as Record<string, unknown>).role as\n      | string\n      | undefined;\n    const isAi = messageType === 'ai' || role === 'assistant';\n    if (isAi && hasReasoningBlock(message)) {\n      // Check if all text blocks are whitespace-only\n      if (Array.isArray(msgContent)) {\n        const hasNonWhitespaceText = msgContent.some((block) => {\n          const type = (block as { type?: string }).type;\n          if (type === ContentTypes.TEXT || type === 'text') {\n            const text = (block as { text?: string }).text;\n            return text != null && text.trim() !== '';\n          }\n          return false;\n        });\n        if (!hasNonWhitespaceText) {\n          debugCache(\n            `⚠️ Message cachePoint SKIPPED at index ${i} (AI with whitespace-only text + reasoning)`\n          );\n          continue;\n        }\n      }\n    }\n\n    // Skip messages that already have cache points (multi-agent scenarios)\n    if (\n      Array.isArray(msgContent) &&\n      msgContent.some((b) => isCachePoint(b as MessageContentComplex))\n    ) {\n      continue;\n    }\n\n    const updated = addCachePointToMessage(message);\n    if (updated != null) {\n      updatedMessages[i] = updated;\n      applied++;\n      debugCache(\n        `📍 Message cachePoint at index ${i} (${typeof message.content === 'string' ? 'string' : 'array'})`\n      );\n    }\n  }\n\n  debugCache(\n    'addBedrockCacheControl: Complete - stable prefix caching applied',\n    {\n      appliedCachePoints: applied,\n      totalMessages: updatedMessages.length,\n    }\n  );\n\n  return updatedMessages;\n}\n"],"names":["BaseMessage","AIMessage","HumanMessage","SystemMessage","ToolMessage","ContentTypes"],"mappings":";;;;;AAoBA;;;;;;;;;;AAUG;AACH,SAAS,oCAAoC,CAC3C,OAAgC,EAAA;IAEhC,IAAI,QAAQ,GAAG,KAAK;IACpB,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,KAAI;AAC5C,QAAA,IAAI,EAAE,eAAe,IAAI,KAAK,CAAC,EAAE;AAC/B,YAAA,OAAO,KAAK;QACd;AAEA,QAAA,MAAM,MAAM,GAAmC,EAAE,GAAG,KAAK,EAAE;QAC3D,OAAO,MAAM,CAAC,aAAa;QAC3B,QAAQ,GAAG,IAAI;AACf,QAAA,OAAO,MAAM;AACf,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,EAAE,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE;AAC/C;AAEA;;;;;AAKG;AACH,SAAS,4BAA4B,CACnC,OAAU,EAAA;AAEV,IAAA,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO;IAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;AAC3B,QAAA,OAAO,OAAO;IAChB;AAEA,IAAA,MAAM,QAAQ,GAAG,oCAAoC,CAAC,OAAO,CAAC;AAC9D,IAAA,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE;AACtB,QAAA,OAAO,OAAO;IAChB;IAEA,OAAO,YAAY,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC;AAChD;AAEA;AACA,MAAM,UAAU,GAAG,CAAC,OAAe,EAAE,IAAc,KAAU;IAC3D,IAAI,OAAO,CAAC,GAAG,CAAC,kBAAkB,KAAK,MAAM,EAAE;;AAE7C,QAAA,OAAO,CAAC,GAAG,CACT,CAAA,QAAA,EAAW,OAAO,CAAA,CAAE,EACpB,IAAI,KAAK,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CACxD;IACH;AACF,CAAC;AAED;;AAEG;AACH,SAAS,gBAAgB,CACvB,OAAU,EAAA;AAEV,IAAA,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AAC/B,QAAA,OAAO,OAAO;IAChB;AACA,IAAA,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;AAC1B,QAAA,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,CAAM;IACpD;AACA,IAAA,OAAO,OAAO;AAChB;AAEA;;;;;AAKG;AACH,SAAS,YAAY,CACnB,OAAU,EACV,OAAyC,EAAA;AAEzC,IAAA,IAAI,OAAO,YAAYA,oBAAW,EAAE;AAClC,QAAA,MAAM,UAAU,GAAG;YACjB,OAAO;AACP,YAAA,iBAAiB,EAAE,EAAE,GAAG,OAAO,CAAC,iBAAiB,EAAE;AACnD,YAAA,iBAAiB,EAAE,EAAE,GAAG,OAAO,CAAC,iBAAiB,EAAE;YACnD,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,IAAI,EAAE,OAAO,CAAC,IAAI;SACnB;AAED,QAAA,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE;QACjC,QAAQ,OAAO;AACf,YAAA,KAAK,IAAI;gBACP,OAAO,IAAIC,kBAAS,CAAC;AACnB,oBAAA,GAAG,UAAU;oBACb,UAAU,EAAG,OAAgC,CAAC,UAAU;AACzD,iBAAA,CAAiB;AACpB,YAAA,KAAK,OAAO;AACV,gBAAA,OAAO,IAAIC,qBAAY,CAAC,UAAU,CAAiB;AACrD,YAAA,KAAK,QAAQ;AACX,gBAAA,OAAO,IAAIC,sBAAa,CAAC,UAAU,CAAiB;AACtD,YAAA,KAAK,MAAM;gBACT,OAAO,IAAIC,oBAAW,CAAC;AACrB,oBAAA,GAAG,UAAU;oBACb,YAAY,EAAG,OAAkC,CAAC,YAAY;AAC/D,iBAAA,CAAiB;;IAItB;AAEA,IAAA,MAAM,EACJ,SAAS,EAAE,UAAU,EACrB,eAAe,EAAE,gBAAgB,EACjC,YAAY,EAAE,aAAa,EAC3B,GAAG,IAAI,EACR,GAAG,OAIH;IAED,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,EAAE,OAAO,EAAO;;AAGxC,IAAA,MAAM,QAAQ,GAAI,OAAmC,CAAC,SAEzC;AACb,IAAA,IAAI,QAAQ,IAAI,IAAI,EAAE;QACnB,MAAkC,CAAC,SAAS,GAAG;AAC9C,YAAA,GAAG,QAAQ;AACX,YAAA,OAAO,EAAE,OAAO;SACjB;IACH;;IAGA,IACE,SAAS,IAAI,OAAO;AACpB,QAAA,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU;AACrC,QAAA,EAAE,MAAM,IAAI,MAAM,CAAC,EACnB;AACA,QAAA,MAAM,OAAO,GAAI,OAAkC,CAAC,OAAO,EAAE;AAC7D,QAAA,MAAM,OAAO,GAA2B;AACtC,YAAA,KAAK,EAAE,MAAM;AACb,YAAA,EAAE,EAAE,WAAW;AACf,YAAA,MAAM,EAAE,QAAQ;AAChB,YAAA,IAAI,EAAE,MAAM;SACb;QACA,MAAkC,CAAC,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO;IACxE;AAEA,IAAA,OAAO,MAAM;AACf;AAEA;;AAEG;AACH,SAAS,YAAY,CAAC,KAA4B,EAAA;IAChD,OAAO,YAAY,IAAI,KAAK,IAAI,EAAE,MAAM,IAAI,KAAK,CAAC;AACpD;AAEA;;;AAGG;AACH,SAAS,mBAAmB,CAAC,OAAgC,EAAA;AAC3D,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,QAAA,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC;QACxB,IAAI,YAAY,CAAC,KAAK,CAAC;AAAE,YAAA,OAAO,IAAI;QACpC,IAAI,eAAe,IAAI,KAAK;AAAE,YAAA,OAAO,IAAI;IAC3C;AACA,IAAA,OAAO,KAAK;AACd;AAEA;;AAEG;AACH,SAAS,wBAAwB,CAAC,OAAgC,EAAA;AAChE,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,QAAA,IAAI,eAAe,IAAI,OAAO,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI;IAChD;AACA,IAAA,OAAO,KAAK;AACd;AAEA;;AAEG;AACH,SAAS,oBAAoB,CAAC,OAAgC,EAAA;AAC5D,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,QAAA,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI;IAC3C;AACA,IAAA,OAAO,KAAK;AACd;AAEA;;;;;;;;AAQG;AACG,SAAU,eAAe,CAC7B,QAAa,EAAA;AAEb,IAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AACnD,QAAA,OAAO,QAAQ;IACjB;AAEA,IAAA,MAAM,eAAe,GAAQ,CAAC,GAAG,QAAQ,CAAC;IAC1C,IAAI,oBAAoB,GAAG,CAAC;AAE5B,IAAA,KAAK,IAAI,CAAC,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACpD,QAAA,MAAM,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC;AAC1C,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO;AACvC,QAAA,MAAM,aAAa,GACjB,CAAC,SAAS,IAAI,eAAe,IAAI,eAAe,CAAC,OAAO,EAAE,KAAK,OAAO;aACrE,MAAM,IAAI,eAAe,IAAI,eAAe,CAAC,IAAI,KAAK,MAAM,CAAC;QAEhE,MAAM,eAAe,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;QAC9C,MAAM,cAAc,GAClB,eAAe;YACf,mBAAmB,CAAC,OAAkC,CAAC;AACzD,QAAA,MAAM,aAAa,GACjB,oBAAoB,GAAG,CAAC;YACxB,aAAa;AACb,aAAC,OAAO,OAAO,KAAK,QAAQ,IAAI,eAAe,CAAC;AAElD,QAAA,IAAI,CAAC,cAAc,IAAI,CAAC,aAAa,EAAE;YACrC;QACF;AAEA,QAAA,IAAI,cAAuC;QAE3C,IAAI,eAAe,EAAE;AACnB,YAAA,cAAc,GAAG,gBAAgB,CAC/B,OAAkC,CACnC,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC,YAAY,CAAC,KAA8B,CAAC,CAAC;AAElE,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC9C,gBAAA,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAA4B;AAC1D,gBAAA,IAAI,eAAe,IAAI,KAAK,EAAE;oBAC5B,OAAO,KAAK,CAAC,aAAa;gBAC5B;YACF;QACF;AAAO,aAAA,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AACtC,YAAA,cAAc,GAAG;AACf,gBAAA,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE;aACL;QAC9B;aAAO;YACL,cAAc,GAAG,EAAE;QACrB;AAEA,QAAA,IAAI,oBAAoB,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;YAC/C,eAAe,CAAC,CAAC,CAAC,GAAG,YAAY,CAC/B,eAAqC,EACrC,cAAc,CACV;YACN;QACF;AAEA,QAAA,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACnD,YAAA,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC;YACrC,IAAI,MAAM,IAAI,WAAW,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM,EAAE;gBACvD,WAAwC,CAAC,aAAa,GAAG;AACxD,oBAAA,IAAI,EAAE,WAAW;iBAClB;AACD,gBAAA,oBAAoB,EAAE;gBACtB;YACF;QACF;QAEA,eAAe,CAAC,CAAC,CAAC,GAAG,YAAY,CAC/B,eAAqC,EACrC,cAAc,CACV;IACR;AAEA,IAAA,OAAO,eAAe;AACxB;AAEA;;;;AAIG;AACG,SAAU,0BAA0B,CACxC,QAAa,EAAA;IAEb,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;AAC5B,QAAA,OAAO,QAAQ;IACjB;AAEA,IAAA,MAAM,eAAe,GAAQ,CAAC,GAAG,QAAQ,CAAC;AAE1C,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC/C,QAAA,MAAM,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC;AAC1C,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO;AAEvC,QAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,EAAE;YACjE;QACF;AAEA,QAAA,MAAM,aAAa,GAAG,gBAAgB,CAAC,OAAO,CAAC;AAC/C,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7C,YAAA,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAA4B;AACzD,YAAA,IAAI,eAAe,IAAI,KAAK,EAAE;gBAC5B,OAAO,KAAK,CAAC,aAAa;YAC5B;QACF;QACA,eAAe,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,eAAe,EAAE,aAAa,CAAM;IACxE;AAEA,IAAA,OAAO,eAAe;AACxB;AAEA;;;;AAIG;AACG,SAAU,wBAAwB,CACtC,QAAa,EAAA;IAEb,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;AAC5B,QAAA,OAAO,QAAQ;IACjB;AAEA,IAAA,MAAM,eAAe,GAAQ,CAAC,GAAG,QAAQ,CAAC;AAE1C,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC/C,QAAA,MAAM,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC;AAC1C,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO;AAEvC,QAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,EAAE;YAC7D;QACF;QAEA,MAAM,aAAa,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC,MAAM,CACpD,CAAC,KAAK,KAAK,CAAC,YAAY,CAAC,KAA8B,CAAC,CACzD;QACD,eAAe,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,eAAe,EAAE,aAAa,CAAM;IACxE;AAEA,IAAA,OAAO,eAAe;AACxB;AAEA;;;;;;;;;;;;;;;;;;;;;;;;AAwBG;AACG,SAAU,sBAAsB,CAEpC,QAAa,EAAA;AACb,IAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;QACnD,UAAU,CAAC,gDAAgD,EAAE;YAC3D,KAAK,EAAE,QAAQ,CAAC,MAAM;AACvB,SAAA,CAAC;AACF,QAAA,OAAO,QAAQ;IACjB;IAEA,UAAU,CACR,yEAAyE,EACzE;QACE,KAAK,EAAE,QAAQ,CAAC,MAAM;AACvB,KAAA,CACF;;IAGD,MAAM,eAAe,GAAQ,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,KAAI;AAChD;;;;AAIkE;QAClE,MAAM,OAAO,GACX,SAAS,IAAI,GAAG,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK;AACzC,cAAE,GAAG,CAAC,OAAO;cACX,SAAS;AACf,QAAA,MAAM,OAAO,GAAI,GAA+B,CAAC,IAA0B;QAC3E,MAAM,QAAQ,GAAG,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,QAAQ;AAE7D,QAAA,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO;AAC3B,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC1B,IAAI,QAAQ,EAAE;;AAEZ,gBAAA,IAAI,wBAAwB,CAAC,OAAO,CAAC,EAAE;oBACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,KAAI;wBACrC,MAAM,GAAG,GAAG,KAAgC;AAC5C,wBAAA,IAAI,eAAe,IAAI,GAAG,EAAE;4BAC1B,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG;AACzC,4BAAA,OAAO,IAA6B;wBACtC;AACA,wBAAA,OAAO,KAAK;AACd,oBAAA,CAAC,CAAC;AACF,oBAAA,OAAO,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAM;gBACzC;AACA,gBAAA,OAAO,YAAY,CAAC,GAAG,EAAE,OAAO,CAAM;YACxC;;YAGA,MAAM,QAAQ,GAAG;iBACd,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC;AACtC,iBAAA,GAAG,CAAC,CAAC,KAAK,KAAI;gBACb,MAAM,GAAG,GAAG,KAAgC;AAC5C,gBAAA,IAAI,eAAe,IAAI,GAAG,EAAE;oBAC1B,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG;AACzC,oBAAA,OAAO,IAA6B;gBACtC;AACA,gBAAA,OAAO,KAAK;AACd,YAAA,CAAC,CAAC;YACJ,IAAI,mBAAmB,CAAC,OAAO,CAAC,IAAI,wBAAwB,CAAC,OAAO,CAAC,EAAE;AACrE,gBAAA,OAAO,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAM;YACzC;QACF;AACA,QAAA,OAAO,YAAY,CAAC,GAAG,EAAE,OAA2C,CAAM;AAC5E,IAAA,CAAC,CAAC;;AAGF,IAAA,MAAM,iBAAiB,GAAG,CAAC,OAAU,KAAa;AAChD,QAAA,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO;QAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;AAC3B,YAAA,OAAO,KAAK;QACd;AACA,QAAA,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE;AAC3B,YAAA,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI;YAC9C,IACE,IAAI,KAAK,mBAAmB;AAC5B,gBAAA,IAAI,KAAK,WAAW;AACpB,gBAAA,IAAI,KAAK,UAAU;gBACnB,IAAI,KAAK,mBAAmB,EAC5B;AACA,gBAAA,OAAO,IAAI;YACb;QACF;AACA,QAAA,OAAO,KAAK;AACd,IAAA,CAAC;AAED;;;;;AAKG;AACH,IAAA,MAAM,sBAAsB,GAAG,CAAC,OAAU,KAAc;AACtD,QAAA,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO;QAElC,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,KAAK,EAAE,EAAE;AACvD,YAAA,MAAM,UAAU,GAAG;gBACjB,EAAE,IAAI,EAAEC,kBAAY,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE;AAC7C,gBAAA,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE;aACT;AAC5B,YAAA,OAAO,YAAY,CAAC,OAAO,EAAE,UAAU,CAAM;QAC/C;AAEA,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;AACtD,YAAA,IAAI,iBAAiB,CAAC,OAAO,CAAC,EAAE;AAC9B,gBAAA,OAAO,IAAI;YACb;;AAEA,YAAA,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC/C,MAAM,IAAI,GAAI,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI;gBACtD,IAAI,IAAI,KAAKA,kBAAY,CAAC,IAAI,IAAI,IAAI,KAAK,MAAM,EAAE;oBACjD,MAAM,IAAI,GAAI,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI;oBACtD,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;AACtC,wBAAA,MAAM,UAAU,GAAG;4BACjB,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AAC7B,4BAAA,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAA2B;AAC5D,4BAAA,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC3B;AACD,wBAAA,OAAO,YAAY,CAAC,OAAO,EAAE,UAAU,CAAM;oBAC/C;gBACF;YACF;QACF;AAEA,QAAA,OAAO,IAAI;AACb,IAAA,CAAC;;;;IAKD,MAAM,gBAAgB,GAAG,CAAC;IAC1B,IAAI,OAAO,GAAG,CAAC;IAEf,KACE,IAAI,CAAC,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,EAClC,CAAC,IAAI,CAAC,IAAI,OAAO,GAAG,gBAAgB,EACpC,CAAC,EAAE,EACH;AACA,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,CAAC,CAAC;AAClC,QAAA,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO;AAElC;;;;;;;;;;;;;;AAcsC;QACtC,MAAM,QAAQ,GACZ,SAAS,IAAI,OAAO,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK;AACjD,cAAE,OAAO,CAAC,OAAO;cACf,SAAS;AACf,QAAA,MAAM,QAAQ,GAAI,OAAmC,CAAC,IAEzC;QACb,IAAI,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,QAAQ,EAAE;YAClD,eAAe,CAAC,CAAC,CAAC,GAAG,4BAA4B,CAC/C,OAA6B,CACzB;YACN;QACF;;QAGA,IAAI,UAAU,IAAI,IAAI;YAAE;QACxB,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE;YAAE;QAChE,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE;;QAG1D,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;YAAE;;QAGlE,MAAM,WAAW,GACf,SAAS,IAAI,OAAO,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK;AACjD,cAAE,OAAO,CAAC,OAAO;cACf,SAAS;AACf,QAAA,MAAM,IAAI,GAAI,OAAmC,CAAC,IAErC;QACb,MAAM,IAAI,GAAG,WAAW,KAAK,IAAI,IAAI,IAAI,KAAK,WAAW;AACzD,QAAA,IAAI,IAAI,IAAI,iBAAiB,CAAC,OAAO,CAAC,EAAE;;AAEtC,YAAA,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;gBAC7B,MAAM,oBAAoB,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,KAAI;AACrD,oBAAA,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI;oBAC9C,IAAI,IAAI,KAAKA,kBAAY,CAAC,IAAI,IAAI,IAAI,KAAK,MAAM,EAAE;AACjD,wBAAA,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI;wBAC9C,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;oBAC3C;AACA,oBAAA,OAAO,KAAK;AACd,gBAAA,CAAC,CAAC;gBACF,IAAI,CAAC,oBAAoB,EAAE;AACzB,oBAAA,UAAU,CACR,CAAA,uCAAA,EAA0C,CAAC,CAAA,2CAAA,CAA6C,CACzF;oBACD;gBACF;YACF;QACF;;AAGA,QAAA,IACE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;AACzB,YAAA,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAA0B,CAAC,CAAC,EAChE;YACA;QACF;AAEA,QAAA,MAAM,OAAO,GAAG,sBAAsB,CAAC,OAAO,CAAC;AAC/C,QAAA,IAAI,OAAO,IAAI,IAAI,EAAE;AACnB,YAAA,eAAe,CAAC,CAAC,CAAC,GAAG,OAAO;AAC5B,YAAA,OAAO,EAAE;YACT,UAAU,CACR,kCAAkC,CAAC,CAAA,EAAA,EAAK,OAAO,OAAO,CAAC,OAAO,KAAK,QAAQ,GAAG,QAAQ,GAAG,OAAO,CAAA,CAAA,CAAG,CACpG;QACH;IACF;IAEA,UAAU,CACR,kEAAkE,EAClE;AACE,QAAA,kBAAkB,EAAE,OAAO;QAC3B,aAAa,EAAE,eAAe,CAAC,MAAM;AACtC,KAAA,CACF;AAED,IAAA,OAAO,eAAe;AACxB;;;;;;;"}
+{"version":3,"file":"cache.cjs","sources":["../../../src/messages/cache.ts"],"sourcesContent":["import {\n  AIMessage,\n  BaseMessage,\n  ToolMessage,\n  HumanMessage,\n  SystemMessage,\n  MessageContentComplex,\n} from '@langchain/core/messages';\nimport type { AnthropicMessage } from '@/types/messages';\nimport type Anthropic from '@anthropic-ai/sdk';\nimport { ContentTypes } from '@/common/enum';\n\ntype MessageWithContent = {\n  content?: string | MessageContentComplex[];\n};\n\n/** Debug logger for cache operations - set ILLUMA_DEBUG_CACHE=true to enable */\nconst debugCache = (message: string, data?: unknown): void => {\n  if (process.env.ILLUMA_DEBUG_CACHE === 'true') {\n    // eslint-disable-next-line no-console\n    console.log(\n      `[Cache] ${message}`,\n      data !== undefined ? JSON.stringify(data, null, 2) : ''\n    );\n  }\n};\n\n/**\n * Deep clones a message's content to prevent mutation of the original.\n */\nfunction deepCloneContent<T extends string | MessageContentComplex[]>(\n  content: T\n): T {\n  if (typeof content === 'string') {\n    return content;\n  }\n  if (Array.isArray(content)) {\n    return content.map((block) => ({ ...block })) as T;\n  }\n  return content;\n}\n\n/**\n * Clones a message with new content. For LangChain BaseMessage instances,\n * constructs a proper class instance so that `instanceof` checks are preserved\n * in downstream code (e.g., ensureThinkingBlockInMessages).\n * For plain objects (AnthropicMessage), uses object spread.\n */\nfunction cloneMessage<T extends MessageWithContent>(\n  message: T,\n  content: string | MessageContentComplex[]\n): T {\n  if (message instanceof BaseMessage) {\n    const baseParams = {\n      content,\n      additional_kwargs: { ...message.additional_kwargs },\n      response_metadata: { ...message.response_metadata },\n      id: message.id,\n      name: message.name,\n    };\n\n    const msgType = message.getType();\n    switch (msgType) {\n    case 'ai':\n      return new AIMessage({\n        ...baseParams,\n        tool_calls: (message as unknown as AIMessage).tool_calls,\n      }) as unknown as T;\n    case 'human':\n      return new HumanMessage(baseParams) as unknown as T;\n    case 'system':\n      return new SystemMessage(baseParams) as unknown as T;\n    case 'tool':\n      return new ToolMessage({\n        ...baseParams,\n        tool_call_id: (message as unknown as ToolMessage).tool_call_id,\n      }) as unknown as T;\n    default:\n      break;\n    }\n  }\n\n  const {\n    lc_kwargs: _lc_kwargs,\n    lc_serializable: _lc_serializable,\n    lc_namespace: _lc_namespace,\n    ...rest\n  } = message as T & {\n    lc_kwargs?: unknown;\n    lc_serializable?: unknown;\n    lc_namespace?: unknown;\n  };\n\n  const cloned = { ...rest, content } as T;\n\n  // Sync lc_kwargs.content with the new content to prevent LangChain coercion issues\n  const lcKwargs = (message as Record<string, unknown>).lc_kwargs as\n    | Record<string, unknown>\n    | undefined;\n  if (lcKwargs != null) {\n    (cloned as Record<string, unknown>).lc_kwargs = {\n      ...lcKwargs,\n      content: content,\n    };\n  }\n\n  // LangChain messages don't have a direct 'role' property - derive it from getType()\n  if (\n    'getType' in message &&\n    typeof message.getType === 'function' &&\n    !('role' in cloned)\n  ) {\n    const msgType = (message as unknown as BaseMessage).getType();\n    const roleMap: Record<string, string> = {\n      human: 'user',\n      ai: 'assistant',\n      system: 'system',\n      tool: 'tool',\n    };\n    (cloned as Record<string, unknown>).role = roleMap[msgType] || msgType;\n  }\n\n  return cloned;\n}\n\n/**\n * Checks if a content block is a cache point\n */\nfunction isCachePoint(block: MessageContentComplex): boolean {\n  return 'cachePoint' in block && !('type' in block);\n}\n\n/**\n * Checks if a message's content needs cache control stripping.\n * Returns true if content has cachePoint blocks or cache_control fields.\n */\nfunction needsCacheStripping(content: MessageContentComplex[]): boolean {\n  for (let i = 0; i < content.length; i++) {\n    const block = content[i];\n    if (isCachePoint(block)) return true;\n    if ('cache_control' in block) return true;\n  }\n  return false;\n}\n\n/**\n * Checks if a message's content has Anthropic cache_control fields.\n */\nfunction hasAnthropicCacheControl(content: MessageContentComplex[]): boolean {\n  for (let i = 0; i < content.length; i++) {\n    if ('cache_control' in content[i]) return true;\n  }\n  return false;\n}\n\n/**\n * Checks if a message's content has Bedrock cachePoint blocks.\n */\nfunction hasBedrockCachePoint(content: MessageContentComplex[]): boolean {\n  for (let i = 0; i < content.length; i++) {\n    if (isCachePoint(content[i])) return true;\n  }\n  return false;\n}\n\n/**\n * Anthropic API: Adds cache control to the appropriate user messages in the payload.\n * Strips ALL existing cache control (both Anthropic and Bedrock formats) from all messages,\n * then adds fresh cache control to the last 2 user messages in a single backward pass.\n * This ensures we don't accumulate stale cache points across multiple turns.\n * Returns a new array - only clones messages that require modification.\n * @param messages - The array of message objects.\n * @returns - A new array of message objects with cache control added.\n */\nexport function addCacheControl<T extends AnthropicMessage | BaseMessage>(\n  messages: T[]\n): T[] {\n  if (!Array.isArray(messages) || messages.length < 2) {\n    return messages;\n  }\n\n  const updatedMessages: T[] = [...messages];\n  let userMessagesModified = 0;\n\n  for (let i = updatedMessages.length - 1; i >= 0; i--) {\n    const originalMessage = updatedMessages[i];\n    const content = originalMessage.content;\n    const isUserMessage =\n      ('getType' in originalMessage && originalMessage.getType() === 'human') ||\n      ('role' in originalMessage && originalMessage.role === 'user');\n\n    const hasArrayContent = Array.isArray(content);\n    const needsStripping =\n      hasArrayContent &&\n      needsCacheStripping(content as MessageContentComplex[]);\n    const needsCacheAdd =\n      userMessagesModified < 2 &&\n      isUserMessage &&\n      (typeof content === 'string' || hasArrayContent);\n\n    if (!needsStripping && !needsCacheAdd) {\n      continue;\n    }\n\n    let workingContent: MessageContentComplex[];\n\n    if (hasArrayContent) {\n      workingContent = deepCloneContent(\n        content as MessageContentComplex[]\n      ).filter((block) => !isCachePoint(block as MessageContentComplex));\n\n      for (let j = 0; j < workingContent.length; j++) {\n        const block = workingContent[j] as Record<string, unknown>;\n        if ('cache_control' in block) {\n          delete block.cache_control;\n        }\n      }\n    } else if (typeof content === 'string') {\n      workingContent = [\n        { type: 'text', text: content },\n      ] as MessageContentComplex[];\n    } else {\n      workingContent = [];\n    }\n\n    if (userMessagesModified >= 2 || !isUserMessage) {\n      updatedMessages[i] = cloneMessage(\n        originalMessage as MessageWithContent,\n        workingContent\n      ) as T;\n      continue;\n    }\n\n    for (let j = workingContent.length - 1; j >= 0; j--) {\n      const contentPart = workingContent[j];\n      if ('type' in contentPart && contentPart.type === 'text') {\n        (contentPart as Anthropic.TextBlockParam).cache_control = {\n          type: 'ephemeral',\n        };\n        userMessagesModified++;\n        break;\n      }\n    }\n\n    updatedMessages[i] = cloneMessage(\n      originalMessage as MessageWithContent,\n      workingContent\n    ) as T;\n  }\n\n  return updatedMessages;\n}\n\n/**\n * Removes all Anthropic cache_control fields from messages\n * Used when switching from Anthropic to Bedrock provider\n * Returns a new array - only clones messages that require modification.\n */\nexport function stripAnthropicCacheControl<T extends MessageWithContent>(\n  messages: T[]\n): T[] {\n  if (!Array.isArray(messages)) {\n    return messages;\n  }\n\n  const updatedMessages: T[] = [...messages];\n\n  for (let i = 0; i < updatedMessages.length; i++) {\n    const originalMessage = updatedMessages[i];\n    const content = originalMessage.content;\n\n    if (!Array.isArray(content) || !hasAnthropicCacheControl(content)) {\n      continue;\n    }\n\n    const clonedContent = deepCloneContent(content);\n    for (let j = 0; j < clonedContent.length; j++) {\n      const block = clonedContent[j] as Record<string, unknown>;\n      if ('cache_control' in block) {\n        delete block.cache_control;\n      }\n    }\n    updatedMessages[i] = cloneMessage(originalMessage, clonedContent) as T;\n  }\n\n  return updatedMessages;\n}\n\n/**\n * Removes all Bedrock cachePoint blocks from messages\n * Used when switching from Bedrock to Anthropic provider\n * Returns a new array - only clones messages that require modification.\n */\nexport function stripBedrockCacheControl<T extends MessageWithContent>(\n  messages: T[]\n): T[] {\n  if (!Array.isArray(messages)) {\n    return messages;\n  }\n\n  const updatedMessages: T[] = [...messages];\n\n  for (let i = 0; i < updatedMessages.length; i++) {\n    const originalMessage = updatedMessages[i];\n    const content = originalMessage.content;\n\n    if (!Array.isArray(content) || !hasBedrockCachePoint(content)) {\n      continue;\n    }\n\n    const clonedContent = deepCloneContent(content).filter(\n      (block) => !isCachePoint(block as MessageContentComplex)\n    );\n    updatedMessages[i] = cloneMessage(originalMessage, clonedContent) as T;\n  }\n\n  return updatedMessages;\n}\n\n/**\n * Adds Bedrock Converse API cache points using \"Stable Prefix Caching\" strategy.\n *\n * STRATEGY: Place cache point after the LAST ASSISTANT message only.\n * This ensures the prefix (everything before the cache point) remains STABLE\n * as the conversation grows, maximizing cache hits.\n *\n * Why this works:\n * - System message has its own cachePoint (added in AgentContext)\n * - Tools have their own cachePoint (added in IllumaBedrockConverse)\n * - Conversation history grows, but the PREFIX stays the same\n * - Only the NEW user message is uncached (it's always different)\n *\n * Example conversation flow:\n * Request 1: [System+cachePoint][Tools+cachePoint][User1] → No conversation cache yet\n * Request 2: [System][Tools][User1][Assistant1+cachePoint][User2] → Cache User1+Assistant1\n * Request 3: [System][Tools][User1][Assistant1][User2][Assistant2+cachePoint][User3]\n *            → Cache reads User1+A1+User2+A2, cache writes new portion\n *\n * Claude's \"Simplified Cache Management\" automatically looks back up to 20 content\n * blocks from the cache checkpoint to find the longest matching prefix.\n *\n * @param messages - The array of message objects (excluding system message).\n * @returns - The updated array with a single cache point after the last assistant message.\n */\nexport function addBedrockCacheControl<\n  T extends Partial<BaseMessage> & MessageWithContent,\n>(messages: T[]): T[] {\n  if (!Array.isArray(messages) || messages.length < 1) {\n    debugCache('addBedrockCacheControl: Skipping - no messages', {\n      count: messages.length,\n    });\n    return messages;\n  }\n\n  debugCache(\n    'addBedrockCacheControl: Processing messages with stable prefix strategy',\n    {\n      count: messages.length,\n    }\n  );\n\n  // Clone messages to avoid mutating originals\n  const updatedMessages: T[] = messages.map((msg) => {\n    const content = msg.content;\n    if (Array.isArray(content)) {\n      // Strip existing cachePoint blocks and Anthropic-style cache_control\n      const stripped = content\n        .filter((block) => !isCachePoint(block))\n        .map((block) => {\n          const rec = block as Record<string, unknown>;\n          if ('cache_control' in rec) {\n            const { cache_control: _, ...rest } = rec;\n            return rest as MessageContentComplex;\n          }\n          return block;\n        });\n      if (needsCacheStripping(content) || hasAnthropicCacheControl(content)) {\n        return cloneMessage(msg, stripped) as T;\n      }\n    }\n    return cloneMessage(msg, content as string | MessageContentComplex[]) as T;\n  });\n\n  // Helper function to check if a message contains reasoning/thinking blocks\n  const hasReasoningBlock = (message: T): boolean => {\n    const content = message.content;\n    if (!Array.isArray(content)) {\n      return false;\n    }\n    for (const block of content) {\n      const type = (block as { type?: string }).type;\n      if (\n        type === 'reasoning_content' ||\n        type === 'reasoning' ||\n        type === 'thinking' ||\n        type === 'redacted_thinking'\n      ) {\n        return true;\n      }\n    }\n    return false;\n  };\n\n  /**\n   * Helper to add a cachePoint to a message's content.\n   * For strings: wraps into [{type: 'text', text}, {cachePoint}]\n   * For arrays: inserts cachePoint after the last non-whitespace text block\n   * Returns the new message or null if no suitable insertion point.\n   */\n  const addCachePointToMessage = (message: T): T | null => {\n    const msgContent = message.content;\n\n    if (typeof msgContent === 'string' && msgContent !== '') {\n      const newContent = [\n        { type: ContentTypes.TEXT, text: msgContent },\n        { cachePoint: { type: 'default' } },\n      ] as MessageContentComplex[];\n      return cloneMessage(message, newContent) as T;\n    }\n\n    if (Array.isArray(msgContent) && msgContent.length > 0) {\n      if (hasReasoningBlock(message)) {\n        return null;\n      }\n      // Find the last text block and insert cache point after it\n      for (let j = msgContent.length - 1; j >= 0; j--) {\n        const type = (msgContent[j] as { type?: string }).type;\n        if (type === ContentTypes.TEXT || type === 'text') {\n          const text = (msgContent[j] as { text?: string }).text;\n          if (text != null && text.trim() !== '') {\n            const newContent = [\n              ...msgContent.slice(0, j + 1),\n              { cachePoint: { type: 'default' } } as MessageContentComplex,\n              ...msgContent.slice(j + 1),\n            ];\n            return cloneMessage(message, newContent) as T;\n          }\n        }\n      }\n    }\n\n    return null;\n  };\n\n  // Add cache points to the last 2 messages (from the end) that have eligible content.\n  // This mirrors Anthropic's two-breakpoint strategy for Bedrock's cache API.\n  // Skip messages with only whitespace, empty content, or reasoning blocks.\n  const MAX_CACHE_POINTS = 2;\n  let applied = 0;\n\n  for (\n    let i = updatedMessages.length - 1;\n    i >= 0 && applied < MAX_CACHE_POINTS;\n    i--\n  ) {\n    const message = updatedMessages[i];\n    const msgContent = message.content;\n\n    // Skip empty/whitespace-only content\n    if (msgContent == null) continue;\n    if (typeof msgContent === 'string' && msgContent.trim() === '') continue;\n    if (Array.isArray(msgContent) && msgContent.length === 0) continue;\n\n    // Skip non-string, non-array content (e.g., number, object without type)\n    if (typeof msgContent !== 'string' && !Array.isArray(msgContent)) continue;\n\n    // Skip AI messages with only whitespace text and reasoning blocks (tool-call scenario)\n    const messageType =\n      'getType' in message && typeof message.getType === 'function'\n        ? message.getType()\n        : 'unknown';\n    const role = (message as Record<string, unknown>).role as\n      | string\n      | undefined;\n    const isAi = messageType === 'ai' || role === 'assistant';\n    if (isAi && hasReasoningBlock(message)) {\n      // Check if all text blocks are whitespace-only\n      if (Array.isArray(msgContent)) {\n        const hasNonWhitespaceText = msgContent.some((block) => {\n          const type = (block as { type?: string }).type;\n          if (type === ContentTypes.TEXT || type === 'text') {\n            const text = (block as { text?: string }).text;\n            return text != null && text.trim() !== '';\n          }\n          return false;\n        });\n        if (!hasNonWhitespaceText) {\n          debugCache(\n            `⚠️ Message cachePoint SKIPPED at index ${i} (AI with whitespace-only text + reasoning)`\n          );\n          continue;\n        }\n      }\n    }\n\n    // Skip messages that already have cache points (multi-agent scenarios)\n    if (\n      Array.isArray(msgContent) &&\n      msgContent.some((b) => isCachePoint(b as MessageContentComplex))\n    ) {\n      continue;\n    }\n\n    const updated = addCachePointToMessage(message);\n    if (updated != null) {\n      updatedMessages[i] = updated;\n      applied++;\n      debugCache(\n        `📍 Message cachePoint at index ${i} (${typeof message.content === 'string' ? 'string' : 'array'})`\n      );\n    }\n  }\n\n  debugCache(\n    'addBedrockCacheControl: Complete - stable prefix caching applied',\n    {\n      appliedCachePoints: applied,\n      totalMessages: updatedMessages.length,\n    }\n  );\n\n  return updatedMessages;\n}\n"],"names":["BaseMessage","AIMessage","HumanMessage","SystemMessage","ToolMessage","ContentTypes"],"mappings":";;;;;AAgBA;AACA,MAAM,UAAU,GAAG,CAAC,OAAe,EAAE,IAAc,KAAU;IAC3D,IAAI,OAAO,CAAC,GAAG,CAAC,kBAAkB,KAAK,MAAM,EAAE;;AAE7C,QAAA,OAAO,CAAC,GAAG,CACT,CAAA,QAAA,EAAW,OAAO,CAAA,CAAE,EACpB,IAAI,KAAK,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CACxD;IACH;AACF,CAAC;AAED;;AAEG;AACH,SAAS,gBAAgB,CACvB,OAAU,EAAA;AAEV,IAAA,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AAC/B,QAAA,OAAO,OAAO;IAChB;AACA,IAAA,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;AAC1B,QAAA,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,CAAM;IACpD;AACA,IAAA,OAAO,OAAO;AAChB;AAEA;;;;;AAKG;AACH,SAAS,YAAY,CACnB,OAAU,EACV,OAAyC,EAAA;AAEzC,IAAA,IAAI,OAAO,YAAYA,oBAAW,EAAE;AAClC,QAAA,MAAM,UAAU,GAAG;YACjB,OAAO;AACP,YAAA,iBAAiB,EAAE,EAAE,GAAG,OAAO,CAAC,iBAAiB,EAAE;AACnD,YAAA,iBAAiB,EAAE,EAAE,GAAG,OAAO,CAAC,iBAAiB,EAAE;YACnD,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,IAAI,EAAE,OAAO,CAAC,IAAI;SACnB;AAED,QAAA,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE;QACjC,QAAQ,OAAO;AACf,YAAA,KAAK,IAAI;gBACP,OAAO,IAAIC,kBAAS,CAAC;AACnB,oBAAA,GAAG,UAAU;oBACb,UAAU,EAAG,OAAgC,CAAC,UAAU;AACzD,iBAAA,CAAiB;AACpB,YAAA,KAAK,OAAO;AACV,gBAAA,OAAO,IAAIC,qBAAY,CAAC,UAAU,CAAiB;AACrD,YAAA,KAAK,QAAQ;AACX,gBAAA,OAAO,IAAIC,sBAAa,CAAC,UAAU,CAAiB;AACtD,YAAA,KAAK,MAAM;gBACT,OAAO,IAAIC,oBAAW,CAAC;AACrB,oBAAA,GAAG,UAAU;oBACb,YAAY,EAAG,OAAkC,CAAC,YAAY;AAC/D,iBAAA,CAAiB;;IAItB;AAEA,IAAA,MAAM,EACJ,SAAS,EAAE,UAAU,EACrB,eAAe,EAAE,gBAAgB,EACjC,YAAY,EAAE,aAAa,EAC3B,GAAG,IAAI,EACR,GAAG,OAIH;IAED,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,EAAE,OAAO,EAAO;;AAGxC,IAAA,MAAM,QAAQ,GAAI,OAAmC,CAAC,SAEzC;AACb,IAAA,IAAI,QAAQ,IAAI,IAAI,EAAE;QACnB,MAAkC,CAAC,SAAS,GAAG;AAC9C,YAAA,GAAG,QAAQ;AACX,YAAA,OAAO,EAAE,OAAO;SACjB;IACH;;IAGA,IACE,SAAS,IAAI,OAAO;AACpB,QAAA,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU;AACrC,QAAA,EAAE,MAAM,IAAI,MAAM,CAAC,EACnB;AACA,QAAA,MAAM,OAAO,GAAI,OAAkC,CAAC,OAAO,EAAE;AAC7D,QAAA,MAAM,OAAO,GAA2B;AACtC,YAAA,KAAK,EAAE,MAAM;AACb,YAAA,EAAE,EAAE,WAAW;AACf,YAAA,MAAM,EAAE,QAAQ;AAChB,YAAA,IAAI,EAAE,MAAM;SACb;QACA,MAAkC,CAAC,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO;IACxE;AAEA,IAAA,OAAO,MAAM;AACf;AAEA;;AAEG;AACH,SAAS,YAAY,CAAC,KAA4B,EAAA;IAChD,OAAO,YAAY,IAAI,KAAK,IAAI,EAAE,MAAM,IAAI,KAAK,CAAC;AACpD;AAEA;;;AAGG;AACH,SAAS,mBAAmB,CAAC,OAAgC,EAAA;AAC3D,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,QAAA,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC;QACxB,IAAI,YAAY,CAAC,KAAK,CAAC;AAAE,YAAA,OAAO,IAAI;QACpC,IAAI,eAAe,IAAI,KAAK;AAAE,YAAA,OAAO,IAAI;IAC3C;AACA,IAAA,OAAO,KAAK;AACd;AAEA;;AAEG;AACH,SAAS,wBAAwB,CAAC,OAAgC,EAAA;AAChE,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,QAAA,IAAI,eAAe,IAAI,OAAO,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI;IAChD;AACA,IAAA,OAAO,KAAK;AACd;AAEA;;AAEG;AACH,SAAS,oBAAoB,CAAC,OAAgC,EAAA;AAC5D,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,QAAA,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI;IAC3C;AACA,IAAA,OAAO,KAAK;AACd;AAEA;;;;;;;;AAQG;AACG,SAAU,eAAe,CAC7B,QAAa,EAAA;AAEb,IAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;AACnD,QAAA,OAAO,QAAQ;IACjB;AAEA,IAAA,MAAM,eAAe,GAAQ,CAAC,GAAG,QAAQ,CAAC;IAC1C,IAAI,oBAAoB,GAAG,CAAC;AAE5B,IAAA,KAAK,IAAI,CAAC,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACpD,QAAA,MAAM,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC;AAC1C,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO;AACvC,QAAA,MAAM,aAAa,GACjB,CAAC,SAAS,IAAI,eAAe,IAAI,eAAe,CAAC,OAAO,EAAE,KAAK,OAAO;aACrE,MAAM,IAAI,eAAe,IAAI,eAAe,CAAC,IAAI,KAAK,MAAM,CAAC;QAEhE,MAAM,eAAe,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;QAC9C,MAAM,cAAc,GAClB,eAAe;YACf,mBAAmB,CAAC,OAAkC,CAAC;AACzD,QAAA,MAAM,aAAa,GACjB,oBAAoB,GAAG,CAAC;YACxB,aAAa;AACb,aAAC,OAAO,OAAO,KAAK,QAAQ,IAAI,eAAe,CAAC;AAElD,QAAA,IAAI,CAAC,cAAc,IAAI,CAAC,aAAa,EAAE;YACrC;QACF;AAEA,QAAA,IAAI,cAAuC;QAE3C,IAAI,eAAe,EAAE;AACnB,YAAA,cAAc,GAAG,gBAAgB,CAC/B,OAAkC,CACnC,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC,YAAY,CAAC,KAA8B,CAAC,CAAC;AAElE,YAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC9C,gBAAA,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAA4B;AAC1D,gBAAA,IAAI,eAAe,IAAI,KAAK,EAAE;oBAC5B,OAAO,KAAK,CAAC,aAAa;gBAC5B;YACF;QACF;AAAO,aAAA,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AACtC,YAAA,cAAc,GAAG;AACf,gBAAA,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE;aACL;QAC9B;aAAO;YACL,cAAc,GAAG,EAAE;QACrB;AAEA,QAAA,IAAI,oBAAoB,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;YAC/C,eAAe,CAAC,CAAC,CAAC,GAAG,YAAY,CAC/B,eAAqC,EACrC,cAAc,CACV;YACN;QACF;AAEA,QAAA,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACnD,YAAA,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC;YACrC,IAAI,MAAM,IAAI,WAAW,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM,EAAE;gBACvD,WAAwC,CAAC,aAAa,GAAG;AACxD,oBAAA,IAAI,EAAE,WAAW;iBAClB;AACD,gBAAA,oBAAoB,EAAE;gBACtB;YACF;QACF;QAEA,eAAe,CAAC,CAAC,CAAC,GAAG,YAAY,CAC/B,eAAqC,EACrC,cAAc,CACV;IACR;AAEA,IAAA,OAAO,eAAe;AACxB;AAEA;;;;AAIG;AACG,SAAU,0BAA0B,CACxC,QAAa,EAAA;IAEb,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;AAC5B,QAAA,OAAO,QAAQ;IACjB;AAEA,IAAA,MAAM,eAAe,GAAQ,CAAC,GAAG,QAAQ,CAAC;AAE1C,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC/C,QAAA,MAAM,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC;AAC1C,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO;AAEvC,QAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,EAAE;YACjE;QACF;AAEA,QAAA,MAAM,aAAa,GAAG,gBAAgB,CAAC,OAAO,CAAC;AAC/C,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7C,YAAA,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAA4B;AACzD,YAAA,IAAI,eAAe,IAAI,KAAK,EAAE;gBAC5B,OAAO,KAAK,CAAC,aAAa;YAC5B;QACF;QACA,eAAe,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,eAAe,EAAE,aAAa,CAAM;IACxE;AAEA,IAAA,OAAO,eAAe;AACxB;AAEA;;;;AAIG;AACG,SAAU,wBAAwB,CACtC,QAAa,EAAA;IAEb,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;AAC5B,QAAA,OAAO,QAAQ;IACjB;AAEA,IAAA,MAAM,eAAe,GAAQ,CAAC,GAAG,QAAQ,CAAC;AAE1C,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC/C,QAAA,MAAM,eAAe,GAAG,eAAe,CAAC,CAAC,CAAC;AAC1C,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,OAAO;AAEvC,QAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,EAAE;YAC7D;QACF;QAEA,MAAM,aAAa,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC,MAAM,CACpD,CAAC,KAAK,KAAK,CAAC,YAAY,CAAC,KAA8B,CAAC,CACzD;QACD,eAAe,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,eAAe,EAAE,aAAa,CAAM;IACxE;AAEA,IAAA,OAAO,eAAe;AACxB;AAEA;;;;;;;;;;;;;;;;;;;;;;;;AAwBG;AACG,SAAU,sBAAsB,CAEpC,QAAa,EAAA;AACb,IAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;QACnD,UAAU,CAAC,gDAAgD,EAAE;YAC3D,KAAK,EAAE,QAAQ,CAAC,MAAM;AACvB,SAAA,CAAC;AACF,QAAA,OAAO,QAAQ;IACjB;IAEA,UAAU,CACR,yEAAyE,EACzE;QACE,KAAK,EAAE,QAAQ,CAAC,MAAM;AACvB,KAAA,CACF;;IAGD,MAAM,eAAe,GAAQ,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,KAAI;AAChD,QAAA,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO;AAC3B,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;;YAE1B,MAAM,QAAQ,GAAG;iBACd,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC;AACtC,iBAAA,GAAG,CAAC,CAAC,KAAK,KAAI;gBACb,MAAM,GAAG,GAAG,KAAgC;AAC5C,gBAAA,IAAI,eAAe,IAAI,GAAG,EAAE;oBAC1B,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG;AACzC,oBAAA,OAAO,IAA6B;gBACtC;AACA,gBAAA,OAAO,KAAK;AACd,YAAA,CAAC,CAAC;YACJ,IAAI,mBAAmB,CAAC,OAAO,CAAC,IAAI,wBAAwB,CAAC,OAAO,CAAC,EAAE;AACrE,gBAAA,OAAO,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAM;YACzC;QACF;AACA,QAAA,OAAO,YAAY,CAAC,GAAG,EAAE,OAA2C,CAAM;AAC5E,IAAA,CAAC,CAAC;;AAGF,IAAA,MAAM,iBAAiB,GAAG,CAAC,OAAU,KAAa;AAChD,QAAA,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO;QAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;AAC3B,YAAA,OAAO,KAAK;QACd;AACA,QAAA,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE;AAC3B,YAAA,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI;YAC9C,IACE,IAAI,KAAK,mBAAmB;AAC5B,gBAAA,IAAI,KAAK,WAAW;AACpB,gBAAA,IAAI,KAAK,UAAU;gBACnB,IAAI,KAAK,mBAAmB,EAC5B;AACA,gBAAA,OAAO,IAAI;YACb;QACF;AACA,QAAA,OAAO,KAAK;AACd,IAAA,CAAC;AAED;;;;;AAKG;AACH,IAAA,MAAM,sBAAsB,GAAG,CAAC,OAAU,KAAc;AACtD,QAAA,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO;QAElC,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,KAAK,EAAE,EAAE;AACvD,YAAA,MAAM,UAAU,GAAG;gBACjB,EAAE,IAAI,EAAEC,kBAAY,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE;AAC7C,gBAAA,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE;aACT;AAC5B,YAAA,OAAO,YAAY,CAAC,OAAO,EAAE,UAAU,CAAM;QAC/C;AAEA,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;AACtD,YAAA,IAAI,iBAAiB,CAAC,OAAO,CAAC,EAAE;AAC9B,gBAAA,OAAO,IAAI;YACb;;AAEA,YAAA,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC/C,MAAM,IAAI,GAAI,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI;gBACtD,IAAI,IAAI,KAAKA,kBAAY,CAAC,IAAI,IAAI,IAAI,KAAK,MAAM,EAAE;oBACjD,MAAM,IAAI,GAAI,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI;oBACtD,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;AACtC,wBAAA,MAAM,UAAU,GAAG;4BACjB,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AAC7B,4BAAA,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAA2B;AAC5D,4BAAA,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC3B;AACD,wBAAA,OAAO,YAAY,CAAC,OAAO,EAAE,UAAU,CAAM;oBAC/C;gBACF;YACF;QACF;AAEA,QAAA,OAAO,IAAI;AACb,IAAA,CAAC;;;;IAKD,MAAM,gBAAgB,GAAG,CAAC;IAC1B,IAAI,OAAO,GAAG,CAAC;IAEf,KACE,IAAI,CAAC,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,EAClC,CAAC,IAAI,CAAC,IAAI,OAAO,GAAG,gBAAgB,EACpC,CAAC,EAAE,EACH;AACA,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,CAAC,CAAC;AAClC,QAAA,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO;;QAGlC,IAAI,UAAU,IAAI,IAAI;YAAE;QACxB,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE;YAAE;QAChE,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE;;QAG1D,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;YAAE;;QAGlE,MAAM,WAAW,GACf,SAAS,IAAI,OAAO,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK;AACjD,cAAE,OAAO,CAAC,OAAO;cACf,SAAS;AACf,QAAA,MAAM,IAAI,GAAI,OAAmC,CAAC,IAErC;QACb,MAAM,IAAI,GAAG,WAAW,KAAK,IAAI,IAAI,IAAI,KAAK,WAAW;AACzD,QAAA,IAAI,IAAI,IAAI,iBAAiB,CAAC,OAAO,CAAC,EAAE;;AAEtC,YAAA,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;gBAC7B,MAAM,oBAAoB,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,KAAI;AACrD,oBAAA,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI;oBAC9C,IAAI,IAAI,KAAKA,kBAAY,CAAC,IAAI,IAAI,IAAI,KAAK,MAAM,EAAE;AACjD,wBAAA,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI;wBAC9C,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;oBAC3C;AACA,oBAAA,OAAO,KAAK;AACd,gBAAA,CAAC,CAAC;gBACF,IAAI,CAAC,oBAAoB,EAAE;AACzB,oBAAA,UAAU,CACR,CAAA,uCAAA,EAA0C,CAAC,CAAA,2CAAA,CAA6C,CACzF;oBACD;gBACF;YACF;QACF;;AAGA,QAAA,IACE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;AACzB,YAAA,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAA0B,CAAC,CAAC,EAChE;YACA;QACF;AAEA,QAAA,MAAM,OAAO,GAAG,sBAAsB,CAAC,OAAO,CAAC;AAC/C,QAAA,IAAI,OAAO,IAAI,IAAI,EAAE;AACnB,YAAA,eAAe,CAAC,CAAC,CAAC,GAAG,OAAO;AAC5B,YAAA,OAAO,EAAE;YACT,UAAU,CACR,kCAAkC,CAAC,CAAA,EAAA,EAAK,OAAO,OAAO,CAAC,OAAO,KAAK,QAAQ,GAAG,QAAQ,GAAG,OAAO,CAAA,CAAA,CAAG,CACpG;QACH;IACF;IAEA,UAAU,CACR,kEAAkE,EAClE;AACE,QAAA,kBAAkB,EAAE,OAAO;QAC3B,aAAa,EAAE,eAAe,CAAC,MAAM;AACtC,KAAA,CACF;AAED,IAAA,OAAO,eAAe;AACxB;;;;;;;"}