@remnic/core 1.0.2 → 1.0.3

package/dist/chunk-ALXMCZEU.js

@@ -0,0 +1,332 @@
+import {
+  log
+} from "./chunk-2ODBA7MQ.js";
+
+// src/embedding-fallback.ts
+import path from "path";
+import { mkdir, readFile, writeFile } from "fs/promises";
+var DEFAULT_OPENAI_MODEL = "text-embedding-3-small";
+var EmbeddingTimeoutError = class extends Error {
+  name = "EmbeddingTimeoutError";
+  constructor(message) {
+    super(message);
+  }
+};
+var DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS = 5e3;
+var DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS = 12e4;
+function resolveEmbeddingLookupTimeoutMs() {
+  const raw = process.env.REMNIC_EMBEDDING_FETCH_TIMEOUT_MS;
+  if (raw) {
+    const parsed = Number(raw);
+    if (Number.isFinite(parsed) && parsed > 0) {
+      return Math.floor(parsed);
+    }
+  }
+  return DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS;
+}
+function resolveEmbeddingIndexTimeoutMs() {
+  const raw = process.env.REMNIC_EMBEDDING_INDEX_TIMEOUT_MS;
+  if (raw) {
+    const parsed = Number(raw);
+    if (Number.isFinite(parsed) && parsed > 0) {
+      return Math.floor(parsed);
+    }
+  }
+  return DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS;
+}
+var EmbeddingFallback = class {
+  constructor(config) {
+    this.config = config;
+    this.indexPath = path.join(config.memoryDir, "state", "embeddings.json");
+  }
+  config;
+  indexPath;
+  loaded = null;
+  async isAvailable() {
+    return await this.resolveProvider() !== null;
+  }
+  /**
+   * Embed an array of texts and return their embedding vectors.
+   *
+   * This is the public batch-embed interface used by semantic chunking
+   * (Finding 1, PR #420 post-merge). Texts are grouped into batches of
+   * `embeddingBatchSize` (from `semanticChunkingConfig`, default 32) and
+   * each batch is dispatched concurrently via `Promise.all()`. This
+   * preserves the semantic intent of `embeddingBatchSize` — without batching,
+   * every text incurred a sequential HTTP round-trip, making the batch size
+   * config ineffective. (PR #439 post-merge Finding 2.)
+   *
+   * If the provider is unavailable or any single embedding fails, the method
+   * throws so the caller can fall back to recursive chunking.
+   */
+  async embedTexts(texts) {
+    const provider = await this.resolveProvider();
+    if (!provider) {
+      throw new Error("Embedding provider is not available");
+    }
+    const batchSize = Math.max(
+      1,
+      this.config.semanticChunkingConfig?.embeddingBatchSize ?? 32
+    );
+    const vectors = [];
+    for (let i = 0; i < texts.length; i += batchSize) {
+      const batch = texts.slice(i, i + batchSize);
+      const batchResults = await Promise.all(
+        batch.map((text) => this.embed(text, provider, { mode: "lookup" }))
+      );
+      for (const vec of batchResults) {
+        if (!vec) {
+          throw new Error("Embedding returned null for input text");
+        }
+        vectors.push(vec);
+      }
+    }
+    return vectors;
+  }
+  /**
+   * Nearest-neighbor search against the embedding index.
+   *
+   * @param query         The query string to embed and search for.
+   * @param limit         Max number of hits to return.
+   * @param options       Optional filters.
+   *   - `pathPrefix`   Restrict candidates to entries whose indexed `path`
+   *                    starts with this prefix (relative to `memoryDir`).
+   *                    Used by the semantic dedup guard to scope lookups
+   *                    to the target namespace so a high-similarity hit
+   *                    from a different namespace can't suppress a write
+   *                    in the target namespace. Default: no filter.
+   *   - `pathExcludePrefixes`
+   *                    Exclude any entry whose indexed `path` starts with
+   *                    any of these prefixes. Used for the default
+   *                    namespace case: when the default namespace lives at
+   *                    `memoryDir` root (legacy layout) we still want to
+   *                    exclude `namespaces/<other>/…` entries.
+   */
+  async search(query, limit, options = {}) {
+    const provider = await this.resolveProvider();
+    if (!provider) return [];
+    const index = await this.loadIndex(provider);
+    const ids = Object.keys(index.entries);
+    if (ids.length === 0) return [];
+    let queryVector;
+    try {
+      queryVector = await this.embed(query, provider, { mode: "lookup" });
+    } catch (err) {
+      if (err instanceof EmbeddingTimeoutError) {
+        if (options.throwOnTimeout) {
+          throw err;
+        }
+        log.debug("embedding fallback search: timeout on lookup, returning [] (throwOnTimeout=false)");
+        return [];
+      }
+      throw err;
+    }
+    if (!queryVector) return [];
+    const includePrefix = normalizePathPrefix(options.pathPrefix);
+    const excludePrefixes = (options.pathExcludePrefixes ?? []).map((p) => normalizePathPrefix(p)).filter((p) => typeof p === "string");
+    const scored = ids.map((id) => {
+      const entry = index.entries[id];
+      return {
+        id,
+        path: entry.path,
+        score: cosineSimilarity(queryVector, entry.vector)
+      };
+    }).filter((r) => {
+      if (!Number.isFinite(r.score)) return false;
+      const normalized = normalizeEntryPath(r.path);
+      if (includePrefix !== void 0 && !normalized.startsWith(includePrefix)) {
+        return false;
+      }
+      for (const excl of excludePrefixes) {
+        if (normalized.startsWith(excl)) return false;
+      }
+      return true;
+    }).sort((a, b) => b.score - a.score).slice(0, Math.max(1, limit));
+    return scored;
+  }
+  async indexFile(memoryId, content, filePath) {
+    const provider = await this.resolveProvider();
+    if (!provider) return;
+    const vector = await this.embed(content, provider, { mode: "index" });
+    if (!vector) return;
+    const index = await this.loadIndex(provider);
+    const relPath = toMemoryRelativePath(this.config.memoryDir, filePath);
+    index.entries[memoryId] = {
+      vector,
+      path: relPath
+    };
+    await this.saveIndex(index);
+  }
+  async removeFromIndex(memoryId) {
+    const provider = await this.resolveProvider();
+    if (!provider) return;
+    const index = await this.loadIndex(provider);
+    if (!index.entries[memoryId]) return;
+    delete index.entries[memoryId];
+    await this.saveIndex(index);
+  }
+  async resolveProvider() {
+    if (!this.config.embeddingFallbackEnabled) return null;
+    const preferred = this.config.embeddingFallbackProvider;
+    const providers = preferred === "auto" ? ["openai", "local"] : [preferred];
+    for (const p of providers) {
+      if (p === "openai" && this.config.openaiApiKey) {
+        const baseUrl = this.config.openaiBaseUrl ?? "https://api.openai.com/v1";
+        return {
+          type: "openai",
+          model: DEFAULT_OPENAI_MODEL,
+          endpoint: `${baseUrl.replace(/\/$/, "")}/embeddings`,
+          headers: {
+            "Content-Type": "application/json",
+            Authorization: `Bearer ${this.config.openaiApiKey}`
+          }
+        };
+      }
+      if (p === "local" && this.config.localLlmEnabled && this.config.localLlmUrl) {
+        const base = this.config.localLlmUrl.replace(/\/$/, "");
+        const endpoint = /\/v1$/i.test(base) ? `${base}/embeddings` : `${base}/v1/embeddings`;
+        const headers = {
+          "Content-Type": "application/json",
+          ...this.config.localLlmHeaders ?? {}
+        };
+        if (this.config.localLlmApiKey && this.config.localLlmAuthHeader !== false) {
+          headers.Authorization = `Bearer ${this.config.localLlmApiKey}`;
+        }
+        return {
+          type: "local",
+          model: this.config.localLlmModel || DEFAULT_OPENAI_MODEL,
+          endpoint,
+          headers
+        };
+      }
+    }
+    return null;
+  }
+  async embed(input, provider, options = {}) {
+    const mode = options.mode ?? "lookup";
+    const timeoutMs = mode === "index" ? resolveEmbeddingIndexTimeoutMs() : resolveEmbeddingLookupTimeoutMs();
+    try {
+      const res = await fetch(provider.endpoint, {
+        method: "POST",
+        headers: provider.headers,
+        body: JSON.stringify({
+          model: provider.model,
+          input: input.slice(0, 8e3),
+          encoding_format: "float"
+        }),
+        signal: AbortSignal.timeout(timeoutMs)
+      });
+      if (!res.ok) {
+        log.debug(`embedding fallback request failed: ${provider.type} ${res.status}`);
+        if (mode === "lookup") {
+          throw new EmbeddingTimeoutError(
+            `embedding backend returned ${res.status} (${provider.type})`
+          );
+        }
+        return null;
+      }
+      const payload = await res.json();
+      const vector = payload?.data?.[0]?.embedding;
+      if (!Array.isArray(vector)) return null;
+      return vector.map((n) => Number(n)).filter((n) => Number.isFinite(n));
+    } catch (err) {
+      if (err instanceof EmbeddingTimeoutError) {
+        throw err;
+      }
+      const isTimeout = err instanceof Error && (err.name === "TimeoutError" || err.name === "AbortError");
+      if (isTimeout) {
+        log.warn(
+          `embedding fallback fetch timed out after ${timeoutMs}ms (${provider.type}, mode=${mode})`
+        );
+        if (mode === "lookup") {
+          throw new EmbeddingTimeoutError(
+            `embedding backend timed out after ${timeoutMs}ms (${provider.type})`
+          );
+        }
+      } else {
+        if (mode === "lookup") {
+          log.warn(
+            `embedding fallback transport error on lookup path (${provider.type}): ${err}`
+          );
+          throw new EmbeddingTimeoutError(
+            `embedding backend transport failure (${provider.type}): ${err instanceof Error ? err.message : String(err)}`
+          );
+        }
+        log.debug(`embedding fallback error: ${err}`);
+      }
+      return null;
+    }
+  }
+  async loadIndex(provider) {
+    if (this.loaded && this.loaded.provider === provider.type && this.loaded.model === provider.model) {
+      return this.loaded;
+    }
+    try {
+      const raw = await readFile(this.indexPath, "utf-8");
+      const parsed = JSON.parse(raw);
+      if (parsed && parsed.version === 1 && parsed.entries && typeof parsed.entries === "object") {
+        this.loaded = {
+          version: 1,
+          provider: provider.type,
+          model: provider.model,
+          entries: parsed.entries
+        };
+        return this.loaded;
+      }
+    } catch {
+    }
+    this.loaded = {
+      version: 1,
+      provider: provider.type,
+      model: provider.model,
+      entries: {}
+    };
+    return this.loaded;
+  }
+  async saveIndex(index) {
+    await mkdir(path.dirname(this.indexPath), { recursive: true });
+    await writeFile(this.indexPath, JSON.stringify(index), "utf-8");
+    this.loaded = index;
+  }
+};
+function toMemoryRelativePath(memoryDir, filePath) {
+  if (!path.isAbsolute(filePath)) return filePath;
+  const rel = path.relative(memoryDir, filePath);
+  return rel.startsWith("..") ? filePath : rel;
+}
+function normalizeEntryPath(p) {
+  let out = p.replace(/\\/g, "/");
+  if (out.startsWith("./")) out = out.slice(2);
+  return out;
+}
+function normalizePathPrefix(prefix) {
+  if (prefix === void 0 || prefix === null) return void 0;
+  let p = String(prefix).replace(/\\/g, "/");
+  if (p.startsWith("./")) p = p.slice(2);
+  if (p.length === 0) return void 0;
+  if (!p.endsWith("/")) p = `${p}/`;
+  return p;
+}
+function cosineSimilarity(a, b) {
+  const n = Math.min(a.length, b.length);
+  if (n === 0) return 0;
+  let dot = 0;
+  let normA = 0;
+  let normB = 0;
+  for (let i = 0; i < n; i++) {
+    const av = a[i] ?? 0;
+    const bv = b[i] ?? 0;
+    dot += av * bv;
+    normA += av * av;
+    normB += bv * bv;
+  }
+  const denom = Math.sqrt(normA) * Math.sqrt(normB);
+  if (denom === 0) return 0;
+  return dot / denom;
+}
+
+export {
+  EmbeddingTimeoutError,
+  EmbeddingFallback
+};
+//# sourceMappingURL=chunk-ALXMCZEU.js.map

package/dist/chunk-ALXMCZEU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/embedding-fallback.ts"],"sourcesContent":["import path from \"node:path\";\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { log } from \"./logger.js\";\nimport type { PluginConfig } from \"./types.js\";\n\ntype EmbeddingProviderType = \"openai\" | \"local\";\n\ntype ProviderConfig = {\n  type: EmbeddingProviderType;\n  model: string;\n  endpoint: string;\n  headers: Record<string, string>;\n};\n\ntype EmbeddingIndexEntry = {\n  vector: number[];\n  path: string;\n};\n\ntype EmbeddingIndexFile = {\n  version: 1;\n  provider: EmbeddingProviderType;\n  model: string;\n  entries: Record<string, EmbeddingIndexEntry>;\n};\n\nconst DEFAULT_OPENAI_MODEL = \"text-embedding-3-small\";\n\n/**\n * Thrown by `EmbeddingFallback.search()` (via `embed()`) when the embedding\n * backend is effectively unavailable on the lookup path — either because the\n * HTTP fetch exceeded its deadline OR because the endpoint returned a non-2xx\n * status code. Callers that need to distinguish a backend outage from \"no\n * candidates\" can `instanceof`-check against this class.\n *\n * Round 9 fix (Finding UZqB): previously a timeout returned null from embed(),\n * which caused search() to return [] silently. decideSemanticDedup then\n * classified the result as no_candidates instead of backend_unavailable, so\n * the per-batch batchBackendUnavailable short-circuit never activated and\n * batches of N facts each paid a full timeout roundtrip.\n *\n * Round 10 fix (Findings Ui1J + Ui1L): search() now only re-throws this error\n * when the caller explicitly passes `{ throwOnTimeout: true }`. Without that\n * flag search() catches it and returns [] instead, preserving fail-open\n * semantics for recall-path callers (searchEmbeddingFallback) that have no\n * try/catch. Only the semantic-dedup path (semanticDedupLookup) passes the\n * flag so it can still reach decideSemanticDedup's backend_unavailable branch.\n *\n * Round 11 fix (Finding Ur_J): `embed()` now also throws this error from the\n * lookup path when the HTTP response is non-2xx (e.g. 429, 500, 503). Without\n * this, repeated 5xx outages would each return null → [] → no_candidates and\n * subsequent facts in the same batch would all pay full roundtrips instead of\n * tripping the per-batch backend_unavailable short-circuit.\n *\n * The class name is kept for backward compatibility — `EmbeddingTimeoutError`\n * now signals \"lookup backend unavailable\" rather than strictly \"timed out\".\n */\nexport class EmbeddingTimeoutError extends Error {\n  override readonly name = \"EmbeddingTimeoutError\" as const;\n  constructor(message: string) {\n    super(message);\n  }\n}\n\n/**\n * Maximum time to wait for an embedding HTTP request on the LOOKUP/query\n * path before giving up.\n *\n * The write-time semantic dedup guard in orchestrator.persistExtraction()\n * blocks each candidate fact on an embedding lookup. If the embedding\n * endpoint hangs (degraded OpenAI, stalled local gateway, DNS timeout),\n * extraction would otherwise stall indefinitely — a single bad backend\n * could freeze the entire persist loop. Bounding the fetch here ensures\n * the decision path fails open (returns null) within a predictable window\n * and writes proceed as non-duplicates.\n *\n * Tests can override via REMNIC_EMBEDDING_FETCH_TIMEOUT_MS so they don't\n * have to wait the full default on hung-fetch assertions.\n *\n * Related: joshuaswarren/remnic#373, PR #399 P1/P2 review.\n */\nconst DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS = 5000;\n\n/**\n * Maximum time to wait for an embedding HTTP request on the INDEX path.\n *\n * Indexing runs asynchronously after a memory has already been persisted\n * to disk. It does not block extraction or writes — it only updates the\n * embedding index used by later semantic dedup lookups. A slow local\n * CPU-backed embedding model can legitimately take tens of seconds per\n * call, so applying the short lookup timeout here silently dropped index\n * updates and caused later dedup lookups to miss recently persisted\n * memories. Use a much larger budget on this path.\n *\n * Tests can override via REMNIC_EMBEDDING_INDEX_TIMEOUT_MS.\n */\nconst DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS = 120_000;\n\nfunction resolveEmbeddingLookupTimeoutMs(): number {\n  const raw = process.env.REMNIC_EMBEDDING_FETCH_TIMEOUT_MS;\n  if (raw) {\n    const parsed = Number(raw);\n    if (Number.isFinite(parsed) && parsed > 0) {\n      return Math.floor(parsed);\n    }\n  }\n  return DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS;\n}\n\nfunction resolveEmbeddingIndexTimeoutMs(): number {\n  const raw = process.env.REMNIC_EMBEDDING_INDEX_TIMEOUT_MS;\n  if (raw) {\n    const parsed = Number(raw);\n    if (Number.isFinite(parsed) && parsed > 0) {\n      return Math.floor(parsed);\n    }\n  }\n  return DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS;\n}\n\n/**\n * Options for the low-level embed() call.\n *\n * `mode` selects the timeout profile:\n *   - \"lookup\" (default): bounded by the short lookup budget; fails open fast.\n *   - \"index\": bounded by a much longer budget so slow backends can still\n *     index newly persisted memories.\n */\nexport type EmbedMode = \"lookup\" | \"index\";\n\nexport class EmbeddingFallback {\n  private readonly indexPath: string;\n  private loaded: EmbeddingIndexFile | null = null;\n\n  constructor(private readonly config: PluginConfig) {\n    this.indexPath = path.join(config.memoryDir, \"state\", \"embeddings.json\");\n  }\n\n  async isAvailable(): Promise<boolean> {\n    return (await this.resolveProvider()) !== null;\n  }\n\n  /**\n   * Embed an array of texts and return their embedding vectors.\n   *\n   * This is the public batch-embed interface used by semantic chunking\n   * (Finding 1, PR #420 post-merge). Texts are grouped into batches of\n   * `embeddingBatchSize` (from `semanticChunkingConfig`, default 32) and\n   * each batch is dispatched concurrently via `Promise.all()`. This\n   * preserves the semantic intent of `embeddingBatchSize` — without batching,\n   * every text incurred a sequential HTTP round-trip, making the batch size\n   * config ineffective. (PR #439 post-merge Finding 2.)\n   *\n   * If the provider is unavailable or any single embedding fails, the method\n   * throws so the caller can fall back to recursive chunking.\n   */\n  async embedTexts(texts: string[]): Promise<number[][]> {\n    const provider = await this.resolveProvider();\n    if (!provider) {\n      throw new Error(\"Embedding provider is not available\");\n    }\n\n    const batchSize = Math.max(\n      1,\n      this.config.semanticChunkingConfig?.embeddingBatchSize ?? 32,\n    );\n\n    const vectors: number[][] = [];\n    for (let i = 0; i < texts.length; i += batchSize) {\n      const batch = texts.slice(i, i + batchSize);\n      const batchResults = await Promise.all(\n        batch.map((text) => this.embed(text, provider, { mode: \"lookup\" })),\n      );\n      for (const vec of batchResults) {\n        if (!vec) {\n          throw new Error(\"Embedding returned null for input text\");\n        }\n        vectors.push(vec);\n      }\n    }\n    return vectors;\n  }\n\n  /**\n   * Nearest-neighbor search against the embedding index.\n   *\n   * @param query         The query string to embed and search for.\n   * @param limit         Max number of hits to return.\n   * @param options       Optional filters.\n   *   - `pathPrefix`   Restrict candidates to entries whose indexed `path`\n   *                    starts with this prefix (relative to `memoryDir`).\n   *                    Used by the semantic dedup guard to scope lookups\n   *                    to the target namespace so a high-similarity hit\n   *                    from a different namespace can't suppress a write\n   *                    in the target namespace. Default: no filter.\n   *   - `pathExcludePrefixes`\n   *                    Exclude any entry whose indexed `path` starts with\n   *                    any of these prefixes. Used for the default\n   *                    namespace case: when the default namespace lives at\n   *                    `memoryDir` root (legacy layout) we still want to\n   *                    exclude `namespaces/<other>/…` entries.\n   */\n  async search(\n    query: string,\n    limit: number,\n    options: {\n      pathPrefix?: string;\n      pathExcludePrefixes?: readonly string[];\n      /**\n       * When true, an `EmbeddingTimeoutError` from the embedding backend is\n       * re-thrown to the caller. Use this on the semantic-dedup path so\n       * `decideSemanticDedup`'s catch block can classify the result as\n       * `reason=\"backend_unavailable\"` and activate the per-batch\n       * short-circuit.\n       *\n       * When false (the default), a timeout is caught here and search()\n       * returns [] instead — preserving fail-open semantics for the recall\n       * path (`searchEmbeddingFallback`) which has no surrounding try/catch.\n       * Without this gate a timed-out embedding request on the recall path\n       * would propagate as an unhandled rejection and abort recall entirely.\n       * (Round 10 fix, Findings Ui1J + Ui1L.)\n       */\n      throwOnTimeout?: boolean;\n    } = {},\n  ): Promise<Array<{ id: string; score: number; path: string }>> {\n    const provider = await this.resolveProvider();\n    if (!provider) return [];\n\n    const index = await this.loadIndex(provider);\n    const ids = Object.keys(index.entries);\n    if (ids.length === 0) return [];\n\n    let queryVector: number[] | null;\n    try {\n      queryVector = await this.embed(query, provider, { mode: \"lookup\" });\n    } catch (err) {\n      if (err instanceof EmbeddingTimeoutError) {\n        if (options.throwOnTimeout) {\n          throw err;\n        }\n        // Fail-open: recall-path callers get an empty result rather than an\n        // unhandled rejection that would abort recall entirely.\n        log.debug(\"embedding fallback search: timeout on lookup, returning [] (throwOnTimeout=false)\");\n        return [];\n      }\n      throw err;\n    }\n    if (!queryVector) return [];\n\n    const includePrefix = normalizePathPrefix(options.pathPrefix);\n    const excludePrefixes = (options.pathExcludePrefixes ?? [])\n      .map((p) => normalizePathPrefix(p))\n      .filter((p): p is string => typeof p === \"string\");\n\n    const scored = ids\n      .map((id) => {\n        const entry = index.entries[id];\n        return {\n          id,\n          path: entry.path,\n          score: cosineSimilarity(queryVector, entry.vector),\n        };\n      })\n      .filter((r) => {\n        if (!Number.isFinite(r.score)) return false;\n        const normalized = normalizeEntryPath(r.path);\n        if (includePrefix !== undefined && !normalized.startsWith(includePrefix)) {\n          return false;\n        }\n        for (const excl of excludePrefixes) {\n          if (normalized.startsWith(excl)) return false;\n        }\n        return true;\n      })\n      .sort((a, b) => b.score - a.score)\n      .slice(0, Math.max(1, limit));\n\n    return scored;\n  }\n\n  async indexFile(memoryId: string, content: string, filePath: string): Promise<void> {\n    const provider = await this.resolveProvider();\n    if (!provider) return;\n    // Indexing is not on the write-critical path: a newly persisted memory\n    // has already been written to disk by the time we reach this call. Use\n    // the long \"index\" timeout so slow local embedding backends can still\n    // add the entry to the index. Previously this used the short lookup\n    // budget and silently dropped updates, leaving later dedup lookups\n    // blind to the memory. Related: PR #399 P2.\n    const vector = await this.embed(content, provider, { mode: \"index\" });\n    if (!vector) return;\n\n    const index = await this.loadIndex(provider);\n    const relPath = toMemoryRelativePath(this.config.memoryDir, filePath);\n    index.entries[memoryId] = {\n      vector,\n      path: relPath,\n    };\n    await this.saveIndex(index);\n  }\n\n  async removeFromIndex(memoryId: string): Promise<void> {\n    const provider = await this.resolveProvider();\n    if (!provider) return;\n\n    const index = await this.loadIndex(provider);\n    if (!index.entries[memoryId]) return;\n    delete index.entries[memoryId];\n    await this.saveIndex(index);\n  }\n\n  private async resolveProvider(): Promise<ProviderConfig | null> {\n    if (!this.config.embeddingFallbackEnabled) return null;\n\n    const preferred = this.config.embeddingFallbackProvider;\n    const providers = preferred === \"auto\" ? [\"openai\", \"local\"] : [preferred];\n\n    for (const p of providers) {\n      if (p === \"openai\" && this.config.openaiApiKey) {\n        const baseUrl = this.config.openaiBaseUrl ?? \"https://api.openai.com/v1\";\n        return {\n          type: \"openai\",\n          model: DEFAULT_OPENAI_MODEL,\n          endpoint: `${baseUrl.replace(/\\/$/, \"\")}/embeddings`,\n          headers: {\n            \"Content-Type\": \"application/json\",\n            Authorization: `Bearer ${this.config.openaiApiKey}`,\n          },\n        };\n      }\n\n      if (p === \"local\" && this.config.localLlmEnabled && this.config.localLlmUrl) {\n        const base = this.config.localLlmUrl.replace(/\\/$/, \"\");\n        const endpoint = /\\/v1$/i.test(base) ? `${base}/embeddings` : `${base}/v1/embeddings`;\n        const headers: Record<string, string> = {\n          \"Content-Type\": \"application/json\",\n          ...(this.config.localLlmHeaders ?? {}),\n        };\n        if (this.config.localLlmApiKey && this.config.localLlmAuthHeader !== false) {\n          headers.Authorization = `Bearer ${this.config.localLlmApiKey}`;\n        }\n        return {\n          type: \"local\",\n          model: this.config.localLlmModel || DEFAULT_OPENAI_MODEL,\n          endpoint,\n          headers,\n        };\n      }\n    }\n\n    return null;\n  }\n\n  private async embed(\n    input: string,\n    provider: ProviderConfig,\n    options: { mode?: EmbedMode } = {},\n  ): Promise<number[] | null> {\n    // Bound the fetch so a hung embedding endpoint cannot stall callers.\n    // The lookup path uses a short budget (see DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS\n    // docblock) so semantic dedup fails open fast. The index path uses a\n    // much longer budget because slow local backends (CPU embedding models)\n    // otherwise drop index updates and blind later dedup lookups. See\n    // DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS docblock and PR #399 P2 review.\n    const mode: EmbedMode = options.mode ?? \"lookup\";\n    const timeoutMs =\n      mode === \"index\"\n        ? resolveEmbeddingIndexTimeoutMs()\n        : resolveEmbeddingLookupTimeoutMs();\n    try {\n      const res = await fetch(provider.endpoint, {\n        method: \"POST\",\n        headers: provider.headers,\n        body: JSON.stringify({\n          model: provider.model,\n          input: input.slice(0, 8000),\n          encoding_format: \"float\",\n        }),\n        signal: AbortSignal.timeout(timeoutMs),\n      });\n      if (!res.ok) {\n        log.debug(`embedding fallback request failed: ${provider.type} ${res.status}`);\n        // Round 11 fix (Finding Ur_J): on the LOOKUP path, a non-2xx response\n        // means the embedding backend is effectively unavailable. Throw the\n        // tagged error so search() (when called with throwOnTimeout) propagates\n        // to decideSemanticDedup's backend_unavailable branch, activating the\n        // per-batch short-circuit. Without this, repeated 429/5xx responses\n        // would silently return [] for every fact in the batch.\n        //\n        // On the INDEX path a non-2xx is non-fatal (the memory is already\n        // persisted; index update can be skipped) — return null there.\n        if (mode === \"lookup\") {\n          throw new EmbeddingTimeoutError(\n            `embedding backend returned ${res.status} (${provider.type})`,\n          );\n        }\n        return null;\n      }\n      const payload = (await res.json()) as any;\n      const vector = payload?.data?.[0]?.embedding;\n      if (!Array.isArray(vector)) return null;\n      return vector.map((n: unknown) => Number(n)).filter((n: number) => Number.isFinite(n));\n    } catch (err) {\n      // Round 11 (Finding Ur_J): the !res.ok branch above throws\n      // EmbeddingTimeoutError directly. Re-throw it here so the catch does\n      // not swallow our own intentional signal back into a null return.\n      if (err instanceof EmbeddingTimeoutError) {\n        throw err;\n      }\n      // AbortSignal.timeout throws a DOMException with name \"TimeoutError\";\n      // surface at warn level so operators can distinguish slow backends from\n      // generic errors.\n      const isTimeout =\n        err instanceof Error &&\n        (err.name === \"TimeoutError\" || err.name === \"AbortError\");\n      if (isTimeout) {\n        log.warn(\n          `embedding fallback fetch timed out after ${timeoutMs}ms (${provider.type}, mode=${mode})`,\n        );\n        // Round 9 fix (Finding UZqB): on the LOOKUP path a timeout means the\n        // embedding backend is effectively unavailable — re-throw so that\n        // search() propagates the error to semanticDedupLookup, which lets it\n        // reach decideSemanticDedup's catch block and return\n        // reason=\"backend_unavailable\". Without this, search() would silently\n        // return [] and the per-batch batchBackendUnavailable flag would never\n        // flip, causing subsequent facts in the same batch to each pay a full\n        // timeout roundtrip (N × timeout instead of 1 × timeout).\n        //\n        // On the INDEX path a timeout is not fatal (the memory is already\n        // persisted; index update can be skipped) — return null there so\n        // indexFile() stays non-blocking.\n        if (mode === \"lookup\") {\n          throw new EmbeddingTimeoutError(\n            `embedding backend timed out after ${timeoutMs}ms (${provider.type})`,\n          );\n        }\n      } else {\n        // Round 12 fix (PR #399 thread PRRT_kwDORJXyws56U6Gi): non-timeout\n        // transport failures (ECONNREFUSED, DNS errors, TLS failures) are just\n        // as fatal as timeouts on the LOOKUP path — the embedding backend is\n        // effectively unreachable. Throw EmbeddingTimeoutError so that\n        // search() (when called with throwOnTimeout:true) propagates the error\n        // to decideSemanticDedup's backend_unavailable branch, activating the\n        // per-batch short-circuit. Without this, each fact in the batch would\n        // pay a full ECONNREFUSED roundtrip and return null → [] → no_candidates,\n        // preventing batchBackendUnavailable from ever being set.\n        //\n        // On the INDEX path a transport failure is non-fatal — the memory is\n        // already persisted; index update can be safely skipped.\n        if (mode === \"lookup\") {\n          log.warn(\n            `embedding fallback transport error on lookup path (${provider.type}): ${err}`,\n          );\n          throw new EmbeddingTimeoutError(\n            `embedding backend transport failure (${provider.type}): ${err instanceof Error ? err.message : String(err)}`,\n          );\n        }\n        log.debug(`embedding fallback error: ${err}`);\n      }\n      return null;\n    }\n  }\n\n  private async loadIndex(provider: ProviderConfig): Promise<EmbeddingIndexFile> {\n    if (this.loaded && this.loaded.provider === provider.type && this.loaded.model === provider.model) {\n      return this.loaded;\n    }\n\n    try {\n      const raw = await readFile(this.indexPath, \"utf-8\");\n      const parsed = JSON.parse(raw) as EmbeddingIndexFile;\n      if (parsed && parsed.version === 1 && parsed.entries && typeof parsed.entries === \"object\") {\n        this.loaded = {\n          version: 1,\n          provider: provider.type,\n          model: provider.model,\n          entries: parsed.entries,\n        };\n        return this.loaded;\n      }\n    } catch {\n      // ignore and create a new index\n    }\n\n    this.loaded = {\n      version: 1,\n      provider: provider.type,\n      model: provider.model,\n      entries: {},\n    };\n    return this.loaded;\n  }\n\n  private async saveIndex(index: EmbeddingIndexFile): Promise<void> {\n    await mkdir(path.dirname(this.indexPath), { recursive: true });\n    await writeFile(this.indexPath, JSON.stringify(index), \"utf-8\");\n    this.loaded = index;\n  }\n}\n\nfunction toMemoryRelativePath(memoryDir: string, filePath: string): string {\n  if (!path.isAbsolute(filePath)) return filePath;\n  const rel = path.relative(memoryDir, filePath);\n  return rel.startsWith(\"..\") ? filePath : rel;\n}\n\n/**\n * Normalize an index entry path to forward-slashes for stable prefix\n * comparison. Entries are stored as `path.relative(memoryDir, …)` output,\n * which on Windows uses back-slashes. Normalize both sides so prefix\n * matching is OS-independent.\n *\n * Also strip a leading `./` so this helper's output is symmetric with\n * `normalizePathPrefix` below. `toMemoryRelativePath` is a pass-through for\n * non-absolute filePath inputs, so an index entry could legitimately carry a\n * stored path like `\"./namespaces/alpha/facts/f.md\"`. Without this strip, a\n * caller-supplied prefix `\"./namespaces/alpha\"` (which `normalizePathPrefix`\n * rewrites to `\"namespaces/alpha/\"`) would silently miss that entry and\n * namespace-scoped dedup would either let a near-duplicate through or fail\n * to exclude a cross-namespace hit.\n */\nfunction normalizeEntryPath(p: string): string {\n  let out = p.replace(/\\\\/g, \"/\");\n  if (out.startsWith(\"./\")) out = out.slice(2);\n  return out;\n}\n\n/**\n * Normalize a caller-supplied path prefix:\n *   - Return `undefined` for nullish/empty input (no filter).\n *   - Replace back-slashes with forward-slashes.\n *   - Strip a leading `./`.\n *   - Ensure a trailing `/` so `\"namespaces/a\"` doesn't accidentally match\n *     `\"namespaces/another/…\"`.\n */\nfunction normalizePathPrefix(prefix: string | undefined): string | undefined {\n  if (prefix === undefined || prefix === null) return undefined;\n  let p = String(prefix).replace(/\\\\/g, \"/\");\n  if (p.startsWith(\"./\")) p = p.slice(2);\n  if (p.length === 0) return undefined;\n  if (!p.endsWith(\"/\")) p = `${p}/`;\n  return p;\n}\n\nfunction cosineSimilarity(a: number[], b: number[]): number {\n  const n = Math.min(a.length, b.length);\n  if (n === 0) return 0;\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < n; i++) {\n    const av = a[i] ?? 0;\n    const bv = b[i] ?? 0;\n    dot += av * bv;\n    normA += av * av;\n    normB += bv * bv;\n  }\n  const denom = Math.sqrt(normA) * Math.sqrt(normB);\n  if (denom === 0) return 0;\n  return dot / denom;\n}\n\n"],"mappings":";;;;;AAAA,OAAO,UAAU;AACjB,SAAS,OAAO,UAAU,iBAAiB;AAyB3C,IAAM,uBAAuB;AA+BtB,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAC7B,OAAO;AAAA,EACzB,YAAY,SAAiB;AAC3B,UAAM,OAAO;AAAA,EACf;AACF;AAmBA,IAAM,sCAAsC;AAe5C,IAAM,qCAAqC;AAE3C,SAAS,kCAA0C;AACjD,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,KAAK;AACP,UAAM,SAAS,OAAO,GAAG;AACzB,QAAI,OAAO,SAAS,MAAM,KAAK,SAAS,GAAG;AACzC,aAAO,KAAK,MAAM,MAAM;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iCAAyC;AAChD,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,KAAK;AACP,UAAM,SAAS,OAAO,GAAG;AACzB,QAAI,OAAO,SAAS,MAAM,KAAK,SAAS,GAAG;AACzC,aAAO,KAAK,MAAM,MAAM;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAYO,IAAM,oBAAN,MAAwB;AAAA,EAI7B,YAA6B,QAAsB;AAAtB;AAC3B,SAAK,YAAY,KAAK,KAAK,OAAO,WAAW,SAAS,iBAAiB;AAAA,EACzE;AAAA,EAF6B;AAAA,EAHZ;AAAA,EACT,SAAoC;AAAA,EAM5C,MAAM,cAAgC;AACpC,WAAQ,MAAM,KAAK,gBAAgB,MAAO;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,WAAW,OAAsC;AACrD,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,UAAM,YAAY,KAAK;AAAA,MACrB;AAAA,MACA,KAAK,OAAO,wBAAwB,sBAAsB;AAAA,IAC5D;AAEA,UAAM,UAAsB,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,WAAW;AAChD,YAAM,QAAQ,MAAM,MAAM,GAAG,IAAI,SAAS;AAC1C,YAAM,eAAe,MAAM,QAAQ;AAAA,QACjC,MAAM,IAAI,CAAC,SAAS,KAAK,MAAM,MAAM,UAAU,EAAE,MAAM,SAAS,CAAC,CAAC;AAAA,MACpE;AACA,iBAAW,OAAO,cAAc;AAC9B,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,wCAAwC;AAAA,QAC1D;AACA,gBAAQ,KAAK,GAAG;AAAA,MAClB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,MAAM,OACJ,OACA,OACA,UAkBI,CAAC,GACwD;AAC7D,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,UAAM,MAAM,OAAO,KAAK,MAAM,OAAO;AACrC,QAAI,IAAI,WAAW,EAAG,QAAO,CAAC;AAE9B,QAAI;AACJ,QAAI;AACF,oBAAc,MAAM,KAAK,MAAM,OAAO,UAAU,EAAE,MAAM,SAAS,CAAC;AAAA,IACpE,SAAS,KAAK;AACZ,UAAI,eAAe,uBAAuB;AACxC,YAAI,QAAQ,gBAAgB;AAC1B,gBAAM;AAAA,QACR;AAGA,YAAI,MAAM,mFAAmF;AAC7F,eAAO,CAAC;AAAA,MACV;AACA,YAAM;AAAA,IACR;AACA,QAAI,CAAC,YAAa,QAAO,CAAC;AAE1B,UAAM,gBAAgB,oBAAoB,QAAQ,UAAU;AAC5D,UAAM,mBAAmB,QAAQ,uBAAuB,CAAC,GACtD,IAAI,CAAC,MAAM,oBAAoB,CAAC,CAAC,EACjC,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAEnD,UAAM,SAAS,IACZ,IAAI,CAAC,OAAO;AACX,YAAM,QAAQ,MAAM,QAAQ,EAAE;AAC9B,aAAO;AAAA,QACL;AAAA,QACA,MAAM,MAAM;AAAA,QACZ,OAAO,iBAAiB,aAAa,MAAM,MAAM;AAAA,MACnD;AAAA,IACF,CAAC,EACA,OAAO,CAAC,MAAM;AACb,UAAI,CAAC,OAAO,SAAS,EAAE,KAAK,EAAG,QAAO;AACtC,YAAM,aAAa,mBAAmB,EAAE,IAAI;AAC5C,UAAI,kBAAkB,UAAa,CAAC,WAAW,WAAW,aAAa,GAAG;AACxE,eAAO;AAAA,MACT;AACA,iBAAW,QAAQ,iBAAiB;AAClC,YAAI,WAAW,WAAW,IAAI,EAAG,QAAO;AAAA,MAC1C;AACA,aAAO;AAAA,IACT,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAE9B,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UAAU,UAAkB,SAAiB,UAAiC;AAClF,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU;AAOf,UAAM,SAAS,MAAM,KAAK,MAAM,SAAS,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpE,QAAI,CAAC,OAAQ;AAEb,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,UAAM,UAAU,qBAAqB,KAAK,OAAO,WAAW,QAAQ;AACpE,UAAM,QAAQ,QAAQ,IAAI;AAAA,MACxB;AAAA,MACA,MAAM;AAAA,IACR;AACA,UAAM,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EAEA,MAAM,gBAAgB,UAAiC;AACrD,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU;AAEf,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,QAAI,CAAC,MAAM,QAAQ,QAAQ,EAAG;AAC9B,WAAO,MAAM,QAAQ,QAAQ;AAC7B,UAAM,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EAEA,MAAc,kBAAkD;AAC9D,QAAI,CAAC,KAAK,OAAO,yBAA0B,QAAO;AAElD,UAAM,YAAY,KAAK,OAAO;AAC9B,UAAM,YAAY,cAAc,SAAS,CAAC,UAAU,OAAO,IAAI,CAAC,SAAS;AAEzE,eAAW,KAAK,WAAW;AACzB,UAAI,MAAM,YAAY,KAAK,OAAO,cAAc;AAC9C,cAAM,UAAU,KAAK,OAAO,iBAAiB;AAC7C,eAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,UAAU,GAAG,QAAQ,QAAQ,OAAO,EAAE,CAAC;AAAA,UACvC,SAAS;AAAA,YACP,gBAAgB;AAAA,YAChB,eAAe,UAAU,KAAK,OAAO,YAAY;AAAA,UACnD;AAAA,QACF;AAAA,MACF;AAEA,UAAI,MAAM,WAAW,KAAK,OAAO,mBAAmB,KAAK,OAAO,aAAa;AAC3E,cAAM,OAAO,KAAK,OAAO,YAAY,QAAQ,OAAO,EAAE;AACtD,cAAM,WAAW,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,GAAG,IAAI;AACrE,cAAM,UAAkC;AAAA,UACtC,gBAAgB;AAAA,UAChB,GAAI,KAAK,OAAO,mBAAmB,CAAC;AAAA,QACtC;AACA,YAAI,KAAK,OAAO,kBAAkB,KAAK,OAAO,uBAAuB,OAAO;AAC1E,kBAAQ,gBAAgB,UAAU,KAAK,OAAO,cAAc;AAAA,QAC9D;AACA,eAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO,KAAK,OAAO,iBAAiB;AAAA,UACpC;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,MACZ,OACA,UACA,UAAgC,CAAC,GACP;AAO1B,UAAM,OAAkB,QAAQ,QAAQ;AACxC,UAAM,YACJ,SAAS,UACL,+BAA+B,IAC/B,gCAAgC;AACtC,QAAI;AACF,YAAM,MAAM,MAAM,MAAM,SAAS,UAAU;AAAA,QACzC,QAAQ;AAAA,QACR,SAAS,SAAS;AAAA,QAClB,MAAM,KAAK,UAAU;AAAA,UACnB,OAAO,SAAS;AAAA,UAChB,OAAO,MAAM,MAAM,GAAG,GAAI;AAAA,UAC1B,iBAAiB;AAAA,QACnB,CAAC;AAAA,QACD,QAAQ,YAAY,QAAQ,SAAS;AAAA,MACvC,CAAC;AACD,UAAI,CAAC,IAAI,IAAI;AACX,YAAI,MAAM,sCAAsC,SAAS,IAAI,IAAI,IAAI,MAAM,EAAE;AAU7E,YAAI,SAAS,UAAU;AACrB,gBAAM,IAAI;AAAA,YACR,8BAA8B,IAAI,MAAM,KAAK,SAAS,IAAI;AAAA,UAC5D;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,YAAM,UAAW,MAAM,IAAI,KAAK;AAChC,YAAM,SAAS,SAAS,OAAO,CAAC,GAAG;AACnC,UAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,QAAO;AACnC,aAAO,OAAO,IAAI,CAAC,MAAe,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,MAAc,OAAO,SAAS,CAAC,CAAC;AAAA,IACvF,SAAS,KAAK;AAIZ,UAAI,eAAe,uBAAuB;AACxC,cAAM;AAAA,MACR;AAIA,YAAM,YACJ,eAAe,UACd,IAAI,SAAS,kBAAkB,IAAI,SAAS;AAC/C,UAAI,WAAW;AACb,YAAI;AAAA,UACF,4CAA4C,SAAS,OAAO,SAAS,IAAI,UAAU,IAAI;AAAA,QACzF;AAaA,YAAI,SAAS,UAAU;AACrB,gBAAM,IAAI;AAAA,YACR,qCAAqC,SAAS,OAAO,SAAS,IAAI;AAAA,UACpE;AAAA,QACF;AAAA,MACF,OAAO;AAaL,YAAI,SAAS,UAAU;AACrB,cAAI;AAAA,YACF,sDAAsD,SAAS,IAAI,MAAM,GAAG;AAAA,UAC9E;AACA,gBAAM,IAAI;AAAA,YACR,wCAAwC,SAAS,IAAI,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,UAC7G;AAAA,QACF;AACA,YAAI,MAAM,6BAA6B,GAAG,EAAE;AAAA,MAC9C;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAc,UAAU,UAAuD;AAC7E,QAAI,KAAK,UAAU,KAAK,OAAO,aAAa,SAAS,QAAQ,KAAK,OAAO,UAAU,SAAS,OAAO;AACjG,aAAO,KAAK;AAAA,IACd;AAEA,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,WAAW,OAAO;AAClD,YAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,UAAI,UAAU,OAAO,YAAY,KAAK,OAAO,WAAW,OAAO,OAAO,YAAY,UAAU;AAC1F,aAAK,SAAS;AAAA,UACZ,SAAS;AAAA,UACT,UAAU,SAAS;AAAA,UACnB,OAAO,SAAS;AAAA,UAChB,SAAS,OAAO;AAAA,QAClB;AACA,eAAO,KAAK;AAAA,MACd;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,SAAK,SAAS;AAAA,MACZ,SAAS;AAAA,MACT,UAAU,SAAS;AAAA,MACnB,OAAO,SAAS;AAAA,MAChB,SAAS,CAAC;AAAA,IACZ;AACA,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAc,UAAU,OAA0C;AAChE,UAAM,MAAM,KAAK,QAAQ,KAAK,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAC7D,UAAM,UAAU,KAAK,WAAW,KAAK,UAAU,KAAK,GAAG,OAAO;AAC9D,SAAK,SAAS;AAAA,EAChB;AACF;AAEA,SAAS,qBAAqB,WAAmB,UAA0B;AACzE,MAAI,CAAC,KAAK,WAAW,QAAQ,EAAG,QAAO;AACvC,QAAM,MAAM,KAAK,SAAS,WAAW,QAAQ;AAC7C,SAAO,IAAI,WAAW,IAAI,IAAI,WAAW;AAC3C;AAiBA,SAAS,mBAAmB,GAAmB;AAC7C,MAAI,MAAM,EAAE,QAAQ,OAAO,GAAG;AAC9B,MAAI,IAAI,WAAW,IAAI,EAAG,OAAM,IAAI,MAAM,CAAC;AAC3C,SAAO;AACT;AAUA,SAAS,oBAAoB,QAAgD;AAC3E,MAAI,WAAW,UAAa,WAAW,KAAM,QAAO;AACpD,MAAI,IAAI,OAAO,MAAM,EAAE,QAAQ,OAAO,GAAG;AACzC,MAAI,EAAE,WAAW,IAAI,EAAG,KAAI,EAAE,MAAM,CAAC;AACrC,MAAI,EAAE,WAAW,EAAG,QAAO;AAC3B,MAAI,CAAC,EAAE,SAAS,GAAG,EAAG,KAAI,GAAG,CAAC;AAC9B,SAAO;AACT;AAEA,SAAS,iBAAiB,GAAa,GAAqB;AAC1D,QAAM,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACrC,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,KAAK,EAAE,CAAC,KAAK;AACnB,UAAM,KAAK,EAAE,CAAC,KAAK;AACnB,WAAO,KAAK;AACZ,aAAS,KAAK;AACd,aAAS,KAAK;AAAA,EAChB;AACA,QAAM,QAAQ,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK;AAChD,MAAI,UAAU,EAAG,QAAO;AACxB,SAAO,MAAM;AACf;","names":[]}

package/dist/{chunk-QANCTXQF.js → chunk-AYPYCLR7.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-CULXMQJH.js";
 import {
   TranscriptManager
-} from "./chunk-UV2FO7J4.js";
+} from "./chunk-E6K4NIEU.js";
 import {
   resolveObjectiveStateStoreDir,
   validateObjectiveStateSnapshot
@@ -15,7 +15,7 @@ import {
 } from "./chunk-FYIYMQ5N.js";
 import {
   parseConfig
-} from "./chunk-ISY75RLM.js";
+} from "./chunk-OJFGVJS6.js";
 import {
   assertIsoRecordedAt,
   assertSafePathSegment,
@@ -268,4 +268,4 @@ export {
   recordResumeBundle,
   getResumeBundleStatus
 };
-//# sourceMappingURL=chunk-QANCTXQF.js.map
+//# sourceMappingURL=chunk-AYPYCLR7.js.map

package/dist/{chunk-WWIQTB2Y.js → chunk-BKQJBXXX.js}

@@ -20,6 +20,7 @@ var ENTITY_PATTERNS = [
   { re: /\b(model|llm|qmd|embedding|retrieval|memory)\b/i, entityType: "ai" },
   { re: /\b(doc|readme|docs|changelog)\b/i, entityType: "docs" }
 ];
+var TASK_INITIATION_RE = /\b(ship(?:ping|ped)?|deploy(?:ing|ed)?|release|publish|open(?:ing)?\s+(?:a\s+)?(?:pr|pull\s+request)|merge(?:ing)?\s+(?:the\s+)?(?:pr|pull\s+request)|run\s+(?:the\s+)?tests?|start(?:ing)?\s+(?:work|on|the)|kick\s+off|implement(?:ing|ed)?|let's\s+|going\s+to\s+(?:ship|deploy|release|open|run|merge)|need\s+to\s+(?:ship|deploy|run|open|merge|test)|fix(?:ing|ed)?\s+(?:the\s+)?(?:bug|build)|patch(?:ing|ed)?|build(?:ing)?\s+(?:and\s+)?(?:ship|deploy))\b/i;
 function normalizeTextInput(input) {
   return typeof input === "string" ? input : "";
 }
@@ -30,12 +31,17 @@ function inferIntentFromText(text) {
   const entityTypes = Array.from(
     new Set(ENTITY_PATTERNS.filter((p) => p.re.test(safeText)).map((p) => p.entityType))
   );
+  const taskInitiation = TASK_INITIATION_RE.test(safeText);
   return {
     goal,
     actionType,
-    entityTypes
+    entityTypes,
+    taskInitiation
   };
 }
+function isTaskInitiationIntent(intent) {
+  return intent.taskInitiation === true;
+}
 function intentCompatibilityScore(queryIntent, memoryIntent) {
   const queryHasSignal = queryIntent.goal !== "unknown" || queryIntent.actionType !== "unknown" || queryIntent.entityTypes.length > 0;
   const memoryHasSignal = memoryIntent.goal !== "unknown" || memoryIntent.actionType !== "unknown" || memoryIntent.entityTypes.length > 0;
@@ -91,8 +97,9 @@ function hasBroadGraphIntent(prompt) {
 
 export {
   inferIntentFromText,
+  isTaskInitiationIntent,
   intentCompatibilityScore,
   planRecallMode,
   hasBroadGraphIntent
 };
-//# sourceMappingURL=chunk-WWIQTB2Y.js.map
+//# sourceMappingURL=chunk-BKQJBXXX.js.map

package/dist/chunk-BKQJBXXX.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/intent.ts"],"sourcesContent":["import type { MemoryIntent, RecallPlanMode } from \"./types.js\";\n\nconst GOAL_PATTERNS: Array<{ re: RegExp; goal: string }> = [\n  { re: /\\b(debug(?:s|ged|ging)?|fix(?:es|ed|ing)?|error(?:s)?|incident(?:s)?|outage(?:s)?|failure(?:s)?)\\b/i, goal: \"stabilize\" },\n  { re: /\\b(deploy(?:s|ed|ing)?|release(?:s|d|ing)?|ship(?:s|ped|ping)?|publish(?:es|ed|ing)?)\\b/i, goal: \"release\" },\n  { re: /\\b(plan(?:s|ned|ning)?|roadmap(?:s)?|strateg(?:y|ies)|design(?:s|ed|ing)?)\\b/i, goal: \"plan\" },\n  { re: /\\b(review(?:s|ed|ing)?|audit(?:s|ed|ing)?|security|hardening)\\b/i, goal: \"review\" },\n  { re: /\\b(sales|deal|customer|client|prospect)\\b/i, goal: \"close_deal\" },\n];\n\nconst ACTION_PATTERNS: Array<{ re: RegExp; action: string }> = [\n  { re: /\\b(review(?:s|ed|ing)?|audit(?:s|ed|ing)?|inspect(?:s|ed|ing)?|check(?:s|ed|ing)?)\\b/i, action: \"review\" },\n  { re: /\\b(plan(?:s|ned|ning)?|design(?:s|ed|ing)?|brainstorm(?:s|ed|ing)?|spec(?:s)?)\\b/i, action: \"plan\" },\n  { re: /\\b(implement(?:s|ed|ing)?|build(?:s|ing)?|built|code(?:s|d|ing)?|patch(?:es|ed|ing)?|fix(?:es|ed|ing)?)\\b/i, action: \"execute\" },\n  { re: /\\b(summariz(?:e|es|ed|ing)|recap(?:s|ped|ping)?|what happened|timeline)\\b/i, action: \"summarize\" },\n  { re: /\\b(decid(?:e|es|ed|ing)|decision(?:s)?|cho(?:ose|oses|osing)|chose|chosen)\\b/i, action: \"decide\" },\n];\n\nconst ENTITY_PATTERNS: Array<{ re: RegExp; entityType: string }> = [\n  { re: /\\b(pr|pull request|branch|repo|github|ci|workflow)\\b/i, entityType: \"repo\" },\n  { re: /\\b(discord|slack|channel|gateway|agent)\\b/i, entityType: \"ops\" },\n  { re: /\\b(customer|client|deal|lead|account)\\b/i, entityType: \"client\" },\n  { re: /\\b(model|llm|qmd|embedding|retrieval|memory)\\b/i, entityType: \"ai\" },\n  { re: /\\b(doc|readme|docs|changelog)\\b/i, entityType: \"docs\" },\n];\n\n/** User/agent is starting a hands-on task (issue #519 procedure recall gate). */\nconst TASK_INITIATION_RE =\n  /\\b(ship(?:ping|ped)?|deploy(?:ing|ed)?|release|publish|open(?:ing)?\\s+(?:a\\s+)?(?:pr|pull\\s+request)|merge(?:ing)?\\s+(?:the\\s+)?(?:pr|pull\\s+request)|run\\s+(?:the\\s+)?tests?|start(?:ing)?\\s+(?:work|on|the)|kick\\s+off|implement(?:ing|ed)?|let's\\s+|going\\s+to\\s+(?:ship|deploy|release|open|run|merge)|need\\s+to\\s+(?:ship|deploy|run|open|merge|test)|fix(?:ing|ed)?\\s+(?:the\\s+)?(?:bug|build)|patch(?:ing|ed)?|build(?:ing)?\\s+(?:and\\s+)?(?:ship|deploy))\\b/i;\n\nfunction normalizeTextInput(input: unknown): string {\n  return typeof input === \"string\" ? input : \"\";\n}\n\nexport function inferIntentFromText(text: string): MemoryIntent {\n  const safeText = normalizeTextInput(text);\n  const goal = GOAL_PATTERNS.find((p) => p.re.test(safeText))?.goal ?? \"unknown\";\n  const actionType = ACTION_PATTERNS.find((p) => p.re.test(safeText))?.action ?? \"unknown\";\n  const entityTypes = Array.from(\n    new Set(ENTITY_PATTERNS.filter((p) => p.re.test(safeText)).map((p) => p.entityType)),\n  );\n  const taskInitiation = TASK_INITIATION_RE.test(safeText);\n\n  return {\n    goal,\n    actionType,\n    entityTypes,\n    taskInitiation,\n  };\n}\n\nexport function isTaskInitiationIntent(intent: MemoryIntent): boolean {\n  return intent.taskInitiation === true;\n}\n\nexport function intentCompatibilityScore(queryIntent: MemoryIntent, memoryIntent: MemoryIntent): number {\n  const queryHasSignal =\n    queryIntent.goal !== \"unknown\" ||\n    queryIntent.actionType !== \"unknown\" ||\n    queryIntent.entityTypes.length > 0;\n  const memoryHasSignal =\n    memoryIntent.goal !== \"unknown\" ||\n    memoryIntent.actionType !== \"unknown\" ||\n    memoryIntent.entityTypes.length > 0;\n  if (!queryHasSignal || !memoryHasSignal) return 0;\n\n  let score = 0;\n  if (\n    queryIntent.goal !== \"unknown\" &&\n    memoryIntent.goal !== \"unknown\" &&\n    queryIntent.goal === memoryIntent.goal\n  ) {\n    score += 0.5;\n  }\n  if (\n    queryIntent.actionType !== \"unknown\" &&\n    memoryIntent.actionType !== \"unknown\" &&\n    queryIntent.actionType === memoryIntent.actionType\n  ) {\n    score += 0.3;\n  }\n\n  const overlap = queryIntent.entityTypes.filter((et) => memoryIntent.entityTypes.includes(et)).length;\n  if (overlap > 0) {\n    const denom = Math.max(queryIntent.entityTypes.length, memoryIntent.entityTypes.length, 1);\n    score += 0.2 * (overlap / denom);\n  }\n\n  return Math.max(0, Math.min(1, score));\n}\n\nexport function planRecallMode(prompt: string): RecallPlanMode {\n  const p = normalizeTextInput(prompt).trim();\n  let ackCandidate = p;\n  while (ackCandidate.length > 0) {\n    const ch = ackCandidate.charCodeAt(ackCandidate.length - 1);\n    const isDigit = ch >= 48 && ch <= 57;\n    const isUpper = ch >= 65 && ch <= 90;\n    const isLower = ch >= 97 && ch <= 122;\n    // Strip any trailing non-alphanumeric noise (punctuation/emojis/symbols).\n    if (isDigit || isUpper || isLower) break;\n    ackCandidate = ackCandidate.slice(0, -1);\n  }\n  ackCandidate = ackCandidate.trim();\n  if (p.length === 0) return \"no_recall\";\n\n  if (/\\b(timeline|sequence|history|what happened|chain of events|root cause)\\b/i.test(p)) {\n    return \"graph_mode\";\n  }\n\n  // Reserve no_recall for low-information acknowledgements; avoid broad regressions.\n  if (\n    p.length <= 18 &&\n    /^(ok|okay|kk|thanks|thx|got it|sounds good|yep|yes|nope|no|done|cool|works)$/i.test(ackCandidate)\n  ) {\n    return \"no_recall\";\n  }\n\n  // Full recall for prompts that are explicitly memory-seeking or analytical questions.\n  if (\n    /\\b(previous|earlier|remember|last time|did we|what did we decide|context|summarize|summary|recap|key points|decision)\\b/i.test(p) ||\n    /\\?$/.test(p) ||\n    /^(what|why|how|when|where|who|which)\\b/i.test(p.toLowerCase())\n  ) {\n    return \"full\";\n  }\n\n  // Minimal for short, non-question operational directives to keep latency/tokens down.\n  if (\n    p.length <= 100 &&\n    /^(check|reload|restart|run|verify|show|status|sync|update|open|close|set|enable|disable|fix|patch)\\b/i.test(p)\n  ) {\n    return \"minimal\";\n  }\n\n  return \"full\";\n}\n\nexport function hasBroadGraphIntent(prompt: string): boolean {\n  const p = normalizeTextInput(prompt).trim().toLowerCase();\n  if (!p) return false;\n  return /\\b(what changed|how did we get here|why did this happen|what led to|cause chain|dependency chain|regression chain|failure chain)\\b/i.test(\n    p,\n  );\n}\n"],"mappings":";AAEA,IAAM,gBAAqD;AAAA,EACzD,EAAE,IAAI,uGAAuG,MAAM,YAAY;AAAA,EAC/H,EAAE,IAAI,4FAA4F,MAAM,UAAU;AAAA,EAClH,EAAE,IAAI,iFAAiF,MAAM,OAAO;AAAA,EACpG,EAAE,IAAI,oEAAoE,MAAM,SAAS;AAAA,EACzF,EAAE,IAAI,8CAA8C,MAAM,aAAa;AACzE;AAEA,IAAM,kBAAyD;AAAA,EAC7D,EAAE,IAAI,yFAAyF,QAAQ,SAAS;AAAA,EAChH,EAAE,IAAI,qFAAqF,QAAQ,OAAO;AAAA,EAC1G,EAAE,IAAI,8GAA8G,QAAQ,UAAU;AAAA,EACtI,EAAE,IAAI,8EAA8E,QAAQ,YAAY;AAAA,EACxG,EAAE,IAAI,iFAAiF,QAAQ,SAAS;AAC1G;AAEA,IAAM,kBAA6D;AAAA,EACjE,EAAE,IAAI,yDAAyD,YAAY,OAAO;AAAA,EAClF,EAAE,IAAI,8CAA8C,YAAY,MAAM;AAAA,EACtE,EAAE,IAAI,4CAA4C,YAAY,SAAS;AAAA,EACvE,EAAE,IAAI,mDAAmD,YAAY,KAAK;AAAA,EAC1E,EAAE,IAAI,oCAAoC,YAAY,OAAO;AAC/D;AAGA,IAAM,qBACJ;AAEF,SAAS,mBAAmB,OAAwB;AAClD,SAAO,OAAO,UAAU,WAAW,QAAQ;AAC7C;AAEO,SAAS,oBAAoB,MAA4B;AAC9D,QAAM,WAAW,mBAAmB,IAAI;AACxC,QAAM,OAAO,cAAc,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,QAAQ,CAAC,GAAG,QAAQ;AACrE,QAAM,aAAa,gBAAgB,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,QAAQ,CAAC,GAAG,UAAU;AAC/E,QAAM,cAAc,MAAM;AAAA,IACxB,IAAI,IAAI,gBAAgB,OAAO,CAAC,MAAM,EAAE,GAAG,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC;AAAA,EACrF;AACA,QAAM,iBAAiB,mBAAmB,KAAK,QAAQ;AAEvD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAAS,uBAAuB,QAA+B;AACpE,SAAO,OAAO,mBAAmB;AACnC;AAEO,SAAS,yBAAyB,aAA2B,cAAoC;AACtG,QAAM,iBACJ,YAAY,SAAS,aACrB,YAAY,eAAe,aAC3B,YAAY,YAAY,SAAS;AACnC,QAAM,kBACJ,aAAa,SAAS,aACtB,aAAa,eAAe,aAC5B,aAAa,YAAY,SAAS;AACpC,MAAI,CAAC,kBAAkB,CAAC,gBAAiB,QAAO;AAEhD,MAAI,QAAQ;AACZ,MACE,YAAY,SAAS,aACrB,aAAa,SAAS,aACtB,YAAY,SAAS,aAAa,MAClC;AACA,aAAS;AAAA,EACX;AACA,MACE,YAAY,eAAe,aAC3B,aAAa,eAAe,aAC5B,YAAY,eAAe,aAAa,YACxC;AACA,aAAS;AAAA,EACX;AAEA,QAAM,UAAU,YAAY,YAAY,OAAO,CAAC,OAAO,aAAa,YAAY,SAAS,EAAE,CAAC,EAAE;AAC9F,MAAI,UAAU,GAAG;AACf,UAAM,QAAQ,KAAK,IAAI,YAAY,YAAY,QAAQ,aAAa,YAAY,QAAQ,CAAC;AACzF,aAAS,OAAO,UAAU;AAAA,EAC5B;AAEA,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAEO,SAAS,eAAe,QAAgC;AAC7D,QAAM,IAAI,mBAAmB,MAAM,EAAE,KAAK;AAC1C,MAAI,eAAe;AACnB,SAAO,aAAa,SAAS,GAAG;AAC9B,UAAM,KAAK,aAAa,WAAW,aAAa,SAAS,CAAC;AAC1D,UAAM,UAAU,MAAM,MAAM,MAAM;AAClC,UAAM,UAAU,MAAM,MAAM,MAAM;AAClC,UAAM,UAAU,MAAM,MAAM,MAAM;AAElC,QAAI,WAAW,WAAW,QAAS;AACnC,mBAAe,aAAa,MAAM,GAAG,EAAE;AAAA,EACzC;AACA,iBAAe,aAAa,KAAK;AACjC,MAAI,EAAE,WAAW,EAAG,QAAO;AAE3B,MAAI,4EAA4E,KAAK,CAAC,GAAG;AACvF,WAAO;AAAA,EACT;AAGA,MACE,EAAE,UAAU,MACZ,gFAAgF,KAAK,YAAY,GACjG;AACA,WAAO;AAAA,EACT;AAGA,MACE,2HAA2H,KAAK,CAAC,KACjI,MAAM,KAAK,CAAC,KACZ,0CAA0C,KAAK,EAAE,YAAY,CAAC,GAC9D;AACA,WAAO;AAAA,EACT;AAGA,MACE,EAAE,UAAU,OACZ,wGAAwG,KAAK,CAAC,GAC9G;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,oBAAoB,QAAyB;AAC3D,QAAM,IAAI,mBAAmB,MAAM,EAAE,KAAK,EAAE,YAAY;AACxD,MAAI,CAAC,EAAG,QAAO;AACf,SAAO,sIAAsI;AAAA,IAC3I;AAAA,EACF;AACF;","names":[]}

package/dist/{chunk-LP47L3ZX.js → chunk-BTY5RRRF.js}

@@ -3,21 +3,21 @@ import {
   upsertSummarySnapshot,
   writeSummarySnapshot
 } from "./chunk-ETOW6ACV.js";
-import {
-  ModelRegistry
-} from "./chunk-ONRU4L2N.js";
 import {
   LocalLlmClient
-} from "./chunk-MDDAA2AO.js";
+} from "./chunk-UPMD5XND.js";
+import {
+  ModelRegistry
+} from "./chunk-FEMOX5AD.js";
 import {
   FallbackLlmClient
-} from "./chunk-XUHI52HK.js";
+} from "./chunk-QKAH5B6E.js";
 import {
   extractJsonCandidates
 } from "./chunk-UZB5KHKX.js";
 import {
   log
-} from "./chunk-KWBU5S5U.js";
+} from "./chunk-2ODBA7MQ.js";
 
 // src/summarizer.ts
 import { mkdir, readFile, writeFile, readdir } from "fs/promises";
@@ -618,4 +618,4 @@ ${truncatedConversation}`;
 export {
   HourlySummarizer
 };
-//# sourceMappingURL=chunk-LP47L3ZX.js.map
+//# sourceMappingURL=chunk-BTY5RRRF.js.map

package/dist/{chunk-SCHEKPYH.js → chunk-C2EFFULQ.js}

@@ -346,4 +346,4 @@ export {
   GraphIndex,
   applyLateralInhibition
 };
-//# sourceMappingURL=chunk-SCHEKPYH.js.map
+//# sourceMappingURL=chunk-C2EFFULQ.js.map

package/dist/{chunk-GJR6D6KC.js → chunk-D654IBA6.js}

@@ -1,6 +1,6 @@
 import {
   log
-} from "./chunk-KWBU5S5U.js";
+} from "./chunk-2ODBA7MQ.js";
 
 // src/negative.ts
 import { mkdir, readFile, writeFile } from "fs/promises";
@@ -58,4 +58,4 @@ var NegativeExampleStore = class {
 export {
   NegativeExampleStore
 };
-//# sourceMappingURL=chunk-GJR6D6KC.js.map
+//# sourceMappingURL=chunk-D654IBA6.js.map

package/dist/{chunk-UV2FO7J4.js → chunk-E6K4NIEU.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-YRMVARQP.js";
 import {
   log
-} from "./chunk-KWBU5S5U.js";
+} from "./chunk-2ODBA7MQ.js";
 
 // src/transcript.ts
 import { appendFile, mkdir, readdir, readFile, stat, unlink, writeFile } from "fs/promises";
@@ -744,4 +744,4 @@ var TranscriptManager = class _TranscriptManager {
 export {
   TranscriptManager
 };
-//# sourceMappingURL=chunk-UV2FO7J4.js.map
+//# sourceMappingURL=chunk-E6K4NIEU.js.map

package/dist/{chunk-T4WRIV2C.js → chunk-EABGC2TL.js}

@@ -4,7 +4,7 @@ import {
 import {
   clamp01,
   clampLifecycleThreshold
-} from "./chunk-QCCCQT3O.js";
+} from "./chunk-TBBDFYXW.js";
 
 // src/policy-runtime.ts
 import path from "path";
@@ -167,4 +167,4 @@ export {
   readRuntimePolicySnapshot,
   PolicyRuntimeManager
 };
-//# sourceMappingURL=chunk-T4WRIV2C.js.map
+//# sourceMappingURL=chunk-EABGC2TL.js.map