@weaveprotocol/core 0.1.2 → 0.2.0

package/dist/sync/negentropy.js

@@ -0,0 +1,379 @@
+/**
+ * @module negentropy
+ * Range-based set reconciliation: two peers find out which items each lacks
+ * by comparing fingerprints of ranges, never by listing everything.
+ *
+ * This is Negentropy protocol version 1 as Nostr uses it (NIP-77), ported
+ * from Doug Hoyte's reference implementation (MIT). Only the wire format is
+ * shared; the storage around it is ours.
+ *
+ * Both sides sort their items by (timestamp, id). The initiator sends
+ * fingerprints of a few ranges covering everything. For each range the other
+ * side agrees with, nothing more is said. For a range it doesn't, it splits
+ * the range into sixteen and answers with their fingerprints, or with the ids
+ * themselves once a range is small. A few rounds narrow every difference down
+ * to the ids, and the initiator ends up knowing both what it has that the
+ * other lacks and what the other has that it lacks.
+ *
+ * A fingerprint is the sum of the ids in a range, as 256-bit numbers, hashed
+ * with the count. A sum can be taken apart and put together again, which is
+ * what lets a store keep one per collection and add or subtract as versions
+ * come and go.
+ *
+ * The timestamp only orders items. It never decides which items are compared:
+ * a writer who lies about the time makes its own items slower to find, nothing
+ * else.
+ */
+import { sha256 } from '../utils/hash.js';
+export const NEGENTROPY_VERSION = 0x61;
+export const ID_SIZE = 32;
+export const FINGERPRINT_SIZE = 16;
+/** Ranges smaller than two buckets' worth go as their ids */
+const BUCKETS = 16;
+/** A timestamp past every real one: the end of the last range */
+const INFINITY = Number.MAX_SAFE_INTEGER;
+var Mode;
+(function (Mode) {
+    Mode[Mode["Skip"] = 0] = "Skip";
+    Mode[Mode["Fingerprint"] = 1] = "Fingerprint";
+    Mode[Mode["IdList"] = 2] = "IdList";
+})(Mode || (Mode = {}));
+// ─── Bytes ─────────────────────────────────────────────────────────
+function compareBytes(a, b) {
+    const n = Math.min(a.length, b.length);
+    for (let i = 0; i < n; i++)
+        if (a[i] !== b[i])
+            return a[i] - b[i];
+    return a.length - b.length;
+}
+export function compareItems(a, b) {
+    return a.timestamp === b.timestamp ? compareBytes(a.id, b.id) : a.timestamp < b.timestamp ? -1 : 1;
+}
+/** Negentropy's varint: seven bits a byte, most significant first. Arithmetic, so it holds past 32 bits. */
+function encodeVarInt(n) {
+    if (!Number.isSafeInteger(n) || n < 0)
+        throw new Error('varint out of range');
+    const out = [n % 128];
+    n = Math.floor(n / 128);
+    while (n > 0) {
+        out.push((n % 128) | 128);
+        n = Math.floor(n / 128);
+    }
+    return out.reverse();
+}
+class Writer {
+    bytes = [];
+    get length() {
+        return this.bytes.length;
+    }
+    push(...values) {
+        for (const value of values) {
+            if (typeof value === 'number')
+                this.bytes.push(value);
+            else
+                for (let i = 0; i < value.length; i++)
+                    this.bytes.push(value[i]);
+        }
+    }
+    append(other) {
+        this.push(other.bytes);
+    }
+    done() {
+        return Uint8Array.from(this.bytes);
+    }
+}
+class Reader {
+    bytes;
+    at = 0;
+    constructor(bytes) {
+        this.bytes = bytes;
+    }
+    get remaining() {
+        return this.bytes.length - this.at;
+    }
+    byte() {
+        if (this.at >= this.bytes.length)
+            throw new Error('Negentropy message ends too soon');
+        return this.bytes[this.at++];
+    }
+    take(n) {
+        if (this.remaining < n)
+            throw new Error('Negentropy message ends too soon');
+        const out = this.bytes.subarray(this.at, this.at + n);
+        this.at += n;
+        return out;
+    }
+    varint() {
+        let n = 0;
+        for (;;) {
+            const byte = this.byte();
+            n = n * 128 + (byte & 127);
+            if (!Number.isSafeInteger(n))
+                throw new Error('Negentropy varint too large');
+            if ((byte & 128) === 0)
+                return n;
+        }
+    }
+}
+// ─── Fingerprints ──────────────────────────────────────────────────
+const MOD = 1n << 256n;
+/** An id as the little-endian 256-bit number the sum is taken over */
+export function idToNumber(id) {
+    const view = new DataView(id.buffer, id.byteOffset, ID_SIZE);
+    return (view.getBigUint64(0, true) |
+        (view.getBigUint64(8, true) << 64n) |
+        (view.getBigUint64(16, true) << 128n) |
+        (view.getBigUint64(24, true) << 192n));
+}
+export const EMPTY_SUM = { sum: 0n, count: 0 };
+export const addToSum = (s, id) => ({ sum: (s.sum + idToNumber(id)) % MOD, count: s.count + 1 });
+export const removeFromSum = (s, id) => ({ sum: (s.sum - idToNumber(id) + MOD) % MOD, count: s.count - 1 });
+export const combineSums = (a, b) => ({ sum: (a.sum + b.sum) % MOD, count: a.count + b.count });
+/** Hashes a sum the one way both sides do: 32 little-endian bytes, then the count as a varint */
+export async function fingerprintOf(s) {
+    const input = new Uint8Array(ID_SIZE + 10);
+    let n = s.sum;
+    for (let i = 0; i < ID_SIZE; i++) {
+        input[i] = Number(n & 0xffn);
+        n >>= 8n;
+    }
+    const count = encodeVarInt(s.count);
+    input.set(count, ID_SIZE);
+    return (await sha256(input.subarray(0, ID_SIZE + count.length))).subarray(0, FINGERPRINT_SIZE);
+}
+// ─── A sorted set ──────────────────────────────────────────────────
+/**
+ * Items sorted by (timestamp, id), with running sums so any range's
+ * fingerprint costs two lookups rather than a pass over it.
+ */
+export class ItemSet {
+    items;
+    /** prefix[i] is the sum of the first i ids */
+    prefix;
+    constructor(items) {
+        const sorted = [...items].sort(compareItems);
+        const unique = [];
+        for (const item of sorted) {
+            if (item.id.length !== ID_SIZE)
+                throw new Error('Negentropy ids are 32 bytes');
+            const last = unique[unique.length - 1];
+            if (!last || compareItems(last, item) !== 0)
+                unique.push(item);
+        }
+        this.items = unique;
+        this.prefix = [0n];
+        for (const item of unique)
+            this.prefix.push((this.prefix[this.prefix.length - 1] + idToNumber(item.id)) % MOD);
+    }
+    get size() {
+        return this.items.length;
+    }
+    sum(begin, end) {
+        return { sum: (this.prefix[end] - this.prefix[begin] + MOD) % MOD, count: end - begin };
+    }
+    fingerprint(begin, end) {
+        return fingerprintOf(this.sum(begin, end));
+    }
+    /** The first index in [begin, end) whose item is not below `bound` */
+    lowerBound(begin, end, bound) {
+        let lo = begin;
+        let hi = end;
+        while (lo < hi) {
+            const mid = (lo + hi) >>> 1;
+            if (compareItems(this.items[mid], bound) < 0)
+                lo = mid + 1;
+            else
+                hi = mid;
+        }
+        return lo;
+    }
+}
+/**
+ * One side of one reconciliation.
+ *
+ * @param set This side's items
+ * @param frameSizeLimit Largest message to produce, in bytes; 0 for no limit.
+ *   What doesn't fit is left for the next round.
+ */
+export function createReconciler(set, options) {
+    const { initiator } = options;
+    const frameSizeLimit = options.frameSizeLimit ?? 0;
+    if (frameSizeLimit !== 0 && frameSizeLimit < 4096)
+        throw new Error('frameSizeLimit too small');
+    const exceeded = (n) => frameSizeLimit !== 0 && n > frameSizeLimit - 200;
+    let lastIn = 0;
+    let lastOut = 0;
+    const encodeTimestamp = (timestamp) => {
+        if (timestamp === INFINITY) {
+            lastOut = INFINITY;
+            return encodeVarInt(0);
+        }
+        const delta = timestamp - lastOut;
+        lastOut = timestamp;
+        return encodeVarInt(delta + 1);
+    };
+    const decodeTimestamp = (reader) => {
+        const raw = reader.varint();
+        if (raw === 0 || lastIn === INFINITY) {
+            lastIn = INFINITY;
+            return INFINITY;
+        }
+        const timestamp = lastIn + raw - 1;
+        if (!Number.isSafeInteger(timestamp))
+            throw new Error('Negentropy timestamp too large');
+        lastIn = timestamp;
+        return timestamp;
+    };
+    const writeBound = (out, bound) => out.push(encodeTimestamp(bound.timestamp), encodeVarInt(bound.id.length), bound.id);
+    const readBound = (reader) => {
+        const timestamp = decodeTimestamp(reader);
+        const length = reader.varint();
+        if (length > ID_SIZE)
+            throw new Error('Negentropy bound too long');
+        return { timestamp, id: reader.take(length) };
+    };
+    /** The shortest bound that falls after `prev` and not after `curr` */
+    const minimalBound = (prev, curr) => {
+        if (curr.timestamp !== prev.timestamp)
+            return { timestamp: curr.timestamp, id: new Uint8Array(0) };
+        let shared = 0;
+        while (shared < ID_SIZE && curr.id[shared] === prev.id[shared])
+            shared++;
+        return { timestamp: curr.timestamp, id: curr.id.subarray(0, shared + 1) };
+    };
+    const splitRange = async (lower, upper, upperBound, out) => {
+        const count = upper - lower;
+        if (count < BUCKETS * 2) {
+            writeBound(out, upperBound);
+            out.push(encodeVarInt(Mode.IdList), encodeVarInt(count));
+            for (let i = lower; i < upper; i++)
+                out.push(set.items[i].id);
+            return;
+        }
+        const per = Math.floor(count / BUCKETS);
+        const extra = count % BUCKETS;
+        let at = lower;
+        for (let i = 0; i < BUCKETS; i++) {
+            const size = per + (i < extra ? 1 : 0);
+            const fingerprint = await set.fingerprint(at, at + size);
+            at += size;
+            writeBound(out, at === upper ? upperBound : minimalBound(set.items[at - 1], set.items[at]));
+            out.push(encodeVarInt(Mode.Fingerprint), fingerprint);
+        }
+    };
+    return {
+        /** The first message: the whole set, split into ranges. Initiator only. */
+        async initiate() {
+            if (!initiator)
+                throw new Error('Only the initiator starts');
+            lastOut = 0;
+            const out = new Writer();
+            out.push(NEGENTROPY_VERSION);
+            await splitRange(0, set.size, { timestamp: INFINITY, id: new Uint8Array(0) }, out);
+            return out.done();
+        },
+        /** Takes the other side's message and works out the answer. */
+        async reconcile(message) {
+            const have = [];
+            const need = [];
+            const reader = new Reader(message);
+            lastIn = 0;
+            lastOut = 0;
+            const full = new Writer();
+            full.push(NEGENTROPY_VERSION);
+            const version = reader.byte();
+            if (version < 0x60 || version > 0x6f)
+                throw new Error('Not a Negentropy message');
+            if (version !== NEGENTROPY_VERSION) {
+                // A responder answers with its own version, and a newer initiator falls back to it.
+                if (initiator)
+                    throw new Error(`Unsupported Negentropy version ${version - 0x60}`);
+                return { message: full.done(), have, need };
+            }
+            let prevBound = { timestamp: 0, id: new Uint8Array(0) };
+            let prevIndex = 0;
+            let skip = false;
+            while (reader.remaining > 0) {
+                let out = new Writer();
+                const flushSkip = () => {
+                    if (!skip)
+                        return;
+                    skip = false;
+                    writeBound(out, prevBound);
+                    out.push(encodeVarInt(Mode.Skip));
+                };
+                const currBound = readBound(reader);
+                const mode = reader.varint();
+                const lower = prevIndex;
+                let upper = set.lowerBound(prevIndex, set.size, currBound);
+                if (mode === Mode.Skip) {
+                    skip = true;
+                }
+                else if (mode === Mode.Fingerprint) {
+                    const theirs = reader.take(FINGERPRINT_SIZE);
+                    const ours = await set.fingerprint(lower, upper);
+                    if (compareBytes(theirs, ours) !== 0) {
+                        flushSkip();
+                        await splitRange(lower, upper, currBound, out);
+                    }
+                    else {
+                        skip = true;
+                    }
+                }
+                else if (mode === Mode.IdList) {
+                    const n = reader.varint();
+                    const theirs = new Map();
+                    for (let i = 0; i < n; i++) {
+                        const id = reader.take(ID_SIZE);
+                        if (initiator)
+                            theirs.set(key(id), id);
+                    }
+                    if (initiator) {
+                        skip = true;
+                        for (let i = lower; i < upper; i++) {
+                            const id = set.items[i].id;
+                            if (!theirs.delete(key(id)))
+                                have.push(id);
+                        }
+                        need.push(...theirs.values());
+                    }
+                    else {
+                        flushSkip();
+                        const ids = new Writer();
+                        let count = 0;
+                        let endBound = currBound;
+                        for (let i = lower; i < upper; i++) {
+                            if (exceeded(full.length + ids.length)) {
+                                endBound = set.items[i];
+                                upper = i; // the rest of the range gets a fingerprint below
+                                break;
+                            }
+                            ids.push(set.items[i].id);
+                            count++;
+                        }
+                        writeBound(out, endBound);
+                        out.push(encodeVarInt(Mode.IdList), encodeVarInt(count));
+                        out.append(ids);
+                        full.append(out);
+                        out = new Writer();
+                    }
+                }
+                else {
+                    throw new Error('Unknown Negentropy mode');
+                }
+                if (exceeded(full.length + out.length)) {
+                    // Out of room: one fingerprint for everything not covered yet, answered next round.
+                    writeBound(full, { timestamp: INFINITY, id: new Uint8Array(0) });
+                    full.push(encodeVarInt(Mode.Fingerprint), await set.fingerprint(upper, set.size));
+                    break;
+                }
+                full.append(out);
+                prevIndex = upper;
+                prevBound = currBound;
+            }
+            return { message: initiator && full.length === 1 ? null : full.done(), have, need };
+        },
+    };
+}
+const key = (id) => String.fromCharCode(...id);
+//# sourceMappingURL=negentropy.js.map

package/dist/sync/negentropy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"negentropy.js","sourceRoot":"","sources":["../../src/sync/negentropy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE1C,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AACvC,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC;AAC1B,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AACnC,6DAA6D;AAC7D,MAAM,OAAO,GAAG,EAAE,CAAC;AACnB,iEAAiE;AACjE,MAAM,QAAQ,GAAG,MAAM,CAAC,gBAAgB,CAAC;AAEzC,IAAW,IAIV;AAJD,WAAW,IAAI;IACb,+BAAQ,CAAA;IACR,6CAAe,CAAA;IACf,mCAAU,CAAA;AACZ,CAAC,EAJU,IAAI,KAAJ,IAAI,QAId;AAcD,sEAAsE;AAEtE,SAAS,YAAY,CAAC,CAAa,EAAE,CAAa;IAChD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACpE,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,CAAQ,EAAE,CAAQ;IAC7C,OAAO,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrG,CAAC;AAED,4GAA4G;AAC5G,SAAS,YAAY,CAAC,CAAS;IAC7B,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAC9E,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IACtB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IACxB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACb,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1B,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,GAAG,CAAC,OAAO,EAAE,CAAC;AACvB,CAAC;AAED,MAAM,MAAM;IACF,KAAK,GAAa,EAAE,CAAC;IAC7B,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD,IAAI,CAAC,GAAG,MAAiD;QACvD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;gBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;oBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IACD,MAAM,CAAC,KAAa;QAClB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IACD,IAAI;QACF,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;CACF;AAED,MAAM,MAAM;IAEmB;IADrB,EAAE,GAAG,CAAC,CAAC;IACf,YAA6B,KAAiB;QAAjB,UAAK,GAAL,KAAK,CAAY;IAAG,CAAC;IAClD,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;IACrC,CAAC;IACD,IAAI;QACF,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,CAAE,CAAC;IAChC,CAAC;IACD,IAAI,CAAC,CAAS;QACZ,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QAC5E,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACb,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM;QACJ,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,SAAS,CAAC;YACR,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACzB,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;YAC7E,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;CACF;AAED,sEAAsE;AAEtE,MAAM,GAAG,GAAG,EAAE,IAAI,IAAI,CAAC;AAEvB,sEAAsE;AACtE,MAAM,UAAU,UAAU,CAAC,EAAc;IACvC,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC7D,OAAO,CACL,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC;QAC1B,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC;QACnC,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC;QACrC,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,CACtC,CAAC;AACJ,CAAC;AAQD,MAAM,CAAC,MAAM,SAAS,GAAQ,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AAEpD,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAM,EAAE,EAAc,EAAO,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;AACvH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAM,EAAE,EAAc,EAAO,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,UAAU,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;AAClI,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAM,EAAE,CAAM,EAAO,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;AAE/G,iGAAiG;AACjG,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,CAAM;IACxC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC;IAC3C,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC7B,CAAC,KAAK,EAAE,CAAC;IACX,CAAC;IACD,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,CAAC,MAAM,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;AACjG,CAAC;AAED,sEAAsE;AAEtE;;;GAGG;AACH,MAAM,OAAO,OAAO;IACT,KAAK,CAAsB;IACpC,8CAA8C;IAC7B,MAAM,CAAW;IAElC,YAAY,KAAqB;QAC/B,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAW,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,KAAK,OAAO;gBAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;YAC/E,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,IAAI,IAAI,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC;QACpB,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,MAAM;YAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAClH,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,GAAW;QAC5B,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAE,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAE,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,KAAK,EAAE,GAAG,GAAG,KAAK,EAAE,CAAC;IAC5F,CAAC;IAED,WAAW,CAAC,KAAa,EAAE,GAAW;QACpC,OAAO,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,sEAAsE;IACtE,UAAU,CAAC,KAAa,EAAE,GAAW,EAAE,KAAY;QACjD,IAAI,EAAE,GAAG,KAAK,CAAC;QACf,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC;gBAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;gBACvD,EAAE,GAAG,GAAG,CAAC;QAChB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;CACF;AAaD;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAY,EAAE,OAA0E;IACvH,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IAC9B,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,CAAC,CAAC;IACnD,IAAI,cAAc,KAAK,CAAC,IAAI,cAAc,GAAG,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAC/F,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,cAAc,KAAK,CAAC,IAAI,CAAC,GAAG,cAAc,GAAG,GAAG,CAAC;IAEjF,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,MAAM,eAAe,GAAG,CAAC,SAAiB,EAAY,EAAE;QACtD,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;YAC3B,OAAO,GAAG,QAAQ,CAAC;YACnB,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,MAAM,KAAK,GAAG,SAAS,GAAG,OAAO,CAAC;QAClC,OAAO,GAAG,SAAS,CAAC;QACpB,OAAO,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC;IAEF,MAAM,eAAe,GAAG,CAAC,MAAc,EAAU,EAAE;QACjD,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,GAAG,KAAK,CAAC,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;YACrC,MAAM,GAAG,QAAQ,CAAC;YAClB,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,MAAM,SAAS,GAAG,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACxF,MAAM,GAAG,SAAS,CAAC;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,KAAY,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IAEtI,MAAM,SAAS,GAAG,CAAC,MAAc,EAAS,EAAE;QAC1C,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC/B,IAAI,MAAM,GAAG,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QACnE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IAChD,CAAC,CAAC;IAEF,sEAAsE;IACtE,MAAM,YAAY,GAAG,CAAC,IAAU,EAAE,IAAU,EAAS,EAAE;QACrD,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS;YAAE,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QACnG,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,OAAO,MAAM,GAAG,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC;YAAE,MAAM,EAAE,CAAC;QACzE,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;IAC5E,CAAC,CAAC;IAEF,MAAM,UAAU,GAAG,KAAK,EAAE,KAAa,EAAE,KAAa,EAAE,UAAiB,EAAE,GAAW,EAAE,EAAE;QACxF,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;QAC5B,IAAI,KAAK,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC;YACxB,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;YAC5B,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;YAC/D,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC;QAC9B,IAAI,EAAE,GAAG,KAAK,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC;YACzD,EAAE,IAAI,IAAI,CAAC;YACX,UAAU,CAAC,GAAG,EAAE,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAE,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC;YAC9F,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC,CAAC;QACxD,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,2EAA2E;QAC3E,KAAK,CAAC,QAAQ;YACZ,IAAI,CAAC,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAC7D,OAAO,GAAG,CAAC,CAAC;YACZ,MAAM,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;YAC7B,MAAM,UAAU,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACnF,OAAO,GAAG,CAAC,IAAI,EAAE,CAAC;QACpB,CAAC;QAED,+DAA+D;QAC/D,KAAK,CAAC,SAAS,CAAC,OAAmB;YACjC,MAAM,IAAI,GAAiB,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAiB,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;YACnC,MAAM,GAAG,CAAC,CAAC;YACX,OAAO,GAAG,CAAC,CAAC;YAEZ,MAAM,IAAI,GAAG,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;YAE9B,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC9B,IAAI,OAAO,GAAG,IAAI,IAAI,OAAO,GAAG,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;YAClF,IAAI,OAAO,KAAK,kBAAkB,EAAE,CAAC;gBACnC,oFAAoF;gBACpF,IAAI,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,OAAO,GAAG,IAAI,EAAE,CAAC,CAAC;gBACnF,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC9C,CAAC;YAED,IAAI,SAAS,GAAU,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/D,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,IAAI,GAAG,KAAK,CAAC;YAEjB,OAAO,MAAM,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;gBAC5B,IAAI,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;gBACvB,MAAM,SAAS,GAAG,GAAG,EAAE;oBACrB,IAAI,CAAC,IAAI;wBAAE,OAAO;oBAClB,IAAI,GAAG,KAAK,CAAC;oBACb,UAAU,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;oBAC3B,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;gBACpC,CAAC,CAAC;gBAEF,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;gBACpC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,SAAS,CAAC;gBACxB,IAAI,KAAK,GAAG,GAAG,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBAE3D,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;oBACvB,IAAI,GAAG,IAAI,CAAC;gBACd,CAAC;qBAAM,IAAI,IAAI,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;oBACrC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;oBAC7C,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;oBACjD,IAAI,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,SAAS,EAAE,CAAC;wBACZ,MAAM,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;oBACjD,CAAC;yBAAM,CAAC;wBACN,IAAI,GAAG,IAAI,CAAC;oBACd,CAAC;gBACH,CAAC;qBAAM,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;oBAC1B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;oBAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;wBAChC,IAAI,SAAS;4BAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;oBACzC,CAAC;oBACD,IAAI,SAAS,EAAE,CAAC;wBACd,IAAI,GAAG,IAAI,CAAC;wBACZ,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;4BACnC,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;4BAC5B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gCAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBAC7C,CAAC;wBACD,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;oBAChC,CAAC;yBAAM,CAAC;wBACN,SAAS,EAAE,CAAC;wBACZ,MAAM,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;wBACzB,IAAI,KAAK,GAAG,CAAC,CAAC;wBACd,IAAI,QAAQ,GAAU,SAAS,CAAC;wBAChC,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;4BACnC,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gCACvC,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;gCACzB,KAAK,GAAG,CAAC,CAAC,CAAC,iDAAiD;gCAC5D,MAAM;4BACR,CAAC;4BACD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;4BAC3B,KAAK,EAAE,CAAC;wBACV,CAAC;wBACD,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;wBAC1B,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;wBACzD,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;wBAChB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;wBACjB,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;oBACrB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;gBAC7C,CAAC;gBAED,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBACvC,oFAAoF;oBACpF,UAAU,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACjE,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;oBAClF,MAAM;gBACR,CAAC;gBACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjB,SAAS,GAAG,KAAK,CAAC;gBAClB,SAAS,GAAG,SAAS,CAAC;YACxB,CAAC;YAED,OAAO,EAAE,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACtF,CAAC;KACF,CAAC;AACJ,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,EAAc,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC"}

package/dist/sync/sync-engine.d.ts

@@ -2,17 +2,29 @@
  * @module sync-engine
  * Keeps one store in step with its peers.
  *
- * Reconciliation is a pull, and both sides do it:
+ * 1. A peer says hello with a fingerprint of each collection it keeps. Equal
+ *    fingerprints mean the same versions: nothing to do for that collection.
+ * 2. For each collection that differs, one side — the initiator — reconciles
+ *    it with the other (`negentropy.ts`). A few rounds of fingerprints of
+ *    ever smaller ranges end with the initiator knowing which versions each
+ *    side lacks.
+ * 3. The initiator asks for what it lacks, and sends what the other lacks.
+ *    Everything that arrives passes the gatekeeper before it is stored.
  *
- * 1. A tells B its root. Equal roots mean identical data — one round trip, done.
- * 2. Otherwise each walks the other's tree from the root, asking for nodes in
- *    batches and skipping any subtree that is already part of its own tree.
- * 3. The keys found in the nodes it fetched, less the records it already
- *    holds, are what it is missing. It asks for those, and every one of them
- *    passes the gatekeeper before it is stored.
+ * Cost follows the difference, not the size: two stores differing by one
+ * version exchange a few hundred bytes.
  *
- * Cost follows the difference, not the size: two trees differing by one entry
- * exchange the few nodes on the path to it.
+ * The initiator is the peer whose id sorts first, so two peers that hear each
+ * other's hello at once don't both do the work. A peer that isn't the
+ * initiator answers a hello with its own, which starts the other.
+ *
+ * **Holding part of a space.** A node may hold every collection, or only
+ * some (plus the space's own `sys.*`, which every node holds). Each hello
+ * says which. Two peers reconcile only the collections both hold, and a
+ * version for a collection this node doesn't hold is not taken in. Whatever
+ * a node does take in from a peer, it tells that peer it has (`stored`): a
+ * node holding part of a space keeps its own writes until enough keepers have
+ * said so.
  */
 import type { Expression } from '../types.js';
 import type { StorageProvider } from '../storage/storage-provider.js';
@@ -29,9 +41,19 @@ export interface IncomingValidation {
      */
     readonly later?: boolean;
 }
+/** What a node holds of a space: every collection, or these (besides `sys.*`, which every node holds) */
+export type Holds = 'all' | ReadonlySet<string>;
+/** Whether a collection is held, given what a node holds */
+export declare const holdsCollection: (holds: Holds, collection: string) => boolean;
 export interface SyncEngineConfig {
     readonly storageProvider: StorageProvider;
     readonly sendToPeer: (peerId: string, message: SyncMessage) => void;
+    /**
+     * This node's id among its peers. The one of two peers whose id sorts first
+     * starts reconciling. Without it, this node starts whenever it hears of a
+     * difference — harmless, just sometimes twice the work.
+     */
+    readonly self?: string;
     readonly heartbeatInterval?: number;
     /**
      * Gatekeeper for expressions arriving from peers — typically a
@@ -42,14 +64,24 @@ export interface SyncEngineConfig {
      * for a trusted transport or a test.
      */
     readonly validate?: (expression: Expression) => Promise<IncomingValidation>;
+    /** What this node holds, asked afresh for every hello. Default: everything. */
+    readonly holds?: () => Holds;
 }
-export type SyncEvent = 'synced' | 'expression-received' | 'rejected' | 'error';
+/**
+ * - `synced` (peer, full): nothing left in flight with the peer; `full` when the peer holds every collection
+ * - `level` (peer, collection, full): this node holds what the peer holds of a
+ *   collection, as far as it could take it in; `full` when the peer holds every collection
+ * - `stored` (peer, ids): the peer says it now has these versions
+ * - `expression-received` (version), `rejected` (peer, version, reason), `error` (error)
+ */
+export type SyncEvent = 'synced' | 'level' | 'stored' | 'expression-received' | 'rejected' | 'error';
 type EventHandler = (...args: any[]) => void;
 export interface SyncEngine {
     start(): void;
     stop(): void;
     /** Handles whatever a peer sent; anything that is not a sync message this peer speaks is ignored. */
     handleMessage(peerId: string, message: unknown): Promise<void>;
+    /** Says hello to these peers now, rather than at the next heartbeat. */
     notifyPeers(peers: ReadonlyArray<string>): void;
     onLocalChange(expression: Expression): void;
     addPeer(peerId: string): void;
@@ -57,10 +89,10 @@ export interface SyncEngine {
     on(event: SyncEvent, callback: EventHandler): void;
     off(event: SyncEvent, callback: EventHandler): void;
 }
-/** Nodes asked for in one message. Nodes are small; this keeps round trips few. */
-export declare const MAX_CIDS_PER_REQUEST = 64;
-/** Records asked for in one message. */
+/** Records asked for, or sent, in one message. */
 export declare const MAX_IDS_PER_REQUEST = 200;
+/** Largest Negentropy message, in bytes before base64. Stays well inside a data channel's limit. */
+export declare const FRAME_SIZE_LIMIT = 32000;
 /**
  * Creates a sync engine orchestrator.
  * @param config Sync engine configuration.

package/dist/sync/sync-engine.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sync-engine.d.ts","sourceRoot":"","sources":["../../src/sync/sync-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AAItE,OAAO,EAA2C,KAAK,WAAW,EAAwB,MAAM,oBAAoB,CAAC;AAGrH,wDAAwD;AACxD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;CAC1B;AAQD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,eAAe,EAAE,eAAe,CAAC;IAC1C,QAAQ,CAAC,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,KAAK,IAAI,CAAC;IACpE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IACpC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,UAAU,KAAK,OAAO,CAAC,kBAAkB,CAAC,CAAC;CAC7E;AAED,MAAM,MAAM,SAAS,GAAG,QAAQ,GAAG,qBAAqB,GAAG,UAAU,GAAG,OAAO,CAAC;AAChF,KAAK,YAAY,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,IAAI,CAAC;AAE7C,MAAM,WAAW,UAAU;IACzB,KAAK,IAAI,IAAI,CAAC;IACd,IAAI,IAAI,IAAI,CAAC;IACb,qGAAqG;IACrG,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/D,WAAW,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAChD,aAAa,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI,CAAC;IAC5C,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,GAAG,IAAI,CAAC;IACnD,GAAG,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,GAAG,IAAI,CAAC;CACrD;AAED,mFAAmF;AACnF,eAAO,MAAM,oBAAoB,KAAK,CAAC;AACvC,wCAAwC;AACxC,eAAO,MAAM,mBAAmB,MAAM,CAAC;AA0BvC;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,gBAAgB,GAAG,UAAU,CA6RrE"}
+{"version":3,"file":"sync-engine.d.ts","sourceRoot":"","sources":["../../src/sync/sync-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AAKtE,OAAO,EAA2C,KAAK,WAAW,EAAwB,MAAM,oBAAoB,CAAC;AAErH,wDAAwD;AACxD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;CAC1B;AAOD,yGAAyG;AACzG,MAAM,MAAM,KAAK,GAAG,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;AAEhD,4DAA4D;AAC5D,eAAO,MAAM,eAAe,GAAI,OAAO,KAAK,EAAE,YAAY,MAAM,KAAG,OACQ,CAAC;AAK5E,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,eAAe,EAAE,eAAe,CAAC;IAC1C,QAAQ,CAAC,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,KAAK,IAAI,CAAC;IACpE;;;;OAIG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IACpC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,UAAU,KAAK,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAC5E,+EAA+E;IAC/E,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC;CAC9B;AAED;;;;;;GAMG;AACH,MAAM,MAAM,SAAS,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,GAAG,qBAAqB,GAAG,UAAU,GAAG,OAAO,CAAC;AACrG,KAAK,YAAY,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,IAAI,CAAC;AAE7C,MAAM,WAAW,UAAU;IACzB,KAAK,IAAI,IAAI,CAAC;IACd,IAAI,IAAI,IAAI,CAAC;IACb,qGAAqG;IACrG,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/D,wEAAwE;IACxE,WAAW,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAChD,aAAa,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI,CAAC;IAC5C,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,GAAG,IAAI,CAAC;IACnD,GAAG,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,GAAG,IAAI,CAAC;CACrD;AAED,kDAAkD;AAClD,eAAO,MAAM,mBAAmB,MAAM,CAAC;AACvC,oGAAoG;AACpG,eAAO,MAAM,gBAAgB,QAAS,CAAC;AAiCvC;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,gBAAgB,GAAG,UAAU,CA2WrE"}