@enbox/dwn-sdk-js 0.0.1 → 0.0.3

package/dist/esm/src/smt/sparse-merkle-tree.js

@@ -0,0 +1,622 @@
+/**
+ * Sparse Merkle Tree (SMT) implementation.
+ *
+ * A 256-level binary trie where:
+ * - Keys are SHA-256 hashes of messageCids (uniformly distributed across 2^256 key space)
+ * - Leaves store the messageCid value
+ * - Internal nodes store H(leftChild || rightChild)
+ * - Empty subtrees are represented implicitly via precomputed default hashes
+ *
+ * Key properties:
+ * - Deterministic: the same set of key-value pairs always produces the same root hash
+ * - O(log n) insert, delete, and proof operations (practically O(256) worst case)
+ * - Supports inclusion and non-inclusion proofs
+ * - Root hash provides a fingerprint of the entire set for O(1) comparison
+ */
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+import { getBit, hashChildren, hashEquals, hashKey, hashLeaf, initDefaultHashes, SMT_DEPTH } from './smt-utils.js';
+export class SparseMerkleTree {
+    constructor(store) {
+        this.store = store;
+    }
+    /**
+     * Initialize the SMT. Must be called before any operations.
+     * Opens the store and precomputes default hashes.
+     */
+    initialize() {
+        return __awaiter(this, void 0, void 0, function* () {
+            yield this.store.open();
+            this.defaultHashes = yield initDefaultHashes();
+        });
+    }
+    /**
+     * Close the underlying store.
+     */
+    close() {
+        return __awaiter(this, void 0, void 0, function* () {
+            yield this.store.close();
+        });
+    }
+    /**
+     * Clear all data from the tree.
+     */
+    clear() {
+        return __awaiter(this, void 0, void 0, function* () {
+            yield this.store.clear();
+        });
+    }
+    /**
+     * Get the current root hash. Returns the default empty root if no root is set.
+     */
+    getRoot() {
+        return __awaiter(this, void 0, void 0, function* () {
+            const root = yield this.store.getRoot();
+            if (root === undefined) {
+                return this.defaultHashes[0];
+            }
+            return root;
+        });
+    }
+    /**
+     * Insert a messageCid into the tree.
+     * The key is SHA-256(messageCid), the value is the messageCid string.
+     *
+     * @returns the new root hash after insertion
+     */
+    insert(messageCid) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const keyHash = yield hashKey(messageCid);
+            const leafHash = yield hashLeaf(keyHash, messageCid);
+            const leafNode = {
+                type: 'leaf',
+                keyHash: keyHash,
+                valueCid: messageCid,
+            };
+            // Store the leaf node
+            yield this.store.putNode(leafHash, leafNode);
+            // Walk down the tree from root to leaf position, collecting the path
+            const currentRoot = yield this.getRoot();
+            const newRoot = yield this.insertAtNode(currentRoot, keyHash, leafHash, leafNode, 0);
+            yield this.store.setRoot(newRoot);
+            return newRoot;
+        });
+    }
+    /**
+     * Delete a messageCid from the tree.
+     *
+     * @returns the new root hash after deletion
+     */
+    delete(messageCid) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const keyHash = yield hashKey(messageCid);
+            const currentRoot = yield this.getRoot();
+            const newRoot = yield this.deleteAtNode(currentRoot, keyHash, 0);
+            yield this.store.setRoot(newRoot);
+            return newRoot;
+        });
+    }
+    /**
+     * Check if a messageCid exists in the tree.
+     */
+    has(messageCid) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const keyHash = yield hashKey(messageCid);
+            const currentRoot = yield this.getRoot();
+            return this.existsAtNode(currentRoot, keyHash, 0);
+        });
+    }
+    /**
+     * Generate a membership proof (inclusion or non-inclusion) for a messageCid.
+     */
+    getProof(messageCid) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const keyHash = yield hashKey(messageCid);
+            const currentRoot = yield this.getRoot();
+            return this.generateProof(currentRoot, keyHash, 0);
+        });
+    }
+    /**
+     * Get the hash of a subtree at a given bit prefix.
+     * Used by the sync protocol for tree walking.
+     *
+     * @param prefix - array of booleans representing the path (false=left, true=right)
+     * @returns the hash of the subtree at that prefix
+     */
+    getSubtreeHash(prefix) {
+        return __awaiter(this, void 0, void 0, function* () {
+            let currentHash = yield this.getRoot();
+            for (let i = 0; i < prefix.length; i++) {
+                if (hashEquals(currentHash, this.defaultHashes[i])) {
+                    // Empty subtree — return the default hash at the target depth
+                    return this.defaultHashes[prefix.length];
+                }
+                const node = yield this.store.getNode(currentHash);
+                if (node === undefined || node.type === 'leaf') {
+                    // Leaf reached before prefix exhausted — need to compute what the
+                    // subtree hash would be if this leaf were pushed down to the prefix depth.
+                    // For simplicity, if we've hit a leaf, the subtree at this prefix
+                    // either contains this leaf or is empty.
+                    if (node !== undefined && node.type === 'leaf') {
+                        return this.computeSubtreeHashForLeaf(node, i, prefix);
+                    }
+                    return this.defaultHashes[prefix.length];
+                }
+                const internalNode = node;
+                if (prefix[i]) {
+                    currentHash = internalNode.rightHash;
+                }
+                else {
+                    currentHash = internalNode.leftHash;
+                }
+            }
+            return currentHash;
+        });
+    }
+    /**
+     * Get all leaf messageCids under a given prefix.
+     * Used by the sync protocol for tree walking.
+     */
+    getLeaves(prefix) {
+        return __awaiter(this, void 0, void 0, function* () {
+            let currentHash = yield this.getRoot();
+            // Navigate to the subtree at the prefix
+            for (let i = 0; i < prefix.length; i++) {
+                if (hashEquals(currentHash, this.defaultHashes[i])) {
+                    return [];
+                }
+                const node = yield this.store.getNode(currentHash);
+                if (node === undefined) {
+                    return [];
+                }
+                if (node.type === 'leaf') {
+                    // Check if this leaf's key hash matches the prefix
+                    const leafMatchesPrefix = this.leafMatchesPrefix(node.keyHash, prefix);
+                    if (leafMatchesPrefix) {
+                        return [node.valueCid];
+                    }
+                    return [];
+                }
+                const internalNode = node;
+                if (prefix[i]) {
+                    currentHash = internalNode.rightHash;
+                }
+                else {
+                    currentHash = internalNode.leftHash;
+                }
+            }
+            // Collect all leaves in this subtree
+            return this.collectLeaves(currentHash, prefix.length);
+        });
+    }
+    /**
+     * Compute a local diff between this tree and another tree's state,
+     * given access to the other tree instance.
+     *
+     * This is used for same-process diffing (e.g., in tests or local operations).
+     * For remote diffing, the sync protocol exchanges subtree hashes via messages.
+     */
+    diff(other) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const localRoot = yield this.getRoot();
+            const remoteRoot = yield other.getRoot();
+            if (hashEquals(localRoot, remoteRoot)) {
+                return { onlyLocal: [], onlyRemote: [] };
+            }
+            const onlyLocal = [];
+            const onlyRemote = [];
+            yield this.diffAtNode(localRoot, remoteRoot, 0, this, other, onlyLocal, onlyRemote);
+            return { onlyLocal, onlyRemote };
+        });
+    }
+    // ─── Private methods ──────────────────────────────────────────────────────
+    /**
+     * Recursively insert a leaf into the tree, returning the new hash for the subtree at `depth`.
+     */
+    insertAtNode(currentHash, keyHash, leafHash, leafNode, depth) {
+        return __awaiter(this, void 0, void 0, function* () {
+            // Base case: reached the maximum depth
+            if (depth >= SMT_DEPTH) {
+                return leafHash;
+            }
+            // If the current subtree is empty (default hash at this depth), just return the leaf hash.
+            // But we need to handle the case where the leaf might need to be pushed down further
+            // because we're at an intermediate depth.
+            if (hashEquals(currentHash, this.defaultHashes[depth])) {
+                // Place the leaf here — the leaf implicitly represents its position via keyHash
+                return leafHash;
+            }
+            // Load the node at currentHash
+            const node = yield this.store.getNode(currentHash);
+            if (node === undefined) {
+                // Shouldn't happen for a well-formed tree, but handle gracefully
+                return leafHash;
+            }
+            if (node.type === 'leaf') {
+                // There's an existing leaf at this position
+                if (hashEquals(node.keyHash, keyHash)) {
+                    // Same key — replace the value. Delete old leaf node.
+                    yield this.store.deleteNode(currentHash);
+                    return leafHash;
+                }
+                // Different key — need to push both leaves down until their paths diverge
+                return this.splitLeaves(node, currentHash, leafNode, leafHash, depth);
+            }
+            // Internal node — recurse into the appropriate child
+            const internalNode = node;
+            const goRight = getBit(keyHash, depth);
+            let newLeftHash;
+            let newRightHash;
+            if (goRight) {
+                newLeftHash = internalNode.leftHash;
+                newRightHash = yield this.insertAtNode(internalNode.rightHash, keyHash, leafHash, leafNode, depth + 1);
+            }
+            else {
+                newLeftHash = yield this.insertAtNode(internalNode.leftHash, keyHash, leafHash, leafNode, depth + 1);
+                newRightHash = internalNode.rightHash;
+            }
+            // Compute the new internal node hash
+            const newHash = yield hashChildren(newLeftHash, newRightHash);
+            // Store the new internal node (if it differs from the old one)
+            if (!hashEquals(newHash, currentHash)) {
+                const newNode = {
+                    type: 'internal',
+                    leftHash: newLeftHash,
+                    rightHash: newRightHash,
+                };
+                yield this.store.putNode(newHash, newNode);
+                // Clean up old internal node
+                yield this.store.deleteNode(currentHash);
+            }
+            return newHash;
+        });
+    }
+    /**
+     * When two leaves collide at the same position in the tree, push them down
+     * until their key paths diverge, creating internal nodes along the way.
+     *
+     * For example, if two leaves share the first 3 bits but diverge at bit 3,
+     * and we're currently at depth 0, we need to create internal nodes at depths
+     * 0, 1, and 2 (where one child is the chain and the other is a default hash),
+     * plus the divergence node at depth 3 where the two leaves split.
+     */
+    splitLeaves(existingLeaf, existingLeafHash, newLeaf, newLeafHash, startDepth) {
+        return __awaiter(this, void 0, void 0, function* () {
+            // Find the depth where the two keys diverge
+            let divergeDepth = startDepth;
+            while (divergeDepth < SMT_DEPTH && getBit(existingLeaf.keyHash, divergeDepth) === getBit(newLeaf.keyHash, divergeDepth)) {
+                divergeDepth++;
+            }
+            if (divergeDepth >= SMT_DEPTH) {
+                // Keys are identical (shouldn't happen with SHA-256 on different inputs)
+                return newLeafHash;
+            }
+            // At the divergence depth, the bits differ — one goes left, the other goes right
+            const existingGoesRight = getBit(existingLeaf.keyHash, divergeDepth);
+            let leftHash;
+            let rightHash;
+            if (existingGoesRight) {
+                leftHash = newLeafHash;
+                rightHash = existingLeafHash;
+            }
+            else {
+                leftHash = existingLeafHash;
+                rightHash = newLeafHash;
+            }
+            // Create the divergence node
+            let currentHash = yield hashChildren(leftHash, rightHash);
+            yield this.store.putNode(currentHash, {
+                type: 'internal',
+                leftHash: leftHash,
+                rightHash: rightHash,
+            });
+            // Build internal nodes back up from (divergeDepth - 1) to startDepth.
+            // At each intermediate depth, one child is the chain (currentHash) and
+            // the other is the default empty hash for that depth + 1.
+            for (let d = divergeDepth - 1; d >= startDepth; d--) {
+                const bit = getBit(existingLeaf.keyHash, d); // both keys share this bit
+                const defaultChild = this.defaultHashes[d + 1];
+                let newLeft;
+                let newRight;
+                if (bit) {
+                    newLeft = defaultChild;
+                    newRight = currentHash;
+                }
+                else {
+                    newLeft = currentHash;
+                    newRight = defaultChild;
+                }
+                currentHash = yield hashChildren(newLeft, newRight);
+                yield this.store.putNode(currentHash, {
+                    type: 'internal',
+                    leftHash: newLeft,
+                    rightHash: newRight,
+                });
+            }
+            return currentHash;
+        });
+    }
+    /**
+     * Recursively delete a key from the tree, returning the new hash for the subtree at `depth`.
+     */
+    deleteAtNode(currentHash, keyHash, depth) {
+        return __awaiter(this, void 0, void 0, function* () {
+            if (depth >= SMT_DEPTH) {
+                return this.defaultHashes[SMT_DEPTH];
+            }
+            // Empty subtree — nothing to delete
+            if (hashEquals(currentHash, this.defaultHashes[depth])) {
+                return currentHash;
+            }
+            const node = yield this.store.getNode(currentHash);
+            if (node === undefined) {
+                return this.defaultHashes[depth];
+            }
+            if (node.type === 'leaf') {
+                if (hashEquals(node.keyHash, keyHash)) {
+                    // Found the leaf to delete
+                    yield this.store.deleteNode(currentHash);
+                    return this.defaultHashes[depth];
+                }
+                // Wrong leaf — key not in tree
+                return currentHash;
+            }
+            // Internal node — recurse into the appropriate child
+            const internalNode = node;
+            const goRight = getBit(keyHash, depth);
+            let newLeftHash;
+            let newRightHash;
+            if (goRight) {
+                newLeftHash = internalNode.leftHash;
+                newRightHash = yield this.deleteAtNode(internalNode.rightHash, keyHash, depth + 1);
+            }
+            else {
+                newLeftHash = yield this.deleteAtNode(internalNode.leftHash, keyHash, depth + 1);
+                newRightHash = internalNode.rightHash;
+            }
+            // If both children are now default (empty), this node becomes empty too
+            if (hashEquals(newLeftHash, this.defaultHashes[depth + 1]) && hashEquals(newRightHash, this.defaultHashes[depth + 1])) {
+                yield this.store.deleteNode(currentHash);
+                return this.defaultHashes[depth];
+            }
+            // If one child is default and the other is a leaf, collapse upward
+            // (the internal node is unnecessary — just return the leaf hash directly)
+            const leftIsDefault = hashEquals(newLeftHash, this.defaultHashes[depth + 1]);
+            const rightIsDefault = hashEquals(newRightHash, this.defaultHashes[depth + 1]);
+            if (leftIsDefault || rightIsDefault) {
+                const survivingHash = leftIsDefault ? newRightHash : newLeftHash;
+                const survivingNode = yield this.store.getNode(survivingHash);
+                if (survivingNode !== undefined && survivingNode.type === 'leaf') {
+                    // Collapse: remove the internal node, return the leaf hash directly
+                    yield this.store.deleteNode(currentHash);
+                    return survivingHash;
+                }
+            }
+            // Recompute internal node hash
+            const newHash = yield hashChildren(newLeftHash, newRightHash);
+            if (!hashEquals(newHash, currentHash)) {
+                const newNode = {
+                    type: 'internal',
+                    leftHash: newLeftHash,
+                    rightHash: newRightHash,
+                };
+                yield this.store.putNode(newHash, newNode);
+                yield this.store.deleteNode(currentHash);
+            }
+            return newHash;
+        });
+    }
+    /**
+     * Check if a key exists at the given node.
+     */
+    existsAtNode(currentHash, keyHash, depth) {
+        return __awaiter(this, void 0, void 0, function* () {
+            if (depth >= SMT_DEPTH) {
+                return false;
+            }
+            if (hashEquals(currentHash, this.defaultHashes[depth])) {
+                return false;
+            }
+            const node = yield this.store.getNode(currentHash);
+            if (node === undefined) {
+                return false;
+            }
+            if (node.type === 'leaf') {
+                return hashEquals(node.keyHash, keyHash);
+            }
+            const internalNode = node;
+            const goRight = getBit(keyHash, depth);
+            if (goRight) {
+                return this.existsAtNode(internalNode.rightHash, keyHash, depth + 1);
+            }
+            else {
+                return this.existsAtNode(internalNode.leftHash, keyHash, depth + 1);
+            }
+        });
+    }
+    /**
+     * Generate a proof for the given key at the given node.
+     */
+    generateProof(currentHash, keyHash, depth) {
+        return __awaiter(this, void 0, void 0, function* () {
+            if (depth >= SMT_DEPTH) {
+                return { siblings: [], leafNode: undefined, depth };
+            }
+            if (hashEquals(currentHash, this.defaultHashes[depth])) {
+                return { siblings: [], leafNode: undefined, depth };
+            }
+            const node = yield this.store.getNode(currentHash);
+            if (node === undefined) {
+                return { siblings: [], leafNode: undefined, depth };
+            }
+            if (node.type === 'leaf') {
+                return { siblings: [], leafNode: node, depth };
+            }
+            const internalNode = node;
+            const goRight = getBit(keyHash, depth);
+            let childHash;
+            let siblingHash;
+            if (goRight) {
+                childHash = internalNode.rightHash;
+                siblingHash = internalNode.leftHash;
+            }
+            else {
+                childHash = internalNode.leftHash;
+                siblingHash = internalNode.rightHash;
+            }
+            const childProof = yield this.generateProof(childHash, keyHash, depth + 1);
+            childProof.siblings.unshift(siblingHash);
+            return childProof;
+        });
+    }
+    /**
+     * Compute the subtree hash for a leaf that exists above the target prefix depth.
+     * The leaf's effective position is determined by its keyHash bits.
+     */
+    computeSubtreeHashForLeaf(leaf, currentDepth, prefix) {
+        return __awaiter(this, void 0, void 0, function* () {
+            // Check if the leaf's key matches the remaining prefix bits
+            for (let i = currentDepth; i < prefix.length; i++) {
+                if (getBit(leaf.keyHash, i) !== prefix[i]) {
+                    // Leaf is not under this prefix
+                    return this.defaultHashes[prefix.length];
+                }
+            }
+            // Leaf is under this prefix — recompute its hash
+            return yield hashLeaf(leaf.keyHash, leaf.valueCid);
+        });
+    }
+    /**
+     * Check if a leaf's keyHash matches a given prefix.
+     */
+    leafMatchesPrefix(keyHash, prefix) {
+        for (let i = 0; i < prefix.length; i++) {
+            if (getBit(keyHash, i) !== prefix[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Collect all leaf messageCids in the subtree rooted at the given hash.
+     */
+    collectLeaves(nodeHash, depth) {
+        return __awaiter(this, void 0, void 0, function* () {
+            if (depth >= SMT_DEPTH || hashEquals(nodeHash, this.defaultHashes[depth])) {
+                return [];
+            }
+            const node = yield this.store.getNode(nodeHash);
+            if (node === undefined) {
+                return [];
+            }
+            if (node.type === 'leaf') {
+                return [node.valueCid];
+            }
+            const internalNode = node;
+            const leftLeaves = yield this.collectLeaves(internalNode.leftHash, depth + 1);
+            const rightLeaves = yield this.collectLeaves(internalNode.rightHash, depth + 1);
+            return [...leftLeaves, ...rightLeaves];
+        });
+    }
+    /**
+     * Recursively diff two subtrees, collecting leaves that exist only in one or the other.
+     */
+    diffAtNode(localHash, remoteHash, depth, localTree, remoteTree, onlyLocal, onlyRemote) {
+        return __awaiter(this, void 0, void 0, function* () {
+            // If hashes match, subtrees are identical — skip
+            if (hashEquals(localHash, remoteHash)) {
+                return;
+            }
+            // If we've reached max depth, something is wrong — bail out
+            if (depth >= SMT_DEPTH) {
+                return;
+            }
+            const localIsDefault = hashEquals(localHash, this.defaultHashes[depth]);
+            const remoteIsDefault = hashEquals(remoteHash, this.defaultHashes[depth]);
+            // If local is empty but remote is not, all remote leaves are "onlyRemote"
+            if (localIsDefault && !remoteIsDefault) {
+                const remoteLeaves = yield remoteTree.collectLeaves(remoteHash, depth);
+                onlyRemote.push(...remoteLeaves);
+                return;
+            }
+            // If remote is empty but local is not, all local leaves are "onlyLocal"
+            if (!localIsDefault && remoteIsDefault) {
+                const localLeaves = yield localTree.collectLeaves(localHash, depth);
+                onlyLocal.push(...localLeaves);
+                return;
+            }
+            // Both are non-default and non-equal — load nodes and recurse
+            const localNode = yield localTree.store.getNode(localHash);
+            const remoteNode = yield remoteTree.store.getNode(remoteHash);
+            // Handle cases where one or both are leaves
+            if ((localNode === null || localNode === void 0 ? void 0 : localNode.type) === 'leaf' && (remoteNode === null || remoteNode === void 0 ? void 0 : remoteNode.type) === 'leaf') {
+                if (!hashEquals(localNode.keyHash, remoteNode.keyHash)) {
+                    // Different keys — both are unique to their respective trees
+                    onlyLocal.push(localNode.valueCid);
+                    onlyRemote.push(remoteNode.valueCid);
+                }
+                else if (localNode.valueCid !== remoteNode.valueCid) {
+                    // Same key, different value — treat as update
+                    onlyLocal.push(localNode.valueCid);
+                    onlyRemote.push(remoteNode.valueCid);
+                }
+                return;
+            }
+            // One is a leaf and the other is internal — expand the leaf side
+            if ((localNode === null || localNode === void 0 ? void 0 : localNode.type) === 'leaf') {
+                // Local is a single leaf; remote is a subtree
+                // All remote leaves are potentially onlyRemote; check if the local leaf exists in remote
+                const remoteLeaves = yield remoteTree.collectLeaves(remoteHash, depth);
+                const localCid = localNode.valueCid;
+                const remoteSet = new Set(remoteLeaves);
+                if (!remoteSet.has(localCid)) {
+                    onlyLocal.push(localCid);
+                }
+                for (const cid of remoteLeaves) {
+                    if (cid !== localCid) {
+                        onlyRemote.push(cid);
+                    }
+                }
+                return;
+            }
+            if ((remoteNode === null || remoteNode === void 0 ? void 0 : remoteNode.type) === 'leaf') {
+                // Remote is a single leaf; local is a subtree
+                const localLeaves = yield localTree.collectLeaves(localHash, depth);
+                const remoteCid = remoteNode.valueCid;
+                const localSet = new Set(localLeaves);
+                if (!localSet.has(remoteCid)) {
+                    onlyRemote.push(remoteCid);
+                }
+                for (const cid of localLeaves) {
+                    if (cid !== remoteCid) {
+                        onlyLocal.push(cid);
+                    }
+                }
+                return;
+            }
+            // Both are internal nodes — recurse into children
+            if ((localNode === null || localNode === void 0 ? void 0 : localNode.type) === 'internal' && (remoteNode === null || remoteNode === void 0 ? void 0 : remoteNode.type) === 'internal') {
+                yield this.diffAtNode(localNode.leftHash, remoteNode.leftHash, depth + 1, localTree, remoteTree, onlyLocal, onlyRemote);
+                yield this.diffAtNode(localNode.rightHash, remoteNode.rightHash, depth + 1, localTree, remoteTree, onlyLocal, onlyRemote);
+                return;
+            }
+            // Fallback: if a node is missing, collect all from the other side
+            if (localNode === undefined) {
+                const remoteLeaves = yield remoteTree.collectLeaves(remoteHash, depth);
+                onlyRemote.push(...remoteLeaves);
+            }
+            if (remoteNode === undefined) {
+                const localLeaves = yield localTree.collectLeaves(localHash, depth);
+                onlyLocal.push(...localLeaves);
+            }
+        });
+    }
+}
+//# sourceMappingURL=sparse-merkle-tree.js.map

package/dist/esm/src/smt/sparse-merkle-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse-merkle-tree.js","sourceRoot":"","sources":["../../../../src/smt/sparse-merkle-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;;;;;;;;;;AAIH,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEnH,MAAM,OAAO,gBAAgB;IAI3B,YAAY,KAAmB;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACG,UAAU;;YACd,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,aAAa,GAAG,MAAM,iBAAiB,EAAE,CAAC;QACjD,CAAC;KAAA;IAED;;OAEG;IACG,KAAK;;YACT,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC3B,CAAC;KAAA;IAED;;OAEG;IACG,KAAK;;YACT,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC3B,CAAC;KAAA;IAED;;OAEG;IACG,OAAO;;YACX,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;KAAA;IAED;;;;;OAKG;IACG,MAAM,CAAC,UAAkB;;YAC7B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC;YAC1C,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;YAErD,MAAM,QAAQ,GAAgB;gBAC5B,IAAI,EAAO,MAAM;gBACjB,OAAO,EAAI,OAAO;gBAClB,QAAQ,EAAG,UAAU;aACtB,CAAC;YAEF,sBAAsB;YACtB,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAE7C,qEAAqE;YACrE,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;YAErF,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAClC,OAAO,OAAO,CAAC;QACjB,CAAC;KAAA;IAED;;;;OAIG;IACG,MAAM,CAAC,UAAkB;;YAC7B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC;YAE1C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YAEjE,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAClC,OAAO,OAAO,CAAC;QACjB,CAAC;KAAA;IAED;;OAEG;IACG,GAAG,CAAC,UAAkB;;YAC1B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC;YAC1C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YACzC,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QACpD,CAAC;KAAA;IAED;;OAEG;IACG,QAAQ,CAAC,UAAkB;;YAC/B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC;YAC1C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YACzC,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QACrD,CAAC;KAAA;IAED;;;;;;OAMG;IACG,cAAc,CAAC,MAAiB;;YACpC,IAAI,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnD,8DAA8D;oBAC9D,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC3C,CAAC;gBAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;gBACnD,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBAC/C,kEAAkE;oBAClE,2EAA2E;oBAC3E,kEAAkE;oBAClE,yCAAyC;oBACzC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;wBAC/C,OAAO,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;oBACzD,CAAC;oBACD,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC3C,CAAC;gBAED,MAAM,YAAY,GAAG,IAAuB,CAAC;gBAC7C,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;oBACd,WAAW,GAAG,YAAY,CAAC,SAAS,CAAC;gBACvC,CAAC;qBAAM,CAAC;oBACN,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;gBACtC,CAAC;YACH,CAAC;YAED,OAAO,WAAW,CAAC;QACrB,CAAC;KAAA;IAED;;;OAGG;IACG,SAAS,CAAC,MAAiB;;YAC/B,IAAI,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YAEvC,wCAAwC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnD,OAAO,EAAE,CAAC;gBACZ,CAAC;gBAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;gBACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,OAAO,EAAE,CAAC;gBACZ,CAAC;gBAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACzB,mDAAmD;oBACnD,MAAM,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;oBACvE,IAAI,iBAAiB,EAAE,CAAC;wBACtB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACzB,CAAC;oBACD,OAAO,EAAE,CAAC;gBACZ,CAAC;gBAED,MAAM,YAAY,GAAG,IAAuB,CAAC;gBAC7C,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;oBACd,WAAW,GAAG,YAAY,CAAC,SAAS,CAAC;gBACvC,CAAC;qBAAM,CAAC;oBACN,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;gBACtC,CAAC;YACH,CAAC;YAED,qCAAqC;YACrC,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACxD,CAAC;KAAA;IAED;;;;;;OAMG;IACG,IAAI,CAAC,KAAuB;;YAChC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;YAEzC,IAAI,UAAU,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;gBACtC,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;YAC3C,CAAC;YAED,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAa,EAAE,CAAC;YAEhC,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;YAEpF,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;QACnC,CAAC;KAAA;IAED,6EAA6E;IAE7E;;OAEG;IACW,YAAY,CACxB,WAAiB,EACjB,OAAa,EACb,QAAc,EACd,QAAqB,EACrB,KAAa;;YAEb,uCAAuC;YACvC,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,QAAQ,CAAC;YAClB,CAAC;YAED,2FAA2F;YAC3F,qFAAqF;YACrF,0CAA0C;YAC1C,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACvD,gFAAgF;gBAChF,OAAO,QAAQ,CAAC;YAClB,CAAC;YAED,+BAA+B;YAC/B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,iEAAiE;gBACjE,OAAO,QAAQ,CAAC;YAClB,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,4CAA4C;gBAC5C,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;oBACtC,sDAAsD;oBACtD,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;oBACzC,OAAO,QAAQ,CAAC;gBAClB,CAAC;gBAED,0EAA0E;gBAC1E,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACxE,CAAC;YAED,qDAAqD;YACrD,MAAM,YAAY,GAAG,IAAuB,CAAC;YAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAEvC,IAAI,WAAiB,CAAC;YACtB,IAAI,YAAkB,CAAC;YAEvB,IAAI,OAAO,EAAE,CAAC;gBACZ,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;gBACpC,YAAY,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACzG,CAAC;iBAAM,CAAC;gBACN,WAAW,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACrG,YAAY,GAAG,YAAY,CAAC,SAAS,CAAC;YACxC,CAAC;YAED,qCAAqC;YACrC,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAE9D,+DAA+D;YAC/D,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;gBACtC,MAAM,OAAO,GAAoB;oBAC/B,IAAI,EAAQ,UAAU;oBACtB,QAAQ,EAAI,WAAW;oBACvB,SAAS,EAAG,YAAY;iBACzB,CAAC;gBACF,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBAE3C,6BAA6B;gBAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YAC3C,CAAC;YAED,OAAO,OAAO,CAAC;QACjB,CAAC;KAAA;IAED;;;;;;;;OAQG;IACW,WAAW,CACvB,YAAyB,EACzB,gBAAsB,EACtB,OAAoB,EACpB,WAAiB,EACjB,UAAkB;;YAElB,4CAA4C;YAC5C,IAAI,YAAY,GAAG,UAAU,CAAC;YAC9B,OAAO,YAAY,GAAG,SAAS,IAAI,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,KAAK,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,EAAE,CAAC;gBACxH,YAAY,EAAE,CAAC;YACjB,CAAC;YAED,IAAI,YAAY,IAAI,SAAS,EAAE,CAAC;gBAC9B,yEAAyE;gBACzE,OAAO,WAAW,CAAC;YACrB,CAAC;YAED,iFAAiF;YACjF,MAAM,iBAAiB,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAErE,IAAI,QAAc,CAAC;YACnB,IAAI,SAAe,CAAC;YAEpB,IAAI,iBAAiB,EAAE,CAAC;gBACtB,QAAQ,GAAG,WAAW,CAAC;gBACvB,SAAS,GAAG,gBAAgB,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,gBAAgB,CAAC;gBAC5B,SAAS,GAAG,WAAW,CAAC;YAC1B,CAAC;YAED,6BAA6B;YAC7B,IAAI,WAAW,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAC1D,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE;gBACpC,IAAI,EAAQ,UAAU;gBACtB,QAAQ,EAAI,QAAQ;gBACpB,SAAS,EAAG,SAAS;aACtB,CAAC,CAAC;YAEH,sEAAsE;YACtE,uEAAuE;YACvE,0DAA0D;YAC1D,KAAK,IAAI,CAAC,GAAG,YAAY,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpD,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,2BAA2B;gBACxE,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAE/C,IAAI,OAAa,CAAC;gBAClB,IAAI,QAAc,CAAC;gBACnB,IAAI,GAAG,EAAE,CAAC;oBACR,OAAO,GAAG,YAAY,CAAC;oBACvB,QAAQ,GAAG,WAAW,CAAC;gBACzB,CAAC;qBAAM,CAAC;oBACN,OAAO,GAAG,WAAW,CAAC;oBACtB,QAAQ,GAAG,YAAY,CAAC;gBAC1B,CAAC;gBAED,WAAW,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACpD,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE;oBACpC,IAAI,EAAQ,UAAU;oBACtB,QAAQ,EAAI,OAAO;oBACnB,SAAS,EAAG,QAAQ;iBACrB,CAAC,CAAC;YACL,CAAC;YAED,OAAO,WAAW,CAAC;QACrB,CAAC;KAAA;IAED;;OAEG;IACW,YAAY,CAAC,WAAiB,EAAE,OAAa,EAAE,KAAa;;YACxE,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACvC,CAAC;YAED,oCAAoC;YACpC,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACvD,OAAO,WAAW,CAAC;YACrB,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;oBACtC,2BAA2B;oBAC3B,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;oBACzC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBACnC,CAAC;gBACD,+BAA+B;gBAC/B,OAAO,WAAW,CAAC;YACrB,CAAC;YAED,qDAAqD;YACrD,MAAM,YAAY,GAAG,IAAuB,CAAC;YAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAEvC,IAAI,WAAiB,CAAC;YACtB,IAAI,YAAkB,CAAC;YAEvB,IAAI,OAAO,EAAE,CAAC;gBACZ,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;gBACpC,YAAY,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACrF,CAAC;iBAAM,CAAC;gBACN,WAAW,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACjF,YAAY,GAAG,YAAY,CAAC,SAAS,CAAC;YACxC,CAAC;YAED,wEAAwE;YACxE,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtH,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;gBACzC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;YAED,mEAAmE;YACnE,0EAA0E;YAC1E,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7E,MAAM,cAAc,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAE/E,IAAI,aAAa,IAAI,cAAc,EAAE,CAAC;gBACpC,MAAM,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC;gBACjE,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;gBAC9D,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACjE,oEAAoE;oBACpE,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;oBACzC,OAAO,aAAa,CAAC;gBACvB,CAAC;YACH,CAAC;YAED,+BAA+B;YAC/B,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;YAE9D,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;gBACtC,MAAM,OAAO,GAAoB;oBAC/B,IAAI,EAAQ,UAAU;oBACtB,QAAQ,EAAI,WAAW;oBACvB,SAAS,EAAG,YAAY;iBACzB,CAAC;gBACF,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC3C,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YAC3C,CAAC;YAED,OAAO,OAAO,CAAC;QACjB,CAAC;KAAA;IAED;;OAEG;IACW,YAAY,CAAC,WAAiB,EAAE,OAAa,EAAE,KAAa;;YACxE,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,KAAK,CAAC;YACf,CAAC;YAED,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACvD,OAAO,KAAK,CAAC;YACf,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,KAAK,CAAC;YACf,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,OAAO,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC3C,CAAC;YAED,MAAM,YAAY,GAAG,IAAuB,CAAC;YAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAEvC,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACvE,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;KAAA;IAED;;OAEG;IACW,aAAa,CAAC,WAAiB,EAAE,OAAa,EAAE,KAAa;;YACzE,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YACtD,CAAC;YAED,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACvD,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YACtD,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YACtD,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;YACjD,CAAC;YAED,MAAM,YAAY,GAAG,IAAuB,CAAC;YAC7C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAEvC,IAAI,SAAe,CAAC;YACpB,IAAI,WAAiB,CAAC;YAEtB,IAAI,OAAO,EAAE,CAAC;gBACZ,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC;gBACnC,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACN,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC;gBAClC,WAAW,GAAG,YAAY,CAAC,SAAS,CAAC;YACvC,CAAC;YAED,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC3E,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAEzC,OAAO,UAAU,CAAC;QACpB,CAAC;KAAA;IAED;;;OAGG;IACW,yBAAyB,CACrC,IAAiB,EACjB,YAAoB,EACpB,MAAiB;;YAEjB,4DAA4D;YAC5D,KAAK,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1C,gCAAgC;oBAChC,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YAED,iDAAiD;YACjD,OAAO,MAAM,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrD,CAAC;KAAA;IAED;;OAEG;IACK,iBAAiB,CAAC,OAAa,EAAE,MAAiB;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrC,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACW,aAAa,CAAC,QAAc,EAAE,KAAa;;YACvD,IAAI,KAAK,IAAI,SAAS,IAAI,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC1E,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzB,CAAC;YAED,MAAM,YAAY,GAAG,IAAuB,CAAC;YAC7C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC9E,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAEhF,OAAO,CAAC,GAAG,UAAU,EAAE,GAAG,WAAW,CAAC,CAAC;QACzC,CAAC;KAAA;IAED;;OAEG;IACW,UAAU,CACtB,SAAe,EACf,UAAgB,EAChB,KAAa,EACb,SAA2B,EAC3B,UAA4B,EAC5B,SAAmB,EACnB,UAAoB;;YAEpB,iDAAiD;YACjD,IAAI,UAAU,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;gBACtC,OAAO;YACT,CAAC;YAED,4DAA4D;YAC5D,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO;YACT,CAAC;YAED,MAAM,cAAc,GAAG,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;YACxE,MAAM,eAAe,GAAG,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;YAE1E,0EAA0E;YAC1E,IAAI,cAAc,IAAI,CAAC,eAAe,EAAE,CAAC;gBACvC,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBACvE,UAAU,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;gBACjC,OAAO;YACT,CAAC;YAED,wEAAwE;YACxE,IAAI,CAAC,cAAc,IAAI,eAAe,EAAE,CAAC;gBACvC,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBACpE,SAAS,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;gBAC/B,OAAO;YACT,CAAC;YAED,8DAA8D;YAC9D,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAE9D,4CAA4C;YAC5C,IAAI,CAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,IAAI,MAAK,MAAM,IAAI,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,IAAI,MAAK,MAAM,EAAE,CAAC;gBAC9D,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;oBACvD,6DAA6D;oBAC7D,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;oBACnC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACvC,CAAC;qBAAM,IAAI,SAAS,CAAC,QAAQ,KAAK,UAAU,CAAC,QAAQ,EAAE,CAAC;oBACtD,8CAA8C;oBAC9C,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;oBACnC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACvC,CAAC;gBACD,OAAO;YACT,CAAC;YAED,iEAAiE;YACjE,IAAI,CAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,IAAI,MAAK,MAAM,EAAE,CAAC;gBAC/B,8CAA8C;gBAC9C,yFAAyF;gBACzF,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBACvE,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;gBACpC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;gBAExC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC7B,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC3B,CAAC;gBACD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;oBAC/B,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;wBACrB,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;gBACD,OAAO;YACT,CAAC;YAED,IAAI,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,IAAI,MAAK,MAAM,EAAE,CAAC;gBAChC,8CAA8C;gBAC9C,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBACpE,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC;gBACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;gBAEtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC7B,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC7B,CAAC;gBACD,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;oBAC9B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;wBACtB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACtB,CAAC;gBACH,CAAC;gBACD,OAAO;YACT,CAAC;YAED,kDAAkD;YAClD,IAAI,CAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,IAAI,MAAK,UAAU,IAAI,CAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,IAAI,MAAK,UAAU,EAAE,CAAC;gBACtE,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;gBACxH,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,SAAS,EAAE,UAAU,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;gBAC1H,OAAO;YACT,CAAC;YAED,kEAAkE;YAClE,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBACvE,UAAU,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;YACnC,CAAC;YACD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC7B,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBACpE,SAAS,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;KAAA;CACF"}