@flarenetwork/flare-periphery-contract-artifacts 0.1.0 → 0.1.2

package/dist/coston/StateConnector/libs/ts/AttestationResponse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AttestationResponse.d.ts","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/AttestationResponse.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,oBAAY,yBAAyB;IACjC;;OAEG;IACH,KAAK,UAAU;IACf;;OAEG;IACH,OAAO,YAAY;IACnB;;OAEG;IACH,aAAa,kBAAkB;CAClC;AACD;;;;GAIG;AAEH,qBAAa,mBAAmB,CAAC,GAAG;IAChC;;OAEG;IACH,MAAM,EAAG,yBAAyB,CAAC;IACnC;;OAEG;IACH,QAAQ,CAAC,EAAE,GAAG,CAAC;CAClB"}

package/dist/coston/StateConnector/libs/ts/AttestationResponse.js

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AttestationResponse = exports.AttestationResponseStatus = void 0;
+/**
+ * Attestation status
+ */
+var AttestationResponseStatus;
+(function (AttestationResponseStatus) {
+    /**
+     * Attestation request is valid.
+     */
+    AttestationResponseStatus["VALID"] = "VALID";
+    /**
+     * Attestation request is invalid.
+     */
+    AttestationResponseStatus["INVALID"] = "INVALID";
+    /**
+     * Attestation request cannot be confirmed neither rejected by the verifier at the moment.
+     */
+    AttestationResponseStatus["INDETERMINATE"] = "INDETERMINATE";
+})(AttestationResponseStatus || (exports.AttestationResponseStatus = AttestationResponseStatus = {}));
+/**
+ * Object returned as a result of attestation.
+ * If status is 'VALID' then parameters @param response contains attestation response.
+ * Otherwise, @param response is undefined.
+ */
+class AttestationResponse {
+}
+exports.AttestationResponse = AttestationResponse;
+//# sourceMappingURL=AttestationResponse.js.map

package/dist/coston/StateConnector/libs/ts/AttestationResponse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AttestationResponse.js","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/AttestationResponse.ts"],"names":[],"mappings":";;;AAAA;;GAEG;AACH,IAAY,yBAaX;AAbD,WAAY,yBAAyB;IACjC;;OAEG;IACH,4CAAe,CAAA;IACf;;OAEG;IACH,gDAAmB,CAAA;IACnB;;OAEG;IACH,4DAA+B,CAAA;AACnC,CAAC,EAbW,yBAAyB,yCAAzB,yBAAyB,QAapC;AACD;;;;GAIG;AAEH,MAAa,mBAAmB;CAS/B;AATD,kDASC"}

package/dist/coston/StateConnector/libs/ts/MerkleTree.d.ts

@@ -0,0 +1,103 @@
+/**
+ * There are several variants for hashing sequences in Merkle trees in cases when there is odd number of hashes on some level.
+ * - Bitcoin hashes remaining hash with itself
+ * - Ethereum community was considering this:
+ *     https://github.com/proofchains/python-proofmarshal/blob/efe9b58921b9a306f2b3552c30b84e1043ab866f/proofmarshal/mmr.py#L96
+ * - This review shows various options and in particular it describes the "Monero way", which gives balanced trees but they
+ *   had some issues with bugs
+ *     https://medium.com/coinmonks/merkle-trees-concepts-and-use-cases-5da873702318
+ *
+ * The current implementation is a derivation and simplification of "Monero" way. It uses ideas
+ * from binary heaps represented in array. This significantly simplifies the construction both of a Merkle tree and a proof.
+ *
+ * Important formulas for a left-aligned full tree represented in an array for n hashes as leafs
+ * - array has exactly 2*n - 1 nodes (n leafs other internal)
+ * - array[0] is merkle root, array[n-1, ..., 2*n - 2] contains leaf hashes in order
+ * - given tree array of length l = 2*n - 1, then n = floor((l + 1)/2) --- be careful with 1 element
+ * - parent(i) = Math.floor((i - 1) / 2);
+ * - left(i) = 2*i + 1
+ * - right(i) = 2*i + 2
+ *
+ * Importants: all input strings should represent bytes32, hence should be 32-byte padded hex strings.
+ */
+/**
+ * Single value hash function. Uses keccak function compatible with the one used in Solidity
+ * It is supposed to be used with `0x`-prefixed 32-byte strings as hex values
+ * @param val input hash in form of the string `0x` prefixed.
+ * @returns hash of the input value
+ */
+export declare function singleHash(val: string): string;
+/**
+ * Helper function for constructing the commit hash used with StateConnector.sol contract
+ * @param merkleRoot merkle root (`0x`-prefixed 32-byte hex string)
+ * @param randomNumber secure random number (`0x`-prefixed 32-byte hex string)
+ * @param address addres (`0x`-prefixed 20-byte hex string)
+ * @returns `0x`-prefixed 32-byte hex string (hash)
+ */
+export declare function commitHash(merkleRoot: string, randomNumber: string, address: string): string;
+/**
+ * A sorted hash of two 32-byte strings
+ * @param x first `0x`-prefixed 32-byte hex string
+ * @param y second `0x`-prefixed 32-byte hex string
+ * @returns the sorted hash
+ */
+export declare function sortedHashPair(x: string, y: string): string;
+/**
+ * Merkle tree implementation with all the helper function for constructing the tree and extracting the root and proofs for every leaf.
+ */
+export declare class MerkleTree {
+    _tree: string[];
+    constructor(values: string[]);
+    /**
+     * Merkle root
+     */
+    get root(): string | undefined;
+    /**
+     * The array representing full tree (length is `2*hashCount - 1`)
+     */
+    get tree(): string[];
+    /**
+     * Number of leaves in the Merkle tree
+     */
+    get hashCount(): number;
+    /**
+     * Returns leaves in array of the length `hashCount` sorted as `0x`-prefixed 32-byte hex strings.
+     */
+    get sortedHashes(): string[];
+    /**
+     * Parent index of the node at index `i` in array
+     * @param i index of a node in the Merkle tree
+     * @returns parent index
+     */
+    parent(i: number): number;
+    /**
+     * Given an array of leave hashes (`0x`-prefixed 32-byte hex strings) it builds the Merkle tree.
+     * @param values
+     */
+    private build;
+    /**
+     * Returns the hash of the `i`-th leaf (index determined by sorting and positioning in the build)
+     * @param i
+     * @returns
+     */
+    getHash(i: number): string | undefined;
+    /** Binary search
+     * Famously prone to subtle bugs, so over-documented with proof
+     */
+    private binarySearch;
+    /**
+     * Extracts the Merkle proof for the given hash, if it is in the tree
+     * @param hashOrIndex the hash whose proof to return
+     * @returns the Merkle proof - a list of `0x`-prefixed 32-byte hex strings
+     */
+    getProof(hashOrIndex: string | number): string[] | undefined;
+}
+/**
+ * Verifies a Merkle proof for a given leaf
+ * @param leaf leaf as (`0x`-prefixed 32-byte hex string)
+ * @param proof Merkle proof (a list of `0x`-prefixed 32-byte hex strings)
+ * @param root Merkle root (`0x`-prefixed 32-byte hex string)
+ * @returns `true` if the proof is valid, `false` otherwise
+ */
+export declare function verifyWithMerkleProof(leaf: string, proof: string[], root: string): boolean;
+//# sourceMappingURL=MerkleTree.d.ts.map

package/dist/coston/StateConnector/libs/ts/MerkleTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MerkleTree.d.ts","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/MerkleTree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAMH;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,UAErC;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAE5F;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,UAKlD;AAED;;GAEG;AACH,qBAAa,UAAU;IACnB,KAAK,EAAE,MAAM,EAAE,CAAM;gBAET,MAAM,EAAE,MAAM,EAAE;IAI5B;;OAEG;IACH,IAAW,IAAI,uBAEd;IAED;;OAEG;IACH,IAAW,IAAI,IAAI,MAAM,EAAE,CAE1B;IAED;;OAEG;IACH,IAAW,SAAS,WAEnB;IAED;;OAEG;IACH,IAAW,YAAY,aAEtB;IAED;;;;OAIG;IACI,MAAM,CAAC,CAAC,EAAE,MAAM;IAIvB;;;OAGG;IACH,OAAO,CAAC,KAAK;IAsBb;;;;OAIG;IACI,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAQ7C;;OAEG;IACH,OAAO,CAAC,YAAY;IAepB;;;;OAIG;IACI,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS;CA8BtE;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,WAOhF"}

package/dist/coston/StateConnector/libs/ts/MerkleTree.js

@@ -0,0 +1,212 @@
+"use strict";
+/**
+ * There are several variants for hashing sequences in Merkle trees in cases when there is odd number of hashes on some level.
+ * - Bitcoin hashes remaining hash with itself
+ * - Ethereum community was considering this:
+ *     https://github.com/proofchains/python-proofmarshal/blob/efe9b58921b9a306f2b3552c30b84e1043ab866f/proofmarshal/mmr.py#L96
+ * - This review shows various options and in particular it describes the "Monero way", which gives balanced trees but they
+ *   had some issues with bugs
+ *     https://medium.com/coinmonks/merkle-trees-concepts-and-use-cases-5da873702318
+ *
+ * The current implementation is a derivation and simplification of "Monero" way. It uses ideas
+ * from binary heaps represented in array. This significantly simplifies the construction both of a Merkle tree and a proof.
+ *
+ * Important formulas for a left-aligned full tree represented in an array for n hashes as leafs
+ * - array has exactly 2*n - 1 nodes (n leafs other internal)
+ * - array[0] is merkle root, array[n-1, ..., 2*n - 2] contains leaf hashes in order
+ * - given tree array of length l = 2*n - 1, then n = floor((l + 1)/2) --- be careful with 1 element
+ * - parent(i) = Math.floor((i - 1) / 2);
+ * - left(i) = 2*i + 1
+ * - right(i) = 2*i + 2
+ *
+ * Importants: all input strings should represent bytes32, hence should be 32-byte padded hex strings.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.verifyWithMerkleProof = exports.MerkleTree = exports.sortedHashPair = exports.commitHash = exports.singleHash = void 0;
+const ethers_1 = require("ethers");
+const coder = ethers_1.ethers.AbiCoder.defaultAbiCoder();
+/**
+ * Single value hash function. Uses keccak function compatible with the one used in Solidity
+ * It is supposed to be used with `0x`-prefixed 32-byte strings as hex values
+ * @param val input hash in form of the string `0x` prefixed.
+ * @returns hash of the input value
+ */
+function singleHash(val) {
+    return ethers_1.ethers.keccak256(val);
+}
+exports.singleHash = singleHash;
+/**
+ * Helper function for constructing the commit hash used with StateConnector.sol contract
+ * @param merkleRoot merkle root (`0x`-prefixed 32-byte hex string)
+ * @param randomNumber secure random number (`0x`-prefixed 32-byte hex string)
+ * @param address addres (`0x`-prefixed 20-byte hex string)
+ * @returns `0x`-prefixed 32-byte hex string (hash)
+ */
+function commitHash(merkleRoot, randomNumber, address) {
+    return ethers_1.ethers.keccak256(coder.encode(["bytes32", "bytes32", "address"], [merkleRoot, randomNumber, address]));
+}
+exports.commitHash = commitHash;
+/**
+ * A sorted hash of two 32-byte strings
+ * @param x first `0x`-prefixed 32-byte hex string
+ * @param y second `0x`-prefixed 32-byte hex string
+ * @returns the sorted hash
+ */
+function sortedHashPair(x, y) {
+    if (x <= y) {
+        return ethers_1.ethers.keccak256(coder.encode(["bytes32", "bytes32"], [x, y]));
+    }
+    return ethers_1.ethers.keccak256(coder.encode(["bytes32", "bytes32"], [y, x]));
+}
+exports.sortedHashPair = sortedHashPair;
+/**
+ * Merkle tree implementation with all the helper function for constructing the tree and extracting the root and proofs for every leaf.
+ */
+class MerkleTree {
+    constructor(values) {
+        this._tree = [];
+        this.build(values);
+    }
+    /**
+     * Merkle root
+     */
+    get root() {
+        return this._tree.length === 0 ? undefined : this._tree[0];
+    }
+    /**
+     * The array representing full tree (length is `2*hashCount - 1`)
+     */
+    get tree() {
+        return [...this._tree];
+    }
+    /**
+     * Number of leaves in the Merkle tree
+     */
+    get hashCount() {
+        return this._tree.length ? (this._tree.length + 1) / 2 : 0;
+    }
+    /**
+     * Returns leaves in array of the length `hashCount` sorted as `0x`-prefixed 32-byte hex strings.
+     */
+    get sortedHashes() {
+        return this._tree.slice(this.hashCount - 1);
+    }
+    /**
+     * Parent index of the node at index `i` in array
+     * @param i index of a node in the Merkle tree
+     * @returns parent index
+     */
+    parent(i) {
+        return Math.floor((i - 1) / 2);
+    }
+    /**
+     * Given an array of leave hashes (`0x`-prefixed 32-byte hex strings) it builds the Merkle tree.
+     * @param values
+     */
+    build(values) {
+        values.forEach((x) => {
+            if (!/^0x[0-9a-f]{64}$/i.test(x)) {
+                throw new Error(`Invalid hash '${x}'`);
+            }
+        });
+        const sorted = values.map((x) => x);
+        sorted.sort();
+        const hashes = [];
+        for (let i = 0; i < sorted.length; i++) {
+            if (i == 0 || sorted[i] !== sorted[i - 1]) {
+                hashes.push(sorted[i]);
+            }
+        }
+        const n = hashes.length;
+        this._tree = [...new Array(Math.max(n - 1, 0)).fill(0), ...hashes];
+        for (let i = n - 2; i >= 0; i--) {
+            this._tree[i] = sortedHashPair(this._tree[2 * i + 1], this._tree[2 * i + 2]);
+        }
+    }
+    /**
+     * Returns the hash of the `i`-th leaf (index determined by sorting and positioning in the build)
+     * @param i
+     * @returns
+     */
+    getHash(i) {
+        if (this.hashCount === 0 || i < 0 || i >= this.hashCount) {
+            return undefined;
+        }
+        const pos = this._tree.length - this.hashCount + i;
+        return this._tree[pos];
+    }
+    /** Binary search
+     * Famously prone to subtle bugs, so over-documented with proof
+     */
+    binarySearch(hash) {
+        let [low, high] = [0, this.hashCount];
+        let count = high;
+        if (count == 0)
+            return undefined;
+        while (count > 1) {
+            // Invariants: low < high, 2 <= count == high - low == [low .. high].length
+            const mid = low + Math.floor(count / 2); // low < mid < high _strictly_
+            hash < this.sortedHashes[mid] ? (high = mid) : (low = mid); // low < high still
+            count = high - low; // preserves invariant
+        }
+        const i = low; // Only element left: count == 1, since 0 != count <= 1
+        if (hash != this.sortedHashes[i])
+            return undefined;
+        return i;
+    }
+    /**
+     * Extracts the Merkle proof for the given hash, if it is in the tree
+     * @param hashOrIndex the hash whose proof to return
+     * @returns the Merkle proof - a list of `0x`-prefixed 32-byte hex strings
+     */
+    getProof(hashOrIndex) {
+        if (this.hashCount === 0) {
+            return undefined;
+        }
+        if (hashOrIndex === undefined)
+            return undefined;
+        let i;
+        if (typeof hashOrIndex === "number") {
+            i = hashOrIndex;
+        }
+        else if (typeof hashOrIndex === "string") {
+            if (/^0x[0-9a-f]{64}$/i.test(hashOrIndex)) {
+                i = this.binarySearch(hashOrIndex);
+            }
+            else {
+                return undefined;
+            }
+        }
+        if (i === undefined)
+            return undefined;
+        if (i < 0 || i >= this.hashCount) {
+            return undefined;
+        }
+        const proof = [];
+        let pos = this._tree.length - this.hashCount + i;
+        while (pos > 0) {
+            proof.push(this._tree[pos + 2 * (pos % 2) - 1]);
+            pos = this.parent(pos);
+        }
+        return proof;
+    }
+}
+exports.MerkleTree = MerkleTree;
+/**
+ * Verifies a Merkle proof for a given leaf
+ * @param leaf leaf as (`0x`-prefixed 32-byte hex string)
+ * @param proof Merkle proof (a list of `0x`-prefixed 32-byte hex strings)
+ * @param root Merkle root (`0x`-prefixed 32-byte hex string)
+ * @returns `true` if the proof is valid, `false` otherwise
+ */
+function verifyWithMerkleProof(leaf, proof, root) {
+    if (!leaf || !proof || !root)
+        return false;
+    let hash = leaf;
+    for (const pair of proof) {
+        hash = sortedHashPair(pair, hash);
+    }
+    return hash == root;
+}
+exports.verifyWithMerkleProof = verifyWithMerkleProof;
+//# sourceMappingURL=MerkleTree.js.map

package/dist/coston/StateConnector/libs/ts/MerkleTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MerkleTree.js","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/MerkleTree.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;;;AAEH,mCAAgC;AAEhC,MAAM,KAAK,GAAG,eAAM,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC;AAEhD;;;;;GAKG;AACH,SAAgB,UAAU,CAAC,GAAW;IAClC,OAAO,eAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;AACjC,CAAC;AAFD,gCAEC;AAED;;;;;;GAMG;AACH,SAAgB,UAAU,CAAC,UAAkB,EAAE,YAAoB,EAAE,OAAe;IAChF,OAAO,eAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,EAAE,CAAC,UAAU,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC,CAAE,CAAC;AACnH,CAAC;AAFD,gCAEC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAAC,CAAS,EAAE,CAAS;IAC/C,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACT,OAAO,eAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,eAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1E,CAAC;AALD,wCAKC;AAED;;GAEG;AACH,MAAa,UAAU;IAGnB,YAAY,MAAgB;QAF5B,UAAK,GAAa,EAAE,CAAC;QAGjB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACX,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAW,SAAS;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;OAEG;IACH,IAAW,YAAY;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,CAAS;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,MAAgB;QAC1B,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACjB,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;YAC3C,CAAC;QACL,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,IAAI,EAAE,CAAC;QAEd,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;QACL,CAAC;QACD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC;QACnE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QAClF,CAAC;IACL,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,CAAS;QACpB,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACvD,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,IAAY;QAC7B,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QACjC,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACf,2EAA2E;YAC3E,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,8BAA8B;YACvE,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAC/E,KAAK,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC,sBAAsB;QAC9C,CAAC;QACD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,uDAAuD;QACtE,IAAI,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACnD,OAAO,CAAC,CAAC;IACb,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,WAA4B;QACxC,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,IAAI,WAAW,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAChD,IAAI,CAAqB,CAAC;QAC1B,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;YAClC,CAAC,GAAG,WAAW,CAAC;QACpB,CAAC;aAAM,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;YACzC,IAAI,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBACxC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACJ,OAAO,SAAS,CAAC;YACrB,CAAC;QACL,CAAC;QACD,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACtC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACjD,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;YACb,KAAK,CAAC,IAAI,CACN,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CACtC,CAAC;YACF,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;CACJ;AAxID,gCAwIC;AAED;;;;;;GAMG;AACH,SAAgB,qBAAqB,CAAC,IAAY,EAAE,KAAe,EAAE,IAAY;IAC7E,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAC3C,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,CAAE,CAAC;IACvC,CAAC;IACD,OAAO,IAAI,IAAI,IAAI,CAAC;AACxB,CAAC;AAPD,sDAOC"}

package/dist/coston/StateConnector/libs/ts/config-types.d.ts

@@ -0,0 +1,143 @@
+/**
+ * ABI definition fields for request, response and proof of an attestation type.
+ */
+export interface ABIDefinitions {
+    /**
+     * JSON ABI definition for attestation type request
+     */
+    requestAbi: any;
+    /**
+     * JSON ABI definition for attestation type response
+     */
+    responseAbi: any;
+    /**
+     * JSON ABI definition for attestation type proof
+     */
+    proofAbi: any;
+}
+/**
+ * Metadata for basic and ABI configs for an attestation type.
+ */
+export interface TypeRecord extends ABIDefinitions {
+    /**
+     * Attestation type name. Must be unique and in PascalCase (also known as UpperCamelCase, hence CamelCase with the first letter capitalized).
+     */
+    name: string;
+    /**
+     * Full comment for the attestation type as provided in the Solidity definition.
+     */
+    fullComment: string;
+    /**
+     * Description of the attestation type. Used also in the generated documentation.
+     */
+    description: string;
+    /**
+     * Comma separated list of supported sources for the attestation type. The strings defining types are community defined.
+     * Currently, the following are supported: BTC, DOGE, XRP, ETH
+     */
+    supported: string[];
+    /**
+     * Text describing the attestation type verification rules. In Markdown format.
+     */
+    verification: string;
+    /**
+     * The description of how lowest used timestamp is obtained from the attestation response.
+     * Usually a field name.
+     */
+    lut: string;
+    /**
+     * Metadata about the struct describing attestation request.
+     */
+    request: StructRecord;
+    /**
+     * Metadata about the struct describing attestation response.
+     */
+    response: StructRecord;
+    /**
+     * Metadata about the struct describing attestation proof.
+     */
+    proof: StructRecord;
+    /**
+     * Metadata about the struct describing attestation request body.
+     */
+    requestBody: StructRecord;
+    /**
+     * Metadata about the struct describing attestation response body.
+     */
+    responseBody: StructRecord;
+    /**
+     * List of metadata objects describing structs used in attestation request.
+     */
+    requestStructs: StructRecord[];
+    /**
+     * List of metadata objects describing structs used in attestation response.
+     */
+    responseStructs: StructRecord[];
+}
+/**
+ * Metadata for a struct parameter from a Solidity definition of attestation types.
+ */
+export interface ParamRecord {
+    /**
+     * Field name.
+     */
+    name: string;
+    /**
+     * Field type as defined in Solidity.
+     */
+    type: string;
+    /**
+     * Short field type (omitting position prefixes for structs)
+     */
+    typeSimple?: string;
+    /**
+     * Field description. Possibly multiline.
+     */
+    comment: string;
+}
+/**
+ * Metadata for a struct from a Solidity definition of attestation types.
+ */
+export interface StructRecord {
+    /**
+     * Struct name.
+     */
+    name: string;
+    /**
+     * Full comment for the struct as provided in the Solidity definition.
+     */
+    fullComment: string;
+    /**
+     * Struct description. Possibly multiline, can use Markdown.
+     */
+    description: string;
+    /**
+     * Additional markdown text to be used above the struct fields description in documentation.
+     */
+    above?: string;
+    /**
+     * Additional markdown text to be used below the struct fields description in documentation.
+     */
+    below?: string;
+    /**
+     * List of metadata objects describing struct fields.
+     */
+    params: ParamRecord[];
+}
+export interface DataSource {
+    name: string;
+    description: string;
+}
+export interface Protocol {
+    name: string;
+    description: string;
+}
+export interface AttestationTypeProtocolSupport {
+    attestationType: string;
+    supportedDataSources: string[];
+}
+export interface ProtocolSupport {
+    protocol: string;
+    supported: AttestationTypeProtocolSupport[];
+}
+//# sourceMappingURL=config-types.d.ts.map

package/dist/coston/StateConnector/libs/ts/config-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"config-types.d.ts","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/config-types.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,WAAW,cAAc;IAC3B;;OAEG;IACH,UAAU,EAAE,GAAG,CAAC;IAChB;;OAEG;IACH,WAAW,EAAE,GAAG,CAAC;IACjB;;OAEG;IACH,QAAQ,EAAE,GAAG,CAAC;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,UAAW,SAAQ,cAAc;IAC9C;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;;OAGG;IACH,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB;;OAEG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;IACH,OAAO,EAAE,YAAY,CAAC;IACtB;;OAEG;IACH,QAAQ,EAAE,YAAY,CAAC;IACvB;;OAEG;IACH,KAAK,EAAE,YAAY,CAAC;IACpB;;OAEG;IACH,WAAW,EAAE,YAAY,CAAC;IAC1B;;OAEG;IACH,YAAY,EAAE,YAAY,CAAC;IAC3B;;OAEG;IACH,cAAc,EAAE,YAAY,EAAE,CAAC;IAC/B;;OAEG;IACH,eAAe,EAAE,YAAY,EAAE,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IACxB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IACzB;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;OAEG;IACH,MAAM,EAAE,WAAW,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,QAAQ;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,8BAA8B;IAC3C,eAAe,EAAE,MAAM,CAAC;IACxB,oBAAoB,EAAE,MAAM,EAAE,CAAC;CAClC;AACD,MAAM,WAAW,eAAe;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,8BAA8B,EAAE,CAAC;CAC/C"}

package/dist/coston/StateConnector/libs/ts/config-types.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=config-types.js.map

package/dist/coston/StateConnector/libs/ts/config-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"config-types.js","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/config-types.ts"],"names":[],"mappings":""}

package/dist/coston/StateConnector/libs/ts/interfaces.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Generic interface for the request of an attestation request.
+ */
+export interface ARBase {
+    attestationType: string;
+    sourceId: string;
+    messageIntegrityCode?: string;
+    requestBody: any;
+}
+/**
+ * Generic interface for the response of an attestation request.
+ */
+export interface ARESBase {
+    attestationType: string;
+    sourceId: string;
+    votingRound: string;
+    lowestUsedTimestamp: string;
+    requestBody: any;
+    responseBody: any;
+}
+/**
+ * Generic interface for example data usually randomly generated for testing purposes and examples.
+ */
+export interface ExampleData<RNM, REQ, RES> {
+    requestNoMic: RNM;
+    request: REQ;
+    response: RES;
+    messageIntegrityCode: string;
+    encodedRequestZeroMic: string;
+    encodedRequest: string;
+}
+//# sourceMappingURL=interfaces.d.ts.map

package/dist/coston/StateConnector/libs/ts/interfaces.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interfaces.d.ts","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/interfaces.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,WAAW,MAAM;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,WAAW,EAAE,GAAG,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,WAAW,EAAE,GAAG,CAAC;IACjB,YAAY,EAAE,GAAG,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG;IACtC,YAAY,EAAE,GAAG,CAAC;IAClB,OAAO,EAAE,GAAG,CAAC;IACb,QAAQ,EAAE,GAAG,CAAC;IACd,oBAAoB,EAAE,MAAM,CAAC;IAC7B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,cAAc,EAAE,MAAM,CAAC;CAC1B"}

package/dist/coston/StateConnector/libs/ts/interfaces.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=interfaces.js.map

package/dist/coston/StateConnector/libs/ts/interfaces.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"interfaces.js","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/interfaces.ts"],"names":[],"mappings":""}

package/dist/coston/StateConnector/libs/ts/random.d.ts

@@ -0,0 +1,9 @@
+export declare function seededRandHex(n: number, seed?: string): string;
+/**
+ * Helper random value generator for Solidity type values used in in randomized attestation requests or responses.
+ * Primarily used for testing
+ * @param typeName solidity type (e.g. uint256)
+ * @returns
+ */
+export declare function randSol(typeName: string, seed?: string): string | boolean;
+//# sourceMappingURL=random.d.ts.map

package/dist/coston/StateConnector/libs/ts/random.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.d.ts","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/random.ts"],"names":[],"mappings":"AAEA,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,SAAM,UAElD;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,SAAM,GAAG,MAAM,GAAG,OAAO,CAyDtE"}

package/dist/coston/StateConnector/libs/ts/random.js

@@ -0,0 +1,70 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.randSol = exports.seededRandHex = void 0;
+const ethers_1 = require("ethers");
+function seededRandHex(n, seed = "0") {
+    return ethers_1.ethers.keccak256(ethers_1.ethers.toUtf8Bytes(seed)).slice(0, 2 + 2 * n);
+}
+exports.seededRandHex = seededRandHex;
+/**
+ * Helper random value generator for Solidity type values used in in randomized attestation requests or responses.
+ * Primarily used for testing
+ * @param typeName solidity type (e.g. uint256)
+ * @returns
+ */
+function randSol(typeName, seed = "0") {
+    let match = typeName.match(/^.+(\[(\d*)\])$/);
+    if (match) {
+        const brackets = match[1];
+        const value = parseInt(match[2]);
+        const typeOfArray = typeName.slice(0, -brackets.length);
+        if (!isNaN(value) || value === 0) {
+            return ("[" +
+                Array(value)
+                    .fill(0)
+                    .map(() => randSol(typeOfArray, seed))
+                    .join(", ") +
+                "]");
+        }
+        else {
+            const length = 3; // fixed length
+            return ("[" +
+                Array(length)
+                    .fill(0)
+                    .map(() => randSol(typeOfArray, seed))
+                    .join(", ") +
+                "]");
+        }
+    }
+    match = typeName.match(/^uint(\d+)$/);
+    if (match) {
+        return BigInt(seededRandHex(parseInt(match[1]) / 8, seed)).toString();
+    }
+    match = typeName.match(/^int(\d+)$/);
+    if (match) {
+        const val = seededRandHex(parseInt(match[1]) / 8, seed);
+        return BigInt("0x0" + val.slice(3)).toString();
+    }
+    if (typeName.match(/^bool$/)) {
+        return true;
+    }
+    match = typeName.match(/^bytes(\d+)$/);
+    if (match) {
+        return seededRandHex(parseInt(match[1]), seed);
+    }
+    if (typeName.match(/^address$/)) {
+        return seededRandHex(20, seed);
+    }
+    if (typeName.match(/^string$/)) {
+        return "Random string";
+    }
+    if (typeName.match(/^byte$/)) {
+        return seededRandHex(1, seed);
+    }
+    if (typeName.match(/^bytes$/)) {
+        return seededRandHex(30, seed);
+    }
+    throw new Error(`Unsupported type ${typeName}`);
+}
+exports.randSol = randSol;
+//# sourceMappingURL=random.js.map

package/dist/coston/StateConnector/libs/ts/random.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"random.js","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/random.ts"],"names":[],"mappings":";;;AAAA,mCAAgC;AAEhC,SAAgB,aAAa,CAAC,CAAS,EAAE,IAAI,GAAG,GAAG;IAC/C,OAAO,eAAM,CAAC,SAAS,CAAC,eAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1E,CAAC;AAFD,sCAEC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAC,QAAgB,EAAE,IAAI,GAAG,GAAG;IAChD,IAAI,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAC9C,IAAI,KAAK,EAAE,CAAC;QACR,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,CACH,GAAG;gBACH,KAAK,CAAC,KAAK,CAAC;qBACP,IAAI,CAAC,CAAC,CAAC;qBACP,GAAG,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;qBACrC,IAAI,CAAC,IAAI,CAAC;gBACf,GAAG,CACN,CAAC;QACN,CAAC;aAAM,CAAC;YACJ,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,eAAe;YACjC,OAAO,CACH,GAAG;gBACH,KAAK,CAAC,MAAM,CAAC;qBACR,IAAI,CAAC,CAAC,CAAC;qBACP,GAAG,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;qBACrC,IAAI,CAAC,IAAI,CAAC;gBACf,GAAG,CACN,CAAC;QACN,CAAC;IACL,CAAC;IAED,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IACtC,IAAI,KAAK,EAAE,CAAC;QACR,OAAO,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC1E,CAAC;IACD,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACrC,IAAI,KAAK,EAAE,CAAC;QACR,MAAM,GAAG,GAAG,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACxD,OAAO,MAAM,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACnD,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACvC,IAAI,KAAK,EAAE,CAAC;QACR,OAAO,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;QAC9B,OAAO,aAAa,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QAC7B,OAAO,eAAe,CAAC;IAC3B,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC3B,OAAO,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5B,OAAO,aAAa,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,oBAAoB,QAAQ,EAAE,CAAC,CAAC;AACpD,CAAC;AAzDD,0BAyDC"}