@optimystic/db-p2p 0.21.0 → 0.24.0

package/dist/src/storage/shared-cache-pool.js

@@ -0,0 +1,354 @@
+/**
+ * A store's registration with the pool. `id` is process-unique and never reused (monotonic
+ * counter), so entries and ghost keys of a departed store can never alias a later one.
+ * `bytes`/`entries` are live occupancy, maintained by the pool — read-only for callers.
+ */
+export class CacheStoreHandle {
+    id;
+    label;
+    bytes = 0;
+    entries = 0;
+    constructor(id, label) {
+        this.id = id;
+        this.label = label;
+    }
+}
+/**
+ * Separator for pool keys: NUL, spelled as an escape so this file stays plain text — a literal
+ * NUL byte in the source makes the whole file binary to git (no diff, no blame, no review).
+ * NUL is the one character no id can carry: block ids are user-supplied collection URI paths
+ * (which may well contain spaces) and action ids are base64url with an optional `tx:`/`stamp:`
+ * prefix, so `(storeId, class, blockId, actionId?)` always splits back unambiguously.
+ */
+const SEP = '\u0000';
+/**
+ * A shared, bounded, clean-value cache pool: one per process (see {@link defaultCachePool}),
+ * shared by every `CachedStoreDriver` so that N stores compete inside ONE memory budget
+ * instead of keeping N unbounded caches. The pool owns residency and eviction only; all
+ * cache *semantics* (coherence, negatives, completeness) stay in the owning store.
+ *
+ * **Always evict, never refuse, never grow unbounded.** Entries are never pinned and never
+ * dirty (the cache is write-through; see `CachedStoreDriver`), so eviction is always safe
+ * and there is no exhaustion condition to raise. At the bound the pool evicts; the one entry
+ * class that can grow while resident (a store's revision map) is simply evicted like any
+ * other when its growth pushes the pool over budget.
+ *
+ * **2Q admission** (default): a first-touch entry enters the A1in probation FIFO; re-hits
+ * inside A1in do NOT promote (FIFO order stands, which is also what absorbs the several
+ * correlated touches one logical operation makes); eviction from A1in demotes the key to
+ * the A1out ghost set; a later admission of a ghosted key — reuse across operations — goes
+ * straight to the protected Am LRU. Am evictions do NOT ghost. One-pass bulk scans
+ * therefore live and die inside A1in without displacing any store's hot Am set.
+ *
+ * **Large values bypass**: an entry whose charge exceeds 1/16 of the byte budget is not
+ * admitted at all (the owner reads/writes through), so one oversized value cannot flush
+ * the pool.
+ *
+ * **Budget sanity**: `maxBytes`/`maxEntries` must be positive finite numbers — anything else
+ * throws. Absurdly small values are accepted as-is: they cannot break coherence (the owning
+ * cache is correct at any residency, including zero), they just degrade toward read-through.
+ *
+ * Not safe for use from multiple threads; like the caches it serves, it relies on JS
+ * single-threaded execution — every mutation completes synchronously.
+ */
+export class SharedCachePool {
+    maxBytesValue;
+    maxEntriesValue;
+    admission;
+    bypassLimit = 0;
+    a1inTargetBytes = 0;
+    a1inTargetEntries = 0;
+    ghostCap = 0;
+    a1in = new Map();
+    am = new Map();
+    ghost = new Set();
+    a1inBytes = 0;
+    bytesTotal = 0;
+    entriesTotal = 0;
+    storeCounter = 0;
+    stores = new Map();
+    hits = 0;
+    admissions = 0;
+    ghostHits = 0;
+    evictions = 0;
+    bypasses = 0;
+    constructor(options) {
+        this.admission = options?.admission ?? '2q';
+        this.maxBytesValue = validateBound('maxBytes', options?.maxBytes ?? platformDefaultBytes());
+        this.maxEntriesValue = validateBound('maxEntries', options?.maxEntries ?? Math.max(16, Math.floor(this.maxBytesValue / 512)));
+        this.recomputeDerived();
+    }
+    get maxBytes() { return this.maxBytesValue; }
+    get maxEntries() { return this.maxEntriesValue; }
+    get bytes() { return this.bytesTotal; }
+    get entries() { return this.entriesTotal; }
+    /**
+     * Re-budget a live pool (e.g. host config change, or a host correcting the platform
+     * default). Shrinking evicts immediately down to the new bound.
+     */
+    setBudget(budget) {
+        if (budget.maxBytes !== undefined) {
+            this.maxBytesValue = validateBound('maxBytes', budget.maxBytes);
+        }
+        if (budget.maxEntries !== undefined) {
+            this.maxEntriesValue = validateBound('maxEntries', budget.maxEntries);
+        }
+        this.recomputeDerived();
+        this.evictToFit(0, 0);
+        this.trimGhost();
+    }
+    /** Register a store. The returned handle's `id` is unique for the pool's lifetime — never reused. */
+    registerStore(label) {
+        const handle = new CacheStoreHandle(`s${++this.storeCounter}`, label);
+        this.stores.set(handle.id, handle);
+        return handle;
+    }
+    /**
+     * Release a departing store: evict any of its entries still resident (defensively — the
+     * owner normally clears first), purge its ghost keys, and remove it from the registry.
+     * Idempotent. This forced removal notifies the owner like any other eviction — `drop` here
+     * would de-account entries the owner still references, leaving it serving values the pool
+     * no longer counts. It does NOT ghost (the ghosts are being purged anyway) and does NOT
+     * count as a budget eviction: it is a lifecycle release, not memory pressure.
+     */
+    unregisterStore(handle) {
+        for (const queue of [this.a1in, this.am]) {
+            for (const entry of [...queue.values()]) {
+                if (entry.store !== handle)
+                    continue;
+                this.unlink(entry);
+                entry.owner.onPoolEvict(entry);
+            }
+        }
+        this.purgeGhosts(handle);
+        this.stores.delete(handle.id);
+    }
+    /** Drop every ghost key belonging to `handle` (used by store clear/close — pre-clear recency must not survive the clear). */
+    purgeGhosts(handle) {
+        const prefix = handle.id + SEP;
+        for (const key of [...this.ghost]) {
+            if (key.startsWith(prefix))
+                this.ghost.delete(key);
+        }
+    }
+    /** Build the pool key for an entry. Store-id first: keying by block id alone would alias name-derived header block ids across stores. */
+    keyFor(store, cls, blockId, actionId) {
+        return actionId === undefined
+            ? store.id + SEP + cls + SEP + blockId
+            : store.id + SEP + cls + SEP + blockId + SEP + actionId;
+    }
+    /**
+     * Would an entry of this total charge be admitted? `false` = large-value bypass (counted);
+     * the owner must then read/write through without caching. Also the gate for value
+     * *updates*: an update growing past the limit should drop the entry instead.
+     */
+    admits(charge) {
+        if (charge > this.bypassLimit) {
+            this.bypasses++;
+            return false;
+        }
+        return true;
+    }
+    /**
+     * Admit a non-resident entry the owner has ALREADY installed in its own state. Evicts
+     * first (so the incoming entry can never be its own victim), then links: to Am when the
+     * key is in the ghost set (2Q reuse signal), to A1in probation otherwise.
+     */
+    admit(entry) {
+        if (entry.where !== 'none') {
+            throw new Error(`pool admit of already-resident entry ${entry.key}`);
+        }
+        this.evictToFit(entry.charge, 1);
+        this.admissions++;
+        if (this.admission === 'lru') {
+            this.link(entry, 'am');
+            return;
+        }
+        if (this.ghost.delete(entry.key)) {
+            this.ghostHits++;
+            this.link(entry, 'am');
+        }
+        else {
+            this.link(entry, 'a1in');
+        }
+    }
+    /** Record a read hit: Am refreshes to MRU; A1in stays put (FIFO — no intra-probation promotion). */
+    touch(entry) {
+        this.hits++;
+        this.refresh(entry);
+    }
+    /**
+     * Re-account a resident entry after the owner mutated its value (write hit, or container
+     * growth like a revision-map fill). Queue position refreshes like a touch (without
+     * counting a hit); growth over budget evicts — possibly the updated entry itself, which
+     * is why owners call this LAST and never touch their cache state after.
+     *
+     * NOTE: growth here is NOT re-checked against {@link admits}' large-value bypass, so a
+     * container entry (a block's revision map or pending-id set) can grow past 1/16 of the
+     * budget and squat where a single oversized value would have been refused. Bounded and
+     * self-correcting today: an over-share entry keeps `a1inBytes` above its target, so
+     * probation evicts it preferentially, and anything past `maxBytes` is evicted outright.
+     * If a block ever accumulates enough revisions for one map to hold a real fraction of the
+     * budget (order 20k revs at the 32 MB Node default), gate growth on `admits(charge)` in
+     * the owner's revision/pending-list paths and drop the entry when it fails, exactly as
+     * `CachedStoreDriver.cachePoint` already does for point values.
+     */
+    updated(entry, newCharge) {
+        if (entry.where === 'none')
+            return;
+        const delta = newCharge - entry.charge;
+        entry.charge = newCharge;
+        this.bytesTotal += delta;
+        entry.store.bytes += delta;
+        if (entry.where === 'a1in')
+            this.a1inBytes += delta;
+        this.refresh(entry);
+        if (delta > 0)
+            this.evictToFit(0, 0);
+    }
+    /**
+     * Remove an entry WITHOUT the eviction callback — for owners invalidating or clearing
+     * their own entries (the owner is already removing its reference). Never ghosts: an
+     * invalidation says nothing about reuse. No-op if not resident.
+     */
+    drop(entry) {
+        if (entry.where === 'none')
+            return;
+        this.unlink(entry);
+    }
+    stats() {
+        const amBytes = this.bytesTotal - this.a1inBytes;
+        return {
+            maxBytes: this.maxBytesValue,
+            maxEntries: this.maxEntriesValue,
+            bytes: this.bytesTotal,
+            entries: this.entriesTotal,
+            a1in: { bytes: this.a1inBytes, entries: this.a1in.size },
+            am: { bytes: amBytes, entries: this.am.size },
+            ghostKeys: this.ghost.size,
+            hits: this.hits,
+            admissions: this.admissions,
+            ghostHits: this.ghostHits,
+            evictions: this.evictions,
+            bypasses: this.bypasses,
+            stores: [...this.stores.values()].map(s => ({ id: s.id, label: s.label, bytes: s.bytes, entries: s.entries })),
+        };
+    }
+    // ---- internals ----
+    recomputeDerived() {
+        this.bypassLimit = Math.floor(this.maxBytesValue / 16);
+        this.a1inTargetBytes = Math.floor(this.maxBytesValue / 4);
+        this.a1inTargetEntries = Math.floor(this.maxEntriesValue / 4);
+        this.ghostCap = Math.floor(this.maxEntriesValue / 2);
+    }
+    link(entry, where) {
+        entry.where = where;
+        (where === 'a1in' ? this.a1in : this.am).set(entry.key, entry);
+        if (where === 'a1in')
+            this.a1inBytes += entry.charge;
+        this.bytesTotal += entry.charge;
+        this.entriesTotal++;
+        entry.store.bytes += entry.charge;
+        entry.store.entries++;
+    }
+    unlink(entry) {
+        (entry.where === 'a1in' ? this.a1in : this.am).delete(entry.key);
+        if (entry.where === 'a1in')
+            this.a1inBytes -= entry.charge;
+        this.bytesTotal -= entry.charge;
+        this.entriesTotal--;
+        entry.store.bytes -= entry.charge;
+        entry.store.entries--;
+        entry.where = 'none';
+    }
+    /** Map insertion order gives A1in its FIFO and Am its LRU: refresh = delete + re-insert. */
+    refresh(entry) {
+        if (entry.where !== 'am')
+            return;
+        this.am.delete(entry.key);
+        this.am.set(entry.key, entry);
+    }
+    evictToFit(incomingCharge, incomingEntries) {
+        while (this.bytesTotal + incomingCharge > this.maxBytesValue
+            || this.entriesTotal + incomingEntries > this.maxEntriesValue) {
+            const victim = this.pickVictim();
+            if (victim === undefined)
+                break; // pool empty — nothing left to evict
+            this.evict(victim);
+        }
+    }
+    pickVictim() {
+        if (this.admission === 'lru') {
+            return first(this.am) ?? first(this.a1in);
+        }
+        // 2Q: take A1in's FIFO head while probation is over its share of EITHER rail (or Am has
+        // nothing); otherwise the protected queue's LRU entry. Probation needs a share of the
+        // entry rail too, not just the byte rail: entries small enough that the entry count binds
+        // first (cached negatives are near-empty) would otherwise leave `a1inBytes` permanently
+        // under its byte target, so every admission would evict from Am and a one-pass scan would
+        // flush the protected set — 2Q silently degraded to plain LRU.
+        const a1inHead = first(this.a1in);
+        if (a1inHead !== undefined && (this.a1inBytes > this.a1inTargetBytes
+            || this.a1in.size > this.a1inTargetEntries || this.am.size === 0)) {
+            return a1inHead;
+        }
+        return first(this.am) ?? a1inHead;
+    }
+    evict(entry) {
+        const fromA1in = entry.where === 'a1in';
+        this.unlink(entry);
+        if (fromA1in && this.admission === '2q') {
+            this.pushGhost(entry.key);
+        }
+        this.evictions++;
+        entry.owner.onPoolEvict(entry);
+    }
+    pushGhost(key) {
+        this.ghost.delete(key);
+        this.ghost.add(key);
+        this.trimGhost();
+    }
+    trimGhost() {
+        while (this.ghost.size > this.ghostCap) {
+            const oldest = this.ghost.values().next().value;
+            if (oldest === undefined)
+                break;
+            this.ghost.delete(oldest);
+        }
+    }
+}
+function first(queue) {
+    return queue.values().next().value;
+}
+function validateBound(name, value) {
+    if (typeof value !== 'number' || !Number.isFinite(value) || value <= 0) {
+        throw new TypeError(`SharedCachePool ${name} must be a positive finite number, got ${value}`);
+    }
+    return Math.floor(value);
+}
+/**
+ * Honest per-platform default byte budget: ~8 MB on React Native (the phone running twenty
+ * workspaces is the device least able to afford more), 16 MB in browsers, 32 MB on Node
+ * (desktop / provider hosts). Hosts with better knowledge should size explicitly — either
+ * `defaultCachePool().setBudget(...)` or their own `SharedCachePool` passed to each cache.
+ */
+function platformDefaultBytes() {
+    const g = globalThis;
+    if (g.navigator?.product === 'ReactNative')
+        return 8 * 1024 * 1024;
+    if (g.window !== undefined)
+        return 16 * 1024 * 1024;
+    return 32 * 1024 * 1024;
+}
+let defaultPool;
+/**
+ * The process-wide shared pool every `CachedStoreDriver` joins unless handed a specific one.
+ * Lazily created on first use with the platform-default budget; re-budget it live via
+ * `setBudget`. One pool per process is the point: twenty workspaces' caches compete inside
+ * one budget instead of each sizing itself as if it were alone.
+ */
+export function defaultCachePool() {
+    defaultPool ??= new SharedCachePool();
+    return defaultPool;
+}
+//# sourceMappingURL=shared-cache-pool.js.map

package/dist/src/storage/shared-cache-pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared-cache-pool.js","sourceRoot":"","sources":["../../../src/storage/shared-cache-pool.ts"],"names":[],"mappings":"AAgDA;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IAIlB;IACA;IAJV,KAAK,GAAG,CAAC,CAAC;IACV,OAAO,GAAG,CAAC,CAAC;IACZ,YACU,EAAU,EACV,KAAyB;QADzB,OAAE,GAAF,EAAE,CAAQ;QACV,UAAK,GAAL,KAAK,CAAoB;IAChC,CAAC;CACJ;AAmCD;;;;;;GAMG;AACH,MAAM,GAAG,GAAG,QAAQ,CAAC;AAErB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,OAAO,eAAe;IACnB,aAAa,CAAS;IACtB,eAAe,CAAS;IACf,SAAS,CAAe;IACjC,WAAW,GAAG,CAAC,CAAC;IAChB,eAAe,GAAG,CAAC,CAAC;IACpB,iBAAiB,GAAG,CAAC,CAAC;IACtB,QAAQ,GAAG,CAAC,CAAC;IAEJ,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;IACpC,EAAE,GAAG,IAAI,GAAG,EAAqB,CAAC;IAClC,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,SAAS,GAAG,CAAC,CAAC;IAEd,UAAU,GAAG,CAAC,CAAC;IACf,YAAY,GAAG,CAAC,CAAC;IACjB,YAAY,GAAG,CAAC,CAAC;IACR,MAAM,GAAG,IAAI,GAAG,EAA4B,CAAC;IAEtD,IAAI,GAAG,CAAC,CAAC;IACT,UAAU,GAAG,CAAC,CAAC;IACf,SAAS,GAAG,CAAC,CAAC;IACd,SAAS,GAAG,CAAC,CAAC;IACd,QAAQ,GAAG,CAAC,CAAC;IAErB,YAAY,OAAgC;QAC3C,IAAI,CAAC,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC;QAC5C,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,QAAQ,IAAI,oBAAoB,EAAE,CAAC,CAAC;QAC5F,IAAI,CAAC,eAAe,GAAG,aAAa,CAAC,YAAY,EAChD,OAAO,EAAE,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5E,IAAI,CAAC,gBAAgB,EAAE,CAAC;IACzB,CAAC;IAED,IAAI,QAAQ,KAAa,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACrD,IAAI,UAAU,KAAa,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;IACzD,IAAI,KAAK,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC/C,IAAI,OAAO,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IAEnD;;;OAGG;IACH,SAAS,CAAC,MAAkD;QAC3D,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACrC,IAAI,CAAC,eAAe,GAAG,aAAa,CAAC,YAAY,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAED,qGAAqG;IACrG,aAAa,CAAC,KAAc;QAC3B,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,EAAE,EAAE,KAAK,CAAC,CAAC;QACtE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,MAAwB;QACvC,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1C,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;gBACzC,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM;oBAAE,SAAS;gBACrC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACnB,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;QACF,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,6HAA6H;IAC7H,WAAW,CAAC,MAAwB;QACnC,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,GAAG,GAAG,CAAC;QAC/B,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACnC,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpD,CAAC;IACF,CAAC;IAED,yIAAyI;IACzI,MAAM,CAAC,KAAuB,EAAE,GAAoB,EAAE,OAAgB,EAAE,QAAmB;QAC1F,OAAO,QAAQ,KAAK,SAAS;YAC5B,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,OAAO;YACtC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,OAAO,GAAG,GAAG,GAAG,QAAQ,CAAC;IAC1D,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,MAAc;QACpB,IAAI,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,OAAO,KAAK,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAgB;QACrB,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,wCAAwC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACvB,OAAO;QACR,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1B,CAAC;IACF,CAAC;IAED,oGAAoG;IACpG,KAAK,CAAC,KAAgB;QACrB,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,KAAgB,EAAE,SAAiB;QAC1C,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM;YAAE,OAAO;QACnC,MAAM,KAAK,GAAG,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;QACvC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC;QACzB,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC;QACzB,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC;QAC3B,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM;YAAE,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC;QACpD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,KAAK,GAAG,CAAC;YAAE,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,KAAgB;QACpB,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM;YAAE,OAAO;QACnC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IAED,KAAK;QACJ,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC;QACjD,OAAO;YACN,QAAQ,EAAE,IAAI,CAAC,aAAa;YAC5B,UAAU,EAAE,IAAI,CAAC,eAAe;YAChC,KAAK,EAAE,IAAI,CAAC,UAAU;YACtB,OAAO,EAAE,IAAI,CAAC,YAAY;YAC1B,IAAI,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACxD,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;YAC7C,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC1B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;SAC9G,CAAC;IACH,CAAC;IAED,sBAAsB;IAEd,gBAAgB;QACvB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC,CAAC;QACvD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAEO,IAAI,CAAC,KAAgB,EAAE,KAAoB;QAClD,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,KAAK,KAAK,MAAM;YAAE,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,MAAM,CAAC;QACrD,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;QAClC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAEO,MAAM,CAAC,KAAgB;QAC9B,CAAC,KAAK,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACjE,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM;YAAE,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,MAAM,CAAC;QAC3D,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;QAClC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACtB,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC;IACtB,CAAC;IAED,4FAA4F;IACpF,OAAO,CAAC,KAAgB;QAC/B,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI;YAAE,OAAO;QACjC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAEO,UAAU,CAAC,cAAsB,EAAE,eAAuB;QACjE,OAAO,IAAI,CAAC,UAAU,GAAG,cAAc,GAAG,IAAI,CAAC,aAAa;eACxD,IAAI,CAAC,YAAY,GAAG,eAAe,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YAChE,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACjC,IAAI,MAAM,KAAK,SAAS;gBAAE,MAAM,CAAC,qCAAqC;YACtE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACpB,CAAC;IACF,CAAC;IAEO,UAAU;QACjB,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE,CAAC;YAC9B,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC;QACD,wFAAwF;QACxF,sFAAsF;QACtF,0FAA0F;QAC1F,wFAAwF;QACxF,0FAA0F;QAC1F,+DAA+D;QAC/D,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,eAAe;eAChE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC;YACpE,OAAO,QAAQ,CAAC;QACjB,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;IACnC,CAAC;IAEO,KAAK,CAAC,KAAgB;QAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,KAAK,MAAM,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,QAAQ,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YACzC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAEO,SAAS,CAAC,GAAW;QAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAEO,SAAS;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAChD,IAAI,MAAM,KAAK,SAAS;gBAAE,MAAM;YAChC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;IACF,CAAC;CACD;AAED,SAAS,KAAK,CAAC,KAA6B;IAC3C,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;AACpC,CAAC;AAED,SAAS,aAAa,CAAC,IAAY,EAAE,KAAa;IACjD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACxE,MAAM,IAAI,SAAS,CAAC,mBAAmB,IAAI,0CAA0C,KAAK,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB;IAC5B,MAAM,CAAC,GAAG,UAAoE,CAAC;IAC/E,IAAI,CAAC,CAAC,SAAS,EAAE,OAAO,KAAK,aAAa;QAAE,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;IACnE,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;IACpD,OAAO,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AACzB,CAAC;AAED,IAAI,WAAwC,CAAC;AAE7C;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB;IAC/B,WAAW,KAAK,IAAI,eAAe,EAAE,CAAC;IACtC,OAAO,WAAW,CAAC;AACpB,CAAC"}

package/dist/src/storage/storage-repo.d.ts

@@ -94,7 +94,56 @@ export declare class StorageRepo implements IRepo, IBlockChangeNotifier, IBlockR
     private emitPromotions;
     pend(request: PendRequest, _options?: MessageOptions): Promise<PendResult>;
     cancel(actionRef: ActionBlocks, _options?: MessageOptions): Promise<void>;
+    /**
+     * Commit a previously-pended action across its blocks, under the per-block commit latches.
+     *
+     * **Divergence vs genuine fault.** When the batch cannot be completed, the reason decides what
+     * happens to the pending records the pend left behind. `ClusterMember.applyConsensusOperation`
+     * makes the same split one layer up — it *tolerates* a divergence (and reconciles every
+     * `commit.blockIds` entry from a cohort peer) but *propagates* a genuine fault for retry — so this
+     * method must agree with it:
+     *
+     * - **Divergence** — this node is behind the agreed history, either because it holds no
+     *   materializable base ({@link MissingBaseRevisionError}) or because it never received the pend
+     *   (the `Pending action … not found` throw). Reconcile is guaranteed to follow and will advance
+     *   every block in the batch past `request.rev`, so no pending record here can ever be promoted:
+     *   {@link dropUnpromotablePendings} deletes them (see {@link refuseMissingBase}, which already
+     *   accepts this tradeoff for the single refusing block).
+     * - **Genuine fault** — any other throw out of {@link internalCommit} (a raw-storage error, …).
+     *   `ClusterMember` propagates it and the commit is retried, and a retry can still replay the
+     *   pendings, so they are KEPT.
+     *
+     * The stale/`missedCommits` early return (this node is AHEAD — it already holds a revision at or
+     * past `request.rev`, committed under a different action) deliberately keeps pendings too, and its
+     * cure is the losing client's `cancel`: `CoordinatorRepo.cancel` runs through consensus, so every
+     * member drops the record, not just the coordinator. Replication cannot be the cure here — this
+     * node is already ahead, and a later forward write carries a DIFFERENT action id, which is not
+     * what `BlockStorage.saveForwardRevision` deletes. A client that dies between the stale result and
+     * its `cancel` therefore still strands the record; that is pre-existing and orthogonal to the
+     * divergence split above.
+     */
     commit(request: CommitRequest, _options?: MessageOptions): Promise<CommitResult>;
+    /**
+     * Delete `actionId`'s pending record from every given block, tolerating absence.
+     *
+     * Called by {@link commit} when it abandons a batch **because this node has diverged from the
+     * agreed history** — the caller has already made that determination; this helper does not
+     * re-derive it. Once `ClusterMember` reconciles the batch, every one of these blocks sits at or
+     * past `request.rev`, so a commit retry partitions them as already-done/stale and never revisits
+     * their pendings; left in place they are reported as phantom conflicting actions by {@link pend}
+     * for every later write to the block (under `policy: 'f'`, forever).
+     *
+     * No special-casing is needed for blocks that already landed (record promoted), that were
+     * `recovered` (record already gone), or for the refusing block itself
+     * ({@link refuseMissingBase} deleted its record): deleting an absent pending record is a no-op on
+     * every backend.
+     *
+     * Per-block failures are logged and swallowed rather than propagated: this cleanup must never
+     * replace the failure the caller is about to report — the pre-loop throw's message is pattern-
+     * matched by `ClusterMember.isMissingPendingActionError`, and a swapped error would misroute
+     * consensus. A leftover record only degrades this node's participation in that one block.
+     */
+    private dropUnpromotablePendings;
     /**
      * Reconciles `metadata.latest` for a single block with the highest contiguous
      * fully-promoted revision in durable storage. Use after a crash between
@@ -131,9 +180,13 @@ export declare class StorageRepo implements IRepo, IBlockChangeNotifier, IBlockR
      * BlockStorage reports every one of these as a bare `Error`, so they cannot be told apart here,
      * and treating them as divergence is the safe default: this node genuinely cannot materialize the
      * base right now, and the cluster's policy is to heal rather than throw out of consensus. The
-     * price is that a transient fault ALSO drops the pending (see {@link refuseMissingBase}), so the
-     * block converges by replication instead of by a replay the retry could have done. Narrowing this
-     * would require typed faults out of BlockStorage; until then, prefer the tolerant reading.
+     * price is that a transient fault ALSO drops pending records — this block's (see
+     * {@link refuseMissingBase}) AND, because {@link commit} keys its cleanup off the same error type,
+     * every not-yet-reached block in the same batch — so those blocks converge by replication instead
+     * of by a replay the retry could have done. That is a wider blast radius than the per-block
+     * refusal alone, and it is why the discriminator must NOT be loosened beyond this error type.
+     * Narrowing this would require typed faults out of BlockStorage; until then, prefer the tolerant
+     * reading.
      */
     private readCommitBase;
     /**

package/dist/src/storage/storage-repo.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"storage-repo.d.ts","sourceRoot":"","sources":["../../../src/storage/storage-repo.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACX,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,EACzG,SAAS,EACH,MAAM,EAAE,SAAS,EACjC,kBAAkB,EAClB,YAAY,EAAE,oBAAoB,EAAE,wBAAwB,EAE5D,MAAM,qBAAqB,CAAC;AAM7B,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,sCAAsC,CAAC;AAK/E;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,GAAI,SAAS,OAAO,KAAG,MAAyC,CAAC;AAE5F;;;;;;;;;GASG;AACH,wBAAsB,oBAAoB,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAOhG;AAED;;;;;GAKG;AACH,eAAO,MAAM,4BAA4B,0BAA0B,CAAC;AAEpE;;;;;;GAMG;AACH,qBAAa,wBAAyB,SAAQ,KAAK;IACtC,QAAQ,CAAC,OAAO,EAAE,OAAO;IAAE,QAAQ,CAAC,GAAG,EAAE,MAAM;gBAAtC,OAAO,EAAE,OAAO,EAAW,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAI3E;AAED;;;;GAIG;AACH,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAE1E;AAED,MAAM,MAAM,kBAAkB,GAAG;IAChC,6DAA6D;IAC7D,YAAY,CAAC,EAAE,kBAAkB,CAAC;CAClC,CAAC;AAEF,qBAAa,WAAY,YAAW,KAAK,EAAE,oBAAoB,EAAE,kBAAkB;IAQjF,OAAO,CAAC,QAAQ,CAAC,kBAAkB;IAPpC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAqB;IACnD,6EAA6E;IAC7E,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA0D;IAC1F,oFAAoF;IACpF,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAuC;gBAGxD,kBAAkB,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,aAAa,EACxE,OAAO,CAAC,EAAE,kBAAkB;IAK7B;;;OAGG;IACH,kBAAkB,CAAC,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,wBAAwB,GAAG,MAAM,IAAI;IAqB9F;;;;;;OAMG;IACH,qBAAqB,CAAC,QAAQ,EAAE,wBAAwB,GAAG,MAAM,IAAI;IAUrE;;;;;;;;;;OAUG;IACH,OAAO,CAAC,qBAAqB;IAiB7B,wHAAwH;IACxH,OAAO,CAAC,mBAAmB;IAUrB,GAAG,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,eAAe,CAAC;IA2KhG;;;;;OAKG;IACH,OAAO,CAAC,cAAc;IAqBhB,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,UAAU,CAAC;IAiH1E,MAAM,CAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAQzE,MAAM,CAAC,OAAO,EAAE,aAAa,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,YAAY,CAAC;IA4LtF;;;;;;OAMG;IACG,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAYnD;;;;;;;;;;OAUG;IACG,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;YAgC/E,cAAc;IAsE5B;;;;;;;;;;;;;;;;;;OAkBG;YACW,cAAc;IAoB5B;;;;;;;;;OASG;YACW,iBAAiB;CAW/B"}
+{"version":3,"file":"storage-repo.d.ts","sourceRoot":"","sources":["../../../src/storage/storage-repo.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACX,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,EACzG,SAAS,EACH,MAAM,EAAE,SAAS,EACjC,kBAAkB,EAClB,YAAY,EAAE,oBAAoB,EAAE,wBAAwB,EAE5D,MAAM,qBAAqB,CAAC;AAM7B,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,sCAAsC,CAAC;AAK/E;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,GAAI,SAAS,OAAO,KAAG,MAAyC,CAAC;AAE5F;;;;;;;;;GASG;AACH,wBAAsB,oBAAoB,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAOhG;AAED;;;;;GAKG;AACH,eAAO,MAAM,4BAA4B,0BAA0B,CAAC;AAEpE;;;;;;GAMG;AACH,qBAAa,wBAAyB,SAAQ,KAAK;IACtC,QAAQ,CAAC,OAAO,EAAE,OAAO;IAAE,QAAQ,CAAC,GAAG,EAAE,MAAM;gBAAtC,OAAO,EAAE,OAAO,EAAW,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAI3E;AAED;;;;GAIG;AACH,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO,CAE1E;AAED,MAAM,MAAM,kBAAkB,GAAG;IAChC,6DAA6D;IAC7D,YAAY,CAAC,EAAE,kBAAkB,CAAC;CAClC,CAAC;AAEF,qBAAa,WAAY,YAAW,KAAK,EAAE,oBAAoB,EAAE,kBAAkB;IAQjF,OAAO,CAAC,QAAQ,CAAC,kBAAkB;IAPpC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAqB;IACnD,6EAA6E;IAC7E,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA0D;IAC1F,oFAAoF;IACpF,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAuC;gBAGxD,kBAAkB,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,aAAa,EACxE,OAAO,CAAC,EAAE,kBAAkB;IAK7B;;;OAGG;IACH,kBAAkB,CAAC,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,wBAAwB,GAAG,MAAM,IAAI;IAqB9F;;;;;;OAMG;IACH,qBAAqB,CAAC,QAAQ,EAAE,wBAAwB,GAAG,MAAM,IAAI;IAUrE;;;;;;;;;;OAUG;IACH,OAAO,CAAC,qBAAqB;IAiB7B,wHAAwH;IACxH,OAAO,CAAC,mBAAmB;IAUrB,GAAG,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,eAAe,CAAC;IA8LhG;;;;;OAKG;IACH,OAAO,CAAC,cAAc;IAqBhB,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,UAAU,CAAC;IAiH1E,MAAM,CAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAQ/E;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACG,MAAM,CAAC,OAAO,EAAE,aAAa,EAAE,QAAQ,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,YAAY,CAAC;IAiNtF;;;;;;;;;;;;;;;;;;;OAmBG;YACW,wBAAwB;IAkBtC;;;;;;OAMG;IACG,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAYnD;;;;;;;;;;OAUG;IACG,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;YAgC/E,cAAc;IAsE5B;;;;;;;;;;;;;;;;;;;;;;OAsBG;YACW,cAAc;IAoB5B;;;;;;;;;OASG;YACW,iBAAiB;CAW/B"}