@serfab/cadre-core 1.17.0 → 1.19.0

package/dist/table-change-watch.js

@@ -0,0 +1,209 @@
+/**
+ * One way for cadre-core to be told that a control or strand table changed, so an idle loop
+ * can wait for a change instead of re-reading on a timer. Built on Quereus's
+ * `Database.watch`, which hears both a commit made on this `Database` and, through the
+ * Optimystic plugin's `notifyExternalChange` bridge, every change this node's storage takes
+ * in from elsewhere: a consensus commit it took part in as a cohort member, a block-transfer
+ * push such as join backfill, and a read-repair landing. Events are table-wide; there are no
+ * row keys.
+ *
+ * The consumer's `onChange` never runs inside a commit. The watch handler only sets flags
+ * and arms a timer, and runs are single-flight: changes inside the coalescing window share
+ * one run, a change during a run produces exactly one follow-up run, and a consumer's own
+ * `trigger` (start, retry backoff) and the backstop go through the same rule.
+ * `docs/architecture.md` → "Table change subscriptions" says what the seam does not hear,
+ * which is why consumers keep a backstop.
+ */
+import debug from 'debug';
+import { defaultTimeoutScheduler } from './timeout-scheduler.js';
+const log = debug('sereus:cadre:table-watch');
+/**
+ * Default coalescing window. One local commit fires the watch twice (Quereus's own
+ * post-commit dispatch, then the plugin's storage event); this folds both into one run.
+ */
+export const TABLE_CHANGE_COALESCE_MS = 50;
+/**
+ * Subscribe `onChange` to changes in `tables` (qualified `'Schema.Table'` names, e.g.
+ * `'CadreControl.Strand'`). Throws synchronously on a name that is not qualified, or a table
+ * that does not exist.
+ *
+ * NOTE: the plugin arms its storage bridge for a table on that table's first full
+ * initialization on this `Database`, so a table not yet touched hears local commits only,
+ * not replicated ones. Consumers' start runs touch their tables; the seam does not, because
+ * touching a never-written collection consults the network.
+ *
+ * NOTE: Quereus silently disposes a subscription whose table is dropped or altered. Control
+ * and strand schemas are fixed for a database's life (an app-schema attach adds `App` tables
+ * and alters no `Strand` one), so nothing re-subscribes; revisit if that stops holding.
+ */
+export function watchTables(db, tables, onChange, options) {
+    return new TableChangeWatcher({ db, tables }, onChange, options);
+}
+/**
+ * {@link watchTables}' schedule — single-flight runs, `trigger`, the backstop — with no table
+ * subscription, for a consumer with no database to watch (tests, fakes).
+ */
+export function scheduleRuns(onChange, options) {
+    return new TableChangeWatcher(undefined, onChange, options);
+}
+/**
+ * The subscriptions one database owner has handed out, so its `close()` can dispose those
+ * still live — synchronously, ahead of its own awaits, so nothing a closing commit does
+ * schedules a run. (`Database.close()` disposes them too, but only after its own awaits.)
+ */
+export class TableWatchRegistry {
+    constructor() {
+        this.live = new Set();
+    }
+    watch(db, tables, onChange, options) {
+        const inner = watchTables(db, tables, onChange, options);
+        const tracked = {
+            trigger: delayMs => inner.trigger(delayMs),
+            dispose: () => {
+                this.live.delete(tracked);
+                inner.dispose();
+            },
+        };
+        this.live.add(tracked);
+        return tracked;
+    }
+    disposeAll() {
+        for (const watch of [...this.live]) {
+            watch.dispose();
+        }
+    }
+}
+class TableChangeWatcher {
+    constructor(watched, onChange, options) {
+        this.onChange = onChange;
+        this.options = options;
+        /** The consumer's name for each watched table, by Quereus's lowercased `schema.table` key. */
+        this.names = new Map();
+        /**
+         * Every armed timer: the coalescing window, `trigger` delays and the backstop. Whichever
+         * fires first starts the run, and starting a run clears the rest.
+         */
+        this.wakes = new Set();
+        this.running = false;
+        /** A timer fired while a run was in flight: one more run, a window after it settles. */
+        this.rerun = false;
+        this.disposed = false;
+        this.warnedThenable = false;
+        this.scheduler = options.scheduler ?? defaultTimeoutScheduler;
+        this.coalesceMs = options.coalesceMs ?? TABLE_CHANGE_COALESCE_MS;
+        this.subscription = watched && this.subscribe(watched);
+        this.armBackstop();
+    }
+    trigger(delayMs = 0) {
+        if (!this.disposed) {
+            this.arm(delayMs);
+        }
+    }
+    dispose() {
+        if (this.disposed) {
+            return;
+        }
+        this.disposed = true;
+        this.subscription?.unsubscribe();
+        this.clearWakes();
+    }
+    subscribe({ db, tables }) {
+        const watches = tables.map(fullTableWatch);
+        watches.forEach((watch, i) => this.names.set(tableKey(watch), tables[i]));
+        const scope = { watches, nonDeterministicSources: [], unboundParameters: [] };
+        // Returns undefined, so Quereus never awaits consumer work inside a commit.
+        return db.watch(scope, event => this.handleChange(event));
+    }
+    /** Runs inside the committing call, possibly under the control write lock: flags and a timer only. */
+    handleChange(event) {
+        if (this.disposed) {
+            return;
+        }
+        this.coalesceWake ?? (this.coalesceWake = this.arm(this.coalesceMs));
+        for (const { watch } of event.matched) {
+            this.invalidate(this.names.get(tableKey(watch)) ?? tableKey(watch));
+        }
+    }
+    invalidate(table) {
+        let result;
+        try {
+            result = this.options.onInvalidate?.(table);
+        }
+        catch (err) {
+            log('%s: onInvalidate threw for %s: %O', this.options.label, table, err);
+            return;
+        }
+        if (!this.warnedThenable && isThenable(result)) {
+            this.warnedThenable = true;
+            log('%s: misuse — onInvalidate returned a promise for %s; it is never awaited, and must only set a flag', this.options.label, table);
+        }
+    }
+    arm(delayMs) {
+        const wake = { handle: undefined };
+        wake.handle = this.scheduler.setTimeout(() => this.fire(wake), delayMs);
+        this.wakes.add(wake);
+        return wake;
+    }
+    armBackstop() {
+        if (this.options.backstopMs !== undefined) {
+            this.arm(this.options.backstopMs);
+        }
+    }
+    clearWakes() {
+        for (const wake of this.wakes) {
+            this.scheduler.clearTimeout(wake.handle);
+        }
+        this.wakes.clear();
+        this.coalesceWake = undefined;
+    }
+    fire(wake) {
+        if (!this.wakes.delete(wake)) {
+            return;
+        }
+        if (wake === this.coalesceWake) {
+            this.coalesceWake = undefined;
+        }
+        if (this.running) {
+            this.rerun = true;
+            return;
+        }
+        this.clearWakes();
+        this.rerun = false;
+        this.running = true;
+        void this.run();
+    }
+    async run() {
+        try {
+            await this.onChange();
+        }
+        catch (err) {
+            log('%s: change run failed: %O', this.options.label, err);
+        }
+        this.running = false;
+        this.settled();
+    }
+    settled() {
+        if (this.disposed) {
+            return;
+        }
+        if (this.rerun) {
+            this.coalesceWake ?? (this.coalesceWake = this.arm(this.coalesceMs));
+        }
+        this.armBackstop();
+    }
+}
+function fullTableWatch(qualifiedTable) {
+    const [schema, table, ...rest] = qualifiedTable.split('.');
+    if (!schema || !table || rest.length > 0) {
+        throw new Error(`watchTables: '${qualifiedTable}' is not a qualified 'Schema.Table' name`);
+    }
+    return { table: { schema, table }, columns: 'all', scope: { kind: 'full' } };
+}
+/** Quereus's own matching key for a watched table. */
+function tableKey(watch) {
+    return `${watch.table.schema}.${watch.table.table}`.toLowerCase();
+}
+function isThenable(value) {
+    return typeof value === 'object' && value !== null && typeof value.then === 'function';
+}
+//# sourceMappingURL=table-change-watch.js.map

package/dist/table-change-watch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"table-change-watch.js","sourceRoot":"","sources":["../src/table-change-watch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,KAAK,MAAM,OAAO,CAAC;AAE1B,OAAO,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAGjE,MAAM,GAAG,GAAG,KAAK,CAAC,0BAA0B,CAAC,CAAC;AAE9C;;;GAGG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC;AA8B3C;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,WAAW,CACzB,EAAY,EACZ,MAAyB,EACzB,QAA6B,EAC7B,OAAgC;IAEhC,OAAO,IAAI,kBAAkB,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AACnE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,QAA6B,EAAE,OAAgC;IAC1F,OAAO,IAAI,kBAAkB,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AAC9D,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAA/B;QACmB,SAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IAyBtD,CAAC;IAvBC,KAAK,CACH,EAAY,EACZ,MAAyB,EACzB,QAA6B,EAC7B,OAAgC;QAEhC,MAAM,KAAK,GAAG,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACzD,MAAM,OAAO,GAAqB;YAChC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YAC1C,OAAO,EAAE,GAAG,EAAE;gBACZ,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBAC1B,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,CAAC;SACF,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,UAAU;QACR,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,KAAK,CAAC,OAAO,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;CACF;AAaD,MAAM,kBAAkB;IAmBtB,YACE,OAAkC,EACjB,QAA6B,EAC7B,OAAgC;QADhC,aAAQ,GAAR,QAAQ,CAAqB;QAC7B,YAAO,GAAP,OAAO,CAAyB;QApBnD,8FAA8F;QAC7E,UAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QAGnD;;;WAGG;QACc,UAAK,GAAG,IAAI,GAAG,EAAQ,CAAC;QAGjC,YAAO,GAAG,KAAK,CAAC;QACxB,wFAAwF;QAChF,UAAK,GAAG,KAAK,CAAC;QACd,aAAQ,GAAG,KAAK,CAAC;QACjB,mBAAc,GAAG,KAAK,CAAC;QAO7B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,uBAAuB,CAAC;QAC9D,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,wBAAwB,CAAC;QACjE,IAAI,CAAC,YAAY,GAAG,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,CAAC,WAAW,EAAE,CAAC;IACrB,CAAC;IAED,OAAO,CAAC,OAAO,GAAG,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,CAAC;QACjC,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAEO,SAAS,CAAC,EAAE,EAAE,EAAE,MAAM,EAAiB;QAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC3C,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,KAAK,GAAgB,EAAE,OAAO,EAAE,uBAAuB,EAAE,EAAE,EAAE,iBAAiB,EAAE,EAAE,EAAE,CAAC;QAC3F,4EAA4E;QAC5E,OAAO,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,sGAAsG;IAC9F,YAAY,CAAC,KAAiB;QACpC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,YAAY,KAAjB,IAAI,CAAC,YAAY,GAAK,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,EAAC;QAChD,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,KAAa;QAC9B,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,GAAG,CAAC,mCAAmC,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YACzE,OAAO;QACT,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;YAC3B,GAAG,CAAC,oGAAoG,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACvI,CAAC;IACH,CAAC;IAEO,GAAG,CAAC,OAAe;QACzB,MAAM,IAAI,GAAS,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;QACzC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;QACxE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,WAAW;QACjB,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YAC1C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAEO,UAAU;QAChB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;IAChC,CAAC;IAEO,IAAI,CAAC,IAAU;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QACD,IAAI,IAAI,KAAK,IAAI,CAAC,YAAY,EAAE,CAAC;YAC/B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;QAChC,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;IAClB,CAAC;IAEO,KAAK,CAAC,GAAG;QACf,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,GAAG,CAAC,2BAA2B,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAEO,OAAO;QACb,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,YAAY,KAAjB,IAAI,CAAC,YAAY,GAAK,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,EAAC;QAClD,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,CAAC;IACrB,CAAC;CACF;AAED,SAAS,cAAc,CAAC,cAAsB;IAC5C,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,iBAAiB,cAAc,0CAA0C,CAAC,CAAC;IAC7F,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;AAC/E,CAAC;AAED,sDAAsD;AACtD,SAAS,QAAQ,CAAC,KAAiB;IACjC,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,WAAW,EAAE,CAAC;AACpE,CAAC;AAED,SAAS,UAAU,CAAC,KAAc;IAChC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,OAAQ,KAA4B,CAAC,IAAI,KAAK,UAAU,CAAC;AACjH,CAAC"}

package/dist/timeout-scheduler.d.ts

@@ -1,7 +1,8 @@
 /**
- * The timer seam shared by the strand bring-up loops that re-arm themselves one step at a
- * time — the first-sync write gate's probe loop (`strand-first-sync-gate.ts`) and the
- * membership reconciler's retry ladder (`strand-membership-reconciler.ts`). `setTimeout`
+ * The timer seam shared by the loops that re-arm themselves one step at a time — the
+ * membership reconciler's retry ladder (`strand-membership-reconciler.ts`) — and by the table
+ * change subscription's coalescing, trigger and backstop timers (`table-change-watch.ts`), on
+ * which the first-sync write gate's probes run (`strand-first-sync-gate.ts`). `setTimeout`
  * rather than a repeating interval because the next step is armed only once the previous
  * one settles, so a slow network read never stacks steps behind it, and because the delay
  * can differ per step.

package/dist/timeout-scheduler.js

@@ -1,7 +1,8 @@
 /**
- * The timer seam shared by the strand bring-up loops that re-arm themselves one step at a
- * time — the first-sync write gate's probe loop (`strand-first-sync-gate.ts`) and the
- * membership reconciler's retry ladder (`strand-membership-reconciler.ts`). `setTimeout`
+ * The timer seam shared by the loops that re-arm themselves one step at a time — the
+ * membership reconciler's retry ladder (`strand-membership-reconciler.ts`) — and by the table
+ * change subscription's coalescing, trigger and backstop timers (`table-change-watch.ts`), on
+ * which the first-sync write gate's probes run (`strand-first-sync-gate.ts`). `setTimeout`
  * rather than a repeating interval because the next step is armed only once the previous
  * one settles, so a slow network read never stacks steps behind it, and because the delay
  * can differ per step.

package/dist/timeout-scheduler.js.map

@@ -1 +1 @@
-{"version":3,"file":"timeout-scheduler.js","sourceRoot":"","sources":["../src/timeout-scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAQH,4DAA4D;AAC5D,MAAM,CAAC,MAAM,uBAAuB,GAAqB;IACvD,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;QACrB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,MAAiC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC7C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,YAAY,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,YAAY,CAAC,MAA4C,CAAC;CACrF,CAAC"}
+{"version":3,"file":"timeout-scheduler.js","sourceRoot":"","sources":["../src/timeout-scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAQH,4DAA4D;AAC5D,MAAM,CAAC,MAAM,uBAAuB,GAAqB;IACvD,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;QACrB,MAAM,MAAM,GAAG,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,MAAiC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC7C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,YAAY,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,YAAY,CAAC,MAA4C,CAAC;CACrF,CAAC"}

package/dist/types.d.ts

@@ -1,7 +1,7 @@
 import type { ConnectionGater, Libp2p, PeerId, PrivateKey } from '@libp2p/interface';
 import type { CircuitRelayServerInit } from '@libp2p/circuit-relay-v2';
 import type { IRawStorage, Libp2pConnectionMonitorInit, Libp2pTransports, NoiseCryptoInterface } from '@optimystic/db-p2p';
-import type { IPeerNetwork, IRepo } from '@optimystic/db-core';
+import type { CollectionChangeListener, IPeerNetwork, IRepo } from '@optimystic/db-core';
 import type { PeerJoinBackfillConfig } from './peer-join-backfill.js';
 import type { StrandReactivityConfig } from './strand-reactivity.js';
 import type { StrandRevocationEnforcementConfig } from './strand-revocation-enforcer.js';
@@ -18,6 +18,7 @@ import type { EnrolledMachineStore } from './enrolled-machine-store.js';
 import type { JoinedStrandStore } from './joined-strand-store.js';
 import type { PushNotifier } from './push-notifier.js';
 import type { CadreInviteSignedFields, OwnerGrantSignedFields, RevocableTable } from './control-authorization.js';
+import type { FoundingInvite } from './control-database.js';
 import type { CadreInvitation } from './cadre-invite-protocol.js';
 import type { OwnerGrantBundle } from './owner-grant-protocol.js';
 import type { RedemptionAddressOutcome } from './member-redemption.js';
@@ -38,6 +39,23 @@ export interface Libp2pNodeWithRepo extends Libp2p {
      * backfill (`peer-join-backfill.ts`) logs once and stays inert when it is absent.
      */
     keyNetwork?: IPeerNetwork;
+    /**
+     * The node's block store, attached by the same factory (Optimystic's
+     * `OptimysticNodeAttachments.storageRepo`), narrowed to the storage-wide change feed: it
+     * fires for every block that lands in this node's store, a push or a commit. Optional for
+     * the same reason as `keyNetwork`; the first-sync gate (`strand-first-sync-gate.ts`) wakes
+     * on it, and logs once and probes on its backstop alone when it is absent.
+     */
+    storageRepo?: {
+        onAnyCollectionChange(listener: CollectionChangeListener): () => void;
+    };
+    /**
+     * Tells the node a peer holds a block at a revision or later (Optimystic's
+     * `OptimysticNodeAttachments.reportBlockHeld`), so its under-replication drain and rebalance
+     * monitor do not push that peer the same block again. Optional for the same reason as
+     * `keyNetwork`; the join catch-up (`peer-join-backfill.ts`) reports each block a peer accepted.
+     */
+    reportBlockHeld?: (blockId: string, rev: number, peerId: string) => Promise<void>;
 }
 /**
  * Node profile determines storage participation
@@ -546,8 +564,13 @@ export interface NetworkConfig {
          */
         targetDegree?: number;
         /**
-         * Recurring reconcile cadence in ms. Defaults to
-         * {@link DEFAULT_CONTROL_COHORT_RECONCILE_MS}.
+         * The reconcile pass's backstop in ms: a pass runs this long after the last one
+         * settled when nothing has started one sooner (a membership table change, a sibling
+         * connecting or disconnecting, an address change, a redial or strand-address wake).
+         * It also caps the redial ladder. Defaults to
+         * {@link DEFAULT_CONTROL_COHORT_RECONCILE_MS} (2 minutes). The membership rows view's
+         * maximum age (`MEMBERSHIP_VIEW_MAX_AGE_MS`, 15 s) does not follow this field: a backstop
+         * longer than it reads storage on every backstop pass, a shorter one every 15 s at most.
          */
         reconcileMs?: number;
         /**
@@ -615,10 +638,10 @@ export interface NetworkConfig {
  * pinging node's monitor sees the reset and aborts the connection exactly as it would on its
  * own timeout. So this deadline is only real up to the handler timeout of the node being
  * pinged, which has to stay above it. The deployed relay sets its handler to 60 s for that
- * reason (`ops/docker/libp2p-infra/src/main.ts`). Every cadre node's handler is Optimystic's
- * bare `ping()`, `@libp2p/ping`'s 10 s, and nothing here can move it
- * (`tickets/blocked/optimystic-ping-handler-timeout-below-the-monitor-deadline.md`): between
- * two cadre nodes, a ping whose echo takes longer than 10 s still drops the connection.
+ * reason (`ops/docker/libp2p-infra/src/main.ts`). Every cadre node's handler is Optimystic's,
+ * which derives it from this object: twice `pingTimeout.maxTimeout`, so 60 s
+ * (`NodeOptions.pingHandlerTimeoutMs`, unset here, since Optimystic 1.16.0). An app that
+ * replaces this object without a `pingTimeout` gets `@libp2p/ping`'s 10 s handler back.
  *
  * WHAT THE LINK NEEDS OF IT. One ping opens a fresh stream and echoes over it: a protocol
  * negotiation plus the echo, two link round trips by `link-budget.ts`'s counts (a `newStream`
@@ -783,10 +806,11 @@ export interface CadreNodeConfig {
     strandClusterSize?: number;
     /**
      * Tuning for the strand peer-join block catch-up (see `peer-join-backfill.ts`):
-     * when a strand's libp2p node connects to a peer this runtime has not yet
-     * caught up, every block in the strand's own raw store is pushed to that peer,
-     * so a machine that joined the strand after blocks were committed still ends
-     * up physically holding them. Applies to every strand this node starts.
+     * when a strand's libp2p node connects (or reconnects) to a peer, every
+     * block in the strand's own raw store that the peer is not
+     * known to hold is pushed to it, each block once per peer, so a machine that
+     * joined the strand after blocks were committed still ends up physically
+     * holding them. Applies to every strand this node starts.
      * Omit for the defaults (`DEFAULT_PEER_JOIN_BACKFILL`); `{ enabled: false }`
      * restores the no-backfill behaviour. The control network runs its own,
      * separately tuned catch-up — see {@link controlBackfill}.
@@ -813,13 +837,14 @@ export interface CadreNodeConfig {
     /**
      * Tuning for the CONTROL network's peer-join block catch-up (same module,
      * `peer-join-backfill.ts`, wired in `CadreNode.start`): when the control
-     * libp2p node connects to an AUTHORIZED party member this runtime has not yet
-     * caught up, every block in the control database's own raw store is pushed to
-     * it. This is what makes a control block committed while the writer was alone
-     * (collection headers written at genesis above all) physically reach members
-     * that joined later — without it, such a member that restarts offline reads
-     * the affected tables as empty. Pushes are gated on
-     * `CadreNode.isAuthorizedMember`, checked at push time, because the control
+     * libp2p node connects (or reconnects) to an AUTHORIZED party member, every
+     * block in the control database's own raw store that the
+     * member is not known to hold is pushed to it. This is what makes a control
+     * block committed while the writer was alone (collection headers written at
+     * genesis above all) physically reach members that joined later — without it,
+     * such a member that restarts offline reads the affected tables as empty.
+     * Pushes are gated on the node's authorized-member snapshot (the rule
+     * `CadreNode.isAuthorizedMember` reads), checked at push time, because the control
      * network's inbound gate deliberately admits non-members in several states
      * (seed delivery, enrollment, bootstrap/relay peers). Omit for the defaults
      * (`DEFAULT_PEER_JOIN_BACKFILL`); `{ enabled: false }` disables it.
@@ -831,9 +856,10 @@ export interface CadreNodeConfig {
      * starts: each strand node materializes the peer ids bound to REMOVED members
      * (orphaned `Strand.MemberPeer` rows) and refuses them at the stream and
      * connection layers, so removing a party cuts the network to its machines
-     * rather than only deleting its row. Open strands never arm it. Omit for the
-     * defaults (`DEFAULT_REVOCATION_POLL_INTERVAL_MS` refresh cadence);
-     * `{ enabled: false }` restores the pre-existing behaviour.
+     * rather than only deleting its row. Open strands never arm it. Each strand
+     * re-reads its membership when `Strand.Member` or `Strand.MemberPeer` changes,
+     * and at the latest every `DEFAULT_REVOCATION_BACKSTOP_MS`. Omit for the
+     * defaults; `{ enabled: false }` restores the pre-existing behaviour.
      */
     strandRevocationEnforcement?: StrandRevocationEnforcementConfig;
     /**
@@ -845,9 +871,8 @@ export interface CadreNodeConfig {
      * background without blocking bring-up. `pollIntervalMs` is the IDLE cadence
      * (how often a machine nobody has admitted re-checks) and the cap of the
      * unfinished-join retry ladder, NOT the retry cadence itself — an unfinished
-     * join retries from 1 s, doubling. Omit for the defaults (it mirrors
-     * {@link strandRevocationEnforcement}'s `pollIntervalMs`);
-     * `{ enabled: false }` disarms the loop — for test fixtures that hand-drive
+     * join retries from 1 s, doubling. Omit for the defaults
+     * (`DEFAULT_MEMBERSHIP_RECONCILE_INTERVAL_MS`); `{ enabled: false }` disarms the loop — for test fixtures that hand-drive
      * the membership writers and assert exact row sets.
      */
     strandMembershipReconciliation?: StrandMembershipReconciliationConfig;
@@ -856,21 +881,27 @@ export interface CadreNodeConfig {
      * (`strand-first-sync-gate.ts`), applied to every strand this node launches as a
      * non-founder: the strand's database is withheld from the app (`StrandInstance.database`
      * unset, status `'syncing'`) until the strand's `Strand.Header` has been received from
-     * another member and every `App` table has been read once, because a machine that writes
-     * to a table it has never fetched creates a private copy of it that never merges.
+     * another member and every `Strand` and `App` table has been read once, because a
+     * machine that writes to a table it has never fetched creates a private copy of it that
+     * never merges.
      * `timeoutMs` bounds how long {@link CadreNode.addStrand} waits before rejecting with
-     * `StrandAwaitingFirstSyncError` (retryable — the launch stays up and keeps probing);
-     * `pollIntervalMs` is the probe cadence. Omit for the defaults (`DEFAULT_STRAND_FIRST_SYNC_TIMEOUT_MS`,
+     * `StrandAwaitingFirstSyncError` (retryable — the launch stays up and keeps probing).
+     * While gated the machine probes whenever data lands in the strand's store, and
+     * `backstopMs` after its last probe when none has. Omit for the defaults (`DEFAULT_STRAND_FIRST_SYNC_TIMEOUT_MS`,
      * sized for a machine re-attaching through a relay on a slow link, the slowest attach
      * measured; that constant's doc comment carries the number, the measurement behind it and
-     * what the budget costs, and is the only copy of them; `DEFAULT_STRAND_FIRST_SYNC_POLL_MS`,
-     * 500 ms). There is deliberately no way to disable the gate: a machine whose store already
+     * what the budget costs, and is the only copy of them; `DEFAULT_STRAND_FIRST_SYNC_BACKSTOP_MS`,
+     * 2 s). There is deliberately no way to disable the gate: a machine whose store already
      * holds the Header is never gated, so nothing that works today is blocked by it.
      */
     strandFirstSync?: StrandFirstSyncConfig;
     /** Hibernation configuration */
     hibernation?: HibernationConfig;
-    /** Polling interval for strand watcher in ms (default: 5000) */
+    /**
+     * The strand watcher's backstop in ms (default 300000): the longest it goes without
+     * re-reading `Strand` and `JoinedStrand` when no change to them is heard. It otherwise runs
+     * on a change. Also caps the first step of its retry ladders, which is 5 s otherwise.
+     */
     strandWatchInterval?: number;
     /**
      * Require a valid author signature on every sApp schema before a strand is
@@ -1363,6 +1394,14 @@ export interface FoundStrandConfig {
     memberPrivateKey?: string;
     /** sApp configuration the hosting application provides, as for {@link StrandConfig}. */
     sAppConfig: SAppConfig;
+    /**
+     * A formation invitation to publish bound to this strand, for the app `sAppConfig.id`, in the
+     * same control transaction and owner approval as the strand row. Mint it first with
+     * `createOpenInvitation` (its `expiration` is `expiresAtMs`). When the strand is already
+     * published the invitation is published on its own, under its own approval, as
+     * `publishFormationInvite` would; one already stored under `token` for this strand is kept.
+     */
+    formationInvite?: Omit<FoundingInvite, 'sAppId'>;
     /**
      * Forwarded to the attach ({@link StrandConfig.awaitFirstSync}). Matters only when the
      * call ATTACHES rather than founds — the stored row was published by a sibling machine
@@ -1682,10 +1721,10 @@ export interface CadreNodeEvents {
      * row is the product of the formation's consent, so claiming it needs no second one.
      *
      * **Fired once per strand per session, and it can fire before your listener is
-     * attached.** The strand watcher's first poll runs inside `CadreNode.start()`
+     * attached.** The strand watcher's first run is inside `CadreNode.start()`
      * (100 ms after the watcher starts), so every strand already stored for this
      * party is normally offered while the embedding app is still inside its own
-     * `start()` await. The watcher then records the strand as seen and no later poll
+     * `start()` await. The watcher then records the strand as seen and no later run
      * re-offers it, so a listener attached a moment late misses those strands for the
      * life of the process.
      *
@@ -1746,10 +1785,17 @@ export interface CadreNodeEvents {
         partyId: string;
         peerId: string;
     };
-    /** Emitted when a seed is successfully applied */
+    /**
+     * Emitted when a seed delivered over the seed protocol has been verified, merged and
+     * acknowledged to its sender. The dials of its preferred peers follow this event, so it
+     * waits on no connection. `dialTargets` are those peers (`seedDialTargets`): an embedder
+     * that restarts into another party's stores carries them there, since this node retained
+     * them in its own.
+     */
     'seed:applied': {
         partyId: string;
         peersAdded: number;
+        dialTargets: SeedDialTarget[];
     };
     /** Emitted when seed application fails */
     'seed:error': {
@@ -1761,10 +1807,10 @@ export interface CadreNodeEvents {
      * valid claim proof has been recorded (`claim.record`) and has durably anchored its
      * signer as this node's owner. Carries the claim's party beside the owner key: the
      * party this node should serve from now on, which its own config did not know. Fires
-     * BEFORE the seed is acknowledged to the claimant, its peers merged and its owners
-     * dialed, so it precedes that seed's `seed:applied`; an embedder that restarts into
-     * the claimed party on this event should wait for that `seed:applied` (or `seed:error`)
-     * so the acknowledgement is not lost with the node. `CadreNode.isAwaitingClaim` is the
+     * BEFORE the seed is acknowledged to the claimant and its peers merged, so it precedes
+     * that seed's `seed:applied`; an embedder that restarts into the claimed party on this
+     * event should wait for that `seed:applied` (or `seed:error`) so the acknowledgement is
+     * not lost with the node. `CadreNode.isAwaitingClaim` is the
      * matching predicate for a reader that subscribed too late to see the event.
      */
     'claim:accepted': NodeClaimRecord;
@@ -2007,7 +2053,7 @@ export interface CadreOwnerKey {
 }
 /** Why `CadreNode.addOwner` refuses by name (`OwnerKeyAddRefusedError.code`). */
 export type OwnerKeyAddRefusal = 
-/** No control connection while the party has other members: the row would stay on this node, and nothing re-issues an `OwnerKey` add. */
+/** No sibling reachable (`CadreNode.hasReachableControlSibling`) while the party has other members: the row would stay on this node, and nothing re-issues an `OwnerKey` add. */
 'alone';
 /** Why `CadreNode.removeMachine` refuses by name (`MachineRemovalRefusedError.code`). */
 export type MachineRemovalRefusal = 
@@ -2044,7 +2090,7 @@ export type OwnerKeyRemovalRefusal =
  | 'last-owner'
 /** The key is this node's own owner key: an owner cannot sign its own row's removal (`A.Key <> old.Key`), so ask another owner key. */
  | 'self'
-/** A re-vouch of an `OwnerKey` row was asked for while this node has no control connection and the party has other members: the re-added row has no re-issue path. Decided at call time, so never planned. */
+/** A re-vouch of an `OwnerKey` row was asked for while this node reaches no sibling and the party has other members: the re-added row has no re-issue path. Decided at call time, so never planned. */
  | 'alone';
 /** The rows sharing the owner keys' voucher column that a removed owner key strands unless re-vouched first. */
 export interface OwnerKeyDependents {
@@ -2148,8 +2194,8 @@ export interface OwnerGrantRedemptionResult {
  * `ControlDatabase.queryRevocations`: the identity triple plus the `ReissuedAt`
  * counter an owner bumps (`ControlDatabase.reissueRevocations`) to re-write — and
  * therefore re-broadcast — a tombstone that committed while the node was alone.
- * Never the ledger marker: that row names no guarded table, and `queryRevocations`
- * skips it, which is what keeps `tableName` a {@link RevocableTable}.
+ * Never the ledger marker an older party may hold: that row names no guarded table, and
+ * `queryRevocations` skips it, which is what keeps `tableName` a {@link RevocableTable}.
  */
 export interface RevocationRow {
     /** Which guarded table's stamp was retired. */
@@ -2165,13 +2211,6 @@ export interface RevocationRow {
     /** That owner's signature over the tombstone's `'remove'` digest (`Revocation.SignerSig`). */
     signerSig: string;
 }
-/**
- * Outcome of `ControlDatabase.openRevocationLedger`: `'opened'` when this call filed the
- * singleton `Revocation` ledger marker, `'already-open'` when it was already filed (seen
- * by the in-lock guard, or filed first by another owner and refused on the primary key).
- * Either way the marker exists afterwards.
- */
-export type RevocationLedgerOpenResult = 'opened' | 'already-open';
 /**
  * Outcome of {@link CadreNode.registerSelf}, surfaced so callers (e.g. the CLI
  * `--owner` branch) can log what happened:
@@ -2347,6 +2386,8 @@ export interface SeedPeer {
      */
     preferred: boolean;
 }
+/** A peer a seed nominates for dialing, and the addresses to dial it at (`seedDialTargets`). */
+export type SeedDialTarget = Pick<SeedPeer, 'peerId' | 'multiaddrs'>;
 /**
  * Control network seed for bootstrapping new nodes.
  * Pre-populates a new node's cache to solve the cold-start problem:

package/dist/types.js

@@ -71,10 +71,10 @@ export const HIBERNATION_TIMEOUTS = {
  * pinging node's monitor sees the reset and aborts the connection exactly as it would on its
  * own timeout. So this deadline is only real up to the handler timeout of the node being
  * pinged, which has to stay above it. The deployed relay sets its handler to 60 s for that
- * reason (`ops/docker/libp2p-infra/src/main.ts`). Every cadre node's handler is Optimystic's
- * bare `ping()`, `@libp2p/ping`'s 10 s, and nothing here can move it
- * (`tickets/blocked/optimystic-ping-handler-timeout-below-the-monitor-deadline.md`): between
- * two cadre nodes, a ping whose echo takes longer than 10 s still drops the connection.
+ * reason (`ops/docker/libp2p-infra/src/main.ts`). Every cadre node's handler is Optimystic's,
+ * which derives it from this object: twice `pingTimeout.maxTimeout`, so 60 s
+ * (`NodeOptions.pingHandlerTimeoutMs`, unset here, since Optimystic 1.16.0). An app that
+ * replaces this object without a `pingTimeout` gets `@libp2p/ping`'s 10 s handler back.
  *
  * WHAT THE LINK NEEDS OF IT. One ping opens a fresh stream and echoes over it: a protocol
  * negotiation plus the echo, two link round trips by `link-budget.ts`'s counts (a `newStream`

package/dist/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AA0FA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAA6C;IAC5E,QAAQ,EAAE;QACR,WAAW,EAAE,QAAQ,EAAS,aAAa;QAC3C,gBAAgB,EAAE,QAAQ,EAAI,kBAAkB;QAChD,eAAe,EAAE,QAAQ,EAAK,MAAM;QACpC,oBAAoB,EAAE,CAAC;QACvB,kBAAkB,EAAE,QAAQ,CAAE,MAAM;KACrC;IACD,WAAW,EAAE;QACX,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAI,YAAY;QAC1C,gBAAgB,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,wBAAwB;QAC1D,eAAe,EAAE,EAAE,GAAG,IAAI,EAAI,mBAAmB;QACjD,oBAAoB,EAAE,CAAC;QACvB,kBAAkB,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,eAAe;KACnD;IACD,UAAU,EAAE;QACV,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAI,WAAW;QACzC,gBAAgB,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAG,uBAAuB;QACzD,eAAe,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAI,kBAAkB;QACpD,oBAAoB,EAAE,CAAC;QACvB,kBAAkB,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,gBAAgB;KACxD;IACD,OAAO,EAAE;QACP,WAAW,EAAE,EAAE,GAAG,IAAI,EAAQ,aAAa;QAC3C,gBAAgB,EAAE,EAAE,GAAG,IAAI,EAAG,wBAAwB;QACtD,eAAe,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,EAAG,eAAe;QACjD,oBAAoB,EAAE,CAAC;QACvB,kBAAkB,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,eAAe;KAC5D;CACF,CAAC;AAweF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6DG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,MAAM,CAAC,MAAM,CAAC;IACtD,uFAAuF;IACvF,mFAAmF;IACnF,YAAY,EAAE,KAAM;IACpB,kFAAkF;IAClF,kFAAkF;IAClF,mBAAmB;IACnB,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,KAAM,EAAE,UAAU,EAAE,KAAM,EAAE,CAAC;CACjC,CAAC,CAAC;AAmBzC;;;GAGG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,GAAG,IAAI,CAAC;AAYnD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,EACL,gBAAgB,EAChB,uBAAuB,EACvB,2BAA2B,EAC3B,sBAAsB,EACtB,2BAA2B,EAC3B,qBAAqB,EACrB,wBAAwB,EACxB,sBAAsB,EACtB,oBAAoB,EACpB,mBAAmB,EACpB,MAAM,+BAA+B,CAAC;AAEvC;;;;;GAKG;AACH,OAAO,EAAE,2BAA2B,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AA0GA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAA6C;IAC5E,QAAQ,EAAE;QACR,WAAW,EAAE,QAAQ,EAAS,aAAa;QAC3C,gBAAgB,EAAE,QAAQ,EAAI,kBAAkB;QAChD,eAAe,EAAE,QAAQ,EAAK,MAAM;QACpC,oBAAoB,EAAE,CAAC;QACvB,kBAAkB,EAAE,QAAQ,CAAE,MAAM;KACrC;IACD,WAAW,EAAE;QACX,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAI,YAAY;QAC1C,gBAAgB,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,wBAAwB;QAC1D,eAAe,EAAE,EAAE,GAAG,IAAI,EAAI,mBAAmB;QACjD,oBAAoB,EAAE,CAAC;QACvB,kBAAkB,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,eAAe;KACnD;IACD,UAAU,EAAE;QACV,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAI,WAAW;QACzC,gBAAgB,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAG,uBAAuB;QACzD,eAAe,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAI,kBAAkB;QACpD,oBAAoB,EAAE,CAAC;QACvB,kBAAkB,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,gBAAgB;KACxD;IACD,OAAO,EAAE;QACP,WAAW,EAAE,EAAE,GAAG,IAAI,EAAQ,aAAa;QAC3C,gBAAgB,EAAE,EAAE,GAAG,IAAI,EAAG,wBAAwB;QACtD,eAAe,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,EAAG,eAAe;QACjD,oBAAoB,EAAE,CAAC;QACvB,kBAAkB,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,eAAe;KAC5D;CACF,CAAC;AA6eF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6DG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,MAAM,CAAC,MAAM,CAAC;IACtD,uFAAuF;IACvF,mFAAmF;IACnF,YAAY,EAAE,KAAM;IACpB,kFAAkF;IAClF,kFAAkF;IAClF,mBAAmB;IACnB,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,KAAM,EAAE,UAAU,EAAE,KAAM,EAAE,CAAC;CACjC,CAAC,CAAC;AAmBzC;;;GAGG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,GAAG,IAAI,CAAC;AAYnD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,OAAO,EACL,gBAAgB,EAChB,uBAAuB,EACvB,2BAA2B,EAC3B,sBAAsB,EACtB,2BAA2B,EAC3B,qBAAqB,EACrB,wBAAwB,EACxB,sBAAsB,EACtB,oBAAoB,EACpB,mBAAmB,EACpB,MAAM,+BAA+B,CAAC;AAEvC;;;;;GAKG;AACH,OAAO,EAAE,2BAA2B,EAAE,MAAM,kBAAkB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@serfab/cadre-core",
-  "version": "1.17.0",
+  "version": "1.19.0",
   "type": "module",
   "description": "Core library for Sereus cadre nodes - manages control networks and strand participation",
   "main": "dist/index.js",
@@ -90,7 +90,7 @@
     "@libp2p/logger": "^6.2.13",
     "@libp2p/peer-store": "^12.0.28",
     "@libp2p/webrtc": "6.0.33",
-    "@optimystic/db-p2p-storage-fs": "^1.15.0",
+    "@optimystic/db-p2p-storage-fs": "^1.19.0",
     "@types/debug": "^4.1.12",
     "@types/node": "^25.0.10",
     "@vitest/coverage-v8": "^4.0.17",
@@ -111,12 +111,12 @@
     "@multiformats/multiaddr": "^13.0.3",
     "@noble/ciphers": "^2.0.1",
     "@noble/hashes": "^2.0.0",
-    "@optimystic/db-core": "^1.15.0",
-    "@optimystic/db-p2p": "^1.15.0",
-    "@optimystic/quereus-plugin-crypto": "^1.15.0",
-    "@optimystic/quereus-plugin-optimystic": "^1.15.0",
-    "@quereus/quereus": "^4.20.1",
-    "@serfab/quereus-plugin-sereus": "^1.17.0",
+    "@optimystic/db-core": "^1.19.0",
+    "@optimystic/db-p2p": "^1.19.0",
+    "@optimystic/quereus-plugin-crypto": "^1.19.0",
+    "@optimystic/quereus-plugin-optimystic": "^1.19.0",
+    "@quereus/quereus": "^4.20.3",
+    "@serfab/quereus-plugin-sereus": "^1.19.0",
     "debug": "^4.4.3",
     "libp2p": "^3.3.11",
     "uint8arrays": "^6.1.1"