@remnic/core 10.0.98 → 10.0.99

package/dist/cli.js

@@ -91,7 +91,7 @@ import {
   runWorkProductStatusCliCommand,
   runWorkProjectCliCommand,
   runWorkTaskCliCommand
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-VZMRKYNR.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import "./chunk-B3DR2JBZ.js";

package/dist/explicit-capture.js

@@ -8,7 +8,7 @@ import {
   shouldSkipImplicitExtraction,
   stripInlineExplicitCaptureNotes,
   validateExplicitCaptureInput
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-VZMRKYNR.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import "./chunk-B3DR2JBZ.js";

package/dist/index.js

@@ -259,7 +259,7 @@ import {
   writeManifest,
   writeMeetingEpisodeMemory,
   writeTimelineState
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-VZMRKYNR.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import {

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-UBJ5RPDM.js";
+import "../chunk-VZMRKYNR.js";
 import "../chunk-6P7U3HWG.js";
 import "../chunk-PQM3B54K.js";
 import "../chunk-B3DR2JBZ.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-UBJ5RPDM.js";
+import "../chunk-VZMRKYNR.js";
 import "../chunk-6P7U3HWG.js";
 import "../chunk-PQM3B54K.js";
 import "../chunk-B3DR2JBZ.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"}

package/dist/orchestration/turn-ingestion.d.ts

@@ -219,13 +219,7 @@ export declare class TurnIngestionCoordinator {
         abortSignal?: AbortSignal;
         /** Automatic buffered work only. Replay and import must not set this. */
         preemptable?: boolean;
-        /**
-         * Invoked when the queued closure has FULLY exited (after settlement).
-         * Settlement can fire before the closure exits — e.g. an abort listener
-         * settles while persistence is still in flight — so callers that
-         * release resources on settlement (claim leases) can use this to wait
-         * for the actual task exit first.
-         */
+        /** Fires once when the task is done: closure exited, or settled before it started. */
         onTaskExit?: () => void;
         /** Fail-closed force-flush only. Not implied by failOnExtractionFailure. */
         preemptRunning?: boolean;

package/dist/orchestration/turn-ingestion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"turn-ingestion.d.ts","sourceRoot":"","sources":["../../src/orchestration/turn-ingestion.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,EAAE,WAAW,EAAuB,MAAM,cAAc,CAAC;AAChE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAE1D,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,qCAAqC,CAAC;AAI7E,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAE5C,OAAO,EAAE,0BAA0B,EAAE,MAAM,mCAAmC,CAAC;AAC/E,OAAO,EAEL,wBAAwB,EACxB,KAAK,mBAAmB,EACzB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,KAAK,UAAU,EAA6B,MAAM,oBAAoB,CAAC;AAChF,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAEpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC;AAKvF,OAAO,EAAuE,KAAK,8BAA8B,EAAE,MAAM,+BAA+B,CAAC;AACzJ,OAAO,EAAoC,iCAAiC,EAAwC,MAAM,wCAAwC,CAAC;AACnK,OAAO,EAA2B,KAAK,wBAAwB,EAA8B,MAAM,iCAAiC,CAAC;AAIrI,OAAO,EAIL,KAAK,2BAA2B,EACjC,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EAAE,2BAA2B,EAAE,0BAA0B,EAAE,MAAM,wBAAwB,CAAC;AACjG,OAAO,EAAE,2BAA2B,EAAE,0BAA0B,EAAE,CAAC;AAEnE,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,wBAAwB,IAAI,MAAM,CAAC;IACnC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,QAAQ,CAAC,0BAA0B,EAAE,0BAA0B,CAAC;IAChE,UAAU,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IACxD,QAAQ,CAAC,uBAAuB,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,sBAAsB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7C,wBAAwB,IAAI,iBAAiB,CAAC;IAC9C,QAAQ,CAAC,0BAA0B,EAAE;QACnC,QAAQ,EAAE,MAAM,CAAC;QACjB,MAAM,EAAE,MAAM,CAAC;QACf,WAAW,EAAE,MAAM,CAAC;QACpB,sBAAsB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAChD,CAAC;IACF,uBAAuB,CACrB,cAAc,EAAE,UAAU,EAAE,EAC5B,MAAM,EAAE,cAAc,GAAG,oBAAoB,EAC7C,OAAO,CAAC,EAAE;QACR,eAAe,CAAC,EAAE,OAAO,CAAC;QAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;QACrC,kBAAkB,CAAC,EAAE,OAAO,CAAC;QAC7B,iBAAiB,CAAC,EAAE,OAAO,CAAC;QAC5B,qBAAqB,CAAC,EAAE,OAAO,CAAC;QAChC,oBAAoB,CAAC,EAAE,MAAM,CAAC;QAC9B,uBAAuB,CAAC,EAAE,OAAO,CAAC;QAClC,eAAe,CAAC,EAAE,MAAM,IAAI,CAAC;QAC7B,sBAAsB,CAAC,EAAE,OAAO,CAAC;QACjC,aAAa,CAAC,EAAE,CACd,KAAK,CAAC,EAAE,OAAO,EACf,MAAM,CAAC,EAAE,mBAAmB,KACzB,IAAI,CAAC;QACV,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,WAAW,CAAC,EAAE,WAAW,CAAC;QAC1B,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,cAAc,CAAC,EAAE,OAAO,CAAC;QACzB,sBAAsB,CAAC,EAAE,MAAM,CAAC;QAChC;;;;WAIG;QACH,qBAAqB,CAAC,EAAE,wBAAwB,GAAG,IAAI,CAAC;QACxD,iBAAiB,CAAC,EAAE,MAAM,CAAC;KAC5B,GACA,OAAO,CAAC,IAAI,CAAC,CAAC;IACjB,uBAAuB,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAClE,yGAAyG;IACzG,2BAA2B,CAAC,IAAI,MAAM,CAAC;IACvC,aAAa,CACX,GAAG,IAAI,EAAE,UAAU,CAAC,wBAAwB,CAAC,eAAe,CAAC,CAAC,GAC7D,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAChC,QAAQ,CAAC,eAAe,EAAE,oBAAoB,CAAC;IAC/C,qBAAqB,CACnB,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,GACjD,OAAO,CAAC;IACX,QAAQ,CAAC,UAAU,EAAE,iBAAiB,CAAC;CACxC;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAqB,SAAQ,yBAAyB;IACrE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAqBD,qBAAa,wBAAwB;IAIvB,OAAO,CAAC,QAAQ,CAAC,IAAI;IAHjC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkB;IACxC,wFAAwF;IACxF,QAAQ,CAAC,eAAe,oCAA2C;gBACtC,IAAI,EAAE,iBAAiB;IAI9C,WAAW,CACf,IAAI,EAAE,MAAM,GAAG,WAAW,EAC1B,OAAO,EAAE,MAAM,EACf,UAAU,CAAC,EAAE,MAAM,EACnB,OAAO,GAAE,oBAAyB,GACjC,OAAO,CAAC,IAAI,CAAC;IAgEV,iBAAiB,CACrB,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,GAAE;QACP,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,UAAU,CAAC,EAAE,OAAO,CAAC;QACrB,WAAW,CAAC,EAAE,WAAW,CAAC;QAC1B;;;;;;;;;WASG;QACH,sBAAsB,CAAC,EAAE,MAAM,CAAC;QAChC;;;;;;;;;WASG;QACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;QAC3B;;;;WAIG;QACH,qBAAqB,CAAC,EAAE,wBAAwB,GAAG,IAAI,CAAC;QACxD;;;;WAIG;QACH,qBAAqB,CAAC,EAAE,MAAM,CAAC;QAC/B;;;;;;WAMG;QACH,cAAc,CAAC,EAAE,WAAW,GAAG,UAAU,CAAC;QAC1C,4EAA4E;QAC5E,kBAAkB,CAAC,EAAE,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC;QACzD;;;;WAIG;QACH,aAAa,CAAC,EAAE,OAAO,aAAa,EAAE,aAAa,CAAC;KAChD,GACL,OAAO,CAAC,IAAI,CAAC;IAoHhB,2FAA2F;YAC7E,yBAAyB;IA4EvC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAsCG;IACG,qBAAqB,CACzB,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,GAAE;QACP,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,uBAAuB,CAAC,EAAE,OAAO,CAAC;QAClC,2BAA2B,CAAC,EAAE,OAAO,CAAC;KAClC,GACL,OAAO,CAAC,2BAA2B,CAAC;IA8KjC,uBAAuB,CAC3B,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO,GACnC,OAAO,CAAC,IAAI,CAAC;IA0EV,uBAAuB,CAC3B,cAAc,EAAE,UAAU,EAAE,EAC5B,MAAM,EAAE,cAAc,GAAG,oBAAoB,EAC7C,OAAO,GAAE;QACP,eAAe,CAAC,EAAE,OAAO,CAAC;QAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;QACrC,kBAAkB,CAAC,EAAE,OAAO,CAAC;QAC7B,iBAAiB,CAAC,EAAE,OAAO,CAAC;QAC5B,qBAAqB,CAAC,EAAE,OAAO,CAAC;QAChC,oBAAoB,CAAC,EAAE,MAAM,CAAC;QAC9B,uBAAuB,CAAC,EAAE,OAAO,CAAC;QAClC,eAAe,CAAC,EAAE,MAAM,IAAI,CAAC;QAC7B,sBAAsB,CAAC,EAAE,OAAO,CAAC;QACjC,aAAa,CAAC,EAAE,CACd,KAAK,CAAC,EAAE,OAAO,EACf,MAAM,CAAC,EAAE,mBAAmB,KACzB,IAAI,CAAC;QACV,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,WAAW,CAAC,EAAE,WAAW,CAAC;QAC1B,yEAAyE;QACzE,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB;;;;;;WAMG;QACH,UAAU,CAAC,EAAE,MAAM,IAAI,CAAC;QACxB,4EAA4E;QAC5E,cAAc,CAAC,EAAE,OAAO,CAAC;QACzB,sBAAsB,CAAC,EAAE,MAAM,CAAC;QAChC;;;;WAIG;QACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;QAC3B,qBAAqB,CAAC,EAAE,wBAAwB,GAAG,IAAI,CAAC;QACxD,wEAAwE;QACxE,SAAS,CAAC,EAAE,8BAA8B,CAAC;KACvC,GACL,OAAO,CAAC,IAAI,CAAC;IAgShB;;;;;;;;;OASG;IACG,8BAA8B,CAClC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE;QACJ,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,aAAa,EAAE,OAAO,CAAC;QACvB,WAAW,CAAC,EAAE,WAAW,CAAC;KAC3B,GACA,OAAO,CAAC,IAAI,CAAC;CAkEjB;AAED,sFAAsF;AACtF,MAAM,MAAM,wBAAwB,GAAG,UAAU,CAAC,wBAAwB,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC"}
+{"version":3,"file":"turn-ingestion.d.ts","sourceRoot":"","sources":["../../src/orchestration/turn-ingestion.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,EAAE,WAAW,EAAuB,MAAM,cAAc,CAAC;AAChE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAE1D,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,qCAAqC,CAAC;AAI7E,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAE5C,OAAO,EAAE,0BAA0B,EAAE,MAAM,mCAAmC,CAAC;AAC/E,OAAO,EAEL,wBAAwB,EACxB,KAAK,mBAAmB,EACzB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,KAAK,UAAU,EAA6B,MAAM,oBAAoB,CAAC;AAChF,OAAO,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAEpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC;AAKvF,OAAO,EAAuE,KAAK,8BAA8B,EAAE,MAAM,+BAA+B,CAAC;AACzJ,OAAO,EAAoC,iCAAiC,EAAwC,MAAM,wCAAwC,CAAC;AACnK,OAAO,EAA2B,KAAK,wBAAwB,EAA8B,MAAM,iCAAiC,CAAC;AAIrI,OAAO,EAIL,KAAK,2BAA2B,EACjC,MAAM,oBAAoB,CAAC;AAI5B,OAAO,EAAE,2BAA2B,EAAE,0BAA0B,EAAE,MAAM,wBAAwB,CAAC;AAEjG,OAAO,EAAE,2BAA2B,EAAE,0BAA0B,EAAE,CAAC;AAEnE,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;IAC7B,wBAAwB,IAAI,MAAM,CAAC;IACnC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,QAAQ,CAAC,0BAA0B,EAAE,0BAA0B,CAAC;IAChE,UAAU,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;IACxD,QAAQ,CAAC,uBAAuB,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,QAAQ,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,CAAC;IACrC,QAAQ,CAAC,sBAAsB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7C,wBAAwB,IAAI,iBAAiB,CAAC;IAC9C,QAAQ,CAAC,0BAA0B,EAAE;QACnC,QAAQ,EAAE,MAAM,CAAC;QACjB,MAAM,EAAE,MAAM,CAAC;QACf,WAAW,EAAE,MAAM,CAAC;QACpB,sBAAsB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAChD,CAAC;IACF,uBAAuB,CACrB,cAAc,EAAE,UAAU,EAAE,EAC5B,MAAM,EAAE,cAAc,GAAG,oBAAoB,EAC7C,OAAO,CAAC,EAAE;QACR,eAAe,CAAC,EAAE,OAAO,CAAC;QAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;QACrC,kBAAkB,CAAC,EAAE,OAAO,CAAC;QAC7B,iBAAiB,CAAC,EAAE,OAAO,CAAC;QAC5B,qBAAqB,CAAC,EAAE,OAAO,CAAC;QAChC,oBAAoB,CAAC,EAAE,MAAM,CAAC;QAC9B,uBAAuB,CAAC,EAAE,OAAO,CAAC;QAClC,eAAe,CAAC,EAAE,MAAM,IAAI,CAAC;QAC7B,sBAAsB,CAAC,EAAE,OAAO,CAAC;QACjC,aAAa,CAAC,EAAE,CACd,KAAK,CAAC,EAAE,OAAO,EACf,MAAM,CAAC,EAAE,mBAAmB,KACzB,IAAI,CAAC;QACV,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,WAAW,CAAC,EAAE,WAAW,CAAC;QAC1B,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,cAAc,CAAC,EAAE,OAAO,CAAC;QACzB,sBAAsB,CAAC,EAAE,MAAM,CAAC;QAChC;;;;WAIG;QACH,qBAAqB,CAAC,EAAE,wBAAwB,GAAG,IAAI,CAAC;QACxD,iBAAiB,CAAC,EAAE,MAAM,CAAC;KAC5B,GACA,OAAO,CAAC,IAAI,CAAC,CAAC;IACjB,uBAAuB,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAClE,yGAAyG;IACzG,2BAA2B,CAAC,IAAI,MAAM,CAAC;IACvC,aAAa,CACX,GAAG,IAAI,EAAE,UAAU,CAAC,wBAAwB,CAAC,eAAe,CAAC,CAAC,GAC7D,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAChC,QAAQ,CAAC,eAAe,EAAE,oBAAoB,CAAC;IAC/C,qBAAqB,CACnB,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,OAAO,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,GACjD,OAAO,CAAC;IACX,QAAQ,CAAC,UAAU,EAAE,iBAAiB,CAAC;CACxC;AAED;;;GAGG;AACH,MAAM,WAAW,oBAAqB,SAAQ,yBAAyB;IACrE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAqBD,qBAAa,wBAAwB;IAIvB,OAAO,CAAC,QAAQ,CAAC,IAAI;IAHjC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkB;IACxC,wFAAwF;IACxF,QAAQ,CAAC,eAAe,oCAA2C;gBACtC,IAAI,EAAE,iBAAiB;IAI9C,WAAW,CACf,IAAI,EAAE,MAAM,GAAG,WAAW,EAC1B,OAAO,EAAE,MAAM,EACf,UAAU,CAAC,EAAE,MAAM,EACnB,OAAO,GAAE,oBAAyB,GACjC,OAAO,CAAC,IAAI,CAAC;IAgEV,iBAAiB,CACrB,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,GAAE;QACP,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,UAAU,CAAC,EAAE,OAAO,CAAC;QACrB,WAAW,CAAC,EAAE,WAAW,CAAC;QAC1B;;;;;;;;;WASG;QACH,sBAAsB,CAAC,EAAE,MAAM,CAAC;QAChC;;;;;;;;;WASG;QACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;QAC3B;;;;WAIG;QACH,qBAAqB,CAAC,EAAE,wBAAwB,GAAG,IAAI,CAAC;QACxD;;;;WAIG;QACH,qBAAqB,CAAC,EAAE,MAAM,CAAC;QAC/B;;;;;;WAMG;QACH,cAAc,CAAC,EAAE,WAAW,GAAG,UAAU,CAAC;QAC1C,4EAA4E;QAC5E,kBAAkB,CAAC,EAAE,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC;QACzD;;;;WAIG;QACH,aAAa,CAAC,EAAE,OAAO,aAAa,EAAE,aAAa,CAAC;KAChD,GACL,OAAO,CAAC,IAAI,CAAC;IAoHhB,2FAA2F;YAC7E,yBAAyB;IA4EvC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAsCG;IACG,qBAAqB,CACzB,KAAK,EAAE,UAAU,EAAE,EACnB,OAAO,GAAE;QACP,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,uBAAuB,CAAC,EAAE,OAAO,CAAC;QAClC,2BAA2B,CAAC,EAAE,OAAO,CAAC;KAClC,GACL,OAAO,CAAC,2BAA2B,CAAC;IA8KjC,uBAAuB,CAC3B,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO,GACnC,OAAO,CAAC,IAAI,CAAC;IA0EV,uBAAuB,CAC3B,cAAc,EAAE,UAAU,EAAE,EAC5B,MAAM,EAAE,cAAc,GAAG,oBAAoB,EAC7C,OAAO,GAAE;QACP,eAAe,CAAC,EAAE,OAAO,CAAC;QAC1B,0BAA0B,CAAC,EAAE,OAAO,CAAC;QACrC,kBAAkB,CAAC,EAAE,OAAO,CAAC;QAC7B,iBAAiB,CAAC,EAAE,OAAO,CAAC;QAC5B,qBAAqB,CAAC,EAAE,OAAO,CAAC;QAChC,oBAAoB,CAAC,EAAE,MAAM,CAAC;QAC9B,uBAAuB,CAAC,EAAE,OAAO,CAAC;QAClC,eAAe,CAAC,EAAE,MAAM,IAAI,CAAC;QAC7B,sBAAsB,CAAC,EAAE,OAAO,CAAC;QACjC,aAAa,CAAC,EAAE,CACd,KAAK,CAAC,EAAE,OAAO,EACf,MAAM,CAAC,EAAE,mBAAmB,KACzB,IAAI,CAAC;QACV,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,WAAW,CAAC,EAAE,WAAW,CAAC;QAC1B,yEAAyE;QACzE,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,sFAAsF;QACtF,UAAU,CAAC,EAAE,MAAM,IAAI,CAAC;QACxB,4EAA4E;QAC5E,cAAc,CAAC,EAAE,OAAO,CAAC;QACzB,sBAAsB,CAAC,EAAE,MAAM,CAAC;QAChC;;;;WAIG;QACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;QAC3B,qBAAqB,CAAC,EAAE,wBAAwB,GAAG,IAAI,CAAC;QACxD,wEAAwE;QACxE,SAAS,CAAC,EAAE,8BAA8B,CAAC;KACvC,GACL,OAAO,CAAC,IAAI,CAAC;IAmShB;;;;;;;;;OASG;IACG,8BAA8B,CAClC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,IAAI,EAAE;QACJ,UAAU,EAAE,MAAM,CAAC;QACnB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,aAAa,EAAE,OAAO,CAAC;QACvB,WAAW,CAAC,EAAE,WAAW,CAAC;KAC3B,GACA,OAAO,CAAC,IAAI,CAAC;CAkEjB;AAED,sFAAsF;AACtF,MAAM,MAAM,wBAAwB,GAAG,UAAU,CAAC,wBAAwB,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC"}

package/dist/orchestrator.js

@@ -6,7 +6,7 @@ import {
   mergeGraphExpandedResults,
   qmdStartupCollectionChecksWithTimeout,
   resolveEffectiveIdentityInjectionMode
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-VZMRKYNR.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import "./chunk-B3DR2JBZ.js";

package/dist/recall-navigation.js

@@ -1,6 +1,6 @@
 import {
   runRecallNavigation
-} from "./chunk-5DGK7E4W.js";
+} from "./chunk-VZMRKYNR.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import "./chunk-B3DR2JBZ.js";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@remnic/core",
-  "version": "10.0.98",
+  "version": "10.0.99",
   "description": "Framework-agnostic Remnic memory engine — orchestrator, storage, extraction, search, trust zones",
   "type": "module",
   "main": "dist/index.js",
@@ -3386,7 +3386,7 @@
     "core"
   ],
   "peerDependencies": {
-    "@remnic/coding-graph": "^10.0.98"
+    "@remnic/coding-graph": "^10.0.99"
   },
   "peerDependenciesMeta": {
     "@remnic/coding-graph": {

package/src/backlog-scheduler.test.ts

@@ -12,6 +12,7 @@ import assert from "node:assert/strict";
 import test from "node:test";
 
 import { hostname } from "node:os";
+import { log } from "./logger.js";
 import {
   BacklogScheduler,
   type BacklogSchedulerDeps,
@@ -390,6 +391,53 @@ test("the in-flight bound is the queue's own maxConcurrency", async () => {
   }
 });
 
+test("stop returns within its settle bound and names a drain that ignores abort", async () => {
+  const queue = new ExtractionQueueCoordinator(1);
+  const state: StubState = {
+    counts: new Map([["stuck-key", { turns: 3, retainedTurns: 0 }]]),
+    claimed: new Set(),
+    claimTurns: new Map(),
+    claimedThisRun: new Set(),
+    outcomes: [],
+    drained: [],
+  };
+  const entered = Promise.withResolvers<void>();
+  const forever = new Promise<DrainSessionOutcome>(() => {});
+  const scheduler = new BacklogScheduler(
+    {
+      ...makeDeps(state, queue),
+      // Ignores options.signal entirely: the shape that held a daemon stop
+      // until the 700 s systemd kill.
+      drainKey: async () => {
+        entered.resolve();
+        return forever;
+      },
+    },
+    { pollMs: 3_600_000, stopSettleTimeoutMs: 50 }
+  );
+  const warnings: string[] = [];
+  const originalWarn = log.warn;
+  log.warn = (msg: string) => {
+    warnings.push(msg);
+  };
+  try {
+    scheduler.start();
+    await scheduler.tickForTest();
+    await entered.promise;
+    const outcome = await Promise.race([
+      scheduler.stop().then(() => "returned"),
+      new Promise<string>((resolve) => setTimeout(() => resolve("hung"), 2_000)),
+    ]);
+    assert.equal(outcome, "returned", "stop must not wait forever on a drain that ignores abort");
+    assert.ok(
+      warnings.some((w) => w.includes("stuck-key")),
+      `the stuck key is named in a warning: ${JSON.stringify(warnings)}`
+    );
+  } finally {
+    log.warn = originalWarn;
+  }
+});
+
 test("stop aborts in-flight drains; a fresh start resumes the still-claimed backlog", async () => {
   const queue = new ExtractionQueueCoordinator(1);
   const state: StubState = {

package/src/orchestration/backlog-scheduler.ts

@@ -70,6 +70,8 @@ export interface BacklogSchedulerOptions {
   pollMs?: number;
   retryBaseMs?: number;
   retryMaxMs?: number;
+  /** Bound on `stop()`'s wait for aborted drains to settle. */
+  stopSettleTimeoutMs?: number;
   now?: () => number;
 }
 
@@ -114,6 +116,9 @@ interface KeyState {
 const DEFAULT_POLL_MS = 15_000;
 const DEFAULT_RETRY_BASE_MS = 30_000;
 const DEFAULT_RETRY_MAX_MS = 15 * 60_000;
+// Aborted drains normally settle within seconds (a chunk boundary); this only
+// bounds the pathological case, well inside the daemon's stop budget.
+const DEFAULT_STOP_SETTLE_TIMEOUT_MS = 30_000;
 
 export class BacklogScheduler {
   private readonly deps: BacklogSchedulerDeps;
@@ -141,6 +146,7 @@ export class BacklogScheduler {
       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,
     };
   }
@@ -155,7 +161,10 @@ export class BacklogScheduler {
   }
 
   /** 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(): Promise<void> {
     if (this.stopped) return;
     this.stopped = true;
@@ -168,7 +177,19 @@ export class BacklogScheduler {
       entry.controller.abort(new Error("backlog scheduler stopping"));
       aborts.push(entry.settled);
     }
-    await Promise.allSettled(aborts);
+    const bound = Promise.withResolvers<"timeout">();
+    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. */

package/src/orchestration/extraction-queue-bounded-retention.test.ts

@@ -299,6 +299,26 @@ test("abort while queued: settled task starts, skips extraction, queue drains",
   assert.equal(settled.length, 1, "queued task settles exactly once from the abort");
 });
 
+test("abort while queued: onTaskExit fires at once, not after the queue head finishes", async () => {
+  const h = makeHarness();
+  const controller = new AbortController();
+  // Occupies the single worker; the drain stays blocked until release().
+  await h.coordinator.processTurn("user", "running", "k");
+  let exited = 0;
+  await h.coordinator.queueBufferedExtraction([makeTurn("queued then aborted")], "trigger_mode", {
+    bufferKey: "k",
+    preemptable: true,
+    abortSignal: controller.signal,
+    onTaskExit: () => { exited += 1; },
+  });
+  controller.abort();
+  // A claim-lease owner waiting on this exit must not be held by an unrelated
+  // running extraction: nothing of this task ever ran.
+  assert.equal(exited, 1, "queued task that never started reports exit on abort");
+  await h.release();
+  assert.equal(exited, 1, "the later no-op closure run does not report a second exit");
+});
+
 test("sharing bound: distinct reference slots equal the union, not the snapshot sum", async () => {
   const h = makeHarness();
   const turns = 30;

package/src/orchestration/task-exit.ts

@@ -0,0 +1,27 @@
+/**
+ * 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 function createTaskExit(onExit?: () => void) {
+  let started = false;
+  let reported = false;
+  const report = (): void => {
+    if (reported) return;
+    reported = true;
+    onExit?.();
+  };
+  return {
+    start: () => {
+      started = true;
+    },
+    settled: () => {
+      if (!started) report();
+    },
+    report,
+  };
+}

package/src/orchestration/turn-ingestion.ts

@@ -60,6 +60,7 @@ import {
 // The class lives in ../buffer-admission.js next to BufferAdmissionRefusedError;
 // re-exported here so existing importers keep their import path.
 import { ReplayAdmissionRefusedError, StorageTargetRequiredError } from "../buffer-admission.js";
+import { createTaskExit } from "./task-exit.js";
 export { ReplayAdmissionRefusedError, StorageTargetRequiredError };
 
 export interface TurnIngestionDeps {
@@ -798,13 +799,7 @@ export class TurnIngestionCoordinator {
       abortSignal?: AbortSignal;
       /** Automatic buffered work only. Replay and import must not set this. */
       preemptable?: boolean;
-      /**
-       * Invoked when the queued closure has FULLY exited (after settlement).
-       * Settlement can fire before the closure exits — e.g. an abort listener
-       * settles while persistence is still in flight — so callers that
-       * release resources on settlement (claim leases) can use this to wait
-       * for the actual task exit first.
-       */
+      /** Fires once when the task is done: closure exited, or settled before it started. */
       onTaskExit?: () => void;
       /** Fail-closed force-flush only. Not implied by failOnExtractionFailure. */
       preemptRunning?: boolean;
@@ -845,6 +840,7 @@ export class TurnIngestionCoordinator {
         : undefined;
     let timeout: ReturnType<typeof setTimeout> | undefined;
     let settled = false;
+    const exit = createTaskExit(options.onTaskExit);
     const clearQueueWaitTimer = (): void => {
       if (timeout) {
         clearTimeout(timeout);
@@ -867,6 +863,7 @@ export class TurnIngestionCoordinator {
       clearQueueWaitTimer();
       clearAbortListener();
       options.onTaskSettled?.(error, result);
+      exit.settled();
       return true;
     };
     if (options.abortSignal) {
@@ -910,6 +907,7 @@ export class TurnIngestionCoordinator {
     const queuedTurnsSource: { chain: SnapshotChain } | { direct: BufferTurn[] } =
       sharingNode ? { chain: sharingNode } : { direct: turnsToExtract };
     const accepted = this.deps.extractionQueueCoordinator.enqueue(async (preemptHandle) => {
+      exit.start();
       try {
         await this.deps.extractionQueueCoordinator.runPreemptable(preemptHandle, preemptable, options.abortSignal, async (abortSignal) => {
       if (settled) return;
@@ -1094,13 +1092,13 @@ export class TurnIngestionCoordinator {
       });
       } finally {
         if (sharingNode) this.snapshotSharing.release(sharingNode);
-        options.onTaskExit?.();
+        exit.report();
       }
     }, { front: options.preemptRunning === true, key: bufferKey });
     if (!accepted) {
       if (sharingNode) this.snapshotSharing.release(sharingNode);
       settleTask(new Error("extraction queue is stopped"));
-      options.onTaskExit?.();
+      exit.report();
       return;
     }