@weaveprotocol/core 0.1.0

package/dist/storage/indexeddb-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexeddb-adapter.js","sourceRoot":"","sources":["../../src/storage/indexeddb-adapter.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;GAGG;AACH,MAAM,UAAU,GAAG,CAAC,CAAC;AAErB;;;;GAIG;AACH,SAAS,UAAU,CAAI,OAAsB;IAC3C,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,OAAO,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClD,OAAO,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CACrB,EAAe,EACf,MAAgB,EAChB,IAAwB;IAExB,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrD,EAAE,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;QAChC,EAAE,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QACpC,EAAE,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC;AAC1B,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAAC,SAAiB,eAAe;IAC3E,MAAM,EAAE,GAAG,MAAM,IAAI,OAAO,CAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QAC5D,MAAM,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAE9D,OAAO,CAAC,eAAe,GAAG,CAAC,KAAK,EAAE,EAAE;YAClC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC;YAC1B,MAAM,eAAe,GAAI,KAA+B,CAAC,UAAU,CAAC;YAEpE,sEAAsE;YACtE,yEAAyE;YACzE,wEAAwE;YACxE,iCAAiC;YACjC,IAAI,eAAe,GAAG,CAAC,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;gBAC/C,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,CAAC;oBACzC,IAAI,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAAE,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;YAED,iDAAiD;YACjD,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;YAC7B,CAAC;YAED,wBAAwB;YACxB,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;gBACjD,MAAM,QAAQ,GAAG,EAAE,CAAC,iBAAiB,CAAC,aAAa,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;gBACxE,QAAQ,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;gBACpE,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC5D,QAAQ,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;YACpE,CAAC;QACH,CAAC,CAAC;QAEF,OAAO,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClD,OAAO,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,KAAK,CAAC,GAAG,CAAC,GAAW;YACnB,MAAM,EAAE,EAAE,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC;YACtD,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAChD,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,GAAW,EAAE,KAAiB;YACtC,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,CAAC;YACjE,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAC7B,MAAM,QAAQ,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,MAAM,CAAC,GAAW;YACtB,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,CAAC;YACjE,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAClB,MAAM,QAAQ,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,GAAW;YACnB,MAAM,EAAE,EAAE,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC;YACtD,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YACjD,OAAO,KAAK,GAAG,CAAC,CAAC;QACnB,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,SAAiB,EAAE;YAC5B,MAAM,EAAE,EAAE,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC;YACtD,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,IAAI,GAAa,EAAE,CAAC;YAE1B,IAAI,OAAO,CAAC;YACZ,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,KAAK,GAAG,MAAM,GAAG,QAAQ,CAAC;gBAChC,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YAC7E,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;YAC/B,CAAC;YAED,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC1C,OAAO,CAAC,SAAS,GAAG,CAAC,KAAK,EAAE,EAAE;oBAC5B,MAAM,MAAM,GAAI,KAAK,CAAC,MAAyC,CAAC,MAAM,CAAC;oBACvE,IAAI,MAAM,EAAE,CAAC;wBACX,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAa,CAAC,CAAC;wBAChC,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACpB,CAAC;yBAAM,CAAC;wBACN,OAAO,EAAE,CAAC;oBACZ,CAAC;gBACH,CAAC,CAAC;gBACF,OAAO,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACd,CAAC;QAED,KAAK,CAAC,gBAAgB,CAAC,UAAkB,EAAE,QAAgB,EAAE,EAAE,MAAe;YAC5E,MAAM,EAAE,EAAE,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,EAAE,UAAU,CAAC,CAAC;YAC/D,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;YAExC,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAExC,MAAM,OAAO,GAAiB,EAAE,CAAC;YACjC,IAAI,QAAQ,GAAG,CAAC,MAAM,CAAC;YAEvB,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC1C,OAAO,CAAC,SAAS,GAAG,CAAC,KAAK,EAAE,EAAE;oBAC5B,MAAM,SAAS,GAAI,KAAK,CAAC,MAAyC,CAAC,MAAM,CAAC;oBAC1E,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;wBAC1C,OAAO,EAAE,CAAC;wBACV,OAAO;oBACT,CAAC;oBAED,IAAI,CAAC,QAAQ,IAAI,MAAM,IAAI,SAAS,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;wBAC3D,QAAQ,GAAG,IAAI,CAAC;wBAChB,SAAS,CAAC,QAAQ,EAAE,CAAC;wBACrB,OAAO;oBACT,CAAC;oBAED,IAAI,QAAQ,EAAE,CAAC;wBACb,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;oBAChC,CAAC;oBACD,SAAS,CAAC,QAAQ,EAAE,CAAC;gBACvB,CAAC,CAAC;gBACF,OAAO,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC,CAAC,CAAC;YAEH,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,aAAa,CAAC,UAAsB;YACxC,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,EAAE,WAAW,CAAC,CAAC;YAC1E,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;YAC5C,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACtB,MAAM,QAAQ,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,aAAa,CAAC,EAAU;YAC5B,MAAM,EAAE,EAAE,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,EAAE,UAAU,CAAC,CAAC;YAC/D,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;YAC5C,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/C,OAAO,MAAM,IAAI,IAAI,CAAC;QACxB,CAAC;QAED,KAAK,CAAC,gBAAgB,CAAC,EAAU;YAC/B,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,EAAE,WAAW,CAAC,CAAC;YAC1E,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;YAC5C,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjB,MAAM,QAAQ,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,KAAK,CAAC,GAA2B;YACrC,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,CAAC;YACjE,MAAM,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;gBACrB,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;oBACtB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;gBACrC,CAAC;qBAAM,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBAChC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,MAAM,QAAQ,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,KAAK;YACT,EAAE,CAAC,KAAK,EAAE,CAAC;QACb,CAAC;KACF,CAAC,CAAC;AACL,CAAC"}

package/dist/storage/mst.d.ts

@@ -0,0 +1,121 @@
+/**
+ * @module mst
+ * Merkle Search Tree (MST) — a deterministic, content-addressed ordered map.
+ *
+ * Every key carries a height derived from its own hash (see {@link nodeHeight}),
+ * and a key lives in the node at exactly that height. Because the height comes
+ * from the key rather than from insertion order, the same set of entries always
+ * produces the same tree — and therefore the same root CID — no matter what
+ * order it was built in. That determinism is what makes the root usable as a
+ * one-word summary of a peer's state, and what lets two peers skip any subtree
+ * whose CID they both already hold.
+ *
+ * Nodes are immutable: an insert rewrites only the path from the touched node
+ * up to the root, which is O(log N) nodes rather than the whole tree.
+ */
+import type { StorageAdapter } from '../types.js';
+/**
+ * A node in the Merkle Search Tree.
+ *
+ * Every key in `keys` hashes to `height`. `children` always holds one more
+ * entry than `keys`: `children[i]` is the subtree at `height - 1` covering the
+ * keys that sort between `keys[i - 1]` and `keys[i]`.
+ */
+export interface MSTNode {
+    readonly height: number;
+    readonly keys: ReadonlyArray<string>;
+    readonly values: ReadonlyArray<string>;
+    readonly children: ReadonlyArray<string | null>;
+}
+/**
+ * Creates an empty MST node at the given height.
+ * @param height The height the node sits at.
+ * @returns An empty node.
+ */
+export declare function createEmptyNode(height?: number): MSTNode;
+/**
+ * Canonical JSON serialization of an MST node.
+ * @param node The node to serialize.
+ * @returns The canonical bytes.
+ */
+export declare function serializeNode(node: MSTNode): Uint8Array;
+/**
+ * Deserialize an MST node.
+ * @param data The canonical bytes.
+ * @returns The node.
+ */
+export declare function deserializeNode(data: Uint8Array): MSTNode;
+/**
+ * Hashes a node to get its CID.
+ * @param node The node to hash.
+ * @returns The node's CID.
+ */
+export declare function hashNode(node: MSTNode): Promise<string>;
+/**
+ * Calculate the deterministic height of a key using SHA-256.
+ * Counts leading zero bits in the hash, divided by 4 — so roughly one key in
+ * 16 sits a level higher than the last, giving the tree its branching factor.
+ * @param key The key to place.
+ * @returns The height the key belongs at.
+ */
+export declare function nodeHeight(key: string): Promise<number>;
+/**
+ * Load a node from the storage adapter.
+ * @param adapter The storage adapter.
+ * @param cid The node's CID.
+ * @returns The node.
+ */
+export declare function loadNode(adapter: StorageAdapter, cid: string): Promise<MSTNode>;
+/**
+ * Save a node to the storage adapter and return its CID.
+ * @param adapter The storage adapter.
+ * @param node The node to store.
+ * @returns The node's CID.
+ */
+export declare function saveNode(adapter: StorageAdapter, node: MSTNode): Promise<string>;
+/**
+ * Every node CID reachable from a root: the tree as it stands, without the
+ * orphans older versions left behind in the store. Sync uses it to decide
+ * which of a peer's subtrees it already holds; garbage collection uses it to
+ * decide what to keep.
+ * @param adapter The storage adapter.
+ * @param rootCid The root, or null for an empty tree.
+ */
+export declare function collectReachableCids(adapter: StorageAdapter, rootCid: string | null): Promise<Set<string>>;
+/**
+ * Insert a key-value pair into the MST.
+ * @param adapter The storage adapter.
+ * @param rootCid The current root, or null for an empty tree.
+ * @param key The key to insert.
+ * @param value The value to store against it.
+ * @returns The new root CID.
+ */
+export declare function insertIntoMST(adapter: StorageAdapter, rootCid: string | null, key: string, value: string): Promise<string>;
+/**
+ * Delete a key from the MST.
+ * @param adapter The storage adapter.
+ * @param rootCid The current root, or null for an empty tree.
+ * @param key The key to remove.
+ * @returns The new root CID, or null once the tree is empty.
+ */
+export declare function deleteFromMST(adapter: StorageAdapter, rootCid: string | null, key: string): Promise<string | null>;
+/**
+ * Lookup a value by key.
+ * @param adapter The storage adapter.
+ * @param rootCid The root to search from.
+ * @param key The key to find.
+ * @returns The value, or null when absent.
+ */
+export declare function lookupInMST(adapter: StorageAdapter, rootCid: string | null, key: string): Promise<string | null>;
+/**
+ * Lists entries — keys with their values — in key order: all of them, or
+ * those under a prefix, reading only the nodes that can hold them.
+ * @param adapter The storage adapter.
+ * @param rootCid The root, or null for an empty tree.
+ * @param prefix Only keys starting with this
+ */
+export declare function listMSTEntries(adapter: StorageAdapter, rootCid: string | null, prefix?: string): Promise<Array<{
+    key: string;
+    value: string;
+}>>;
+//# sourceMappingURL=mst.d.ts.map

package/dist/storage/mst.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mst.d.ts","sourceRoot":"","sources":["../../src/storage/mst.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAIlD;;;;;;GAMG;AACH,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IACrC,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IACvC,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;CACjD;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,MAAM,SAAI,GAAG,OAAO,CAOnD;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,OAAO,GAAG,UAAU,CASvD;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAQzD;AAED;;;;GAIG;AACH,wBAAsB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAG7D;AAED;;;;;;GAMG;AACH,wBAAsB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAiB7D;AAED;;;;;GAKG;AACH,wBAAsB,QAAQ,CAAC,OAAO,EAAE,cAAc,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAIrF;AAED;;;;;GAKG;AACH,wBAAsB,QAAQ,CAAC,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAKtF;AA+PD;;;;;;;GAOG;AACH,wBAAsB,oBAAoB,CAAC,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAEhH;AAED;;;;;;;GAOG;AACH,wBAAsB,aAAa,CACjC,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,MAAM,CAAC,CAuBjB;AAED;;;;;;GAMG;AACH,wBAAsB,aAAa,CACjC,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,GAAG,EAAE,MAAM,GACV,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAexB;AAED;;;;;;GAMG;AACH,wBAAsB,WAAW,CAC/B,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,GAAG,EAAE,MAAM,GACV,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CASxB;AAED;;;;;;GAMG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,MAAM,SAAK,GACV,OAAO,CAAC,KAAK,CAAC;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC,CAIhD"}

package/dist/storage/mst.js

@@ -0,0 +1,402 @@
+/**
+ * @module mst
+ * Merkle Search Tree (MST) — a deterministic, content-addressed ordered map.
+ *
+ * Every key carries a height derived from its own hash (see {@link nodeHeight}),
+ * and a key lives in the node at exactly that height. Because the height comes
+ * from the key rather than from insertion order, the same set of entries always
+ * produces the same tree — and therefore the same root CID — no matter what
+ * order it was built in. That determinism is what makes the root usable as a
+ * one-word summary of a peer's state, and what lets two peers skip any subtree
+ * whose CID they both already hold.
+ *
+ * Nodes are immutable: an insert rewrites only the path from the touched node
+ * up to the root, which is O(log N) nodes rather than the whole tree.
+ */
+import { utf8Encode, utf8Decode } from '../utils/encoding.js';
+import { sha256, cidFromBytes } from '../utils/hash.js';
+/**
+ * Creates an empty MST node at the given height.
+ * @param height The height the node sits at.
+ * @returns An empty node.
+ */
+export function createEmptyNode(height = 0) {
+    return Object.freeze({
+        height,
+        keys: Object.freeze([]),
+        values: Object.freeze([]),
+        children: Object.freeze([null])
+    });
+}
+/**
+ * Canonical JSON serialization of an MST node.
+ * @param node The node to serialize.
+ * @returns The canonical bytes.
+ */
+export function serializeNode(node) {
+    // Field order is fixed so the same node always hashes to the same CID.
+    const obj = {
+        height: node.height,
+        keys: node.keys,
+        values: node.values,
+        children: node.children
+    };
+    return utf8Encode(JSON.stringify(obj));
+}
+/**
+ * Deserialize an MST node.
+ * @param data The canonical bytes.
+ * @returns The node.
+ */
+export function deserializeNode(data) {
+    const obj = JSON.parse(utf8Decode(data));
+    return Object.freeze({
+        height: obj.height ?? 0,
+        keys: Object.freeze([...obj.keys]),
+        values: Object.freeze([...obj.values]),
+        children: Object.freeze([...obj.children])
+    });
+}
+/**
+ * Hashes a node to get its CID.
+ * @param node The node to hash.
+ * @returns The node's CID.
+ */
+export async function hashNode(node) {
+    const bytes = serializeNode(node);
+    return cidFromBytes(bytes);
+}
+/**
+ * Calculate the deterministic height of a key using SHA-256.
+ * Counts leading zero bits in the hash, divided by 4 — so roughly one key in
+ * 16 sits a level higher than the last, giving the tree its branching factor.
+ * @param key The key to place.
+ * @returns The height the key belongs at.
+ */
+export async function nodeHeight(key) {
+    const hashBytes = await sha256(utf8Encode(key));
+    let zeros = 0;
+    for (let i = 0; i < hashBytes.length; i++) {
+        const byte = hashBytes[i];
+        if (byte === 0) {
+            zeros += 8;
+        }
+        else {
+            let temp = byte;
+            while ((temp & 0x80) === 0) {
+                zeros++;
+                temp <<= 1;
+            }
+            break;
+        }
+    }
+    return Math.floor(zeros / 4);
+}
+/**
+ * Load a node from the storage adapter.
+ * @param adapter The storage adapter.
+ * @param cid The node's CID.
+ * @returns The node.
+ */
+export async function loadNode(adapter, cid) {
+    const data = await adapter.get(cid);
+    if (!data)
+        throw new Error(`Node not found: ${cid}`);
+    return deserializeNode(data);
+}
+/**
+ * Save a node to the storage adapter and return its CID.
+ * @param adapter The storage adapter.
+ * @param node The node to store.
+ * @returns The node's CID.
+ */
+export async function saveNode(adapter, node) {
+    const bytes = serializeNode(node);
+    const cid = await cidFromBytes(bytes);
+    await adapter.put(cid, bytes);
+    return cid;
+}
+// --------------------------------------------------------------- internals
+/** Index of the first key that is greater than or equal to `target`. */
+function lowerBound(keys, target) {
+    let lo = 0;
+    let hi = keys.length;
+    while (lo < hi) {
+        const mid = (lo + hi) >> 1;
+        if (keys[mid] < target)
+            lo = mid + 1;
+        else
+            hi = mid;
+    }
+    return lo;
+}
+/**
+ * Stores a node, unless it carries nothing at all — an empty node with no
+ * surviving child is simply an absent subtree, and representing it as `null`
+ * keeps the tree canonical.
+ */
+async function saveOrPrune(adapter, node) {
+    if (node.keys.length === 0 && node.children.every(child => child === null))
+        return null;
+    return saveNode(adapter, node);
+}
+/**
+ * Wraps a subtree in empty parent nodes until it sits at `toHeight`.
+ *
+ * A height gap has to be filled with real nodes rather than skipped, because
+ * every tree holding the same keys must produce the same CIDs.
+ */
+async function lift(adapter, cid, fromHeight, toHeight) {
+    if (cid === null)
+        return null;
+    let current = cid;
+    for (let h = fromHeight + 1; h <= toHeight; h++) {
+        current = await saveNode(adapter, Object.freeze({
+            height: h,
+            keys: Object.freeze([]),
+            values: Object.freeze([]),
+            children: Object.freeze([current])
+        }));
+    }
+    return current;
+}
+/** Builds a subtree topped at `topHeight` holding exactly one entry. */
+async function singleton(adapter, key, value, keyHeight, topHeight) {
+    const leaf = await saveNode(adapter, Object.freeze({
+        height: keyHeight,
+        keys: Object.freeze([key]),
+        values: Object.freeze([value]),
+        children: Object.freeze([null, null])
+    }));
+    return (await lift(adapter, leaf, keyHeight, topHeight));
+}
+/**
+ * Splits a subtree into the entries below `key` and those above it, both
+ * returned at the input subtree's height.
+ */
+async function splitSubtree(adapter, cid, key) {
+    if (cid === null)
+        return [null, null];
+    const node = await loadNode(adapter, cid);
+    const idx = lowerBound(node.keys, key);
+    // The child at `idx` straddles the split point, so it splits too.
+    const [childLeft, childRight] = await splitSubtree(adapter, node.children[idx] ?? null, key);
+    const left = {
+        height: node.height,
+        keys: node.keys.slice(0, idx),
+        values: node.values.slice(0, idx),
+        children: [...node.children.slice(0, idx), childLeft]
+    };
+    const right = {
+        height: node.height,
+        keys: node.keys.slice(idx),
+        values: node.values.slice(idx),
+        children: [childRight, ...node.children.slice(idx + 1)]
+    };
+    return [await saveOrPrune(adapter, left), await saveOrPrune(adapter, right)];
+}
+/**
+ * Merges two adjacent subtrees of equal height, where every key on the left
+ * sorts before every key on the right.
+ */
+async function mergeSubtrees(adapter, left, right) {
+    if (left === null)
+        return right;
+    if (right === null)
+        return left;
+    const leftNode = await loadNode(adapter, left);
+    const rightNode = await loadNode(adapter, right);
+    // The two subtrees meet at the left's last child and the right's first.
+    const middle = await mergeSubtrees(adapter, leftNode.children[leftNode.children.length - 1] ?? null, rightNode.children[0] ?? null);
+    return saveOrPrune(adapter, {
+        height: leftNode.height,
+        keys: [...leftNode.keys, ...rightNode.keys],
+        values: [...leftNode.values, ...rightNode.values],
+        children: [...leftNode.children.slice(0, -1), middle, ...rightNode.children.slice(1)]
+    });
+}
+/** Inserts into a subtree known to sit at `subtreeHeight`. */
+async function insertInto(adapter, cid, subtreeHeight, key, value, keyHeight) {
+    if (cid === null)
+        return singleton(adapter, key, value, keyHeight, subtreeHeight);
+    const node = await loadNode(adapter, cid);
+    const idx = lowerBound(node.keys, key);
+    if (keyHeight === node.height) {
+        if (node.keys[idx] === key) {
+            const values = [...node.values];
+            values[idx] = value;
+            return saveNode(adapter, { ...node, values });
+        }
+        // The key lands between two existing keys, so the subtree that currently
+        // spans that gap has to be split around it.
+        const [childLeft, childRight] = await splitSubtree(adapter, node.children[idx] ?? null, key);
+        return saveNode(adapter, {
+            height: node.height,
+            keys: [...node.keys.slice(0, idx), key, ...node.keys.slice(idx)],
+            values: [...node.values.slice(0, idx), value, ...node.values.slice(idx)],
+            children: [...node.children.slice(0, idx), childLeft, childRight, ...node.children.slice(idx + 1)]
+        });
+    }
+    // The key belongs further down; only this child changes.
+    const child = await insertInto(adapter, node.children[idx] ?? null, node.height - 1, key, value, keyHeight);
+    const children = [...node.children];
+    children[idx] = child;
+    return saveNode(adapter, { ...node, children });
+}
+/** Removes from a subtree, returning its new CID, or `null` if nothing is left. */
+async function deleteFrom(adapter, cid, key, keyHeight) {
+    if (cid === null)
+        return null;
+    const node = await loadNode(adapter, cid);
+    // A key sitting above this node cannot appear anywhere beneath it.
+    if (keyHeight > node.height)
+        return cid;
+    const idx = lowerBound(node.keys, key);
+    if (keyHeight === node.height) {
+        if (node.keys[idx] !== key)
+            return cid;
+        // Removing the separator joins the subtrees on either side of it.
+        const merged = await mergeSubtrees(adapter, node.children[idx] ?? null, node.children[idx + 1] ?? null);
+        return saveOrPrune(adapter, {
+            height: node.height,
+            keys: [...node.keys.slice(0, idx), ...node.keys.slice(idx + 1)],
+            values: [...node.values.slice(0, idx), ...node.values.slice(idx + 1)],
+            children: [...node.children.slice(0, idx), merged, ...node.children.slice(idx + 2)]
+        });
+    }
+    const existing = node.children[idx] ?? null;
+    const child = await deleteFrom(adapter, existing, key, keyHeight);
+    if (child === existing)
+        return cid;
+    const children = [...node.children];
+    children[idx] = child;
+    return saveOrPrune(adapter, { ...node, children });
+}
+/**
+ * Walks the entries whose keys start with `prefix`, in key order, skipping
+ * every subtree that lies wholly outside that range.
+ */
+async function walkEntries(adapter, cid, prefix, visit) {
+    if (cid === null)
+        return;
+    const node = await loadNode(adapter, cid);
+    const { keys } = node;
+    // Child i holds the keys between keys[i - 1] and keys[i].
+    for (let i = 0; i <= keys.length; i++) {
+        const below = keys[i - 1];
+        const above = keys[i];
+        const afterRange = below !== undefined && below > prefix && !below.startsWith(prefix);
+        if (afterRange)
+            return;
+        const beforeRange = above !== undefined && above < prefix;
+        if (!beforeRange)
+            await walkEntries(adapter, node.children[i] ?? null, prefix, visit);
+        if (above !== undefined && above.startsWith(prefix))
+            visit(above, node.values[i]);
+    }
+}
+/** Collects the CID of every node reachable from `cid`. */
+async function collectCids(adapter, cid, out = new Set()) {
+    if (cid === null || out.has(cid))
+        return out;
+    out.add(cid);
+    const node = await loadNode(adapter, cid);
+    for (const child of node.children) {
+        await collectCids(adapter, child ?? null, out);
+    }
+    return out;
+}
+// ------------------------------------------------------------ public API
+/**
+ * Every node CID reachable from a root: the tree as it stands, without the
+ * orphans older versions left behind in the store. Sync uses it to decide
+ * which of a peer's subtrees it already holds; garbage collection uses it to
+ * decide what to keep.
+ * @param adapter The storage adapter.
+ * @param rootCid The root, or null for an empty tree.
+ */
+export async function collectReachableCids(adapter, rootCid) {
+    return collectCids(adapter, rootCid);
+}
+/**
+ * Insert a key-value pair into the MST.
+ * @param adapter The storage adapter.
+ * @param rootCid The current root, or null for an empty tree.
+ * @param key The key to insert.
+ * @param value The value to store against it.
+ * @returns The new root CID.
+ */
+export async function insertIntoMST(adapter, rootCid, key, value) {
+    const keyHeight = await nodeHeight(key);
+    if (rootCid === null)
+        return singleton(adapter, key, value, keyHeight, keyHeight);
+    const root = await loadNode(adapter, rootCid);
+    if (keyHeight > root.height) {
+        // The key outranks everything already stored, so it becomes the new root
+        // and the existing tree is split to sit beneath it.
+        const [left, right] = await splitSubtree(adapter, rootCid, key);
+        return saveNode(adapter, {
+            height: keyHeight,
+            keys: [key],
+            values: [value],
+            children: [
+                await lift(adapter, left, root.height, keyHeight - 1),
+                await lift(adapter, right, root.height, keyHeight - 1)
+            ]
+        });
+    }
+    return insertInto(adapter, rootCid, root.height, key, value, keyHeight);
+}
+/**
+ * Delete a key from the MST.
+ * @param adapter The storage adapter.
+ * @param rootCid The current root, or null for an empty tree.
+ * @param key The key to remove.
+ * @returns The new root CID, or null once the tree is empty.
+ */
+export async function deleteFromMST(adapter, rootCid, key) {
+    if (!rootCid)
+        return null;
+    const keyHeight = await nodeHeight(key);
+    let next = await deleteFrom(adapter, rootCid, key, keyHeight);
+    // Removing the tallest key can leave empty wrappers on top; drop them so the
+    // root is always the highest node that actually holds a key.
+    while (next !== null) {
+        const node = await loadNode(adapter, next);
+        if (node.keys.length > 0)
+            break;
+        next = node.children[0] ?? null;
+    }
+    return next;
+}
+/**
+ * Lookup a value by key.
+ * @param adapter The storage adapter.
+ * @param rootCid The root to search from.
+ * @param key The key to find.
+ * @returns The value, or null when absent.
+ */
+export async function lookupInMST(adapter, rootCid, key) {
+    let cid = rootCid;
+    while (cid !== null) {
+        const node = await loadNode(adapter, cid);
+        const idx = lowerBound(node.keys, key);
+        if (node.keys[idx] === key)
+            return node.values[idx];
+        cid = node.children[idx] ?? null;
+    }
+    return null;
+}
+/**
+ * Lists entries — keys with their values — in key order: all of them, or
+ * those under a prefix, reading only the nodes that can hold them.
+ * @param adapter The storage adapter.
+ * @param rootCid The root, or null for an empty tree.
+ * @param prefix Only keys starting with this
+ */
+export async function listMSTEntries(adapter, rootCid, prefix = '') {
+    const entries = [];
+    await walkEntries(adapter, rootCid, prefix, (key, value) => { entries.push({ key, value }); });
+    return entries;
+}
+//# sourceMappingURL=mst.js.map

package/dist/storage/mst.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mst.js","sourceRoot":"","sources":["../../src/storage/mst.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAgBxD;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,MAAM,GAAG,CAAC;IACxC,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,MAAM;QACN,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACvB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACzB,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;KAChC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAAa;IACzC,uEAAuE;IACvE,MAAM,GAAG,GAAG;QACV,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;KACxB,CAAC;IACF,OAAO,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAgB;IAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC;QACvB,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;KAC3C,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,IAAa;IAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAClC,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,GAAW;IAC1C,MAAM,SAAS,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,KAAK,EAAE,CAAC;gBACR,IAAI,KAAK,CAAC,CAAC;YACb,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,OAAuB,EAAE,GAAW;IACjE,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,GAAG,EAAE,CAAC,CAAC;IACrD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,OAAuB,EAAE,IAAa;IACnE,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,MAAM,YAAY,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,4EAA4E;AAE5E,wEAAwE;AACxE,SAAS,UAAU,CAAC,IAA2B,EAAE,MAAc;IAC7D,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;IACrB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,GAAG,CAAE,GAAG,MAAM;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;YACjC,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,WAAW,CAAC,OAAuB,EAAE,IAAa;IAC/D,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACxF,OAAO,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,IAAI,CACjB,OAAuB,EACvB,GAAkB,EAClB,UAAkB,EAClB,QAAgB;IAEhB,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,OAAO,GAAG,GAAG,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,OAAO,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC;YAC9C,MAAM,EAAE,CAAC;YACT,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YACvB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC;SACnC,CAAC,CAAC,CAAC;IACN,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,wEAAwE;AACxE,KAAK,UAAU,SAAS,CACtB,OAAuB,EACvB,GAAW,EACX,KAAa,EACb,SAAiB,EACjB,SAAiB;IAEjB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC;QACjD,MAAM,EAAE,SAAS;QACjB,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9B,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KACtC,CAAC,CAAC,CAAC;IACJ,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,CAAC,CAAE,CAAC;AAC5D,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,YAAY,CACzB,OAAuB,EACvB,GAAkB,EAClB,GAAW;IAEX,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAEtC,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAEvC,kEAAkE;IAClE,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC;IAE7F,MAAM,IAAI,GAAY;QACpB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;QAC7B,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;QACjC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,CAAC;KACtD,CAAC;IACF,MAAM,KAAK,GAAY;QACrB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAC1B,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC;QAC9B,QAAQ,EAAE,CAAC,UAAU,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;KACxD,CAAC;IAEF,OAAO,CAAC,MAAM,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,MAAM,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,aAAa,CAC1B,OAAuB,EACvB,IAAmB,EACnB,KAAoB;IAEpB,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAChC,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAEhC,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAEjD,wEAAwE;IACxE,MAAM,MAAM,GAAG,MAAM,aAAa,CAChC,OAAO,EACP,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,EACvD,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAC9B,CAAC;IAEF,OAAO,WAAW,CAAC,OAAO,EAAE;QAC1B,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,IAAI,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3C,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC;QACjD,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;KACtF,CAAC,CAAC;AACL,CAAC;AAED,8DAA8D;AAC9D,KAAK,UAAU,UAAU,CACvB,OAAuB,EACvB,GAAkB,EAClB,aAAqB,EACrB,GAAW,EACX,KAAa,EACb,SAAiB;IAEjB,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IAElF,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAEvC,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YACpB,OAAO,QAAQ,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAChD,CAAC;QAED,yEAAyE;QACzE,4CAA4C;QAC5C,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7F,OAAO,QAAQ,CAAC,OAAO,EAAE;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChE,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACxE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;SACnG,CAAC,CAAC;IACL,CAAC;IAED,yDAAyD;IACzD,MAAM,KAAK,GAAG,MAAM,UAAU,CAC5B,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,CAC5E,CAAC;IACF,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACtB,OAAO,QAAQ,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AAClD,CAAC;AAED,mFAAmF;AACnF,KAAK,UAAU,UAAU,CACvB,OAAuB,EACvB,GAAkB,EAClB,GAAW,EACX,SAAiB;IAEjB,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAE9B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAE1C,mEAAmE;IACnE,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM;QAAE,OAAO,GAAG,CAAC;IAExC,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAEvC,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG;YAAE,OAAO,GAAG,CAAC;QAEvC,kEAAkE;QAClE,MAAM,MAAM,GAAG,MAAM,aAAa,CAChC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CACpE,CAAC;QACF,OAAO,WAAW,CAAC,OAAO,EAAE;YAC1B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAC/D,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACrE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;SACpF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;IAC5C,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;IAClE,IAAI,KAAK,KAAK,QAAQ;QAAE,OAAO,GAAG,CAAC;IAEnC,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACtB,OAAO,WAAW,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,WAAW,CACxB,OAAuB,EACvB,GAAkB,EAClB,MAAc,EACd,KAA2C;IAE3C,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO;IAEzB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;IACtB,0DAA0D;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,UAAU,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACtF,IAAI,UAAU;YAAE,OAAO;QACvB,MAAM,WAAW,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,MAAM,CAAC;QAC1D,IAAI,CAAC,WAAW;YAAE,MAAM,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACtF,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC;IACrF,CAAC;AACH,CAAC;AAED,2DAA2D;AAC3D,KAAK,UAAU,WAAW,CACxB,OAAuB,EACvB,GAAkB,EAClB,MAAmB,IAAI,GAAG,EAAE;IAE5B,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IAC7C,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACb,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,MAAM,WAAW,CAAC,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,0EAA0E;AAE1E;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CAAC,OAAuB,EAAE,OAAsB;IACxF,OAAO,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,OAAuB,EACvB,OAAsB,EACtB,GAAW,EACX,KAAa;IAEb,MAAM,SAAS,GAAG,MAAM,UAAU,CAAC,GAAG,CAAC,CAAC;IAExC,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IAElF,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAE9C,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,yEAAyE;QACzE,oDAAoD;QACpD,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QAChE,OAAO,QAAQ,CAAC,OAAO,EAAE;YACvB,MAAM,EAAE,SAAS;YACjB,IAAI,EAAE,CAAC,GAAG,CAAC;YACX,MAAM,EAAE,CAAC,KAAK,CAAC;YACf,QAAQ,EAAE;gBACR,MAAM,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC;gBACrD,MAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC;aACvD;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;AAC1E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,OAAuB,EACvB,OAAsB,EACtB,GAAW;IAEX,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,MAAM,SAAS,GAAG,MAAM,UAAU,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,IAAI,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;IAE9D,6EAA6E;IAC7E,6DAA6D;IAC7D,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM;QAChC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IAClC,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,OAAuB,EACvB,OAAsB,EACtB,GAAW;IAEX,IAAI,GAAG,GAAG,OAAO,CAAC;IAClB,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAE,CAAC;QACrD,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;IACnC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAAuB,EACvB,OAAsB,EACtB,MAAM,GAAG,EAAE;IAEX,MAAM,OAAO,GAA0C,EAAE,CAAC;IAC1D,MAAM,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/storage/storage-provider.d.ts

@@ -0,0 +1,85 @@
+/**
+ * @module storage-provider
+ * A space's store: record versions, and the Merkle Search Tree that indexes them.
+ *
+ * The tree maps **record keys to version ids**:
+ *
+ * ```
+ * r/<key>              → the current version          (every record)
+ * g/<key>              → the record's first version   (once it has been edited)
+ * h/<key>/<seq>/<id>   → a superseded version         (only if marked `retain`)
+ * ```
+ *
+ * A version that arrives is compared with the one at `r/<key>` by the ordering
+ * rule (`records/version.ts`). The winner takes `r/<key>`; the loser's body is
+ * dropped — unless it is the record's first version, kept as proof of who
+ * created it, or its writer marked it `retain`. The same set of versions gives
+ * the same tree whatever order they arrive in, which is what lets two peers
+ * converge.
+ */
+import type { StorageAdapter, Expression } from '../types.js';
+export interface StorageProvider {
+    /**
+     * Takes in a version of a record: it becomes current if it supersedes the
+     * current one, and is kept or dropped otherwise. Idempotent.
+     * @returns The new tree root
+     */
+    addExpression(expression: Expression): Promise<string | null>;
+    /** Drops a version from the tree and the store, wherever it is indexed. */
+    removeExpression(id: string): Promise<string | null>;
+    /** A version by its id, current or not, if this store holds it. */
+    getExpression(id: string): Promise<Expression | null>;
+    /** The current version of a record — possibly a delete. */
+    getCurrent(key: string): Promise<Expression | null>;
+    /** The record's first version, when it has been edited and so is stored apart. */
+    getGenesis(key: string): Promise<Expression | null>;
+    /** Every version of a record this store keeps: current, first, and retained. Newest first. */
+    history(key: string): Promise<Expression[]>;
+    /** {@link history} for every record whose key starts with `prefix`, reading only that part of the tree. */
+    histories(prefix: string): Promise<Map<string, Expression[]>>;
+    /** Current versions of every record, deletes included. */
+    listCurrent(): Promise<Expression[]>;
+    /** Current versions in one collection, deletes included — found through the store's collection index. */
+    queryExpressions(collection: string): Promise<Expression[]>;
+    /** Every tree entry, for sync and copying: `r/…`, `g/…`, `h/…` keys and the version ids under them. */
+    entries(): Promise<Array<{
+        key: string;
+        value: string;
+    }>>;
+    /** Get the current MST root CID. */
+    getRootCid(): Promise<string | null>;
+    /**
+     * Deletes the tree nodes the root no longer reaches. Every change rewrites
+     * the path to one entry and leaves the old path behind, so without this a
+     * store grows with every edit ever made rather than with its records.
+     *
+     * Tabs share a browser's store, and a change another tab has in flight may
+     * build on nodes this one's root has left. So a node is deleted only once it
+     * was already unreachable at a compaction at least `graceMs` earlier —
+     * remembered in the store, so it holds across sessions. A store whose other
+     * writers can lag by more than that — a folder behind a sync service — must
+     * not be compacted at all.
+     * @returns How many nodes were deleted
+     */
+    compact(): Promise<number>;
+    /** Get the underlying storage adapter. */
+    getAdapter(): StorageAdapter;
+    /** Close the storage adapter. */
+    close(): Promise<void>;
+}
+export interface StorageProviderOptions {
+    /** Compact on its own after this many changes (see `compact`). Off by default. */
+    readonly compactEvery?: number;
+    /** How long a node stays unreachable before `compact` deletes it. Default a minute. */
+    readonly graceMs?: number;
+}
+export declare const CURRENT_PREFIX = "r/";
+export declare const GENESIS_PREFIX = "g/";
+export declare const HISTORY_PREFIX = "h/";
+/**
+ * Creates a StorageProvider wrapping an adapter.
+ * @param adapter The initialized storage adapter.
+ * @returns The StorageProvider orchestrator.
+ */
+export declare function createStorageProvider(adapter: StorageAdapter, options?: StorageProviderOptions): StorageProvider;
+//# sourceMappingURL=storage-provider.d.ts.map

package/dist/storage/storage-provider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage-provider.d.ts","sourceRoot":"","sources":["../../src/storage/storage-provider.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,UAAU,EAAW,MAAM,aAAa,CAAC;AAKvE,MAAM,WAAW,eAAe;IAC9B;;;;OAIG;IACH,aAAa,CAAC,UAAU,EAAE,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IAC9D,2EAA2E;IAC3E,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IACrD,mEAAmE;IACnE,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACtD,2DAA2D;IAC3D,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACpD,kFAAkF;IAClF,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACpD,8FAA8F;IAC9F,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IAC5C,2GAA2G;IAC3G,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAC9D,0DAA0D;IAC1D,WAAW,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IACrC,yGAAyG;IACzG,gBAAgB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IAC5D,uGAAuG;IACvG,OAAO,IAAI,OAAO,CAAC,KAAK,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;IAC1D,oCAAoC;IACpC,UAAU,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IACrC;;;;;;;;;;;;OAYG;IACH,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3B,0CAA0C;IAC1C,UAAU,IAAI,cAAc,CAAC;IAC7B,iCAAiC;IACjC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CACxB;AAQD,MAAM,WAAW,sBAAsB;IACrC,kFAAkF;IAClF,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,uFAAuF;IACvF,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,eAAO,MAAM,cAAc,OAAO,CAAC;AACnC,eAAO,MAAM,cAAc,OAAO,CAAC;AACnC,eAAO,MAAM,cAAc,OAAO,CAAC;AAOnC;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,cAAc,EAAE,OAAO,GAAE,sBAA2B,GAAG,eAAe,CAsMpH"}