@brightchain/brightchain-lib 0.29.21 → 0.29.22

package/src/lib/ledger/incrementalMerkleTree.js

@@ -0,0 +1,372 @@
+"use strict";
+/**
+ * @fileoverview IncrementalMerkleTree — a frontier-based incremental Merkle tree
+ * built over SHA3-512 entry hashes.
+ *
+ * The tree supports O(log N) appends via a frontier (right-spine hashes) and
+ * maintains the full leaf list for proof generation. All binary data uses
+ * Uint8Array (no Node.js Buffer) for browser compatibility.
+ *
+ * @see Design: Merkle Tree Commitment Layer — IncrementalMerkleTree
+ * @see Requirements 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 2.1, 2.2, 14.1, 15.1, 15.2
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.IncrementalMerkleTree = void 0;
+const ledgerError_1 = require("../errors/ledgerError");
+const merkleProof_1 = require("../interfaces/ledger/merkleProof");
+/**
+ * Incremental Merkle tree using frontier-based O(log N) appends.
+ *
+ * Leaves are the entryHash (SHA3-512, 64 bytes) of each ledger entry.
+ * Internal nodes are SHA3-512(left_child || right_child).
+ * The frontier stores the root hashes of the perfect binary subtrees
+ * that compose the current tree.
+ */
+class IncrementalMerkleTree {
+    checksumService;
+    /** All leaf hashes, in order. */
+    leaves;
+    /** Frontier: right-spine hashes for incremental root computation. */
+    frontier;
+    /** Cached current root. */
+    cachedRoot;
+    /**
+     * Tracked size, independent of leaves.length.
+     * For frontier-only trees (restored via fromFrontier), leaves may be empty
+     * while _size reflects the actual number of leaves the frontier represents.
+     */
+    _size;
+    constructor(checksumService) {
+        this.checksumService = checksumService;
+        this.leaves = [];
+        this.frontier = [];
+        this.cachedRoot = null;
+        this._size = 0;
+    }
+    /**
+     * Current Merkle root. SHA3-512 of empty bytes if tree is empty.
+     * Returns the leaf hash when there is a single leaf.
+     */
+    get root() {
+        if (this._size === 0) {
+            return this.checksumService.calculateChecksum(new Uint8Array(0));
+        }
+        if (this._size === 1 && this.leaves.length === 1) {
+            return this.leaves[0];
+        }
+        if (this.cachedRoot !== null) {
+            return this.cachedRoot;
+        }
+        this.cachedRoot = this.computeRootFromFrontier();
+        return this.cachedRoot;
+    }
+    /** Number of leaves in the tree. */
+    get size() {
+        return this._size;
+    }
+    /** Current frontier (right-spine hashes). Returns a copy. */
+    get currentFrontier() {
+        return [...this.frontier];
+    }
+    /**
+     * Append a new leaf hash. Updates frontier and root in O(log N).
+     *
+     * Algorithm (trailing-ones merge):
+     *   1. Push leafHash onto frontier
+     *   2. Increment size
+     *   3. Count trailing 1-bits in binary(size) = mergeCount
+     *   4. For mergeCount iterations: pop right, pop left, push SHA3-512(left || right)
+     *   5. Recompute cachedRoot from frontier
+     */
+    append(leafHash) {
+        this.leaves.push(leafHash);
+        this.frontier.push(leafHash);
+        this._size++;
+        const mergeCount = this.trailingZeros(this._size);
+        for (let i = 0; i < mergeCount; i++) {
+            const right = this.frontier.pop();
+            const left = this.frontier.pop();
+            this.frontier.push(this.hashPair(left, right));
+        }
+        this.cachedRoot = this.computeRootFromFrontier();
+    }
+    /**
+     * Generate an inclusion proof for the leaf at the given index.
+     *
+     * Uses the RFC 6962 recursive decomposition: split the N leaves into
+     * a left subtree of size k (largest power of 2 < N) and a right subtree
+     * of size N-k. Recurse into whichever subtree contains the target leaf,
+     * recording the sibling subtree's hash at each level.
+     *
+     * This guarantees path length = ceil(log2(N)), or 0 when N = 1.
+     *
+     * @param leafIndex - Zero-based index of the leaf
+     * @returns An IMerkleProof with the authentication path from leaf to root
+     * @throws LedgerError(MerkleProofFailed) if leafIndex is out of range
+     *
+     * @see Requirements 3.1, 3.2, 3.3, 3.4, 14.2
+     */
+    getInclusionProof(leafIndex) {
+        const n = this._size;
+        if (n === 0 || leafIndex < 0 || leafIndex >= n || leafIndex >= this.leaves.length) {
+            throw new ledgerError_1.LedgerError(ledgerError_1.LedgerErrorType.MerkleProofFailed, `Leaf index ${leafIndex} is out of range [0, ${n})`);
+        }
+        // Single leaf — proof path is empty
+        if (n === 1) {
+            return {
+                leafHash: this.leaves[0],
+                leafIndex: 0,
+                treeSize: 1,
+                path: [],
+            };
+        }
+        const path = [];
+        this.buildInclusionPath(this.leaves, leafIndex, path);
+        // buildInclusionPath produces root-to-leaf order; reverse for leaf-to-root
+        path.reverse();
+        return {
+            leafHash: this.leaves[leafIndex],
+            leafIndex,
+            treeSize: n,
+            path,
+        };
+    }
+    /**
+     * Generate a consistency proof between an earlier tree size M and the current
+     * tree size N.
+     *
+     * Follows RFC 6962 Section 2.1.2: SUBPROOF(m, D[0:n], b).
+     *
+     * - M=0 or M=N → empty proof (trivially consistent)
+     * - M > N → throw LedgerError(ConsistencyProofFailed)
+     * - 0 < M < N → return minimal set of intermediate hashes
+     *
+     * @param earlierSize - The earlier tree size M
+     * @returns An IConsistencyProof with the intermediate hashes
+     * @throws LedgerError(ConsistencyProofFailed) if earlierSize > current size
+     *
+     * @see Requirements 5.1, 5.2, 5.3, 5.4, 14.3
+     */
+    getConsistencyProof(earlierSize) {
+        const n = this._size;
+        const m = earlierSize;
+        if (m > n) {
+            throw new ledgerError_1.LedgerError(ledgerError_1.LedgerErrorType.ConsistencyProofFailed, `Earlier size ${m} exceeds current size ${n}`);
+        }
+        // M=0 or M=N → trivially consistent, empty proof
+        if (m === 0 || m === n) {
+            return {
+                earlierSize: m,
+                laterSize: n,
+                hashes: [],
+            };
+        }
+        // Consistency proofs require leaves for hash computation
+        if (this.leaves.length === 0) {
+            throw new ledgerError_1.LedgerError(ledgerError_1.LedgerErrorType.ConsistencyProofFailed, 'Cannot generate consistency proof from a frontier-only tree (no leaves stored)');
+        }
+        // RFC 6962 SUBPROOF(m, D[0:n], true)
+        const hashes = [];
+        this.buildConsistencyProof(m, this.leaves.slice(0, n), true, hashes);
+        return {
+            earlierSize: m,
+            laterSize: n,
+            hashes,
+        };
+    }
+    /**
+     * Batch-construct a tree from a list of leaf hashes.
+     * Produces the same root as appending each leaf one at a time.
+     *
+     * @param leaves - Array of leaf hashes (SHA3-512 Checksums)
+     * @param checksumService - ChecksumService for hashing
+     * @returns A fully populated IncrementalMerkleTree
+     *
+     * @see Requirements 2.3, 2.4, 8.2, 14.5
+     */
+    static fromLeaves(leaves, checksumService) {
+        const tree = new IncrementalMerkleTree(checksumService);
+        for (const leaf of leaves) {
+            tree.append(leaf);
+        }
+        return tree;
+    }
+    /**
+     * Restore a tree from a persisted frontier and size.
+     * Creates a tree that can compute the root and accept further appends,
+     * but cannot generate inclusion or consistency proofs (no leaves stored).
+     *
+     * @param frontier - The persisted frontier (right-spine hashes)
+     * @param size - The number of leaves the frontier represents
+     * @param checksumService - ChecksumService for hashing
+     * @returns An IncrementalMerkleTree with frontier and size set, but no leaves
+     *
+     * @see Requirements 2.3, 2.4, 8.2, 14.5
+     */
+    static fromFrontier(frontier, size, checksumService) {
+        const tree = new IncrementalMerkleTree(checksumService);
+        tree.frontier = [...frontier];
+        tree._size = size;
+        tree.cachedRoot = tree.computeRootFromFrontier();
+        return tree;
+    }
+    /**
+     * Compute the Merkle root for a given set of leaves without creating
+     * a full tree instance. Pure function for verification.
+     *
+     * @param leaves - Array of leaf hashes (SHA3-512 Checksums)
+     * @param checksumService - ChecksumService for hashing
+     * @returns The Merkle root Checksum
+     *
+     * @see Requirements 2.3, 2.4, 8.2, 14.5
+     */
+    static computeRoot(leaves, checksumService) {
+        const tree = IncrementalMerkleTree.fromLeaves(leaves, checksumService);
+        return tree.root;
+    }
+    /**
+     * RFC 6962 Section 2.1.2 SUBPROOF(m, leaves, startFromOldRoot).
+     *
+     * Recursively decomposes the tree to produce the minimal set of hashes
+     * needed to prove consistency between tree sizes m and |leaves|.
+     *
+     * @param m - The earlier tree size within this subtree
+     * @param leaves - The leaves of the current subtree
+     * @param startFromOldRoot - If true, omit the hash when m == |leaves|
+     *   (because the verifier can compute it from the earlier root)
+     * @param hashes - Accumulator for the proof hashes
+     */
+    buildConsistencyProof(m, leaves, startFromOldRoot, hashes) {
+        const n = leaves.length;
+        if (m === n) {
+            // When startFromOldRoot is true, the verifier already knows this hash
+            // (it's the old root). When false, we must include it.
+            if (!startFromOldRoot) {
+                hashes.push(this.computeSubtreeHash(leaves));
+            }
+            return;
+        }
+        // k = largest power of 2 less than n
+        const k = this.largestPowerOf2LessThan(n);
+        if (m <= k) {
+            // The old tree fits entirely in the left subtree
+            this.buildConsistencyProof(m, leaves.slice(0, k), startFromOldRoot, hashes);
+            // Include the right subtree hash
+            hashes.push(this.computeSubtreeHash(leaves.slice(k)));
+        }
+        else {
+            // The old tree spans both subtrees: left is full (size k), right has m-k
+            this.buildConsistencyProof(m - k, leaves.slice(k), false, hashes);
+            // Include the left subtree hash
+            hashes.push(this.computeSubtreeHash(leaves.slice(0, k)));
+        }
+    }
+    /**
+     * Recursively build the inclusion proof path using RFC 6962 decomposition.
+     *
+     * Split leaves into left (size k = largest power of 2 < n) and right (n-k).
+     * Record the sibling subtree hash and recurse into the subtree containing
+     * the target leaf.
+     */
+    buildInclusionPath(leaves, targetIndex, path) {
+        const n = leaves.length;
+        if (n <= 1) {
+            return;
+        }
+        // k = largest power of 2 less than n
+        const k = this.largestPowerOf2LessThan(n);
+        if (targetIndex < k) {
+            // Target is in the left subtree; sibling is the right subtree hash
+            const rightHash = this.computeSubtreeHash(leaves.slice(k));
+            path.push({ hash: rightHash, direction: merkleProof_1.MerkleDirection.RIGHT });
+            this.buildInclusionPath(leaves.slice(0, k), targetIndex, path);
+        }
+        else {
+            // Target is in the right subtree; sibling is the left subtree hash
+            const leftHash = this.computeSubtreeHash(leaves.slice(0, k));
+            path.push({ hash: leftHash, direction: merkleProof_1.MerkleDirection.LEFT });
+            this.buildInclusionPath(leaves.slice(k), targetIndex - k, path);
+        }
+    }
+    /**
+     * Compute the Merkle hash of a subtree given its leaves.
+     * Uses the same RFC 6962 recursive decomposition.
+     */
+    computeSubtreeHash(leaves) {
+        const n = leaves.length;
+        if (n === 0) {
+            return this.checksumService.calculateChecksum(new Uint8Array(0));
+        }
+        if (n === 1) {
+            return leaves[0];
+        }
+        const k = this.largestPowerOf2LessThan(n);
+        const leftHash = this.computeSubtreeHash(leaves.slice(0, k));
+        const rightHash = this.computeSubtreeHash(leaves.slice(k));
+        return this.hashPair(leftHash, rightHash);
+    }
+    /**
+     * Returns the largest power of 2 that is strictly less than n.
+     * For n=2, returns 1. For n=3, returns 2. For n=5, returns 4.
+     */
+    largestPowerOf2LessThan(n) {
+        let k = 1;
+        while (k * 2 < n) {
+            k *= 2;
+        }
+        return k;
+    }
+    /**
+     * Compute the root from the frontier by folding right-to-left.
+     * SHA3-512(frontier[i] || result) for i from second-to-last down to 0.
+     */
+    computeRootFromFrontier() {
+        if (this.frontier.length === 0) {
+            return this.checksumService.calculateChecksum(new Uint8Array(0));
+        }
+        let result = this.frontier[this.frontier.length - 1];
+        for (let i = this.frontier.length - 2; i >= 0; i--) {
+            result = this.hashPair(this.frontier[i], result);
+        }
+        return result;
+    }
+    /**
+     * Hash two child nodes: SHA3-512(left || right).
+     * Concatenates the 64-byte left and right hashes, then hashes the 128-byte result.
+     */
+    hashPair(left, right) {
+        const leftBytes = left.toUint8Array();
+        const rightBytes = right.toUint8Array();
+        const combined = new Uint8Array(leftBytes.length + rightBytes.length);
+        combined.set(leftBytes, 0);
+        combined.set(rightBytes, leftBytes.length);
+        return this.checksumService.calculateChecksum(combined);
+    }
+    /**
+     * Count the number of trailing 1-bits in the binary representation of n.
+     */
+    trailingOnes(n) {
+        let count = 0;
+        while ((n & 1) === 1) {
+            count++;
+            n >>>= 1;
+        }
+        return count;
+    }
+    /**
+     * Count the number of trailing 0-bits in the binary representation of n.
+     * For n=0, returns 0.
+     */
+    trailingZeros(n) {
+        if (n === 0)
+            return 0;
+        let count = 0;
+        while ((n & 1) === 0) {
+            count++;
+            n >>>= 1;
+        }
+        return count;
+    }
+}
+exports.IncrementalMerkleTree = IncrementalMerkleTree;
+//# sourceMappingURL=incrementalMerkleTree.js.map

package/src/lib/ledger/incrementalMerkleTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"incrementalMerkleTree.js","sourceRoot":"","sources":["../../../../../brightchain-lib/src/lib/ledger/incrementalMerkleTree.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AAEH,uDAAqE;AAErE,kEAI0C;AAI1C;;;;;;;GAOG;AACH,MAAa,qBAAqB;IAcH;IAb7B,iCAAiC;IACzB,MAAM,CAAa;IAC3B,qEAAqE;IAC7D,QAAQ,CAAa;IAC7B,2BAA2B;IACnB,UAAU,CAAkB;IACpC;;;;OAIG;IACK,KAAK,CAAS;IAEtB,YAA6B,eAAgC;QAAhC,oBAAe,GAAf,eAAe,CAAiB;QAC3D,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,IAAI,IAAI;QACN,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,eAAe,CAAC,iBAAiB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,UAAU,CAAC;QACzB,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,uBAAuB,EAAE,CAAC;QACjD,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,oCAAoC;IACpC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,6DAA6D;IAC7D,IAAI,eAAe;QACjB,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,QAAkB;QACvB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAElD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAG,CAAC;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAG,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,uBAAuB,EAAE,CAAC;IACnD,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,iBAAiB,CAAC,SAAiB;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QAErB,IAAI,CAAC,KAAK,CAAC,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAClF,MAAM,IAAI,yBAAW,CACnB,6BAAe,CAAC,iBAAiB,EACjC,cAAc,SAAS,wBAAwB,CAAC,GAAG,CACpD,CAAC;QACJ,CAAC;QAED,oCAAoC;QACpC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO;gBACL,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBACxB,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,CAAC;gBACX,IAAI,EAAE,EAAE;aACT,CAAC;QACJ,CAAC;QAED,MAAM,IAAI,GAAuB,EAAE,CAAC;QACpC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAEtD,2EAA2E;QAC3E,IAAI,CAAC,OAAO,EAAE,CAAC;QAEf,OAAO;YACL,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;YAChC,SAAS;YACT,QAAQ,EAAE,CAAC;YACX,IAAI;SACL,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,mBAAmB,CAAC,WAAmB;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,MAAM,CAAC,GAAG,WAAW,CAAC;QAEtB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,yBAAW,CACnB,6BAAe,CAAC,sBAAsB,EACtC,gBAAgB,CAAC,yBAAyB,CAAC,EAAE,CAC9C,CAAC;QACJ,CAAC;QAED,iDAAiD;QACjD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO;gBACL,WAAW,EAAE,CAAC;gBACd,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,EAAE;aACX,CAAC;QACJ,CAAC;QAED,yDAAyD;QACzD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,yBAAW,CACnB,6BAAe,CAAC,sBAAsB,EACtC,gFAAgF,CACjF,CAAC;QACJ,CAAC;QAED,qCAAqC;QACrC,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAErE,OAAO;YACL,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC;YACZ,MAAM;SACP,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,UAAU,CACf,MAAkB,EAClB,eAAgC;QAEhC,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,eAAe,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,YAAY,CACjB,QAAoB,EACpB,IAAY,EACZ,eAAgC;QAEhC,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,eAAe,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,uBAAuB,EAAE,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,WAAW,CAChB,MAAkB,EAClB,eAAgC;QAEhC,MAAM,IAAI,GAAG,qBAAqB,CAAC,UAAU,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;OAWG;IACK,qBAAqB,CAC3B,CAAS,EACT,MAAkB,EAClB,gBAAyB,EACzB,MAAkB;QAElB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAExB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,sEAAsE;YACtE,uDAAuD;YACvD,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;YAC/C,CAAC;YACD,OAAO;QACT,CAAC;QAED,qCAAqC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;QAE1C,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACX,iDAAiD;YACjD,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,gBAAgB,EAAE,MAAM,CAAC,CAAC;YAC5E,iCAAiC;YACjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;aAAM,CAAC;YACN,yEAAyE;YACzE,IAAI,CAAC,qBAAqB,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;YAClE,gCAAgC;YAChC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,kBAAkB,CACxB,MAAkB,EAClB,WAAmB,EACnB,IAAwB;QAExB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACX,OAAO;QACT,CAAC;QAED,qCAAqC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;QAE1C,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,mEAAmE;YACnE,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,6BAAe,CAAC,KAAK,EAAE,CAAC,CAAC;YACjE,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;QACjE,CAAC;aAAM,CAAC;YACN,mEAAmE;YACnE,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7D,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,6BAAe,CAAC,IAAI,EAAE,CAAC,CAAC;YAC/D,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,kBAAkB,CAAC,MAAkB;QAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC,eAAe,CAAC,iBAAiB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACK,uBAAuB,CAAC,CAAS;QACvC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACjB,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;OAGG;IACK,uBAAuB;QAC7B,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,eAAe,CAAC,iBAAiB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;QAED,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,QAAQ,CAAC,IAAc,EAAE,KAAe;QAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QACtE,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC,eAAe,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,CAAS;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACrB,KAAK,EAAE,CAAC;YACR,CAAC,MAAM,CAAC,CAAC;QACX,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACK,aAAa,CAAC,CAAS;QAC7B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACtB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACrB,KAAK,EAAE,CAAC;YACR,CAAC,MAAM,CAAC,CAAC;QACX,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AArZD,sDAqZC"}

package/src/lib/ledger/ledger.d.ts

@@ -25,9 +25,12 @@
 import { SignatureUint8Array } from '@digitaldefiance/ecies-lib';
 import { BlockSize } from '../enumerations/blockSize';
 import { IAuthorizedSigner } from '../interfaces/ledger/authorizedSigner';
+import { IConsistencyProof } from '../interfaces/ledger/consistencyProof';
 import { IGovernanceAction } from '../interfaces/ledger/governanceAction';
 import { ILedgerEntry } from '../interfaces/ledger/ledgerEntry';
 import { ILedgerSigner } from '../interfaces/ledger/ledgerSigner';
+import { IMerkleProof } from '../interfaces/ledger/merkleProof';
+import { IProofVerificationResult } from '../interfaces/ledger/proofVerificationResult';
 import { IQuorumPolicy } from '../interfaces/ledger/quorumPolicy';
 import { IBlockStore } from '../interfaces/storage/blockStore';
 import { Checksum } from '../types/checksum';
@@ -51,6 +54,7 @@ export declare class Ledger {
     private readonly governanceSerializer?;
     private readonly index;
     private readonly checksumService;
+    private merkleTree;
     private _length;
     private _head;
     private _headEntryHash;
@@ -62,6 +66,11 @@ export declare class Ledger {
     get head(): Checksum | null;
     /** Current quorum policy, or undefined if governance not initialized. */
     get quorumPolicy(): IQuorumPolicy | undefined;
+    /**
+     * Current Merkle root, or null if the ledger is empty.
+     * @see Requirements 9.1, 7.1
+     */
+    get merkleRoot(): Checksum | null;
     /**
      * Append a new entry to the ledger.
      * Returns the Checksum of the stored block.
@@ -100,6 +109,26 @@ export declare class Ledger {
      * Get the most recent entry, or null if empty.
      */
     getLatestEntry(): Promise<ILedgerEntry | null>;
+    /**
+     * Get an inclusion proof for the entry at the given sequence number.
+     *
+     * @param sequenceNumber - Zero-based sequence number of the entry
+     * @returns An IMerkleProof with the authentication path from leaf to root
+     * @throws LedgerError(MerkleProofFailed) if sequenceNumber is out of range
+     *
+     * @see Requirements 9.2, 18.1
+     */
+    getInclusionProof(sequenceNumber: number): IMerkleProof;
+    /**
+     * Get a consistency proof between an earlier length and the current length.
+     *
+     * @param earlierLength - The earlier ledger length M
+     * @returns An IConsistencyProof with the intermediate hashes
+     * @throws LedgerError(ConsistencyProofFailed) if earlierLength > current length
+     *
+     * @see Requirements 9.3
+     */
+    getConsistencyProof(earlierLength: number): IConsistencyProof;
     /**
      * Handle the genesis entry for a governance-enabled ledger.
      * The payload must be a governance genesis payload containing the
@@ -119,7 +148,7 @@ export declare class Ledger {
     /**
      * Serialize the current metadata into binary.
      *
-     * Format:
+     * Format (version 0x0001):
      *   magic           4 bytes  0x4C4D4554 ("LMET")
      *   version         2 bytes  0x0001
      *   ledgerIdLength  4 bytes  uint32 BE
@@ -127,13 +156,56 @@ export declare class Ledger {
      *   length          4 bytes  uint32 BE
      *   hasHead         1 byte   0x00 or 0x01
      *   headChecksum    0|64     SHA3-512 bytes (block checksum of head)
+     *   hasMerkleRoot   1 byte   0x00 or 0x01
+     *   merkleRoot      0|64     SHA3-512 Merkle root
+     *   frontierCount   2 bytes  uint16 BE — number of frontier hashes
+     *   frontier        var      frontierCount × 64 bytes SHA3-512 hashes
      *   index entries   var      seqNum (uint32 BE) + blockChecksum (64 bytes)
+     *
+     * @see Requirements 7.1, 7.3, 8.1, 8.4
      */
     private serializeMetadata;
     /**
      * Persist the metadata block to the store under a deterministic key.
      */
     private persistMetadata;
+    /**
+     * Verify an inclusion proof against a Merkle root.
+     * Static — no Ledger instance needed. Suitable for light clients.
+     *
+     * Recomputes hashes from the leaf to the root using the proof path,
+     * then compares the result to the provided Merkle root.
+     *
+     * @param proof - The inclusion proof to verify
+     * @param merkleRoot - The expected Merkle root
+     * @returns An IProofVerificationResult indicating success or failure
+     *
+     * @see Requirements 9.4, 4.1, 4.2, 4.3, 4.4, 15.3, 18.3
+     */
+    static verifyInclusionProof(proof: IMerkleProof, merkleRoot: Checksum): IProofVerificationResult;
+    /**
+     * Verify a consistency proof between two Merkle roots.
+     * Static — no Ledger instance needed.
+     *
+     * Implements the RFC 6962 Section 2.1.4 consistency proof verification
+     * algorithm. The proof hashes are consumed in order to reconstruct both
+     * the earlier and later roots.
+     *
+     * @param proof - The consistency proof to verify
+     * @param earlierRoot - The Merkle root at the earlier length
+     * @param laterRoot - The Merkle root at the later length
+     * @param earlierLength - The earlier ledger length M
+     * @param laterLength - The later ledger length N
+     * @returns An IProofVerificationResult indicating success or failure
+     *
+     * @see Requirements 9.5, 6.1, 6.2, 6.3
+     */
+    static verifyConsistencyProof(proof: IConsistencyProof, earlierRoot: Checksum, laterRoot: Checksum, earlierLength: number, laterLength: number): IProofVerificationResult;
+    /**
+     * Hash two child nodes: SHA3-512(left || right).
+     * Helper for static verification methods.
+     */
+    private static hashChildren;
     /**
      * Load ledger state from the block store.
      *
@@ -151,8 +223,26 @@ export declare class Ledger {
      * AuthorizedSignerSet from governance entries.
      */
     private replayGovernance;
+    /**
+     * Restore the Merkle tree during `Ledger.load()`.
+     *
+     * Strategy:
+     * 1. If a Merkle root and frontier are persisted, attempt fast restoration
+     *    via `IncrementalMerkleTree.fromFrontier()`. Verify the restored root
+     *    matches the persisted root.
+     * 2. On mismatch, fall back to full reconstruction from entry hashes.
+     * 3. If no Merkle root in metadata, rebuild from all entry hashes.
+     *
+     * @see Requirements 7.2, 8.2, 8.3
+     */
+    private restoreMerkleTree;
     /**
      * Parse a metadata block's binary content.
+     *
+     * Returns the parsed fields including Merkle root and frontier
+     * so that `Ledger.load()` can restore the Merkle tree state.
+     *
+     * @see Requirements 7.2, 7.3, 8.1, 8.4
      */
     private static parseMetadata;
 }

package/src/lib/ledger/ledger.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ledger.d.ts","sourceRoot":"","sources":["../../../../../brightchain-lib/src/lib/ledger/ledger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAGjE,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAGtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAC1E,OAAO,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAE/D,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAG7C,OAAO,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AAC5E,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AA+ChE;;;;;;;;;GASG;AACH,qBAAa,MAAM;IASf,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAC;IAZxC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoC;IAC1D,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA0C;IAC1E,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,KAAK,CAAyB;IACtC,OAAO,CAAC,cAAc,CAAyB;IAC/C,OAAO,CAAC,oBAAoB,CAAoC;gBAG7C,KAAK,EAAE,WAAW,EAClB,SAAS,EAAE,SAAS,EACpB,UAAU,EAAE,qBAAqB,EACjC,QAAQ,EAAE,MAAM,EAChB,oBAAoB,CAAC,EAAE,2BAA2B,YAAA;IAKrE,4BAA4B;IAC5B,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,iEAAiE;IACjE,IAAI,IAAI,IAAI,QAAQ,GAAG,IAAI,CAE1B;IAED,yEAAyE;IACzE,IAAI,YAAY,IAAI,aAAa,GAAG,SAAS,CAE5C;IAID;;;;;;;OAOG;IACG,MAAM,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,GAAG,OAAO,CAAC,QAAQ,CAAC;IAqB3E;;;;;;OAMG;IACG,gBAAgB,CACpB,OAAO,EAAE,iBAAiB,EAAE,EAC5B,aAAa,EAAE,aAAa,EAC5B,SAAS,CAAC,EAAE;QAAE,MAAM,EAAE,aAAa,CAAC;QAAC,SAAS,EAAE,mBAAmB,CAAA;KAAE,EAAE,GACtE,OAAO,CAAC,QAAQ,CAAC;IA4FpB,wCAAwC;IACxC,aAAa,CAAC,SAAS,EAAE,UAAU,GAAG,iBAAiB,GAAG,SAAS;IAInE,kDAAkD;IAClD,oBAAoB,IAAI,iBAAiB,EAAE;IAM3C;;;OAGG;IACG,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;IAc7D;;;OAGG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAqBrE;;OAEG;IACG,cAAc,IAAI,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC;IASpD;;;;OAIG;YACW,kBAAkB;IAkDhC;;;OAGG;YACW,cAAc;IAgE5B;;;OAGG;IACH,OAAO,CAAC,kBAAkB;IAM1B;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,iBAAiB;IAwDzB;;OAEG;YACW,eAAe;IAkB7B;;;;;;;;;;OAUG;WACU,IAAI,CACf,KAAK,EAAE,WAAW,EAClB,SAAS,EAAE,SAAS,EACpB,UAAU,EAAE,qBAAqB,EACjC,QAAQ,EAAE,MAAM,EAChB,oBAAoB,CAAC,EAAE,2BAA2B,GACjD,OAAO,CAAC,MAAM,CAAC;IAuDlB;;;OAGG;YACW,gBAAgB;IAgC9B;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,aAAa;CA0G7B"}
+{"version":3,"file":"ledger.d.ts","sourceRoot":"","sources":["../../../../../brightchain-lib/src/lib/ledger/ledger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAGjE,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAGtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAC1E,OAAO,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAC1E,OAAO,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,kCAAkC,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAClE,OAAO,EACL,YAAY,EAEb,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,wBAAwB,EAAE,MAAM,8CAA8C,CAAC;AACxF,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAE/D,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAG7C,OAAO,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AAE5E,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AA+ChE;;;;;;;;;GASG;AACH,qBAAa,MAAM;IAUf,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAC;IAbxC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoC;IAC1D,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA0C;IAC1E,OAAO,CAAC,UAAU,CAAwB;IAC1C,OAAO,CAAC,OAAO,CAAK;IACpB,OAAO,CAAC,KAAK,CAAyB;IACtC,OAAO,CAAC,cAAc,CAAyB;IAC/C,OAAO,CAAC,oBAAoB,CAAoC;gBAG7C,KAAK,EAAE,WAAW,EAClB,SAAS,EAAE,SAAS,EACpB,UAAU,EAAE,qBAAqB,EACjC,QAAQ,EAAE,MAAM,EAChB,oBAAoB,CAAC,EAAE,2BAA2B,YAAA;IAOrE,4BAA4B;IAC5B,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,iEAAiE;IACjE,IAAI,IAAI,IAAI,QAAQ,GAAG,IAAI,CAE1B;IAED,yEAAyE;IACzE,IAAI,YAAY,IAAI,aAAa,GAAG,SAAS,CAE5C;IAED;;;OAGG;IACH,IAAI,UAAU,IAAI,QAAQ,GAAG,IAAI,CAKhC;IAID;;;;;;;OAOG;IACG,MAAM,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,GAAG,OAAO,CAAC,QAAQ,CAAC;IAqB3E;;;;;;OAMG;IACG,gBAAgB,CACpB,OAAO,EAAE,iBAAiB,EAAE,EAC5B,aAAa,EAAE,aAAa,EAC5B,SAAS,CAAC,EAAE;QAAE,MAAM,EAAE,aAAa,CAAC;QAAC,SAAS,EAAE,mBAAmB,CAAA;KAAE,EAAE,GACtE,OAAO,CAAC,QAAQ,CAAC;IA+FpB,wCAAwC;IACxC,aAAa,CAAC,SAAS,EAAE,UAAU,GAAG,iBAAiB,GAAG,SAAS;IAInE,kDAAkD;IAClD,oBAAoB,IAAI,iBAAiB,EAAE;IAM3C;;;OAGG;IACG,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;IAc7D;;;OAGG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAqBrE;;OAEG;IACG,cAAc,IAAI,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC;IASpD;;;;;;;;OAQG;IACH,iBAAiB,CAAC,cAAc,EAAE,MAAM,GAAG,YAAY;IAUvD;;;;;;;;OAQG;IACH,mBAAmB,CAAC,aAAa,EAAE,MAAM,GAAG,iBAAiB;IAM7D;;;;OAIG;YACW,kBAAkB;IAkDhC;;;OAGG;YACW,cAAc;IAmE5B;;;OAGG;IACH,OAAO,CAAC,kBAAkB;IAM1B;;;;;;;;;;;;;;;;;;OAkBG;IACH,OAAO,CAAC,iBAAiB;IA0FzB;;OAEG;YACW,eAAe;IAkB7B;;;;;;;;;;;;OAYG;IACH,MAAM,CAAC,oBAAoB,CACzB,KAAK,EAAE,YAAY,EACnB,UAAU,EAAE,QAAQ,GACnB,wBAAwB;IA8C3B;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CAAC,sBAAsB,CAC3B,KAAK,EAAE,iBAAiB,EACxB,WAAW,EAAE,QAAQ,EACrB,SAAS,EAAE,QAAQ,EACnB,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,GAClB,wBAAwB;IAqH3B;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,YAAY;IAe3B;;;;;;;;;;OAUG;WACU,IAAI,CACf,KAAK,EAAE,WAAW,EAClB,SAAS,EAAE,SAAS,EACpB,UAAU,EAAE,qBAAqB,EACjC,QAAQ,EAAE,MAAM,EAChB,oBAAoB,CAAC,EAAE,2BAA2B,GACjD,OAAO,CAAC,MAAM,CAAC;IAiElB;;;OAGG;YACW,gBAAgB;IAgC9B;;;;;;;;;;;OAWG;YACW,iBAAiB;IAyD/B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,aAAa;CA4J7B"}