@weaveprotocol/core 0.1.0

package/dist/sync/sync-engine.js

@@ -0,0 +1,309 @@
+import { deserializeNode } from '../storage/mst.js';
+import { cidFromBytes } from '../utils/hash.js';
+import { createEmitter } from '../utils/events.js';
+import { parseSyncMessage, SYNC_PROTOCOL_VERSION } from './sync-messages.js';
+import { differingEntries, unknownChildren, verifyNode } from './anti-entropy.js';
+/** At most this many records wait for what they depend on; the oldest give way */
+const MAX_WAITING = 1000;
+/** Collection definitions first, then records by version — what others depend on comes first */
+const rank = (e) => (e?.collection === 'sys.collection' ? -1 : (e?.seq ?? 0));
+/** Nodes asked for in one message. Nodes are small; this keeps round trips few. */
+export const MAX_CIDS_PER_REQUEST = 64;
+/** Records asked for in one message. */
+export const MAX_IDS_PER_REQUEST = 200;
+/** A real tree of a billion entries is about seven deep. Anything past this is hostile. */
+const MAX_DEPTH = 32;
+/** Nodes one walk may fetch before it is abandoned as runaway. */
+const MAX_NODES_PER_WALK = 200_000;
+/** A walk that has heard nothing for this long is given up on. */
+const STALE_WALK_MS = 30_000;
+/**
+ * Creates a sync engine orchestrator.
+ * @param config Sync engine configuration.
+ * @returns A sync engine instance.
+ */
+export function createSyncEngine(config) {
+    const { storageProvider, sendToPeer, heartbeatInterval = 30000, validate } = config;
+    const peers = new Set();
+    const walks = new Map();
+    let intervalId = null;
+    let nextRequestId = 1;
+    const { on, off, emit } = createEmitter();
+    const stamp = (msg) => ({ v: SYNC_PROTOCOL_VERSION, ...msg });
+    const send = (peerId, msg) => sendToPeer(peerId, stamp(msg));
+    const broadcast = (msg) => {
+        for (const peer of peers)
+            sendToPeer(peer, stamp(msg));
+    };
+    /**
+     * Commits an expression from a peer, but only if the gatekeeper allows it.
+     * @returns Whether the expression was accepted
+     */
+    const admit = async (peerId, expression) => {
+        if (validate) {
+            const verdict = await validate(expression);
+            if (!verdict.valid) {
+                if (verdict.later) {
+                    waiting.set(expression.id, { peerId, expression });
+                    if (waiting.size > MAX_WAITING)
+                        waiting.delete(waiting.keys().next().value);
+                }
+                else {
+                    emit('rejected', peerId, expression, verdict.reason);
+                }
+                return false;
+            }
+        }
+        waiting.delete(expression.id);
+        await storageProvider.addExpression(expression);
+        emit('expression-received', expression);
+        return true;
+    };
+    /** Records that could not be judged yet — tried again whenever something new is admitted */
+    const waiting = new Map();
+    const retryWaiting = async () => {
+        let progressed = true;
+        while (progressed && waiting.size > 0) {
+            progressed = false;
+            for (const [id, held] of [...waiting]) {
+                waiting.delete(id);
+                if (await admit(held.peerId, held.expression))
+                    progressed = true;
+            }
+        }
+    };
+    // ─── The walk ──────────────────────────────────────────────────────
+    const finish = (peerId, walk) => {
+        walks.delete(peerId);
+        emit('synced', peerId);
+        if (walk.next !== null && walk.next !== walk.remoteRoot)
+            void pull(peerId, walk.next);
+    };
+    /** Sends whatever is queued, or moves on to records once the tree is done. */
+    const advance = (peerId, walk) => {
+        walk.touchedAt = Date.now();
+        while (walk.queue.length > 0) {
+            const batch = walk.queue.splice(0, MAX_CIDS_PER_REQUEST);
+            const id = nextRequestId++;
+            walk.nodeBatches.set(id, batch);
+            send(peerId, { type: 'node-request', id, cids: batch });
+        }
+        if (walk.nodeBatches.size > 0)
+            return;
+        // The tree is walked. Ask for the records it named that are not here.
+        if (walk.missing.size > 0 && walk.idBatches.size === 0) {
+            const ids = [...walk.missing];
+            walk.missing.clear();
+            for (let i = 0; i < ids.length; i += MAX_IDS_PER_REQUEST) {
+                const batch = ids.slice(i, i + MAX_IDS_PER_REQUEST);
+                const id = nextRequestId++;
+                walk.idBatches.set(id, batch);
+                send(peerId, { type: 'diff-request', id, missingIds: batch });
+            }
+            return;
+        }
+        if (walk.idBatches.size === 0)
+            finish(peerId, walk);
+    };
+    /** Pulls a peer's tree, given its root. */
+    const pull = async (peerId, remoteRoot) => {
+        const current = walks.get(peerId);
+        if (current && Date.now() - current.touchedAt < STALE_WALK_MS) {
+            // One walk per peer at a time; a newer root is pulled when this one ends.
+            if (current.remoteRoot !== remoteRoot)
+                current.next = remoteRoot;
+            return;
+        }
+        walks.delete(peerId);
+        if (remoteRoot === null) {
+            emit('synced', peerId);
+            return;
+        }
+        const localRoot = await storageProvider.getRootCid();
+        if (await storageProvider.getAdapter().has(remoteRoot)) {
+            // A tree this store holds, or has moved past: nothing to pull.
+            emit('synced', peerId);
+            return;
+        }
+        const walk = {
+            remoteRoot,
+            localRoot,
+            depth: new Map([[remoteRoot, 0]]),
+            queue: [remoteRoot],
+            nodeBatches: new Map(),
+            missing: new Set(),
+            idBatches: new Map(),
+            fetched: 0,
+            touchedAt: Date.now(),
+            next: null,
+        };
+        walks.set(peerId, walk);
+        advance(peerId, walk);
+    };
+    const onNodes = async (peerId, requestId, nodes) => {
+        const walk = walks.get(peerId);
+        const batch = walk?.nodeBatches.get(requestId);
+        if (!walk || !batch)
+            return; // not ours, or already answered
+        const asked = new Set(batch);
+        const adapter = storageProvider.getAdapter();
+        for (const { cid, node: sent } of nodes) {
+            if (typeof cid !== 'string' || !asked.has(cid))
+                continue;
+            const node = await verifyNode(cid, sent);
+            if (!node)
+                continue; // malformed, or not the node that CID names
+            if (++walk.fetched > MAX_NODES_PER_WALK) {
+                walks.delete(peerId);
+                emit('error', new Error(`Sync with ${peerId} abandoned: more than ${MAX_NODES_PER_WALK} nodes`));
+                return;
+            }
+            for (const id of await differingEntries(adapter, walk.localRoot, node))
+                walk.missing.add(id);
+            const depth = walk.depth.get(cid) ?? 0;
+            if (depth >= MAX_DEPTH)
+                continue;
+            for (const child of await unknownChildren(adapter, node)) {
+                if (walk.depth.has(child))
+                    continue; // already queued — a cycle, or a shared subtree
+                walk.depth.set(child, depth + 1);
+                walk.queue.push(child);
+            }
+        }
+        // Asked-for nodes the peer did not send are simply not followed: a peer can
+        // legitimately have compacted a node away between its root and our request.
+        // Marked answered only now, so a reply processed alongside this one cannot
+        // decide the tree is finished while this one's children are still unqueued.
+        walk.nodeBatches.delete(requestId);
+        advance(peerId, walk);
+    };
+    const onRecords = async (peerId, requestId, expressions) => {
+        const walk = walks.get(peerId);
+        const asked = walk?.idBatches.get(requestId);
+        // Only records this node asked for are considered; anything else was not
+        // requested and is not taken on trust as a side effect.
+        const wanted = asked ? new Set(asked) : null;
+        // Definitions and first versions before what depends on them, so little has to wait.
+        const ordered = [...expressions].sort((a, b) => rank(a) - rank(b));
+        let admitted = false;
+        for (const expression of ordered) {
+            if (wanted?.has(expression?.id) && (await admit(peerId, expression)))
+                admitted = true;
+        }
+        if (admitted)
+            await retryWaiting();
+        if (!walk || !asked)
+            return;
+        walk.idBatches.delete(requestId);
+        advance(peerId, walk);
+    };
+    // ─── Serving ───────────────────────────────────────────────────────
+    const serveNodes = async (peerId, requestId, cids) => {
+        const adapter = storageProvider.getAdapter();
+        const nodes = [];
+        for (const cid of cids.slice(0, MAX_CIDS_PER_REQUEST)) {
+            if (typeof cid !== 'string')
+                continue;
+            const bytes = await adapter.get(cid);
+            // Only content-addressed tree nodes leave this store — never another key
+            // that happens to share the namespace.
+            if (bytes && (await cidFromBytes(bytes)) === cid)
+                nodes.push({ cid, node: deserializeNode(bytes) });
+        }
+        send(peerId, { type: 'node-response', id: requestId, nodes });
+    };
+    const serveRecords = async (peerId, requestId, ids) => {
+        const expressions = [];
+        for (const id of ids.slice(0, MAX_IDS_PER_REQUEST)) {
+            const expression = typeof id === 'string' ? await storageProvider.getExpression(id) : null;
+            if (expression)
+                expressions.push(expression);
+        }
+        // Always answered, even empty: the asker counts replies to know it is done.
+        send(peerId, { type: 'diff-response', id: requestId, expressions });
+    };
+    return {
+        start() {
+            if (intervalId !== null)
+                return;
+            intervalId = setInterval(async () => {
+                const rootCid = await storageProvider.getRootCid();
+                broadcast({ type: 'sync-request', rootCid });
+            }, heartbeatInterval);
+        },
+        stop() {
+            if (intervalId !== null) {
+                clearInterval(intervalId);
+                intervalId = null;
+            }
+            walks.clear();
+        },
+        async handleMessage(peerId, message) {
+            try {
+                const msg = parseSyncMessage(message);
+                if (!msg)
+                    return; // malformed, or a protocol version this peer does not speak
+                switch (msg.type) {
+                    case 'sync-request': {
+                        const localRoot = await storageProvider.getRootCid();
+                        const differs = localRoot !== msg.rootCid;
+                        send(peerId, { type: 'sync-response', rootCid: localRoot, hasChanges: differs });
+                        // They will pull ours from the response; we pull theirs.
+                        if (differs)
+                            await pull(peerId, msg.rootCid);
+                        break;
+                    }
+                    case 'sync-response': {
+                        if (msg.hasChanges)
+                            await pull(peerId, msg.rootCid);
+                        else
+                            emit('synced', peerId);
+                        break;
+                    }
+                    case 'node-request':
+                        await serveNodes(peerId, msg.id, Array.isArray(msg.cids) ? msg.cids : []);
+                        break;
+                    case 'node-response':
+                        await onNodes(peerId, msg.id, Array.isArray(msg.nodes) ? msg.nodes : []);
+                        break;
+                    case 'diff-request':
+                        await serveRecords(peerId, msg.id, Array.isArray(msg.missingIds) ? msg.missingIds : []);
+                        break;
+                    case 'diff-response':
+                        await onRecords(peerId, msg.id, Array.isArray(msg.expressions) ? msg.expressions : []);
+                        break;
+                    case 'push-update':
+                        await admit(peerId, msg.expression);
+                        break;
+                }
+            }
+            catch (err) {
+                emit('error', err);
+            }
+        },
+        notifyPeers(peerIds) {
+            storageProvider.getRootCid().then(rootCid => {
+                for (const peer of peerIds) {
+                    if (peers.has(peer))
+                        send(peer, { type: 'sync-request', rootCid });
+                }
+            }).catch(err => emit('error', err));
+        },
+        onLocalChange(expression) {
+            storageProvider.getRootCid().then(newRootCid => {
+                broadcast({ type: 'push-update', expression, newRootCid: newRootCid || '' });
+            }).catch(err => emit('error', err));
+        },
+        addPeer(peerId) {
+            peers.add(peerId);
+        },
+        removePeer(peerId) {
+            peers.delete(peerId);
+            // A dropped peer must not leave a half-finished walk holding memory.
+            walks.delete(peerId);
+        },
+        on,
+        off,
+    };
+}
+//# sourceMappingURL=sync-engine.js.map

package/dist/sync/sync-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sync-engine.js","sourceRoot":"","sources":["../../src/sync/sync-engine.ts"],"names":[],"mappings":"AAkBA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAA0C,MAAM,oBAAoB,CAAC;AACrH,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAelF,kFAAkF;AAClF,MAAM,WAAW,GAAG,IAAI,CAAC;AAEzB,gGAAgG;AAChG,MAAM,IAAI,GAAG,CAAC,CAAa,EAAU,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,KAAK,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAiClG,mFAAmF;AACnF,MAAM,CAAC,MAAM,oBAAoB,GAAG,EAAE,CAAC;AACvC,wCAAwC;AACxC,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AACvC,2FAA2F;AAC3F,MAAM,SAAS,GAAG,EAAE,CAAC;AACrB,kEAAkE;AAClE,MAAM,kBAAkB,GAAG,OAAO,CAAC;AACnC,kEAAkE;AAClE,MAAM,aAAa,GAAG,MAAM,CAAC;AAoB7B;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAwB;IACvD,MAAM,EAAE,eAAe,EAAE,UAAU,EAAE,iBAAiB,GAAG,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;IACpF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;IACtC,IAAI,UAAU,GAA0C,IAAI,CAAC;IAC7D,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,aAAa,EAAmC,CAAC;IAE3E,MAAM,KAAK,GAAG,CAAC,GAAoB,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,qBAAqB,EAAE,GAAG,GAAG,EAAE,CAAgB,CAAC;IAC9F,MAAM,IAAI,GAAG,CAAC,MAAc,EAAE,GAAoB,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACtF,MAAM,SAAS,GAAG,CAAC,GAAoB,EAAE,EAAE;QACzC,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC;IAEF;;;OAGG;IACH,MAAM,KAAK,GAAG,KAAK,EAAE,MAAc,EAAE,UAAsB,EAAoB,EAAE;QAC/E,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;gBACnB,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;oBAClB,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;oBACnD,IAAI,OAAO,CAAC,IAAI,GAAG,WAAW;wBAAE,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAM,CAAC,CAAC;gBAC/E,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBACvD,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,eAAe,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,qBAAqB,EAAE,UAAU,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,4FAA4F;IAC5F,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsD,CAAC;IAC9E,MAAM,YAAY,GAAG,KAAK,IAAI,EAAE;QAC9B,IAAI,UAAU,GAAG,IAAI,CAAC;QACtB,OAAO,UAAU,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACtC,UAAU,GAAG,KAAK,CAAC;YACnB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;gBACtC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnB,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC;oBAAE,UAAU,GAAG,IAAI,CAAC;YACnE,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,sEAAsE;IAEtE,MAAM,MAAM,GAAG,CAAC,MAAc,EAAE,IAAU,EAAE,EAAE;QAC5C,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,UAAU;YAAE,KAAK,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxF,CAAC,CAAC;IAEF,8EAA8E;IAC9E,MAAM,OAAO,GAAG,CAAC,MAAc,EAAE,IAAU,EAAE,EAAE;QAC7C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE5B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;YACzD,MAAM,EAAE,GAAG,aAAa,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAChC,IAAI,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC;YAAE,OAAO;QAEtC,sEAAsE;QACtE,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACvD,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,mBAAmB,EAAE,CAAC;gBACzD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC;gBACpD,MAAM,EAAE,GAAG,aAAa,EAAE,CAAC;gBAC3B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBAC9B,IAAI,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;YAChE,CAAC;YACD,OAAO;QACT,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC;YAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC;IAEF,2CAA2C;IAC3C,MAAM,IAAI,GAAG,KAAK,EAAE,MAAc,EAAE,UAAyB,EAAiB,EAAE;QAC9E,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,OAAO,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,SAAS,GAAG,aAAa,EAAE,CAAC;YAC9D,0EAA0E;YAC1E,IAAI,OAAO,CAAC,UAAU,KAAK,UAAU;gBAAE,OAAO,CAAC,IAAI,GAAG,UAAU,CAAC;YACjE,OAAO;QACT,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAErB,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YACvB,OAAO;QACT,CAAC;QACD,MAAM,SAAS,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,CAAC;QACrD,IAAI,MAAM,eAAe,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACvD,+DAA+D;YAC/D,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YACvB,OAAO;QACT,CAAC;QAED,MAAM,IAAI,GAAS;YACjB,UAAU;YACV,SAAS;YACT,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,KAAK,EAAE,CAAC,UAAU,CAAC;YACnB,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,SAAS,EAAE,IAAI,GAAG,EAAE;YACpB,OAAO,EAAE,CAAC;YACV,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,IAAI,EAAE,IAAI;SACX,CAAC;QACF,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxB,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,KAAK,EAAE,MAAc,EAAE,SAAiB,EAAE,KAAoD,EAAE,EAAE;QAChH,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,gCAAgC;QAC7D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,eAAe,CAAC,UAAU,EAAE,CAAC;QAE7C,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;YACxC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YACzD,MAAM,IAAI,GAAG,MAAM,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI;gBAAE,SAAS,CAAC,4CAA4C;YAEjE,IAAI,EAAE,IAAI,CAAC,OAAO,GAAG,kBAAkB,EAAE,CAAC;gBACxC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACrB,IAAI,CAAC,OAAO,EAAE,IAAI,KAAK,CAAC,aAAa,MAAM,yBAAyB,kBAAkB,QAAQ,CAAC,CAAC,CAAC;gBACjG,OAAO;YACT,CAAC;YACD,KAAK,MAAM,EAAE,IAAI,MAAM,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC;gBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAE7F,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,KAAK,IAAI,SAAS;gBAAE,SAAS;YACjC,KAAK,MAAM,KAAK,IAAI,MAAM,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;gBACzD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAS,CAAC,gDAAgD;gBACrF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACjC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,4EAA4E;QAC5E,4EAA4E;QAC5E,2EAA2E;QAC3E,4EAA4E;QAC5E,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,KAAK,EAAE,MAAc,EAAE,SAAiB,EAAE,WAAsC,EAAE,EAAE;QACpG,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC7C,yEAAyE;QACzE,wDAAwD;QACxD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7C,qFAAqF;QACrF,MAAM,OAAO,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;YACjC,IAAI,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;gBAAE,QAAQ,GAAG,IAAI,CAAC;QACxF,CAAC;QACD,IAAI,QAAQ;YAAE,MAAM,YAAY,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO;QAC5B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACjC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC;IAEF,sEAAsE;IAEtE,MAAM,UAAU,GAAG,KAAK,EAAE,MAAc,EAAE,SAAiB,EAAE,IAA2B,EAAE,EAAE;QAC1F,MAAM,OAAO,GAAG,eAAe,CAAC,UAAU,EAAE,CAAC;QAC7C,MAAM,KAAK,GAA0C,EAAE,CAAC;QACxD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,oBAAoB,CAAC,EAAE,CAAC;YACtD,IAAI,OAAO,GAAG,KAAK,QAAQ;gBAAE,SAAS;YACtC,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACrC,yEAAyE;YACzE,uCAAuC;YACvC,IAAI,KAAK,IAAI,CAAC,MAAM,YAAY,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACtG,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IAChE,CAAC,CAAC;IAEF,MAAM,YAAY,GAAG,KAAK,EAAE,MAAc,EAAE,SAAiB,EAAE,GAA0B,EAAE,EAAE;QAC3F,MAAM,WAAW,GAAiB,EAAE,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,EAAE,CAAC;YACnD,MAAM,UAAU,GAAG,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,eAAe,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC3F,IAAI,UAAU;gBAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC/C,CAAC;QACD,4EAA4E;QAC5E,IAAI,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC;IACtE,CAAC,CAAC;IAEF,OAAO;QACL,KAAK;YACH,IAAI,UAAU,KAAK,IAAI;gBAAE,OAAO;YAChC,UAAU,GAAG,WAAW,CAAC,KAAK,IAAI,EAAE;gBAClC,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,CAAC;gBACnD,SAAS,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC;YAC/C,CAAC,EAAE,iBAAiB,CAAC,CAAC;QACxB,CAAC;QAED,IAAI;YACF,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;gBACxB,aAAa,CAAC,UAAU,CAAC,CAAC;gBAC1B,UAAU,GAAG,IAAI,CAAC;YACpB,CAAC;YACD,KAAK,CAAC,KAAK,EAAE,CAAC;QAChB,CAAC;QAED,KAAK,CAAC,aAAa,CAAC,MAAc,EAAE,OAAgB;YAClD,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;gBACtC,IAAI,CAAC,GAAG;oBAAE,OAAO,CAAC,4DAA4D;gBAE9E,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;oBACjB,KAAK,cAAc,CAAC,CAAC,CAAC;wBACpB,MAAM,SAAS,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,CAAC;wBACrD,MAAM,OAAO,GAAG,SAAS,KAAK,GAAG,CAAC,OAAO,CAAC;wBAC1C,IAAI,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;wBACjF,yDAAyD;wBACzD,IAAI,OAAO;4BAAE,MAAM,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;wBAC7C,MAAM;oBACR,CAAC;oBACD,KAAK,eAAe,CAAC,CAAC,CAAC;wBACrB,IAAI,GAAG,CAAC,UAAU;4BAAE,MAAM,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;;4BAC/C,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;wBAC5B,MAAM;oBACR,CAAC;oBACD,KAAK,cAAc;wBACjB,MAAM,UAAU,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBAC1E,MAAM;oBACR,KAAK,eAAe;wBAClB,MAAM,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBACzE,MAAM;oBACR,KAAK,cAAc;wBACjB,MAAM,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBACxF,MAAM;oBACR,KAAK,eAAe;wBAClB,MAAM,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;wBACvF,MAAM;oBACR,KAAK,aAAa;wBAChB,MAAM,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;wBACpC,MAAM;gBACV,CAAC;YACH,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,WAAW,CAAC,OAA8B;YACxC,eAAe,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;gBAC1C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;oBAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;QAED,aAAa,CAAC,UAAsB;YAClC,eAAe,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;gBAC7C,SAAS,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,IAAI,EAAE,EAAE,CAAC,CAAC;YAC/E,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,CAAC,MAAc;YACpB,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,CAAC;QAED,UAAU,CAAC,MAAc;YACvB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACrB,qEAAqE;YACrE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;QAED,EAAE;QACF,GAAG;KACJ,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,75 @@
+/**
+ * @module sync-messages
+ * What peers say to each other to reconcile a space.
+ *
+ * Messages are plain objects: they travel inside the network's own envelope,
+ * which is encoded once, rather than being encoded here and again there.
+ *
+ * Every message carries `v`. A peer drops a message whose version it does not
+ * speak rather than half-processing it: two versions that cannot reconcile
+ * should fail loudly, not leave a quiet partial sync.
+ */
+import type { Expression } from '../types.js';
+export declare const SYNC_PROTOCOL_VERSION = 3;
+type V = {
+    readonly v: typeof SYNC_PROTOCOL_VERSION;
+};
+export type SyncMessage = V & (
+/** "My tree's root is this." Equal roots mean identical data. */
+{
+    readonly type: 'sync-request';
+    readonly rootCid: string | null;
+}
+/** The answer: my root, and whether it differs from yours. */
+ | {
+    readonly type: 'sync-response';
+    readonly rootCid: string | null;
+    readonly hasChanges: boolean;
+}
+/**
+ * "Send me these tree nodes." `id` is echoed in the reply: requests are
+ * served concurrently, so replies can arrive in any order.
+ */
+ | {
+    readonly type: 'node-request';
+    readonly id: number;
+    readonly cids: ReadonlyArray<string>;
+}
+/**
+ * Tree nodes, as objects. Unknown CIDs are left out, never an error. The
+ * receiver checks each against its CID by serializing it the one canonical
+ * way (`anti-entropy.ts`).
+ */
+ | {
+    readonly type: 'node-response';
+    readonly id: number;
+    readonly nodes: ReadonlyArray<{
+        readonly cid: string;
+        readonly node: unknown;
+    }>;
+}
+/** "Send me these records." */
+ | {
+    readonly type: 'diff-request';
+    readonly id: number;
+    readonly missingIds: ReadonlyArray<string>;
+} | {
+    readonly type: 'diff-response';
+    readonly id: number;
+    readonly expressions: ReadonlyArray<Expression>;
+}
+/** A record written just now, pushed without waiting for the next round. */
+ | {
+    readonly type: 'push-update';
+    readonly expression: Expression;
+    readonly newRootCid: string;
+});
+/** A message before the version is stamped on — what callers construct. */
+export type SyncMessageBody = SyncMessage extends infer M ? (M extends V ? Omit<M, 'v'> : never) : never;
+/**
+ * Checks that something a peer sent is a sync message this peer speaks.
+ * @returns The message, or null when it is malformed or from another protocol version.
+ */
+export declare function parseSyncMessage(value: unknown): SyncMessage | null;
+export {};
+//# sourceMappingURL=sync-messages.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sync-messages.d.ts","sourceRoot":"","sources":["../../src/sync/sync-messages.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAE9C,eAAO,MAAM,qBAAqB,IAAI,CAAC;AAEvC,KAAK,CAAC,GAAG;IAAE,QAAQ,CAAC,CAAC,EAAE,OAAO,qBAAqB,CAAA;CAAE,CAAC;AAEtD,MAAM,MAAM,WAAW,GAAG,CAAC,GACzB;AACE,iEAAiE;AAC/D;IAAE,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE;AACpE,8DAA8D;GAC5D;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAA;CAAE;AACnG;;;GAGG;GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CAAE;AAC9F;;;;GAIG;GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;QAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;KAAE,CAAC,CAAA;CAAE;AAC1I,+BAA+B;GAC7B;IAAE,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CAAE,GAClG;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,WAAW,EAAE,aAAa,CAAC,UAAU,CAAC,CAAA;CAAE;AAC1G,4EAA4E;GAC1E;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CACjG,CAAC;AAEJ,2EAA2E;AAC3E,MAAM,MAAM,eAAe,GAAG,WAAW,SAAS,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AAEzG;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,WAAW,GAAG,IAAI,CAInE"}

package/dist/sync/sync-messages.js

@@ -0,0 +1,12 @@
+export const SYNC_PROTOCOL_VERSION = 3;
+/**
+ * Checks that something a peer sent is a sync message this peer speaks.
+ * @returns The message, or null when it is malformed or from another protocol version.
+ */
+export function parseSyncMessage(value) {
+    const message = value;
+    if (!message || typeof message !== 'object' || message.v !== SYNC_PROTOCOL_VERSION || typeof message.type !== 'string')
+        return null;
+    return message;
+}
+//# sourceMappingURL=sync-messages.js.map

package/dist/sync/sync-messages.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sync-messages.js","sourceRoot":"","sources":["../../src/sync/sync-messages.ts"],"names":[],"mappings":"AAaA,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC;AA+BvC;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAc;IAC7C,MAAM,OAAO,GAAG,KAAoC,CAAC;IACrD,IAAI,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,KAAK,qBAAqB,IAAI,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACpI,OAAO,OAAsB,CAAC;AAChC,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,243 @@
+/**
+ * Core protocol types used across all modules.
+ * @module types
+ */
+/** Crypto provider interface — abstraction over key algorithms for easy swapping */
+export interface CryptoProvider {
+    readonly algorithm: string;
+    generateKeyPair(): Promise<CryptoKeyPairResult>;
+    /**
+     * Deterministically derives a key pair from seed bytes (same seed → same keys).
+     * Owns the whole KDF: callers pass the raw seed, at least 16 uniform bytes.
+     */
+    deriveKeyPairFromSeed(seed: Uint8Array): Promise<CryptoKeyPairResult>;
+    sign(privateKey: CryptoKey, data: Uint8Array): Promise<Uint8Array>;
+    verify(publicKey: CryptoKey, signature: Uint8Array, data: Uint8Array): Promise<boolean>;
+    exportPublicKey(key: CryptoKey): Promise<Uint8Array>;
+    importPublicKey(bytes: Uint8Array): Promise<CryptoKey>;
+    importPrivateKey(bytes: Uint8Array): Promise<CryptoKey>;
+}
+export interface CryptoKeyPairResult {
+    readonly publicKey: CryptoKey;
+    readonly privateKey: CryptoKey;
+}
+/** Standard Schema v1 interface (https://standardschema.dev/) */
+export interface StandardSchemaV1<Input = unknown, Output = Input> {
+    readonly '~standard': {
+        readonly version: 1;
+        readonly vendor: string;
+        readonly validate: (value: unknown) => StandardSchemaResult<Output> | Promise<StandardSchemaResult<Output>>;
+        readonly types?: {
+            readonly input: Input;
+            readonly output: Output;
+        };
+    };
+}
+/**
+ * Standard JSON Schema v1 (https://standardschema.dev/json-schema): a schema
+ * that can describe itself as JSON Schema — Zod 4.2+, ArkType 2.1.28+, and
+ * Valibot through `toStandardJsonSchema`. It is how a validator you already
+ * use becomes a definition a space can store.
+ */
+export interface StandardJSONSchemaV1<Input = unknown, Output = Input> {
+    readonly '~standard': {
+        readonly version: 1;
+        readonly vendor: string;
+        readonly types?: {
+            readonly input: Input;
+            readonly output: Output;
+        };
+        readonly jsonSchema: {
+            readonly input: (options: {
+                readonly target: string;
+                readonly libraryOptions?: Record<string, unknown>;
+            }) => Record<string, unknown>;
+            readonly output: (options: {
+                readonly target: string;
+                readonly libraryOptions?: Record<string, unknown>;
+            }) => Record<string, unknown>;
+        };
+    };
+}
+export type StandardSchemaResult<Output> = {
+    readonly value: Output;
+    readonly issues?: undefined;
+} | {
+    readonly value?: undefined;
+    readonly issues: ReadonlyArray<StandardSchemaIssue>;
+};
+export interface StandardSchemaIssue {
+    readonly message: string;
+    readonly path?: ReadonlyArray<PropertyKey>;
+}
+/** What a record is about: another record in the same space, in a named role */
+export interface Link {
+    /** The role: 'about', 'in', 'replyTo' — lower camel case */
+    readonly rel: string;
+    /** The key of the record it points at */
+    readonly to: string;
+}
+/** Expression — the atomic data unit */
+export interface Expression<T = unknown> {
+    readonly id: string;
+    readonly author: string;
+    readonly collection: string;
+    readonly space?: string;
+    readonly createdAt: string;
+    readonly body: T;
+    readonly proof?: string;
+    /** The record's identity, stable across versions. Links point here. */
+    readonly key: string;
+    /** 0 for a record's first version; each later version is one more than the one it replaces */
+    readonly seq: number;
+    /** Id of the version this one replaces. Absent on seq 0. */
+    readonly prev?: string;
+    /** Id of the record's first version — who created it. Absent on seq 0. */
+    readonly genesis?: string;
+    /** Keep this version once it is superseded — set by the writer, from the collection's `history` */
+    readonly retain?: true;
+    /**
+     * The latest changes to the space's access history — roles, members,
+     * invites, revoked notes, collection definitions — its writer knew of. It
+     * is judged by who held what, and which definition was in force, as of
+     * those (`space/roles.ts`).
+     */
+    readonly seen?: ReadonlyArray<string>;
+    /** This version deletes the record; its body is null */
+    readonly deleted?: true;
+    /**
+     * Links to other records. Signed with the rest. In a private space they are
+     * sealed inside the encrypted body instead, and this is absent.
+     */
+    readonly links?: ReadonlyArray<Link>;
+    readonly signature: string;
+}
+export interface UnsignedExpression<T = unknown> {
+    readonly author: string;
+    readonly collection: string;
+    /** Space this belongs to — signed, so it cannot be replayed into another space */
+    readonly space?: string;
+    readonly createdAt: string;
+    readonly body: T;
+    /** Encoded UCAN proving the author may write this — signed along with the rest */
+    readonly proof?: string;
+    /** The record's identity, stable across versions. Links point here. */
+    readonly key: string;
+    /** 0 for a record's first version; each later version is one more than the one it replaces */
+    readonly seq: number;
+    /** Id of the version this one replaces. Absent on seq 0. */
+    readonly prev?: string;
+    /** Id of the record's first version — who created it. Absent on seq 0. */
+    readonly genesis?: string;
+    /** Keep this version once it is superseded — set by the writer, from the collection's `history` */
+    readonly retain?: true;
+    /**
+     * The latest changes to the space's access history — roles, members,
+     * invites, revoked notes, collection definitions — its writer knew of. It
+     * is judged by who held what, and which definition was in force, as of
+     * those (`space/roles.ts`).
+     */
+    readonly seen?: ReadonlyArray<string>;
+    /** This version deletes the record; its body is null */
+    readonly deleted?: true;
+    /**
+     * Links to other records. Signed with the rest. In a private space they are
+     * sealed inside the encrypted body instead, and this is absent.
+     */
+    readonly links?: ReadonlyArray<Link>;
+}
+/** Whether a space's contents are readable by anyone who has them */
+export type SpaceVisibility = 'public' | 'private';
+/** A role, as a space defines it — see `space/roles.ts` */
+export interface SpaceRole {
+    /** Lower case, used as its key: `moderator` */
+    readonly name: string;
+    /** What people see: `Moderator` */
+    readonly title?: string;
+    /** Higher can change lower. Equal ranks are equals. */
+    readonly rank: number;
+    readonly permissions: ReadonlyArray<string>;
+}
+/**
+ * A space. Its id is the hash of what is fixed at creation — creator,
+ * visibility, starting roles, time, nonce and read key (`space/space-access.ts`)
+ * — so whoever hands over a space cannot change who started it or with which
+ * roles. `name` is a description, not part of that.
+ */
+export interface Space {
+    readonly id: string;
+    readonly visibility: SpaceVisibility;
+    /** The account that made it, holding `creatorRole` at the start */
+    readonly creator: string;
+    /** The roles it started with — later changed by records in `sys.role` */
+    readonly roles: ReadonlyArray<SpaceRole>;
+    readonly creatorRole: string;
+    readonly name: string;
+    readonly createdAt: string;
+    /** Random, so two spaces made alike still differ */
+    readonly nonce: string;
+    /** Private spaces: the public half of the read key, derived from the space key — what a node checks a reader against */
+    readonly readKey?: string;
+    readonly encryptionKeyId?: string;
+}
+/** Collection definition */
+export interface CollectionDef {
+    readonly name: string;
+    readonly schema: StandardSchemaV1;
+}
+/** Peer info */
+export interface PeerInfo {
+    readonly did: string;
+    readonly connectionId: string;
+    readonly connectedAt: string;
+}
+/** Sync state */
+export interface SyncState {
+    readonly peerId: string;
+    readonly lastSyncedAt: string;
+    readonly remoteRoot: string;
+}
+/** Storage adapter interface */
+export interface StorageAdapter {
+    get(key: string): Promise<Uint8Array | null>;
+    put(key: string, value: Uint8Array): Promise<void>;
+    delete(key: string): Promise<void>;
+    has(key: string): Promise<boolean>;
+    list(prefix?: string): Promise<string[]>;
+    /** Query expressions by collection */
+    queryExpressions(collection: string, limit?: number, cursor?: string): Promise<Expression[]>;
+    /** Store an expression */
+    putExpression(expression: Expression): Promise<void>;
+    /** Get an expression by ID */
+    getExpression(id: string): Promise<Expression | null>;
+    /** Delete an expression by ID */
+    deleteExpression(id: string): Promise<void>;
+    /** Batch operations */
+    batch(ops: ReadonlyArray<BatchOp>): Promise<void>;
+    close(): Promise<void>;
+}
+export type BatchOp = {
+    readonly type: 'put';
+    readonly key: string;
+    readonly value: Uint8Array;
+} | {
+    readonly type: 'delete';
+    readonly key: string;
+};
+/** Network message envelope */
+export interface NetworkMessage {
+    readonly type: string;
+    readonly from: string;
+    readonly payload: unknown;
+}
+/** Result type for operations that can fail */
+export type Result<T, E = Error> = {
+    readonly ok: true;
+    readonly value: T;
+} | {
+    readonly ok: false;
+    readonly error: E;
+};
+export declare const ok: <T>(value: T) => Result<T, never>;
+export declare const err: <E>(error: E) => Result<never, E>;
+//# sourceMappingURL=types.d.ts.map