@tekmidian/pai 0.15.0 → 0.17.0

package/dist/{detector-ZiOhHszd.mjs.map → detector-Bwzm3E_x.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"detector-ZiOhHszd.mjs","names":[],"sources":["../src/topics/detector.ts"],"sourcesContent":["/**\n * Topic shift detection engine.\n *\n * Accepts a context summary (recent conversation text) and determines whether\n * the conversation has drifted away from the currently-routed project.\n *\n * Algorithm:\n *   1. Run keyword memory_search against the context text (no project filter)\n *   2. Score results by project — sum of BM25 scores per project\n *   3. Compare the top-scoring project against the current project\n *   4. If a different project dominates by more than the confidence threshold,\n *      report a topic shift.\n *\n * Design decisions:\n *   - Keyword search only (no semantic) — fast, no embedding requirement\n *   - Works with or without an active daemon (direct DB access path)\n *   - Stateless: callers supply currentProject; detector has no session memory\n *   - Minimal: returns a plain result object, not MCP content arrays\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport type { StorageBackend } from \"../storage/interface.js\";\nimport { searchMemory, populateSlugs } from \"../memory/search.js\";\nimport type { SearchResult } from \"../memory/search.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface TopicCheckParams {\n  /** Recent conversation context (a few sentences or tool call summaries) */\n  context: string;\n  /** The project slug the session is currently routed to. May be null/empty. */\n  currentProject?: string;\n  /**\n   * Minimum confidence [0,1] to declare a shift. Default: 0.6.\n   * Higher = less sensitive, fewer false positives.\n   */\n  threshold?: number;\n  /**\n   * Maximum results to draw from memory search (candidates). Default: 20.\n   * More candidates = more accurate scoring, slightly slower.\n   */\n  candidates?: number;\n}\n\nexport interface TopicCheckResult {\n  /** Whether a significant topic shift was detected. */\n  shifted: boolean;\n  /** The project slug the session is currently routed to (echoed from input). */\n  currentProject: string | null;\n  /** The project slug that best matches the context, or null if no clear match. */\n  suggestedProject: string | null;\n  /**\n   * Confidence score for the suggested project [0,1].\n   * Represents the fraction of total score mass held by the top project.\n   * 1.0 = all matching chunks belong to one project.\n   * 0.5 = two projects are equally matched.\n   */\n  confidence: number;\n  /** Number of memory chunks that contributed to scoring. */\n  chunkCount: number;\n  /** Top-3 scoring projects with their normalised scores (for debugging). */\n  topProjects: Array<{ slug: string; score: number }>;\n}\n\n// ---------------------------------------------------------------------------\n// Core algorithm\n// ---------------------------------------------------------------------------\n\n/**\n * Detect whether the provided context text best matches a different project\n * than the session's current routing.\n *\n * Works with either a raw SQLite Database or a StorageBackend.\n * For the StorageBackend path, keyword search is used.\n * For the raw Database path (legacy/direct), searchMemory() is called.\n */\nexport async function detectTopicShift(\n  registryDb: Database,\n  federation: Database | StorageBackend,\n  params: TopicCheckParams\n): Promise<TopicCheckResult> {\n  const threshold = params.threshold ?? 0.6;\n  const candidates = params.candidates ?? 20;\n  const currentProject = params.currentProject?.trim() || null;\n\n  if (!params.context || params.context.trim().length === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: 0,\n      topProjects: [],\n    };\n  }\n\n  // -------------------------------------------------------------------------\n  // Run memory search across ALL projects (no project filter)\n  // -------------------------------------------------------------------------\n\n  let results: SearchResult[];\n\n  const isBackend = (x: Database | StorageBackend): x is StorageBackend =>\n    \"backendType\" in x;\n\n  if (isBackend(federation)) {\n    results = await federation.searchKeyword(params.context, {\n      maxResults: candidates,\n    });\n  } else {\n    results = searchMemory(federation, params.context, {\n      maxResults: candidates,\n    });\n  }\n\n  if (results.length === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: 0,\n      topProjects: [],\n    };\n  }\n\n  // Populate project slugs from the registry\n  const withSlugs = populateSlugs(results, registryDb);\n\n  // -------------------------------------------------------------------------\n  // Score projects by summing BM25 scores of matching chunks\n  // -------------------------------------------------------------------------\n\n  const projectScores = new Map<string, number>();\n\n  for (const r of withSlugs) {\n    const slug = r.projectSlug;\n    if (!slug) continue;\n    projectScores.set(slug, (projectScores.get(slug) ?? 0) + r.score);\n  }\n\n  if (projectScores.size === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: withSlugs.length,\n      topProjects: [],\n    };\n  }\n\n  // Sort by total score descending\n  const ranked = Array.from(projectScores.entries())\n    .sort((a, b) => b[1] - a[1]);\n\n  const totalScore = ranked.reduce((sum, [, s]) => sum + s, 0);\n\n  // Top-3 for reporting (normalised to [0,1] fraction of total mass)\n  const topProjects = ranked.slice(0, 3).map(([slug, score]) => ({\n    slug,\n    score: totalScore > 0 ? score / totalScore : 0,\n  }));\n\n  const topSlug = ranked[0][0];\n  const topRawScore = ranked[0][1];\n  const confidence = totalScore > 0 ? topRawScore / totalScore : 0;\n\n  // -------------------------------------------------------------------------\n  // Determine if a shift occurred\n  // -------------------------------------------------------------------------\n\n  // A shift is detected when:\n  //   1. confidence >= threshold (the top project dominates)\n  //   2. The top project is different from currentProject\n  //   3. There is a currentProject to compare against\n  //      (if no current project, we still return the best match but no \"shift\")\n\n  const isDifferent =\n    currentProject !== null &&\n    topSlug !== currentProject;\n\n  const shifted = isDifferent && confidence >= threshold;\n\n  return {\n    shifted,\n    currentProject,\n    suggestedProject: topSlug,\n    confidence,\n    chunkCount: withSlugs.length,\n    topProjects,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;AA8EA,eAAsB,iBACpB,YACA,YACA,QAC2B;CAC3B,MAAM,YAAY,OAAO,aAAa;CACtC,MAAM,aAAa,OAAO,cAAc;CACxC,MAAM,iBAAiB,OAAO,gBAAgB,MAAM,IAAI;AAExD,KAAI,CAAC,OAAO,WAAW,OAAO,QAAQ,MAAM,CAAC,WAAW,EACtD,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY;EACZ,aAAa,EAAE;EAChB;CAOH,IAAI;CAEJ,MAAM,aAAa,MACjB,iBAAiB;AAEnB,KAAI,UAAU,WAAW,CACvB,WAAU,MAAM,WAAW,cAAc,OAAO,SAAS,EACvD,YAAY,YACb,CAAC;KAEF,WAAU,aAAa,YAAY,OAAO,SAAS,EACjD,YAAY,YACb,CAAC;AAGJ,KAAI,QAAQ,WAAW,EACrB,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY;EACZ,aAAa,EAAE;EAChB;CAIH,MAAM,YAAY,cAAc,SAAS,WAAW;CAMpD,MAAM,gCAAgB,IAAI,KAAqB;AAE/C,MAAK,MAAM,KAAK,WAAW;EACzB,MAAM,OAAO,EAAE;AACf,MAAI,CAAC,KAAM;AACX,gBAAc,IAAI,OAAO,cAAc,IAAI,KAAK,IAAI,KAAK,EAAE,MAAM;;AAGnE,KAAI,cAAc,SAAS,EACzB,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY,UAAU;EACtB,aAAa,EAAE;EAChB;CAIH,MAAM,SAAS,MAAM,KAAK,cAAc,SAAS,CAAC,CAC/C,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG;CAE9B,MAAM,aAAa,OAAO,QAAQ,KAAK,GAAG,OAAO,MAAM,GAAG,EAAE;CAG5D,MAAM,cAAc,OAAO,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,YAAY;EAC7D;EACA,OAAO,aAAa,IAAI,QAAQ,aAAa;EAC9C,EAAE;CAEH,MAAM,UAAU,OAAO,GAAG;CAC1B,MAAM,cAAc,OAAO,GAAG;CAC9B,MAAM,aAAa,aAAa,IAAI,cAAc,aAAa;AAkB/D,QAAO;EACL,SANA,mBAAmB,QACnB,YAAY,kBAEiB,cAAc;EAI3C;EACA,kBAAkB;EAClB;EACA,YAAY,UAAU;EACtB;EACD"}
+{"version":3,"file":"detector-Bwzm3E_x.mjs","names":[],"sources":["../src/topics/detector.ts"],"sourcesContent":["/**\n * Topic shift detection engine.\n *\n * Accepts a context summary (recent conversation text) and determines whether\n * the conversation has drifted away from the currently-routed project.\n *\n * Algorithm:\n *   1. Run keyword memory_search against the context text (no project filter)\n *   2. Score results by project — sum of BM25 scores per project\n *   3. Compare the top-scoring project against the current project\n *   4. If a different project dominates by more than the confidence threshold,\n *      report a topic shift.\n *\n * Design decisions:\n *   - Keyword search only (no semantic) — fast, no embedding requirement\n *   - Works with or without an active daemon (direct DB access path)\n *   - Stateless: callers supply currentProject; detector has no session memory\n *   - Minimal: returns a plain result object, not MCP content arrays\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport type { StorageBackend } from \"../storage/interface.js\";\nimport { searchMemory, populateSlugs } from \"../memory/search.js\";\nimport type { SearchResult } from \"../memory/search.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface TopicCheckParams {\n  /** Recent conversation context (a few sentences or tool call summaries) */\n  context: string;\n  /** The project slug the session is currently routed to. May be null/empty. */\n  currentProject?: string;\n  /**\n   * Minimum confidence [0,1] to declare a shift. Default: 0.6.\n   * Higher = less sensitive, fewer false positives.\n   */\n  threshold?: number;\n  /**\n   * Maximum results to draw from memory search (candidates). Default: 20.\n   * More candidates = more accurate scoring, slightly slower.\n   */\n  candidates?: number;\n}\n\nexport interface TopicCheckResult {\n  /** Whether a significant topic shift was detected. */\n  shifted: boolean;\n  /** The project slug the session is currently routed to (echoed from input). */\n  currentProject: string | null;\n  /** The project slug that best matches the context, or null if no clear match. */\n  suggestedProject: string | null;\n  /**\n   * Confidence score for the suggested project [0,1].\n   * Represents the fraction of total score mass held by the top project.\n   * 1.0 = all matching chunks belong to one project.\n   * 0.5 = two projects are equally matched.\n   */\n  confidence: number;\n  /** Number of memory chunks that contributed to scoring. */\n  chunkCount: number;\n  /** Top-3 scoring projects with their normalised scores (for debugging). */\n  topProjects: Array<{ slug: string; score: number }>;\n}\n\n// ---------------------------------------------------------------------------\n// Core algorithm\n// ---------------------------------------------------------------------------\n\n/**\n * Detect whether the provided context text best matches a different project\n * than the session's current routing.\n *\n * Works with either a raw SQLite Database or a StorageBackend.\n * For the StorageBackend path, keyword search is used.\n * For the raw Database path (legacy/direct), searchMemory() is called.\n */\nexport async function detectTopicShift(\n  registryDb: Database,\n  federation: Database | StorageBackend,\n  params: TopicCheckParams\n): Promise<TopicCheckResult> {\n  const threshold = params.threshold ?? 0.6;\n  const candidates = params.candidates ?? 20;\n  const currentProject = params.currentProject?.trim() || null;\n\n  if (!params.context || params.context.trim().length === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: 0,\n      topProjects: [],\n    };\n  }\n\n  // -------------------------------------------------------------------------\n  // Run memory search across ALL projects (no project filter)\n  // -------------------------------------------------------------------------\n\n  let results: SearchResult[];\n\n  const isBackend = (x: Database | StorageBackend): x is StorageBackend =>\n    \"backendType\" in x;\n\n  if (isBackend(federation)) {\n    results = await federation.searchKeyword(params.context, {\n      maxResults: candidates,\n    });\n  } else {\n    results = searchMemory(federation, params.context, {\n      maxResults: candidates,\n    });\n  }\n\n  if (results.length === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: 0,\n      topProjects: [],\n    };\n  }\n\n  // Populate project slugs from the registry\n  const withSlugs = populateSlugs(results, registryDb);\n\n  // -------------------------------------------------------------------------\n  // Score projects by summing BM25 scores of matching chunks\n  // -------------------------------------------------------------------------\n\n  const projectScores = new Map<string, number>();\n\n  for (const r of withSlugs) {\n    const slug = r.projectSlug;\n    if (!slug) continue;\n    projectScores.set(slug, (projectScores.get(slug) ?? 0) + r.score);\n  }\n\n  if (projectScores.size === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: withSlugs.length,\n      topProjects: [],\n    };\n  }\n\n  // Sort by total score descending\n  const ranked = Array.from(projectScores.entries())\n    .sort((a, b) => b[1] - a[1]);\n\n  const totalScore = ranked.reduce((sum, [, s]) => sum + s, 0);\n\n  // Top-3 for reporting (normalised to [0,1] fraction of total mass)\n  const topProjects = ranked.slice(0, 3).map(([slug, score]) => ({\n    slug,\n    score: totalScore > 0 ? score / totalScore : 0,\n  }));\n\n  const topSlug = ranked[0][0];\n  const topRawScore = ranked[0][1];\n  const confidence = totalScore > 0 ? topRawScore / totalScore : 0;\n\n  // -------------------------------------------------------------------------\n  // Determine if a shift occurred\n  // -------------------------------------------------------------------------\n\n  // A shift is detected when:\n  //   1. confidence >= threshold (the top project dominates)\n  //   2. The top project is different from currentProject\n  //   3. There is a currentProject to compare against\n  //      (if no current project, we still return the best match but no \"shift\")\n\n  const isDifferent =\n    currentProject !== null &&\n    topSlug !== currentProject;\n\n  const shifted = isDifferent && confidence >= threshold;\n\n  return {\n    shifted,\n    currentProject,\n    suggestedProject: topSlug,\n    confidence,\n    chunkCount: withSlugs.length,\n    topProjects,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;AA8EA,eAAsB,iBACpB,YACA,YACA,QAC2B;CAC3B,MAAM,YAAY,OAAO,aAAa;CACtC,MAAM,aAAa,OAAO,cAAc;CACxC,MAAM,iBAAiB,OAAO,gBAAgB,MAAM,IAAI;AAExD,KAAI,CAAC,OAAO,WAAW,OAAO,QAAQ,MAAM,CAAC,WAAW,EACtD,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY;EACZ,aAAa,EAAE;EAChB;CAOH,IAAI;CAEJ,MAAM,aAAa,MACjB,iBAAiB;AAEnB,KAAI,UAAU,WAAW,CACvB,WAAU,MAAM,WAAW,cAAc,OAAO,SAAS,EACvD,YAAY,YACb,CAAC;KAEF,WAAU,aAAa,YAAY,OAAO,SAAS,EACjD,YAAY,YACb,CAAC;AAGJ,KAAI,QAAQ,WAAW,EACrB,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY;EACZ,aAAa,EAAE;EAChB;CAIH,MAAM,YAAY,cAAc,SAAS,WAAW;CAMpD,MAAM,gCAAgB,IAAI,KAAqB;AAE/C,MAAK,MAAM,KAAK,WAAW;EACzB,MAAM,OAAO,EAAE;AACf,MAAI,CAAC,KAAM;AACX,gBAAc,IAAI,OAAO,cAAc,IAAI,KAAK,IAAI,KAAK,EAAE,MAAM;;AAGnE,KAAI,cAAc,SAAS,EACzB,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY,UAAU;EACtB,aAAa,EAAE;EAChB;CAIH,MAAM,SAAS,MAAM,KAAK,cAAc,SAAS,CAAC,CAC/C,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG;CAE9B,MAAM,aAAa,OAAO,QAAQ,KAAK,GAAG,OAAO,MAAM,GAAG,EAAE;CAG5D,MAAM,cAAc,OAAO,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,YAAY;EAC7D;EACA,OAAO,aAAa,IAAI,QAAQ,aAAa;EAC9C,EAAE;CAEH,MAAM,UAAU,OAAO,GAAG;CAC1B,MAAM,cAAc,OAAO,GAAG;CAC9B,MAAM,aAAa,aAAa,IAAI,cAAc,aAAa;AAkB/D,QAAO;EACL,SANA,mBAAmB,QACnB,YAAY,kBAEiB,cAAc;EAI3C;EACA,kBAAkB;EAClB;EACA,YAAY,UAAU;EACtB;EACD"}

package/dist/detector-rq9JGTmS.mjs

@@ -0,0 +1,74 @@
+import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
+import { n as populateSlugs, r as searchMemory } from "./search-i2nlQ-JM.mjs";
+
+//#region src/topics/detector.ts
+var detector_exports = /* @__PURE__ */ __exportAll({ detectTopicShift: () => detectTopicShift });
+/**
+* Detect whether the provided context text best matches a different project
+* than the session's current routing.
+*
+* Works with either a raw SQLite Database or a StorageBackend.
+* For the StorageBackend path, keyword search is used.
+* For the raw Database path (legacy/direct), searchMemory() is called.
+*/
+async function detectTopicShift(registryDb, federation, params) {
+	const threshold = params.threshold ?? .6;
+	const candidates = params.candidates ?? 20;
+	const currentProject = params.currentProject?.trim() || null;
+	if (!params.context || params.context.trim().length === 0) return {
+		shifted: false,
+		currentProject,
+		suggestedProject: null,
+		confidence: 0,
+		chunkCount: 0,
+		topProjects: []
+	};
+	let results;
+	const isBackend = (x) => "backendType" in x;
+	if (isBackend(federation)) results = await federation.searchKeyword(params.context, { maxResults: candidates });
+	else results = searchMemory(federation, params.context, { maxResults: candidates });
+	if (results.length === 0) return {
+		shifted: false,
+		currentProject,
+		suggestedProject: null,
+		confidence: 0,
+		chunkCount: 0,
+		topProjects: []
+	};
+	const withSlugs = populateSlugs(results, registryDb);
+	const projectScores = /* @__PURE__ */ new Map();
+	for (const r of withSlugs) {
+		const slug = r.projectSlug;
+		if (!slug) continue;
+		projectScores.set(slug, (projectScores.get(slug) ?? 0) + r.score);
+	}
+	if (projectScores.size === 0) return {
+		shifted: false,
+		currentProject,
+		suggestedProject: null,
+		confidence: 0,
+		chunkCount: withSlugs.length,
+		topProjects: []
+	};
+	const ranked = Array.from(projectScores.entries()).sort((a, b) => b[1] - a[1]);
+	const totalScore = ranked.reduce((sum, [, s]) => sum + s, 0);
+	const topProjects = ranked.slice(0, 3).map(([slug, score]) => ({
+		slug,
+		score: totalScore > 0 ? score / totalScore : 0
+	}));
+	const topSlug = ranked[0][0];
+	const topRawScore = ranked[0][1];
+	const confidence = totalScore > 0 ? topRawScore / totalScore : 0;
+	return {
+		shifted: currentProject !== null && topSlug !== currentProject && confidence >= threshold,
+		currentProject,
+		suggestedProject: topSlug,
+		confidence,
+		chunkCount: withSlugs.length,
+		topProjects
+	};
+}
+
+//#endregion
+export { detector_exports as n, detectTopicShift as t };
+//# sourceMappingURL=detector-rq9JGTmS.mjs.map

package/dist/detector-rq9JGTmS.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"detector-rq9JGTmS.mjs","names":[],"sources":["../src/topics/detector.ts"],"sourcesContent":["/**\n * Topic shift detection engine.\n *\n * Accepts a context summary (recent conversation text) and determines whether\n * the conversation has drifted away from the currently-routed project.\n *\n * Algorithm:\n *   1. Run keyword memory_search against the context text (no project filter)\n *   2. Score results by project — sum of BM25 scores per project\n *   3. Compare the top-scoring project against the current project\n *   4. If a different project dominates by more than the confidence threshold,\n *      report a topic shift.\n *\n * Design decisions:\n *   - Keyword search only (no semantic) — fast, no embedding requirement\n *   - Works with or without an active daemon (direct DB access path)\n *   - Stateless: callers supply currentProject; detector has no session memory\n *   - Minimal: returns a plain result object, not MCP content arrays\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport type { StorageBackend } from \"../storage/interface.js\";\nimport { searchMemory, populateSlugs } from \"../memory/search.js\";\nimport type { SearchResult } from \"../memory/search.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface TopicCheckParams {\n  /** Recent conversation context (a few sentences or tool call summaries) */\n  context: string;\n  /** The project slug the session is currently routed to. May be null/empty. */\n  currentProject?: string;\n  /**\n   * Minimum confidence [0,1] to declare a shift. Default: 0.6.\n   * Higher = less sensitive, fewer false positives.\n   */\n  threshold?: number;\n  /**\n   * Maximum results to draw from memory search (candidates). Default: 20.\n   * More candidates = more accurate scoring, slightly slower.\n   */\n  candidates?: number;\n}\n\nexport interface TopicCheckResult {\n  /** Whether a significant topic shift was detected. */\n  shifted: boolean;\n  /** The project slug the session is currently routed to (echoed from input). */\n  currentProject: string | null;\n  /** The project slug that best matches the context, or null if no clear match. */\n  suggestedProject: string | null;\n  /**\n   * Confidence score for the suggested project [0,1].\n   * Represents the fraction of total score mass held by the top project.\n   * 1.0 = all matching chunks belong to one project.\n   * 0.5 = two projects are equally matched.\n   */\n  confidence: number;\n  /** Number of memory chunks that contributed to scoring. */\n  chunkCount: number;\n  /** Top-3 scoring projects with their normalised scores (for debugging). */\n  topProjects: Array<{ slug: string; score: number }>;\n}\n\n// ---------------------------------------------------------------------------\n// Core algorithm\n// ---------------------------------------------------------------------------\n\n/**\n * Detect whether the provided context text best matches a different project\n * than the session's current routing.\n *\n * Works with either a raw SQLite Database or a StorageBackend.\n * For the StorageBackend path, keyword search is used.\n * For the raw Database path (legacy/direct), searchMemory() is called.\n */\nexport async function detectTopicShift(\n  registryDb: Database,\n  federation: Database | StorageBackend,\n  params: TopicCheckParams\n): Promise<TopicCheckResult> {\n  const threshold = params.threshold ?? 0.6;\n  const candidates = params.candidates ?? 20;\n  const currentProject = params.currentProject?.trim() || null;\n\n  if (!params.context || params.context.trim().length === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: 0,\n      topProjects: [],\n    };\n  }\n\n  // -------------------------------------------------------------------------\n  // Run memory search across ALL projects (no project filter)\n  // -------------------------------------------------------------------------\n\n  let results: SearchResult[];\n\n  const isBackend = (x: Database | StorageBackend): x is StorageBackend =>\n    \"backendType\" in x;\n\n  if (isBackend(federation)) {\n    results = await federation.searchKeyword(params.context, {\n      maxResults: candidates,\n    });\n  } else {\n    results = searchMemory(federation, params.context, {\n      maxResults: candidates,\n    });\n  }\n\n  if (results.length === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: 0,\n      topProjects: [],\n    };\n  }\n\n  // Populate project slugs from the registry\n  const withSlugs = populateSlugs(results, registryDb);\n\n  // -------------------------------------------------------------------------\n  // Score projects by summing BM25 scores of matching chunks\n  // -------------------------------------------------------------------------\n\n  const projectScores = new Map<string, number>();\n\n  for (const r of withSlugs) {\n    const slug = r.projectSlug;\n    if (!slug) continue;\n    projectScores.set(slug, (projectScores.get(slug) ?? 0) + r.score);\n  }\n\n  if (projectScores.size === 0) {\n    return {\n      shifted: false,\n      currentProject,\n      suggestedProject: null,\n      confidence: 0,\n      chunkCount: withSlugs.length,\n      topProjects: [],\n    };\n  }\n\n  // Sort by total score descending\n  const ranked = Array.from(projectScores.entries())\n    .sort((a, b) => b[1] - a[1]);\n\n  const totalScore = ranked.reduce((sum, [, s]) => sum + s, 0);\n\n  // Top-3 for reporting (normalised to [0,1] fraction of total mass)\n  const topProjects = ranked.slice(0, 3).map(([slug, score]) => ({\n    slug,\n    score: totalScore > 0 ? score / totalScore : 0,\n  }));\n\n  const topSlug = ranked[0][0];\n  const topRawScore = ranked[0][1];\n  const confidence = totalScore > 0 ? topRawScore / totalScore : 0;\n\n  // -------------------------------------------------------------------------\n  // Determine if a shift occurred\n  // -------------------------------------------------------------------------\n\n  // A shift is detected when:\n  //   1. confidence >= threshold (the top project dominates)\n  //   2. The top project is different from currentProject\n  //   3. There is a currentProject to compare against\n  //      (if no current project, we still return the best match but no \"shift\")\n\n  const isDifferent =\n    currentProject !== null &&\n    topSlug !== currentProject;\n\n  const shifted = isDifferent && confidence >= threshold;\n\n  return {\n    shifted,\n    currentProject,\n    suggestedProject: topSlug,\n    confidence,\n    chunkCount: withSlugs.length,\n    topProjects,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;AA8EA,eAAsB,iBACpB,YACA,YACA,QAC2B;CAC3B,MAAM,YAAY,OAAO,aAAa;CACtC,MAAM,aAAa,OAAO,cAAc;CACxC,MAAM,iBAAiB,OAAO,gBAAgB,MAAM,IAAI;AAExD,KAAI,CAAC,OAAO,WAAW,OAAO,QAAQ,MAAM,CAAC,WAAW,EACtD,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY;EACZ,aAAa,EAAE;EAChB;CAOH,IAAI;CAEJ,MAAM,aAAa,MACjB,iBAAiB;AAEnB,KAAI,UAAU,WAAW,CACvB,WAAU,MAAM,WAAW,cAAc,OAAO,SAAS,EACvD,YAAY,YACb,CAAC;KAEF,WAAU,aAAa,YAAY,OAAO,SAAS,EACjD,YAAY,YACb,CAAC;AAGJ,KAAI,QAAQ,WAAW,EACrB,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY;EACZ,aAAa,EAAE;EAChB;CAIH,MAAM,YAAY,cAAc,SAAS,WAAW;CAMpD,MAAM,gCAAgB,IAAI,KAAqB;AAE/C,MAAK,MAAM,KAAK,WAAW;EACzB,MAAM,OAAO,EAAE;AACf,MAAI,CAAC,KAAM;AACX,gBAAc,IAAI,OAAO,cAAc,IAAI,KAAK,IAAI,KAAK,EAAE,MAAM;;AAGnE,KAAI,cAAc,SAAS,EACzB,QAAO;EACL,SAAS;EACT;EACA,kBAAkB;EAClB,YAAY;EACZ,YAAY,UAAU;EACtB,aAAa,EAAE;EAChB;CAIH,MAAM,SAAS,MAAM,KAAK,cAAc,SAAS,CAAC,CAC/C,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG;CAE9B,MAAM,aAAa,OAAO,QAAQ,KAAK,GAAG,OAAO,MAAM,GAAG,EAAE;CAG5D,MAAM,cAAc,OAAO,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,YAAY;EAC7D;EACA,OAAO,aAAa,IAAI,QAAQ,aAAa;EAC9C,EAAE;CAEH,MAAM,UAAU,OAAO,GAAG;CAC1B,MAAM,cAAc,OAAO,GAAG;CAC9B,MAAM,aAAa,aAAa,IAAI,cAAc,aAAa;AAkB/D,QAAO;EACL,SANA,mBAAmB,QACnB,YAAY,kBAEiB,cAAc;EAI3C;EACA,kBAAkB;EAClB;EACA,YAAY,UAAU;EACtB;EACD"}

package/dist/embeddings-Bn86ssxR.mjs

@@ -0,0 +1,119 @@
+import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
+
+//#region src/memory/embeddings.ts
+var embeddings_exports = /* @__PURE__ */ __exportAll({
+	configureEmbeddingModel: () => configureEmbeddingModel,
+	cosineSimilarity: () => cosineSimilarity,
+	deserializeEmbedding: () => deserializeEmbedding,
+	generateEmbedding: () => generateEmbedding,
+	generateEmbeddings: () => generateEmbeddings,
+	serializeEmbedding: () => serializeEmbedding
+});
+const DEFAULT_EMBEDDING_MODEL = "Snowflake/snowflake-arctic-embed-m-v1.5";
+/** Query prefix required by Snowflake Arctic Embed for retrieval tasks. */
+const QUERY_PREFIX = "Represent this sentence for searching relevant passages: ";
+let _embeddingPipeline = null;
+let _currentModel = null;
+/**
+* Configure the embedding model to use.
+* Must be called before the first generateEmbedding() call.
+* If the pipeline is already loaded with a different model, it will be reloaded.
+*
+* @param model  HuggingFace model ID (e.g. "Snowflake/snowflake-arctic-embed-m-v1.5").
+*               Pass undefined or empty string to use the default model.
+*/
+function configureEmbeddingModel(model) {
+	const resolved = model?.trim() || DEFAULT_EMBEDDING_MODEL;
+	if (_currentModel !== null && _currentModel !== resolved) _embeddingPipeline = null;
+	_currentModel = resolved;
+}
+async function getEmbedder() {
+	const model = _currentModel ?? DEFAULT_EMBEDDING_MODEL;
+	if (!_embeddingPipeline) {
+		const { pipeline } = await import("@huggingface/transformers");
+		_embeddingPipeline = await pipeline("feature-extraction", model, { dtype: "q8" });
+	}
+	return _embeddingPipeline;
+}
+/**
+* Generate a normalized 768-dim embedding for the given text.
+*
+* Uses CLS pooling (first token) and L2 normalization (cosine similarity ready).
+*
+* @param text     The text to embed.
+* @param isQuery  If true, prepend the Snowflake query prefix. Use for search queries.
+*                 Documents should be embedded without the prefix (default: false).
+*/
+async function generateEmbedding(text, isQuery = false) {
+	const input = (isQuery ? QUERY_PREFIX : "") + text;
+	const output = await (await getEmbedder())(input, {
+		pooling: "cls",
+		normalize: true
+	});
+	return new Float32Array(output.data);
+}
+/**
+* Generate normalized embeddings for several documents in one forward pass.
+*
+* The model call dominates embedding cost, and calling it once per chunk leaves
+* most of the available throughput unused: measured on this machine, one-at-a-
+* time runs at ~5 chunks/s, which turns a six-figure backlog into days of
+* work. Batching amortises the per-call overhead across the batch.
+*
+* The pipeline returns one flat buffer for the whole batch, so it is sliced
+* back apart by row. Order is preserved: result[i] corresponds to texts[i].
+*
+* Documents only — queries take the prefixed single-text path, since a search
+* embeds exactly one string and gains nothing here.
+*/
+async function generateEmbeddings(texts) {
+	if (texts.length === 0) return [];
+	if (texts.length === 1) return [await generateEmbedding(texts[0])];
+	const flat = (await (await getEmbedder())(texts, {
+		pooling: "cls",
+		normalize: true
+	})).data;
+	const dim = flat.length / texts.length;
+	if (!Number.isInteger(dim)) throw new Error(`Batched embedding returned ${flat.length} values for ${texts.length} inputs — not divisible`);
+	const out = [];
+	for (let i = 0; i < texts.length; i++) out.push(new Float32Array(flat.slice(i * dim, (i + 1) * dim)));
+	return out;
+}
+/**
+* Serialize a Float32Array to a Buffer for storage in a SQLite BLOB column.
+*/
+function serializeEmbedding(vec) {
+	return Buffer.from(vec.buffer, vec.byteOffset, vec.byteLength);
+}
+/**
+* Deserialize a Buffer (from a SQLite BLOB column) back into a Float32Array.
+*/
+function deserializeEmbedding(blob) {
+	return new Float32Array(blob.buffer, blob.byteOffset, blob.byteLength / 4);
+}
+/**
+* Compute cosine similarity between two normalized embedding vectors.
+*
+* Since both vectors are already L2-normalized by the embedding model,
+* cosine similarity reduces to a dot product — but we compute the full
+* formula for correctness when embeddings may not be pre-normalized.
+*
+* Returns a value in [-1, 1] where 1 = identical.
+*/
+function cosineSimilarity(a, b) {
+	let dot = 0;
+	let normA = 0;
+	let normB = 0;
+	for (let i = 0; i < a.length; i++) {
+		dot += a[i] * b[i];
+		normA += a[i] * a[i];
+		normB += b[i] * b[i];
+	}
+	const denom = Math.sqrt(normA) * Math.sqrt(normB);
+	if (denom === 0) return 0;
+	return dot / denom;
+}
+
+//#endregion
+export { generateEmbedding as a, embeddings_exports as i, cosineSimilarity as n, deserializeEmbedding as r, configureEmbeddingModel as t };
+//# sourceMappingURL=embeddings-Bn86ssxR.mjs.map

package/dist/embeddings-Bn86ssxR.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"embeddings-Bn86ssxR.mjs","names":[],"sources":["../src/memory/embeddings.ts"],"sourcesContent":["/**\n * Embedding generation for the PAI federation memory engine (Phase 2.5).\n *\n * Uses @huggingface/transformers with the Snowflake/snowflake-arctic-embed-m-v1.5 model\n * (768 dims, q8 quantization, MTEB strong retrieval quality).\n *\n * The model uses CLS pooling (first token) — NOT mean pooling.\n * For retrieval, queries require a prefix: \"Represent this sentence for searching relevant passages: \"\n * Documents should be embedded WITHOUT a prefix.\n *\n * The pipeline is a lazy singleton — loaded on first call, reused thereafter.\n * This avoids loading the heavy ML model on every CLI invocation.\n */\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nexport const EMBEDDING_DIM = 768;\nconst DEFAULT_EMBEDDING_MODEL = \"Snowflake/snowflake-arctic-embed-m-v1.5\";\n\n/** Query prefix required by Snowflake Arctic Embed for retrieval tasks. */\nconst QUERY_PREFIX = \"Represent this sentence for searching relevant passages: \";\n\n// ---------------------------------------------------------------------------\n// Lazy pipeline singleton\n// ---------------------------------------------------------------------------\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nlet _embeddingPipeline: any = null;\nlet _currentModel: string | null = null;\n\n/**\n * Configure the embedding model to use.\n * Must be called before the first generateEmbedding() call.\n * If the pipeline is already loaded with a different model, it will be reloaded.\n *\n * @param model  HuggingFace model ID (e.g. \"Snowflake/snowflake-arctic-embed-m-v1.5\").\n *               Pass undefined or empty string to use the default model.\n */\nexport function configureEmbeddingModel(model?: string): void {\n  const resolved = model?.trim() || DEFAULT_EMBEDDING_MODEL;\n  if (_currentModel !== null && _currentModel !== resolved) {\n    // Model changed — force reload on next call\n    _embeddingPipeline = null;\n  }\n  _currentModel = resolved;\n}\n\nasync function getEmbedder() {\n  const model = _currentModel ?? DEFAULT_EMBEDDING_MODEL;\n  if (!_embeddingPipeline) {\n    // Dynamic import to avoid loading the ML runtime on startup\n    const { pipeline } = await import(\"@huggingface/transformers\");\n    _embeddingPipeline = await pipeline(\n      \"feature-extraction\",\n      model,\n      { dtype: \"q8\" },\n    );\n  }\n  return _embeddingPipeline;\n}\n\n// ---------------------------------------------------------------------------\n// Embedding generation\n// ---------------------------------------------------------------------------\n\n/**\n * Generate a normalized 768-dim embedding for the given text.\n *\n * Uses CLS pooling (first token) and L2 normalization (cosine similarity ready).\n *\n * @param text     The text to embed.\n * @param isQuery  If true, prepend the Snowflake query prefix. Use for search queries.\n *                 Documents should be embedded without the prefix (default: false).\n */\nexport async function generateEmbedding(text: string, isQuery: boolean = false): Promise<Float32Array> {\n  const prefix = isQuery ? QUERY_PREFIX : \"\";\n  const input = prefix + text;\n  const extractor = await getEmbedder();\n  // Snowflake Arctic Embed uses CLS pooling (first token), not mean pooling\n  const output = await extractor(input, { pooling: \"cls\", normalize: true });\n  return new Float32Array(output.data);\n}\n\n/**\n * Generate normalized embeddings for several documents in one forward pass.\n *\n * The model call dominates embedding cost, and calling it once per chunk leaves\n * most of the available throughput unused: measured on this machine, one-at-a-\n * time runs at ~5 chunks/s, which turns a six-figure backlog into days of\n * work. Batching amortises the per-call overhead across the batch.\n *\n * The pipeline returns one flat buffer for the whole batch, so it is sliced\n * back apart by row. Order is preserved: result[i] corresponds to texts[i].\n *\n * Documents only — queries take the prefixed single-text path, since a search\n * embeds exactly one string and gains nothing here.\n */\nexport async function generateEmbeddings(texts: string[]): Promise<Float32Array[]> {\n  if (texts.length === 0) return [];\n  if (texts.length === 1) return [await generateEmbedding(texts[0])];\n\n  const extractor = await getEmbedder();\n  const output = await extractor(texts, { pooling: \"cls\", normalize: true });\n  const flat = output.data as Float32Array;\n\n  const dim = flat.length / texts.length;\n  if (!Number.isInteger(dim)) {\n    throw new Error(\n      `Batched embedding returned ${flat.length} values for ${texts.length} inputs — not divisible`\n    );\n  }\n\n  const out: Float32Array[] = [];\n  for (let i = 0; i < texts.length; i++) {\n    // Copy rather than subarray: the caller stores these, and a view would\n    // pin the whole batch buffer in memory for the lifetime of one vector.\n    out.push(new Float32Array(flat.slice(i * dim, (i + 1) * dim)));\n  }\n  return out;\n}\n\n// ---------------------------------------------------------------------------\n// Serialization helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Serialize a Float32Array to a Buffer for storage in a SQLite BLOB column.\n */\nexport function serializeEmbedding(vec: Float32Array): Buffer {\n  return Buffer.from(vec.buffer, vec.byteOffset, vec.byteLength);\n}\n\n/**\n * Deserialize a Buffer (from a SQLite BLOB column) back into a Float32Array.\n */\nexport function deserializeEmbedding(blob: Buffer): Float32Array {\n  return new Float32Array(blob.buffer, blob.byteOffset, blob.byteLength / 4);\n}\n\n// ---------------------------------------------------------------------------\n// Similarity computation\n// ---------------------------------------------------------------------------\n\n/**\n * Compute cosine similarity between two normalized embedding vectors.\n *\n * Since both vectors are already L2-normalized by the embedding model,\n * cosine similarity reduces to a dot product — but we compute the full\n * formula for correctness when embeddings may not be pre-normalized.\n *\n * Returns a value in [-1, 1] where 1 = identical.\n */\nexport function cosineSimilarity(a: Float32Array, b: Float32Array): number {\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < a.length; i++) {\n    dot += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n  const denom = Math.sqrt(normA) * Math.sqrt(normB);\n  if (denom === 0) return 0;\n  return dot / denom;\n}\n"],"mappings":";;;;;;;;;;;AAmBA,MAAM,0BAA0B;;AAGhC,MAAM,eAAe;AAOrB,IAAI,qBAA0B;AAC9B,IAAI,gBAA+B;;;;;;;;;AAUnC,SAAgB,wBAAwB,OAAsB;CAC5D,MAAM,WAAW,OAAO,MAAM,IAAI;AAClC,KAAI,kBAAkB,QAAQ,kBAAkB,SAE9C,sBAAqB;AAEvB,iBAAgB;;AAGlB,eAAe,cAAc;CAC3B,MAAM,QAAQ,iBAAiB;AAC/B,KAAI,CAAC,oBAAoB;EAEvB,MAAM,EAAE,aAAa,MAAM,OAAO;AAClC,uBAAqB,MAAM,SACzB,sBACA,OACA,EAAE,OAAO,MAAM,CAChB;;AAEH,QAAO;;;;;;;;;;;AAgBT,eAAsB,kBAAkB,MAAc,UAAmB,OAA8B;CAErG,MAAM,SADS,UAAU,eAAe,MACjB;CAGvB,MAAM,SAAS,OAFG,MAAM,aAAa,EAEN,OAAO;EAAE,SAAS;EAAO,WAAW;EAAM,CAAC;AAC1E,QAAO,IAAI,aAAa,OAAO,KAAK;;;;;;;;;;;;;;;;AAiBtC,eAAsB,mBAAmB,OAA0C;AACjF,KAAI,MAAM,WAAW,EAAG,QAAO,EAAE;AACjC,KAAI,MAAM,WAAW,EAAG,QAAO,CAAC,MAAM,kBAAkB,MAAM,GAAG,CAAC;CAIlE,MAAM,QADS,OADG,MAAM,aAAa,EACN,OAAO;EAAE,SAAS;EAAO,WAAW;EAAM,CAAC,EACtD;CAEpB,MAAM,MAAM,KAAK,SAAS,MAAM;AAChC,KAAI,CAAC,OAAO,UAAU,IAAI,CACxB,OAAM,IAAI,MACR,8BAA8B,KAAK,OAAO,cAAc,MAAM,OAAO,yBACtE;CAGH,MAAM,MAAsB,EAAE;AAC9B,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAGhC,KAAI,KAAK,IAAI,aAAa,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK,IAAI,CAAC,CAAC;AAEhE,QAAO;;;;;AAUT,SAAgB,mBAAmB,KAA2B;AAC5D,QAAO,OAAO,KAAK,IAAI,QAAQ,IAAI,YAAY,IAAI,WAAW;;;;;AAMhE,SAAgB,qBAAqB,MAA4B;AAC/D,QAAO,IAAI,aAAa,KAAK,QAAQ,KAAK,YAAY,KAAK,aAAa,EAAE;;;;;;;;;;;AAgB5E,SAAgB,iBAAiB,GAAiB,GAAyB;CACzE,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,IAAI,QAAQ;AACZ,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,SAAO,EAAE,KAAK,EAAE;AAChB,WAAS,EAAE,KAAK,EAAE;AAClB,WAAS,EAAE,KAAK,EAAE;;CAEpB,MAAM,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,KAAK,MAAM;AACjD,KAAI,UAAU,EAAG,QAAO;AACxB,QAAO,MAAM"}

package/dist/{embeddings-BJPOcbik.mjs → embeddings-DGRAPAYb.mjs}

@@ -88,4 +88,4 @@ function cosineSimilarity(a, b) {
 
 //#endregion
 export { generateEmbedding as a, embeddings_exports as i, cosineSimilarity as n, deserializeEmbedding as r, configureEmbeddingModel as t };
-//# sourceMappingURL=embeddings-BJPOcbik.mjs.map
+//# sourceMappingURL=embeddings-DGRAPAYb.mjs.map

package/dist/{embeddings-BJPOcbik.mjs.map → embeddings-DGRAPAYb.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"embeddings-BJPOcbik.mjs","names":[],"sources":["../src/memory/embeddings.ts"],"sourcesContent":["/**\n * Embedding generation for the PAI federation memory engine (Phase 2.5).\n *\n * Uses @huggingface/transformers with the Snowflake/snowflake-arctic-embed-m-v1.5 model\n * (768 dims, q8 quantization, MTEB strong retrieval quality).\n *\n * The model uses CLS pooling (first token) — NOT mean pooling.\n * For retrieval, queries require a prefix: \"Represent this sentence for searching relevant passages: \"\n * Documents should be embedded WITHOUT a prefix.\n *\n * The pipeline is a lazy singleton — loaded on first call, reused thereafter.\n * This avoids loading the heavy ML model on every CLI invocation.\n */\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nexport const EMBEDDING_DIM = 768;\nconst DEFAULT_EMBEDDING_MODEL = \"Snowflake/snowflake-arctic-embed-m-v1.5\";\n\n/** Query prefix required by Snowflake Arctic Embed for retrieval tasks. */\nconst QUERY_PREFIX = \"Represent this sentence for searching relevant passages: \";\n\n// ---------------------------------------------------------------------------\n// Lazy pipeline singleton\n// ---------------------------------------------------------------------------\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nlet _embeddingPipeline: any = null;\nlet _currentModel: string | null = null;\n\n/**\n * Configure the embedding model to use.\n * Must be called before the first generateEmbedding() call.\n * If the pipeline is already loaded with a different model, it will be reloaded.\n *\n * @param model  HuggingFace model ID (e.g. \"Snowflake/snowflake-arctic-embed-m-v1.5\").\n *               Pass undefined or empty string to use the default model.\n */\nexport function configureEmbeddingModel(model?: string): void {\n  const resolved = model?.trim() || DEFAULT_EMBEDDING_MODEL;\n  if (_currentModel !== null && _currentModel !== resolved) {\n    // Model changed — force reload on next call\n    _embeddingPipeline = null;\n  }\n  _currentModel = resolved;\n}\n\nasync function getEmbedder() {\n  const model = _currentModel ?? DEFAULT_EMBEDDING_MODEL;\n  if (!_embeddingPipeline) {\n    // Dynamic import to avoid loading the ML runtime on startup\n    const { pipeline } = await import(\"@huggingface/transformers\");\n    _embeddingPipeline = await pipeline(\n      \"feature-extraction\",\n      model,\n      { dtype: \"q8\" },\n    );\n  }\n  return _embeddingPipeline;\n}\n\n// ---------------------------------------------------------------------------\n// Embedding generation\n// ---------------------------------------------------------------------------\n\n/**\n * Generate a normalized 768-dim embedding for the given text.\n *\n * Uses CLS pooling (first token) and L2 normalization (cosine similarity ready).\n *\n * @param text     The text to embed.\n * @param isQuery  If true, prepend the Snowflake query prefix. Use for search queries.\n *                 Documents should be embedded without the prefix (default: false).\n */\nexport async function generateEmbedding(text: string, isQuery: boolean = false): Promise<Float32Array> {\n  const prefix = isQuery ? QUERY_PREFIX : \"\";\n  const input = prefix + text;\n  const extractor = await getEmbedder();\n  // Snowflake Arctic Embed uses CLS pooling (first token), not mean pooling\n  const output = await extractor(input, { pooling: \"cls\", normalize: true });\n  return new Float32Array(output.data);\n}\n\n// ---------------------------------------------------------------------------\n// Serialization helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Serialize a Float32Array to a Buffer for storage in a SQLite BLOB column.\n */\nexport function serializeEmbedding(vec: Float32Array): Buffer {\n  return Buffer.from(vec.buffer, vec.byteOffset, vec.byteLength);\n}\n\n/**\n * Deserialize a Buffer (from a SQLite BLOB column) back into a Float32Array.\n */\nexport function deserializeEmbedding(blob: Buffer): Float32Array {\n  return new Float32Array(blob.buffer, blob.byteOffset, blob.byteLength / 4);\n}\n\n// ---------------------------------------------------------------------------\n// Similarity computation\n// ---------------------------------------------------------------------------\n\n/**\n * Compute cosine similarity between two normalized embedding vectors.\n *\n * Since both vectors are already L2-normalized by the embedding model,\n * cosine similarity reduces to a dot product — but we compute the full\n * formula for correctness when embeddings may not be pre-normalized.\n *\n * Returns a value in [-1, 1] where 1 = identical.\n */\nexport function cosineSimilarity(a: Float32Array, b: Float32Array): number {\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < a.length; i++) {\n    dot += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n  const denom = Math.sqrt(normA) * Math.sqrt(normB);\n  if (denom === 0) return 0;\n  return dot / denom;\n}\n"],"mappings":";;;;;;;;;;AAmBA,MAAM,0BAA0B;;AAGhC,MAAM,eAAe;AAOrB,IAAI,qBAA0B;AAC9B,IAAI,gBAA+B;;;;;;;;;AAUnC,SAAgB,wBAAwB,OAAsB;CAC5D,MAAM,WAAW,OAAO,MAAM,IAAI;AAClC,KAAI,kBAAkB,QAAQ,kBAAkB,SAE9C,sBAAqB;AAEvB,iBAAgB;;AAGlB,eAAe,cAAc;CAC3B,MAAM,QAAQ,iBAAiB;AAC/B,KAAI,CAAC,oBAAoB;EAEvB,MAAM,EAAE,aAAa,MAAM,OAAO;AAClC,uBAAqB,MAAM,SACzB,sBACA,OACA,EAAE,OAAO,MAAM,CAChB;;AAEH,QAAO;;;;;;;;;;;AAgBT,eAAsB,kBAAkB,MAAc,UAAmB,OAA8B;CAErG,MAAM,SADS,UAAU,eAAe,MACjB;CAGvB,MAAM,SAAS,OAFG,MAAM,aAAa,EAEN,OAAO;EAAE,SAAS;EAAO,WAAW;EAAM,CAAC;AAC1E,QAAO,IAAI,aAAa,OAAO,KAAK;;;;;AAUtC,SAAgB,mBAAmB,KAA2B;AAC5D,QAAO,OAAO,KAAK,IAAI,QAAQ,IAAI,YAAY,IAAI,WAAW;;;;;AAMhE,SAAgB,qBAAqB,MAA4B;AAC/D,QAAO,IAAI,aAAa,KAAK,QAAQ,KAAK,YAAY,KAAK,aAAa,EAAE;;;;;;;;;;;AAgB5E,SAAgB,iBAAiB,GAAiB,GAAyB;CACzE,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,IAAI,QAAQ;AACZ,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,SAAO,EAAE,KAAK,EAAE;AAChB,WAAS,EAAE,KAAK,EAAE;AAClB,WAAS,EAAE,KAAK,EAAE;;CAEpB,MAAM,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,KAAK,MAAM;AACjD,KAAI,UAAU,EAAG,QAAO;AACxB,QAAO,MAAM"}
+{"version":3,"file":"embeddings-DGRAPAYb.mjs","names":[],"sources":["../src/memory/embeddings.ts"],"sourcesContent":["/**\n * Embedding generation for the PAI federation memory engine (Phase 2.5).\n *\n * Uses @huggingface/transformers with the Snowflake/snowflake-arctic-embed-m-v1.5 model\n * (768 dims, q8 quantization, MTEB strong retrieval quality).\n *\n * The model uses CLS pooling (first token) — NOT mean pooling.\n * For retrieval, queries require a prefix: \"Represent this sentence for searching relevant passages: \"\n * Documents should be embedded WITHOUT a prefix.\n *\n * The pipeline is a lazy singleton — loaded on first call, reused thereafter.\n * This avoids loading the heavy ML model on every CLI invocation.\n */\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nexport const EMBEDDING_DIM = 768;\nconst DEFAULT_EMBEDDING_MODEL = \"Snowflake/snowflake-arctic-embed-m-v1.5\";\n\n/** Query prefix required by Snowflake Arctic Embed for retrieval tasks. */\nconst QUERY_PREFIX = \"Represent this sentence for searching relevant passages: \";\n\n// ---------------------------------------------------------------------------\n// Lazy pipeline singleton\n// ---------------------------------------------------------------------------\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nlet _embeddingPipeline: any = null;\nlet _currentModel: string | null = null;\n\n/**\n * Configure the embedding model to use.\n * Must be called before the first generateEmbedding() call.\n * If the pipeline is already loaded with a different model, it will be reloaded.\n *\n * @param model  HuggingFace model ID (e.g. \"Snowflake/snowflake-arctic-embed-m-v1.5\").\n *               Pass undefined or empty string to use the default model.\n */\nexport function configureEmbeddingModel(model?: string): void {\n  const resolved = model?.trim() || DEFAULT_EMBEDDING_MODEL;\n  if (_currentModel !== null && _currentModel !== resolved) {\n    // Model changed — force reload on next call\n    _embeddingPipeline = null;\n  }\n  _currentModel = resolved;\n}\n\nasync function getEmbedder() {\n  const model = _currentModel ?? DEFAULT_EMBEDDING_MODEL;\n  if (!_embeddingPipeline) {\n    // Dynamic import to avoid loading the ML runtime on startup\n    const { pipeline } = await import(\"@huggingface/transformers\");\n    _embeddingPipeline = await pipeline(\n      \"feature-extraction\",\n      model,\n      { dtype: \"q8\" },\n    );\n  }\n  return _embeddingPipeline;\n}\n\n// ---------------------------------------------------------------------------\n// Embedding generation\n// ---------------------------------------------------------------------------\n\n/**\n * Generate a normalized 768-dim embedding for the given text.\n *\n * Uses CLS pooling (first token) and L2 normalization (cosine similarity ready).\n *\n * @param text     The text to embed.\n * @param isQuery  If true, prepend the Snowflake query prefix. Use for search queries.\n *                 Documents should be embedded without the prefix (default: false).\n */\nexport async function generateEmbedding(text: string, isQuery: boolean = false): Promise<Float32Array> {\n  const prefix = isQuery ? QUERY_PREFIX : \"\";\n  const input = prefix + text;\n  const extractor = await getEmbedder();\n  // Snowflake Arctic Embed uses CLS pooling (first token), not mean pooling\n  const output = await extractor(input, { pooling: \"cls\", normalize: true });\n  return new Float32Array(output.data);\n}\n\n// ---------------------------------------------------------------------------\n// Serialization helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Serialize a Float32Array to a Buffer for storage in a SQLite BLOB column.\n */\nexport function serializeEmbedding(vec: Float32Array): Buffer {\n  return Buffer.from(vec.buffer, vec.byteOffset, vec.byteLength);\n}\n\n/**\n * Deserialize a Buffer (from a SQLite BLOB column) back into a Float32Array.\n */\nexport function deserializeEmbedding(blob: Buffer): Float32Array {\n  return new Float32Array(blob.buffer, blob.byteOffset, blob.byteLength / 4);\n}\n\n// ---------------------------------------------------------------------------\n// Similarity computation\n// ---------------------------------------------------------------------------\n\n/**\n * Compute cosine similarity between two normalized embedding vectors.\n *\n * Since both vectors are already L2-normalized by the embedding model,\n * cosine similarity reduces to a dot product — but we compute the full\n * formula for correctness when embeddings may not be pre-normalized.\n *\n * Returns a value in [-1, 1] where 1 = identical.\n */\nexport function cosineSimilarity(a: Float32Array, b: Float32Array): number {\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < a.length; i++) {\n    dot += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n  const denom = Math.sqrt(normA) * Math.sqrt(normB);\n  if (denom === 0) return 0;\n  return dot / denom;\n}\n"],"mappings":";;;;;;;;;;AAmBA,MAAM,0BAA0B;;AAGhC,MAAM,eAAe;AAOrB,IAAI,qBAA0B;AAC9B,IAAI,gBAA+B;;;;;;;;;AAUnC,SAAgB,wBAAwB,OAAsB;CAC5D,MAAM,WAAW,OAAO,MAAM,IAAI;AAClC,KAAI,kBAAkB,QAAQ,kBAAkB,SAE9C,sBAAqB;AAEvB,iBAAgB;;AAGlB,eAAe,cAAc;CAC3B,MAAM,QAAQ,iBAAiB;AAC/B,KAAI,CAAC,oBAAoB;EAEvB,MAAM,EAAE,aAAa,MAAM,OAAO;AAClC,uBAAqB,MAAM,SACzB,sBACA,OACA,EAAE,OAAO,MAAM,CAChB;;AAEH,QAAO;;;;;;;;;;;AAgBT,eAAsB,kBAAkB,MAAc,UAAmB,OAA8B;CAErG,MAAM,SADS,UAAU,eAAe,MACjB;CAGvB,MAAM,SAAS,OAFG,MAAM,aAAa,EAEN,OAAO;EAAE,SAAS;EAAO,WAAW;EAAM,CAAC;AAC1E,QAAO,IAAI,aAAa,OAAO,KAAK;;;;;AAUtC,SAAgB,mBAAmB,KAA2B;AAC5D,QAAO,OAAO,KAAK,IAAI,QAAQ,IAAI,YAAY,IAAI,WAAW;;;;;AAMhE,SAAgB,qBAAqB,MAA4B;AAC/D,QAAO,IAAI,aAAa,KAAK,QAAQ,KAAK,YAAY,KAAK,aAAa,EAAE;;;;;;;;;;;AAgB5E,SAAgB,iBAAiB,GAAiB,GAAyB;CACzE,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,IAAI,QAAQ;AACZ,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,SAAO,EAAE,KAAK,EAAE;AAChB,WAAS,EAAE,KAAK,EAAE;AAClB,WAAS,EAAE,KAAK,EAAE;;CAEpB,MAAM,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,KAAK,MAAM;AACjD,KAAI,UAAU,EAAG,QAAO;AACxB,QAAO,MAAM"}

package/dist/{factory-Q88X1bAN.mjs → factory-0-57Ac-7.mjs}

@@ -1,4 +1,7 @@
+import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
+
 //#region src/storage/factory.ts
+var factory_exports = /* @__PURE__ */ __exportAll({ createStorageBackend: () => createStorageBackend });
 /** Backoff schedule (ms) for the bounded CLI retry path. */
 const CLI_RETRY_DELAYS_MS = [
 	500,
@@ -23,7 +26,7 @@ async function createStorageBackend(config, opts = {}) {
 * backend on success, or an error string describing why it failed.
 */
 async function attemptPostgres(config) {
-	const { PostgresBackend } = await import("./postgres-B451Hnkm.mjs");
+	const { PostgresBackend } = await import("./postgres-BJxiqtqg.mjs");
 	const pgConfig = config.postgres ?? {};
 	let backend = null;
 	try {
@@ -59,11 +62,11 @@ async function connectPostgres(config, waitForever) {
 	}
 }
 async function createSQLiteBackend() {
-	const { openFederation } = await import("./db-CmYbAVCD.mjs").then((n) => n.t);
-	const { SQLiteBackend } = await import("./sqlite-DQpY1Esi.mjs");
+	const { openFederation } = await import("./db-CYmBWcjh.mjs").then((n) => n.t);
+	const { SQLiteBackend } = await import("./sqlite-CZ0LFili.mjs");
 	return new SQLiteBackend(openFederation());
 }
 
 //#endregion
-export { createStorageBackend as t };
-//# sourceMappingURL=factory-Q88X1bAN.mjs.map
+export { factory_exports as n, createStorageBackend as t };
+//# sourceMappingURL=factory-0-57Ac-7.mjs.map

package/dist/{factory-Q88X1bAN.mjs.map → factory-0-57Ac-7.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"factory-Q88X1bAN.mjs","names":[],"sources":["../src/storage/factory.ts"],"sourcesContent":["/**\n * Storage backend factory.\n *\n * Reads the daemon config and returns the appropriate StorageBackend.\n *\n * When Postgres is the configured backend we NEVER silently fall back to\n * SQLite — doing so would split the corpus across two databases. Instead:\n *  - Daemon (waitForPostgres: true) retries Postgres forever with capped\n *    backoff until it comes up (handles the boot race where launchd starts\n *    the daemon before Docker Desktop / Postgres is ready).\n *  - CLI / one-shot callers (default) retry a few times, then throw a clear\n *    error rather than returning a wrong/empty SQLite database.\n */\n\nimport type { PaiDaemonConfig } from \"../daemon/config.js\";\nimport type { StorageBackend } from \"./interface.js\";\n\nexport interface StorageBackendOptions {\n  /**\n   * When true, retry Postgres indefinitely instead of giving up. Used by the\n   * long-lived daemon so a not-yet-ready Postgres at boot is tolerated.\n   * Defaults to false (one-shot CLI behaviour: bounded retries, then throw).\n   */\n  waitForPostgres?: boolean;\n}\n\n/** Backoff schedule (ms) for the bounded CLI retry path. */\nconst CLI_RETRY_DELAYS_MS = [500, 1_000, 2_000];\n\n/** Backoff cap (ms) for the daemon's infinite retry path. */\nconst DAEMON_RETRY_CAP_MS = 15_000;\n\n/**\n * Create and return the configured StorageBackend.\n *\n * Auto-behaviour:\n *  - storageBackend = \"sqlite\"   → SQLiteBackend always\n *  - storageBackend = \"postgres\" → PostgresBackend (retried; never falls back)\n */\nexport async function createStorageBackend(\n  config: PaiDaemonConfig,\n  opts: StorageBackendOptions = {}\n): Promise<StorageBackend> {\n  if (config.storageBackend === \"postgres\") {\n    return await connectPostgres(config, opts.waitForPostgres ?? false);\n  }\n\n  // Default: SQLite\n  return createSQLiteBackend();\n}\n\n/**\n * Attempt a single Postgres connection (ensure DB + test). Returns the live\n * backend on success, or an error string describing why it failed.\n */\nasync function attemptPostgres(\n  config: PaiDaemonConfig\n): Promise<{ backend: StorageBackend } | { error: string }> {\n  const { PostgresBackend } = await import(\"./postgres.js\");\n  const pgConfig = config.postgres ?? {};\n\n  let backend: InstanceType<typeof PostgresBackend> | null = null;\n  try {\n    // Ensure the per-user database exists and has the schema applied.\n    await PostgresBackend.ensureDatabase(pgConfig);\n\n    backend = new PostgresBackend(pgConfig);\n    const err = await backend.testConnection();\n    if (err) {\n      await backend.close().catch(() => {});\n      return { error: err };\n    }\n    return { backend };\n  } catch (e) {\n    if (backend) await backend.close().catch(() => {});\n    return { error: e instanceof Error ? e.message : String(e) };\n  }\n}\n\nasync function connectPostgres(\n  config: PaiDaemonConfig,\n  waitForever: boolean\n): Promise<StorageBackend> {\n  let attempt = 0;\n  let lastError = \"unknown error\";\n\n  // eslint-disable-next-line no-constant-condition\n  while (true) {\n    attempt++;\n    const result = await attemptPostgres(config);\n    if (\"backend\" in result) {\n      if (attempt > 1) {\n        process.stderr.write(\n          `[pai-daemon] Connected to PostgreSQL backend (after ${attempt} attempts).\\n`\n        );\n      } else {\n        process.stderr.write(\"[pai-daemon] Connected to PostgreSQL backend.\\n\");\n      }\n      return result.backend;\n    }\n\n    lastError = result.error;\n\n    if (!waitForever && attempt > CLI_RETRY_DELAYS_MS.length) {\n      // Bounded CLI path exhausted — fail loudly, never silently use SQLite.\n      throw new Error(\n        `Postgres backend unreachable after ${attempt} attempts: ${lastError}. ` +\n          `Is Docker Desktop / Postgres running? Refusing to fall back to SQLite ` +\n          `(would split the corpus). Start Postgres and retry.`\n      );\n    }\n\n    const delayMs = waitForever\n      ? Math.min(DAEMON_RETRY_CAP_MS, 1_000 * 2 ** Math.min(attempt - 1, 4))\n      : CLI_RETRY_DELAYS_MS[attempt - 1];\n\n    process.stderr.write(\n      `[pai-daemon] Postgres unavailable (${lastError}). ` +\n        `Retry ${attempt}${waitForever ? \"\" : `/${CLI_RETRY_DELAYS_MS.length + 1}`} ` +\n        `in ${delayMs}ms...\\n`\n    );\n    await new Promise((r) => setTimeout(r, delayMs));\n  }\n}\n\nasync function createSQLiteBackend(): Promise<StorageBackend> {\n  const { openFederation } = await import(\"../memory/db.js\");\n  const { SQLiteBackend } = await import(\"./sqlite.js\");\n  const db = openFederation();\n  return new SQLiteBackend(db);\n}\n"],"mappings":";;AA2BA,MAAM,sBAAsB;CAAC;CAAK;CAAO;CAAM;;AAG/C,MAAM,sBAAsB;;;;;;;;AAS5B,eAAsB,qBACpB,QACA,OAA8B,EAAE,EACP;AACzB,KAAI,OAAO,mBAAmB,WAC5B,QAAO,MAAM,gBAAgB,QAAQ,KAAK,mBAAmB,MAAM;AAIrE,QAAO,qBAAqB;;;;;;AAO9B,eAAe,gBACb,QAC0D;CAC1D,MAAM,EAAE,oBAAoB,MAAM,OAAO;CACzC,MAAM,WAAW,OAAO,YAAY,EAAE;CAEtC,IAAI,UAAuD;AAC3D,KAAI;AAEF,QAAM,gBAAgB,eAAe,SAAS;AAE9C,YAAU,IAAI,gBAAgB,SAAS;EACvC,MAAM,MAAM,MAAM,QAAQ,gBAAgB;AAC1C,MAAI,KAAK;AACP,SAAM,QAAQ,OAAO,CAAC,YAAY,GAAG;AACrC,UAAO,EAAE,OAAO,KAAK;;AAEvB,SAAO,EAAE,SAAS;UACX,GAAG;AACV,MAAI,QAAS,OAAM,QAAQ,OAAO,CAAC,YAAY,GAAG;AAClD,SAAO,EAAE,OAAO,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE,EAAE;;;AAIhE,eAAe,gBACb,QACA,aACyB;CACzB,IAAI,UAAU;CACd,IAAI,YAAY;AAGhB,QAAO,MAAM;AACX;EACA,MAAM,SAAS,MAAM,gBAAgB,OAAO;AAC5C,MAAI,aAAa,QAAQ;AACvB,OAAI,UAAU,EACZ,SAAQ,OAAO,MACb,uDAAuD,QAAQ,eAChE;OAED,SAAQ,OAAO,MAAM,kDAAkD;AAEzE,UAAO,OAAO;;AAGhB,cAAY,OAAO;AAEnB,MAAI,CAAC,eAAe,UAAU,oBAAoB,OAEhD,OAAM,IAAI,MACR,sCAAsC,QAAQ,aAAa,UAAU,6HAGtE;EAGH,MAAM,UAAU,cACZ,KAAK,IAAI,qBAAqB,MAAQ,KAAK,KAAK,IAAI,UAAU,GAAG,EAAE,CAAC,GACpE,oBAAoB,UAAU;AAElC,UAAQ,OAAO,MACb,sCAAsC,UAAU,WACrC,UAAU,cAAc,KAAK,IAAI,oBAAoB,SAAS,IAAI,MACrE,QAAQ,SACjB;AACD,QAAM,IAAI,SAAS,MAAM,WAAW,GAAG,QAAQ,CAAC;;;AAIpD,eAAe,sBAA+C;CAC5D,MAAM,EAAE,mBAAmB,MAAM,OAAO;CACxC,MAAM,EAAE,kBAAkB,MAAM,OAAO;AAEvC,QAAO,IAAI,cADA,gBAAgB,CACC"}
+{"version":3,"file":"factory-0-57Ac-7.mjs","names":[],"sources":["../src/storage/factory.ts"],"sourcesContent":["/**\n * Storage backend factory.\n *\n * Reads the daemon config and returns the appropriate StorageBackend.\n *\n * When Postgres is the configured backend we NEVER silently fall back to\n * SQLite — doing so would split the corpus across two databases. Instead:\n *  - Daemon (waitForPostgres: true) retries Postgres forever with capped\n *    backoff until it comes up (handles the boot race where launchd starts\n *    the daemon before Docker Desktop / Postgres is ready).\n *  - CLI / one-shot callers (default) retry a few times, then throw a clear\n *    error rather than returning a wrong/empty SQLite database.\n */\n\nimport type { PaiDaemonConfig } from \"../daemon/config.js\";\nimport type { StorageBackend } from \"./interface.js\";\n\nexport interface StorageBackendOptions {\n  /**\n   * When true, retry Postgres indefinitely instead of giving up. Used by the\n   * long-lived daemon so a not-yet-ready Postgres at boot is tolerated.\n   * Defaults to false (one-shot CLI behaviour: bounded retries, then throw).\n   */\n  waitForPostgres?: boolean;\n}\n\n/** Backoff schedule (ms) for the bounded CLI retry path. */\nconst CLI_RETRY_DELAYS_MS = [500, 1_000, 2_000];\n\n/** Backoff cap (ms) for the daemon's infinite retry path. */\nconst DAEMON_RETRY_CAP_MS = 15_000;\n\n/**\n * Create and return the configured StorageBackend.\n *\n * Auto-behaviour:\n *  - storageBackend = \"sqlite\"   → SQLiteBackend always\n *  - storageBackend = \"postgres\" → PostgresBackend (retried; never falls back)\n */\nexport async function createStorageBackend(\n  config: PaiDaemonConfig,\n  opts: StorageBackendOptions = {}\n): Promise<StorageBackend> {\n  if (config.storageBackend === \"postgres\") {\n    return await connectPostgres(config, opts.waitForPostgres ?? false);\n  }\n\n  // Default: SQLite\n  return createSQLiteBackend();\n}\n\n/**\n * Attempt a single Postgres connection (ensure DB + test). Returns the live\n * backend on success, or an error string describing why it failed.\n */\nasync function attemptPostgres(\n  config: PaiDaemonConfig\n): Promise<{ backend: StorageBackend } | { error: string }> {\n  const { PostgresBackend } = await import(\"./postgres.js\");\n  const pgConfig = config.postgres ?? {};\n\n  let backend: InstanceType<typeof PostgresBackend> | null = null;\n  try {\n    // Ensure the per-user database exists and has the schema applied.\n    await PostgresBackend.ensureDatabase(pgConfig);\n\n    backend = new PostgresBackend(pgConfig);\n    const err = await backend.testConnection();\n    if (err) {\n      await backend.close().catch(() => {});\n      return { error: err };\n    }\n    return { backend };\n  } catch (e) {\n    if (backend) await backend.close().catch(() => {});\n    return { error: e instanceof Error ? e.message : String(e) };\n  }\n}\n\nasync function connectPostgres(\n  config: PaiDaemonConfig,\n  waitForever: boolean\n): Promise<StorageBackend> {\n  let attempt = 0;\n  let lastError = \"unknown error\";\n\n  // eslint-disable-next-line no-constant-condition\n  while (true) {\n    attempt++;\n    const result = await attemptPostgres(config);\n    if (\"backend\" in result) {\n      if (attempt > 1) {\n        process.stderr.write(\n          `[pai-daemon] Connected to PostgreSQL backend (after ${attempt} attempts).\\n`\n        );\n      } else {\n        process.stderr.write(\"[pai-daemon] Connected to PostgreSQL backend.\\n\");\n      }\n      return result.backend;\n    }\n\n    lastError = result.error;\n\n    if (!waitForever && attempt > CLI_RETRY_DELAYS_MS.length) {\n      // Bounded CLI path exhausted — fail loudly, never silently use SQLite.\n      throw new Error(\n        `Postgres backend unreachable after ${attempt} attempts: ${lastError}. ` +\n          `Is Docker Desktop / Postgres running? Refusing to fall back to SQLite ` +\n          `(would split the corpus). Start Postgres and retry.`\n      );\n    }\n\n    const delayMs = waitForever\n      ? Math.min(DAEMON_RETRY_CAP_MS, 1_000 * 2 ** Math.min(attempt - 1, 4))\n      : CLI_RETRY_DELAYS_MS[attempt - 1];\n\n    process.stderr.write(\n      `[pai-daemon] Postgres unavailable (${lastError}). ` +\n        `Retry ${attempt}${waitForever ? \"\" : `/${CLI_RETRY_DELAYS_MS.length + 1}`} ` +\n        `in ${delayMs}ms...\\n`\n    );\n    await new Promise((r) => setTimeout(r, delayMs));\n  }\n}\n\nasync function createSQLiteBackend(): Promise<StorageBackend> {\n  const { openFederation } = await import(\"../memory/db.js\");\n  const { SQLiteBackend } = await import(\"./sqlite.js\");\n  const db = openFederation();\n  return new SQLiteBackend(db);\n}\n"],"mappings":";;;;;AA2BA,MAAM,sBAAsB;CAAC;CAAK;CAAO;CAAM;;AAG/C,MAAM,sBAAsB;;;;;;;;AAS5B,eAAsB,qBACpB,QACA,OAA8B,EAAE,EACP;AACzB,KAAI,OAAO,mBAAmB,WAC5B,QAAO,MAAM,gBAAgB,QAAQ,KAAK,mBAAmB,MAAM;AAIrE,QAAO,qBAAqB;;;;;;AAO9B,eAAe,gBACb,QAC0D;CAC1D,MAAM,EAAE,oBAAoB,MAAM,OAAO;CACzC,MAAM,WAAW,OAAO,YAAY,EAAE;CAEtC,IAAI,UAAuD;AAC3D,KAAI;AAEF,QAAM,gBAAgB,eAAe,SAAS;AAE9C,YAAU,IAAI,gBAAgB,SAAS;EACvC,MAAM,MAAM,MAAM,QAAQ,gBAAgB;AAC1C,MAAI,KAAK;AACP,SAAM,QAAQ,OAAO,CAAC,YAAY,GAAG;AACrC,UAAO,EAAE,OAAO,KAAK;;AAEvB,SAAO,EAAE,SAAS;UACX,GAAG;AACV,MAAI,QAAS,OAAM,QAAQ,OAAO,CAAC,YAAY,GAAG;AAClD,SAAO,EAAE,OAAO,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE,EAAE;;;AAIhE,eAAe,gBACb,QACA,aACyB;CACzB,IAAI,UAAU;CACd,IAAI,YAAY;AAGhB,QAAO,MAAM;AACX;EACA,MAAM,SAAS,MAAM,gBAAgB,OAAO;AAC5C,MAAI,aAAa,QAAQ;AACvB,OAAI,UAAU,EACZ,SAAQ,OAAO,MACb,uDAAuD,QAAQ,eAChE;OAED,SAAQ,OAAO,MAAM,kDAAkD;AAEzE,UAAO,OAAO;;AAGhB,cAAY,OAAO;AAEnB,MAAI,CAAC,eAAe,UAAU,oBAAoB,OAEhD,OAAM,IAAI,MACR,sCAAsC,QAAQ,aAAa,UAAU,6HAGtE;EAGH,MAAM,UAAU,cACZ,KAAK,IAAI,qBAAqB,MAAQ,KAAK,KAAK,IAAI,UAAU,GAAG,EAAE,CAAC,GACpE,oBAAoB,UAAU;AAElC,UAAQ,OAAO,MACb,sCAAsC,UAAU,WACrC,UAAU,cAAc,KAAK,IAAI,oBAAoB,SAAS,IAAI,MACrE,QAAQ,SACjB;AACD,QAAM,IAAI,SAAS,MAAM,WAAW,GAAG,QAAQ,CAAC;;;AAIpD,eAAe,sBAA+C;CAC5D,MAAM,EAAE,mBAAmB,MAAM,OAAO;CACxC,MAAM,EAAE,kBAAkB,MAAM,OAAO;AAEvC,QAAO,IAAI,cADA,gBAAgB,CACC"}

package/dist/factory-HcQsQqh0.mjs

@@ -0,0 +1,72 @@
+import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
+
+//#region src/storage/factory.ts
+var factory_exports = /* @__PURE__ */ __exportAll({ createStorageBackend: () => createStorageBackend });
+/** Backoff schedule (ms) for the bounded CLI retry path. */
+const CLI_RETRY_DELAYS_MS = [
+	500,
+	1e3,
+	2e3
+];
+/** Backoff cap (ms) for the daemon's infinite retry path. */
+const DAEMON_RETRY_CAP_MS = 15e3;
+/**
+* Create and return the configured StorageBackend.
+*
+* Auto-behaviour:
+*  - storageBackend = "sqlite"   → SQLiteBackend always
+*  - storageBackend = "postgres" → PostgresBackend (retried; never falls back)
+*/
+async function createStorageBackend(config, opts = {}) {
+	if (config.storageBackend === "postgres") return await connectPostgres(config, opts.waitForPostgres ?? false);
+	return createSQLiteBackend();
+}
+/**
+* Attempt a single Postgres connection (ensure DB + test). Returns the live
+* backend on success, or an error string describing why it failed.
+*/
+async function attemptPostgres(config) {
+	const { PostgresBackend } = await import("./postgres-zjKqPl4X.mjs");
+	const pgConfig = config.postgres ?? {};
+	let backend = null;
+	try {
+		await PostgresBackend.ensureDatabase(pgConfig);
+		backend = new PostgresBackend(pgConfig);
+		const err = await backend.testConnection();
+		if (err) {
+			await backend.close().catch(() => {});
+			return { error: err };
+		}
+		return { backend };
+	} catch (e) {
+		if (backend) await backend.close().catch(() => {});
+		return { error: e instanceof Error ? e.message : String(e) };
+	}
+}
+async function connectPostgres(config, waitForever) {
+	let attempt = 0;
+	let lastError = "unknown error";
+	while (true) {
+		attempt++;
+		const result = await attemptPostgres(config);
+		if ("backend" in result) {
+			if (attempt > 1) process.stderr.write(`[pai-daemon] Connected to PostgreSQL backend (after ${attempt} attempts).\n`);
+			else process.stderr.write("[pai-daemon] Connected to PostgreSQL backend.\n");
+			return result.backend;
+		}
+		lastError = result.error;
+		if (!waitForever && attempt > CLI_RETRY_DELAYS_MS.length) throw new Error(`Postgres backend unreachable after ${attempt} attempts: ${lastError}. Is Docker Desktop / Postgres running? Refusing to fall back to SQLite (would split the corpus). Start Postgres and retry.`);
+		const delayMs = waitForever ? Math.min(DAEMON_RETRY_CAP_MS, 1e3 * 2 ** Math.min(attempt - 1, 4)) : CLI_RETRY_DELAYS_MS[attempt - 1];
+		process.stderr.write(`[pai-daemon] Postgres unavailable (${lastError}). Retry ${attempt}${waitForever ? "" : `/${CLI_RETRY_DELAYS_MS.length + 1}`} in ${delayMs}ms...\n`);
+		await new Promise((r) => setTimeout(r, delayMs));
+	}
+}
+async function createSQLiteBackend() {
+	const { openFederation } = await import("./db-CYmBWcjh.mjs").then((n) => n.t);
+	const { SQLiteBackend } = await import("./sqlite-ChSCYwiC.mjs");
+	return new SQLiteBackend(openFederation());
+}
+
+//#endregion
+export { factory_exports as n, createStorageBackend as t };
+//# sourceMappingURL=factory-HcQsQqh0.mjs.map

package/dist/factory-HcQsQqh0.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"factory-HcQsQqh0.mjs","names":[],"sources":["../src/storage/factory.ts"],"sourcesContent":["/**\n * Storage backend factory.\n *\n * Reads the daemon config and returns the appropriate StorageBackend.\n *\n * When Postgres is the configured backend we NEVER silently fall back to\n * SQLite — doing so would split the corpus across two databases. Instead:\n *  - Daemon (waitForPostgres: true) retries Postgres forever with capped\n *    backoff until it comes up (handles the boot race where launchd starts\n *    the daemon before Docker Desktop / Postgres is ready).\n *  - CLI / one-shot callers (default) retry a few times, then throw a clear\n *    error rather than returning a wrong/empty SQLite database.\n */\n\nimport type { PaiDaemonConfig } from \"../daemon/config.js\";\nimport type { StorageBackend } from \"./interface.js\";\n\nexport interface StorageBackendOptions {\n  /**\n   * When true, retry Postgres indefinitely instead of giving up. Used by the\n   * long-lived daemon so a not-yet-ready Postgres at boot is tolerated.\n   * Defaults to false (one-shot CLI behaviour: bounded retries, then throw).\n   */\n  waitForPostgres?: boolean;\n}\n\n/** Backoff schedule (ms) for the bounded CLI retry path. */\nconst CLI_RETRY_DELAYS_MS = [500, 1_000, 2_000];\n\n/** Backoff cap (ms) for the daemon's infinite retry path. */\nconst DAEMON_RETRY_CAP_MS = 15_000;\n\n/**\n * Create and return the configured StorageBackend.\n *\n * Auto-behaviour:\n *  - storageBackend = \"sqlite\"   → SQLiteBackend always\n *  - storageBackend = \"postgres\" → PostgresBackend (retried; never falls back)\n */\nexport async function createStorageBackend(\n  config: PaiDaemonConfig,\n  opts: StorageBackendOptions = {}\n): Promise<StorageBackend> {\n  if (config.storageBackend === \"postgres\") {\n    return await connectPostgres(config, opts.waitForPostgres ?? false);\n  }\n\n  // Default: SQLite\n  return createSQLiteBackend();\n}\n\n/**\n * Attempt a single Postgres connection (ensure DB + test). Returns the live\n * backend on success, or an error string describing why it failed.\n */\nasync function attemptPostgres(\n  config: PaiDaemonConfig\n): Promise<{ backend: StorageBackend } | { error: string }> {\n  const { PostgresBackend } = await import(\"./postgres.js\");\n  const pgConfig = config.postgres ?? {};\n\n  let backend: InstanceType<typeof PostgresBackend> | null = null;\n  try {\n    // Ensure the per-user database exists and has the schema applied.\n    await PostgresBackend.ensureDatabase(pgConfig);\n\n    backend = new PostgresBackend(pgConfig);\n    const err = await backend.testConnection();\n    if (err) {\n      await backend.close().catch(() => {});\n      return { error: err };\n    }\n    return { backend };\n  } catch (e) {\n    if (backend) await backend.close().catch(() => {});\n    return { error: e instanceof Error ? e.message : String(e) };\n  }\n}\n\nasync function connectPostgres(\n  config: PaiDaemonConfig,\n  waitForever: boolean\n): Promise<StorageBackend> {\n  let attempt = 0;\n  let lastError = \"unknown error\";\n\n  // eslint-disable-next-line no-constant-condition\n  while (true) {\n    attempt++;\n    const result = await attemptPostgres(config);\n    if (\"backend\" in result) {\n      if (attempt > 1) {\n        process.stderr.write(\n          `[pai-daemon] Connected to PostgreSQL backend (after ${attempt} attempts).\\n`\n        );\n      } else {\n        process.stderr.write(\"[pai-daemon] Connected to PostgreSQL backend.\\n\");\n      }\n      return result.backend;\n    }\n\n    lastError = result.error;\n\n    if (!waitForever && attempt > CLI_RETRY_DELAYS_MS.length) {\n      // Bounded CLI path exhausted — fail loudly, never silently use SQLite.\n      throw new Error(\n        `Postgres backend unreachable after ${attempt} attempts: ${lastError}. ` +\n          `Is Docker Desktop / Postgres running? Refusing to fall back to SQLite ` +\n          `(would split the corpus). Start Postgres and retry.`\n      );\n    }\n\n    const delayMs = waitForever\n      ? Math.min(DAEMON_RETRY_CAP_MS, 1_000 * 2 ** Math.min(attempt - 1, 4))\n      : CLI_RETRY_DELAYS_MS[attempt - 1];\n\n    process.stderr.write(\n      `[pai-daemon] Postgres unavailable (${lastError}). ` +\n        `Retry ${attempt}${waitForever ? \"\" : `/${CLI_RETRY_DELAYS_MS.length + 1}`} ` +\n        `in ${delayMs}ms...\\n`\n    );\n    await new Promise((r) => setTimeout(r, delayMs));\n  }\n}\n\nasync function createSQLiteBackend(): Promise<StorageBackend> {\n  const { openFederation } = await import(\"../memory/db.js\");\n  const { SQLiteBackend } = await import(\"./sqlite.js\");\n  const db = openFederation();\n  return new SQLiteBackend(db);\n}\n"],"mappings":";;;;;AA2BA,MAAM,sBAAsB;CAAC;CAAK;CAAO;CAAM;;AAG/C,MAAM,sBAAsB;;;;;;;;AAS5B,eAAsB,qBACpB,QACA,OAA8B,EAAE,EACP;AACzB,KAAI,OAAO,mBAAmB,WAC5B,QAAO,MAAM,gBAAgB,QAAQ,KAAK,mBAAmB,MAAM;AAIrE,QAAO,qBAAqB;;;;;;AAO9B,eAAe,gBACb,QAC0D;CAC1D,MAAM,EAAE,oBAAoB,MAAM,OAAO;CACzC,MAAM,WAAW,OAAO,YAAY,EAAE;CAEtC,IAAI,UAAuD;AAC3D,KAAI;AAEF,QAAM,gBAAgB,eAAe,SAAS;AAE9C,YAAU,IAAI,gBAAgB,SAAS;EACvC,MAAM,MAAM,MAAM,QAAQ,gBAAgB;AAC1C,MAAI,KAAK;AACP,SAAM,QAAQ,OAAO,CAAC,YAAY,GAAG;AACrC,UAAO,EAAE,OAAO,KAAK;;AAEvB,SAAO,EAAE,SAAS;UACX,GAAG;AACV,MAAI,QAAS,OAAM,QAAQ,OAAO,CAAC,YAAY,GAAG;AAClD,SAAO,EAAE,OAAO,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE,EAAE;;;AAIhE,eAAe,gBACb,QACA,aACyB;CACzB,IAAI,UAAU;CACd,IAAI,YAAY;AAGhB,QAAO,MAAM;AACX;EACA,MAAM,SAAS,MAAM,gBAAgB,OAAO;AAC5C,MAAI,aAAa,QAAQ;AACvB,OAAI,UAAU,EACZ,SAAQ,OAAO,MACb,uDAAuD,QAAQ,eAChE;OAED,SAAQ,OAAO,MAAM,kDAAkD;AAEzE,UAAO,OAAO;;AAGhB,cAAY,OAAO;AAEnB,MAAI,CAAC,eAAe,UAAU,oBAAoB,OAEhD,OAAM,IAAI,MACR,sCAAsC,QAAQ,aAAa,UAAU,6HAGtE;EAGH,MAAM,UAAU,cACZ,KAAK,IAAI,qBAAqB,MAAQ,KAAK,KAAK,IAAI,UAAU,GAAG,EAAE,CAAC,GACpE,oBAAoB,UAAU;AAElC,UAAQ,OAAO,MACb,sCAAsC,UAAU,WACrC,UAAU,cAAc,KAAK,IAAI,oBAAoB,SAAS,IAAI,MACrE,QAAQ,SACjB;AACD,QAAM,IAAI,SAAS,MAAM,WAAW,GAAG,QAAQ,CAAC;;;AAIpD,eAAe,sBAA+C;CAC5D,MAAM,EAAE,mBAAmB,MAAM,OAAO;CACxC,MAAM,EAAE,kBAAkB,MAAM,OAAO;AAEvC,QAAO,IAAI,cADA,gBAAgB,CACC"}

package/dist/factory-PDXQdkLO.mjs

@@ -0,0 +1,72 @@
+import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
+
+//#region src/storage/factory.ts
+var factory_exports = /* @__PURE__ */ __exportAll({ createStorageBackend: () => createStorageBackend });
+/** Backoff schedule (ms) for the bounded CLI retry path. */
+const CLI_RETRY_DELAYS_MS = [
+	500,
+	1e3,
+	2e3
+];
+/** Backoff cap (ms) for the daemon's infinite retry path. */
+const DAEMON_RETRY_CAP_MS = 15e3;
+/**
+* Create and return the configured StorageBackend.
+*
+* Auto-behaviour:
+*  - storageBackend = "sqlite"   → SQLiteBackend always
+*  - storageBackend = "postgres" → PostgresBackend (retried; never falls back)
+*/
+async function createStorageBackend(config, opts = {}) {
+	if (config.storageBackend === "postgres") return await connectPostgres(config, opts.waitForPostgres ?? false);
+	return createSQLiteBackend();
+}
+/**
+* Attempt a single Postgres connection (ensure DB + test). Returns the live
+* backend on success, or an error string describing why it failed.
+*/
+async function attemptPostgres(config) {
+	const { PostgresBackend } = await import("./postgres-BJxiqtqg.mjs");
+	const pgConfig = config.postgres ?? {};
+	let backend = null;
+	try {
+		await PostgresBackend.ensureDatabase(pgConfig);
+		backend = new PostgresBackend(pgConfig);
+		const err = await backend.testConnection();
+		if (err) {
+			await backend.close().catch(() => {});
+			return { error: err };
+		}
+		return { backend };
+	} catch (e) {
+		if (backend) await backend.close().catch(() => {});
+		return { error: e instanceof Error ? e.message : String(e) };
+	}
+}
+async function connectPostgres(config, waitForever) {
+	let attempt = 0;
+	let lastError = "unknown error";
+	while (true) {
+		attempt++;
+		const result = await attemptPostgres(config);
+		if ("backend" in result) {
+			if (attempt > 1) process.stderr.write(`[pai-daemon] Connected to PostgreSQL backend (after ${attempt} attempts).\n`);
+			else process.stderr.write("[pai-daemon] Connected to PostgreSQL backend.\n");
+			return result.backend;
+		}
+		lastError = result.error;
+		if (!waitForever && attempt > CLI_RETRY_DELAYS_MS.length) throw new Error(`Postgres backend unreachable after ${attempt} attempts: ${lastError}. Is Docker Desktop / Postgres running? Refusing to fall back to SQLite (would split the corpus). Start Postgres and retry.`);
+		const delayMs = waitForever ? Math.min(DAEMON_RETRY_CAP_MS, 1e3 * 2 ** Math.min(attempt - 1, 4)) : CLI_RETRY_DELAYS_MS[attempt - 1];
+		process.stderr.write(`[pai-daemon] Postgres unavailable (${lastError}). Retry ${attempt}${waitForever ? "" : `/${CLI_RETRY_DELAYS_MS.length + 1}`} in ${delayMs}ms...\n`);
+		await new Promise((r) => setTimeout(r, delayMs));
+	}
+}
+async function createSQLiteBackend() {
+	const { openFederation } = await import("./db-CYmBWcjh.mjs").then((n) => n.t);
+	const { SQLiteBackend } = await import("./sqlite-Nw8ZW5Rj.mjs");
+	return new SQLiteBackend(openFederation());
+}
+
+//#endregion
+export { factory_exports as n, createStorageBackend as t };
+//# sourceMappingURL=factory-PDXQdkLO.mjs.map

package/dist/factory-PDXQdkLO.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"factory-PDXQdkLO.mjs","names":[],"sources":["../src/storage/factory.ts"],"sourcesContent":["/**\n * Storage backend factory.\n *\n * Reads the daemon config and returns the appropriate StorageBackend.\n *\n * When Postgres is the configured backend we NEVER silently fall back to\n * SQLite — doing so would split the corpus across two databases. Instead:\n *  - Daemon (waitForPostgres: true) retries Postgres forever with capped\n *    backoff until it comes up (handles the boot race where launchd starts\n *    the daemon before Docker Desktop / Postgres is ready).\n *  - CLI / one-shot callers (default) retry a few times, then throw a clear\n *    error rather than returning a wrong/empty SQLite database.\n */\n\nimport type { PaiDaemonConfig } from \"../daemon/config.js\";\nimport type { StorageBackend } from \"./interface.js\";\n\nexport interface StorageBackendOptions {\n  /**\n   * When true, retry Postgres indefinitely instead of giving up. Used by the\n   * long-lived daemon so a not-yet-ready Postgres at boot is tolerated.\n   * Defaults to false (one-shot CLI behaviour: bounded retries, then throw).\n   */\n  waitForPostgres?: boolean;\n}\n\n/** Backoff schedule (ms) for the bounded CLI retry path. */\nconst CLI_RETRY_DELAYS_MS = [500, 1_000, 2_000];\n\n/** Backoff cap (ms) for the daemon's infinite retry path. */\nconst DAEMON_RETRY_CAP_MS = 15_000;\n\n/**\n * Create and return the configured StorageBackend.\n *\n * Auto-behaviour:\n *  - storageBackend = \"sqlite\"   → SQLiteBackend always\n *  - storageBackend = \"postgres\" → PostgresBackend (retried; never falls back)\n */\nexport async function createStorageBackend(\n  config: PaiDaemonConfig,\n  opts: StorageBackendOptions = {}\n): Promise<StorageBackend> {\n  if (config.storageBackend === \"postgres\") {\n    return await connectPostgres(config, opts.waitForPostgres ?? false);\n  }\n\n  // Default: SQLite\n  return createSQLiteBackend();\n}\n\n/**\n * Attempt a single Postgres connection (ensure DB + test). Returns the live\n * backend on success, or an error string describing why it failed.\n */\nasync function attemptPostgres(\n  config: PaiDaemonConfig\n): Promise<{ backend: StorageBackend } | { error: string }> {\n  const { PostgresBackend } = await import(\"./postgres.js\");\n  const pgConfig = config.postgres ?? {};\n\n  let backend: InstanceType<typeof PostgresBackend> | null = null;\n  try {\n    // Ensure the per-user database exists and has the schema applied.\n    await PostgresBackend.ensureDatabase(pgConfig);\n\n    backend = new PostgresBackend(pgConfig);\n    const err = await backend.testConnection();\n    if (err) {\n      await backend.close().catch(() => {});\n      return { error: err };\n    }\n    return { backend };\n  } catch (e) {\n    if (backend) await backend.close().catch(() => {});\n    return { error: e instanceof Error ? e.message : String(e) };\n  }\n}\n\nasync function connectPostgres(\n  config: PaiDaemonConfig,\n  waitForever: boolean\n): Promise<StorageBackend> {\n  let attempt = 0;\n  let lastError = \"unknown error\";\n\n  // eslint-disable-next-line no-constant-condition\n  while (true) {\n    attempt++;\n    const result = await attemptPostgres(config);\n    if (\"backend\" in result) {\n      if (attempt > 1) {\n        process.stderr.write(\n          `[pai-daemon] Connected to PostgreSQL backend (after ${attempt} attempts).\\n`\n        );\n      } else {\n        process.stderr.write(\"[pai-daemon] Connected to PostgreSQL backend.\\n\");\n      }\n      return result.backend;\n    }\n\n    lastError = result.error;\n\n    if (!waitForever && attempt > CLI_RETRY_DELAYS_MS.length) {\n      // Bounded CLI path exhausted — fail loudly, never silently use SQLite.\n      throw new Error(\n        `Postgres backend unreachable after ${attempt} attempts: ${lastError}. ` +\n          `Is Docker Desktop / Postgres running? Refusing to fall back to SQLite ` +\n          `(would split the corpus). Start Postgres and retry.`\n      );\n    }\n\n    const delayMs = waitForever\n      ? Math.min(DAEMON_RETRY_CAP_MS, 1_000 * 2 ** Math.min(attempt - 1, 4))\n      : CLI_RETRY_DELAYS_MS[attempt - 1];\n\n    process.stderr.write(\n      `[pai-daemon] Postgres unavailable (${lastError}). ` +\n        `Retry ${attempt}${waitForever ? \"\" : `/${CLI_RETRY_DELAYS_MS.length + 1}`} ` +\n        `in ${delayMs}ms...\\n`\n    );\n    await new Promise((r) => setTimeout(r, delayMs));\n  }\n}\n\nasync function createSQLiteBackend(): Promise<StorageBackend> {\n  const { openFederation } = await import(\"../memory/db.js\");\n  const { SQLiteBackend } = await import(\"./sqlite.js\");\n  const db = openFederation();\n  return new SQLiteBackend(db);\n}\n"],"mappings":";;;;;AA2BA,MAAM,sBAAsB;CAAC;CAAK;CAAO;CAAM;;AAG/C,MAAM,sBAAsB;;;;;;;;AAS5B,eAAsB,qBACpB,QACA,OAA8B,EAAE,EACP;AACzB,KAAI,OAAO,mBAAmB,WAC5B,QAAO,MAAM,gBAAgB,QAAQ,KAAK,mBAAmB,MAAM;AAIrE,QAAO,qBAAqB;;;;;;AAO9B,eAAe,gBACb,QAC0D;CAC1D,MAAM,EAAE,oBAAoB,MAAM,OAAO;CACzC,MAAM,WAAW,OAAO,YAAY,EAAE;CAEtC,IAAI,UAAuD;AAC3D,KAAI;AAEF,QAAM,gBAAgB,eAAe,SAAS;AAE9C,YAAU,IAAI,gBAAgB,SAAS;EACvC,MAAM,MAAM,MAAM,QAAQ,gBAAgB;AAC1C,MAAI,KAAK;AACP,SAAM,QAAQ,OAAO,CAAC,YAAY,GAAG;AACrC,UAAO,EAAE,OAAO,KAAK;;AAEvB,SAAO,EAAE,SAAS;UACX,GAAG;AACV,MAAI,QAAS,OAAM,QAAQ,OAAO,CAAC,YAAY,GAAG;AAClD,SAAO,EAAE,OAAO,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE,EAAE;;;AAIhE,eAAe,gBACb,QACA,aACyB;CACzB,IAAI,UAAU;CACd,IAAI,YAAY;AAGhB,QAAO,MAAM;AACX;EACA,MAAM,SAAS,MAAM,gBAAgB,OAAO;AAC5C,MAAI,aAAa,QAAQ;AACvB,OAAI,UAAU,EACZ,SAAQ,OAAO,MACb,uDAAuD,QAAQ,eAChE;OAED,SAAQ,OAAO,MAAM,kDAAkD;AAEzE,UAAO,OAAO;;AAGhB,cAAY,OAAO;AAEnB,MAAI,CAAC,eAAe,UAAU,oBAAoB,OAEhD,OAAM,IAAI,MACR,sCAAsC,QAAQ,aAAa,UAAU,6HAGtE;EAGH,MAAM,UAAU,cACZ,KAAK,IAAI,qBAAqB,MAAQ,KAAK,KAAK,IAAI,UAAU,GAAG,EAAE,CAAC,GACpE,oBAAoB,UAAU;AAElC,UAAQ,OAAO,MACb,sCAAsC,UAAU,WACrC,UAAU,cAAc,KAAK,IAAI,oBAAoB,SAAS,IAAI,MACrE,QAAQ,SACjB;AACD,QAAM,IAAI,SAAS,MAAM,WAAW,GAAG,QAAQ,CAAC;;;AAIpD,eAAe,sBAA+C;CAC5D,MAAM,EAAE,mBAAmB,MAAM,OAAO;CACxC,MAAM,EAAE,kBAAkB,MAAM,OAAO;AAEvC,QAAO,IAAI,cADA,gBAAgB,CACC"}

package/dist/{helpers-IjZkXBhj.mjs → helpers-crDEr6S2.mjs}

@@ -425,4 +425,4 @@ const INDEX_YIELD_EVERY = 10;
 
 //#endregion
 export { parseSessionTitleChunk as a, yieldToEventLoop as c, sha256 as d, sha256File as f, isPathTooBroadForContentScan as i, chunkMarkdown as l, chunkId as n, walkContentFiles as o, detectTier as r, walkMdFiles as s, INDEX_YIELD_EVERY as t, estimateTokens as u };
-//# sourceMappingURL=helpers-IjZkXBhj.mjs.map
+//# sourceMappingURL=helpers-crDEr6S2.mjs.map