@bsv/sdk 1.0.29 → 1.0.31

package/dist/cjs/src/transaction/MerklePath.js

@@ -0,0 +1,239 @@
+"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) {
+        const blockHeight = reader.readVarIntNum();
+        const treeHeight = reader.readUInt8();
+        const path = Array(treeHeight).fill(0).map(() => ([]));
+        let flags, offset, nLeavesAtThisHeight;
+        for (let level = 0; level < treeHeight; level++) {
+            nLeavesAtThisHeight = reader.readVarIntNum();
+            while (nLeavesAtThisHeight) {
+                offset = reader.readVarIntNum();
+                flags = reader.readUInt8();
+                const leaf = { offset };
+                if (flags & 1) {
+                    leaf.duplicate = true;
+                }
+                else {
+                    if (flags & 2) {
+                        leaf.txid = true;
+                    }
+                    leaf.hash = (0, utils_js_1.toHex)(reader.read(32).reverse());
+                }
+                path[level].push(leaf);
+                nLeavesAtThisHeight--;
+            }
+            path[level].sort((a, b) => a.offset - b.offset);
+        }
+        return new MerklePath(blockHeight, path);
+    }
+    /**
+     * 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);
+    }
+    constructor(blockHeight, path) {
+        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.map((leaves, height) => {
+            if (leaves.length === 0) {
+                throw new Error(`Empty level at height: ${height}`);
+            }
+            const offsetsAtThisHeight = new Set();
+            leaves.map(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) {
+                        for (let h = 1; h < this.path.length; h++) {
+                            legalOffsets[h].add(leaf.offset >> h ^ 1);
+                        }
+                    }
+                }
+                else {
+                    if (!legalOffsets[height].has(leaf.offset)) {
+                        throw new Error(`Invalid offset: ${leaf.offset}, at height: ${height}, with legal offsets: ${Array.from(legalOffsets[height]).join(', ')}`);
+                    }
+                }
+            });
+        });
+        let root;
+        // every txid must calculate to the same root.
+        this.path[0].map((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 === null || leaf === void 0 ? void 0 : leaf.duplicate) {
+                    flags |= 1;
+                }
+                if (leaf === null || leaf === void 0 ? void 0 : leaf.txid) {
+                    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());
+    }
+    /**
+     * 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') {
+            txid = this.path[0].find(leaf => Boolean(leaf === null || leaf === void 0 ? void 0 : leaf.hash)).hash;
+        }
+        // Find the index of the txid at the lowest level of the Merkle tree
+        const index = this.path[0].find(l => l.hash === txid).offset;
+        if (typeof index !== 'number') {
+            throw new Error(`This proof does not contain the txid: ${txid}`);
+        }
+        // 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;
+        for (let height = 0; height < this.path.length; height++) {
+            const leaves = this.path[height];
+            const offset = index >> height ^ 1;
+            const leaf = leaves.find(l => l.offset === offset);
+            if (typeof leaf !== 'object') {
+                throw new Error(`Missing hash for index ${index} at height ${height}`);
+            }
+            if (leaf.duplicate) {
+                workingHash = hash(workingHash + workingHash);
+            }
+            else if (offset % 2 !== 0) {
+                workingHash = hash(leaf.hash + workingHash);
+            }
+            else {
+                workingHash = hash(workingHash + leaf.hash);
+            }
+        }
+        return workingHash;
+    }
+    /**
+     * 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);
+        // 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) {
+        var _a;
+        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)) {
+                    combinedPath[h].push(other.path[h][l]);
+                }
+                else {
+                    // Ensure that any elements which appear in both are not downgraded to a non txid.
+                    if ((_a = other.path[h][l]) === null || _a === void 0 ? void 0 : _a.txid) {
+                        combinedPath[h].find(leaf => leaf.offset === other.path[h][l]).txid = true;
+                    }
+                }
+            }
+        }
+        this.path = combinedPath;
+    }
+}
+exports.default = MerklePath;
+//# sourceMappingURL=MerklePath.js.map

package/dist/cjs/src/transaction/MerklePath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MerklePath.js","sourceRoot":"","sources":["../../../../src/transaction/MerklePath.ts"],"names":[],"mappings":";;AAAA,qDAAuE;AACvE,mDAA+C;AAG/C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAqB,UAAU;IAS7B;;;;;;OAMG;IACH,MAAM,CAAC,OAAO,CAAC,GAAW;QACxB,OAAO,UAAU,CAAC,UAAU,CAAC,IAAA,kBAAO,EAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;IACnD,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,MAAc;QAC9B,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;QAC1C,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,EAAE,CAAA;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACtD,IAAI,KAAK,EAAE,MAAM,EAAE,mBAAmB,CAAA;QACtC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,EAAE,KAAK,EAAE,EAAE;YAC/C,mBAAmB,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;YAC5C,OAAO,mBAAmB,EAAE;gBAC1B,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,KAAK,GAAG,CAAC,EAAE;oBACb,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;iBACtB;qBAAM;oBACL,IAAI,KAAK,GAAG,CAAC,EAAE;wBACb,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;qBACjB;oBACD,IAAI,CAAC,IAAI,GAAG,IAAA,gBAAK,EAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;iBAC7C;gBACD,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACtB,mBAAmB,EAAE,CAAA;aACtB;YACD,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAA;SAChD;QACD,OAAO,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,CAAA;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,UAAU,CAAC,IAAc;QAC9B,MAAM,MAAM,GAAG,IAAI,iBAAM,CAAC,IAAI,CAAC,CAAA;QAC/B,OAAO,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;IACtC,CAAC;IAED,YAAY,WAAmB,EAAE,IAK9B;QACD,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,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,CAAA;QACzE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE;YAC/B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;gBACvB,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,EAAE,CAAC,CAAA;aACpD;YACD,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAE,CAAA;YACrC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBAChB,IAAI,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;oBAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,IAAI,CAAC,MAAM,gBAAgB,MAAM,EAAE,CAAC,CAAA;gBACnH,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACpC,IAAI,MAAM,KAAK,CAAC,EAAE;oBAChB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;wBACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACzC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;yBAC1C;qBACF;iBACF;qBAAM;oBACL,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;wBAC1C,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,CAAC,MAAM,gBAAgB,MAAM,yBAAyB,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;qBAC5I;iBACF;YACH,CAAC,CAAC,CAAA;QACJ,CAAC,CAAC,CAAA;QAEF,IAAI,IAAY,CAAA;QAChB,8CAA8C;QAC9C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC7B,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;gBACxC,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAA;aACpC;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;YAC/C,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;gBACnC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBAClC,IAAI,KAAK,GAAG,CAAC,CAAA;gBACb,IAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,SAAS,EAAE;oBACnB,KAAK,IAAI,CAAC,CAAA;iBACX;gBACD,IAAI,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,EAAE;oBACd,KAAK,IAAI,CAAC,CAAA;iBACX;gBACD,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;gBACxB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE;oBACrB,MAAM,CAAC,KAAK,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;iBAClD;aACF;SACF;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;;;;;;OAMG;IACH,WAAW,CAAC,IAAa;QACvB,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;YAC5B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,aAAJ,IAAI,uBAAJ,IAAI,CAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;SAC3D;QACD,oEAAoE;QACpE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,MAAM,CAAA;QAC5D,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;YAC7B,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAI,EAAE,CAAC,CAAA;SACjE;QACD,2FAA2F;QAC3F,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,IAAA,gBAAK,EAAC,CACxC,IAAA,iBAAO,EAAC,IAAA,kBAAO,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CACrC,CAAC,OAAO,EAAE,CAAC,CAAA;QACZ,IAAI,WAAW,GAAG,IAAI,CAAA;QACtB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAChC,MAAM,MAAM,GAAG,KAAK,IAAI,MAAM,GAAG,CAAC,CAAA;YAClC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAA;YAClD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;gBAC5B,MAAM,IAAI,KAAK,CAAC,0BAA0B,KAAK,cAAc,MAAM,EAAE,CAAC,CAAA;aACvE;YACD,IAAI,IAAI,CAAC,SAAS,EAAE;gBAClB,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC,CAAA;aAC9C;iBAAM,IAAI,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE;gBAC3B,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC,CAAA;aAC5C;iBAAM;gBACL,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;aAC5C;SACF;QACD,OAAO,WAAW,CAAA;IACpB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,MAAM,CAAC,IAAY,EAAE,YAA0B;QACnD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;QACnC,mGAAmG;QACnG,OAAO,MAAM,YAAY,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;IACxE,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,KAAiB;;QACvB,IAAI,IAAI,CAAC,WAAW,KAAK,KAAK,CAAC,WAAW,EAAE;YAC1C,MAAM,IAAI,KAAK,CAAC,mEAAmE,CAAC,CAAA;SACrF;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;QAChC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAA;QACjC,IAAI,KAAK,KAAK,KAAK,EAAE;YACnB,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAA;SAC7E;QACD,MAAM,YAAY,GAAG,EAAE,CAAA;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,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;gBAC5C,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;aACtC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7C,IAAI,CAAE,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAa,EAAE;oBACvF,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;iBACvC;qBAAM;oBACL,kFAAkF;oBAClF,IAAI,MAAA,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,0CAAE,IAAI,EAAE;wBAC1B,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAA;qBAC3E;iBACF;aACF;SACF;QACD,IAAI,CAAC,IAAI,GAAG,YAAY,CAAA;IAC1B,CAAC;CACF;AAzOD,6BAyOC"}