acp-kernel 0.0.88 → 0.0.89-pr.315.262

package/dist/nudge-text.d.ts

@@ -3,6 +3,7 @@ import type { Prompts } from "./prompts.js";
 export type NudgeVoice = "gentle" | "emergency";
 export interface NudgePromptSections {
     efficiencyNote?: string | null;
+    pressureHeader?: string | null;
     emergencyHeader?: string | null;
     t2Guidance?: string | null;
     t3Guidance?: string | null;

package/dist/nudge-text.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"nudge-text.d.ts","sourceRoot":"","sources":["../src/nudge-text.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,iBAAiB,EAAE,cAAc,EAAiD,MAAM,YAAY,CAAC;AAElI,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAE5C,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,WAAW,CAAC;AAEhD,MAAM,WAAW,mBAAmB;IAClC,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,eAAe,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,UAAU,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;CACd;AAwDD,wBAAgB,YAAY,CAAC,YAAY,EAAE,iBAAiB,EAAE,EAAE,eAAe,EAAE,cAAc,EAAE,GAAG,MAAM,CAgFzG;AAiBD,wBAAgB,eAAe,CAAC,QAAQ,EAAE,aAAa,EAAE,OAAO,GAAE,OAAwB,EAAE,QAAQ,GAAE,mBAAwB,GAAG,aAAa,CAyE7I"}
+{"version":3,"file":"nudge-text.d.ts","sourceRoot":"","sources":["../src/nudge-text.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,iBAAiB,EAAE,cAAc,EAAiD,MAAM,YAAY,CAAC;AAElI,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAE5C,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,WAAW,CAAC;AAEhD,MAAM,WAAW,mBAAmB;IAClC,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B,eAAe,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,UAAU,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;CACd;AA6DD,wBAAgB,YAAY,CAAC,YAAY,EAAE,iBAAiB,EAAE,EAAE,eAAe,EAAE,cAAc,EAAE,GAAG,MAAM,CAgFzG;AAiBD,wBAAgB,eAAe,CAAC,QAAQ,EAAE,aAAa,EAAE,OAAO,GAAE,OAAwB,EAAE,QAAQ,GAAE,mBAAwB,GAAG,aAAa,CAiF7I"}

package/dist/panel/index.js

@@ -3,7 +3,7 @@ import {
   defaultCountTokens,
   formatRanges,
   viableRanges
-} from "../chunk-NUQZKPQS.js";
+} from "../chunk-OY6XYN4S.js";
 
 // src/panel/topic.ts
 function topicFallback(summary) {

package/dist/persist/index.js

@@ -25,6 +25,12 @@ var StateStore = class {
   writeChains = /* @__PURE__ */ new Map();
   /** id → absolute path, populated by writes and loadAll. */
   discovered = /* @__PURE__ */ new Map();
+  /** id → seq of the last COMMITTED write (sync or async). Async writers
+   *  capture the seq at snapshot time and re-check it inside their
+   *  synchronous commit block; a flushSync (or a newer committed write)
+   *  bumping the seq makes the stale in-flight write abort its commit
+   *  instead of clobbering the newer on-disk payload. */
+  commitSeq = /* @__PURE__ */ new Map();
   /** id → cumulative write-failure count, for rate-limited alerting. */
   failCounts = /* @__PURE__ */ new Map();
   /** Monotonic counter for unique temp filenames within a process. */
@@ -79,7 +85,9 @@ var StateStore = class {
   /** Synchronous flush for one id. Used where the caller cannot await
    *  (memory eviction, sync shutdown paths). Cancels any pending debounce
    *  timer. Returns true on success, false on failure — callers that use
-   *  the result to drop in-memory state must NOT drop it on failure. */
+   *  the result to drop in-memory state must NOT drop it on failure.
+   *  Committing bumps the per-id fence so a stale in-flight async write
+   *  cannot land its older payload after this returns. */
   flushSync(id, build) {
     if (!this.enabled) return true;
     const timer = this.timers.get(id);
@@ -119,6 +127,7 @@ var StateStore = class {
     if (!lastErr) {
       this.discovered.set(id, file);
       this.clearFailure(id);
+      this.bumpCommit(id);
       this.removeSpillSync(file);
       return true;
     }
@@ -135,6 +144,7 @@ var StateStore = class {
       }
     }
     if (spillPath) this.discovered.set(id, spillPath);
+    if (spillPath) this.bumpCommit(id);
     this.recordFailure(id, lastErr, spillPath);
     return spillPath !== null;
   }
@@ -230,6 +240,7 @@ var StateStore = class {
     this.pending.clear();
   }
   async writeInner(id, build) {
+    const baseSeq = this.commitSeq.get(id) ?? 0;
     let payload;
     try {
       payload = build();
@@ -245,9 +256,26 @@ var StateStore = class {
       try {
         await fsp.mkdir(path.dirname(file), { recursive: true });
         await fsp.writeFile(tmp, data);
-        await fsp.rename(tmp, file);
+        if ((this.commitSeq.get(id) ?? 0) !== baseSeq) {
+          await fsp.unlink(tmp).catch(() => {
+          });
+          return;
+        }
+        try {
+          fs.renameSync(tmp, file);
+        } catch (e) {
+          lastErr = e;
+          await fsp.unlink(tmp).catch(() => {
+          });
+          if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;
+          const { promise, resolve } = Promise.withResolvers();
+          setTimeout(resolve, this.backoffMs(attempt));
+          await promise;
+          continue;
+        }
         this.discovered.set(id, file);
         this.clearFailure(id);
+        this.commitSeq.set(id, baseSeq + 1);
         await this.removeSpill(file);
         return;
       } catch (e) {
@@ -260,12 +288,14 @@ var StateStore = class {
         await promise;
       }
     }
+    if ((this.commitSeq.get(id) ?? 0) !== baseSeq) return;
     const spill = this.spillPathFor(file);
     let spillPath = null;
     for (let attempt = 0; attempt < this.retryAttempts && spillPath === null; attempt++) {
       try {
         await fsp.mkdir(path.dirname(spill), { recursive: true });
-        await fsp.writeFile(spill, data);
+        if ((this.commitSeq.get(id) ?? 0) !== baseSeq) return;
+        fs.writeFileSync(spill, data);
         spillPath = spill;
       } catch (e) {
         if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;
@@ -274,7 +304,10 @@ var StateStore = class {
         await promise;
       }
     }
-    if (spillPath) this.discovered.set(id, spillPath);
+    if (spillPath) {
+      this.discovered.set(id, spillPath);
+      this.commitSeq.set(id, baseSeq + 1);
+    }
     this.recordFailure(id, lastErr, spillPath);
     throw lastErr;
   }
@@ -328,6 +361,12 @@ var StateStore = class {
     await fsp.unlink(this.spillPathFor(file)).catch(() => {
     });
   }
+  /** Advance the per-id commit fence after a successful synchronous
+   *  commit, fencing off any in-flight async write holding an older
+   *  snapshot. */
+  bumpCommit(id) {
+    this.commitSeq.set(id, (this.commitSeq.get(id) ?? 0) + 1);
+  }
   removeSpillSync(file) {
     try {
       fs.unlinkSync(this.spillPathFor(file));

package/dist/persist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/persist/store.ts","../../src/persist/state-merge.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport fs from \"node:fs\";\nimport fsp from \"node:fs/promises\";\nimport path from \"node:path\";\n\n/** Logger callback. Downstream routes it wherever it wants (file, stderr). */\nexport type PersistLogger = (level: \"info\" | \"warn\" | \"error\", msg: string) => void;\n\n/**\n * On-disk record shape. The store owns the envelope (version stamp, save\n * time, id) so atomicity and discovery can rely on it; the payload schema\n * is entirely downstream-owned. `payload` must be JSON-serializable.\n */\nexport interface PersistedEnvelope<T> {\n    version: number;\n    savedAt: number;\n    id: string;\n    payload: T;\n}\n\n/** A legacy (pre-envelope) record adopted on load. `version`/`savedAt`\n * preserve the source record's own stamps when present. */\nexport interface LegacyAdoption<T> {\n    id: string;\n    payload: T;\n    version?: number;\n    savedAt?: number;\n}\n\n/**\n * Optional record codec: transforms serialized envelopes between the store\n * and disk (e.g. compress and/or encrypt at rest). The store is\n * codec-agnostic — it hands `encode` the exact JSON string it would have\n * written and passes raw file bytes to `decode`, which must return that same\n * JSON string or throw, in which case the file is treated as corrupt\n * (skipped + logged) like any unreadable record. Format detection (magic\n * bytes, plaintext fallback for unencoded legacy files) is the codec's job,\n * so mixed trees of legacy plaintext and encoded files load fine.\n */\nexport interface StateStoreCodec {\n    encode(data: string): Buffer | string;\n    decode(buf: Buffer): string;\n}\n\nexport interface StateStoreOptions<T> {\n    /**\n     * Storage root. The kernel deliberately has NO default location: the\n     * downstream decides where state lives (CLI dir, XDG data dir, plugin\n     * dir, temp dir in tests). All records live under this directory.\n     */\n    dir: string;\n    /**\n     * Schema version stamped into every envelope. Owned by the downstream;\n     * bump it when the payload shape changes. The store itself never\n     * rejects a record over its version — migration policy belongs to the\n     * reader.\n     */\n    version: number;\n    /** Debounce window for scheduleSave, ms. Default 500. */\n    debounceMs?: number;\n    /** Default true. When false, all writes are silent no-ops and loads\n     *  return empty results. */\n    enabled?: boolean;\n    log?: PersistLogger;\n    /**\n     * Relative path (under `dir`) for a record, possibly namespaced into\n     * subdirectories (e.g. `openai/host-hash.json`). Default: flat\n     * `<sha256(id)[:24]>.json`.\n     *\n     * Because the path may depend on payload fields the store only learns\n     * at write time, single-record loads resolve namespaced files only\n     * after loadAll() has discovered them (or the store itself wrote\n     * them). The flat default name is always checked as a fallback, so\n     * downstreams using a custom relPath should call loadAll() at boot.\n     */\n    relPath?: (id: string, payload: T) => string;\n    /**\n     * Adopt records written by an older, pre-envelope schema. Receives the\n     * parsed JSON of any file that failed the envelope-shape check; return\n     * an adoption to load it as an envelope, or null to skip it. Adopted\n     * records are re-persisted in the current envelope format on the next\n     * dirty write — files migrate organically, and old files keep loading\n     * (same policy billion-context's proxy used for its v1→v3 migration).\n     */\n    legacy?: (parsed: unknown) => LegacyAdoption<T> | null;\n    /**\n     * Payload validation on load. Return false to skip a record (foreign\n     * schema, corrupt content). Default: envelope-shape check only\n     * (string id, non-null payload).\n     */\n    validate?: (envelope: PersistedEnvelope<T>) => boolean;\n    /**\n     * Optional codec applied around every write (canonical + spill) and\n     * read. See StateStoreCodec. Default: none — files are plain UTF-8 JSON.\n     */\n    codec?: StateStoreCodec;\n    /**\n     * Transient-write retry policy (Windows + hostile temp environments).\n     * The whole write cycle — mkdir, temp write, rename — is retried with\n     * exponential backoff when it fails with a TRANSIENT code: EPERM/EBUSY/\n     * EACCES (a lock held by AV scan, search indexer, SMB) or ENOENT/ENOTDIR\n     * (the temp file or its directory vanished between create and rename —\n     * observed on CI Windows runners where a sweeper deletes freshly\n     * created files under %TEMP%). The delay after attempt i is\n     * min(retryBaseMs * 2^i, retryMaxMs). Defaults (6 attempts, 50ms base,\n     * 1600ms cap) give a ~1.5s window per write path — long enough for most\n     * locks to release, short enough not to stall a sync flush. When the\n     * window is exhausted the write spills to a side file (see spillPath)\n     * instead of dropping the data.\n     */\n    retryAttempts?: number;\n    retryBaseMs?: number;\n    retryMaxMs?: number;\n}\n\n/**\n * Crash-safe, debounce-coalescing JSON state store. Mechanism only — lifted\n * from billion-context's proxy SessionStore and generalized:\n *\n * - atomic writes: temp file + rename, so a crash mid-write never leaves a\n *   truncated record (readers see either the old or the new file)\n * - whole-cycle retries with exponential backoff on transient fs failures:\n *   Windows locks (EPERM/EBUSY/EACCES from AV/indexer/SMB) and vanishing\n *   files/dirs (ENOENT/ENOTDIR — a sweeper deleting fresh temp files, seen\n *   on CI Windows runners); when the window is exhausted the record spills\n *   to a side file (`<name>.fb.json`) instead of being dropped, so a lock\n *   held by AV/indexer/SMB never silently loses session data\n * - per-id serialization so concurrent writeNow calls never interleave\n *   temp-file names or reorders writes\n * - debounced scheduleSave coalesces bursts into one write; the record is\n *   built at WRITE time from a builder, so late mutations are picked up\n * - optional record codec (compress/encrypt at rest): encode on every write,\n *   decode on every read; a decode failure is corrupt-file semantics\n * - loadAll skips `.tmp-*` orphans, corrupt JSON, and records whose\n *   filename does not match their id — one bad file never blocks boot; it\n *   reconciles a canonical record against its spill by savedAt (freshest wins)\n *\n * The store never deletes a record's data. On a successful canonical write it\n * removes a now-stale spill of the SAME id (a duplicate, not distinct data).\n * Session cleanup is a downstream policy decision (kernel position: persisted\n * state should not be deleted opportunistically).\n */\nexport class StateStore<T> {\n    readonly enabled: boolean;\n    private readonly dir: string;\n    private readonly version: number;\n    private readonly debounceMs: number;\n    private readonly log: PersistLogger;\n    private readonly legacyFn?: (parsed: unknown) => LegacyAdoption<T> | null;\n    private readonly relPathFn?: (id: string, payload: T) => string;\n    private readonly validateFn: (envelope: PersistedEnvelope<T>) => boolean;\n    private readonly codec?: StateStoreCodec;\n    private readonly retryAttempts: number;\n    private readonly retryBaseMs: number;\n    private readonly retryMaxMs: number;\n    private readonly timers = new Map<string, NodeJS.Timeout>();\n    private readonly pending = new Map<string, () => T>();\n    private readonly writeChains = new Map<string, Promise<void>>();\n    /** id → absolute path, populated by writes and loadAll. */\n    private readonly discovered = new Map<string, string>();\n    /** id → cumulative write-failure count, for rate-limited alerting. */\n    private readonly failCounts = new Map<string, number>();\n    /** Monotonic counter for unique temp filenames within a process. */\n    private tmpSeq = 0;\n\n    constructor(opts: StateStoreOptions<T>) {\n        this.dir = opts.dir;\n        this.version = opts.version;\n        this.debounceMs = opts.debounceMs ?? 500;\n        this.enabled = opts.enabled ?? true;\n        this.log = opts.log ?? ((_level, _msg) => {});\n        this.relPathFn = opts.relPath;\n        this.legacyFn = opts.legacy;\n        this.validateFn = opts.validate ?? defaultValidate;\n        this.codec = opts.codec;\n        this.retryAttempts = Math.max(1, opts.retryAttempts ?? 6);\n        this.retryBaseMs = Math.max(1, opts.retryBaseMs ?? 50);\n        this.retryMaxMs = Math.max(this.retryBaseMs, opts.retryMaxMs ?? 1600);\n    }\n\n    /** Debounced save. Coalesces bursts; the builder runs at write time, so\n     *  the freshest state is always persisted. Never throws. */\n    scheduleSave(id: string, build: () => T): void {\n        if (!this.enabled) return;\n        this.pending.set(id, build);\n        const existing = this.timers.get(id);\n        if (existing) return;\n        const timer = setTimeout(() => {\n            this.timers.delete(id);\n            const builder = this.pending.get(id);\n            this.pending.delete(id);\n            if (!builder) return;\n            // Errors are logged inside writeInner; swallowing here keeps a\n            // failed timer write from becoming an unhandledRejection.\n            void this.writeNow(id, builder).catch(() => {});\n        }, this.debounceMs);\n        timer.unref?.();\n        this.timers.set(id, timer);\n    }\n\n    /** Immediate save, serialized per id. Rejects on write failure; a\n     *  failing write never breaks the chain for the next one. */\n    async writeNow(id: string, build: () => T): Promise<void> {\n        if (!this.enabled) return;\n        // The previous promise may reject (disk full, EPERM) — catch so our\n        // chain doesn't break, then run our own write.\n        const prev = this.writeChains.get(id) ?? Promise.resolve();\n        const next = prev.catch(() => {}).then(() => this.writeInner(id, build));\n        this.writeChains.set(id, next);\n        // Clean up the chain entry once settled so the Map doesn't grow. The\n        // .catch() is load-bearing: .finally() returns a derived promise that\n        // nobody else holds — when the chain rejects it would surface as an\n        // unhandledRejection and crash the host on default Node settings.\n        next\n            .finally(() => {\n                if (this.writeChains.get(id) === next) this.writeChains.delete(id);\n            })\n            .catch(() => {});\n        return next;\n    }\n\n    /** Synchronous flush for one id. Used where the caller cannot await\n     *  (memory eviction, sync shutdown paths). Cancels any pending debounce\n     *  timer. Returns true on success, false on failure — callers that use\n     *  the result to drop in-memory state must NOT drop it on failure. */\n    flushSync(id: string, build: () => T): boolean {\n        if (!this.enabled) return true;\n        const timer = this.timers.get(id);\n        if (timer) {\n            clearTimeout(timer);\n            this.timers.delete(id);\n            this.pending.delete(id);\n        }\n        let payload: T;\n        try {\n            payload = build();\n        } catch (e) {\n            this.log(\"error\", `[persist] builder failed for ${id}: ${errText(e)}`);\n            return false;\n        }\n        const file = this.resolvePath(id, payload);\n        const data = this.serialize(id, payload);\n        let lastErr: unknown;\n        for (let attempt = 0; attempt < this.retryAttempts; attempt++) {\n            // Fresh temp name + mkdir per attempt — same reasoning as the\n            // async writeInner loop (delete-pending tombstones, swept dirs).\n            const tmp = this.tempPath(file);\n            try {\n                fs.mkdirSync(path.dirname(file), { recursive: true });\n                fs.writeFileSync(tmp, data);\n                fs.renameSync(tmp, file);\n                lastErr = undefined;\n                break;\n            } catch (e) {\n                lastErr = e;\n                try {\n                    fs.unlinkSync(tmp);\n                } catch {\n                    // temp never created or already gone\n                }\n                if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                // sync sleep (Atomics.wait) — backoff grows per attempt\n                Atomics.wait(new Int32Array(new SharedArrayBuffer(4)), 0, 0, this.backoffMs(attempt));\n            }\n        }\n        if (!lastErr) {\n            this.discovered.set(id, file);\n            this.clearFailure(id);\n            this.removeSpillSync(file);\n            return true;\n        }\n        // The canonical write outlived the retry window (Windows lock held by\n        // AV/indexer/SMB). Spill to a side file so the data still lands on\n        // disk instead of being dropped — loadAll picks the freshest of the\n        // canonical and the spill, with its own transient retry window.\n        const spill = this.spillPathFor(file);\n        let spillPath: string | null = null;\n        for (let attempt = 0; attempt < this.retryAttempts && spillPath === null; attempt++) {\n            try {\n                fs.mkdirSync(path.dirname(spill), { recursive: true });\n                fs.writeFileSync(spill, data);\n                spillPath = spill;\n            } catch (e) {\n                if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                Atomics.wait(new Int32Array(new SharedArrayBuffer(4)), 0, 0, this.backoffMs(attempt));\n            }\n        }\n        if (spillPath) this.discovered.set(id, spillPath);\n        this.recordFailure(id, lastErr, spillPath);\n        return spillPath !== null;\n    }\n\n    /** Load one record. Checks the discovered path (from a prior\n     *  write/loadAll), an optional relative-path hint, and the flat default\n     *  name. Returns null when absent, disabled, corrupt, or rejected by\n     *  validate. The hint covers namespaced records the store has not\n     *  discovered (e.g. an evicted session re-requested with its meta,\n     *  where the path depends on data the store cannot reconstruct from\n     *  the id alone). */\n    loadSync(id: string, hint?: string): PersistedEnvelope<T> | null {\n        if (!this.enabled) return null;\n        const candidates = [\n            this.discovered.get(id),\n            hint ? path.join(this.dir, hint) : undefined,\n            path.join(this.dir, flatFileNameFor(id)),\n        ];\n        for (const file of candidates) {\n            if (!file) continue;\n            const envelope = this.readEnvelope(file);\n            if (envelope && envelope.id === id) return envelope;\n        }\n        return null;\n    }\n\n    /** Load every record under dir. Populates the discovery map (enables\n     *  loadSync for namespaced relPaths). Skips corrupt files, `.tmp-*`\n     *  orphans, and records whose filename does not match their id — one\n     *  bad file never blocks boot. Never throws. */\n    async loadAll(): Promise<Map<string, PersistedEnvelope<T>>> {\n        const out = new Map<string, PersistedEnvelope<T>>();\n        if (!this.enabled) return out;\n        const files = await this.walkJsonFiles(this.dir);\n        for (const file of files) {\n            const envelope = this.readEnvelope(file);\n            if (!envelope) continue;\n            const base = path.basename(file);\n            const relBase = path.basename(this.relPathOf(envelope.id, envelope.payload));\n            const flatBase = flatFileNameFor(envelope.id);\n            // A file is a valid record for its envelope id when its name is the\n            // canonical name OR a spill (`.fb`) of the canonical name. This lets\n            // a spilled record (written while the canonical was locked) be\n            // discovered and reconciled against the canonical by savedAt.\n            let owner: string | null = null;\n            if (base === relBase || base === flatBase) {\n                owner = envelope.id;\n            } else if (base.endsWith(\".fb.json\")) {\n                const canonicalBase = `${base.slice(0, -\".fb.json\".length)}.json`;\n                if (canonicalBase === relBase || canonicalBase === flatBase) {\n                    owner = envelope.id;\n                }\n            }\n            if (owner === null) {\n                this.log(\"warn\", `[persist] skipping ${rel(file, this.dir)}: filename does not match record id`);\n                continue;\n            }\n            const existing = out.get(owner);\n            if (!existing || envelope.savedAt >= existing.savedAt) {\n                out.set(owner, envelope);\n                this.discovered.set(owner, file);\n            }\n        }\n        return out;\n    }\n\n    /** Whether a debounced write is pending for an id. */\n    hasPending(id: string): boolean {\n        return this.timers.has(id);\n    }\n\n    /** Ids with a pending debounced write. */\n    pendingIds(): string[] {\n        return [...this.timers.keys()];\n    }\n\n    /** Flush every pending debounced write immediately, then drain in-flight\n     *  writes. For graceful shutdown (SIGTERM/SIGINT). Never rejects. */\n    async flushAll(): Promise<void> {\n        const ids = this.pendingIds();\n        for (const timer of this.timers.values()) clearTimeout(timer);\n        this.timers.clear();\n        const builders = new Map<string, () => T>();\n        for (const id of ids) {\n            const build = this.pending.get(id);\n            if (build) builders.set(id, build);\n            this.pending.delete(id);\n        }\n        await Promise.all(\n            [...builders.entries()].map(([id, build]) =>\n                this.writeNow(id, build).catch((e) => {\n                    this.log(\"error\", `[persist] shutdown flush failed for ${id}: ${errText(e)}`);\n                }),\n            ),\n        );\n        // Drain writes whose timer fired earlier but are still mid-flight.\n        await Promise.allSettled([...this.writeChains.values()]);\n    }\n\n    /** Cancel all pending debounced writes without flushing (tests). */\n    cancelAll(): void {\n        for (const timer of this.timers.values()) clearTimeout(timer);\n        this.timers.clear();\n        this.pending.clear();\n    }\n\n    private async writeInner(id: string, build: () => T): Promise<void> {\n        let payload: T;\n        try {\n            payload = build();\n        } catch (e) {\n            this.log(\"error\", `[persist] builder failed for ${id}: ${errText(e)}`);\n            throw e;\n        }\n        const file = this.resolvePath(id, payload);\n        const data = this.serialize(id, payload);\n        let lastErr: unknown;\n        for (let attempt = 0; attempt < this.retryAttempts; attempt++) {\n            // Fresh temp name per attempt: on Windows a failed cleanup can\n            // leave the previous name delete-pending, and creating over a\n            // tombstoned name fails immediately — reusing it would burn every\n            // remaining attempt before the write even happens. mkdir runs per\n            // attempt too: a sweeper may have deleted the directory after the\n            // previous cycle created it.\n            const tmp = this.tempPath(file);\n            try {\n                await fsp.mkdir(path.dirname(file), { recursive: true });\n                await fsp.writeFile(tmp, data);\n                await fsp.rename(tmp, file);\n                this.discovered.set(id, file);\n                this.clearFailure(id);\n                await this.removeSpill(file);\n                return;\n            } catch (e) {\n                lastErr = e;\n                // Clean up the .tmp orphan so the next write doesn't collide\n                // with it.\n                await fsp.unlink(tmp).catch(() => {});\n                if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                const { promise, resolve } = Promise.withResolvers<void>();\n                setTimeout(resolve, this.backoffMs(attempt));\n                await promise;\n            }\n        }\n        // The canonical write outlived the retry window (Windows lock held\n        // by AV/indexer/SMB, or a sweeper keeps deleting the fresh temp).\n        // Spill to a side file so the data still lands on disk instead of\n        // being dropped — loadAll picks the freshest of the canonical and\n        // the spill. The spill write gets its own transient retry window for\n        // the same reason (observed failing with ENOENT alongside the\n        // canonical on CI Windows runners).\n        const spill = this.spillPathFor(file);\n        let spillPath: string | null = null;\n        for (let attempt = 0; attempt < this.retryAttempts && spillPath === null; attempt++) {\n            try {\n                await fsp.mkdir(path.dirname(spill), { recursive: true });\n                await fsp.writeFile(spill, data);\n                spillPath = spill;\n            } catch (e) {\n                if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                const { promise, resolve } = Promise.withResolvers<void>();\n                setTimeout(resolve, this.backoffMs(attempt));\n                await promise;\n            }\n        }\n        if (spillPath) this.discovered.set(id, spillPath);\n        this.recordFailure(id, lastErr, spillPath);\n        throw lastErr;\n    }\n\n    private envelope(id: string, payload: T): PersistedEnvelope<T> {\n        return { version: this.version, savedAt: Date.now(), id, payload };\n    }\n\n    /** Serialize an envelope for disk, applying the optional codec. Strings\n     *  are written as UTF-8 (the fs default); Buffer results pass through as\n     *  raw bytes. */\n    private serialize(id: string, payload: T): Buffer | string {\n        const json = JSON.stringify(this.envelope(id, payload));\n        return this.codec ? this.codec.encode(json) : json;\n    }\n\n    /** Absolute path for a record: custom relPath (guarded against path\n     *  escape) or the flat hash default. */\n    private resolvePath(id: string, payload: T): string {\n        return path.join(this.dir, this.relPathOf(id, payload));\n    }\n\n    private relPathOf(id: string, payload: T): string {\n        const custom = this.relPathFn?.(id, payload);\n        if (!custom) return flatFileNameFor(id);\n        const rel = path.normalize(custom);\n        if (path.isAbsolute(rel) || rel.split(/[\\\\/]+/).includes(\"..\")) {\n            this.log(\"warn\", `[persist] relPath for ${id} escapes dir; using flat name`);\n            return flatFileNameFor(id);\n        }\n        return rel;\n    }\n\n    /** Unique temp file next to the destination (same dir ⇒ same volume ⇒\n     *  rename is atomic). Prefixed `.tmp-` so loadAll skips orphans. */\n    private tempPath(dest: string): string {\n        const seq = this.tmpSeq++;\n        return path.join(path.dirname(dest), `.tmp-${path.basename(dest, \".json\")}-${process.pid}-${seq}`);\n    }\n\n    private backoffMs(attempt: number): number {\n        return Math.min(this.retryBaseMs * 2 ** attempt, this.retryMaxMs);\n    }\n\n    /** Side file for a record whose canonical write keeps failing: the\n     *  canonical name with a `.fb` (fallback) infix, e.g. `a.json` →\n     *  `a.fb.json`. One slot per id, overwritten on each spill, so a stuck\n     *  lock never accumulates files. Ends in `.json` so loadAll discovers it. */\n    private spillPathFor(file: string): string {\n        const base = path.basename(file);\n        const dot = base.lastIndexOf(\".\");\n        const stem = dot > 0 ? base.slice(0, dot) : base;\n        const ext = dot > 0 ? base.slice(dot) : \".json\";\n        return path.join(path.dirname(file), `${stem}.fb${ext}`);\n    }\n\n    /** Remove a stale spill after a successful canonical write (best-effort). */\n    private async removeSpill(file: string): Promise<void> {\n        await fsp.unlink(this.spillPathFor(file)).catch(() => {});\n    }\n\n    private removeSpillSync(file: string): void {\n        try {\n            fs.unlinkSync(this.spillPathFor(file));\n        } catch {\n            // no spill or still locked — loadAll reconciles by savedAt\n        }\n    }\n\n    /** Rate-limited failure alerting: log on the first failure and at each\n     *  power-of-two count (1,2,4,8,…), so a long lock yields ~log2(N) lines\n     *  instead of one per write. Includes the spill path so the operator can\n     *  see where the data landed. */\n    private recordFailure(id: string, err: unknown, spillPath: string | null): void {\n        const count = (this.failCounts.get(id) ?? 0) + 1;\n        this.failCounts.set(id, count);\n        const alertAt = count === 1 || (count >= 2 && (count & (count - 1)) === 0);\n        if (!alertAt) return;\n        const where = spillPath\n            ? `; data spilled to ${rel(spillPath, this.dir)}`\n            : \"; SPILLOVER ALSO FAILED — data at risk\";\n        this.log(count === 1 ? \"error\" : \"warn\", `[persist] write failed for ${id} (total ${count}x): ${errText(err)}${where}`);\n    }\n\n    private clearFailure(id: string): void {\n        this.failCounts.delete(id);\n    }\n\n    /** Parse + validate one file. Corrupt or invalid records return null\n     *  (logged) instead of throwing — load paths must never block boot. */\n    private readEnvelope(file: string): PersistedEnvelope<T> | null {\n        let parsed: unknown;\n        try {\n            const buf = fs.readFileSync(file);\n            const text = this.codec ? this.codec.decode(buf) : buf.toString(\"utf8\");\n            parsed = JSON.parse(text);\n        } catch (e) {\n            // A missing candidate path is an expected miss (loadSync probes);\n            // only genuinely unreadable/corrupt files get logged.\n            if ((e as NodeJS.ErrnoException).code !== \"ENOENT\") {\n                this.log(\"warn\", `[persist] skipping corrupt file ${rel(file, this.dir)}: ${errText(e)}`);\n            }\n            return null;\n        }\n        if (isEnvelopeLike(parsed)) {\n            if (!this.validateFn(parsed as PersistedEnvelope<T>)) {\n                this.log(\"warn\", `[persist] skipping invalid record ${rel(file, this.dir)}`);\n                return null;\n            }\n            return parsed as PersistedEnvelope<T>;\n        }\n        const adopted = this.adoptLegacy(parsed);\n        if (adopted) return adopted;\n        this.log(\"warn\", `[persist] skipping invalid record ${rel(file, this.dir)}`);\n        return null;\n    }\n\n    /** Wrap a legacy (pre-envelope) record as an envelope via the `legacy`\n     *  hook, then validate the adopted payload like any other. */\n    private adoptLegacy(parsed: unknown): PersistedEnvelope<T> | null {\n        const adoption = this.legacyFn ? this.legacyFn(parsed) : null;\n        if (!adoption || typeof adoption.id !== \"string\" || adoption.id.length === 0 || adoption.payload == null) {\n            return null;\n        }\n        const source = parsed as Partial<PersistedEnvelope<T>>;\n        const envelope: PersistedEnvelope<T> = {\n            version: adoption.version ?? source.version ?? this.version,\n            savedAt: adoption.savedAt ?? source.savedAt ?? 0,\n            id: adoption.id,\n            payload: adoption.payload,\n        };\n        if (!this.validateFn(envelope)) return null;\n        return envelope;\n    }\n\n    /** Iterative recursive walk (no readdir-recursive dependency), skipping\n     *  `.tmp-*` names and non-.json files. */\n    private async walkJsonFiles(root: string): Promise<string[]> {\n        const out: string[] = [];\n        const queue: string[] = [root];\n        while (queue.length > 0) {\n            const dir = queue.pop()!;\n            let dirents: fs.Dirent[];\n            try {\n                dirents = await fsp.readdir(dir, { withFileTypes: true });\n            } catch {\n                continue; // missing dir → no records yet\n            }\n            for (const d of dirents) {\n                if (d.name.startsWith(\".tmp-\")) continue;\n                const full = path.join(dir, d.name);\n                if (d.isDirectory()) queue.push(full);\n                else if (d.isFile() && d.name.endsWith(\".json\")) out.push(full);\n            }\n        }\n        return out;\n    }\n}\n\nfunction defaultValidate<T>(envelope: PersistedEnvelope<T>): boolean {\n    return typeof envelope.id === \"string\" && envelope.id.length > 0 && envelope.payload != null;\n}\n\nfunction isEnvelopeLike(value: unknown): value is PersistedEnvelope<unknown> {\n    if (!value || typeof value !== \"object\") return false;\n    const v = value as Partial<PersistedEnvelope<unknown>>;\n    return typeof v.id === \"string\" && \"payload\" in v;\n}\n\n/** Deterministic flat filename: `<sha256(id)[:24]>.json`. Truncated hash —\n *  96 bits keeps collisions unreachable for realistic id counts, and short\n *  names stay greppable. */\nexport function flatFileNameFor(id: string): string {\n    return createHash(\"sha256\").update(id, \"utf8\").digest(\"hex\").slice(0, 24) + \".json\";\n}\n\n/** Transient fs failure codes worth retrying the whole write cycle for:\n *  - EPERM/EBUSY/EACCES — a lock held on the file/dir (AV scan, search\n *    indexer, SMB); releases within the backoff window.\n *  - ENOENT/ENOTDIR — the temp file or its directory VANISHED between\n *    create and rename (a sweeper deleting fresh files under %TEMP%, seen\n *    on CI Windows runners), or a delete-pending tombstone from the same\n *    sweep. Recreating the dir + rewriting a fresh temp heals it. */\nfunction isTransientFsError(e: unknown): boolean {\n    const code = (e as NodeJS.ErrnoException).code;\n    return code === \"EPERM\" || code === \"EBUSY\" || code === \"EACCES\" || code === \"ENOENT\" || code === \"ENOTDIR\";\n}\n\nfunction errText(e: unknown): string {\n    return e instanceof Error ? e.message : String(e);\n}\n\n\nfunction rel(p: string, base: string): string {\n    const r = path.relative(base, p);\n    return r && !r.startsWith(\"..\") ? r : p;\n}\n","import type { CompressionState } from \"../types.js\";\nimport { createInitialState } from \"../state.js\";\n\n/**\n * Forward-compat: merge a parsed state with a fresh one so fields added in\n * later kernel versions get sane defaults instead of `undefined`. Nested\n * groups (nudge, stats) are shallow-merged per field so older snapshots\n * keep their values while newer counters default in.\n *\n * Lifted verbatim in behavior from billion-context's proxy mergeState.\n */\nexport function mergeCompressionState(parsed: CompressionState): CompressionState {\n  const fresh = createInitialState();\n  return {\n    blocks: parsed.blocks ?? fresh.blocks,\n    messageRefs: parsed.messageRefs ?? fresh.messageRefs,\n    nudge: { ...fresh.nudge, ...(parsed.nudge ?? {}) },\n    stats: { ...fresh.stats, ...(parsed.stats ?? {}) },\n    nextBlockId: parsed.nextBlockId ?? fresh.nextBlockId,\n    nextRunId: parsed.nextRunId ?? fresh.nextRunId,\n    tokenSnapshot: parsed.tokenSnapshot ?? fresh.tokenSnapshot,\n    absorbed: parsed.absorbed ?? fresh.absorbed,\n    rules: parsed.rules ?? fresh.rules,\n    nextRuleId: parsed.nextRuleId ?? fresh.nextRuleId,\n    terminalStreak: parsed.terminalStreak,\n    imageFullRestored: parsed.imageFullRestored ?? fresh.imageFullRestored,\n    imageShrinks: parsed.imageShrinks ?? fresh.imageShrinks,\n  };\n}\n"],"mappings":";;;;;AAAA,SAAS,kBAAkB;AAC3B,OAAO,QAAQ;AACf,OAAO,SAAS;AAChB,OAAO,UAAU;AA2IV,IAAM,aAAN,MAAoB;AAAA,EACd;AAAA,EACQ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAS,oBAAI,IAA4B;AAAA,EACzC,UAAU,oBAAI,IAAqB;AAAA,EACnC,cAAc,oBAAI,IAA2B;AAAA;AAAA,EAE7C,aAAa,oBAAI,IAAoB;AAAA;AAAA,EAErC,aAAa,oBAAI,IAAoB;AAAA;AAAA,EAE9C,SAAS;AAAA,EAEjB,YAAY,MAA4B;AACpC,SAAK,MAAM,KAAK;AAChB,SAAK,UAAU,KAAK;AACpB,SAAK,aAAa,KAAK,cAAc;AACrC,SAAK,UAAU,KAAK,WAAW;AAC/B,SAAK,MAAM,KAAK,QAAQ,CAAC,QAAQ,SAAS;AAAA,IAAC;AAC3C,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW,KAAK;AACrB,SAAK,aAAa,KAAK,YAAY;AACnC,SAAK,QAAQ,KAAK;AAClB,SAAK,gBAAgB,KAAK,IAAI,GAAG,KAAK,iBAAiB,CAAC;AACxD,SAAK,cAAc,KAAK,IAAI,GAAG,KAAK,eAAe,EAAE;AACrD,SAAK,aAAa,KAAK,IAAI,KAAK,aAAa,KAAK,cAAc,IAAI;AAAA,EACxE;AAAA;AAAA;AAAA,EAIA,aAAa,IAAY,OAAsB;AAC3C,QAAI,CAAC,KAAK,QAAS;AACnB,SAAK,QAAQ,IAAI,IAAI,KAAK;AAC1B,UAAM,WAAW,KAAK,OAAO,IAAI,EAAE;AACnC,QAAI,SAAU;AACd,UAAM,QAAQ,WAAW,MAAM;AAC3B,WAAK,OAAO,OAAO,EAAE;AACrB,YAAM,UAAU,KAAK,QAAQ,IAAI,EAAE;AACnC,WAAK,QAAQ,OAAO,EAAE;AACtB,UAAI,CAAC,QAAS;AAGd,WAAK,KAAK,SAAS,IAAI,OAAO,EAAE,MAAM,MAAM;AAAA,MAAC,CAAC;AAAA,IAClD,GAAG,KAAK,UAAU;AAClB,UAAM,QAAQ;AACd,SAAK,OAAO,IAAI,IAAI,KAAK;AAAA,EAC7B;AAAA;AAAA;AAAA,EAIA,MAAM,SAAS,IAAY,OAA+B;AACtD,QAAI,CAAC,KAAK,QAAS;AAGnB,UAAM,OAAO,KAAK,YAAY,IAAI,EAAE,KAAK,QAAQ,QAAQ;AACzD,UAAM,OAAO,KAAK,MAAM,MAAM;AAAA,IAAC,CAAC,EAAE,KAAK,MAAM,KAAK,WAAW,IAAI,KAAK,CAAC;AACvE,SAAK,YAAY,IAAI,IAAI,IAAI;AAK7B,SACK,QAAQ,MAAM;AACX,UAAI,KAAK,YAAY,IAAI,EAAE,MAAM,KAAM,MAAK,YAAY,OAAO,EAAE;AAAA,IACrE,CAAC,EACA,MAAM,MAAM;AAAA,IAAC,CAAC;AACnB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,IAAY,OAAyB;AAC3C,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,UAAM,QAAQ,KAAK,OAAO,IAAI,EAAE;AAChC,QAAI,OAAO;AACP,mBAAa,KAAK;AAClB,WAAK,OAAO,OAAO,EAAE;AACrB,WAAK,QAAQ,OAAO,EAAE;AAAA,IAC1B;AACA,QAAI;AACJ,QAAI;AACA,gBAAU,MAAM;AAAA,IACpB,SAAS,GAAG;AACR,WAAK,IAAI,SAAS,gCAAgC,EAAE,KAAK,QAAQ,CAAC,CAAC,EAAE;AACrE,aAAO;AAAA,IACX;AACA,UAAM,OAAO,KAAK,YAAY,IAAI,OAAO;AACzC,UAAM,OAAO,KAAK,UAAU,IAAI,OAAO;AACvC,QAAI;AACJ,aAAS,UAAU,GAAG,UAAU,KAAK,eAAe,WAAW;AAG3D,YAAM,MAAM,KAAK,SAAS,IAAI;AAC9B,UAAI;AACA,WAAG,UAAU,KAAK,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AACpD,WAAG,cAAc,KAAK,IAAI;AAC1B,WAAG,WAAW,KAAK,IAAI;AACvB,kBAAU;AACV;AAAA,MACJ,SAAS,GAAG;AACR,kBAAU;AACV,YAAI;AACA,aAAG,WAAW,GAAG;AAAA,QACrB,QAAQ;AAAA,QAER;AACA,YAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAElE,gBAAQ,KAAK,IAAI,WAAW,IAAI,kBAAkB,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,UAAU,OAAO,CAAC;AAAA,MACxF;AAAA,IACJ;AACA,QAAI,CAAC,SAAS;AACV,WAAK,WAAW,IAAI,IAAI,IAAI;AAC5B,WAAK,aAAa,EAAE;AACpB,WAAK,gBAAgB,IAAI;AACzB,aAAO;AAAA,IACX;AAKA,UAAM,QAAQ,KAAK,aAAa,IAAI;AACpC,QAAI,YAA2B;AAC/B,aAAS,UAAU,GAAG,UAAU,KAAK,iBAAiB,cAAc,MAAM,WAAW;AACjF,UAAI;AACA,WAAG,UAAU,KAAK,QAAQ,KAAK,GAAG,EAAE,WAAW,KAAK,CAAC;AACrD,WAAG,cAAc,OAAO,IAAI;AAC5B,oBAAY;AAAA,MAChB,SAAS,GAAG;AACR,YAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAClE,gBAAQ,KAAK,IAAI,WAAW,IAAI,kBAAkB,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,UAAU,OAAO,CAAC;AAAA,MACxF;AAAA,IACJ;AACA,QAAI,UAAW,MAAK,WAAW,IAAI,IAAI,SAAS;AAChD,SAAK,cAAc,IAAI,SAAS,SAAS;AACzC,WAAO,cAAc;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAAS,IAAY,MAA4C;AAC7D,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,UAAM,aAAa;AAAA,MACf,KAAK,WAAW,IAAI,EAAE;AAAA,MACtB,OAAO,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI;AAAA,MACnC,KAAK,KAAK,KAAK,KAAK,gBAAgB,EAAE,CAAC;AAAA,IAC3C;AACA,eAAW,QAAQ,YAAY;AAC3B,UAAI,CAAC,KAAM;AACX,YAAM,WAAW,KAAK,aAAa,IAAI;AACvC,UAAI,YAAY,SAAS,OAAO,GAAI,QAAO;AAAA,IAC/C;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAsD;AACxD,UAAM,MAAM,oBAAI,IAAkC;AAClD,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,UAAM,QAAQ,MAAM,KAAK,cAAc,KAAK,GAAG;AAC/C,eAAW,QAAQ,OAAO;AACtB,YAAM,WAAW,KAAK,aAAa,IAAI;AACvC,UAAI,CAAC,SAAU;AACf,YAAM,OAAO,KAAK,SAAS,IAAI;AAC/B,YAAM,UAAU,KAAK,SAAS,KAAK,UAAU,SAAS,IAAI,SAAS,OAAO,CAAC;AAC3E,YAAM,WAAW,gBAAgB,SAAS,EAAE;AAK5C,UAAI,QAAuB;AAC3B,UAAI,SAAS,WAAW,SAAS,UAAU;AACvC,gBAAQ,SAAS;AAAA,MACrB,WAAW,KAAK,SAAS,UAAU,GAAG;AAClC,cAAM,gBAAgB,GAAG,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,CAAC;AAC1D,YAAI,kBAAkB,WAAW,kBAAkB,UAAU;AACzD,kBAAQ,SAAS;AAAA,QACrB;AAAA,MACJ;AACA,UAAI,UAAU,MAAM;AAChB,aAAK,IAAI,QAAQ,sBAAsB,IAAI,MAAM,KAAK,GAAG,CAAC,qCAAqC;AAC/F;AAAA,MACJ;AACA,YAAM,WAAW,IAAI,IAAI,KAAK;AAC9B,UAAI,CAAC,YAAY,SAAS,WAAW,SAAS,SAAS;AACnD,YAAI,IAAI,OAAO,QAAQ;AACvB,aAAK,WAAW,IAAI,OAAO,IAAI;AAAA,MACnC;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,WAAW,IAAqB;AAC5B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC7B;AAAA;AAAA,EAGA,aAAuB;AACnB,WAAO,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC;AAAA,EACjC;AAAA;AAAA;AAAA,EAIA,MAAM,WAA0B;AAC5B,UAAM,MAAM,KAAK,WAAW;AAC5B,eAAW,SAAS,KAAK,OAAO,OAAO,EAAG,cAAa,KAAK;AAC5D,SAAK,OAAO,MAAM;AAClB,UAAM,WAAW,oBAAI,IAAqB;AAC1C,eAAW,MAAM,KAAK;AAClB,YAAM,QAAQ,KAAK,QAAQ,IAAI,EAAE;AACjC,UAAI,MAAO,UAAS,IAAI,IAAI,KAAK;AACjC,WAAK,QAAQ,OAAO,EAAE;AAAA,IAC1B;AACA,UAAM,QAAQ;AAAA,MACV,CAAC,GAAG,SAAS,QAAQ,CAAC,EAAE;AAAA,QAAI,CAAC,CAAC,IAAI,KAAK,MACnC,KAAK,SAAS,IAAI,KAAK,EAAE,MAAM,CAAC,MAAM;AAClC,eAAK,IAAI,SAAS,uCAAuC,EAAE,KAAK,QAAQ,CAAC,CAAC,EAAE;AAAA,QAChF,CAAC;AAAA,MACL;AAAA,IACJ;AAEA,UAAM,QAAQ,WAAW,CAAC,GAAG,KAAK,YAAY,OAAO,CAAC,CAAC;AAAA,EAC3D;AAAA;AAAA,EAGA,YAAkB;AACd,eAAW,SAAS,KAAK,OAAO,OAAO,EAAG,cAAa,KAAK;AAC5D,SAAK,OAAO,MAAM;AAClB,SAAK,QAAQ,MAAM;AAAA,EACvB;AAAA,EAEA,MAAc,WAAW,IAAY,OAA+B;AAChE,QAAI;AACJ,QAAI;AACA,gBAAU,MAAM;AAAA,IACpB,SAAS,GAAG;AACR,WAAK,IAAI,SAAS,gCAAgC,EAAE,KAAK,QAAQ,CAAC,CAAC,EAAE;AACrE,YAAM;AAAA,IACV;AACA,UAAM,OAAO,KAAK,YAAY,IAAI,OAAO;AACzC,UAAM,OAAO,KAAK,UAAU,IAAI,OAAO;AACvC,QAAI;AACJ,aAAS,UAAU,GAAG,UAAU,KAAK,eAAe,WAAW;AAO3D,YAAM,MAAM,KAAK,SAAS,IAAI;AAC9B,UAAI;AACA,cAAM,IAAI,MAAM,KAAK,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AACvD,cAAM,IAAI,UAAU,KAAK,IAAI;AAC7B,cAAM,IAAI,OAAO,KAAK,IAAI;AAC1B,aAAK,WAAW,IAAI,IAAI,IAAI;AAC5B,aAAK,aAAa,EAAE;AACpB,cAAM,KAAK,YAAY,IAAI;AAC3B;AAAA,MACJ,SAAS,GAAG;AACR,kBAAU;AAGV,cAAM,IAAI,OAAO,GAAG,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AACpC,YAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAClE,cAAM,EAAE,SAAS,QAAQ,IAAI,QAAQ,cAAoB;AACzD,mBAAW,SAAS,KAAK,UAAU,OAAO,CAAC;AAC3C,cAAM;AAAA,MACV;AAAA,IACJ;AAQA,UAAM,QAAQ,KAAK,aAAa,IAAI;AACpC,QAAI,YAA2B;AAC/B,aAAS,UAAU,GAAG,UAAU,KAAK,iBAAiB,cAAc,MAAM,WAAW;AACjF,UAAI;AACA,cAAM,IAAI,MAAM,KAAK,QAAQ,KAAK,GAAG,EAAE,WAAW,KAAK,CAAC;AACxD,cAAM,IAAI,UAAU,OAAO,IAAI;AAC/B,oBAAY;AAAA,MAChB,SAAS,GAAG;AACR,YAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAClE,cAAM,EAAE,SAAS,QAAQ,IAAI,QAAQ,cAAoB;AACzD,mBAAW,SAAS,KAAK,UAAU,OAAO,CAAC;AAC3C,cAAM;AAAA,MACV;AAAA,IACJ;AACA,QAAI,UAAW,MAAK,WAAW,IAAI,IAAI,SAAS;AAChD,SAAK,cAAc,IAAI,SAAS,SAAS;AACzC,UAAM;AAAA,EACV;AAAA,EAEQ,SAAS,IAAY,SAAkC;AAC3D,WAAO,EAAE,SAAS,KAAK,SAAS,SAAS,KAAK,IAAI,GAAG,IAAI,QAAQ;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA,EAKQ,UAAU,IAAY,SAA6B;AACvD,UAAM,OAAO,KAAK,UAAU,KAAK,SAAS,IAAI,OAAO,CAAC;AACtD,WAAO,KAAK,QAAQ,KAAK,MAAM,OAAO,IAAI,IAAI;AAAA,EAClD;AAAA;AAAA;AAAA,EAIQ,YAAY,IAAY,SAAoB;AAChD,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,UAAU,IAAI,OAAO,CAAC;AAAA,EAC1D;AAAA,EAEQ,UAAU,IAAY,SAAoB;AAC9C,UAAM,SAAS,KAAK,YAAY,IAAI,OAAO;AAC3C,QAAI,CAAC,OAAQ,QAAO,gBAAgB,EAAE;AACtC,UAAMA,OAAM,KAAK,UAAU,MAAM;AACjC,QAAI,KAAK,WAAWA,IAAG,KAAKA,KAAI,MAAM,QAAQ,EAAE,SAAS,IAAI,GAAG;AAC5D,WAAK,IAAI,QAAQ,yBAAyB,EAAE,+BAA+B;AAC3E,aAAO,gBAAgB,EAAE;AAAA,IAC7B;AACA,WAAOA;AAAA,EACX;AAAA;AAAA;AAAA,EAIQ,SAAS,MAAsB;AACnC,UAAM,MAAM,KAAK;AACjB,WAAO,KAAK,KAAK,KAAK,QAAQ,IAAI,GAAG,QAAQ,KAAK,SAAS,MAAM,OAAO,CAAC,IAAI,QAAQ,GAAG,IAAI,GAAG,EAAE;AAAA,EACrG;AAAA,EAEQ,UAAU,SAAyB;AACvC,WAAO,KAAK,IAAI,KAAK,cAAc,KAAK,SAAS,KAAK,UAAU;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,aAAa,MAAsB;AACvC,UAAM,OAAO,KAAK,SAAS,IAAI;AAC/B,UAAM,MAAM,KAAK,YAAY,GAAG;AAChC,UAAM,OAAO,MAAM,IAAI,KAAK,MAAM,GAAG,GAAG,IAAI;AAC5C,UAAM,MAAM,MAAM,IAAI,KAAK,MAAM,GAAG,IAAI;AACxC,WAAO,KAAK,KAAK,KAAK,QAAQ,IAAI,GAAG,GAAG,IAAI,MAAM,GAAG,EAAE;AAAA,EAC3D;AAAA;AAAA,EAGA,MAAc,YAAY,MAA6B;AACnD,UAAM,IAAI,OAAO,KAAK,aAAa,IAAI,CAAC,EAAE,MAAM,MAAM;AAAA,IAAC,CAAC;AAAA,EAC5D;AAAA,EAEQ,gBAAgB,MAAoB;AACxC,QAAI;AACA,SAAG,WAAW,KAAK,aAAa,IAAI,CAAC;AAAA,IACzC,QAAQ;AAAA,IAER;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,cAAc,IAAY,KAAc,WAAgC;AAC5E,UAAM,SAAS,KAAK,WAAW,IAAI,EAAE,KAAK,KAAK;AAC/C,SAAK,WAAW,IAAI,IAAI,KAAK;AAC7B,UAAM,UAAU,UAAU,KAAM,SAAS,MAAM,QAAS,QAAQ,OAAQ;AACxE,QAAI,CAAC,QAAS;AACd,UAAM,QAAQ,YACR,qBAAqB,IAAI,WAAW,KAAK,GAAG,CAAC,KAC7C;AACN,SAAK,IAAI,UAAU,IAAI,UAAU,QAAQ,8BAA8B,EAAE,WAAW,KAAK,OAAO,QAAQ,GAAG,CAAC,GAAG,KAAK,EAAE;AAAA,EAC1H;AAAA,EAEQ,aAAa,IAAkB;AACnC,SAAK,WAAW,OAAO,EAAE;AAAA,EAC7B;AAAA;AAAA;AAAA,EAIQ,aAAa,MAA2C;AAC5D,QAAI;AACJ,QAAI;AACA,YAAM,MAAM,GAAG,aAAa,IAAI;AAChC,YAAM,OAAO,KAAK,QAAQ,KAAK,MAAM,OAAO,GAAG,IAAI,IAAI,SAAS,MAAM;AACtE,eAAS,KAAK,MAAM,IAAI;AAAA,IAC5B,SAAS,GAAG;AAGR,UAAK,EAA4B,SAAS,UAAU;AAChD,aAAK,IAAI,QAAQ,mCAAmC,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,QAAQ,CAAC,CAAC,EAAE;AAAA,MAC5F;AACA,aAAO;AAAA,IACX;AACA,QAAI,eAAe,MAAM,GAAG;AACxB,UAAI,CAAC,KAAK,WAAW,MAA8B,GAAG;AAClD,aAAK,IAAI,QAAQ,qCAAqC,IAAI,MAAM,KAAK,GAAG,CAAC,EAAE;AAC3E,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AACA,UAAM,UAAU,KAAK,YAAY,MAAM;AACvC,QAAI,QAAS,QAAO;AACpB,SAAK,IAAI,QAAQ,qCAAqC,IAAI,MAAM,KAAK,GAAG,CAAC,EAAE;AAC3E,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAIQ,YAAY,QAA8C;AAC9D,UAAM,WAAW,KAAK,WAAW,KAAK,SAAS,MAAM,IAAI;AACzD,QAAI,CAAC,YAAY,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,WAAW,KAAK,SAAS,WAAW,MAAM;AACtG,aAAO;AAAA,IACX;AACA,UAAM,SAAS;AACf,UAAM,WAAiC;AAAA,MACnC,SAAS,SAAS,WAAW,OAAO,WAAW,KAAK;AAAA,MACpD,SAAS,SAAS,WAAW,OAAO,WAAW;AAAA,MAC/C,IAAI,SAAS;AAAA,MACb,SAAS,SAAS;AAAA,IACtB;AACA,QAAI,CAAC,KAAK,WAAW,QAAQ,EAAG,QAAO;AACvC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAIA,MAAc,cAAc,MAAiC;AACzD,UAAM,MAAgB,CAAC;AACvB,UAAM,QAAkB,CAAC,IAAI;AAC7B,WAAO,MAAM,SAAS,GAAG;AACrB,YAAM,MAAM,MAAM,IAAI;AACtB,UAAI;AACJ,UAAI;AACA,kBAAU,MAAM,IAAI,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,MAC5D,QAAQ;AACJ;AAAA,MACJ;AACA,iBAAW,KAAK,SAAS;AACrB,YAAI,EAAE,KAAK,WAAW,OAAO,EAAG;AAChC,cAAM,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI;AAClC,YAAI,EAAE,YAAY,EAAG,OAAM,KAAK,IAAI;AAAA,iBAC3B,EAAE,OAAO,KAAK,EAAE,KAAK,SAAS,OAAO,EAAG,KAAI,KAAK,IAAI;AAAA,MAClE;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AAEA,SAAS,gBAAmB,UAAyC;AACjE,SAAO,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,SAAS,KAAK,SAAS,WAAW;AAC5F;AAEA,SAAS,eAAe,OAAqD;AACzE,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,IAAI;AACV,SAAO,OAAO,EAAE,OAAO,YAAY,aAAa;AACpD;AAKO,SAAS,gBAAgB,IAAoB;AAChD,SAAO,WAAW,QAAQ,EAAE,OAAO,IAAI,MAAM,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE,IAAI;AAChF;AASA,SAAS,mBAAmB,GAAqB;AAC7C,QAAM,OAAQ,EAA4B;AAC1C,SAAO,SAAS,WAAW,SAAS,WAAW,SAAS,YAAY,SAAS,YAAY,SAAS;AACtG;AAEA,SAAS,QAAQ,GAAoB;AACjC,SAAO,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;AACpD;AAGA,SAAS,IAAI,GAAW,MAAsB;AAC1C,QAAM,IAAI,KAAK,SAAS,MAAM,CAAC;AAC/B,SAAO,KAAK,CAAC,EAAE,WAAW,IAAI,IAAI,IAAI;AAC1C;;;AC/nBO,SAAS,sBAAsB,QAA4C;AAChF,QAAM,QAAQ,mBAAmB;AACjC,SAAO;AAAA,IACL,QAAQ,OAAO,UAAU,MAAM;AAAA,IAC/B,aAAa,OAAO,eAAe,MAAM;AAAA,IACzC,OAAO,EAAE,GAAG,MAAM,OAAO,GAAI,OAAO,SAAS,CAAC,EAAG;AAAA,IACjD,OAAO,EAAE,GAAG,MAAM,OAAO,GAAI,OAAO,SAAS,CAAC,EAAG;AAAA,IACjD,aAAa,OAAO,eAAe,MAAM;AAAA,IACzC,WAAW,OAAO,aAAa,MAAM;AAAA,IACrC,eAAe,OAAO,iBAAiB,MAAM;AAAA,IAC7C,UAAU,OAAO,YAAY,MAAM;AAAA,IACnC,OAAO,OAAO,SAAS,MAAM;AAAA,IAC7B,YAAY,OAAO,cAAc,MAAM;AAAA,IACvC,gBAAgB,OAAO;AAAA,IACvB,mBAAmB,OAAO,qBAAqB,MAAM;AAAA,IACrD,cAAc,OAAO,gBAAgB,MAAM;AAAA,EAC7C;AACF;","names":["rel"]}
+{"version":3,"sources":["../../src/persist/store.ts","../../src/persist/state-merge.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport fs from \"node:fs\";\nimport fsp from \"node:fs/promises\";\nimport path from \"node:path\";\n\n/** Logger callback. Downstream routes it wherever it wants (file, stderr). */\nexport type PersistLogger = (level: \"info\" | \"warn\" | \"error\", msg: string) => void;\n\n/**\n * On-disk record shape. The store owns the envelope (version stamp, save\n * time, id) so atomicity and discovery can rely on it; the payload schema\n * is entirely downstream-owned. `payload` must be JSON-serializable.\n */\nexport interface PersistedEnvelope<T> {\n    version: number;\n    savedAt: number;\n    id: string;\n    payload: T;\n}\n\n/** A legacy (pre-envelope) record adopted on load. `version`/`savedAt`\n * preserve the source record's own stamps when present. */\nexport interface LegacyAdoption<T> {\n    id: string;\n    payload: T;\n    version?: number;\n    savedAt?: number;\n}\n\n/**\n * Optional record codec: transforms serialized envelopes between the store\n * and disk (e.g. compress and/or encrypt at rest). The store is\n * codec-agnostic — it hands `encode` the exact JSON string it would have\n * written and passes raw file bytes to `decode`, which must return that same\n * JSON string or throw, in which case the file is treated as corrupt\n * (skipped + logged) like any unreadable record. Format detection (magic\n * bytes, plaintext fallback for unencoded legacy files) is the codec's job,\n * so mixed trees of legacy plaintext and encoded files load fine.\n */\nexport interface StateStoreCodec {\n    encode(data: string): Buffer | string;\n    decode(buf: Buffer): string;\n}\n\nexport interface StateStoreOptions<T> {\n    /**\n     * Storage root. The kernel deliberately has NO default location: the\n     * downstream decides where state lives (CLI dir, XDG data dir, plugin\n     * dir, temp dir in tests). All records live under this directory.\n     */\n    dir: string;\n    /**\n     * Schema version stamped into every envelope. Owned by the downstream;\n     * bump it when the payload shape changes. The store itself never\n     * rejects a record over its version — migration policy belongs to the\n     * reader.\n     */\n    version: number;\n    /** Debounce window for scheduleSave, ms. Default 500. */\n    debounceMs?: number;\n    /** Default true. When false, all writes are silent no-ops and loads\n     *  return empty results. */\n    enabled?: boolean;\n    log?: PersistLogger;\n    /**\n     * Relative path (under `dir`) for a record, possibly namespaced into\n     * subdirectories (e.g. `openai/host-hash.json`). Default: flat\n     * `<sha256(id)[:24]>.json`.\n     *\n     * Because the path may depend on payload fields the store only learns\n     * at write time, single-record loads resolve namespaced files only\n     * after loadAll() has discovered them (or the store itself wrote\n     * them). The flat default name is always checked as a fallback, so\n     * downstreams using a custom relPath should call loadAll() at boot.\n     */\n    relPath?: (id: string, payload: T) => string;\n    /**\n     * Adopt records written by an older, pre-envelope schema. Receives the\n     * parsed JSON of any file that failed the envelope-shape check; return\n     * an adoption to load it as an envelope, or null to skip it. Adopted\n     * records are re-persisted in the current envelope format on the next\n     * dirty write — files migrate organically, and old files keep loading\n     * (same policy billion-context's proxy used for its v1→v3 migration).\n     */\n    legacy?: (parsed: unknown) => LegacyAdoption<T> | null;\n    /**\n     * Payload validation on load. Return false to skip a record (foreign\n     * schema, corrupt content). Default: envelope-shape check only\n     * (string id, non-null payload).\n     */\n    validate?: (envelope: PersistedEnvelope<T>) => boolean;\n    /**\n     * Optional codec applied around every write (canonical + spill) and\n     * read. See StateStoreCodec. Default: none — files are plain UTF-8 JSON.\n     */\n    codec?: StateStoreCodec;\n    /**\n     * Transient-write retry policy (Windows + hostile temp environments).\n     * The whole write cycle — mkdir, temp write, rename — is retried with\n     * exponential backoff when it fails with a TRANSIENT code: EPERM/EBUSY/\n     * EACCES (a lock held by AV scan, search indexer, SMB) or ENOENT/ENOTDIR\n     * (the temp file or its directory vanished between create and rename —\n     * observed on CI Windows runners where a sweeper deletes freshly\n     * created files under %TEMP%). The delay after attempt i is\n     * min(retryBaseMs * 2^i, retryMaxMs). Defaults (6 attempts, 50ms base,\n     * 1600ms cap) give a ~1.5s window per write path — long enough for most\n     * locks to release, short enough not to stall a sync flush. When the\n     * window is exhausted the write spills to a side file (see spillPath)\n     * instead of dropping the data.\n     */\n    retryAttempts?: number;\n    retryBaseMs?: number;\n    retryMaxMs?: number;\n}\n\n/**\n * Crash-safe, debounce-coalescing JSON state store. Mechanism only — lifted\n * from billion-context's proxy SessionStore and generalized:\n *\n * - atomic writes: temp file + rename, so a crash mid-write never leaves a\n *   truncated record (readers see either the old or the new file)\n * - whole-cycle retries with exponential backoff on transient fs failures:\n *   Windows locks (EPERM/EBUSY/EACCES from AV/indexer/SMB) and vanishing\n *   files/dirs (ENOENT/ENOTDIR — a sweeper deleting fresh temp files, seen\n *   on CI Windows runners); when the window is exhausted the record spills\n *   to a side file (`<name>.fb.json`) instead of being dropped, so a lock\n *   held by AV/indexer/SMB never silently loses session data\n * - per-id serialization so concurrent writeNow calls never interleave\n *   temp-file names or reorders writes\n * - debounced scheduleSave coalesces bursts into one write; the record is\n *   built at WRITE time from a builder, so late mutations are picked up\n * - optional record codec (compress/encrypt at rest): encode on every write,\n *   decode on every read; a decode failure is corrupt-file semantics\n * - loadAll skips `.tmp-*` orphans, corrupt JSON, and records whose\n *   filename does not match their id — one bad file never blocks boot; it\n *   reconciles a canonical record against its spill by savedAt (freshest wins)\n *\n * The store never deletes a record's data. On a successful canonical write it\n * removes a now-stale spill of the SAME id (a duplicate, not distinct data).\n * Session cleanup is a downstream policy decision (kernel position: persisted\n * state should not be deleted opportunistically).\n */\nexport class StateStore<T> {\n    readonly enabled: boolean;\n    private readonly dir: string;\n    private readonly version: number;\n    private readonly debounceMs: number;\n    private readonly log: PersistLogger;\n    private readonly legacyFn?: (parsed: unknown) => LegacyAdoption<T> | null;\n    private readonly relPathFn?: (id: string, payload: T) => string;\n    private readonly validateFn: (envelope: PersistedEnvelope<T>) => boolean;\n    private readonly codec?: StateStoreCodec;\n    private readonly retryAttempts: number;\n    private readonly retryBaseMs: number;\n    private readonly retryMaxMs: number;\n    private readonly timers = new Map<string, NodeJS.Timeout>();\n    private readonly pending = new Map<string, () => T>();\n    private readonly writeChains = new Map<string, Promise<void>>();\n    /** id → absolute path, populated by writes and loadAll. */\n    private readonly discovered = new Map<string, string>();\n    /** id → seq of the last COMMITTED write (sync or async). Async writers\n     *  capture the seq at snapshot time and re-check it inside their\n     *  synchronous commit block; a flushSync (or a newer committed write)\n     *  bumping the seq makes the stale in-flight write abort its commit\n     *  instead of clobbering the newer on-disk payload. */\n    private readonly commitSeq = new Map<string, number>();\n    /** id → cumulative write-failure count, for rate-limited alerting. */\n    private readonly failCounts = new Map<string, number>();\n    /** Monotonic counter for unique temp filenames within a process. */\n    private tmpSeq = 0;\n\n    constructor(opts: StateStoreOptions<T>) {\n        this.dir = opts.dir;\n        this.version = opts.version;\n        this.debounceMs = opts.debounceMs ?? 500;\n        this.enabled = opts.enabled ?? true;\n        this.log = opts.log ?? ((_level, _msg) => {});\n        this.relPathFn = opts.relPath;\n        this.legacyFn = opts.legacy;\n        this.validateFn = opts.validate ?? defaultValidate;\n        this.codec = opts.codec;\n        this.retryAttempts = Math.max(1, opts.retryAttempts ?? 6);\n        this.retryBaseMs = Math.max(1, opts.retryBaseMs ?? 50);\n        this.retryMaxMs = Math.max(this.retryBaseMs, opts.retryMaxMs ?? 1600);\n    }\n\n    /** Debounced save. Coalesces bursts; the builder runs at write time, so\n     *  the freshest state is always persisted. Never throws. */\n    scheduleSave(id: string, build: () => T): void {\n        if (!this.enabled) return;\n        this.pending.set(id, build);\n        const existing = this.timers.get(id);\n        if (existing) return;\n        const timer = setTimeout(() => {\n            this.timers.delete(id);\n            const builder = this.pending.get(id);\n            this.pending.delete(id);\n            if (!builder) return;\n            // Errors are logged inside writeInner; swallowing here keeps a\n            // failed timer write from becoming an unhandledRejection.\n            void this.writeNow(id, builder).catch(() => {});\n        }, this.debounceMs);\n        timer.unref?.();\n        this.timers.set(id, timer);\n    }\n\n    /** Immediate save, serialized per id. Rejects on write failure; a\n     *  failing write never breaks the chain for the next one. */\n    async writeNow(id: string, build: () => T): Promise<void> {\n        if (!this.enabled) return;\n        // The previous promise may reject (disk full, EPERM) — catch so our\n        // chain doesn't break, then run our own write.\n        const prev = this.writeChains.get(id) ?? Promise.resolve();\n        const next = prev.catch(() => {}).then(() => this.writeInner(id, build));\n        this.writeChains.set(id, next);\n        // Clean up the chain entry once settled so the Map doesn't grow. The\n        // .catch() is load-bearing: .finally() returns a derived promise that\n        // nobody else holds — when the chain rejects it would surface as an\n        // unhandledRejection and crash the host on default Node settings.\n        next\n            .finally(() => {\n                if (this.writeChains.get(id) === next) this.writeChains.delete(id);\n            })\n            .catch(() => {});\n        return next;\n    }\n\n    /** Synchronous flush for one id. Used where the caller cannot await\n     *  (memory eviction, sync shutdown paths). Cancels any pending debounce\n     *  timer. Returns true on success, false on failure — callers that use\n     *  the result to drop in-memory state must NOT drop it on failure.\n     *  Committing bumps the per-id fence so a stale in-flight async write\n     *  cannot land its older payload after this returns. */\n    flushSync(id: string, build: () => T): boolean {\n        if (!this.enabled) return true;\n        const timer = this.timers.get(id);\n        if (timer) {\n            clearTimeout(timer);\n            this.timers.delete(id);\n            this.pending.delete(id);\n        }\n        let payload: T;\n        try {\n            payload = build();\n        } catch (e) {\n            this.log(\"error\", `[persist] builder failed for ${id}: ${errText(e)}`);\n            return false;\n        }\n        const file = this.resolvePath(id, payload);\n        const data = this.serialize(id, payload);\n        let lastErr: unknown;\n        for (let attempt = 0; attempt < this.retryAttempts; attempt++) {\n            // Fresh temp name + mkdir per attempt — same reasoning as the\n            // async writeInner loop (delete-pending tombstones, swept dirs).\n            const tmp = this.tempPath(file);\n            try {\n                fs.mkdirSync(path.dirname(file), { recursive: true });\n                fs.writeFileSync(tmp, data);\n                fs.renameSync(tmp, file);\n                lastErr = undefined;\n                break;\n            } catch (e) {\n                lastErr = e;\n                try {\n                    fs.unlinkSync(tmp);\n                } catch {\n                    // temp never created or already gone\n                }\n                if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                // sync sleep (Atomics.wait) — backoff grows per attempt\n                Atomics.wait(new Int32Array(new SharedArrayBuffer(4)), 0, 0, this.backoffMs(attempt));\n            }\n        }\n        if (!lastErr) {\n            this.discovered.set(id, file);\n            this.clearFailure(id);\n            this.bumpCommit(id);\n            this.removeSpillSync(file);\n            return true;\n        }\n        // The canonical write outlived the retry window (Windows lock held by\n        // AV/indexer/SMB). Spill to a side file so the data still lands on\n        // disk instead of being dropped — loadAll picks the freshest of the\n        // canonical and the spill, with its own transient retry window.\n        const spill = this.spillPathFor(file);\n        let spillPath: string | null = null;\n        for (let attempt = 0; attempt < this.retryAttempts && spillPath === null; attempt++) {\n            try {\n                fs.mkdirSync(path.dirname(spill), { recursive: true });\n                fs.writeFileSync(spill, data);\n                spillPath = spill;\n            } catch (e) {\n                if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                Atomics.wait(new Int32Array(new SharedArrayBuffer(4)), 0, 0, this.backoffMs(attempt));\n            }\n        }\n        if (spillPath) this.discovered.set(id, spillPath);\n        if (spillPath) this.bumpCommit(id);\n        this.recordFailure(id, lastErr, spillPath);\n        return spillPath !== null;\n    }\n\n    /** Load one record. Checks the discovered path (from a prior\n     *  write/loadAll), an optional relative-path hint, and the flat default\n     *  name. Returns null when absent, disabled, corrupt, or rejected by\n     *  validate. The hint covers namespaced records the store has not\n     *  discovered (e.g. an evicted session re-requested with its meta,\n     *  where the path depends on data the store cannot reconstruct from\n     *  the id alone). */\n    loadSync(id: string, hint?: string): PersistedEnvelope<T> | null {\n        if (!this.enabled) return null;\n        const candidates = [\n            this.discovered.get(id),\n            hint ? path.join(this.dir, hint) : undefined,\n            path.join(this.dir, flatFileNameFor(id)),\n        ];\n        for (const file of candidates) {\n            if (!file) continue;\n            const envelope = this.readEnvelope(file);\n            if (envelope && envelope.id === id) return envelope;\n        }\n        return null;\n    }\n\n    /** Load every record under dir. Populates the discovery map (enables\n     *  loadSync for namespaced relPaths). Skips corrupt files, `.tmp-*`\n     *  orphans, and records whose filename does not match their id — one\n     *  bad file never blocks boot. Never throws. */\n    async loadAll(): Promise<Map<string, PersistedEnvelope<T>>> {\n        const out = new Map<string, PersistedEnvelope<T>>();\n        if (!this.enabled) return out;\n        const files = await this.walkJsonFiles(this.dir);\n        for (const file of files) {\n            const envelope = this.readEnvelope(file);\n            if (!envelope) continue;\n            const base = path.basename(file);\n            const relBase = path.basename(this.relPathOf(envelope.id, envelope.payload));\n            const flatBase = flatFileNameFor(envelope.id);\n            // A file is a valid record for its envelope id when its name is the\n            // canonical name OR a spill (`.fb`) of the canonical name. This lets\n            // a spilled record (written while the canonical was locked) be\n            // discovered and reconciled against the canonical by savedAt.\n            let owner: string | null = null;\n            if (base === relBase || base === flatBase) {\n                owner = envelope.id;\n            } else if (base.endsWith(\".fb.json\")) {\n                const canonicalBase = `${base.slice(0, -\".fb.json\".length)}.json`;\n                if (canonicalBase === relBase || canonicalBase === flatBase) {\n                    owner = envelope.id;\n                }\n            }\n            if (owner === null) {\n                this.log(\"warn\", `[persist] skipping ${rel(file, this.dir)}: filename does not match record id`);\n                continue;\n            }\n            const existing = out.get(owner);\n            if (!existing || envelope.savedAt >= existing.savedAt) {\n                out.set(owner, envelope);\n                this.discovered.set(owner, file);\n            }\n        }\n        return out;\n    }\n\n    /** Whether a debounced write is pending for an id. */\n    hasPending(id: string): boolean {\n        return this.timers.has(id);\n    }\n\n    /** Ids with a pending debounced write. */\n    pendingIds(): string[] {\n        return [...this.timers.keys()];\n    }\n\n    /** Flush every pending debounced write immediately, then drain in-flight\n     *  writes. For graceful shutdown (SIGTERM/SIGINT). Never rejects. */\n    async flushAll(): Promise<void> {\n        const ids = this.pendingIds();\n        for (const timer of this.timers.values()) clearTimeout(timer);\n        this.timers.clear();\n        const builders = new Map<string, () => T>();\n        for (const id of ids) {\n            const build = this.pending.get(id);\n            if (build) builders.set(id, build);\n            this.pending.delete(id);\n        }\n        await Promise.all(\n            [...builders.entries()].map(([id, build]) =>\n                this.writeNow(id, build).catch((e) => {\n                    this.log(\"error\", `[persist] shutdown flush failed for ${id}: ${errText(e)}`);\n                }),\n            ),\n        );\n        // Drain writes whose timer fired earlier but are still mid-flight.\n        await Promise.allSettled([...this.writeChains.values()]);\n    }\n\n    /** Cancel all pending debounced writes without flushing (tests). */\n    cancelAll(): void {\n        for (const timer of this.timers.values()) clearTimeout(timer);\n        this.timers.clear();\n        this.pending.clear();\n    }\n\n    private async writeInner(id: string, build: () => T): Promise<void> {\n        // Fence point, captured BEFORE build(): from here on, any write that\n        // commits (a flushSync re-entering from inside build(), or a newer\n        // chained write) bumps the seq and this snapshot is stale.\n        const baseSeq = this.commitSeq.get(id) ?? 0;\n        let payload: T;\n        try {\n            payload = build();\n        } catch (e) {\n            this.log(\"error\", `[persist] builder failed for ${id}: ${errText(e)}`);\n            throw e;\n        }\n        const file = this.resolvePath(id, payload);\n        const data = this.serialize(id, payload);\n        let lastErr: unknown;\n        for (let attempt = 0; attempt < this.retryAttempts; attempt++) {\n            // Fresh temp name per attempt: on Windows a failed cleanup can\n            // leave the previous name delete-pending, and creating over a\n            // tombstoned name fails immediately — reusing it would burn every\n            // remaining attempt before the write even happens. mkdir runs per\n            // attempt too: a sweeper may have deleted the directory after the\n            // previous cycle created it.\n            const tmp = this.tempPath(file);\n            try {\n                await fsp.mkdir(path.dirname(file), { recursive: true });\n                await fsp.writeFile(tmp, data);\n                // Commit block: fence check + rename in one synchronous run\n                // — the event loop cannot interleave a flushSync between the\n                // check and the rename, so a stale payload can never land\n                // after a newer committed write.\n                if ((this.commitSeq.get(id) ?? 0) !== baseSeq) {\n                    await fsp.unlink(tmp).catch(() => {});\n                    return;\n                }\n                try {\n                    fs.renameSync(tmp, file);\n                } catch (e) {\n                    lastErr = e;\n                    await fsp.unlink(tmp).catch(() => {});\n                    if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                    const { promise, resolve } = Promise.withResolvers<void>();\n                    setTimeout(resolve, this.backoffMs(attempt));\n                    await promise;\n                    continue;\n                }\n                this.discovered.set(id, file);\n                this.clearFailure(id);\n                this.commitSeq.set(id, baseSeq + 1);\n                await this.removeSpill(file);\n                return;\n            } catch (e) {\n                lastErr = e;\n                // Clean up the .tmp orphan so the next write doesn't collide\n                // with it.\n                await fsp.unlink(tmp).catch(() => {});\n                if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                const { promise, resolve } = Promise.withResolvers<void>();\n                setTimeout(resolve, this.backoffMs(attempt));\n                await promise;\n            }\n        }\n        // Fenced off before spilling: a newer committed write already owns\n        // the disk record for this id — the stale payload is dropped, not\n        // spilled (its spill would clobber the newer spill on the same slot).\n        if ((this.commitSeq.get(id) ?? 0) !== baseSeq) return;\n        // The canonical write outlived the retry window (Windows lock held\n        // by AV/indexer/SMB, or a sweeper keeps deleting the fresh temp).\n        // Spill to a side file so the data still lands on disk instead of\n        // being dropped — loadAll picks the freshest of the canonical and\n        // the spill. The spill write gets its own transient retry window for\n        // the same reason (observed failing with ENOENT alongside the\n        // canonical on CI Windows runners).\n        const spill = this.spillPathFor(file);\n        let spillPath: string | null = null;\n        for (let attempt = 0; attempt < this.retryAttempts && spillPath === null; attempt++) {\n            try {\n                await fsp.mkdir(path.dirname(spill), { recursive: true });\n                // Fence + write synchronously: the spill slot is shared per\n                // id, so a late-landing stale spill would overwrite a newer\n                // spill exactly like the canonical case above.\n                if ((this.commitSeq.get(id) ?? 0) !== baseSeq) return;\n                fs.writeFileSync(spill, data);\n                spillPath = spill;\n            } catch (e) {\n                if (!isTransientFsError(e) || attempt === this.retryAttempts - 1) break;\n                const { promise, resolve } = Promise.withResolvers<void>();\n                setTimeout(resolve, this.backoffMs(attempt));\n                await promise;\n            }\n        }\n        if (spillPath) {\n            this.discovered.set(id, spillPath);\n            this.commitSeq.set(id, baseSeq + 1);\n        }\n        this.recordFailure(id, lastErr, spillPath);\n        throw lastErr;\n    }\n\n    private envelope(id: string, payload: T): PersistedEnvelope<T> {\n        return { version: this.version, savedAt: Date.now(), id, payload };\n    }\n\n    /** Serialize an envelope for disk, applying the optional codec. Strings\n     *  are written as UTF-8 (the fs default); Buffer results pass through as\n     *  raw bytes. */\n    private serialize(id: string, payload: T): Buffer | string {\n        const json = JSON.stringify(this.envelope(id, payload));\n        return this.codec ? this.codec.encode(json) : json;\n    }\n\n    /** Absolute path for a record: custom relPath (guarded against path\n     *  escape) or the flat hash default. */\n    private resolvePath(id: string, payload: T): string {\n        return path.join(this.dir, this.relPathOf(id, payload));\n    }\n\n    private relPathOf(id: string, payload: T): string {\n        const custom = this.relPathFn?.(id, payload);\n        if (!custom) return flatFileNameFor(id);\n        const rel = path.normalize(custom);\n        if (path.isAbsolute(rel) || rel.split(/[\\\\/]+/).includes(\"..\")) {\n            this.log(\"warn\", `[persist] relPath for ${id} escapes dir; using flat name`);\n            return flatFileNameFor(id);\n        }\n        return rel;\n    }\n\n    /** Unique temp file next to the destination (same dir ⇒ same volume ⇒\n     *  rename is atomic). Prefixed `.tmp-` so loadAll skips orphans. */\n    private tempPath(dest: string): string {\n        const seq = this.tmpSeq++;\n        return path.join(path.dirname(dest), `.tmp-${path.basename(dest, \".json\")}-${process.pid}-${seq}`);\n    }\n\n    private backoffMs(attempt: number): number {\n        return Math.min(this.retryBaseMs * 2 ** attempt, this.retryMaxMs);\n    }\n\n    /** Side file for a record whose canonical write keeps failing: the\n     *  canonical name with a `.fb` (fallback) infix, e.g. `a.json` →\n     *  `a.fb.json`. One slot per id, overwritten on each spill, so a stuck\n     *  lock never accumulates files. Ends in `.json` so loadAll discovers it. */\n    private spillPathFor(file: string): string {\n        const base = path.basename(file);\n        const dot = base.lastIndexOf(\".\");\n        const stem = dot > 0 ? base.slice(0, dot) : base;\n        const ext = dot > 0 ? base.slice(dot) : \".json\";\n        return path.join(path.dirname(file), `${stem}.fb${ext}`);\n    }\n\n    /** Remove a stale spill after a successful canonical write (best-effort). */\n    private async removeSpill(file: string): Promise<void> {\n        await fsp.unlink(this.spillPathFor(file)).catch(() => {});\n    }\n\n    /** Advance the per-id commit fence after a successful synchronous\n     *  commit, fencing off any in-flight async write holding an older\n     *  snapshot. */\n    private bumpCommit(id: string): void {\n        this.commitSeq.set(id, (this.commitSeq.get(id) ?? 0) + 1);\n    }\n\n    private removeSpillSync(file: string): void {\n        try {\n            fs.unlinkSync(this.spillPathFor(file));\n        } catch {\n            // no spill or still locked — loadAll reconciles by savedAt\n        }\n    }\n\n    /** Rate-limited failure alerting: log on the first failure and at each\n     *  power-of-two count (1,2,4,8,…), so a long lock yields ~log2(N) lines\n     *  instead of one per write. Includes the spill path so the operator can\n     *  see where the data landed. */\n    private recordFailure(id: string, err: unknown, spillPath: string | null): void {\n        const count = (this.failCounts.get(id) ?? 0) + 1;\n        this.failCounts.set(id, count);\n        const alertAt = count === 1 || (count >= 2 && (count & (count - 1)) === 0);\n        if (!alertAt) return;\n        const where = spillPath\n            ? `; data spilled to ${rel(spillPath, this.dir)}`\n            : \"; SPILLOVER ALSO FAILED — data at risk\";\n        this.log(count === 1 ? \"error\" : \"warn\", `[persist] write failed for ${id} (total ${count}x): ${errText(err)}${where}`);\n    }\n\n    private clearFailure(id: string): void {\n        this.failCounts.delete(id);\n    }\n\n    /** Parse + validate one file. Corrupt or invalid records return null\n     *  (logged) instead of throwing — load paths must never block boot. */\n    private readEnvelope(file: string): PersistedEnvelope<T> | null {\n        let parsed: unknown;\n        try {\n            const buf = fs.readFileSync(file);\n            const text = this.codec ? this.codec.decode(buf) : buf.toString(\"utf8\");\n            parsed = JSON.parse(text);\n        } catch (e) {\n            // A missing candidate path is an expected miss (loadSync probes);\n            // only genuinely unreadable/corrupt files get logged.\n            if ((e as NodeJS.ErrnoException).code !== \"ENOENT\") {\n                this.log(\"warn\", `[persist] skipping corrupt file ${rel(file, this.dir)}: ${errText(e)}`);\n            }\n            return null;\n        }\n        if (isEnvelopeLike(parsed)) {\n            if (!this.validateFn(parsed as PersistedEnvelope<T>)) {\n                this.log(\"warn\", `[persist] skipping invalid record ${rel(file, this.dir)}`);\n                return null;\n            }\n            return parsed as PersistedEnvelope<T>;\n        }\n        const adopted = this.adoptLegacy(parsed);\n        if (adopted) return adopted;\n        this.log(\"warn\", `[persist] skipping invalid record ${rel(file, this.dir)}`);\n        return null;\n    }\n\n    /** Wrap a legacy (pre-envelope) record as an envelope via the `legacy`\n     *  hook, then validate the adopted payload like any other. */\n    private adoptLegacy(parsed: unknown): PersistedEnvelope<T> | null {\n        const adoption = this.legacyFn ? this.legacyFn(parsed) : null;\n        if (!adoption || typeof adoption.id !== \"string\" || adoption.id.length === 0 || adoption.payload == null) {\n            return null;\n        }\n        const source = parsed as Partial<PersistedEnvelope<T>>;\n        const envelope: PersistedEnvelope<T> = {\n            version: adoption.version ?? source.version ?? this.version,\n            savedAt: adoption.savedAt ?? source.savedAt ?? 0,\n            id: adoption.id,\n            payload: adoption.payload,\n        };\n        if (!this.validateFn(envelope)) return null;\n        return envelope;\n    }\n\n    /** Iterative recursive walk (no readdir-recursive dependency), skipping\n     *  `.tmp-*` names and non-.json files. */\n    private async walkJsonFiles(root: string): Promise<string[]> {\n        const out: string[] = [];\n        const queue: string[] = [root];\n        while (queue.length > 0) {\n            const dir = queue.pop()!;\n            let dirents: fs.Dirent[];\n            try {\n                dirents = await fsp.readdir(dir, { withFileTypes: true });\n            } catch {\n                continue; // missing dir → no records yet\n            }\n            for (const d of dirents) {\n                if (d.name.startsWith(\".tmp-\")) continue;\n                const full = path.join(dir, d.name);\n                if (d.isDirectory()) queue.push(full);\n                else if (d.isFile() && d.name.endsWith(\".json\")) out.push(full);\n            }\n        }\n        return out;\n    }\n}\n\nfunction defaultValidate<T>(envelope: PersistedEnvelope<T>): boolean {\n    return typeof envelope.id === \"string\" && envelope.id.length > 0 && envelope.payload != null;\n}\n\nfunction isEnvelopeLike(value: unknown): value is PersistedEnvelope<unknown> {\n    if (!value || typeof value !== \"object\") return false;\n    const v = value as Partial<PersistedEnvelope<unknown>>;\n    return typeof v.id === \"string\" && \"payload\" in v;\n}\n\n/** Deterministic flat filename: `<sha256(id)[:24]>.json`. Truncated hash —\n *  96 bits keeps collisions unreachable for realistic id counts, and short\n *  names stay greppable. */\nexport function flatFileNameFor(id: string): string {\n    return createHash(\"sha256\").update(id, \"utf8\").digest(\"hex\").slice(0, 24) + \".json\";\n}\n\n/** Transient fs failure codes worth retrying the whole write cycle for:\n *  - EPERM/EBUSY/EACCES — a lock held on the file/dir (AV scan, search\n *    indexer, SMB); releases within the backoff window.\n *  - ENOENT/ENOTDIR — the temp file or its directory VANISHED between\n *    create and rename (a sweeper deleting fresh files under %TEMP%, seen\n *    on CI Windows runners), or a delete-pending tombstone from the same\n *    sweep. Recreating the dir + rewriting a fresh temp heals it. */\nfunction isTransientFsError(e: unknown): boolean {\n    const code = (e as NodeJS.ErrnoException).code;\n    return code === \"EPERM\" || code === \"EBUSY\" || code === \"EACCES\" || code === \"ENOENT\" || code === \"ENOTDIR\";\n}\n\nfunction errText(e: unknown): string {\n    return e instanceof Error ? e.message : String(e);\n}\n\n\nfunction rel(p: string, base: string): string {\n    const r = path.relative(base, p);\n    return r && !r.startsWith(\"..\") ? r : p;\n}\n","import type { CompressionState } from \"../types.js\";\nimport { createInitialState } from \"../state.js\";\n\n/**\n * Forward-compat: merge a parsed state with a fresh one so fields added in\n * later kernel versions get sane defaults instead of `undefined`. Nested\n * groups (nudge, stats) are shallow-merged per field so older snapshots\n * keep their values while newer counters default in.\n *\n * Lifted verbatim in behavior from billion-context's proxy mergeState.\n */\nexport function mergeCompressionState(parsed: CompressionState): CompressionState {\n  const fresh = createInitialState();\n  return {\n    blocks: parsed.blocks ?? fresh.blocks,\n    messageRefs: parsed.messageRefs ?? fresh.messageRefs,\n    nudge: { ...fresh.nudge, ...(parsed.nudge ?? {}) },\n    stats: { ...fresh.stats, ...(parsed.stats ?? {}) },\n    nextBlockId: parsed.nextBlockId ?? fresh.nextBlockId,\n    nextRunId: parsed.nextRunId ?? fresh.nextRunId,\n    tokenSnapshot: parsed.tokenSnapshot ?? fresh.tokenSnapshot,\n    absorbed: parsed.absorbed ?? fresh.absorbed,\n    rules: parsed.rules ?? fresh.rules,\n    nextRuleId: parsed.nextRuleId ?? fresh.nextRuleId,\n    terminalStreak: parsed.terminalStreak,\n    imageFullRestored: parsed.imageFullRestored ?? fresh.imageFullRestored,\n    imageShrinks: parsed.imageShrinks ?? fresh.imageShrinks,\n  };\n}\n"],"mappings":";;;;;AAAA,SAAS,kBAAkB;AAC3B,OAAO,QAAQ;AACf,OAAO,SAAS;AAChB,OAAO,UAAU;AA2IV,IAAM,aAAN,MAAoB;AAAA,EACd;AAAA,EACQ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,SAAS,oBAAI,IAA4B;AAAA,EACzC,UAAU,oBAAI,IAAqB;AAAA,EACnC,cAAc,oBAAI,IAA2B;AAAA;AAAA,EAE7C,aAAa,oBAAI,IAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMrC,YAAY,oBAAI,IAAoB;AAAA;AAAA,EAEpC,aAAa,oBAAI,IAAoB;AAAA;AAAA,EAE9C,SAAS;AAAA,EAEjB,YAAY,MAA4B;AACpC,SAAK,MAAM,KAAK;AAChB,SAAK,UAAU,KAAK;AACpB,SAAK,aAAa,KAAK,cAAc;AACrC,SAAK,UAAU,KAAK,WAAW;AAC/B,SAAK,MAAM,KAAK,QAAQ,CAAC,QAAQ,SAAS;AAAA,IAAC;AAC3C,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW,KAAK;AACrB,SAAK,aAAa,KAAK,YAAY;AACnC,SAAK,QAAQ,KAAK;AAClB,SAAK,gBAAgB,KAAK,IAAI,GAAG,KAAK,iBAAiB,CAAC;AACxD,SAAK,cAAc,KAAK,IAAI,GAAG,KAAK,eAAe,EAAE;AACrD,SAAK,aAAa,KAAK,IAAI,KAAK,aAAa,KAAK,cAAc,IAAI;AAAA,EACxE;AAAA;AAAA;AAAA,EAIA,aAAa,IAAY,OAAsB;AAC3C,QAAI,CAAC,KAAK,QAAS;AACnB,SAAK,QAAQ,IAAI,IAAI,KAAK;AAC1B,UAAM,WAAW,KAAK,OAAO,IAAI,EAAE;AACnC,QAAI,SAAU;AACd,UAAM,QAAQ,WAAW,MAAM;AAC3B,WAAK,OAAO,OAAO,EAAE;AACrB,YAAM,UAAU,KAAK,QAAQ,IAAI,EAAE;AACnC,WAAK,QAAQ,OAAO,EAAE;AACtB,UAAI,CAAC,QAAS;AAGd,WAAK,KAAK,SAAS,IAAI,OAAO,EAAE,MAAM,MAAM;AAAA,MAAC,CAAC;AAAA,IAClD,GAAG,KAAK,UAAU;AAClB,UAAM,QAAQ;AACd,SAAK,OAAO,IAAI,IAAI,KAAK;AAAA,EAC7B;AAAA;AAAA;AAAA,EAIA,MAAM,SAAS,IAAY,OAA+B;AACtD,QAAI,CAAC,KAAK,QAAS;AAGnB,UAAM,OAAO,KAAK,YAAY,IAAI,EAAE,KAAK,QAAQ,QAAQ;AACzD,UAAM,OAAO,KAAK,MAAM,MAAM;AAAA,IAAC,CAAC,EAAE,KAAK,MAAM,KAAK,WAAW,IAAI,KAAK,CAAC;AACvE,SAAK,YAAY,IAAI,IAAI,IAAI;AAK7B,SACK,QAAQ,MAAM;AACX,UAAI,KAAK,YAAY,IAAI,EAAE,MAAM,KAAM,MAAK,YAAY,OAAO,EAAE;AAAA,IACrE,CAAC,EACA,MAAM,MAAM;AAAA,IAAC,CAAC;AACnB,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,IAAY,OAAyB;AAC3C,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,UAAM,QAAQ,KAAK,OAAO,IAAI,EAAE;AAChC,QAAI,OAAO;AACP,mBAAa,KAAK;AAClB,WAAK,OAAO,OAAO,EAAE;AACrB,WAAK,QAAQ,OAAO,EAAE;AAAA,IAC1B;AACA,QAAI;AACJ,QAAI;AACA,gBAAU,MAAM;AAAA,IACpB,SAAS,GAAG;AACR,WAAK,IAAI,SAAS,gCAAgC,EAAE,KAAK,QAAQ,CAAC,CAAC,EAAE;AACrE,aAAO;AAAA,IACX;AACA,UAAM,OAAO,KAAK,YAAY,IAAI,OAAO;AACzC,UAAM,OAAO,KAAK,UAAU,IAAI,OAAO;AACvC,QAAI;AACJ,aAAS,UAAU,GAAG,UAAU,KAAK,eAAe,WAAW;AAG3D,YAAM,MAAM,KAAK,SAAS,IAAI;AAC9B,UAAI;AACA,WAAG,UAAU,KAAK,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AACpD,WAAG,cAAc,KAAK,IAAI;AAC1B,WAAG,WAAW,KAAK,IAAI;AACvB,kBAAU;AACV;AAAA,MACJ,SAAS,GAAG;AACR,kBAAU;AACV,YAAI;AACA,aAAG,WAAW,GAAG;AAAA,QACrB,QAAQ;AAAA,QAER;AACA,YAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAElE,gBAAQ,KAAK,IAAI,WAAW,IAAI,kBAAkB,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,UAAU,OAAO,CAAC;AAAA,MACxF;AAAA,IACJ;AACA,QAAI,CAAC,SAAS;AACV,WAAK,WAAW,IAAI,IAAI,IAAI;AAC5B,WAAK,aAAa,EAAE;AACpB,WAAK,WAAW,EAAE;AAClB,WAAK,gBAAgB,IAAI;AACzB,aAAO;AAAA,IACX;AAKA,UAAM,QAAQ,KAAK,aAAa,IAAI;AACpC,QAAI,YAA2B;AAC/B,aAAS,UAAU,GAAG,UAAU,KAAK,iBAAiB,cAAc,MAAM,WAAW;AACjF,UAAI;AACA,WAAG,UAAU,KAAK,QAAQ,KAAK,GAAG,EAAE,WAAW,KAAK,CAAC;AACrD,WAAG,cAAc,OAAO,IAAI;AAC5B,oBAAY;AAAA,MAChB,SAAS,GAAG;AACR,YAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAClE,gBAAQ,KAAK,IAAI,WAAW,IAAI,kBAAkB,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,UAAU,OAAO,CAAC;AAAA,MACxF;AAAA,IACJ;AACA,QAAI,UAAW,MAAK,WAAW,IAAI,IAAI,SAAS;AAChD,QAAI,UAAW,MAAK,WAAW,EAAE;AACjC,SAAK,cAAc,IAAI,SAAS,SAAS;AACzC,WAAO,cAAc;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAAS,IAAY,MAA4C;AAC7D,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,UAAM,aAAa;AAAA,MACf,KAAK,WAAW,IAAI,EAAE;AAAA,MACtB,OAAO,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI;AAAA,MACnC,KAAK,KAAK,KAAK,KAAK,gBAAgB,EAAE,CAAC;AAAA,IAC3C;AACA,eAAW,QAAQ,YAAY;AAC3B,UAAI,CAAC,KAAM;AACX,YAAM,WAAW,KAAK,aAAa,IAAI;AACvC,UAAI,YAAY,SAAS,OAAO,GAAI,QAAO;AAAA,IAC/C;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAsD;AACxD,UAAM,MAAM,oBAAI,IAAkC;AAClD,QAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,UAAM,QAAQ,MAAM,KAAK,cAAc,KAAK,GAAG;AAC/C,eAAW,QAAQ,OAAO;AACtB,YAAM,WAAW,KAAK,aAAa,IAAI;AACvC,UAAI,CAAC,SAAU;AACf,YAAM,OAAO,KAAK,SAAS,IAAI;AAC/B,YAAM,UAAU,KAAK,SAAS,KAAK,UAAU,SAAS,IAAI,SAAS,OAAO,CAAC;AAC3E,YAAM,WAAW,gBAAgB,SAAS,EAAE;AAK5C,UAAI,QAAuB;AAC3B,UAAI,SAAS,WAAW,SAAS,UAAU;AACvC,gBAAQ,SAAS;AAAA,MACrB,WAAW,KAAK,SAAS,UAAU,GAAG;AAClC,cAAM,gBAAgB,GAAG,KAAK,MAAM,GAAG,CAAC,WAAW,MAAM,CAAC;AAC1D,YAAI,kBAAkB,WAAW,kBAAkB,UAAU;AACzD,kBAAQ,SAAS;AAAA,QACrB;AAAA,MACJ;AACA,UAAI,UAAU,MAAM;AAChB,aAAK,IAAI,QAAQ,sBAAsB,IAAI,MAAM,KAAK,GAAG,CAAC,qCAAqC;AAC/F;AAAA,MACJ;AACA,YAAM,WAAW,IAAI,IAAI,KAAK;AAC9B,UAAI,CAAC,YAAY,SAAS,WAAW,SAAS,SAAS;AACnD,YAAI,IAAI,OAAO,QAAQ;AACvB,aAAK,WAAW,IAAI,OAAO,IAAI;AAAA,MACnC;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,WAAW,IAAqB;AAC5B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC7B;AAAA;AAAA,EAGA,aAAuB;AACnB,WAAO,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC;AAAA,EACjC;AAAA;AAAA;AAAA,EAIA,MAAM,WAA0B;AAC5B,UAAM,MAAM,KAAK,WAAW;AAC5B,eAAW,SAAS,KAAK,OAAO,OAAO,EAAG,cAAa,KAAK;AAC5D,SAAK,OAAO,MAAM;AAClB,UAAM,WAAW,oBAAI,IAAqB;AAC1C,eAAW,MAAM,KAAK;AAClB,YAAM,QAAQ,KAAK,QAAQ,IAAI,EAAE;AACjC,UAAI,MAAO,UAAS,IAAI,IAAI,KAAK;AACjC,WAAK,QAAQ,OAAO,EAAE;AAAA,IAC1B;AACA,UAAM,QAAQ;AAAA,MACV,CAAC,GAAG,SAAS,QAAQ,CAAC,EAAE;AAAA,QAAI,CAAC,CAAC,IAAI,KAAK,MACnC,KAAK,SAAS,IAAI,KAAK,EAAE,MAAM,CAAC,MAAM;AAClC,eAAK,IAAI,SAAS,uCAAuC,EAAE,KAAK,QAAQ,CAAC,CAAC,EAAE;AAAA,QAChF,CAAC;AAAA,MACL;AAAA,IACJ;AAEA,UAAM,QAAQ,WAAW,CAAC,GAAG,KAAK,YAAY,OAAO,CAAC,CAAC;AAAA,EAC3D;AAAA;AAAA,EAGA,YAAkB;AACd,eAAW,SAAS,KAAK,OAAO,OAAO,EAAG,cAAa,KAAK;AAC5D,SAAK,OAAO,MAAM;AAClB,SAAK,QAAQ,MAAM;AAAA,EACvB;AAAA,EAEA,MAAc,WAAW,IAAY,OAA+B;AAIhE,UAAM,UAAU,KAAK,UAAU,IAAI,EAAE,KAAK;AAC1C,QAAI;AACJ,QAAI;AACA,gBAAU,MAAM;AAAA,IACpB,SAAS,GAAG;AACR,WAAK,IAAI,SAAS,gCAAgC,EAAE,KAAK,QAAQ,CAAC,CAAC,EAAE;AACrE,YAAM;AAAA,IACV;AACA,UAAM,OAAO,KAAK,YAAY,IAAI,OAAO;AACzC,UAAM,OAAO,KAAK,UAAU,IAAI,OAAO;AACvC,QAAI;AACJ,aAAS,UAAU,GAAG,UAAU,KAAK,eAAe,WAAW;AAO3D,YAAM,MAAM,KAAK,SAAS,IAAI;AAC9B,UAAI;AACA,cAAM,IAAI,MAAM,KAAK,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AACvD,cAAM,IAAI,UAAU,KAAK,IAAI;AAK7B,aAAK,KAAK,UAAU,IAAI,EAAE,KAAK,OAAO,SAAS;AAC3C,gBAAM,IAAI,OAAO,GAAG,EAAE,MAAM,MAAM;AAAA,UAAC,CAAC;AACpC;AAAA,QACJ;AACA,YAAI;AACA,aAAG,WAAW,KAAK,IAAI;AAAA,QAC3B,SAAS,GAAG;AACR,oBAAU;AACV,gBAAM,IAAI,OAAO,GAAG,EAAE,MAAM,MAAM;AAAA,UAAC,CAAC;AACpC,cAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAClE,gBAAM,EAAE,SAAS,QAAQ,IAAI,QAAQ,cAAoB;AACzD,qBAAW,SAAS,KAAK,UAAU,OAAO,CAAC;AAC3C,gBAAM;AACN;AAAA,QACJ;AACA,aAAK,WAAW,IAAI,IAAI,IAAI;AAC5B,aAAK,aAAa,EAAE;AACpB,aAAK,UAAU,IAAI,IAAI,UAAU,CAAC;AAClC,cAAM,KAAK,YAAY,IAAI;AAC3B;AAAA,MACJ,SAAS,GAAG;AACR,kBAAU;AAGV,cAAM,IAAI,OAAO,GAAG,EAAE,MAAM,MAAM;AAAA,QAAC,CAAC;AACpC,YAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAClE,cAAM,EAAE,SAAS,QAAQ,IAAI,QAAQ,cAAoB;AACzD,mBAAW,SAAS,KAAK,UAAU,OAAO,CAAC;AAC3C,cAAM;AAAA,MACV;AAAA,IACJ;AAIA,SAAK,KAAK,UAAU,IAAI,EAAE,KAAK,OAAO,QAAS;AAQ/C,UAAM,QAAQ,KAAK,aAAa,IAAI;AACpC,QAAI,YAA2B;AAC/B,aAAS,UAAU,GAAG,UAAU,KAAK,iBAAiB,cAAc,MAAM,WAAW;AACjF,UAAI;AACA,cAAM,IAAI,MAAM,KAAK,QAAQ,KAAK,GAAG,EAAE,WAAW,KAAK,CAAC;AAIxD,aAAK,KAAK,UAAU,IAAI,EAAE,KAAK,OAAO,QAAS;AAC/C,WAAG,cAAc,OAAO,IAAI;AAC5B,oBAAY;AAAA,MAChB,SAAS,GAAG;AACR,YAAI,CAAC,mBAAmB,CAAC,KAAK,YAAY,KAAK,gBAAgB,EAAG;AAClE,cAAM,EAAE,SAAS,QAAQ,IAAI,QAAQ,cAAoB;AACzD,mBAAW,SAAS,KAAK,UAAU,OAAO,CAAC;AAC3C,cAAM;AAAA,MACV;AAAA,IACJ;AACA,QAAI,WAAW;AACX,WAAK,WAAW,IAAI,IAAI,SAAS;AACjC,WAAK,UAAU,IAAI,IAAI,UAAU,CAAC;AAAA,IACtC;AACA,SAAK,cAAc,IAAI,SAAS,SAAS;AACzC,UAAM;AAAA,EACV;AAAA,EAEQ,SAAS,IAAY,SAAkC;AAC3D,WAAO,EAAE,SAAS,KAAK,SAAS,SAAS,KAAK,IAAI,GAAG,IAAI,QAAQ;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA,EAKQ,UAAU,IAAY,SAA6B;AACvD,UAAM,OAAO,KAAK,UAAU,KAAK,SAAS,IAAI,OAAO,CAAC;AACtD,WAAO,KAAK,QAAQ,KAAK,MAAM,OAAO,IAAI,IAAI;AAAA,EAClD;AAAA;AAAA;AAAA,EAIQ,YAAY,IAAY,SAAoB;AAChD,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,UAAU,IAAI,OAAO,CAAC;AAAA,EAC1D;AAAA,EAEQ,UAAU,IAAY,SAAoB;AAC9C,UAAM,SAAS,KAAK,YAAY,IAAI,OAAO;AAC3C,QAAI,CAAC,OAAQ,QAAO,gBAAgB,EAAE;AACtC,UAAMA,OAAM,KAAK,UAAU,MAAM;AACjC,QAAI,KAAK,WAAWA,IAAG,KAAKA,KAAI,MAAM,QAAQ,EAAE,SAAS,IAAI,GAAG;AAC5D,WAAK,IAAI,QAAQ,yBAAyB,EAAE,+BAA+B;AAC3E,aAAO,gBAAgB,EAAE;AAAA,IAC7B;AACA,WAAOA;AAAA,EACX;AAAA;AAAA;AAAA,EAIQ,SAAS,MAAsB;AACnC,UAAM,MAAM,KAAK;AACjB,WAAO,KAAK,KAAK,KAAK,QAAQ,IAAI,GAAG,QAAQ,KAAK,SAAS,MAAM,OAAO,CAAC,IAAI,QAAQ,GAAG,IAAI,GAAG,EAAE;AAAA,EACrG;AAAA,EAEQ,UAAU,SAAyB;AACvC,WAAO,KAAK,IAAI,KAAK,cAAc,KAAK,SAAS,KAAK,UAAU;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,aAAa,MAAsB;AACvC,UAAM,OAAO,KAAK,SAAS,IAAI;AAC/B,UAAM,MAAM,KAAK,YAAY,GAAG;AAChC,UAAM,OAAO,MAAM,IAAI,KAAK,MAAM,GAAG,GAAG,IAAI;AAC5C,UAAM,MAAM,MAAM,IAAI,KAAK,MAAM,GAAG,IAAI;AACxC,WAAO,KAAK,KAAK,KAAK,QAAQ,IAAI,GAAG,GAAG,IAAI,MAAM,GAAG,EAAE;AAAA,EAC3D;AAAA;AAAA,EAGA,MAAc,YAAY,MAA6B;AACnD,UAAM,IAAI,OAAO,KAAK,aAAa,IAAI,CAAC,EAAE,MAAM,MAAM;AAAA,IAAC,CAAC;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,IAAkB;AACjC,SAAK,UAAU,IAAI,KAAK,KAAK,UAAU,IAAI,EAAE,KAAK,KAAK,CAAC;AAAA,EAC5D;AAAA,EAEQ,gBAAgB,MAAoB;AACxC,QAAI;AACA,SAAG,WAAW,KAAK,aAAa,IAAI,CAAC;AAAA,IACzC,QAAQ;AAAA,IAER;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,cAAc,IAAY,KAAc,WAAgC;AAC5E,UAAM,SAAS,KAAK,WAAW,IAAI,EAAE,KAAK,KAAK;AAC/C,SAAK,WAAW,IAAI,IAAI,KAAK;AAC7B,UAAM,UAAU,UAAU,KAAM,SAAS,MAAM,QAAS,QAAQ,OAAQ;AACxE,QAAI,CAAC,QAAS;AACd,UAAM,QAAQ,YACR,qBAAqB,IAAI,WAAW,KAAK,GAAG,CAAC,KAC7C;AACN,SAAK,IAAI,UAAU,IAAI,UAAU,QAAQ,8BAA8B,EAAE,WAAW,KAAK,OAAO,QAAQ,GAAG,CAAC,GAAG,KAAK,EAAE;AAAA,EAC1H;AAAA,EAEQ,aAAa,IAAkB;AACnC,SAAK,WAAW,OAAO,EAAE;AAAA,EAC7B;AAAA;AAAA;AAAA,EAIQ,aAAa,MAA2C;AAC5D,QAAI;AACJ,QAAI;AACA,YAAM,MAAM,GAAG,aAAa,IAAI;AAChC,YAAM,OAAO,KAAK,QAAQ,KAAK,MAAM,OAAO,GAAG,IAAI,IAAI,SAAS,MAAM;AACtE,eAAS,KAAK,MAAM,IAAI;AAAA,IAC5B,SAAS,GAAG;AAGR,UAAK,EAA4B,SAAS,UAAU;AAChD,aAAK,IAAI,QAAQ,mCAAmC,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,QAAQ,CAAC,CAAC,EAAE;AAAA,MAC5F;AACA,aAAO;AAAA,IACX;AACA,QAAI,eAAe,MAAM,GAAG;AACxB,UAAI,CAAC,KAAK,WAAW,MAA8B,GAAG;AAClD,aAAK,IAAI,QAAQ,qCAAqC,IAAI,MAAM,KAAK,GAAG,CAAC,EAAE;AAC3E,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AACA,UAAM,UAAU,KAAK,YAAY,MAAM;AACvC,QAAI,QAAS,QAAO;AACpB,SAAK,IAAI,QAAQ,qCAAqC,IAAI,MAAM,KAAK,GAAG,CAAC,EAAE;AAC3E,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAIQ,YAAY,QAA8C;AAC9D,UAAM,WAAW,KAAK,WAAW,KAAK,SAAS,MAAM,IAAI;AACzD,QAAI,CAAC,YAAY,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,WAAW,KAAK,SAAS,WAAW,MAAM;AACtG,aAAO;AAAA,IACX;AACA,UAAM,SAAS;AACf,UAAM,WAAiC;AAAA,MACnC,SAAS,SAAS,WAAW,OAAO,WAAW,KAAK;AAAA,MACpD,SAAS,SAAS,WAAW,OAAO,WAAW;AAAA,MAC/C,IAAI,SAAS;AAAA,MACb,SAAS,SAAS;AAAA,IACtB;AACA,QAAI,CAAC,KAAK,WAAW,QAAQ,EAAG,QAAO;AACvC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAIA,MAAc,cAAc,MAAiC;AACzD,UAAM,MAAgB,CAAC;AACvB,UAAM,QAAkB,CAAC,IAAI;AAC7B,WAAO,MAAM,SAAS,GAAG;AACrB,YAAM,MAAM,MAAM,IAAI;AACtB,UAAI;AACJ,UAAI;AACA,kBAAU,MAAM,IAAI,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,MAC5D,QAAQ;AACJ;AAAA,MACJ;AACA,iBAAW,KAAK,SAAS;AACrB,YAAI,EAAE,KAAK,WAAW,OAAO,EAAG;AAChC,cAAM,OAAO,KAAK,KAAK,KAAK,EAAE,IAAI;AAClC,YAAI,EAAE,YAAY,EAAG,OAAM,KAAK,IAAI;AAAA,iBAC3B,EAAE,OAAO,KAAK,EAAE,KAAK,SAAS,OAAO,EAAG,KAAI,KAAK,IAAI;AAAA,MAClE;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;AAEA,SAAS,gBAAmB,UAAyC;AACjE,SAAO,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,SAAS,KAAK,SAAS,WAAW;AAC5F;AAEA,SAAS,eAAe,OAAqD;AACzE,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,IAAI;AACV,SAAO,OAAO,EAAE,OAAO,YAAY,aAAa;AACpD;AAKO,SAAS,gBAAgB,IAAoB;AAChD,SAAO,WAAW,QAAQ,EAAE,OAAO,IAAI,MAAM,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE,IAAI;AAChF;AASA,SAAS,mBAAmB,GAAqB;AAC7C,QAAM,OAAQ,EAA4B;AAC1C,SAAO,SAAS,WAAW,SAAS,WAAW,SAAS,YAAY,SAAS,YAAY,SAAS;AACtG;AAEA,SAAS,QAAQ,GAAoB;AACjC,SAAO,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;AACpD;AAGA,SAAS,IAAI,GAAW,MAAsB;AAC1C,QAAM,IAAI,KAAK,SAAS,MAAM,CAAC;AAC/B,SAAO,KAAK,CAAC,EAAE,WAAW,IAAI,IAAI,IAAI;AAC1C;;;AClrBO,SAAS,sBAAsB,QAA4C;AAChF,QAAM,QAAQ,mBAAmB;AACjC,SAAO;AAAA,IACL,QAAQ,OAAO,UAAU,MAAM;AAAA,IAC/B,aAAa,OAAO,eAAe,MAAM;AAAA,IACzC,OAAO,EAAE,GAAG,MAAM,OAAO,GAAI,OAAO,SAAS,CAAC,EAAG;AAAA,IACjD,OAAO,EAAE,GAAG,MAAM,OAAO,GAAI,OAAO,SAAS,CAAC,EAAG;AAAA,IACjD,aAAa,OAAO,eAAe,MAAM;AAAA,IACzC,WAAW,OAAO,aAAa,MAAM;AAAA,IACrC,eAAe,OAAO,iBAAiB,MAAM;AAAA,IAC7C,UAAU,OAAO,YAAY,MAAM;AAAA,IACnC,OAAO,OAAO,SAAS,MAAM;AAAA,IAC7B,YAAY,OAAO,cAAc,MAAM;AAAA,IACvC,gBAAgB,OAAO;AAAA,IACvB,mBAAmB,OAAO,qBAAqB,MAAM;AAAA,IACrD,cAAc,OAAO,gBAAgB,MAAM;AAAA,EAC7C;AACF;","names":["rel"]}

package/dist/persist/store.d.ts

@@ -148,6 +148,12 @@ export declare class StateStore<T> {
     private readonly writeChains;
     /** id → absolute path, populated by writes and loadAll. */
     private readonly discovered;
+    /** id → seq of the last COMMITTED write (sync or async). Async writers
+     *  capture the seq at snapshot time and re-check it inside their
+     *  synchronous commit block; a flushSync (or a newer committed write)
+     *  bumping the seq makes the stale in-flight write abort its commit
+     *  instead of clobbering the newer on-disk payload. */
+    private readonly commitSeq;
     /** id → cumulative write-failure count, for rate-limited alerting. */
     private readonly failCounts;
     /** Monotonic counter for unique temp filenames within a process. */
@@ -162,7 +168,9 @@ export declare class StateStore<T> {
     /** Synchronous flush for one id. Used where the caller cannot await
      *  (memory eviction, sync shutdown paths). Cancels any pending debounce
      *  timer. Returns true on success, false on failure — callers that use
-     *  the result to drop in-memory state must NOT drop it on failure. */
+     *  the result to drop in-memory state must NOT drop it on failure.
+     *  Committing bumps the per-id fence so a stale in-flight async write
+     *  cannot land its older payload after this returns. */
     flushSync(id: string, build: () => T): boolean;
     /** Load one record. Checks the discovered path (from a prior
      *  write/loadAll), an optional relative-path hint, and the flat default
@@ -207,6 +215,10 @@ export declare class StateStore<T> {
     private spillPathFor;
     /** Remove a stale spill after a successful canonical write (best-effort). */
     private removeSpill;
+    /** Advance the per-id commit fence after a successful synchronous
+     *  commit, fencing off any in-flight async write holding an older
+     *  snapshot. */
+    private bumpCommit;
     private removeSpillSync;
     /** Rate-limited failure alerting: log on the first failure and at each
      *  power-of-two count (1,2,4,8,…), so a long lock yields ~log2(N) lines

package/dist/persist/store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/persist/store.ts"],"names":[],"mappings":"AAKA,8EAA8E;AAC9E,MAAM,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;AAEpF;;;;GAIG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAChC,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,CAAC,CAAC;CACd;AAED;2DAC2D;AAC3D,MAAM,WAAW,cAAc,CAAC,CAAC;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,CAAC,CAAC;IACX,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,eAAe;IAC5B,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;IACtC,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAChC;;;;OAIG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;;;;OAKG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB,yDAAyD;IACzD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;gCAC4B;IAC5B,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,GAAG,CAAC,EAAE,aAAa,CAAC;IACpB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,MAAM,CAAC;IAC7C;;;;;;;OAOG;IACH,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACvD;;;;OAIG;IACH,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC;IACvD;;;OAGG;IACH,KAAK,CAAC,EAAE,eAAe,CAAC;IACxB;;;;;;;;;;;;;OAaG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,UAAU,CAAC,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAC7B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAgB;IACpC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAgD;IAC1E,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAqC;IAChE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA8C;IACzE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAkB;IACzC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IACvC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAqC;IAC5D,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA8B;IACtD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAoC;IAChE,2DAA2D;IAC3D,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IACxD,sEAAsE;IACtE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IACxD,oEAAoE;IACpE,OAAO,CAAC,MAAM,CAAK;gBAEP,IAAI,EAAE,iBAAiB,CAAC,CAAC,CAAC;IAetC;gEAC4D;IAC5D,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,IAAI;IAkB9C;iEAC6D;IACvD,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAmBzD;;;0EAGsE;IACtE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,OAAO;IAmE9C;;;;;;yBAMqB;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,IAAI;IAehE;;;oDAGgD;IAC1C,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAoC3D,sDAAsD;IACtD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI/B,0CAA0C;IAC1C,UAAU,IAAI,MAAM,EAAE;IAItB;yEACqE;IAC/D,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAqB/B,oEAAoE;IACpE,SAAS,IAAI,IAAI;YAMH,UAAU;IAgExB,OAAO,CAAC,QAAQ;IAIhB;;qBAEiB;IACjB,OAAO,CAAC,SAAS;IAKjB;4CACwC;IACxC,OAAO,CAAC,WAAW;IAInB,OAAO,CAAC,SAAS;IAWjB;wEACoE;IACpE,OAAO,CAAC,QAAQ;IAKhB,OAAO,CAAC,SAAS;IAIjB;;;iFAG6E;IAC7E,OAAO,CAAC,YAAY;IAQpB,6EAA6E;YAC/D,WAAW;IAIzB,OAAO,CAAC,eAAe;IAQvB;;;qCAGiC;IACjC,OAAO,CAAC,aAAa;IAWrB,OAAO,CAAC,YAAY;IAIpB;2EACuE;IACvE,OAAO,CAAC,YAAY;IA2BpB;kEAC8D;IAC9D,OAAO,CAAC,WAAW;IAgBnB;8CAC0C;YAC5B,aAAa;CAoB9B;AAYD;;4BAE4B;AAC5B,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAElD"}
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/persist/store.ts"],"names":[],"mappings":"AAKA,8EAA8E;AAC9E,MAAM,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;AAEpF;;;;GAIG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAChC,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,CAAC,CAAC;CACd;AAED;2DAC2D;AAC3D,MAAM,WAAW,cAAc,CAAC,CAAC;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,CAAC,CAAC;IACX,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,eAAe;IAC5B,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;IACtC,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAChC;;;;OAIG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;;;;OAKG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB,yDAAyD;IACzD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;gCAC4B;IAC5B,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,GAAG,CAAC,EAAE,aAAa,CAAC;IACpB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,MAAM,CAAC;IAC7C;;;;;;;OAOG;IACH,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACvD;;;;OAIG;IACH,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC;IACvD;;;OAGG;IACH,KAAK,CAAC,EAAE,eAAe,CAAC;IACxB;;;;;;;;;;;;;OAaG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,UAAU,CAAC,CAAC;IACrB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAC7B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAgB;IACpC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAgD;IAC1E,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAqC;IAChE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA8C;IACzE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAkB;IACzC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IACvC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAqC;IAC5D,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA8B;IACtD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAoC;IAChE,2DAA2D;IAC3D,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IACxD;;;;2DAIuD;IACvD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA6B;IACvD,sEAAsE;IACtE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA6B;IACxD,oEAAoE;IACpE,OAAO,CAAC,MAAM,CAAK;gBAEP,IAAI,EAAE,iBAAiB,CAAC,CAAC,CAAC;IAetC;gEAC4D;IAC5D,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,IAAI;IAkB9C;iEAC6D;IACvD,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAmBzD;;;;;4DAKwD;IACxD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,OAAO;IAqE9C;;;;;;yBAMqB;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,IAAI;IAehE;;;oDAGgD;IAC1C,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAoC3D,sDAAsD;IACtD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI/B,0CAA0C;IAC1C,UAAU,IAAI,MAAM,EAAE;IAItB;yEACqE;IAC/D,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAqB/B,oEAAoE;IACpE,SAAS,IAAI,IAAI;YAMH,UAAU;IAkGxB,OAAO,CAAC,QAAQ;IAIhB;;qBAEiB;IACjB,OAAO,CAAC,SAAS;IAKjB;4CACwC;IACxC,OAAO,CAAC,WAAW;IAInB,OAAO,CAAC,SAAS;IAWjB;wEACoE;IACpE,OAAO,CAAC,QAAQ;IAKhB,OAAO,CAAC,SAAS;IAIjB;;;iFAG6E;IAC7E,OAAO,CAAC,YAAY;IAQpB,6EAA6E;YAC/D,WAAW;IAIzB;;oBAEgB;IAChB,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,eAAe;IAQvB;;;qCAGiC;IACjC,OAAO,CAAC,aAAa;IAWrB,OAAO,CAAC,YAAY;IAIpB;2EACuE;IACvE,OAAO,CAAC,YAAY;IA2BpB;kEAC8D;IAC9D,OAAO,CAAC,WAAW;IAgBnB;8CAC0C;YAC5B,aAAa;CAoB9B;AAYD;;4BAE4B;AAC5B,wBAAgB,eAAe,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAElD"}

package/dist/protected.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"protected.d.ts","sourceRoot":"","sources":["../src/protected.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEtD;;;;;;kFAMkF;AAClF,eAAO,MAAM,sBAAsB,mCAAoC,CAAC;AAExE;;;;;;;;;;;;;;;;;;gEAkBgE;AAChE,eAAO,MAAM,2BAA2B,2DAK9B,CAAC;AAEX;;mEAEmE;AACnE,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAM/D;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAK3E;AAED,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,GACzD,OAAO,CAsBT;AAED;;;8DAG8D;AAC9D,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,WAAW,EAAE,EACvB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,GACzD,GAAG,CAAC,MAAM,CAAC,CAQb;AAED;iFACiF;AACjF,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,EAC1D,gBAAgB,EAAE,GAAG,CAAC,MAAM,CAAC,GAC5B,OAAO,CAUT;AAED;;;;;;;;gFAQgF;AAChF,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACrB;AAED,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,WAAW,EAAE,EACvB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,sBAAsB,CAAC,GAC3C,eAAe,CAqBjB;AAED;2BAC2B;AAC3B,wBAAgB,wBAAwB,CACtC,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,eAAe,GACtB,OAAO,CAUT;AAiBD,wBAAgB,eAAe,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAgBzD"}
+{"version":3,"file":"protected.d.ts","sourceRoot":"","sources":["../src/protected.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEtD;;;;;;kFAMkF;AAClF,eAAO,MAAM,sBAAsB,mCAAoC,CAAC;AAExE;;;;;;;;;;;;;;;;;;gEAkBgE;AAChE,eAAO,MAAM,2BAA2B,2DAK9B,CAAC;AAEX;;mEAEmE;AACnE,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAM/D;AAED,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAK3E;AAED,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,GACzD,OAAO,CAsBT;AAED;;;8DAG8D;AAC9D,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,WAAW,EAAE,EACvB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,GACzD,GAAG,CAAC,MAAM,CAAC,CAQb;AAED;iFACiF;AACjF,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,EAC1D,gBAAgB,EAAE,GAAG,CAAC,MAAM,CAAC,GAC5B,OAAO,CAUT;AAED;;;;;;;;gFAQgF;AAChF,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACrB;AAED,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,WAAW,EAAE,EACvB,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,sBAAsB,CAAC,GAC3C,eAAe,CAqBjB;AAED;2BAC2B;AAC3B,wBAAgB,wBAAwB,CACtC,GAAG,EAAE,WAAW,EAChB,MAAM,EAAE,eAAe,GACtB,OAAO,CAUT;AAkBD,wBAAgB,eAAe,CAAC,GAAG,EAAE,WAAW,GAAG,OAAO,CAwBzD"}

package/dist/prune.d.ts

@@ -8,6 +8,21 @@ export declare const SUMMARY_HEADER = "[Compressed conversation section]";
  */
 export declare function summaryMessageId(blockId: string): string;
 export declare function isSummaryMessageId(id: string): boolean;
+/**
+ * Base id of a message id: everything before the first `#`. Sub-id
+ * projections (`base#callId`, `base#r0`, …) are alternate renderings of the
+ * same original message, so coverage is decided per original message — id
+ * comparisons normalize to the base (issue #231).
+ */
+export declare function baseIdOf(id: string): string;
+/**
+ * True when `id` falls under any covered original message, regardless of
+ * which projection form the block recorded and which the current view emits.
+ * `coveredBases` must be the set of `baseIdOf(c)` over the covered ids,
+ * built once per pass (O(1) per message instead of a scan). The exact
+ * membership test is subsumed: a covered id's own base is in the set.
+ */
+export declare function isCovered(id: string, coveredBases: Set<string>): boolean;
 /**
  * True when a message is a rendered block summary (the exact shape prune
  * emits). The id prefix alone is not sufficient — a host-authored message

package/dist/prune.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"prune.d.ts","sourceRoot":"","sources":["../src/prune.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEhE,eAAO,MAAM,cAAc,sCAAsC,CAAC;AAOlE;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAExD;AAED,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEtD;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,GAAG,MAAM,GAAG,aAAa,CAAC,GACxD,OAAO,CAMT;AAED,MAAM,WAAW,YAAY;IAC3B,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,wBAAgB,KAAK,CACnB,QAAQ,EAAE,WAAW,EAAE,EACvB,KAAK,EAAE,gBAAgB,EACvB,OAAO,GAAE,YAAiB,GACzB,WAAW,EAAE,CA4Bf"}
+{"version":3,"file":"prune.d.ts","sourceRoot":"","sources":["../src/prune.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEhE,eAAO,MAAM,cAAc,sCAAsC,CAAC;AAOlE;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAExD;AAED,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAEtD;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAG3C;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,OAAO,CAExE;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,GAAG,MAAM,GAAG,aAAa,CAAC,GACxD,OAAO,CAMT;AAED,MAAM,WAAW,YAAY;IAC3B,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,wBAAgB,KAAK,CACnB,QAAQ,EAAE,WAAW,EAAE,EACvB,KAAK,EAAE,gBAAgB,EACvB,OAAO,GAAE,YAAiB,GACzB,WAAW,EAAE,CAiCf"}

package/dist/report.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"report.d.ts","sourceRoot":"","sources":["../src/report.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAoB,gBAAgB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAsGlF;;2EAE2E;AAC3E,MAAM,WAAW,gBAAgB;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,mBAAmB;IAChC,KAAK,CAAC,EAAE,YAAY,GAAG,cAAc,CAAC;IACtC,IAAI,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC;IACxC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,gBAAgB,CAAC;CAC3B;AAED,wBAAgB,iBAAiB,CAC7B,KAAK,EAAE,gBAAgB,EACvB,QAAQ,EAAE,WAAW,EAAE,EACvB,WAAW,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,EAClC,OAAO,GAAE,mBAAwB,GAClC,MAAM,CAyBR;AAgOD,wBAAgB,UAAU,CACtB,KAAK,EAAE,gBAAgB,EACvB,OAAO,CAAC,EAAE,MAAM,GACjB,MAAM,CA6BR"}
+{"version":3,"file":"report.d.ts","sourceRoot":"","sources":["../src/report.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAoB,gBAAgB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AA2GlF;;2EAE2E;AAC3E,MAAM,WAAW,gBAAgB;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,mBAAmB;IAChC,KAAK,CAAC,EAAE,YAAY,GAAG,cAAc,CAAC;IACtC,IAAI,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC;IACxC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,gBAAgB,CAAC;CAC3B;AAED,wBAAgB,iBAAiB,CAC7B,KAAK,EAAE,gBAAgB,EACvB,QAAQ,EAAE,WAAW,EAAE,EACvB,WAAW,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,EAClC,OAAO,GAAE,mBAAwB,GAClC,MAAM,CAyBR;AAqOD,wBAAgB,UAAU,CACtB,KAAK,EAAE,gBAAgB,EACvB,OAAO,CAAC,EAAE,MAAM,GACjB,MAAM,CA6BR"}

package/dist/search/algorithms/hybrid.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hybrid.d.ts","sourceRoot":"","sources":["../../../src/search/algorithms/hybrid.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAA0B,MAAM,aAAa,CAAC;AAwB3E,eAAO,MAAM,eAAe,EAAE,eAe7B,CAAC"}
+{"version":3,"file":"hybrid.d.ts","sourceRoot":"","sources":["../../../src/search/algorithms/hybrid.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAA0B,MAAM,aAAa,CAAC;AAwB3E,eAAO,MAAM,eAAe,EAAE,eAgB7B,CAAC"}

package/dist/search/doc-cache.d.ts

@@ -4,16 +4,38 @@
  * A search over the compressed history re-scores the SAME immutable docs on
  * every call — compressed block summaries and folded message text never
  * change. Without this cache, every search_context call re-tokenized the
- * entire corpus (segmenter CJK pass ≈ 0.3s/MB cold) plus re-lowercased it
- * and rebuilt the bigram set for each channel: a 5MB session cost ~3s PER
- * CALL, growing linearly with session length. With the cache the corpus is
- * processed once; later searches are O(docs × query-terms).
+ * entire corpus (segmenter pass ≈ 0.1–0.6s/MB cold, content-dependent) plus
+ * re-lowercased it and rebuilt the bigram set for each channel: a 5MB session
+ * cost seconds PER CALL, growing linearly with session length. With the cache
+ * the corpus is processed once; later searches are O(docs × query-terms).
  *
- * Keyed by doc text (immutable). Bounded by total cached source chars —
- * oldest docs are evicted when the cap is exceeded, so a long-lived
- * process serving many sessions cannot grow unboundedly. Hosts that want to
- * release the memory eagerly on session shutdown/switch can call
- * clearDocFeatures() (optional: the cap already bounds it).
+ * Keyed by doc text (immutable), bounded by total cached SOURCE CHARS. Eviction
+ * is least-recently-used: a hit re-inserts the doc at the tail, so the docs a
+ * host keeps re-touching are retained. LRU helps when access is HETEROGENEOUS
+ * (a hot subset across many queries; a long-lived multi-session process). It
+ * does NOT help when every call re-scans the ENTIRE corpus below the cap — no
+ * hot subset exists, the window slides past every doc each call, and
+ * (corpus − cap) is re-tokenized every time.
+ *
+ * Sizing consequence: if your corpus exceeds the cap and each search rescans
+ * it whole, the ONLY setting that stops re-tokenization is
+ * setDocCacheCap(≥ corpus) (or Infinity). Do NOT lower the cap to save memory
+ * there — it trades bounded memory for a full re-tokenize of the excess on
+ * EVERY call. The default (8MB) suits hosts running many sessions that cannot
+ * afford to pin one corpus.
+ *
+ * The cap is in SOURCE CHARS, a loose proxy for retained heap: feature memory
+ * scales with DISTINCT token/bigram count, content-dependent (≈ 2×–49× per
+ * source char, latin prose → high-entropy CJK). The cap bounds billed chars,
+ * not a hard memory limit.
+ *
+ * The cap is MODULE-GLOBAL — setDocCacheCap() sets process-wide state shared
+ * by every acp-kernel consumer in the process. Fine while one consumer runs
+ * per process; a per-scope cache (keyed by doc ref) would let a host scope a
+ * cap to one session instead (see #227).
+ *
+ * Hosts that want to release the memory eagerly on session shutdown/switch
+ * can call clearDocFeatures() (optional: the cap already bounds it).
  */
 export interface DocFeatures {
     /** Stemmed term frequencies (BM25 channel). */
@@ -30,7 +52,9 @@ export declare function docFeatures(text: string): DocFeatures;
 export declare function clearDocFeatures(): void;
 /**
  * Set the cache cap in source chars. Docs larger than the cap are never
- * cached. Also used by tests to exercise eviction.
+ * cached. Pass a value ≥ the corpus size (or Infinity) to cache the whole
+ * corpus — a single-session host then avoids re-tokenizing on every call.
+ * Also used by tests to exercise eviction.
  */
 export declare function setDocCacheCap(chars: number): void;
 /** Cache occupancy — for diagnostics. */

package/dist/search/doc-cache.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"doc-cache.d.ts","sourceRoot":"","sources":["../../src/search/doc-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,MAAM,WAAW,WAAW;IACxB,+CAA+C;IAC/C,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxB,oDAAoD;IACpD,GAAG,EAAE,MAAM,CAAC;IACZ,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;IACd,sDAAsD;IACtD,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACtB;AAeD,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,CAcrD;AAED,kEAAkE;AAClE,wBAAgB,gBAAgB,IAAI,IAAI,CAGvC;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAOlD;AAED,yCAAyC;AACzC,wBAAgB,YAAY,IAAI;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAEjE"}
+{"version":3,"file":"doc-cache.d.ts","sourceRoot":"","sources":["../../src/search/doc-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAIH,MAAM,WAAW,WAAW;IACxB,+CAA+C;IAC/C,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxB,oDAAoD;IACpD,GAAG,EAAE,MAAM,CAAC;IACZ,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;IACd,sDAAsD;IACtD,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACtB;AAeD,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,CAmBrD;AAED,kEAAkE;AAClE,wBAAgB,gBAAgB,IAAI,IAAI,CAGvC;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAOlD;AAED,yCAAyC;AACzC,wBAAgB,YAAY,IAAI;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAEjE"}

package/dist/sync.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sync.d.ts","sourceRoot":"","sources":["../src/sync.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEhE,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,gBAAgB,CAAC;IACxB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,wBAAgB,UAAU,CACxB,QAAQ,EAAE,WAAW,EAAE,EACvB,KAAK,EAAE,gBAAgB,GACtB,UAAU,CAiFZ"}
+{"version":3,"file":"sync.d.ts","sourceRoot":"","sources":["../src/sync.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEhE,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,gBAAgB,CAAC;IACxB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,wBAAgB,UAAU,CACxB,QAAQ,EAAE,WAAW,EAAE,EACvB,KAAK,EAAE,gBAAgB,GACtB,UAAU,CAmFZ"}

package/dist/types.d.ts

@@ -239,6 +239,15 @@ export interface CompressionState {
     imageFullRestored?: string[];
     /** Arrival-time downsample records (#353). Optional: pre-feature persisted states lack it. */
     imageShrinks?: ImageShrinkRecord[];
+    /** Padded refs (mNNNNN) of HIDDEN orphan compress call/result messages — the
+     *  orphans beyond the keep-last-N window that hide-consumed removed from the
+     *  visible view this turn. Written every processTurn by the hide-compress-calls
+     *  node so boundary resolution can snap a range endpoint that lands on such a
+     *  hidden-but-intact artifact to its adjacent visible message instead of
+     *  dead-ending the whole range (#396). A drifted/dangling ref (#387) is NOT in
+     *  this set and keeps the clear "cannot be anchored" error. Optional for
+     *  pre-feature persisted states. */
+    hiddenOrphanRefs?: string[];
     nextBlockId: number;
     nextRunId: number;
 }
@@ -267,7 +276,7 @@ export interface NudgeConfig {
     minGrowthFloor: number;
     /** Ratio for growth floor: max(minGrowthFloor, minGrowthRatio × growthTokens). Default 0.45. */
     minGrowthRatio: number;
-    /** Emergency override: always nudge when usage ≥ this fraction. Default 0.98 (98%). */
+    /** Emergency override: always nudge when usage ≥ this fraction. Default 0.95 (95%). */
     emergencyThresholdPct: number;
     /** Growth multiplier for the tier-2 trigger: T2 distillation fires when T2
      *  pending ≥ nudgeGrowthTokens × this multiplier AND T2 > T1 effective.
@@ -456,6 +465,11 @@ export interface ApplyCompressionResult {
          *  The compression still succeeded; the host should surface these to the
          *  model so it understands what was skipped. */
         warnings: string[];
+        /** Kernel-side rewrites of the model's input (e.g. reversed refs
+         *  normalized to ascending order), for hosts to render into the tool
+         *  result so the model knows its input was changed (#310). Omitted when
+         *  empty. */
+        notes?: string[];
     };
 }
 export interface ProcessTurnResult {