@remnic/core 10.0.98 → 10.0.100

package/dist/{chunk-4PXDXCNE.js → chunk-PL36IQPL.js}

@@ -30,6 +30,7 @@ import {
   stripAttributesSuffix
 } from "./chunk-JDSVLVCG.js";
 import {
+  raceAbort,
   throwIfAborted
 } from "./chunk-R2MBW2S4.js";
 import {
@@ -348,7 +349,8 @@ async function buildProjectedHarmonicGraph(options) {
 var GRAPH_CACHE_TTL_MS = 3e4;
 var GRAPH_CACHE_MAX_ENTRIES = 8;
 var graphCache = /* @__PURE__ */ new Map();
-var harmonicGraphCacheStats = { hits: 0, misses: 0 };
+var graphBuilds = /* @__PURE__ */ new Map();
+var harmonicGraphCacheStats = { hits: 0, misses: 0, shared: 0 };
 function deepFreeze(value) {
   if (Object.isFrozen(value)) return value;
   Object.freeze(value);
@@ -357,6 +359,44 @@ function deepFreeze(value) {
 }
 function clearHarmonicGraphCache() {
   graphCache.clear();
+  graphBuilds.clear();
+}
+function startGraphBuild(key, stamp, options) {
+  harmonicGraphCacheStats.misses++;
+  const startedAtMs = Date.now();
+  const controller = new AbortController();
+  const promise = buildProjectedHarmonicGraph({
+    memoryDir: options.memoryDir,
+    abstractionNodeStoreDir: options.abstractionNodeStoreDir,
+    anchorsEnabled: options.anchorsEnabled,
+    temporalExpiredInInjection: options.temporalExpiredInInjection,
+    abortSignal: controller.signal
+  }).then((built) => {
+    const graph = { nodes: deepFreeze(built.nodes), anchors: deepFreeze(built.anchors) };
+    if (graphBuilds.get(key)?.promise !== promise) return graph;
+    graphCache.delete(key);
+    graphCache.set(key, { stamp, startedAtMs, graph });
+    while (graphCache.size > GRAPH_CACHE_MAX_ENTRIES) {
+      const oldest = graphCache.keys().next().value;
+      if (oldest === void 0) break;
+      graphCache.delete(oldest);
+    }
+    return graph;
+  }).finally(() => {
+    if (graphBuilds.get(key)?.promise === promise) graphBuilds.delete(key);
+  });
+  const build = { stamp, promise, controller, waiting: 0 };
+  graphBuilds.set(key, build);
+  return build;
+}
+function joinGraphBuild(key, build, signal) {
+  build.waiting++;
+  return raceAbort(build.promise, signal, "harmonic retrieval aborted").finally(() => {
+    build.waiting--;
+    if (build.waiting > 0) return;
+    if (graphBuilds.get(key) === build) graphBuilds.delete(key);
+    build.controller.abort();
+  });
 }
 async function readProjectedHarmonicGraph(options) {
   if (options.useCache !== true || options.nowMs !== void 0) return buildProjectedHarmonicGraph(options);
@@ -377,20 +417,12 @@ async function readProjectedHarmonicGraph(options) {
     graphCache.set(key, hit);
     return hit.graph;
   }
-  harmonicGraphCacheStats.misses++;
-  const built = await buildProjectedHarmonicGraph(options);
-  const graph = {
-    nodes: deepFreeze(built.nodes),
-    anchors: deepFreeze(built.anchors)
-  };
-  graphCache.delete(key);
-  graphCache.set(key, { stamp, startedAtMs, graph });
-  while (graphCache.size > GRAPH_CACHE_MAX_ENTRIES) {
-    const oldest = graphCache.keys().next().value;
-    if (oldest === void 0) break;
-    graphCache.delete(oldest);
+  const running = graphBuilds.get(key);
+  if (running?.stamp === stamp) {
+    harmonicGraphCacheStats.shared++;
+    return joinGraphBuild(key, running, options.abortSignal);
   }
-  return graph;
+  return joinGraphBuild(key, startGraphBuild(key, stamp, options), options.abortSignal);
 }
 async function searchHarmonicRetrieval(options) {
   throwIfAborted(options.abortSignal, "harmonic retrieval aborted");
@@ -471,4 +503,4 @@ export {
   readProjectedHarmonicGraph,
   searchHarmonicRetrieval
 };
-//# sourceMappingURL=chunk-4PXDXCNE.js.map
+//# sourceMappingURL=chunk-PL36IQPL.js.map

package/dist/chunk-PL36IQPL.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/harmonic-retrieval.ts"],"sourcesContent":["import path from \"node:path\";\nimport { realpath } from \"node:fs/promises\";\nimport { listJsonFilesStrict, readJsonFile } from \"./json-store.js\";\nimport { raceAbort, throwIfAborted } from \"./abort-error.js\";\nimport { readHarmonicGraphStamp } from \"./harmonic-graph-version.js\";\nimport { inferMemoryStatus, toMemoryPathRel } from \"./memory-lifecycle-ledger-utils.js\";\n import {\n   HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY,\n   resolveAbstractionNodeStoreDir,\n   validateAbstractionNode,\n   type AbstractionNode,\n } from \"./abstraction-nodes.js\";\nimport { resolveCueAnchorStoreDir, validateCueAnchor, type CueAnchor, type CueAnchorType } from \"./cue-anchors.js\";\nimport { compareDeterministicStrings } from \"./deterministic-order.js\";\nimport { countRecallTokenOverlap, normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport { stripAttributesSuffix } from \"./structured-attributes.js\";\nimport { isValidityExpiredNow } from \"./temporal-validity.js\";\nimport { assertSafePathSegment, isRecord } from \"./store-contract.js\";\nimport { isSupportPassportPrivateMemory } from \"./support-passport/card-projection.js\";\nimport type { MemoryFile } from \"./types.js\";\nimport { readProjectedMemoryStates } from \"./memory-projection-batch.js\";\nimport { SecureStoreLockedError } from \"./secure-store/secure-fs.js\";\nimport { StorageManager } from \"./storage.js\";\nimport { RECALL_FALLBACK_DIRS } from \"./utils/category-dir.js\";\nimport { readHarmonicSourceMemory, readUnresolvedHarmonicSources } from \"./harmonic-source-lookup.js\";\n\n\ntype SourceMemoryMap = Map<string, MemoryFile>;\n\n\n// An index older than this is treated as unusable: the date window needed to\n// cover \"created since the last rebuild\" would stop being cheap.\nconst INDEX_MAX_AGE_MS = 7 * 86_400_000;\nconst DAY_MS = 86_400_000;\n\nfunction utcDaysSince(rebuiltMs: number, nowMs: number): string[] {\n  const days: string[] = [];\n  for (let day = Math.floor((rebuiltMs - DAY_MS) / DAY_MS) * DAY_MS; day <= nowMs; day += DAY_MS) {\n    days.push(new Date(day).toISOString().slice(0, 10));\n  }\n  return days;\n}\n\n\n// Memories the projection has no row for were written after its last rebuild, so\n// their dated directory is normally one of `days`. Hot and cold tiers are probed\n// by exact path. Only recall-corpus categories are probed: `questions/` is a queue\n// and `artifacts/` is outside the recall surface, so neither can be a source.\nfunction unprojectedCandidatePaths(memoryDir: string, id: string, days: string[]): string[] {\n  const paths: string[] = [];\n  for (const root of [memoryDir, path.join(memoryDir, \"cold\")]) {\n    for (const dir of RECALL_FALLBACK_DIRS) {\n      paths.push(path.join(root, dir, `${id}.md`));\n      for (const day of days) paths.push(path.join(root, dir, day, `${id}.md`));\n    }\n  }\n  return paths;\n}\n\n/** Resolve indexed sources first, then use the durable unresolved-id path cache. */\nasync function readIndexedSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n  sourceMemoryIds: string[];\n  nowMs: number;\n}): Promise<SourceMemoryMap | null> {\n  // The ids go to SQL as bound parameters, so any id the projection holds is safe to look up.\n  const batch = readProjectedMemoryStates(options.memoryDir, options.sourceMemoryIds);\n  const rebuiltMs = Date.parse(batch?.rebuiltAt ?? \"\");\n  if (!batch?.complete || !batch.rebuiltAt || !Number.isFinite(rebuiltMs) || options.nowMs - rebuiltMs > INDEX_MAX_AGE_MS) return null;\n  const rootReal = await realpath(options.memoryDir).catch(() => null);\n  if (rootReal === null) return null;\n\n  const storage = new StorageManager(options.memoryDir);\n  const days = utcDaysSince(rebuiltMs, options.nowMs);\n  const sourceMemories: SourceMemoryMap = new Map();\n  const pending: string[] = [];\n  for (const id of options.sourceMemoryIds) {\n    const state = batch.states.get(id);\n    // An id is only ever joined into a path when it is a single safe segment.\n    let safeId = true;\n    try {\n      assertSafePathSegment(id, \"sourceMemoryId\");\n    } catch {\n      safeId = false;\n    }\n    // state.path was containment-checked by the projection reader.\n    const candidates = state\n      ? [state.path, path.join(options.memoryDir, \"cold\", state.pathRel)]\n      : safeId ? unprojectedCandidatePaths(options.memoryDir, id, days) : [];\n    let found = false;\n    for (const candidate of candidates) {\n      const memory = await readHarmonicSourceMemory(storage, rootReal, candidate, options.abortSignal);\n      if (memory?.frontmatter.id !== id) continue;\n      sourceMemories.set(id, memory);\n      found = true;\n      break;\n    }\n    if (!found) pending.push(id);\n  }\n  if (pending.length === 0) return sourceMemories;\n\n  const unresolved = await readUnresolvedHarmonicSources({\n    storage, rootReal, rebuiltAt: batch.rebuiltAt, sourceMemoryIds: pending,\n    nowMs: options.nowMs, abortSignal: options.abortSignal,\n  });\n  for (const [id, memory] of unresolved) sourceMemories.set(id, memory);\n  return sourceMemories;\n}\n\nasync function readCorpusSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n}): Promise<SourceMemoryMap> {\n  const sourceMemories: SourceMemoryMap = new Map();\n  try {\n    const storage = new StorageManager(options.memoryDir);\n    const [hotMemories, coldMemories] = await Promise.all([\n      storage.readAllMemories({ abortSignal: options.abortSignal }),\n      storage.readAllColdMemories({ abortSignal: options.abortSignal }),\n    ]);\n    for (const memory of [...hotMemories, ...coldMemories]) {\n      throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n      sourceMemories.set(memory.frontmatter.id, memory);\n    }\n  } catch (err) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    if (err instanceof SecureStoreLockedError) return new Map();\n    // Source validation fails closed when the authorized memory directory is\n    // unreadable. Source-less nodes remain eligible for retrieval.\n    sourceMemories.clear();\n  }\n  return sourceMemories;\n}\n\nasync function readSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n  sourceMemoryIds: string[];\n  nowMs?: number;\n}): Promise<SourceMemoryMap> {\n  try {\n    const indexed = await readIndexedSourceMemories({\n      memoryDir: options.memoryDir,\n      abortSignal: options.abortSignal,\n      sourceMemoryIds: options.sourceMemoryIds,\n      nowMs: options.nowMs ?? Date.now(),\n    });\n    if (indexed) return indexed;\n  } catch (err) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    if (err instanceof SecureStoreLockedError) return new Map();\n  }\n  return readCorpusSourceMemories(options);\n}\n\nfunction parseSourceMemoryInsertedAt(node: AbstractionNode): Map<string, string> {\n  const insertedAtById = new Map<string, string>();\n  const insertedAtRaw = node.metadata?.[HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY];\n  if (!insertedAtRaw) return insertedAtById;\n  try {\n    const parsed = JSON.parse(insertedAtRaw) as unknown;\n    if (!isRecord(parsed)) return insertedAtById;\n    for (const [memoryId, value] of Object.entries(parsed)) {\n      if (typeof value === \"string\") insertedAtById.set(memoryId, value);\n    }\n  } catch {\n    // Malformed insertion metadata leaves ordering on the recordedAt fallback.\n  }\n  return insertedAtById;\n}\n\nfunction projectSourceBackedNode(\n  node: AbstractionNode,\n  sourceMemories: SourceMemoryMap,\n  memoryDir: string,\n  temporalExpiredInInjection: boolean,\n  nowMs: number\n): AbstractionNode | null {\n  const sourceMemoryIds = node.sourceMemoryIds ?? [];\n  if (sourceMemoryIds.length === 0) return node;\n\n  const activeSourceMemoryIds = sourceMemoryIds.filter((memoryId) => {\n    const memory = sourceMemories.get(memoryId);\n    return (\n      memory !== undefined &&\n      // #2332: a private support-passport record leaves the eligible set the\n      // same way a rejected one does — a node title or anchor attribution\n      // rebuilt from it would leak governed metadata into the deep-recall\n      // frontier (and every other graph reader) before any content check runs.\n      !isSupportPassportPrivateMemory(memory) &&\n      inferMemoryStatus(memory.frontmatter, toMemoryPathRel(memoryDir, memory.path)) === \"active\" &&\n      (temporalExpiredInInjection || !isValidityExpiredNow(memory.frontmatter, nowMs))\n    );\n  });\n  if (activeSourceMemoryIds.length === 0) return null;\n\n // Newest-first source order keeps the projected title and summary on the most\n // recently inserted facts. Equal or missing timestamps fall back to ascending\n // id order, which matches the stored sourceMemoryIds order.\n const insertedAtById = parseSourceMemoryInsertedAt(node);\n const insertedAtMs = (memoryId: string): number => {\n   const parsedMs = Date.parse(insertedAtById.get(memoryId) ?? \"\");\n   return Number.isFinite(parsedMs) ? parsedMs : Date.parse(node.recordedAt);\n };\n activeSourceMemoryIds.sort(\n   (left, right) =>\n     insertedAtMs(right) - insertedAtMs(left) || compareDeterministicStrings(left, right)\n );\n\n  const activeMemories = activeSourceMemoryIds.flatMap((memoryId) => {\n    const memory = sourceMemories.get(memoryId);\n    return memory ? [memory] : [];\n  });\n  const activeContents = activeMemories.map((memory) =>\n    memory.frontmatter.structuredAttributes ? stripAttributesSuffix(memory.content) : memory.content\n  );\n let metadata: Record<string, string> | undefined;\n const activeInsertedAt = activeSourceMemoryIds.flatMap((memoryId) => {\n   const value = insertedAtById.get(memoryId);\n   return typeof value === \"string\" ? [[memoryId, value] as const] : [];\n });\n if (activeInsertedAt.length > 0) {\n   metadata = {\n     [HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY]: JSON.stringify(Object.fromEntries(activeInsertedAt)),\n   };\n  }\n\n return {\n   ...node,\n   sourceMemoryIds: activeSourceMemoryIds,\n   title: activeContents[0]?.slice(0, 80) ?? node.title,\n   summary: activeContents.slice(0, 3).join(\"; \").slice(0, 400),\n   tags: [...new Set(activeMemories.flatMap((memory) => memory.frontmatter.tags))].sort(compareDeterministicStrings),\n   entityRefs: [\n     ...new Set(\n       activeMemories.flatMap((memory) =>\n         typeof memory.frontmatter.entityRef === \"string\" ? [memory.frontmatter.entityRef] : []\n       )\n     ),\n   ].sort(compareDeterministicStrings),\n   metadata,\n };\n}\n\nfunction anchorMatchesProjectedNode(\n  anchor: CueAnchor,\n  nodeRef: string,\n  node: AbstractionNode,\n  allowLegacyAttribution: boolean\n): boolean {\n  const activeSourceMemoryIds = node.sourceMemoryIds ?? [];\n  if (activeSourceMemoryIds.length === 0) return true;\n  if (!anchor.sourceMemoryIdsByNodeRef) return allowLegacyAttribution;\n  const anchorSourceMemoryIds = anchor.sourceMemoryIdsByNodeRef[nodeRef] ?? [];\n  return anchorSourceMemoryIds.some((sourceMemoryId) => activeSourceMemoryIds.includes(sourceMemoryId));\n}\n\nexport interface HarmonicMatchedAnchor {\n  anchorId: string;\n  anchorType: CueAnchorType;\n  anchorValue: string;\n}\n\nexport interface HarmonicRetrievalResult {\n  node: AbstractionNode;\n  score: number;\n  nodeScore: number;\n  anchorScore: number;\n  matchedFields: string[];\n  matchedAnchors: HarmonicMatchedAnchor[];\n}\n\ninterface HarmonicCandidate {\n  node: AbstractionNode;\n  nodeScore: number;\n  anchorScore: number;\n  matchedFields: Set<string>;\n  matchedAnchors: Map<string, HarmonicMatchedAnchor>;\n}\n\nfunction scoreNode(node: AbstractionNode, queryTokens: Set<string>): { score: number; matchedFields: string[] } {\n  const matchedFields: string[] = [];\n  let score = 0;\n\n  const titleMatches = countRecallTokenOverlap(queryTokens, node.title);\n  if (titleMatches > 0) {\n    score += titleMatches * 3;\n    matchedFields.push(\"title\");\n  }\n\n  const summaryMatches = countRecallTokenOverlap(queryTokens, node.summary);\n  if (summaryMatches > 0) {\n    score += summaryMatches * 3;\n    matchedFields.push(\"summary\");\n  }\n\n  const tagMatches = countRecallTokenOverlap(queryTokens, node.tags?.join(\" \"));\n  if (tagMatches > 0) {\n    score += tagMatches * 2;\n    matchedFields.push(\"tags\");\n  }\n\n  const entityMatches = countRecallTokenOverlap(queryTokens, node.entityRefs?.join(\" \"));\n  if (entityMatches > 0) {\n    score += entityMatches * 2;\n    matchedFields.push(\"entityRefs\");\n  }\n\n  const kindMatches = countRecallTokenOverlap(queryTokens, `${node.kind} ${node.abstractionLevel}`);\n  if (kindMatches > 0) {\n    score += kindMatches;\n    matchedFields.push(\"kind\");\n  }\n\n  return { score, matchedFields };\n}\n\nfunction scoreAnchor(\n  anchor: CueAnchor,\n  queryTokens: Set<string>,\n  eligibleNodeTags: readonly string[]\n): { score: number; matchedFields: string[] } {\n  const matchedFields: string[] = [];\n  let score = 0;\n\n  const valueMatches = countRecallTokenOverlap(queryTokens, anchor.anchorValue);\n  const normalizedMatches = countRecallTokenOverlap(queryTokens, anchor.normalizedCue);\n  const cueMatches = Math.max(valueMatches, normalizedMatches);\n  if (cueMatches > 0) {\n    score += cueMatches * 4;\n    if (valueMatches > 0) matchedFields.push(\"anchorValue\");\n    if (normalizedMatches > 0) matchedFields.push(\"anchor\");\n  }\n\n  const typeMatches = countRecallTokenOverlap(queryTokens, anchor.anchorType);\n  if (typeMatches > 0) {\n    score += typeMatches;\n    matchedFields.push(\"anchorType\");\n  }\n\n  const tagMatches = countRecallTokenOverlap(queryTokens, eligibleNodeTags.join(\" \"));\n  if (tagMatches > 0) {\n    score += tagMatches * 2;\n    matchedFields.push(\"anchorTags\");\n  }\n\n  return { score, matchedFields };\n}\n\nexport async function readAbstractionNodes(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n}): Promise<AbstractionNode[]> {\n  const rootDir = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const files = await listJsonFilesStrict(path.join(rootDir, \"nodes\"), { allowMissingDirectory: true });\n  const nodes: AbstractionNode[] = [];\n  for (const filePath of files) {\n    try {\n      nodes.push(validateAbstractionNode(await readJsonFile(filePath)));\n    } catch {\n      // fail-open: invalid artifacts stay visible via status tooling instead of recall\n    }\n  }\n  return nodes;\n}\n\nexport async function readCueAnchors(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n}): Promise<CueAnchor[]> {\n  const abstractionRoot = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const rootDir = resolveCueAnchorStoreDir(abstractionRoot);\n  const files = await listJsonFilesStrict(rootDir, { allowMissingDirectory: true });\n  const anchors: CueAnchor[] = [];\n  for (const filePath of files) {\n    try {\n      anchors.push(validateCueAnchor(await readJsonFile(filePath)));\n    } catch {\n      // fail-open: invalid artifacts stay visible via status tooling instead of recall\n    }\n  }\n  return anchors;\n}\n\nexport interface ProjectedHarmonicGraph {\n  nodes: AbstractionNode[];\n  anchors: CueAnchor[];\n}\n\n/**\n * Read nodes + anchors and project BOTH against the namespace's current active\n * memories. This is the single projection every graph reader shares: a raw\n * `readAbstractionNodes` / `readCueAnchors` pair still carries the stored title,\n * summary, tags, and anchor attribution of a memory that was later rejected,\n * quarantined, or otherwise moved out of the active set, so a second reader\n * that skipped the projection could leak governed metadata even when the\n * memory itself is excluded from the final results.\n *\n * - A node whose every source memory left the active set is dropped.\n * - A surviving node's title/summary/tags/entityRefs are rebuilt from its\n *   active sources only.\n * - An anchor keeps a node reference only while its attribution runs through\n *   one of that node's surviving active sources, and is dropped once no\n *   reference survives.\n */\nasync function buildProjectedHarmonicGraph(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n  nowMs?: number;\n}): Promise<ProjectedHarmonicGraph> {\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const nodes = await readAbstractionNodes(options);\n  const sourceMemoryIds = [...new Set(nodes.flatMap((node) => node.sourceMemoryIds ?? []))];\n  const sourceMemories: SourceMemoryMap = sourceMemoryIds.length > 0\n    ? await readSourceMemories({\n        memoryDir: options.memoryDir,\n        abortSignal: options.abortSignal,\n        sourceMemoryIds,\n        nowMs: options.nowMs,\n      })\n    : new Map();\n  const nowMs = options.nowMs ?? Date.now();\n  // A node whose full stored source set survived projection keeps legacy\n  // anchor attribution (an anchor written before per-node source ids existed).\n  const legacyCompatibleNodeRefs = new Set<string>();\n  const projectedNodes = nodes.flatMap((node) => {\n    const projected = projectSourceBackedNode(\n      node,\n      sourceMemories,\n      options.memoryDir,\n      options.temporalExpiredInInjection === true,\n      nowMs\n    );\n    if (\n      projected &&\n      (node.sourceMemoryIds?.length ?? 0) > 0 &&\n      projected.sourceMemoryIds?.length === node.sourceMemoryIds?.length\n    ) {\n      legacyCompatibleNodeRefs.add(node.nodeId);\n    }\n    return projected ? [projected] : [];\n  });\n  if (!options.anchorsEnabled) return { nodes: projectedNodes, anchors: [] };\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const nodeIndex = new Map(projectedNodes.map((node) => [node.nodeId, node]));\n  const anchors = (await readCueAnchors(options)).flatMap((anchor) => {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const nodeRefs = anchor.nodeRefs.filter((nodeRef) => {\n      const node = nodeIndex.get(nodeRef);\n      return (\n        node !== undefined &&\n        anchorMatchesProjectedNode(anchor, nodeRef, node, legacyCompatibleNodeRefs.has(nodeRef))\n      );\n    });\n    return nodeRefs.length > 0 ? [{ ...anchor, nodeRefs }] : [];\n  });\n  return { nodes: projectedNodes, anchors };\n}\n\nconst GRAPH_CACHE_TTL_MS = 30_000;\nconst GRAPH_CACHE_MAX_ENTRIES = 8;\n\ninterface GraphCacheEntry {\n  stamp: string;\n  startedAtMs: number;\n  graph: ProjectedHarmonicGraph;\n}\n\nconst graphCache = new Map<string, GraphCacheEntry>();\n\ninterface GraphBuild {\n  stamp: string;\n  promise: Promise<ProjectedHarmonicGraph>;\n  /** Cancels the build's source scan; fired when no caller is waiting for it. */\n  controller: AbortController;\n  /** Callers currently waiting for this build. */\n  waiting: number;\n}\n\n/** One build per cache key at a time: every recall that lands on a miss waits for the same build. */\nconst graphBuilds = new Map<string, GraphBuild>();\n/** Counters for tests and diagnostics. `shared` counts reads that joined a build already running. */\nexport const harmonicGraphCacheStats = { hits: 0, misses: 0, shared: 0 };\n\n/** Freeze records and their nested arrays/objects so a caller cannot corrupt the shared cache. */\nfunction deepFreeze<T extends object>(value: T): T {\n  // isFrozen is true for primitives and null, and a frozen value is not revisited, so this ends on cycles too.\n  if (Object.isFrozen(value)) return value;\n  Object.freeze(value);\n  for (const child of Object.values(value)) deepFreeze(child);\n  return value;\n}\n\nexport function clearHarmonicGraphCache(): void {\n  graphCache.clear();\n  graphBuilds.clear();\n}\n\ntype GraphReadOptions = Parameters<typeof buildProjectedHarmonicGraph>[0];\n\n/**\n * Start the one build for `key`. The build owns an abort controller instead of using one caller's signal,\n * so a caller that leaves does not cancel it for the others; `joinGraphBuild` cancels it when the last caller leaves.\n */\nfunction startGraphBuild(key: string, stamp: string, options: GraphReadOptions): GraphBuild {\n  harmonicGraphCacheStats.misses++;\n  const startedAtMs = Date.now();\n  const controller = new AbortController();\n  const promise: Promise<ProjectedHarmonicGraph> = buildProjectedHarmonicGraph({\n    memoryDir: options.memoryDir,\n    abstractionNodeStoreDir: options.abstractionNodeStoreDir,\n    anchorsEnabled: options.anchorsEnabled,\n    temporalExpiredInInjection: options.temporalExpiredInInjection,\n    abortSignal: controller.signal,\n  })\n    .then((built) => {\n      const graph = { nodes: deepFreeze(built.nodes), anchors: deepFreeze(built.anchors) };\n      // A cleared cache or a newer build for this key has replaced this one: do not store a stale graph.\n      if (graphBuilds.get(key)?.promise !== promise) return graph;\n      graphCache.delete(key);\n      graphCache.set(key, { stamp, startedAtMs, graph });\n      while (graphCache.size > GRAPH_CACHE_MAX_ENTRIES) {\n        const oldest = graphCache.keys().next().value;\n        if (oldest === undefined) break;\n        graphCache.delete(oldest);\n      }\n      return graph;\n    })\n    .finally(() => {\n      if (graphBuilds.get(key)?.promise === promise) graphBuilds.delete(key);\n    });\n  const build: GraphBuild = { stamp, promise, controller, waiting: 0 };\n  graphBuilds.set(key, build);\n  return build;\n}\n\n/**\n * Wait for `build` on behalf of one caller. The caller's own signal ends only its own wait. When the last\n * waiting caller has left, the build is cancelled and dropped, so abandoned recalls do not leave full scans running\n * (cancelling a build that already finished does nothing).\n */\nfunction joinGraphBuild(key: string, build: GraphBuild, signal: AbortSignal | undefined): Promise<ProjectedHarmonicGraph> {\n  build.waiting++;\n  return raceAbort(build.promise, signal, \"harmonic retrieval aborted\").finally(() => {\n    build.waiting--;\n    if (build.waiting > 0) return;\n    if (graphBuilds.get(key) === build) graphBuilds.delete(key);\n    build.controller.abort();\n  });\n}\n\n/**\n * `readProjectedHarmonicGraph` with an opt-in in-memory cache. Every recall used\n * to re-read all nodes, anchors and source memories from disk (about 4.7 s on a\n * 2107 node, 9199 anchor, 4105 source graph). With `useCache` a completed graph is\n * reused while the stamp below is unchanged: the memory corpus, memory status and\n * cold-write version sentinels (bumped by every memory write, in any process) and\n * the graph version sentinel (bumped by node and anchor writes). A stamp read is\n * four stats, not a scan of the memories. The TTL bounds the one input a sentinel\n * cannot see, which is wall-clock validity expiry. Concurrent misses share one\n * build. An explicit `nowMs` bypasses the cache so tests stay deterministic. The\n * cached arrays are frozen: callers must not mutate them.\n */\nexport async function readProjectedHarmonicGraph(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n  nowMs?: number;\n  useCache?: boolean;\n}): Promise<ProjectedHarmonicGraph> {\n  if (options.useCache !== true || options.nowMs !== undefined) return buildProjectedHarmonicGraph(options);\n  // Same cancellation contract as the builder: a cache hit must not mask an aborted signal.\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const nodeStoreDir = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const key = JSON.stringify([\n    options.memoryDir,\n    nodeStoreDir,\n    options.anchorsEnabled === true,\n    options.temporalExpiredInInjection === true,\n  ]);\n  // The stamp is read BEFORE the build, so a write that lands mid-build leaves the\n  // entry stale and the next call rebuilds.\n  const stamp = readHarmonicGraphStamp(options.memoryDir, nodeStoreDir);\n  const startedAtMs = Date.now();\n  const hit = graphCache.get(key);\n  if (hit && hit.stamp === stamp && startedAtMs - hit.startedAtMs < GRAPH_CACHE_TTL_MS) {\n    harmonicGraphCacheStats.hits++;\n    graphCache.delete(key);\n    graphCache.set(key, hit);\n    return hit.graph;\n  }\n  const running = graphBuilds.get(key);\n  if (running?.stamp === stamp) {\n    harmonicGraphCacheStats.shared++;\n    return joinGraphBuild(key, running, options.abortSignal);\n  }\n  return joinGraphBuild(key, startGraphBuild(key, stamp, options), options.abortSignal);\n}\n\nexport async function searchHarmonicRetrieval(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  query: string;\n  maxResults: number;\n  sessionKey?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n  /** Share one projected graph between recalls until a write bumps a version sentinel (see readProjectedHarmonicGraph). */\n  useGraphCache?: boolean;\n}): Promise<HarmonicRetrievalResult[]> {\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const queryTokens = new Set(normalizeRecallTokens(options.query, [\"what\", \"which\"]));\n  if (queryTokens.size === 0 || options.maxResults <= 0) return [];\n\n  // One projection for every graph reader: nodes and anchors both arrive\n  // already narrowed to the namespace's current active memories.\n  const { nodes: eligibleNodes, anchors } = await readProjectedHarmonicGraph({\n    ...options,\n    useCache: options.useGraphCache === true,\n  });\n  const candidates = new Map<string, HarmonicCandidate>();\n\n  for (const node of eligibleNodes) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const { score, matchedFields } = scoreNode(node, queryTokens);\n    if (score <= 0) continue;\n    candidates.set(node.nodeId, {\n      node,\n      nodeScore: score,\n      anchorScore: 0,\n      matchedFields: new Set(matchedFields),\n      matchedAnchors: new Map(),\n    });\n  }\n\n  if (options.anchorsEnabled) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const nodeIndex = new Map(eligibleNodes.map((node) => [node.nodeId, node]));\n    for (const anchor of anchors) {\n      throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n      // `nodeRefs` are the projection's surviving references already.\n      const eligibleNodeRefs = anchor.nodeRefs;\n      const eligibleNodeTags = new Set(eligibleNodeRefs.flatMap((nodeRef) => nodeIndex.get(nodeRef)?.tags ?? []));\n      const eligibleAnchorTags = anchor.tags?.filter((tag) => eligibleNodeTags.has(tag)) ?? [];\n      const { score, matchedFields } = scoreAnchor(anchor, queryTokens, eligibleAnchorTags);\n      if (score <= 0) continue;\n      for (const nodeRef of eligibleNodeRefs) {\n        const node = nodeIndex.get(nodeRef);\n        if (!node) continue;\n        const existing = candidates.get(nodeRef) ?? {\n          node,\n          nodeScore: 0,\n          anchorScore: 0,\n          matchedFields: new Set<string>(),\n          matchedAnchors: new Map<string, HarmonicMatchedAnchor>(),\n        };\n        existing.anchorScore += score;\n        existing.matchedFields.add(\"anchor\");\n        for (const field of matchedFields) existing.matchedFields.add(field);\n        existing.matchedAnchors.set(anchor.anchorId, {\n          anchorId: anchor.anchorId,\n          anchorType: anchor.anchorType,\n          anchorValue: anchor.anchorValue,\n        });\n        candidates.set(nodeRef, existing);\n      }\n    }\n  }\n\n  return [...candidates.values()]\n    .map((candidate) => {\n      let score = candidate.nodeScore + candidate.anchorScore;\n      if (options.sessionKey && candidate.node.sessionKey === options.sessionKey) score += 0.5;\n      return {\n        node: candidate.node,\n        score,\n        nodeScore: candidate.nodeScore,\n        anchorScore: candidate.anchorScore,\n        matchedFields: [...candidate.matchedFields].sort(),\n        matchedAnchors: [...candidate.matchedAnchors.values()].sort(\n          (left, right) =>\n            left.anchorType.localeCompare(right.anchorType) || left.anchorValue.localeCompare(right.anchorValue)\n        ),\n      };\n    })\n    .filter((result) => result.nodeScore > 0 || result.anchorScore > 0)\n    .sort(\n      (left, right) =>\n        right.score - left.score ||\n        right.anchorScore - left.anchorScore ||\n        right.node.recordedAt.localeCompare(left.node.recordedAt)\n    )\n    .slice(0, options.maxResults);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,gBAAgB;AA+BzB,IAAM,mBAAmB,IAAI;AAC7B,IAAM,SAAS;AAEf,SAAS,aAAa,WAAmB,OAAyB;AAChE,QAAM,OAAiB,CAAC;AACxB,WAAS,MAAM,KAAK,OAAO,YAAY,UAAU,MAAM,IAAI,QAAQ,OAAO,OAAO,OAAO,QAAQ;AAC9F,SAAK,KAAK,IAAI,KAAK,GAAG,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAOA,SAAS,0BAA0B,WAAmB,IAAY,MAA0B;AAC1F,QAAM,QAAkB,CAAC;AACzB,aAAW,QAAQ,CAAC,WAAW,KAAK,KAAK,WAAW,MAAM,CAAC,GAAG;AAC5D,eAAW,OAAO,sBAAsB;AACtC,YAAM,KAAK,KAAK,KAAK,MAAM,KAAK,GAAG,EAAE,KAAK,CAAC;AAC3C,iBAAW,OAAO,KAAM,OAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,GAAG,EAAE,KAAK,CAAC;AAAA,IAC1E;AAAA,EACF;AACA,SAAO;AACT;AAGA,eAAe,0BAA0B,SAKL;AAElC,QAAM,QAAQ,0BAA0B,QAAQ,WAAW,QAAQ,eAAe;AAClF,QAAM,YAAY,KAAK,MAAM,OAAO,aAAa,EAAE;AACnD,MAAI,CAAC,OAAO,YAAY,CAAC,MAAM,aAAa,CAAC,OAAO,SAAS,SAAS,KAAK,QAAQ,QAAQ,YAAY,iBAAkB,QAAO;AAChI,QAAM,WAAW,MAAM,SAAS,QAAQ,SAAS,EAAE,MAAM,MAAM,IAAI;AACnE,MAAI,aAAa,KAAM,QAAO;AAE9B,QAAM,UAAU,IAAI,eAAe,QAAQ,SAAS;AACpD,QAAM,OAAO,aAAa,WAAW,QAAQ,KAAK;AAClD,QAAM,iBAAkC,oBAAI,IAAI;AAChD,QAAM,UAAoB,CAAC;AAC3B,aAAW,MAAM,QAAQ,iBAAiB;AACxC,UAAM,QAAQ,MAAM,OAAO,IAAI,EAAE;AAEjC,QAAI,SAAS;AACb,QAAI;AACF,4BAAsB,IAAI,gBAAgB;AAAA,IAC5C,QAAQ;AACN,eAAS;AAAA,IACX;AAEA,UAAM,aAAa,QACf,CAAC,MAAM,MAAM,KAAK,KAAK,QAAQ,WAAW,QAAQ,MAAM,OAAO,CAAC,IAChE,SAAS,0BAA0B,QAAQ,WAAW,IAAI,IAAI,IAAI,CAAC;AACvE,QAAI,QAAQ;AACZ,eAAW,aAAa,YAAY;AAClC,YAAM,SAAS,MAAM,yBAAyB,SAAS,UAAU,WAAW,QAAQ,WAAW;AAC/F,UAAI,QAAQ,YAAY,OAAO,GAAI;AACnC,qBAAe,IAAI,IAAI,MAAM;AAC7B,cAAQ;AACR;AAAA,IACF;AACA,QAAI,CAAC,MAAO,SAAQ,KAAK,EAAE;AAAA,EAC7B;AACA,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,aAAa,MAAM,8BAA8B;AAAA,IACrD;AAAA,IAAS;AAAA,IAAU,WAAW,MAAM;AAAA,IAAW,iBAAiB;AAAA,IAChE,OAAO,QAAQ;AAAA,IAAO,aAAa,QAAQ;AAAA,EAC7C,CAAC;AACD,aAAW,CAAC,IAAI,MAAM,KAAK,WAAY,gBAAe,IAAI,IAAI,MAAM;AACpE,SAAO;AACT;AAEA,eAAe,yBAAyB,SAGX;AAC3B,QAAM,iBAAkC,oBAAI,IAAI;AAChD,MAAI;AACF,UAAM,UAAU,IAAI,eAAe,QAAQ,SAAS;AACpD,UAAM,CAAC,aAAa,YAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,MACpD,QAAQ,gBAAgB,EAAE,aAAa,QAAQ,YAAY,CAAC;AAAA,MAC5D,QAAQ,oBAAoB,EAAE,aAAa,QAAQ,YAAY,CAAC;AAAA,IAClE,CAAC;AACD,eAAW,UAAU,CAAC,GAAG,aAAa,GAAG,YAAY,GAAG;AACtD,qBAAe,QAAQ,aAAa,4BAA4B;AAChE,qBAAe,IAAI,OAAO,YAAY,IAAI,MAAM;AAAA,IAClD;AAAA,EACF,SAAS,KAAK;AACZ,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAI,eAAe,uBAAwB,QAAO,oBAAI,IAAI;AAG1D,mBAAe,MAAM;AAAA,EACvB;AACA,SAAO;AACT;AAEA,eAAe,mBAAmB,SAKL;AAC3B,MAAI;AACF,UAAM,UAAU,MAAM,0BAA0B;AAAA,MAC9C,WAAW,QAAQ;AAAA,MACnB,aAAa,QAAQ;AAAA,MACrB,iBAAiB,QAAQ;AAAA,MACzB,OAAO,QAAQ,SAAS,KAAK,IAAI;AAAA,IACnC,CAAC;AACD,QAAI,QAAS,QAAO;AAAA,EACtB,SAAS,KAAK;AACZ,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAI,eAAe,uBAAwB,QAAO,oBAAI,IAAI;AAAA,EAC5D;AACA,SAAO,yBAAyB,OAAO;AACzC;AAEA,SAAS,4BAA4B,MAA4C;AAC/E,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,QAAM,gBAAgB,KAAK,WAAW,sCAAsC;AAC5E,MAAI,CAAC,cAAe,QAAO;AAC3B,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,aAAa;AACvC,QAAI,CAAC,SAAS,MAAM,EAAG,QAAO;AAC9B,eAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACtD,UAAI,OAAO,UAAU,SAAU,gBAAe,IAAI,UAAU,KAAK;AAAA,IACnE;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,wBACP,MACA,gBACA,WACA,4BACA,OACwB;AACxB,QAAM,kBAAkB,KAAK,mBAAmB,CAAC;AACjD,MAAI,gBAAgB,WAAW,EAAG,QAAO;AAEzC,QAAM,wBAAwB,gBAAgB,OAAO,CAAC,aAAa;AACjE,UAAM,SAAS,eAAe,IAAI,QAAQ;AAC1C,WACE,WAAW;AAAA;AAAA;AAAA;AAAA,IAKX,CAAC,+BAA+B,MAAM,KACtC,kBAAkB,OAAO,aAAa,gBAAgB,WAAW,OAAO,IAAI,CAAC,MAAM,aAClF,8BAA8B,CAAC,qBAAqB,OAAO,aAAa,KAAK;AAAA,EAElF,CAAC;AACD,MAAI,sBAAsB,WAAW,EAAG,QAAO;AAKhD,QAAM,iBAAiB,4BAA4B,IAAI;AACvD,QAAM,eAAe,CAAC,aAA6B;AACjD,UAAM,WAAW,KAAK,MAAM,eAAe,IAAI,QAAQ,KAAK,EAAE;AAC9D,WAAO,OAAO,SAAS,QAAQ,IAAI,WAAW,KAAK,MAAM,KAAK,UAAU;AAAA,EAC1E;AACA,wBAAsB;AAAA,IACpB,CAAC,MAAM,UACL,aAAa,KAAK,IAAI,aAAa,IAAI,KAAK,4BAA4B,MAAM,KAAK;AAAA,EACvF;AAEC,QAAM,iBAAiB,sBAAsB,QAAQ,CAAC,aAAa;AACjE,UAAM,SAAS,eAAe,IAAI,QAAQ;AAC1C,WAAO,SAAS,CAAC,MAAM,IAAI,CAAC;AAAA,EAC9B,CAAC;AACD,QAAM,iBAAiB,eAAe;AAAA,IAAI,CAAC,WACzC,OAAO,YAAY,uBAAuB,sBAAsB,OAAO,OAAO,IAAI,OAAO;AAAA,EAC3F;AACD,MAAI;AACJ,QAAM,mBAAmB,sBAAsB,QAAQ,CAAC,aAAa;AACnE,UAAM,QAAQ,eAAe,IAAI,QAAQ;AACzC,WAAO,OAAO,UAAU,WAAW,CAAC,CAAC,UAAU,KAAK,CAAU,IAAI,CAAC;AAAA,EACrE,CAAC;AACD,MAAI,iBAAiB,SAAS,GAAG;AAC/B,eAAW;AAAA,MACT,CAAC,sCAAsC,GAAG,KAAK,UAAU,OAAO,YAAY,gBAAgB,CAAC;AAAA,IAC/F;AAAA,EACD;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,iBAAiB;AAAA,IACjB,OAAO,eAAe,CAAC,GAAG,MAAM,GAAG,EAAE,KAAK,KAAK;AAAA,IAC/C,SAAS,eAAe,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AAAA,IAC3D,MAAM,CAAC,GAAG,IAAI,IAAI,eAAe,QAAQ,CAAC,WAAW,OAAO,YAAY,IAAI,CAAC,CAAC,EAAE,KAAK,2BAA2B;AAAA,IAChH,YAAY;AAAA,MACV,GAAG,IAAI;AAAA,QACL,eAAe;AAAA,UAAQ,CAAC,WACtB,OAAO,OAAO,YAAY,cAAc,WAAW,CAAC,OAAO,YAAY,SAAS,IAAI,CAAC;AAAA,QACvF;AAAA,MACF;AAAA,IACF,EAAE,KAAK,2BAA2B;AAAA,IAClC;AAAA,EACF;AACD;AAEA,SAAS,2BACP,QACA,SACA,MACA,wBACS;AACT,QAAM,wBAAwB,KAAK,mBAAmB,CAAC;AACvD,MAAI,sBAAsB,WAAW,EAAG,QAAO;AAC/C,MAAI,CAAC,OAAO,yBAA0B,QAAO;AAC7C,QAAM,wBAAwB,OAAO,yBAAyB,OAAO,KAAK,CAAC;AAC3E,SAAO,sBAAsB,KAAK,CAAC,mBAAmB,sBAAsB,SAAS,cAAc,CAAC;AACtG;AAyBA,SAAS,UAAU,MAAuB,aAAsE;AAC9G,QAAM,gBAA0B,CAAC;AACjC,MAAI,QAAQ;AAEZ,QAAM,eAAe,wBAAwB,aAAa,KAAK,KAAK;AACpE,MAAI,eAAe,GAAG;AACpB,aAAS,eAAe;AACxB,kBAAc,KAAK,OAAO;AAAA,EAC5B;AAEA,QAAM,iBAAiB,wBAAwB,aAAa,KAAK,OAAO;AACxE,MAAI,iBAAiB,GAAG;AACtB,aAAS,iBAAiB;AAC1B,kBAAc,KAAK,SAAS;AAAA,EAC9B;AAEA,QAAM,aAAa,wBAAwB,aAAa,KAAK,MAAM,KAAK,GAAG,CAAC;AAC5E,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,QAAM,gBAAgB,wBAAwB,aAAa,KAAK,YAAY,KAAK,GAAG,CAAC;AACrF,MAAI,gBAAgB,GAAG;AACrB,aAAS,gBAAgB;AACzB,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,QAAM,cAAc,wBAAwB,aAAa,GAAG,KAAK,IAAI,IAAI,KAAK,gBAAgB,EAAE;AAChG,MAAI,cAAc,GAAG;AACnB,aAAS;AACT,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,SAAS,YACP,QACA,aACA,kBAC4C;AAC5C,QAAM,gBAA0B,CAAC;AACjC,MAAI,QAAQ;AAEZ,QAAM,eAAe,wBAAwB,aAAa,OAAO,WAAW;AAC5E,QAAM,oBAAoB,wBAAwB,aAAa,OAAO,aAAa;AACnF,QAAM,aAAa,KAAK,IAAI,cAAc,iBAAiB;AAC3D,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,QAAI,eAAe,EAAG,eAAc,KAAK,aAAa;AACtD,QAAI,oBAAoB,EAAG,eAAc,KAAK,QAAQ;AAAA,EACxD;AAEA,QAAM,cAAc,wBAAwB,aAAa,OAAO,UAAU;AAC1E,MAAI,cAAc,GAAG;AACnB,aAAS;AACT,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,QAAM,aAAa,wBAAwB,aAAa,iBAAiB,KAAK,GAAG,CAAC;AAClF,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,eAAsB,qBAAqB,SAGZ;AAC7B,QAAM,UAAU,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACjG,QAAM,QAAQ,MAAM,oBAAoB,KAAK,KAAK,SAAS,OAAO,GAAG,EAAE,uBAAuB,KAAK,CAAC;AACpG,QAAM,QAA2B,CAAC;AAClC,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,YAAM,KAAK,wBAAwB,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAClE,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,eAAe,SAGZ;AACvB,QAAM,kBAAkB,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACzG,QAAM,UAAU,yBAAyB,eAAe;AACxD,QAAM,QAAQ,MAAM,oBAAoB,SAAS,EAAE,uBAAuB,KAAK,CAAC;AAChF,QAAM,UAAuB,CAAC;AAC9B,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,cAAQ,KAAK,kBAAkB,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAC9D,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAuBA,eAAe,4BAA4B,SAOP;AAClC,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,QAAQ,MAAM,qBAAqB,OAAO;AAChD,QAAM,kBAAkB,CAAC,GAAG,IAAI,IAAI,MAAM,QAAQ,CAAC,SAAS,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC;AACxF,QAAM,iBAAkC,gBAAgB,SAAS,IAC7D,MAAM,mBAAmB;AAAA,IACvB,WAAW,QAAQ;AAAA,IACnB,aAAa,QAAQ;AAAA,IACrB;AAAA,IACA,OAAO,QAAQ;AAAA,EACjB,CAAC,IACD,oBAAI,IAAI;AACZ,QAAM,QAAQ,QAAQ,SAAS,KAAK,IAAI;AAGxC,QAAM,2BAA2B,oBAAI,IAAY;AACjD,QAAM,iBAAiB,MAAM,QAAQ,CAAC,SAAS;AAC7C,UAAM,YAAY;AAAA,MAChB;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ,+BAA+B;AAAA,MACvC;AAAA,IACF;AACA,QACE,cACC,KAAK,iBAAiB,UAAU,KAAK,KACtC,UAAU,iBAAiB,WAAW,KAAK,iBAAiB,QAC5D;AACA,+BAAyB,IAAI,KAAK,MAAM;AAAA,IAC1C;AACA,WAAO,YAAY,CAAC,SAAS,IAAI,CAAC;AAAA,EACpC,CAAC;AACD,MAAI,CAAC,QAAQ,eAAgB,QAAO,EAAE,OAAO,gBAAgB,SAAS,CAAC,EAAE;AACzE,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,YAAY,IAAI,IAAI,eAAe,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAC3E,QAAM,WAAW,MAAM,eAAe,OAAO,GAAG,QAAQ,CAAC,WAAW;AAClE,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,WAAW,OAAO,SAAS,OAAO,CAAC,YAAY;AACnD,YAAM,OAAO,UAAU,IAAI,OAAO;AAClC,aACE,SAAS,UACT,2BAA2B,QAAQ,SAAS,MAAM,yBAAyB,IAAI,OAAO,CAAC;AAAA,IAE3F,CAAC;AACD,WAAO,SAAS,SAAS,IAAI,CAAC,EAAE,GAAG,QAAQ,SAAS,CAAC,IAAI,CAAC;AAAA,EAC5D,CAAC;AACD,SAAO,EAAE,OAAO,gBAAgB,QAAQ;AAC1C;AAEA,IAAM,qBAAqB;AAC3B,IAAM,0BAA0B;AAQhC,IAAM,aAAa,oBAAI,IAA6B;AAYpD,IAAM,cAAc,oBAAI,IAAwB;AAEzC,IAAM,0BAA0B,EAAE,MAAM,GAAG,QAAQ,GAAG,QAAQ,EAAE;AAGvE,SAAS,WAA6B,OAAa;AAEjD,MAAI,OAAO,SAAS,KAAK,EAAG,QAAO;AACnC,SAAO,OAAO,KAAK;AACnB,aAAW,SAAS,OAAO,OAAO,KAAK,EAAG,YAAW,KAAK;AAC1D,SAAO;AACT;AAEO,SAAS,0BAAgC;AAC9C,aAAW,MAAM;AACjB,cAAY,MAAM;AACpB;AAQA,SAAS,gBAAgB,KAAa,OAAe,SAAuC;AAC1F,0BAAwB;AACxB,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,UAA2C,4BAA4B;AAAA,IAC3E,WAAW,QAAQ;AAAA,IACnB,yBAAyB,QAAQ;AAAA,IACjC,gBAAgB,QAAQ;AAAA,IACxB,4BAA4B,QAAQ;AAAA,IACpC,aAAa,WAAW;AAAA,EAC1B,CAAC,EACE,KAAK,CAAC,UAAU;AACf,UAAM,QAAQ,EAAE,OAAO,WAAW,MAAM,KAAK,GAAG,SAAS,WAAW,MAAM,OAAO,EAAE;AAEnF,QAAI,YAAY,IAAI,GAAG,GAAG,YAAY,QAAS,QAAO;AACtD,eAAW,OAAO,GAAG;AACrB,eAAW,IAAI,KAAK,EAAE,OAAO,aAAa,MAAM,CAAC;AACjD,WAAO,WAAW,OAAO,yBAAyB;AAChD,YAAM,SAAS,WAAW,KAAK,EAAE,KAAK,EAAE;AACxC,UAAI,WAAW,OAAW;AAC1B,iBAAW,OAAO,MAAM;AAAA,IAC1B;AACA,WAAO;AAAA,EACT,CAAC,EACA,QAAQ,MAAM;AACb,QAAI,YAAY,IAAI,GAAG,GAAG,YAAY,QAAS,aAAY,OAAO,GAAG;AAAA,EACvE,CAAC;AACH,QAAM,QAAoB,EAAE,OAAO,SAAS,YAAY,SAAS,EAAE;AACnE,cAAY,IAAI,KAAK,KAAK;AAC1B,SAAO;AACT;AAOA,SAAS,eAAe,KAAa,OAAmB,QAAkE;AACxH,QAAM;AACN,SAAO,UAAU,MAAM,SAAS,QAAQ,4BAA4B,EAAE,QAAQ,MAAM;AAClF,UAAM;AACN,QAAI,MAAM,UAAU,EAAG;AACvB,QAAI,YAAY,IAAI,GAAG,MAAM,MAAO,aAAY,OAAO,GAAG;AAC1D,UAAM,WAAW,MAAM;AAAA,EACzB,CAAC;AACH;AAcA,eAAsB,2BAA2B,SAQb;AAClC,MAAI,QAAQ,aAAa,QAAQ,QAAQ,UAAU,OAAW,QAAO,4BAA4B,OAAO;AAExG,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,eAAe,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACtG,QAAM,MAAM,KAAK,UAAU;AAAA,IACzB,QAAQ;AAAA,IACR;AAAA,IACA,QAAQ,mBAAmB;AAAA,IAC3B,QAAQ,+BAA+B;AAAA,EACzC,CAAC;AAGD,QAAM,QAAQ,uBAAuB,QAAQ,WAAW,YAAY;AACpE,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,MAAM,WAAW,IAAI,GAAG;AAC9B,MAAI,OAAO,IAAI,UAAU,SAAS,cAAc,IAAI,cAAc,oBAAoB;AACpF,4BAAwB;AACxB,eAAW,OAAO,GAAG;AACrB,eAAW,IAAI,KAAK,GAAG;AACvB,WAAO,IAAI;AAAA,EACb;AACA,QAAM,UAAU,YAAY,IAAI,GAAG;AACnC,MAAI,SAAS,UAAU,OAAO;AAC5B,4BAAwB;AACxB,WAAO,eAAe,KAAK,SAAS,QAAQ,WAAW;AAAA,EACzD;AACA,SAAO,eAAe,KAAK,gBAAgB,KAAK,OAAO,OAAO,GAAG,QAAQ,WAAW;AACtF;AAEA,eAAsB,wBAAwB,SAWP;AACrC,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,cAAc,IAAI,IAAI,sBAAsB,QAAQ,OAAO,CAAC,QAAQ,OAAO,CAAC,CAAC;AACnF,MAAI,YAAY,SAAS,KAAK,QAAQ,cAAc,EAAG,QAAO,CAAC;AAI/D,QAAM,EAAE,OAAO,eAAe,QAAQ,IAAI,MAAM,2BAA2B;AAAA,IACzE,GAAG;AAAA,IACH,UAAU,QAAQ,kBAAkB;AAAA,EACtC,CAAC;AACD,QAAM,aAAa,oBAAI,IAA+B;AAEtD,aAAW,QAAQ,eAAe;AAChC,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,EAAE,OAAO,cAAc,IAAI,UAAU,MAAM,WAAW;AAC5D,QAAI,SAAS,EAAG;AAChB,eAAW,IAAI,KAAK,QAAQ;AAAA,MAC1B;AAAA,MACA,WAAW;AAAA,MACX,aAAa;AAAA,MACb,eAAe,IAAI,IAAI,aAAa;AAAA,MACpC,gBAAgB,oBAAI,IAAI;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,YAAY,IAAI,IAAI,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAC1E,eAAW,UAAU,SAAS;AAC5B,qBAAe,QAAQ,aAAa,4BAA4B;AAEhE,YAAM,mBAAmB,OAAO;AAChC,YAAM,mBAAmB,IAAI,IAAI,iBAAiB,QAAQ,CAAC,YAAY,UAAU,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC1G,YAAM,qBAAqB,OAAO,MAAM,OAAO,CAAC,QAAQ,iBAAiB,IAAI,GAAG,CAAC,KAAK,CAAC;AACvF,YAAM,EAAE,OAAO,cAAc,IAAI,YAAY,QAAQ,aAAa,kBAAkB;AACpF,UAAI,SAAS,EAAG;AAChB,iBAAW,WAAW,kBAAkB;AACtC,cAAM,OAAO,UAAU,IAAI,OAAO;AAClC,YAAI,CAAC,KAAM;AACX,cAAM,WAAW,WAAW,IAAI,OAAO,KAAK;AAAA,UAC1C;AAAA,UACA,WAAW;AAAA,UACX,aAAa;AAAA,UACb,eAAe,oBAAI,IAAY;AAAA,UAC/B,gBAAgB,oBAAI,IAAmC;AAAA,QACzD;AACA,iBAAS,eAAe;AACxB,iBAAS,cAAc,IAAI,QAAQ;AACnC,mBAAW,SAAS,cAAe,UAAS,cAAc,IAAI,KAAK;AACnE,iBAAS,eAAe,IAAI,OAAO,UAAU;AAAA,UAC3C,UAAU,OAAO;AAAA,UACjB,YAAY,OAAO;AAAA,UACnB,aAAa,OAAO;AAAA,QACtB,CAAC;AACD,mBAAW,IAAI,SAAS,QAAQ;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,WAAW,OAAO,CAAC,EAC3B,IAAI,CAAC,cAAc;AAClB,QAAI,QAAQ,UAAU,YAAY,UAAU;AAC5C,QAAI,QAAQ,cAAc,UAAU,KAAK,eAAe,QAAQ,WAAY,UAAS;AACrF,WAAO;AAAA,MACL,MAAM,UAAU;AAAA,MAChB;AAAA,MACA,WAAW,UAAU;AAAA,MACrB,aAAa,UAAU;AAAA,MACvB,eAAe,CAAC,GAAG,UAAU,aAAa,EAAE,KAAK;AAAA,MACjD,gBAAgB,CAAC,GAAG,UAAU,eAAe,OAAO,CAAC,EAAE;AAAA,QACrD,CAAC,MAAM,UACL,KAAK,WAAW,cAAc,MAAM,UAAU,KAAK,KAAK,YAAY,cAAc,MAAM,WAAW;AAAA,MACvG;AAAA,IACF;AAAA,EACF,CAAC,EACA,OAAO,CAAC,WAAW,OAAO,YAAY,KAAK,OAAO,cAAc,CAAC,EACjE;AAAA,IACC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SACnB,MAAM,cAAc,KAAK,eACzB,MAAM,KAAK,WAAW,cAAc,KAAK,KAAK,UAAU;AAAA,EAC5D,EACC,MAAM,GAAG,QAAQ,UAAU;AAChC;","names":[]}

package/dist/{chunk-TZKK72BY.js → chunk-QIPDTAWZ.js}

@@ -2,7 +2,7 @@ import {
   ExtractionDrain,
   TurnIngestionCoordinator,
   shouldSkipImplicitExtraction
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-MMOXCCHF.js";
 import {
   headerConnector,
   renderExtractionConversation,
@@ -447,4 +447,4 @@ export {
   ClaimBufferStorage,
   BufferDrainRunner
 };
-//# sourceMappingURL=chunk-TZKK72BY.js.map
+//# sourceMappingURL=chunk-QIPDTAWZ.js.map

package/dist/cli.js

@@ -91,7 +91,7 @@ import {
   runWorkProductStatusCliCommand,
   runWorkProjectCliCommand,
   runWorkTaskCliCommand
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-MMOXCCHF.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import "./chunk-B3DR2JBZ.js";
@@ -264,7 +264,7 @@ import "./chunk-MDPT6QFK.js";
 import "./chunk-UOBPK2OS.js";
 import "./chunk-2YA5N2BY.js";
 import "./chunk-3HSRWJTC.js";
-import "./chunk-4PXDXCNE.js";
+import "./chunk-PL36IQPL.js";
 import "./chunk-HUDPXTXW.js";
 import "./chunk-AZEZSQ5R.js";
 import "./chunk-YAZNBMNF.js";

package/dist/explicit-capture.js

@@ -8,7 +8,7 @@ import {
   shouldSkipImplicitExtraction,
   stripInlineExplicitCaptureNotes,
   validateExplicitCaptureInput
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-MMOXCCHF.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import "./chunk-B3DR2JBZ.js";
@@ -181,7 +181,7 @@ import "./chunk-MDPT6QFK.js";
 import "./chunk-UOBPK2OS.js";
 import "./chunk-2YA5N2BY.js";
 import "./chunk-3HSRWJTC.js";
-import "./chunk-4PXDXCNE.js";
+import "./chunk-PL36IQPL.js";
 import "./chunk-HUDPXTXW.js";
 import "./chunk-AZEZSQ5R.js";
 import "./chunk-YAZNBMNF.js";

package/dist/harmonic-retrieval.d.ts

@@ -25,10 +25,11 @@ export interface ProjectedHarmonicGraph {
     nodes: AbstractionNode[];
     anchors: CueAnchor[];
 }
-/** Counters for tests and diagnostics. */
+/** Counters for tests and diagnostics. `shared` counts reads that joined a build already running. */
 export declare const harmonicGraphCacheStats: {
     hits: number;
     misses: number;
+    shared: number;
 };
 export declare function clearHarmonicGraphCache(): void;
 /**
@@ -39,9 +40,9 @@ export declare function clearHarmonicGraphCache(): void;
  * cold-write version sentinels (bumped by every memory write, in any process) and
  * the graph version sentinel (bumped by node and anchor writes). A stamp read is
  * four stats, not a scan of the memories. The TTL bounds the one input a sentinel
- * cannot see, which is wall-clock validity expiry. An explicit `nowMs` bypasses the
- * cache so tests stay deterministic. The cached arrays are frozen: callers must not
- * mutate them.
+ * cannot see, which is wall-clock validity expiry. Concurrent misses share one
+ * build. An explicit `nowMs` bypasses the cache so tests stay deterministic. The
+ * cached arrays are frozen: callers must not mutate them.
  */
 export declare function readProjectedHarmonicGraph(options: {
     memoryDir: string;

package/dist/harmonic-retrieval.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"harmonic-retrieval.d.ts","sourceRoot":"","sources":["../src/harmonic-retrieval.ts"],"names":[],"mappings":"AAMC,OAAO,EAIL,KAAK,eAAe,EACrB,MAAM,wBAAwB,CAAC;AACjC,OAAO,EAA+C,KAAK,SAAS,EAAE,KAAK,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAsPnH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,aAAa,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,eAAe,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,cAAc,EAAE,qBAAqB,EAAE,CAAC;CACzC;AA+ED,wBAAsB,oBAAoB,CAAC,OAAO,EAAE;IAClD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;CAClC,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CAY7B;AAED,wBAAsB,cAAc,CAAC,OAAO,EAAE;IAC5C,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;CAClC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAavB;AAED,MAAM,WAAW,sBAAsB;IACrC,KAAK,EAAE,eAAe,EAAE,CAAC;IACzB,OAAO,EAAE,SAAS,EAAE,CAAC;CACtB;AAqFD,0CAA0C;AAC1C,eAAO,MAAM,uBAAuB;;;CAAyB,CAAC;AAW9D,wBAAgB,uBAAuB,IAAI,IAAI,CAE9C;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,0BAA0B,CAAC,OAAO,EAAE;IACxD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;IACrC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAoClC;AAED,wBAAsB,uBAAuB,CAAC,OAAO,EAAE;IACrD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;IACrC,yHAAyH;IACzH,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB,GAAG,OAAO,CAAC,uBAAuB,EAAE,CAAC,CAoFrC"}
+{"version":3,"file":"harmonic-retrieval.d.ts","sourceRoot":"","sources":["../src/harmonic-retrieval.ts"],"names":[],"mappings":"AAMC,OAAO,EAIL,KAAK,eAAe,EACrB,MAAM,wBAAwB,CAAC;AACjC,OAAO,EAA+C,KAAK,SAAS,EAAE,KAAK,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAsPnH,MAAM,WAAW,qBAAqB;IACpC,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,aAAa,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,uBAAuB;IACtC,IAAI,EAAE,eAAe,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,cAAc,EAAE,qBAAqB,EAAE,CAAC;CACzC;AA+ED,wBAAsB,oBAAoB,CAAC,OAAO,EAAE;IAClD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;CAClC,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CAY7B;AAED,wBAAsB,cAAc,CAAC,OAAO,EAAE;IAC5C,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;CAClC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAavB;AAED,MAAM,WAAW,sBAAsB;IACrC,KAAK,EAAE,eAAe,EAAE,CAAC;IACzB,OAAO,EAAE,SAAS,EAAE,CAAC;CACtB;AAiGD,qGAAqG;AACrG,eAAO,MAAM,uBAAuB;;;;CAAoC,CAAC;AAWzE,wBAAgB,uBAAuB,IAAI,IAAI,CAG9C;AAuDD;;;;;;;;;;;GAWG;AACH,wBAAsB,0BAA0B,CAAC,OAAO,EAAE;IACxD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;IACrC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB,GAAG,OAAO,CAAC,sBAAsB,CAAC,CA4BlC;AAED,wBAAsB,uBAAuB,CAAC,OAAO,EAAE;IACrD,SAAS,EAAE,MAAM,CAAC;IAClB,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,OAAO,CAAC;IACxB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;IACrC,yHAAyH;IACzH,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB,GAAG,OAAO,CAAC,uBAAuB,EAAE,CAAC,CAoFrC"}

package/dist/harmonic-retrieval.js

@@ -5,7 +5,7 @@ import {
   readCueAnchors,
   readProjectedHarmonicGraph,
   searchHarmonicRetrieval
-} from "./chunk-4PXDXCNE.js";
+} from "./chunk-PL36IQPL.js";
 import "./chunk-HUDPXTXW.js";
 import "./chunk-AZEZSQ5R.js";
 import "./chunk-FL3O34XF.js";

package/dist/index.js

@@ -259,7 +259,7 @@ import {
   writeManifest,
   writeMeetingEpisodeMemory,
   writeTimelineState
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-MMOXCCHF.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import {
@@ -717,7 +717,7 @@ import {
 import "./chunk-UOBPK2OS.js";
 import "./chunk-2YA5N2BY.js";
 import "./chunk-3HSRWJTC.js";
-import "./chunk-4PXDXCNE.js";
+import "./chunk-PL36IQPL.js";
 import "./chunk-HUDPXTXW.js";
 import "./chunk-AZEZSQ5R.js";
 import "./chunk-YAZNBMNF.js";

package/dist/orchestration/backlog-scheduler.d.ts

@@ -68,6 +68,8 @@ export interface BacklogSchedulerOptions {
     pollMs?: number;
     retryBaseMs?: number;
     retryMaxMs?: number;
+    /** Bound on `stop()`'s wait for aborted drains to settle. */
+    stopSettleTimeoutMs?: number;
     now?: () => number;
 }
 export interface BacklogSchedulerCounters {
@@ -113,7 +115,10 @@ export declare class BacklogScheduler {
     /** Idempotent. Starts the poll timer (unref'd) and runs an initial tick. */
     start(): void;
     /** Idempotent. Stops the timer, aborts in-flight drains (their claims stay
-     *  retryable) and waits for them to settle. */
+     *  retryable) and waits up to `stopSettleTimeoutMs` for them to settle. A
+     *  drain that ignores abort is named in a warning and left behind: the
+     *  caller's later shutdown phases (orchestrator flush and dispose) must
+     *  still run before the service manager's kill. */
     stop(): Promise<void>;
     /** Bounded snapshot for ops/watchers: counters + per-key states + live sets. */
     snapshot(): BacklogSchedulerSnapshot;

package/dist/orchestration/backlog-scheduler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"backlog-scheduler.d.ts","sourceRoot":"","sources":["../../src/orchestration/backlog-scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAKH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,KAAK,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,mCAAmC,CAAC;AAEvF,OAAO,KAAK,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AACtF,OAAO,KAAK,EAAE,0BAA0B,EAAE,MAAM,mCAAmC,CAAC;AACpF,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAErE;+EAC+E;AAC/E,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,IAAI,CAAC,0BAA0B,EAAE,eAAe,GAAG,uBAAuB,GAAG,gBAAgB,CAAC,CAAC;IACtG,MAAM,EAAE,IAAI,CAAC,iBAAiB,EAAE,MAAM,GAAG,UAAU,GAAG,sBAAsB,GAAG,WAAW,CAAC,CAAC;IAC5F;8EAC0E;IAC1E,gBAAgB,IACZ,GAAG,CAAC,MAAM,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,CAAC,GACrD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;IACnE,qDAAqD;IACrD,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,UAAU,CAAC;IACnC,oEAAoE;IACpE,QAAQ,CACN,GAAG,EAAE,MAAM,EACX,OAAO,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,WAAW,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,gBAAgB,KAAK,IAAI,CAAA;KAAE,GAC7F,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAChC;;;;;sBAKkB;IAClB,eAAe,CAAC,IAAI,uBAAuB,CAAC;IAC5C,0DAA0D;IAC1D,GAAG,CAAC,IAAI,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,uBAAuB;IACtC,0EAA0E;IAC1E,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,8DAA8D;IAC9D,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,wBAAwB;IACvC,8EAA8E;IAC9E,OAAO,EAAE,MAAM,CAAC;IAChB,2EAA2E;IAC3E,SAAS,EAAE,MAAM,CAAC;IAClB,4EAA4E;IAC5E,cAAc,EAAE,MAAM,CAAC;IACvB,6DAA6D;IAC7D,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IACxC,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,MAAM,eAAe,GAAG,UAAU,GAAG,SAAS,GAAG,QAAQ,CAAC;AAEhE,MAAM,WAAW,kBAAkB;IACjC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,eAAe,CAAC;IACvB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,wBAAwB;IACvC,QAAQ,EAAE,wBAAwB,CAAC;IACnC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,IAAI,EAAE,kBAAkB,EAAE,CAAC;CAC5B;AAeD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAuB;IAC5C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAwF;IAChH,OAAO,CAAC,QAAQ,CAAC,IAAI,CAA+B;IACpD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA8E;IACvG,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAqB;IAC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAOvB;IACF,OAAO,CAAC,WAAW,CAAqB;IACxC,OAAO,CAAC,KAAK,CAA6C;IAC1D,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,OAAO,CAAQ;gBAEX,IAAI,EAAE,oBAAoB,EAAE,OAAO,GAAE,uBAA4B;IAW7E,4EAA4E;IAC5E,KAAK,IAAI,IAAI;IAQb;mDAC+C;IACzC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAe3B,gFAAgF;IAChF,QAAQ,IAAI,wBAAwB;IAqBpC;wEACoE;IAC9D,WAAW,IAAI,OAAO,CAAC,IAAI,CAAC;IAOlC;4DACwD;IAClD,aAAa,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAQpD,OAAO,CAAC,GAAG;YAIG,IAAI;IA8ClB,wEAAwE;YAC1D,kBAAkB;IAmBhC;2EACuE;IACvE,OAAO,CAAC,eAAe;IAKvB,wEAAwE;IACxE,OAAO,CAAC,gBAAgB;IA6BxB;uEACmE;IACnE,OAAO,CAAC,iBAAiB;IAOzB;sEACkE;YACpD,MAAM;IA4BpB,sEAAsE;YACxD,cAAc;IAe5B;;oBAEgB;YACF,eAAe;IAkB7B,OAAO,CAAC,YAAY;IAwBpB,yDAAyD;IACzD,OAAO,CAAC,wBAAwB;IAchC;8EAC0E;IAC1E,OAAO,CAAC,YAAY;IAepB,OAAO,CAAC,mBAAmB;IAI3B,OAAO,CAAC,SAAS;IAMjB,OAAO,CAAC,UAAU;CAUnB;AAKD;qEACqE;AACrE,wBAAgB,oBAAoB,CAClC,YAAY,EAAE,YAAY,EAC1B,OAAO,GAAE,uBAA4B,GACpC,gBAAgB,CA8BlB"}
+{"version":3,"file":"backlog-scheduler.d.ts","sourceRoot":"","sources":["../../src/orchestration/backlog-scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAKH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,KAAK,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,mCAAmC,CAAC;AAEvF,OAAO,KAAK,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AACtF,OAAO,KAAK,EAAE,0BAA0B,EAAE,MAAM,mCAAmC,CAAC;AACpF,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAErE;+EAC+E;AAC/E,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,IAAI,CAAC,0BAA0B,EAAE,eAAe,GAAG,uBAAuB,GAAG,gBAAgB,CAAC,CAAC;IACtG,MAAM,EAAE,IAAI,CAAC,iBAAiB,EAAE,MAAM,GAAG,UAAU,GAAG,sBAAsB,GAAG,WAAW,CAAC,CAAC;IAC5F;8EAC0E;IAC1E,gBAAgB,IACZ,GAAG,CAAC,MAAM,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,CAAC,GACrD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;IACnE,qDAAqD;IACrD,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,UAAU,CAAC;IACnC,oEAAoE;IACpE,QAAQ,CACN,GAAG,EAAE,MAAM,EACX,OAAO,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,WAAW,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,gBAAgB,KAAK,IAAI,CAAA;KAAE,GAC7F,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAChC;;;;;sBAKkB;IAClB,eAAe,CAAC,IAAI,uBAAuB,CAAC;IAC5C,0DAA0D;IAC1D,GAAG,CAAC,IAAI,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,uBAAuB;IACtC,0EAA0E;IAC1E,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,8DAA8D;IAC9D,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,6DAA6D;IAC7D,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,wBAAwB;IACvC,8EAA8E;IAC9E,OAAO,EAAE,MAAM,CAAC;IAChB,2EAA2E;IAC3E,SAAS,EAAE,MAAM,CAAC;IAClB,4EAA4E;IAC5E,cAAc,EAAE,MAAM,CAAC;IACvB,6DAA6D;IAC7D,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IACxC,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,MAAM,eAAe,GAAG,UAAU,GAAG,SAAS,GAAG,QAAQ,CAAC;AAEhE,MAAM,WAAW,kBAAkB;IACjC,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,eAAe,CAAC;IACvB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,wBAAwB;IACvC,QAAQ,EAAE,wBAAwB,CAAC;IACnC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,IAAI,EAAE,kBAAkB,EAAE,CAAC;CAC5B;AAkBD,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAuB;IAC5C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAwF;IAChH,OAAO,CAAC,QAAQ,CAAC,IAAI,CAA+B;IACpD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA8E;IACvG,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAqB;IAC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAOvB;IACF,OAAO,CAAC,WAAW,CAAqB;IACxC,OAAO,CAAC,KAAK,CAA6C;IAC1D,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,OAAO,CAAQ;gBAEX,IAAI,EAAE,oBAAoB,EAAE,OAAO,GAAE,uBAA4B;IAY7E,4EAA4E;IAC5E,KAAK,IAAI,IAAI;IAQb;;;;uDAImD;IAC7C,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IA2B3B,gFAAgF;IAChF,QAAQ,IAAI,wBAAwB;IAqBpC;wEACoE;IAC9D,WAAW,IAAI,OAAO,CAAC,IAAI,CAAC;IAOlC;4DACwD;IAClD,aAAa,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAQpD,OAAO,CAAC,GAAG;YAIG,IAAI;IA8ClB,wEAAwE;YAC1D,kBAAkB;IAmBhC;2EACuE;IACvE,OAAO,CAAC,eAAe;IAKvB,wEAAwE;IACxE,OAAO,CAAC,gBAAgB;IA6BxB;uEACmE;IACnE,OAAO,CAAC,iBAAiB;IAOzB;sEACkE;YACpD,MAAM;IA4BpB,sEAAsE;YACxD,cAAc;IAe5B;;oBAEgB;YACF,eAAe;IAkB7B,OAAO,CAAC,YAAY;IAwBpB,yDAAyD;IACzD,OAAO,CAAC,wBAAwB;IAchC;8EAC0E;IAC1E,OAAO,CAAC,YAAY;IAepB,OAAO,CAAC,mBAAmB;IAI3B,OAAO,CAAC,SAAS;IAMjB,OAAO,CAAC,UAAU;CAUnB;AAKD;qEACqE;AACrE,wBAAgB,oBAAoB,CAClC,YAAY,EAAE,YAAY,EAC1B,OAAO,GAAE,uBAA4B,GACpC,gBAAgB,CA8BlB"}

package/dist/orchestration/backlog-scheduler.js

@@ -1,7 +1,7 @@
 import {
   BufferDrainRunner
-} from "../chunk-TZKK72BY.js";
-import "../chunk-5DGK7E4W.js";
+} from "../chunk-QIPDTAWZ.js";
+import "../chunk-MMOXCCHF.js";
 import "../chunk-6P7U3HWG.js";
 import "../chunk-PQM3B54K.js";
 import "../chunk-B3DR2JBZ.js";
@@ -174,7 +174,7 @@ import "../chunk-MDPT6QFK.js";
 import "../chunk-UOBPK2OS.js";
 import "../chunk-2YA5N2BY.js";
 import "../chunk-3HSRWJTC.js";
-import "../chunk-4PXDXCNE.js";
+import "../chunk-PL36IQPL.js";
 import "../chunk-HUDPXTXW.js";
 import "../chunk-AZEZSQ5R.js";
 import "../chunk-YAZNBMNF.js";
@@ -571,6 +571,7 @@ import { hostname } from "os";
 var DEFAULT_POLL_MS = 15e3;
 var DEFAULT_RETRY_BASE_MS = 3e4;
 var DEFAULT_RETRY_MAX_MS = 15 * 6e4;
+var DEFAULT_STOP_SETTLE_TIMEOUT_MS = 3e4;
 var BacklogScheduler = class {
   deps;
   options;
@@ -596,6 +597,7 @@ var BacklogScheduler = class {
       pollMs: options.pollMs ?? DEFAULT_POLL_MS,
       retryBaseMs: options.retryBaseMs ?? DEFAULT_RETRY_BASE_MS,
       retryMaxMs: options.retryMaxMs ?? DEFAULT_RETRY_MAX_MS,
+      stopSettleTimeoutMs: options.stopSettleTimeoutMs ?? DEFAULT_STOP_SETTLE_TIMEOUT_MS,
       now: options.now
     };
   }
@@ -608,7 +610,10 @@ var BacklogScheduler = class {
     void this.tick();
   }
   /** Idempotent. Stops the timer, aborts in-flight drains (their claims stay
-   *  retryable) and waits for them to settle. */
+   *  retryable) and waits up to `stopSettleTimeoutMs` for them to settle. A
+   *  drain that ignores abort is named in a warning and left behind: the
+   *  caller's later shutdown phases (orchestrator flush and dispose) must
+   *  still run before the service manager's kill. */
   async stop() {
     if (this.stopped) return;
     this.stopped = true;
@@ -621,7 +626,18 @@ var BacklogScheduler = class {
       entry.controller.abort(new Error("backlog scheduler stopping"));
       aborts.push(entry.settled);
     }
-    await Promise.allSettled(aborts);
+    const bound = Promise.withResolvers();
+    const boundTimer = setTimeout(() => bound.resolve("timeout"), this.options.stopSettleTimeoutMs);
+    try {
+      const result = await Promise.race([Promise.allSettled(aborts), bound.promise]);
+      if (result === "timeout") {
+        log.warn(
+          `backlog scheduler stop: ${this.inFlight.size} drain(s) ignored abort for ${this.options.stopSettleTimeoutMs}ms; continuing shutdown (stuck keys: ${[...this.inFlight.keys()].join(", ")})`
+        );
+      }
+    } finally {
+      clearTimeout(boundTimer);
+    }
   }
   /** Bounded snapshot for ops/watchers: counters + per-key states + live sets. */
   snapshot() {

package/dist/orchestration/backlog-scheduler.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/orchestration/backlog-scheduler.ts"],"sourcesContent":["/**\n * Daemon-owned extraction backlog scheduler.\n *\n * ONE bounded in-process loop that owns ALL persisted extraction backlog:\n * at startup (existing drain claims + buffered sessions), on every poll tick\n * (new persisted work), and by retrying keys that are still pending — with\n * bounded memory (per-key COUNTS only; candidate scans never retain turn\n * payloads) and bounded outstanding work (the extraction queue's own\n * maxConcurrency gates submissions, so live foreground work keeps its share\n * of the queue).\n *\n * Claim authority: an existing claim — including an EMPTY ack tombstone — is\n * authoritative over the live buffer's in-memory copy. A tombstoned key is\n * never re-claimed or counted as work; new ingress consumes the tombstone\n * through the native save handover, which is what makes the key a candidate\n * again. Claim creation is fenced: the key is reserved synchronously on the\n * extraction queue BEFORE the async claim decision, so a queued live task for\n * the same key cannot start past the claimed-session gate until the decision\n * settles; live capture continues via the native merge-into-claim protocol.\n *\n * Failed, deferred, or policy-denied outcomes keep their turns durable in the\n * claim and re-submit after backoff (exponential from `retryBaseMs` to\n * `retryMaxMs`, reset by progress; denials wait the full max) — never a busy\n * retry. `stop()` aborts in-flight drains at their chunk boundary and leaves\n * every claim retryable; a restarted daemon's scheduler adopts them.\n */\n\nimport { randomUUID } from \"node:crypto\";\nimport { hostname } from \"node:os\";\nimport { log } from \"../logger.js\";\nimport type { Orchestrator } from \"../orchestrator.js\";\nimport type { BufferDrainClaims, DrainLease } from \"../storage/buffer-drain-claims.js\";\nimport { BufferDrainRunner } from \"./buffer-drain-runner.js\";\nimport type { DrainRunnerEvent, DrainSessionOutcome } from \"./buffer-drain-runner.js\";\nimport type { ExtractionQueueCoordinator } from \"./extraction-queue-coordinator.js\";\nimport type { ProviderBreakerSnapshot } from \"./provider-breaker.js\";\n\n/** What the scheduler needs from its host (structurally satisfied by the\n *  orchestrator wiring); injectable so tests drive ticks deterministically. */\nexport interface BacklogSchedulerDeps {\n  queue: Pick<ExtractionQueueCoordinator, \"tryReserveKey\" | \"releaseKeyReservation\" | \"maxConcurrency\">;\n  claims: Pick<BufferDrainClaims, \"list\" | \"listPage\" | \"claimFromSessionFile\" | \"isClaimed\">;\n  /** Live per-key pending counts (counts only — never turn payloads). May be\n   *  async: hosts with a lazily-loaded buffer load it here (idempotent). */\n  liveBufferCounts():\n    | Map<string, { turns: number; retainedTurns: number }>\n    | Promise<Map<string, { turns: number; retainedTurns: number }>>;\n  /** Create a fresh lease for a unique owner token. */\n  lease(ownerId: string): DrainLease;\n  /** Drain one key to quiescence (BufferDrainRunner.drainSession). */\n  drainKey(\n    key: string,\n    options: { ownerId: string; signal: AbortSignal; onEvent?: (event: DrainRunnerEvent) => void }\n  ): Promise<DrainSessionOutcome>;\n  /** Shared provider circuit-breaker snapshot (the same instance the run\n   *  coordinator gates attempts on). While OPEN inside its cooldown window\n   *  the scheduler skips submission entirely — claims stay durable, and the\n   *  breaker's single half-open probe (one attempt through once the window\n   *  lapses) keeps recovery automatic. Optional: hosts without a breaker\n   *  never skip. */\n  breakerSnapshot?(): ProviderBreakerSnapshot;\n  /** Test seam: monotonic-ish clock for backoff windows. */\n  now?(): number;\n}\n\nexport interface BacklogSchedulerOptions {\n  /** Optional label prefix; each scheduler instance adds a unique token. */\n  ownerId?: string;\n  /** Scan cadence in ms (startup + new-work + retry checks). */\n  pollMs?: number;\n  retryBaseMs?: number;\n  retryMaxMs?: number;\n  now?: () => number;\n}\n\nexport interface BacklogSchedulerCounters {\n  /** Keys submitted to the drain (claimed or adopted) this process lifetime. */\n  claimed: number;\n  /** Outcomes with genuinely empty claims (durable outputs preceded ack). */\n  processed: number;\n  /** Sum of durable outputs (memories + entities) across processed drains. */\n  durableOutputs: number;\n  /** Re-submissions after a failed/deferred/denied outcome. */\n  retried: number;\n  denied: { keys: number; turns: number };\n  failed: number;\n}\n\nexport type BacklogKeyState = \"inflight\" | \"backoff\" | \"denied\";\n\nexport interface BacklogKeySnapshot {\n  key: string;\n  state: BacklogKeyState;\n  turnsRemaining?: number;\n  reason?: string;\n}\n\nexport interface BacklogSchedulerSnapshot {\n  counters: BacklogSchedulerCounters;\n  inFlight: string[];\n  reservedKeys: string[];\n  keys: BacklogKeySnapshot[];\n}\n\ninterface KeyState {\n  state: BacklogKeyState;\n  nextAttemptMs: number;\n  /** Last observed remaining turns; progress resets the backoff exponent. */\n  turnsRemaining: number;\n  reason?: string;\n  backoffExponent: number;\n}\n\nconst DEFAULT_POLL_MS = 15_000;\nconst DEFAULT_RETRY_BASE_MS = 30_000;\nconst DEFAULT_RETRY_MAX_MS = 15 * 60_000;\n\nexport class BacklogScheduler {\n  private readonly deps: BacklogSchedulerDeps;\n  private readonly options: Required<Omit<BacklogSchedulerOptions, \"now\">> & Pick<BacklogSchedulerOptions, \"now\">;\n  private readonly keys = new Map<string, KeyState>();\n  private readonly inFlight = new Map<string, { controller: AbortController; settled: Promise<void> }>();\n  private readonly reserved = new Set<string>();\n  private readonly counters: BacklogSchedulerCounters = {\n    claimed: 0,\n    processed: 0,\n    durableOutputs: 0,\n    retried: 0,\n    denied: { keys: 0, turns: 0 },\n    failed: 0,\n  };\n  private claimCursor: string | undefined;\n  private timer: ReturnType<typeof setInterval> | undefined;\n  private ticking = false;\n  private stopped = true;\n\n  constructor(deps: BacklogSchedulerDeps, options: BacklogSchedulerOptions = {}) {\n    this.deps = deps;\n    this.options = {\n      ownerId: `${options.ownerId ?? \"daemon-drain\"}-${randomUUID()}`,\n      pollMs: options.pollMs ?? DEFAULT_POLL_MS,\n      retryBaseMs: options.retryBaseMs ?? DEFAULT_RETRY_BASE_MS,\n      retryMaxMs: options.retryMaxMs ?? DEFAULT_RETRY_MAX_MS,\n      now: options.now,\n    };\n  }\n\n  /** Idempotent. Starts the poll timer (unref'd) and runs an initial tick. */\n  start(): void {\n    if (!this.stopped) return;\n    this.stopped = false;\n    this.timer = setInterval(() => void this.tick(), this.options.pollMs);\n    this.timer.unref?.();\n    void this.tick();\n  }\n\n  /** Idempotent. Stops the timer, aborts in-flight drains (their claims stay\n   *  retryable) and waits for them to settle. */\n  async stop(): Promise<void> {\n    if (this.stopped) return;\n    this.stopped = true;\n    if (this.timer) {\n      clearInterval(this.timer);\n      this.timer = undefined;\n    }\n    const aborts: Promise<void>[] = [];\n    for (const entry of this.inFlight.values()) {\n      entry.controller.abort(new Error(\"backlog scheduler stopping\"));\n      aborts.push(entry.settled);\n    }\n    await Promise.allSettled(aborts);\n  }\n\n  /** Bounded snapshot for ops/watchers: counters + per-key states + live sets. */\n  snapshot(): BacklogSchedulerSnapshot {\n    return {\n      counters: {\n        claimed: this.counters.claimed,\n        processed: this.counters.processed,\n        durableOutputs: this.counters.durableOutputs,\n        retried: this.counters.retried,\n        denied: { ...this.counters.denied },\n        failed: this.counters.failed,\n      },\n      inFlight: [...this.inFlight.keys()],\n      reservedKeys: [...this.reserved],\n      keys: [...this.keys.entries()].map(([key, state]) => ({\n        key,\n        state: state.state,\n        turnsRemaining: state.turnsRemaining,\n        reason: state.reason,\n      })),\n    };\n  }\n\n  /** One scan+submit pass (tests drive this instead of the timer). Waits out\n   *  any in-progress tick first so the pass always actually scans. */\n  async tickForTest(): Promise<void> {\n    // setImmediate: yields to the event loop so pending I/O (a slow first\n    // scan) can finish; a microtask spin would starve it.\n    while (this.ticking) await new Promise((resolve) => setImmediate(resolve));\n    await this.tick();\n  }\n\n  /** Await the settle (slot release) of everything currently in flight,\n   *  optionally excluding one still-gated key (tests). */\n  async settleForTest(exclude?: string): Promise<void> {\n    for (;;) {\n      const pending = [...this.inFlight.entries()].filter(([key]) => key !== exclude).map(([, entry]) => entry.settled);\n      if (pending.length === 0) return;\n      await Promise.allSettled(pending);\n    }\n  }\n\n  private now(): number {\n    return this.options.now?.() ?? Date.now();\n  }\n\n  private async tick(): Promise<void> {\n    if (this.ticking || this.stopped) return;\n    this.ticking = true;\n    const cursorBeforeTick = this.claimCursor;\n    try {\n      // Fast bail: a breaker already open must not pay discovery I/O\n      // (listPage reads and parses claim bodies on every poll). The\n      // submitCandidates guard below still catches a breaker that opens\n      // while discovery awaits.\n      const breakerBeforeDiscovery = this.deps.breakerSnapshot?.();\n      if (\n        breakerBeforeDiscovery &&\n        breakerBeforeDiscovery.state === \"open\" &&\n        this.now() < breakerBeforeDiscovery.openUntilMs\n      ) {\n        return;\n      }\n      // stop() may land while discovery's I/O is pending: re-check before\n      // submitting anything, and again per candidate.\n      // A discovery failure (EACCES/EIO on the claims dir) must not reject\n      // into a detached timer callback: it would be an unhandled rejection\n      // that terminates the server. Log, skip this pass, retry next poll.\n      let candidates: { key: string; needsClaim: boolean }[];\n      try {\n        candidates = await this.discoverCandidates();\n      } catch (err) {\n        // Discovery may have listed a page before it failed: the page cursor\n        // already moved, so restore it — otherwise those claims wait for the\n        // cursor to wrap instead of the next poll.\n        this.claimCursor = cursorBeforeTick;\n        log.warn(\n          `backlog drain: discovery failed; retrying next poll: ${err instanceof Error ? err.message : String(err)}`\n        );\n        return;\n      }\n      if (this.stopped) return;\n      const dropped = this.submitCandidates(candidates);\n      // The concurrency bound stopped submission mid-page: rewind the page\n      // cursor so the unsubmitted claims are re-listed on the next tick\n      // (already-submitted ones are gated by inFlight and key backoff).\n      if (dropped) this.claimCursor = cursorBeforeTick;\n    } finally {\n      this.ticking = false;\n    }\n  }\n\n  /** Bounded discovery: ONE page of existing claims with pending turns */\n  private async discoverCandidates(): Promise<{ key: string; needsClaim: boolean }[]> {\n    const out: { key: string; needsClaim: boolean }[] = [];\n    const seen = new Set<string>();\n    const pageLimit = Math.max(this.submissionLimit() * 4, 16);\n    const page = await this.deps.claims.listPage(this.claimCursor, pageLimit);\n    for (const listed of page.entries) {\n      seen.add(listed.key);\n      out.push({ key: listed.key, needsClaim: false });\n    }\n    this.claimCursor = page.nextCursor;\n    for (const [key, counts] of await this.deps.liveBufferCounts()) {\n      if (counts.turns + counts.retainedTurns <= 0) continue;\n      if (seen.has(key) || this.deps.claims.isClaimed(key)) continue;\n      seen.add(key);\n      out.push({ key, needsClaim: true });\n    }\n    return out;\n  }\n\n  /** Submission bound: the queue's own concurrency limit, read with the\n   *  documented \"0 disables\" contract — a zero limit submits nothing. */\n  private submissionLimit(): number {\n    if (this.deps.queue.maxConcurrency <= 0) return 0;\n    return this.deps.queue.maxConcurrency;\n  }\n\n  /** Submit discovery candidates within the queue's concurrency bound. */\n  private submitCandidates(candidates: { key: string; needsClaim: boolean }[]): boolean {\n    // Breaker-open churn guard: a full attempt reads the claim, rebuilds the\n    // buffer/coordinator and re-renders chunks before the breaker fails it\n    // fast — pure heap pressure per poll during a provider stall. Skip while\n    // the window is open; once it lapses, submissions resume and the\n    // breaker's half-open probe runs as usual.\n    const breaker = this.deps.breakerSnapshot?.();\n    if (breaker && breaker.state === \"open\" && this.now() < breaker.openUntilMs) {\n      return true;\n    }\n    let dropped = false;\n    for (const candidate of candidates) {\n      if (this.stopped || this.inFlight.size >= this.submissionLimit()) {\n        dropped = true;\n        break;\n      }\n      if (!this.candidateEligible(candidate)) continue;\n      // Fence the claim decision: reserve the key synchronously BEFORE the\n      // async rename so no queued task for it can pass the claimed gate in\n      // the meantime. Release happens when the decision settles.\n      if (candidate.needsClaim) {\n        if (!this.deps.queue.tryReserveKey(candidate.key)) continue;\n        this.reserved.add(candidate.key);\n      }\n      void this.submit(candidate.key, candidate.needsClaim);\n    }\n    return dropped;\n  }\n\n  /** inFlight is the authority for \"already submitted\" — key state only\n   *  exists once an outcome landed (backoff/denied gating below). */\n  private candidateEligible(candidate: { key: string; needsClaim: boolean }): boolean {\n    if (this.stopped || this.inFlight.size >= this.submissionLimit()) return false;\n    if (this.inFlight.has(candidate.key)) return false;\n    const state = this.keys.get(candidate.key);\n    return !(state && this.now() < state.nextAttemptMs);\n  }\n\n  /** Claim (when needed), then drain one key; the reservation spans the async\n   *  claim decision, the queue entry carries the key afterwards. */\n  private async submit(key: string, needsClaim: boolean): Promise<void> {\n    const controller = new AbortController();\n    const { promise: settled, resolve: settle } = Promise.withResolvers<void>();\n    this.inFlight.set(key, { controller, settled });\n    try {\n      if (!(await this.claimForSubmit(key, needsClaim, this.options.ownerId))) return;\n      // Stopped between the claim decision and the task: leave the claim\n      // with its lease (it expires; the next start adopts) — never drain.\n      if (this.stopped) return;\n      await this.drainClaimedKey(key, controller.signal, this.options.ownerId);\n    } catch (err) {\n      // Claim/drain failures are scheduler-level: the claim content is\n      // untouched — count failed and back off (never an unhandled rejection\n      // in the detached submission).\n      this.counters.failed += 1;\n      const message = err instanceof Error ? err.message : String(err);\n      // SAFETY: a thrown non-Error (incl. null) carries no retry hint; the\n      // optional chain reads the hint off Error throws only.\n      this.setBackoff(key, (err as { turnsRemaining?: number } | null | undefined)?.turnsRemaining ?? 0, message);\n      log.warn(`backlog drain: ${key} submission failed: ${message}`);\n    } finally {\n      this.inFlight.delete(key);\n      this.reserved.delete(key);\n      this.deps.queue.releaseKeyReservation(key);\n      settle();\n    }\n  }\n\n  /** after all — the key goes quiet without a task. \"claimed\": ours. */\n  private async claimForSubmit(key: string, needsClaim: boolean, ownerId: string): Promise<boolean> {\n    if (!needsClaim) return true;\n    try {\n      const outcome = await this.deps.claims.claimFromSessionFile(key, this.deps.lease(ownerId));\n      if (outcome === \"empty\") {\n        this.keys.delete(key);\n        return false;\n      }\n      return true;\n    } finally {\n      this.reserved.delete(key);\n      this.deps.queue.releaseKeyReservation(key);\n    }\n  }\n\n  /** Drain one claimed key. drainKey reports failures as outcomes; a thrown\n   *  error still means the claim content is intact — count it failed and\n   *  back off. */\n  private async drainClaimedKey(key: string, signal: AbortSignal, ownerId: string): Promise<void> {\n    this.counters.claimed += 1;\n    try {\n      const outcome = await this.deps.drainKey(key, {\n        ownerId,\n        signal,\n      });\n      this.applyOutcome(key, outcome);\n    } catch (err) {\n      this.counters.failed += 1;\n      const message = err instanceof Error ? err.message : String(err);\n      // SAFETY: a thrown non-Error (incl. null) carries no retry hint; the\n      // optional chain reads the hint off Error throws only.\n      this.setBackoff(key, (err as { turnsRemaining?: number } | null | undefined)?.turnsRemaining ?? 0, message);\n      log.warn(`backlog drain: ${key} threw: ${message}`);\n    }\n  }\n\n  private applyOutcome(key: string, outcome: DrainSessionOutcome): void {\n    const deniedTurns = outcome.denied?.reduce((sum, entry) => sum + entry.turns, 0) ?? 0;\n    const previous = this.keys.get(key);\n    const progressed = outcome.turnsRemaining < (previous?.turnsRemaining ?? Number.POSITIVE_INFINITY);\n    if (outcome.status === \"drained\") {\n      // The claim is now an empty tombstone: authoritative, nothing pending.\n      // New ingress consumes it via the native save path and re-candidates.\n      this.keys.delete(key);\n      this.counters.processed += 1;\n      this.counters.durableOutputs += outcome.durableOutputCount;\n      log.info(\n        `backlog drain: ${key} drained (${outcome.turnsAtStart} turn(s), ${outcome.durableOutputCount} durable output(s))`\n      );\n      return;\n    }\n    this.recordNonDrainedCounters(previous, outcome, deniedTurns);\n    const denied = deniedTurns > 0 && outcome.turnsRemaining > 0;\n    this.keys.set(key, this.nextKeyState(previous, outcome, denied, progressed));\n    log.info(\n      `backlog drain: ${key} ${outcome.status} (${outcome.turnsRemaining} turn(s) remaining` +\n        `${denied ? `, denied: ${deniedTurns}` : \"\"}${outcome.reason ? `, ${outcome.reason}` : \"\"})`\n    );\n  }\n\n  /** Denied backlog counters for a non-drained outcome. */\n  private recordNonDrainedCounters(\n    previous: KeyState | undefined,\n    outcome: DrainSessionOutcome,\n    deniedTurns: number\n  ): void {\n    if (deniedTurns > 0) {\n      this.counters.denied.keys += 1;\n      this.counters.denied.turns += deniedTurns;\n    }\n    if (outcome.status === \"failed\") this.counters.failed += 1;\n    else if (previous !== undefined && (previous.state === \"backoff\" || previous.state === \"denied\"))\n      this.counters.retried += 1;\n  }\n\n  /** The post-drain key state: denial waits the full max window (its content\n   *  is valid but currently unauthorized); progress resets the exponent. */\n  private nextKeyState(\n    previous: KeyState | undefined,\n    outcome: DrainSessionOutcome,\n    denied: boolean,\n    progressed: boolean\n  ): KeyState {\n    return {\n      state: denied ? \"denied\" : \"backoff\",\n      nextAttemptMs: this.now() + this.backoffMs(previous, progressed && !denied),\n      turnsRemaining: outcome.turnsRemaining,\n      reason: outcome.reason,\n      backoffExponent: this.nextBackoffExponent(denied, progressed, previous),\n    };\n  }\n\n  private nextBackoffExponent(denied: boolean, progressed: boolean, previous: KeyState | undefined): number {\n    return denied || !progressed ? (previous?.backoffExponent ?? 0) + 1 : 0;\n  }\n\n  private backoffMs(previous: KeyState | undefined, progressed: boolean): number {\n    if (previous?.state === \"denied\") return this.options.retryMaxMs;\n    const exponent = progressed ? 0 : (previous?.backoffExponent ?? 0) + 1;\n    return Math.min(this.options.retryBaseMs * 2 ** exponent, this.options.retryMaxMs);\n  }\n\n  private setBackoff(key: string, turnsRemaining: number, reason: string): void {\n    const previous = this.keys.get(key);\n    this.keys.set(key, {\n      state: \"backoff\",\n      nextAttemptMs: this.now() + this.backoffMs(previous, false),\n      turnsRemaining,\n      reason,\n      backoffExponent: (previous?.backoffExponent ?? 0) + 1,\n    });\n  }\n}\n\n/** Lease lifetime for claims the scheduler takes (matches the runner default). */\nconst SCHEDULER_LEASE_MS = 120_000;\n\n/** Wire the scheduler to an orchestrator's own queue, claim store, live buffer\n *  counts and drain runner — the daemon's single ownership point. */\nexport function wireBacklogScheduler(\n  orchestrator: Orchestrator,\n  options: BacklogSchedulerOptions = {}\n): BacklogScheduler {\n  const runner = new BufferDrainRunner(orchestrator);\n  return new BacklogScheduler(\n    {\n      queue: orchestrator.extractionQueueCoordinator,\n      claims: orchestrator.storage.bufferDrainClaims(),\n      liveBufferCounts: async () => {\n        // The daemon's buffer may be lazy: ensure the persisted state is in\n        // memory before counting (load is guarded/idempotent).\n        await orchestrator.buffer.load();\n        return orchestrator.buffer.entryCounts();\n      },\n      lease: (ownerId) => {\n        const now = new Date().toISOString();\n        return {\n          ownerId,\n          pid: process.pid,\n          host: hostname(),\n          acquiredAt: now,\n          heartbeatAt: now,\n          leaseMs: SCHEDULER_LEASE_MS,\n        };\n      },\n      drainKey: (key, drainOptions) => runner.drainSession(key, drainOptions),\n      // The orchestrator's one shared provider breaker (foreground and every\n      // claim-backed drain accumulate toward the same threshold).\n      breakerSnapshot: () => orchestrator.getExtractionResilienceStatus().breaker,\n    },\n    options\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,SAAS,kBAAkB;AAC3B,SAAS,gBAAgB;AAqFzB,IAAM,kBAAkB;AACxB,IAAM,wBAAwB;AAC9B,IAAM,uBAAuB,KAAK;AAE3B,IAAM,mBAAN,MAAuB;AAAA,EACX;AAAA,EACA;AAAA,EACA,OAAO,oBAAI,IAAsB;AAAA,EACjC,WAAW,oBAAI,IAAqE;AAAA,EACpF,WAAW,oBAAI,IAAY;AAAA,EAC3B,WAAqC;AAAA,IACpD,SAAS;AAAA,IACT,WAAW;AAAA,IACX,gBAAgB;AAAA,IAChB,SAAS;AAAA,IACT,QAAQ,EAAE,MAAM,GAAG,OAAO,EAAE;AAAA,IAC5B,QAAQ;AAAA,EACV;AAAA,EACQ;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,UAAU;AAAA,EAElB,YAAY,MAA4B,UAAmC,CAAC,GAAG;AAC7E,SAAK,OAAO;AACZ,SAAK,UAAU;AAAA,MACb,SAAS,GAAG,QAAQ,WAAW,cAAc,IAAI,WAAW,CAAC;AAAA,MAC7D,QAAQ,QAAQ,UAAU;AAAA,MAC1B,aAAa,QAAQ,eAAe;AAAA,MACpC,YAAY,QAAQ,cAAc;AAAA,MAClC,KAAK,QAAQ;AAAA,IACf;AAAA,EACF;AAAA;AAAA,EAGA,QAAc;AACZ,QAAI,CAAC,KAAK,QAAS;AACnB,SAAK,UAAU;AACf,SAAK,QAAQ,YAAY,MAAM,KAAK,KAAK,KAAK,GAAG,KAAK,QAAQ,MAAM;AACpE,SAAK,MAAM,QAAQ;AACnB,SAAK,KAAK,KAAK;AAAA,EACjB;AAAA;AAAA;AAAA,EAIA,MAAM,OAAsB;AAC1B,QAAI,KAAK,QAAS;AAClB,SAAK,UAAU;AACf,QAAI,KAAK,OAAO;AACd,oBAAc,KAAK,KAAK;AACxB,WAAK,QAAQ;AAAA,IACf;AACA,UAAM,SAA0B,CAAC;AACjC,eAAW,SAAS,KAAK,SAAS,OAAO,GAAG;AAC1C,YAAM,WAAW,MAAM,IAAI,MAAM,4BAA4B,CAAC;AAC9D,aAAO,KAAK,MAAM,OAAO;AAAA,IAC3B;AACA,UAAM,QAAQ,WAAW,MAAM;AAAA,EACjC;AAAA;AAAA,EAGA,WAAqC;AACnC,WAAO;AAAA,MACL,UAAU;AAAA,QACR,SAAS,KAAK,SAAS;AAAA,QACvB,WAAW,KAAK,SAAS;AAAA,QACzB,gBAAgB,KAAK,SAAS;AAAA,QAC9B,SAAS,KAAK,SAAS;AAAA,QACvB,QAAQ,EAAE,GAAG,KAAK,SAAS,OAAO;AAAA,QAClC,QAAQ,KAAK,SAAS;AAAA,MACxB;AAAA,MACA,UAAU,CAAC,GAAG,KAAK,SAAS,KAAK,CAAC;AAAA,MAClC,cAAc,CAAC,GAAG,KAAK,QAAQ;AAAA,MAC/B,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO;AAAA,QACpD;AAAA,QACA,OAAO,MAAM;AAAA,QACb,gBAAgB,MAAM;AAAA,QACtB,QAAQ,MAAM;AAAA,MAChB,EAAE;AAAA,IACJ;AAAA,EACF;AAAA;AAAA;AAAA,EAIA,MAAM,cAA6B;AAGjC,WAAO,KAAK,QAAS,OAAM,IAAI,QAAQ,CAAC,YAAY,aAAa,OAAO,CAAC;AACzE,UAAM,KAAK,KAAK;AAAA,EAClB;AAAA;AAAA;AAAA,EAIA,MAAM,cAAc,SAAiC;AACnD,eAAS;AACP,YAAM,UAAU,CAAC,GAAG,KAAK,SAAS,QAAQ,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,MAAM,QAAQ,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,MAAM,OAAO;AAChH,UAAI,QAAQ,WAAW,EAAG;AAC1B,YAAM,QAAQ,WAAW,OAAO;AAAA,IAClC;AAAA,EACF;AAAA,EAEQ,MAAc;AACpB,WAAO,KAAK,QAAQ,MAAM,KAAK,KAAK,IAAI;AAAA,EAC1C;AAAA,EAEA,MAAc,OAAsB;AAClC,QAAI,KAAK,WAAW,KAAK,QAAS;AAClC,SAAK,UAAU;AACf,UAAM,mBAAmB,KAAK;AAC9B,QAAI;AAKF,YAAM,yBAAyB,KAAK,KAAK,kBAAkB;AAC3D,UACE,0BACA,uBAAuB,UAAU,UACjC,KAAK,IAAI,IAAI,uBAAuB,aACpC;AACA;AAAA,MACF;AAMA,UAAI;AACJ,UAAI;AACF,qBAAa,MAAM,KAAK,mBAAmB;AAAA,MAC7C,SAAS,KAAK;AAIZ,aAAK,cAAc;AACnB,YAAI;AAAA,UACF,wDAAwD,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,QAC1G;AACA;AAAA,MACF;AACA,UAAI,KAAK,QAAS;AAClB,YAAM,UAAU,KAAK,iBAAiB,UAAU;AAIhD,UAAI,QAAS,MAAK,cAAc;AAAA,IAClC,UAAE;AACA,WAAK,UAAU;AAAA,IACjB;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,qBAAsE;AAClF,UAAM,MAA8C,CAAC;AACrD,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,YAAY,KAAK,IAAI,KAAK,gBAAgB,IAAI,GAAG,EAAE;AACzD,UAAM,OAAO,MAAM,KAAK,KAAK,OAAO,SAAS,KAAK,aAAa,SAAS;AACxE,eAAW,UAAU,KAAK,SAAS;AACjC,WAAK,IAAI,OAAO,GAAG;AACnB,UAAI,KAAK,EAAE,KAAK,OAAO,KAAK,YAAY,MAAM,CAAC;AAAA,IACjD;AACA,SAAK,cAAc,KAAK;AACxB,eAAW,CAAC,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,iBAAiB,GAAG;AAC9D,UAAI,OAAO,QAAQ,OAAO,iBAAiB,EAAG;AAC9C,UAAI,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,OAAO,UAAU,GAAG,EAAG;AACtD,WAAK,IAAI,GAAG;AACZ,UAAI,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAIQ,kBAA0B;AAChC,QAAI,KAAK,KAAK,MAAM,kBAAkB,EAAG,QAAO;AAChD,WAAO,KAAK,KAAK,MAAM;AAAA,EACzB;AAAA;AAAA,EAGQ,iBAAiB,YAA6D;AAMpF,UAAM,UAAU,KAAK,KAAK,kBAAkB;AAC5C,QAAI,WAAW,QAAQ,UAAU,UAAU,KAAK,IAAI,IAAI,QAAQ,aAAa;AAC3E,aAAO;AAAA,IACT;AACA,QAAI,UAAU;AACd,eAAW,aAAa,YAAY;AAClC,UAAI,KAAK,WAAW,KAAK,SAAS,QAAQ,KAAK,gBAAgB,GAAG;AAChE,kBAAU;AACV;AAAA,MACF;AACA,UAAI,CAAC,KAAK,kBAAkB,SAAS,EAAG;AAIxC,UAAI,UAAU,YAAY;AACxB,YAAI,CAAC,KAAK,KAAK,MAAM,cAAc,UAAU,GAAG,EAAG;AACnD,aAAK,SAAS,IAAI,UAAU,GAAG;AAAA,MACjC;AACA,WAAK,KAAK,OAAO,UAAU,KAAK,UAAU,UAAU;AAAA,IACtD;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAIQ,kBAAkB,WAA0D;AAClF,QAAI,KAAK,WAAW,KAAK,SAAS,QAAQ,KAAK,gBAAgB,EAAG,QAAO;AACzE,QAAI,KAAK,SAAS,IAAI,UAAU,GAAG,EAAG,QAAO;AAC7C,UAAM,QAAQ,KAAK,KAAK,IAAI,UAAU,GAAG;AACzC,WAAO,EAAE,SAAS,KAAK,IAAI,IAAI,MAAM;AAAA,EACvC;AAAA;AAAA;AAAA,EAIA,MAAc,OAAO,KAAa,YAAoC;AACpE,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,EAAE,SAAS,SAAS,SAAS,OAAO,IAAI,QAAQ,cAAoB;AAC1E,SAAK,SAAS,IAAI,KAAK,EAAE,YAAY,QAAQ,CAAC;AAC9C,QAAI;AACF,UAAI,CAAE,MAAM,KAAK,eAAe,KAAK,YAAY,KAAK,QAAQ,OAAO,EAAI;AAGzE,UAAI,KAAK,QAAS;AAClB,YAAM,KAAK,gBAAgB,KAAK,WAAW,QAAQ,KAAK,QAAQ,OAAO;AAAA,IACzE,SAAS,KAAK;AAIZ,WAAK,SAAS,UAAU;AACxB,YAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAG/D,WAAK,WAAW,KAAM,KAAwD,kBAAkB,GAAG,OAAO;AAC1G,UAAI,KAAK,kBAAkB,GAAG,uBAAuB,OAAO,EAAE;AAAA,IAChE,UAAE;AACA,WAAK,SAAS,OAAO,GAAG;AACxB,WAAK,SAAS,OAAO,GAAG;AACxB,WAAK,KAAK,MAAM,sBAAsB,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,eAAe,KAAa,YAAqB,SAAmC;AAChG,QAAI,CAAC,WAAY,QAAO;AACxB,QAAI;AACF,YAAM,UAAU,MAAM,KAAK,KAAK,OAAO,qBAAqB,KAAK,KAAK,KAAK,MAAM,OAAO,CAAC;AACzF,UAAI,YAAY,SAAS;AACvB,aAAK,KAAK,OAAO,GAAG;AACpB,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT,UAAE;AACA,WAAK,SAAS,OAAO,GAAG;AACxB,WAAK,KAAK,MAAM,sBAAsB,GAAG;AAAA,IAC3C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,gBAAgB,KAAa,QAAqB,SAAgC;AAC9F,SAAK,SAAS,WAAW;AACzB,QAAI;AACF,YAAM,UAAU,MAAM,KAAK,KAAK,SAAS,KAAK;AAAA,QAC5C;AAAA,QACA;AAAA,MACF,CAAC;AACD,WAAK,aAAa,KAAK,OAAO;AAAA,IAChC,SAAS,KAAK;AACZ,WAAK,SAAS,UAAU;AACxB,YAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAG/D,WAAK,WAAW,KAAM,KAAwD,kBAAkB,GAAG,OAAO;AAC1G,UAAI,KAAK,kBAAkB,GAAG,WAAW,OAAO,EAAE;AAAA,IACpD;AAAA,EACF;AAAA,EAEQ,aAAa,KAAa,SAAoC;AACpE,UAAM,cAAc,QAAQ,QAAQ,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,OAAO,CAAC,KAAK;AACpF,UAAM,WAAW,KAAK,KAAK,IAAI,GAAG;AAClC,UAAM,aAAa,QAAQ,kBAAkB,UAAU,kBAAkB,OAAO;AAChF,QAAI,QAAQ,WAAW,WAAW;AAGhC,WAAK,KAAK,OAAO,GAAG;AACpB,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,kBAAkB,QAAQ;AACxC,UAAI;AAAA,QACF,kBAAkB,GAAG,aAAa,QAAQ,YAAY,aAAa,QAAQ,kBAAkB;AAAA,MAC/F;AACA;AAAA,IACF;AACA,SAAK,yBAAyB,UAAU,SAAS,WAAW;AAC5D,UAAM,SAAS,cAAc,KAAK,QAAQ,iBAAiB;AAC3D,SAAK,KAAK,IAAI,KAAK,KAAK,aAAa,UAAU,SAAS,QAAQ,UAAU,CAAC;AAC3E,QAAI;AAAA,MACF,kBAAkB,GAAG,IAAI,QAAQ,MAAM,KAAK,QAAQ,cAAc,qBAC7D,SAAS,aAAa,WAAW,KAAK,EAAE,GAAG,QAAQ,SAAS,KAAK,QAAQ,MAAM,KAAK,EAAE;AAAA,IAC7F;AAAA,EACF;AAAA;AAAA,EAGQ,yBACN,UACA,SACA,aACM;AACN,QAAI,cAAc,GAAG;AACnB,WAAK,SAAS,OAAO,QAAQ;AAC7B,WAAK,SAAS,OAAO,SAAS;AAAA,IAChC;AACA,QAAI,QAAQ,WAAW,SAAU,MAAK,SAAS,UAAU;AAAA,aAChD,aAAa,WAAc,SAAS,UAAU,aAAa,SAAS,UAAU;AACrF,WAAK,SAAS,WAAW;AAAA,EAC7B;AAAA;AAAA;AAAA,EAIQ,aACN,UACA,SACA,QACA,YACU;AACV,WAAO;AAAA,MACL,OAAO,SAAS,WAAW;AAAA,MAC3B,eAAe,KAAK,IAAI,IAAI,KAAK,UAAU,UAAU,cAAc,CAAC,MAAM;AAAA,MAC1E,gBAAgB,QAAQ;AAAA,MACxB,QAAQ,QAAQ;AAAA,MAChB,iBAAiB,KAAK,oBAAoB,QAAQ,YAAY,QAAQ;AAAA,IACxE;AAAA,EACF;AAAA,EAEQ,oBAAoB,QAAiB,YAAqB,UAAwC;AACxG,WAAO,UAAU,CAAC,cAAc,UAAU,mBAAmB,KAAK,IAAI;AAAA,EACxE;AAAA,EAEQ,UAAU,UAAgC,YAA6B;AAC7E,QAAI,UAAU,UAAU,SAAU,QAAO,KAAK,QAAQ;AACtD,UAAM,WAAW,aAAa,KAAK,UAAU,mBAAmB,KAAK;AACrE,WAAO,KAAK,IAAI,KAAK,QAAQ,cAAc,KAAK,UAAU,KAAK,QAAQ,UAAU;AAAA,EACnF;AAAA,EAEQ,WAAW,KAAa,gBAAwB,QAAsB;AAC5E,UAAM,WAAW,KAAK,KAAK,IAAI,GAAG;AAClC,SAAK,KAAK,IAAI,KAAK;AAAA,MACjB,OAAO;AAAA,MACP,eAAe,KAAK,IAAI,IAAI,KAAK,UAAU,UAAU,KAAK;AAAA,MAC1D;AAAA,MACA;AAAA,MACA,kBAAkB,UAAU,mBAAmB,KAAK;AAAA,IACtD,CAAC;AAAA,EACH;AACF;AAGA,IAAM,qBAAqB;AAIpB,SAAS,qBACd,cACA,UAAmC,CAAC,GAClB;AAClB,QAAM,SAAS,IAAI,kBAAkB,YAAY;AACjD,SAAO,IAAI;AAAA,IACT;AAAA,MACE,OAAO,aAAa;AAAA,MACpB,QAAQ,aAAa,QAAQ,kBAAkB;AAAA,MAC/C,kBAAkB,YAAY;AAG5B,cAAM,aAAa,OAAO,KAAK;AAC/B,eAAO,aAAa,OAAO,YAAY;AAAA,MACzC;AAAA,MACA,OAAO,CAAC,YAAY;AAClB,cAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,eAAO;AAAA,UACL;AAAA,UACA,KAAK,QAAQ;AAAA,UACb,MAAM,SAAS;AAAA,UACf,YAAY;AAAA,UACZ,aAAa;AAAA,UACb,SAAS;AAAA,QACX;AAAA,MACF;AAAA,MACA,UAAU,CAAC,KAAK,iBAAiB,OAAO,aAAa,KAAK,YAAY;AAAA;AAAA;AAAA,MAGtE,iBAAiB,MAAM,aAAa,8BAA8B,EAAE;AAAA,IACtE;AAAA,IACA;AAAA,EACF;AACF;","names":[]}
+{"version":3,"sources":["../../src/orchestration/backlog-scheduler.ts"],"sourcesContent":["/**\n * Daemon-owned extraction backlog scheduler.\n *\n * ONE bounded in-process loop that owns ALL persisted extraction backlog:\n * at startup (existing drain claims + buffered sessions), on every poll tick\n * (new persisted work), and by retrying keys that are still pending — with\n * bounded memory (per-key COUNTS only; candidate scans never retain turn\n * payloads) and bounded outstanding work (the extraction queue's own\n * maxConcurrency gates submissions, so live foreground work keeps its share\n * of the queue).\n *\n * Claim authority: an existing claim — including an EMPTY ack tombstone — is\n * authoritative over the live buffer's in-memory copy. A tombstoned key is\n * never re-claimed or counted as work; new ingress consumes the tombstone\n * through the native save handover, which is what makes the key a candidate\n * again. Claim creation is fenced: the key is reserved synchronously on the\n * extraction queue BEFORE the async claim decision, so a queued live task for\n * the same key cannot start past the claimed-session gate until the decision\n * settles; live capture continues via the native merge-into-claim protocol.\n *\n * Failed, deferred, or policy-denied outcomes keep their turns durable in the\n * claim and re-submit after backoff (exponential from `retryBaseMs` to\n * `retryMaxMs`, reset by progress; denials wait the full max) — never a busy\n * retry. `stop()` aborts in-flight drains at their chunk boundary and leaves\n * every claim retryable; a restarted daemon's scheduler adopts them.\n */\n\nimport { randomUUID } from \"node:crypto\";\nimport { hostname } from \"node:os\";\nimport { log } from \"../logger.js\";\nimport type { Orchestrator } from \"../orchestrator.js\";\nimport type { BufferDrainClaims, DrainLease } from \"../storage/buffer-drain-claims.js\";\nimport { BufferDrainRunner } from \"./buffer-drain-runner.js\";\nimport type { DrainRunnerEvent, DrainSessionOutcome } from \"./buffer-drain-runner.js\";\nimport type { ExtractionQueueCoordinator } from \"./extraction-queue-coordinator.js\";\nimport type { ProviderBreakerSnapshot } from \"./provider-breaker.js\";\n\n/** What the scheduler needs from its host (structurally satisfied by the\n *  orchestrator wiring); injectable so tests drive ticks deterministically. */\nexport interface BacklogSchedulerDeps {\n  queue: Pick<ExtractionQueueCoordinator, \"tryReserveKey\" | \"releaseKeyReservation\" | \"maxConcurrency\">;\n  claims: Pick<BufferDrainClaims, \"list\" | \"listPage\" | \"claimFromSessionFile\" | \"isClaimed\">;\n  /** Live per-key pending counts (counts only — never turn payloads). May be\n   *  async: hosts with a lazily-loaded buffer load it here (idempotent). */\n  liveBufferCounts():\n    | Map<string, { turns: number; retainedTurns: number }>\n    | Promise<Map<string, { turns: number; retainedTurns: number }>>;\n  /** Create a fresh lease for a unique owner token. */\n  lease(ownerId: string): DrainLease;\n  /** Drain one key to quiescence (BufferDrainRunner.drainSession). */\n  drainKey(\n    key: string,\n    options: { ownerId: string; signal: AbortSignal; onEvent?: (event: DrainRunnerEvent) => void }\n  ): Promise<DrainSessionOutcome>;\n  /** Shared provider circuit-breaker snapshot (the same instance the run\n   *  coordinator gates attempts on). While OPEN inside its cooldown window\n   *  the scheduler skips submission entirely — claims stay durable, and the\n   *  breaker's single half-open probe (one attempt through once the window\n   *  lapses) keeps recovery automatic. Optional: hosts without a breaker\n   *  never skip. */\n  breakerSnapshot?(): ProviderBreakerSnapshot;\n  /** Test seam: monotonic-ish clock for backoff windows. */\n  now?(): number;\n}\n\nexport interface BacklogSchedulerOptions {\n  /** Optional label prefix; each scheduler instance adds a unique token. */\n  ownerId?: string;\n  /** Scan cadence in ms (startup + new-work + retry checks). */\n  pollMs?: number;\n  retryBaseMs?: number;\n  retryMaxMs?: number;\n  /** Bound on `stop()`'s wait for aborted drains to settle. */\n  stopSettleTimeoutMs?: number;\n  now?: () => number;\n}\n\nexport interface BacklogSchedulerCounters {\n  /** Keys submitted to the drain (claimed or adopted) this process lifetime. */\n  claimed: number;\n  /** Outcomes with genuinely empty claims (durable outputs preceded ack). */\n  processed: number;\n  /** Sum of durable outputs (memories + entities) across processed drains. */\n  durableOutputs: number;\n  /** Re-submissions after a failed/deferred/denied outcome. */\n  retried: number;\n  denied: { keys: number; turns: number };\n  failed: number;\n}\n\nexport type BacklogKeyState = \"inflight\" | \"backoff\" | \"denied\";\n\nexport interface BacklogKeySnapshot {\n  key: string;\n  state: BacklogKeyState;\n  turnsRemaining?: number;\n  reason?: string;\n}\n\nexport interface BacklogSchedulerSnapshot {\n  counters: BacklogSchedulerCounters;\n  inFlight: string[];\n  reservedKeys: string[];\n  keys: BacklogKeySnapshot[];\n}\n\ninterface KeyState {\n  state: BacklogKeyState;\n  nextAttemptMs: number;\n  /** Last observed remaining turns; progress resets the backoff exponent. */\n  turnsRemaining: number;\n  reason?: string;\n  backoffExponent: number;\n}\n\nconst DEFAULT_POLL_MS = 15_000;\nconst DEFAULT_RETRY_BASE_MS = 30_000;\nconst DEFAULT_RETRY_MAX_MS = 15 * 60_000;\n// Aborted drains normally settle within seconds (a chunk boundary); this only\n// bounds the pathological case, well inside the daemon's stop budget.\nconst DEFAULT_STOP_SETTLE_TIMEOUT_MS = 30_000;\n\nexport class BacklogScheduler {\n  private readonly deps: BacklogSchedulerDeps;\n  private readonly options: Required<Omit<BacklogSchedulerOptions, \"now\">> & Pick<BacklogSchedulerOptions, \"now\">;\n  private readonly keys = new Map<string, KeyState>();\n  private readonly inFlight = new Map<string, { controller: AbortController; settled: Promise<void> }>();\n  private readonly reserved = new Set<string>();\n  private readonly counters: BacklogSchedulerCounters = {\n    claimed: 0,\n    processed: 0,\n    durableOutputs: 0,\n    retried: 0,\n    denied: { keys: 0, turns: 0 },\n    failed: 0,\n  };\n  private claimCursor: string | undefined;\n  private timer: ReturnType<typeof setInterval> | undefined;\n  private ticking = false;\n  private stopped = true;\n\n  constructor(deps: BacklogSchedulerDeps, options: BacklogSchedulerOptions = {}) {\n    this.deps = deps;\n    this.options = {\n      ownerId: `${options.ownerId ?? \"daemon-drain\"}-${randomUUID()}`,\n      pollMs: options.pollMs ?? DEFAULT_POLL_MS,\n      retryBaseMs: options.retryBaseMs ?? DEFAULT_RETRY_BASE_MS,\n      retryMaxMs: options.retryMaxMs ?? DEFAULT_RETRY_MAX_MS,\n      stopSettleTimeoutMs: options.stopSettleTimeoutMs ?? DEFAULT_STOP_SETTLE_TIMEOUT_MS,\n      now: options.now,\n    };\n  }\n\n  /** Idempotent. Starts the poll timer (unref'd) and runs an initial tick. */\n  start(): void {\n    if (!this.stopped) return;\n    this.stopped = false;\n    this.timer = setInterval(() => void this.tick(), this.options.pollMs);\n    this.timer.unref?.();\n    void this.tick();\n  }\n\n  /** Idempotent. Stops the timer, aborts in-flight drains (their claims stay\n   *  retryable) and waits up to `stopSettleTimeoutMs` for them to settle. A\n   *  drain that ignores abort is named in a warning and left behind: the\n   *  caller's later shutdown phases (orchestrator flush and dispose) must\n   *  still run before the service manager's kill. */\n  async stop(): Promise<void> {\n    if (this.stopped) return;\n    this.stopped = true;\n    if (this.timer) {\n      clearInterval(this.timer);\n      this.timer = undefined;\n    }\n    const aborts: Promise<void>[] = [];\n    for (const entry of this.inFlight.values()) {\n      entry.controller.abort(new Error(\"backlog scheduler stopping\"));\n      aborts.push(entry.settled);\n    }\n    const bound = Promise.withResolvers<\"timeout\">();\n    const boundTimer = setTimeout(() => bound.resolve(\"timeout\"), this.options.stopSettleTimeoutMs);\n    try {\n      const result = await Promise.race([Promise.allSettled(aborts), bound.promise]);\n      if (result === \"timeout\") {\n        log.warn(\n          `backlog scheduler stop: ${this.inFlight.size} drain(s) ignored abort for ${this.options.stopSettleTimeoutMs}ms; ` +\n            `continuing shutdown (stuck keys: ${[...this.inFlight.keys()].join(\", \")})`,\n        );\n      }\n    } finally {\n      clearTimeout(boundTimer);\n    }\n  }\n\n  /** Bounded snapshot for ops/watchers: counters + per-key states + live sets. */\n  snapshot(): BacklogSchedulerSnapshot {\n    return {\n      counters: {\n        claimed: this.counters.claimed,\n        processed: this.counters.processed,\n        durableOutputs: this.counters.durableOutputs,\n        retried: this.counters.retried,\n        denied: { ...this.counters.denied },\n        failed: this.counters.failed,\n      },\n      inFlight: [...this.inFlight.keys()],\n      reservedKeys: [...this.reserved],\n      keys: [...this.keys.entries()].map(([key, state]) => ({\n        key,\n        state: state.state,\n        turnsRemaining: state.turnsRemaining,\n        reason: state.reason,\n      })),\n    };\n  }\n\n  /** One scan+submit pass (tests drive this instead of the timer). Waits out\n   *  any in-progress tick first so the pass always actually scans. */\n  async tickForTest(): Promise<void> {\n    // setImmediate: yields to the event loop so pending I/O (a slow first\n    // scan) can finish; a microtask spin would starve it.\n    while (this.ticking) await new Promise((resolve) => setImmediate(resolve));\n    await this.tick();\n  }\n\n  /** Await the settle (slot release) of everything currently in flight,\n   *  optionally excluding one still-gated key (tests). */\n  async settleForTest(exclude?: string): Promise<void> {\n    for (;;) {\n      const pending = [...this.inFlight.entries()].filter(([key]) => key !== exclude).map(([, entry]) => entry.settled);\n      if (pending.length === 0) return;\n      await Promise.allSettled(pending);\n    }\n  }\n\n  private now(): number {\n    return this.options.now?.() ?? Date.now();\n  }\n\n  private async tick(): Promise<void> {\n    if (this.ticking || this.stopped) return;\n    this.ticking = true;\n    const cursorBeforeTick = this.claimCursor;\n    try {\n      // Fast bail: a breaker already open must not pay discovery I/O\n      // (listPage reads and parses claim bodies on every poll). The\n      // submitCandidates guard below still catches a breaker that opens\n      // while discovery awaits.\n      const breakerBeforeDiscovery = this.deps.breakerSnapshot?.();\n      if (\n        breakerBeforeDiscovery &&\n        breakerBeforeDiscovery.state === \"open\" &&\n        this.now() < breakerBeforeDiscovery.openUntilMs\n      ) {\n        return;\n      }\n      // stop() may land while discovery's I/O is pending: re-check before\n      // submitting anything, and again per candidate.\n      // A discovery failure (EACCES/EIO on the claims dir) must not reject\n      // into a detached timer callback: it would be an unhandled rejection\n      // that terminates the server. Log, skip this pass, retry next poll.\n      let candidates: { key: string; needsClaim: boolean }[];\n      try {\n        candidates = await this.discoverCandidates();\n      } catch (err) {\n        // Discovery may have listed a page before it failed: the page cursor\n        // already moved, so restore it — otherwise those claims wait for the\n        // cursor to wrap instead of the next poll.\n        this.claimCursor = cursorBeforeTick;\n        log.warn(\n          `backlog drain: discovery failed; retrying next poll: ${err instanceof Error ? err.message : String(err)}`\n        );\n        return;\n      }\n      if (this.stopped) return;\n      const dropped = this.submitCandidates(candidates);\n      // The concurrency bound stopped submission mid-page: rewind the page\n      // cursor so the unsubmitted claims are re-listed on the next tick\n      // (already-submitted ones are gated by inFlight and key backoff).\n      if (dropped) this.claimCursor = cursorBeforeTick;\n    } finally {\n      this.ticking = false;\n    }\n  }\n\n  /** Bounded discovery: ONE page of existing claims with pending turns */\n  private async discoverCandidates(): Promise<{ key: string; needsClaim: boolean }[]> {\n    const out: { key: string; needsClaim: boolean }[] = [];\n    const seen = new Set<string>();\n    const pageLimit = Math.max(this.submissionLimit() * 4, 16);\n    const page = await this.deps.claims.listPage(this.claimCursor, pageLimit);\n    for (const listed of page.entries) {\n      seen.add(listed.key);\n      out.push({ key: listed.key, needsClaim: false });\n    }\n    this.claimCursor = page.nextCursor;\n    for (const [key, counts] of await this.deps.liveBufferCounts()) {\n      if (counts.turns + counts.retainedTurns <= 0) continue;\n      if (seen.has(key) || this.deps.claims.isClaimed(key)) continue;\n      seen.add(key);\n      out.push({ key, needsClaim: true });\n    }\n    return out;\n  }\n\n  /** Submission bound: the queue's own concurrency limit, read with the\n   *  documented \"0 disables\" contract — a zero limit submits nothing. */\n  private submissionLimit(): number {\n    if (this.deps.queue.maxConcurrency <= 0) return 0;\n    return this.deps.queue.maxConcurrency;\n  }\n\n  /** Submit discovery candidates within the queue's concurrency bound. */\n  private submitCandidates(candidates: { key: string; needsClaim: boolean }[]): boolean {\n    // Breaker-open churn guard: a full attempt reads the claim, rebuilds the\n    // buffer/coordinator and re-renders chunks before the breaker fails it\n    // fast — pure heap pressure per poll during a provider stall. Skip while\n    // the window is open; once it lapses, submissions resume and the\n    // breaker's half-open probe runs as usual.\n    const breaker = this.deps.breakerSnapshot?.();\n    if (breaker && breaker.state === \"open\" && this.now() < breaker.openUntilMs) {\n      return true;\n    }\n    let dropped = false;\n    for (const candidate of candidates) {\n      if (this.stopped || this.inFlight.size >= this.submissionLimit()) {\n        dropped = true;\n        break;\n      }\n      if (!this.candidateEligible(candidate)) continue;\n      // Fence the claim decision: reserve the key synchronously BEFORE the\n      // async rename so no queued task for it can pass the claimed gate in\n      // the meantime. Release happens when the decision settles.\n      if (candidate.needsClaim) {\n        if (!this.deps.queue.tryReserveKey(candidate.key)) continue;\n        this.reserved.add(candidate.key);\n      }\n      void this.submit(candidate.key, candidate.needsClaim);\n    }\n    return dropped;\n  }\n\n  /** inFlight is the authority for \"already submitted\" — key state only\n   *  exists once an outcome landed (backoff/denied gating below). */\n  private candidateEligible(candidate: { key: string; needsClaim: boolean }): boolean {\n    if (this.stopped || this.inFlight.size >= this.submissionLimit()) return false;\n    if (this.inFlight.has(candidate.key)) return false;\n    const state = this.keys.get(candidate.key);\n    return !(state && this.now() < state.nextAttemptMs);\n  }\n\n  /** Claim (when needed), then drain one key; the reservation spans the async\n   *  claim decision, the queue entry carries the key afterwards. */\n  private async submit(key: string, needsClaim: boolean): Promise<void> {\n    const controller = new AbortController();\n    const { promise: settled, resolve: settle } = Promise.withResolvers<void>();\n    this.inFlight.set(key, { controller, settled });\n    try {\n      if (!(await this.claimForSubmit(key, needsClaim, this.options.ownerId))) return;\n      // Stopped between the claim decision and the task: leave the claim\n      // with its lease (it expires; the next start adopts) — never drain.\n      if (this.stopped) return;\n      await this.drainClaimedKey(key, controller.signal, this.options.ownerId);\n    } catch (err) {\n      // Claim/drain failures are scheduler-level: the claim content is\n      // untouched — count failed and back off (never an unhandled rejection\n      // in the detached submission).\n      this.counters.failed += 1;\n      const message = err instanceof Error ? err.message : String(err);\n      // SAFETY: a thrown non-Error (incl. null) carries no retry hint; the\n      // optional chain reads the hint off Error throws only.\n      this.setBackoff(key, (err as { turnsRemaining?: number } | null | undefined)?.turnsRemaining ?? 0, message);\n      log.warn(`backlog drain: ${key} submission failed: ${message}`);\n    } finally {\n      this.inFlight.delete(key);\n      this.reserved.delete(key);\n      this.deps.queue.releaseKeyReservation(key);\n      settle();\n    }\n  }\n\n  /** after all — the key goes quiet without a task. \"claimed\": ours. */\n  private async claimForSubmit(key: string, needsClaim: boolean, ownerId: string): Promise<boolean> {\n    if (!needsClaim) return true;\n    try {\n      const outcome = await this.deps.claims.claimFromSessionFile(key, this.deps.lease(ownerId));\n      if (outcome === \"empty\") {\n        this.keys.delete(key);\n        return false;\n      }\n      return true;\n    } finally {\n      this.reserved.delete(key);\n      this.deps.queue.releaseKeyReservation(key);\n    }\n  }\n\n  /** Drain one claimed key. drainKey reports failures as outcomes; a thrown\n   *  error still means the claim content is intact — count it failed and\n   *  back off. */\n  private async drainClaimedKey(key: string, signal: AbortSignal, ownerId: string): Promise<void> {\n    this.counters.claimed += 1;\n    try {\n      const outcome = await this.deps.drainKey(key, {\n        ownerId,\n        signal,\n      });\n      this.applyOutcome(key, outcome);\n    } catch (err) {\n      this.counters.failed += 1;\n      const message = err instanceof Error ? err.message : String(err);\n      // SAFETY: a thrown non-Error (incl. null) carries no retry hint; the\n      // optional chain reads the hint off Error throws only.\n      this.setBackoff(key, (err as { turnsRemaining?: number } | null | undefined)?.turnsRemaining ?? 0, message);\n      log.warn(`backlog drain: ${key} threw: ${message}`);\n    }\n  }\n\n  private applyOutcome(key: string, outcome: DrainSessionOutcome): void {\n    const deniedTurns = outcome.denied?.reduce((sum, entry) => sum + entry.turns, 0) ?? 0;\n    const previous = this.keys.get(key);\n    const progressed = outcome.turnsRemaining < (previous?.turnsRemaining ?? Number.POSITIVE_INFINITY);\n    if (outcome.status === \"drained\") {\n      // The claim is now an empty tombstone: authoritative, nothing pending.\n      // New ingress consumes it via the native save path and re-candidates.\n      this.keys.delete(key);\n      this.counters.processed += 1;\n      this.counters.durableOutputs += outcome.durableOutputCount;\n      log.info(\n        `backlog drain: ${key} drained (${outcome.turnsAtStart} turn(s), ${outcome.durableOutputCount} durable output(s))`\n      );\n      return;\n    }\n    this.recordNonDrainedCounters(previous, outcome, deniedTurns);\n    const denied = deniedTurns > 0 && outcome.turnsRemaining > 0;\n    this.keys.set(key, this.nextKeyState(previous, outcome, denied, progressed));\n    log.info(\n      `backlog drain: ${key} ${outcome.status} (${outcome.turnsRemaining} turn(s) remaining` +\n        `${denied ? `, denied: ${deniedTurns}` : \"\"}${outcome.reason ? `, ${outcome.reason}` : \"\"})`\n    );\n  }\n\n  /** Denied backlog counters for a non-drained outcome. */\n  private recordNonDrainedCounters(\n    previous: KeyState | undefined,\n    outcome: DrainSessionOutcome,\n    deniedTurns: number\n  ): void {\n    if (deniedTurns > 0) {\n      this.counters.denied.keys += 1;\n      this.counters.denied.turns += deniedTurns;\n    }\n    if (outcome.status === \"failed\") this.counters.failed += 1;\n    else if (previous !== undefined && (previous.state === \"backoff\" || previous.state === \"denied\"))\n      this.counters.retried += 1;\n  }\n\n  /** The post-drain key state: denial waits the full max window (its content\n   *  is valid but currently unauthorized); progress resets the exponent. */\n  private nextKeyState(\n    previous: KeyState | undefined,\n    outcome: DrainSessionOutcome,\n    denied: boolean,\n    progressed: boolean\n  ): KeyState {\n    return {\n      state: denied ? \"denied\" : \"backoff\",\n      nextAttemptMs: this.now() + this.backoffMs(previous, progressed && !denied),\n      turnsRemaining: outcome.turnsRemaining,\n      reason: outcome.reason,\n      backoffExponent: this.nextBackoffExponent(denied, progressed, previous),\n    };\n  }\n\n  private nextBackoffExponent(denied: boolean, progressed: boolean, previous: KeyState | undefined): number {\n    return denied || !progressed ? (previous?.backoffExponent ?? 0) + 1 : 0;\n  }\n\n  private backoffMs(previous: KeyState | undefined, progressed: boolean): number {\n    if (previous?.state === \"denied\") return this.options.retryMaxMs;\n    const exponent = progressed ? 0 : (previous?.backoffExponent ?? 0) + 1;\n    return Math.min(this.options.retryBaseMs * 2 ** exponent, this.options.retryMaxMs);\n  }\n\n  private setBackoff(key: string, turnsRemaining: number, reason: string): void {\n    const previous = this.keys.get(key);\n    this.keys.set(key, {\n      state: \"backoff\",\n      nextAttemptMs: this.now() + this.backoffMs(previous, false),\n      turnsRemaining,\n      reason,\n      backoffExponent: (previous?.backoffExponent ?? 0) + 1,\n    });\n  }\n}\n\n/** Lease lifetime for claims the scheduler takes (matches the runner default). */\nconst SCHEDULER_LEASE_MS = 120_000;\n\n/** Wire the scheduler to an orchestrator's own queue, claim store, live buffer\n *  counts and drain runner — the daemon's single ownership point. */\nexport function wireBacklogScheduler(\n  orchestrator: Orchestrator,\n  options: BacklogSchedulerOptions = {}\n): BacklogScheduler {\n  const runner = new BufferDrainRunner(orchestrator);\n  return new BacklogScheduler(\n    {\n      queue: orchestrator.extractionQueueCoordinator,\n      claims: orchestrator.storage.bufferDrainClaims(),\n      liveBufferCounts: async () => {\n        // The daemon's buffer may be lazy: ensure the persisted state is in\n        // memory before counting (load is guarded/idempotent).\n        await orchestrator.buffer.load();\n        return orchestrator.buffer.entryCounts();\n      },\n      lease: (ownerId) => {\n        const now = new Date().toISOString();\n        return {\n          ownerId,\n          pid: process.pid,\n          host: hostname(),\n          acquiredAt: now,\n          heartbeatAt: now,\n          leaseMs: SCHEDULER_LEASE_MS,\n        };\n      },\n      drainKey: (key, drainOptions) => runner.drainSession(key, drainOptions),\n      // The orchestrator's one shared provider breaker (foreground and every\n      // claim-backed drain accumulate toward the same threshold).\n      breakerSnapshot: () => orchestrator.getExtractionResilienceStatus().breaker,\n    },\n    options\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,SAAS,kBAAkB;AAC3B,SAAS,gBAAgB;AAuFzB,IAAM,kBAAkB;AACxB,IAAM,wBAAwB;AAC9B,IAAM,uBAAuB,KAAK;AAGlC,IAAM,iCAAiC;AAEhC,IAAM,mBAAN,MAAuB;AAAA,EACX;AAAA,EACA;AAAA,EACA,OAAO,oBAAI,IAAsB;AAAA,EACjC,WAAW,oBAAI,IAAqE;AAAA,EACpF,WAAW,oBAAI,IAAY;AAAA,EAC3B,WAAqC;AAAA,IACpD,SAAS;AAAA,IACT,WAAW;AAAA,IACX,gBAAgB;AAAA,IAChB,SAAS;AAAA,IACT,QAAQ,EAAE,MAAM,GAAG,OAAO,EAAE;AAAA,IAC5B,QAAQ;AAAA,EACV;AAAA,EACQ;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,UAAU;AAAA,EAElB,YAAY,MAA4B,UAAmC,CAAC,GAAG;AAC7E,SAAK,OAAO;AACZ,SAAK,UAAU;AAAA,MACb,SAAS,GAAG,QAAQ,WAAW,cAAc,IAAI,WAAW,CAAC;AAAA,MAC7D,QAAQ,QAAQ,UAAU;AAAA,MAC1B,aAAa,QAAQ,eAAe;AAAA,MACpC,YAAY,QAAQ,cAAc;AAAA,MAClC,qBAAqB,QAAQ,uBAAuB;AAAA,MACpD,KAAK,QAAQ;AAAA,IACf;AAAA,EACF;AAAA;AAAA,EAGA,QAAc;AACZ,QAAI,CAAC,KAAK,QAAS;AACnB,SAAK,UAAU;AACf,SAAK,QAAQ,YAAY,MAAM,KAAK,KAAK,KAAK,GAAG,KAAK,QAAQ,MAAM;AACpE,SAAK,MAAM,QAAQ;AACnB,SAAK,KAAK,KAAK;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,OAAsB;AAC1B,QAAI,KAAK,QAAS;AAClB,SAAK,UAAU;AACf,QAAI,KAAK,OAAO;AACd,oBAAc,KAAK,KAAK;AACxB,WAAK,QAAQ;AAAA,IACf;AACA,UAAM,SAA0B,CAAC;AACjC,eAAW,SAAS,KAAK,SAAS,OAAO,GAAG;AAC1C,YAAM,WAAW,MAAM,IAAI,MAAM,4BAA4B,CAAC;AAC9D,aAAO,KAAK,MAAM,OAAO;AAAA,IAC3B;AACA,UAAM,QAAQ,QAAQ,cAAyB;AAC/C,UAAM,aAAa,WAAW,MAAM,MAAM,QAAQ,SAAS,GAAG,KAAK,QAAQ,mBAAmB;AAC9F,QAAI;AACF,YAAM,SAAS,MAAM,QAAQ,KAAK,CAAC,QAAQ,WAAW,MAAM,GAAG,MAAM,OAAO,CAAC;AAC7E,UAAI,WAAW,WAAW;AACxB,YAAI;AAAA,UACF,2BAA2B,KAAK,SAAS,IAAI,+BAA+B,KAAK,QAAQ,mBAAmB,wCACtE,CAAC,GAAG,KAAK,SAAS,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,QAC5E;AAAA,MACF;AAAA,IACF,UAAE;AACA,mBAAa,UAAU;AAAA,IACzB;AAAA,EACF;AAAA;AAAA,EAGA,WAAqC;AACnC,WAAO;AAAA,MACL,UAAU;AAAA,QACR,SAAS,KAAK,SAAS;AAAA,QACvB,WAAW,KAAK,SAAS;AAAA,QACzB,gBAAgB,KAAK,SAAS;AAAA,QAC9B,SAAS,KAAK,SAAS;AAAA,QACvB,QAAQ,EAAE,GAAG,KAAK,SAAS,OAAO;AAAA,QAClC,QAAQ,KAAK,SAAS;AAAA,MACxB;AAAA,MACA,UAAU,CAAC,GAAG,KAAK,SAAS,KAAK,CAAC;AAAA,MAClC,cAAc,CAAC,GAAG,KAAK,QAAQ;AAAA,MAC/B,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO;AAAA,QACpD;AAAA,QACA,OAAO,MAAM;AAAA,QACb,gBAAgB,MAAM;AAAA,QACtB,QAAQ,MAAM;AAAA,MAChB,EAAE;AAAA,IACJ;AAAA,EACF;AAAA;AAAA;AAAA,EAIA,MAAM,cAA6B;AAGjC,WAAO,KAAK,QAAS,OAAM,IAAI,QAAQ,CAAC,YAAY,aAAa,OAAO,CAAC;AACzE,UAAM,KAAK,KAAK;AAAA,EAClB;AAAA;AAAA;AAAA,EAIA,MAAM,cAAc,SAAiC;AACnD,eAAS;AACP,YAAM,UAAU,CAAC,GAAG,KAAK,SAAS,QAAQ,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,MAAM,QAAQ,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,MAAM,OAAO;AAChH,UAAI,QAAQ,WAAW,EAAG;AAC1B,YAAM,QAAQ,WAAW,OAAO;AAAA,IAClC;AAAA,EACF;AAAA,EAEQ,MAAc;AACpB,WAAO,KAAK,QAAQ,MAAM,KAAK,KAAK,IAAI;AAAA,EAC1C;AAAA,EAEA,MAAc,OAAsB;AAClC,QAAI,KAAK,WAAW,KAAK,QAAS;AAClC,SAAK,UAAU;AACf,UAAM,mBAAmB,KAAK;AAC9B,QAAI;AAKF,YAAM,yBAAyB,KAAK,KAAK,kBAAkB;AAC3D,UACE,0BACA,uBAAuB,UAAU,UACjC,KAAK,IAAI,IAAI,uBAAuB,aACpC;AACA;AAAA,MACF;AAMA,UAAI;AACJ,UAAI;AACF,qBAAa,MAAM,KAAK,mBAAmB;AAAA,MAC7C,SAAS,KAAK;AAIZ,aAAK,cAAc;AACnB,YAAI;AAAA,UACF,wDAAwD,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,QAC1G;AACA;AAAA,MACF;AACA,UAAI,KAAK,QAAS;AAClB,YAAM,UAAU,KAAK,iBAAiB,UAAU;AAIhD,UAAI,QAAS,MAAK,cAAc;AAAA,IAClC,UAAE;AACA,WAAK,UAAU;AAAA,IACjB;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,qBAAsE;AAClF,UAAM,MAA8C,CAAC;AACrD,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,YAAY,KAAK,IAAI,KAAK,gBAAgB,IAAI,GAAG,EAAE;AACzD,UAAM,OAAO,MAAM,KAAK,KAAK,OAAO,SAAS,KAAK,aAAa,SAAS;AACxE,eAAW,UAAU,KAAK,SAAS;AACjC,WAAK,IAAI,OAAO,GAAG;AACnB,UAAI,KAAK,EAAE,KAAK,OAAO,KAAK,YAAY,MAAM,CAAC;AAAA,IACjD;AACA,SAAK,cAAc,KAAK;AACxB,eAAW,CAAC,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,iBAAiB,GAAG;AAC9D,UAAI,OAAO,QAAQ,OAAO,iBAAiB,EAAG;AAC9C,UAAI,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,OAAO,UAAU,GAAG,EAAG;AACtD,WAAK,IAAI,GAAG;AACZ,UAAI,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAIQ,kBAA0B;AAChC,QAAI,KAAK,KAAK,MAAM,kBAAkB,EAAG,QAAO;AAChD,WAAO,KAAK,KAAK,MAAM;AAAA,EACzB;AAAA;AAAA,EAGQ,iBAAiB,YAA6D;AAMpF,UAAM,UAAU,KAAK,KAAK,kBAAkB;AAC5C,QAAI,WAAW,QAAQ,UAAU,UAAU,KAAK,IAAI,IAAI,QAAQ,aAAa;AAC3E,aAAO;AAAA,IACT;AACA,QAAI,UAAU;AACd,eAAW,aAAa,YAAY;AAClC,UAAI,KAAK,WAAW,KAAK,SAAS,QAAQ,KAAK,gBAAgB,GAAG;AAChE,kBAAU;AACV;AAAA,MACF;AACA,UAAI,CAAC,KAAK,kBAAkB,SAAS,EAAG;AAIxC,UAAI,UAAU,YAAY;AACxB,YAAI,CAAC,KAAK,KAAK,MAAM,cAAc,UAAU,GAAG,EAAG;AACnD,aAAK,SAAS,IAAI,UAAU,GAAG;AAAA,MACjC;AACA,WAAK,KAAK,OAAO,UAAU,KAAK,UAAU,UAAU;AAAA,IACtD;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAIQ,kBAAkB,WAA0D;AAClF,QAAI,KAAK,WAAW,KAAK,SAAS,QAAQ,KAAK,gBAAgB,EAAG,QAAO;AACzE,QAAI,KAAK,SAAS,IAAI,UAAU,GAAG,EAAG,QAAO;AAC7C,UAAM,QAAQ,KAAK,KAAK,IAAI,UAAU,GAAG;AACzC,WAAO,EAAE,SAAS,KAAK,IAAI,IAAI,MAAM;AAAA,EACvC;AAAA;AAAA;AAAA,EAIA,MAAc,OAAO,KAAa,YAAoC;AACpE,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,EAAE,SAAS,SAAS,SAAS,OAAO,IAAI,QAAQ,cAAoB;AAC1E,SAAK,SAAS,IAAI,KAAK,EAAE,YAAY,QAAQ,CAAC;AAC9C,QAAI;AACF,UAAI,CAAE,MAAM,KAAK,eAAe,KAAK,YAAY,KAAK,QAAQ,OAAO,EAAI;AAGzE,UAAI,KAAK,QAAS;AAClB,YAAM,KAAK,gBAAgB,KAAK,WAAW,QAAQ,KAAK,QAAQ,OAAO;AAAA,IACzE,SAAS,KAAK;AAIZ,WAAK,SAAS,UAAU;AACxB,YAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAG/D,WAAK,WAAW,KAAM,KAAwD,kBAAkB,GAAG,OAAO;AAC1G,UAAI,KAAK,kBAAkB,GAAG,uBAAuB,OAAO,EAAE;AAAA,IAChE,UAAE;AACA,WAAK,SAAS,OAAO,GAAG;AACxB,WAAK,SAAS,OAAO,GAAG;AACxB,WAAK,KAAK,MAAM,sBAAsB,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,eAAe,KAAa,YAAqB,SAAmC;AAChG,QAAI,CAAC,WAAY,QAAO;AACxB,QAAI;AACF,YAAM,UAAU,MAAM,KAAK,KAAK,OAAO,qBAAqB,KAAK,KAAK,KAAK,MAAM,OAAO,CAAC;AACzF,UAAI,YAAY,SAAS;AACvB,aAAK,KAAK,OAAO,GAAG;AACpB,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT,UAAE;AACA,WAAK,SAAS,OAAO,GAAG;AACxB,WAAK,KAAK,MAAM,sBAAsB,GAAG;AAAA,IAC3C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,gBAAgB,KAAa,QAAqB,SAAgC;AAC9F,SAAK,SAAS,WAAW;AACzB,QAAI;AACF,YAAM,UAAU,MAAM,KAAK,KAAK,SAAS,KAAK;AAAA,QAC5C;AAAA,QACA;AAAA,MACF,CAAC;AACD,WAAK,aAAa,KAAK,OAAO;AAAA,IAChC,SAAS,KAAK;AACZ,WAAK,SAAS,UAAU;AACxB,YAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAG/D,WAAK,WAAW,KAAM,KAAwD,kBAAkB,GAAG,OAAO;AAC1G,UAAI,KAAK,kBAAkB,GAAG,WAAW,OAAO,EAAE;AAAA,IACpD;AAAA,EACF;AAAA,EAEQ,aAAa,KAAa,SAAoC;AACpE,UAAM,cAAc,QAAQ,QAAQ,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,OAAO,CAAC,KAAK;AACpF,UAAM,WAAW,KAAK,KAAK,IAAI,GAAG;AAClC,UAAM,aAAa,QAAQ,kBAAkB,UAAU,kBAAkB,OAAO;AAChF,QAAI,QAAQ,WAAW,WAAW;AAGhC,WAAK,KAAK,OAAO,GAAG;AACpB,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,kBAAkB,QAAQ;AACxC,UAAI;AAAA,QACF,kBAAkB,GAAG,aAAa,QAAQ,YAAY,aAAa,QAAQ,kBAAkB;AAAA,MAC/F;AACA;AAAA,IACF;AACA,SAAK,yBAAyB,UAAU,SAAS,WAAW;AAC5D,UAAM,SAAS,cAAc,KAAK,QAAQ,iBAAiB;AAC3D,SAAK,KAAK,IAAI,KAAK,KAAK,aAAa,UAAU,SAAS,QAAQ,UAAU,CAAC;AAC3E,QAAI;AAAA,MACF,kBAAkB,GAAG,IAAI,QAAQ,MAAM,KAAK,QAAQ,cAAc,qBAC7D,SAAS,aAAa,WAAW,KAAK,EAAE,GAAG,QAAQ,SAAS,KAAK,QAAQ,MAAM,KAAK,EAAE;AAAA,IAC7F;AAAA,EACF;AAAA;AAAA,EAGQ,yBACN,UACA,SACA,aACM;AACN,QAAI,cAAc,GAAG;AACnB,WAAK,SAAS,OAAO,QAAQ;AAC7B,WAAK,SAAS,OAAO,SAAS;AAAA,IAChC;AACA,QAAI,QAAQ,WAAW,SAAU,MAAK,SAAS,UAAU;AAAA,aAChD,aAAa,WAAc,SAAS,UAAU,aAAa,SAAS,UAAU;AACrF,WAAK,SAAS,WAAW;AAAA,EAC7B;AAAA;AAAA;AAAA,EAIQ,aACN,UACA,SACA,QACA,YACU;AACV,WAAO;AAAA,MACL,OAAO,SAAS,WAAW;AAAA,MAC3B,eAAe,KAAK,IAAI,IAAI,KAAK,UAAU,UAAU,cAAc,CAAC,MAAM;AAAA,MAC1E,gBAAgB,QAAQ;AAAA,MACxB,QAAQ,QAAQ;AAAA,MAChB,iBAAiB,KAAK,oBAAoB,QAAQ,YAAY,QAAQ;AAAA,IACxE;AAAA,EACF;AAAA,EAEQ,oBAAoB,QAAiB,YAAqB,UAAwC;AACxG,WAAO,UAAU,CAAC,cAAc,UAAU,mBAAmB,KAAK,IAAI;AAAA,EACxE;AAAA,EAEQ,UAAU,UAAgC,YAA6B;AAC7E,QAAI,UAAU,UAAU,SAAU,QAAO,KAAK,QAAQ;AACtD,UAAM,WAAW,aAAa,KAAK,UAAU,mBAAmB,KAAK;AACrE,WAAO,KAAK,IAAI,KAAK,QAAQ,cAAc,KAAK,UAAU,KAAK,QAAQ,UAAU;AAAA,EACnF;AAAA,EAEQ,WAAW,KAAa,gBAAwB,QAAsB;AAC5E,UAAM,WAAW,KAAK,KAAK,IAAI,GAAG;AAClC,SAAK,KAAK,IAAI,KAAK;AAAA,MACjB,OAAO;AAAA,MACP,eAAe,KAAK,IAAI,IAAI,KAAK,UAAU,UAAU,KAAK;AAAA,MAC1D;AAAA,MACA;AAAA,MACA,kBAAkB,UAAU,mBAAmB,KAAK;AAAA,IACtD,CAAC;AAAA,EACH;AACF;AAGA,IAAM,qBAAqB;AAIpB,SAAS,qBACd,cACA,UAAmC,CAAC,GAClB;AAClB,QAAM,SAAS,IAAI,kBAAkB,YAAY;AACjD,SAAO,IAAI;AAAA,IACT;AAAA,MACE,OAAO,aAAa;AAAA,MACpB,QAAQ,aAAa,QAAQ,kBAAkB;AAAA,MAC/C,kBAAkB,YAAY;AAG5B,cAAM,aAAa,OAAO,KAAK;AAC/B,eAAO,aAAa,OAAO,YAAY;AAAA,MACzC;AAAA,MACA,OAAO,CAAC,YAAY;AAClB,cAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,eAAO;AAAA,UACL;AAAA,UACA,KAAK,QAAQ;AAAA,UACb,MAAM,SAAS;AAAA,UACf,YAAY;AAAA,UACZ,aAAa;AAAA,UACb,SAAS;AAAA,QACX;AAAA,MACF;AAAA,MACA,UAAU,CAAC,KAAK,iBAAiB,OAAO,aAAa,KAAK,YAAY;AAAA;AAAA;AAAA,MAGtE,iBAAiB,MAAM,aAAa,8BAA8B,EAAE;AAAA,IACtE;AAAA,IACA;AAAA,EACF;AACF;","names":[]}

package/dist/orchestration/buffer-drain-runner.js

@@ -1,8 +1,8 @@
 import {
   BufferDrainRunner,
   ClaimBufferStorage
-} from "../chunk-TZKK72BY.js";
-import "../chunk-5DGK7E4W.js";
+} from "../chunk-QIPDTAWZ.js";
+import "../chunk-MMOXCCHF.js";
 import "../chunk-6P7U3HWG.js";
 import "../chunk-PQM3B54K.js";
 import "../chunk-B3DR2JBZ.js";
@@ -175,7 +175,7 @@ import "../chunk-MDPT6QFK.js";
 import "../chunk-UOBPK2OS.js";
 import "../chunk-2YA5N2BY.js";
 import "../chunk-3HSRWJTC.js";
-import "../chunk-4PXDXCNE.js";
+import "../chunk-PL36IQPL.js";
 import "../chunk-HUDPXTXW.js";
 import "../chunk-AZEZSQ5R.js";
 import "../chunk-YAZNBMNF.js";

package/dist/orchestration/task-exit.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Exit-once bookkeeping for a queued extraction task (`onTaskExit`).
+ *
+ * A task settled (abort, queue deadline) before its closure ever ran has
+ * nothing to exit, so `settled()` reports exit at once; a claim-lease owner
+ * waiting on the exit is then not held behind an unrelated running extraction.
+ * A closure that did start reports exit when it finishes. Either way the
+ * callback fires exactly once.
+ */
+export declare function createTaskExit(onExit?: () => void): {
+    start: () => void;
+    settled: () => void;
+    report: () => void;
+};
+//# sourceMappingURL=task-exit.d.ts.map

package/dist/orchestration/task-exit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-exit.d.ts","sourceRoot":"","sources":["../../src/orchestration/task-exit.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAAC,MAAM,CAAC,EAAE,MAAM,IAAI;;;kBAG7B,IAAI;EAcxB"}