@remnic/core 9.3.612 → 9.3.614

package/dist/{capsule-crypto-7FJQINUR.js → capsule-crypto-YO5QJ6L3.js}

@@ -3,7 +3,7 @@ import {
   decryptCapsuleFileInMemory,
   encryptCapsuleFile,
   isEncryptedCapsuleFile
-} from "./chunk-X7Y7WX73.js";
+} from "./chunk-DQEMWVMT.js";
 import "./chunk-BJMBJZ2Y.js";
 import "./chunk-UKJAGEXH.js";
 import "./chunk-FP2373TW.js";
@@ -15,4 +15,4 @@ export {
   encryptCapsuleFile,
   isEncryptedCapsuleFile
 };
-//# sourceMappingURL=capsule-crypto-7FJQINUR.js.map
+//# sourceMappingURL=capsule-crypto-YO5QJ6L3.js.map

package/dist/causal-consolidation.d.ts

@@ -1,4 +1,4 @@
-import { GatewayConfig, PluginConfig, MemoryFile } from './types.js';
+import { GatewayConfig, AgentPersonaModelConfig, PluginConfig, MemoryFile } from './types.js';
 import { RolloutSummaryInput, MaterializeResult } from './connectors/codex-materialize.js';
 import './types-BliCnURB.js';
 import './index-DJ9QWMw-.js';
@@ -49,7 +49,10 @@ interface LlmConsolidationResult {
     }>;
 }
 interface ConsolidationLlmClient {
-    isAvailable(agentId?: string): boolean;
+    isAvailable(options?: {
+        agentId?: string;
+        modelChain?: AgentPersonaModelConfig;
+    }): boolean;
     chatCompletion(messages: Array<{
         role: "system" | "user" | "assistant";
         content: string;
@@ -57,6 +60,7 @@ interface ConsolidationLlmClient {
         temperature?: number;
         maxTokens?: number;
         agentId?: string;
+        modelChain?: AgentPersonaModelConfig;
     }): Promise<{
         content: string;
     } | null>;
@@ -71,6 +75,7 @@ declare function deriveCausalPromotionCandidates(options: {
     config: ConsolidationConfig;
     gatewayConfig?: GatewayConfig;
     gatewayAgentId?: string;
+    modelChain?: AgentPersonaModelConfig;
     workspaceDir?: string;
     pluginConfig?: PluginConfig;
     llmClient?: ConsolidationLlmClient;
@@ -84,6 +89,7 @@ declare function synthesizeCausalPreferencesViaLlm(options: {
     causalTrajectoryStoreDir?: string;
     gatewayConfig?: GatewayConfig;
     gatewayAgentId?: string;
+    modelChain?: AgentPersonaModelConfig;
     workspaceDir?: string;
     minTrajectories?: number;
 }): Promise<string | null>;

package/dist/causal-consolidation.js

@@ -4,27 +4,27 @@ import {
 } from "./chunk-EWC6W6AB.js";
 import {
   buildExtensionsBlockForConsolidation
-} from "./chunk-7DZRO2DC.js";
+} from "./chunk-DEPRLVLK.js";
 import {
   runPostConsolidationMaterialize
-} from "./chunk-NOMEVTUD.js";
+} from "./chunk-C6C7XVKG.js";
 import "./chunk-JFEKNTX7.js";
 import "./chunk-JLNBQWZ2.js";
 import "./chunk-3UXOZBHV.js";
 import {
   FallbackLlmClient,
   fallbackLlmRuntimeContextFromConfig
-} from "./chunk-CSKLPDN6.js";
+} from "./chunk-DEVUWMME.js";
 import "./chunk-B5XMS73R.js";
 import "./chunk-7SI52C65.js";
 import "./chunk-L2EXJQJP.js";
 import "./chunk-UZB5KHKX.js";
 import "./chunk-RK6F44Y6.js";
 import "./chunk-HQ6NIBL6.js";
-import "./chunk-YFS5OEKO.js";
+import "./chunk-7MLB4NCL.js";
 import "./chunk-5UZXUTVO.js";
 import "./chunk-4H5ZJHEN.js";
-import "./chunk-KGK2QKWL.js";
+import "./chunk-4R4KTDIE.js";
 import "./chunk-RULE4VG5.js";
 import "./chunk-SCU65EZI.js";
 import "./chunk-KILOTVIF.js";
@@ -142,13 +142,13 @@ Output valid JSON only:
 }
 
 If no clear patterns exist, return {"rules": [], "preferences": []}.`;
-async function consolidateWithLlm(context, llm, agentId) {
+async function consolidateWithLlm(context, llm, options = {}) {
   const response = await llm.chatCompletion(
     [
       { role: "system", content: CONSOLIDATION_PROMPT },
       { role: "user", content: context }
     ],
-    { temperature: 0.2, maxTokens: 2e3, agentId }
+    { temperature: 0.2, maxTokens: 2e3, agentId: options.agentId, modelChain: options.modelChain }
   );
   if (!response?.content) {
     return { rules: [], preferences: [] };
@@ -292,11 +292,12 @@ async function deriveCausalPromotionCandidates(options) {
         workspaceDir: options.workspaceDir ?? options.pluginConfig.workspaceDir
       }) : { workspaceDir: options.workspaceDir }
     );
-    if (!llm.isAvailable(options.gatewayAgentId)) {
+    const llmOptions = { agentId: options.gatewayAgentId, modelChain: options.modelChain };
+    if (!llm.isAvailable(llmOptions)) {
       log.debug("[cmc] no LLM available for consolidation \u2014 skipping");
       return [];
     }
-    const result = await consolidateWithLlm(context, llm, options.gatewayAgentId);
+    const result = await consolidateWithLlm(context, llm, llmOptions);
     const candidates = llmResultToCandidates(result);
     log.debug(`[cmc] LLM consolidation produced ${candidates.length} rule(s) and ${result.preferences.length} preference(s)`);
     return candidates;
@@ -315,8 +316,9 @@ async function synthesizeCausalPreferencesViaLlm(options) {
     const llm = new FallbackLlmClient(options.gatewayConfig, {
       workspaceDir: options.workspaceDir
     });
-    if (!llm.isAvailable(options.gatewayAgentId)) return null;
-    const result = await consolidateWithLlm(context, llm, options.gatewayAgentId);
+    const llmOptions = { agentId: options.gatewayAgentId, modelChain: options.modelChain };
+    if (!llm.isAvailable(llmOptions)) return null;
+    const result = await consolidateWithLlm(context, llm, llmOptions);
     if (result.preferences.length === 0 && result.rules.length === 0) return null;
     const lines = ["## Behavioral Insights (from Causal Chain Analysis)", ""];
     for (const pref of result.preferences) {

package/dist/causal-consolidation.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/causal-consolidation.ts"],"sourcesContent":["/**\n * causal-consolidation.ts — CMC Phase 2: LLM-Assisted Causal Consolidation\n *\n * Uses an LLM to analyze causal trajectory patterns across sessions.\n * The LLM receives the causal chain graph as context — connected trajectories\n * from different sessions — and identifies recurring behavioral patterns,\n * preference signals, and actionable rules.\n *\n * This is the core CMC innovation: the LLM gets cross-session causal context\n * that no other memory system provides. It can see that a user investigated\n * a bug in session 1, attempted a fix in session 2, and succeeded in session 3 —\n * and synthesize a rule or preference from that chain.\n */\n\nimport { createHash } from \"node:crypto\";\nimport { resolveCausalTrajectoryStoreDir, type CausalTrajectoryRecord } from \"./causal-trajectory.js\";\nimport { readChainIndex, resolveChainsDir, type CausalChainIndex, type CausalEdge } from \"./causal-chain.js\";\nimport { listJsonFiles, readJsonFile } from \"./json-store.js\";\nimport { isRecord } from \"./store-contract.js\";\nimport { FallbackLlmClient, fallbackLlmRuntimeContextFromConfig } from \"./fallback-llm.js\";\nimport type { GatewayConfig, MemoryFile, PluginConfig } from \"./types.js\";\nimport path from \"node:path\";\nimport { log } from \"./logger.js\";\nimport { runPostConsolidationMaterialize } from \"./connectors/codex-materialize-runner.js\";\nimport type { MaterializeResult, RolloutSummaryInput } from \"./connectors/codex-materialize.js\";\nimport { buildExtensionsBlockForConsolidation } from \"./semantic-consolidation.js\";\n\n// ─── Types ───────────────────────────────────────────────────────────────────\n\nexport interface CausalPatternCandidate {\n  id: string;\n  sourceType: \"causal-pattern\";\n  subject: string;\n  category: \"principle\" | \"rule\" | \"preference\";\n  content: string;\n  score: number;\n  rationale: string;\n  outcome: null;\n  provenance: string[];\n  agent: string | null;\n  workflow: string | null;\n}\n\nexport interface ConsolidationConfig {\n  minRecurrence: number;\n  minSessions: number;\n  successThreshold: number;\n}\n\nexport interface LlmConsolidationResult {\n  rules: Array<{\n    content: string;\n    category: \"rule\" | \"principle\" | \"preference\";\n    confidence: number;\n    evidence: string[];\n  }>;\n  preferences: Array<{\n    statement: string;\n    confidence: number;\n    evidence: string[];\n  }>;\n}\n\nconst CAUSAL_RULE_CATEGORIES = new Set([\"rule\", \"principle\", \"preference\"]);\n\ninterface ConsolidationLlmClient {\n  isAvailable(agentId?: string): boolean;\n  chatCompletion(\n    messages: Array<{ role: \"system\" | \"user\" | \"assistant\"; content: string }>,\n    options?: { temperature?: number; maxTokens?: number; agentId?: string },\n  ): Promise<{ content: string } | null>;\n}\n\n// ─── Trajectory Reading ──────────────────────────────────────────────────────\n\nasync function readAllTrajectories(\n  memoryDir: string,\n  causalTrajectoryStoreDir?: string,\n): Promise<CausalTrajectoryRecord[]> {\n  const root = resolveCausalTrajectoryStoreDir(memoryDir, causalTrajectoryStoreDir);\n  const trajectoriesDir = path.join(root, \"trajectories\");\n\n  const files = await listJsonFiles(trajectoriesDir).catch(() => [] as string[]);\n  const results: CausalTrajectoryRecord[] = [];\n\n  for (const filePath of files) {\n    try {\n      const raw = await readJsonFile(filePath);\n      if (isRecord(raw) && typeof raw.trajectoryId === \"string\") {\n        results.push(raw as unknown as CausalTrajectoryRecord);\n      }\n    } catch {\n      // skip invalid\n    }\n  }\n\n  return results;\n}\n\n// ─── Context Formatting ──────────────────────────────────────────────────────\n\n/**\n * Format trajectories and their causal connections as a readable context\n * for the LLM. Groups by session and shows chain connections.\n */\nfunction formatCausalContext(\n  trajectories: CausalTrajectoryRecord[],\n  chainIndex: CausalChainIndex,\n  maxChars: number = 8000,\n): string {\n  // Group trajectories by session\n  const bySession = new Map<string, CausalTrajectoryRecord[]>();\n  for (const t of trajectories) {\n    const list = bySession.get(t.sessionKey) ?? [];\n    list.push(t);\n    bySession.set(t.sessionKey, list);\n  }\n\n  const lines: string[] = [];\n  lines.push(`## Causal Trajectories (${trajectories.length} across ${bySession.size} sessions)`);\n  lines.push(\"\");\n\n  // Format each session's trajectories\n  for (const [sessionKey, sessionTrajs] of bySession) {\n    lines.push(`### Session: ${sessionKey}`);\n    for (const t of sessionTrajs.slice(0, 5)) {\n      const outcome = t.outcomeKind === \"success\" ? \"+\" : t.outcomeKind === \"failure\" ? \"-\" : \"~\";\n      lines.push(`[${outcome}] Goal: ${t.goal}`);\n      lines.push(`    Action: ${t.actionSummary}`);\n      lines.push(`    Outcome: ${t.outcomeSummary}`);\n      if (t.followUpSummary) lines.push(`    Follow-up: ${t.followUpSummary}`);\n      if (t.entityRefs?.length) lines.push(`    Entities: ${t.entityRefs.join(\", \")}`);\n    }\n    lines.push(\"\");\n  }\n\n  // Format causal chain connections\n  const edgeCount = Object.keys(chainIndex.edges).length;\n  if (edgeCount > 0) {\n    lines.push(`## Cross-Session Causal Chains (${edgeCount} connections)`);\n    lines.push(\"\");\n\n    const trajectoryMap = new Map(trajectories.map((t) => [t.trajectoryId, t]));\n    const shown = new Set<string>();\n\n    for (const [edgeId, edge] of Object.entries(chainIndex.edges)) {\n      if (shown.size >= 10) break; // limit output size\n      const from = trajectoryMap.get(edge.fromTrajectoryId);\n      const to = trajectoryMap.get(edge.toTrajectoryId);\n      if (!from || !to) continue;\n\n      lines.push(`${edge.edgeType}: \"${from.goal}\" (${from.sessionKey}) → \"${to.goal}\" (${to.sessionKey})`);\n      shown.add(edgeId);\n    }\n    lines.push(\"\");\n  }\n\n  const result = lines.join(\"\\n\");\n  return result.length > maxChars ? result.slice(0, maxChars) + \"\\n[truncated]\" : result;\n}\n\n// ─── LLM Consolidation ──────────────────────────────────────────────────────\n\nconst CONSOLIDATION_PROMPT = `You are analyzing a user's causal trajectory history across multiple sessions. Trajectories record what the user tried to do (goal), what they did (action), and what happened (outcome).\n\nYour job is to identify:\n1. BEHAVIORAL RULES: Recurring patterns where the same approach consistently succeeds or fails. These should be actionable guidance for future sessions.\n2. PREFERENCES: What the user cares about, prefers, or consistently chooses — even if never explicitly stated. Infer preferences from what they repeatedly do, retry until successful, or always include in their workflow.\n\nIMPORTANT:\n- Look for CROSS-SESSION patterns — things that repeat across different sessions are more significant than within-session patterns.\n- A user who retries the same goal across sessions has a strong implicit preference for that outcome.\n- Consistent action choices reveal preferences even when the user never says \"I prefer X.\"\n- Frame preferences as \"The user would prefer responses that...\" when applicable.\n\nOutput valid JSON only:\n{\n  \"rules\": [\n    {\"content\": \"actionable rule text\", \"category\": \"rule|principle\", \"confidence\": 0.0-1.0, \"evidence\": [\"trajectory IDs\"]}\n  ],\n  \"preferences\": [\n    {\"statement\": \"The user would prefer...\", \"confidence\": 0.0-1.0, \"evidence\": [\"trajectory IDs\"]}\n  ]\n}\n\nIf no clear patterns exist, return {\"rules\": [], \"preferences\": []}.`;\n\nasync function consolidateWithLlm(\n  context: string,\n  llm: ConsolidationLlmClient,\n  agentId?: string,\n): Promise<LlmConsolidationResult> {\n  const response = await llm.chatCompletion(\n    [\n      { role: \"system\", content: CONSOLIDATION_PROMPT },\n      { role: \"user\", content: context },\n    ],\n    { temperature: 0.2, maxTokens: 2000, agentId },\n  );\n\n  if (!response?.content) {\n    return { rules: [], preferences: [] };\n  }\n\n  try {\n    // Extract JSON from response (may have markdown code fences)\n    let jsonStr = response.content.trim();\n    const fenceMatch = jsonStr.match(/```(?:json)?\\s*\\n?([\\s\\S]*?)\\n?\\s*```/);\n    if (fenceMatch) jsonStr = fenceMatch[1];\n\n    const parsed = JSON.parse(jsonStr);\n    const rawRules: unknown[] = Array.isArray(parsed.rules) ? parsed.rules : [];\n    const rawPreferences: unknown[] = Array.isArray(parsed.preferences) ? parsed.preferences : [];\n    return {\n      rules: rawRules\n        .map(parseLlmRule)\n        .filter((rule): rule is LlmConsolidationResult[\"rules\"][number] => !!rule),\n      preferences: rawPreferences\n        .map(parseLlmPreference)\n        .filter((pref): pref is LlmConsolidationResult[\"preferences\"][number] => !!pref),\n    };\n  } catch {\n    log.warn(\"[cmc] failed to parse LLM consolidation response\");\n    return { rules: [], preferences: [] };\n  }\n}\n\n// ─── Candidate Generation ────────────────────────────────────────────────────\n\nfunction stablePatternId(content: string): string {\n  const digest = createHash(\"sha256\")\n    .update(`causal-pattern\\0${content}`)\n    .digest(\"hex\")\n    .slice(0, 16);\n  return `causal-pattern:${digest}`;\n}\n\nfunction parseConfidence(value: unknown): number | undefined {\n  if (typeof value !== \"number\" || !Number.isFinite(value)) return undefined;\n  return Math.max(0, Math.min(1, value));\n}\n\nfunction parseEvidence(value: unknown): string[] {\n  if (!Array.isArray(value)) return [];\n  return value.filter((item): item is string => typeof item === \"string\" && item.trim().length > 0);\n}\n\nfunction parseLlmRule(raw: unknown): LlmConsolidationResult[\"rules\"][number] | undefined {\n  if (!raw || typeof raw !== \"object\" || Array.isArray(raw)) return undefined;\n  const r = raw as Record<string, unknown>;\n  const content = typeof r.content === \"string\" ? r.content.trim() : \"\";\n  const category = typeof r.category === \"string\" ? r.category : \"\";\n  const confidence = parseConfidence(r.confidence);\n  if (content.length <= 5 || !CAUSAL_RULE_CATEGORIES.has(category) || confidence === undefined) {\n    return undefined;\n  }\n  return {\n    content,\n    category: category as \"rule\" | \"principle\" | \"preference\",\n    confidence,\n    evidence: parseEvidence(r.evidence),\n  };\n}\n\nfunction parseLlmPreference(raw: unknown): LlmConsolidationResult[\"preferences\"][number] | undefined {\n  if (!raw || typeof raw !== \"object\" || Array.isArray(raw)) return undefined;\n  const p = raw as Record<string, unknown>;\n  const statement = typeof p.statement === \"string\" ? p.statement.trim() : \"\";\n  const confidence = parseConfidence(p.confidence);\n  if (statement.length <= 5 || confidence === undefined) return undefined;\n  return {\n    statement,\n    confidence,\n    evidence: parseEvidence(p.evidence),\n  };\n}\n\nfunction llmResultToCandidates(result: LlmConsolidationResult): CausalPatternCandidate[] {\n  const candidates: CausalPatternCandidate[] = [];\n\n  for (const rule of result.rules) {\n    const category =\n      rule.category === \"principle\" || rule.category === \"preference\"\n        ? rule.category\n        : \"rule\";\n    candidates.push({\n      id: stablePatternId(rule.content),\n      sourceType: \"causal-pattern\",\n      subject: rule.content.slice(0, 80),\n      category,\n      content: rule.content,\n      score: Math.min(1, rule.confidence ?? 0.7),\n      rationale: \"LLM-identified causal pattern from cross-session trajectory analysis\",\n      outcome: null,\n      provenance: (rule.evidence ?? []).slice(0, 5),\n      agent: null,\n      workflow: null,\n    });\n  }\n\n  for (const preference of result.preferences) {\n    candidates.push({\n      id: stablePatternId(preference.statement),\n      sourceType: \"causal-pattern\",\n      subject: preference.statement.slice(0, 80),\n      category: \"preference\",\n      content: preference.statement,\n      score: Math.min(1, preference.confidence ?? 0.7),\n      rationale: \"LLM-identified preference from cross-session trajectory analysis\",\n      outcome: null,\n      provenance: (preference.evidence ?? []).slice(0, 5),\n      agent: null,\n      workflow: null,\n    });\n  }\n\n  return candidates;\n}\n\nfunction normalizePositiveInteger(value: number, fallback: number): number {\n  return Number.isFinite(value) && value > 0 ? Math.floor(value) : fallback;\n}\n\nfunction normalizeSuccessThreshold(value: number): number {\n  if (!Number.isFinite(value) || value <= 0) return 0;\n  return Math.min(1, value);\n}\n\nfunction trajectorySuccessScore(trajectory: CausalTrajectoryRecord): number {\n  if (trajectory.outcomeKind === \"success\") return 1;\n  if (trajectory.outcomeKind === \"partial\") return 0.5;\n  return 0;\n}\n\nfunction averageSuccessScore(trajectories: CausalTrajectoryRecord[]): number {\n  if (trajectories.length === 0) return 0;\n  const total = trajectories.reduce((sum, trajectory) => sum + trajectorySuccessScore(trajectory), 0);\n  return total / trajectories.length;\n}\n\nfunction passesConsolidationGates(\n  trajectories: CausalTrajectoryRecord[],\n  config: ConsolidationConfig,\n): boolean {\n  const minRecurrence = normalizePositiveInteger(config.minRecurrence, 1);\n  if (trajectories.length < minRecurrence) return false;\n\n  const minSessions = normalizePositiveInteger(config.minSessions, 1);\n  const sessionCount = new Set(trajectories.map((trajectory) => trajectory.sessionKey)).size;\n  if (sessionCount < minSessions) return false;\n\n  const successThreshold = normalizeSuccessThreshold(config.successThreshold);\n  if (successThreshold > 0 && averageSuccessScore(trajectories) < successThreshold) {\n    return false;\n  }\n\n  return true;\n}\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/**\n * Run LLM-assisted consolidation: read trajectories, format causal context,\n * ask LLM to identify patterns and preferences.\n */\nexport async function deriveCausalPromotionCandidates(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  config: ConsolidationConfig;\n  gatewayConfig?: GatewayConfig;\n  gatewayAgentId?: string;\n  workspaceDir?: string;\n  pluginConfig?: PluginConfig;\n  llmClient?: ConsolidationLlmClient;\n}): Promise<CausalPatternCandidate[]> {\n  try {\n    const trajectories = await readAllTrajectories(options.memoryDir, options.causalTrajectoryStoreDir);\n    if (!passesConsolidationGates(trajectories, options.config)) return [];\n\n    const chainsDir = resolveChainsDir(options.memoryDir, options.causalTrajectoryStoreDir);\n    const chainIndex = await readChainIndex(chainsDir);\n\n    // Format the causal context for the LLM\n    let context = formatCausalContext(trajectories, chainIndex);\n\n    // Append memory extensions block if available (#382)\n    if (options.pluginConfig) {\n      const extBlock = await buildExtensionsBlockForConsolidation(options.pluginConfig);\n      if (extBlock.length > 0) {\n        context += \"\\n\\n\" + extBlock;\n      }\n    }\n\n    // If no LLM available, fall back to empty (no deterministic fallback)\n    const llm = options.llmClient ?? new FallbackLlmClient(\n      options.gatewayConfig,\n      options.pluginConfig\n        ? fallbackLlmRuntimeContextFromConfig(options.pluginConfig, {\n            workspaceDir: options.workspaceDir ?? options.pluginConfig.workspaceDir,\n          })\n        : { workspaceDir: options.workspaceDir },\n    );\n    if (!llm.isAvailable(options.gatewayAgentId)) {\n      log.debug(\"[cmc] no LLM available for consolidation — skipping\");\n      return [];\n    }\n\n    // Call LLM for pattern analysis\n    const result = await consolidateWithLlm(context, llm, options.gatewayAgentId);\n    const candidates = llmResultToCandidates(result);\n\n    log.debug(`[cmc] LLM consolidation produced ${candidates.length} rule(s) and ${result.preferences.length} preference(s)`);\n    return candidates;\n  } catch (error) {\n    log.warn(`[cmc] consolidation failed (non-fatal): ${error instanceof Error ? error.message : String(error)}`);\n    return [];\n  }\n}\n\n/**\n * Get LLM-synthesized preferences from causal trajectory analysis.\n * Returns formatted preference statements for recall injection.\n */\nexport async function synthesizeCausalPreferencesViaLlm(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  gatewayConfig?: GatewayConfig;\n  gatewayAgentId?: string;\n  workspaceDir?: string;\n  minTrajectories?: number;\n}): Promise<string | null> {\n  try {\n    const trajectories = await readAllTrajectories(options.memoryDir, options.causalTrajectoryStoreDir);\n    if (trajectories.length < (options.minTrajectories ?? 2)) return null;\n\n    const chainsDir = resolveChainsDir(options.memoryDir, options.causalTrajectoryStoreDir);\n    const chainIndex = await readChainIndex(chainsDir);\n    const context = formatCausalContext(trajectories, chainIndex);\n\n    const llm = new FallbackLlmClient(options.gatewayConfig, {\n      workspaceDir: options.workspaceDir,\n    });\n    if (!llm.isAvailable(options.gatewayAgentId)) return null;\n\n    const result = await consolidateWithLlm(context, llm, options.gatewayAgentId);\n    if (result.preferences.length === 0 && result.rules.length === 0) return null;\n\n    const lines: string[] = [\"## Behavioral Insights (from Causal Chain Analysis)\", \"\"];\n\n    for (const pref of result.preferences) {\n      lines.push(`- ${pref.statement}`);\n    }\n\n    for (const rule of result.rules) {\n      lines.push(`- ${rule.content}`);\n    }\n\n    lines.push(\"\");\n    return lines.join(\"\\n\");\n  } catch (error) {\n    log.warn(`[cmc] preference synthesis failed (non-fatal): ${error instanceof Error ? error.message : String(error)}`);\n    return null;\n  }\n}\n\n/**\n * Optional post-consolidation hook — materializes Codex-native memory artifacts\n * after a causal consolidation run. Guarded by `codexMaterializeMemories` and\n * `codexMaterializeOnConsolidation`. Returns `null` when disabled or when the\n * sentinel is missing (honors user hand-edits).\n *\n * Split from the orchestrator-owned flow so #378 avoids touching\n * orchestrator.ts while Wave 1 edits are in flight.\n */\nexport async function materializeAfterCausalConsolidation(options: {\n  config: PluginConfig;\n  namespace?: string;\n  memories?: MemoryFile[];\n  memoryDir?: string;\n  codexHome?: string;\n  rolloutSummaries?: RolloutSummaryInput[];\n  now?: Date;\n}): Promise<MaterializeResult | null> {\n  // Delegates to the shared post-consolidation helper — see\n  // runPostConsolidationMaterialize in codex-materialize-runner.ts.\n  return runPostConsolidationMaterialize(\"[cmc]\", options);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAcA,SAAS,kBAAkB;AAO3B,OAAO,UAAU;AA0CjB,IAAM,yBAAyB,oBAAI,IAAI,CAAC,QAAQ,aAAa,YAAY,CAAC;AAY1E,eAAe,oBACb,WACA,0BACmC;AACnC,QAAM,OAAO,gCAAgC,WAAW,wBAAwB;AAChF,QAAM,kBAAkB,KAAK,KAAK,MAAM,cAAc;AAEtD,QAAM,QAAQ,MAAM,cAAc,eAAe,EAAE,MAAM,MAAM,CAAC,CAAa;AAC7E,QAAM,UAAoC,CAAC;AAE3C,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,YAAM,MAAM,MAAM,aAAa,QAAQ;AACvC,UAAI,SAAS,GAAG,KAAK,OAAO,IAAI,iBAAiB,UAAU;AACzD,gBAAQ,KAAK,GAAwC;AAAA,MACvD;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAAS,oBACP,cACA,YACA,WAAmB,KACX;AAER,QAAM,YAAY,oBAAI,IAAsC;AAC5D,aAAW,KAAK,cAAc;AAC5B,UAAM,OAAO,UAAU,IAAI,EAAE,UAAU,KAAK,CAAC;AAC7C,SAAK,KAAK,CAAC;AACX,cAAU,IAAI,EAAE,YAAY,IAAI;AAAA,EAClC;AAEA,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,2BAA2B,aAAa,MAAM,WAAW,UAAU,IAAI,YAAY;AAC9F,QAAM,KAAK,EAAE;AAGb,aAAW,CAAC,YAAY,YAAY,KAAK,WAAW;AAClD,UAAM,KAAK,gBAAgB,UAAU,EAAE;AACvC,eAAW,KAAK,aAAa,MAAM,GAAG,CAAC,GAAG;AACxC,YAAM,UAAU,EAAE,gBAAgB,YAAY,MAAM,EAAE,gBAAgB,YAAY,MAAM;AACxF,YAAM,KAAK,IAAI,OAAO,WAAW,EAAE,IAAI,EAAE;AACzC,YAAM,KAAK,eAAe,EAAE,aAAa,EAAE;AAC3C,YAAM,KAAK,gBAAgB,EAAE,cAAc,EAAE;AAC7C,UAAI,EAAE,gBAAiB,OAAM,KAAK,kBAAkB,EAAE,eAAe,EAAE;AACvE,UAAI,EAAE,YAAY,OAAQ,OAAM,KAAK,iBAAiB,EAAE,WAAW,KAAK,IAAI,CAAC,EAAE;AAAA,IACjF;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,YAAY,OAAO,KAAK,WAAW,KAAK,EAAE;AAChD,MAAI,YAAY,GAAG;AACjB,UAAM,KAAK,mCAAmC,SAAS,eAAe;AACtE,UAAM,KAAK,EAAE;AAEb,UAAM,gBAAgB,IAAI,IAAI,aAAa,IAAI,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;AAC1E,UAAM,QAAQ,oBAAI,IAAY;AAE9B,eAAW,CAAC,QAAQ,IAAI,KAAK,OAAO,QAAQ,WAAW,KAAK,GAAG;AAC7D,UAAI,MAAM,QAAQ,GAAI;AACtB,YAAM,OAAO,cAAc,IAAI,KAAK,gBAAgB;AACpD,YAAM,KAAK,cAAc,IAAI,KAAK,cAAc;AAChD,UAAI,CAAC,QAAQ,CAAC,GAAI;AAElB,YAAM,KAAK,GAAG,KAAK,QAAQ,MAAM,KAAK,IAAI,MAAM,KAAK,UAAU,aAAQ,GAAG,IAAI,MAAM,GAAG,UAAU,GAAG;AACpG,YAAM,IAAI,MAAM;AAAA,IAClB;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,SAAS,MAAM,KAAK,IAAI;AAC9B,SAAO,OAAO,SAAS,WAAW,OAAO,MAAM,GAAG,QAAQ,IAAI,kBAAkB;AAClF;AAIA,IAAM,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAwB7B,eAAe,mBACb,SACA,KACA,SACiC;AACjC,QAAM,WAAW,MAAM,IAAI;AAAA,IACzB;AAAA,MACE,EAAE,MAAM,UAAU,SAAS,qBAAqB;AAAA,MAChD,EAAE,MAAM,QAAQ,SAAS,QAAQ;AAAA,IACnC;AAAA,IACA,EAAE,aAAa,KAAK,WAAW,KAAM,QAAQ;AAAA,EAC/C;AAEA,MAAI,CAAC,UAAU,SAAS;AACtB,WAAO,EAAE,OAAO,CAAC,GAAG,aAAa,CAAC,EAAE;AAAA,EACtC;AAEA,MAAI;AAEF,QAAI,UAAU,SAAS,QAAQ,KAAK;AACpC,UAAM,aAAa,QAAQ,MAAM,uCAAuC;AACxE,QAAI,WAAY,WAAU,WAAW,CAAC;AAEtC,UAAM,SAAS,KAAK,MAAM,OAAO;AACjC,UAAM,WAAsB,MAAM,QAAQ,OAAO,KAAK,IAAI,OAAO,QAAQ,CAAC;AAC1E,UAAM,iBAA4B,MAAM,QAAQ,OAAO,WAAW,IAAI,OAAO,cAAc,CAAC;AAC5F,WAAO;AAAA,MACL,OAAO,SACJ,IAAI,YAAY,EAChB,OAAO,CAAC,SAA0D,CAAC,CAAC,IAAI;AAAA,MAC3E,aAAa,eACV,IAAI,kBAAkB,EACtB,OAAO,CAAC,SAAgE,CAAC,CAAC,IAAI;AAAA,IACnF;AAAA,EACF,QAAQ;AACN,QAAI,KAAK,kDAAkD;AAC3D,WAAO,EAAE,OAAO,CAAC,GAAG,aAAa,CAAC,EAAE;AAAA,EACtC;AACF;AAIA,SAAS,gBAAgB,SAAyB;AAChD,QAAM,SAAS,WAAW,QAAQ,EAC/B,OAAO,mBAAmB,OAAO,EAAE,EACnC,OAAO,KAAK,EACZ,MAAM,GAAG,EAAE;AACd,SAAO,kBAAkB,MAAM;AACjC;AAEA,SAAS,gBAAgB,OAAoC;AAC3D,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACjE,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAEA,SAAS,cAAc,OAA0B;AAC/C,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACnC,SAAO,MAAM,OAAO,CAAC,SAAyB,OAAO,SAAS,YAAY,KAAK,KAAK,EAAE,SAAS,CAAC;AAClG;AAEA,SAAS,aAAa,KAAmE;AACvF,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,EAAG,QAAO;AAClE,QAAM,IAAI;AACV,QAAM,UAAU,OAAO,EAAE,YAAY,WAAW,EAAE,QAAQ,KAAK,IAAI;AACnE,QAAM,WAAW,OAAO,EAAE,aAAa,WAAW,EAAE,WAAW;AAC/D,QAAM,aAAa,gBAAgB,EAAE,UAAU;AAC/C,MAAI,QAAQ,UAAU,KAAK,CAAC,uBAAuB,IAAI,QAAQ,KAAK,eAAe,QAAW;AAC5F,WAAO;AAAA,EACT;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,cAAc,EAAE,QAAQ;AAAA,EACpC;AACF;AAEA,SAAS,mBAAmB,KAAyE;AACnG,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,EAAG,QAAO;AAClE,QAAM,IAAI;AACV,QAAM,YAAY,OAAO,EAAE,cAAc,WAAW,EAAE,UAAU,KAAK,IAAI;AACzE,QAAM,aAAa,gBAAgB,EAAE,UAAU;AAC/C,MAAI,UAAU,UAAU,KAAK,eAAe,OAAW,QAAO;AAC9D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,UAAU,cAAc,EAAE,QAAQ;AAAA,EACpC;AACF;AAEA,SAAS,sBAAsB,QAA0D;AACvF,QAAM,aAAuC,CAAC;AAE9C,aAAW,QAAQ,OAAO,OAAO;AAC/B,UAAM,WACJ,KAAK,aAAa,eAAe,KAAK,aAAa,eAC/C,KAAK,WACL;AACN,eAAW,KAAK;AAAA,MACd,IAAI,gBAAgB,KAAK,OAAO;AAAA,MAChC,YAAY;AAAA,MACZ,SAAS,KAAK,QAAQ,MAAM,GAAG,EAAE;AAAA,MACjC;AAAA,MACA,SAAS,KAAK;AAAA,MACd,OAAO,KAAK,IAAI,GAAG,KAAK,cAAc,GAAG;AAAA,MACzC,WAAW;AAAA,MACX,SAAS;AAAA,MACT,aAAa,KAAK,YAAY,CAAC,GAAG,MAAM,GAAG,CAAC;AAAA,MAC5C,OAAO;AAAA,MACP,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAEA,aAAW,cAAc,OAAO,aAAa;AAC3C,eAAW,KAAK;AAAA,MACd,IAAI,gBAAgB,WAAW,SAAS;AAAA,MACxC,YAAY;AAAA,MACZ,SAAS,WAAW,UAAU,MAAM,GAAG,EAAE;AAAA,MACzC,UAAU;AAAA,MACV,SAAS,WAAW;AAAA,MACpB,OAAO,KAAK,IAAI,GAAG,WAAW,cAAc,GAAG;AAAA,MAC/C,WAAW;AAAA,MACX,SAAS;AAAA,MACT,aAAa,WAAW,YAAY,CAAC,GAAG,MAAM,GAAG,CAAC;AAAA,MAClD,OAAO;AAAA,MACP,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,yBAAyB,OAAe,UAA0B;AACzE,SAAO,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,IAAI;AACnE;AAEA,SAAS,0BAA0B,OAAuB;AACxD,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,EAAG,QAAO;AAClD,SAAO,KAAK,IAAI,GAAG,KAAK;AAC1B;AAEA,SAAS,uBAAuB,YAA4C;AAC1E,MAAI,WAAW,gBAAgB,UAAW,QAAO;AACjD,MAAI,WAAW,gBAAgB,UAAW,QAAO;AACjD,SAAO;AACT;AAEA,SAAS,oBAAoB,cAAgD;AAC3E,MAAI,aAAa,WAAW,EAAG,QAAO;AACtC,QAAM,QAAQ,aAAa,OAAO,CAAC,KAAK,eAAe,MAAM,uBAAuB,UAAU,GAAG,CAAC;AAClG,SAAO,QAAQ,aAAa;AAC9B;AAEA,SAAS,yBACP,cACA,QACS;AACT,QAAM,gBAAgB,yBAAyB,OAAO,eAAe,CAAC;AACtE,MAAI,aAAa,SAAS,cAAe,QAAO;AAEhD,QAAM,cAAc,yBAAyB,OAAO,aAAa,CAAC;AAClE,QAAM,eAAe,IAAI,IAAI,aAAa,IAAI,CAAC,eAAe,WAAW,UAAU,CAAC,EAAE;AACtF,MAAI,eAAe,YAAa,QAAO;AAEvC,QAAM,mBAAmB,0BAA0B,OAAO,gBAAgB;AAC1E,MAAI,mBAAmB,KAAK,oBAAoB,YAAY,IAAI,kBAAkB;AAChF,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAQA,eAAsB,gCAAgC,SAShB;AACpC,MAAI;AACF,UAAM,eAAe,MAAM,oBAAoB,QAAQ,WAAW,QAAQ,wBAAwB;AAClG,QAAI,CAAC,yBAAyB,cAAc,QAAQ,MAAM,EAAG,QAAO,CAAC;AAErE,UAAM,YAAY,iBAAiB,QAAQ,WAAW,QAAQ,wBAAwB;AACtF,UAAM,aAAa,MAAM,eAAe,SAAS;AAGjD,QAAI,UAAU,oBAAoB,cAAc,UAAU;AAG1D,QAAI,QAAQ,cAAc;AACxB,YAAM,WAAW,MAAM,qCAAqC,QAAQ,YAAY;AAChF,UAAI,SAAS,SAAS,GAAG;AACvB,mBAAW,SAAS;AAAA,MACtB;AAAA,IACF;AAGA,UAAM,MAAM,QAAQ,aAAa,IAAI;AAAA,MACnC,QAAQ;AAAA,MACR,QAAQ,eACJ,oCAAoC,QAAQ,cAAc;AAAA,QACxD,cAAc,QAAQ,gBAAgB,QAAQ,aAAa;AAAA,MAC7D,CAAC,IACD,EAAE,cAAc,QAAQ,aAAa;AAAA,IAC3C;AACA,QAAI,CAAC,IAAI,YAAY,QAAQ,cAAc,GAAG;AAC5C,UAAI,MAAM,0DAAqD;AAC/D,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,SAAS,MAAM,mBAAmB,SAAS,KAAK,QAAQ,cAAc;AAC5E,UAAM,aAAa,sBAAsB,MAAM;AAE/C,QAAI,MAAM,oCAAoC,WAAW,MAAM,gBAAgB,OAAO,YAAY,MAAM,gBAAgB;AACxH,WAAO;AAAA,EACT,SAAS,OAAO;AACd,QAAI,KAAK,2CAA2C,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAC5G,WAAO,CAAC;AAAA,EACV;AACF;AAMA,eAAsB,kCAAkC,SAO7B;AACzB,MAAI;AACF,UAAM,eAAe,MAAM,oBAAoB,QAAQ,WAAW,QAAQ,wBAAwB;AAClG,QAAI,aAAa,UAAU,QAAQ,mBAAmB,GAAI,QAAO;AAEjE,UAAM,YAAY,iBAAiB,QAAQ,WAAW,QAAQ,wBAAwB;AACtF,UAAM,aAAa,MAAM,eAAe,SAAS;AACjD,UAAM,UAAU,oBAAoB,cAAc,UAAU;AAE5D,UAAM,MAAM,IAAI,kBAAkB,QAAQ,eAAe;AAAA,MACvD,cAAc,QAAQ;AAAA,IACxB,CAAC;AACD,QAAI,CAAC,IAAI,YAAY,QAAQ,cAAc,EAAG,QAAO;AAErD,UAAM,SAAS,MAAM,mBAAmB,SAAS,KAAK,QAAQ,cAAc;AAC5E,QAAI,OAAO,YAAY,WAAW,KAAK,OAAO,MAAM,WAAW,EAAG,QAAO;AAEzE,UAAM,QAAkB,CAAC,uDAAuD,EAAE;AAElF,eAAW,QAAQ,OAAO,aAAa;AACrC,YAAM,KAAK,KAAK,KAAK,SAAS,EAAE;AAAA,IAClC;AAEA,eAAW,QAAQ,OAAO,OAAO;AAC/B,YAAM,KAAK,KAAK,KAAK,OAAO,EAAE;AAAA,IAChC;AAEA,UAAM,KAAK,EAAE;AACb,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB,SAAS,OAAO;AACd,QAAI,KAAK,kDAAkD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AACnH,WAAO;AAAA,EACT;AACF;AAWA,eAAsB,oCAAoC,SAQpB;AAGpC,SAAO,gCAAgC,SAAS,OAAO;AACzD;","names":[]}
+{"version":3,"sources":["../src/causal-consolidation.ts"],"sourcesContent":["/**\n * causal-consolidation.ts — CMC Phase 2: LLM-Assisted Causal Consolidation\n *\n * Uses an LLM to analyze causal trajectory patterns across sessions.\n * The LLM receives the causal chain graph as context — connected trajectories\n * from different sessions — and identifies recurring behavioral patterns,\n * preference signals, and actionable rules.\n *\n * This is the core CMC innovation: the LLM gets cross-session causal context\n * that no other memory system provides. It can see that a user investigated\n * a bug in session 1, attempted a fix in session 2, and succeeded in session 3 —\n * and synthesize a rule or preference from that chain.\n */\n\nimport { createHash } from \"node:crypto\";\nimport { resolveCausalTrajectoryStoreDir, type CausalTrajectoryRecord } from \"./causal-trajectory.js\";\nimport { readChainIndex, resolveChainsDir, type CausalChainIndex, type CausalEdge } from \"./causal-chain.js\";\nimport { listJsonFiles, readJsonFile } from \"./json-store.js\";\nimport { isRecord } from \"./store-contract.js\";\nimport { FallbackLlmClient, fallbackLlmRuntimeContextFromConfig } from \"./fallback-llm.js\";\nimport type { AgentPersonaModelConfig, GatewayConfig, MemoryFile, PluginConfig } from \"./types.js\";\nimport path from \"node:path\";\nimport { log } from \"./logger.js\";\nimport { runPostConsolidationMaterialize } from \"./connectors/codex-materialize-runner.js\";\nimport type { MaterializeResult, RolloutSummaryInput } from \"./connectors/codex-materialize.js\";\nimport { buildExtensionsBlockForConsolidation } from \"./semantic-consolidation.js\";\n\n// ─── Types ───────────────────────────────────────────────────────────────────\n\nexport interface CausalPatternCandidate {\n  id: string;\n  sourceType: \"causal-pattern\";\n  subject: string;\n  category: \"principle\" | \"rule\" | \"preference\";\n  content: string;\n  score: number;\n  rationale: string;\n  outcome: null;\n  provenance: string[];\n  agent: string | null;\n  workflow: string | null;\n}\n\nexport interface ConsolidationConfig {\n  minRecurrence: number;\n  minSessions: number;\n  successThreshold: number;\n}\n\nexport interface LlmConsolidationResult {\n  rules: Array<{\n    content: string;\n    category: \"rule\" | \"principle\" | \"preference\";\n    confidence: number;\n    evidence: string[];\n  }>;\n  preferences: Array<{\n    statement: string;\n    confidence: number;\n    evidence: string[];\n  }>;\n}\n\nconst CAUSAL_RULE_CATEGORIES = new Set([\"rule\", \"principle\", \"preference\"]);\n\ninterface ConsolidationLlmClient {\n  isAvailable(options?: { agentId?: string; modelChain?: AgentPersonaModelConfig }): boolean;\n  chatCompletion(\n    messages: Array<{ role: \"system\" | \"user\" | \"assistant\"; content: string }>,\n    options?: { temperature?: number; maxTokens?: number; agentId?: string; modelChain?: AgentPersonaModelConfig },\n  ): Promise<{ content: string } | null>;\n}\n\n// ─── Trajectory Reading ──────────────────────────────────────────────────────\n\nasync function readAllTrajectories(\n  memoryDir: string,\n  causalTrajectoryStoreDir?: string,\n): Promise<CausalTrajectoryRecord[]> {\n  const root = resolveCausalTrajectoryStoreDir(memoryDir, causalTrajectoryStoreDir);\n  const trajectoriesDir = path.join(root, \"trajectories\");\n\n  const files = await listJsonFiles(trajectoriesDir).catch(() => [] as string[]);\n  const results: CausalTrajectoryRecord[] = [];\n\n  for (const filePath of files) {\n    try {\n      const raw = await readJsonFile(filePath);\n      if (isRecord(raw) && typeof raw.trajectoryId === \"string\") {\n        results.push(raw as unknown as CausalTrajectoryRecord);\n      }\n    } catch {\n      // skip invalid\n    }\n  }\n\n  return results;\n}\n\n// ─── Context Formatting ──────────────────────────────────────────────────────\n\n/**\n * Format trajectories and their causal connections as a readable context\n * for the LLM. Groups by session and shows chain connections.\n */\nfunction formatCausalContext(\n  trajectories: CausalTrajectoryRecord[],\n  chainIndex: CausalChainIndex,\n  maxChars: number = 8000,\n): string {\n  // Group trajectories by session\n  const bySession = new Map<string, CausalTrajectoryRecord[]>();\n  for (const t of trajectories) {\n    const list = bySession.get(t.sessionKey) ?? [];\n    list.push(t);\n    bySession.set(t.sessionKey, list);\n  }\n\n  const lines: string[] = [];\n  lines.push(`## Causal Trajectories (${trajectories.length} across ${bySession.size} sessions)`);\n  lines.push(\"\");\n\n  // Format each session's trajectories\n  for (const [sessionKey, sessionTrajs] of bySession) {\n    lines.push(`### Session: ${sessionKey}`);\n    for (const t of sessionTrajs.slice(0, 5)) {\n      const outcome = t.outcomeKind === \"success\" ? \"+\" : t.outcomeKind === \"failure\" ? \"-\" : \"~\";\n      lines.push(`[${outcome}] Goal: ${t.goal}`);\n      lines.push(`    Action: ${t.actionSummary}`);\n      lines.push(`    Outcome: ${t.outcomeSummary}`);\n      if (t.followUpSummary) lines.push(`    Follow-up: ${t.followUpSummary}`);\n      if (t.entityRefs?.length) lines.push(`    Entities: ${t.entityRefs.join(\", \")}`);\n    }\n    lines.push(\"\");\n  }\n\n  // Format causal chain connections\n  const edgeCount = Object.keys(chainIndex.edges).length;\n  if (edgeCount > 0) {\n    lines.push(`## Cross-Session Causal Chains (${edgeCount} connections)`);\n    lines.push(\"\");\n\n    const trajectoryMap = new Map(trajectories.map((t) => [t.trajectoryId, t]));\n    const shown = new Set<string>();\n\n    for (const [edgeId, edge] of Object.entries(chainIndex.edges)) {\n      if (shown.size >= 10) break; // limit output size\n      const from = trajectoryMap.get(edge.fromTrajectoryId);\n      const to = trajectoryMap.get(edge.toTrajectoryId);\n      if (!from || !to) continue;\n\n      lines.push(`${edge.edgeType}: \"${from.goal}\" (${from.sessionKey}) → \"${to.goal}\" (${to.sessionKey})`);\n      shown.add(edgeId);\n    }\n    lines.push(\"\");\n  }\n\n  const result = lines.join(\"\\n\");\n  return result.length > maxChars ? result.slice(0, maxChars) + \"\\n[truncated]\" : result;\n}\n\n// ─── LLM Consolidation ──────────────────────────────────────────────────────\n\nconst CONSOLIDATION_PROMPT = `You are analyzing a user's causal trajectory history across multiple sessions. Trajectories record what the user tried to do (goal), what they did (action), and what happened (outcome).\n\nYour job is to identify:\n1. BEHAVIORAL RULES: Recurring patterns where the same approach consistently succeeds or fails. These should be actionable guidance for future sessions.\n2. PREFERENCES: What the user cares about, prefers, or consistently chooses — even if never explicitly stated. Infer preferences from what they repeatedly do, retry until successful, or always include in their workflow.\n\nIMPORTANT:\n- Look for CROSS-SESSION patterns — things that repeat across different sessions are more significant than within-session patterns.\n- A user who retries the same goal across sessions has a strong implicit preference for that outcome.\n- Consistent action choices reveal preferences even when the user never says \"I prefer X.\"\n- Frame preferences as \"The user would prefer responses that...\" when applicable.\n\nOutput valid JSON only:\n{\n  \"rules\": [\n    {\"content\": \"actionable rule text\", \"category\": \"rule|principle\", \"confidence\": 0.0-1.0, \"evidence\": [\"trajectory IDs\"]}\n  ],\n  \"preferences\": [\n    {\"statement\": \"The user would prefer...\", \"confidence\": 0.0-1.0, \"evidence\": [\"trajectory IDs\"]}\n  ]\n}\n\nIf no clear patterns exist, return {\"rules\": [], \"preferences\": []}.`;\n\nasync function consolidateWithLlm(\n  context: string,\n  llm: ConsolidationLlmClient,\n  options: { agentId?: string; modelChain?: AgentPersonaModelConfig } = {},\n): Promise<LlmConsolidationResult> {\n  const response = await llm.chatCompletion(\n    [\n      { role: \"system\", content: CONSOLIDATION_PROMPT },\n      { role: \"user\", content: context },\n    ],\n    { temperature: 0.2, maxTokens: 2000, agentId: options.agentId, modelChain: options.modelChain },\n  );\n\n  if (!response?.content) {\n    return { rules: [], preferences: [] };\n  }\n\n  try {\n    // Extract JSON from response (may have markdown code fences)\n    let jsonStr = response.content.trim();\n    const fenceMatch = jsonStr.match(/```(?:json)?\\s*\\n?([\\s\\S]*?)\\n?\\s*```/);\n    if (fenceMatch) jsonStr = fenceMatch[1];\n\n    const parsed = JSON.parse(jsonStr);\n    const rawRules: unknown[] = Array.isArray(parsed.rules) ? parsed.rules : [];\n    const rawPreferences: unknown[] = Array.isArray(parsed.preferences) ? parsed.preferences : [];\n    return {\n      rules: rawRules\n        .map(parseLlmRule)\n        .filter((rule): rule is LlmConsolidationResult[\"rules\"][number] => !!rule),\n      preferences: rawPreferences\n        .map(parseLlmPreference)\n        .filter((pref): pref is LlmConsolidationResult[\"preferences\"][number] => !!pref),\n    };\n  } catch {\n    log.warn(\"[cmc] failed to parse LLM consolidation response\");\n    return { rules: [], preferences: [] };\n  }\n}\n\n// ─── Candidate Generation ────────────────────────────────────────────────────\n\nfunction stablePatternId(content: string): string {\n  const digest = createHash(\"sha256\")\n    .update(`causal-pattern\\0${content}`)\n    .digest(\"hex\")\n    .slice(0, 16);\n  return `causal-pattern:${digest}`;\n}\n\nfunction parseConfidence(value: unknown): number | undefined {\n  if (typeof value !== \"number\" || !Number.isFinite(value)) return undefined;\n  return Math.max(0, Math.min(1, value));\n}\n\nfunction parseEvidence(value: unknown): string[] {\n  if (!Array.isArray(value)) return [];\n  return value.filter((item): item is string => typeof item === \"string\" && item.trim().length > 0);\n}\n\nfunction parseLlmRule(raw: unknown): LlmConsolidationResult[\"rules\"][number] | undefined {\n  if (!raw || typeof raw !== \"object\" || Array.isArray(raw)) return undefined;\n  const r = raw as Record<string, unknown>;\n  const content = typeof r.content === \"string\" ? r.content.trim() : \"\";\n  const category = typeof r.category === \"string\" ? r.category : \"\";\n  const confidence = parseConfidence(r.confidence);\n  if (content.length <= 5 || !CAUSAL_RULE_CATEGORIES.has(category) || confidence === undefined) {\n    return undefined;\n  }\n  return {\n    content,\n    category: category as \"rule\" | \"principle\" | \"preference\",\n    confidence,\n    evidence: parseEvidence(r.evidence),\n  };\n}\n\nfunction parseLlmPreference(raw: unknown): LlmConsolidationResult[\"preferences\"][number] | undefined {\n  if (!raw || typeof raw !== \"object\" || Array.isArray(raw)) return undefined;\n  const p = raw as Record<string, unknown>;\n  const statement = typeof p.statement === \"string\" ? p.statement.trim() : \"\";\n  const confidence = parseConfidence(p.confidence);\n  if (statement.length <= 5 || confidence === undefined) return undefined;\n  return {\n    statement,\n    confidence,\n    evidence: parseEvidence(p.evidence),\n  };\n}\n\nfunction llmResultToCandidates(result: LlmConsolidationResult): CausalPatternCandidate[] {\n  const candidates: CausalPatternCandidate[] = [];\n\n  for (const rule of result.rules) {\n    const category =\n      rule.category === \"principle\" || rule.category === \"preference\"\n        ? rule.category\n        : \"rule\";\n    candidates.push({\n      id: stablePatternId(rule.content),\n      sourceType: \"causal-pattern\",\n      subject: rule.content.slice(0, 80),\n      category,\n      content: rule.content,\n      score: Math.min(1, rule.confidence ?? 0.7),\n      rationale: \"LLM-identified causal pattern from cross-session trajectory analysis\",\n      outcome: null,\n      provenance: (rule.evidence ?? []).slice(0, 5),\n      agent: null,\n      workflow: null,\n    });\n  }\n\n  for (const preference of result.preferences) {\n    candidates.push({\n      id: stablePatternId(preference.statement),\n      sourceType: \"causal-pattern\",\n      subject: preference.statement.slice(0, 80),\n      category: \"preference\",\n      content: preference.statement,\n      score: Math.min(1, preference.confidence ?? 0.7),\n      rationale: \"LLM-identified preference from cross-session trajectory analysis\",\n      outcome: null,\n      provenance: (preference.evidence ?? []).slice(0, 5),\n      agent: null,\n      workflow: null,\n    });\n  }\n\n  return candidates;\n}\n\nfunction normalizePositiveInteger(value: number, fallback: number): number {\n  return Number.isFinite(value) && value > 0 ? Math.floor(value) : fallback;\n}\n\nfunction normalizeSuccessThreshold(value: number): number {\n  if (!Number.isFinite(value) || value <= 0) return 0;\n  return Math.min(1, value);\n}\n\nfunction trajectorySuccessScore(trajectory: CausalTrajectoryRecord): number {\n  if (trajectory.outcomeKind === \"success\") return 1;\n  if (trajectory.outcomeKind === \"partial\") return 0.5;\n  return 0;\n}\n\nfunction averageSuccessScore(trajectories: CausalTrajectoryRecord[]): number {\n  if (trajectories.length === 0) return 0;\n  const total = trajectories.reduce((sum, trajectory) => sum + trajectorySuccessScore(trajectory), 0);\n  return total / trajectories.length;\n}\n\nfunction passesConsolidationGates(\n  trajectories: CausalTrajectoryRecord[],\n  config: ConsolidationConfig,\n): boolean {\n  const minRecurrence = normalizePositiveInteger(config.minRecurrence, 1);\n  if (trajectories.length < minRecurrence) return false;\n\n  const minSessions = normalizePositiveInteger(config.minSessions, 1);\n  const sessionCount = new Set(trajectories.map((trajectory) => trajectory.sessionKey)).size;\n  if (sessionCount < minSessions) return false;\n\n  const successThreshold = normalizeSuccessThreshold(config.successThreshold);\n  if (successThreshold > 0 && averageSuccessScore(trajectories) < successThreshold) {\n    return false;\n  }\n\n  return true;\n}\n\n// ─── Public API ──────────────────────────────────────────────────────────────\n\n/**\n * Run LLM-assisted consolidation: read trajectories, format causal context,\n * ask LLM to identify patterns and preferences.\n */\nexport async function deriveCausalPromotionCandidates(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  config: ConsolidationConfig;\n  gatewayConfig?: GatewayConfig;\n  gatewayAgentId?: string;\n  modelChain?: AgentPersonaModelConfig;\n  workspaceDir?: string;\n  pluginConfig?: PluginConfig;\n  llmClient?: ConsolidationLlmClient;\n}): Promise<CausalPatternCandidate[]> {\n  try {\n    const trajectories = await readAllTrajectories(options.memoryDir, options.causalTrajectoryStoreDir);\n    if (!passesConsolidationGates(trajectories, options.config)) return [];\n\n    const chainsDir = resolveChainsDir(options.memoryDir, options.causalTrajectoryStoreDir);\n    const chainIndex = await readChainIndex(chainsDir);\n\n    // Format the causal context for the LLM\n    let context = formatCausalContext(trajectories, chainIndex);\n\n    // Append memory extensions block if available (#382)\n    if (options.pluginConfig) {\n      const extBlock = await buildExtensionsBlockForConsolidation(options.pluginConfig);\n      if (extBlock.length > 0) {\n        context += \"\\n\\n\" + extBlock;\n      }\n    }\n\n    // If no LLM available, fall back to empty (no deterministic fallback)\n    const llm = options.llmClient ?? new FallbackLlmClient(\n      options.gatewayConfig,\n      options.pluginConfig\n        ? fallbackLlmRuntimeContextFromConfig(options.pluginConfig, {\n            workspaceDir: options.workspaceDir ?? options.pluginConfig.workspaceDir,\n          })\n        : { workspaceDir: options.workspaceDir },\n    );\n    const llmOptions = { agentId: options.gatewayAgentId, modelChain: options.modelChain };\n    if (!llm.isAvailable(llmOptions)) {\n      log.debug(\"[cmc] no LLM available for consolidation — skipping\");\n      return [];\n    }\n\n    // Call LLM for pattern analysis\n    const result = await consolidateWithLlm(context, llm, llmOptions);\n    const candidates = llmResultToCandidates(result);\n\n    log.debug(`[cmc] LLM consolidation produced ${candidates.length} rule(s) and ${result.preferences.length} preference(s)`);\n    return candidates;\n  } catch (error) {\n    log.warn(`[cmc] consolidation failed (non-fatal): ${error instanceof Error ? error.message : String(error)}`);\n    return [];\n  }\n}\n\n/**\n * Get LLM-synthesized preferences from causal trajectory analysis.\n * Returns formatted preference statements for recall injection.\n */\nexport async function synthesizeCausalPreferencesViaLlm(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  gatewayConfig?: GatewayConfig;\n  gatewayAgentId?: string;\n  modelChain?: AgentPersonaModelConfig;\n  workspaceDir?: string;\n  minTrajectories?: number;\n}): Promise<string | null> {\n  try {\n    const trajectories = await readAllTrajectories(options.memoryDir, options.causalTrajectoryStoreDir);\n    if (trajectories.length < (options.minTrajectories ?? 2)) return null;\n\n    const chainsDir = resolveChainsDir(options.memoryDir, options.causalTrajectoryStoreDir);\n    const chainIndex = await readChainIndex(chainsDir);\n    const context = formatCausalContext(trajectories, chainIndex);\n\n    const llm = new FallbackLlmClient(options.gatewayConfig, {\n      workspaceDir: options.workspaceDir,\n    });\n    const llmOptions = { agentId: options.gatewayAgentId, modelChain: options.modelChain };\n    if (!llm.isAvailable(llmOptions)) return null;\n\n    const result = await consolidateWithLlm(context, llm, llmOptions);\n    if (result.preferences.length === 0 && result.rules.length === 0) return null;\n\n    const lines: string[] = [\"## Behavioral Insights (from Causal Chain Analysis)\", \"\"];\n\n    for (const pref of result.preferences) {\n      lines.push(`- ${pref.statement}`);\n    }\n\n    for (const rule of result.rules) {\n      lines.push(`- ${rule.content}`);\n    }\n\n    lines.push(\"\");\n    return lines.join(\"\\n\");\n  } catch (error) {\n    log.warn(`[cmc] preference synthesis failed (non-fatal): ${error instanceof Error ? error.message : String(error)}`);\n    return null;\n  }\n}\n\n/**\n * Optional post-consolidation hook — materializes Codex-native memory artifacts\n * after a causal consolidation run. Guarded by `codexMaterializeMemories` and\n * `codexMaterializeOnConsolidation`. Returns `null` when disabled or when the\n * sentinel is missing (honors user hand-edits).\n *\n * Split from the orchestrator-owned flow so #378 avoids touching\n * orchestrator.ts while Wave 1 edits are in flight.\n */\nexport async function materializeAfterCausalConsolidation(options: {\n  config: PluginConfig;\n  namespace?: string;\n  memories?: MemoryFile[];\n  memoryDir?: string;\n  codexHome?: string;\n  rolloutSummaries?: RolloutSummaryInput[];\n  now?: Date;\n}): Promise<MaterializeResult | null> {\n  // Delegates to the shared post-consolidation helper — see\n  // runPostConsolidationMaterialize in codex-materialize-runner.ts.\n  return runPostConsolidationMaterialize(\"[cmc]\", options);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAcA,SAAS,kBAAkB;AAO3B,OAAO,UAAU;AA0CjB,IAAM,yBAAyB,oBAAI,IAAI,CAAC,QAAQ,aAAa,YAAY,CAAC;AAY1E,eAAe,oBACb,WACA,0BACmC;AACnC,QAAM,OAAO,gCAAgC,WAAW,wBAAwB;AAChF,QAAM,kBAAkB,KAAK,KAAK,MAAM,cAAc;AAEtD,QAAM,QAAQ,MAAM,cAAc,eAAe,EAAE,MAAM,MAAM,CAAC,CAAa;AAC7E,QAAM,UAAoC,CAAC;AAE3C,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,YAAM,MAAM,MAAM,aAAa,QAAQ;AACvC,UAAI,SAAS,GAAG,KAAK,OAAO,IAAI,iBAAiB,UAAU;AACzD,gBAAQ,KAAK,GAAwC;AAAA,MACvD;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;AAQA,SAAS,oBACP,cACA,YACA,WAAmB,KACX;AAER,QAAM,YAAY,oBAAI,IAAsC;AAC5D,aAAW,KAAK,cAAc;AAC5B,UAAM,OAAO,UAAU,IAAI,EAAE,UAAU,KAAK,CAAC;AAC7C,SAAK,KAAK,CAAC;AACX,cAAU,IAAI,EAAE,YAAY,IAAI;AAAA,EAClC;AAEA,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,2BAA2B,aAAa,MAAM,WAAW,UAAU,IAAI,YAAY;AAC9F,QAAM,KAAK,EAAE;AAGb,aAAW,CAAC,YAAY,YAAY,KAAK,WAAW;AAClD,UAAM,KAAK,gBAAgB,UAAU,EAAE;AACvC,eAAW,KAAK,aAAa,MAAM,GAAG,CAAC,GAAG;AACxC,YAAM,UAAU,EAAE,gBAAgB,YAAY,MAAM,EAAE,gBAAgB,YAAY,MAAM;AACxF,YAAM,KAAK,IAAI,OAAO,WAAW,EAAE,IAAI,EAAE;AACzC,YAAM,KAAK,eAAe,EAAE,aAAa,EAAE;AAC3C,YAAM,KAAK,gBAAgB,EAAE,cAAc,EAAE;AAC7C,UAAI,EAAE,gBAAiB,OAAM,KAAK,kBAAkB,EAAE,eAAe,EAAE;AACvE,UAAI,EAAE,YAAY,OAAQ,OAAM,KAAK,iBAAiB,EAAE,WAAW,KAAK,IAAI,CAAC,EAAE;AAAA,IACjF;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,YAAY,OAAO,KAAK,WAAW,KAAK,EAAE;AAChD,MAAI,YAAY,GAAG;AACjB,UAAM,KAAK,mCAAmC,SAAS,eAAe;AACtE,UAAM,KAAK,EAAE;AAEb,UAAM,gBAAgB,IAAI,IAAI,aAAa,IAAI,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;AAC1E,UAAM,QAAQ,oBAAI,IAAY;AAE9B,eAAW,CAAC,QAAQ,IAAI,KAAK,OAAO,QAAQ,WAAW,KAAK,GAAG;AAC7D,UAAI,MAAM,QAAQ,GAAI;AACtB,YAAM,OAAO,cAAc,IAAI,KAAK,gBAAgB;AACpD,YAAM,KAAK,cAAc,IAAI,KAAK,cAAc;AAChD,UAAI,CAAC,QAAQ,CAAC,GAAI;AAElB,YAAM,KAAK,GAAG,KAAK,QAAQ,MAAM,KAAK,IAAI,MAAM,KAAK,UAAU,aAAQ,GAAG,IAAI,MAAM,GAAG,UAAU,GAAG;AACpG,YAAM,IAAI,MAAM;AAAA,IAClB;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,SAAS,MAAM,KAAK,IAAI;AAC9B,SAAO,OAAO,SAAS,WAAW,OAAO,MAAM,GAAG,QAAQ,IAAI,kBAAkB;AAClF;AAIA,IAAM,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAwB7B,eAAe,mBACb,SACA,KACA,UAAsE,CAAC,GACtC;AACjC,QAAM,WAAW,MAAM,IAAI;AAAA,IACzB;AAAA,MACE,EAAE,MAAM,UAAU,SAAS,qBAAqB;AAAA,MAChD,EAAE,MAAM,QAAQ,SAAS,QAAQ;AAAA,IACnC;AAAA,IACA,EAAE,aAAa,KAAK,WAAW,KAAM,SAAS,QAAQ,SAAS,YAAY,QAAQ,WAAW;AAAA,EAChG;AAEA,MAAI,CAAC,UAAU,SAAS;AACtB,WAAO,EAAE,OAAO,CAAC,GAAG,aAAa,CAAC,EAAE;AAAA,EACtC;AAEA,MAAI;AAEF,QAAI,UAAU,SAAS,QAAQ,KAAK;AACpC,UAAM,aAAa,QAAQ,MAAM,uCAAuC;AACxE,QAAI,WAAY,WAAU,WAAW,CAAC;AAEtC,UAAM,SAAS,KAAK,MAAM,OAAO;AACjC,UAAM,WAAsB,MAAM,QAAQ,OAAO,KAAK,IAAI,OAAO,QAAQ,CAAC;AAC1E,UAAM,iBAA4B,MAAM,QAAQ,OAAO,WAAW,IAAI,OAAO,cAAc,CAAC;AAC5F,WAAO;AAAA,MACL,OAAO,SACJ,IAAI,YAAY,EAChB,OAAO,CAAC,SAA0D,CAAC,CAAC,IAAI;AAAA,MAC3E,aAAa,eACV,IAAI,kBAAkB,EACtB,OAAO,CAAC,SAAgE,CAAC,CAAC,IAAI;AAAA,IACnF;AAAA,EACF,QAAQ;AACN,QAAI,KAAK,kDAAkD;AAC3D,WAAO,EAAE,OAAO,CAAC,GAAG,aAAa,CAAC,EAAE;AAAA,EACtC;AACF;AAIA,SAAS,gBAAgB,SAAyB;AAChD,QAAM,SAAS,WAAW,QAAQ,EAC/B,OAAO,mBAAmB,OAAO,EAAE,EACnC,OAAO,KAAK,EACZ,MAAM,GAAG,EAAE;AACd,SAAO,kBAAkB,MAAM;AACjC;AAEA,SAAS,gBAAgB,OAAoC;AAC3D,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACjE,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAEA,SAAS,cAAc,OAA0B;AAC/C,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACnC,SAAO,MAAM,OAAO,CAAC,SAAyB,OAAO,SAAS,YAAY,KAAK,KAAK,EAAE,SAAS,CAAC;AAClG;AAEA,SAAS,aAAa,KAAmE;AACvF,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,EAAG,QAAO;AAClE,QAAM,IAAI;AACV,QAAM,UAAU,OAAO,EAAE,YAAY,WAAW,EAAE,QAAQ,KAAK,IAAI;AACnE,QAAM,WAAW,OAAO,EAAE,aAAa,WAAW,EAAE,WAAW;AAC/D,QAAM,aAAa,gBAAgB,EAAE,UAAU;AAC/C,MAAI,QAAQ,UAAU,KAAK,CAAC,uBAAuB,IAAI,QAAQ,KAAK,eAAe,QAAW;AAC5F,WAAO;AAAA,EACT;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,cAAc,EAAE,QAAQ;AAAA,EACpC;AACF;AAEA,SAAS,mBAAmB,KAAyE;AACnG,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,EAAG,QAAO;AAClE,QAAM,IAAI;AACV,QAAM,YAAY,OAAO,EAAE,cAAc,WAAW,EAAE,UAAU,KAAK,IAAI;AACzE,QAAM,aAAa,gBAAgB,EAAE,UAAU;AAC/C,MAAI,UAAU,UAAU,KAAK,eAAe,OAAW,QAAO;AAC9D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,UAAU,cAAc,EAAE,QAAQ;AAAA,EACpC;AACF;AAEA,SAAS,sBAAsB,QAA0D;AACvF,QAAM,aAAuC,CAAC;AAE9C,aAAW,QAAQ,OAAO,OAAO;AAC/B,UAAM,WACJ,KAAK,aAAa,eAAe,KAAK,aAAa,eAC/C,KAAK,WACL;AACN,eAAW,KAAK;AAAA,MACd,IAAI,gBAAgB,KAAK,OAAO;AAAA,MAChC,YAAY;AAAA,MACZ,SAAS,KAAK,QAAQ,MAAM,GAAG,EAAE;AAAA,MACjC;AAAA,MACA,SAAS,KAAK;AAAA,MACd,OAAO,KAAK,IAAI,GAAG,KAAK,cAAc,GAAG;AAAA,MACzC,WAAW;AAAA,MACX,SAAS;AAAA,MACT,aAAa,KAAK,YAAY,CAAC,GAAG,MAAM,GAAG,CAAC;AAAA,MAC5C,OAAO;AAAA,MACP,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAEA,aAAW,cAAc,OAAO,aAAa;AAC3C,eAAW,KAAK;AAAA,MACd,IAAI,gBAAgB,WAAW,SAAS;AAAA,MACxC,YAAY;AAAA,MACZ,SAAS,WAAW,UAAU,MAAM,GAAG,EAAE;AAAA,MACzC,UAAU;AAAA,MACV,SAAS,WAAW;AAAA,MACpB,OAAO,KAAK,IAAI,GAAG,WAAW,cAAc,GAAG;AAAA,MAC/C,WAAW;AAAA,MACX,SAAS;AAAA,MACT,aAAa,WAAW,YAAY,CAAC,GAAG,MAAM,GAAG,CAAC;AAAA,MAClD,OAAO;AAAA,MACP,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAEA,SAAS,yBAAyB,OAAe,UAA0B;AACzE,SAAO,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,KAAK,MAAM,KAAK,IAAI;AACnE;AAEA,SAAS,0BAA0B,OAAuB;AACxD,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,EAAG,QAAO;AAClD,SAAO,KAAK,IAAI,GAAG,KAAK;AAC1B;AAEA,SAAS,uBAAuB,YAA4C;AAC1E,MAAI,WAAW,gBAAgB,UAAW,QAAO;AACjD,MAAI,WAAW,gBAAgB,UAAW,QAAO;AACjD,SAAO;AACT;AAEA,SAAS,oBAAoB,cAAgD;AAC3E,MAAI,aAAa,WAAW,EAAG,QAAO;AACtC,QAAM,QAAQ,aAAa,OAAO,CAAC,KAAK,eAAe,MAAM,uBAAuB,UAAU,GAAG,CAAC;AAClG,SAAO,QAAQ,aAAa;AAC9B;AAEA,SAAS,yBACP,cACA,QACS;AACT,QAAM,gBAAgB,yBAAyB,OAAO,eAAe,CAAC;AACtE,MAAI,aAAa,SAAS,cAAe,QAAO;AAEhD,QAAM,cAAc,yBAAyB,OAAO,aAAa,CAAC;AAClE,QAAM,eAAe,IAAI,IAAI,aAAa,IAAI,CAAC,eAAe,WAAW,UAAU,CAAC,EAAE;AACtF,MAAI,eAAe,YAAa,QAAO;AAEvC,QAAM,mBAAmB,0BAA0B,OAAO,gBAAgB;AAC1E,MAAI,mBAAmB,KAAK,oBAAoB,YAAY,IAAI,kBAAkB;AAChF,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAQA,eAAsB,gCAAgC,SAUhB;AACpC,MAAI;AACF,UAAM,eAAe,MAAM,oBAAoB,QAAQ,WAAW,QAAQ,wBAAwB;AAClG,QAAI,CAAC,yBAAyB,cAAc,QAAQ,MAAM,EAAG,QAAO,CAAC;AAErE,UAAM,YAAY,iBAAiB,QAAQ,WAAW,QAAQ,wBAAwB;AACtF,UAAM,aAAa,MAAM,eAAe,SAAS;AAGjD,QAAI,UAAU,oBAAoB,cAAc,UAAU;AAG1D,QAAI,QAAQ,cAAc;AACxB,YAAM,WAAW,MAAM,qCAAqC,QAAQ,YAAY;AAChF,UAAI,SAAS,SAAS,GAAG;AACvB,mBAAW,SAAS;AAAA,MACtB;AAAA,IACF;AAGA,UAAM,MAAM,QAAQ,aAAa,IAAI;AAAA,MACnC,QAAQ;AAAA,MACR,QAAQ,eACJ,oCAAoC,QAAQ,cAAc;AAAA,QACxD,cAAc,QAAQ,gBAAgB,QAAQ,aAAa;AAAA,MAC7D,CAAC,IACD,EAAE,cAAc,QAAQ,aAAa;AAAA,IAC3C;AACA,UAAM,aAAa,EAAE,SAAS,QAAQ,gBAAgB,YAAY,QAAQ,WAAW;AACrF,QAAI,CAAC,IAAI,YAAY,UAAU,GAAG;AAChC,UAAI,MAAM,0DAAqD;AAC/D,aAAO,CAAC;AAAA,IACV;AAGA,UAAM,SAAS,MAAM,mBAAmB,SAAS,KAAK,UAAU;AAChE,UAAM,aAAa,sBAAsB,MAAM;AAE/C,QAAI,MAAM,oCAAoC,WAAW,MAAM,gBAAgB,OAAO,YAAY,MAAM,gBAAgB;AACxH,WAAO;AAAA,EACT,SAAS,OAAO;AACd,QAAI,KAAK,2CAA2C,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAC5G,WAAO,CAAC;AAAA,EACV;AACF;AAMA,eAAsB,kCAAkC,SAQ7B;AACzB,MAAI;AACF,UAAM,eAAe,MAAM,oBAAoB,QAAQ,WAAW,QAAQ,wBAAwB;AAClG,QAAI,aAAa,UAAU,QAAQ,mBAAmB,GAAI,QAAO;AAEjE,UAAM,YAAY,iBAAiB,QAAQ,WAAW,QAAQ,wBAAwB;AACtF,UAAM,aAAa,MAAM,eAAe,SAAS;AACjD,UAAM,UAAU,oBAAoB,cAAc,UAAU;AAE5D,UAAM,MAAM,IAAI,kBAAkB,QAAQ,eAAe;AAAA,MACvD,cAAc,QAAQ;AAAA,IACxB,CAAC;AACD,UAAM,aAAa,EAAE,SAAS,QAAQ,gBAAgB,YAAY,QAAQ,WAAW;AACrF,QAAI,CAAC,IAAI,YAAY,UAAU,EAAG,QAAO;AAEzC,UAAM,SAAS,MAAM,mBAAmB,SAAS,KAAK,UAAU;AAChE,QAAI,OAAO,YAAY,WAAW,KAAK,OAAO,MAAM,WAAW,EAAG,QAAO;AAEzE,UAAM,QAAkB,CAAC,uDAAuD,EAAE;AAElF,eAAW,QAAQ,OAAO,aAAa;AACrC,YAAM,KAAK,KAAK,KAAK,SAAS,EAAE;AAAA,IAClC;AAEA,eAAW,QAAQ,OAAO,OAAO;AAC/B,YAAM,KAAK,KAAK,KAAK,OAAO,EAAE;AAAA,IAChC;AAEA,UAAM,KAAK,EAAE;AACb,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB,SAAS,OAAO;AACd,QAAI,KAAK,kDAAkD,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AACnH,WAAO;AAAA,EACT;AACF;AAWA,eAAsB,oCAAoC,SAQpB;AAGpC,SAAO,gCAAgC,SAAS,OAAO;AACzD;","names":[]}

package/dist/{chunk-3BP57I6J.js → chunk-2F6NP3NT.js}

@@ -208,6 +208,7 @@ async function learnUtilityPromotionWeights(options) {
     weights
   };
   if (weights.length === 0) {
+    await writeUtilityLearningSnapshot(statePath, snapshot);
     return {
       applied: false,
       reason: "insufficient_events",
@@ -265,4 +266,4 @@ export {
   learnUtilityPromotionWeights,
   getUtilityLearningStatus
 };
-//# sourceMappingURL=chunk-3BP57I6J.js.map
+//# sourceMappingURL=chunk-2F6NP3NT.js.map

package/dist/{chunk-3BP57I6J.js.map → chunk-2F6NP3NT.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/utility-learner.ts"],"sourcesContent":["import path from \"node:path\";\nimport { mkdir, readFile, rename, writeFile } from \"node:fs/promises\";\nimport { clamp01 } from \"./lifecycle.js\";\nimport {\n  readUtilityTelemetryEvents,\n  resolveUtilityTelemetryDir,\n  type UtilityTelemetryDecision,\n  type UtilityTelemetryEvent,\n  type UtilityTelemetryOutcome,\n  type UtilityTelemetryTarget,\n} from \"./utility-telemetry.js\";\n\nexport interface UtilityLearningWeight {\n  target: UtilityTelemetryTarget;\n  decision: UtilityTelemetryDecision;\n  eventCount: number;\n  learnedWeight: number;\n  averageUtilityScore: number;\n  confidence: number;\n  outcomeCounts: Partial<Record<UtilityTelemetryOutcome, number>>;\n  updatedAt: string;\n}\n\nexport interface UtilityLearningSnapshot {\n  version: 1;\n  updatedAt: string;\n  windowDays: number;\n  minEventCount: number;\n  maxWeightMagnitude: number;\n  weights: UtilityLearningWeight[];\n}\n\nexport interface UtilityLearningStatus {\n  enabled: boolean;\n  promotionByOutcomeEnabled: boolean;\n  rootDir: string;\n  statePath: string;\n  snapshot: UtilityLearningSnapshot | null;\n  weights: {\n    total: number;\n    positive: number;\n    negative: number;\n    zero: number;\n    latestUpdatedAt?: string;\n  };\n}\n\nexport interface UtilityLearningResult {\n  applied: boolean;\n  reason: \"disabled\" | \"insufficient_events\" | \"learned\";\n  statePath: string;\n  snapshot: UtilityLearningSnapshot | null;\n}\n\nconst UTILITY_LEARNING_SNAPSHOT_VERSION = 1;\nconst UTILITY_LEARNING_STATE_FILE = \"learning-state.json\";\n\nfunction clampWeight(value: number, maxWeightMagnitude: number): number {\n  const limit = Number.isFinite(maxWeightMagnitude) && maxWeightMagnitude > 0\n    ? maxWeightMagnitude\n    : 0;\n  return Math.max(-limit, Math.min(limit, value));\n}\n\nfunction coerceLearningWindowDays(value: number): number {\n  if (!Number.isFinite(value)) return 14;\n  return Math.max(1, Math.floor(value));\n}\n\nfunction coerceMinEventCount(value: number): number {\n  if (!Number.isFinite(value)) return 3;\n  return Math.max(1, Math.floor(value));\n}\n\nfunction coerceMaxWeightMagnitude(value: number): number {\n  if (!Number.isFinite(value)) return 0.35;\n  return Math.max(0, Math.min(1, value));\n}\n\nfunction roundWeight(value: number): number {\n  return Math.round(value * 1000) / 1000;\n}\n\nfunction outcomeCountsFor(events: UtilityTelemetryEvent[]): Partial<Record<UtilityTelemetryOutcome, number>> {\n  const counts: Partial<Record<UtilityTelemetryOutcome, number>> = {};\n  for (const event of events) {\n    counts[event.outcome] = (counts[event.outcome] ?? 0) + 1;\n  }\n  return counts;\n}\n\nfunction selectRecentEvents(events: UtilityTelemetryEvent[], now: Date, windowDays: number): UtilityTelemetryEvent[] {\n  if (!Number.isFinite(windowDays) || windowDays <= 0) return [...events];\n  const minTimestamp = now.getTime() - windowDays * 86_400_000;\n  return events.filter((event) => {\n    const ts = Date.parse(event.recordedAt);\n    return Number.isFinite(ts) && ts >= minTimestamp;\n  });\n}\n\nfunction confidenceFromEvents(eventCount: number, averageUtilityScore: number): number {\n  if (eventCount <= 0) return 0;\n  return roundWeight(clamp01(Math.abs(averageUtilityScore) * Math.min(1, eventCount / 10)));\n}\n\nfunction validateUtilityLearningSnapshot(raw: unknown): UtilityLearningSnapshot {\n  if (!raw || typeof raw !== \"object\" || Array.isArray(raw)) {\n    throw new Error(\"utility learning snapshot must be an object\");\n  }\n  const record = raw as Record<string, unknown>;\n  if (record.version !== UTILITY_LEARNING_SNAPSHOT_VERSION) {\n    throw new Error(\"utility learning snapshot version must be 1\");\n  }\n  if (typeof record.updatedAt !== \"string\" || record.updatedAt.length === 0) {\n    throw new Error(\"utility learning snapshot updatedAt must be a string\");\n  }\n  if (typeof record.windowDays !== \"number\" || !Number.isFinite(record.windowDays) || record.windowDays < 0) {\n    throw new Error(\"utility learning snapshot windowDays must be a non-negative number\");\n  }\n  if (typeof record.minEventCount !== \"number\" || !Number.isFinite(record.minEventCount) || record.minEventCount < 1) {\n    throw new Error(\"utility learning snapshot minEventCount must be >= 1\");\n  }\n  if (\n    typeof record.maxWeightMagnitude !== \"number\" ||\n    !Number.isFinite(record.maxWeightMagnitude) ||\n    record.maxWeightMagnitude < 0\n  ) {\n    throw new Error(\"utility learning snapshot maxWeightMagnitude must be >= 0\");\n  }\n  if (!Array.isArray(record.weights)) {\n    throw new Error(\"utility learning snapshot weights must be an array\");\n  }\n\n  const weights = record.weights.map((entry) => {\n    if (!entry || typeof entry !== \"object\" || Array.isArray(entry)) {\n      throw new Error(\"utility learning weight must be an object\");\n    }\n    const weight = entry as Record<string, unknown>;\n    const target = weight.target;\n    const decision = weight.decision;\n    if (target !== \"promotion\" && target !== \"ranking\") {\n      throw new Error(\"utility learning weight target must be promotion|ranking\");\n    }\n    if (![\"promote\", \"demote\", \"hold\", \"boost\", \"suppress\"].includes(String(decision))) {\n      throw new Error(\"utility learning weight decision is invalid\");\n    }\n    if (typeof weight.eventCount !== \"number\" || !Number.isFinite(weight.eventCount) || weight.eventCount < 0) {\n      throw new Error(\"utility learning weight eventCount must be >= 0\");\n    }\n    if (typeof weight.learnedWeight !== \"number\" || !Number.isFinite(weight.learnedWeight)) {\n      throw new Error(\"utility learning weight learnedWeight must be finite\");\n    }\n    if (typeof weight.averageUtilityScore !== \"number\" || !Number.isFinite(weight.averageUtilityScore)) {\n      throw new Error(\"utility learning weight averageUtilityScore must be finite\");\n    }\n    if (typeof weight.confidence !== \"number\" || !Number.isFinite(weight.confidence)) {\n      throw new Error(\"utility learning weight confidence must be finite\");\n    }\n    if (typeof weight.updatedAt !== \"string\" || weight.updatedAt.length === 0) {\n      throw new Error(\"utility learning weight updatedAt must be a string\");\n    }\n    const outcomeCounts = (weight.outcomeCounts ?? {}) as Partial<Record<UtilityTelemetryOutcome, number>>;\n    return {\n      target,\n      decision: decision as UtilityTelemetryDecision,\n      eventCount: weight.eventCount,\n      learnedWeight: roundWeight(weight.learnedWeight),\n      averageUtilityScore: roundWeight(weight.averageUtilityScore),\n      confidence: roundWeight(clamp01(weight.confidence)),\n      outcomeCounts,\n      updatedAt: weight.updatedAt,\n    } satisfies UtilityLearningWeight;\n  });\n\n  return {\n    version: 1,\n    updatedAt: record.updatedAt,\n    windowDays: record.windowDays,\n    minEventCount: record.minEventCount,\n    maxWeightMagnitude: record.maxWeightMagnitude,\n    weights,\n  };\n}\n\nexport function resolveUtilityLearningStatePath(memoryDir: string, utilityTelemetryDir?: string): string {\n  return path.join(resolveUtilityTelemetryDir(memoryDir, utilityTelemetryDir), UTILITY_LEARNING_STATE_FILE);\n}\n\nexport async function readUtilityLearningSnapshot(\n  memoryDir: string,\n  utilityTelemetryDir?: string,\n): Promise<UtilityLearningSnapshot | null> {\n  const statePath = resolveUtilityLearningStatePath(memoryDir, utilityTelemetryDir);\n  try {\n    const raw = JSON.parse(await readFile(statePath, \"utf8\")) as unknown;\n    return validateUtilityLearningSnapshot(raw);\n  } catch {\n    return null;\n  }\n}\n\nasync function writeUtilityLearningSnapshot(\n  statePath: string,\n  snapshot: UtilityLearningSnapshot,\n): Promise<void> {\n  const tempPath = `${statePath}.tmp`;\n  await mkdir(path.dirname(statePath), { recursive: true });\n  await writeFile(tempPath, `${JSON.stringify(snapshot, null, 2)}\\n`, \"utf8\");\n  await rename(tempPath, statePath);\n}\n\nexport async function learnUtilityPromotionWeights(options: {\n  memoryDir: string;\n  utilityTelemetryDir?: string;\n  enabled: boolean;\n  now?: Date;\n  learningWindowDays: number;\n  minEventCount: number;\n  maxWeightMagnitude: number;\n}): Promise<UtilityLearningResult> {\n  const statePath = resolveUtilityLearningStatePath(options.memoryDir, options.utilityTelemetryDir);\n  if (!options.enabled) {\n    return {\n      applied: false,\n      reason: \"disabled\",\n      statePath,\n      snapshot: null,\n    };\n  }\n\n  const now = options.now ?? new Date();\n  const updatedAt = now.toISOString();\n  const windowDays = coerceLearningWindowDays(options.learningWindowDays);\n  const minEventCount = coerceMinEventCount(options.minEventCount);\n  const maxWeightMagnitude = coerceMaxWeightMagnitude(options.maxWeightMagnitude);\n  const recentEvents = selectRecentEvents(\n    (\n      await readUtilityTelemetryEvents({\n        memoryDir: options.memoryDir,\n        utilityTelemetryDir: options.utilityTelemetryDir,\n      })\n    ).events,\n    now,\n    windowDays,\n  );\n\n  const grouped = new Map<string, UtilityTelemetryEvent[]>();\n  for (const event of recentEvents) {\n    const key = `${event.target}:${event.decision}`;\n    const existing = grouped.get(key);\n    if (existing) {\n      existing.push(event);\n    } else {\n      grouped.set(key, [event]);\n    }\n  }\n\n  const weights: UtilityLearningWeight[] = [];\n  for (const events of grouped.values()) {\n    if (events.length < minEventCount) continue;\n    const target = events[0].target;\n    const decision = events[0].decision;\n    const averageUtilityScore = events.reduce((sum, event) => sum + event.utilityScore, 0) / events.length;\n    const confidence = confidenceFromEvents(events.length, averageUtilityScore);\n    const learnedWeight = roundWeight(\n      clampWeight(averageUtilityScore * confidence, maxWeightMagnitude),\n    );\n    weights.push({\n      target,\n      decision,\n      eventCount: events.length,\n      learnedWeight,\n      averageUtilityScore: roundWeight(averageUtilityScore),\n      confidence,\n      outcomeCounts: outcomeCountsFor(events),\n      updatedAt,\n    });\n  }\n\n  weights.sort((left, right) => {\n    const targetCompare = left.target.localeCompare(right.target);\n    if (targetCompare !== 0) return targetCompare;\n    return left.decision.localeCompare(right.decision);\n  });\n\n  const snapshot: UtilityLearningSnapshot = {\n    version: 1,\n    updatedAt,\n    windowDays,\n    minEventCount,\n    maxWeightMagnitude,\n    weights,\n  };\n\n  if (weights.length === 0) {\n    return {\n      applied: false,\n      reason: \"insufficient_events\",\n      statePath,\n      snapshot,\n    };\n  }\n\n  await writeUtilityLearningSnapshot(statePath, snapshot);\n  return {\n    applied: true,\n    reason: \"learned\",\n    statePath,\n    snapshot,\n  };\n}\n\nexport async function getUtilityLearningStatus(options: {\n  memoryDir: string;\n  utilityTelemetryDir?: string;\n  enabled: boolean;\n  promotionByOutcomeEnabled?: boolean;\n}): Promise<UtilityLearningStatus> {\n  const rootDir = resolveUtilityTelemetryDir(options.memoryDir, options.utilityTelemetryDir);\n  const statePath = resolveUtilityLearningStatePath(options.memoryDir, options.utilityTelemetryDir);\n  if (!options.enabled) {\n    return {\n      enabled: false,\n      promotionByOutcomeEnabled: options.promotionByOutcomeEnabled === true,\n      rootDir,\n      statePath,\n      snapshot: null,\n      weights: {\n        total: 0,\n        positive: 0,\n        negative: 0,\n        zero: 0,\n      },\n    };\n  }\n\n  const snapshot = await readUtilityLearningSnapshot(options.memoryDir, options.utilityTelemetryDir);\n  const weights = snapshot?.weights ?? [];\n  return {\n    enabled: true,\n    promotionByOutcomeEnabled: options.promotionByOutcomeEnabled === true,\n    rootDir,\n    statePath,\n    snapshot,\n    weights: {\n      total: weights.length,\n      positive: weights.filter((entry) => entry.learnedWeight > 0).length,\n      negative: weights.filter((entry) => entry.learnedWeight < 0).length,\n      zero: weights.filter((entry) => entry.learnedWeight === 0).length,\n      latestUpdatedAt: snapshot?.updatedAt,\n    },\n  };\n}\n"],"mappings":";;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,OAAO,UAAU,QAAQ,iBAAiB;AAqDnD,IAAM,oCAAoC;AAC1C,IAAM,8BAA8B;AAEpC,SAAS,YAAY,OAAe,oBAAoC;AACtE,QAAM,QAAQ,OAAO,SAAS,kBAAkB,KAAK,qBAAqB,IACtE,qBACA;AACJ,SAAO,KAAK,IAAI,CAAC,OAAO,KAAK,IAAI,OAAO,KAAK,CAAC;AAChD;AAEA,SAAS,yBAAyB,OAAuB;AACvD,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;AACtC;AAEA,SAAS,oBAAoB,OAAuB;AAClD,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;AACtC;AAEA,SAAS,yBAAyB,OAAuB;AACvD,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAEA,SAAS,YAAY,OAAuB;AAC1C,SAAO,KAAK,MAAM,QAAQ,GAAI,IAAI;AACpC;AAEA,SAAS,iBAAiB,QAAmF;AAC3G,QAAM,SAA2D,CAAC;AAClE,aAAW,SAAS,QAAQ;AAC1B,WAAO,MAAM,OAAO,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK;AAAA,EACzD;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,QAAiC,KAAW,YAA6C;AACnH,MAAI,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,EAAG,QAAO,CAAC,GAAG,MAAM;AACtE,QAAM,eAAe,IAAI,QAAQ,IAAI,aAAa;AAClD,SAAO,OAAO,OAAO,CAAC,UAAU;AAC9B,UAAM,KAAK,KAAK,MAAM,MAAM,UAAU;AACtC,WAAO,OAAO,SAAS,EAAE,KAAK,MAAM;AAAA,EACtC,CAAC;AACH;AAEA,SAAS,qBAAqB,YAAoB,qBAAqC;AACrF,MAAI,cAAc,EAAG,QAAO;AAC5B,SAAO,YAAY,QAAQ,KAAK,IAAI,mBAAmB,IAAI,KAAK,IAAI,GAAG,aAAa,EAAE,CAAC,CAAC;AAC1F;AAEA,SAAS,gCAAgC,KAAuC;AAC9E,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAAG;AACzD,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,QAAM,SAAS;AACf,MAAI,OAAO,YAAY,mCAAmC;AACxD,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,MAAI,OAAO,OAAO,cAAc,YAAY,OAAO,UAAU,WAAW,GAAG;AACzE,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACxE;AACA,MAAI,OAAO,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,OAAO,UAAU,KAAK,OAAO,aAAa,GAAG;AACzG,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,MAAI,OAAO,OAAO,kBAAkB,YAAY,CAAC,OAAO,SAAS,OAAO,aAAa,KAAK,OAAO,gBAAgB,GAAG;AAClH,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACxE;AACA,MACE,OAAO,OAAO,uBAAuB,YACrC,CAAC,OAAO,SAAS,OAAO,kBAAkB,KAC1C,OAAO,qBAAqB,GAC5B;AACA,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AACA,MAAI,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAClC,UAAM,IAAI,MAAM,oDAAoD;AAAA,EACtE;AAEA,QAAM,UAAU,OAAO,QAAQ,IAAI,CAAC,UAAU;AAC5C,QAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AAC/D,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC7D;AACA,UAAM,SAAS;AACf,UAAM,SAAS,OAAO;AACtB,UAAM,WAAW,OAAO;AACxB,QAAI,WAAW,eAAe,WAAW,WAAW;AAClD,YAAM,IAAI,MAAM,0DAA0D;AAAA,IAC5E;AACA,QAAI,CAAC,CAAC,WAAW,UAAU,QAAQ,SAAS,UAAU,EAAE,SAAS,OAAO,QAAQ,CAAC,GAAG;AAClF,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AACA,QAAI,OAAO,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,OAAO,UAAU,KAAK,OAAO,aAAa,GAAG;AACzG,YAAM,IAAI,MAAM,iDAAiD;AAAA,IACnE;AACA,QAAI,OAAO,OAAO,kBAAkB,YAAY,CAAC,OAAO,SAAS,OAAO,aAAa,GAAG;AACtF,YAAM,IAAI,MAAM,sDAAsD;AAAA,IACxE;AACA,QAAI,OAAO,OAAO,wBAAwB,YAAY,CAAC,OAAO,SAAS,OAAO,mBAAmB,GAAG;AAClG,YAAM,IAAI,MAAM,4DAA4D;AAAA,IAC9E;AACA,QAAI,OAAO,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,OAAO,UAAU,GAAG;AAChF,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACrE;AACA,QAAI,OAAO,OAAO,cAAc,YAAY,OAAO,UAAU,WAAW,GAAG;AACzE,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AACA,UAAM,gBAAiB,OAAO,iBAAiB,CAAC;AAChD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,eAAe,YAAY,OAAO,aAAa;AAAA,MAC/C,qBAAqB,YAAY,OAAO,mBAAmB;AAAA,MAC3D,YAAY,YAAY,QAAQ,OAAO,UAAU,CAAC;AAAA,MAClD;AAAA,MACA,WAAW,OAAO;AAAA,IACpB;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,SAAS;AAAA,IACT,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,eAAe,OAAO;AAAA,IACtB,oBAAoB,OAAO;AAAA,IAC3B;AAAA,EACF;AACF;AAEO,SAAS,gCAAgC,WAAmB,qBAAsC;AACvG,SAAO,KAAK,KAAK,2BAA2B,WAAW,mBAAmB,GAAG,2BAA2B;AAC1G;AAEA,eAAsB,4BACpB,WACA,qBACyC;AACzC,QAAM,YAAY,gCAAgC,WAAW,mBAAmB;AAChF,MAAI;AACF,UAAM,MAAM,KAAK,MAAM,MAAM,SAAS,WAAW,MAAM,CAAC;AACxD,WAAO,gCAAgC,GAAG;AAAA,EAC5C,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,6BACb,WACA,UACe;AACf,QAAM,WAAW,GAAG,SAAS;AAC7B,QAAM,MAAM,KAAK,QAAQ,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACxD,QAAM,UAAU,UAAU,GAAG,KAAK,UAAU,UAAU,MAAM,CAAC,CAAC;AAAA,GAAM,MAAM;AAC1E,QAAM,OAAO,UAAU,SAAS;AAClC;AAEA,eAAsB,6BAA6B,SAQhB;AACjC,QAAM,YAAY,gCAAgC,QAAQ,WAAW,QAAQ,mBAAmB;AAChG,MAAI,CAAC,QAAQ,SAAS;AACpB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ;AAAA,MACR;AAAA,MACA,UAAU;AAAA,IACZ;AAAA,EACF;AAEA,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,YAAY,IAAI,YAAY;AAClC,QAAM,aAAa,yBAAyB,QAAQ,kBAAkB;AACtE,QAAM,gBAAgB,oBAAoB,QAAQ,aAAa;AAC/D,QAAM,qBAAqB,yBAAyB,QAAQ,kBAAkB;AAC9E,QAAM,eAAe;AAAA,KAEjB,MAAM,2BAA2B;AAAA,MAC/B,WAAW,QAAQ;AAAA,MACnB,qBAAqB,QAAQ;AAAA,IAC/B,CAAC,GACD;AAAA,IACF;AAAA,IACA;AAAA,EACF;AAEA,QAAM,UAAU,oBAAI,IAAqC;AACzD,aAAW,SAAS,cAAc;AAChC,UAAM,MAAM,GAAG,MAAM,MAAM,IAAI,MAAM,QAAQ;AAC7C,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,QAAI,UAAU;AACZ,eAAS,KAAK,KAAK;AAAA,IACrB,OAAO;AACL,cAAQ,IAAI,KAAK,CAAC,KAAK,CAAC;AAAA,IAC1B;AAAA,EACF;AAEA,QAAM,UAAmC,CAAC;AAC1C,aAAW,UAAU,QAAQ,OAAO,GAAG;AACrC,QAAI,OAAO,SAAS,cAAe;AACnC,UAAM,SAAS,OAAO,CAAC,EAAE;AACzB,UAAM,WAAW,OAAO,CAAC,EAAE;AAC3B,UAAM,sBAAsB,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,cAAc,CAAC,IAAI,OAAO;AAChG,UAAM,aAAa,qBAAqB,OAAO,QAAQ,mBAAmB;AAC1E,UAAM,gBAAgB;AAAA,MACpB,YAAY,sBAAsB,YAAY,kBAAkB;AAAA,IAClE;AACA,YAAQ,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,YAAY,OAAO;AAAA,MACnB;AAAA,MACA,qBAAqB,YAAY,mBAAmB;AAAA,MACpD;AAAA,MACA,eAAe,iBAAiB,MAAM;AAAA,MACtC;AAAA,IACF,CAAC;AAAA,EACH;AAEA,UAAQ,KAAK,CAAC,MAAM,UAAU;AAC5B,UAAM,gBAAgB,KAAK,OAAO,cAAc,MAAM,MAAM;AAC5D,QAAI,kBAAkB,EAAG,QAAO;AAChC,WAAO,KAAK,SAAS,cAAc,MAAM,QAAQ;AAAA,EACnD,CAAC;AAED,QAAM,WAAoC;AAAA,IACxC,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,6BAA6B,WAAW,QAAQ;AACtD,SAAO;AAAA,IACL,SAAS;AAAA,IACT,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,EACF;AACF;AAEA,eAAsB,yBAAyB,SAKZ;AACjC,QAAM,UAAU,2BAA2B,QAAQ,WAAW,QAAQ,mBAAmB;AACzF,QAAM,YAAY,gCAAgC,QAAQ,WAAW,QAAQ,mBAAmB;AAChG,MAAI,CAAC,QAAQ,SAAS;AACpB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,2BAA2B,QAAQ,8BAA8B;AAAA,MACjE;AAAA,MACA;AAAA,MACA,UAAU;AAAA,MACV,SAAS;AAAA,QACP,OAAO;AAAA,QACP,UAAU;AAAA,QACV,UAAU;AAAA,QACV,MAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WAAW,MAAM,4BAA4B,QAAQ,WAAW,QAAQ,mBAAmB;AACjG,QAAM,UAAU,UAAU,WAAW,CAAC;AACtC,SAAO;AAAA,IACL,SAAS;AAAA,IACT,2BAA2B,QAAQ,8BAA8B;AAAA,IACjE;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS;AAAA,MACP,OAAO,QAAQ;AAAA,MACf,UAAU,QAAQ,OAAO,CAAC,UAAU,MAAM,gBAAgB,CAAC,EAAE;AAAA,MAC7D,UAAU,QAAQ,OAAO,CAAC,UAAU,MAAM,gBAAgB,CAAC,EAAE;AAAA,MAC7D,MAAM,QAAQ,OAAO,CAAC,UAAU,MAAM,kBAAkB,CAAC,EAAE;AAAA,MAC3D,iBAAiB,UAAU;AAAA,IAC7B;AAAA,EACF;AACF;","names":[]}
+{"version":3,"sources":["../src/utility-learner.ts"],"sourcesContent":["import path from \"node:path\";\nimport { mkdir, readFile, rename, writeFile } from \"node:fs/promises\";\nimport { clamp01 } from \"./lifecycle.js\";\nimport {\n  readUtilityTelemetryEvents,\n  resolveUtilityTelemetryDir,\n  type UtilityTelemetryDecision,\n  type UtilityTelemetryEvent,\n  type UtilityTelemetryOutcome,\n  type UtilityTelemetryTarget,\n} from \"./utility-telemetry.js\";\n\nexport interface UtilityLearningWeight {\n  target: UtilityTelemetryTarget;\n  decision: UtilityTelemetryDecision;\n  eventCount: number;\n  learnedWeight: number;\n  averageUtilityScore: number;\n  confidence: number;\n  outcomeCounts: Partial<Record<UtilityTelemetryOutcome, number>>;\n  updatedAt: string;\n}\n\nexport interface UtilityLearningSnapshot {\n  version: 1;\n  updatedAt: string;\n  windowDays: number;\n  minEventCount: number;\n  maxWeightMagnitude: number;\n  weights: UtilityLearningWeight[];\n}\n\nexport interface UtilityLearningStatus {\n  enabled: boolean;\n  promotionByOutcomeEnabled: boolean;\n  rootDir: string;\n  statePath: string;\n  snapshot: UtilityLearningSnapshot | null;\n  weights: {\n    total: number;\n    positive: number;\n    negative: number;\n    zero: number;\n    latestUpdatedAt?: string;\n  };\n}\n\nexport interface UtilityLearningResult {\n  applied: boolean;\n  reason: \"disabled\" | \"insufficient_events\" | \"learned\";\n  statePath: string;\n  snapshot: UtilityLearningSnapshot | null;\n}\n\nconst UTILITY_LEARNING_SNAPSHOT_VERSION = 1;\nconst UTILITY_LEARNING_STATE_FILE = \"learning-state.json\";\n\nfunction clampWeight(value: number, maxWeightMagnitude: number): number {\n  const limit = Number.isFinite(maxWeightMagnitude) && maxWeightMagnitude > 0\n    ? maxWeightMagnitude\n    : 0;\n  return Math.max(-limit, Math.min(limit, value));\n}\n\nfunction coerceLearningWindowDays(value: number): number {\n  if (!Number.isFinite(value)) return 14;\n  return Math.max(1, Math.floor(value));\n}\n\nfunction coerceMinEventCount(value: number): number {\n  if (!Number.isFinite(value)) return 3;\n  return Math.max(1, Math.floor(value));\n}\n\nfunction coerceMaxWeightMagnitude(value: number): number {\n  if (!Number.isFinite(value)) return 0.35;\n  return Math.max(0, Math.min(1, value));\n}\n\nfunction roundWeight(value: number): number {\n  return Math.round(value * 1000) / 1000;\n}\n\nfunction outcomeCountsFor(events: UtilityTelemetryEvent[]): Partial<Record<UtilityTelemetryOutcome, number>> {\n  const counts: Partial<Record<UtilityTelemetryOutcome, number>> = {};\n  for (const event of events) {\n    counts[event.outcome] = (counts[event.outcome] ?? 0) + 1;\n  }\n  return counts;\n}\n\nfunction selectRecentEvents(events: UtilityTelemetryEvent[], now: Date, windowDays: number): UtilityTelemetryEvent[] {\n  if (!Number.isFinite(windowDays) || windowDays <= 0) return [...events];\n  const minTimestamp = now.getTime() - windowDays * 86_400_000;\n  return events.filter((event) => {\n    const ts = Date.parse(event.recordedAt);\n    return Number.isFinite(ts) && ts >= minTimestamp;\n  });\n}\n\nfunction confidenceFromEvents(eventCount: number, averageUtilityScore: number): number {\n  if (eventCount <= 0) return 0;\n  return roundWeight(clamp01(Math.abs(averageUtilityScore) * Math.min(1, eventCount / 10)));\n}\n\nfunction validateUtilityLearningSnapshot(raw: unknown): UtilityLearningSnapshot {\n  if (!raw || typeof raw !== \"object\" || Array.isArray(raw)) {\n    throw new Error(\"utility learning snapshot must be an object\");\n  }\n  const record = raw as Record<string, unknown>;\n  if (record.version !== UTILITY_LEARNING_SNAPSHOT_VERSION) {\n    throw new Error(\"utility learning snapshot version must be 1\");\n  }\n  if (typeof record.updatedAt !== \"string\" || record.updatedAt.length === 0) {\n    throw new Error(\"utility learning snapshot updatedAt must be a string\");\n  }\n  if (typeof record.windowDays !== \"number\" || !Number.isFinite(record.windowDays) || record.windowDays < 0) {\n    throw new Error(\"utility learning snapshot windowDays must be a non-negative number\");\n  }\n  if (typeof record.minEventCount !== \"number\" || !Number.isFinite(record.minEventCount) || record.minEventCount < 1) {\n    throw new Error(\"utility learning snapshot minEventCount must be >= 1\");\n  }\n  if (\n    typeof record.maxWeightMagnitude !== \"number\" ||\n    !Number.isFinite(record.maxWeightMagnitude) ||\n    record.maxWeightMagnitude < 0\n  ) {\n    throw new Error(\"utility learning snapshot maxWeightMagnitude must be >= 0\");\n  }\n  if (!Array.isArray(record.weights)) {\n    throw new Error(\"utility learning snapshot weights must be an array\");\n  }\n\n  const weights = record.weights.map((entry) => {\n    if (!entry || typeof entry !== \"object\" || Array.isArray(entry)) {\n      throw new Error(\"utility learning weight must be an object\");\n    }\n    const weight = entry as Record<string, unknown>;\n    const target = weight.target;\n    const decision = weight.decision;\n    if (target !== \"promotion\" && target !== \"ranking\") {\n      throw new Error(\"utility learning weight target must be promotion|ranking\");\n    }\n    if (![\"promote\", \"demote\", \"hold\", \"boost\", \"suppress\"].includes(String(decision))) {\n      throw new Error(\"utility learning weight decision is invalid\");\n    }\n    if (typeof weight.eventCount !== \"number\" || !Number.isFinite(weight.eventCount) || weight.eventCount < 0) {\n      throw new Error(\"utility learning weight eventCount must be >= 0\");\n    }\n    if (typeof weight.learnedWeight !== \"number\" || !Number.isFinite(weight.learnedWeight)) {\n      throw new Error(\"utility learning weight learnedWeight must be finite\");\n    }\n    if (typeof weight.averageUtilityScore !== \"number\" || !Number.isFinite(weight.averageUtilityScore)) {\n      throw new Error(\"utility learning weight averageUtilityScore must be finite\");\n    }\n    if (typeof weight.confidence !== \"number\" || !Number.isFinite(weight.confidence)) {\n      throw new Error(\"utility learning weight confidence must be finite\");\n    }\n    if (typeof weight.updatedAt !== \"string\" || weight.updatedAt.length === 0) {\n      throw new Error(\"utility learning weight updatedAt must be a string\");\n    }\n    const outcomeCounts = (weight.outcomeCounts ?? {}) as Partial<Record<UtilityTelemetryOutcome, number>>;\n    return {\n      target,\n      decision: decision as UtilityTelemetryDecision,\n      eventCount: weight.eventCount,\n      learnedWeight: roundWeight(weight.learnedWeight),\n      averageUtilityScore: roundWeight(weight.averageUtilityScore),\n      confidence: roundWeight(clamp01(weight.confidence)),\n      outcomeCounts,\n      updatedAt: weight.updatedAt,\n    } satisfies UtilityLearningWeight;\n  });\n\n  return {\n    version: 1,\n    updatedAt: record.updatedAt,\n    windowDays: record.windowDays,\n    minEventCount: record.minEventCount,\n    maxWeightMagnitude: record.maxWeightMagnitude,\n    weights,\n  };\n}\n\nexport function resolveUtilityLearningStatePath(memoryDir: string, utilityTelemetryDir?: string): string {\n  return path.join(resolveUtilityTelemetryDir(memoryDir, utilityTelemetryDir), UTILITY_LEARNING_STATE_FILE);\n}\n\nexport async function readUtilityLearningSnapshot(\n  memoryDir: string,\n  utilityTelemetryDir?: string,\n): Promise<UtilityLearningSnapshot | null> {\n  const statePath = resolveUtilityLearningStatePath(memoryDir, utilityTelemetryDir);\n  try {\n    const raw = JSON.parse(await readFile(statePath, \"utf8\")) as unknown;\n    return validateUtilityLearningSnapshot(raw);\n  } catch {\n    return null;\n  }\n}\n\nasync function writeUtilityLearningSnapshot(\n  statePath: string,\n  snapshot: UtilityLearningSnapshot,\n): Promise<void> {\n  const tempPath = `${statePath}.tmp`;\n  await mkdir(path.dirname(statePath), { recursive: true });\n  await writeFile(tempPath, `${JSON.stringify(snapshot, null, 2)}\\n`, \"utf8\");\n  await rename(tempPath, statePath);\n}\n\nexport async function learnUtilityPromotionWeights(options: {\n  memoryDir: string;\n  utilityTelemetryDir?: string;\n  enabled: boolean;\n  now?: Date;\n  learningWindowDays: number;\n  minEventCount: number;\n  maxWeightMagnitude: number;\n}): Promise<UtilityLearningResult> {\n  const statePath = resolveUtilityLearningStatePath(options.memoryDir, options.utilityTelemetryDir);\n  if (!options.enabled) {\n    return {\n      applied: false,\n      reason: \"disabled\",\n      statePath,\n      snapshot: null,\n    };\n  }\n\n  const now = options.now ?? new Date();\n  const updatedAt = now.toISOString();\n  const windowDays = coerceLearningWindowDays(options.learningWindowDays);\n  const minEventCount = coerceMinEventCount(options.minEventCount);\n  const maxWeightMagnitude = coerceMaxWeightMagnitude(options.maxWeightMagnitude);\n  const recentEvents = selectRecentEvents(\n    (\n      await readUtilityTelemetryEvents({\n        memoryDir: options.memoryDir,\n        utilityTelemetryDir: options.utilityTelemetryDir,\n      })\n    ).events,\n    now,\n    windowDays,\n  );\n\n  const grouped = new Map<string, UtilityTelemetryEvent[]>();\n  for (const event of recentEvents) {\n    const key = `${event.target}:${event.decision}`;\n    const existing = grouped.get(key);\n    if (existing) {\n      existing.push(event);\n    } else {\n      grouped.set(key, [event]);\n    }\n  }\n\n  const weights: UtilityLearningWeight[] = [];\n  for (const events of grouped.values()) {\n    if (events.length < minEventCount) continue;\n    const target = events[0].target;\n    const decision = events[0].decision;\n    const averageUtilityScore = events.reduce((sum, event) => sum + event.utilityScore, 0) / events.length;\n    const confidence = confidenceFromEvents(events.length, averageUtilityScore);\n    const learnedWeight = roundWeight(\n      clampWeight(averageUtilityScore * confidence, maxWeightMagnitude),\n    );\n    weights.push({\n      target,\n      decision,\n      eventCount: events.length,\n      learnedWeight,\n      averageUtilityScore: roundWeight(averageUtilityScore),\n      confidence,\n      outcomeCounts: outcomeCountsFor(events),\n      updatedAt,\n    });\n  }\n\n  weights.sort((left, right) => {\n    const targetCompare = left.target.localeCompare(right.target);\n    if (targetCompare !== 0) return targetCompare;\n    return left.decision.localeCompare(right.decision);\n  });\n\n  const snapshot: UtilityLearningSnapshot = {\n    version: 1,\n    updatedAt,\n    windowDays,\n    minEventCount,\n    maxWeightMagnitude,\n    weights,\n  };\n\n  if (weights.length === 0) {\n    await writeUtilityLearningSnapshot(statePath, snapshot);\n    return {\n      applied: false,\n      reason: \"insufficient_events\",\n      statePath,\n      snapshot,\n    };\n  }\n\n  await writeUtilityLearningSnapshot(statePath, snapshot);\n  return {\n    applied: true,\n    reason: \"learned\",\n    statePath,\n    snapshot,\n  };\n}\n\nexport async function getUtilityLearningStatus(options: {\n  memoryDir: string;\n  utilityTelemetryDir?: string;\n  enabled: boolean;\n  promotionByOutcomeEnabled?: boolean;\n}): Promise<UtilityLearningStatus> {\n  const rootDir = resolveUtilityTelemetryDir(options.memoryDir, options.utilityTelemetryDir);\n  const statePath = resolveUtilityLearningStatePath(options.memoryDir, options.utilityTelemetryDir);\n  if (!options.enabled) {\n    return {\n      enabled: false,\n      promotionByOutcomeEnabled: options.promotionByOutcomeEnabled === true,\n      rootDir,\n      statePath,\n      snapshot: null,\n      weights: {\n        total: 0,\n        positive: 0,\n        negative: 0,\n        zero: 0,\n      },\n    };\n  }\n\n  const snapshot = await readUtilityLearningSnapshot(options.memoryDir, options.utilityTelemetryDir);\n  const weights = snapshot?.weights ?? [];\n  return {\n    enabled: true,\n    promotionByOutcomeEnabled: options.promotionByOutcomeEnabled === true,\n    rootDir,\n    statePath,\n    snapshot,\n    weights: {\n      total: weights.length,\n      positive: weights.filter((entry) => entry.learnedWeight > 0).length,\n      negative: weights.filter((entry) => entry.learnedWeight < 0).length,\n      zero: weights.filter((entry) => entry.learnedWeight === 0).length,\n      latestUpdatedAt: snapshot?.updatedAt,\n    },\n  };\n}\n"],"mappings":";;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,OAAO,UAAU,QAAQ,iBAAiB;AAqDnD,IAAM,oCAAoC;AAC1C,IAAM,8BAA8B;AAEpC,SAAS,YAAY,OAAe,oBAAoC;AACtE,QAAM,QAAQ,OAAO,SAAS,kBAAkB,KAAK,qBAAqB,IACtE,qBACA;AACJ,SAAO,KAAK,IAAI,CAAC,OAAO,KAAK,IAAI,OAAO,KAAK,CAAC;AAChD;AAEA,SAAS,yBAAyB,OAAuB;AACvD,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;AACtC;AAEA,SAAS,oBAAoB,OAAuB;AAClD,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;AACtC;AAEA,SAAS,yBAAyB,OAAuB;AACvD,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAEA,SAAS,YAAY,OAAuB;AAC1C,SAAO,KAAK,MAAM,QAAQ,GAAI,IAAI;AACpC;AAEA,SAAS,iBAAiB,QAAmF;AAC3G,QAAM,SAA2D,CAAC;AAClE,aAAW,SAAS,QAAQ;AAC1B,WAAO,MAAM,OAAO,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK;AAAA,EACzD;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,QAAiC,KAAW,YAA6C;AACnH,MAAI,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,EAAG,QAAO,CAAC,GAAG,MAAM;AACtE,QAAM,eAAe,IAAI,QAAQ,IAAI,aAAa;AAClD,SAAO,OAAO,OAAO,CAAC,UAAU;AAC9B,UAAM,KAAK,KAAK,MAAM,MAAM,UAAU;AACtC,WAAO,OAAO,SAAS,EAAE,KAAK,MAAM;AAAA,EACtC,CAAC;AACH;AAEA,SAAS,qBAAqB,YAAoB,qBAAqC;AACrF,MAAI,cAAc,EAAG,QAAO;AAC5B,SAAO,YAAY,QAAQ,KAAK,IAAI,mBAAmB,IAAI,KAAK,IAAI,GAAG,aAAa,EAAE,CAAC,CAAC;AAC1F;AAEA,SAAS,gCAAgC,KAAuC;AAC9E,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAAG;AACzD,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,QAAM,SAAS;AACf,MAAI,OAAO,YAAY,mCAAmC;AACxD,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,MAAI,OAAO,OAAO,cAAc,YAAY,OAAO,UAAU,WAAW,GAAG;AACzE,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACxE;AACA,MAAI,OAAO,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,OAAO,UAAU,KAAK,OAAO,aAAa,GAAG;AACzG,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,MAAI,OAAO,OAAO,kBAAkB,YAAY,CAAC,OAAO,SAAS,OAAO,aAAa,KAAK,OAAO,gBAAgB,GAAG;AAClH,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACxE;AACA,MACE,OAAO,OAAO,uBAAuB,YACrC,CAAC,OAAO,SAAS,OAAO,kBAAkB,KAC1C,OAAO,qBAAqB,GAC5B;AACA,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AACA,MAAI,CAAC,MAAM,QAAQ,OAAO,OAAO,GAAG;AAClC,UAAM,IAAI,MAAM,oDAAoD;AAAA,EACtE;AAEA,QAAM,UAAU,OAAO,QAAQ,IAAI,CAAC,UAAU;AAC5C,QAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AAC/D,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC7D;AACA,UAAM,SAAS;AACf,UAAM,SAAS,OAAO;AACtB,UAAM,WAAW,OAAO;AACxB,QAAI,WAAW,eAAe,WAAW,WAAW;AAClD,YAAM,IAAI,MAAM,0DAA0D;AAAA,IAC5E;AACA,QAAI,CAAC,CAAC,WAAW,UAAU,QAAQ,SAAS,UAAU,EAAE,SAAS,OAAO,QAAQ,CAAC,GAAG;AAClF,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AACA,QAAI,OAAO,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,OAAO,UAAU,KAAK,OAAO,aAAa,GAAG;AACzG,YAAM,IAAI,MAAM,iDAAiD;AAAA,IACnE;AACA,QAAI,OAAO,OAAO,kBAAkB,YAAY,CAAC,OAAO,SAAS,OAAO,aAAa,GAAG;AACtF,YAAM,IAAI,MAAM,sDAAsD;AAAA,IACxE;AACA,QAAI,OAAO,OAAO,wBAAwB,YAAY,CAAC,OAAO,SAAS,OAAO,mBAAmB,GAAG;AAClG,YAAM,IAAI,MAAM,4DAA4D;AAAA,IAC9E;AACA,QAAI,OAAO,OAAO,eAAe,YAAY,CAAC,OAAO,SAAS,OAAO,UAAU,GAAG;AAChF,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACrE;AACA,QAAI,OAAO,OAAO,cAAc,YAAY,OAAO,UAAU,WAAW,GAAG;AACzE,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AACA,UAAM,gBAAiB,OAAO,iBAAiB,CAAC;AAChD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,eAAe,YAAY,OAAO,aAAa;AAAA,MAC/C,qBAAqB,YAAY,OAAO,mBAAmB;AAAA,MAC3D,YAAY,YAAY,QAAQ,OAAO,UAAU,CAAC;AAAA,MAClD;AAAA,MACA,WAAW,OAAO;AAAA,IACpB;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,SAAS;AAAA,IACT,WAAW,OAAO;AAAA,IAClB,YAAY,OAAO;AAAA,IACnB,eAAe,OAAO;AAAA,IACtB,oBAAoB,OAAO;AAAA,IAC3B;AAAA,EACF;AACF;AAEO,SAAS,gCAAgC,WAAmB,qBAAsC;AACvG,SAAO,KAAK,KAAK,2BAA2B,WAAW,mBAAmB,GAAG,2BAA2B;AAC1G;AAEA,eAAsB,4BACpB,WACA,qBACyC;AACzC,QAAM,YAAY,gCAAgC,WAAW,mBAAmB;AAChF,MAAI;AACF,UAAM,MAAM,KAAK,MAAM,MAAM,SAAS,WAAW,MAAM,CAAC;AACxD,WAAO,gCAAgC,GAAG;AAAA,EAC5C,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,6BACb,WACA,UACe;AACf,QAAM,WAAW,GAAG,SAAS;AAC7B,QAAM,MAAM,KAAK,QAAQ,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACxD,QAAM,UAAU,UAAU,GAAG,KAAK,UAAU,UAAU,MAAM,CAAC,CAAC;AAAA,GAAM,MAAM;AAC1E,QAAM,OAAO,UAAU,SAAS;AAClC;AAEA,eAAsB,6BAA6B,SAQhB;AACjC,QAAM,YAAY,gCAAgC,QAAQ,WAAW,QAAQ,mBAAmB;AAChG,MAAI,CAAC,QAAQ,SAAS;AACpB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ;AAAA,MACR;AAAA,MACA,UAAU;AAAA,IACZ;AAAA,EACF;AAEA,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,YAAY,IAAI,YAAY;AAClC,QAAM,aAAa,yBAAyB,QAAQ,kBAAkB;AACtE,QAAM,gBAAgB,oBAAoB,QAAQ,aAAa;AAC/D,QAAM,qBAAqB,yBAAyB,QAAQ,kBAAkB;AAC9E,QAAM,eAAe;AAAA,KAEjB,MAAM,2BAA2B;AAAA,MAC/B,WAAW,QAAQ;AAAA,MACnB,qBAAqB,QAAQ;AAAA,IAC/B,CAAC,GACD;AAAA,IACF;AAAA,IACA;AAAA,EACF;AAEA,QAAM,UAAU,oBAAI,IAAqC;AACzD,aAAW,SAAS,cAAc;AAChC,UAAM,MAAM,GAAG,MAAM,MAAM,IAAI,MAAM,QAAQ;AAC7C,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,QAAI,UAAU;AACZ,eAAS,KAAK,KAAK;AAAA,IACrB,OAAO;AACL,cAAQ,IAAI,KAAK,CAAC,KAAK,CAAC;AAAA,IAC1B;AAAA,EACF;AAEA,QAAM,UAAmC,CAAC;AAC1C,aAAW,UAAU,QAAQ,OAAO,GAAG;AACrC,QAAI,OAAO,SAAS,cAAe;AACnC,UAAM,SAAS,OAAO,CAAC,EAAE;AACzB,UAAM,WAAW,OAAO,CAAC,EAAE;AAC3B,UAAM,sBAAsB,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,cAAc,CAAC,IAAI,OAAO;AAChG,UAAM,aAAa,qBAAqB,OAAO,QAAQ,mBAAmB;AAC1E,UAAM,gBAAgB;AAAA,MACpB,YAAY,sBAAsB,YAAY,kBAAkB;AAAA,IAClE;AACA,YAAQ,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,YAAY,OAAO;AAAA,MACnB;AAAA,MACA,qBAAqB,YAAY,mBAAmB;AAAA,MACpD;AAAA,MACA,eAAe,iBAAiB,MAAM;AAAA,MACtC;AAAA,IACF,CAAC;AAAA,EACH;AAEA,UAAQ,KAAK,CAAC,MAAM,UAAU;AAC5B,UAAM,gBAAgB,KAAK,OAAO,cAAc,MAAM,MAAM;AAC5D,QAAI,kBAAkB,EAAG,QAAO;AAChC,WAAO,KAAK,SAAS,cAAc,MAAM,QAAQ;AAAA,EACnD,CAAC;AAED,QAAM,WAAoC;AAAA,IACxC,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,6BAA6B,WAAW,QAAQ;AACtD,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,6BAA6B,WAAW,QAAQ;AACtD,SAAO;AAAA,IACL,SAAS;AAAA,IACT,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,EACF;AACF;AAEA,eAAsB,yBAAyB,SAKZ;AACjC,QAAM,UAAU,2BAA2B,QAAQ,WAAW,QAAQ,mBAAmB;AACzF,QAAM,YAAY,gCAAgC,QAAQ,WAAW,QAAQ,mBAAmB;AAChG,MAAI,CAAC,QAAQ,SAAS;AACpB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,2BAA2B,QAAQ,8BAA8B;AAAA,MACjE;AAAA,MACA;AAAA,MACA,UAAU;AAAA,MACV,SAAS;AAAA,QACP,OAAO;AAAA,QACP,UAAU;AAAA,QACV,UAAU;AAAA,QACV,MAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WAAW,MAAM,4BAA4B,QAAQ,WAAW,QAAQ,mBAAmB;AACjG,QAAM,UAAU,UAAU,WAAW,CAAC;AACtC,SAAO;AAAA,IACL,SAAS;AAAA,IACT,2BAA2B,QAAQ,8BAA8B;AAAA,IACjE;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS;AAAA,MACP,OAAO,QAAQ;AAAA,MACf,UAAU,QAAQ,OAAO,CAAC,UAAU,MAAM,gBAAgB,CAAC,EAAE;AAAA,MAC7D,UAAU,QAAQ,OAAO,CAAC,UAAU,MAAM,gBAAgB,CAAC,EAAE;AAAA,MAC7D,MAAM,QAAQ,OAAO,CAAC,UAAU,MAAM,kBAAkB,CAAC,EAAE;AAAA,MAC3D,iBAAiB,UAAU;AAAA,IAC7B;AAAA,EACF;AACF;","names":[]}

package/dist/{chunk-AU7Q3LSC.js → chunk-2QSZNTDO.js}

@@ -1,3 +1,6 @@
+import {
+  CodexAdapter
+} from "./chunk-RSUYKGGZ.js";
 import {
   HermesAdapter
 } from "./chunk-42NQ7AVG.js";
@@ -7,9 +10,6 @@ import {
 import {
   ClaudeCodeAdapter
 } from "./chunk-J64TK33U.js";
-import {
-  CodexAdapter
-} from "./chunk-RSUYKGGZ.js";
 
 // src/adapters/registry.ts
 var AdapterRegistry = class {
@@ -53,4 +53,4 @@ var AdapterRegistry = class {
 export {
   AdapterRegistry
 };
-//# sourceMappingURL=chunk-AU7Q3LSC.js.map
+//# sourceMappingURL=chunk-2QSZNTDO.js.map

package/dist/{chunk-HSVJGWYS.js → chunk-2ROPI5OE.js}

@@ -1,7 +1,7 @@
 import {
   isTemporalQuery,
   recencyWindowBoundsFromPrompt
-} from "./chunk-G6R5UD3Q.js";
+} from "./chunk-MGN7VHWQ.js";
 import {
   isAbortError
 } from "./chunk-PVGDJXVK.js";
@@ -406,4 +406,4 @@ export {
   augmentWithDirectAndTemporal,
   parallelRetrieval
 };
-//# sourceMappingURL=chunk-HSVJGWYS.js.map
+//# sourceMappingURL=chunk-2ROPI5OE.js.map

package/dist/{chunk-C4SQJZAF.js → chunk-2SGJY2UY.js}

@@ -1,3 +1,6 @@
+import {
+  gatewayTaskChainOptions
+} from "./chunk-DEVUWMME.js";
 import {
   extractJsonCandidates
 } from "./chunk-UZB5KHKX.js";
@@ -348,7 +351,7 @@ async function callJudgeLlm(userPrompt, config, localLlm, fallbackLlm) {
   ];
   const modelOverride = config.extractionJudgeModel || void 0;
   const skipLocal = config.modelSource === "gateway";
-  const agentId = config.modelSource === "gateway" ? config.gatewayAgentId || void 0 : void 0;
+  const gatewayChain = gatewayTaskChainOptions(config);
   if (localLlm && !skipLocal) {
     try {
       const result = await localLlm.chatCompletion(messages, {
@@ -377,7 +380,7 @@ async function callJudgeLlm(userPrompt, config, localLlm, fallbackLlm) {
           maxTokens: 2048,
           timeoutMs: 1500,
           ...modelOverride ? { model: modelOverride } : {},
-          ...agentId ? { agentId } : {}
+          ...gatewayChain
         }
       );
       if (result?.content) {
@@ -483,4 +486,4 @@ export {
   createVerdictCache,
   createDeferCountMap
 };
-//# sourceMappingURL=chunk-C4SQJZAF.js.map
+//# sourceMappingURL=chunk-2SGJY2UY.js.map

package/dist/chunk-2SGJY2UY.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/extraction-judge.ts"],"sourcesContent":["/**\n * Extraction Judge — LLM-as-judge fact-worthiness gate (issue #376).\n *\n * Evaluates extracted facts against a durability rubric before they are\n * persisted. Facts that are unlikely to be useful 30+ days from now or\n * across sessions are rejected (or shadow-logged depending on config).\n *\n * Design constraints:\n *   - Corrections and principles are auto-approved (safety bypass).\n *   - Critical-importance facts are auto-approved.\n *   - Batches respect extractionJudgeBatchSize.\n *   - Content-hash caching avoids redundant LLM calls.\n *   - Performance budget: <= 1.5s per batch.\n */\n\nimport { createHash } from \"node:crypto\";\nimport { log } from \"./logger.js\";\nimport type { PluginConfig, ImportanceLevel } from \"./types.js\";\nimport type { LocalLlmClient } from \"./local-llm.js\";\nimport { type FallbackLlmClient, gatewayTaskChainOptions } from \"./fallback-llm.js\";\nimport { extractJsonCandidates } from \"./json-extract.js\";\nimport { normalizeProcedureSteps } from \"./procedural/procedure-types.js\";\n\n// ---------------------------------------------------------------------------\n// Public interfaces\n// ---------------------------------------------------------------------------\n\nexport interface JudgeCandidate {\n  text: string;\n  category: string;\n  confidence: number;\n  tags?: string[];\n  /** Local importance level, set by caller before judging. */\n  importanceLevel?: ImportanceLevel;\n}\n\n/**\n * Verdict kinds (issue #562, PR 1).\n *\n * - `\"accept\"`: fact is durable, persist it.\n * - `\"reject\"`: fact is not durable, drop it.\n * - `\"defer\"`: fact is ambiguous; push it back into the buffer for another\n *   pass with fresh context. Inspired by MemReader (arxiv 2604.07877).\n *\n * PR 1 only introduces the type. No emit path produces `\"defer\"` yet — the\n * defer-capable prompt, buffer re-routing, telemetry, and GRPO data\n * collection are landing in PRs 2, 3, and 4 respectively.\n */\nexport type JudgeVerdictKind = \"accept\" | \"reject\" | \"defer\";\n\n/**\n * Judge verdict shape.\n *\n * Back-compat note: `kind` is optional. Verdicts serialized before PR 1\n * (both in-memory cache entries and any persisted caches) only carry\n * `{ durable, reason }`. Downstream consumers must either read `durable`\n * directly, or use {@link getVerdictKind} / {@link isDurableVerdict} which\n * gracefully fall back to the boolean when `kind` is missing, and ignore\n * unknown future `kind` values rather than crashing.\n */\nexport interface JudgeVerdict {\n  /**\n   * True iff the fact should be persisted. For `\"defer\"` verdicts this is\n   * `false` — a deferred fact is not (yet) persisted, so callers that only\n   * look at `durable` will treat defer as \"skip this turn\", which matches\n   * the pre-PR-1 fail-closed behavior for non-accepted verdicts.\n   */\n  durable: boolean;\n  reason: string;\n  /**\n   * Optional explicit verdict kind. Added in PR 1 of issue #562. Legacy\n   * verdicts (including cache entries produced before this field existed)\n   * do not set `kind`; use {@link getVerdictKind} to read this safely.\n   */\n  kind?: JudgeVerdictKind;\n}\n\n/**\n * Resolve a verdict's effective kind.\n *\n * - If `kind` is explicitly set to one of the known values, return it.\n * - If `kind` is absent, infer from `durable` (back-compat with pre-PR-1\n *   cache entries and emit paths that have not been updated yet).\n * - If `kind` is set to an unrecognised value (forward-compat, e.g. a\n *   future cache entry loaded by an older build), fall back to `durable`\n *   so we never crash on unknown strings.\n */\nexport function getVerdictKind(verdict: JudgeVerdict): JudgeVerdictKind {\n  const raw = verdict.kind;\n  if (raw === \"accept\" || raw === \"reject\" || raw === \"defer\") {\n    return raw;\n  }\n  return verdict.durable ? \"accept\" : \"reject\";\n}\n\n/**\n * Type guard: returns `true` only for verdicts that should be persisted.\n * Treats both `\"reject\"` and `\"defer\"` as \"not durable\" — defer means the\n * caller should re-evaluate later, not write now.\n */\nexport function isDurableVerdict(verdict: JudgeVerdict): boolean {\n  return getVerdictKind(verdict) === \"accept\";\n}\n\n/**\n * Validate a cache entry loaded from persistence / another process.\n *\n * Strict: accepts legacy `{ durable, reason }` entries and new entries\n * whose `kind` is one of the three known `JudgeVerdictKind` values.\n * Rejects structurally wrong types and unknown `kind` strings so the\n * type-guard narrowing is sound — callers that receive\n * `value is JudgeVerdict` can safely treat `kind` as the declared\n * union.\n *\n * Forward-compat is handled by {@link normalizeCachedVerdict}, which\n * drops unknown `kind` strings before validation so a newer build's\n * cache entry still loads instead of being rejected.\n */\nexport function isValidCachedVerdict(value: unknown): value is JudgeVerdict {\n  if (typeof value !== \"object\" || value === null) return false;\n  const v = value as Record<string, unknown>;\n  if (typeof v.durable !== \"boolean\") return false;\n  if (typeof v.reason !== \"string\") return false;\n  if (v.kind !== undefined) {\n    if (v.kind !== \"accept\" && v.kind !== \"reject\" && v.kind !== \"defer\") {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Forward-compatible cache-entry loader.\n *\n * Drops unknown `kind` strings to `undefined` (so `getVerdictKind` can\n * fall back to `durable`), then validates structurally. Non-string\n * `kind` values are still treated as structural violations and rejected.\n * Returns the sanitised verdict, or `null` when the entry is structurally\n * unusable.\n */\nexport function normalizeCachedVerdict(value: unknown): JudgeVerdict | null {\n  if (typeof value !== \"object\" || value === null) return null;\n  const v = value as Record<string, unknown>;\n  if (typeof v.durable !== \"boolean\") return null;\n  if (typeof v.reason !== \"string\") return null;\n  let kind: JudgeVerdictKind | undefined;\n  if (v.kind !== undefined) {\n    if (typeof v.kind !== \"string\") return null;\n    if (v.kind === \"accept\" || v.kind === \"reject\" || v.kind === \"defer\") {\n      kind = v.kind;\n    }\n    // Unknown string `kind`: dropped to undefined for forward-compat.\n  }\n  const out: JudgeVerdict = { durable: v.durable, reason: v.reason };\n  if (kind !== undefined) out.kind = kind;\n  return out;\n}\n\nexport interface JudgeBatchResult {\n  verdicts: Map<number, JudgeVerdict>;\n  /** Number of verdicts served from cache. */\n  cached: number;\n  /** Number of verdicts produced by an LLM call. */\n  judged: number;\n  /** Total wall-clock time in milliseconds. */\n  elapsed: number;\n  /**\n   * Number of verdicts in this batch that resolved to `\"defer\"` (issue #562,\n   * PR 2). Callers can use this to decide whether to retain buffer turns for\n   * the next extraction pass.\n   */\n  deferred: number;\n  /**\n   * Number of defers that were forcibly converted to `\"reject\"` because the\n   * same candidate text had already been deferred at least\n   * `extractionJudgeMaxDeferrals` times. Rolled out of `deferred` — a\n   * candidate counted here is *not* also in `deferred`.\n   */\n  deferredCappedToReject: number;\n}\n\n/**\n * Per-verdict observation emitted by `judgeFactDurability` when an\n * `onVerdict` callback is supplied (issue #562, PR 3). Used to wire the\n * observation ledger / telemetry stream without coupling the judge module\n * directly to filesystem I/O. One event is emitted for every resolved\n * verdict, including auto-approved and cache-hit paths.\n */\nexport interface JudgeVerdictObservation {\n  verdict: JudgeVerdict;\n  /** The original `JudgeCandidate` passed in (same reference). */\n  candidate: JudgeCandidate;\n  /** SHA-256 of `text\\0category`, same key the cache/deferCounter use. */\n  contentHash: string;\n  /** Verdict resolution path. Useful for debugging + dashboards. */\n  source: \"auto-approve\" | \"cache\" | \"llm\" | \"llm-cap-rejected\" | \"fail-open\";\n  /**\n   * How many times this candidate had already been deferred before this\n   * verdict resolved. 0 when the candidate had never been deferred.\n   */\n  priorDeferrals: number;\n  /**\n   * Milliseconds from batch start to now. Shared across verdicts emitted in\n   * the same batch.\n   */\n  elapsedMs: number;\n}\n\n// ---------------------------------------------------------------------------\n// Prompt (embedded; mirrors prompts/extraction_judge.prompt.md)\n// ---------------------------------------------------------------------------\n\nconst JUDGE_SYSTEM_PROMPT = `You are a memory curator evaluating whether extracted facts are **durable** — worth storing for long-term recall across sessions.\n\nA fact is **durable** if it will still be useful 30+ days from now and is relevant across multiple sessions, not just the current task.\n\nReturn one of three verdicts per candidate:\n\nACCEPT — the fact is durable, persist it:\n- Personal preferences, identities, or relationships\n- Decisions with rationale that affect future work\n- Corrections to previously held beliefs\n- Principles, rules, or constraints the user wants respected\n- Stable facts about projects, tools, or workflows\n- Commitments, deadlines, or obligations\n\nREJECT — the fact is not durable, drop it:\n- Transient task details (\"currently debugging line 42\")\n- Ephemeral state (\"the build is running now\")\n- Routine operations (\"ran npm install\")\n- Conversational filler or acknowledgements\n- Information that will be stale within hours\n- Step-by-step instructions for a one-time task\n\nDEFER — the fact MIGHT be durable but needs more context to decide. The candidate will be re-evaluated on a later extraction pass with fresh context; if it cannot be resolved within a small number of re-evaluations it will be rejected.\n- Ambiguous referents (\"he said they'd follow up on it\")\n- Partial or in-progress statements that might become durable once completed\n- Future-tense commitments whose subject or timeline is unclear\n- Facts whose durability hinges on context not present in the candidate text\n\nDo NOT use defer as a soft reject. Reject facts you are confident are transient. Only defer when another turn of context would genuinely change the verdict.\n\nReturn a JSON array of objects with these fields:\n- index: number (the candidate index)\n- kind: string — one of \"accept\", \"reject\", \"defer\"\n- reason: string (brief explanation, under 80 characters)\n\nYou may also include durable (boolean) for backwards compatibility: true for accept, false for reject or defer. If kind is omitted, durable determines the verdict.\n\nRules:\n1. Return exactly one verdict per input candidate, matched by index.\n2. When in doubt between accept and reject, lean toward accept — false negatives (losing a useful fact) are worse than false positives (keeping a marginal one).\n3. Use defer only when another turn of context would genuinely change the verdict.\n4. Output valid JSON only. No markdown fences, no commentary.\n\nExample output:\n[{\"index\": 0, \"kind\": \"accept\", \"durable\": true, \"reason\": \"Stable personal preference\"}, {\"index\": 1, \"kind\": \"reject\", \"durable\": false, \"reason\": \"Ephemeral build status\"}, {\"index\": 2, \"kind\": \"defer\", \"durable\": false, \"reason\": \"Ambiguous pronoun\"}]`;\n\n// ---------------------------------------------------------------------------\n// Content-hash cache (in-memory, per-process fallback)\n// ---------------------------------------------------------------------------\n\n/** Maximum entries before evicting the oldest half. */\nconst VERDICT_CACHE_MAX_SIZE = 10_000;\n\n/** Module-level fallback cache, used when callers do not pass their own. */\nconst defaultVerdictCache = new Map<string, JudgeVerdict>();\n\n/**\n * Per-content-hash deferral counter (issue #562, PR 2).\n *\n * When the judge emits a `\"defer\"` verdict for a candidate whose content\n * has already been deferred `extractionJudgeMaxDeferrals` times, the verdict\n * is forcibly converted to `\"reject\"` so a pathological LLM response cannot\n * produce an infinite defer loop.\n *\n * Module-level with a size cap so stale test state cannot leak between runs\n * in the unlikely case a caller does not clear it between processes.\n */\nconst defaultDeferCounts = new Map<string, number>();\nconst DEFER_COUNT_MAX_SIZE = 20_000;\n\nfunction cacheKey(text: string, category: string): string {\n  return createHash(\"sha256\").update(`${text}\\0${category}`).digest(\"hex\");\n}\n\n/**\n * Resolve the effective defer cap from config, defaulting to 2 when the\n * config value is missing or non-positive. Matches the PR 2 spec.\n */\nfunction resolveDeferCap(config: PluginConfig): number {\n  const raw = (config as { extractionJudgeMaxDeferrals?: number })\n    .extractionJudgeMaxDeferrals;\n  if (typeof raw === \"number\" && Number.isFinite(raw) && raw >= 1) {\n    return Math.floor(raw);\n  }\n  return 2;\n}\n\n/**\n * Enforce the max-size invariant on a verdict cache. When the cache exceeds\n * VERDICT_CACHE_MAX_SIZE, the oldest half of entries are deleted (Map\n * iteration order is insertion order).\n */\nfunction enforceMaxCacheSize(cache: Map<string, JudgeVerdict>): void {\n  if (cache.size <= VERDICT_CACHE_MAX_SIZE) return;\n  const deleteCount = Math.floor(cache.size / 2);\n  let deleted = 0;\n  for (const key of cache.keys()) {\n    if (deleted >= deleteCount) break;\n    cache.delete(key);\n    deleted++;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Categories that bypass the judge (safety / correctness)\n// ---------------------------------------------------------------------------\n\nconst AUTO_APPROVE_CATEGORIES = new Set([\"correction\", \"principle\"]);\n\n/** Explicit trigger phrasing — procedures must match to persist (issue #519). */\nconst PROCEDURE_TRIGGER_RE =\n  /(when you|whenever|before you|before running|always\\s|first\\b.*\\bthen|to deploy|to ship|run these steps|follow these steps|how (i|we)\\s|recipe for|workflow|each time you)/i;\n\n/**\n * Deterministic gate for extracted `procedure` memories: ≥2 steps with non-empty\n * intents and explicit trigger wording in title and/or steps.\n */\nexport function validateProcedureExtraction(input: {\n  content: string;\n  procedureSteps?: unknown;\n}): JudgeVerdict {\n  const steps = normalizeProcedureSteps(input.procedureSteps);\n  if (steps.length < 2) {\n    return { durable: false, reason: \"Procedure requires at least two steps with intents\" };\n  }\n  const combined = [input.content, ...steps.map((s) => s.intent)].join(\" \").toLowerCase();\n  if (!PROCEDURE_TRIGGER_RE.test(combined)) {\n    return { durable: false, reason: \"Procedure missing explicit trigger phrasing\" };\n  }\n  return { durable: true, reason: \"Procedure structure validated\" };\n}\n\n// ---------------------------------------------------------------------------\n// Core judge function\n// ---------------------------------------------------------------------------\n\n/**\n * Evaluate a batch of candidate facts for durability.\n *\n * Auto-approves corrections, principles, and critical-importance facts.\n * Remaining candidates are batched (up to extractionJudgeBatchSize),\n * checked against an in-memory content-hash cache, and sent to the LLM\n * for verdict.\n */\nexport async function judgeFactDurability(\n  candidates: JudgeCandidate[],\n  config: PluginConfig,\n  localLlm: LocalLlmClient | null,\n  fallbackLlm: FallbackLlmClient | null,\n  cache?: Map<string, JudgeVerdict>,\n  deferCounts?: Map<string, number>,\n  onVerdict?: (observation: JudgeVerdictObservation) => void,\n): Promise<JudgeBatchResult> {\n  const startMs = Date.now();\n  const verdicts = new Map<number, JudgeVerdict>();\n  let cached = 0;\n  let judged = 0;\n  let deferred = 0;\n  let deferredCappedToReject = 0;\n\n  // Use caller-provided cache for per-orchestrator scoping, or fall back\n  // to the module-level default cache.\n  const verdictCache = cache ?? defaultVerdictCache;\n  const deferCountMap = deferCounts ?? defaultDeferCounts;\n  const deferCap = resolveDeferCap(config);\n\n  // Lazy emit (Codex P2): when `onVerdict` is undefined (default path —\n  // telemetry off), payload construction is skipped entirely. Callers\n  // pass a factory instead of a pre-built observation so the `sha256`\n  // `contentHash` and surrounding object allocation only run when a\n  // subscriber is present. For large batches with telemetry off this\n  // removes per-verdict overhead that would otherwise fire on every\n  // auto-approved / cache / fail-open path.\n  const emit = (build: () => JudgeVerdictObservation): void => {\n    if (!onVerdict) return;\n    let observation: JudgeVerdictObservation;\n    try {\n      observation = build();\n    } catch (err) {\n      log.debug(\n        `extraction-judge: onVerdict builder threw (non-fatal): ${err instanceof Error ? err.message : String(err)}`,\n      );\n      return;\n    }\n    try {\n      onVerdict(observation);\n    } catch (err) {\n      // Fail-open: telemetry errors must never block extraction.\n      log.debug(\n        `extraction-judge: onVerdict callback threw (non-fatal): ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  };\n\n  if (candidates.length === 0) {\n    return {\n      verdicts,\n      cached,\n      judged,\n      elapsed: 0,\n      deferred,\n      deferredCappedToReject,\n    };\n  }\n\n  // Indices that need LLM judgment\n  const pendingIndices: number[] = [];\n\n  for (let i = 0; i < candidates.length; i++) {\n    const c = candidates[i];\n\n    // Auto-approve safety categories\n    if (AUTO_APPROVE_CATEGORIES.has(c.category)) {\n      const v: JudgeVerdict = {\n        durable: true,\n        reason: `Auto-approved: ${c.category} category bypasses judge`,\n      };\n      verdicts.set(i, v);\n      emit(() => ({\n        verdict: v,\n        candidate: c,\n        contentHash: cacheKey(c.text, c.category),\n        source: \"auto-approve\",\n        priorDeferrals: 0,\n        elapsedMs: Date.now() - startMs,\n      }));\n      continue;\n    }\n\n    // Auto-approve critical importance\n    if (c.importanceLevel === \"critical\") {\n      const v: JudgeVerdict = {\n        durable: true,\n        reason: \"Auto-approved: critical importance\",\n      };\n      verdicts.set(i, v);\n      emit(() => ({\n        verdict: v,\n        candidate: c,\n        contentHash: cacheKey(c.text, c.category),\n        source: \"auto-approve\",\n        priorDeferrals: 0,\n        elapsedMs: Date.now() - startMs,\n      }));\n      continue;\n    }\n\n    // Check cache\n    const key = cacheKey(c.text, c.category);\n    const cachedVerdict = verdictCache.get(key);\n    if (cachedVerdict) {\n      verdicts.set(i, cachedVerdict);\n      cached++;\n      emit(() => ({\n        verdict: cachedVerdict,\n        candidate: c,\n        contentHash: key,\n        source: \"cache\",\n        priorDeferrals: deferCountMap.get(key) ?? 0,\n        elapsedMs: Date.now() - startMs,\n      }));\n      continue;\n    }\n\n    pendingIndices.push(i);\n  }\n\n  // If all resolved without LLM, return early\n  if (pendingIndices.length === 0) {\n    return {\n      verdicts,\n      cached,\n      judged,\n      elapsed: Date.now() - startMs,\n      deferred,\n      deferredCappedToReject,\n    };\n  }\n\n  // Batch the pending candidates up to batchSize\n  const batchSize = config.extractionJudgeBatchSize;\n  for (let batchStart = 0; batchStart < pendingIndices.length; batchStart += batchSize) {\n    const batchIndices = pendingIndices.slice(batchStart, batchStart + batchSize);\n    const batchPayload = batchIndices.map((idx) => ({\n      index: idx,\n      text: candidates[idx].text,\n      category: candidates[idx].category,\n      confidence: candidates[idx].confidence,\n    }));\n\n    const userPrompt = JSON.stringify(batchPayload);\n\n    try {\n      const llmResponse = await callJudgeLlm(\n        userPrompt,\n        config,\n        localLlm,\n        fallbackLlm,\n      );\n\n      if (llmResponse) {\n        const parsed = parseJudgeResponse(llmResponse, batchIndices);\n        // Per-batch defer-increment dedupe (codex P2): a single extraction\n        // pass must not advance the cap more than once for identical\n        // candidate content, even if the same text appears multiple times\n        // in the same LLM response. Duplicate hits share the first\n        // increment's `priorDeferrals` snapshot.\n        const deferredThisBatch = new Set<string>();\n        for (const [idx, rawVerdict] of parsed.entries()) {\n          const c = candidates[idx];\n          const key = cacheKey(c.text, c.category);\n          let verdict = rawVerdict;\n          let source: JudgeVerdictObservation[\"source\"] = \"llm\";\n          const priorDefers = deferCountMap.get(key) ?? 0;\n\n          // Defer cap (issue #562, PR 2). A candidate that has already been\n          // deferred `deferCap` times is forcibly rejected so a pathological\n          // LLM response cannot produce an infinite defer loop.\n          if (getVerdictKind(verdict) === \"defer\") {\n            if (priorDefers >= deferCap) {\n              verdict = {\n                durable: false,\n                reason: `Defer cap reached (${deferCap} prior defers); rejecting`,\n                kind: \"reject\",\n              };\n              source = \"llm-cap-rejected\";\n              // Only clear + count the cap conversion once per batch for\n              // this key — duplicates in the same response all resolve to\n              // reject but should not inflate the cap-rejection counter.\n              if (!deferredThisBatch.has(key)) {\n                deferCountMap.delete(key);\n                deferredCappedToReject++;\n                deferredThisBatch.add(key);\n              }\n            } else if (!deferredThisBatch.has(key)) {\n              deferCountMap.set(key, priorDefers + 1);\n              deferred++;\n              deferredThisBatch.add(key);\n              // Bound the per-process defer-counter map.\n              if (deferCountMap.size > DEFER_COUNT_MAX_SIZE) {\n                const drop = Math.floor(deferCountMap.size / 2);\n                let dropped = 0;\n                for (const k of deferCountMap.keys()) {\n                  if (dropped >= drop) break;\n                  deferCountMap.delete(k);\n                  dropped++;\n                }\n              }\n            }\n            // else: duplicate defer for a key already counted this batch —\n            // no additional counter increment, verdict still marked defer.\n          } else {\n            // On accept/reject, clear any outstanding defer counter so a\n            // future reappearance of the same text starts fresh.\n            deferCountMap.delete(key);\n          }\n\n          verdicts.set(idx, verdict);\n          judged++;\n          // Cache non-defer verdicts. Defer is intentionally NOT cached:\n          // caching it would short-circuit the re-evaluation pass that is\n          // the entire point of the defer verdict.\n          if (getVerdictKind(verdict) !== \"defer\") {\n            verdictCache.set(key, verdict);\n          }\n          emit(() => ({\n            verdict,\n            candidate: c,\n            contentHash: key,\n            source,\n            priorDeferrals: priorDefers,\n            elapsedMs: Date.now() - startMs,\n          }));\n        }\n        // Evict oldest entries if cache exceeds max size\n        enforceMaxCacheSize(verdictCache);\n      }\n    } catch (err) {\n      // Fail-open: if the LLM call fails, approve all candidates in this batch\n      log.warn(\n        `extraction-judge: LLM call failed, approving batch (fail-open): ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n\n    // Fill in any missing verdicts from this batch (fail-open: approve).\n    // Clear defer counts so a transient outage doesn't leave stale state\n    // that causes later defers to hit the cap early.\n    for (const idx of batchIndices) {\n      if (!verdicts.has(idx)) {\n        const c = candidates[idx];\n        const hash = cacheKey(c.text, c.category);\n        // Capture the prior deferral count BEFORE clearing so the\n        // telemetry event reflects the true state rather than always 0.\n        const priorDefers = deferCountMap.get(hash) ?? 0;\n        deferCountMap.delete(hash);\n        const v: JudgeVerdict = {\n          durable: true,\n          reason: \"Approved by default (judge unavailable or parse error)\",\n        };\n        verdicts.set(idx, v);\n        emit(() => {\n          return {\n            verdict: v,\n            candidate: c,\n            contentHash: hash,\n            source: \"fail-open\",\n            priorDeferrals: priorDefers,\n            elapsedMs: Date.now() - startMs,\n          };\n        });\n      }\n    }\n  }\n\n  return {\n    verdicts,\n    cached,\n    judged,\n    elapsed: Date.now() - startMs,\n    deferred,\n    deferredCappedToReject,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// LLM call helpers\n// ---------------------------------------------------------------------------\n\nasync function callJudgeLlm(\n  userPrompt: string,\n  config: PluginConfig,\n  localLlm: LocalLlmClient | null,\n  fallbackLlm: FallbackLlmClient | null,\n): Promise<string | null> {\n  const messages: Array<{ role: \"system\" | \"user\"; content: string }> = [\n    { role: \"system\", content: JUDGE_SYSTEM_PROMPT },\n    { role: \"user\", content: userPrompt },\n  ];\n\n  const modelOverride = config.extractionJudgeModel || undefined;\n\n  // When modelSource is \"gateway\", skip localLlm and go directly to fallback\n  // (the gateway-routed backend). This respects the operator's explicit\n  // routing preference.\n  const skipLocal = config.modelSource === \"gateway\";\n\n  // Route judge-gated extractions through the SAME shared resolution as every\n  // other background task (taskModelChain > gatewayAgentId in gateway mode), so\n  // the judge never silently falls back to the persona/default chain when a\n  // task chain is configured (gotcha #22, #39). Issue #1365 / PR #1425.\n  const gatewayChain = gatewayTaskChainOptions(config);\n\n  // Try local LLM first (unless modelSource says gateway)\n  if (localLlm && !skipLocal) {\n    try {\n      const result = await (localLlm as any).chatCompletion(messages, {\n        temperature: 0.1,\n        maxTokens: 2048,\n        responseFormat: { type: \"json_object\" },\n        timeoutMs: 1500,\n        operation: \"extraction-judge\",\n        ...(modelOverride ? { model: modelOverride } : {}),\n      });\n      if (result?.content) {\n        return result.content;\n      }\n    } catch (err) {\n      log.debug(\n        `extraction-judge: local LLM failed, trying fallback: ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  }\n\n  // Try fallback LLM\n  if (fallbackLlm) {\n    try {\n      const result = await fallbackLlm.chatCompletion(\n        messages as Array<{ role: \"system\" | \"user\" | \"assistant\"; content: string }>,\n        {\n          temperature: 0.1,\n          maxTokens: 2048,\n          timeoutMs: 1500,\n          ...(modelOverride ? { model: modelOverride } : {}),\n          ...gatewayChain,\n        },\n      );\n      if (result?.content) {\n        return result.content;\n      }\n    } catch (err) {\n      log.debug(\n        `extraction-judge: fallback LLM failed: ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  }\n\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// Response parsing\n// ---------------------------------------------------------------------------\n\nfunction parseJudgeResponse(\n  raw: string,\n  expectedIndices: number[],\n): Map<number, JudgeVerdict> {\n  const result = new Map<number, JudgeVerdict>();\n  const expectedSet = new Set(expectedIndices);\n\n  try {\n    // Try direct parse first, then fall back to JSON extraction\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(raw);\n    } catch {\n      const candidates = extractJsonCandidates(raw);\n      if (candidates.length > 0) {\n        parsed = JSON.parse(candidates[0]);\n      }\n    }\n\n    if (!Array.isArray(parsed)) {\n      // Might be wrapped in an object with a key\n      if (parsed && typeof parsed === \"object\" && !Array.isArray(parsed)) {\n        const values = Object.values(parsed as Record<string, unknown>);\n        for (const v of values) {\n          if (Array.isArray(v)) {\n            parsed = v;\n            break;\n          }\n        }\n      }\n      if (!Array.isArray(parsed)) {\n        log.debug(\"extraction-judge: response is not an array, cannot parse\");\n        return result;\n      }\n    }\n\n    for (const item of parsed) {\n      if (\n        typeof item !== \"object\" ||\n        item === null ||\n        typeof (item as any).index !== \"number\"\n      ) {\n        continue;\n      }\n      const idx = (item as any).index as number;\n      if (!expectedSet.has(idx)) continue;\n\n      // Parse kind first — it's the primary signal in PR 2 and above.\n      // Fall back to durable for pre-PR-2 model responses that only return\n      // the boolean.\n      let kind: JudgeVerdictKind | undefined;\n      const rawKind = (item as any).kind;\n      const rawAction = (item as any).action;\n      if (rawKind === \"accept\" || rawKind === \"reject\" || rawKind === \"defer\") {\n        kind = rawKind;\n      } else if (\n        rawAction === \"accept\" ||\n        rawAction === \"reject\" ||\n        rawAction === \"defer\"\n      ) {\n        // Tolerate `action` as an alias — MemReader uses that word in the\n        // paper and models may echo it.\n        kind = rawAction;\n      }\n\n      const hasDurable = typeof (item as any).durable === \"boolean\";\n      const durableFromModel = hasDurable\n        ? ((item as any).durable as boolean)\n        : undefined;\n\n      // Resolve the durable flag from kind when present; otherwise trust\n      // the model's boolean; otherwise fail-open to durable=true.\n      let durable: boolean;\n      if (kind === \"accept\") {\n        durable = true;\n      } else if (kind === \"reject\" || kind === \"defer\") {\n        durable = false;\n      } else if (durableFromModel !== undefined) {\n        durable = durableFromModel;\n      } else {\n        durable = true; // fail-open\n      }\n\n      const reason =\n        typeof (item as any).reason === \"string\"\n          ? ((item as any).reason as string).slice(0, 120)\n          : \"No reason provided\";\n\n      const verdict: JudgeVerdict = { durable, reason };\n      if (kind !== undefined) verdict.kind = kind;\n      result.set(idx, verdict);\n    }\n  } catch (err) {\n    log.debug(\n      `extraction-judge: failed to parse response: ${err instanceof Error ? err.message : String(err)}`,\n    );\n  }\n\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Cache management (exposed for testing)\n// ---------------------------------------------------------------------------\n\n/** Clear the in-memory default verdict cache. Primarily for tests. */\nexport function clearVerdictCache(): void {\n  defaultVerdictCache.clear();\n  defaultDeferCounts.clear();\n}\n\n/** Return the current default verdict cache size. Primarily for tests. */\nexport function verdictCacheSize(): number {\n  return defaultVerdictCache.size;\n}\n\n/** Create a new per-instance verdict cache. Orchestrators should hold one. */\nexport function createVerdictCache(): Map<string, JudgeVerdict> {\n  return new Map();\n}\n\n/**\n * Create a new per-instance defer-counter map. Orchestrators should hold one\n * alongside their verdict cache so defer counts survive across extraction\n * passes within a single orchestrator but do not leak across orchestrators.\n */\nexport function createDeferCountMap(): Map<string, number> {\n  return new Map();\n}\n"],"mappings":";;;;;;;;;;;;;;AAeA,SAAS,kBAAkB;AAwEpB,SAAS,eAAe,SAAyC;AACtE,QAAM,MAAM,QAAQ;AACpB,MAAI,QAAQ,YAAY,QAAQ,YAAY,QAAQ,SAAS;AAC3D,WAAO;AAAA,EACT;AACA,SAAO,QAAQ,UAAU,WAAW;AACtC;AAOO,SAAS,iBAAiB,SAAgC;AAC/D,SAAO,eAAe,OAAO,MAAM;AACrC;AAgBO,SAAS,qBAAqB,OAAuC;AAC1E,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,UAAW,QAAO;AAC3C,MAAI,OAAO,EAAE,WAAW,SAAU,QAAO;AACzC,MAAI,EAAE,SAAS,QAAW;AACxB,QAAI,EAAE,SAAS,YAAY,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AACpE,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAWO,SAAS,uBAAuB,OAAqC;AAC1E,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,UAAW,QAAO;AAC3C,MAAI,OAAO,EAAE,WAAW,SAAU,QAAO;AACzC,MAAI;AACJ,MAAI,EAAE,SAAS,QAAW;AACxB,QAAI,OAAO,EAAE,SAAS,SAAU,QAAO;AACvC,QAAI,EAAE,SAAS,YAAY,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS;AACpE,aAAO,EAAE;AAAA,IACX;AAAA,EAEF;AACA,QAAM,MAAoB,EAAE,SAAS,EAAE,SAAS,QAAQ,EAAE,OAAO;AACjE,MAAI,SAAS,OAAW,KAAI,OAAO;AACnC,SAAO;AACT;AAwDA,IAAM,sBAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAmD5B,IAAM,yBAAyB;AAG/B,IAAM,sBAAsB,oBAAI,IAA0B;AAa1D,IAAM,qBAAqB,oBAAI,IAAoB;AACnD,IAAM,uBAAuB;AAE7B,SAAS,SAAS,MAAc,UAA0B;AACxD,SAAO,WAAW,QAAQ,EAAE,OAAO,GAAG,IAAI,KAAK,QAAQ,EAAE,EAAE,OAAO,KAAK;AACzE;AAMA,SAAS,gBAAgB,QAA8B;AACrD,QAAM,MAAO,OACV;AACH,MAAI,OAAO,QAAQ,YAAY,OAAO,SAAS,GAAG,KAAK,OAAO,GAAG;AAC/D,WAAO,KAAK,MAAM,GAAG;AAAA,EACvB;AACA,SAAO;AACT;AAOA,SAAS,oBAAoB,OAAwC;AACnE,MAAI,MAAM,QAAQ,uBAAwB;AAC1C,QAAM,cAAc,KAAK,MAAM,MAAM,OAAO,CAAC;AAC7C,MAAI,UAAU;AACd,aAAW,OAAO,MAAM,KAAK,GAAG;AAC9B,QAAI,WAAW,YAAa;AAC5B,UAAM,OAAO,GAAG;AAChB;AAAA,EACF;AACF;AAMA,IAAM,0BAA0B,oBAAI,IAAI,CAAC,cAAc,WAAW,CAAC;AAGnE,IAAM,uBACJ;AAMK,SAAS,4BAA4B,OAG3B;AACf,QAAM,QAAQ,wBAAwB,MAAM,cAAc;AAC1D,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,EAAE,SAAS,OAAO,QAAQ,qDAAqD;AAAA,EACxF;AACA,QAAM,WAAW,CAAC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,EAAE,YAAY;AACtF,MAAI,CAAC,qBAAqB,KAAK,QAAQ,GAAG;AACxC,WAAO,EAAE,SAAS,OAAO,QAAQ,8CAA8C;AAAA,EACjF;AACA,SAAO,EAAE,SAAS,MAAM,QAAQ,gCAAgC;AAClE;AAcA,eAAsB,oBACpB,YACA,QACA,UACA,aACA,OACA,aACA,WAC2B;AAC3B,QAAM,UAAU,KAAK,IAAI;AACzB,QAAM,WAAW,oBAAI,IAA0B;AAC/C,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,WAAW;AACf,MAAI,yBAAyB;AAI7B,QAAM,eAAe,SAAS;AAC9B,QAAM,gBAAgB,eAAe;AACrC,QAAM,WAAW,gBAAgB,MAAM;AASvC,QAAM,OAAO,CAAC,UAA+C;AAC3D,QAAI,CAAC,UAAW;AAChB,QAAI;AACJ,QAAI;AACF,oBAAc,MAAM;AAAA,IACtB,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,0DAA0D,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC5G;AACA;AAAA,IACF;AACA,QAAI;AACF,gBAAU,WAAW;AAAA,IACvB,SAAS,KAAK;AAEZ,UAAI;AAAA,QACF,2DAA2D,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC7G;AAAA,IACF;AAAA,EACF;AAEA,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,iBAA2B,CAAC;AAElC,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,UAAM,IAAI,WAAW,CAAC;AAGtB,QAAI,wBAAwB,IAAI,EAAE,QAAQ,GAAG;AAC3C,YAAM,IAAkB;AAAA,QACtB,SAAS;AAAA,QACT,QAAQ,kBAAkB,EAAE,QAAQ;AAAA,MACtC;AACA,eAAS,IAAI,GAAG,CAAC;AACjB,WAAK,OAAO;AAAA,QACV,SAAS;AAAA,QACT,WAAW;AAAA,QACX,aAAa,SAAS,EAAE,MAAM,EAAE,QAAQ;AAAA,QACxC,QAAQ;AAAA,QACR,gBAAgB;AAAA,QAChB,WAAW,KAAK,IAAI,IAAI;AAAA,MAC1B,EAAE;AACF;AAAA,IACF;AAGA,QAAI,EAAE,oBAAoB,YAAY;AACpC,YAAM,IAAkB;AAAA,QACtB,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AACA,eAAS,IAAI,GAAG,CAAC;AACjB,WAAK,OAAO;AAAA,QACV,SAAS;AAAA,QACT,WAAW;AAAA,QACX,aAAa,SAAS,EAAE,MAAM,EAAE,QAAQ;AAAA,QACxC,QAAQ;AAAA,QACR,gBAAgB;AAAA,QAChB,WAAW,KAAK,IAAI,IAAI;AAAA,MAC1B,EAAE;AACF;AAAA,IACF;AAGA,UAAM,MAAM,SAAS,EAAE,MAAM,EAAE,QAAQ;AACvC,UAAM,gBAAgB,aAAa,IAAI,GAAG;AAC1C,QAAI,eAAe;AACjB,eAAS,IAAI,GAAG,aAAa;AAC7B;AACA,WAAK,OAAO;AAAA,QACV,SAAS;AAAA,QACT,WAAW;AAAA,QACX,aAAa;AAAA,QACb,QAAQ;AAAA,QACR,gBAAgB,cAAc,IAAI,GAAG,KAAK;AAAA,QAC1C,WAAW,KAAK,IAAI,IAAI;AAAA,MAC1B,EAAE;AACF;AAAA,IACF;AAEA,mBAAe,KAAK,CAAC;AAAA,EACvB;AAGA,MAAI,eAAe,WAAW,GAAG;AAC/B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS,KAAK,IAAI,IAAI;AAAA,MACtB;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAY,OAAO;AACzB,WAAS,aAAa,GAAG,aAAa,eAAe,QAAQ,cAAc,WAAW;AACpF,UAAM,eAAe,eAAe,MAAM,YAAY,aAAa,SAAS;AAC5E,UAAM,eAAe,aAAa,IAAI,CAAC,SAAS;AAAA,MAC9C,OAAO;AAAA,MACP,MAAM,WAAW,GAAG,EAAE;AAAA,MACtB,UAAU,WAAW,GAAG,EAAE;AAAA,MAC1B,YAAY,WAAW,GAAG,EAAE;AAAA,IAC9B,EAAE;AAEF,UAAM,aAAa,KAAK,UAAU,YAAY;AAE9C,QAAI;AACF,YAAM,cAAc,MAAM;AAAA,QACxB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,UAAI,aAAa;AACf,cAAM,SAAS,mBAAmB,aAAa,YAAY;AAM3D,cAAM,oBAAoB,oBAAI,IAAY;AAC1C,mBAAW,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,GAAG;AAChD,gBAAM,IAAI,WAAW,GAAG;AACxB,gBAAM,MAAM,SAAS,EAAE,MAAM,EAAE,QAAQ;AACvC,cAAI,UAAU;AACd,cAAI,SAA4C;AAChD,gBAAM,cAAc,cAAc,IAAI,GAAG,KAAK;AAK9C,cAAI,eAAe,OAAO,MAAM,SAAS;AACvC,gBAAI,eAAe,UAAU;AAC3B,wBAAU;AAAA,gBACR,SAAS;AAAA,gBACT,QAAQ,sBAAsB,QAAQ;AAAA,gBACtC,MAAM;AAAA,cACR;AACA,uBAAS;AAIT,kBAAI,CAAC,kBAAkB,IAAI,GAAG,GAAG;AAC/B,8BAAc,OAAO,GAAG;AACxB;AACA,kCAAkB,IAAI,GAAG;AAAA,cAC3B;AAAA,YACF,WAAW,CAAC,kBAAkB,IAAI,GAAG,GAAG;AACtC,4BAAc,IAAI,KAAK,cAAc,CAAC;AACtC;AACA,gCAAkB,IAAI,GAAG;AAEzB,kBAAI,cAAc,OAAO,sBAAsB;AAC7C,sBAAM,OAAO,KAAK,MAAM,cAAc,OAAO,CAAC;AAC9C,oBAAI,UAAU;AACd,2BAAW,KAAK,cAAc,KAAK,GAAG;AACpC,sBAAI,WAAW,KAAM;AACrB,gCAAc,OAAO,CAAC;AACtB;AAAA,gBACF;AAAA,cACF;AAAA,YACF;AAAA,UAGF,OAAO;AAGL,0BAAc,OAAO,GAAG;AAAA,UAC1B;AAEA,mBAAS,IAAI,KAAK,OAAO;AACzB;AAIA,cAAI,eAAe,OAAO,MAAM,SAAS;AACvC,yBAAa,IAAI,KAAK,OAAO;AAAA,UAC/B;AACA,eAAK,OAAO;AAAA,YACV;AAAA,YACA,WAAW;AAAA,YACX,aAAa;AAAA,YACb;AAAA,YACA,gBAAgB;AAAA,YAChB,WAAW,KAAK,IAAI,IAAI;AAAA,UAC1B,EAAE;AAAA,QACJ;AAEA,4BAAoB,YAAY;AAAA,MAClC;AAAA,IACF,SAAS,KAAK;AAEZ,UAAI;AAAA,QACF,mEAAmE,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACrH;AAAA,IACF;AAKA,eAAW,OAAO,cAAc;AAC9B,UAAI,CAAC,SAAS,IAAI,GAAG,GAAG;AACtB,cAAM,IAAI,WAAW,GAAG;AACxB,cAAM,OAAO,SAAS,EAAE,MAAM,EAAE,QAAQ;AAGxC,cAAM,cAAc,cAAc,IAAI,IAAI,KAAK;AAC/C,sBAAc,OAAO,IAAI;AACzB,cAAM,IAAkB;AAAA,UACtB,SAAS;AAAA,UACT,QAAQ;AAAA,QACV;AACA,iBAAS,IAAI,KAAK,CAAC;AACnB,aAAK,MAAM;AACT,iBAAO;AAAA,YACL,SAAS;AAAA,YACT,WAAW;AAAA,YACX,aAAa;AAAA,YACb,QAAQ;AAAA,YACR,gBAAgB;AAAA,YAChB,WAAW,KAAK,IAAI,IAAI;AAAA,UAC1B;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,KAAK,IAAI,IAAI;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AACF;AAMA,eAAe,aACb,YACA,QACA,UACA,aACwB;AACxB,QAAM,WAAgE;AAAA,IACpE,EAAE,MAAM,UAAU,SAAS,oBAAoB;AAAA,IAC/C,EAAE,MAAM,QAAQ,SAAS,WAAW;AAAA,EACtC;AAEA,QAAM,gBAAgB,OAAO,wBAAwB;AAKrD,QAAM,YAAY,OAAO,gBAAgB;AAMzC,QAAM,eAAe,wBAAwB,MAAM;AAGnD,MAAI,YAAY,CAAC,WAAW;AAC1B,QAAI;AACF,YAAM,SAAS,MAAO,SAAiB,eAAe,UAAU;AAAA,QAC9D,aAAa;AAAA,QACb,WAAW;AAAA,QACX,gBAAgB,EAAE,MAAM,cAAc;AAAA,QACtC,WAAW;AAAA,QACX,WAAW;AAAA,QACX,GAAI,gBAAgB,EAAE,OAAO,cAAc,IAAI,CAAC;AAAA,MAClD,CAAC;AACD,UAAI,QAAQ,SAAS;AACnB,eAAO,OAAO;AAAA,MAChB;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,wDAAwD,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC1G;AAAA,IACF;AAAA,EACF;AAGA,MAAI,aAAa;AACf,QAAI;AACF,YAAM,SAAS,MAAM,YAAY;AAAA,QAC/B;AAAA,QACA;AAAA,UACE,aAAa;AAAA,UACb,WAAW;AAAA,UACX,WAAW;AAAA,UACX,GAAI,gBAAgB,EAAE,OAAO,cAAc,IAAI,CAAC;AAAA,UAChD,GAAG;AAAA,QACL;AAAA,MACF;AACA,UAAI,QAAQ,SAAS;AACnB,eAAO,OAAO;AAAA,MAChB;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,0CAA0C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC5F;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,mBACP,KACA,iBAC2B;AAC3B,QAAM,SAAS,oBAAI,IAA0B;AAC7C,QAAM,cAAc,IAAI,IAAI,eAAe;AAE3C,MAAI;AAEF,QAAI;AACJ,QAAI;AACF,eAAS,KAAK,MAAM,GAAG;AAAA,IACzB,QAAQ;AACN,YAAM,aAAa,sBAAsB,GAAG;AAC5C,UAAI,WAAW,SAAS,GAAG;AACzB,iBAAS,KAAK,MAAM,WAAW,CAAC,CAAC;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAE1B,UAAI,UAAU,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,GAAG;AAClE,cAAM,SAAS,OAAO,OAAO,MAAiC;AAC9D,mBAAW,KAAK,QAAQ;AACtB,cAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,qBAAS;AACT;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,YAAI,MAAM,0DAA0D;AACpE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,eAAW,QAAQ,QAAQ;AACzB,UACE,OAAO,SAAS,YAChB,SAAS,QACT,OAAQ,KAAa,UAAU,UAC/B;AACA;AAAA,MACF;AACA,YAAM,MAAO,KAAa;AAC1B,UAAI,CAAC,YAAY,IAAI,GAAG,EAAG;AAK3B,UAAI;AACJ,YAAM,UAAW,KAAa;AAC9B,YAAM,YAAa,KAAa;AAChC,UAAI,YAAY,YAAY,YAAY,YAAY,YAAY,SAAS;AACvE,eAAO;AAAA,MACT,WACE,cAAc,YACd,cAAc,YACd,cAAc,SACd;AAGA,eAAO;AAAA,MACT;AAEA,YAAM,aAAa,OAAQ,KAAa,YAAY;AACpD,YAAM,mBAAmB,aACnB,KAAa,UACf;AAIJ,UAAI;AACJ,UAAI,SAAS,UAAU;AACrB,kBAAU;AAAA,MACZ,WAAW,SAAS,YAAY,SAAS,SAAS;AAChD,kBAAU;AAAA,MACZ,WAAW,qBAAqB,QAAW;AACzC,kBAAU;AAAA,MACZ,OAAO;AACL,kBAAU;AAAA,MACZ;AAEA,YAAM,SACJ,OAAQ,KAAa,WAAW,WAC1B,KAAa,OAAkB,MAAM,GAAG,GAAG,IAC7C;AAEN,YAAM,UAAwB,EAAE,SAAS,OAAO;AAChD,UAAI,SAAS,OAAW,SAAQ,OAAO;AACvC,aAAO,IAAI,KAAK,OAAO;AAAA,IACzB;AAAA,EACF,SAAS,KAAK;AACZ,QAAI;AAAA,MACF,+CAA+C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IACjG;AAAA,EACF;AAEA,SAAO;AACT;AAOO,SAAS,oBAA0B;AACxC,sBAAoB,MAAM;AAC1B,qBAAmB,MAAM;AAC3B;AAGO,SAAS,mBAA2B;AACzC,SAAO,oBAAoB;AAC7B;AAGO,SAAS,qBAAgD;AAC9D,SAAO,oBAAI,IAAI;AACjB;AAOO,SAAS,sBAA2C;AACzD,SAAO,oBAAI,IAAI;AACjB;","names":[]}

package/dist/{chunk-ZDTVJXIP.js → chunk-3MAONBX3.js}

@@ -1,10 +1,13 @@
+import {
+  scanMemoryDir
+} from "./chunk-Q4CAQGKQ.js";
 import {
   isSearchAborted,
   throwIfSearchAborted
 } from "./chunk-CINZGPSJ.js";
 import {
-  scanMemoryDir
-} from "./chunk-Q4CAQGKQ.js";
+  resolveEnsureCollectionArgs
+} from "./chunk-FAV25DUZ.js";
 import {
   log
 } from "./chunk-2ODBA7MQ.js";
@@ -236,9 +239,14 @@ var LanceDbBackend = class {
       log.debug(`LanceDbBackend embed failed: ${err}`);
     }
   }
-  async ensureCollection(_memoryDir, _execution) {
+  async ensureCollection(_memoryDir, collectionOrExecution, execution) {
+    const { collection, execution: effectiveExecution } = resolveEnsureCollectionArgs(
+      collectionOrExecution,
+      execution
+    );
+    if (isSearchAborted(effectiveExecution)) return "skipped";
     try {
-      await this.ensureTable();
+      await this.ensureTableForCollection(collection ?? this.collection);
       return "present";
     } catch {
       return "missing";
@@ -483,4 +491,4 @@ function isMissingVectorProviderColumnError(err) {
 export {
   LanceDbBackend
 };
-//# sourceMappingURL=chunk-ZDTVJXIP.js.map
+//# sourceMappingURL=chunk-3MAONBX3.js.map