@bsv/wallet-toolbox 1.7.13 → 1.7.15

package/mobile/node_modules/@bsv/sdk/dist/cjs/src/transaction/MerklePath.js

@@ -0,0 +1,383 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const utils_js_1 = require("../primitives/utils.js");
+const Hash_js_1 = require("../primitives/Hash.js");
+/**
+ * Represents a Merkle Path, which is used to provide a compact proof of inclusion for a
+ * transaction in a block. This class encapsulates all the details required for creating
+ * and verifying Merkle Proofs.
+ *
+ * @class MerklePath
+ * @property {number} blockHeight - The height of the block in which the transaction is included.
+ * @property {Array<Array<{offset: number, hash?: string, txid?: boolean, duplicate?: boolean}>>} path -
+ *           A tree structure representing the Merkle Path, with each level containing information
+ *           about the nodes involved in constructing the proof.
+ *
+ * @example
+ * // Creating and verifying a Merkle Path
+ * const merklePath = MerklePath.fromHex('...');
+ * const isValid = merklePath.verify(txid, chainTracker);
+ *
+ * @description
+ * The MerklePath class is useful for verifying transactions in a lightweight and efficient manner without
+ * needing the entire block data. This class offers functionalities for creating, converting,
+ * and verifying these proofs.
+ */
+class MerklePath {
+    /**
+     * Creates a MerklePath instance from a hexadecimal string.
+     *
+     * @static
+     * @param {string} hex - The hexadecimal string representation of the Merkle Path.
+     * @returns {MerklePath} - A new MerklePath instance.
+     */
+    static fromHex(hex) {
+        return MerklePath.fromBinary((0, utils_js_1.toArray)(hex, 'hex'));
+    }
+    static fromReader(reader, legalOffsetsOnly = true) {
+        const blockHeight = reader.readVarIntNum();
+        const treeHeight = reader.readUInt8();
+        // Explicitly define the type of path as an array of arrays of leaf objects
+        const path = Array(treeHeight)
+            .fill(null)
+            .map(() => []);
+        let flags, offset, nLeavesAtThisHeight;
+        for (let level = 0; level < treeHeight; level++) {
+            nLeavesAtThisHeight = reader.readVarIntNum();
+            while (nLeavesAtThisHeight > 0) {
+                offset = reader.readVarIntNum();
+                flags = reader.readUInt8();
+                const leaf = { offset };
+                if ((flags & 1) !== 0) {
+                    leaf.duplicate = true;
+                }
+                else {
+                    if ((flags & 2) !== 0) {
+                        leaf.txid = true;
+                    }
+                    leaf.hash = (0, utils_js_1.toHex)(reader.read(32).reverse());
+                }
+                // Ensure path[level] exists before pushing
+                if (!Array.isArray(path[level]) || path[level].length === 0) {
+                    path[level] = [];
+                }
+                path[level].push(leaf);
+                nLeavesAtThisHeight--;
+            }
+            // Sort the array based on the offset property
+            path[level].sort((a, b) => a.offset - b.offset);
+        }
+        return new MerklePath(blockHeight, path, legalOffsetsOnly);
+    }
+    /**
+     * Creates a MerklePath instance from a binary array.
+     *
+     * @static
+     * @param {number[]} bump - The binary array representation of the Merkle Path.
+     * @returns {MerklePath} - A new MerklePath instance.
+     */
+    static fromBinary(bump) {
+        const reader = new utils_js_1.Reader(bump);
+        return MerklePath.fromReader(reader);
+    }
+    /**
+     *
+     * @static fromCoinbaseTxid
+     *
+     * Creates a MerklePath instance for a coinbase transaction in an empty block.
+     * This edge case is difficult to retrieve from standard APIs.
+     *
+     * @param {string} txid - The coinbase txid.
+     * @param {number} height - The height of the block.
+     * @returns {MerklePath} - A new MerklePath instance which assumes the tx is in a block with no other transactions.
+     */
+    static fromCoinbaseTxidAndHeight(txid, height) {
+        return new MerklePath(height, [[{ offset: 0, hash: txid, txid: true }]]);
+    }
+    constructor(blockHeight, path, legalOffsetsOnly = true) {
+        this.blockHeight = blockHeight;
+        this.path = path;
+        // store all of the legal offsets which we expect given the txid indices.
+        const legalOffsets = Array(this.path.length)
+            .fill(0)
+            .map(() => new Set());
+        this.path.forEach((leaves, height) => {
+            if (leaves.length === 0 && height === 0) {
+                throw new Error(`Empty level at height: ${height}`);
+            }
+            const offsetsAtThisHeight = new Set();
+            leaves.forEach((leaf) => {
+                if (offsetsAtThisHeight.has(leaf.offset)) {
+                    throw new Error(`Duplicate offset: ${leaf.offset}, at height: ${height}`);
+                }
+                offsetsAtThisHeight.add(leaf.offset);
+                if (height === 0) {
+                    if (leaf.duplicate !== true) {
+                        for (let h = 1; h < this.path.length; h++) {
+                            legalOffsets[h].add((leaf.offset >> h) ^ 1);
+                        }
+                    }
+                }
+                else {
+                    if (legalOffsetsOnly && !legalOffsets[height].has(leaf.offset)) {
+                        throw new Error(`Invalid offset: ${leaf.offset}, at height: ${height}, with legal offsets: ${Array.from(legalOffsets[height]).join(', ')}`);
+                    }
+                }
+            });
+        });
+        // every txid must calculate to the same root.
+        let root;
+        this.path[0].forEach((leaf, idx) => {
+            if (idx === 0)
+                root = this.computeRoot(leaf.hash);
+            if (root !== this.computeRoot(leaf.hash)) {
+                throw new Error('Mismatched roots');
+            }
+        });
+    }
+    /**
+     * Converts the MerklePath to a binary array format.
+     *
+     * @returns {number[]} - The binary array representation of the Merkle Path.
+     */
+    toBinary() {
+        const writer = new utils_js_1.Writer();
+        writer.writeVarIntNum(this.blockHeight);
+        const treeHeight = this.path.length;
+        writer.writeUInt8(treeHeight);
+        for (let level = 0; level < treeHeight; level++) {
+            const nLeaves = Object.keys(this.path[level]).length;
+            writer.writeVarIntNum(nLeaves);
+            for (const leaf of this.path[level]) {
+                writer.writeVarIntNum(leaf.offset);
+                let flags = 0;
+                if (leaf?.duplicate === true) {
+                    flags |= 1;
+                }
+                if (leaf?.txid !== undefined && leaf.txid !== null) {
+                    flags |= 2;
+                }
+                writer.writeUInt8(flags);
+                if ((flags & 1) === 0) {
+                    writer.write((0, utils_js_1.toArray)(leaf.hash, 'hex').reverse());
+                }
+            }
+        }
+        return writer.toArray();
+    }
+    /**
+     * Converts the MerklePath to a hexadecimal string format.
+     *
+     * @returns {string} - The hexadecimal string representation of the Merkle Path.
+     */
+    toHex() {
+        return (0, utils_js_1.toHex)(this.toBinary());
+    }
+    //
+    indexOf(txid) {
+        const leaf = this.path[0].find((l) => l.hash === txid);
+        if (leaf === null || leaf === undefined) {
+            throw new Error(`Transaction ID ${txid} not found in the Merkle Path`);
+        }
+        return leaf.offset;
+    }
+    /**
+     * Computes the Merkle root from the provided transaction ID.
+     *
+     * @param {string} txid - The transaction ID to compute the Merkle root for. If not provided, the root will be computed from an unspecified branch, and not all branches will be validated!
+     * @returns {string} - The computed Merkle root as a hexadecimal string.
+     * @throws {Error} - If the transaction ID is not part of the Merkle Path.
+     */
+    computeRoot(txid) {
+        if (typeof txid !== 'string') {
+            const foundLeaf = this.path[0].find((leaf) => Boolean(leaf?.hash));
+            if (foundLeaf === null || foundLeaf === undefined) {
+                throw new Error('No valid leaf found in the Merkle Path');
+            }
+            txid = foundLeaf.hash;
+        }
+        // Find the index of the txid at the lowest level of the Merkle tree
+        if (typeof txid !== 'string') {
+            throw new Error('Transaction ID is undefined');
+        }
+        const index = this.indexOf(txid);
+        if (typeof index !== 'number') {
+            throw new Error(`This proof does not contain the txid: ${txid ?? 'undefined'}`);
+        }
+        // Calculate the root using the index as a way to determine which direction to concatenate.
+        const hash = (m) => (0, utils_js_1.toHex)((0, Hash_js_1.hash256)((0, utils_js_1.toArray)(m, 'hex').reverse()).reverse());
+        let workingHash = txid;
+        // special case for blocks with only one transaction
+        if (this.path.length === 1 && this.path[0].length === 1)
+            return workingHash;
+        for (let height = 0; height < this.path.length; height++) {
+            // eslint-disable-next-line @typescript-eslint/no-unused-vars
+            const leaves = this.path[height];
+            const offset = (index >> height) ^ 1;
+            const leaf = this.findOrComputeLeaf(height, offset);
+            if (typeof leaf !== 'object') {
+                throw new Error(`Missing hash for index ${index} at height ${height}`);
+            }
+            if (leaf.duplicate === true) {
+                workingHash = hash((workingHash ?? '') + (workingHash ?? ''));
+            }
+            else if (offset % 2 !== 0) {
+                workingHash = hash((leaf.hash ?? '') + (workingHash ?? ''));
+            }
+            else {
+                workingHash = hash((workingHash ?? '') + (leaf.hash ?? ''));
+            }
+        }
+        return workingHash;
+    }
+    /**
+     * Find leaf with `offset` at `height` or compute from level below, recursively.
+     *
+     * Does not add computed leaves to path.
+     *
+     * @param height
+     * @param offset
+     */
+    findOrComputeLeaf(height, offset) {
+        const hash = (m) => (0, utils_js_1.toHex)((0, Hash_js_1.hash256)((0, utils_js_1.toArray)(m, 'hex').reverse()).reverse());
+        let leaf = this.path[height].find((l) => l.offset === offset);
+        if (leaf != null)
+            return leaf;
+        if (height === 0)
+            return undefined;
+        const h = height - 1;
+        const l = offset << 1;
+        const leaf0 = this.findOrComputeLeaf(h, l);
+        if (leaf0 == null || leaf0.hash == null || leaf0.hash === '')
+            return undefined;
+        const leaf1 = this.findOrComputeLeaf(h, l + 1);
+        if (leaf1 == null)
+            return undefined;
+        let workinghash;
+        if (leaf1.duplicate === true) {
+            workinghash = hash(leaf0.hash + leaf0.hash);
+        }
+        else {
+            workinghash = hash((leaf1.hash ?? '') + (leaf0.hash ?? ''));
+        }
+        leaf = {
+            offset,
+            hash: workinghash
+        };
+        return leaf;
+    }
+    /**
+     * Verifies if the given transaction ID is part of the Merkle tree at the specified block height.
+     *
+     * @param {string} txid - The transaction ID to verify.
+     * @param {ChainTracker} chainTracker - The ChainTracker instance used to verify the Merkle root.
+     * @returns {boolean} - True if the transaction ID is valid within the Merkle Path at the specified block height.
+     */
+    async verify(txid, chainTracker) {
+        const root = this.computeRoot(txid);
+        if (this.indexOf(txid) === 0) {
+            // Coinbase transaction outputs can only be spent once they're 100 blocks deep.
+            const height = await chainTracker.currentHeight();
+            if (this.blockHeight + 100 < height) {
+                return false;
+            }
+        }
+        // Use the chain tracker to determine whether this is a valid merkle root at the given block height
+        return await chainTracker.isValidRootForHeight(root, this.blockHeight);
+    }
+    /**
+     * Combines this MerklePath with another to create a compound proof.
+     *
+     * @param {MerklePath} other - Another MerklePath to combine with this path.
+     * @throws {Error} - If the paths have different block heights or roots.
+     */
+    combine(other) {
+        if (this.blockHeight !== other.blockHeight) {
+            throw new Error('You cannot combine paths which do not have the same block height.');
+        }
+        const root1 = this.computeRoot();
+        const root2 = other.computeRoot();
+        if (root1 !== root2) {
+            throw new Error('You cannot combine paths which do not have the same root.');
+        }
+        const combinedPath = [];
+        for (let h = 0; h < this.path.length; h++) {
+            combinedPath.push([]);
+            for (let l = 0; l < this.path[h].length; l++) {
+                combinedPath[h].push(this.path[h][l]);
+            }
+            for (let l = 0; l < other.path[h].length; l++) {
+                if (combinedPath[h].find((leaf) => leaf.offset === other.path[h][l].offset) === undefined) {
+                    combinedPath[h].push(other.path[h][l]);
+                }
+                else {
+                    // Ensure that any elements which appear in both are not downgraded to a non txid.
+                    if (other.path[h][l]?.txid !== undefined && other.path[h][l]?.txid !== null) {
+                        const target = combinedPath[h].find((leaf) => leaf.offset === other.path[h][l].offset);
+                        if (target !== null && target !== undefined) {
+                            target.txid = true;
+                        }
+                    }
+                }
+            }
+        }
+        this.path = combinedPath;
+        this.trim();
+    }
+    /**
+     * Remove all internal nodes that are not required by level zero txid nodes.
+     * Assumes that at least all required nodes are present.
+     * Leaves all levels sorted by increasing offset.
+     */
+    trim() {
+        const pushIfNew = (v, a) => {
+            if (a.length === 0 || a.slice(-1)[0] !== v) {
+                a.push(v);
+            }
+        };
+        const dropOffsetsFromLevel = (dropOffsets, level) => {
+            for (let i = dropOffsets.length; i >= 0; i--) {
+                const l = this.path[level].findIndex((n) => n.offset === dropOffsets[i]);
+                if (l >= 0) {
+                    this.path[level].splice(l, 1);
+                }
+            }
+        };
+        const nextComputedOffsets = (cos) => {
+            const ncos = [];
+            for (const o of cos) {
+                pushIfNew(o >> 1, ncos);
+            }
+            return ncos;
+        };
+        let computedOffsets = []; // in next level
+        let dropOffsets = [];
+        for (let h = 0; h < this.path.length; h++) {
+            // Sort each level by increasing offset order
+            this.path[h].sort((a, b) => a.offset - b.offset);
+        }
+        for (let l = 0; l < this.path[0].length; l++) {
+            const n = this.path[0][l];
+            if (n.txid === true) {
+                // level 0 must enable computing level 1 for txid nodes
+                pushIfNew(n.offset >> 1, computedOffsets);
+            }
+            else {
+                const isOdd = n.offset % 2 === 1;
+                const peer = this.path[0][l + (isOdd ? -1 : 1)];
+                if (peer.txid === undefined || peer.txid === null || !peer.txid) {
+                    // drop non-txid level 0 nodes without a txid peer
+                    pushIfNew(peer.offset, dropOffsets);
+                }
+            }
+        }
+        dropOffsetsFromLevel(dropOffsets, 0);
+        for (let h = 1; h < this.path.length; h++) {
+            dropOffsets = computedOffsets;
+            computedOffsets = nextComputedOffsets(computedOffsets);
+            dropOffsetsFromLevel(dropOffsets, h);
+        }
+    }
+}
+exports.default = MerklePath;
+//# sourceMappingURL=MerklePath.js.map

package/mobile/node_modules/@bsv/sdk/dist/cjs/src/transaction/MerklePath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MerklePath.js","sourceRoot":"","sources":["../../../../src/transaction/MerklePath.ts"],"names":[],"mappings":";;AACA,qDAAuE;AACvE,mDAA+C;AAU/C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAqB,UAAU;IAW7B;;;;;;OAMG;IACH,MAAM,CAAC,OAAO,CAAE,GAAW;QACzB,OAAO,UAAU,CAAC,UAAU,CAAC,IAAA,kBAAO,EAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;IACnD,CAAC;IAED,MAAM,CAAC,UAAU,CACf,MAAc,EACd,mBAA4B,IAAI;QAEhC,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;QAC1C,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,EAAE,CAAA;QACrC,2EAA2E;QAC3E,MAAM,IAAI,GAAyF,KAAK,CAAC,UAAU,CAAC;aACjH,IAAI,CAAC,IAAI,CAAC;aACV,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAA;QAChB,IAAI,KAAa,EAAE,MAAc,EAAE,mBAA2B,CAAA;QAC9D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;YAChD,mBAAmB,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;YAC5C,OAAO,mBAAmB,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;gBAC/B,KAAK,GAAG,MAAM,CAAC,SAAS,EAAE,CAAA;gBAC1B,MAAM,IAAI,GAKN,EAAE,MAAM,EAAE,CAAA;gBACd,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;oBACtB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;gBACvB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;wBACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;oBAClB,CAAC;oBACD,IAAI,CAAC,IAAI,GAAG,IAAA,gBAAK,EAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;gBAC9C,CAAC;gBACD,2CAA2C;gBAC3C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC5D,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAA;gBAClB,CAAC;gBACD,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACtB,mBAAmB,EAAE,CAAA;YACvB,CAAC;YACD,8CAA8C;YAC9C,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;QACjD,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAA;IAC5D,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,UAAU,CAAE,IAAc;QAC/B,MAAM,MAAM,GAAG,IAAI,iBAAM,CAAC,IAAI,CAAC,CAAA;QAC/B,OAAO,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;IACtC,CAAC;IAED;;;;;;;;;;OAUG;IACH,MAAM,CAAC,yBAAyB,CAAE,IAAY,EAAE,MAAc;QAC5D,OAAO,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IAC1E,CAAC;IAED,YACE,WAAmB,EACnB,IAOC,EACD,mBAA4B,IAAI;QAEhC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAA;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAEhB,yEAAyE;QACzE,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;aACzC,IAAI,CAAC,CAAC,CAAC;aACP,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,CAAA;QACvB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE;YACnC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,EAAE,CAAC,CAAA;YACrD,CAAC;YACD,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAE,CAAA;YACrC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;gBACtB,IAAI,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBACzC,MAAM,IAAI,KAAK,CACb,qBAAqB,IAAI,CAAC,MAAM,gBAAgB,MAAM,EAAE,CACzD,CAAA;gBACH,CAAC;gBACD,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACpC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;oBACjB,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;wBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC1C,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;wBAC7C,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,gBAAgB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC/D,MAAM,IAAI,KAAK,CACb,mBAAmB,IAAI,CAAC,MAAM,gBAAgB,MAAM,yBAAyB,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC3H,CAAA;oBACH,CAAC;gBACH,CAAC;YACH,CAAC,CAAC,CAAA;QACJ,CAAC,CAAC,CAAA;QAEF,8CAA8C;QAC9C,IAAI,IAAY,CAAA;QAChB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YACjC,IAAI,GAAG,KAAK,CAAC;gBAAE,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACjD,IAAI,IAAI,KAAK,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzC,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAA;YACrC,CAAC;QACH,CAAC,CAAC,CAAA;IACJ,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,MAAM,MAAM,GAAG,IAAI,iBAAM,EAAE,CAAA;QAC3B,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QACvC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAA;QACnC,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAA;QAC7B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC;YAChD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAA;YACpD,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAA;YAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBAClC,IAAI,KAAK,GAAG,CAAC,CAAA;gBACb,IAAI,IAAI,EAAE,SAAS,KAAK,IAAI,EAAE,CAAC;oBAC7B,KAAK,IAAI,CAAC,CAAA;gBACZ,CAAC;gBACD,IAAI,IAAI,EAAE,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBACnD,KAAK,IAAI,CAAC,CAAA;gBACZ,CAAC;gBACD,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;gBACxB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,KAAK,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,OAAO,EAAE,CAAA;IACzB,CAAC;IAED;;;;OAIG;IACH,KAAK;QACH,OAAO,IAAA,gBAAK,EAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;IAC/B,CAAC;IAED,EAAE;IACM,OAAO,CAAE,IAAY;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;QACtD,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,+BAA+B,CAAC,CAAA;QACxE,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAE,IAAa;QACxB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;YAClE,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAClD,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;YAC3D,CAAC;YACD,IAAI,GAAG,SAAS,CAAC,IAAI,CAAA;QACvB,CAAC;QACD,oEAAoE;QACpE,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAA;QAChD,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QAChC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAI,IAAI,WAAW,EAAE,CAAC,CAAA;QACjF,CAAC;QACD,2FAA2F;QAC3F,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CACjC,IAAA,gBAAK,EAAC,IAAA,iBAAO,EAAC,IAAA,kBAAO,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;QACvD,IAAI,WAAW,GAAG,IAAI,CAAA;QAEtB,oDAAoD;QACpD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,WAAW,CAAA;QAE3E,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;YACzD,6DAA6D;YAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAChC,MAAM,MAAM,GAAG,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,CAAC,CAAA;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;YACnD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC7B,MAAM,IAAI,KAAK,CAAC,0BAA0B,KAAK,cAAc,MAAM,EAAE,CAAC,CAAA;YACxE,CAAC;YACD,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC5B,WAAW,GAAG,IAAI,CAAC,CAAC,WAAW,IAAI,EAAE,CAAC,GAAG,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,CAAA;YAC/D,CAAC;iBAAM,IAAI,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,WAAW,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,CAAA;YAC7D,CAAC;iBAAM,CAAC;gBACN,WAAW,GAAG,IAAI,CAAC,CAAC,WAAW,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAA;YAC7D,CAAC;QACH,CAAC;QACD,OAAO,WAAW,CAAA;IACpB,CAAC;IAED;;;;;;;OAOG;IACH,iBAAiB,CACf,MAAc,EACd,MAAc;QAEd,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CACjC,IAAA,gBAAK,EAAC,IAAA,iBAAO,EAAC,IAAA,kBAAO,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;QAEvD,IAAI,IAAI,GAA+B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAC3D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAC3B,CAAA;QAED,IAAI,IAAI,IAAI,IAAI;YAAE,OAAO,IAAI,CAAA;QAE7B,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAA;QAElC,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAA;QACpB,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,CAAA;QAErB,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC1C,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,KAAK,EAAE;YAAE,OAAO,SAAS,CAAA;QAE9E,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC9C,IAAI,KAAK,IAAI,IAAI;YAAE,OAAO,SAAS,CAAA;QAEnC,IAAI,WAAmB,CAAA;QACvB,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC7B,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAA;QAC7C,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAA;QAC7D,CAAC;QACD,IAAI,GAAG;YACL,MAAM;YACN,IAAI,EAAE,WAAW;SAClB,CAAA;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,MAAM,CAAE,IAAY,EAAE,YAA0B;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACnC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,+EAA+E;YAC/E,MAAM,MAAM,GAAG,MAAM,YAAY,CAAC,aAAa,EAAE,CAAA;YACjD,IAAI,IAAI,CAAC,WAAW,GAAG,GAAG,GAAG,MAAM,EAAE,CAAC;gBACpC,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,mGAAmG;QACnG,OAAO,MAAM,YAAY,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;IACxE,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAE,KAAiB;QACxB,IAAI,IAAI,CAAC,WAAW,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC;YAC3C,MAAM,IAAI,KAAK,CACb,mEAAmE,CACpE,CAAA;QACH,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QAChC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAA;QACjC,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CACb,2DAA2D,CAC5D,CAAA;QACH,CAAC;QACD,MAAM,YAAY,GAAyF,EAAE,CAAA;QAC7G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACvC,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,IACE,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAClB,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAClD,KAAK,SAAS,EACf,CAAC;oBACD,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBACxC,CAAC;qBAAM,CAAC;oBACN,kFAAkF;oBAClF,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,IAAI,EAAE,CAAC;wBAC5E,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CACjC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAClD,CAAA;wBACD,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;4BAC5C,MAAM,CAAC,IAAI,GAAG,IAAI,CAAA;wBACpB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,YAAY,CAAA;QACxB,IAAI,CAAC,IAAI,EAAE,CAAA;IACb,CAAC;IAED;;;;OAIG;IACH,IAAI;QACF,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAW,EAAQ,EAAE;YACjD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACX,CAAC;QACH,CAAC,CAAA;QAED,MAAM,oBAAoB,GAAG,CAAC,WAAqB,EAAE,KAAa,EAAQ,EAAE;YAC1E,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,CACnC,CAAA;gBACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACX,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAC/B,CAAC;YACH,CAAC;QACH,CAAC,CAAA;QAED,MAAM,mBAAmB,GAAG,CAAC,GAAa,EAAY,EAAE;YACtD,MAAM,IAAI,GAAa,EAAE,CAAA;YACzB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;gBACpB,SAAS,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAA;YACzB,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC,CAAA;QAED,IAAI,eAAe,GAAa,EAAE,CAAA,CAAC,gBAAgB;QACnD,IAAI,WAAW,GAAa,EAAE,CAAA;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,6CAA6C;YAC7C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;QAClD,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACzB,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACpB,uDAAuD;gBACvD,SAAS,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,eAAe,CAAC,CAAA;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAA;gBAChC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;oBAChE,kDAAkD;oBAClD,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QACD,oBAAoB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAA;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,WAAW,GAAG,eAAe,CAAA;YAC7B,eAAe,GAAG,mBAAmB,CAAC,eAAe,CAAC,CAAA;YACtD,oBAAoB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;CACF;AAraD,6BAqaC"}