@feelyourprotocol/mpt 8141.0.0

package/dist/cjs/mpt.js

@@ -0,0 +1,900 @@
+// Some more secure presets when using e.g. JS `call`
+'use strict';
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MerklePatriciaTrie = void 0;
+const rlp_1 = require("@feelyourprotocol/rlp");
+const util_1 = require("@feelyourprotocol/util");
+const sha3_js_1 = require("@noble/hashes/sha3.js");
+const debug_1 = require("debug");
+const checkpointDB_ts_1 = require("./db/checkpointDB.js");
+const index_ts_1 = require("./node/index.js");
+const types_ts_1 = require("./types.js");
+const asyncWalk_ts_1 = require("./util/asyncWalk.js");
+const nibbles_ts_1 = require("./util/nibbles.js");
+const walkController_ts_1 = require("./util/walkController.js");
+/**
+ * The basic trie interface, use with `import { MerklePatriciaTrie } from '@feelyourprotocol/mpt'`.
+ *
+ * A MerklePatriciaTrie object can be created with the constructor method:
+ *
+ * - {@link createMPT}
+ *
+ * A sparse MerklePatriciaTrie object can be created from a merkle proof:
+ *
+ * - {@link createMPTFromProof}
+ */
+/**
+ * Merkle Patricia Trie - a space-optimized trie where each node with only one child
+ * is merged with its parent. Used for Ethereum state and storage.
+ *
+ * Node types:
+ * - Branch: 16-way branch + optional value (for keys ending at this node)
+ * - Extension: short path (nibbles) → child node
+ * - Leaf: remaining path (nibbles) → value
+ */
+class MerklePatriciaTrie {
+    /**
+     * Creates a new trie.
+     * @param opts Options for instantiating the trie
+     *
+     * Note: in most cases, {@link createMPT} constructor should be used.  It uses the same API but provides sensible defaults
+     */
+    constructor(opts) {
+        /** Options with defaults applied */
+        this._opts = {
+            useKeyHashing: false,
+            useKeyHashingFunction: sha3_js_1.keccak_256,
+            keyPrefix: undefined,
+            useRootPersistence: false,
+            useNodePruning: false,
+            cacheSize: 0,
+            valueEncoding: util_1.ValueEncoding.String,
+        };
+        this._lock = new util_1.Lock();
+        this._debug = (0, debug_1.default)('mpt:#');
+        this.walkTrieIterable = asyncWalk_ts_1._walkTrie.bind(this);
+        if (opts?.valueEncoding !== undefined && opts.db === undefined) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('`valueEncoding` can only be set if a `db` is provided');
+        }
+        if (opts !== undefined) {
+            this._opts = { ...this._opts, ...opts };
+            this._opts.useKeyHashingFunction =
+                opts.common?.customCrypto.keccak256 ?? opts.useKeyHashingFunction ?? sha3_js_1.keccak_256;
+        }
+        const valueEncoding = opts?.db !== undefined ? (opts.valueEncoding ?? util_1.ValueEncoding.String) : util_1.ValueEncoding.Bytes;
+        this.DEBUG = (0, util_1.isDebugEnabled)('ethjs');
+        this.debug = this.DEBUG
+            ? (message, namespaces = []) => {
+                let logger = this._debug;
+                for (const namespace of namespaces) {
+                    logger = logger.extend(namespace);
+                }
+                logger(message);
+            }
+            : (..._args) => { };
+        this.database(opts?.db ?? new util_1.MapDB(), valueEncoding);
+        this.EMPTY_TRIE_ROOT = this.hash(util_1.RLP_EMPTY_STRING);
+        this._hashLen = this.EMPTY_TRIE_ROOT.length;
+        this._root = this.EMPTY_TRIE_ROOT;
+        if (opts?.root) {
+            this.root(opts.root);
+        }
+        this.DEBUG &&
+            this.debug(`Trie created:
+    || Root: ${(0, util_1.bytesToHex)(this.root())}
+    || Secure: ${this._opts.useKeyHashing}
+    || Persistent: ${this._opts.useRootPersistence}
+    || Pruning: ${this._opts.useNodePruning}
+    || CacheSize: ${this._opts.cacheSize}
+    || ----------------`);
+    }
+    database(db, valueEncoding) {
+        if (db !== undefined) {
+            if (db instanceof checkpointDB_ts_1.CheckpointDB) {
+                throw (0, util_1.EthereumJSErrorWithoutCode)('Cannot pass in an instance of CheckpointDB');
+            }
+            this._db = new checkpointDB_ts_1.CheckpointDB({ db, cacheSize: this._opts.cacheSize, valueEncoding });
+        }
+        return this._db;
+    }
+    /**
+     * Gets and/or Sets the current root of the `trie`
+     */
+    root(value) {
+        if (value !== undefined) {
+            if (value === null) {
+                value = this.EMPTY_TRIE_ROOT;
+            }
+            this.DEBUG && this.debug(`Setting root to ${(0, util_1.bytesToHex)(value)}`);
+            if (value.length !== this._hashLen) {
+                throw (0, util_1.EthereumJSErrorWithoutCode)(`Invalid root length. Roots are ${this._hashLen} bytes, got ${value.length} bytes`);
+            }
+            this._root = value;
+        }
+        return this._root;
+    }
+    /**
+     * Checks if a given root exists.
+     */
+    async checkRoot(root) {
+        try {
+            const value = await this.lookupNode(root);
+            return value !== null;
+        }
+        catch (error) {
+            if (error.message === 'Missing node in DB') {
+                return (0, util_1.equalsBytes)(root, this.EMPTY_TRIE_ROOT);
+            }
+            else {
+                throw error;
+            }
+        }
+    }
+    /**
+     * Gets a value given a `key`
+     * @param key - the key to search for
+     * @param throwIfMissing - if true, throws if any nodes are missing. Used for verifying proofs. (default: false)
+     * @returns A Promise that resolves to `Uint8Array` if a value was found or `null` if no value was found.
+     */
+    async get(key, throwIfMissing = false) {
+        this.DEBUG && this.debug(`Key: ${(0, util_1.bytesToHex)(key)}`, ['get']);
+        const { node, remaining } = await this.findPath(this.appliedKey(key), throwIfMissing);
+        let value = null;
+        if (node && remaining.length === 0) {
+            value = node.value();
+        }
+        this.DEBUG && this.debug(`Value: ${value === null ? 'null' : (0, util_1.bytesToHex)(value)}`, ['get']);
+        return value;
+    }
+    /**
+     * Stores a given `value` at the given `key` or do a delete if `value` is empty
+     * (delete operations are only executed on DB with `deleteFromDB` set to `true`)
+     * @param key
+     * @param value
+     * @returns A Promise that resolves once value is stored.
+     */
+    async put(key, value, skipKeyTransform = false) {
+        this.DEBUG && this.debug(`Key: ${(0, util_1.bytesToHex)(key)}`, ['put']);
+        this.DEBUG && this.debug(`Value: ${value === null ? 'null' : (0, util_1.bytesToHex)(value)}`, ['put']);
+        if (this._opts.useRootPersistence && (0, util_1.equalsBytes)(key, types_ts_1.ROOT_DB_KEY)) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)(`Attempted to set '${(0, util_1.bytesToUtf8)(types_ts_1.ROOT_DB_KEY)}' key but it is not allowed.`);
+        }
+        // If value is empty, delete
+        if (value === null || value.length === 0) {
+            return this.del(key);
+        }
+        await this._lock.acquire();
+        const appliedKey = skipKeyTransform ? key : this.appliedKey(key);
+        if ((0, util_1.equalsBytes)(this.root(), this.EMPTY_TRIE_ROOT)) {
+            await this._createInitialNode(appliedKey, value);
+        }
+        else {
+            const { remaining, stack } = await this.findPath(appliedKey);
+            let ops = [];
+            if (this._opts.useNodePruning) {
+                const val = await this.get(key);
+                // Only delete keys if it either does not exist, or if it gets updated
+                // (The update will update the hash of the node, thus we can delete the original leaf node)
+                if (val === null || !(0, util_1.equalsBytes)(val, value)) {
+                    ops = this._createPruneDeleteOps(stack);
+                }
+            }
+            // then update
+            await this._updateNode(appliedKey, value, remaining, stack);
+            if (this._opts.useNodePruning) {
+                // Only after updating the node we can delete the keyHashes
+                await this._db.batch(ops);
+            }
+        }
+        await this.persistRoot();
+        this._lock.release();
+    }
+    /**
+     * Deletes a value given a `key` from the trie
+     * (delete operations are only executed on DB with `deleteFromDB` set to `true`)
+     * @param key
+     * @returns A Promise that resolves once value is deleted.
+     */
+    async del(key, skipKeyTransform = false) {
+        this.DEBUG && this.debug(`Key: ${(0, util_1.bytesToHex)(key)}`, ['del']);
+        await this._lock.acquire();
+        const appliedKey = skipKeyTransform ? key : this.appliedKey(key);
+        const { node, stack } = await this.findPath(appliedKey);
+        let ops = [];
+        // Only delete if the `key` currently has any value
+        if (this._opts.useNodePruning && node !== null) {
+            ops = this._createPruneDeleteOps(stack);
+        }
+        if (node) {
+            await this._deleteNode(appliedKey, stack);
+        }
+        if (this._opts.useNodePruning) {
+            // Only after deleting the node it is possible to delete the keyHashes
+            await this._db.batch(ops);
+        }
+        await this.persistRoot();
+        this._lock.release();
+    }
+    // ─── Path finding ───────────────────────────────────────────────────────────
+    /**
+     * Finds the path from root to the node for the given key.
+     * Walks the trie, matching nibbles at each level. Returns the target node (if found)
+     * and the stack of nodes along the path (needed for updates/deletes).
+     *
+     * @param key - the search key (bytes)
+     * @param throwIfMissing - if true, throws when nodes are missing (e.g. proof verification)
+     * @param partialPath - optional pre-loaded stack for resuming from a mid-path node
+     */
+    async findPath(key, throwIfMissing = false, partialPath = {
+        stack: [],
+    }) {
+        const targetKey = (0, nibbles_ts_1.bytesToNibbles)(key);
+        const keyLen = targetKey.length;
+        const stack = Array.from({ length: keyLen });
+        // Pre-fill stack from partialPath when resuming a previous walk
+        let pathProgress = 0;
+        for (let stackIndex = 0; stackIndex < partialPath.stack.length - 1; stackIndex++) {
+            stack[stackIndex] = partialPath.stack[stackIndex];
+            pathProgress +=
+                stack[stackIndex] instanceof index_ts_1.BranchMPTNode
+                    ? 1
+                    : stack[stackIndex].keyLength();
+        }
+        this.DEBUG && this.debug(`Target (${targetKey.length}): [${targetKey}]`, ['find_path']);
+        let result = null;
+        const onFound = async (_nodeRef, node, currentKeyNibbles, walkController) => {
+            stack[pathProgress] = node;
+            if (node instanceof index_ts_1.BranchMPTNode) {
+                if (pathProgress === keyLen) {
+                    result = { node, remaining: [], stack };
+                }
+                else {
+                    const branchIndex = targetKey[pathProgress];
+                    const branchNode = node.getBranch(branchIndex);
+                    this.DEBUG &&
+                        this.debug(branchNode === null
+                            ? 'NULL'
+                            : `Branch ${branchIndex}: ${branchNode instanceof Uint8Array ? (0, util_1.bytesToHex)(branchNode) : 'raw'}`, ['find_path', 'branch_node']);
+                    if (!branchNode) {
+                        result = { node: null, remaining: targetKey.slice(pathProgress), stack };
+                    }
+                    else {
+                        pathProgress++;
+                        walkController.onlyBranchIndex(node, currentKeyNibbles, branchIndex);
+                    }
+                }
+            }
+            else if (node instanceof index_ts_1.LeafMPTNode) {
+                const leafStartProgress = pathProgress;
+                if (keyLen - pathProgress > node.key().length) {
+                    result = { node: null, remaining: targetKey.slice(leafStartProgress), stack };
+                    return;
+                }
+                for (const nibble of node.key()) {
+                    if (nibble !== targetKey[pathProgress]) {
+                        result = { node: null, remaining: targetKey.slice(leafStartProgress), stack };
+                        return;
+                    }
+                    pathProgress++;
+                }
+                result = { node, remaining: [], stack };
+            }
+            else if (node instanceof index_ts_1.ExtensionMPTNode) {
+                const extensionStartProgress = pathProgress;
+                this.DEBUG &&
+                    this.debug(`Extension key: [${node.key()}] vs expected [${targetKey.slice(pathProgress, pathProgress + node.key().length)}]`, ['find_path', 'extension_node']);
+                for (const nibble of node.key()) {
+                    if (nibble !== targetKey[pathProgress]) {
+                        result = { node: null, remaining: targetKey.slice(extensionStartProgress), stack };
+                        return;
+                    }
+                    pathProgress++;
+                }
+                walkController.allChildren(node, currentKeyNibbles);
+            }
+        };
+        const startingNode = partialPath.stack[partialPath.stack.length - 1];
+        const start = startingNode !== undefined ? this.hash(startingNode.serialize()) : this.root();
+        try {
+            this.DEBUG &&
+                this.debug(`Walking trie from ${startingNode === undefined ? 'ROOT' : 'NODE'}: ${(0, util_1.bytesToHex)(start)}`, ['find_path']);
+            await this.walkTrie(start, onFound);
+        }
+        catch (error) {
+            if (error.message !== 'Missing node in DB' || throwIfMissing) {
+                throw error;
+            }
+        }
+        if (result === null) {
+            result = { node: null, remaining: [], stack };
+        }
+        this.DEBUG &&
+            this.debug(result.node !== null
+                ? `Target Node FOUND for ${(0, nibbles_ts_1.bytesToNibbles)(key)}`
+                : `Target Node NOT FOUND`, ['find_path']);
+        result.stack = result.stack.filter((stackEntry) => stackEntry !== undefined);
+        this.DEBUG &&
+            this.debug(`Result:
+        || Node: ${result.node === null ? 'null' : result.node.constructor.name}
+        || Remaining: [${result.remaining}]\n|| Stack: ${result.stack
+                .map((stackEntry) => stackEntry.constructor.name)
+                .join(', ')}`, ['find_path']);
+        return result;
+    }
+    /**
+     * Walks a trie until finished.
+     * @param root
+     * @param onFound - callback to call when a node is found. This schedules new tasks. If no tasks are available, the Promise resolves.
+     * @returns Resolves when finished walking trie.
+     */
+    async walkTrie(root, onFound) {
+        await walkController_ts_1.WalkController.newWalk(onFound, this, root);
+    }
+    /**
+     * Executes a callback for each node in the trie.
+     * @param onFound - callback to call when a node is found.
+     * @returns Resolves when finished walking trie.
+     */
+    async walkAllNodes(onFound) {
+        for await (const { node, currentKey } of this.walkTrieIterable(this.root())) {
+            await onFound(node, currentKey);
+        }
+    }
+    /**
+     * Executes a callback for each value node in the trie.
+     * @param onFound - callback to call when a node is found.
+     * @returns Resolves when finished walking trie.
+     */
+    async walkAllValueNodes(onFound) {
+        for await (const { node, currentKey } of this.walkTrieIterable(this.root(), [], undefined, async (node) => {
+            return (node instanceof index_ts_1.LeafMPTNode || (node instanceof index_ts_1.BranchMPTNode && node.value() !== null));
+        })) {
+            await onFound(node, currentKey);
+        }
+    }
+    // ─── Node persistence (internal) ─────────────────────────────────────────────
+    /**
+     * Creates the initial leaf node when inserting into an empty trie.
+     * @private
+     */
+    async _createInitialNode(key, value) {
+        const newNode = new index_ts_1.LeafMPTNode((0, nibbles_ts_1.bytesToNibbles)(key), value);
+        const encoded = newNode.serialize();
+        this.root(this.hash(encoded));
+        await this._db.put(this._getDbKey(this.root()), encoded);
+        await this.persistRoot();
+    }
+    /**
+     * Retrieves a node from db by hash.
+     */
+    async lookupNode(node) {
+        if ((0, index_ts_1.isRawMPTNode)(node)) {
+            const decoded = (0, index_ts_1.decodeRawMPTNode)(node);
+            this.DEBUG && this.debug(`${decoded.constructor.name}`, ['lookup_node', 'raw_node']);
+            return decoded;
+        }
+        this.DEBUG && this.debug(`${(0, util_1.bytesToHex)(node)}`, ['lookup_node', 'by_hash']);
+        const value = (await this._db.get(this._getDbKey(node))) ?? null;
+        if (value === null) {
+            // Dev note: this error message text is used for error checking in `checkRoot`, `verifyMPTWithMerkleProof`, and `findPath`
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Missing node in DB');
+        }
+        const decoded = (0, index_ts_1.decodeMPTNode)(value);
+        this.DEBUG && this.debug(`${decoded.constructor.name} found in DB`, ['lookup_node', 'by_hash']);
+        return decoded;
+    }
+    /**
+     * True when we're updating an existing leaf value (key already exists, no structural change).
+     * @private
+     */
+    _isMatchingLeafUpdate(lastNode, stack, fullKeyNibbles, keyRemainder) {
+        if (!(lastNode instanceof index_ts_1.LeafMPTNode) || keyRemainder.length !== 0) {
+            return false;
+        }
+        let keyOffset = 0;
+        for (const stackNode of stack) {
+            keyOffset += stackNode instanceof index_ts_1.BranchMPTNode ? 1 : stackNode.key().length;
+        }
+        return ((0, nibbles_ts_1.matchingNibbleLength)(lastNode.key(), fullKeyNibbles.slice(keyOffset)) ===
+            lastNode.key().length);
+    }
+    /**
+     * Applies a value update given the path from findPath. Modifies the stack in-place
+     * to represent the new structure, then calls saveStack to persist.
+     *
+     * Three cases:
+     * 1. Match leaf: key exists, just update value (no structure change)
+     * 2. Branch: add new leaf to branch, or set branch value
+     * 3. Extension/Leaf with diverging path: create new branch at divergence, re-hang old + new leaf
+     *
+     * @private
+     */
+    async _updateNode(keyBytes, value, keyRemainder, stack) {
+        const opStack = [];
+        const lastNode = stack.pop();
+        if (!lastNode) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('Stack underflow');
+        }
+        const fullKeyNibbles = (0, nibbles_ts_1.bytesToNibbles)(keyBytes);
+        const matchLeaf = this._isMatchingLeafUpdate(lastNode, stack, fullKeyNibbles, keyRemainder);
+        if (matchLeaf) {
+            // Case 1: Key already exists at this leaf – update value in place
+            lastNode.value(value);
+            stack.push(lastNode);
+        }
+        else if (lastNode instanceof index_ts_1.BranchMPTNode) {
+            // Case 2: Insert into branch – either new leaf on empty slot or set branch value
+            stack.push(lastNode);
+            if (keyRemainder.length !== 0) {
+                keyRemainder.shift();
+                stack.push(new index_ts_1.LeafMPTNode(keyRemainder, value));
+            }
+            else {
+                lastNode.value(value);
+            }
+        }
+        else {
+            // Case 3: Last node is Extension or Leaf – path diverges. Create branch at divergence point
+            const lastKey = lastNode.key();
+            const matchingLength = (0, nibbles_ts_1.matchingNibbleLength)(lastKey, keyRemainder);
+            const newBranchMPTNode = new index_ts_1.BranchMPTNode();
+            if (matchingLength !== 0) {
+                const newExtNode = new index_ts_1.ExtensionMPTNode(lastNode.key().slice(0, matchingLength), value);
+                stack.push(newExtNode);
+                lastKey.splice(0, matchingLength);
+                keyRemainder.splice(0, matchingLength);
+            }
+            stack.push(newBranchMPTNode);
+            if (lastKey.length !== 0) {
+                const branchKey = lastKey.shift();
+                if (lastKey.length !== 0 || lastNode instanceof index_ts_1.LeafMPTNode) {
+                    lastNode.key(lastKey);
+                    const formattedNode = this._formatNode(lastNode, false, opStack);
+                    newBranchMPTNode.setBranch(branchKey, formattedNode);
+                }
+                else {
+                    this._formatNode(lastNode, false, opStack, true);
+                    newBranchMPTNode.setBranch(branchKey, lastNode.value());
+                }
+            }
+            else {
+                newBranchMPTNode.value(lastNode.value());
+            }
+            if (keyRemainder.length !== 0) {
+                keyRemainder.shift();
+                stack.push(new index_ts_1.LeafMPTNode(keyRemainder, value));
+            }
+            else {
+                newBranchMPTNode.value(value);
+            }
+        }
+        await this.saveStack(fullKeyNibbles, stack, opStack);
+    }
+    /**
+     * Removes a key from the trie. Handles two main cases:
+     * - Deleting from a leaf: remove leaf, possibly collapse parent branch
+     * - Deleting from a branch value: clear value, possibly collapse if branch has single child
+     *
+     * When a branch ends up with only one child after deletion, we collapse it into
+     * an extension (or merge with parent extension) to keep the trie minimal.
+     *
+     * @private
+     */
+    async _deleteNode(keyBytes, stack) {
+        /**
+         * Collapses a branch with one child into a simpler structure.
+         * Parent can be: Branch (branch→branch), Extension (ext→branch), or null (branch is root).
+         */
+        const collapseBranchWithOneChild = (pathNibbles, branchIndex, childNode, parentNode, nodeStack) => {
+            const parentIsBranchOrRoot = parentNode === null || parentNode === undefined || parentNode instanceof index_ts_1.BranchMPTNode;
+            if (parentIsBranchOrRoot) {
+                if (parentNode instanceof index_ts_1.BranchMPTNode)
+                    nodeStack.push(parentNode);
+                if (childNode instanceof index_ts_1.BranchMPTNode) {
+                    const extensionNode = new index_ts_1.ExtensionMPTNode([branchIndex], new Uint8Array());
+                    nodeStack.push(extensionNode);
+                    pathNibbles.push(branchIndex);
+                }
+                else {
+                    const childNodeKey = childNode.key();
+                    childNodeKey.unshift(branchIndex);
+                    childNode.key(childNodeKey.slice(0));
+                    nodeStack.push(childNode);
+                    return pathNibbles.concat(childNodeKey);
+                }
+                nodeStack.push(childNode);
+                return pathNibbles;
+            }
+            if (!(parentNode instanceof index_ts_1.ExtensionMPTNode)) {
+                throw (0, util_1.EthereumJSErrorWithoutCode)('Expected extension node');
+            }
+            const parentKey = parentNode.key();
+            if (childNode instanceof index_ts_1.BranchMPTNode) {
+                parentKey.push(branchIndex);
+                pathNibbles.push(branchIndex);
+                parentNode.key(parentKey);
+                nodeStack.push(parentNode);
+            }
+            else {
+                const childNodeKey = childNode.key();
+                childNodeKey.unshift(branchIndex);
+                const fullPath = parentKey.concat(childNodeKey);
+                childNode.key(fullPath);
+                nodeStack.push(childNode);
+                return pathNibbles.concat(childNodeKey);
+            }
+            nodeStack.push(childNode);
+            return pathNibbles;
+        };
+        let lastNode = stack.pop();
+        if (lastNode === undefined)
+            throw (0, util_1.EthereumJSErrorWithoutCode)('missing last node');
+        let parentNode = stack.pop();
+        const opStack = [];
+        let pathNibbles = (0, nibbles_ts_1.bytesToNibbles)(keyBytes);
+        if (parentNode === undefined) {
+            this.root(this.EMPTY_TRIE_ROOT);
+            return;
+        }
+        if (lastNode instanceof index_ts_1.BranchMPTNode) {
+            lastNode.value(null);
+        }
+        else {
+            // Deleting a leaf: remove it from parent branch, then consider collapsing
+            if (!(parentNode instanceof index_ts_1.BranchMPTNode)) {
+                throw (0, util_1.EthereumJSErrorWithoutCode)('Expected branch node');
+            }
+            const lastNodeKey = lastNode.key();
+            pathNibbles.splice(pathNibbles.length - lastNodeKey.length);
+            this._formatNode(lastNode, false, opStack, true);
+            parentNode.setBranch(pathNibbles.pop(), null);
+            lastNode = parentNode;
+            parentNode = stack.pop();
+        }
+        const branchNodes = lastNode.getChildren();
+        if (branchNodes.length === 1) {
+            // add the one remaining branch node to node above it
+            const branchNode = branchNodes[0][1];
+            const branchNodeKey = branchNodes[0][0];
+            // Special case where one needs to delete an extra node:
+            // In this case, after updating the branch, the branch node has just one branch left
+            // However, this violates the trie spec; this should be converted in either an ExtensionMPTNode
+            // Or a LeafMPTNode
+            // Since this branch is deleted, one can thus also delete this branch from the DB
+            // So add this to the `opStack` and mark the keyHash to be deleted
+            if (this._opts.useNodePruning) {
+                // If the branchNode has length < 32, it will be a RawNode (Uint8Array[]) instead of a Uint8Array
+                // In that case, we need to serialize and hash it into a Uint8Array, otherwise the operation will throw
+                const hashToDelete = (0, index_ts_1.isRawMPTNode)(branchNode)
+                    ? this.hash(rlp_1.RLP.encode(branchNode))
+                    : branchNode;
+                opStack.push({ type: 'del', key: this._getDbKey(hashToDelete) });
+            }
+            // look up node
+            const foundNode = await this.lookupNode(branchNode);
+            pathNibbles = collapseBranchWithOneChild(pathNibbles, branchNodeKey, foundNode, parentNode, stack);
+            await this.saveStack(pathNibbles, stack, opStack);
+        }
+        else {
+            // Branch has multiple children: just persist the updated branch
+            if (parentNode) {
+                stack.push(parentNode);
+            }
+            stack.push(lastNode);
+            await this.saveStack(pathNibbles, stack, opStack);
+        }
+    }
+    /**
+     * Persists the modified node stack to the DB. Processes nodes from leaf toward root,
+     * wiring each node's references (extension value, branch slot) to its child's hash.
+     *
+     * @param key - nibble path that corresponds to the stack
+     * @param stack - nodes from findPath/update, bottom (leaf) to top (root)
+     * @param opStack - put/del operations accumulated by _formatNode
+     */
+    async saveStack(pathNibbles, stack, opStack) {
+        let childHash;
+        while (stack.length > 0) {
+            const node = stack.pop();
+            if (node === undefined) {
+                throw (0, util_1.EthereumJSErrorWithoutCode)('saveStack: missing node');
+            }
+            if (node instanceof index_ts_1.LeafMPTNode || node instanceof index_ts_1.ExtensionMPTNode) {
+                pathNibbles.splice(pathNibbles.length - node.key().length);
+            }
+            if (node instanceof index_ts_1.ExtensionMPTNode && childHash !== undefined) {
+                node.value(childHash);
+            }
+            if (node instanceof index_ts_1.BranchMPTNode && childHash !== undefined) {
+                const branchIndex = pathNibbles.pop();
+                node.setBranch(branchIndex, childHash);
+            }
+            childHash = this._formatNode(node, stack.length === 0, opStack);
+        }
+        if (childHash !== undefined) {
+            this.root(childHash);
+        }
+        await this._db.batch(opStack);
+        await this.persistRoot();
+    }
+    /**
+     * Serializes a node and either stores it (put) or schedules removal (del).
+     * Nodes ≥32 bytes (or top-level) are hashed and stored; smaller nodes are inlined as raw.
+     *
+     * @param node - the node to persist
+     * @param topLevel - if true, always store (root must be in DB)
+     * @param opStack - accumulates put/del operations for batch commit
+     * @param remove - if true, schedule del (used when pruning)
+     * @returns hash (for references) or raw encoding (for inline)
+     */
+    _formatNode(node, topLevel, opStack, remove = false) {
+        const encoded = node.serialize();
+        if (encoded.length >= 32 || topLevel) {
+            const nodeHash = this.hash(encoded);
+            const dbKey = this._getDbKey(nodeHash);
+            if (remove) {
+                if (this._opts.useNodePruning) {
+                    opStack.push({ type: 'del', key: dbKey });
+                }
+            }
+            else {
+                opStack.push({ type: 'put', key: dbKey, value: encoded });
+            }
+            return nodeHash;
+        }
+        return node.raw();
+    }
+    /**
+     * The given hash of operations (key additions or deletions) are executed on the trie
+     * (delete operations are only executed on DB with `deleteFromDB` set to `true`)
+     * @example
+     * const ops = [
+     *    { type: 'del', key: Uint8Array.from('father') }
+     *  , { type: 'put', key: Uint8Array.from('name'), value: Uint8Array.from('Yuri Irsenovich Kim') } // cspell:disable-line
+     *  , { type: 'put', key: Uint8Array.from('dob'), value: Uint8Array.from('16 February 1941') }
+     *  , { type: 'put', key: Uint8Array.from('spouse'), value: Uint8Array.from('Kim Young-sook') } // cspell:disable-line
+     *  , { type: 'put', key: Uint8Array.from('occupation'), value: Uint8Array.from('Clown') }
+     * ]
+     * await trie.batch(ops)
+     * @param ops
+     */
+    async batch(ops, skipKeyTransform) {
+        for (const op of ops) {
+            if (op.type === 'put') {
+                if (op.value === null || op.value === undefined) {
+                    throw (0, util_1.EthereumJSErrorWithoutCode)('Invalid batch db operation');
+                }
+                await this.put(op.key, op.value, skipKeyTransform);
+            }
+            else if (op.type === 'del') {
+                await this.del(op.key, skipKeyTransform);
+            }
+        }
+        await this.persistRoot();
+    }
+    /**
+     * Verifies that every key in the DB is reachable from the root. Used to ensure
+     * pruning is correct – unreachable keys indicate a bug or corrupt state.
+     */
+    async verifyPrunedIntegrity() {
+        // Using deprecated bytesToUnprefixedHex for performance: used for string comparisons with database keys.
+        const roots = [
+            (0, util_1.bytesToUnprefixedHex)(this.root()),
+            (0, util_1.bytesToUnprefixedHex)(this.appliedKey(types_ts_1.ROOT_DB_KEY)),
+        ];
+        for (const dbKeyHex of this._db.db._database.keys()) {
+            if (roots.includes(dbKeyHex)) {
+                // The root key can never be found from the trie, otherwise this would
+                // convert the tree from a directed acyclic graph to a directed cycling graph
+                continue;
+            }
+            // Track if key is found
+            let found = false;
+            try {
+                await this.walkTrie(this.root(), async (_, node, currentKeyNibbles, walkController) => {
+                    if (found)
+                        return;
+                    if (node instanceof index_ts_1.BranchMPTNode) {
+                        for (const branchRef of node._branches) {
+                            if (branchRef !== null &&
+                                (0, util_1.bytesToUnprefixedHex)((0, index_ts_1.isRawMPTNode)(branchRef)
+                                    ? walkController.trie.appliedKey(rlp_1.RLP.encode(branchRef))
+                                    : branchRef) === dbKeyHex) {
+                                found = true;
+                                return;
+                            }
+                        }
+                        walkController.allChildren(node, currentKeyNibbles);
+                    }
+                    if (node instanceof index_ts_1.ExtensionMPTNode) {
+                        if ((0, util_1.bytesToUnprefixedHex)(node.value()) === dbKeyHex) {
+                            found = true;
+                            return;
+                        }
+                        walkController.allChildren(node, currentKeyNibbles);
+                    }
+                });
+            }
+            catch {
+                return false;
+            }
+            if (!found) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Returns a copy of the underlying trie.
+     *
+     * Note on db: the copy will create a reference to the
+     * same underlying database.
+     *
+     * Note on cache: for memory reasons a copy will by default
+     * not recreate a new LRU cache but initialize with cache
+     * being deactivated. This behavior can be overwritten by
+     * explicitly setting `cacheSize` as an option on the method.
+     *
+     * @param includeCheckpoints - If true and during a checkpoint, the copy will contain the checkpointing metadata and will use the same scratch as underlying db.
+     */
+    shallowCopy(includeCheckpoints = true, opts) {
+        const trie = new MerklePatriciaTrie({
+            ...this._opts,
+            db: this._db.db.shallowCopy(),
+            root: this.root(),
+            cacheSize: 0,
+            ...(opts ?? {}),
+        });
+        if (includeCheckpoints && this.hasCheckpoints()) {
+            trie._db.setCheckpoints(this._db.checkpoints);
+        }
+        return trie;
+    }
+    /**
+     * Persists the root hash in the underlying database
+     */
+    async persistRoot() {
+        if (this._opts.useRootPersistence) {
+            this.DEBUG &&
+                this.debug(`Persisting root: \n|| RootHash: ${(0, util_1.bytesToHex)(this.root())}\n|| RootKey: ${(0, util_1.bytesToHex)(this.appliedKey(types_ts_1.ROOT_DB_KEY))}`, ['persist_root']);
+            await this._db.put(this._getDbKey(this.appliedKey(types_ts_1.ROOT_DB_KEY)), this.root());
+        }
+    }
+    /**
+     * Finds all nodes that are stored directly in the db
+     * (some nodes are stored raw inside other nodes)
+     * called by {@link ScratchReadStream}
+     * @private
+     */
+    async _findDbNodes(onFound) {
+        const outerOnFound = async (nodeRef, node, key, walkController) => {
+            if ((0, index_ts_1.isRawMPTNode)(nodeRef)) {
+                if (node !== null) {
+                    walkController.allChildren(node, key);
+                }
+            }
+            else {
+                onFound(nodeRef, node, key, walkController);
+            }
+        };
+        await this.walkTrie(this.root(), outerOnFound);
+    }
+    // ─── DB helpers ─────────────────────────────────────────────────────────────
+    /** Applies keyPrefix to a hash when multiple tries share a DB. */
+    _getDbKey(hash) {
+        return this._opts.keyPrefix ? (0, util_1.concatBytes)(this._opts.keyPrefix, hash) : hash;
+    }
+    /** Builds del ops for nodes that will be replaced (pruning). */
+    _createPruneDeleteOps(stack) {
+        return stack.map((node) => {
+            const deletedHash = this.hash(node.serialize());
+            return {
+                type: 'del',
+                key: this._getDbKey(deletedHash),
+                opts: { keyEncoding: util_1.KeyEncoding.Bytes },
+            };
+        });
+    }
+    /** Applies key hashing (keccak) when useKeyHashing is enabled (Ethereum-style). */
+    appliedKey(key) {
+        if (this._opts.useKeyHashing) {
+            return this.hash(key);
+        }
+        return key;
+    }
+    hash(inputBytes) {
+        return Uint8Array.from(this._opts.useKeyHashingFunction.call(undefined, inputBytes));
+    }
+    /**
+     * Is the trie during a checkpoint phase?
+     */
+    hasCheckpoints() {
+        return this._db.hasCheckpoints();
+    }
+    /**
+     * Creates a checkpoint that can later be reverted to or committed.
+     * After this is called, all changes can be reverted until `commit` is called.
+     */
+    checkpoint() {
+        this.DEBUG && this.debug(`${(0, util_1.bytesToHex)(this.root())}`, ['checkpoint']);
+        this._db.checkpoint(this.root());
+    }
+    /**
+     * Commits a checkpoint to disk, if current checkpoint is not nested.
+     * If nested, only sets the parent checkpoint as current checkpoint.
+     * @throws If not during a checkpoint phase
+     */
+    async commit() {
+        if (!this.hasCheckpoints()) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('trying to commit when not checkpointed');
+        }
+        this.DEBUG && this.debug(`${(0, util_1.bytesToHex)(this.root())}`, ['commit']);
+        await this._lock.acquire();
+        await this._db.commit();
+        await this.persistRoot();
+        this._lock.release();
+    }
+    /**
+     * Reverts the trie to the state it was at when `checkpoint` was first called.
+     * If during a nested checkpoint, sets root to most recent checkpoint, and sets
+     * parent checkpoint as current.
+     */
+    async revert() {
+        if (!this.hasCheckpoints()) {
+            throw (0, util_1.EthereumJSErrorWithoutCode)('trying to revert when not checkpointed');
+        }
+        this.DEBUG && this.debug(`${(0, util_1.bytesToHex)(this.root())}`, ['revert', 'before']);
+        await this._lock.acquire();
+        this.root(await this._db.revert());
+        await this.persistRoot();
+        this._lock.release();
+        this.DEBUG && this.debug(`${(0, util_1.bytesToHex)(this.root())}`, ['revert', 'after']);
+    }
+    /**
+     * Flushes all checkpoints, restoring the initial checkpoint state.
+     */
+    flushCheckpoints() {
+        this.DEBUG &&
+            this.debug(`Deleting ${this._db.checkpoints.length} checkpoints.`, ['flush_checkpoints']);
+        this._db.checkpoints = [];
+    }
+    /**
+     * Returns a list of values stored in the trie
+     * @param startKey first unhashed key in the range to be returned (defaults to 0).  Note, all keys must be of the same length or undefined behavior will result
+     * @param limit - the number of keys to be returned (undefined means all keys)
+     * @returns an object with two properties (a map of all key/value pairs in the trie - or in the specified range) and then a `nextKey` reference if a range is specified
+     */
+    async getValueMap(startKey = util_1.BIGINT_0, limit) {
+        let inRange = limit !== undefined ? false : true;
+        let valueCount = 0;
+        const values = {};
+        let nextKey = null;
+        await this.walkAllValueNodes(async (node, currentKey) => {
+            if (node instanceof index_ts_1.LeafMPTNode) {
+                const keyBytes = (0, nibbles_ts_1.nibblesTypeToPackedBytes)(currentKey.concat(node.key()));
+                if (!inRange) {
+                    // Check if the key is already in the correct range.
+                    if ((0, util_1.bytesToBigInt)(keyBytes) >= startKey) {
+                        inRange = true;
+                    }
+                    else {
+                        return;
+                    }
+                }
+                if (limit === undefined || valueCount < limit) {
+                    values[(0, util_1.bytesToHex)(keyBytes)] = (0, util_1.bytesToHex)(node._value);
+                    valueCount++;
+                }
+                else if (valueCount === limit) {
+                    nextKey = (0, util_1.bytesToHex)(keyBytes);
+                }
+            }
+        });
+        return {
+            values,
+            nextKey,
+        };
+    }
+}
+exports.MerklePatriciaTrie = MerklePatriciaTrie;
+//# sourceMappingURL=mpt.js.map