@maximem/synap-js-sdk 0.4.0 → 0.4.2

package/bin/synap-js-sdk.js

@@ -3,7 +3,7 @@
  * Compatibility shim.
  *
  * `npx synap-js-sdk setup` used to build a Python virtualenv and install the
- * Python SDK into it. Since 1.0 the SDK is native TypeScript, so there is
+ * Python SDK into it. Since 0.4 the SDK is native TypeScript, so there is
  * nothing to set up.
  *
  * The command is kept, and kept exiting 0, because it appears in published
@@ -17,7 +17,7 @@
 const [, , command] = process.argv;
 
 const NOTE = `
-@maximem/synap-js-sdk 1.x is a native TypeScript SDK. It does not use Python,
+@maximem/synap-js-sdk 0.4+ is a native TypeScript SDK. It does not use Python,
 so there is no setup step and this command does nothing.
 
 If you are upgrading from 0.3.x:
@@ -37,7 +37,7 @@ switch (command) {
     break;
   case '--version':
   case '-v':
-    console.log(process.env['npm_package_version'] ?? '1.x');
+    console.log(process.env['npm_package_version'] ?? '0.4+');
     break;
   default:
     console.log(`Unknown command: ${command}\n\n${NOTE}`);

package/dist/anticipation-cache-ARYEEKMU.cjs

@@ -0,0 +1,10 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});
+
+
+var _chunkRB57I2IQcjs = require('./chunk-RB57I2IQ.cjs');
+require('./chunk-ZKOJDUN4.cjs');
+
+
+
+exports.ANY_SCOPE = _chunkRB57I2IQcjs.ANY_SCOPE; exports.AnticipationCache = _chunkRB57I2IQcjs.AnticipationCache;
+//# sourceMappingURL=anticipation-cache-ARYEEKMU.cjs.map

package/dist/{anticipation-cache-JBZHTJ3O.cjs.map → anticipation-cache-ARYEEKMU.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["/Users/anish/maximemai/maximem_synap/synap/sdk/js/dist/anticipation-cache-JBZHTJ3O.cjs"],"names":[],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACA;AACF,iHAAC","file":"/Users/anish/maximemai/maximem_synap/synap/sdk/js/dist/anticipation-cache-JBZHTJ3O.cjs"}
+{"version":3,"sources":["/Users/anish/maximemai/maximem_synap/synap/sdk/js/dist/anticipation-cache-ARYEEKMU.cjs"],"names":[],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACA;AACF,iHAAC","file":"/Users/anish/maximemai/maximem_synap/synap/sdk/js/dist/anticipation-cache-ARYEEKMU.cjs"}

package/dist/{anticipation-cache-BgkqcTPJ.d.cts → anticipation-cache-BMVF5sXb.d.cts}

@@ -110,6 +110,7 @@ interface AnticipationCacheOptions {
     onLookup?: (telemetry: LookupTelemetry) => void;
 }
 declare class AnticipationCache {
+    #private;
     private readonly ttlSeconds;
     private readonly maxBundles;
     private readonly now;
@@ -147,6 +148,15 @@ declare class AnticipationCache {
      * contract, which caps lookup telemetry rather than this snapshot.
      */
     snapshot(): AnticipationCacheSnapshot;
+    /**
+     * The freshest `user_summary` bundle for this entity, or null.
+     *
+     * `entityId` is REQUIRED, and a missing one refuses the lookup rather than
+     * falling back to the freshest summary across all users. Python hardened this
+     * for exactly that reason: the permissive version could splice user A's
+     * summary into user B's response on the conversation-scope path.
+     */
+    lookupUserSummary(entityId: string | null | undefined): Record<string, unknown> | null;
     /**
      * Drop every bundle belonging to one conversation.
      *

package/dist/{anticipation-cache-BgkqcTPJ.d.ts → anticipation-cache-BMVF5sXb.d.ts}

@@ -110,6 +110,7 @@ interface AnticipationCacheOptions {
     onLookup?: (telemetry: LookupTelemetry) => void;
 }
 declare class AnticipationCache {
+    #private;
     private readonly ttlSeconds;
     private readonly maxBundles;
     private readonly now;
@@ -147,6 +148,15 @@ declare class AnticipationCache {
      * contract, which caps lookup telemetry rather than this snapshot.
      */
     snapshot(): AnticipationCacheSnapshot;
+    /**
+     * The freshest `user_summary` bundle for this entity, or null.
+     *
+     * `entityId` is REQUIRED, and a missing one refuses the lookup rather than
+     * falling back to the freshest summary across all users. Python hardened this
+     * for exactly that reason: the permissive version could splice user A's
+     * summary into user B's response on the conversation-scope path.
+     */
+    lookupUserSummary(entityId: string | null | undefined): Record<string, unknown> | null;
     /**
      * Drop every bundle belonging to one conversation.
      *

package/dist/{anticipation-cache-D5YHEPV3.js → anticipation-cache-H7HEVWQC.js}

@@ -1,10 +1,10 @@
 import {
   ANY_SCOPE,
   AnticipationCache
-} from "./chunk-TCEP5OVR.js";
+} from "./chunk-6LDUDKHS.js";
 import "./chunk-QBCVMPGK.js";
 export {
   ANY_SCOPE,
   AnticipationCache
 };
-//# sourceMappingURL=anticipation-cache-D5YHEPV3.js.map
+//# sourceMappingURL=anticipation-cache-H7HEVWQC.js.map

package/dist/{chunk-TCEP5OVR.js → chunk-6LDUDKHS.js}

@@ -675,6 +675,38 @@ var AnticipationCache = class {
       bundles
     };
   }
+  /**
+   * The freshest `user_summary` bundle for this entity, or null.
+   *
+   * `entityId` is REQUIRED, and a missing one refuses the lookup rather than
+   * falling back to the freshest summary across all users. Python hardened this
+   * for exactly that reason: the permissive version could splice user A's
+   * summary into user B's response on the conversation-scope path.
+   */
+  lookupUserSummary(entityId) {
+    if (!entityId) return null;
+    this.evictExpired();
+    let freshest = null;
+    for (const entry of this.entries.values()) {
+      if (entry.bundleType !== "user_summary") continue;
+      if (entry.entityId !== entityId && entry.entityId !== ANY_SCOPE) continue;
+      if (freshest === null || entry.storedAt > freshest.storedAt) freshest = entry;
+    }
+    if (freshest === null) return null;
+    if (!getEnvFlag("SYNAP_SDK_CACHE_HONOR_TTL_HINT")) {
+      freshest.storedAt = this.now();
+    }
+    return this.#bundleFor(freshest.bundleId);
+  }
+  /** Rebuild a bundle's items_by_type from the flat item records. */
+  #bundleFor(bundleId) {
+    const itemsByType = {};
+    for (const record of this.items) {
+      if (record.bundleId !== bundleId) continue;
+      (itemsByType[record.itemType] ??= []).push(record.itemDict);
+    }
+    return { bundle_id: bundleId, items_by_type: itemsByType };
+  }
   /**
    * Drop every bundle belonging to one conversation.
    *
@@ -797,4 +829,4 @@ export {
   ANY_SCOPE,
   AnticipationCache
 };
-//# sourceMappingURL=chunk-TCEP5OVR.js.map
+//# sourceMappingURL=chunk-6LDUDKHS.js.map

package/dist/{chunk-TCEP5OVR.js.map → chunk-6LDUDKHS.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/behavior/anticipation.json","../src/behavior/contract.ts","../src/cache/bm25.ts","../src/context/anticipation-cache.ts"],"sourcesContent":["{\n  \"$comment\": \"SOURCE OF TRUTH for anticipation-cache behavior, shared by the Python and JS/TS SDKs. Do not duplicate these values into either SDK's source. See ../README.md. Regexes are restricted to the intersection of Python 're' and ECMAScript; both SDKs have a parity test.\",\n  \"version\": 1,\n  \"recall_bypass\": {\n    \"note\": \"WS4 of the playground query-hygiene plan. A recall-shaped question never serves from the anticipation cache. Asymmetric cost is why: a stale false-hit makes the agent answer 'I don't see that' while the store holds the fact (the BZQR6J cross-session failure), whereas bypassing costs only cold-fetch latency on a turn where the user already expects a lookup. Stem coverage cannot gate this \\u2014 false hits were measured at coverage=1.00. Ties break toward INCLUDING a pattern.\",\n    \"env_flag\": \"SYNAP_SDK_CACHE_RECALL_BYPASS\",\n    \"default\": false,\n    \"patterns\": [\n      {\n        \"pattern\": \"\\\\bremind me\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4, playground query-hygiene plan).\"\n      },\n      {\n        \"pattern\": \"\\\\bon file\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\b(your|my|the) records\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bdo you (have|know|remember|recall|see)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhat (do|did) (i|you) (say|tell|mention|have)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhat('s| is) my\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhere (am i|do i live)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bhow long have i\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhich of my\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhat .{0,40}\\\\b(again|earlier|last time|previously|yesterday)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4). 'again' alone is deliberately NOT a marker: 'book me a ride again' is a task query, not a recall query.\"\n      },\n      {\n        \"pattern\": \"\\\\bwill you use to (contact|reach|notify)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\b(confirm|verify|double.?check)\\\\b.{0,40}\\\\bmy\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11: 'can you confirm my email address?' served a stale bundle. Also catches 'confirm my booking' \\u2014 an intentional over-match, costing one cloud fetch.\"\n      },\n      {\n        \"pattern\": \"\\\\b(linked to|associated with|registered (to|on|with)) my\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11: 'what name is linked to my Uber account?' served a stale bundle.\"\n      },\n      {\n        \"pattern\": \"\\\\b(best|preferred) way to (reach|contact|update|notify) me\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11: 'best way to contact me with updates' served a stale bundle.\"\n      },\n      {\n        \"pattern\": \"\\\\bhow (do|will|can|should) you (reach|contact|notify) me\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11, sibling phrasing of the above.\"\n      },\n      {\n        \"pattern\": \"\\\\bwhich .{0,40}\\\\b(are|will) you (going to )?(use|using)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11: 'which email are you going to use?' served a stale bundle.\"\n      },\n      {\n        \"pattern\": \"\\\\bon (my|the) account\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11.\"\n      }\n    ]\n  },\n  \"thresholds\": {\n    \"bm25\": {\n      \"value\": 1.5,\n      \"note\": \"Nominal threshold. The value actually applied is derived per query: max(effective_floor, min(bm25, query_token_scale * len(query_tokens))). Short queries cannot reach the nominal score, so holding them to it would miss every time.\"\n    },\n    \"novel_term\": {\n      \"value\": 0.45,\n      \"note\": \"Fraction of query stems absent from the cached corpus that forces a miss.\"\n    },\n    \"min_corpus_for_novel_gate\": {\n      \"value\": 200,\n      \"note\": \"The novel-term gate is meaningless on a small corpus, where the ratio is dominated by ordinary English word forms. Measured: a fresh playground conversation reaches ~60 stems after the first push and would trip the 0.45 gate on essentially every second-turn query. 200 means the gate engages once a customer has ~3-4 typical bundles cached.\"\n    },\n    \"effective_floor\": {\n      \"value\": 0.6,\n      \"note\": \"Lower bound on the derived per-query threshold. Below this, BM25 stops discriminating.\"\n    },\n    \"query_token_scale\": {\n      \"value\": 0.3,\n      \"note\": \"Scales the threshold down for short queries: 0.3 points of score per query token.\"\n    }\n  },\n  \"bm25\": {\n    \"k1\": 1.5,\n    \"b\": 0.75,\n    \"idf_floor\": 0.5,\n    \"min_token_len\": 2,\n    \"min_stem_len\": 4,\n    \"suffixes\": [\n      \"ences\",\n      \"ances\",\n      \"ation\",\n      \"tion\",\n      \"sion\",\n      \"ence\",\n      \"ance\",\n      \"ness\",\n      \"ment\",\n      \"able\",\n      \"ible\",\n      \"ical\",\n      \"ally\",\n      \"ies\",\n      \"ive\",\n      \"ful\",\n      \"ous\",\n      \"ing\",\n      \"ary\",\n      \"ly\",\n      \"ed\",\n      \"es\",\n      \"s\"\n    ],\n    \"stop_words\": [\n      \"a\",\n      \"about\",\n      \"after\",\n      \"an\",\n      \"and\",\n      \"are\",\n      \"at\",\n      \"be\",\n      \"been\",\n      \"before\",\n      \"being\",\n      \"but\",\n      \"by\",\n      \"can\",\n      \"could\",\n      \"did\",\n      \"do\",\n      \"does\",\n      \"for\",\n      \"from\",\n      \"had\",\n      \"has\",\n      \"have\",\n      \"how\",\n      \"if\",\n      \"in\",\n      \"into\",\n      \"is\",\n      \"it\",\n      \"its\",\n      \"may\",\n      \"might\",\n      \"no\",\n      \"nor\",\n      \"not\",\n      \"of\",\n      \"on\",\n      \"or\",\n      \"over\",\n      \"should\",\n      \"so\",\n      \"than\",\n      \"that\",\n      \"the\",\n      \"then\",\n      \"these\",\n      \"this\",\n      \"those\",\n      \"to\",\n      \"was\",\n      \"were\",\n      \"what\",\n      \"when\",\n      \"where\",\n      \"which\",\n      \"who\",\n      \"whom\",\n      \"why\",\n      \"will\",\n      \"with\",\n      \"would\"\n    ],\n    \"alias_token\": {\n      \"pattern\": \"\\\\[\\\\[([A-Za-z][A-Za-z0-9_]*_[a-z0-9]{12})\\\\]\\\\]\",\n      \"note\": \"An alias label as it appears in text: [[PERSON_PHONE_h2n7v5cx8m0d]]. Kept whole rather than split, because 'person' and 'phone' are boilerplate shared by every label of that field type and would make two different people's memories score alike. Mirrors synap/cloud/shared/tokenizer.py \\u2014 keep the two in step.\"\n    },\n    \"suffix_note\": \"Order matters: longest-first, because _stem returns on first match. Reordering this list silently changes every stem and therefore every BM25 score.\"\n  },\n  \"env_flags\": {\n    \"$comment\": \"Read at CALL time, never at module load. Python does os.environ.get inside the function bodies; JS must do the same or late process.env mutation stops working and the flag looks broken. See gotcha G-S.\",\n    \"SYNAP_SDK_CACHE_RECALL_BYPASS\": {\n      \"default\": false,\n      \"truthy\": [\n        \"true\",\n        \"1\",\n        \"yes\"\n      ]\n    },\n    \"SYNAP_SDK_CACHE_HONOR_TTL_HINT\": {\n      \"default\": false,\n      \"truthy\": [\n        \"true\",\n        \"1\",\n        \"yes\"\n      ],\n      \"note\": \"A bundle's server ttl_hint_seconds may only SHORTEN the global TTL, never extend it.\"\n    },\n    \"SYNAP_SDK_CACHE_INVALIDATE_ON_WRITE\": {\n      \"default\": false,\n      \"truthy\": [\n        \"true\",\n        \"1\",\n        \"yes\"\n      ],\n      \"note\": \"2026-07-16 eval register issue #8: the cloud invalidates its own Redis caches on ingest, but that stops at the process boundary.\"\n    },\n    \"SYNAP_SDK_CACHE_MAX_ENTRY_AGE\": {\n      \"default\": null,\n      \"note\": \"2026-07-16 eval register issue #6: stored_at is a sliding lease renewed on hit, so under steady traffic a pre-update snapshot never expired. Defaults to 2x the sliding TTL; 0 disables.\"\n    },\n    \"SYNAP_SDK_CACHE_COVERAGE_MIN\": {\n      \"default\": null\n    }\n  },\n  \"coverage_gate\": {\n    \"note\": \"Fraction of the query's stems present in the picked items. A bundle can clear the BM25 threshold on one shared token ('account') while lacking the asked-for fact entirely: the false HIT behind the eval's 'forgot the name' failure. ALWAYS computed and reported; ENFORCED only when SYNAP_SDK_CACHE_COVERAGE_MIN is explicitly set, so default behavior is unchanged. When it does fire it must gate BEFORE any side effect, so a rejected lookup leaves cache state untouched.\",\n    \"env_flag\": \"SYNAP_SDK_CACHE_COVERAGE_MIN\",\n    \"default\": null,\n    \"empty_query_coverage\": 1.0\n  },\n  \"telemetry\": {\n    \"rejected_items_cap\": {\n      \"value\": 20,\n      \"note\": \"Rejected items reported per lookup, highest score first, so a large cache cannot bloat the payload.\"\n    },\n    \"content_preview_chars\": 120\n  }\n}\n","/**\n * Loader for the shared SDK behavior contract.\n *\n * The values here are tuned against measured eval failures and are shared,\n * byte-identical, with the Python SDK. They live in data rather than code\n * specifically so the two SDKs cannot drift. See\n * `synap/sdk/CONTRACT/README.md`.\n *\n * `anticipation.json` is vendored into `src/` by\n * `synap/sdk/scripts/sync-behavior.sh` and imported (not read from disk) so\n * that the bundler inlines it. Reading it with `node:fs` at runtime would work\n * in Node and break in every bundled target: Edge, Workers, and anything under\n * webpack/turbopack, where `dist/` is rewritten and relative paths do not\n * survive. It is the same failure mode as `@grpc/proto-loader` reading a\n * `.proto` off disk (gotcha G-P).\n */\n\nimport contractJson from './anticipation.json' with { type: 'json' };\n\nexport interface RecallPattern {\n  pattern: string;\n  flags: string;\n  note: string;\n}\n\nexport interface BehaviorContract {\n  version: number;\n  recall_bypass: {\n    note: string;\n    env_flag: string;\n    default: boolean;\n    patterns: RecallPattern[];\n  };\n  thresholds: {\n    bm25: { value: number; note: string };\n    novel_term: { value: number; note: string };\n    min_corpus_for_novel_gate: { value: number; note: string };\n    effective_floor: { value: number; note: string };\n    query_token_scale: { value: number; note: string };\n  };\n  coverage_gate: {\n    note: string;\n    env_flag: string;\n    default: number | null;\n    empty_query_coverage: number;\n  };\n  telemetry: {\n    rejected_items_cap: { value: number; note: string };\n    content_preview_chars: number;\n  };\n  bm25: {\n    k1: number;\n    b: number;\n    idf_floor: number;\n    min_token_len: number;\n    min_stem_len: number;\n    suffixes: string[];\n    stop_words: string[];\n    alias_token: { pattern: string; note: string };\n  };\n}\n\nexport const CONTRACT = contractJson as unknown as BehaviorContract;\n\n/** ECMAScript flags we accept. Anything else is invalid in Python too. */\nconst ALLOWED_FLAGS = new Set(['i', 'm', 's']);\n\nfunction compile(pattern: string, flags: string): RegExp {\n  for (const ch of flags) {\n    if (!ALLOWED_FLAGS.has(ch)) {\n      throw new Error(\n        `Unsupported regex flag '${ch}' in behavior contract. Flags must be ` +\n          `valid in both Python and ECMAScript.`,\n      );\n    }\n  }\n  return new RegExp(pattern, flags);\n}\n\n/**\n * Compiled recall-bypass patterns, in contract order.\n *\n * Deliberately NOT using the `g` flag: a global RegExp carries `lastIndex`\n * between calls, so a shared instance would match on one query and then miss\n * on the next. That failure is intermittent and traffic-dependent, which is\n * the worst kind to debug.\n */\nexport const RECALL_PATTERNS: readonly RegExp[] = CONTRACT.recall_bypass.patterns.map((p) =>\n  compile(p.pattern, p.flags ?? ''),\n);\n\nexport const THRESHOLDS = {\n  bm25: CONTRACT.thresholds.bm25.value,\n  novelTerm: CONTRACT.thresholds.novel_term.value,\n  minCorpusForNovelGate: CONTRACT.thresholds.min_corpus_for_novel_gate.value,\n  /** Lower bound on the derived per-query threshold. */\n  effectiveFloor: CONTRACT.thresholds.effective_floor.value,\n  /** Points of score allowed per query token when deriving the threshold. */\n  queryTokenScale: CONTRACT.thresholds.query_token_scale.value,\n} as const;\n\nexport const BM25_PARAMS = CONTRACT.bm25;\nexport const STOP_WORDS: ReadonlySet<string> = new Set(CONTRACT.bm25.stop_words);\n// Order is load-bearing: stem() returns on first match, so this must stay\n// longest-first exactly as the contract lists it.\nexport const SUFFIXES: readonly string[] = CONTRACT.bm25.suffixes;\nexport const ALIAS_TOKEN_SOURCE = CONTRACT.bm25.alias_token.pattern;\n\n/** True when any query string looks like an explicit memory-recall ask. */\nexport function isRecallQuery(searchQuery: readonly (string | null | undefined)[] | null | undefined): boolean {\n  for (const q of searchQuery ?? []) {\n    if (!q) continue;\n    for (const pattern of RECALL_PATTERNS) {\n      if (pattern.test(q)) return true;\n    }\n  }\n  return false;\n}\n","/**\n * BM25 scorer for the anticipation cache.\n *\n * A faithful port of `maximem_synap/cache/bm25.py`. Every tuned value comes\n * from the shared behavior contract, so the two implementations cannot drift\n * on parameters. What they *can* still drift on is arithmetic, which is what\n * the shared conformance corpus is for.\n */\n\nimport { BM25_PARAMS, STOP_WORDS, SUFFIXES, ALIAS_TOKEN_SOURCE } from '../behavior/contract.js';\n\nconst MIN_STEM_LEN = BM25_PARAMS.min_stem_len;\nconst MIN_TOKEN_LEN = BM25_PARAMS.min_token_len;\n\nexport function stem(word: string): string {\n  // Order is load-bearing: longest suffix first, return on first match.\n  for (const suffix of SUFFIXES) {\n    if (word.endsWith(suffix) && word.length - suffix.length >= MIN_STEM_LEN) {\n      return word.slice(0, word.length - suffix.length);\n    }\n  }\n  return word;\n}\n\n/**\n * An alias label, as it appears in text: `[[PERSON_PHONE_h2n7v5cx8m0d]]`.\n *\n * Kept whole rather than split into `person`, `phone` and the suffix, because\n * the first two are boilerplate shared by every label of that field type and\n * would make two different people's memories score alike.\n *\n * Mirrors `synap/cloud/shared/tokenizer.py`. Keep the two in step.\n */\nfunction aliasTokenRe(): RegExp {\n  // Constructed per call because `g` regexes carry `lastIndex`, and this one\n  // is used with replace(). A module-level shared instance would produce\n  // different results on alternating calls.\n  return new RegExp(ALIAS_TOKEN_SOURCE, 'g');\n}\n\nconst WORD_RE = /[a-z0-9]+/g;\n\n/** Tokenize, lowercase, remove stop words, and stem. Alias labels survive whole. */\nexport function tokenize(text: string | null | undefined): string[] {\n  if (!text) return [];\n\n  const labels: string[] = [];\n  const remainder = text.replace(aliasTokenRe(), (_match, captured: string) => {\n    labels.push(captured.toLowerCase());\n    return ' ';\n  });\n\n  const words = remainder.toLowerCase().match(WORD_RE) ?? [];\n  const out = labels.slice();\n  for (const w of words) {\n    if (w.length >= MIN_TOKEN_LEN && !STOP_WORDS.has(w)) out.push(stem(w));\n  }\n  return out;\n}\n\n/** Okapi BM25 scorer over a small in-memory corpus. */\nexport class BM25 {\n  static readonly IDF_FLOOR = BM25_PARAMS.idf_floor;\n\n  readonly k1: number;\n  readonly b: number;\n  readonly corpus: readonly (readonly string[])[];\n  readonly docCount: number;\n  readonly avgdl: number;\n  readonly docLens: readonly number[];\n  readonly idf: ReadonlyMap<string, number>;\n\n  constructor(\n    corpus: readonly (readonly string[])[],\n    k1: number = BM25_PARAMS.k1,\n    b: number = BM25_PARAMS.b,\n  ) {\n    this.k1 = k1;\n    this.b = b;\n    this.corpus = corpus;\n    this.docCount = corpus.length;\n    this.docLens = corpus.map((doc) => doc.length);\n    // Python falls back to 1.0 rather than dividing by zero on an empty corpus.\n    this.avgdl = this.docCount\n      ? this.docLens.reduce((a, n) => a + n, 0) / this.docCount\n      : 1.0;\n\n    const idf = new Map<string, number>();\n    const allTerms = new Set<string>();\n    for (const doc of corpus) for (const t of doc) allTerms.add(t);\n    for (const term of allTerms) {\n      let df = 0;\n      for (const doc of corpus) if (doc.includes(term)) df++;\n      const raw = Math.log((this.docCount - df + 0.5) / (df + 0.5) + 1.0);\n      idf.set(term, Math.max(raw, BM25.IDF_FLOOR));\n    }\n    this.idf = idf;\n  }\n\n  score(queryTokens: readonly string[], docIdx: number): number {\n    const doc = this.corpus[docIdx];\n    if (doc === undefined) return 0;\n    const dl = this.docLens[docIdx] ?? 0;\n\n    const tfMap = new Map<string, number>();\n    for (const t of doc) tfMap.set(t, (tfMap.get(t) ?? 0) + 1);\n\n    let s = 0;\n    for (const term of queryTokens) {\n      const tf = tfMap.get(term);\n      if (tf === undefined) continue;\n      const idf = this.idf.get(term) ?? BM25.IDF_FLOOR;\n      const numerator = tf * (this.k1 + 1);\n      const denominator = tf + this.k1 * (1 - this.b + (this.b * dl) / this.avgdl);\n      s += (idf * numerator) / denominator;\n    }\n    return s;\n  }\n\n  scores(queryTokens: readonly string[]): number[] {\n    return this.corpus.map((_, i) => this.score(queryTokens, i));\n  }\n}\n","/**\n * In-memory TTL cache for context bundles pushed over gRPC.\n *\n * Port of `maximem_synap/cache/anticipation_cache.py`.\n *\n * ## Why this is a faithful port and not a simplification\n *\n * `@maximem/synap-vercel-adk` already contains a native TS anticipation cache,\n * and it is a simplification: a hardcoded 30-minute TTL, a plain BM25 threshold\n * with no per-query derivation, and none of the gates below. Shipping that as\n * the SDK's cache would mean two retrieval behaviors under one brand, which is\n * gotcha G-C. Every gate here exists because a specific eval failed without it:\n *\n *  - **Recall bypass** runs BEFORE scoring. The measured false hit scored 2.86\n *    at coverage 1.00, so no score-side gate could ever have caught it.\n *  - **The novel-term gate** is suppressed below a 200-stem corpus, because at\n *    cold start ordinary English trips it on nearly every query.\n *  - **The per-query threshold** scales down for short queries, which otherwise\n *    cannot reach the nominal score at all.\n *  - **The coverage gate** catches a bundle that clears BM25 on one shared\n *    token (\"account\") while lacking the asked-for fact.\n *\n * All thresholds come from the shared behavior contract.\n */\n\nimport { BM25, tokenize } from '../cache/bm25.js';\nimport { CONTRACT, THRESHOLDS, isRecallQuery } from '../behavior/contract.js';\nimport { getEnvFlag, getEnvFloat } from '../util/env.js';\n\nconst EFFECTIVE_FLOOR = CONTRACT.thresholds.effective_floor.value;\nconst QUERY_TOKEN_SCALE = CONTRACT.thresholds.query_token_scale.value;\nconst REJECTED_CAP = CONTRACT.telemetry.rejected_items_cap.value;\nconst PREVIEW_CHARS = CONTRACT.telemetry.content_preview_chars;\n\n/** Sentinel scope that matches any requester. */\nexport const ANY_SCOPE = '_any';\n\nexport interface BundleItem {\n  item_id?: string;\n  content?: string;\n  [key: string]: unknown;\n}\n\nexport interface ContextBundle {\n  bundleId: string;\n  entityId?: string | null;\n  conversationId?: string | null;\n  itemsByType: Record<string, BundleItem[]>;\n  /** Server hint; may only SHORTEN the global TTL, never extend it. */\n  ttlHintSeconds?: number | null;\n  /** Which anticipation pattern produced this bundle. Diagnostics only. */\n  bundleType?: string | null;\n  /** The queries the server anticipated. Diagnostics only. */\n  searchQueries?: readonly string[] | null;\n}\n\ninterface ItemRecord {\n  bundleId: string;\n  itemType: string;\n  content: string;\n  tokens: string[];\n  itemDict: BundleItem;\n}\n\ninterface EntryRecord {\n  bundleId: string;\n  entityId: string;\n  conversationId: string | null;\n  bundleType: string | null;\n  searchQueries: string[];\n  /** Sliding lease, refreshed on hit unless TTL hints are honoured. */\n  storedAt: number;\n  /** Absolute creation time; the max-entry-age cap uses this, not the lease. */\n  createdAt: number;\n  ttlHintSeconds: number | null;\n}\n\nexport interface LookupResult {\n  itemsByType: Record<string, BundleItem[]>;\n  bundleIds: string[];\n  score: number;\n  coverage: number;\n}\n\nexport interface LookupParams {\n  searchQuery?: readonly string[] | null;\n  entityId?: string | null;\n  customerId?: string | null;\n  clientId?: string | null;\n  conversationId?: string | null;\n  maxItems?: number;\n}\n\nexport type ExitReason =\n  | 'empty'\n  | 'recall_bypass'\n  | 'no_query_tokens'\n  | 'novel_term_gate'\n  | 'empty_corpus'\n  | 'no_items_above_threshold'\n  | 'coverage_gate'\n  | 'hit';\n\nexport interface LookupTelemetry {\n  searchQuery: string[];\n  entityId: string | null;\n  customerId: string | null;\n  clientId: string | null;\n  conversationId: string | null;\n  scopeFilterAccepted: string[];\n  novelTermRatio: number | null;\n  bm25Threshold: number | null;\n  bm25QueryTokens: string[];\n  itemsPicked: unknown[];\n  itemsRejected: unknown[];\n  coverage: number | null;\n  hit: boolean;\n  exitReason: ExitReason;\n}\n\nexport interface SnapshotItemPreview {\n  type: string;\n  scope: string | null;\n  content: string;\n}\n\nexport interface SnapshotItemRecord {\n  bundle_id: string;\n  item_type: string;\n  tokens: string[];\n  content: string;\n}\n\nexport interface SnapshotBundle {\n  bundle_id: string;\n  entity_id: string;\n  conversation_id: string | null;\n  bundle_type: string | null;\n  search_queries: string[];\n  scope_counts: Record<string, number>;\n  total_items: number;\n  items: SnapshotItemPreview[];\n}\n\nexport interface AnticipationCacheSnapshot {\n  total_entries: number;\n  total_item_records: number;\n  scope_breakdown_overall: Record<string, number>;\n  corpus_vocab_size: number;\n  corpus_vocab_sample: string[];\n  item_records: SnapshotItemRecord[];\n  bundles: SnapshotBundle[];\n}\n\nexport interface AnticipationCacheOptions {\n  ttlSeconds?: number;\n  maxBundles?: number;\n  /** Injected in tests. Defaults to a monotonic clock. */\n  now?: () => number;\n  onLookup?: (telemetry: LookupTelemetry) => void;\n}\n\nconst DEFAULT_TTL_SECONDS = 1800;\nconst DEFAULT_MAX_BUNDLES = 50;\n\nexport class AnticipationCache {\n  private readonly ttlSeconds: number;\n  private readonly maxBundles: number;\n  private readonly now: () => number;\n  private readonly onLookup: ((t: LookupTelemetry) => void) | undefined;\n\n  private entries = new Map<string, EntryRecord>();\n  private items: ItemRecord[] = [];\n  private corpusVocab = new Set<string>();\n  private bm25: BM25 | null = null;\n  private bm25Dirty = true;\n\n  constructor(options: AnticipationCacheOptions = {}) {\n    this.ttlSeconds = options.ttlSeconds ?? DEFAULT_TTL_SECONDS;\n    this.maxBundles = options.maxBundles ?? DEFAULT_MAX_BUNDLES;\n    this.now = options.now ?? monotonicNow;\n    this.onLookup = options.onLookup;\n  }\n\n  get size(): number {\n    return this.entries.size;\n  }\n\n  get itemCount(): number {\n    return this.items.length;\n  }\n\n  store(bundle: ContextBundle): void {\n    if (!bundle.bundleId) return;\n    this.evictExpired();\n\n    // Client-scope knowledge (FAQs, policies) arrives with no entity, and the\n    // sentinel makes it visible to every requester.\n    const entityId = bundle.entityId || ANY_SCOPE;\n\n    if (this.entries.has(bundle.bundleId)) this.dropBundle(bundle.bundleId);\n\n    const now = this.now();\n    this.entries.set(bundle.bundleId, {\n      bundleId: bundle.bundleId,\n      entityId,\n      conversationId: bundle.conversationId ?? null,\n      bundleType: bundle.bundleType ?? null,\n      searchQueries: [...(bundle.searchQueries ?? [])],\n      storedAt: now,\n      createdAt: now,\n      ttlHintSeconds: bundle.ttlHintSeconds ?? null,\n    });\n\n    for (const [itemType, list] of Object.entries(bundle.itemsByType ?? {})) {\n      for (const item of list ?? []) {\n        const content = String(item.content ?? '');\n        const tokens = tokenize(content);\n        this.items.push({ bundleId: bundle.bundleId, itemType, content, tokens, itemDict: item });\n        for (const t of tokens) this.corpusVocab.add(t);\n      }\n    }\n    this.bm25Dirty = true;\n\n    // LRU by lease age.\n    while (this.entries.size > this.maxBundles) {\n      let oldest: EntryRecord | null = null;\n      for (const e of this.entries.values()) {\n        if (oldest === null || e.storedAt < oldest.storedAt) oldest = e;\n      }\n      if (oldest === null) break;\n      this.dropBundle(oldest.bundleId);\n    }\n  }\n\n  lookup(params: LookupParams): LookupResult | null {\n    const {\n      searchQuery = null, entityId = null, customerId = null,\n      clientId = null, conversationId = null, maxItems = 10,\n    } = params;\n\n    this.evictExpired();\n\n    const accepted = this.buildAcceptedScope(entityId, customerId, clientId);\n    const telemetry: LookupTelemetry = {\n      searchQuery: (searchQuery ?? []).filter((q): q is string => Boolean(q)),\n      entityId, customerId, clientId, conversationId,\n      scopeFilterAccepted: [...accepted].sort(),\n      novelTermRatio: null, bm25Threshold: null, bm25QueryTokens: [],\n      itemsPicked: [], itemsRejected: [], coverage: null,\n      hit: false, exitReason: 'empty',\n    };\n\n    if (this.entries.size === 0 || this.items.length === 0) {\n      return this.miss(telemetry, 'empty');\n    }\n\n    const hasQuery = (searchQuery ?? []).some((q) => q && q.trim() !== '');\n    if (!hasQuery) {\n      return this.freshnessLookup(entityId, maxItems, telemetry);\n    }\n\n    // Recall bypass fires BEFORE scoring: a stale false-hit on a recall-shaped\n    // question makes the agent deny a fact the store holds, and the measured\n    // failure cleared every score-side gate.\n    if (getEnvFlag(CONTRACT.recall_bypass.env_flag) && isRecallQuery(searchQuery)) {\n      return this.miss(telemetry, 'recall_bypass');\n    }\n\n    const queryTokens = (searchQuery ?? []).flatMap((q) => tokenize(q));\n    telemetry.bm25QueryTokens = queryTokens;\n    if (queryTokens.length === 0) {\n      return this.miss(telemetry, 'no_query_tokens');\n    }\n\n    const uniqueStems = new Set(queryTokens);\n    let novel = 0;\n    for (const s of uniqueStems) if (!this.corpusVocab.has(s)) novel++;\n    const novelRatio = uniqueStems.size ? novel / uniqueStems.size : 0;\n    telemetry.novelTermRatio = round4(novelRatio);\n\n    // Only meaningful once the corpus has real vocabulary. Below the floor the\n    // ratio is dominated by ordinary English and would miss on nearly anything.\n    if (\n      this.corpusVocab.size >= THRESHOLDS.minCorpusForNovelGate &&\n      novelRatio >= THRESHOLDS.novelTerm\n    ) {\n      return this.miss(telemetry, 'novel_term_gate');\n    }\n\n    if (this.bm25Dirty || this.bm25 === null) {\n      if (this.items.length === 0) return this.miss(telemetry, 'empty_corpus');\n      this.bm25 = new BM25(this.items.map((i) => i.tokens));\n      this.bm25Dirty = false;\n    }\n\n    const scores = this.bm25.scores(queryTokens);\n    const validBundles = this.getValidBundleIds(accepted, conversationId);\n\n    const effectiveThreshold = Math.max(\n      EFFECTIVE_FLOOR,\n      Math.min(THRESHOLDS.bm25, QUERY_TOKEN_SCALE * queryTokens.length),\n    );\n    telemetry.bm25Threshold = round4(effectiveThreshold);\n\n    const picked: { score: number; item: ItemRecord }[] = [];\n    const rejected: { score: number; payload: Record<string, unknown> }[] = [];\n\n    for (let idx = 0; idx < scores.length; idx++) {\n      const item = this.items[idx]!;\n      const score = scores[idx]!;\n      const reject = (reason: string) =>\n        rejected.push({\n          score,\n          payload: {\n            item_index: idx, bundle_id: item.bundleId, item_type: item.itemType,\n            content_first_120: item.content.slice(0, PREVIEW_CHARS),\n            bm25_score: round4(score), reason,\n          },\n        });\n      if (score < effectiveThreshold) { reject('below_threshold'); continue; }\n      if (!validBundles.has(item.bundleId)) { reject('scope_filter_excluded'); continue; }\n      picked.push({ score, item });\n    }\n\n    rejected.sort((a, b) => b.score - a.score);\n    telemetry.itemsRejected = rejected.slice(0, REJECTED_CAP).map((r) => r.payload);\n\n    if (picked.length === 0) {\n      return this.miss(telemetry, 'no_items_above_threshold');\n    }\n\n    picked.sort((a, b) => b.score - a.score);\n    const top = picked.slice(0, maxItems);\n\n    const pickedStems = new Set<string>();\n    for (const { item } of top) for (const t of item.tokens) pickedStems.add(t);\n    let overlap = 0;\n    for (const s of uniqueStems) if (pickedStems.has(s)) overlap++;\n    const coverage = uniqueStems.size ? overlap / uniqueStems.size : 1.0;\n    telemetry.coverage = round4(coverage);\n\n    // Observe-only unless explicitly configured. A malformed setting stays\n    // observe-only rather than failing closed on every lookup.\n    const coverageMin = getEnvFloat('SYNAP_SDK_CACHE_COVERAGE_MIN');\n    if (coverageMin !== null && coverage < coverageMin) {\n      // Gate BEFORE any side effect, so a rejected lookup leaves cache state\n      // untouched and does not refresh a lease.\n      return this.miss(telemetry, 'coverage_gate');\n    }\n\n    const itemsByType: Record<string, BundleItem[]> = {};\n    const bundleIds = new Set<string>();\n    for (const { item } of top) {\n      (itemsByType[item.itemType] ??= []).push(item.itemDict);\n      bundleIds.add(item.bundleId);\n    }\n\n    // Honouring a TTL hint also means a hit stops renewing the lease, otherwise\n    // a hinted bundle under steady traffic would outlive its hint.\n    const refreshOnHit = !getEnvFlag('SYNAP_SDK_CACHE_HONOR_TTL_HINT');\n    if (refreshOnHit) {\n      const now = this.now();\n      for (const id of bundleIds) {\n        const entry = this.entries.get(id);\n        if (entry) entry.storedAt = now;\n      }\n    }\n\n    telemetry.hit = true;\n    telemetry.exitReason = 'hit';\n    telemetry.itemsPicked = top.map(({ score, item }) => ({\n      bundle_id: item.bundleId, item_type: item.itemType,\n      content_first_120: item.content.slice(0, PREVIEW_CHARS), bm25_score: round4(score),\n    }));\n    this.fire(telemetry);\n\n    return {\n      itemsByType,\n      bundleIds: [...bundleIds],\n      score: top[0]!.score,\n      coverage,\n    };\n  }\n\n  /**\n   * Drop this entity's bundles after a write, so the cache stops serving a\n   * pre-write view. Gated on the flag: this is the write-path hook.\n   */\n  invalidateEntity(entityId: string): number {\n    if (!getEnvFlag('SYNAP_SDK_CACHE_INVALIDATE_ON_WRITE')) return 0;\n    return this.dropEntity(entityId);\n  }\n\n  /**\n   * Unconditionally drop this entity's bundles. Backs `cache.clear_user` and\n   * `cache.clear_customer`, which are explicit user requests and so are not\n   * gated on the invalidate-on-write flag.\n   */\n  dropEntity(entityId: string): number {\n    let dropped = 0;\n    for (const entry of [...this.entries.values()]) {\n      // Never drop shared client-scope knowledge on one entity's behalf.\n      if (entry.entityId === ANY_SCOPE) continue;\n      if (entry.entityId === entityId) { this.dropBundle(entry.bundleId); dropped++; }\n    }\n    return dropped;\n  }\n\n  /**\n   * A read-only diagnostic projection of the cache.\n   *\n   * Backs `client.anticipation_cache_snapshot()` and mirrors Python's shape\n   * key for key, including snake_case keys: this output gets logged, diffed\n   * and pasted into issues across both SDKs, so it is a wire format.\n   *\n   * Note the 140-character content previews. That is Python's literal, and it\n   * is deliberately NOT the 120 of `telemetry.content_preview_chars` from the\n   * contract, which caps lookup telemetry rather than this snapshot.\n   */\n  snapshot(): AnticipationCacheSnapshot {\n    const SNAPSHOT_PREVIEW_CHARS = 140;\n    const overallScope = new Map<string, number>();\n    const itemsByBundle = new Map<string, ItemRecord[]>();\n    for (const record of this.items) {\n      const list = itemsByBundle.get(record.bundleId);\n      if (list === undefined) itemsByBundle.set(record.bundleId, [record]);\n      else list.push(record);\n    }\n\n    const bundles: SnapshotBundle[] = [];\n    for (const [bundleId, entry] of this.entries) {\n      const perBundle = new Map<string, number>();\n      const itemPreviews: SnapshotItemPreview[] = [];\n      for (const record of itemsByBundle.get(bundleId) ?? []) {\n        // `scope` is absent on plenty of items; Python's Counter happily keys\n        // on None, which JSON-serialises to null, so preserve the distinction\n        // rather than coercing to a string.\n        const scope = (record.itemDict['scope'] ?? null) as string | null;\n        const key = scope === null ? '' : scope;\n        overallScope.set(key, (overallScope.get(key) ?? 0) + 1);\n        perBundle.set(key, (perBundle.get(key) ?? 0) + 1);\n        itemPreviews.push({\n          type: record.itemType,\n          scope,\n          content: record.content.slice(0, SNAPSHOT_PREVIEW_CHARS),\n        });\n      }\n      let totalItems = 0;\n      for (const n of perBundle.values()) totalItems += n;\n      bundles.push({\n        bundle_id: bundleId,\n        entity_id: entry.entityId,\n        conversation_id: entry.conversationId,\n        bundle_type: entry.bundleType,\n        search_queries: [...entry.searchQueries],\n        scope_counts: Object.fromEntries(perBundle),\n        total_items: totalItems,\n        items: itemPreviews,\n      });\n    }\n\n    return {\n      total_entries: this.entries.size,\n      total_item_records: this.items.length,\n      scope_breakdown_overall: Object.fromEntries(overallScope),\n      corpus_vocab_size: this.corpusVocab.size,\n      corpus_vocab_sample: [...this.corpusVocab].sort().slice(0, 80),\n      item_records: this.items.slice(0, 20).map((rec) => ({\n        bundle_id: rec.bundleId,\n        item_type: rec.itemType,\n        tokens: rec.tokens.slice(0, 25),\n        content: rec.content.slice(0, SNAPSHOT_PREVIEW_CHARS),\n      })),\n      bundles,\n    };\n  }\n\n  /**\n   * Drop every bundle belonging to one conversation.\n   *\n   * Backs the `compaction_update` signal on the Listen stream: a compaction\n   * rewrites the conversation's summary, so any bundle built from the previous\n   * state is stale and must not keep serving for the rest of its TTL.\n   *\n   * Unlike `dropEntity`, client-scope bundles are NOT spared: a bundle is only\n   * dropped here if it is bound to this specific conversation, and a shared\n   * client-scope bundle has no conversation id to match.\n   */\n  dropConversation(conversationId: string): number {\n    if (!conversationId) return 0;\n    let dropped = 0;\n    for (const entry of [...this.entries.values()]) {\n      if (entry.conversationId === conversationId) { this.dropBundle(entry.bundleId); dropped++; }\n    }\n    return dropped;\n  }\n\n  clear(): void {\n    this.entries.clear();\n    this.items = [];\n    this.corpusVocab.clear();\n    this.bm25 = null;\n    this.bm25Dirty = true;\n  }\n\n  // ── internals ───────────────────────────────────────────────────────────────\n\n  private miss(telemetry: LookupTelemetry, reason: ExitReason): null {\n    telemetry.exitReason = reason;\n    telemetry.hit = false;\n    this.fire(telemetry);\n    return null;\n  }\n\n  private fire(telemetry: LookupTelemetry): void {\n    // Exception-safe by contract: a buggy hook must never break the SDK.\n    try {\n      this.onLookup?.(telemetry);\n    } catch {\n      /* ignored on purpose */\n    }\n  }\n\n  private freshnessLookup(\n    entityId: string | null,\n    maxItems: number,\n    telemetry: LookupTelemetry,\n  ): LookupResult | null {\n    const candidates = [...this.entries.values()]\n      .filter((e) => entityId === null || e.entityId === entityId || e.entityId === ANY_SCOPE)\n      .sort((a, b) => b.storedAt - a.storedAt);\n    if (candidates.length === 0) return this.miss(telemetry, 'empty');\n\n    const newest = candidates[0]!;\n    const itemsByType: Record<string, BundleItem[]> = {};\n    let n = 0;\n    for (const item of this.items) {\n      if (item.bundleId !== newest.bundleId) continue;\n      if (n >= maxItems) break;\n      (itemsByType[item.itemType] ??= []).push(item.itemDict);\n      n++;\n    }\n    if (n === 0) return this.miss(telemetry, 'empty');\n\n    telemetry.hit = true;\n    telemetry.exitReason = 'hit';\n    this.fire(telemetry);\n    return { itemsByType, bundleIds: [newest.bundleId], score: 0, coverage: 1.0 };\n  }\n\n  /**\n   * The widened scope-match set for a request.\n   *\n   * A narrower-scope request also matches broader-scope bundles for the same\n   * customer or client. Falsy ids are dropped so an empty customer_id cannot\n   * accidentally match bundles keyed at \"\".\n   */\n  private buildAcceptedScope(\n    entityId: string | null, customerId: string | null, clientId: string | null,\n  ): Set<string> {\n    const accepted = new Set<string>([ANY_SCOPE]);\n    if (entityId) accepted.add(entityId);\n    if (customerId) accepted.add(customerId);\n    if (clientId) accepted.add(clientId);\n    return accepted;\n  }\n\n  private getValidBundleIds(accepted: Set<string>, conversationId: string | null): Set<string> {\n    const valid = new Set<string>();\n    for (const entry of this.entries.values()) {\n      if (!accepted.has(entry.entityId)) continue;\n      // A conversation-scoped bundle is only valid inside its conversation.\n      if (entry.conversationId && conversationId && entry.conversationId !== conversationId) continue;\n      valid.add(entry.bundleId);\n    }\n    return valid;\n  }\n\n  private effectiveTtl(entry: EntryRecord): number {\n    if (!getEnvFlag('SYNAP_SDK_CACHE_HONOR_TTL_HINT')) return this.ttlSeconds;\n    if (entry.ttlHintSeconds == null || entry.ttlHintSeconds <= 0) return this.ttlSeconds;\n    // A hint may only shorten.\n    return Math.min(this.ttlSeconds, entry.ttlHintSeconds);\n  }\n\n  private evictExpired(): void {\n    const now = this.now();\n    // Default cap is twice the sliding TTL; 0 disables. Without it a bundle\n    // under steady traffic renews forever and can serve a retired value\n    // indefinitely.\n    const configuredMaxAge = getEnvFloat('SYNAP_SDK_CACHE_MAX_ENTRY_AGE');\n    const maxAge = configuredMaxAge ?? this.ttlSeconds * 2;\n\n    for (const entry of [...this.entries.values()]) {\n      const idleExpired = now - entry.storedAt > this.effectiveTtl(entry);\n      const ageExpired = maxAge > 0 && now - entry.createdAt > maxAge;\n      if (idleExpired || ageExpired) this.dropBundle(entry.bundleId);\n    }\n  }\n\n  private dropBundle(bundleId: string): void {\n    if (!this.entries.delete(bundleId)) return;\n    this.items = this.items.filter((i) => i.bundleId !== bundleId);\n    // Vocabulary is rebuilt rather than decremented: a stem can be shared by\n    // several bundles, so per-bundle subtraction would drop stems still in use.\n    this.corpusVocab = new Set(this.items.flatMap((i) => i.tokens));\n    this.bm25Dirty = true;\n  }\n}\n\nfunction monotonicNow(): number {\n  // performance.now() is monotonic and unaffected by wall-clock adjustments,\n  // matching Python's time.monotonic(). Date.now() would let an NTP step\n  // expire or resurrect every entry at once.\n  return typeof performance !== 'undefined' && typeof performance.now === 'function'\n    ? performance.now() / 1000\n    : Date.now() / 1000;\n}\n\nfunction round4(n: number): number {\n  return Number(n.toFixed(4));\n}\n"],"mappings":";;;;;;AAAA;AAAA,EACE,UAAY;AAAA,EACZ,SAAW;AAAA,EACX,eAAiB;AAAA,IACf,MAAQ;AAAA,IACR,UAAY;AAAA,IACZ,SAAW;AAAA,IACX,UAAY;AAAA,MACV;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAAA,EACA,YAAc;AAAA,IACZ,MAAQ;AAAA,MACN,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,YAAc;AAAA,MACZ,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,2BAA6B;AAAA,MAC3B,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,iBAAmB;AAAA,MACjB,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,mBAAqB;AAAA,MACnB,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,EACF;AAAA,EACA,MAAQ;AAAA,IACN,IAAM;AAAA,IACN,GAAK;AAAA,IACL,WAAa;AAAA,IACb,eAAiB;AAAA,IACjB,cAAgB;AAAA,IAChB,UAAY;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,YAAc;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,aAAe;AAAA,MACb,SAAW;AAAA,MACX,MAAQ;AAAA,IACV;AAAA,IACA,aAAe;AAAA,EACjB;AAAA,EACA,WAAa;AAAA,IACX,UAAY;AAAA,IACZ,+BAAiC;AAAA,MAC/B,SAAW;AAAA,MACX,QAAU;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,IACA,gCAAkC;AAAA,MAChC,SAAW;AAAA,MACX,QAAU;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACA,MAAQ;AAAA,IACV;AAAA,IACA,qCAAuC;AAAA,MACrC,SAAW;AAAA,MACX,QAAU;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACA,MAAQ;AAAA,IACV;AAAA,IACA,+BAAiC;AAAA,MAC/B,SAAW;AAAA,MACX,MAAQ;AAAA,IACV;AAAA,IACA,8BAAgC;AAAA,MAC9B,SAAW;AAAA,IACb;AAAA,EACF;AAAA,EACA,eAAiB;AAAA,IACf,MAAQ;AAAA,IACR,UAAY;AAAA,IACZ,SAAW;AAAA,IACX,sBAAwB;AAAA,EAC1B;AAAA,EACA,WAAa;AAAA,IACX,oBAAsB;AAAA,MACpB,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,uBAAyB;AAAA,EAC3B;AACF;;;AC5MO,IAAM,WAAW;AAGxB,IAAM,gBAAgB,oBAAI,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC;AAE7C,SAAS,QAAQ,SAAiB,OAAuB;AACvD,aAAW,MAAM,OAAO;AACtB,QAAI,CAAC,cAAc,IAAI,EAAE,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,2BAA2B,EAAE;AAAA,MAE/B;AAAA,IACF;AAAA,EACF;AACA,SAAO,IAAI,OAAO,SAAS,KAAK;AAClC;AAUO,IAAM,kBAAqC,SAAS,cAAc,SAAS;AAAA,EAAI,CAAC,MACrF,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE;AAClC;AAEO,IAAM,aAAa;AAAA,EACxB,MAAM,SAAS,WAAW,KAAK;AAAA,EAC/B,WAAW,SAAS,WAAW,WAAW;AAAA,EAC1C,uBAAuB,SAAS,WAAW,0BAA0B;AAAA;AAAA,EAErE,gBAAgB,SAAS,WAAW,gBAAgB;AAAA;AAAA,EAEpD,iBAAiB,SAAS,WAAW,kBAAkB;AACzD;AAEO,IAAM,cAAc,SAAS;AAC7B,IAAM,aAAkC,IAAI,IAAI,SAAS,KAAK,UAAU;AAGxE,IAAM,WAA8B,SAAS,KAAK;AAClD,IAAM,qBAAqB,SAAS,KAAK,YAAY;AAGrD,SAAS,cAAc,aAAiF;AAC7G,aAAW,KAAK,eAAe,CAAC,GAAG;AACjC,QAAI,CAAC,EAAG;AACR,eAAW,WAAW,iBAAiB;AACrC,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO;AAAA,IAC9B;AAAA,EACF;AACA,SAAO;AACT;;;AC1GA,IAAM,eAAe,YAAY;AACjC,IAAM,gBAAgB,YAAY;AAE3B,SAAS,KAAK,MAAsB;AAEzC,aAAW,UAAU,UAAU;AAC7B,QAAI,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,OAAO,UAAU,cAAc;AACxE,aAAO,KAAK,MAAM,GAAG,KAAK,SAAS,OAAO,MAAM;AAAA,IAClD;AAAA,EACF;AACA,SAAO;AACT;AAWA,SAAS,eAAuB;AAI9B,SAAO,IAAI,OAAO,oBAAoB,GAAG;AAC3C;AAEA,IAAM,UAAU;AAGT,SAAS,SAAS,MAA2C;AAClE,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,SAAmB,CAAC;AAC1B,QAAM,YAAY,KAAK,QAAQ,aAAa,GAAG,CAAC,QAAQ,aAAqB;AAC3E,WAAO,KAAK,SAAS,YAAY,CAAC;AAClC,WAAO;AAAA,EACT,CAAC;AAED,QAAM,QAAQ,UAAU,YAAY,EAAE,MAAM,OAAO,KAAK,CAAC;AACzD,QAAM,MAAM,OAAO,MAAM;AACzB,aAAW,KAAK,OAAO;AACrB,QAAI,EAAE,UAAU,iBAAiB,CAAC,WAAW,IAAI,CAAC,EAAG,KAAI,KAAK,KAAK,CAAC,CAAC;AAAA,EACvE;AACA,SAAO;AACT;AAGO,IAAM,OAAN,MAAM,MAAK;AAAA,EAChB,OAAgB,YAAY,YAAY;AAAA,EAE/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YACE,QACA,KAAa,YAAY,IACzB,IAAY,YAAY,GACxB;AACA,SAAK,KAAK;AACV,SAAK,IAAI;AACT,SAAK,SAAS;AACd,SAAK,WAAW,OAAO;AACvB,SAAK,UAAU,OAAO,IAAI,CAAC,QAAQ,IAAI,MAAM;AAE7C,SAAK,QAAQ,KAAK,WACd,KAAK,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,WAC/C;AAEJ,UAAM,MAAM,oBAAI,IAAoB;AACpC,UAAM,WAAW,oBAAI,IAAY;AACjC,eAAW,OAAO,OAAQ,YAAW,KAAK,IAAK,UAAS,IAAI,CAAC;AAC7D,eAAW,QAAQ,UAAU;AAC3B,UAAI,KAAK;AACT,iBAAW,OAAO,OAAQ,KAAI,IAAI,SAAS,IAAI,EAAG;AAClD,YAAM,MAAM,KAAK,KAAK,KAAK,WAAW,KAAK,QAAQ,KAAK,OAAO,CAAG;AAClE,UAAI,IAAI,MAAM,KAAK,IAAI,KAAK,MAAK,SAAS,CAAC;AAAA,IAC7C;AACA,SAAK,MAAM;AAAA,EACb;AAAA,EAEA,MAAM,aAAgC,QAAwB;AAC5D,UAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,QAAI,QAAQ,OAAW,QAAO;AAC9B,UAAM,KAAK,KAAK,QAAQ,MAAM,KAAK;AAEnC,UAAM,QAAQ,oBAAI,IAAoB;AACtC,eAAW,KAAK,IAAK,OAAM,IAAI,IAAI,MAAM,IAAI,CAAC,KAAK,KAAK,CAAC;AAEzD,QAAI,IAAI;AACR,eAAW,QAAQ,aAAa;AAC9B,YAAM,KAAK,MAAM,IAAI,IAAI;AACzB,UAAI,OAAO,OAAW;AACtB,YAAM,MAAM,KAAK,IAAI,IAAI,IAAI,KAAK,MAAK;AACvC,YAAM,YAAY,MAAM,KAAK,KAAK;AAClC,YAAM,cAAc,KAAK,KAAK,MAAM,IAAI,KAAK,IAAK,KAAK,IAAI,KAAM,KAAK;AACtE,WAAM,MAAM,YAAa;AAAA,IAC3B;AACA,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,aAA0C;AAC/C,WAAO,KAAK,OAAO,IAAI,CAAC,GAAG,MAAM,KAAK,MAAM,aAAa,CAAC,CAAC;AAAA,EAC7D;AACF;;;AC7FA,IAAM,kBAAkB,SAAS,WAAW,gBAAgB;AAC5D,IAAM,oBAAoB,SAAS,WAAW,kBAAkB;AAChE,IAAM,eAAe,SAAS,UAAU,mBAAmB;AAC3D,IAAM,gBAAgB,SAAS,UAAU;AAGlC,IAAM,YAAY;AA+HzB,IAAM,sBAAsB;AAC5B,IAAM,sBAAsB;AAErB,IAAM,oBAAN,MAAwB;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,UAAU,oBAAI,IAAyB;AAAA,EACvC,QAAsB,CAAC;AAAA,EACvB,cAAc,oBAAI,IAAY;AAAA,EAC9B,OAAoB;AAAA,EACpB,YAAY;AAAA,EAEpB,YAAY,UAAoC,CAAC,GAAG;AAClD,SAAK,aAAa,QAAQ,cAAc;AACxC,SAAK,aAAa,QAAQ,cAAc;AACxC,SAAK,MAAM,QAAQ,OAAO;AAC1B,SAAK,WAAW,QAAQ;AAAA,EAC1B;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,YAAoB;AACtB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA,EAEA,MAAM,QAA6B;AACjC,QAAI,CAAC,OAAO,SAAU;AACtB,SAAK,aAAa;AAIlB,UAAM,WAAW,OAAO,YAAY;AAEpC,QAAI,KAAK,QAAQ,IAAI,OAAO,QAAQ,EAAG,MAAK,WAAW,OAAO,QAAQ;AAEtE,UAAM,MAAM,KAAK,IAAI;AACrB,SAAK,QAAQ,IAAI,OAAO,UAAU;AAAA,MAChC,UAAU,OAAO;AAAA,MACjB;AAAA,MACA,gBAAgB,OAAO,kBAAkB;AAAA,MACzC,YAAY,OAAO,cAAc;AAAA,MACjC,eAAe,CAAC,GAAI,OAAO,iBAAiB,CAAC,CAAE;AAAA,MAC/C,UAAU;AAAA,MACV,WAAW;AAAA,MACX,gBAAgB,OAAO,kBAAkB;AAAA,IAC3C,CAAC;AAED,eAAW,CAAC,UAAU,IAAI,KAAK,OAAO,QAAQ,OAAO,eAAe,CAAC,CAAC,GAAG;AACvE,iBAAW,QAAQ,QAAQ,CAAC,GAAG;AAC7B,cAAM,UAAU,OAAO,KAAK,WAAW,EAAE;AACzC,cAAM,SAAS,SAAS,OAAO;AAC/B,aAAK,MAAM,KAAK,EAAE,UAAU,OAAO,UAAU,UAAU,SAAS,QAAQ,UAAU,KAAK,CAAC;AACxF,mBAAW,KAAK,OAAQ,MAAK,YAAY,IAAI,CAAC;AAAA,MAChD;AAAA,IACF;AACA,SAAK,YAAY;AAGjB,WAAO,KAAK,QAAQ,OAAO,KAAK,YAAY;AAC1C,UAAI,SAA6B;AACjC,iBAAW,KAAK,KAAK,QAAQ,OAAO,GAAG;AACrC,YAAI,WAAW,QAAQ,EAAE,WAAW,OAAO,SAAU,UAAS;AAAA,MAChE;AACA,UAAI,WAAW,KAAM;AACrB,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA,EAEA,OAAO,QAA2C;AAChD,UAAM;AAAA,MACJ,cAAc;AAAA,MAAM,WAAW;AAAA,MAAM,aAAa;AAAA,MAClD,WAAW;AAAA,MAAM,iBAAiB;AAAA,MAAM,WAAW;AAAA,IACrD,IAAI;AAEJ,SAAK,aAAa;AAElB,UAAM,WAAW,KAAK,mBAAmB,UAAU,YAAY,QAAQ;AACvE,UAAM,YAA6B;AAAA,MACjC,cAAc,eAAe,CAAC,GAAG,OAAO,CAAC,MAAmB,QAAQ,CAAC,CAAC;AAAA,MACtE;AAAA,MAAU;AAAA,MAAY;AAAA,MAAU;AAAA,MAChC,qBAAqB,CAAC,GAAG,QAAQ,EAAE,KAAK;AAAA,MACxC,gBAAgB;AAAA,MAAM,eAAe;AAAA,MAAM,iBAAiB,CAAC;AAAA,MAC7D,aAAa,CAAC;AAAA,MAAG,eAAe,CAAC;AAAA,MAAG,UAAU;AAAA,MAC9C,KAAK;AAAA,MAAO,YAAY;AAAA,IAC1B;AAEA,QAAI,KAAK,QAAQ,SAAS,KAAK,KAAK,MAAM,WAAW,GAAG;AACtD,aAAO,KAAK,KAAK,WAAW,OAAO;AAAA,IACrC;AAEA,UAAM,YAAY,eAAe,CAAC,GAAG,KAAK,CAAC,MAAM,KAAK,EAAE,KAAK,MAAM,EAAE;AACrE,QAAI,CAAC,UAAU;AACb,aAAO,KAAK,gBAAgB,UAAU,UAAU,SAAS;AAAA,IAC3D;AAKA,QAAI,WAAW,SAAS,cAAc,QAAQ,KAAK,cAAc,WAAW,GAAG;AAC7E,aAAO,KAAK,KAAK,WAAW,eAAe;AAAA,IAC7C;AAEA,UAAM,eAAe,eAAe,CAAC,GAAG,QAAQ,CAAC,MAAM,SAAS,CAAC,CAAC;AAClE,cAAU,kBAAkB;AAC5B,QAAI,YAAY,WAAW,GAAG;AAC5B,aAAO,KAAK,KAAK,WAAW,iBAAiB;AAAA,IAC/C;AAEA,UAAM,cAAc,IAAI,IAAI,WAAW;AACvC,QAAI,QAAQ;AACZ,eAAW,KAAK,YAAa,KAAI,CAAC,KAAK,YAAY,IAAI,CAAC,EAAG;AAC3D,UAAM,aAAa,YAAY,OAAO,QAAQ,YAAY,OAAO;AACjE,cAAU,iBAAiB,OAAO,UAAU;AAI5C,QACE,KAAK,YAAY,QAAQ,WAAW,yBACpC,cAAc,WAAW,WACzB;AACA,aAAO,KAAK,KAAK,WAAW,iBAAiB;AAAA,IAC/C;AAEA,QAAI,KAAK,aAAa,KAAK,SAAS,MAAM;AACxC,UAAI,KAAK,MAAM,WAAW,EAAG,QAAO,KAAK,KAAK,WAAW,cAAc;AACvE,WAAK,OAAO,IAAI,KAAK,KAAK,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AACpD,WAAK,YAAY;AAAA,IACnB;AAEA,UAAM,SAAS,KAAK,KAAK,OAAO,WAAW;AAC3C,UAAM,eAAe,KAAK,kBAAkB,UAAU,cAAc;AAEpE,UAAM,qBAAqB,KAAK;AAAA,MAC9B;AAAA,MACA,KAAK,IAAI,WAAW,MAAM,oBAAoB,YAAY,MAAM;AAAA,IAClE;AACA,cAAU,gBAAgB,OAAO,kBAAkB;AAEnD,UAAM,SAAgD,CAAC;AACvD,UAAM,WAAkE,CAAC;AAEzE,aAAS,MAAM,GAAG,MAAM,OAAO,QAAQ,OAAO;AAC5C,YAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,YAAM,QAAQ,OAAO,GAAG;AACxB,YAAM,SAAS,CAAC,WACd,SAAS,KAAK;AAAA,QACZ;AAAA,QACA,SAAS;AAAA,UACP,YAAY;AAAA,UAAK,WAAW,KAAK;AAAA,UAAU,WAAW,KAAK;AAAA,UAC3D,mBAAmB,KAAK,QAAQ,MAAM,GAAG,aAAa;AAAA,UACtD,YAAY,OAAO,KAAK;AAAA,UAAG;AAAA,QAC7B;AAAA,MACF,CAAC;AACH,UAAI,QAAQ,oBAAoB;AAAE,eAAO,iBAAiB;AAAG;AAAA,MAAU;AACvE,UAAI,CAAC,aAAa,IAAI,KAAK,QAAQ,GAAG;AAAE,eAAO,uBAAuB;AAAG;AAAA,MAAU;AACnF,aAAO,KAAK,EAAE,OAAO,KAAK,CAAC;AAAA,IAC7B;AAEA,aAAS,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACzC,cAAU,gBAAgB,SAAS,MAAM,GAAG,YAAY,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO;AAE9E,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,KAAK,KAAK,WAAW,0BAA0B;AAAA,IACxD;AAEA,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACvC,UAAM,MAAM,OAAO,MAAM,GAAG,QAAQ;AAEpC,UAAM,cAAc,oBAAI,IAAY;AACpC,eAAW,EAAE,KAAK,KAAK,IAAK,YAAW,KAAK,KAAK,OAAQ,aAAY,IAAI,CAAC;AAC1E,QAAI,UAAU;AACd,eAAW,KAAK,YAAa,KAAI,YAAY,IAAI,CAAC,EAAG;AACrD,UAAM,WAAW,YAAY,OAAO,UAAU,YAAY,OAAO;AACjE,cAAU,WAAW,OAAO,QAAQ;AAIpC,UAAM,cAAc,YAAY,8BAA8B;AAC9D,QAAI,gBAAgB,QAAQ,WAAW,aAAa;AAGlD,aAAO,KAAK,KAAK,WAAW,eAAe;AAAA,IAC7C;AAEA,UAAM,cAA4C,CAAC;AACnD,UAAM,YAAY,oBAAI,IAAY;AAClC,eAAW,EAAE,KAAK,KAAK,KAAK;AAC1B,OAAC,YAAY,KAAK,QAAQ,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ;AACtD,gBAAU,IAAI,KAAK,QAAQ;AAAA,IAC7B;AAIA,UAAM,eAAe,CAAC,WAAW,gCAAgC;AACjE,QAAI,cAAc;AAChB,YAAM,MAAM,KAAK,IAAI;AACrB,iBAAW,MAAM,WAAW;AAC1B,cAAM,QAAQ,KAAK,QAAQ,IAAI,EAAE;AACjC,YAAI,MAAO,OAAM,WAAW;AAAA,MAC9B;AAAA,IACF;AAEA,cAAU,MAAM;AAChB,cAAU,aAAa;AACvB,cAAU,cAAc,IAAI,IAAI,CAAC,EAAE,OAAO,KAAK,OAAO;AAAA,MACpD,WAAW,KAAK;AAAA,MAAU,WAAW,KAAK;AAAA,MAC1C,mBAAmB,KAAK,QAAQ,MAAM,GAAG,aAAa;AAAA,MAAG,YAAY,OAAO,KAAK;AAAA,IACnF,EAAE;AACF,SAAK,KAAK,SAAS;AAEnB,WAAO;AAAA,MACL;AAAA,MACA,WAAW,CAAC,GAAG,SAAS;AAAA,MACxB,OAAO,IAAI,CAAC,EAAG;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB,UAA0B;AACzC,QAAI,CAAC,WAAW,qCAAqC,EAAG,QAAO;AAC/D,WAAO,KAAK,WAAW,QAAQ;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,UAA0B;AACnC,QAAI,UAAU;AACd,eAAW,SAAS,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,GAAG;AAE9C,UAAI,MAAM,aAAa,UAAW;AAClC,UAAI,MAAM,aAAa,UAAU;AAAE,aAAK,WAAW,MAAM,QAAQ;AAAG;AAAA,MAAW;AAAA,IACjF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,WAAsC;AACpC,UAAM,yBAAyB;AAC/B,UAAM,eAAe,oBAAI,IAAoB;AAC7C,UAAM,gBAAgB,oBAAI,IAA0B;AACpD,eAAW,UAAU,KAAK,OAAO;AAC/B,YAAM,OAAO,cAAc,IAAI,OAAO,QAAQ;AAC9C,UAAI,SAAS,OAAW,eAAc,IAAI,OAAO,UAAU,CAAC,MAAM,CAAC;AAAA,UAC9D,MAAK,KAAK,MAAM;AAAA,IACvB;AAEA,UAAM,UAA4B,CAAC;AACnC,eAAW,CAAC,UAAU,KAAK,KAAK,KAAK,SAAS;AAC5C,YAAM,YAAY,oBAAI,IAAoB;AAC1C,YAAM,eAAsC,CAAC;AAC7C,iBAAW,UAAU,cAAc,IAAI,QAAQ,KAAK,CAAC,GAAG;AAItD,cAAM,QAAS,OAAO,SAAS,OAAO,KAAK;AAC3C,cAAM,MAAM,UAAU,OAAO,KAAK;AAClC,qBAAa,IAAI,MAAM,aAAa,IAAI,GAAG,KAAK,KAAK,CAAC;AACtD,kBAAU,IAAI,MAAM,UAAU,IAAI,GAAG,KAAK,KAAK,CAAC;AAChD,qBAAa,KAAK;AAAA,UAChB,MAAM,OAAO;AAAA,UACb;AAAA,UACA,SAAS,OAAO,QAAQ,MAAM,GAAG,sBAAsB;AAAA,QACzD,CAAC;AAAA,MACH;AACA,UAAI,aAAa;AACjB,iBAAW,KAAK,UAAU,OAAO,EAAG,eAAc;AAClD,cAAQ,KAAK;AAAA,QACX,WAAW;AAAA,QACX,WAAW,MAAM;AAAA,QACjB,iBAAiB,MAAM;AAAA,QACvB,aAAa,MAAM;AAAA,QACnB,gBAAgB,CAAC,GAAG,MAAM,aAAa;AAAA,QACvC,cAAc,OAAO,YAAY,SAAS;AAAA,QAC1C,aAAa;AAAA,QACb,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,MACL,eAAe,KAAK,QAAQ;AAAA,MAC5B,oBAAoB,KAAK,MAAM;AAAA,MAC/B,yBAAyB,OAAO,YAAY,YAAY;AAAA,MACxD,mBAAmB,KAAK,YAAY;AAAA,MACpC,qBAAqB,CAAC,GAAG,KAAK,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,EAAE;AAAA,MAC7D,cAAc,KAAK,MAAM,MAAM,GAAG,EAAE,EAAE,IAAI,CAAC,SAAS;AAAA,QAClD,WAAW,IAAI;AAAA,QACf,WAAW,IAAI;AAAA,QACf,QAAQ,IAAI,OAAO,MAAM,GAAG,EAAE;AAAA,QAC9B,SAAS,IAAI,QAAQ,MAAM,GAAG,sBAAsB;AAAA,MACtD,EAAE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,iBAAiB,gBAAgC;AAC/C,QAAI,CAAC,eAAgB,QAAO;AAC5B,QAAI,UAAU;AACd,eAAW,SAAS,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,GAAG;AAC9C,UAAI,MAAM,mBAAmB,gBAAgB;AAAE,aAAK,WAAW,MAAM,QAAQ;AAAG;AAAA,MAAW;AAAA,IAC7F;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QAAc;AACZ,SAAK,QAAQ,MAAM;AACnB,SAAK,QAAQ,CAAC;AACd,SAAK,YAAY,MAAM;AACvB,SAAK,OAAO;AACZ,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA,EAIQ,KAAK,WAA4B,QAA0B;AACjE,cAAU,aAAa;AACvB,cAAU,MAAM;AAChB,SAAK,KAAK,SAAS;AACnB,WAAO;AAAA,EACT;AAAA,EAEQ,KAAK,WAAkC;AAE7C,QAAI;AACF,WAAK,WAAW,SAAS;AAAA,IAC3B,QAAQ;AAAA,IAER;AAAA,EACF;AAAA,EAEQ,gBACN,UACA,UACA,WACqB;AACrB,UAAM,aAAa,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,EACzC,OAAO,CAAC,MAAM,aAAa,QAAQ,EAAE,aAAa,YAAY,EAAE,aAAa,SAAS,EACtF,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACzC,QAAI,WAAW,WAAW,EAAG,QAAO,KAAK,KAAK,WAAW,OAAO;AAEhE,UAAM,SAAS,WAAW,CAAC;AAC3B,UAAM,cAA4C,CAAC;AACnD,QAAI,IAAI;AACR,eAAW,QAAQ,KAAK,OAAO;AAC7B,UAAI,KAAK,aAAa,OAAO,SAAU;AACvC,UAAI,KAAK,SAAU;AACnB,OAAC,YAAY,KAAK,QAAQ,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ;AACtD;AAAA,IACF;AACA,QAAI,MAAM,EAAG,QAAO,KAAK,KAAK,WAAW,OAAO;AAEhD,cAAU,MAAM;AAChB,cAAU,aAAa;AACvB,SAAK,KAAK,SAAS;AACnB,WAAO,EAAE,aAAa,WAAW,CAAC,OAAO,QAAQ,GAAG,OAAO,GAAG,UAAU,EAAI;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,mBACN,UAAyB,YAA2B,UACvC;AACb,UAAM,WAAW,oBAAI,IAAY,CAAC,SAAS,CAAC;AAC5C,QAAI,SAAU,UAAS,IAAI,QAAQ;AACnC,QAAI,WAAY,UAAS,IAAI,UAAU;AACvC,QAAI,SAAU,UAAS,IAAI,QAAQ;AACnC,WAAO;AAAA,EACT;AAAA,EAEQ,kBAAkB,UAAuB,gBAA4C;AAC3F,UAAM,QAAQ,oBAAI,IAAY;AAC9B,eAAW,SAAS,KAAK,QAAQ,OAAO,GAAG;AACzC,UAAI,CAAC,SAAS,IAAI,MAAM,QAAQ,EAAG;AAEnC,UAAI,MAAM,kBAAkB,kBAAkB,MAAM,mBAAmB,eAAgB;AACvF,YAAM,IAAI,MAAM,QAAQ;AAAA,IAC1B;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,aAAa,OAA4B;AAC/C,QAAI,CAAC,WAAW,gCAAgC,EAAG,QAAO,KAAK;AAC/D,QAAI,MAAM,kBAAkB,QAAQ,MAAM,kBAAkB,EAAG,QAAO,KAAK;AAE3E,WAAO,KAAK,IAAI,KAAK,YAAY,MAAM,cAAc;AAAA,EACvD;AAAA,EAEQ,eAAqB;AAC3B,UAAM,MAAM,KAAK,IAAI;AAIrB,UAAM,mBAAmB,YAAY,+BAA+B;AACpE,UAAM,SAAS,oBAAoB,KAAK,aAAa;AAErD,eAAW,SAAS,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,GAAG;AAC9C,YAAM,cAAc,MAAM,MAAM,WAAW,KAAK,aAAa,KAAK;AAClE,YAAM,aAAa,SAAS,KAAK,MAAM,MAAM,YAAY;AACzD,UAAI,eAAe,WAAY,MAAK,WAAW,MAAM,QAAQ;AAAA,IAC/D;AAAA,EACF;AAAA,EAEQ,WAAW,UAAwB;AACzC,QAAI,CAAC,KAAK,QAAQ,OAAO,QAAQ,EAAG;AACpC,SAAK,QAAQ,KAAK,MAAM,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ;AAG7D,SAAK,cAAc,IAAI,IAAI,KAAK,MAAM,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;AAC9D,SAAK,YAAY;AAAA,EACnB;AACF;AAEA,SAAS,eAAuB;AAI9B,SAAO,OAAO,gBAAgB,eAAe,OAAO,YAAY,QAAQ,aACpE,YAAY,IAAI,IAAI,MACpB,KAAK,IAAI,IAAI;AACnB;AAEA,SAAS,OAAO,GAAmB;AACjC,SAAO,OAAO,EAAE,QAAQ,CAAC,CAAC;AAC5B;","names":[]}
+{"version":3,"sources":["../src/behavior/anticipation.json","../src/behavior/contract.ts","../src/cache/bm25.ts","../src/context/anticipation-cache.ts"],"sourcesContent":["{\n  \"$comment\": \"SOURCE OF TRUTH for anticipation-cache behavior, shared by the Python and JS/TS SDKs. Do not duplicate these values into either SDK's source. See ../README.md. Regexes are restricted to the intersection of Python 're' and ECMAScript; both SDKs have a parity test.\",\n  \"version\": 1,\n  \"recall_bypass\": {\n    \"note\": \"WS4 of the playground query-hygiene plan. A recall-shaped question never serves from the anticipation cache. Asymmetric cost is why: a stale false-hit makes the agent answer 'I don't see that' while the store holds the fact (the BZQR6J cross-session failure), whereas bypassing costs only cold-fetch latency on a turn where the user already expects a lookup. Stem coverage cannot gate this \\u2014 false hits were measured at coverage=1.00. Ties break toward INCLUDING a pattern.\",\n    \"env_flag\": \"SYNAP_SDK_CACHE_RECALL_BYPASS\",\n    \"default\": false,\n    \"patterns\": [\n      {\n        \"pattern\": \"\\\\bremind me\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4, playground query-hygiene plan).\"\n      },\n      {\n        \"pattern\": \"\\\\bon file\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\b(your|my|the) records\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bdo you (have|know|remember|recall|see)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhat (do|did) (i|you) (say|tell|mention|have)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhat('s| is) my\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhere (am i|do i live)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bhow long have i\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhich of my\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\bwhat .{0,40}\\\\b(again|earlier|last time|previously|yesterday)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4). 'again' alone is deliberately NOT a marker: 'book me a ride again' is a task query, not a recall query.\"\n      },\n      {\n        \"pattern\": \"\\\\bwill you use to (contact|reach|notify)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"Original set (WS4).\"\n      },\n      {\n        \"pattern\": \"\\\\b(confirm|verify|double.?check)\\\\b.{0,40}\\\\bmy\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11: 'can you confirm my email address?' served a stale bundle. Also catches 'confirm my booking' \\u2014 an intentional over-match, costing one cloud fetch.\"\n      },\n      {\n        \"pattern\": \"\\\\b(linked to|associated with|registered (to|on|with)) my\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11: 'what name is linked to my Uber account?' served a stale bundle.\"\n      },\n      {\n        \"pattern\": \"\\\\b(best|preferred) way to (reach|contact|update|notify) me\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11: 'best way to contact me with updates' served a stale bundle.\"\n      },\n      {\n        \"pattern\": \"\\\\bhow (do|will|can|should) you (reach|contact|notify) me\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11, sibling phrasing of the above.\"\n      },\n      {\n        \"pattern\": \"\\\\bwhich .{0,40}\\\\b(are|will) you (going to )?(use|using)\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11: 'which email are you going to use?' served a stale bundle.\"\n      },\n      {\n        \"pattern\": \"\\\\bon (my|the) account\\\\b\",\n        \"flags\": \"i\",\n        \"note\": \"2026-07-16 eval register issue #11.\"\n      }\n    ]\n  },\n  \"thresholds\": {\n    \"bm25\": {\n      \"value\": 1.5,\n      \"note\": \"Nominal threshold. The value actually applied is derived per query: max(effective_floor, min(bm25, query_token_scale * len(query_tokens))). Short queries cannot reach the nominal score, so holding them to it would miss every time.\"\n    },\n    \"novel_term\": {\n      \"value\": 0.45,\n      \"note\": \"Fraction of query stems absent from the cached corpus that forces a miss.\"\n    },\n    \"min_corpus_for_novel_gate\": {\n      \"value\": 200,\n      \"note\": \"The novel-term gate is meaningless on a small corpus, where the ratio is dominated by ordinary English word forms. Measured: a fresh playground conversation reaches ~60 stems after the first push and would trip the 0.45 gate on essentially every second-turn query. 200 means the gate engages once a customer has ~3-4 typical bundles cached.\"\n    },\n    \"effective_floor\": {\n      \"value\": 0.6,\n      \"note\": \"Lower bound on the derived per-query threshold. Below this, BM25 stops discriminating.\"\n    },\n    \"query_token_scale\": {\n      \"value\": 0.3,\n      \"note\": \"Scales the threshold down for short queries: 0.3 points of score per query token.\"\n    }\n  },\n  \"bm25\": {\n    \"k1\": 1.5,\n    \"b\": 0.75,\n    \"idf_floor\": 0.5,\n    \"min_token_len\": 2,\n    \"min_stem_len\": 4,\n    \"suffixes\": [\n      \"ences\",\n      \"ances\",\n      \"ation\",\n      \"tion\",\n      \"sion\",\n      \"ence\",\n      \"ance\",\n      \"ness\",\n      \"ment\",\n      \"able\",\n      \"ible\",\n      \"ical\",\n      \"ally\",\n      \"ies\",\n      \"ive\",\n      \"ful\",\n      \"ous\",\n      \"ing\",\n      \"ary\",\n      \"ly\",\n      \"ed\",\n      \"es\",\n      \"s\"\n    ],\n    \"stop_words\": [\n      \"a\",\n      \"about\",\n      \"after\",\n      \"an\",\n      \"and\",\n      \"are\",\n      \"at\",\n      \"be\",\n      \"been\",\n      \"before\",\n      \"being\",\n      \"but\",\n      \"by\",\n      \"can\",\n      \"could\",\n      \"did\",\n      \"do\",\n      \"does\",\n      \"for\",\n      \"from\",\n      \"had\",\n      \"has\",\n      \"have\",\n      \"how\",\n      \"if\",\n      \"in\",\n      \"into\",\n      \"is\",\n      \"it\",\n      \"its\",\n      \"may\",\n      \"might\",\n      \"no\",\n      \"nor\",\n      \"not\",\n      \"of\",\n      \"on\",\n      \"or\",\n      \"over\",\n      \"should\",\n      \"so\",\n      \"than\",\n      \"that\",\n      \"the\",\n      \"then\",\n      \"these\",\n      \"this\",\n      \"those\",\n      \"to\",\n      \"was\",\n      \"were\",\n      \"what\",\n      \"when\",\n      \"where\",\n      \"which\",\n      \"who\",\n      \"whom\",\n      \"why\",\n      \"will\",\n      \"with\",\n      \"would\"\n    ],\n    \"alias_token\": {\n      \"pattern\": \"\\\\[\\\\[([A-Za-z][A-Za-z0-9_]*_[a-z0-9]{12})\\\\]\\\\]\",\n      \"note\": \"An alias label as it appears in text: [[PERSON_PHONE_h2n7v5cx8m0d]]. Kept whole rather than split, because 'person' and 'phone' are boilerplate shared by every label of that field type and would make two different people's memories score alike. Mirrors synap/cloud/shared/tokenizer.py \\u2014 keep the two in step.\"\n    },\n    \"suffix_note\": \"Order matters: longest-first, because _stem returns on first match. Reordering this list silently changes every stem and therefore every BM25 score.\"\n  },\n  \"env_flags\": {\n    \"$comment\": \"Read at CALL time, never at module load. Python does os.environ.get inside the function bodies; JS must do the same or late process.env mutation stops working and the flag looks broken. See gotcha G-S.\",\n    \"SYNAP_SDK_CACHE_RECALL_BYPASS\": {\n      \"default\": false,\n      \"truthy\": [\n        \"true\",\n        \"1\",\n        \"yes\"\n      ]\n    },\n    \"SYNAP_SDK_CACHE_HONOR_TTL_HINT\": {\n      \"default\": false,\n      \"truthy\": [\n        \"true\",\n        \"1\",\n        \"yes\"\n      ],\n      \"note\": \"A bundle's server ttl_hint_seconds may only SHORTEN the global TTL, never extend it.\"\n    },\n    \"SYNAP_SDK_CACHE_INVALIDATE_ON_WRITE\": {\n      \"default\": false,\n      \"truthy\": [\n        \"true\",\n        \"1\",\n        \"yes\"\n      ],\n      \"note\": \"2026-07-16 eval register issue #8: the cloud invalidates its own Redis caches on ingest, but that stops at the process boundary.\"\n    },\n    \"SYNAP_SDK_CACHE_MAX_ENTRY_AGE\": {\n      \"default\": null,\n      \"note\": \"2026-07-16 eval register issue #6: stored_at is a sliding lease renewed on hit, so under steady traffic a pre-update snapshot never expired. Defaults to 2x the sliding TTL; 0 disables.\"\n    },\n    \"SYNAP_SDK_CACHE_COVERAGE_MIN\": {\n      \"default\": null\n    }\n  },\n  \"coverage_gate\": {\n    \"note\": \"Fraction of the query's stems present in the picked items. A bundle can clear the BM25 threshold on one shared token ('account') while lacking the asked-for fact entirely: the false HIT behind the eval's 'forgot the name' failure. ALWAYS computed and reported; ENFORCED only when SYNAP_SDK_CACHE_COVERAGE_MIN is explicitly set, so default behavior is unchanged. When it does fire it must gate BEFORE any side effect, so a rejected lookup leaves cache state untouched.\",\n    \"env_flag\": \"SYNAP_SDK_CACHE_COVERAGE_MIN\",\n    \"default\": null,\n    \"empty_query_coverage\": 1.0\n  },\n  \"telemetry\": {\n    \"rejected_items_cap\": {\n      \"value\": 20,\n      \"note\": \"Rejected items reported per lookup, highest score first, so a large cache cannot bloat the payload.\"\n    },\n    \"content_preview_chars\": 120\n  }\n}\n","/**\n * Loader for the shared SDK behavior contract.\n *\n * The values here are tuned against measured eval failures and are shared,\n * byte-identical, with the Python SDK. They live in data rather than code\n * specifically so the two SDKs cannot drift. See\n * `synap/sdk/CONTRACT/README.md`.\n *\n * `anticipation.json` is vendored into `src/` by\n * `synap/sdk/scripts/sync-behavior.sh` and imported (not read from disk) so\n * that the bundler inlines it. Reading it with `node:fs` at runtime would work\n * in Node and break in every bundled target: Edge, Workers, and anything under\n * webpack/turbopack, where `dist/` is rewritten and relative paths do not\n * survive. It is the same failure mode as `@grpc/proto-loader` reading a\n * `.proto` off disk (gotcha G-P).\n */\n\nimport contractJson from './anticipation.json' with { type: 'json' };\n\nexport interface RecallPattern {\n  pattern: string;\n  flags: string;\n  note: string;\n}\n\nexport interface BehaviorContract {\n  version: number;\n  recall_bypass: {\n    note: string;\n    env_flag: string;\n    default: boolean;\n    patterns: RecallPattern[];\n  };\n  thresholds: {\n    bm25: { value: number; note: string };\n    novel_term: { value: number; note: string };\n    min_corpus_for_novel_gate: { value: number; note: string };\n    effective_floor: { value: number; note: string };\n    query_token_scale: { value: number; note: string };\n  };\n  coverage_gate: {\n    note: string;\n    env_flag: string;\n    default: number | null;\n    empty_query_coverage: number;\n  };\n  telemetry: {\n    rejected_items_cap: { value: number; note: string };\n    content_preview_chars: number;\n  };\n  bm25: {\n    k1: number;\n    b: number;\n    idf_floor: number;\n    min_token_len: number;\n    min_stem_len: number;\n    suffixes: string[];\n    stop_words: string[];\n    alias_token: { pattern: string; note: string };\n  };\n}\n\nexport const CONTRACT = contractJson as unknown as BehaviorContract;\n\n/** ECMAScript flags we accept. Anything else is invalid in Python too. */\nconst ALLOWED_FLAGS = new Set(['i', 'm', 's']);\n\nfunction compile(pattern: string, flags: string): RegExp {\n  for (const ch of flags) {\n    if (!ALLOWED_FLAGS.has(ch)) {\n      throw new Error(\n        `Unsupported regex flag '${ch}' in behavior contract. Flags must be ` +\n          `valid in both Python and ECMAScript.`,\n      );\n    }\n  }\n  return new RegExp(pattern, flags);\n}\n\n/**\n * Compiled recall-bypass patterns, in contract order.\n *\n * Deliberately NOT using the `g` flag: a global RegExp carries `lastIndex`\n * between calls, so a shared instance would match on one query and then miss\n * on the next. That failure is intermittent and traffic-dependent, which is\n * the worst kind to debug.\n */\nexport const RECALL_PATTERNS: readonly RegExp[] = CONTRACT.recall_bypass.patterns.map((p) =>\n  compile(p.pattern, p.flags ?? ''),\n);\n\nexport const THRESHOLDS = {\n  bm25: CONTRACT.thresholds.bm25.value,\n  novelTerm: CONTRACT.thresholds.novel_term.value,\n  minCorpusForNovelGate: CONTRACT.thresholds.min_corpus_for_novel_gate.value,\n  /** Lower bound on the derived per-query threshold. */\n  effectiveFloor: CONTRACT.thresholds.effective_floor.value,\n  /** Points of score allowed per query token when deriving the threshold. */\n  queryTokenScale: CONTRACT.thresholds.query_token_scale.value,\n} as const;\n\nexport const BM25_PARAMS = CONTRACT.bm25;\nexport const STOP_WORDS: ReadonlySet<string> = new Set(CONTRACT.bm25.stop_words);\n// Order is load-bearing: stem() returns on first match, so this must stay\n// longest-first exactly as the contract lists it.\nexport const SUFFIXES: readonly string[] = CONTRACT.bm25.suffixes;\nexport const ALIAS_TOKEN_SOURCE = CONTRACT.bm25.alias_token.pattern;\n\n/** True when any query string looks like an explicit memory-recall ask. */\nexport function isRecallQuery(searchQuery: readonly (string | null | undefined)[] | null | undefined): boolean {\n  for (const q of searchQuery ?? []) {\n    if (!q) continue;\n    for (const pattern of RECALL_PATTERNS) {\n      if (pattern.test(q)) return true;\n    }\n  }\n  return false;\n}\n","/**\n * BM25 scorer for the anticipation cache.\n *\n * A faithful port of `maximem_synap/cache/bm25.py`. Every tuned value comes\n * from the shared behavior contract, so the two implementations cannot drift\n * on parameters. What they *can* still drift on is arithmetic, which is what\n * the shared conformance corpus is for.\n */\n\nimport { BM25_PARAMS, STOP_WORDS, SUFFIXES, ALIAS_TOKEN_SOURCE } from '../behavior/contract.js';\n\nconst MIN_STEM_LEN = BM25_PARAMS.min_stem_len;\nconst MIN_TOKEN_LEN = BM25_PARAMS.min_token_len;\n\nexport function stem(word: string): string {\n  // Order is load-bearing: longest suffix first, return on first match.\n  for (const suffix of SUFFIXES) {\n    if (word.endsWith(suffix) && word.length - suffix.length >= MIN_STEM_LEN) {\n      return word.slice(0, word.length - suffix.length);\n    }\n  }\n  return word;\n}\n\n/**\n * An alias label, as it appears in text: `[[PERSON_PHONE_h2n7v5cx8m0d]]`.\n *\n * Kept whole rather than split into `person`, `phone` and the suffix, because\n * the first two are boilerplate shared by every label of that field type and\n * would make two different people's memories score alike.\n *\n * Mirrors `synap/cloud/shared/tokenizer.py`. Keep the two in step.\n */\nfunction aliasTokenRe(): RegExp {\n  // Constructed per call because `g` regexes carry `lastIndex`, and this one\n  // is used with replace(). A module-level shared instance would produce\n  // different results on alternating calls.\n  return new RegExp(ALIAS_TOKEN_SOURCE, 'g');\n}\n\nconst WORD_RE = /[a-z0-9]+/g;\n\n/** Tokenize, lowercase, remove stop words, and stem. Alias labels survive whole. */\nexport function tokenize(text: string | null | undefined): string[] {\n  if (!text) return [];\n\n  const labels: string[] = [];\n  const remainder = text.replace(aliasTokenRe(), (_match, captured: string) => {\n    labels.push(captured.toLowerCase());\n    return ' ';\n  });\n\n  const words = remainder.toLowerCase().match(WORD_RE) ?? [];\n  const out = labels.slice();\n  for (const w of words) {\n    if (w.length >= MIN_TOKEN_LEN && !STOP_WORDS.has(w)) out.push(stem(w));\n  }\n  return out;\n}\n\n/** Okapi BM25 scorer over a small in-memory corpus. */\nexport class BM25 {\n  static readonly IDF_FLOOR = BM25_PARAMS.idf_floor;\n\n  readonly k1: number;\n  readonly b: number;\n  readonly corpus: readonly (readonly string[])[];\n  readonly docCount: number;\n  readonly avgdl: number;\n  readonly docLens: readonly number[];\n  readonly idf: ReadonlyMap<string, number>;\n\n  constructor(\n    corpus: readonly (readonly string[])[],\n    k1: number = BM25_PARAMS.k1,\n    b: number = BM25_PARAMS.b,\n  ) {\n    this.k1 = k1;\n    this.b = b;\n    this.corpus = corpus;\n    this.docCount = corpus.length;\n    this.docLens = corpus.map((doc) => doc.length);\n    // Python falls back to 1.0 rather than dividing by zero on an empty corpus.\n    this.avgdl = this.docCount\n      ? this.docLens.reduce((a, n) => a + n, 0) / this.docCount\n      : 1.0;\n\n    const idf = new Map<string, number>();\n    const allTerms = new Set<string>();\n    for (const doc of corpus) for (const t of doc) allTerms.add(t);\n    for (const term of allTerms) {\n      let df = 0;\n      for (const doc of corpus) if (doc.includes(term)) df++;\n      const raw = Math.log((this.docCount - df + 0.5) / (df + 0.5) + 1.0);\n      idf.set(term, Math.max(raw, BM25.IDF_FLOOR));\n    }\n    this.idf = idf;\n  }\n\n  score(queryTokens: readonly string[], docIdx: number): number {\n    const doc = this.corpus[docIdx];\n    if (doc === undefined) return 0;\n    const dl = this.docLens[docIdx] ?? 0;\n\n    const tfMap = new Map<string, number>();\n    for (const t of doc) tfMap.set(t, (tfMap.get(t) ?? 0) + 1);\n\n    let s = 0;\n    for (const term of queryTokens) {\n      const tf = tfMap.get(term);\n      if (tf === undefined) continue;\n      const idf = this.idf.get(term) ?? BM25.IDF_FLOOR;\n      const numerator = tf * (this.k1 + 1);\n      const denominator = tf + this.k1 * (1 - this.b + (this.b * dl) / this.avgdl);\n      s += (idf * numerator) / denominator;\n    }\n    return s;\n  }\n\n  scores(queryTokens: readonly string[]): number[] {\n    return this.corpus.map((_, i) => this.score(queryTokens, i));\n  }\n}\n","/**\n * In-memory TTL cache for context bundles pushed over gRPC.\n *\n * Port of `maximem_synap/cache/anticipation_cache.py`.\n *\n * ## Why this is a faithful port and not a simplification\n *\n * `@maximem/synap-vercel-adk` already contains a native TS anticipation cache,\n * and it is a simplification: a hardcoded 30-minute TTL, a plain BM25 threshold\n * with no per-query derivation, and none of the gates below. Shipping that as\n * the SDK's cache would mean two retrieval behaviors under one brand, which is\n * gotcha G-C. Every gate here exists because a specific eval failed without it:\n *\n *  - **Recall bypass** runs BEFORE scoring. The measured false hit scored 2.86\n *    at coverage 1.00, so no score-side gate could ever have caught it.\n *  - **The novel-term gate** is suppressed below a 200-stem corpus, because at\n *    cold start ordinary English trips it on nearly every query.\n *  - **The per-query threshold** scales down for short queries, which otherwise\n *    cannot reach the nominal score at all.\n *  - **The coverage gate** catches a bundle that clears BM25 on one shared\n *    token (\"account\") while lacking the asked-for fact.\n *\n * All thresholds come from the shared behavior contract.\n */\n\nimport { BM25, tokenize } from '../cache/bm25.js';\nimport { CONTRACT, THRESHOLDS, isRecallQuery } from '../behavior/contract.js';\nimport { getEnvFlag, getEnvFloat } from '../util/env.js';\n\nconst EFFECTIVE_FLOOR = CONTRACT.thresholds.effective_floor.value;\nconst QUERY_TOKEN_SCALE = CONTRACT.thresholds.query_token_scale.value;\nconst REJECTED_CAP = CONTRACT.telemetry.rejected_items_cap.value;\nconst PREVIEW_CHARS = CONTRACT.telemetry.content_preview_chars;\n\n/** Sentinel scope that matches any requester. */\nexport const ANY_SCOPE = '_any';\n\nexport interface BundleItem {\n  item_id?: string;\n  content?: string;\n  [key: string]: unknown;\n}\n\nexport interface ContextBundle {\n  bundleId: string;\n  entityId?: string | null;\n  conversationId?: string | null;\n  itemsByType: Record<string, BundleItem[]>;\n  /** Server hint; may only SHORTEN the global TTL, never extend it. */\n  ttlHintSeconds?: number | null;\n  /** Which anticipation pattern produced this bundle. Diagnostics only. */\n  bundleType?: string | null;\n  /** The queries the server anticipated. Diagnostics only. */\n  searchQueries?: readonly string[] | null;\n}\n\ninterface ItemRecord {\n  bundleId: string;\n  itemType: string;\n  content: string;\n  tokens: string[];\n  itemDict: BundleItem;\n}\n\ninterface EntryRecord {\n  bundleId: string;\n  entityId: string;\n  conversationId: string | null;\n  bundleType: string | null;\n  searchQueries: string[];\n  /** Sliding lease, refreshed on hit unless TTL hints are honoured. */\n  storedAt: number;\n  /** Absolute creation time; the max-entry-age cap uses this, not the lease. */\n  createdAt: number;\n  ttlHintSeconds: number | null;\n}\n\nexport interface LookupResult {\n  itemsByType: Record<string, BundleItem[]>;\n  bundleIds: string[];\n  score: number;\n  coverage: number;\n}\n\nexport interface LookupParams {\n  searchQuery?: readonly string[] | null;\n  entityId?: string | null;\n  customerId?: string | null;\n  clientId?: string | null;\n  conversationId?: string | null;\n  maxItems?: number;\n}\n\nexport type ExitReason =\n  | 'empty'\n  | 'recall_bypass'\n  | 'no_query_tokens'\n  | 'novel_term_gate'\n  | 'empty_corpus'\n  | 'no_items_above_threshold'\n  | 'coverage_gate'\n  | 'hit';\n\nexport interface LookupTelemetry {\n  searchQuery: string[];\n  entityId: string | null;\n  customerId: string | null;\n  clientId: string | null;\n  conversationId: string | null;\n  scopeFilterAccepted: string[];\n  novelTermRatio: number | null;\n  bm25Threshold: number | null;\n  bm25QueryTokens: string[];\n  itemsPicked: unknown[];\n  itemsRejected: unknown[];\n  coverage: number | null;\n  hit: boolean;\n  exitReason: ExitReason;\n}\n\nexport interface SnapshotItemPreview {\n  type: string;\n  scope: string | null;\n  content: string;\n}\n\nexport interface SnapshotItemRecord {\n  bundle_id: string;\n  item_type: string;\n  tokens: string[];\n  content: string;\n}\n\nexport interface SnapshotBundle {\n  bundle_id: string;\n  entity_id: string;\n  conversation_id: string | null;\n  bundle_type: string | null;\n  search_queries: string[];\n  scope_counts: Record<string, number>;\n  total_items: number;\n  items: SnapshotItemPreview[];\n}\n\nexport interface AnticipationCacheSnapshot {\n  total_entries: number;\n  total_item_records: number;\n  scope_breakdown_overall: Record<string, number>;\n  corpus_vocab_size: number;\n  corpus_vocab_sample: string[];\n  item_records: SnapshotItemRecord[];\n  bundles: SnapshotBundle[];\n}\n\nexport interface AnticipationCacheOptions {\n  ttlSeconds?: number;\n  maxBundles?: number;\n  /** Injected in tests. Defaults to a monotonic clock. */\n  now?: () => number;\n  onLookup?: (telemetry: LookupTelemetry) => void;\n}\n\nconst DEFAULT_TTL_SECONDS = 1800;\nconst DEFAULT_MAX_BUNDLES = 50;\n\nexport class AnticipationCache {\n  private readonly ttlSeconds: number;\n  private readonly maxBundles: number;\n  private readonly now: () => number;\n  private readonly onLookup: ((t: LookupTelemetry) => void) | undefined;\n\n  private entries = new Map<string, EntryRecord>();\n  private items: ItemRecord[] = [];\n  private corpusVocab = new Set<string>();\n  private bm25: BM25 | null = null;\n  private bm25Dirty = true;\n\n  constructor(options: AnticipationCacheOptions = {}) {\n    this.ttlSeconds = options.ttlSeconds ?? DEFAULT_TTL_SECONDS;\n    this.maxBundles = options.maxBundles ?? DEFAULT_MAX_BUNDLES;\n    this.now = options.now ?? monotonicNow;\n    this.onLookup = options.onLookup;\n  }\n\n  get size(): number {\n    return this.entries.size;\n  }\n\n  get itemCount(): number {\n    return this.items.length;\n  }\n\n  store(bundle: ContextBundle): void {\n    if (!bundle.bundleId) return;\n    this.evictExpired();\n\n    // Client-scope knowledge (FAQs, policies) arrives with no entity, and the\n    // sentinel makes it visible to every requester.\n    const entityId = bundle.entityId || ANY_SCOPE;\n\n    if (this.entries.has(bundle.bundleId)) this.dropBundle(bundle.bundleId);\n\n    const now = this.now();\n    this.entries.set(bundle.bundleId, {\n      bundleId: bundle.bundleId,\n      entityId,\n      conversationId: bundle.conversationId ?? null,\n      bundleType: bundle.bundleType ?? null,\n      searchQueries: [...(bundle.searchQueries ?? [])],\n      storedAt: now,\n      createdAt: now,\n      ttlHintSeconds: bundle.ttlHintSeconds ?? null,\n    });\n\n    for (const [itemType, list] of Object.entries(bundle.itemsByType ?? {})) {\n      for (const item of list ?? []) {\n        const content = String(item.content ?? '');\n        const tokens = tokenize(content);\n        this.items.push({ bundleId: bundle.bundleId, itemType, content, tokens, itemDict: item });\n        for (const t of tokens) this.corpusVocab.add(t);\n      }\n    }\n    this.bm25Dirty = true;\n\n    // LRU by lease age.\n    while (this.entries.size > this.maxBundles) {\n      let oldest: EntryRecord | null = null;\n      for (const e of this.entries.values()) {\n        if (oldest === null || e.storedAt < oldest.storedAt) oldest = e;\n      }\n      if (oldest === null) break;\n      this.dropBundle(oldest.bundleId);\n    }\n  }\n\n  lookup(params: LookupParams): LookupResult | null {\n    const {\n      searchQuery = null, entityId = null, customerId = null,\n      clientId = null, conversationId = null, maxItems = 10,\n    } = params;\n\n    this.evictExpired();\n\n    const accepted = this.buildAcceptedScope(entityId, customerId, clientId);\n    const telemetry: LookupTelemetry = {\n      searchQuery: (searchQuery ?? []).filter((q): q is string => Boolean(q)),\n      entityId, customerId, clientId, conversationId,\n      scopeFilterAccepted: [...accepted].sort(),\n      novelTermRatio: null, bm25Threshold: null, bm25QueryTokens: [],\n      itemsPicked: [], itemsRejected: [], coverage: null,\n      hit: false, exitReason: 'empty',\n    };\n\n    if (this.entries.size === 0 || this.items.length === 0) {\n      return this.miss(telemetry, 'empty');\n    }\n\n    const hasQuery = (searchQuery ?? []).some((q) => q && q.trim() !== '');\n    if (!hasQuery) {\n      return this.freshnessLookup(entityId, maxItems, telemetry);\n    }\n\n    // Recall bypass fires BEFORE scoring: a stale false-hit on a recall-shaped\n    // question makes the agent deny a fact the store holds, and the measured\n    // failure cleared every score-side gate.\n    if (getEnvFlag(CONTRACT.recall_bypass.env_flag) && isRecallQuery(searchQuery)) {\n      return this.miss(telemetry, 'recall_bypass');\n    }\n\n    const queryTokens = (searchQuery ?? []).flatMap((q) => tokenize(q));\n    telemetry.bm25QueryTokens = queryTokens;\n    if (queryTokens.length === 0) {\n      return this.miss(telemetry, 'no_query_tokens');\n    }\n\n    const uniqueStems = new Set(queryTokens);\n    let novel = 0;\n    for (const s of uniqueStems) if (!this.corpusVocab.has(s)) novel++;\n    const novelRatio = uniqueStems.size ? novel / uniqueStems.size : 0;\n    telemetry.novelTermRatio = round4(novelRatio);\n\n    // Only meaningful once the corpus has real vocabulary. Below the floor the\n    // ratio is dominated by ordinary English and would miss on nearly anything.\n    if (\n      this.corpusVocab.size >= THRESHOLDS.minCorpusForNovelGate &&\n      novelRatio >= THRESHOLDS.novelTerm\n    ) {\n      return this.miss(telemetry, 'novel_term_gate');\n    }\n\n    if (this.bm25Dirty || this.bm25 === null) {\n      if (this.items.length === 0) return this.miss(telemetry, 'empty_corpus');\n      this.bm25 = new BM25(this.items.map((i) => i.tokens));\n      this.bm25Dirty = false;\n    }\n\n    const scores = this.bm25.scores(queryTokens);\n    const validBundles = this.getValidBundleIds(accepted, conversationId);\n\n    const effectiveThreshold = Math.max(\n      EFFECTIVE_FLOOR,\n      Math.min(THRESHOLDS.bm25, QUERY_TOKEN_SCALE * queryTokens.length),\n    );\n    telemetry.bm25Threshold = round4(effectiveThreshold);\n\n    const picked: { score: number; item: ItemRecord }[] = [];\n    const rejected: { score: number; payload: Record<string, unknown> }[] = [];\n\n    for (let idx = 0; idx < scores.length; idx++) {\n      const item = this.items[idx]!;\n      const score = scores[idx]!;\n      const reject = (reason: string) =>\n        rejected.push({\n          score,\n          payload: {\n            item_index: idx, bundle_id: item.bundleId, item_type: item.itemType,\n            content_first_120: item.content.slice(0, PREVIEW_CHARS),\n            bm25_score: round4(score), reason,\n          },\n        });\n      if (score < effectiveThreshold) { reject('below_threshold'); continue; }\n      if (!validBundles.has(item.bundleId)) { reject('scope_filter_excluded'); continue; }\n      picked.push({ score, item });\n    }\n\n    rejected.sort((a, b) => b.score - a.score);\n    telemetry.itemsRejected = rejected.slice(0, REJECTED_CAP).map((r) => r.payload);\n\n    if (picked.length === 0) {\n      return this.miss(telemetry, 'no_items_above_threshold');\n    }\n\n    picked.sort((a, b) => b.score - a.score);\n    const top = picked.slice(0, maxItems);\n\n    const pickedStems = new Set<string>();\n    for (const { item } of top) for (const t of item.tokens) pickedStems.add(t);\n    let overlap = 0;\n    for (const s of uniqueStems) if (pickedStems.has(s)) overlap++;\n    const coverage = uniqueStems.size ? overlap / uniqueStems.size : 1.0;\n    telemetry.coverage = round4(coverage);\n\n    // Observe-only unless explicitly configured. A malformed setting stays\n    // observe-only rather than failing closed on every lookup.\n    const coverageMin = getEnvFloat('SYNAP_SDK_CACHE_COVERAGE_MIN');\n    if (coverageMin !== null && coverage < coverageMin) {\n      // Gate BEFORE any side effect, so a rejected lookup leaves cache state\n      // untouched and does not refresh a lease.\n      return this.miss(telemetry, 'coverage_gate');\n    }\n\n    const itemsByType: Record<string, BundleItem[]> = {};\n    const bundleIds = new Set<string>();\n    for (const { item } of top) {\n      (itemsByType[item.itemType] ??= []).push(item.itemDict);\n      bundleIds.add(item.bundleId);\n    }\n\n    // Honouring a TTL hint also means a hit stops renewing the lease, otherwise\n    // a hinted bundle under steady traffic would outlive its hint.\n    const refreshOnHit = !getEnvFlag('SYNAP_SDK_CACHE_HONOR_TTL_HINT');\n    if (refreshOnHit) {\n      const now = this.now();\n      for (const id of bundleIds) {\n        const entry = this.entries.get(id);\n        if (entry) entry.storedAt = now;\n      }\n    }\n\n    telemetry.hit = true;\n    telemetry.exitReason = 'hit';\n    telemetry.itemsPicked = top.map(({ score, item }) => ({\n      bundle_id: item.bundleId, item_type: item.itemType,\n      content_first_120: item.content.slice(0, PREVIEW_CHARS), bm25_score: round4(score),\n    }));\n    this.fire(telemetry);\n\n    return {\n      itemsByType,\n      bundleIds: [...bundleIds],\n      score: top[0]!.score,\n      coverage,\n    };\n  }\n\n  /**\n   * Drop this entity's bundles after a write, so the cache stops serving a\n   * pre-write view. Gated on the flag: this is the write-path hook.\n   */\n  invalidateEntity(entityId: string): number {\n    if (!getEnvFlag('SYNAP_SDK_CACHE_INVALIDATE_ON_WRITE')) return 0;\n    return this.dropEntity(entityId);\n  }\n\n  /**\n   * Unconditionally drop this entity's bundles. Backs `cache.clear_user` and\n   * `cache.clear_customer`, which are explicit user requests and so are not\n   * gated on the invalidate-on-write flag.\n   */\n  dropEntity(entityId: string): number {\n    let dropped = 0;\n    for (const entry of [...this.entries.values()]) {\n      // Never drop shared client-scope knowledge on one entity's behalf.\n      if (entry.entityId === ANY_SCOPE) continue;\n      if (entry.entityId === entityId) { this.dropBundle(entry.bundleId); dropped++; }\n    }\n    return dropped;\n  }\n\n  /**\n   * A read-only diagnostic projection of the cache.\n   *\n   * Backs `client.anticipation_cache_snapshot()` and mirrors Python's shape\n   * key for key, including snake_case keys: this output gets logged, diffed\n   * and pasted into issues across both SDKs, so it is a wire format.\n   *\n   * Note the 140-character content previews. That is Python's literal, and it\n   * is deliberately NOT the 120 of `telemetry.content_preview_chars` from the\n   * contract, which caps lookup telemetry rather than this snapshot.\n   */\n  snapshot(): AnticipationCacheSnapshot {\n    const SNAPSHOT_PREVIEW_CHARS = 140;\n    const overallScope = new Map<string, number>();\n    const itemsByBundle = new Map<string, ItemRecord[]>();\n    for (const record of this.items) {\n      const list = itemsByBundle.get(record.bundleId);\n      if (list === undefined) itemsByBundle.set(record.bundleId, [record]);\n      else list.push(record);\n    }\n\n    const bundles: SnapshotBundle[] = [];\n    for (const [bundleId, entry] of this.entries) {\n      const perBundle = new Map<string, number>();\n      const itemPreviews: SnapshotItemPreview[] = [];\n      for (const record of itemsByBundle.get(bundleId) ?? []) {\n        // `scope` is absent on plenty of items; Python's Counter happily keys\n        // on None, which JSON-serialises to null, so preserve the distinction\n        // rather than coercing to a string.\n        const scope = (record.itemDict['scope'] ?? null) as string | null;\n        const key = scope === null ? '' : scope;\n        overallScope.set(key, (overallScope.get(key) ?? 0) + 1);\n        perBundle.set(key, (perBundle.get(key) ?? 0) + 1);\n        itemPreviews.push({\n          type: record.itemType,\n          scope,\n          content: record.content.slice(0, SNAPSHOT_PREVIEW_CHARS),\n        });\n      }\n      let totalItems = 0;\n      for (const n of perBundle.values()) totalItems += n;\n      bundles.push({\n        bundle_id: bundleId,\n        entity_id: entry.entityId,\n        conversation_id: entry.conversationId,\n        bundle_type: entry.bundleType,\n        search_queries: [...entry.searchQueries],\n        scope_counts: Object.fromEntries(perBundle),\n        total_items: totalItems,\n        items: itemPreviews,\n      });\n    }\n\n    return {\n      total_entries: this.entries.size,\n      total_item_records: this.items.length,\n      scope_breakdown_overall: Object.fromEntries(overallScope),\n      corpus_vocab_size: this.corpusVocab.size,\n      corpus_vocab_sample: [...this.corpusVocab].sort().slice(0, 80),\n      item_records: this.items.slice(0, 20).map((rec) => ({\n        bundle_id: rec.bundleId,\n        item_type: rec.itemType,\n        tokens: rec.tokens.slice(0, 25),\n        content: rec.content.slice(0, SNAPSHOT_PREVIEW_CHARS),\n      })),\n      bundles,\n    };\n  }\n\n  /**\n   * The freshest `user_summary` bundle for this entity, or null.\n   *\n   * `entityId` is REQUIRED, and a missing one refuses the lookup rather than\n   * falling back to the freshest summary across all users. Python hardened this\n   * for exactly that reason: the permissive version could splice user A's\n   * summary into user B's response on the conversation-scope path.\n   */\n  lookupUserSummary(entityId: string | null | undefined): Record<string, unknown> | null {\n    if (!entityId) return null;\n    this.evictExpired();\n\n    let freshest: EntryRecord | null = null;\n    for (const entry of this.entries.values()) {\n      if (entry.bundleType !== 'user_summary') continue;\n      // ANY_SCOPE covers client-shared summaries, which are safe for everyone.\n      if (entry.entityId !== entityId && entry.entityId !== ANY_SCOPE) continue;\n      if (freshest === null || entry.storedAt > freshest.storedAt) freshest = entry;\n    }\n    if (freshest === null) return null;\n\n    // Serving refreshes the sliding lease, unless the server's TTL hint is\n    // being honoured, in which case the hint owns expiry.\n    if (!getEnvFlag('SYNAP_SDK_CACHE_HONOR_TTL_HINT')) {\n      freshest.storedAt = this.now();\n    }\n    return this.#bundleFor(freshest.bundleId);\n  }\n\n  /** Rebuild a bundle's items_by_type from the flat item records. */\n  #bundleFor(bundleId: string): Record<string, unknown> {\n    const itemsByType: Record<string, BundleItem[]> = {};\n    for (const record of this.items) {\n      if (record.bundleId !== bundleId) continue;\n      (itemsByType[record.itemType] ??= []).push(record.itemDict);\n    }\n    return { bundle_id: bundleId, items_by_type: itemsByType };\n  }\n\n  /**\n   * Drop every bundle belonging to one conversation.\n   *\n   * Backs the `compaction_update` signal on the Listen stream: a compaction\n   * rewrites the conversation's summary, so any bundle built from the previous\n   * state is stale and must not keep serving for the rest of its TTL.\n   *\n   * Unlike `dropEntity`, client-scope bundles are NOT spared: a bundle is only\n   * dropped here if it is bound to this specific conversation, and a shared\n   * client-scope bundle has no conversation id to match.\n   */\n  dropConversation(conversationId: string): number {\n    if (!conversationId) return 0;\n    let dropped = 0;\n    for (const entry of [...this.entries.values()]) {\n      if (entry.conversationId === conversationId) { this.dropBundle(entry.bundleId); dropped++; }\n    }\n    return dropped;\n  }\n\n  clear(): void {\n    this.entries.clear();\n    this.items = [];\n    this.corpusVocab.clear();\n    this.bm25 = null;\n    this.bm25Dirty = true;\n  }\n\n  // ── internals ───────────────────────────────────────────────────────────────\n\n  private miss(telemetry: LookupTelemetry, reason: ExitReason): null {\n    telemetry.exitReason = reason;\n    telemetry.hit = false;\n    this.fire(telemetry);\n    return null;\n  }\n\n  private fire(telemetry: LookupTelemetry): void {\n    // Exception-safe by contract: a buggy hook must never break the SDK.\n    try {\n      this.onLookup?.(telemetry);\n    } catch {\n      /* ignored on purpose */\n    }\n  }\n\n  private freshnessLookup(\n    entityId: string | null,\n    maxItems: number,\n    telemetry: LookupTelemetry,\n  ): LookupResult | null {\n    const candidates = [...this.entries.values()]\n      .filter((e) => entityId === null || e.entityId === entityId || e.entityId === ANY_SCOPE)\n      .sort((a, b) => b.storedAt - a.storedAt);\n    if (candidates.length === 0) return this.miss(telemetry, 'empty');\n\n    const newest = candidates[0]!;\n    const itemsByType: Record<string, BundleItem[]> = {};\n    let n = 0;\n    for (const item of this.items) {\n      if (item.bundleId !== newest.bundleId) continue;\n      if (n >= maxItems) break;\n      (itemsByType[item.itemType] ??= []).push(item.itemDict);\n      n++;\n    }\n    if (n === 0) return this.miss(telemetry, 'empty');\n\n    telemetry.hit = true;\n    telemetry.exitReason = 'hit';\n    this.fire(telemetry);\n    return { itemsByType, bundleIds: [newest.bundleId], score: 0, coverage: 1.0 };\n  }\n\n  /**\n   * The widened scope-match set for a request.\n   *\n   * A narrower-scope request also matches broader-scope bundles for the same\n   * customer or client. Falsy ids are dropped so an empty customer_id cannot\n   * accidentally match bundles keyed at \"\".\n   */\n  private buildAcceptedScope(\n    entityId: string | null, customerId: string | null, clientId: string | null,\n  ): Set<string> {\n    const accepted = new Set<string>([ANY_SCOPE]);\n    if (entityId) accepted.add(entityId);\n    if (customerId) accepted.add(customerId);\n    if (clientId) accepted.add(clientId);\n    return accepted;\n  }\n\n  private getValidBundleIds(accepted: Set<string>, conversationId: string | null): Set<string> {\n    const valid = new Set<string>();\n    for (const entry of this.entries.values()) {\n      if (!accepted.has(entry.entityId)) continue;\n      // A conversation-scoped bundle is only valid inside its conversation.\n      if (entry.conversationId && conversationId && entry.conversationId !== conversationId) continue;\n      valid.add(entry.bundleId);\n    }\n    return valid;\n  }\n\n  private effectiveTtl(entry: EntryRecord): number {\n    if (!getEnvFlag('SYNAP_SDK_CACHE_HONOR_TTL_HINT')) return this.ttlSeconds;\n    if (entry.ttlHintSeconds == null || entry.ttlHintSeconds <= 0) return this.ttlSeconds;\n    // A hint may only shorten.\n    return Math.min(this.ttlSeconds, entry.ttlHintSeconds);\n  }\n\n  private evictExpired(): void {\n    const now = this.now();\n    // Default cap is twice the sliding TTL; 0 disables. Without it a bundle\n    // under steady traffic renews forever and can serve a retired value\n    // indefinitely.\n    const configuredMaxAge = getEnvFloat('SYNAP_SDK_CACHE_MAX_ENTRY_AGE');\n    const maxAge = configuredMaxAge ?? this.ttlSeconds * 2;\n\n    for (const entry of [...this.entries.values()]) {\n      const idleExpired = now - entry.storedAt > this.effectiveTtl(entry);\n      const ageExpired = maxAge > 0 && now - entry.createdAt > maxAge;\n      if (idleExpired || ageExpired) this.dropBundle(entry.bundleId);\n    }\n  }\n\n  private dropBundle(bundleId: string): void {\n    if (!this.entries.delete(bundleId)) return;\n    this.items = this.items.filter((i) => i.bundleId !== bundleId);\n    // Vocabulary is rebuilt rather than decremented: a stem can be shared by\n    // several bundles, so per-bundle subtraction would drop stems still in use.\n    this.corpusVocab = new Set(this.items.flatMap((i) => i.tokens));\n    this.bm25Dirty = true;\n  }\n}\n\nfunction monotonicNow(): number {\n  // performance.now() is monotonic and unaffected by wall-clock adjustments,\n  // matching Python's time.monotonic(). Date.now() would let an NTP step\n  // expire or resurrect every entry at once.\n  return typeof performance !== 'undefined' && typeof performance.now === 'function'\n    ? performance.now() / 1000\n    : Date.now() / 1000;\n}\n\nfunction round4(n: number): number {\n  return Number(n.toFixed(4));\n}\n"],"mappings":";;;;;;AAAA;AAAA,EACE,UAAY;AAAA,EACZ,SAAW;AAAA,EACX,eAAiB;AAAA,IACf,MAAQ;AAAA,IACR,UAAY;AAAA,IACZ,SAAW;AAAA,IACX,UAAY;AAAA,MACV;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,MACA;AAAA,QACE,SAAW;AAAA,QACX,OAAS;AAAA,QACT,MAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAAA,EACA,YAAc;AAAA,IACZ,MAAQ;AAAA,MACN,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,YAAc;AAAA,MACZ,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,2BAA6B;AAAA,MAC3B,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,iBAAmB;AAAA,MACjB,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,mBAAqB;AAAA,MACnB,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,EACF;AAAA,EACA,MAAQ;AAAA,IACN,IAAM;AAAA,IACN,GAAK;AAAA,IACL,WAAa;AAAA,IACb,eAAiB;AAAA,IACjB,cAAgB;AAAA,IAChB,UAAY;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,YAAc;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,IACA,aAAe;AAAA,MACb,SAAW;AAAA,MACX,MAAQ;AAAA,IACV;AAAA,IACA,aAAe;AAAA,EACjB;AAAA,EACA,WAAa;AAAA,IACX,UAAY;AAAA,IACZ,+BAAiC;AAAA,MAC/B,SAAW;AAAA,MACX,QAAU;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,IACA,gCAAkC;AAAA,MAChC,SAAW;AAAA,MACX,QAAU;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACA,MAAQ;AAAA,IACV;AAAA,IACA,qCAAuC;AAAA,MACrC,SAAW;AAAA,MACX,QAAU;AAAA,QACR;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACA,MAAQ;AAAA,IACV;AAAA,IACA,+BAAiC;AAAA,MAC/B,SAAW;AAAA,MACX,MAAQ;AAAA,IACV;AAAA,IACA,8BAAgC;AAAA,MAC9B,SAAW;AAAA,IACb;AAAA,EACF;AAAA,EACA,eAAiB;AAAA,IACf,MAAQ;AAAA,IACR,UAAY;AAAA,IACZ,SAAW;AAAA,IACX,sBAAwB;AAAA,EAC1B;AAAA,EACA,WAAa;AAAA,IACX,oBAAsB;AAAA,MACpB,OAAS;AAAA,MACT,MAAQ;AAAA,IACV;AAAA,IACA,uBAAyB;AAAA,EAC3B;AACF;;;AC5MO,IAAM,WAAW;AAGxB,IAAM,gBAAgB,oBAAI,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC;AAE7C,SAAS,QAAQ,SAAiB,OAAuB;AACvD,aAAW,MAAM,OAAO;AACtB,QAAI,CAAC,cAAc,IAAI,EAAE,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,2BAA2B,EAAE;AAAA,MAE/B;AAAA,IACF;AAAA,EACF;AACA,SAAO,IAAI,OAAO,SAAS,KAAK;AAClC;AAUO,IAAM,kBAAqC,SAAS,cAAc,SAAS;AAAA,EAAI,CAAC,MACrF,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE;AAClC;AAEO,IAAM,aAAa;AAAA,EACxB,MAAM,SAAS,WAAW,KAAK;AAAA,EAC/B,WAAW,SAAS,WAAW,WAAW;AAAA,EAC1C,uBAAuB,SAAS,WAAW,0BAA0B;AAAA;AAAA,EAErE,gBAAgB,SAAS,WAAW,gBAAgB;AAAA;AAAA,EAEpD,iBAAiB,SAAS,WAAW,kBAAkB;AACzD;AAEO,IAAM,cAAc,SAAS;AAC7B,IAAM,aAAkC,IAAI,IAAI,SAAS,KAAK,UAAU;AAGxE,IAAM,WAA8B,SAAS,KAAK;AAClD,IAAM,qBAAqB,SAAS,KAAK,YAAY;AAGrD,SAAS,cAAc,aAAiF;AAC7G,aAAW,KAAK,eAAe,CAAC,GAAG;AACjC,QAAI,CAAC,EAAG;AACR,eAAW,WAAW,iBAAiB;AACrC,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO;AAAA,IAC9B;AAAA,EACF;AACA,SAAO;AACT;;;AC1GA,IAAM,eAAe,YAAY;AACjC,IAAM,gBAAgB,YAAY;AAE3B,SAAS,KAAK,MAAsB;AAEzC,aAAW,UAAU,UAAU;AAC7B,QAAI,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,OAAO,UAAU,cAAc;AACxE,aAAO,KAAK,MAAM,GAAG,KAAK,SAAS,OAAO,MAAM;AAAA,IAClD;AAAA,EACF;AACA,SAAO;AACT;AAWA,SAAS,eAAuB;AAI9B,SAAO,IAAI,OAAO,oBAAoB,GAAG;AAC3C;AAEA,IAAM,UAAU;AAGT,SAAS,SAAS,MAA2C;AAClE,MAAI,CAAC,KAAM,QAAO,CAAC;AAEnB,QAAM,SAAmB,CAAC;AAC1B,QAAM,YAAY,KAAK,QAAQ,aAAa,GAAG,CAAC,QAAQ,aAAqB;AAC3E,WAAO,KAAK,SAAS,YAAY,CAAC;AAClC,WAAO;AAAA,EACT,CAAC;AAED,QAAM,QAAQ,UAAU,YAAY,EAAE,MAAM,OAAO,KAAK,CAAC;AACzD,QAAM,MAAM,OAAO,MAAM;AACzB,aAAW,KAAK,OAAO;AACrB,QAAI,EAAE,UAAU,iBAAiB,CAAC,WAAW,IAAI,CAAC,EAAG,KAAI,KAAK,KAAK,CAAC,CAAC;AAAA,EACvE;AACA,SAAO;AACT;AAGO,IAAM,OAAN,MAAM,MAAK;AAAA,EAChB,OAAgB,YAAY,YAAY;AAAA,EAE/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YACE,QACA,KAAa,YAAY,IACzB,IAAY,YAAY,GACxB;AACA,SAAK,KAAK;AACV,SAAK,IAAI;AACT,SAAK,SAAS;AACd,SAAK,WAAW,OAAO;AACvB,SAAK,UAAU,OAAO,IAAI,CAAC,QAAQ,IAAI,MAAM;AAE7C,SAAK,QAAQ,KAAK,WACd,KAAK,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK,WAC/C;AAEJ,UAAM,MAAM,oBAAI,IAAoB;AACpC,UAAM,WAAW,oBAAI,IAAY;AACjC,eAAW,OAAO,OAAQ,YAAW,KAAK,IAAK,UAAS,IAAI,CAAC;AAC7D,eAAW,QAAQ,UAAU;AAC3B,UAAI,KAAK;AACT,iBAAW,OAAO,OAAQ,KAAI,IAAI,SAAS,IAAI,EAAG;AAClD,YAAM,MAAM,KAAK,KAAK,KAAK,WAAW,KAAK,QAAQ,KAAK,OAAO,CAAG;AAClE,UAAI,IAAI,MAAM,KAAK,IAAI,KAAK,MAAK,SAAS,CAAC;AAAA,IAC7C;AACA,SAAK,MAAM;AAAA,EACb;AAAA,EAEA,MAAM,aAAgC,QAAwB;AAC5D,UAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,QAAI,QAAQ,OAAW,QAAO;AAC9B,UAAM,KAAK,KAAK,QAAQ,MAAM,KAAK;AAEnC,UAAM,QAAQ,oBAAI,IAAoB;AACtC,eAAW,KAAK,IAAK,OAAM,IAAI,IAAI,MAAM,IAAI,CAAC,KAAK,KAAK,CAAC;AAEzD,QAAI,IAAI;AACR,eAAW,QAAQ,aAAa;AAC9B,YAAM,KAAK,MAAM,IAAI,IAAI;AACzB,UAAI,OAAO,OAAW;AACtB,YAAM,MAAM,KAAK,IAAI,IAAI,IAAI,KAAK,MAAK;AACvC,YAAM,YAAY,MAAM,KAAK,KAAK;AAClC,YAAM,cAAc,KAAK,KAAK,MAAM,IAAI,KAAK,IAAK,KAAK,IAAI,KAAM,KAAK;AACtE,WAAM,MAAM,YAAa;AAAA,IAC3B;AACA,WAAO;AAAA,EACT;AAAA,EAEA,OAAO,aAA0C;AAC/C,WAAO,KAAK,OAAO,IAAI,CAAC,GAAG,MAAM,KAAK,MAAM,aAAa,CAAC,CAAC;AAAA,EAC7D;AACF;;;AC7FA,IAAM,kBAAkB,SAAS,WAAW,gBAAgB;AAC5D,IAAM,oBAAoB,SAAS,WAAW,kBAAkB;AAChE,IAAM,eAAe,SAAS,UAAU,mBAAmB;AAC3D,IAAM,gBAAgB,SAAS,UAAU;AAGlC,IAAM,YAAY;AA+HzB,IAAM,sBAAsB;AAC5B,IAAM,sBAAsB;AAErB,IAAM,oBAAN,MAAwB;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,UAAU,oBAAI,IAAyB;AAAA,EACvC,QAAsB,CAAC;AAAA,EACvB,cAAc,oBAAI,IAAY;AAAA,EAC9B,OAAoB;AAAA,EACpB,YAAY;AAAA,EAEpB,YAAY,UAAoC,CAAC,GAAG;AAClD,SAAK,aAAa,QAAQ,cAAc;AACxC,SAAK,aAAa,QAAQ,cAAc;AACxC,SAAK,MAAM,QAAQ,OAAO;AAC1B,SAAK,WAAW,QAAQ;AAAA,EAC1B;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,YAAoB;AACtB,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA,EAEA,MAAM,QAA6B;AACjC,QAAI,CAAC,OAAO,SAAU;AACtB,SAAK,aAAa;AAIlB,UAAM,WAAW,OAAO,YAAY;AAEpC,QAAI,KAAK,QAAQ,IAAI,OAAO,QAAQ,EAAG,MAAK,WAAW,OAAO,QAAQ;AAEtE,UAAM,MAAM,KAAK,IAAI;AACrB,SAAK,QAAQ,IAAI,OAAO,UAAU;AAAA,MAChC,UAAU,OAAO;AAAA,MACjB;AAAA,MACA,gBAAgB,OAAO,kBAAkB;AAAA,MACzC,YAAY,OAAO,cAAc;AAAA,MACjC,eAAe,CAAC,GAAI,OAAO,iBAAiB,CAAC,CAAE;AAAA,MAC/C,UAAU;AAAA,MACV,WAAW;AAAA,MACX,gBAAgB,OAAO,kBAAkB;AAAA,IAC3C,CAAC;AAED,eAAW,CAAC,UAAU,IAAI,KAAK,OAAO,QAAQ,OAAO,eAAe,CAAC,CAAC,GAAG;AACvE,iBAAW,QAAQ,QAAQ,CAAC,GAAG;AAC7B,cAAM,UAAU,OAAO,KAAK,WAAW,EAAE;AACzC,cAAM,SAAS,SAAS,OAAO;AAC/B,aAAK,MAAM,KAAK,EAAE,UAAU,OAAO,UAAU,UAAU,SAAS,QAAQ,UAAU,KAAK,CAAC;AACxF,mBAAW,KAAK,OAAQ,MAAK,YAAY,IAAI,CAAC;AAAA,MAChD;AAAA,IACF;AACA,SAAK,YAAY;AAGjB,WAAO,KAAK,QAAQ,OAAO,KAAK,YAAY;AAC1C,UAAI,SAA6B;AACjC,iBAAW,KAAK,KAAK,QAAQ,OAAO,GAAG;AACrC,YAAI,WAAW,QAAQ,EAAE,WAAW,OAAO,SAAU,UAAS;AAAA,MAChE;AACA,UAAI,WAAW,KAAM;AACrB,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA,EAEA,OAAO,QAA2C;AAChD,UAAM;AAAA,MACJ,cAAc;AAAA,MAAM,WAAW;AAAA,MAAM,aAAa;AAAA,MAClD,WAAW;AAAA,MAAM,iBAAiB;AAAA,MAAM,WAAW;AAAA,IACrD,IAAI;AAEJ,SAAK,aAAa;AAElB,UAAM,WAAW,KAAK,mBAAmB,UAAU,YAAY,QAAQ;AACvE,UAAM,YAA6B;AAAA,MACjC,cAAc,eAAe,CAAC,GAAG,OAAO,CAAC,MAAmB,QAAQ,CAAC,CAAC;AAAA,MACtE;AAAA,MAAU;AAAA,MAAY;AAAA,MAAU;AAAA,MAChC,qBAAqB,CAAC,GAAG,QAAQ,EAAE,KAAK;AAAA,MACxC,gBAAgB;AAAA,MAAM,eAAe;AAAA,MAAM,iBAAiB,CAAC;AAAA,MAC7D,aAAa,CAAC;AAAA,MAAG,eAAe,CAAC;AAAA,MAAG,UAAU;AAAA,MAC9C,KAAK;AAAA,MAAO,YAAY;AAAA,IAC1B;AAEA,QAAI,KAAK,QAAQ,SAAS,KAAK,KAAK,MAAM,WAAW,GAAG;AACtD,aAAO,KAAK,KAAK,WAAW,OAAO;AAAA,IACrC;AAEA,UAAM,YAAY,eAAe,CAAC,GAAG,KAAK,CAAC,MAAM,KAAK,EAAE,KAAK,MAAM,EAAE;AACrE,QAAI,CAAC,UAAU;AACb,aAAO,KAAK,gBAAgB,UAAU,UAAU,SAAS;AAAA,IAC3D;AAKA,QAAI,WAAW,SAAS,cAAc,QAAQ,KAAK,cAAc,WAAW,GAAG;AAC7E,aAAO,KAAK,KAAK,WAAW,eAAe;AAAA,IAC7C;AAEA,UAAM,eAAe,eAAe,CAAC,GAAG,QAAQ,CAAC,MAAM,SAAS,CAAC,CAAC;AAClE,cAAU,kBAAkB;AAC5B,QAAI,YAAY,WAAW,GAAG;AAC5B,aAAO,KAAK,KAAK,WAAW,iBAAiB;AAAA,IAC/C;AAEA,UAAM,cAAc,IAAI,IAAI,WAAW;AACvC,QAAI,QAAQ;AACZ,eAAW,KAAK,YAAa,KAAI,CAAC,KAAK,YAAY,IAAI,CAAC,EAAG;AAC3D,UAAM,aAAa,YAAY,OAAO,QAAQ,YAAY,OAAO;AACjE,cAAU,iBAAiB,OAAO,UAAU;AAI5C,QACE,KAAK,YAAY,QAAQ,WAAW,yBACpC,cAAc,WAAW,WACzB;AACA,aAAO,KAAK,KAAK,WAAW,iBAAiB;AAAA,IAC/C;AAEA,QAAI,KAAK,aAAa,KAAK,SAAS,MAAM;AACxC,UAAI,KAAK,MAAM,WAAW,EAAG,QAAO,KAAK,KAAK,WAAW,cAAc;AACvE,WAAK,OAAO,IAAI,KAAK,KAAK,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AACpD,WAAK,YAAY;AAAA,IACnB;AAEA,UAAM,SAAS,KAAK,KAAK,OAAO,WAAW;AAC3C,UAAM,eAAe,KAAK,kBAAkB,UAAU,cAAc;AAEpE,UAAM,qBAAqB,KAAK;AAAA,MAC9B;AAAA,MACA,KAAK,IAAI,WAAW,MAAM,oBAAoB,YAAY,MAAM;AAAA,IAClE;AACA,cAAU,gBAAgB,OAAO,kBAAkB;AAEnD,UAAM,SAAgD,CAAC;AACvD,UAAM,WAAkE,CAAC;AAEzE,aAAS,MAAM,GAAG,MAAM,OAAO,QAAQ,OAAO;AAC5C,YAAM,OAAO,KAAK,MAAM,GAAG;AAC3B,YAAM,QAAQ,OAAO,GAAG;AACxB,YAAM,SAAS,CAAC,WACd,SAAS,KAAK;AAAA,QACZ;AAAA,QACA,SAAS;AAAA,UACP,YAAY;AAAA,UAAK,WAAW,KAAK;AAAA,UAAU,WAAW,KAAK;AAAA,UAC3D,mBAAmB,KAAK,QAAQ,MAAM,GAAG,aAAa;AAAA,UACtD,YAAY,OAAO,KAAK;AAAA,UAAG;AAAA,QAC7B;AAAA,MACF,CAAC;AACH,UAAI,QAAQ,oBAAoB;AAAE,eAAO,iBAAiB;AAAG;AAAA,MAAU;AACvE,UAAI,CAAC,aAAa,IAAI,KAAK,QAAQ,GAAG;AAAE,eAAO,uBAAuB;AAAG;AAAA,MAAU;AACnF,aAAO,KAAK,EAAE,OAAO,KAAK,CAAC;AAAA,IAC7B;AAEA,aAAS,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACzC,cAAU,gBAAgB,SAAS,MAAM,GAAG,YAAY,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO;AAE9E,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,KAAK,KAAK,WAAW,0BAA0B;AAAA,IACxD;AAEA,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACvC,UAAM,MAAM,OAAO,MAAM,GAAG,QAAQ;AAEpC,UAAM,cAAc,oBAAI,IAAY;AACpC,eAAW,EAAE,KAAK,KAAK,IAAK,YAAW,KAAK,KAAK,OAAQ,aAAY,IAAI,CAAC;AAC1E,QAAI,UAAU;AACd,eAAW,KAAK,YAAa,KAAI,YAAY,IAAI,CAAC,EAAG;AACrD,UAAM,WAAW,YAAY,OAAO,UAAU,YAAY,OAAO;AACjE,cAAU,WAAW,OAAO,QAAQ;AAIpC,UAAM,cAAc,YAAY,8BAA8B;AAC9D,QAAI,gBAAgB,QAAQ,WAAW,aAAa;AAGlD,aAAO,KAAK,KAAK,WAAW,eAAe;AAAA,IAC7C;AAEA,UAAM,cAA4C,CAAC;AACnD,UAAM,YAAY,oBAAI,IAAY;AAClC,eAAW,EAAE,KAAK,KAAK,KAAK;AAC1B,OAAC,YAAY,KAAK,QAAQ,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ;AACtD,gBAAU,IAAI,KAAK,QAAQ;AAAA,IAC7B;AAIA,UAAM,eAAe,CAAC,WAAW,gCAAgC;AACjE,QAAI,cAAc;AAChB,YAAM,MAAM,KAAK,IAAI;AACrB,iBAAW,MAAM,WAAW;AAC1B,cAAM,QAAQ,KAAK,QAAQ,IAAI,EAAE;AACjC,YAAI,MAAO,OAAM,WAAW;AAAA,MAC9B;AAAA,IACF;AAEA,cAAU,MAAM;AAChB,cAAU,aAAa;AACvB,cAAU,cAAc,IAAI,IAAI,CAAC,EAAE,OAAO,KAAK,OAAO;AAAA,MACpD,WAAW,KAAK;AAAA,MAAU,WAAW,KAAK;AAAA,MAC1C,mBAAmB,KAAK,QAAQ,MAAM,GAAG,aAAa;AAAA,MAAG,YAAY,OAAO,KAAK;AAAA,IACnF,EAAE;AACF,SAAK,KAAK,SAAS;AAEnB,WAAO;AAAA,MACL;AAAA,MACA,WAAW,CAAC,GAAG,SAAS;AAAA,MACxB,OAAO,IAAI,CAAC,EAAG;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB,UAA0B;AACzC,QAAI,CAAC,WAAW,qCAAqC,EAAG,QAAO;AAC/D,WAAO,KAAK,WAAW,QAAQ;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,UAA0B;AACnC,QAAI,UAAU;AACd,eAAW,SAAS,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,GAAG;AAE9C,UAAI,MAAM,aAAa,UAAW;AAClC,UAAI,MAAM,aAAa,UAAU;AAAE,aAAK,WAAW,MAAM,QAAQ;AAAG;AAAA,MAAW;AAAA,IACjF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,WAAsC;AACpC,UAAM,yBAAyB;AAC/B,UAAM,eAAe,oBAAI,IAAoB;AAC7C,UAAM,gBAAgB,oBAAI,IAA0B;AACpD,eAAW,UAAU,KAAK,OAAO;AAC/B,YAAM,OAAO,cAAc,IAAI,OAAO,QAAQ;AAC9C,UAAI,SAAS,OAAW,eAAc,IAAI,OAAO,UAAU,CAAC,MAAM,CAAC;AAAA,UAC9D,MAAK,KAAK,MAAM;AAAA,IACvB;AAEA,UAAM,UAA4B,CAAC;AACnC,eAAW,CAAC,UAAU,KAAK,KAAK,KAAK,SAAS;AAC5C,YAAM,YAAY,oBAAI,IAAoB;AAC1C,YAAM,eAAsC,CAAC;AAC7C,iBAAW,UAAU,cAAc,IAAI,QAAQ,KAAK,CAAC,GAAG;AAItD,cAAM,QAAS,OAAO,SAAS,OAAO,KAAK;AAC3C,cAAM,MAAM,UAAU,OAAO,KAAK;AAClC,qBAAa,IAAI,MAAM,aAAa,IAAI,GAAG,KAAK,KAAK,CAAC;AACtD,kBAAU,IAAI,MAAM,UAAU,IAAI,GAAG,KAAK,KAAK,CAAC;AAChD,qBAAa,KAAK;AAAA,UAChB,MAAM,OAAO;AAAA,UACb;AAAA,UACA,SAAS,OAAO,QAAQ,MAAM,GAAG,sBAAsB;AAAA,QACzD,CAAC;AAAA,MACH;AACA,UAAI,aAAa;AACjB,iBAAW,KAAK,UAAU,OAAO,EAAG,eAAc;AAClD,cAAQ,KAAK;AAAA,QACX,WAAW;AAAA,QACX,WAAW,MAAM;AAAA,QACjB,iBAAiB,MAAM;AAAA,QACvB,aAAa,MAAM;AAAA,QACnB,gBAAgB,CAAC,GAAG,MAAM,aAAa;AAAA,QACvC,cAAc,OAAO,YAAY,SAAS;AAAA,QAC1C,aAAa;AAAA,QACb,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,MACL,eAAe,KAAK,QAAQ;AAAA,MAC5B,oBAAoB,KAAK,MAAM;AAAA,MAC/B,yBAAyB,OAAO,YAAY,YAAY;AAAA,MACxD,mBAAmB,KAAK,YAAY;AAAA,MACpC,qBAAqB,CAAC,GAAG,KAAK,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,EAAE;AAAA,MAC7D,cAAc,KAAK,MAAM,MAAM,GAAG,EAAE,EAAE,IAAI,CAAC,SAAS;AAAA,QAClD,WAAW,IAAI;AAAA,QACf,WAAW,IAAI;AAAA,QACf,QAAQ,IAAI,OAAO,MAAM,GAAG,EAAE;AAAA,QAC9B,SAAS,IAAI,QAAQ,MAAM,GAAG,sBAAsB;AAAA,MACtD,EAAE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,kBAAkB,UAAqE;AACrF,QAAI,CAAC,SAAU,QAAO;AACtB,SAAK,aAAa;AAElB,QAAI,WAA+B;AACnC,eAAW,SAAS,KAAK,QAAQ,OAAO,GAAG;AACzC,UAAI,MAAM,eAAe,eAAgB;AAEzC,UAAI,MAAM,aAAa,YAAY,MAAM,aAAa,UAAW;AACjE,UAAI,aAAa,QAAQ,MAAM,WAAW,SAAS,SAAU,YAAW;AAAA,IAC1E;AACA,QAAI,aAAa,KAAM,QAAO;AAI9B,QAAI,CAAC,WAAW,gCAAgC,GAAG;AACjD,eAAS,WAAW,KAAK,IAAI;AAAA,IAC/B;AACA,WAAO,KAAK,WAAW,SAAS,QAAQ;AAAA,EAC1C;AAAA;AAAA,EAGA,WAAW,UAA2C;AACpD,UAAM,cAA4C,CAAC;AACnD,eAAW,UAAU,KAAK,OAAO;AAC/B,UAAI,OAAO,aAAa,SAAU;AAClC,OAAC,YAAY,OAAO,QAAQ,MAAM,CAAC,GAAG,KAAK,OAAO,QAAQ;AAAA,IAC5D;AACA,WAAO,EAAE,WAAW,UAAU,eAAe,YAAY;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,iBAAiB,gBAAgC;AAC/C,QAAI,CAAC,eAAgB,QAAO;AAC5B,QAAI,UAAU;AACd,eAAW,SAAS,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,GAAG;AAC9C,UAAI,MAAM,mBAAmB,gBAAgB;AAAE,aAAK,WAAW,MAAM,QAAQ;AAAG;AAAA,MAAW;AAAA,IAC7F;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QAAc;AACZ,SAAK,QAAQ,MAAM;AACnB,SAAK,QAAQ,CAAC;AACd,SAAK,YAAY,MAAM;AACvB,SAAK,OAAO;AACZ,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA,EAIQ,KAAK,WAA4B,QAA0B;AACjE,cAAU,aAAa;AACvB,cAAU,MAAM;AAChB,SAAK,KAAK,SAAS;AACnB,WAAO;AAAA,EACT;AAAA,EAEQ,KAAK,WAAkC;AAE7C,QAAI;AACF,WAAK,WAAW,SAAS;AAAA,IAC3B,QAAQ;AAAA,IAER;AAAA,EACF;AAAA,EAEQ,gBACN,UACA,UACA,WACqB;AACrB,UAAM,aAAa,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,EACzC,OAAO,CAAC,MAAM,aAAa,QAAQ,EAAE,aAAa,YAAY,EAAE,aAAa,SAAS,EACtF,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACzC,QAAI,WAAW,WAAW,EAAG,QAAO,KAAK,KAAK,WAAW,OAAO;AAEhE,UAAM,SAAS,WAAW,CAAC;AAC3B,UAAM,cAA4C,CAAC;AACnD,QAAI,IAAI;AACR,eAAW,QAAQ,KAAK,OAAO;AAC7B,UAAI,KAAK,aAAa,OAAO,SAAU;AACvC,UAAI,KAAK,SAAU;AACnB,OAAC,YAAY,KAAK,QAAQ,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ;AACtD;AAAA,IACF;AACA,QAAI,MAAM,EAAG,QAAO,KAAK,KAAK,WAAW,OAAO;AAEhD,cAAU,MAAM;AAChB,cAAU,aAAa;AACvB,SAAK,KAAK,SAAS;AACnB,WAAO,EAAE,aAAa,WAAW,CAAC,OAAO,QAAQ,GAAG,OAAO,GAAG,UAAU,EAAI;AAAA,EAC9E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,mBACN,UAAyB,YAA2B,UACvC;AACb,UAAM,WAAW,oBAAI,IAAY,CAAC,SAAS,CAAC;AAC5C,QAAI,SAAU,UAAS,IAAI,QAAQ;AACnC,QAAI,WAAY,UAAS,IAAI,UAAU;AACvC,QAAI,SAAU,UAAS,IAAI,QAAQ;AACnC,WAAO;AAAA,EACT;AAAA,EAEQ,kBAAkB,UAAuB,gBAA4C;AAC3F,UAAM,QAAQ,oBAAI,IAAY;AAC9B,eAAW,SAAS,KAAK,QAAQ,OAAO,GAAG;AACzC,UAAI,CAAC,SAAS,IAAI,MAAM,QAAQ,EAAG;AAEnC,UAAI,MAAM,kBAAkB,kBAAkB,MAAM,mBAAmB,eAAgB;AACvF,YAAM,IAAI,MAAM,QAAQ;AAAA,IAC1B;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,aAAa,OAA4B;AAC/C,QAAI,CAAC,WAAW,gCAAgC,EAAG,QAAO,KAAK;AAC/D,QAAI,MAAM,kBAAkB,QAAQ,MAAM,kBAAkB,EAAG,QAAO,KAAK;AAE3E,WAAO,KAAK,IAAI,KAAK,YAAY,MAAM,cAAc;AAAA,EACvD;AAAA,EAEQ,eAAqB;AAC3B,UAAM,MAAM,KAAK,IAAI;AAIrB,UAAM,mBAAmB,YAAY,+BAA+B;AACpE,UAAM,SAAS,oBAAoB,KAAK,aAAa;AAErD,eAAW,SAAS,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,GAAG;AAC9C,YAAM,cAAc,MAAM,MAAM,WAAW,KAAK,aAAa,KAAK;AAClE,YAAM,aAAa,SAAS,KAAK,MAAM,MAAM,YAAY;AACzD,UAAI,eAAe,WAAY,MAAK,WAAW,MAAM,QAAQ;AAAA,IAC/D;AAAA,EACF;AAAA,EAEQ,WAAW,UAAwB;AACzC,QAAI,CAAC,KAAK,QAAQ,OAAO,QAAQ,EAAG;AACpC,SAAK,QAAQ,KAAK,MAAM,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ;AAG7D,SAAK,cAAc,IAAI,IAAI,KAAK,MAAM,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;AAC9D,SAAK,YAAY;AAAA,EACnB;AACF;AAEA,SAAS,eAAuB;AAI9B,SAAO,OAAO,gBAAgB,eAAe,OAAO,YAAY,QAAQ,aACpE,YAAY,IAAI,IAAI,MACpB,KAAK,IAAI,IAAI;AACnB;AAEA,SAAS,OAAO,GAAmB;AACjC,SAAO,OAAO,EAAE,QAAQ,CAAC,CAAC;AAC5B;","names":[]}

package/dist/{chunk-NIDPTBNC.cjs → chunk-RB57I2IQ.cjs}

@@ -675,6 +675,38 @@ var AnticipationCache = (_class2 = class {
       bundles
     };
   }
+  /**
+   * The freshest `user_summary` bundle for this entity, or null.
+   *
+   * `entityId` is REQUIRED, and a missing one refuses the lookup rather than
+   * falling back to the freshest summary across all users. Python hardened this
+   * for exactly that reason: the permissive version could splice user A's
+   * summary into user B's response on the conversation-scope path.
+   */
+  lookupUserSummary(entityId) {
+    if (!entityId) return null;
+    this.evictExpired();
+    let freshest = null;
+    for (const entry of this.entries.values()) {
+      if (entry.bundleType !== "user_summary") continue;
+      if (entry.entityId !== entityId && entry.entityId !== ANY_SCOPE) continue;
+      if (freshest === null || entry.storedAt > freshest.storedAt) freshest = entry;
+    }
+    if (freshest === null) return null;
+    if (!_chunkZKOJDUN4cjs.getEnvFlag.call(void 0, "SYNAP_SDK_CACHE_HONOR_TTL_HINT")) {
+      freshest.storedAt = this.now();
+    }
+    return this.#bundleFor(freshest.bundleId);
+  }
+  /** Rebuild a bundle's items_by_type from the flat item records. */
+  #bundleFor(bundleId) {
+    const itemsByType = {};
+    for (const record of this.items) {
+      if (record.bundleId !== bundleId) continue;
+      (itemsByType[record.itemType] ??= []).push(record.itemDict);
+    }
+    return { bundle_id: bundleId, items_by_type: itemsByType };
+  }
   /**
    * Drop every bundle belonging to one conversation.
    *
@@ -797,4 +829,4 @@ function round4(n) {
 
 
 exports.CONTRACT = CONTRACT; exports.THRESHOLDS = THRESHOLDS; exports.isRecallQuery = isRecallQuery; exports.stem = stem; exports.tokenize = tokenize; exports.BM25 = BM25; exports.ANY_SCOPE = ANY_SCOPE; exports.AnticipationCache = AnticipationCache;
-//# sourceMappingURL=chunk-NIDPTBNC.cjs.map
+//# sourceMappingURL=chunk-RB57I2IQ.cjs.map