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

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

@@ -0,0 +1,68 @@
+import { TypeRecord } from "./config-types";
+import { ethers } from "ethers";
+import { ARBase, ARESBase } from "./interfaces";
+/**
+ * Attestation definition store. Contains all the attestation type definitions
+ * that are contained in the folder, from which the store was initialized.
+ */
+export declare class AttestationDefinitionStore {
+    definitions: Map<string, TypeRecord>;
+    coder: ethers.AbiCoder;
+    constructor(configsPath?: string);
+    /**
+     * Initializes the store by reading the attestation type definition configs from the
+     * provided path.
+     * @param configsPath
+     */
+    private initialize;
+    /**
+     * Returns the attestation type definition for the provided attestation type id.
+     * @param attestationType
+     * @returns
+     */
+    getDefinitionForDecodedAttestationType(attestationType: string): TypeRecord | undefined;
+    getABIsForDecodedAttestationType(attestationTypeId: string): {
+        requestAbi: any;
+        responseAbi: any;
+        proofAbi: any;
+    };
+    /**
+     * Calculated usual or salted hash of the attestation response.
+     * The function throws an error if an attestation type is not supported or
+     * the response does not match the provided ABI definition.
+     * @param response
+     * @param salt
+     * @returns
+     */
+    attestationResponseHash<T extends ARESBase>(response: T, salt?: string): string;
+    /**
+     * Extracts the attestation type prefix from the provided attestation request.
+     * The prefix consists of 3 x 32 bytes: attestation type, source id and message integrity code.
+     * The rest of the bytes define ABI encoded request body.
+     * @param bytes
+     * @param decodeAttestationTypeName
+     * @returns
+     */
+    static extractPrefixFromRequest(bytes: string, decodeAttestationTypeName?: boolean): ARBase;
+    /**
+     * Encodes attestation request.
+     * The request must have the attestation type encoded into 32-byte 0x-prefixed string.
+     * @param request
+     * @returns
+     */
+    encodeRequest(request: ARBase): string;
+    /**
+     * Parses attestation request.
+     * @param bytes
+     * @returns
+     */
+    parseRequest<AR extends ARBase>(bytes: string, decodeAttestationTypeName?: boolean): AR;
+    /**
+     * Compares two attestation requests.
+     * @param request1
+     * @param request2
+     * @returns
+     */
+    equalsRequest(request1: ARBase, request2: ARBase): boolean;
+}
+//# sourceMappingURL=AttestationDefinitionStore.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"AttestationDefinitionStore.d.ts","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/AttestationDefinitionStore.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAYhD;;;GAGG;AACH,qBAAa,0BAA0B;IACnC,WAAW,EAAG,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACtC,KAAK,EAAG,MAAM,CAAC,QAAQ,CAAC;gBAEZ,WAAW,SAAwC;IAG/D;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAKlB;;;;OAIG;IACH,sCAAsC,CAAC,eAAe,EAAE,MAAM;IAI9D,gCAAgC,CAAC,iBAAiB,EAAE,MAAM;;;;;IAY1D;;;;;;;OAOG;IACH,uBAAuB,CAAC,CAAC,SAAS,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM;IAe/E;;;;;;;OAOG;IACH,MAAM,CAAC,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,yBAAyB,UAAQ,GAAG,MAAM;IAsBzF;;;;;OAKG;IACH,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAoBtC;;;;OAIG;IACH,YAAY,CAAC,EAAE,SAAS,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,yBAAyB,UAAQ,GAAG,EAAE;IAqBrF;;;;;OAKG;IACH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;CAc7D"}

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

@@ -0,0 +1,164 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AttestationDefinitionStore = void 0;
+const ethers_1 = require("ethers");
+const utils_1 = require("./utils");
+/**
+ * Attestation definition store. Contains all the attestation type definitions
+ * that are contained in the folder, from which the store was initialized.
+ */
+class AttestationDefinitionStore {
+    constructor(configsPath = utils_1.DEFAULT_ATTESTATION_TYPE_CONFIGS_PATH) {
+        this.initialize(configsPath);
+    }
+    /**
+     * Initializes the store by reading the attestation type definition configs from the
+     * provided path.
+     * @param configsPath
+     */
+    initialize(configsPath) {
+        this.definitions = (0, utils_1.readAttestationTypeConfigs)(configsPath);
+        this.coder = ethers_1.ethers.AbiCoder.defaultAbiCoder();
+    }
+    /**
+     * Returns the attestation type definition for the provided attestation type id.
+     * @param attestationType
+     * @returns
+     */
+    getDefinitionForDecodedAttestationType(attestationType) {
+        return this.definitions.get(attestationType);
+    }
+    getABIsForDecodedAttestationType(attestationTypeId) {
+        const definition = this.getDefinitionForDecodedAttestationType(attestationTypeId);
+        if (!definition) {
+            throw new Error(`Unsupported attestation type id: '${attestationTypeId}'`);
+        }
+        return {
+            requestAbi: definition.requestAbi,
+            responseAbi: definition.responseAbi,
+            proofAbi: definition.proofAbi,
+        };
+    }
+    /**
+     * Calculated usual or salted hash of the attestation response.
+     * The function throws an error if an attestation type is not supported or
+     * the response does not match the provided ABI definition.
+     * @param response
+     * @param salt
+     * @returns
+     */
+    attestationResponseHash(response, salt) {
+        const attestationType = (0, utils_1.decodeAttestationName)(response.attestationType);
+        const definition = this.getDefinitionForDecodedAttestationType(attestationType);
+        if (!definition) {
+            throw new Error(`Unsupported attestation type id: '${attestationType}'`);
+        }
+        let abiEncoded;
+        if (salt) {
+            abiEncoded = this.coder.encode([definition.responseAbi, "string"], [response, salt]);
+        }
+        else {
+            abiEncoded = this.coder.encode([definition.responseAbi], [response]);
+        }
+        return ethers_1.ethers.keccak256(abiEncoded);
+    }
+    /**
+     * Extracts the attestation type prefix from the provided attestation request.
+     * The prefix consists of 3 x 32 bytes: attestation type, source id and message integrity code.
+     * The rest of the bytes define ABI encoded request body.
+     * @param bytes
+     * @param decodeAttestationTypeName
+     * @returns
+     */
+    static extractPrefixFromRequest(bytes, decodeAttestationTypeName = false) {
+        if (!bytes) {
+            throw new Error("Empty attestation request");
+        }
+        if (!bytes.match(/^0x[0-9a-fA-F]*$/)) {
+            throw new Error("Not a '0x'-prefixed hex string");
+        }
+        if (bytes.length < 3 * 64 + 2) {
+            throw new Error("Incorrectly formatted attestation request");
+        }
+        let attestationType = bytes.slice(0, 2 + 64);
+        if (decodeAttestationTypeName) {
+            attestationType = (0, utils_1.decodeAttestationName)(attestationType);
+        }
+        return {
+            attestationType,
+            sourceId: "0x" + bytes.slice(2 + 64, 2 + 2 * 64),
+            messageIntegrityCode: "0x" + bytes.slice(2 + 2 * 64, 2 + 3 * 64),
+            requestBody: "0x" + bytes.slice(2 + 3 * 64),
+        };
+    }
+    /**
+     * Encodes attestation request.
+     * The request must have the attestation type encoded into 32-byte 0x-prefixed string.
+     * @param request
+     * @returns
+     */
+    encodeRequest(request) {
+        const attestationType = (0, utils_1.decodeAttestationName)(request.attestationType);
+        const definition = this.getDefinitionForDecodedAttestationType(attestationType);
+        if (!definition) {
+            throw new Error(`Unsupported attestation type id: '${request.attestationType}'`);
+        }
+        // custom encoding for the prefix
+        const abiEncodePrefix = this.coder.encode(["bytes32", "bytes32", "bytes32"], [request.attestationType, request.sourceId, request.messageIntegrityCode || utils_1.ZERO_BYTES_32]);
+        // ABI encoding for the request body
+        const requestBodyAbi = definition.requestAbi.components.find((item) => item.name == "requestBody");
+        if (!requestBodyAbi) {
+            throw new Error(`Invalid request ABI for attestation type id: '${request.attestationType}'. No 'requestBody'.`);
+        }
+        const abiEncodeBody = this.coder.encode([requestBodyAbi], [request.requestBody]);
+        return ethers_1.ethers.concat([abiEncodePrefix, abiEncodeBody]);
+    }
+    /**
+     * Parses attestation request.
+     * @param bytes
+     * @returns
+     */
+    parseRequest(bytes, decodeAttestationTypeName = false) {
+        var _a;
+        const prefix = AttestationDefinitionStore.extractPrefixFromRequest(bytes);
+        const attestationType = (0, utils_1.decodeAttestationName)(prefix.attestationType);
+        const definition = this.getDefinitionForDecodedAttestationType(attestationType);
+        if (!definition) {
+            throw new Error(`Unsupported attestation type id: '${attestationType}'`);
+        }
+        const requestBodyAbi = (_a = definition.requestAbi) === null || _a === void 0 ? void 0 : _a.components.find((item) => item.name == "requestBody");
+        if (!requestBodyAbi) {
+            throw new Error(`Invalid request ABI for attestation type id: '${prefix.attestationType}'. No 'requestBody'.`);
+        }
+        const parsed = this.coder.decode([requestBodyAbi], "0x" + bytes.slice(2 + 3 * 64))[0];
+        return (0, utils_1.serializeBigInts)({
+            attestationType: decodeAttestationTypeName ? definition : prefix.attestationType,
+            sourceId: prefix.sourceId,
+            messageIntegrityCode: prefix.messageIntegrityCode,
+            requestBody: (0, utils_1.remapABIParsedToObjects)(parsed, requestBodyAbi),
+        });
+    }
+    /**
+     * Compares two attestation requests.
+     * @param request1
+     * @param request2
+     * @returns
+     */
+    equalsRequest(request1, request2) {
+        var _a;
+        if (request1.attestationType !== request2.attestationType) {
+            return false;
+        }
+        if (request1.sourceId != request2.sourceId) {
+            return false;
+        }
+        const attestationType = (0, utils_1.decodeAttestationName)(request1.attestationType);
+        const requestAbi = (_a = this.getDefinitionForDecodedAttestationType(attestationType)) === null || _a === void 0 ? void 0 : _a.requestAbi;
+        if (!requestAbi) {
+            throw new Error(`Unsupported attestation type id: '${attestationType}'`);
+        }
+        return (0, utils_1.structsDeepEqual)(request1, request2, requestAbi);
+    }
+}
+exports.AttestationDefinitionStore = AttestationDefinitionStore;
+//# sourceMappingURL=AttestationDefinitionStore.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"AttestationDefinitionStore.js","sourceRoot":"","sources":["../../../../../coston/StateConnector/libs/ts/AttestationDefinitionStore.ts"],"names":[],"mappings":";;;AACA,mCAAgC;AAEhC,mCASiB;AAEjB;;;GAGG;AACH,MAAa,0BAA0B;IAInC,YAAY,WAAW,GAAG,6CAAqC;QAC3D,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACjC,CAAC;IACD;;;;OAIG;IACK,UAAU,CAAC,WAAmB;QAClC,IAAI,CAAC,WAAW,GAAG,IAAA,kCAA0B,EAAC,WAAW,CAAC,CAAC;QAC3D,IAAI,CAAC,KAAK,GAAG,eAAM,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC;IACnD,CAAC;IAED;;;;OAIG;IACH,sCAAsC,CAAC,eAAuB;QAC1D,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IACjD,CAAC;IAED,gCAAgC,CAAC,iBAAyB;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,sCAAsC,CAAC,iBAAiB,CAAC,CAAC;QAClF,IAAI,CAAC,UAAU,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,qCAAqC,iBAAiB,GAAG,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO;YACH,UAAU,EAAE,UAAU,CAAC,UAAU;YACjC,WAAW,EAAE,UAAU,CAAC,WAAW;YACnC,QAAQ,EAAE,UAAU,CAAC,QAAQ;SAChC,CAAC;IACN,CAAC;IAED;;;;;;;OAOG;IACH,uBAAuB,CAAqB,QAAW,EAAE,IAAa;QAClE,MAAM,eAAe,GAAG,IAAA,6BAAqB,EAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;QACxE,MAAM,UAAU,GAAG,IAAI,CAAC,sCAAsC,CAAC,eAAe,CAAC,CAAC;QAChF,IAAI,CAAC,UAAU,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,qCAAqC,eAAe,GAAG,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,UAAU,CAAC;QACf,IAAI,IAAI,EAAE,CAAC;YACP,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;QACzF,CAAC;aAAM,CAAC;YACJ,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,eAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACxC,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,wBAAwB,CAAC,KAAa,EAAE,yBAAyB,GAAG,KAAK;QAC5E,IAAI,CAAC,KAAK,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QACjD,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,kBAAkB,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,eAAe,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC7C,IAAI,yBAAyB,EAAE,CAAC;YAC5B,eAAe,GAAG,IAAA,6BAAqB,EAAC,eAAe,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO;YACH,eAAe;YACf,QAAQ,EAAE,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;YAChD,oBAAoB,EAAE,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;YAChE,WAAW,EAAE,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;SACpC,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,OAAe;QACzB,MAAM,eAAe,GAAG,IAAA,6BAAqB,EAAC,OAAO,CAAC,eAAe,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,sCAAsC,CAAC,eAAe,CAAC,CAAC;QAChF,IAAI,CAAC,UAAU,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,qCAAqC,OAAO,CAAC,eAAe,GAAG,CAAC,CAAC;QACrF,CAAC;QACD,iCAAiC;QACjC,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CACrC,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,EACjC,CAAC,OAAO,CAAC,eAAe,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,oBAAoB,IAAI,qBAAa,CAAC,CAC7F,CAAC;QACF,oCAAoC;QACpC,MAAM,cAAc,GAAG,UAAU,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAiB,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,aAAa,CAAC,CAAC;QAChH,IAAI,CAAC,cAAc,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,iDAAiD,OAAO,CAAC,eAAe,sBAAsB,CAAC,CAAC;QACpH,CAAC;QACD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC;QACjF,OAAO,eAAM,CAAC,MAAM,CAAC,CAAC,eAAe,EAAE,aAAa,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAoB,KAAa,EAAE,yBAAyB,GAAG,KAAK;;QAC5E,MAAM,MAAM,GAAG,0BAA0B,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;QAC1E,MAAM,eAAe,GAAG,IAAA,6BAAqB,EAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QACtE,MAAM,UAAU,GAAG,IAAI,CAAC,sCAAsC,CAAC,eAAe,CAAC,CAAC;QAChF,IAAI,CAAC,UAAU,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,qCAAqC,eAAe,GAAG,CAAC,CAAC;QAC7E,CAAC;QACD,MAAM,cAAc,GAAG,MAAA,UAAU,CAAC,UAAU,0CAAE,UAAU,CAAC,IAAI,CAAC,CAAC,IAAiB,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,aAAa,CAAC,CAAC;QACjH,IAAI,CAAC,cAAc,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,iDAAiD,MAAM,CAAC,eAAe,sBAAsB,CAAC,CAAC;QACnH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,OAAO,IAAA,wBAAgB,EAAC;YACpB,eAAe,EAAE,yBAAyB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,eAAe;YAChF,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;YACjD,WAAW,EAAE,IAAA,+BAAuB,EAAC,MAAM,EAAE,cAAc,CAAC;SAC/D,CAAO,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,QAAgB,EAAE,QAAgB;;QAC5C,IAAI,QAAQ,CAAC,eAAe,KAAK,QAAQ,CAAC,eAAe,EAAE,CAAC;YACxD,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACzC,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,MAAM,eAAe,GAAG,IAAA,6BAAqB,EAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;QACxE,MAAM,UAAU,GAAG,MAAA,IAAI,CAAC,sCAAsC,CAAC,eAAe,CAAC,0CAAE,UAAyB,CAAC;QAC3G,IAAI,CAAC,UAAU,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,qCAAqC,eAAe,GAAG,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,IAAA,wBAAgB,EAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC5D,CAAC;CACJ;AAnKD,gEAmKC"}

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

@@ -0,0 +1,33 @@
+/**
+ * Attestation status
+ */
+export declare enum AttestationResponseStatus {
+    /**
+     * Attestation request is valid.
+     */
+    VALID = "VALID",
+    /**
+     * Attestation request is invalid.
+     */
+    INVALID = "INVALID",
+    /**
+     * Attestation request cannot be confirmed neither rejected by the verifier at the moment.
+     */
+    INDETERMINATE = "INDETERMINATE"
+}
+/**
+ * Object returned as a result of attestation.
+ * If status is 'VALID' then parameters @param response contains attestation response.
+ * Otherwise, @param response is undefined.
+ */
+export declare class AttestationResponse<RES> {
+    /**
+     * Verification status.
+     */
+    status: AttestationResponseStatus;
+    /**
+     * Attestation response.
+     */
+    response?: RES;
+}
+//# sourceMappingURL=AttestationResponse.d.ts.map

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"}