@feelyourprotocol/mpt 8141.0.0

package/dist/cjs/proof/range.js

@@ -0,0 +1,456 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.verifyMerkleRangeProof = verifyMerkleRangeProof;
+const util_1 = require("@feelyourprotocol/util");
+const sha3_js_1 = require("@noble/hashes/sha3.js");
+const index_ts_1 = require("../index.js");
+const mpt_ts_1 = require("../mpt.js");
+const index_ts_2 = require("../node/index.js");
+const nibbles_ts_1 = require("../util/nibbles.js");
+// reference: https://github.com/ethereum/go-ethereum/blob/20356e57b119b4e70ce47665a71964434e15200d/trie/proof.go
+/**
+ * unset will remove all nodes to the left or right of the target key(decided by `removeLeft`).
+ * @param trie - trie object.
+ * @param parent - parent node, it can be `null`.
+ * @param child - child node.
+ * @param key - target nibbles.
+ * @param pos - key position.
+ * @param removeLeft - remove all nodes to the left or right of the target key.
+ * @param stack - a stack of modified nodes.
+ * @returns The end position of key.
+ */
+async function unset(trie, parent, child, key, pos, removeLeft, stack) {
+    if (child instanceof index_ts_2.BranchMPTNode) {
+        /**
+         * This node is a branch node,
+         * remove all branches on the left or right
+         */
+        if (removeLeft) {
+            for (let i = 0; i < key[pos]; i++) {
+                child.setBranch(i, null);
+            }
+        }
+        else {
+            for (let i = key[pos] + 1; i < 16; i++) {
+                child.setBranch(i, null);
+            }
+        }
+        // record this node on the stack
+        stack.push(child);
+        // continue to the next node
+        const next = child.getBranch(key[pos]);
+        const _child = next && (await trie.lookupNode(next));
+        return unset(trie, child, _child, key, pos + 1, removeLeft, stack);
+    }
+    else if (child instanceof index_ts_2.ExtensionMPTNode || child instanceof index_ts_2.LeafMPTNode) {
+        /**
+         * This node is an extension node or lead node,
+         * if node._nibbles is less or greater than the target key,
+         * remove self from parent
+         */
+        if (key.length - pos < child.keyLength() ||
+            (0, nibbles_ts_1.nibblesCompare)(child._nibbles, key.slice(pos, pos + child.keyLength())) !== 0) {
+            if (removeLeft) {
+                if ((0, nibbles_ts_1.nibblesCompare)(child._nibbles, key.slice(pos)) < 0) {
+                    ;
+                    parent.setBranch(key[pos - 1], null);
+                }
+            }
+            else {
+                if ((0, nibbles_ts_1.nibblesCompare)(child._nibbles, key.slice(pos)) > 0) {
+                    ;
+                    parent.setBranch(key[pos - 1], null);
+                }
+            }
+            return pos - 1;
+        }
+        if (child instanceof index_ts_2.LeafMPTNode) {
+            // This node is a leaf node, directly remove it from parent
+            ;
+            parent.setBranch(key[pos - 1], null);
+            return pos - 1;
+        }
+        else {
+            const _child = await trie.lookupNode(child.value());
+            if (_child instanceof index_ts_2.LeafMPTNode) {
+                // The child of this node is leaf node, remove it from parent too
+                ;
+                parent.setBranch(key[pos - 1], null);
+                return pos - 1;
+            }
+            // record this node on the stack
+            stack.push(child);
+            // continue to the next node
+            return unset(trie, child, _child, key, pos + child.keyLength(), removeLeft, stack);
+        }
+    }
+    else if (child === null) {
+        return pos - 1;
+    }
+    else {
+        throw (0, util_1.EthereumJSErrorWithoutCode)('invalid node');
+    }
+}
+/**
+ * unsetInternal will remove all nodes between `left` and `right` (including `left` and `right`)
+ * @param trie - trie object.
+ * @param left - left nibbles.
+ * @param right - right nibbles.
+ * @returns Is it an empty trie.
+ */
+async function unsetInternal(trie, left, right) {
+    // Key position
+    let pos = 0;
+    // Parent node
+    let parent = null;
+    // Current node
+    let node = await trie.lookupNode(trie.root());
+    let shortForkLeft;
+    let shortForkRight;
+    // A stack of modified nodes.
+    const stack = [];
+    // 1. Find the fork point of `left` and `right`
+    while (true) {
+        if (node instanceof index_ts_2.ExtensionMPTNode || node instanceof index_ts_2.LeafMPTNode) {
+            // record this node on the stack
+            stack.push(node);
+            if (left.length - pos < node.keyLength()) {
+                shortForkLeft = (0, nibbles_ts_1.nibblesCompare)(left.slice(pos), node._nibbles);
+            }
+            else {
+                shortForkLeft = (0, nibbles_ts_1.nibblesCompare)(left.slice(pos, pos + node.keyLength()), node._nibbles);
+            }
+            if (right.length - pos < node.keyLength()) {
+                shortForkRight = (0, nibbles_ts_1.nibblesCompare)(right.slice(pos), node._nibbles);
+            }
+            else {
+                shortForkRight = (0, nibbles_ts_1.nibblesCompare)(right.slice(pos, pos + node.keyLength()), node._nibbles);
+            }
+            // If one of `left` and `right` is not equal to node._nibbles, it means we found the fork point
+            if (shortForkLeft !== 0 || shortForkRight !== 0) {
+                break;
+            }
+            if (node instanceof index_ts_2.LeafMPTNode) {
+                // it shouldn't happen
+                throw (0, util_1.EthereumJSErrorWithoutCode)('invalid node');
+            }
+            // continue to the next node
+            parent = node;
+            pos += node.keyLength();
+            node = await trie.lookupNode(node.value());
+        }
+        else if (node instanceof index_ts_2.BranchMPTNode) {
+            // record this node on the stack
+            stack.push(node);
+            const leftNode = node.getBranch(left[pos]);
+            const rightNode = node.getBranch(right[pos]);
+            // One of `left` and `right` is `null`, stop searching
+            if (leftNode === null || rightNode === null) {
+                break;
+            }
+            // Stop searching if `left` and `right` are not equal
+            if (!(leftNode instanceof Uint8Array)) {
+                if (rightNode instanceof Uint8Array) {
+                    break;
+                }
+                if (leftNode.length !== rightNode.length) {
+                    break;
+                }
+                let abort = false;
+                for (let i = 0; i < leftNode.length; i++) {
+                    if (!(0, util_1.equalsBytes)(leftNode[i], rightNode[i])) {
+                        abort = true;
+                        break;
+                    }
+                }
+                if (abort) {
+                    break;
+                }
+            }
+            else {
+                if (!(rightNode instanceof Uint8Array)) {
+                    break;
+                }
+                if (!(0, util_1.equalsBytes)(leftNode, rightNode)) {
+                    break;
+                }
+            }
+            // continue to the next node
+            parent = node;
+            node = await trie.lookupNode(leftNode);
+            pos += 1;
+        }
+        else {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid node');
+        }
+    }
+    // 2. Starting from the fork point, delete all nodes between `left` and `right`
+    const saveStack = (key, stack) => {
+        return trie.saveStack(key, stack, []);
+    };
+    if (node instanceof index_ts_2.ExtensionMPTNode || node instanceof index_ts_2.LeafMPTNode) {
+        /**
+         * There can have these five scenarios:
+         * - both proofs are less than the trie path => no valid range
+         * - both proofs are greater than the trie path => no valid range
+         * - left proof is less and right proof is greater => valid range, unset the entire trie
+         * - left proof points to the trie node, but right proof is greater => valid range, unset left node
+         * - right proof points to the trie node, but left proof is less  => valid range, unset right node
+         */
+        const removeSelfFromParentAndSaveStack = async (key) => {
+            if (parent === null) {
+                return true;
+            }
+            stack.pop();
+            parent.setBranch(key[pos - 1], null);
+            await saveStack(key.slice(0, pos - 1), stack);
+            return false;
+        };
+        if (shortForkLeft === -1 && shortForkRight === -1) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid range');
+        }
+        if (shortForkLeft === 1 && shortForkRight === 1) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid range');
+        }
+        if (shortForkLeft !== 0 && shortForkRight !== 0) {
+            // Unset the entire trie
+            return removeSelfFromParentAndSaveStack(left);
+        }
+        // Unset left node
+        if (shortForkRight !== 0) {
+            if (node instanceof index_ts_2.LeafMPTNode) {
+                return removeSelfFromParentAndSaveStack(left);
+            }
+            const child = await trie.lookupNode(node._value);
+            if (child instanceof index_ts_2.LeafMPTNode) {
+                return removeSelfFromParentAndSaveStack(left);
+            }
+            const endPos = await unset(trie, node, child, left.slice(pos), node.keyLength(), false, stack);
+            await saveStack(left.slice(0, pos + endPos), stack);
+            return false;
+        }
+        // Unset right node
+        if (shortForkLeft !== 0) {
+            if (node instanceof index_ts_2.LeafMPTNode) {
+                return removeSelfFromParentAndSaveStack(right);
+            }
+            const child = await trie.lookupNode(node._value);
+            if (child instanceof index_ts_2.LeafMPTNode) {
+                return removeSelfFromParentAndSaveStack(right);
+            }
+            const endPos = await unset(trie, node, child, right.slice(pos), node.keyLength(), true, stack);
+            await saveStack(right.slice(0, pos + endPos), stack);
+            return false;
+        }
+        return false;
+    }
+    else if (node instanceof index_ts_2.BranchMPTNode) {
+        // Unset all internal nodes in the forkPoint
+        for (let i = left[pos] + 1; i < right[pos]; i++) {
+            node.setBranch(i, null);
+        }
+        {
+            /**
+             * `stack` records the path from root to fork point.
+             * Since we need to unset both left and right nodes once,
+             * we need to make a copy here.
+             */
+            const _stack = [...stack];
+            const next = node.getBranch(left[pos]);
+            const child = next && (await trie.lookupNode(next));
+            const endPos = await unset(trie, node, child, left.slice(pos), 1, false, _stack);
+            await saveStack(left.slice(0, pos + endPos), _stack);
+        }
+        {
+            const _stack = [...stack];
+            const next = node.getBranch(right[pos]);
+            const child = next && (await trie.lookupNode(next));
+            const endPos = await unset(trie, node, child, right.slice(pos), 1, true, _stack);
+            await saveStack(right.slice(0, pos + endPos), _stack);
+        }
+        return false;
+    }
+    else {
+        throw (0, util_1.EthereumJSErrorWithoutCode)('invalid node');
+    }
+}
+/**
+ * Verifies a proof and return the verified trie.
+ * @param rootHash - root hash.
+ * @param key - target key.
+ * @param proof - proof node list.
+ * @throws If proof is found to be invalid.
+ * @returns The value from the key, or null if valid proof of non-existence.
+ */
+async function verifyMPTWithMerkleProof(rootHash, key, proof, useKeyHashingFunction) {
+    const proofTrie = await (0, index_ts_1.createMPTFromProof)(proof, {
+        root: rootHash,
+        useKeyHashingFunction,
+    });
+    try {
+        const value = await proofTrie.get(key, true);
+        return {
+            trie: proofTrie,
+            value,
+        };
+    }
+    catch (err) {
+        if (err.message === 'Missing node in DB') {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Invalid proof provided');
+        }
+        else {
+            throw err;
+        }
+    }
+}
+/**
+ * hasRightElement returns the indicator whether there exists more elements
+ * on the right side of the given path
+ * @param trie - trie object.
+ * @param key - given path.
+ */
+async function hasRightElement(trie, key) {
+    let pos = 0;
+    let node = await trie.lookupNode(trie.root());
+    while (node !== null) {
+        if (node instanceof index_ts_2.BranchMPTNode) {
+            for (let i = key[pos] + 1; i < 16; i++) {
+                if (node.getBranch(i) !== null) {
+                    return true;
+                }
+            }
+            const next = node.getBranch(key[pos]);
+            node = next && (await trie.lookupNode(next));
+            pos += 1;
+        }
+        else if (node instanceof index_ts_2.ExtensionMPTNode) {
+            if (key.length - pos < node.keyLength() ||
+                (0, nibbles_ts_1.nibblesCompare)(node._nibbles, key.slice(pos, pos + node.keyLength())) !== 0) {
+                return (0, nibbles_ts_1.nibblesCompare)(node._nibbles, key.slice(pos)) > 0;
+            }
+            pos += node.keyLength();
+            node = await trie.lookupNode(node._value);
+        }
+        else if (node instanceof index_ts_2.LeafMPTNode) {
+            return false;
+        }
+        else {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid node');
+        }
+    }
+    return false;
+}
+/**
+ * Checks whether the given leaf nodes and edge proof can prove the given trie leaves range is matched with the specific root.
+ *
+ * A range proof is a proof that includes the encoded trie nodes from the root node to leaf node for one or more branches of a trie,
+ * allowing an entire range of leaf nodes to be validated. This is useful in applications such as snap sync where contiguous ranges
+ * of state trie data is received and validated for constructing world state, locally.
+ *
+ * There are four situations:
+ *
+ * - All elements proof. In this case the proof can be null, but the range should
+ *   be all the leaves in the trie.
+ *
+ * - One element proof. In this case no matter the edge proof is a non-existent
+ *   proof or not, we can always verify the correctness of the proof.
+ *
+ * - Zero element proof. In this case a single non-existent proof is enough to prove.
+ *   Besides, if there are still some other leaves available on the right side, then
+ *   an error will be returned.
+ *
+ * - Two edge elements proof. In this case two existent or non-existent proof(first and last) should be provided.
+ *
+ * NOTE: Currently only supports verification when the length of firstKey and lastKey are the same.
+ *
+ * @param rootHash - root hash of state trie this proof is being verified against.
+ * @param firstKey - first key of range being proven.
+ * @param lastKey - last key of range being proven.
+ * @param keys - key list of leaf data being proven.
+ * @param values - value list of leaf data being proven, one-to-one correspondence with keys.
+ * @param proof - proof node list, if all-elements-proof where no proof is needed, proof should be null, and both `firstKey` and `lastKey` must be null as well
+ * @param opts - optional, the opts may include a custom hashing function to use with the trie for proof verification
+ * @returns a flag to indicate whether there exists more trie node in the trie
+ */
+async function verifyMerkleRangeProof(rootHash, firstKeyRaw, lastKeyRaw, keysRaw, values, proof, useKeyHashingFunction = sha3_js_1.keccak_256) {
+    // Convert Uint8Array keys to nibbles
+    const firstKey = firstKeyRaw !== null ? (0, nibbles_ts_1.bytesToNibbles)(firstKeyRaw) : null;
+    const lastKey = lastKeyRaw !== null ? (0, nibbles_ts_1.bytesToNibbles)(lastKeyRaw) : null;
+    const keys = keysRaw.map(nibbles_ts_1.bytesToNibbles);
+    if (keys.length !== values.length) {
+        throw (0, util_1.EthereumJSErrorWithoutCode)('invalid keys length or values length');
+    }
+    // Make sure the keys are in order
+    for (let i = 0; i < keys.length - 1; i++) {
+        if ((0, nibbles_ts_1.nibblesCompare)(keys[i], keys[i + 1]) >= 0) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid keys order');
+        }
+    }
+    // Make sure all values are present
+    for (const value of values) {
+        if (value.length === 0) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid values');
+        }
+    }
+    // All elements proof
+    if (proof === null && firstKey === null && lastKey === null) {
+        const trie = new mpt_ts_1.MerklePatriciaTrie({ useKeyHashingFunction });
+        for (let i = 0; i < keys.length; i++) {
+            await trie.put((0, nibbles_ts_1.nibblesTypeToPackedBytes)(keys[i]), values[i]);
+        }
+        if (!(0, util_1.equalsBytes)(rootHash, trie.root())) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid all elements proof: root mismatch');
+        }
+        return false;
+    }
+    if (proof !== null && firstKey !== null && lastKey === null) {
+        // Zero element proof
+        if (keys.length === 0) {
+            const { trie, value } = await verifyMPTWithMerkleProof(rootHash, (0, nibbles_ts_1.nibblesTypeToPackedBytes)(firstKey), proof, useKeyHashingFunction);
+            if (value !== null || (await hasRightElement(trie, firstKey))) {
+                throw (0, util_1.EthereumJSErrorWithoutCode)('invalid zero element proof: value mismatch');
+            }
+            return false;
+        }
+    }
+    if (proof === null || firstKey === null || lastKey === null) {
+        throw (0, util_1.EthereumJSErrorWithoutCode)('invalid all elements proof: proof, firstKey, lastKey must be null at the same time');
+    }
+    // One element proof
+    if (keys.length === 1 && (0, nibbles_ts_1.nibblesCompare)(firstKey, lastKey) === 0) {
+        const { trie, value } = await verifyMPTWithMerkleProof(rootHash, (0, nibbles_ts_1.nibblesTypeToPackedBytes)(firstKey), proof, useKeyHashingFunction);
+        if ((0, nibbles_ts_1.nibblesCompare)(firstKey, keys[0]) !== 0) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid one element proof: firstKey should be equal to keys[0]');
+        }
+        if (value === null || !(0, util_1.equalsBytes)(value, values[0])) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('invalid one element proof: value mismatch');
+        }
+        return hasRightElement(trie, firstKey);
+    }
+    // Two edge elements proof
+    if ((0, nibbles_ts_1.nibblesCompare)(firstKey, lastKey) >= 0) {
+        throw (0, util_1.EthereumJSErrorWithoutCode)('invalid two edge elements proof: firstKey should be less than lastKey');
+    }
+    if (firstKey.length !== lastKey.length) {
+        throw (0, util_1.EthereumJSErrorWithoutCode)('invalid two edge elements proof: the length of firstKey should be equal to the length of lastKey');
+    }
+    const trie = await (0, index_ts_1.createMPTFromProof)(proof, {
+        useKeyHashingFunction,
+        root: rootHash,
+    });
+    // Remove all nodes between two edge proofs
+    const empty = await unsetInternal(trie, firstKey, lastKey);
+    if (empty) {
+        trie.root(trie.EMPTY_TRIE_ROOT);
+    }
+    // Put all elements to the trie
+    for (let i = 0; i < keys.length; i++) {
+        await trie.put((0, nibbles_ts_1.nibblesTypeToPackedBytes)(keys[i]), values[i]);
+    }
+    // Compare rootHash
+    if (!(0, util_1.equalsBytes)(trie.root(), rootHash)) {
+        throw (0, util_1.EthereumJSErrorWithoutCode)('invalid two edge elements proof: root mismatch');
+    }
+    return hasRightElement(trie, keys[keys.length - 1]);
+}
+//# sourceMappingURL=range.js.map

package/dist/cjs/proof/range.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"range.js","sourceRoot":"","sources":["../../../src/proof/range.ts"],"names":[],"mappings":";;AAmaA,wDA0HC;AA7hBD,2CAA0E;AAC1E,mDAAkD;AAElD,0CAAgD;AAChD,sCAA8C;AAC9C,+CAA+E;AAC/E,mDAA6F;AAI7F,iHAAiH;AAEjH;;;;;;;;;;GAUG;AACH,KAAK,UAAU,KAAK,CAClB,IAAwB,EACxB,MAAe,EACf,KAAqB,EACrB,GAAY,EACZ,GAAW,EACX,UAAmB,EACnB,KAAgB;IAEhB,IAAI,KAAK,YAAY,wBAAa,EAAE,CAAC;QACnC;;;WAGG;QACH,IAAI,UAAU,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAEjB,4BAA4B;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QACtC,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAA;QACpD,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;IACpE,CAAC;SAAM,IAAI,KAAK,YAAY,2BAAgB,IAAI,KAAK,YAAY,sBAAW,EAAE,CAAC;QAC7E;;;;WAIG;QACH,IACE,GAAG,CAAC,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,SAAS,EAAE;YACpC,IAAA,2BAAc,EAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,EAC7E,CAAC;YACD,IAAI,UAAU,EAAE,CAAC;gBACf,IAAI,IAAA,2BAAc,EAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvD,CAAC;oBAAC,MAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;gBAC1D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,IAAA,2BAAc,EAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvD,CAAC;oBAAC,MAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;gBAC1D,CAAC;YACH,CAAC;YACD,OAAO,GAAG,GAAG,CAAC,CAAA;QAChB,CAAC;QAED,IAAI,KAAK,YAAY,sBAAW,EAAE,CAAC;YACjC,2DAA2D;YAC3D,CAAC;YAAC,MAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YACxD,OAAO,GAAG,GAAG,CAAC,CAAA;QAChB,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAA;YACnD,IAAI,MAAM,YAAY,sBAAW,EAAE,CAAC;gBAClC,iEAAiE;gBACjE,CAAC;gBAAC,MAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;gBACxD,OAAO,GAAG,GAAG,CAAC,CAAA;YAChB,CAAC;YAED,gCAAgC;YAChC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAEjB,4BAA4B;YAC5B,OAAO,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,KAAK,CAAC,SAAS,EAAE,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;QACpF,CAAC;IACH,CAAC;SAAM,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAC1B,OAAO,GAAG,GAAG,CAAC,CAAA;IAChB,CAAC;SAAM,CAAC;QACN,MAAM,IAAA,iCAA0B,EAAC,cAAc,CAAC,CAAA;IAClD,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,aAAa,CAC1B,IAAwB,EACxB,IAAa,EACb,KAAc;IAEd,eAAe;IACf,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,cAAc;IACd,IAAI,MAAM,GAAmB,IAAI,CAAA;IACjC,eAAe;IACf,IAAI,IAAI,GAAmB,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;IAC7D,IAAI,aAAsB,CAAA;IAC1B,IAAI,cAAuB,CAAA;IAC3B,6BAA6B;IAC7B,MAAM,KAAK,GAAc,EAAE,CAAA;IAE3B,+CAA+C;IAE/C,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,IAAI,YAAY,2BAAgB,IAAI,IAAI,YAAY,sBAAW,EAAE,CAAC;YACpE,gCAAgC;YAChC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAEhB,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;gBACzC,aAAa,GAAG,IAAA,2BAAc,EAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;YAChE,CAAC;iBAAM,CAAC;gBACN,aAAa,GAAG,IAAA,2BAAc,EAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;YACxF,CAAC;YAED,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC1C,cAAc,GAAG,IAAA,2BAAc,EAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;YAClE,CAAC;iBAAM,CAAC;gBACN,cAAc,GAAG,IAAA,2BAAc,EAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC1F,CAAC;YAED,+FAA+F;YAC/F,IAAI,aAAa,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;gBAChD,MAAK;YACP,CAAC;YAED,IAAI,IAAI,YAAY,sBAAW,EAAE,CAAC;gBAChC,sBAAsB;gBACtB,MAAM,IAAA,iCAA0B,EAAC,cAAc,CAAC,CAAA;YAClD,CAAC;YAED,4BAA4B;YAC5B,MAAM,GAAG,IAAI,CAAA;YACb,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAA;YACvB,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAA;QAC5C,CAAC;aAAM,IAAI,IAAI,YAAY,wBAAa,EAAE,CAAC;YACzC,gCAAgC;YAChC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAEhB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;YAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;YAE5C,sDAAsD;YACtD,IAAI,QAAQ,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC5C,MAAK;YACP,CAAC;YAED,qDAAqD;YACrD,IAAI,CAAC,CAAC,QAAQ,YAAY,UAAU,CAAC,EAAE,CAAC;gBACtC,IAAI,SAAS,YAAY,UAAU,EAAE,CAAC;oBACpC,MAAK;gBACP,CAAC;gBAED,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBACzC,MAAK;gBACP,CAAC;gBAED,IAAI,KAAK,GAAG,KAAK,CAAA;gBACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,IAAI,CAAC,IAAA,kBAAW,EAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC5C,KAAK,GAAG,IAAI,CAAA;wBACZ,MAAK;oBACP,CAAC;gBACH,CAAC;gBACD,IAAI,KAAK,EAAE,CAAC;oBACV,MAAK;gBACP,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,CAAC,SAAS,YAAY,UAAU,CAAC,EAAE,CAAC;oBACvC,MAAK;gBACP,CAAC;gBAED,IAAI,CAAC,IAAA,kBAAW,EAAC,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC;oBACtC,MAAK;gBACP,CAAC;YACH,CAAC;YAED,4BAA4B;YAC5B,MAAM,GAAG,IAAI,CAAA;YACb,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAA;YACtC,GAAG,IAAI,CAAC,CAAA;QACV,CAAC;aAAM,CAAC;YACN,MAAM,IAAA,iCAA0B,EAAC,cAAc,CAAC,CAAA;QAClD,CAAC;IACH,CAAC;IAED,+EAA+E;IAE/E,MAAM,SAAS,GAAG,CAAC,GAAY,EAAE,KAAgB,EAAE,EAAE;QACnD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;IACvC,CAAC,CAAA;IAED,IAAI,IAAI,YAAY,2BAAgB,IAAI,IAAI,YAAY,sBAAW,EAAE,CAAC;QACpE;;;;;;;WAOG;QACH,MAAM,gCAAgC,GAAG,KAAK,EAAE,GAAY,EAAE,EAAE;YAC9D,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,OAAO,IAAI,CAAA;YACb,CAAC;YAED,KAAK,CAAC,GAAG,EAAE,CACV;YAAC,MAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;YACxD,MAAM,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;YAC7C,OAAO,KAAK,CAAA;QACd,CAAC,CAAA;QAED,IAAI,aAAa,KAAK,CAAC,CAAC,IAAI,cAAc,KAAK,CAAC,CAAC,EAAE,CAAC;YAClD,MAAM,IAAA,iCAA0B,EAAC,eAAe,CAAC,CAAA;QACnD,CAAC;QAED,IAAI,aAAa,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,IAAA,iCAA0B,EAAC,eAAe,CAAC,CAAA;QACnD,CAAC;QAED,IAAI,aAAa,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;YAChD,wBAAwB;YACxB,OAAO,gCAAgC,CAAC,IAAI,CAAC,CAAA;QAC/C,CAAC;QAED,kBAAkB;QAClB,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,IAAI,YAAY,sBAAW,EAAE,CAAC;gBAChC,OAAO,gCAAgC,CAAC,IAAI,CAAC,CAAA;YAC/C,CAAC;YAED,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAChD,IAAI,KAAK,YAAY,sBAAW,EAAE,CAAC;gBACjC,OAAO,gCAAgC,CAAC,IAAI,CAAC,CAAA;YAC/C,CAAC;YAED,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;YAC9F,MAAM,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,EAAE,KAAK,CAAC,CAAA;YAEnD,OAAO,KAAK,CAAA;QACd,CAAC;QAED,mBAAmB;QACnB,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;YACxB,IAAI,IAAI,YAAY,sBAAW,EAAE,CAAC;gBAChC,OAAO,gCAAgC,CAAC,KAAK,CAAC,CAAA;YAChD,CAAC;YAED,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAChD,IAAI,KAAK,YAAY,sBAAW,EAAE,CAAC;gBACjC,OAAO,gCAAgC,CAAC,KAAK,CAAC,CAAA;YAChD,CAAC;YAED,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;YAC9F,MAAM,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,EAAE,KAAK,CAAC,CAAA;YAEpD,OAAO,KAAK,CAAA;QACd,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;SAAM,IAAI,IAAI,YAAY,wBAAa,EAAE,CAAC;QACzC,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;QACzB,CAAC;QAED,CAAC;YACC;;;;eAIG;YACH,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAA;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;YACtC,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAA;YACnD,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAA;YAChF,MAAM,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,EAAE,MAAM,CAAC,CAAA;QACtD,CAAC;QAED,CAAC;YACC,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAA;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;YACvC,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAA;YACnD,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;YAChF,MAAM,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,EAAE,MAAM,CAAC,CAAA;QACvD,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;SAAM,CAAC;QACN,MAAM,IAAA,iCAA0B,EAAC,cAAc,CAAC,CAAA;IAClD,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,KAAK,UAAU,wBAAwB,CACrC,QAAoB,EACpB,GAAe,EACf,KAAmB,EACnB,qBAAuC;IAEvC,MAAM,SAAS,GAAG,MAAM,IAAA,6BAAkB,EAAC,KAAK,EAAE;QAChD,IAAI,EAAE,QAAQ;QACd,qBAAqB;KACtB,CAAC,CAAA;IACF,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAC5C,OAAO;YACL,IAAI,EAAE,SAAS;YACf,KAAK;SACN,CAAA;IACH,CAAC;IAAC,OAAO,GAAQ,EAAE,CAAC;QAClB,IAAI,GAAG,CAAC,OAAO,KAAK,oBAAoB,EAAE,CAAC;YACzC,MAAM,IAAA,iCAA0B,EAAC,wBAAwB,CAAC,CAAA;QAC5D,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,CAAA;QACX,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,eAAe,CAAC,IAAwB,EAAE,GAAY;IACnE,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,IAAI,IAAI,GAAmB,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;IAC7D,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;QACrB,IAAI,IAAI,YAAY,wBAAa,EAAE,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;oBAC/B,OAAO,IAAI,CAAA;gBACb,CAAC;YACH,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YACrC,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAA;YAC5C,GAAG,IAAI,CAAC,CAAA;QACV,CAAC;aAAM,IAAI,IAAI,YAAY,2BAAgB,EAAE,CAAC;YAC5C,IACE,GAAG,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE;gBACnC,IAAA,2BAAc,EAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,EAC3E,CAAC;gBACD,OAAO,IAAA,2BAAc,EAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YAC1D,CAAC;YAED,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAA;YACvB,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC3C,CAAC;aAAM,IAAI,IAAI,YAAY,sBAAW,EAAE,CAAC;YACvC,OAAO,KAAK,CAAA;QACd,CAAC;aAAM,CAAC;YACN,MAAM,IAAA,iCAA0B,EAAC,cAAc,CAAC,CAAA;QAClD,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACI,KAAK,UAAU,sBAAsB,CAC1C,QAAoB,EACpB,WAA8B,EAC9B,UAA6B,EAC7B,OAAqB,EACrB,MAAoB,EACpB,KAA0B,EAC1B,wBAA0C,oBAAU;IAEpD,qCAAqC;IACrC,MAAM,QAAQ,GAAG,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,IAAA,2BAAc,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IAC1E,MAAM,OAAO,GAAG,UAAU,KAAK,IAAI,CAAC,CAAC,CAAC,IAAA,2BAAc,EAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IACvE,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,2BAAc,CAAC,CAAA;IAExC,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QAClC,MAAM,IAAA,iCAA0B,EAAC,sCAAsC,CAAC,CAAA;IAC1E,CAAC;IAED,kCAAkC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,IAAA,2BAAc,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAA,iCAA0B,EAAC,oBAAoB,CAAC,CAAA;QACxD,CAAC;IACH,CAAC;IACD,mCAAmC;IACnC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,IAAA,iCAA0B,EAAC,gBAAgB,CAAC,CAAA;QACpD,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QAC5D,MAAM,IAAI,GAAG,IAAI,2BAAkB,CAAC,EAAE,qBAAqB,EAAE,CAAC,CAAA;QAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,CAAC,GAAG,CAAC,IAAA,qCAAwB,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9D,CAAC;QACD,IAAI,CAAC,IAAA,kBAAW,EAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YACxC,MAAM,IAAA,iCAA0B,EAAC,2CAA2C,CAAC,CAAA;QAC/E,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QAC5D,qBAAqB;QACrB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,wBAAwB,CACpD,QAAQ,EACR,IAAA,qCAAwB,EAAC,QAAQ,CAAC,EAClC,KAAK,EACL,qBAAqB,CACtB,CAAA;YAED,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,MAAM,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,IAAA,iCAA0B,EAAC,4CAA4C,CAAC,CAAA;YAChF,CAAC;YAED,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IAED,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QAC5D,MAAM,IAAA,iCAA0B,EAC9B,oFAAoF,CACrF,CAAA;IACH,CAAC;IAED,oBAAoB;IACpB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAA,2BAAc,EAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACjE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,MAAM,wBAAwB,CACpD,QAAQ,EACR,IAAA,qCAAwB,EAAC,QAAQ,CAAC,EAClC,KAAK,EACL,qBAAqB,CACtB,CAAA;QAED,IAAI,IAAA,2BAAc,EAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAA,iCAA0B,EAC9B,gEAAgE,CACjE,CAAA;QACH,CAAC;QACD,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAA,kBAAW,EAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACrD,MAAM,IAAA,iCAA0B,EAAC,2CAA2C,CAAC,CAAA;QAC/E,CAAC;QAED,OAAO,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IACxC,CAAC;IAED,0BAA0B;IAC1B,IAAI,IAAA,2BAAc,EAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAA,iCAA0B,EAC9B,uEAAuE,CACxE,CAAA;IACH,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,IAAA,iCAA0B,EAC9B,kGAAkG,CACnG,CAAA;IACH,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,IAAA,6BAAkB,EAAC,KAAK,EAAE;QAC3C,qBAAqB;QACrB,IAAI,EAAE,QAAQ;KACf,CAAC,CAAA;IAEF,2CAA2C;IAC3C,MAAM,KAAK,GAAG,MAAM,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;IAC1D,IAAI,KAAK,EAAE,CAAC;QACV,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;IACjC,CAAC;IAED,+BAA+B;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,CAAC,GAAG,CAAC,IAAA,qCAAwB,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAC9D,CAAC;IAED,mBAAmB;IACnB,IAAI,CAAC,IAAA,kBAAW,EAAC,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC;QACxC,MAAM,IAAA,iCAA0B,EAAC,gDAAgD,CAAC,CAAA;IACpF,CAAC;IAED,OAAO,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;AACrD,CAAC"}

package/dist/cjs/types.d.ts

@@ -0,0 +1,110 @@
+import type { DB, ValueEncoding } from '@feelyourprotocol/util';
+import type { BranchMPTNode, ExtensionMPTNode, LeafMPTNode } from './node/index.ts';
+import type { WalkController } from './util/walkController.ts';
+export type MPTNode = BranchMPTNode | ExtensionMPTNode | LeafMPTNode;
+export type Nibbles = number[];
+export type RawExtensionMPTNode = [Uint8Array, Uint8Array];
+export type RawLeafMPTNode = [Uint8Array, Uint8Array];
+export type NodeReferenceOrRawMPTNode = Uint8Array | RawExtensionMPTNode | RawLeafMPTNode;
+export type BranchMPTNodeBranchValue = NodeReferenceOrRawMPTNode | null;
+export type Proof = Uint8Array[];
+export interface CommonInterface {
+    customCrypto: {
+        keccak256?: (msg: Uint8Array) => Uint8Array;
+    };
+}
+export interface Path {
+    node: MPTNode | null;
+    remaining: Nibbles;
+    stack: MPTNode[];
+}
+export type FoundNodeFunction = (nodeRef: NodeReferenceOrRawMPTNode, node: MPTNode | null, key: Nibbles, walkController: WalkController) => void;
+export type HashKeysFunction = (msg: Uint8Array) => Uint8Array;
+export interface MPTOpts {
+    /**
+     * A database instance.
+     */
+    db?: DB<string, string | Uint8Array>;
+    /**
+     * A `Uint8Array` for the root of a previously stored trie
+     */
+    root?: Uint8Array;
+    /**
+     * Create as a secure MerklePatriciaTrie where the keys are automatically hashed using the
+     * **keccak_256** hash function or alternatively the custom hash function provided.
+     * Default: `false`
+     *
+     * This is the flavor of the MerklePatriciaTrie which is used in production Ethereum networks
+     * like Ethereum Mainnet.
+     *
+     * Note: This functionality has been refactored along the v5 release and was before
+     * provided as a separate inherited class `SecureTrie`. Just replace with `Trie`
+     * instantiation with `useKeyHashing` set to `true`.
+     */
+    useKeyHashing?: boolean;
+    /**
+     * Hash function used for hashing trie node and securing key.
+     */
+    useKeyHashingFunction?: HashKeysFunction;
+    /**
+     * Add a prefix to the trie node keys
+     *
+     * (potential performance benefits if multiple tries are stored within the same DB,
+     * e.g. all storage tries being stored in the outer account state DB)
+     */
+    keyPrefix?: Uint8Array;
+    /**
+     * ValueEncoding of the database (the values which are `put`/`get` in the db are of this type). Defaults to `string`
+     */
+    valueEncoding?: ValueEncoding;
+    /**
+     * Store the root inside the database after every `write` operation
+     */
+    useRootPersistence?: boolean;
+    /**
+     * Flag to prune the trie. When set to `true`, each time a value is overridden,
+     * unreachable nodes will be pruned (deleted) from the trie
+     */
+    useNodePruning?: boolean;
+    /**
+     * LRU cache for trie nodes to allow for faster node retrieval.
+     *
+     * Default: 0 (deactivated)
+     */
+    cacheSize?: number;
+    /**
+     * @feelyourprotocol/common `Common` instance (an alternative to passing in a `customHashingFunction`)
+     */
+    common?: CommonInterface;
+}
+export type MPTOptsWithDefaults = MPTOpts & {
+    useKeyHashing: boolean;
+    useKeyHashingFunction: HashKeysFunction;
+    useRootPersistence: boolean;
+    useNodePruning: boolean;
+    cacheSize: number;
+};
+export interface TrieShallowCopyOpts {
+    keyPrefix?: Uint8Array;
+    cacheSize?: number;
+}
+export interface CheckpointDBOpts {
+    /**
+     * A database instance.
+     */
+    db: DB<string, string | Uint8Array>;
+    /**
+     * ValueEncoding of the database (the values which are `put`/`get` in the db are of this type). Defaults to `string`
+     */
+    valueEncoding?: ValueEncoding;
+    /**
+     * Cache size (default: 0)
+     */
+    cacheSize?: number;
+}
+export type Checkpoint = {
+    keyValueMap: Map<string, Uint8Array | undefined>;
+    root: Uint8Array;
+};
+export declare const ROOT_DB_KEY: Uint8Array<ArrayBufferLike>;
+//# sourceMappingURL=types.d.ts.map

package/dist/cjs/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/types.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,EAAE,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AACzD,OAAO,KAAK,EAAE,aAAa,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAA;AACnF,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAA;AAE9D,MAAM,MAAM,OAAO,GAAG,aAAa,GAAG,gBAAgB,GAAG,WAAW,CAAA;AAEpE,MAAM,MAAM,OAAO,GAAG,MAAM,EAAE,CAAA;AAM9B,MAAM,MAAM,mBAAmB,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,CAAA;AAC1D,MAAM,MAAM,cAAc,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,CAAA;AAIrD,MAAM,MAAM,yBAAyB,GAAG,UAAU,GAAG,mBAAmB,GAAG,cAAc,CAAA;AAEzF,MAAM,MAAM,wBAAwB,GAAG,yBAAyB,GAAG,IAAI,CAAA;AAEvE,MAAM,MAAM,KAAK,GAAG,UAAU,EAAE,CAAA;AAEhC,MAAM,WAAW,eAAe;IAC9B,YAAY,EAAE;QACZ,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,UAAU,KAAK,UAAU,CAAA;KAC5C,CAAA;CACF;AAED,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,OAAO,GAAG,IAAI,CAAA;IACpB,SAAS,EAAE,OAAO,CAAA;IAClB,KAAK,EAAE,OAAO,EAAE,CAAA;CACjB;AAED,MAAM,MAAM,iBAAiB,GAAG,CAC9B,OAAO,EAAE,yBAAyB,EAClC,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,GAAG,EAAE,OAAO,EACZ,cAAc,EAAE,cAAc,KAC3B,IAAI,CAAA;AAET,MAAM,MAAM,gBAAgB,GAAG,CAAC,GAAG,EAAE,UAAU,KAAK,UAAU,CAAA;AAE9D,MAAM,WAAW,OAAO;IACtB;;OAEG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,CAAC,CAAA;IAEpC;;OAEG;IACH,IAAI,CAAC,EAAE,UAAU,CAAA;IAEjB;;;;;;;;;;;OAWG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;OAEG;IACH,qBAAqB,CAAC,EAAE,gBAAgB,CAAA;IAExC;;;;;OAKG;IACH,SAAS,CAAC,EAAE,UAAU,CAAA;IAEtB;;OAEG;IACH,aAAa,CAAC,EAAE,aAAa,CAAA;IAE7B;;OAEG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAE5B;;;OAGG;IACH,cAAc,CAAC,EAAE,OAAO,CAAA;IAExB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAA;IAElB;;OAEG;IACH,MAAM,CAAC,EAAE,eAAe,CAAA;CACzB;AAED,MAAM,MAAM,mBAAmB,GAAG,OAAO,GAAG;IAC1C,aAAa,EAAE,OAAO,CAAA;IACtB,qBAAqB,EAAE,gBAAgB,CAAA;IACvC,kBAAkB,EAAE,OAAO,CAAA;IAC3B,cAAc,EAAE,OAAO,CAAA;IACvB,SAAS,EAAE,MAAM,CAAA;CAClB,CAAA;AAED,MAAM,WAAW,mBAAmB;IAClC,SAAS,CAAC,EAAE,UAAU,CAAA;IACtB,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB;AAED,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,EAAE,EAAE,EAAE,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,CAAC,CAAA;IAEnC;;OAEG;IACH,aAAa,CAAC,EAAE,aAAa,CAAA;IAE7B;;OAEG;IACH,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB;AAED,MAAM,MAAM,UAAU,GAAG;IAGvB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,GAAG,SAAS,CAAC,CAAA;IAChD,IAAI,EAAE,UAAU,CAAA;CACjB,CAAA;AAED,eAAO,MAAM,WAAW,6BAA0B,CAAA"}

package/dist/cjs/types.js

@@ -0,0 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ROOT_DB_KEY = void 0;
+const util_1 = require("@feelyourprotocol/util");
+exports.ROOT_DB_KEY = (0, util_1.utf8ToBytes)('__root__');
+//# sourceMappingURL=types.js.map

package/dist/cjs/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/types.ts"],"names":[],"mappings":";;;AAAA,2CAA8C;AAsJjC,QAAA,WAAW,GAAG,IAAA,kBAAW,EAAC,UAAU,CAAC,CAAA"}

package/dist/cjs/util/asyncWalk.d.ts

@@ -0,0 +1,20 @@
+import type { MerklePatriciaTrie } from '../mpt.ts';
+import type { MPTNode } from '../types.ts';
+export type NodeFilter = (node: MPTNode, key: number[]) => Promise<boolean>;
+export type OnFound = (node: MPTNode, key: number[]) => Promise<any>;
+/**
+ * Walk MerklePatriciaTrie via async generator
+ * @param nodeHash - The root key to walk on.
+ * @param currentKey - The current (partial) key.
+ * @param onFound - Called on every node found (before filter)
+ * @param filter - Filter nodes yielded by the generator.
+ * @param visited - Set of visited nodes
+ * @returns AsyncIterable<{ node: MPTNode; currentKey: number[] }>
+ * Iterate through nodes with
+ * `for await (const { node, currentKey } of trie._walkTrie(root)) { ... }`
+ */
+export declare function _walkTrie(this: MerklePatriciaTrie, nodeHash: Uint8Array, currentKey?: number[], onFound?: OnFound, filter?: NodeFilter, visited?: Set<string>): AsyncIterable<{
+    node: MPTNode;
+    currentKey: number[];
+}>;
+//# sourceMappingURL=asyncWalk.d.ts.map

package/dist/cjs/util/asyncWalk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"asyncWalk.d.ts","sourceRoot":"","sources":["../../../src/util/asyncWalk.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAA;AACnD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,aAAa,CAAA;AAE1C,MAAM,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,OAAO,CAAC,OAAO,CAAC,CAAA;AAC3E,MAAM,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,OAAO,CAAC,GAAG,CAAC,CAAA;AAEpE;;;;;;;;;;GAUG;AACH,wBAAuB,SAAS,CAC9B,IAAI,EAAE,kBAAkB,EACxB,QAAQ,EAAE,UAAU,EACpB,UAAU,GAAE,MAAM,EAAO,EACzB,OAAO,GAAE,OAA0D,EACnE,MAAM,GAAE,UAA+D,EACvE,OAAO,GAAE,GAAG,CAAC,MAAM,CAAqB,GACvC,aAAa,CAAC;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,UAAU,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,CA6BxD"}