@optimystic/db-p2p 1.0.0-beta.2 → 1.0.0

package/dist/src/repo/kv-under-replication-ledger.js

@@ -0,0 +1,287 @@
+import { createLogger } from "../logger.js";
+const log = createLogger('under-replication-ledger');
+/**
+ * Key namespace: `under-replicated/<blockId>` → JSON(UnderReplicatedEntry). A fixed literal first
+ * segment, which is what keeps this store safe to share a base path with `FileRawStorage` — see
+ * the NOTE on `FileKVStore.keyToPath` for the condition sharing would break under.
+ */
+export const UNDER_REPLICATED_KEY_PREFIX = 'under-replicated/';
+/**
+ * The backstop cap. Generous on purpose: the drain's give-up counter is what retires entries, and
+ * this only stops a node whose partner never returns from growing the ledger without limit.
+ * NOTE: every entry is one small file under `FileKVStore` and one block id held in memory by the
+ * eviction index; if a deployment ever sits at this cap, measure both before raising it.
+ */
+export const DEFAULT_UNDER_REPLICATION_MAX_ENTRIES = 100_000;
+const SHORTFALL_QUORUMS = ['majority', 'local', 'unrouted'];
+/**
+ * {@link IUnderReplicationLedger} over the portable {@link IKVStore}, the same shape
+ * `PersistentTransactionStateStore` uses for its node-local state.
+ *
+ * Two pieces of in-memory state sit beside the store, neither authoritative:
+ * - a per-block operation queue, so each read-compare-write is atomic against the others for the
+ *   same block (`IKVStore` has no compare-and-set);
+ * - an eviction index of recorded block ids in oldest-first order, loaded lazily from the store on
+ *   the first mutation, so enforcing `maxEntries` costs neither a directory listing nor a read per
+ *   record. It is only as good as this instance's ownership of the key prefix — the reason the
+ *   interface scopes its guarantees to one instance per store.
+ */
+export class KvUnderReplicationLedger {
+    kv;
+    maxEntries;
+    queues = new Map();
+    indexLoad;
+    constructor(kv, options) {
+        this.kv = kv;
+        const maxEntries = options?.maxEntries ?? DEFAULT_UNDER_REPLICATION_MAX_ENTRIES;
+        if (!Number.isInteger(maxEntries) || maxEntries < 1) {
+            throw new Error(`KvUnderReplicationLedger: maxEntries must be a positive integer, got ${maxEntries}`);
+        }
+        this.maxEntries = maxEntries;
+    }
+    async record(entry) {
+        await this.serialized(entry.blockId, async () => {
+            const index = await this.index();
+            const existing = await this.read(entry.blockId);
+            if (existing !== undefined && existing.rev > entry.rev) {
+                log('record:skip-lower-rev %o', { blockId: entry.blockId, rev: entry.rev, recordedRev: existing.rev });
+                return;
+            }
+            const sameShortfall = existing !== undefined && existing.rev === entry.rev;
+            const stored = sameShortfall
+                ? { ...entry, recordedAt: existing.recordedAt, attempts: existing.attempts }
+                : entry;
+            await this.kv.set(keyFor(entry.blockId), JSON.stringify(stored));
+            if (!sameShortfall) {
+                // A new shortfall is the newest one: move it to the young end of the eviction order.
+                index.delete(entry.blockId);
+                index.add(entry.blockId);
+            }
+        });
+        await this.evictBeyondCap();
+    }
+    async settle(blockId, rev) {
+        await this.serialized(blockId, async () => {
+            // Every fully replicated commit settles each of its blocks, and almost none has an entry:
+            // answer those from the index instead of a store read. An entry missing from the index is
+            // one `read` would report absent anyway (malformed), so nothing is skipped that could be settled.
+            const index = await this.index();
+            if (!index.has(blockId))
+                return;
+            const existing = await this.read(blockId);
+            if (existing === undefined)
+                return;
+            if (existing.rev > rev) {
+                log('settle:keep-higher-rev %o', { blockId, rev, recordedRev: existing.rev });
+                return;
+            }
+            await this.remove(blockId);
+        });
+    }
+    async get(blockId) {
+        return this.read(blockId);
+    }
+    /**
+     * A full scan. The FIRST scan after start also becomes the eviction index's load, so the drain's
+     * start pass warms the index for free and the first commit after a restart finds it loaded
+     * instead of paying for the scan itself.
+     */
+    async list() {
+        if (this.indexLoad === undefined) {
+            const scan = this.scan();
+            this.indexLoad = this.indexFrom(scan);
+            return scan;
+        }
+        return this.scan();
+    }
+    async size() {
+        return (await this.index()).size;
+    }
+    async scan() {
+        const keys = await this.kv.list(UNDER_REPLICATED_KEY_PREFIX);
+        const entries = [];
+        // Sequential on purpose: a ledger at its cap under `FileKVStore` is that many files, and
+        // opening them all at once would trade a slower scan for file-descriptor exhaustion.
+        for (const key of keys) {
+            const entry = await this.read(key.slice(UNDER_REPLICATED_KEY_PREFIX.length));
+            if (entry !== undefined)
+                entries.push(entry);
+        }
+        return entries.sort((a, b) => a.recordedAt - b.recordedAt);
+    }
+    async satisfy(blockId, peerIds, heldRev) {
+        return this.serialized(blockId, async () => {
+            const existing = await this.read(blockId);
+            if (existing === undefined)
+                return undefined;
+            if (heldRev !== undefined && existing.rev > heldRev) {
+                log('satisfy:keep-higher-rev %o', { blockId, heldRev, recordedRev: existing.rev });
+                return existing;
+            }
+            // Unknown is not empty: see `IUnderReplicationLedger.satisfy`.
+            if (existing.missingPeerIds.length === 0)
+                return existing;
+            const confirmed = new Set(peerIds);
+            const remaining = existing.missingPeerIds.filter(peerId => !confirmed.has(peerId));
+            if (remaining.length === 0) {
+                await this.remove(blockId);
+                return undefined;
+            }
+            if (remaining.length === existing.missingPeerIds.length)
+                return existing;
+            const updated = { ...existing, missingPeerIds: remaining };
+            await this.kv.set(keyFor(blockId), JSON.stringify(updated));
+            return updated;
+        });
+    }
+    async name(blockId, rev, missingPeerIds) {
+        return this.serialized(blockId, async () => {
+            const existing = await this.read(blockId);
+            if (existing === undefined)
+                return undefined;
+            if (existing.rev !== rev) {
+                log('name:keep-other-rev %o', { blockId, rev, recordedRev: existing.rev });
+                return existing;
+            }
+            if (existing.missingPeerIds.length > 0)
+                return existing;
+            const updated = { ...existing, missingPeerIds: [...missingPeerIds] };
+            await this.kv.set(keyFor(blockId), JSON.stringify(updated));
+            return updated;
+        });
+    }
+    async noteAttempt(blockId) {
+        await this.serialized(blockId, async () => {
+            const existing = await this.read(blockId);
+            if (existing === undefined)
+                return;
+            const updated = { ...existing, attempts: existing.attempts + 1 };
+            await this.kv.set(keyFor(blockId), JSON.stringify(updated));
+        });
+    }
+    async delete(blockId) {
+        await this.serialized(blockId, () => this.remove(blockId));
+    }
+    /** Delete from the store and the eviction index. Callers hold the block's queue. */
+    async remove(blockId) {
+        const index = await this.index();
+        await this.kv.delete(keyFor(blockId));
+        index.delete(blockId);
+    }
+    /**
+     * Evict oldest-recorded entries until the ledger is back within `maxEntries`. Runs AFTER the
+     * recording block's queue is released and takes each victim's own queue, so no call ever holds
+     * two blocks' queues at once and two recordings evicting each other cannot deadlock. A victim a
+     * concurrent operation already removed is skipped, and the loop re-measures, so concurrent
+     * recordings at the cap never evict more than the overflow.
+     *
+     * An eviction failure is logged and ends the pass rather than failing the recording that
+     * triggered it: that entry is already written, and the next recording tries again.
+     */
+    async evictBeyondCap() {
+        const index = await this.index();
+        while (index.size > this.maxEntries) {
+            const victim = index.values().next().value;
+            if (victim === undefined)
+                return;
+            try {
+                await this.serialized(victim, async () => {
+                    if (!index.has(victim))
+                        return;
+                    await this.remove(victim);
+                    log('evict:over-cap %o', { blockId: victim, maxEntries: this.maxEntries });
+                });
+            }
+            catch (err) {
+                log.error('evict:failed %o', { blockId: victim, error: err.message });
+                return;
+            }
+        }
+    }
+    /**
+     * The eviction index, loaded once from the store: every entry's block id, oldest `recordedAt`
+     * first. A failed load is not cached, so the next mutation retries it instead of the ledger
+     * failing every write for the life of the process.
+     *
+     * NOTE: the load is one read per stored entry. It runs on the first `list`, `size` or mutation
+     * after start. With the drain wired that is its start pass on every node — `list` when a pushable
+     * peer is connected, otherwise the `size` that decides whether to arm its re-check — so the load
+     * runs at boot, off the commit path; without the drain it is the first commit. A solo node keeps
+     * an entry per block it writes, so a commit that arrives before the load finishes still waits on
+     * it and can stall on slow storage — see
+     * `backlog/debt-solo-node-ledger-is-reread-whole-on-first-commit-after-restart`.
+     */
+    index() {
+        if (this.indexLoad === undefined) {
+            this.indexLoad = this.indexFrom(this.scan());
+        }
+        return this.indexLoad;
+    }
+    indexFrom(scan) {
+        return scan
+            .then(entries => new Set(entries.map(entry => entry.blockId)))
+            .catch((err) => {
+            this.indexLoad = undefined;
+            throw err;
+        });
+    }
+    async read(blockId) {
+        const raw = await this.kv.get(keyFor(blockId));
+        return raw === undefined ? undefined : parseEntry(blockId, raw);
+    }
+    /**
+     * Run `operation` after every earlier operation queued for `blockId`, whatever their outcome.
+     * The queue entry is dropped once nothing is waiting behind it, so the map holds only blocks with
+     * work in flight.
+     */
+    async serialized(blockId, operation) {
+        const previous = this.queues.get(blockId) ?? Promise.resolve();
+        const run = previous.then(operation);
+        const tail = run.then(() => undefined, () => undefined);
+        this.queues.set(blockId, tail);
+        try {
+            return await run;
+        }
+        finally {
+            if (this.queues.get(blockId) === tail)
+                this.queues.delete(blockId);
+        }
+    }
+}
+function keyFor(blockId) {
+    return `${UNDER_REPLICATED_KEY_PREFIX}${blockId}`;
+}
+/**
+ * An entry as stored, or `undefined` for one that is not a well-formed entry for `blockId`. Stored
+ * bytes are this class's own output, but they outlive the process that wrote them, so they are
+ * checked rather than cast. A malformed entry is logged and read as absent — never deleted by a
+ * read — and the next recording for the block overwrites it.
+ */
+function parseEntry(blockId, raw) {
+    let value;
+    try {
+        value = JSON.parse(raw);
+    }
+    catch (err) {
+        log.error('read:unparseable %o', { blockId, error: err.message });
+        return undefined;
+    }
+    if (!isEntryFor(blockId, value)) {
+        log.error('read:malformed %o', { blockId, raw });
+        return undefined;
+    }
+    return value;
+}
+function isEntryFor(blockId, value) {
+    if (typeof value !== 'object' || value === null)
+        return false;
+    const entry = value;
+    return entry.blockId === blockId
+        && Number.isInteger(entry.rev)
+        && typeof entry.actionId === 'string'
+        && SHORTFALL_QUORUMS.includes(entry.quorum)
+        && Array.isArray(entry.missingPeerIds) && entry.missingPeerIds.every(peerId => typeof peerId === 'string')
+        && typeof entry.recordedAt === 'number'
+        && Number.isInteger(entry.attempts);
+}
+//# sourceMappingURL=kv-under-replication-ledger.js.map

package/dist/src/repo/kv-under-replication-ledger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kv-under-replication-ledger.js","sourceRoot":"","sources":["../../../src/repo/kv-under-replication-ledger.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE5C,MAAM,GAAG,GAAG,YAAY,CAAC,0BAA0B,CAAC,CAAC;AAErD;;;;GAIG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,mBAAmB,CAAC;AAE/D;;;;;GAKG;AACH,MAAM,CAAC,MAAM,qCAAqC,GAAG,OAAO,CAAC;AAQ7D,MAAM,iBAAiB,GAA+B,CAAC,UAAU,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;AAExF;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,wBAAwB;IAKP;IAJZ,UAAU,CAAS;IACnB,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,SAAS,CAAoC;IAErD,YAA6B,EAAY,EAAE,OAAyC;QAAvD,OAAE,GAAF,EAAE,CAAU;QACxC,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,qCAAqC,CAAC;QAChF,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACrD,MAAM,IAAI,KAAK,CAAC,wEAAwE,UAAU,EAAE,CAAC,CAAC;QACvG,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC9B,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAA2B;QACvC,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE;YAC/C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;gBACxD,GAAG,CAAC,0BAA0B,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,WAAW,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBACvG,OAAO;YACR,CAAC;YACD,MAAM,aAAa,GAAG,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,CAAC;YAC3E,MAAM,MAAM,GAAyB,aAAa;gBACjD,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE;gBAC5E,CAAC,CAAC,KAAK,CAAC;YACT,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,IAAI,CAAC,aAAa,EAAE,CAAC;gBACpB,qFAAqF;gBACrF,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAC5B,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC,CAAC,CAAC;QACH,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,OAAgB,EAAE,GAAW;QACzC,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE;YACzC,0FAA0F;YAC1F,0FAA0F;YAC1F,kGAAkG;YAClG,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,OAAO;YAChC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAO;YACnC,IAAI,QAAQ,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;gBACxB,GAAG,CAAC,2BAA2B,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC9E,OAAO;YACR,CAAC;YACD,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,OAAgB;QACzB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,IAAI;QACT,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACtC,OAAO,IAAI,CAAC;QACb,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,IAAI;QACT,OAAO,CAAC,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC;IAClC,CAAC;IAEO,KAAK,CAAC,IAAI;QACjB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QAC7D,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,yFAAyF;QACzF,qFAAqF;QACrF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,2BAA2B,CAAC,MAAM,CAAY,CAAC,CAAC;YACxF,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAC5D,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,OAAgB,EAAE,OAA0B,EAAE,OAAgB;QAC3E,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE;YAC1C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAC7C,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,GAAG,OAAO,EAAE,CAAC;gBACrD,GAAG,CAAC,4BAA4B,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBACnF,OAAO,QAAQ,CAAC;YACjB,CAAC;YACD,+DAA+D;YAC/D,IAAI,QAAQ,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,QAAQ,CAAC;YAC1D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;YACnC,MAAM,SAAS,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YACnF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBAC3B,OAAO,SAAS,CAAC;YAClB,CAAC;YACD,IAAI,SAAS,CAAC,MAAM,KAAK,QAAQ,CAAC,cAAc,CAAC,MAAM;gBAAE,OAAO,QAAQ,CAAC;YACzE,MAAM,OAAO,GAAyB,EAAE,GAAG,QAAQ,EAAE,cAAc,EAAE,SAAS,EAAE,CAAC;YACjF,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5D,OAAO,OAAO,CAAC;QAChB,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,OAAgB,EAAE,GAAW,EAAE,cAAiC;QAC1E,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE;YAC1C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAC7C,IAAI,QAAQ,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;gBAC1B,GAAG,CAAC,wBAAwB,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC3E,OAAO,QAAQ,CAAC;YACjB,CAAC;YACD,IAAI,QAAQ,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,QAAQ,CAAC;YACxD,MAAM,OAAO,GAAyB,EAAE,GAAG,QAAQ,EAAE,cAAc,EAAE,CAAC,GAAG,cAAc,CAAC,EAAE,CAAC;YAC3F,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5D,OAAO,OAAO,CAAC;QAChB,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,OAAgB;QACjC,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE;YACzC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1C,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAO;YACnC,MAAM,OAAO,GAAyB,EAAE,GAAG,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;YACvF,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,OAAgB;QAC5B,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,oFAAoF;IAC5E,KAAK,CAAC,MAAM,CAAC,OAAgB;QACpC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QACjC,MAAM,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QACtC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvB,CAAC;IAED;;;;;;;;;OASG;IACK,KAAK,CAAC,cAAc;QAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAC3C,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO;YACjC,IAAI,CAAC;gBACJ,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,IAAI,EAAE;oBACxC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;wBAAE,OAAO;oBAC/B,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC1B,GAAG,CAAC,mBAAmB,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;gBAC5E,CAAC,CAAC,CAAC;YACJ,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACd,GAAG,CAAC,KAAK,CAAC,iBAAiB,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAG,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;gBACjF,OAAO;YACR,CAAC;QACF,CAAC;IACF,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,KAAK;QACZ,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YAClC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAEO,SAAS,CAAC,IAAqC;QACtD,OAAO,IAAI;aACT,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;aAC7D,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;YACvB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,MAAM,GAAG,CAAC;QACX,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,KAAK,CAAC,IAAI,CAAC,OAAgB;QAClC,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAC/C,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACjE,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,UAAU,CAAI,OAAgB,EAAE,SAA2B;QACxE,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QAC/D,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC;YACJ,OAAO,MAAM,GAAG,CAAC;QAClB,CAAC;gBAAS,CAAC;YACV,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,IAAI;gBAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACpE,CAAC;IACF,CAAC;CACD;AAED,SAAS,MAAM,CAAC,OAAgB;IAC/B,OAAO,GAAG,2BAA2B,GAAG,OAAO,EAAE,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CAAC,OAAgB,EAAE,GAAW;IAChD,IAAI,KAAc,CAAC;IACnB,IAAI,CAAC;QACJ,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACd,GAAG,CAAC,KAAK,CAAC,qBAAqB,EAAE,EAAE,OAAO,EAAE,KAAK,EAAG,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;QAC7E,OAAO,SAAS,CAAC;IAClB,CAAC;IACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC;QACjC,GAAG,CAAC,KAAK,CAAC,mBAAmB,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;QACjD,OAAO,SAAS,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CAAC,OAAgB,EAAE,KAAc;IACnD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,KAAK,GAAG,KAAgC,CAAC;IAC/C,OAAO,KAAK,CAAC,OAAO,KAAK,OAAO;WAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC;WAC3B,OAAO,KAAK,CAAC,QAAQ,KAAK,QAAQ;WAClC,iBAAiB,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAyB,CAAC;WAC3D,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,MAAM,KAAK,QAAQ,CAAC;WACvG,OAAO,KAAK,CAAC,UAAU,KAAK,QAAQ;WACpC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AACtC,CAAC"}

package/dist/src/repo/responsibility.d.ts

@@ -0,0 +1,37 @@
+import type { BlockId } from "@optimystic/db-core";
+/**
+ * How long one node's answer to "is this node in the block's cohort?" is reused before it is looked up
+ * again. Shared by the two places that ask it — `CoordinatorRepo`'s write-path responsibility check and
+ * `RepoService`'s redirect check — as a VALUE, never as a cache: they sit on either side of the served-repo
+ * boundary and each keeps its own memo. With one TTL, the two can disagree about a block only inside the
+ * same minute after its cohort changed, and in that window the coordinator's refusal is the backstop.
+ */
+export declare const RESPONSIBILITY_TTL_MS = 60000;
+/**
+ * Why a node refused a request on responsibility grounds.
+ *  - `not-responsible`: the cohort lookup answered, and this node is not in the cohort for these blocks.
+ *    The request was sent to the wrong machine; the writer re-picks inside the cohort.
+ *  - `undetermined`: the cohort lookup THREW, so this node cannot tell whether it is responsible. A routing
+ *    fault on this node, not a misrouted request — and not a licence to accept: accepting there is what
+ *    let a write commit on a phone that consulted nobody (GitHub #19).
+ */
+export type ResponsibilityRefusalKind = 'not-responsible' | 'undetermined';
+/**
+ * A write refused because this node is not, or cannot tell whether it is, responsible for the blocks it
+ * names. Typed so a caller matches on {@link kind} and {@link blockIds} rather than on message text.
+ *
+ * Local only: over the repo protocol a thrown error aborts the stream, so a remote writer sees a failed
+ * batch, not this class. Either way the writer's transactor excludes the peer and re-picks, which is the
+ * whole remedy for both kinds.
+ */
+export declare class ResponsibilityRefusalError extends Error {
+    readonly kind: ResponsibilityRefusalKind;
+    /** Every block the refusal is about — all of them, so one log line names the whole misroute. */
+    readonly blockIds: readonly BlockId[];
+    constructor(kind: ResponsibilityRefusalKind, 
+    /** Every block the refusal is about — all of them, so one log line names the whole misroute. */
+    blockIds: readonly BlockId[], 
+    /** Extra context for the message; never parsed. */
+    detail?: string);
+}
+//# sourceMappingURL=responsibility.d.ts.map

package/dist/src/repo/responsibility.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"responsibility.d.ts","sourceRoot":"","sources":["../../../src/repo/responsibility.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEnD;;;;;;GAMG;AACH,eAAO,MAAM,qBAAqB,QAAS,CAAC;AAE5C;;;;;;;GAOG;AACH,MAAM,MAAM,yBAAyB,GAAG,iBAAiB,GAAG,cAAc,CAAC;AAE3E;;;;;;;GAOG;AACH,qBAAa,0BAA2B,SAAQ,KAAK;IAEnD,QAAQ,CAAC,IAAI,EAAE,yBAAyB;IACxC,gGAAgG;IAChG,QAAQ,CAAC,QAAQ,EAAE,SAAS,OAAO,EAAE;gBAF5B,IAAI,EAAE,yBAAyB;IACxC,gGAAgG;IACvF,QAAQ,EAAE,SAAS,OAAO,EAAE;IACrC,mDAAmD;IACnD,MAAM,CAAC,EAAE,MAAM;CAKhB"}

package/dist/src/repo/responsibility.js

@@ -0,0 +1,37 @@
+/**
+ * How long one node's answer to "is this node in the block's cohort?" is reused before it is looked up
+ * again. Shared by the two places that ask it — `CoordinatorRepo`'s write-path responsibility check and
+ * `RepoService`'s redirect check — as a VALUE, never as a cache: they sit on either side of the served-repo
+ * boundary and each keeps its own memo. With one TTL, the two can disagree about a block only inside the
+ * same minute after its cohort changed, and in that window the coordinator's refusal is the backstop.
+ */
+export const RESPONSIBILITY_TTL_MS = 60_000;
+/**
+ * A write refused because this node is not, or cannot tell whether it is, responsible for the blocks it
+ * names. Typed so a caller matches on {@link kind} and {@link blockIds} rather than on message text.
+ *
+ * Local only: over the repo protocol a thrown error aborts the stream, so a remote writer sees a failed
+ * batch, not this class. Either way the writer's transactor excludes the peer and re-picks, which is the
+ * whole remedy for both kinds.
+ */
+export class ResponsibilityRefusalError extends Error {
+    kind;
+    blockIds;
+    constructor(kind, 
+    /** Every block the refusal is about — all of them, so one log line names the whole misroute. */
+    blockIds, 
+    /** Extra context for the message; never parsed. */
+    detail) {
+        super(responsibilityRefusalMessage(kind, blockIds, detail));
+        this.kind = kind;
+        this.blockIds = blockIds;
+        this.name = 'ResponsibilityRefusalError';
+    }
+}
+function responsibilityRefusalMessage(kind, blockIds, detail) {
+    const head = kind === 'not-responsible'
+        ? `Not responsible for block(s): ${blockIds.join(', ')}`
+        : `Cannot determine responsibility for block(s): ${blockIds.join(', ')}`;
+    return detail === undefined ? head : `${head} (${detail})`;
+}
+//# sourceMappingURL=responsibility.js.map

package/dist/src/repo/responsibility.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"responsibility.js","sourceRoot":"","sources":["../../../src/repo/responsibility.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,MAAM,CAAC;AAY5C;;;;;;;GAOG;AACH,MAAM,OAAO,0BAA2B,SAAQ,KAAK;IAE1C;IAEA;IAHV,YACU,IAA+B;IACxC,gGAAgG;IACvF,QAA4B;IACrC,mDAAmD;IACnD,MAAe;QAEf,KAAK,CAAC,4BAA4B,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;QANnD,SAAI,GAAJ,IAAI,CAA2B;QAE/B,aAAQ,GAAR,QAAQ,CAAoB;QAKrC,IAAI,CAAC,IAAI,GAAG,4BAA4B,CAAC;IAC1C,CAAC;CACD;AAED,SAAS,4BAA4B,CAAC,IAA+B,EAAE,QAA4B,EAAE,MAA0B;IAC9H,MAAM,IAAI,GAAG,IAAI,KAAK,iBAAiB;QACtC,CAAC,CAAC,iCAAiC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QACxD,CAAC,CAAC,iDAAiD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAC1E,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,MAAM,GAAG,CAAC;AAC5D,CAAC"}

package/dist/src/repo/service.d.ts

@@ -1,5 +1,5 @@
 import type { Startable, StreamHandler, PeerId, Libp2p } from '@libp2p/interface';
-import type { IRepo, RepoMessage } from '@optimystic/db-core';
+import type { IKeyNetwork, IRepo, RepoMessage } from '@optimystic/db-core';
 import { type RedirectPayload } from './redirect.js';
 import { type InboundStreamAuthorizationInit } from '../inbound-authorization.js';
 interface BaseComponents {
@@ -8,12 +8,16 @@ interface BaseComponents {
         unhandle: (protocol: string) => Promise<void>;
     };
 }
-export interface NetworkManagerLike {
-    getCluster(key: Uint8Array): Promise<PeerId[]>;
-}
+/** The one key-network call the redirect check makes. The node's own `Libp2pKeyPeerNetwork` satisfies it. */
+export type ClusterLookup = Pick<IKeyNetwork, 'findCluster'>;
 export type RepoServiceComponents = BaseComponents & {
     repo: IRepo;
-    networkManager?: NetworkManagerLike;
+    /**
+     * Where the redirect check asks who is responsible for a block. Absent → the `keyNetwork` attachment of
+     * the node injected by {@link RepoService.setLibp2p}, which is the production source: the same key
+     * network the writer's transactor and this node's coordinator ask, so all three apply one rule.
+     */
+    keyNetwork?: ClusterLookup;
     peerId?: PeerId;
     /**
      * Optional resolver for the addresses this node may publish for a redirect target. Async
@@ -44,12 +48,10 @@ export type RepoServiceInit = InboundStreamAuthorizationInit & {
     logPrefix?: string;
     kBucketSize?: number;
     /**
-     * Responsibility K - the replica set size for determining cluster membership.
-     * This is distinct from kBucketSize (DHT routing).
-     * When set, this determines how many peers (by XOR distance) are considered
-     * responsible for a key. If this node is not in the top responsibilityK peers,
-     * it will redirect requests to closer peers.
-     * Default: 1 (only the closest peer handles requests)
+     * Small-mesh bypass for the redirect check: when the block's cohort has fewer than this many peers,
+     * the request is handled locally without a membership test (and the coordinator's own responsibility
+     * check then decides). It does not size the cohort — the key network's `clusterSize` does.
+     * Default: 1 (only an empty cohort bypasses)
      */
     responsibilityK?: number;
 };
@@ -71,7 +73,7 @@ export declare class RepoService implements Startable {
      * The libp2p node, injected post-construction by the node wiring (see
      * libp2p-node-base.ts, mirroring how `networkManager`/`fret` receive theirs).
      * The libp2p `components.libp2p` proxy does NOT reliably resolve from inside a
-     * service at request time, so the redirect path resolves the network manager,
+     * service at request time, so the redirect path resolves the key network,
      * self identity, and connection addrs through this explicitly-set reference.
      */
     private libp2pRef;
@@ -83,6 +85,16 @@ export declare class RepoService implements Startable {
      * ingress point, instead of keeping it filterable as the single `peer-address-book` namespace.
      */
     private readonly addressLog;
+    /**
+     * Per block key, the responsible peer ids the key network last named: one cohort lookup per block per
+     * minute on the inbound path, instead of one per request on top of the coordinator's own.
+     *
+     * NOTE: same TTL as `CoordinatorRepo`'s responsibility cache, deliberately not the same cache — the two
+     * sit on either side of the served-repo boundary. Their verdicts can therefore disagree about a block
+     * only inside the minute after its cohort changes; a request this check wrongly lets through is refused
+     * by the coordinator, and one it wrongly redirects is followed by the client to a member that serves it.
+     */
+    private readonly responsibleIds;
     constructor(components: RepoServiceComponents, init?: RepoServiceInit);
     readonly [Symbol.toStringTag] = "@libp2p/repo-service";
     /**
@@ -100,7 +112,12 @@ export declare class RepoService implements Startable {
      * Stop the service
      */
     stop(): Promise<void>;
-    private getNetworkManager;
+    /**
+     * The key network the redirect check asks. Absent only before the node attaches it, which happens after
+     * `start()`; a request in that window is handled locally, where the served-repo proxy has no
+     * coordinator to hand it to yet either.
+     */
+    private getKeyNetwork;
     private getSelfId;
     /**
      * The addresses this node may publish for `peerId` in a redirect payload.
@@ -122,7 +139,7 @@ export declare class RepoService implements Startable {
      *   - pend   → blockIdsForTransforms(transforms)[0]
      *   - cancel → actionRef.blockIds[0]
      *   - commit → blockIds[0]  (CoordinatorRepo.commit anchors consensus on
-     *     getClusterSize(blockIds[0]) / executeClusterTransaction(blockIds[0]) and guards
+     *     resolveCohort(blockIds[0]) / executeClusterTransaction(blockIds[0]) and guards
      *     with verifyResponsibility(blockIds) — NOT tailId; for a per-block commit batch
      *     whose blockIds[0] !== tailId, keying on tailId redirected the commit to the
      *     collection tail's cluster, which then fails verifyResponsibility for the non-tail block.)
@@ -138,9 +155,21 @@ export declare class RepoService implements Startable {
     /**
      * Check if this node should redirect the request for a given key.
      * Returns a RedirectPayload if not responsible, null if should handle locally.
-     * Also attaches cluster info to the message for downstream use.
+     * Also attaches the responsible peer ids to the message for downstream use.
+     *
+     * The responsible set comes from the node's own key network — `findCluster` on the block's routing
+     * key, the same call and the same bytes the writer's transactor and this node's `CoordinatorRepo` use —
+     * so a correctly routed request is never redirected, including on machines shared by several networks,
+     * where FRET's raw cohort would include peers that do not serve this one.
+     *
+     * A lookup that THROWS splits by operation: a `get` is handled locally (a read is best-effort, and the
+     * coordinator flags what it could not confirm); every other operation propagates the error, which
+     * aborts the stream so the writer excludes this peer and re-picks — the posture `CoordinatorRepo` takes
+     * on the same fault.
      */
     checkRedirect(blockKey: string, opName: string, message: RepoMessage): Promise<RedirectPayload | null>;
+    /** The block's responsible peer ids, memoized per block key for {@link RESPONSIBILITY_TTL_MS}. A throw is never memoized. */
+    private responsiblePeerIds;
     /**
      * Handle incoming streams on the repo protocol
      */

package/dist/src/repo/service.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"service.d.ts","sourceRoot":"","sources":["../../../src/repo/service.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,SAAS,EAAsB,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAA;AACrG,OAAO,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAA;AAG7D,OAAO,EAAe,KAAK,eAAe,EAAE,MAAM,eAAe,CAAA;AAKjE,OAAO,EAAqE,KAAK,8BAA8B,EAAE,MAAM,6BAA6B,CAAA;AAIpJ,UAAU,cAAc;IACvB,SAAS,EAAE;QACV,MAAM,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,KAAK,OAAO,CAAC,IAAI,CAAC,CAAA;QACjF,QAAQ,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAA;KAC7C,CAAA;CACD;AAED,MAAM,WAAW,kBAAkB;IAClC,UAAU,CAAC,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;CAC9C;AAED,MAAM,MAAM,qBAAqB,GAAG,cAAc,GAAG;IACpD,IAAI,EAAE,KAAK,CAAA;IACX,cAAc,CAAC,EAAE,kBAAkB,CAAA;IACnC,MAAM,CAAC,EAAE,MAAM,CAAA;IACf;;;;;OAKG;IACH,kBAAkB,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;IACrE;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAA;CACf,CAAA;AAED,MAAM,MAAM,eAAe,GAAG,8BAA8B,GAAG;IAC9D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;;;OAOG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;CACzB,CAAA;AAED,wBAAgB,WAAW,CAAC,IAAI,GAAE,eAAoB,GAAG,CAAC,UAAU,EAAE,qBAAqB,KAAK,WAAW,CAE1G;AAED;;GAEG;AACH,qBAAa,WAAY,YAAW,SAAS;IAC5C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAQ;IACjC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAQ;IAC1C,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAQ;IAC3C,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAC5B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAO;IAC5B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAuB;IAClD,OAAO,CAAC,OAAO,CAAS;IACxB,2FAA2F;IAC3F,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAQ;IACxC;;;;;;OAMG;IACH,OAAO,CAAC,SAAS,CAAoB;IACrC,2FAA2F;IAC3F,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAwC;IACtE;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAY;gBAE3B,UAAU,EAAE,qBAAqB,EAAE,IAAI,GAAE,eAAoB;IAczE,QAAQ,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,0BAAyB;IAEtD;;;OAGG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAI/B,gGAAgG;IAChG,OAAO,CAAC,SAAS;IAIjB;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAa5B;;OAEG;IACG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAS3B,OAAO,CAAC,iBAAiB;IAKzB,OAAO,CAAC,SAAS;IAKjB;;;;;;;;OAQG;YACW,YAAY;IAQ1B;;;;;;;;;;;;;;;;;;OAkBG;IACH,cAAc,CAAC,SAAS,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,GAAG;QAAE,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAgB9G;;;;OAIG;IACG,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;IAiC5G;;OAEG;IACH,OAAO,CAAC,oBAAoB;CAsE5B"}
+{"version":3,"file":"service.d.ts","sourceRoot":"","sources":["../../../src/repo/service.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,SAAS,EAAsB,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAA;AACrG,OAAO,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAA;AAG1E,OAAO,EAAe,KAAK,eAAe,EAAE,MAAM,eAAe,CAAA;AAKjE,OAAO,EAAqE,KAAK,8BAA8B,EAAE,MAAM,6BAA6B,CAAA;AAMpJ,UAAU,cAAc;IACvB,SAAS,EAAE;QACV,MAAM,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,KAAK,OAAO,CAAC,IAAI,CAAC,CAAA;QACjF,QAAQ,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAA;KAC7C,CAAA;CACD;AAED,6GAA6G;AAC7G,MAAM,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,EAAE,aAAa,CAAC,CAAA;AAE5D,MAAM,MAAM,qBAAqB,GAAG,cAAc,GAAG;IACpD,IAAI,EAAE,KAAK,CAAA;IACX;;;;OAIG;IACH,UAAU,CAAC,EAAE,aAAa,CAAA;IAC1B,MAAM,CAAC,EAAE,MAAM,CAAA;IACf;;;;;OAKG;IACH,kBAAkB,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;IACrE;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAA;CACf,CAAA;AAED,MAAM,MAAM,eAAe,GAAG,8BAA8B,GAAG;IAC9D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;CACzB,CAAA;AAED,wBAAgB,WAAW,CAAC,IAAI,GAAE,eAAoB,GAAG,CAAC,UAAU,EAAE,qBAAqB,KAAK,WAAW,CAE1G;AAED;;GAEG;AACH,qBAAa,WAAY,YAAW,SAAS;IAC5C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAQ;IACjC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAQ;IAC1C,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAQ;IAC3C,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAC5B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAO;IAC5B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAuB;IAClD,OAAO,CAAC,OAAO,CAAS;IACxB,2FAA2F;IAC3F,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAQ;IACxC;;;;;;OAMG;IACH,OAAO,CAAC,SAAS,CAAoB;IACrC,2FAA2F;IAC3F,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAwC;IACtE;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAY;IACvC;;;;;;;;OAQG;IACH,OAAO,CAAC,QAAQ,CAAC,cAAc,CAA4E;gBAE/F,UAAU,EAAE,qBAAqB,EAAE,IAAI,GAAE,eAAoB;IAczE,QAAQ,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,0BAAyB;IAEtD;;;OAGG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAI/B,gGAAgG;IAChG,OAAO,CAAC,SAAS;IAIjB;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAa5B;;OAEG;IACG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAS3B;;;;OAIG;IACH,OAAO,CAAC,aAAa;IAKrB,OAAO,CAAC,SAAS;IAKjB;;;;;;;;OAQG;YACW,YAAY;IAQ1B;;;;;;;;;;;;;;;;;;OAkBG;IACH,cAAc,CAAC,SAAS,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,GAAG;QAAE,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAgB9G;;;;;;;;;;;;;;OAcG;IACG,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;IA+B5G,6HAA6H;YAC/G,kBAAkB;IAShC;;OAEG;IACH,OAAO,CAAC,oBAAoB;CAsE5B"}