@freedomofpress/sigstore-browser 0.1.6 → 0.1.8

package/dist/index-CRFtwdjM.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-CRFtwdjM.js","sources":["../node_modules/@freedomofpress/crypto-browser/dist/asn1/error.js","../node_modules/@freedomofpress/crypto-browser/dist/asn1/tag.js","../node_modules/@freedomofpress/crypto-browser/dist/asn1/length.js","../node_modules/@freedomofpress/crypto-browser/dist/encoding.js","../node_modules/@freedomofpress/crypto-browser/dist/asn1/parse.js","../node_modules/@freedomofpress/crypto-browser/dist/stream.js","../node_modules/@freedomofpress/crypto-browser/dist/asn1/obj.js","../node_modules/@freedomofpress/crypto-browser/dist/pem.js","../node_modules/@freedomofpress/crypto-browser/dist/canonicalize.js","../node_modules/@freedomofpress/crypto-browser/dist/interfaces.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/hashes/esm/crypto.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/hashes/esm/utils.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/hashes/esm/_md.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/hashes/esm/_u64.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/hashes/esm/sha2.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/hashes/esm/hmac.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/curves/esm/utils.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/curves/esm/abstract/modular.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/curves/esm/abstract/curve.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/curves/esm/abstract/weierstrass.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/curves/esm/_shortw_utils.js","../node_modules/@freedomofpress/crypto-browser/node_modules/@noble/curves/esm/nist.js","../node_modules/@freedomofpress/crypto-browser/dist/crypto.js","../src/interfaces.ts","../src/oid.ts","../src/x509/sct.ts","../src/x509/ext.ts","../src/x509/cert.ts","../src/x509/chain.ts","../src/dsse.ts","../src/tlog/merkle.ts","../src/tlog/checkpoint.ts","../src/tlog/hashedrekord.ts","../src/tlog/dsse.ts","../src/tlog/intoto.ts","../src/tlog/body.ts","../src/rfc3161/error.ts","../src/rfc3161/tstinfo.ts","../src/rfc3161/timestamp.ts","../src/timestamp/tsa.ts","../src/trust/tuf.ts","../src/sigstore.ts","../src/errors.ts","../src/policy.ts"],"sourcesContent":["/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nAdapted from: https://github.com/sigstore/sigstore-js/blob/main/packages/core/src/asn1/error.ts\n*/\nexport class ASN1ParseError extends Error {\n}\nexport class ASN1TypeError extends Error {\n}\n//# sourceMappingURL=error.js.map","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nAdapted from: https://github.com/sigstore/sigstore-js/blob/main/packages/core/src/asn1/tag.ts\nChanges: Added .js extensions for browser ESM compatibility\n*/\nimport { ASN1ParseError } from \"./error.js\";\nconst UNIVERSAL_TAG = {\n    BOOLEAN: 0x01,\n    INTEGER: 0x02,\n    BIT_STRING: 0x03,\n    OCTET_STRING: 0x04,\n    OBJECT_IDENTIFIER: 0x06,\n    SEQUENCE: 0x10,\n    SET: 0x11,\n    PRINTABLE_STRING: 0x13,\n    UTC_TIME: 0x17,\n    GENERALIZED_TIME: 0x18,\n};\nconst TAG_CLASS = {\n    UNIVERSAL: 0x00,\n    APPLICATION: 0x01,\n    CONTEXT_SPECIFIC: 0x02,\n    PRIVATE: 0x03,\n};\nexport class ASN1Tag {\n    constructor(enc) {\n        this.number = enc & 0x1f;\n        this.constructed = (enc & 0x20) === 0x20;\n        this.class = enc >> 6;\n        if (this.number === 0x1f) {\n            throw new ASN1ParseError(\"long form tags not supported\");\n        }\n        if (this.class === TAG_CLASS.UNIVERSAL && this.number === 0x00) {\n            throw new ASN1ParseError(\"unsupported tag 0x00\");\n        }\n    }\n    isUniversal() {\n        return this.class === TAG_CLASS.UNIVERSAL;\n    }\n    isContextSpecific(num) {\n        const res = this.class === TAG_CLASS.CONTEXT_SPECIFIC;\n        return num !== undefined ? res && this.number === num : res;\n    }\n    isBoolean() {\n        return this.isUniversal() && this.number === UNIVERSAL_TAG.BOOLEAN;\n    }\n    isInteger() {\n        return this.isUniversal() && this.number === UNIVERSAL_TAG.INTEGER;\n    }\n    isBitString() {\n        return this.isUniversal() && this.number === UNIVERSAL_TAG.BIT_STRING;\n    }\n    isOctetString() {\n        return this.isUniversal() && this.number === UNIVERSAL_TAG.OCTET_STRING;\n    }\n    isOID() {\n        return (this.isUniversal() && this.number === UNIVERSAL_TAG.OBJECT_IDENTIFIER);\n    }\n    isUTCTime() {\n        return this.isUniversal() && this.number === UNIVERSAL_TAG.UTC_TIME;\n    }\n    isGeneralizedTime() {\n        return this.isUniversal() && this.number === UNIVERSAL_TAG.GENERALIZED_TIME;\n    }\n    toDER() {\n        return this.number | (this.constructed ? 0x20 : 0x00) | (this.class << 6);\n    }\n}\n//# sourceMappingURL=tag.js.map","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nAdapted from: https://github.com/sigstore/sigstore-js/blob/main/packages/core/src/asn1/length.ts\nChanges: Buffer → Uint8Array for browser compatibility, added .js extensions\n*/\nimport { ASN1ParseError } from \"./error.js\";\n// Decodes the length of a DER-encoded ANS.1 element from the supplied stream.\n// https://learn.microsoft.com/en-us/windows/win32/seccertenroll/about-encoded-length-and-value-bytes\nexport function decodeLength(stream) {\n    const buf = stream.getUint8();\n    // If the most significant bit is UNSET the length is just the value of the\n    // byte.\n    if ((buf & 0x80) === 0x00) {\n        return buf;\n    }\n    // Otherwise, the lower 7 bits of the first byte indicate the number of bytes\n    // that follow to encode the length.\n    const byteCount = buf & 0x7f;\n    // Ensure the encoded length can safely fit in a JS number.\n    if (byteCount > 6) {\n        throw new ASN1ParseError(\"length exceeds 6 byte limit\");\n    }\n    // Iterate over the bytes that encode the length.\n    let len = 0;\n    for (let i = 0; i < byteCount; i++) {\n        len = len * 256 + stream.getUint8();\n    }\n    // This is a valid ASN.1 length encoding, but we don't support it.\n    if (len === 0) {\n        throw new ASN1ParseError(\"indefinite length encoding not supported\");\n    }\n    return len;\n}\n// Translates the supplied value to a DER-encoded length.\nexport function encodeLength(len) {\n    if (len < 128) {\n        return new Uint8Array([len]);\n    }\n    // Bitwise operations on large numbers are not supported in JS, so we need to\n    // use BigInts.\n    let val = BigInt(len);\n    const bytes = [];\n    while (val > 0n) {\n        bytes.unshift(Number(val & 255n));\n        val = val >> 8n;\n    }\n    return new Uint8Array([0x80 | bytes.length, ...bytes]);\n}\n//# sourceMappingURL=length.js.map","export function base64ToUint8Array(base64) {\n    const binaryString = atob(base64);\n    const length = binaryString.length;\n    const bytes = new Uint8Array(length);\n    for (let i = 0; i < length; i++) {\n        bytes[i] = binaryString.charCodeAt(i);\n    }\n    return bytes;\n}\nexport function base64UrlToUint8Array(base64url) {\n    let base64 = base64url.replace(/-/g, '+').replace(/_/g, '/');\n    while (base64.length % 4 !== 0) {\n        base64 += '=';\n    }\n    return base64ToUint8Array(base64);\n}\nexport function Uint8ArrayToBase64(uint8Array) {\n    let binaryString = \"\";\n    for (let i = 0; i < uint8Array.length; i++) {\n        binaryString += String.fromCharCode(uint8Array[i]);\n    }\n    return btoa(binaryString);\n}\nexport function hexToUint8Array(hex) {\n    if (hex.length % 2 !== 0) {\n        throw new Error(\"Hex string must have an even length\");\n    }\n    const length = hex.length / 2;\n    const uint8Array = new Uint8Array(length);\n    for (let i = 0; i < length; i++) {\n        uint8Array[i] = parseInt(hex.slice(i * 2, i * 2 + 2), 16);\n    }\n    return uint8Array;\n}\nexport function Uint8ArrayToHex(data) {\n    let hexString = \"\";\n    for (let i = 0; i < data.length; i++) {\n        let hex = data[i].toString(16);\n        if (hex.length === 1) {\n            hex = \"0\" + hex;\n        }\n        hexString += hex;\n    }\n    return hexString;\n}\nexport function stringToUint8Array(str) {\n    const encoder = new TextEncoder();\n    return encoder.encode(str);\n}\nexport function Uint8ArrayToString(uint8Array) {\n    const decoder = new TextDecoder(\"utf-8\");\n    return decoder.decode(uint8Array);\n}\nexport function readBigInt64BE(uint8Array, offset) {\n    if (offset === undefined) {\n        offset = 0;\n    }\n    const hex = Uint8ArrayToHex(uint8Array.slice(offset, offset + 8));\n    return BigInt(`0x${hex}`);\n}\nexport function base64Encode(str) {\n    return Uint8ArrayToBase64(stringToUint8Array(str));\n}\nexport function base64Decode(str) {\n    return Uint8ArrayToString(base64ToUint8Array(str));\n}\nexport function uint8ArrayEqual(a, b) {\n    if (a.byteLength !== b.byteLength) {\n        return false;\n    }\n    let result = 0;\n    for (let i = 0; i < a.byteLength; i++) {\n        result |= a[i] ^ b[i];\n    }\n    return result === 0;\n}\n//# sourceMappingURL=encoding.js.map","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nAdapted from: https://github.com/sigstore/sigstore-js/blob/main/packages/core/src/asn1/parse.ts\nChanges: Buffer → Uint8Array for browser compatibility, uses Uint8ArrayToString helper\n*/\nimport { Uint8ArrayToString } from \"../encoding.js\";\nconst RE_TIME_SHORT_YEAR = /^(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\.\\d{3})?Z$/;\nconst RE_TIME_LONG_YEAR = /^(\\d{4})(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\d{2})(\\.\\d{3})?Z$/;\n// Parse a BigInt from the DER-encoded buffer\n// https://learn.microsoft.com/en-us/windows/win32/seccertenroll/about-integer\nexport function parseInteger(buf) {\n    let pos = 0;\n    const end = buf.length;\n    let val = buf[pos];\n    const neg = val > 0x7f;\n    // Consume any padding bytes\n    const pad = neg ? 0xff : 0x00;\n    while (val == pad && ++pos < end) {\n        val = buf[pos];\n    }\n    // Calculate remaining bytes to read\n    const len = end - pos;\n    if (len === 0)\n        return BigInt(neg ? -1 : 0);\n    // Handle two's complement for negative numbers\n    val = neg ? val - 256 : val;\n    // Parse remaining bytes\n    let n = BigInt(val);\n    for (let i = pos + 1; i < end; ++i) {\n        n = n * BigInt(256) + BigInt(buf[i]);\n    }\n    return n;\n}\n// Parse an ASCII string from the DER-encoded buffer\n// https://learn.microsoft.com/en-us/windows/win32/seccertenroll/about-basic-types#boolean\nexport function parseStringASCII(buf) {\n    return Uint8ArrayToString(buf);\n}\n// Parse a Date from the DER-encoded buffer\n// https://www.rfc-editor.org/rfc/rfc5280#section-4.1.2.5.1\nexport function parseTime(buf, shortYear) {\n    const timeStr = parseStringASCII(buf);\n    // Parse the time string into matches - captured groups start at index 1\n    const m = shortYear\n        ? RE_TIME_SHORT_YEAR.exec(timeStr)\n        : RE_TIME_LONG_YEAR.exec(timeStr);\n    if (!m) {\n        throw new Error(\"invalid time\");\n    }\n    // Translate dates with a 2-digit year to 4 digits per the spec\n    if (shortYear) {\n        let year = Number(m[1]);\n        year += year >= 50 ? 1900 : 2000;\n        m[1] = year.toString();\n    }\n    // Translate to ISO8601 format and parse\n    return new Date(`${m[1]}-${m[2]}-${m[3]}T${m[4]}:${m[5]}:${m[6]}Z`);\n}\n// Parse an OID from the DER-encoded buffer\n// https://learn.microsoft.com/en-us/windows/win32/seccertenroll/about-object-identifier\nexport function parseOID(buf) {\n    let pos = 0;\n    const end = buf.length;\n    // Consume first byte which encodes the first two OID components\n    let n = buf[pos++];\n    const first = Math.floor(n / 40);\n    const second = n % 40;\n    let oid = `${first}.${second}`;\n    // Consume remaining bytes\n    let val = 0;\n    for (; pos < end; ++pos) {\n        n = buf[pos];\n        val = (val << 7) + (n & 0x7f);\n        // If the left-most bit is NOT set, then this is the last byte in the\n        // sequence and we can add the value to the OID and reset the accumulator\n        if ((n & 0x80) === 0) {\n            oid += `.${val}`;\n            val = 0;\n        }\n    }\n    return oid;\n}\n// Parse a boolean from the DER-encoded buffer\n// https://learn.microsoft.com/en-us/windows/win32/seccertenroll/about-basic-types#boolean\nexport function parseBoolean(buf) {\n    return buf[0] !== 0;\n}\n// Parse a bit string from the DER-encoded buffer\n// https://learn.microsoft.com/en-us/windows/win32/seccertenroll/about-bit-string\nexport function parseBitString(buf) {\n    // First byte tell us how many unused bits are in the last byte\n    const unused = buf[0];\n    const start = 1;\n    const end = buf.length;\n    const bits = [];\n    for (let i = start; i < end; ++i) {\n        const byte = buf[i];\n        // The skip value is only used for the last byte\n        const skip = i === end - 1 ? unused : 0;\n        // Iterate over each bit in the byte (most significant first)\n        for (let j = 7; j >= skip; --j) {\n            // Read the bit and add it to the bit string\n            bits.push((byte >> j) & 0x01);\n        }\n    }\n    return bits;\n}\n//# sourceMappingURL=parse.js.map","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nAdapted from: https://github.com/sigstore/sigstore-js/blob/main/packages/core/src/stream.ts\nChanges: None (identical to upstream)\n*/\nclass StreamError extends Error {\n}\nexport class ByteStream {\n    constructor(buffer) {\n        this.start = 0;\n        this.view = buffer ?? new Uint8Array(0);\n    }\n    get buffer() {\n        return this.view.subarray(0, this.start);\n    }\n    get length() {\n        return this.view.byteLength;\n    }\n    get position() {\n        return this.start;\n    }\n    seek(position) {\n        this.start = position;\n    }\n    slice(start, len) {\n        const end = start + len;\n        if (end > this.length) {\n            throw new StreamError(\"request past end of buffer\");\n        }\n        return this.view.subarray(start, end);\n    }\n    appendChar(char) {\n        this.ensureCapacity(1);\n        this.view[this.start] = char;\n        this.start += 1;\n    }\n    appendUint16(num) {\n        this.ensureCapacity(2);\n        const value = new Uint16Array([num]);\n        const view = new Uint8Array(value.buffer);\n        this.view[this.start] = view[1];\n        this.view[this.start + 1] = view[0];\n        this.start += 2;\n    }\n    appendUint24(num) {\n        this.ensureCapacity(3);\n        const value = new Uint32Array([num]);\n        const view = new Uint8Array(value.buffer);\n        this.view[this.start] = view[2];\n        this.view[this.start + 1] = view[1];\n        this.view[this.start + 2] = view[0];\n        this.start += 3;\n    }\n    appendView(view) {\n        this.ensureCapacity(view.length);\n        this.view.set(view, this.start);\n        this.start += view.length;\n    }\n    getBlock(size) {\n        if (size <= 0) {\n            return new Uint8Array(0);\n        }\n        if (this.start + size > this.view.length) {\n            throw new Error(\"request past end of buffer\");\n        }\n        const result = this.view.subarray(this.start, this.start + size);\n        this.start += size;\n        return result;\n    }\n    getUint8() {\n        return this.getBlock(1)[0];\n    }\n    getUint16() {\n        const block = this.getBlock(2);\n        return (block[0] << 8) | block[1];\n    }\n    ensureCapacity(size) {\n        if (this.start + size > this.view.byteLength) {\n            const blockSize = ByteStream.BLOCK_SIZE + (size > ByteStream.BLOCK_SIZE ? size : 0);\n            this.realloc(this.view.byteLength + blockSize);\n        }\n    }\n    realloc(size) {\n        const newView = new Uint8Array(size);\n        newView.set(this.view);\n        this.view = newView;\n    }\n}\nByteStream.BLOCK_SIZE = 1024;\n//# sourceMappingURL=stream.js.map","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nAdapted from: https://github.com/sigstore/sigstore-js/blob/main/packages/core/src/asn1/obj.ts\nChanges: Buffer → Uint8Array for browser compatibility\n*/\nimport { ByteStream } from \"../stream.js\";\nimport { ASN1ParseError, ASN1TypeError } from \"./error.js\";\nimport { decodeLength, encodeLength } from \"./length.js\";\nimport { parseBitString, parseBoolean, parseInteger, parseOID, parseTime, } from \"./parse.js\";\nimport { ASN1Tag } from \"./tag.js\";\nexport class ASN1Obj {\n    constructor(tag, value, subs) {\n        this.tag = tag;\n        this.value = value;\n        this.subs = subs;\n    }\n    // Constructs an ASN.1 object from a Buffer of DER-encoded bytes.\n    static parseBuffer(buf) {\n        return parseStream(new ByteStream(buf));\n    }\n    toDER() {\n        const valueStream = new ByteStream();\n        if (this.subs.length > 0) {\n            for (const sub of this.subs) {\n                valueStream.appendView(sub.toDER());\n            }\n        }\n        else {\n            valueStream.appendView(this.value);\n        }\n        const value = valueStream.buffer;\n        // Concat tag/length/value\n        const obj = new ByteStream();\n        obj.appendChar(this.tag.toDER());\n        obj.appendView(encodeLength(value.length));\n        obj.appendView(value);\n        return obj.buffer;\n    }\n    /////////////////////////////////////////////////////////////////////////////\n    // Convenience methods for parsing ASN.1 primitives into JS types\n    // Returns the ASN.1 object's value as a boolean. Throws an error if the\n    // object is not a boolean.\n    toBoolean() {\n        if (!this.tag.isBoolean()) {\n            throw new ASN1TypeError('not a boolean');\n        }\n        return parseBoolean(this.value);\n    }\n    // Returns the ASN.1 object's value as a BigInt. Throws an error if the\n    // object is not an integer.\n    toInteger() {\n        if (!this.tag.isInteger()) {\n            throw new ASN1TypeError('not an integer');\n        }\n        return parseInteger(this.value);\n    }\n    // Returns the ASN.1 object's value as an OID string. Throws an error if the\n    // object is not an OID.\n    toOID() {\n        if (!this.tag.isOID()) {\n            throw new ASN1TypeError('not an OID');\n        }\n        return parseOID(this.value);\n    }\n    // Returns the ASN.1 object's value as a Date. Throws an error if the object\n    // is not either a UTCTime or a GeneralizedTime.\n    toDate() {\n        switch (true) {\n            case this.tag.isUTCTime():\n                return parseTime(this.value, true);\n            case this.tag.isGeneralizedTime():\n                return parseTime(this.value, false);\n            default:\n                throw new ASN1TypeError('not a date');\n        }\n    }\n    // Returns the ASN.1 object's value as a number[] where each number is the\n    // value of a bit in the bit string. Throws an error if the object is not a\n    // bit string.\n    toBitString() {\n        if (!this.tag.isBitString()) {\n            throw new ASN1TypeError('not a bit string');\n        }\n        return parseBitString(this.value);\n    }\n}\n/////////////////////////////////////////////////////////////////////////////\n// Internal stream parsing functions\nfunction parseStream(stream) {\n    // Parse tag, length, and value from stream\n    const tag = new ASN1Tag(stream.getUint8());\n    const len = decodeLength(stream);\n    const value = stream.slice(stream.position, len);\n    const start = stream.position;\n    let subs = [];\n    // If the object is constructed, parse its children. Sometimes, children\n    // are embedded in OCTESTRING objects, so we need to check those\n    // for children as well.\n    if (tag.constructed) {\n        subs = collectSubs(stream, len);\n    }\n    else if (tag.isOctetString()) {\n        // Attempt to parse children of OCTETSTRING objects. If anything fails,\n        // assume the object is not constructed and treat as primitive.\n        try {\n            subs = collectSubs(stream, len);\n        }\n        catch (e) {\n            // Fail silently and treat as primitive\n        }\n    }\n    // If there are no children, move stream cursor to the end of the object\n    if (subs.length === 0) {\n        stream.seek(start + len);\n    }\n    return new ASN1Obj(tag, value, subs);\n}\nfunction collectSubs(stream, len) {\n    // Calculate end of object content\n    const end = stream.position + len;\n    // Make sure there are enough bytes left in the stream. This should never\n    // happen, cause it'll get caught when the stream is sliced in parseStream.\n    // Leaving as an extra check just in case.\n    /* istanbul ignore if */\n    if (end > stream.length) {\n        throw new ASN1ParseError('invalid length');\n    }\n    // Parse all children\n    const subs = [];\n    while (stream.position < end) {\n        subs.push(parseStream(stream));\n    }\n    // When we're done parsing children, we should be at the end of the object\n    if (stream.position !== end) {\n        throw new ASN1ParseError('invalid length');\n    }\n    return subs;\n}\n//# sourceMappingURL=obj.js.map","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nAdapted from: https://github.com/sigstore/sigstore-js/blob/main/packages/core/src/pem.ts\nChanges: None (identical to upstream)\n*/\nimport { base64ToUint8Array, Uint8ArrayToBase64 } from \"./encoding.js\";\nconst PEM_HEADER = /-----BEGIN (.*)-----/;\nconst PEM_FOOTER = /-----END (.*)-----/;\nexport function toDER(certificate) {\n    let der = \"\";\n    certificate.split(\"\\n\").forEach((line) => {\n        if (line.match(PEM_HEADER) || line.match(PEM_FOOTER)) {\n            return;\n        }\n        der += line;\n    });\n    return base64ToUint8Array(der);\n}\n// Translates a DER-encoded buffer into a PEM-encoded string. Standard PEM\n// encoding dictates that each certificate should have a trailing newline after\n// the footer.\nexport function fromDER(certificate, type = \"CERTIFICATE\") {\n    // Base64-encode the certificate.\n    const der = Uint8ArrayToBase64(certificate);\n    // Split the certificate into lines of 64 characters.\n    const lines = der.match(/.{1,64}/g) || \"\";\n    return [`-----BEGIN ${type}-----`, ...lines, `-----END ${type}-----`]\n        .join(\"\\n\")\n        .concat(\"\\n\");\n}\n//# sourceMappingURL=pem.js.map","// Adapted from: https://github.com/theupdateframework/tuf-js/blob/main/packages/canonical-json/lib/index.js\nconst COMMA = \",\";\nconst COLON = \":\";\nconst LEFT_SQUARE_BRACKET = \"[\";\nconst RIGHT_SQUARE_BRACKET = \"]\";\nconst LEFT_CURLY_BRACKET = \"{\";\nconst RIGHT_CURLY_BRACKET = \"}\";\nfunction canonicalizeString(string) {\n    const escapedString = string.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, '\\\\\"');\n    return '\"' + escapedString + '\"';\n}\n// Recursively encodes the supplied object according to the canonical JSON form\n// as specified at http://wiki.laptop.org/go/Canonical_JSON. It's a restricted\n// dialect of JSON in which keys are lexically sorted, floats are not allowed,\n// and only double quotes and backslashes are escaped.\nexport function canonicalize(object) {\n    const buffer = [];\n    if (typeof object === \"string\") {\n        buffer.push(canonicalizeString(object));\n    }\n    else if (typeof object === \"boolean\") {\n        buffer.push(JSON.stringify(object));\n    }\n    else if (Number.isInteger(object)) {\n        buffer.push(JSON.stringify(object));\n    }\n    else if (object === null) {\n        buffer.push(JSON.stringify(object));\n    }\n    else if (Array.isArray(object)) {\n        buffer.push(LEFT_SQUARE_BRACKET);\n        let first = true;\n        object.forEach((element) => {\n            if (!first) {\n                buffer.push(COMMA);\n            }\n            first = false;\n            buffer.push(canonicalize(element));\n        });\n        buffer.push(RIGHT_SQUARE_BRACKET);\n    }\n    else if (typeof object === \"object\") {\n        buffer.push(LEFT_CURLY_BRACKET);\n        let first = true;\n        Object.keys(object)\n            .sort()\n            .forEach((property) => {\n            if (!first) {\n                buffer.push(COMMA);\n            }\n            first = false;\n            buffer.push(canonicalizeString(property));\n            buffer.push(COLON);\n            // eslint-disable-next-line\n            buffer.push(canonicalize(object[property])); // 'any' as a fallback\n        });\n        buffer.push(RIGHT_CURLY_BRACKET);\n    }\n    else {\n        throw new TypeError(\"cannot encode \" + object);\n    }\n    return buffer.join(\"\");\n}\n//# sourceMappingURL=canonicalize.js.map","export var KeyTypes;\n(function (KeyTypes) {\n    KeyTypes[\"Ecdsa\"] = \"ECDSA\";\n    KeyTypes[\"Ed25519\"] = \"Ed25519\";\n    KeyTypes[\"RSA\"] = \"RSA\";\n})(KeyTypes || (KeyTypes = {}));\nexport var EcdsaTypes;\n(function (EcdsaTypes) {\n    EcdsaTypes[\"P256\"] = \"P-256\";\n    EcdsaTypes[\"P384\"] = \"P-384\";\n    EcdsaTypes[\"P521\"] = \"P-521\";\n})(EcdsaTypes || (EcdsaTypes = {}));\nexport var HashAlgorithms;\n(function (HashAlgorithms) {\n    HashAlgorithms[\"SHA256\"] = \"SHA-256\";\n    HashAlgorithms[\"SHA384\"] = \"SHA-384\";\n    HashAlgorithms[\"SHA512\"] = \"SHA-512\";\n})(HashAlgorithms || (HashAlgorithms = {}));\nexport var RsaAlgorithms;\n(function (RsaAlgorithms) {\n    RsaAlgorithms[\"PKCS1v15\"] = \"RSASSA-PKCS1-v1_5\";\n    RsaAlgorithms[\"PSS\"] = \"RSA-PSS\";\n})(RsaAlgorithms || (RsaAlgorithms = {}));\nexport var RsaSchemes;\n(function (RsaSchemes) {\n    RsaSchemes[\"PKCS1\"] = \"PKCS1\";\n    RsaSchemes[\"RSAPKCS1\"] = \"RSAPKCS1\";\n})(RsaSchemes || (RsaSchemes = {}));\n//# sourceMappingURL=interfaces.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a) {\n    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is positive integer. */\nexport function anumber(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error('positive integer expected, got ' + n);\n}\n/** Asserts something is Uint8Array. */\nexport function abytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error('Uint8Array expected of length ' + lengths + ', got length=' + b.length);\n}\n/** Asserts something is hash */\nexport function ahash(h) {\n    if (typeof h !== 'function' || typeof h.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.createHasher');\n    anumber(h.outputLen);\n    anumber(h.blockLen);\n}\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out, instance) {\n    abytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error('digestInto() expects output buffer of length at least ' + min);\n    }\n}\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr) {\n    return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr) {\n    return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays) {\n    for (let i = 0; i < arrays.length; i++) {\n        arrays[i].fill(0);\n    }\n}\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr) {\n    return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word, shift) {\n    return (word << (32 - shift)) | (word >>> shift);\n}\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word, shift) {\n    return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/** The byte swap operation for uint32 */\nexport function byteSwap(word) {\n    return (((word << 24) & 0xff000000) |\n        ((word << 8) & 0xff0000) |\n        ((word >>> 8) & 0xff00) |\n        ((word >>> 24) & 0xff));\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE = isLE\n    ? (n) => n\n    : (n) => byteSwap(n);\n/** @deprecated */\nexport const byteSwapIfBE = swap8IfBE;\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n    return arr;\n}\nexport const swap32IfBE = isLE\n    ? (u) => u\n    : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = /* @__PURE__ */ (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // @ts-ignore\n    if (hasHexBuiltin)\n        return bytes.toHex();\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n    if (ch >= asciis._0 && ch <= asciis._9)\n        return ch - asciis._0; // '2' => 50-48\n    if (ch >= asciis.A && ch <= asciis.F)\n        return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n    if (ch >= asciis.a && ch <= asciis.f)\n        return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n    return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // @ts-ignore\n    if (hasHexBuiltin)\n        return Uint8Array.fromHex(hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n    }\n    return array;\n}\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\nexport const nextTick = async () => { };\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * Converts string to bytes using UTF8 encoding.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error('string expected');\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes) {\n    return new TextDecoder().decode(bytes);\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    abytes(data);\n    return data;\n}\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    abytes(data);\n    return data;\n}\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n        throw new Error('options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\n/** For runtime check if class implements interface */\nexport class Hash {\n}\n/** Wraps hash function, creating an interface on top of it */\nexport function createHasher(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function createOptHasher(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function createXOFer(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport const wrapConstructor = createHasher;\nexport const wrapConstructorWithOpts = createOptHasher;\nexport const wrapXOFConstructorWithOpts = createXOFer;\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    // Legacy Node.js compatibility\n    if (crypto && typeof crypto.randomBytes === 'function') {\n        return Uint8Array.from(crypto.randomBytes(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { Hash, abytes, aexists, aoutput, clean, createView, toBytes } from \"./utils.js\";\n/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */\nexport function setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, value, isLE);\n    const _32n = BigInt(32);\n    const _u32_max = BigInt(0xffffffff);\n    const wh = Number((value >> _32n) & _u32_max);\n    const wl = Number(value & _u32_max);\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n/** Choice: a ? b : c */\nexport function Chi(a, b, c) {\n    return (a & b) ^ (~a & c);\n}\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a, b, c) {\n    return (a & b) ^ (a & c) ^ (b & c);\n}\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport class HashMD extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        aexists(this);\n        data = toBytes(data);\n        abytes(data);\n        const { view, buffer, blockLen } = this;\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        aoutput(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        clean(this.buffer.subarray(pos));\n        // we have less than padOffset left in buffer, so we cannot put length in\n        // current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.destroyed = destroyed;\n        to.finished = finished;\n        to.length = length;\n        to.pos = pos;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n    clone() {\n        return this._cloneInto();\n    }\n}\n/**\n * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n */\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV = /* @__PURE__ */ Uint32Array.from([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV = /* @__PURE__ */ Uint32Array.from([\n    0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV = /* @__PURE__ */ Uint32Array.from([\n    0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n    0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV = /* @__PURE__ */ Uint32Array.from([\n    0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n    0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n//# sourceMappingURL=_md.js.map","/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\nfunction fromBig(n, le = false) {\n    if (le)\n        return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n    return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n    const len = lst.length;\n    let Ah = new Uint32Array(len);\n    let Al = new Uint32Array(len);\n    for (let i = 0; i < len; i++) {\n        const { h, l } = fromBig(lst[i], le);\n        [Ah[i], Al[i]] = [h, l];\n    }\n    return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n    const l = (Al >>> 0) + (Bl >>> 0);\n    return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig };\n// prettier-ignore\nconst u64 = {\n    fromBig, split, toBig,\n    shrSH, shrSL,\n    rotrSH, rotrSL, rotrBH, rotrBL,\n    rotr32H, rotr32L,\n    rotlSH, rotlSL, rotlBH, rotlBL,\n    add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","/**\n * SHA2 hash function. A.k.a. sha256, sha384, sha512, sha512_224, sha512_256.\n * SHA256 is the fastest hash implementable in JS, even faster than Blake3.\n * Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and\n * [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n */\nimport { Chi, HashMD, Maj, SHA224_IV, SHA256_IV, SHA384_IV, SHA512_IV } from \"./_md.js\";\nimport * as u64 from \"./_u64.js\";\nimport { clean, createHasher, rotr } from \"./utils.js\";\n/**\n * Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n */\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ Uint32Array.from([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nexport class SHA256 extends HashMD {\n    constructor(outputLen = 32) {\n        super(64, outputLen, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = SHA256_IV[0] | 0;\n        this.B = SHA256_IV[1] | 0;\n        this.C = SHA256_IV[2] | 0;\n        this.D = SHA256_IV[3] | 0;\n        this.E = SHA256_IV[4] | 0;\n        this.F = SHA256_IV[5] | 0;\n        this.G = SHA256_IV[6] | 0;\n        this.H = SHA256_IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        clean(SHA256_W);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        clean(this.buffer);\n    }\n}\nexport class SHA224 extends SHA256 {\n    constructor() {\n        super(28);\n        this.A = SHA224_IV[0] | 0;\n        this.B = SHA224_IV[1] | 0;\n        this.C = SHA224_IV[2] | 0;\n        this.D = SHA224_IV[3] | 0;\n        this.E = SHA224_IV[4] | 0;\n        this.F = SHA224_IV[5] | 0;\n        this.G = SHA224_IV[6] | 0;\n        this.H = SHA224_IV[7] | 0;\n    }\n}\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = /* @__PURE__ */ (() => u64.split([\n    '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n    '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n    '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n    '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n    '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n    '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n    '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n    '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n    '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n    '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n    '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n    '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n    '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n    '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n    '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n    '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n    '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n    '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n    '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n    '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = /* @__PURE__ */ (() => K512[0])();\nconst SHA512_Kl = /* @__PURE__ */ (() => K512[1])();\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends HashMD {\n    constructor(outputLen = 64) {\n        super(128, outputLen, 16, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = SHA512_IV[0] | 0;\n        this.Al = SHA512_IV[1] | 0;\n        this.Bh = SHA512_IV[2] | 0;\n        this.Bl = SHA512_IV[3] | 0;\n        this.Ch = SHA512_IV[4] | 0;\n        this.Cl = SHA512_IV[5] | 0;\n        this.Dh = SHA512_IV[6] | 0;\n        this.Dl = SHA512_IV[7] | 0;\n        this.Eh = SHA512_IV[8] | 0;\n        this.El = SHA512_IV[9] | 0;\n        this.Fh = SHA512_IV[10] | 0;\n        this.Fl = SHA512_IV[11] | 0;\n        this.Gh = SHA512_IV[12] | 0;\n        this.Gl = SHA512_IV[13] | 0;\n        this.Hh = SHA512_IV[14] | 0;\n        this.Hl = SHA512_IV[15] | 0;\n    }\n    // prettier-ignore\n    get() {\n        const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n    }\n    // prettier-ignore\n    set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n        this.Ah = Ah | 0;\n        this.Al = Al | 0;\n        this.Bh = Bh | 0;\n        this.Bl = Bl | 0;\n        this.Ch = Ch | 0;\n        this.Cl = Cl | 0;\n        this.Dh = Dh | 0;\n        this.Dl = Dl | 0;\n        this.Eh = Eh | 0;\n        this.El = El | 0;\n        this.Fh = Fh | 0;\n        this.Fl = Fl | 0;\n        this.Gh = Gh | 0;\n        this.Gl = Gl | 0;\n        this.Hh = Hh | 0;\n        this.Hl = Hl | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4) {\n            SHA512_W_H[i] = view.getUint32(offset);\n            SHA512_W_L[i] = view.getUint32((offset += 4));\n        }\n        for (let i = 16; i < 80; i++) {\n            // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n            const W15h = SHA512_W_H[i - 15] | 0;\n            const W15l = SHA512_W_L[i - 15] | 0;\n            const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n            const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n            // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n            const W2h = SHA512_W_H[i - 2] | 0;\n            const W2l = SHA512_W_L[i - 2] | 0;\n            const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n            const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n            const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n            const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n            SHA512_W_H[i] = SUMh | 0;\n            SHA512_W_L[i] = SUMl | 0;\n        }\n        let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        // Compression function main loop, 80 rounds\n        for (let i = 0; i < 80; i++) {\n            // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n            const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n            const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n            //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n            const CHIl = (El & Fl) ^ (~El & Gl);\n            // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n            // prettier-ignore\n            const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n            const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n            const T1l = T1ll | 0;\n            // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n            const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n            const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n            const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n            const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n            Hh = Gh | 0;\n            Hl = Gl | 0;\n            Gh = Fh | 0;\n            Gl = Fl | 0;\n            Fh = Eh | 0;\n            Fl = El | 0;\n            ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n            Dh = Ch | 0;\n            Dl = Cl | 0;\n            Ch = Bh | 0;\n            Cl = Bl | 0;\n            Bh = Ah | 0;\n            Bl = Al | 0;\n            const All = u64.add3L(T1l, sigma0l, MAJl);\n            Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n            Al = All | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n        ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n        ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n        ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n        ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n        ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n        ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n        ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n        this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n    }\n    roundClean() {\n        clean(SHA512_W_H, SHA512_W_L);\n    }\n    destroy() {\n        clean(this.buffer);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\nexport class SHA384 extends SHA512 {\n    constructor() {\n        super(48);\n        this.Ah = SHA384_IV[0] | 0;\n        this.Al = SHA384_IV[1] | 0;\n        this.Bh = SHA384_IV[2] | 0;\n        this.Bl = SHA384_IV[3] | 0;\n        this.Ch = SHA384_IV[4] | 0;\n        this.Cl = SHA384_IV[5] | 0;\n        this.Dh = SHA384_IV[6] | 0;\n        this.Dl = SHA384_IV[7] | 0;\n        this.Eh = SHA384_IV[8] | 0;\n        this.El = SHA384_IV[9] | 0;\n        this.Fh = SHA384_IV[10] | 0;\n        this.Fl = SHA384_IV[11] | 0;\n        this.Gh = SHA384_IV[12] | 0;\n        this.Gl = SHA384_IV[13] | 0;\n        this.Hh = SHA384_IV[14] | 0;\n        this.Hl = SHA384_IV[15] | 0;\n    }\n}\n/**\n * Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n */\n/** SHA512/224 IV */\nconst T224_IV = /* @__PURE__ */ Uint32Array.from([\n    0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n    0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n/** SHA512/256 IV */\nconst T256_IV = /* @__PURE__ */ Uint32Array.from([\n    0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n    0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\nexport class SHA512_224 extends SHA512 {\n    constructor() {\n        super(28);\n        this.Ah = T224_IV[0] | 0;\n        this.Al = T224_IV[1] | 0;\n        this.Bh = T224_IV[2] | 0;\n        this.Bl = T224_IV[3] | 0;\n        this.Ch = T224_IV[4] | 0;\n        this.Cl = T224_IV[5] | 0;\n        this.Dh = T224_IV[6] | 0;\n        this.Dl = T224_IV[7] | 0;\n        this.Eh = T224_IV[8] | 0;\n        this.El = T224_IV[9] | 0;\n        this.Fh = T224_IV[10] | 0;\n        this.Fl = T224_IV[11] | 0;\n        this.Gh = T224_IV[12] | 0;\n        this.Gl = T224_IV[13] | 0;\n        this.Hh = T224_IV[14] | 0;\n        this.Hl = T224_IV[15] | 0;\n    }\n}\nexport class SHA512_256 extends SHA512 {\n    constructor() {\n        super(32);\n        this.Ah = T256_IV[0] | 0;\n        this.Al = T256_IV[1] | 0;\n        this.Bh = T256_IV[2] | 0;\n        this.Bl = T256_IV[3] | 0;\n        this.Ch = T256_IV[4] | 0;\n        this.Cl = T256_IV[5] | 0;\n        this.Dh = T256_IV[6] | 0;\n        this.Dl = T256_IV[7] | 0;\n        this.Eh = T256_IV[8] | 0;\n        this.El = T256_IV[9] | 0;\n        this.Fh = T256_IV[10] | 0;\n        this.Fl = T256_IV[11] | 0;\n        this.Gh = T256_IV[12] | 0;\n        this.Gl = T256_IV[13] | 0;\n        this.Hh = T256_IV[14] | 0;\n        this.Hl = T256_IV[15] | 0;\n    }\n}\n/**\n * SHA2-256 hash function from RFC 4634.\n *\n * It is the fastest JS hash, even faster than Blake3.\n * To break sha256 using birthday attack, attackers need to try 2^128 hashes.\n * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n */\nexport const sha256 = /* @__PURE__ */ createHasher(() => new SHA256());\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224 = /* @__PURE__ */ createHasher(() => new SHA224());\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512 = /* @__PURE__ */ createHasher(() => new SHA512());\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384 = /* @__PURE__ */ createHasher(() => new SHA384());\n/**\n * SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n */\nexport const sha512_256 = /* @__PURE__ */ createHasher(() => new SHA512_256());\n/**\n * SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n */\nexport const sha512_224 = /* @__PURE__ */ createHasher(() => new SHA512_224());\n//# sourceMappingURL=sha2.js.map","/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, Hash, toBytes } from \"./utils.js\";\nexport class HMAC extends Hash {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        ahash(hash);\n        const key = toBytes(_key);\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('Expected instance of class which extends utils.Hash');\n        this.blockLen = this.iHash.blockLen;\n        this.outputLen = this.iHash.outputLen;\n        const blockLen = this.blockLen;\n        const pad = new Uint8Array(blockLen);\n        // blockLen can be bigger than outputLen\n        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36;\n        this.iHash.update(pad);\n        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n        this.oHash = hash.create();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        clean(pad);\n    }\n    update(buf) {\n        aexists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        abytes(out, this.outputLen);\n        this.finished = true;\n        this.iHash.digestInto(out);\n        this.oHash.update(out);\n        this.oHash.digestInto(out);\n        this.destroy();\n    }\n    digest() {\n        const out = new Uint8Array(this.oHash.outputLen);\n        this.digestInto(out);\n        return out;\n    }\n    _cloneInto(to) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to || (to = Object.create(Object.getPrototypeOf(this), {}));\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    clone() {\n        return this._cloneInto();\n    }\n    destroy() {\n        this.destroyed = true;\n        this.oHash.destroy();\n        this.iHash.destroy();\n    }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n * @example\n * import { hmac } from '@noble/hashes/hmac';\n * import { sha256 } from '@noble/hashes/sha2';\n * const mac1 = hmac(sha256, 'key', 'message');\n */\nexport const hmac = (hash, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { abytes as abytes_, bytesToHex as bytesToHex_, concatBytes as concatBytes_, hexToBytes as hexToBytes_, isBytes as isBytes_, } from '@noble/hashes/utils.js';\nexport { abytes, anumber, bytesToHex, bytesToUtf8, concatBytes, hexToBytes, isBytes, randomBytes, utf8ToBytes, } from '@noble/hashes/utils.js';\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nexport function abool(title, value) {\n    if (typeof value !== 'boolean')\n        throw new Error(title + ' boolean expected, got ' + value);\n}\n// tmp name until v2\nexport function _abool2(value, title = '') {\n    if (typeof value !== 'boolean') {\n        const prefix = title && `\"${title}\"`;\n        throw new Error(prefix + 'expected boolean, got type=' + typeof value);\n    }\n    return value;\n}\n// tmp name until v2\n/** Asserts something is Uint8Array. */\nexport function _abytes2(value, length, title = '') {\n    const bytes = isBytes_(value);\n    const len = value?.length;\n    const needsLen = length !== undefined;\n    if (!bytes || (needsLen && len !== length)) {\n        const prefix = title && `\"${title}\" `;\n        const ofLen = needsLen ? ` of length ${length}` : '';\n        const got = bytes ? `length=${len}` : `type=${typeof value}`;\n        throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n    }\n    return value;\n}\n// Used in weierstrass, der\nexport function numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? '0' + hex : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex_(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    abytes_(bytes);\n    return hexToNumber(bytesToHex_(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes_(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes_(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'secret key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes_(hex);\n        }\n        catch (e) {\n            throw new Error(title + ' must be hex string or Uint8Array, cause: ' + e);\n        }\n    }\n    else if (isBytes_(hex)) {\n        // Uint8Array.from() instead of hash.slice() because node.js Buffer\n        // is instance of Uint8Array, and its slice() creates **mutable** copy\n        res = Uint8Array.from(hex);\n    }\n    else {\n        throw new Error(title + ' must be hex string or Uint8Array');\n    }\n    const len = res.length;\n    if (typeof expectedLength === 'number' && len !== expectedLength)\n        throw new Error(title + ' of length ' + expectedLength + ' expected, got ' + len);\n    return res;\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n    if (a.length !== b.length)\n        return false;\n    let diff = 0;\n    for (let i = 0; i < a.length; i++)\n        diff |= a[i] ^ b[i];\n    return diff === 0;\n}\n/**\n * Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,\n * and Buffer#slice creates mutable copy. Never use Buffers!\n */\nexport function copyBytes(bytes) {\n    return Uint8Array.from(bytes);\n}\n/**\n * Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols\n * Should be safe to use for things expected to be ASCII.\n * Returns exact same result as utf8ToBytes for ASCII or throws.\n */\nexport function asciiToBytes(ascii) {\n    return Uint8Array.from(ascii, (c, i) => {\n        const charCode = c.charCodeAt(0);\n        if (c.length !== 1 || charCode > 127) {\n            throw new Error(`string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`);\n        }\n        return charCode;\n    });\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\n// export const utf8ToBytes: typeof utf8ToBytes_ = utf8ToBytes_;\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\n// export const bytesToUtf8: typeof bytesToUtf8_ = bytesToUtf8_;\n// Is positive bigint\nconst isPosBig = (n) => typeof n === 'bigint' && _0n <= n;\nexport function inRange(n, min, max) {\n    return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n/**\n * Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n */\nexport function aInRange(title, n, min, max) {\n    // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n    // consider P=256n, min=0n, max=P\n    // - a for min=0 would require -1:          `inRange('x', x, -1n, P)`\n    // - b would commonly require subtraction:  `inRange('x', x, 0n, P - 1n)`\n    // - our way is the cleanest:               `inRange('x', x, 0n, P)\n    if (!inRange(n, min, max))\n        throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n * TODO: merge with nLength in modular\n */\nexport function bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n, pos, value) {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_1n << BigInt(n)) - _1n;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n    const u8n = (len) => new Uint8Array(len); // creates Uint8Array\n    const u8of = (byte) => Uint8Array.of(byte); // another shortcut\n    let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n    let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n    let i = 0; // Iterations counter, will throw when over 1000\n    const reset = () => {\n        v.fill(1);\n        k.fill(0);\n        i = 0;\n    };\n    const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n    const reseed = (seed = u8n(0)) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(u8of(0x00), seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(u8of(0x01), seed); // k = hmac(k || v || 0x01 || seed)\n        v = h(); // v = hmac(k || v)\n    };\n    const gen = () => {\n        // HMAC-DRBG generate() function\n        if (i++ >= 1000)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return concatBytes_(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    stringOrUint8Array: (val) => typeof val === 'string' || isBytes_(val),\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error('invalid validator function');\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error('param ' + String(fieldName) + ' is invalid. Expected ' + type + ', got ' + val);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        checkField(fieldName, type, true);\n    return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\nexport function isHash(val) {\n    return typeof val === 'function' && Number.isSafeInteger(val.outputLen);\n}\nexport function _validateObject(object, fields, optFields = {}) {\n    if (!object || typeof object !== 'object')\n        throw new Error('expected valid options object');\n    function checkField(fieldName, expectedType, isOpt) {\n        const val = object[fieldName];\n        if (isOpt && val === undefined)\n            return;\n        const current = typeof val;\n        if (current !== expectedType || val === null)\n            throw new Error(`param \"${fieldName}\" is invalid: expected ${expectedType}, got ${current}`);\n    }\n    Object.entries(fields).forEach(([k, v]) => checkField(k, v, false));\n    Object.entries(optFields).forEach(([k, v]) => checkField(k, v, true));\n}\n/**\n * throws not implemented error\n */\nexport const notImplemented = () => {\n    throw new Error('not implemented');\n};\n/**\n * Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n */\nexport function memoized(fn) {\n    const map = new WeakMap();\n    return (arg, ...args) => {\n        const val = map.get(arg);\n        if (val !== undefined)\n            return val;\n        const computed = fn(arg, ...args);\n        map.set(arg, computed);\n        return computed;\n    };\n}\n//# sourceMappingURL=utils.js.map","/**\n * Utils for modular division and fields.\n * Field over 11 is a finite (Galois) field is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { _validateObject, anumber, bitMask, bytesToNumberBE, bytesToNumberLE, ensureBytes, numberToBytesBE, numberToBytesLE, } from \"../utils.js\";\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = /* @__PURE__ */ BigInt(2), _3n = /* @__PURE__ */ BigInt(3);\n// prettier-ignore\nconst _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5), _7n = /* @__PURE__ */ BigInt(7);\n// prettier-ignore\nconst _8n = /* @__PURE__ */ BigInt(8), _9n = /* @__PURE__ */ BigInt(9), _16n = /* @__PURE__ */ BigInt(16);\n// Calculates a modulo b\nexport function mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\nexport function pow(num, power, modulo) {\n    return FpPow(Field(modulo), num, power);\n}\n/** Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` */\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n/**\n * Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n */\nexport function invert(number, modulo) {\n    if (number === _0n)\n        throw new Error('invert: expected non-zero number');\n    if (modulo <= _0n)\n        throw new Error('invert: expected positive modulus, got ' + modulo);\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = _0n, y = _1n, u = _1n, v = _0n;\n    while (a !== _0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== _1n)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\n}\nfunction assertIsSquare(Fp, root, n) {\n    if (!Fp.eql(Fp.sqr(root), n))\n        throw new Error('Cannot find square root');\n}\n// Not all roots are possible! Example which will throw:\n// const NUM =\n// n = 72057594037927816n;\n// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));\nfunction sqrt3mod4(Fp, n) {\n    const p1div4 = (Fp.ORDER + _1n) / _4n;\n    const root = Fp.pow(n, p1div4);\n    assertIsSquare(Fp, root, n);\n    return root;\n}\nfunction sqrt5mod8(Fp, n) {\n    const p5div8 = (Fp.ORDER - _5n) / _8n;\n    const n2 = Fp.mul(n, _2n);\n    const v = Fp.pow(n2, p5div8);\n    const nv = Fp.mul(n, v);\n    const i = Fp.mul(Fp.mul(nv, _2n), v);\n    const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n    assertIsSquare(Fp, root, n);\n    return root;\n}\n// Based on RFC9380, Kong algorithm\n// prettier-ignore\nfunction sqrt9mod16(P) {\n    const Fp_ = Field(P);\n    const tn = tonelliShanks(P);\n    const c1 = tn(Fp_, Fp_.neg(Fp_.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n    const c2 = tn(Fp_, c1); //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n    const c3 = tn(Fp_, Fp_.neg(c1)); //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n    const c4 = (P + _7n) / _16n; //  4. c4 = (q + 7) / 16        # Integer arithmetic\n    return (Fp, n) => {\n        let tv1 = Fp.pow(n, c4); //  1. tv1 = x^c4\n        let tv2 = Fp.mul(tv1, c1); //  2. tv2 = c1 * tv1\n        const tv3 = Fp.mul(tv1, c2); //  3. tv3 = c2 * tv1\n        const tv4 = Fp.mul(tv1, c3); //  4. tv4 = c3 * tv1\n        const e1 = Fp.eql(Fp.sqr(tv2), n); //  5.  e1 = (tv2^2) == x\n        const e2 = Fp.eql(Fp.sqr(tv3), n); //  6.  e2 = (tv3^2) == x\n        tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        const e3 = Fp.eql(Fp.sqr(tv2), n); //  9.  e3 = (tv2^2) == x\n        const root = Fp.cmov(tv1, tv2, e3); // 10.  z = CMOV(tv1, tv2, e3)   # Select sqrt from tv1 & tv2\n        assertIsSquare(Fp, root, n);\n        return root;\n    };\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n    // Initialization (precomputation).\n    // Caching initialization could boost perf by 7%.\n    if (P < _3n)\n        throw new Error('sqrt is not defined for small field');\n    // Factor P - 1 = Q * 2^S, where Q is odd\n    let Q = P - _1n;\n    let S = 0;\n    while (Q % _2n === _0n) {\n        Q /= _2n;\n        S++;\n    }\n    // Find the first quadratic non-residue Z >= 2\n    let Z = _2n;\n    const _Fp = Field(P);\n    while (FpLegendre(_Fp, Z) === 1) {\n        // Basic primality test for P. After x iterations, chance of\n        // not finding quadratic non-residue is 2^x, so 2^1000.\n        if (Z++ > 1000)\n            throw new Error('Cannot find square root: probably non-prime P');\n    }\n    // Fast-path; usually done before Z, but we do \"primality test\".\n    if (S === 1)\n        return sqrt3mod4;\n    // Slow-path\n    // TODO: test on Fp2 and others\n    let cc = _Fp.pow(Z, Q); // c = z^Q\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        if (Fp.is0(n))\n            return n;\n        // Check if n is a quadratic residue using Legendre symbol\n        if (FpLegendre(Fp, n) !== 1)\n            throw new Error('Cannot find square root');\n        // Initialize variables for the main loop\n        let M = S;\n        let c = Fp.mul(Fp.ONE, cc); // c = z^Q, move cc from field _Fp into field Fp\n        let t = Fp.pow(n, Q); // t = n^Q, first guess at the fudge factor\n        let R = Fp.pow(n, Q1div2); // R = n^((Q+1)/2), first guess at the square root\n        // Main loop\n        // while t != 1\n        while (!Fp.eql(t, Fp.ONE)) {\n            if (Fp.is0(t))\n                return Fp.ZERO; // if t=0 return R=0\n            let i = 1;\n            // Find the smallest i >= 1 such that t^(2^i) ≡ 1 (mod P)\n            let t_tmp = Fp.sqr(t); // t^(2^1)\n            while (!Fp.eql(t_tmp, Fp.ONE)) {\n                i++;\n                t_tmp = Fp.sqr(t_tmp); // t^(2^2)...\n                if (i === M)\n                    throw new Error('Cannot find square root');\n            }\n            // Calculate the exponent for b: 2^(M - i - 1)\n            const exponent = _1n << BigInt(M - i - 1); // bigint is important\n            const b = Fp.pow(c, exponent); // b = 2^(M - i - 1)\n            // Update variables\n            M = i;\n            c = Fp.sqr(b); // c = b^2\n            t = Fp.mul(t, c); // t = (t * b^2)\n            R = Fp.mul(R, b); // R = R*b\n        }\n        return R;\n    };\n}\n/**\n * Square root for a finite field. Will try optimized versions first:\n *\n * 1. P ≡ 3 (mod 4)\n * 2. P ≡ 5 (mod 8)\n * 3. P ≡ 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n *\n * Different algorithms can give different roots, it is up to user to decide which one they want.\n * For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n */\nexport function FpSqrt(P) {\n    // P ≡ 3 (mod 4) => √n = n^((P+1)/4)\n    if (P % _4n === _3n)\n        return sqrt3mod4;\n    // P ≡ 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf\n    if (P % _8n === _5n)\n        return sqrt5mod8;\n    // P ≡ 9 (mod 16) => Kong algorithm, page 11 of https://eprint.iacr.org/2012/685.pdf (algorithm 4)\n    if (P % _16n === _9n)\n        return sqrt9mod16(P);\n    // Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'number',\n        BITS: 'number',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    _validateObject(field, opts);\n    // const max = 16384;\n    // if (field.BYTES < 1 || field.BYTES > max) throw new Error('invalid field');\n    // if (field.BITS < 1 || field.BITS > 8 * max) throw new Error('invalid field');\n    return field;\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow(Fp, num, power) {\n    if (power < _0n)\n        throw new Error('invalid exponent, negatives unsupported');\n    if (power === _0n)\n        return Fp.ONE;\n    if (power === _1n)\n        return num;\n    let p = Fp.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = Fp.mul(p, d);\n        d = Fp.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * Exception-free. Will return `undefined` for 0 elements.\n * @param passZero map 0 to 0 (instead of undefined)\n */\nexport function FpInvertBatch(Fp, nums, passZero = false) {\n    const inverted = new Array(nums.length).fill(passZero ? Fp.ZERO : undefined);\n    // Walk from first to last, multiply them by each other MOD p\n    const multipliedAcc = nums.reduce((acc, num, i) => {\n        if (Fp.is0(num))\n            return acc;\n        inverted[i] = acc;\n        return Fp.mul(acc, num);\n    }, Fp.ONE);\n    // Invert last element\n    const invertedAcc = Fp.inv(multipliedAcc);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (Fp.is0(num))\n            return acc;\n        inverted[i] = Fp.mul(acc, inverted[i]);\n        return Fp.mul(acc, num);\n    }, invertedAcc);\n    return inverted;\n}\n// TODO: remove\nexport function FpDiv(Fp, lhs, rhs) {\n    return Fp.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, Fp.ORDER) : Fp.inv(rhs));\n}\n/**\n * Legendre symbol.\n * Legendre constant is used to calculate Legendre symbol (a | p)\n * which denotes the value of a^((p-1)/2) (mod p).\n *\n * * (a | p) ≡ 1    if a is a square (mod p), quadratic residue\n * * (a | p) ≡ -1   if a is not a square (mod p), quadratic non residue\n * * (a | p) ≡ 0    if a ≡ 0 (mod p)\n */\nexport function FpLegendre(Fp, n) {\n    // We can use 3rd argument as optional cache of this value\n    // but seems unneeded for now. The operation is very fast.\n    const p1mod2 = (Fp.ORDER - _1n) / _2n;\n    const powered = Fp.pow(n, p1mod2);\n    const yes = Fp.eql(powered, Fp.ONE);\n    const zero = Fp.eql(powered, Fp.ZERO);\n    const no = Fp.eql(powered, Fp.neg(Fp.ONE));\n    if (!yes && !zero && !no)\n        throw new Error('invalid Legendre symbol result');\n    return yes ? 1 : zero ? 0 : -1;\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(Fp, n) {\n    const l = FpLegendre(Fp, n);\n    return l === 1;\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    if (nBitLength !== undefined)\n        anumber(nBitLength);\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Creates a finite field. Major performance optimizations:\n * * 1. Denormalized operations like mulN instead of mul.\n * * 2. Identical object shape: never add or remove keys.\n * * 3. `Object.freeze`.\n * Fragile: always run a benchmark on a change.\n * Security note: operations don't check 'isValid' for all elements for performance reasons,\n * it is caller responsibility to check this.\n * This is low-level code, please make sure you know what you're doing.\n *\n * Note about field properties:\n * * CHARACTERISTIC p = prime number, number of elements in main subgroup.\n * * ORDER q = similar to cofactor in curves, may be composite `q = p^m`.\n *\n * @param ORDER field order, probably prime, or could be composite\n * @param bitLen how many bits the field consumes\n * @param isLE (default: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(ORDER, bitLenOrOpts, // TODO: use opts only in v2?\nisLE = false, opts = {}) {\n    if (ORDER <= _0n)\n        throw new Error('invalid field: expected ORDER > 0, got ' + ORDER);\n    let _nbitLength = undefined;\n    let _sqrt = undefined;\n    let modFromBytes = false;\n    let allowedLengths = undefined;\n    if (typeof bitLenOrOpts === 'object' && bitLenOrOpts != null) {\n        if (opts.sqrt || isLE)\n            throw new Error('cannot specify opts in two arguments');\n        const _opts = bitLenOrOpts;\n        if (_opts.BITS)\n            _nbitLength = _opts.BITS;\n        if (_opts.sqrt)\n            _sqrt = _opts.sqrt;\n        if (typeof _opts.isLE === 'boolean')\n            isLE = _opts.isLE;\n        if (typeof _opts.modFromBytes === 'boolean')\n            modFromBytes = _opts.modFromBytes;\n        allowedLengths = _opts.allowedLengths;\n    }\n    else {\n        if (typeof bitLenOrOpts === 'number')\n            _nbitLength = bitLenOrOpts;\n        if (opts.sqrt)\n            _sqrt = opts.sqrt;\n    }\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, _nbitLength);\n    if (BYTES > 2048)\n        throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n    let sqrtP; // cached sqrtP\n    const f = Object.freeze({\n        ORDER,\n        isLE,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: _0n,\n        ONE: _1n,\n        allowedLengths: allowedLengths,\n        create: (num) => mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error('invalid field element: expected bigint, got ' + typeof num);\n            return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === _0n,\n        // is valid and invertible\n        isValidNot0: (num) => !f.is0(num) && f.isValid(num),\n        isOdd: (num) => (num & _1n) === _1n,\n        neg: (num) => mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => mod(num * num, ORDER),\n        add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: _sqrt ||\n            ((n) => {\n                if (!sqrtP)\n                    sqrtP = FpSqrt(ORDER);\n                return sqrtP(f, n);\n            }),\n        toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes, skipValidation = true) => {\n            if (allowedLengths) {\n                if (!allowedLengths.includes(bytes.length) || bytes.length > BYTES) {\n                    throw new Error('Field.fromBytes: expected ' + allowedLengths + ' bytes, got ' + bytes.length);\n                }\n                const padded = new Uint8Array(BYTES);\n                // isLE add 0 to right, !isLE to the left.\n                padded.set(bytes, isLE ? 0 : padded.length - bytes.length);\n                bytes = padded;\n            }\n            if (bytes.length !== BYTES)\n                throw new Error('Field.fromBytes: expected ' + BYTES + ' bytes, got ' + bytes.length);\n            let scalar = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n            if (modFromBytes)\n                scalar = mod(scalar, ORDER);\n            if (!skipValidation)\n                if (!f.isValid(scalar))\n                    throw new Error('invalid field element: outside of range 0..ORDER');\n            // NOTE: we don't validate scalar here, please use isValid. This done such way because some\n            // protocol may allow non-reduced scalar that reduced later or changed some other way.\n            return scalar;\n        },\n        // TODO: we don't need it here, move out to separate fn\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // We can't move this out because Fp6, Fp12 implement it\n        // and it's unclear what to return in there.\n        cmov: (a, b, c) => (c ? b : a),\n    });\n    return Object.freeze(f);\n}\n// Generic random scalar, we can do same for other fields if via Fp2.mul(Fp2.ONE, Fp2.random)?\n// This allows unsafe methods like ignore bias or zero. These unsafe, but often used in different protocols (if deterministic RNG).\n// which mean we cannot force this via opts.\n// Not sure what to do with randomBytes, we can accept it inside opts if wanted.\n// Probably need to export getMinHashLength somewhere?\n// random(bytes?: Uint8Array, unsafeAllowZero = false, unsafeAllowBias = false) {\n//   const LEN = !unsafeAllowBias ? getMinHashLength(ORDER) : BYTES;\n//   if (bytes === undefined) bytes = randomBytes(LEN); // _opts.randomBytes?\n//   const num = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n//   // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n//   const reduced = unsafeAllowZero ? mod(num, ORDER) : mod(num, ORDER - _1n) + _1n;\n//   return reduced;\n// },\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(\"Field doesn't have isOdd\");\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(\"Field doesn't have isOdd\");\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use `mapKeyToField` instead\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error('hashToPrivateScalar: expected ' + minLen + '-1024 bytes of input, got ' + hashLen);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n    const len = key.length;\n    const fieldLen = getFieldBytesLength(fieldOrder);\n    const minLen = getMinHashLength(fieldOrder);\n    // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n    if (len < 16 || len < minLen || len > 1024)\n        throw new Error('expected ' + minLen + '-1024 bytes of input, got ' + len);\n    const num = isLE ? bytesToNumberLE(key) : bytesToNumberBE(key);\n    // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n    const reduced = mod(num, fieldOrder - _1n) + _1n;\n    return isLE ? numberToBytesLE(reduced, fieldLen) : numberToBytesBE(reduced, fieldLen);\n}\n//# sourceMappingURL=modular.js.map","/**\n * Methods for elliptic curve multiplication by scalars.\n * Contains wNAF, pippenger.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { bitLen, bitMask, validateObject } from \"../utils.js\";\nimport { Field, FpInvertBatch, nLength, validateField } from \"./modular.js\";\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nexport function negateCt(condition, item) {\n    const neg = item.negate();\n    return condition ? neg : item;\n}\n/**\n * Takes a bunch of Projective Points but executes only one\n * inversion on all of them. Inversion is very slow operation,\n * so this improves performance massively.\n * Optimization: converts a list of projective points to a list of identical points with Z=1.\n */\nexport function normalizeZ(c, points) {\n    const invertedZs = FpInvertBatch(c.Fp, points.map((p) => p.Z));\n    return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));\n}\nfunction validateW(W, bits) {\n    if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n        throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\nfunction calcWOpts(W, scalarBits) {\n    validateW(W, scalarBits);\n    const windows = Math.ceil(scalarBits / W) + 1; // W=8 33. Not 32, because we skip zero\n    const windowSize = 2 ** (W - 1); // W=8 128. Not 256, because we skip zero\n    const maxNumber = 2 ** W; // W=8 256\n    const mask = bitMask(W); // W=8 255 == mask 0b11111111\n    const shiftBy = BigInt(W); // W=8 8\n    return { windows, windowSize, mask, maxNumber, shiftBy };\n}\nfunction calcOffsets(n, window, wOpts) {\n    const { windowSize, mask, maxNumber, shiftBy } = wOpts;\n    let wbits = Number(n & mask); // extract W bits.\n    let nextN = n >> shiftBy; // shift number by W bits.\n    // What actually happens here:\n    // const highestBit = Number(mask ^ (mask >> 1n));\n    // let wbits2 = wbits - 1; // skip zero\n    // if (wbits2 & highestBit) { wbits2 ^= Number(mask); // (~);\n    // split if bits > max: +224 => 256-32\n    if (wbits > windowSize) {\n        // we skip zero, which means instead of `>= size-1`, we do `> size`\n        wbits -= maxNumber; // -32, can be maxNumber - wbits, but then we need to set isNeg here.\n        nextN += _1n; // +256 (carry)\n    }\n    const offsetStart = window * windowSize;\n    const offset = offsetStart + Math.abs(wbits) - 1; // -1 because we skip zero\n    const isZero = wbits === 0; // is current window slice a 0?\n    const isNeg = wbits < 0; // is current window slice negative?\n    const isNegF = window % 2 !== 0; // fake random statement for noise\n    const offsetF = offsetStart; // fake offset for noise\n    return { nextN, offset, isZero, isNeg, isNegF, offsetF };\n}\nfunction validateMSMPoints(points, c) {\n    if (!Array.isArray(points))\n        throw new Error('array expected');\n    points.forEach((p, i) => {\n        if (!(p instanceof c))\n            throw new Error('invalid point at index ' + i);\n    });\n}\nfunction validateMSMScalars(scalars, field) {\n    if (!Array.isArray(scalars))\n        throw new Error('array of scalars expected');\n    scalars.forEach((s, i) => {\n        if (!field.isValid(s))\n            throw new Error('invalid scalar at index ' + i);\n    });\n}\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes.\n// Allows to make points frozen / immutable.\nconst pointPrecomputes = new WeakMap();\nconst pointWindowSizes = new WeakMap();\nfunction getW(P) {\n    // To disable precomputes:\n    // return 1;\n    return pointWindowSizes.get(P) || 1;\n}\nfunction assert0(n) {\n    if (n !== _0n)\n        throw new Error('invalid wNAF');\n}\n/**\n * Elliptic curve multiplication of Point by scalar. Fragile.\n * Table generation takes **30MB of ram and 10ms on high-end CPU**,\n * but may take much longer on slow devices. Actual generation will happen on\n * first call of `multiply()`. By default, `BASE` point is precomputed.\n *\n * Scalars should always be less than curve order: this should be checked inside of a curve itself.\n * Creates precomputation tables for fast multiplication:\n * - private scalar is split by fixed size windows of W bits\n * - every window point is collected from window's table & added to accumulator\n * - since windows are different, same point inside tables won't be accessed more than once per calc\n * - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n * - +1 window is neccessary for wNAF\n * - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n *\n * @todo Research returning 2d JS array of windows, instead of a single window.\n * This would allow windows to be in different memory locations\n */\nexport class wNAF {\n    // Parametrized with a given Point class (not individual point)\n    constructor(Point, bits) {\n        this.BASE = Point.BASE;\n        this.ZERO = Point.ZERO;\n        this.Fn = Point.Fn;\n        this.bits = bits;\n    }\n    // non-const time multiplication ladder\n    _unsafeLadder(elm, n, p = this.ZERO) {\n        let d = elm;\n        while (n > _0n) {\n            if (n & _1n)\n                p = p.add(d);\n            d = d.double();\n            n >>= _1n;\n        }\n        return p;\n    }\n    /**\n     * Creates a wNAF precomputation window. Used for caching.\n     * Default window size is set by `utils.precompute()` and is equal to 8.\n     * Number of precomputed points depends on the curve size:\n     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n     * - 𝑊 is the window size\n     * - 𝑛 is the bitlength of the curve order.\n     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n     * @param point Point instance\n     * @param W window size\n     * @returns precomputed point tables flattened to a single array\n     */\n    precomputeWindow(point, W) {\n        const { windows, windowSize } = calcWOpts(W, this.bits);\n        const points = [];\n        let p = point;\n        let base = p;\n        for (let window = 0; window < windows; window++) {\n            base = p;\n            points.push(base);\n            // i=1, bc we skip 0\n            for (let i = 1; i < windowSize; i++) {\n                base = base.add(p);\n                points.push(base);\n            }\n            p = base.double();\n        }\n        return points;\n    }\n    /**\n     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n     * More compact implementation:\n     * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541\n     * @returns real and fake (for const-time) points\n     */\n    wNAF(W, precomputes, n) {\n        // Scalar should be smaller than field order\n        if (!this.Fn.isValid(n))\n            throw new Error('invalid scalar');\n        // Accumulators\n        let p = this.ZERO;\n        let f = this.BASE;\n        // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n        // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n        // there is negate now: it is possible that negated element from low value\n        // would be the same as high element, which will create carry into next window.\n        // It's not obvious how this can fail, but still worth investigating later.\n        const wo = calcWOpts(W, this.bits);\n        for (let window = 0; window < wo.windows; window++) {\n            // (n === _0n) is handled and not early-exited. isEven and offsetF are used for noise\n            const { nextN, offset, isZero, isNeg, isNegF, offsetF } = calcOffsets(n, window, wo);\n            n = nextN;\n            if (isZero) {\n                // bits are 0: add garbage to fake point\n                // Important part for const-time getPublicKey: add random \"noise\" point to f.\n                f = f.add(negateCt(isNegF, precomputes[offsetF]));\n            }\n            else {\n                // bits are 1: add to result point\n                p = p.add(negateCt(isNeg, precomputes[offset]));\n            }\n        }\n        assert0(n);\n        // Return both real and fake points: JIT won't eliminate f.\n        // At this point there is a way to F be infinity-point even if p is not,\n        // which makes it less const-time: around 1 bigint multiply.\n        return { p, f };\n    }\n    /**\n     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.\n     * @param acc accumulator point to add result of multiplication\n     * @returns point\n     */\n    wNAFUnsafe(W, precomputes, n, acc = this.ZERO) {\n        const wo = calcWOpts(W, this.bits);\n        for (let window = 0; window < wo.windows; window++) {\n            if (n === _0n)\n                break; // Early-exit, skip 0 value\n            const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);\n            n = nextN;\n            if (isZero) {\n                // Window bits are 0: skip processing.\n                // Move to next window.\n                continue;\n            }\n            else {\n                const item = precomputes[offset];\n                acc = acc.add(isNeg ? item.negate() : item); // Re-using acc allows to save adds in MSM\n            }\n        }\n        assert0(n);\n        return acc;\n    }\n    getPrecomputes(W, point, transform) {\n        // Calculate precomputes on a first run, reuse them after\n        let comp = pointPrecomputes.get(point);\n        if (!comp) {\n            comp = this.precomputeWindow(point, W);\n            if (W !== 1) {\n                // Doing transform outside of if brings 15% perf hit\n                if (typeof transform === 'function')\n                    comp = transform(comp);\n                pointPrecomputes.set(point, comp);\n            }\n        }\n        return comp;\n    }\n    cached(point, scalar, transform) {\n        const W = getW(point);\n        return this.wNAF(W, this.getPrecomputes(W, point, transform), scalar);\n    }\n    unsafe(point, scalar, transform, prev) {\n        const W = getW(point);\n        if (W === 1)\n            return this._unsafeLadder(point, scalar, prev); // For W=1 ladder is ~x2 faster\n        return this.wNAFUnsafe(W, this.getPrecomputes(W, point, transform), scalar, prev);\n    }\n    // We calculate precomputes for elliptic curve point multiplication\n    // using windowed method. This specifies window size and\n    // stores precomputed values. Usually only base point would be precomputed.\n    createCache(P, W) {\n        validateW(W, this.bits);\n        pointWindowSizes.set(P, W);\n        pointPrecomputes.delete(P);\n    }\n    hasCache(elm) {\n        return getW(elm) !== 1;\n    }\n}\n/**\n * Endomorphism-specific multiplication for Koblitz curves.\n * Cost: 128 dbl, 0-256 adds.\n */\nexport function mulEndoUnsafe(Point, point, k1, k2) {\n    let acc = point;\n    let p1 = Point.ZERO;\n    let p2 = Point.ZERO;\n    while (k1 > _0n || k2 > _0n) {\n        if (k1 & _1n)\n            p1 = p1.add(acc);\n        if (k2 & _1n)\n            p2 = p2.add(acc);\n        acc = acc.double();\n        k1 >>= _1n;\n        k2 >>= _1n;\n    }\n    return { p1, p2 };\n}\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster than precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @param scalars array of L scalars (aka secret keys / bigints)\n */\nexport function pippenger(c, fieldN, points, scalars) {\n    // If we split scalars by some window (let's say 8 bits), every chunk will only\n    // take 256 buckets even if there are 4096 scalars, also re-uses double.\n    // TODO:\n    // - https://eprint.iacr.org/2024/750.pdf\n    // - https://tches.iacr.org/index.php/TCHES/article/view/10287\n    // 0 is accepted in scalars\n    validateMSMPoints(points, c);\n    validateMSMScalars(scalars, fieldN);\n    const plength = points.length;\n    const slength = scalars.length;\n    if (plength !== slength)\n        throw new Error('arrays of points and scalars must have equal length');\n    // if (plength === 0) throw new Error('array must be of length >= 2');\n    const zero = c.ZERO;\n    const wbits = bitLen(BigInt(plength));\n    let windowSize = 1; // bits\n    if (wbits > 12)\n        windowSize = wbits - 3;\n    else if (wbits > 4)\n        windowSize = wbits - 2;\n    else if (wbits > 0)\n        windowSize = 2;\n    const MASK = bitMask(windowSize);\n    const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array\n    const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;\n    let sum = zero;\n    for (let i = lastBits; i >= 0; i -= windowSize) {\n        buckets.fill(zero);\n        for (let j = 0; j < slength; j++) {\n            const scalar = scalars[j];\n            const wbits = Number((scalar >> BigInt(i)) & MASK);\n            buckets[wbits] = buckets[wbits].add(points[j]);\n        }\n        let resI = zero; // not using this will do small speed-up, but will lose ct\n        // Skip first bucket, because it is zero\n        for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n            sumI = sumI.add(buckets[j]);\n            resI = resI.add(sumI);\n        }\n        sum = sum.add(resI);\n        if (i !== 0)\n            for (let j = 0; j < windowSize; j++)\n                sum = sum.double();\n    }\n    return sum;\n}\n/**\n * Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @returns function which multiplies points with scaars\n */\nexport function precomputeMSMUnsafe(c, fieldN, points, windowSize) {\n    /**\n     * Performance Analysis of Window-based Precomputation\n     *\n     * Base Case (256-bit scalar, 8-bit window):\n     * - Standard precomputation requires:\n     *   - 31 additions per scalar × 256 scalars = 7,936 ops\n     *   - Plus 255 summary additions = 8,191 total ops\n     *   Note: Summary additions can be optimized via accumulator\n     *\n     * Chunked Precomputation Analysis:\n     * - Using 32 chunks requires:\n     *   - 255 additions per chunk\n     *   - 256 doublings\n     *   - Total: (255 × 32) + 256 = 8,416 ops\n     *\n     * Memory Usage Comparison:\n     * Window Size | Standard Points | Chunked Points\n     * ------------|-----------------|---------------\n     *     4-bit   |     520         |      15\n     *     8-bit   |    4,224        |     255\n     *    10-bit   |   13,824        |   1,023\n     *    16-bit   |  557,056        |  65,535\n     *\n     * Key Advantages:\n     * 1. Enables larger window sizes due to reduced memory overhead\n     * 2. More efficient for smaller scalar counts:\n     *    - 16 chunks: (16 × 255) + 256 = 4,336 ops\n     *    - ~2x faster than standard 8,191 ops\n     *\n     * Limitations:\n     * - Not suitable for plain precomputes (requires 256 constant doublings)\n     * - Performance degrades with larger scalar counts:\n     *   - Optimal for ~256 scalars\n     *   - Less efficient for 4096+ scalars (Pippenger preferred)\n     */\n    validateW(windowSize, fieldN.BITS);\n    validateMSMPoints(points, c);\n    const zero = c.ZERO;\n    const tableSize = 2 ** windowSize - 1; // table size (without zero)\n    const chunks = Math.ceil(fieldN.BITS / windowSize); // chunks of item\n    const MASK = bitMask(windowSize);\n    const tables = points.map((p) => {\n        const res = [];\n        for (let i = 0, acc = p; i < tableSize; i++) {\n            res.push(acc);\n            acc = acc.add(p);\n        }\n        return res;\n    });\n    return (scalars) => {\n        validateMSMScalars(scalars, fieldN);\n        if (scalars.length > points.length)\n            throw new Error('array of scalars must be smaller than array of points');\n        let res = zero;\n        for (let i = 0; i < chunks; i++) {\n            // No need to double if accumulator is still zero.\n            if (res !== zero)\n                for (let j = 0; j < windowSize; j++)\n                    res = res.double();\n            const shiftBy = BigInt(chunks * windowSize - (i + 1) * windowSize);\n            for (let j = 0; j < scalars.length; j++) {\n                const n = scalars[j];\n                const curr = Number((n >> shiftBy) & MASK);\n                if (!curr)\n                    continue; // skip zero scalars chunks\n                res = res.add(tables[j][curr - 1]);\n            }\n        }\n        return res;\n    };\n}\n// TODO: remove\n/** @deprecated */\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\nfunction createField(order, field, isLE) {\n    if (field) {\n        if (field.ORDER !== order)\n            throw new Error('Field.ORDER must match order: Fp == p, Fn == n');\n        validateField(field);\n        return field;\n    }\n    else {\n        return Field(order, { isLE });\n    }\n}\n/** Validates CURVE opts and creates fields */\nexport function _createCurveFields(type, CURVE, curveOpts = {}, FpFnLE) {\n    if (FpFnLE === undefined)\n        FpFnLE = type === 'edwards';\n    if (!CURVE || typeof CURVE !== 'object')\n        throw new Error(`expected valid ${type} CURVE object`);\n    for (const p of ['p', 'n', 'h']) {\n        const val = CURVE[p];\n        if (!(typeof val === 'bigint' && val > _0n))\n            throw new Error(`CURVE.${p} must be positive bigint`);\n    }\n    const Fp = createField(CURVE.p, curveOpts.Fp, FpFnLE);\n    const Fn = createField(CURVE.n, curveOpts.Fn, FpFnLE);\n    const _b = type === 'weierstrass' ? 'b' : 'd';\n    const params = ['Gx', 'Gy', 'a', _b];\n    for (const p of params) {\n        // @ts-ignore\n        if (!Fp.isValid(CURVE[p]))\n            throw new Error(`CURVE.${p} must be valid field element of CURVE.Fp`);\n    }\n    CURVE = Object.freeze(Object.assign({}, CURVE));\n    return { CURVE, Fp, Fn };\n}\n//# sourceMappingURL=curve.js.map","/**\n * Short Weierstrass curve methods. The formula is: y² = x³ + ax + b.\n *\n * ### Design rationale for types\n *\n * * Interaction between classes from different curves should fail:\n *   `k256.Point.BASE.add(p256.Point.BASE)`\n * * For this purpose we want to use `instanceof` operator, which is fast and works during runtime\n * * Different calls of `curve()` would return different classes -\n *   `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,\n *   it won't affect others\n *\n * TypeScript can't infer types for classes created inside a function. Classes is one instance\n * of nominative types in TypeScript and interfaces only check for shape, so it's hard to create\n * unique type for every function call.\n *\n * We can use generic types via some param, like curve opts, but that would:\n *     1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)\n *     which is hard to debug.\n *     2. Params can be generic and we can't enforce them to be constant value:\n *     if somebody creates curve from non-constant params,\n *     it would be allowed to interact with other curves with non-constant params\n *\n * @todo https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac as nobleHmac } from '@noble/hashes/hmac.js';\nimport { ahash } from '@noble/hashes/utils';\nimport { _validateObject, _abool2 as abool, _abytes2 as abytes, aInRange, bitLen, bitMask, bytesToHex, bytesToNumberBE, concatBytes, createHmacDrbg, ensureBytes, hexToBytes, inRange, isBytes, memoized, numberToHexUnpadded, randomBytes as randomBytesWeb, } from \"../utils.js\";\nimport { _createCurveFields, mulEndoUnsafe, negateCt, normalizeZ, pippenger, wNAF, } from \"./curve.js\";\nimport { Field, FpInvertBatch, getMinHashLength, mapHashToField, nLength, validateField, } from \"./modular.js\";\n// We construct basis in such way that den is always positive and equals n, but num sign depends on basis (not on secret value)\nconst divNearest = (num, den) => (num + (num >= 0 ? den : -den) / _2n) / den;\n/**\n * Splits scalar for GLV endomorphism.\n */\nexport function _splitEndoScalar(k, basis, n) {\n    // Split scalar into two such that part is ~half bits: `abs(part) < sqrt(N)`\n    // Since part can be negative, we need to do this on point.\n    // TODO: verifyScalar function which consumes lambda\n    const [[a1, b1], [a2, b2]] = basis;\n    const c1 = divNearest(b2 * k, n);\n    const c2 = divNearest(-b1 * k, n);\n    // |k1|/|k2| is < sqrt(N), but can be negative.\n    // If we do `k1 mod N`, we'll get big scalar (`> sqrt(N)`): so, we do cheaper negation instead.\n    let k1 = k - c1 * a1 - c2 * a2;\n    let k2 = -c1 * b1 - c2 * b2;\n    const k1neg = k1 < _0n;\n    const k2neg = k2 < _0n;\n    if (k1neg)\n        k1 = -k1;\n    if (k2neg)\n        k2 = -k2;\n    // Double check that resulting scalar less than half bits of N: otherwise wNAF will fail.\n    // This should only happen on wrong basises. Also, math inside is too complex and I don't trust it.\n    const MAX_NUM = bitMask(Math.ceil(bitLen(n) / 2)) + _1n; // Half bits of N\n    if (k1 < _0n || k1 >= MAX_NUM || k2 < _0n || k2 >= MAX_NUM) {\n        throw new Error('splitScalar (endomorphism): failed, k=' + k);\n    }\n    return { k1neg, k1, k2neg, k2 };\n}\nfunction validateSigFormat(format) {\n    if (!['compact', 'recovered', 'der'].includes(format))\n        throw new Error('Signature format must be \"compact\", \"recovered\", or \"der\"');\n    return format;\n}\nfunction validateSigOpts(opts, def) {\n    const optsn = {};\n    for (let optName of Object.keys(def)) {\n        // @ts-ignore\n        optsn[optName] = opts[optName] === undefined ? def[optName] : opts[optName];\n    }\n    abool(optsn.lowS, 'lowS');\n    abool(optsn.prehash, 'prehash');\n    if (optsn.format !== undefined)\n        validateSigFormat(optsn.format);\n    return optsn;\n}\nexport class DERErr extends Error {\n    constructor(m = '') {\n        super(m);\n    }\n}\n/**\n * ASN.1 DER encoding utilities. ASN is very complex & fragile. Format:\n *\n *     [0x30 (SEQUENCE), bytelength, 0x02 (INTEGER), intLength, R, 0x02 (INTEGER), intLength, S]\n *\n * Docs: https://letsencrypt.org/docs/a-warm-welcome-to-asn1-and-der/, https://luca.ntop.org/Teaching/Appunti/asn1.html\n */\nexport const DER = {\n    // asn.1 DER encoding utils\n    Err: DERErr,\n    // Basic building block is TLV (Tag-Length-Value)\n    _tlv: {\n        encode: (tag, data) => {\n            const { Err: E } = DER;\n            if (tag < 0 || tag > 256)\n                throw new E('tlv.encode: wrong tag');\n            if (data.length & 1)\n                throw new E('tlv.encode: unpadded data');\n            const dataLen = data.length / 2;\n            const len = numberToHexUnpadded(dataLen);\n            if ((len.length / 2) & 128)\n                throw new E('tlv.encode: long form length too big');\n            // length of length with long form flag\n            const lenLen = dataLen > 127 ? numberToHexUnpadded((len.length / 2) | 128) : '';\n            const t = numberToHexUnpadded(tag);\n            return t + lenLen + len + data;\n        },\n        // v - value, l - left bytes (unparsed)\n        decode(tag, data) {\n            const { Err: E } = DER;\n            let pos = 0;\n            if (tag < 0 || tag > 256)\n                throw new E('tlv.encode: wrong tag');\n            if (data.length < 2 || data[pos++] !== tag)\n                throw new E('tlv.decode: wrong tlv');\n            const first = data[pos++];\n            const isLong = !!(first & 128); // First bit of first length byte is flag for short/long form\n            let length = 0;\n            if (!isLong)\n                length = first;\n            else {\n                // Long form: [longFlag(1bit), lengthLength(7bit), length (BE)]\n                const lenLen = first & 127;\n                if (!lenLen)\n                    throw new E('tlv.decode(long): indefinite length not supported');\n                if (lenLen > 4)\n                    throw new E('tlv.decode(long): byte length is too big'); // this will overflow u32 in js\n                const lengthBytes = data.subarray(pos, pos + lenLen);\n                if (lengthBytes.length !== lenLen)\n                    throw new E('tlv.decode: length bytes not complete');\n                if (lengthBytes[0] === 0)\n                    throw new E('tlv.decode(long): zero leftmost byte');\n                for (const b of lengthBytes)\n                    length = (length << 8) | b;\n                pos += lenLen;\n                if (length < 128)\n                    throw new E('tlv.decode(long): not minimal encoding');\n            }\n            const v = data.subarray(pos, pos + length);\n            if (v.length !== length)\n                throw new E('tlv.decode: wrong value length');\n            return { v, l: data.subarray(pos + length) };\n        },\n    },\n    // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n    // since we always use positive integers here. It must always be empty:\n    // - add zero byte if exists\n    // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n    _int: {\n        encode(num) {\n            const { Err: E } = DER;\n            if (num < _0n)\n                throw new E('integer: negative integers are not allowed');\n            let hex = numberToHexUnpadded(num);\n            // Pad with zero byte if negative flag is present\n            if (Number.parseInt(hex[0], 16) & 0b1000)\n                hex = '00' + hex;\n            if (hex.length & 1)\n                throw new E('unexpected DER parsing assertion: unpadded hex');\n            return hex;\n        },\n        decode(data) {\n            const { Err: E } = DER;\n            if (data[0] & 128)\n                throw new E('invalid signature integer: negative');\n            if (data[0] === 0x00 && !(data[1] & 128))\n                throw new E('invalid signature integer: unnecessary leading zero');\n            return bytesToNumberBE(data);\n        },\n    },\n    toSig(hex) {\n        // parse DER signature\n        const { Err: E, _int: int, _tlv: tlv } = DER;\n        const data = ensureBytes('signature', hex);\n        const { v: seqBytes, l: seqLeftBytes } = tlv.decode(0x30, data);\n        if (seqLeftBytes.length)\n            throw new E('invalid signature: left bytes after parsing');\n        const { v: rBytes, l: rLeftBytes } = tlv.decode(0x02, seqBytes);\n        const { v: sBytes, l: sLeftBytes } = tlv.decode(0x02, rLeftBytes);\n        if (sLeftBytes.length)\n            throw new E('invalid signature: left bytes after parsing');\n        return { r: int.decode(rBytes), s: int.decode(sBytes) };\n    },\n    hexFromSig(sig) {\n        const { _tlv: tlv, _int: int } = DER;\n        const rs = tlv.encode(0x02, int.encode(sig.r));\n        const ss = tlv.encode(0x02, int.encode(sig.s));\n        const seq = rs + ss;\n        return tlv.encode(0x30, seq);\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function _normFnElement(Fn, key) {\n    const { BYTES: expected } = Fn;\n    let num;\n    if (typeof key === 'bigint') {\n        num = key;\n    }\n    else {\n        let bytes = ensureBytes('private key', key);\n        try {\n            num = Fn.fromBytes(bytes);\n        }\n        catch (error) {\n            throw new Error(`invalid private key: expected ui8a of size ${expected}, got ${typeof key}`);\n        }\n    }\n    if (!Fn.isValidNot0(num))\n        throw new Error('invalid private key: out of range [1..N-1]');\n    return num;\n}\n/**\n * Creates weierstrass Point constructor, based on specified curve options.\n *\n * @example\n```js\nconst opts = {\n  p: BigInt('0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff'),\n  n: BigInt('0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551'),\n  h: BigInt(1),\n  a: BigInt('0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc'),\n  b: BigInt('0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b'),\n  Gx: BigInt('0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296'),\n  Gy: BigInt('0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5'),\n};\nconst p256_Point = weierstrass(opts);\n```\n */\nexport function weierstrassN(params, extraOpts = {}) {\n    const validated = _createCurveFields('weierstrass', params, extraOpts);\n    const { Fp, Fn } = validated;\n    let CURVE = validated.CURVE;\n    const { h: cofactor, n: CURVE_ORDER } = CURVE;\n    _validateObject(extraOpts, {}, {\n        allowInfinityPoint: 'boolean',\n        clearCofactor: 'function',\n        isTorsionFree: 'function',\n        fromBytes: 'function',\n        toBytes: 'function',\n        endo: 'object',\n        wrapPrivateKey: 'boolean',\n    });\n    const { endo } = extraOpts;\n    if (endo) {\n        // validateObject(endo, { beta: 'bigint', splitScalar: 'function' });\n        if (!Fp.is0(CURVE.a) || typeof endo.beta !== 'bigint' || !Array.isArray(endo.basises)) {\n            throw new Error('invalid endo: expected \"beta\": bigint and \"basises\": array');\n        }\n    }\n    const lengths = getWLengths(Fp, Fn);\n    function assertCompressionIsSupported() {\n        if (!Fp.isOdd)\n            throw new Error('compression is not supported: Field does not have .isOdd()');\n    }\n    // Implements IEEE P1363 point encoding\n    function pointToBytes(_c, point, isCompressed) {\n        const { x, y } = point.toAffine();\n        const bx = Fp.toBytes(x);\n        abool(isCompressed, 'isCompressed');\n        if (isCompressed) {\n            assertCompressionIsSupported();\n            const hasEvenY = !Fp.isOdd(y);\n            return concatBytes(pprefix(hasEvenY), bx);\n        }\n        else {\n            return concatBytes(Uint8Array.of(0x04), bx, Fp.toBytes(y));\n        }\n    }\n    function pointFromBytes(bytes) {\n        abytes(bytes, undefined, 'Point');\n        const { publicKey: comp, publicKeyUncompressed: uncomp } = lengths; // e.g. for 32-byte: 33, 65\n        const length = bytes.length;\n        const head = bytes[0];\n        const tail = bytes.subarray(1);\n        // No actual validation is done here: use .assertValidity()\n        if (length === comp && (head === 0x02 || head === 0x03)) {\n            const x = Fp.fromBytes(tail);\n            if (!Fp.isValid(x))\n                throw new Error('bad point: is not on curve, wrong x');\n            const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n            let y;\n            try {\n                y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n            }\n            catch (sqrtError) {\n                const err = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n                throw new Error('bad point: is not on curve, sqrt error' + err);\n            }\n            assertCompressionIsSupported();\n            const isYOdd = Fp.isOdd(y); // (y & _1n) === _1n;\n            const isHeadOdd = (head & 1) === 1; // ECDSA-specific\n            if (isHeadOdd !== isYOdd)\n                y = Fp.neg(y);\n            return { x, y };\n        }\n        else if (length === uncomp && head === 0x04) {\n            // TODO: more checks\n            const L = Fp.BYTES;\n            const x = Fp.fromBytes(tail.subarray(0, L));\n            const y = Fp.fromBytes(tail.subarray(L, L * 2));\n            if (!isValidXY(x, y))\n                throw new Error('bad point: is not on curve');\n            return { x, y };\n        }\n        else {\n            throw new Error(`bad point: got length ${length}, expected compressed=${comp} or uncompressed=${uncomp}`);\n        }\n    }\n    const encodePoint = extraOpts.toBytes || pointToBytes;\n    const decodePoint = extraOpts.fromBytes || pointFromBytes;\n    function weierstrassEquation(x) {\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x² * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, CURVE.a)), CURVE.b); // x³ + a * x + b\n    }\n    // TODO: move top-level\n    /** Checks whether equation holds for given x, y: y² == x³ + ax + b */\n    function isValidXY(x, y) {\n        const left = Fp.sqr(y); // y²\n        const right = weierstrassEquation(x); // x³ + ax + b\n        return Fp.eql(left, right);\n    }\n    // Validate whether the passed curve params are valid.\n    // Test 1: equation y² = x³ + ax + b should work for generator point.\n    if (!isValidXY(CURVE.Gx, CURVE.Gy))\n        throw new Error('bad curve params: generator point');\n    // Test 2: discriminant Δ part should be non-zero: 4a³ + 27b² != 0.\n    // Guarantees curve is genus-1, smooth (non-singular).\n    const _4a3 = Fp.mul(Fp.pow(CURVE.a, _3n), _4n);\n    const _27b2 = Fp.mul(Fp.sqr(CURVE.b), BigInt(27));\n    if (Fp.is0(Fp.add(_4a3, _27b2)))\n        throw new Error('bad curve params: a or b');\n    /** Asserts coordinate is valid: 0 <= n < Fp.ORDER. */\n    function acoord(title, n, banZero = false) {\n        if (!Fp.isValid(n) || (banZero && Fp.is0(n)))\n            throw new Error(`bad point coordinate ${title}`);\n        return n;\n    }\n    function aprjpoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ProjectivePoint expected');\n    }\n    function splitEndoScalarN(k) {\n        if (!endo || !endo.basises)\n            throw new Error('no endo');\n        return _splitEndoScalar(k, endo.basises, Fn.ORDER);\n    }\n    // Memoized toAffine / validity check. They are heavy. Points are immutable.\n    // Converts Projective point to affine (x, y) coordinates.\n    // Can accept precomputed Z^-1 - for example, from invertBatch.\n    // (X, Y, Z) ∋ (x=X/Z, y=Y/Z)\n    const toAffineMemo = memoized((p, iz) => {\n        const { X, Y, Z } = p;\n        // Fast-path for normalized points\n        if (Fp.eql(Z, Fp.ONE))\n            return { x: X, y: Y };\n        const is0 = p.is0();\n        // If invZ was 0, we return zero point. However we still want to execute\n        // all operations, so we replace invZ with a random number, 1.\n        if (iz == null)\n            iz = is0 ? Fp.ONE : Fp.inv(Z);\n        const x = Fp.mul(X, iz);\n        const y = Fp.mul(Y, iz);\n        const zz = Fp.mul(Z, iz);\n        if (is0)\n            return { x: Fp.ZERO, y: Fp.ZERO };\n        if (!Fp.eql(zz, Fp.ONE))\n            throw new Error('invZ was invalid');\n        return { x, y };\n    });\n    // NOTE: on exception this will crash 'cached' and no value will be set.\n    // Otherwise true will be return\n    const assertValidMemo = memoized((p) => {\n        if (p.is0()) {\n            // (0, 1, 0) aka ZERO is invalid in most contexts.\n            // In BLS, ZERO can be serialized, so we allow it.\n            // (0, 0, 0) is invalid representation of ZERO.\n            if (extraOpts.allowInfinityPoint && !Fp.is0(p.Y))\n                return;\n            throw new Error('bad point: ZERO');\n        }\n        // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n        const { x, y } = p.toAffine();\n        if (!Fp.isValid(x) || !Fp.isValid(y))\n            throw new Error('bad point: x or y not field elements');\n        if (!isValidXY(x, y))\n            throw new Error('bad point: equation left != right');\n        if (!p.isTorsionFree())\n            throw new Error('bad point: not in prime-order subgroup');\n        return true;\n    });\n    function finishEndo(endoBeta, k1p, k2p, k1neg, k2neg) {\n        k2p = new Point(Fp.mul(k2p.X, endoBeta), k2p.Y, k2p.Z);\n        k1p = negateCt(k1neg, k1p);\n        k2p = negateCt(k2neg, k2p);\n        return k1p.add(k2p);\n    }\n    /**\n     * Projective Point works in 3d / projective (homogeneous) coordinates:(X, Y, Z) ∋ (x=X/Z, y=Y/Z).\n     * Default Point works in 2d / affine coordinates: (x, y).\n     * We're doing calculations in projective, because its operations don't require costly inversion.\n     */\n    class Point {\n        /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n        constructor(X, Y, Z) {\n            this.X = acoord('x', X);\n            this.Y = acoord('y', Y, true);\n            this.Z = acoord('z', Z);\n            Object.freeze(this);\n        }\n        static CURVE() {\n            return CURVE;\n        }\n        /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            // (0, 0) would've produced (0, 0, 1) - instead, we need (0, 1, 0)\n            if (Fp.is0(x) && Fp.is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        static fromBytes(bytes) {\n            const P = Point.fromAffine(decodePoint(abytes(bytes, undefined, 'point')));\n            P.assertValidity();\n            return P;\n        }\n        static fromHex(hex) {\n            return Point.fromBytes(ensureBytes('pointHex', hex));\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        /**\n         *\n         * @param windowSize\n         * @param isLazy true will defer table computation until the first multiplication\n         * @returns\n         */\n        precompute(windowSize = 8, isLazy = true) {\n            wnaf.createCache(this, windowSize);\n            if (!isLazy)\n                this.multiply(_3n); // random number\n            return this;\n        }\n        // TODO: return `this`\n        /** A point on curve is valid if it conforms to equation. */\n        assertValidity() {\n            assertValidMemo(this);\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (!Fp.isOdd)\n                throw new Error(\"Field doesn't support isOdd\");\n            return !Fp.isOdd(y);\n        }\n        /** Compare one point to another. */\n        equals(other) {\n            aprjpoint(other);\n            const { X: X1, Y: Y1, Z: Z1 } = this;\n            const { X: X2, Y: Y2, Z: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /** Flips point to one corresponding to (x, -y) in Affine coordinates. */\n        negate() {\n            return new Point(this.X, Fp.neg(this.Y), this.Z);\n        }\n        // Renes-Costello-Batina exception-free doubling formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 3\n        // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n        double() {\n            const { a, b } = CURVE;\n            const b3 = Fp.mul(b, _3n);\n            const { X: X1, Y: Y1, Z: Z1 } = this;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            let t0 = Fp.mul(X1, X1); // step 1\n            let t1 = Fp.mul(Y1, Y1);\n            let t2 = Fp.mul(Z1, Z1);\n            let t3 = Fp.mul(X1, Y1);\n            t3 = Fp.add(t3, t3); // step 5\n            Z3 = Fp.mul(X1, Z1);\n            Z3 = Fp.add(Z3, Z3);\n            X3 = Fp.mul(a, Z3);\n            Y3 = Fp.mul(b3, t2);\n            Y3 = Fp.add(X3, Y3); // step 10\n            X3 = Fp.sub(t1, Y3);\n            Y3 = Fp.add(t1, Y3);\n            Y3 = Fp.mul(X3, Y3);\n            X3 = Fp.mul(t3, X3);\n            Z3 = Fp.mul(b3, Z3); // step 15\n            t2 = Fp.mul(a, t2);\n            t3 = Fp.sub(t0, t2);\n            t3 = Fp.mul(a, t3);\n            t3 = Fp.add(t3, Z3);\n            Z3 = Fp.add(t0, t0); // step 20\n            t0 = Fp.add(Z3, t0);\n            t0 = Fp.add(t0, t2);\n            t0 = Fp.mul(t0, t3);\n            Y3 = Fp.add(Y3, t0);\n            t2 = Fp.mul(Y1, Z1); // step 25\n            t2 = Fp.add(t2, t2);\n            t0 = Fp.mul(t2, t3);\n            X3 = Fp.sub(X3, t0);\n            Z3 = Fp.mul(t2, t1);\n            Z3 = Fp.add(Z3, Z3); // step 30\n            Z3 = Fp.add(Z3, Z3);\n            return new Point(X3, Y3, Z3);\n        }\n        // Renes-Costello-Batina exception-free addition formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 1\n        // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n        add(other) {\n            aprjpoint(other);\n            const { X: X1, Y: Y1, Z: Z1 } = this;\n            const { X: X2, Y: Y2, Z: Z2 } = other;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            const a = CURVE.a;\n            const b3 = Fp.mul(CURVE.b, _3n);\n            let t0 = Fp.mul(X1, X2); // step 1\n            let t1 = Fp.mul(Y1, Y2);\n            let t2 = Fp.mul(Z1, Z2);\n            let t3 = Fp.add(X1, Y1);\n            let t4 = Fp.add(X2, Y2); // step 5\n            t3 = Fp.mul(t3, t4);\n            t4 = Fp.add(t0, t1);\n            t3 = Fp.sub(t3, t4);\n            t4 = Fp.add(X1, Z1);\n            let t5 = Fp.add(X2, Z2); // step 10\n            t4 = Fp.mul(t4, t5);\n            t5 = Fp.add(t0, t2);\n            t4 = Fp.sub(t4, t5);\n            t5 = Fp.add(Y1, Z1);\n            X3 = Fp.add(Y2, Z2); // step 15\n            t5 = Fp.mul(t5, X3);\n            X3 = Fp.add(t1, t2);\n            t5 = Fp.sub(t5, X3);\n            Z3 = Fp.mul(a, t4);\n            X3 = Fp.mul(b3, t2); // step 20\n            Z3 = Fp.add(X3, Z3);\n            X3 = Fp.sub(t1, Z3);\n            Z3 = Fp.add(t1, Z3);\n            Y3 = Fp.mul(X3, Z3);\n            t1 = Fp.add(t0, t0); // step 25\n            t1 = Fp.add(t1, t0);\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.mul(b3, t4);\n            t1 = Fp.add(t1, t2);\n            t2 = Fp.sub(t0, t2); // step 30\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.add(t4, t2);\n            t0 = Fp.mul(t1, t4);\n            Y3 = Fp.add(Y3, t0);\n            t0 = Fp.mul(t5, t4); // step 35\n            X3 = Fp.mul(t3, X3);\n            X3 = Fp.sub(X3, t0);\n            t0 = Fp.mul(t3, t1);\n            Z3 = Fp.mul(t5, Z3);\n            Z3 = Fp.add(Z3, t0); // step 40\n            return new Point(X3, Y3, Z3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        /**\n         * Constant time multiplication.\n         * Uses wNAF method. Windowed method may be 10% faster,\n         * but takes 2x longer to generate and consumes 2x memory.\n         * Uses precomputes when available.\n         * Uses endomorphism for Koblitz curves.\n         * @param scalar by which the point would be multiplied\n         * @returns New point\n         */\n        multiply(scalar) {\n            const { endo } = extraOpts;\n            if (!Fn.isValidNot0(scalar))\n                throw new Error('invalid scalar: out of range'); // 0 is invalid\n            let point, fake; // Fake point is used to const-time mult\n            const mul = (n) => wnaf.cached(this, n, (p) => normalizeZ(Point, p));\n            /** See docs for {@link EndomorphismOpts} */\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(scalar);\n                const { p: k1p, f: k1f } = mul(k1);\n                const { p: k2p, f: k2f } = mul(k2);\n                fake = k1f.add(k2f);\n                point = finishEndo(endo.beta, k1p, k2p, k1neg, k2neg);\n            }\n            else {\n                const { p, f } = mul(scalar);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return normalizeZ(Point, [point, fake])[0];\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed secret key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(sc) {\n            const { endo } = extraOpts;\n            const p = this;\n            if (!Fn.isValid(sc))\n                throw new Error('invalid scalar: out of range'); // 0 is valid\n            if (sc === _0n || p.is0())\n                return Point.ZERO;\n            if (sc === _1n)\n                return p; // fast-path\n            if (wnaf.hasCache(this))\n                return this.multiply(sc);\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(sc);\n                const { p1, p2 } = mulEndoUnsafe(Point, p, k1, k2); // 30% faster vs wnaf.unsafe\n                return finishEndo(endo.beta, p1, p2, k1neg, k2neg);\n            }\n            else {\n                return wnaf.unsafe(p, sc);\n            }\n        }\n        multiplyAndAddUnsafe(Q, a, b) {\n            const sum = this.multiplyUnsafe(a).add(Q.multiplyUnsafe(b));\n            return sum.is0() ? undefined : sum;\n        }\n        /**\n         * Converts Projective point to affine (x, y) coordinates.\n         * @param invertedZ Z^-1 (inverted zero) - optional, precomputation is useful for invertBatch\n         */\n        toAffine(invertedZ) {\n            return toAffineMemo(this, invertedZ);\n        }\n        /**\n         * Checks whether Point is free of torsion elements (is in prime subgroup).\n         * Always torsion-free for cofactor=1 curves.\n         */\n        isTorsionFree() {\n            const { isTorsionFree } = extraOpts;\n            if (cofactor === _1n)\n                return true;\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            return wnaf.unsafe(this, CURVE_ORDER).is0();\n        }\n        clearCofactor() {\n            const { clearCofactor } = extraOpts;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(cofactor);\n        }\n        isSmallOrder() {\n            // can we use this.clearCofactor()?\n            return this.multiplyUnsafe(cofactor).is0();\n        }\n        toBytes(isCompressed = true) {\n            abool(isCompressed, 'isCompressed');\n            this.assertValidity();\n            return encodePoint(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return bytesToHex(this.toBytes(isCompressed));\n        }\n        toString() {\n            return `<Point ${this.is0() ? 'ZERO' : this.toHex()}>`;\n        }\n        // TODO: remove\n        get px() {\n            return this.X;\n        }\n        get py() {\n            return this.X;\n        }\n        get pz() {\n            return this.Z;\n        }\n        toRawBytes(isCompressed = true) {\n            return this.toBytes(isCompressed);\n        }\n        _setWindowSize(windowSize) {\n            this.precompute(windowSize);\n        }\n        static normalizeZ(points) {\n            return normalizeZ(Point, points);\n        }\n        static msm(points, scalars) {\n            return pippenger(Point, Fn, points, scalars);\n        }\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(_normFnElement(Fn, privateKey));\n        }\n    }\n    // base / generator point\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    // zero / infinity / identity point\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO); // 0, 1, 0\n    // math field\n    Point.Fp = Fp;\n    // scalar field\n    Point.Fn = Fn;\n    const bits = Fn.BITS;\n    const wnaf = new wNAF(Point, extraOpts.endo ? Math.ceil(bits / 2) : bits);\n    Point.BASE.precompute(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n    return Point;\n}\n// Points start with byte 0x02 when y is even; otherwise 0x03\nfunction pprefix(hasEvenY) {\n    return Uint8Array.of(hasEvenY ? 0x02 : 0x03);\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = _0n;\n    for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n        l += _1n;\n    const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n    // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n    // 2n ** c1 == 2n << (c1-1)\n    const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n    const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n    const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n    const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n    const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n    const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n    const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n    const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n    let sqrtRatio = (u, v) => {\n        let tv1 = c6; // 1. tv1 = c6\n        let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n        let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n        tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n        let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n        tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n        tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n        tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n        tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n        let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n        tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n        let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n        tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n        tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n        tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n        tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n        // 17. for i in (c1, c1 - 1, ..., 2):\n        for (let i = c1; i > _1n; i--) {\n            let tv5 = i - _2n; // 18.    tv5 = i - 2\n            tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n            let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n            const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n            tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n            tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n            tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n            tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n            tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n        }\n        return { isValid: isQR, value: tv3 };\n    };\n    if (Fp.ORDER % _4n === _3n) {\n        // sqrt_ratio_3mod4(u, v)\n        const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n        const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n        sqrtRatio = (u, v) => {\n            let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n            const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n            tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n            let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n            y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n            const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n            const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n            const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n            let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n            return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n        };\n    }\n    // No curves uses that\n    // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n    return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n    validateField(Fp);\n    const { A, B, Z } = opts;\n    if (!Fp.isValid(A) || !Fp.isValid(B) || !Fp.isValid(Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, Z);\n    if (!Fp.isOdd)\n        throw new Error('Field does not have .isOdd()');\n    // Input: u, an element of F.\n    // Output: (x, y), a point on E.\n    return (u) => {\n        // prettier-ignore\n        let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n        tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n        tv1 = Fp.mul(tv1, Z); // 2.  tv1 = Z * tv1\n        tv2 = Fp.sqr(tv1); // 3.  tv2 = tv1^2\n        tv2 = Fp.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n        tv3 = Fp.add(tv2, Fp.ONE); // 5.  tv3 = tv2 + 1\n        tv3 = Fp.mul(tv3, B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, A); // 8.  tv4 = A * tv4\n        tv2 = Fp.sqr(tv3); // 9.  tv2 = tv3^2\n        tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n        tv5 = Fp.mul(tv6, A); // 11. tv5 = A * tv6\n        tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n        tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n        tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n        tv5 = Fp.mul(tv6, B); // 15. tv5 = B * tv6\n        tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n        x = Fp.mul(tv1, tv3); // 17.   x = tv1 * tv3\n        const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n        y = Fp.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n        y = Fp.mul(y, value); // 20.   y = y * y1\n        x = Fp.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n        y = Fp.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n        const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23.  e1 = sgn0(u) == sgn0(y)\n        y = Fp.cmov(Fp.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n        const tv4_inv = FpInvertBatch(Fp, [tv4], true)[0];\n        x = Fp.mul(x, tv4_inv); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\nfunction getWLengths(Fp, Fn) {\n    return {\n        secretKey: Fn.BYTES,\n        publicKey: 1 + Fp.BYTES,\n        publicKeyUncompressed: 1 + 2 * Fp.BYTES,\n        publicKeyHasPrefix: true,\n        signature: 2 * Fn.BYTES,\n    };\n}\n/**\n * Sometimes users only need getPublicKey, getSharedSecret, and secret key handling.\n * This helper ensures no signature functionality is present. Less code, smaller bundle size.\n */\nexport function ecdh(Point, ecdhOpts = {}) {\n    const { Fn } = Point;\n    const randomBytes_ = ecdhOpts.randomBytes || randomBytesWeb;\n    const lengths = Object.assign(getWLengths(Point.Fp, Fn), { seed: getMinHashLength(Fn.ORDER) });\n    function isValidSecretKey(secretKey) {\n        try {\n            return !!_normFnElement(Fn, secretKey);\n        }\n        catch (error) {\n            return false;\n        }\n    }\n    function isValidPublicKey(publicKey, isCompressed) {\n        const { publicKey: comp, publicKeyUncompressed } = lengths;\n        try {\n            const l = publicKey.length;\n            if (isCompressed === true && l !== comp)\n                return false;\n            if (isCompressed === false && l !== publicKeyUncompressed)\n                return false;\n            return !!Point.fromBytes(publicKey);\n        }\n        catch (error) {\n            return false;\n        }\n    }\n    /**\n     * Produces cryptographically secure secret key from random of size\n     * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n     */\n    function randomSecretKey(seed = randomBytes_(lengths.seed)) {\n        return mapHashToField(abytes(seed, lengths.seed, 'seed'), Fn.ORDER);\n    }\n    /**\n     * Computes public key for a secret key. Checks for validity of the secret key.\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns Public key, full when isCompressed=false; short when isCompressed=true\n     */\n    function getPublicKey(secretKey, isCompressed = true) {\n        return Point.BASE.multiply(_normFnElement(Fn, secretKey)).toBytes(isCompressed);\n    }\n    function keygen(seed) {\n        const secretKey = randomSecretKey(seed);\n        return { secretKey, publicKey: getPublicKey(secretKey) };\n    }\n    /**\n     * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n     */\n    function isProbPub(item) {\n        if (typeof item === 'bigint')\n            return false;\n        if (item instanceof Point)\n            return true;\n        const { secretKey, publicKey, publicKeyUncompressed } = lengths;\n        if (Fn.allowedLengths || secretKey === publicKey)\n            return undefined;\n        const l = ensureBytes('key', item).length;\n        return l === publicKey || l === publicKeyUncompressed;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from secret key A and public key B.\n     * Checks: 1) secret key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(secretKeyA, publicKeyB, isCompressed = true) {\n        if (isProbPub(secretKeyA) === true)\n            throw new Error('first arg must be private key');\n        if (isProbPub(publicKeyB) === false)\n            throw new Error('second arg must be public key');\n        const s = _normFnElement(Fn, secretKeyA);\n        const b = Point.fromHex(publicKeyB); // checks for being on-curve\n        return b.multiply(s).toBytes(isCompressed);\n    }\n    const utils = {\n        isValidSecretKey,\n        isValidPublicKey,\n        randomSecretKey,\n        // TODO: remove\n        isValidPrivateKey: isValidSecretKey,\n        randomPrivateKey: randomSecretKey,\n        normPrivateKeyToScalar: (key) => _normFnElement(Fn, key),\n        precompute(windowSize = 8, point = Point.BASE) {\n            return point.precompute(windowSize, false);\n        },\n    };\n    return Object.freeze({ getPublicKey, getSharedSecret, keygen, Point, utils, lengths });\n}\n/**\n * Creates ECDSA signing interface for given elliptic curve `Point` and `hash` function.\n * We need `hash` for 2 features:\n * 1. Message prehash-ing. NOT used if `sign` / `verify` are called with `prehash: false`\n * 2. k generation in `sign`, using HMAC-drbg(hash)\n *\n * ECDSAOpts are only rarely needed.\n *\n * @example\n * ```js\n * const p256_Point = weierstrass(...);\n * const p256_sha256 = ecdsa(p256_Point, sha256);\n * const p256_sha224 = ecdsa(p256_Point, sha224);\n * const p256_sha224_r = ecdsa(p256_Point, sha224, { randomBytes: (length) => { ... } });\n * ```\n */\nexport function ecdsa(Point, hash, ecdsaOpts = {}) {\n    ahash(hash);\n    _validateObject(ecdsaOpts, {}, {\n        hmac: 'function',\n        lowS: 'boolean',\n        randomBytes: 'function',\n        bits2int: 'function',\n        bits2int_modN: 'function',\n    });\n    const randomBytes = ecdsaOpts.randomBytes || randomBytesWeb;\n    const hmac = ecdsaOpts.hmac ||\n        ((key, ...msgs) => nobleHmac(hash, key, concatBytes(...msgs)));\n    const { Fp, Fn } = Point;\n    const { ORDER: CURVE_ORDER, BITS: fnBits } = Fn;\n    const { keygen, getPublicKey, getSharedSecret, utils, lengths } = ecdh(Point, ecdsaOpts);\n    const defaultSigOpts = {\n        prehash: false,\n        lowS: typeof ecdsaOpts.lowS === 'boolean' ? ecdsaOpts.lowS : false,\n        format: undefined, //'compact' as ECDSASigFormat,\n        extraEntropy: false,\n    };\n    const defaultSigOpts_format = 'compact';\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function validateRS(title, num) {\n        if (!Fn.isValidNot0(num))\n            throw new Error(`invalid signature ${title}: out of range 1..Point.Fn.ORDER`);\n        return num;\n    }\n    function validateSigLength(bytes, format) {\n        validateSigFormat(format);\n        const size = lengths.signature;\n        const sizer = format === 'compact' ? size : format === 'recovered' ? size + 1 : undefined;\n        return abytes(bytes, sizer, `${format} signature`);\n    }\n    /**\n     * ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = validateRS('r', r); // r in [1..N-1];\n            this.s = validateRS('s', s); // s in [1..N-1];\n            if (recovery != null)\n                this.recovery = recovery;\n            Object.freeze(this);\n        }\n        static fromBytes(bytes, format = defaultSigOpts_format) {\n            validateSigLength(bytes, format);\n            let recid;\n            if (format === 'der') {\n                const { r, s } = DER.toSig(abytes(bytes));\n                return new Signature(r, s);\n            }\n            if (format === 'recovered') {\n                recid = bytes[0];\n                format = 'compact';\n                bytes = bytes.subarray(1);\n            }\n            const L = Fn.BYTES;\n            const r = bytes.subarray(0, L);\n            const s = bytes.subarray(L, L * 2);\n            return new Signature(Fn.fromBytes(r), Fn.fromBytes(s), recid);\n        }\n        static fromHex(hex, format) {\n            return this.fromBytes(hexToBytes(hex), format);\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(messageHash) {\n            const FIELD_ORDER = Fp.ORDER;\n            const { r, s, recovery: rec } = this;\n            if (rec == null || ![0, 1, 2, 3].includes(rec))\n                throw new Error('recovery id invalid');\n            // ECDSA recovery is hard for cofactor > 1 curves.\n            // In sign, `r = q.x mod n`, and here we recover q.x from r.\n            // While recovering q.x >= n, we need to add r+n for cofactor=1 curves.\n            // However, for cofactor>1, r+n may not get q.x:\n            // r+n*i would need to be done instead where i is unknown.\n            // To easily get i, we either need to:\n            // a. increase amount of valid recid values (4, 5...); OR\n            // b. prohibit non-prime-order signatures (recid > 1).\n            const hasCofactor = CURVE_ORDER * _2n < FIELD_ORDER;\n            if (hasCofactor && rec > 1)\n                throw new Error('recovery id is ambiguous for h>1 curve');\n            const radj = rec === 2 || rec === 3 ? r + CURVE_ORDER : r;\n            if (!Fp.isValid(radj))\n                throw new Error('recovery id 2 or 3 invalid');\n            const x = Fp.toBytes(radj);\n            const R = Point.fromBytes(concatBytes(pprefix((rec & 1) === 0), x));\n            const ir = Fn.inv(radj); // r^-1\n            const h = bits2int_modN(ensureBytes('msgHash', messageHash)); // Truncate hash\n            const u1 = Fn.create(-h * ir); // -hr^-1\n            const u2 = Fn.create(s * ir); // sr^-1\n            // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1). unsafe is fine: there is no private data.\n            const Q = Point.BASE.multiplyUnsafe(u1).add(R.multiplyUnsafe(u2));\n            if (Q.is0())\n                throw new Error('point at infinify');\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        toBytes(format = defaultSigOpts_format) {\n            validateSigFormat(format);\n            if (format === 'der')\n                return hexToBytes(DER.hexFromSig(this));\n            const r = Fn.toBytes(this.r);\n            const s = Fn.toBytes(this.s);\n            if (format === 'recovered') {\n                if (this.recovery == null)\n                    throw new Error('recovery bit must be present');\n                return concatBytes(Uint8Array.of(this.recovery), r, s);\n            }\n            return concatBytes(r, s);\n        }\n        toHex(format) {\n            return bytesToHex(this.toBytes(format));\n        }\n        // TODO: remove\n        assertValidity() { }\n        static fromCompact(hex) {\n            return Signature.fromBytes(ensureBytes('sig', hex), 'compact');\n        }\n        static fromDER(hex) {\n            return Signature.fromBytes(ensureBytes('sig', hex), 'der');\n        }\n        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, Fn.neg(this.s), this.recovery) : this;\n        }\n        toDERRawBytes() {\n            return this.toBytes('der');\n        }\n        toDERHex() {\n            return bytesToHex(this.toBytes('der'));\n        }\n        toCompactRawBytes() {\n            return this.toBytes('compact');\n        }\n        toCompactHex() {\n            return bytesToHex(this.toBytes('compact'));\n        }\n    }\n    // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n    // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n    // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n    // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n    const bits2int = ecdsaOpts.bits2int ||\n        function bits2int_def(bytes) {\n            // Our custom check \"just in case\", for protection against DoS\n            if (bytes.length > 8192)\n                throw new Error('input is too large');\n            // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n            // for some cases, since bytes.length * 8 is not actual bitLength.\n            const num = bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - fnBits; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = ecdsaOpts.bits2int_modN ||\n        function bits2int_modN_def(bytes) {\n            return Fn.create(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // Pads output with zero as per spec\n    const ORDER_MASK = bitMask(fnBits);\n    /** Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`. */\n    function int2octets(num) {\n        // IMPORTANT: the check ensures working for case `Fn.BYTES != Fn.BITS * 8`\n        aInRange('num < 2^' + fnBits, num, _0n, ORDER_MASK);\n        return Fn.toBytes(num);\n    }\n    function validateMsgAndHash(message, prehash) {\n        abytes(message, undefined, 'message');\n        return prehash ? abytes(hash(message), undefined, 'prehashed message') : message;\n    }\n    /**\n     * Steps A, D of RFC6979 3.2.\n     * Creates RFC6979 seed; converts msg/privKey to numbers.\n     * Used only in sign, not in verify.\n     *\n     * Warning: we cannot assume here that message has same amount of bytes as curve order,\n     * this will be invalid at least for P521. Also it can be bigger for P224 + SHA256.\n     */\n    function prepSig(message, privateKey, opts) {\n        if (['recovered', 'canonical'].some((k) => k in opts))\n            throw new Error('sign() legacy options not supported');\n        const { lowS, prehash, extraEntropy } = validateSigOpts(opts, defaultSigOpts);\n        message = validateMsgAndHash(message, prehash); // RFC6979 3.2 A: h1 = H(m)\n        // We can't later call bits2octets, since nested bits2int is broken for curves\n        // with fnBits % 8 !== 0. Because of that, we unwrap it here as int2octets call.\n        // const bits2octets = (bits) => int2octets(bits2int_modN(bits))\n        const h1int = bits2int_modN(message);\n        const d = _normFnElement(Fn, privateKey); // validate secret key, convert to bigint\n        const seedArgs = [int2octets(d), int2octets(h1int)];\n        // extraEntropy. RFC6979 3.6: additional k' (optional).\n        if (extraEntropy != null && extraEntropy !== false) {\n            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n            // gen random bytes OR pass as-is\n            const e = extraEntropy === true ? randomBytes(lengths.secretKey) : extraEntropy;\n            seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n        }\n        const seed = concatBytes(...seedArgs); // Step D of RFC6979 3.2\n        const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n        // Converts signature params into point w r/s, checks result for validity.\n        // To transform k => Signature:\n        // q = k⋅G\n        // r = q.x mod n\n        // s = k^-1(m + rd) mod n\n        // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n        // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n        // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            // Important: all mod() calls here must be done over N\n            const k = bits2int(kBytes); // mod n, not mod p\n            if (!Fn.isValidNot0(k))\n                return; // Valid scalars (including k) must be in 1..N-1\n            const ik = Fn.inv(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = k⋅G\n            const r = Fn.create(q.x); // r = q.x mod n\n            if (r === _0n)\n                return;\n            const s = Fn.create(ik * Fn.create(m + r * d)); // Not using blinding here, see comment above\n            if (s === _0n)\n                return;\n            let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n            let normS = s;\n            if (lowS && isBiggerThanHalfOrder(s)) {\n                normS = Fn.neg(s); // if lowS was passed, ensure s is always\n                recovery ^= 1; // // in the bottom half of N\n            }\n            return new Signature(r, normS, recovery); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    /**\n     * Signs message hash with a secret key.\n     *\n     * ```\n     * sign(m, d) where\n     *   k = rfc6979_hmac_drbg(m, d)\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr) / k mod n\n     * ```\n     */\n    function sign(message, secretKey, opts = {}) {\n        message = ensureBytes('message', message);\n        const { seed, k2sig } = prepSig(message, secretKey, opts); // Steps A, D of RFC6979 3.2.\n        const drbg = createHmacDrbg(hash.outputLen, Fn.BYTES, hmac);\n        const sig = drbg(seed, k2sig); // Steps B, C, D, E, F, G\n        return sig;\n    }\n    function tryParsingSig(sg) {\n        // Try to deduce format\n        let sig = undefined;\n        const isHex = typeof sg === 'string' || isBytes(sg);\n        const isObj = !isHex &&\n            sg !== null &&\n            typeof sg === 'object' &&\n            typeof sg.r === 'bigint' &&\n            typeof sg.s === 'bigint';\n        if (!isHex && !isObj)\n            throw new Error('invalid signature, expected Uint8Array, hex string or Signature instance');\n        if (isObj) {\n            sig = new Signature(sg.r, sg.s);\n        }\n        else if (isHex) {\n            try {\n                sig = Signature.fromBytes(ensureBytes('sig', sg), 'der');\n            }\n            catch (derError) {\n                if (!(derError instanceof DER.Err))\n                    throw derError;\n            }\n            if (!sig) {\n                try {\n                    sig = Signature.fromBytes(ensureBytes('sig', sg), 'compact');\n                }\n                catch (error) {\n                    return false;\n                }\n            }\n        }\n        if (!sig)\n            return false;\n        return sig;\n    }\n    /**\n     * Verifies a signature against message and public key.\n     * Rejects lowS signatures by default: see {@link ECDSAVerifyOpts}.\n     * Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n     *\n     * ```\n     * verify(r, s, h, P) where\n     *   u1 = hs^-1 mod n\n     *   u2 = rs^-1 mod n\n     *   R = u1⋅G + u2⋅P\n     *   mod(R.x, n) == r\n     * ```\n     */\n    function verify(signature, message, publicKey, opts = {}) {\n        const { lowS, prehash, format } = validateSigOpts(opts, defaultSigOpts);\n        publicKey = ensureBytes('publicKey', publicKey);\n        message = validateMsgAndHash(ensureBytes('message', message), prehash);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        const sig = format === undefined\n            ? tryParsingSig(signature)\n            : Signature.fromBytes(ensureBytes('sig', signature), format);\n        if (sig === false)\n            return false;\n        try {\n            const P = Point.fromBytes(publicKey);\n            if (lowS && sig.hasHighS())\n                return false;\n            const { r, s } = sig;\n            const h = bits2int_modN(message); // mod n, not mod p\n            const is = Fn.inv(s); // s^-1 mod n\n            const u1 = Fn.create(h * is); // u1 = hs^-1 mod n\n            const u2 = Fn.create(r * is); // u2 = rs^-1 mod n\n            const R = Point.BASE.multiplyUnsafe(u1).add(P.multiplyUnsafe(u2)); // u1⋅G + u2⋅P\n            if (R.is0())\n                return false;\n            const v = Fn.create(R.x); // v = r.x mod n\n            return v === r;\n        }\n        catch (e) {\n            return false;\n        }\n    }\n    function recoverPublicKey(signature, message, opts = {}) {\n        const { prehash } = validateSigOpts(opts, defaultSigOpts);\n        message = validateMsgAndHash(message, prehash);\n        return Signature.fromBytes(signature, 'recovered').recoverPublicKey(message).toBytes();\n    }\n    return Object.freeze({\n        keygen,\n        getPublicKey,\n        getSharedSecret,\n        utils,\n        lengths,\n        Point,\n        sign,\n        verify,\n        recoverPublicKey,\n        Signature,\n        hash,\n    });\n}\n/** @deprecated use `weierstrass` in newer releases */\nexport function weierstrassPoints(c) {\n    const { CURVE, curveOpts } = _weierstrass_legacy_opts_to_new(c);\n    const Point = weierstrassN(CURVE, curveOpts);\n    return _weierstrass_new_output_to_legacy(c, Point);\n}\nfunction _weierstrass_legacy_opts_to_new(c) {\n    const CURVE = {\n        a: c.a,\n        b: c.b,\n        p: c.Fp.ORDER,\n        n: c.n,\n        h: c.h,\n        Gx: c.Gx,\n        Gy: c.Gy,\n    };\n    const Fp = c.Fp;\n    let allowedLengths = c.allowedPrivateKeyLengths\n        ? Array.from(new Set(c.allowedPrivateKeyLengths.map((l) => Math.ceil(l / 2))))\n        : undefined;\n    const Fn = Field(CURVE.n, {\n        BITS: c.nBitLength,\n        allowedLengths: allowedLengths,\n        modFromBytes: c.wrapPrivateKey,\n    });\n    const curveOpts = {\n        Fp,\n        Fn,\n        allowInfinityPoint: c.allowInfinityPoint,\n        endo: c.endo,\n        isTorsionFree: c.isTorsionFree,\n        clearCofactor: c.clearCofactor,\n        fromBytes: c.fromBytes,\n        toBytes: c.toBytes,\n    };\n    return { CURVE, curveOpts };\n}\nfunction _ecdsa_legacy_opts_to_new(c) {\n    const { CURVE, curveOpts } = _weierstrass_legacy_opts_to_new(c);\n    const ecdsaOpts = {\n        hmac: c.hmac,\n        randomBytes: c.randomBytes,\n        lowS: c.lowS,\n        bits2int: c.bits2int,\n        bits2int_modN: c.bits2int_modN,\n    };\n    return { CURVE, curveOpts, hash: c.hash, ecdsaOpts };\n}\nexport function _legacyHelperEquat(Fp, a, b) {\n    /**\n     * y² = x³ + ax + b: Short weierstrass curve formula. Takes x, returns y².\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x² * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x³ + a * x + b\n    }\n    return weierstrassEquation;\n}\nfunction _weierstrass_new_output_to_legacy(c, Point) {\n    const { Fp, Fn } = Point;\n    function isWithinCurveOrder(num) {\n        return inRange(num, _1n, Fn.ORDER);\n    }\n    const weierstrassEquation = _legacyHelperEquat(Fp, c.a, c.b);\n    return Object.assign({}, {\n        CURVE: c,\n        Point: Point,\n        ProjectivePoint: Point,\n        normPrivateKeyToScalar: (key) => _normFnElement(Fn, key),\n        weierstrassEquation,\n        isWithinCurveOrder,\n    });\n}\nfunction _ecdsa_new_output_to_legacy(c, _ecdsa) {\n    const Point = _ecdsa.Point;\n    return Object.assign({}, _ecdsa, {\n        ProjectivePoint: Point,\n        CURVE: Object.assign({}, c, nLength(Point.Fn.ORDER, Point.Fn.BITS)),\n    });\n}\n// _ecdsa_legacy\nexport function weierstrass(c) {\n    const { CURVE, curveOpts, hash, ecdsaOpts } = _ecdsa_legacy_opts_to_new(c);\n    const Point = weierstrassN(CURVE, curveOpts);\n    const signs = ecdsa(Point, hash, ecdsaOpts);\n    return _ecdsa_new_output_to_legacy(c, signs);\n}\n//# sourceMappingURL=weierstrass.js.map","/**\n * Utilities for short weierstrass curves, combined with noble-hashes.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { weierstrass } from \"./abstract/weierstrass.js\";\n/** connects noble-curves to noble-hashes */\nexport function getHash(hash) {\n    return { hash };\n}\n/** @deprecated use new `weierstrass()` and `ecdsa()` methods */\nexport function createCurve(curveDef, defHash) {\n    const create = (hash) => weierstrass({ ...curveDef, hash: hash });\n    return { ...create(defHash), create };\n}\n//# sourceMappingURL=_shortw_utils.js.map","/**\n * Internal module for NIST P256, P384, P521 curves.\n * Do not use for now.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256, sha384, sha512 } from '@noble/hashes/sha2.js';\nimport { createCurve } from \"./_shortw_utils.js\";\nimport { createHasher } from \"./abstract/hash-to-curve.js\";\nimport { Field } from \"./abstract/modular.js\";\nimport { mapToCurveSimpleSWU, } from \"./abstract/weierstrass.js\";\n// p = 2n**224n * (2n**32n-1n) + 2n**192n + 2n**96n - 1n\n// a = Fp256.create(BigInt('-3'));\nconst p256_CURVE = {\n    p: BigInt('0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff'),\n    n: BigInt('0xffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551'),\n    h: BigInt(1),\n    a: BigInt('0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc'),\n    b: BigInt('0x5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b'),\n    Gx: BigInt('0x6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296'),\n    Gy: BigInt('0x4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5'),\n};\n// p = 2n**384n - 2n**128n - 2n**96n + 2n**32n - 1n\nconst p384_CURVE = {\n    p: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000ffffffff'),\n    n: BigInt('0xffffffffffffffffffffffffffffffffffffffffffffffffc7634d81f4372ddf581a0db248b0a77aecec196accc52973'),\n    h: BigInt(1),\n    a: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffeffffffff0000000000000000fffffffc'),\n    b: BigInt('0xb3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef'),\n    Gx: BigInt('0xaa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7'),\n    Gy: BigInt('0x3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f'),\n};\n// p = 2n**521n - 1n\nconst p521_CURVE = {\n    p: BigInt('0x1ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff'),\n    n: BigInt('0x01fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffa51868783bf2f966b7fcc0148f709a5d03bb5c9b8899c47aebb6fb71e91386409'),\n    h: BigInt(1),\n    a: BigInt('0x1fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffc'),\n    b: BigInt('0x0051953eb9618e1c9a1f929a21a0b68540eea2da725b99b315f3b8b489918ef109e156193951ec7e937b1652c0bd3bb1bf073573df883d2c34f1ef451fd46b503f00'),\n    Gx: BigInt('0x00c6858e06b70404e9cd9e3ecb662395b4429c648139053fb521f828af606b4d3dbaa14b5e77efe75928fe1dc127a2ffa8de3348b3c1856a429bf97e7e31c2e5bd66'),\n    Gy: BigInt('0x011839296a789a3bc0045c8a5fb42c7d1bd998f54449579b446817afbd17273e662c97ee72995ef42640c550b9013fad0761353c7086a272c24088be94769fd16650'),\n};\nconst Fp256 = Field(p256_CURVE.p);\nconst Fp384 = Field(p384_CURVE.p);\nconst Fp521 = Field(p521_CURVE.p);\nfunction createSWU(Point, opts) {\n    const map = mapToCurveSimpleSWU(Point.Fp, opts);\n    return (scalars) => map(scalars[0]);\n}\n/** NIST P256 (aka secp256r1, prime256v1) curve, ECDSA and ECDH methods. */\nexport const p256 = createCurve({ ...p256_CURVE, Fp: Fp256, lowS: false }, sha256);\n/** Hashing / encoding to p256 points / field. RFC 9380 methods. */\nexport const p256_hasher = /* @__PURE__ */ (() => {\n    return createHasher(p256.Point, createSWU(p256.Point, {\n        A: p256_CURVE.a,\n        B: p256_CURVE.b,\n        Z: p256.Point.Fp.create(BigInt('-10')),\n    }), {\n        DST: 'P256_XMD:SHA-256_SSWU_RO_',\n        encodeDST: 'P256_XMD:SHA-256_SSWU_NU_',\n        p: p256_CURVE.p,\n        m: 1,\n        k: 128,\n        expand: 'xmd',\n        hash: sha256,\n    });\n})();\n// export const p256_oprf: OPRF = createORPF({\n//   name: 'P256-SHA256',\n//   Point: p256.Point,\n//   hash: sha256,\n//   hashToGroup: p256_hasher.hashToCurve,\n//   hashToScalar: p256_hasher.hashToScalar,\n// });\n/** NIST P384 (aka secp384r1) curve, ECDSA and ECDH methods. */\nexport const p384 = createCurve({ ...p384_CURVE, Fp: Fp384, lowS: false }, sha384);\n/** Hashing / encoding to p384 points / field. RFC 9380 methods. */\nexport const p384_hasher = /* @__PURE__ */ (() => {\n    return createHasher(p384.Point, createSWU(p384.Point, {\n        A: p384_CURVE.a,\n        B: p384_CURVE.b,\n        Z: p384.Point.Fp.create(BigInt('-12')),\n    }), {\n        DST: 'P384_XMD:SHA-384_SSWU_RO_',\n        encodeDST: 'P384_XMD:SHA-384_SSWU_NU_',\n        p: p384_CURVE.p,\n        m: 1,\n        k: 192,\n        expand: 'xmd',\n        hash: sha384,\n    });\n})();\n// export const p384_oprf: OPRF = createORPF({\n//   name: 'P384-SHA384',\n//   Point: p384.Point,\n//   hash: sha384,\n//   hashToGroup: p384_hasher.hashToCurve,\n//   hashToScalar: p384_hasher.hashToScalar,\n// });\n// const Fn521 = Field(p521_CURVE.n, { allowedScalarLengths: [65, 66] });\n/** NIST P521 (aka secp521r1) curve, ECDSA and ECDH methods. */\nexport const p521 = createCurve({ ...p521_CURVE, Fp: Fp521, lowS: false, allowedPrivateKeyLengths: [130, 131, 132] }, sha512);\n/** @deprecated use `p256` for consistency with `p256_hasher` */\nexport const secp256r1 = p256;\n/** @deprecated use `p384` for consistency with `p384_hasher` */\nexport const secp384r1 = p384;\n/** @deprecated use `p521` for consistency with `p521_hasher` */\nexport const secp521r1 = p521;\n/** Hashing / encoding to p521 points / field. RFC 9380 methods. */\nexport const p521_hasher = /* @__PURE__ */ (() => {\n    return createHasher(p521.Point, createSWU(p521.Point, {\n        A: p521_CURVE.a,\n        B: p521_CURVE.b,\n        Z: p521.Point.Fp.create(BigInt('-4')),\n    }), {\n        DST: 'P521_XMD:SHA-512_SSWU_RO_',\n        encodeDST: 'P521_XMD:SHA-512_SSWU_NU_',\n        p: p521_CURVE.p,\n        m: 1,\n        k: 256,\n        expand: 'xmd',\n        hash: sha512,\n    });\n})();\n// export const p521_oprf: OPRF = createORPF({\n//   name: 'P521-SHA512',\n//   Point: p521.Point,\n//   hash: sha512,\n//   hashToGroup: p521_hasher.hashToCurve,\n//   hashToScalar: p521_hasher.hashToScalar, // produces L=98 just like in RFC\n// });\n//# sourceMappingURL=nist.js.map","import { ASN1Obj } from \"./asn1/index.js\";\nimport { base64ToUint8Array, base64UrlToUint8Array, hexToUint8Array, } from \"./encoding.js\";\nimport { EcdsaTypes, HashAlgorithms, KeyTypes, RsaAlgorithms, RsaSchemes } from \"./interfaces.js\";\nimport { toDER } from \"./pem.js\";\nimport { p256, p384, p521 } from \"@noble/curves/nist.js\";\nfunction pkcs1ToSpki(pkcs1Bytes) {\n    const algorithmIdentifier = new Uint8Array([\n        0x30, 0x0d,\n        0x06, 0x09, 0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x01, 0x01, 0x01,\n        0x05, 0x00\n    ]);\n    const bitStringLength = pkcs1Bytes.length + 1;\n    const totalContentLength = algorithmIdentifier.length + 1 + lengthBytes(bitStringLength).length + bitStringLength;\n    const result = new Uint8Array(1 + lengthBytes(totalContentLength).length + totalContentLength);\n    let offset = 0;\n    result[offset++] = 0x30;\n    const totalLengthBytes = lengthBytes(totalContentLength);\n    result.set(totalLengthBytes, offset);\n    offset += totalLengthBytes.length;\n    result.set(algorithmIdentifier, offset);\n    offset += algorithmIdentifier.length;\n    result[offset++] = 0x03;\n    const bitStringLengthBytes = lengthBytes(bitStringLength);\n    result.set(bitStringLengthBytes, offset);\n    offset += bitStringLengthBytes.length;\n    result[offset++] = 0x00;\n    result.set(pkcs1Bytes, offset);\n    return result;\n}\n// Encodes a length value in DER (Distinguished Encoding Rules) format.\n// DER length encoding rules:\n// - Lengths 0-127: single byte containing the length\n// - Lengths 128-255: 0x81 followed by one byte containing the length\n// - Lengths 256-65535: 0x82 followed by two bytes containing the length (big-endian)\n// Used by pkcs1ToSpki() to construct valid ASN.1/DER structures.\nfunction lengthBytes(length) {\n    if (length < 128) {\n        return new Uint8Array([length]);\n    }\n    else if (length < 256) {\n        return new Uint8Array([0x81, length]);\n    }\n    else {\n        return new Uint8Array([0x82, (length >> 8) & 0xff, length & 0xff]);\n    }\n}\n// Imports cryptographic public keys into the Web Crypto API format (CryptoKey).\n// This function is specific to the browser implementation and doesn't exist in sigstore-js.\n//\n// Why needed for browser:\n// - sigstore-js uses Node.js crypto.createPublicKey() which handles many key formats automatically\n// - Browsers only have Web Crypto API (crypto.subtle.importKey) which requires explicit format/algorithm\n// - This function bridges the gap by:\n//   1. Detecting key format (PEM, hex, base64, PKCS#1, SPKI)\n//   2. Converting PKCS#1 RSA keys to SPKI (Web Crypto only supports SPKI for RSA)\n//   3. Mapping Sigstore key types/schemes to Web Crypto algorithm parameters\n//\n// Supports:\n// - ECDSA (P-256, P-384, P-521) - Used by Fulcio, CT logs\n// - Ed25519 - Used by Rekor checkpoints, some CT logs\n// - RSA (PKCS#1, PSS) - Used by older CT logs and some Rekor instances\n//\n// Key format detection:\n// - PEM format (contains \"BEGIN\"): Parse with toDER()\n// - Hex string (all hex chars): Import as raw\n// - Base64 PKCS#1 (starts with 0x30 0x82...): Convert to SPKI\n// - Base64 SPKI: Import directly\nexport async function importKey(keytype, scheme, key) {\n    class importParams {\n        constructor() {\n            this.format = \"spki\";\n            this.keyData = new Uint8Array(0);\n            this.algorithm = { name: KeyTypes.Ecdsa };\n            this.extractable = true;\n            this.usage = [\"verify\"];\n        }\n    }\n    const params = new importParams();\n    if (key.includes(\"BEGIN\")) {\n        params.format = \"spki\";\n        params.keyData = toDER(key);\n    }\n    else if (/^[0-9A-Fa-f]+$/.test(key)) {\n        params.format = \"raw\";\n        params.keyData = hexToUint8Array(key);\n    }\n    else {\n        params.format = \"spki\";\n        const keyBytes = base64ToUint8Array(key);\n        if (keytype.toLowerCase().includes(\"pkcs1\") &&\n            keyBytes[0] === 0x30 && keyBytes[1] === 0x82 &&\n            keyBytes[4] === 0x02 && keyBytes[5] === 0x82) {\n            params.keyData = pkcs1ToSpki(keyBytes);\n        }\n        else {\n            params.keyData = keyBytes;\n        }\n    }\n    if (keytype.toLowerCase().includes(\"ecdsa\")) {\n        if (scheme.includes(\"256\")) {\n            params.algorithm = { name: KeyTypes.Ecdsa, namedCurve: EcdsaTypes.P256 };\n        }\n        else if (scheme.includes(\"384\")) {\n            params.algorithm = { name: KeyTypes.Ecdsa, namedCurve: EcdsaTypes.P384 };\n        }\n        else if (scheme.includes(\"521\")) {\n            params.algorithm = { name: KeyTypes.Ecdsa, namedCurve: EcdsaTypes.P521 };\n        }\n        else {\n            throw new Error(\"Cannot determine ECDSA key size.\");\n        }\n    }\n    else if (keytype.toLowerCase().includes(\"ed25519\")) {\n        params.algorithm = { name: KeyTypes.Ed25519 };\n    }\n    else if (keytype.toLowerCase().includes(\"rsa\") || keytype.toLowerCase().includes(\"pkcs1\")) {\n        let hashName = HashAlgorithms.SHA256;\n        // Normalize scheme to handle various formats: SHA256, SHA_256, SHA-256, etc.\n        const normalizedScheme = scheme.toUpperCase().replace(/[-_]/g, \"\");\n        if (normalizedScheme.includes(\"SHA256\") || normalizedScheme.includes(\"256\")) {\n            hashName = HashAlgorithms.SHA256;\n        }\n        else if (normalizedScheme.includes(\"SHA384\") || normalizedScheme.includes(\"384\")) {\n            hashName = HashAlgorithms.SHA384;\n        }\n        else if (normalizedScheme.includes(\"SHA512\") || normalizedScheme.includes(\"512\")) {\n            hashName = HashAlgorithms.SHA512;\n        }\n        if (normalizedScheme.includes(RsaSchemes.PKCS1) || normalizedScheme.includes(RsaSchemes.RSAPKCS1)) {\n            params.algorithm = {\n                name: RsaAlgorithms.PKCS1v15,\n                hash: { name: hashName },\n            };\n        }\n        else {\n            params.algorithm = {\n                name: RsaAlgorithms.PSS,\n                hash: { name: hashName },\n            };\n        }\n    }\n    else {\n        throw new Error(`Unsupported ${keytype}`);\n    }\n    return await crypto.subtle.importKey(params.format, params.keyData, params.algorithm, params.extractable, params.usage);\n}\nexport async function verifySignature(key, signed, sig, hash = \"sha256\") {\n    const options = {\n        name: key.algorithm.name,\n    };\n    if (key.algorithm.name === KeyTypes.Ecdsa) {\n        const namedCurve = key.algorithm.namedCurve;\n        let sig_size = 32;\n        if (namedCurve === EcdsaTypes.P256) {\n            sig_size = 32;\n        }\n        else if (namedCurve === EcdsaTypes.P384) {\n            sig_size = 48;\n        }\n        else if (namedCurve === EcdsaTypes.P521) {\n            sig_size = 66;\n        }\n        options.hash = { name: \"\" };\n        if (hash.includes(\"256\")) {\n            options.hash.name = HashAlgorithms.SHA256;\n        }\n        else if (hash.includes(\"384\")) {\n            options.hash.name = HashAlgorithms.SHA384;\n        }\n        else if (hash.includes(\"512\")) {\n            options.hash.name = HashAlgorithms.SHA512;\n        }\n        else {\n            throw new Error(\"Cannot determine hashing algorithm;\");\n        }\n        let raw_signature;\n        try {\n            const asn1_sig = ASN1Obj.parseBuffer(sig);\n            const r = asn1_sig.subs[0].toInteger();\n            const s = asn1_sig.subs[1].toInteger();\n            const binr = hexToUint8Array(r.toString(16).padStart(sig_size * 2, \"0\"));\n            const bins = hexToUint8Array(s.toString(16).padStart(sig_size * 2, \"0\"));\n            raw_signature = new Uint8Array(binr.length + bins.length);\n            raw_signature.set(binr, 0);\n            raw_signature.set(bins, binr.length);\n        }\n        catch {\n            return false;\n        }\n        return await crypto.subtle.verify(options, key, raw_signature, signed);\n    }\n    else if (key.algorithm.name === KeyTypes.Ed25519) {\n        return await crypto.subtle.verify(key.algorithm.name, key, sig, signed);\n    }\n    else if (key.algorithm.name === RsaAlgorithms.PSS) {\n        const hashAlg = key.algorithm.hash.name;\n        const saltLength = hashAlg === HashAlgorithms.SHA256 ? 32 :\n            hashAlg === HashAlgorithms.SHA384 ? 48 :\n                hashAlg === HashAlgorithms.SHA512 ? 64 : 32;\n        return await crypto.subtle.verify({\n            name: RsaAlgorithms.PSS,\n            saltLength: saltLength,\n        }, key, sig, signed);\n    }\n    else if (key.algorithm.name === RsaAlgorithms.PKCS1v15) {\n        return await crypto.subtle.verify(key.algorithm.name, key, sig, signed);\n    }\n    else {\n        throw new Error(\"Unsupported key type!\");\n    }\n}\n// Verifies an ECDSA signature over a pre-computed digest.\n// WebCrypto's verify() always hashes the input first, so passing a digest would\n// result in double-hashing. We use @noble/curves for low-level ECDSA verification,\n// adapted from the same workaround used in sigstore-js's conformance CLI.\n// See: https://github.com/sigstore/sigstore-js/blob/main/packages/conformance/src/commands/verify-bundle.ts#L111\nexport async function verifySignatureOverDigest(key, digest, sig) {\n    if (key.algorithm.name !== KeyTypes.Ecdsa) {\n        throw new Error(\"verifySignatureOverDigest only supports ECDSA keys\");\n    }\n    const namedCurve = key.algorithm.namedCurve;\n    let curve;\n    if (namedCurve === EcdsaTypes.P256) {\n        curve = p256;\n    }\n    else if (namedCurve === EcdsaTypes.P384) {\n        curve = p384;\n    }\n    else if (namedCurve === EcdsaTypes.P521) {\n        curve = p521;\n    }\n    else {\n        throw new Error(`Unsupported curve: ${namedCurve}`);\n    }\n    // Export the public key to get x and y coordinates\n    const jwk = await crypto.subtle.exportKey(\"jwk\", key);\n    if (!jwk.x || !jwk.y) {\n        throw new Error(\"Invalid ECDSA public key: missing x or y coordinates\");\n    }\n    // Convert base64url JWK coordinates to bytes\n    const x = base64UrlToUint8Array(jwk.x);\n    const y = base64UrlToUint8Array(jwk.y);\n    // Combine x and y into uncompressed public key format (0x04 || x || y)\n    const publicKey = new Uint8Array(1 + x.length + y.length);\n    publicKey[0] = 0x04;\n    publicKey.set(x, 1);\n    publicKey.set(y, 1 + x.length);\n    // Verify the DER-encoded signature over the digest\n    // @noble/curves can parse DER signatures directly with format: 'der'\n    // Options:\n    // - format: 'der' to parse DER-encoded signatures\n    // - prehash: false because we're passing a pre-computed digest, not the original message\n    // - lowS: false to accept both high-S and low-S signatures (matches elliptic.js behavior)\n    //   elliptic.js accepts malleable signatures by default, while @noble/curves rejects them by default\n    return curve.verify(sig, digest, publicKey, { format: 'der', prehash: false, lowS: false });\n}\nexport { uint8ArrayEqual as bufferEqual } from \"./encoding.js\";\n//# sourceMappingURL=crypto.js.map","import { X509Certificate } from \"./x509/index.js\";\n\nexport enum SigstoreRoots {\n  certificateAuthorities = \"certificateAuthorities\",\n  ctlogs = \"ctlogs\",\n  timestampAuthorities = \"timestampAuthorities\",\n  tlogs = \"tlogs\",\n}\n\nexport type RawTimestampAuthorities = RawTimestampAuthority[];\n\nexport interface TrustedRoot {\n  mediaType: string;\n  tlogs: RawLogs;\n  certificateAuthorities: RawCAs;\n  ctlogs: RawLogs;\n  timestampAuthorities: RawTimestampAuthorities;\n}\n\nexport interface RawTimestampAuthority {\n  subject: {\n    organization: string;\n    commonName: string;\n  };\n  certChain: {\n    certificates: {\n      rawBytes: string;\n    }[];\n  };\n  validFor: {\n    start: string;\n    end?: string;\n  };\n}\n\nexport interface CTLog {\n  logID: Uint8Array;\n  publicKey: CryptoKey;\n  validFor: {\n    start: Date;\n    end: Date;\n  };\n}\n\nexport interface RekorKeyInfo {\n  publicKey: CryptoKey;\n  logId: Uint8Array;\n}\n\nexport interface CertAuthority {\n  certChain: X509Certificate[];\n  validFor: {\n    start: Date;\n    end: Date;\n  };\n}\n\nexport interface Sigstore {\n  rekor: RekorKeyInfo | undefined;\n  ctlogs: CTLog[];\n  certificateAuthorities: CertAuthority[];\n  timestampAuthorities: CertAuthority[];\n}\n\nexport interface RawLog {\n  baseUrl: string;\n  hashAlgorithm: string;\n  publicKey: {\n    rawBytes: string;\n    keyDetails: string;\n    validFor: {\n      start: string;\n      end?: string;\n    };\n  };\n  logId: {\n    keyId: string;\n  };\n}\n\nexport type RawLogs = RawLog[];\n\nexport interface RawCA {\n  subject: {\n    organization: string;\n    commonName: string;\n  };\n  uri: string;\n  certChain: {\n    certificates: {\n      rawBytes: string;\n    }[];\n  };\n  validFor: {\n    start: string;\n    end?: string;\n  };\n}\n\nexport type RawCAs = RawCA[];\n\n// Re-export crypto enums from crypto-browser (shared with tuf-browser)\nexport { KeyTypes, EcdsaTypes, HashAlgorithms } from \"@freedomofpress/crypto-browser\";\nimport { HashAlgorithms } from \"@freedomofpress/crypto-browser\";\n\n// Supported hash algorithms for payload hash validation\n// Rekor v1 uses lowercase (sha256), Rekor v2 uses uppercase with underscore (SHA2_256)\nconst SUPPORTED_HASH_ALGORITHMS: Record<string, string> = {\n  \"sha256\": HashAlgorithms.SHA256,\n  \"sha384\": HashAlgorithms.SHA384,\n  \"sha512\": HashAlgorithms.SHA512,\n  \"SHA2_256\": HashAlgorithms.SHA256,\n  \"SHA2_384\": HashAlgorithms.SHA384,\n  \"SHA2_512\": HashAlgorithms.SHA512,\n};\n\nexport function getHashAlgorithm(algorithm: string): string {\n  const hashAlg = SUPPORTED_HASH_ALGORITHMS[algorithm];\n  if (!hashAlg) {\n    throw new Error(`Unsupported hash algorithm: ${algorithm}`);\n  }\n  return hashAlg;\n}\n","// From https://github.com/sigstore/sigstore-js/blob/main/packages/core/src/oid.ts\n\nexport const ECDSA_SIGNATURE_ALGOS: Record<string, string> = {\n  \"1.2.840.10045.4.3.1\": \"sha224\",\n  \"1.2.840.10045.4.3.2\": \"sha256\",\n  \"1.2.840.10045.4.3.3\": \"sha384\",\n  \"1.2.840.10045.4.3.4\": \"sha512\",\n};\n\n// RSA signature algorithms (PKCS#1 v1.5)\nexport const RSA_SIGNATURE_ALGOS: Record<string, string> = {\n  \"1.2.840.113549.1.1.11\": \"sha256\", // sha256WithRSAEncryption\n  \"1.2.840.113549.1.1.12\": \"sha384\", // sha384WithRSAEncryption\n  \"1.2.840.113549.1.1.13\": \"sha512\", // sha512WithRSAEncryption\n  \"1.2.840.113549.1.1.5\": \"sha1\",    // sha1WithRSAEncryption\n};\n\n// RSASSA-PSS OID - hash algorithm must be parsed from signature algorithm parameters\nexport const OID_RSASSA_PSS = \"1.2.840.113549.1.1.10\";\n\nexport const SHA2_HASH_ALGOS: Record<string, string> = {\n  \"2.16.840.1.101.3.4.2.1\": \"sha256\",\n  \"2.16.840.1.101.3.4.2.2\": \"sha384\",\n  \"2.16.840.1.101.3.4.2.3\": \"sha512\",\n};\n\n// Default hash algorithm used when not specified\nexport const DEFAULT_HASH_ALGORITHM = \"sha256\";\n\nexport const ECDSA_CURVE_NAMES: Record<string, string> = {\n  \"1.2.840.10045.3.1.7\": \"secp256r1\",\n  \"1.3.132.0.34\": \"secp384r1\",\n  \"1.3.132.0.35\": \"secp521r1\",\n};\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nimport { ByteStream, readBigInt64BE, verifySignature } from \"@freedomofpress/crypto-browser\";\n\ninterface SCTOptions {\n  version: number;\n  logID: Uint8Array;\n  timestamp: Uint8Array;\n  extensions: Uint8Array;\n  hashAlgorithm: number;\n  signatureAlgorithm: number;\n  signature: Uint8Array;\n}\n\nexport class SignedCertificateTimestamp {\n  readonly version: number;\n  readonly logID: Uint8Array;\n  readonly timestamp: Uint8Array;\n  readonly extensions: Uint8Array;\n  readonly hashAlgorithm: number;\n  readonly signatureAlgorithm: number;\n  readonly signature: Uint8Array;\n\n  constructor(options: SCTOptions) {\n    this.version = options.version;\n    this.logID = options.logID;\n    this.timestamp = options.timestamp;\n    this.extensions = options.extensions;\n    this.hashAlgorithm = options.hashAlgorithm;\n    this.signatureAlgorithm = options.signatureAlgorithm;\n    this.signature = options.signature;\n  }\n\n  get datetime(): Date {\n    return new Date(Number(readBigInt64BE(this.timestamp)));\n  }\n\n  // Returns the hash algorithm used to generate the SCT's signature.\n  // https://www.rfc-editor.org/rfc/rfc5246#section-7.4.1.4.1\n  get algorithm(): string {\n    switch (this.hashAlgorithm) {\n      /* istanbul ignore next */\n      case 0:\n        return \"none\";\n      /* istanbul ignore next */\n      case 1:\n        return \"md5\";\n      /* istanbul ignore next */\n      case 2:\n        return \"sha1\";\n      /* istanbul ignore next */\n      case 3:\n        return \"sha224\";\n      case 4:\n        return \"sha256\";\n      /* istanbul ignore next */\n      case 5:\n        return \"sha384\";\n      /* istanbul ignore next */\n      case 6:\n        return \"sha512\";\n      /* istanbul ignore next */\n      default:\n        return \"unknown\";\n    }\n  }\n\n  public async verify(preCert: Uint8Array, key: CryptoKey): Promise<boolean> {\n    // Assemble the digitally-signed struct (the data over which the signature\n    // was generated).\n    // https://www.rfc-editor.org/rfc/rfc6962#section-3.2\n    const stream = new ByteStream();\n    stream.appendChar(this.version);\n    stream.appendChar(0x00); // SignatureType = certificate_timestamp(0)\n    stream.appendView(this.timestamp);\n    stream.appendUint16(0x01); // LogEntryType = precert_entry(1)\n    stream.appendView(preCert);\n    stream.appendUint16(this.extensions.byteLength);\n\n    /* istanbul ignore next - extensions are very uncommon */\n    if (this.extensions.byteLength > 0) {\n      stream.appendView(this.extensions);\n    }\n\n    return await verifySignature(\n      key,\n      stream.buffer,\n      this.signature,\n      this.algorithm,\n    );\n  }\n\n  // Parses a SignedCertificateTimestamp from a buffer. SCTs are encoded using\n  // TLS encoding which means the fields and lengths of most fields are\n  // specified as part of the SCT and TLS specs.\n  // https://www.rfc-editor.org/rfc/rfc6962#section-3.2\n  // https://www.rfc-editor.org/rfc/rfc5246#section-7.4.1.4.1\n  public static parse(buf: Uint8Array): SignedCertificateTimestamp {\n    const stream = new ByteStream(buf);\n\n    // Version - enum { v1(0), (255) }\n    // RFC 6962 specifies only v1(0) is valid (for now)\n    const version = stream.getUint8();\n    if (version !== 0) {\n      throw new Error(`Unsupported SCT version: ${version} (expected 0 for v1)`);\n    }\n\n    // Log ID  - struct { opaque key_id[32]; }\n    const logID = stream.getBlock(32);\n\n    // Timestamp - uint64\n    const timestamp = stream.getBlock(8);\n\n    // Extensions - opaque extensions<0..2^16-1>;\n    const extenstionLength = stream.getUint16();\n    const extensions = stream.getBlock(extenstionLength);\n\n    // Hash algo - enum { sha256(4), . . . (255) }\n    const hashAlgorithm = stream.getUint8();\n\n    // Signature algo - enum { anonymous(0), rsa(1), dsa(2), ecdsa(3), (255) }\n    const signatureAlgorithm = stream.getUint8();\n\n    // Signature  - opaque signature<0..2^16-1>;\n    const sigLength = stream.getUint16();\n    const signature = stream.getBlock(sigLength);\n\n    // Check that we read the entire buffer\n    if (stream.position !== buf.length) {\n      throw new Error(\"SCT buffer length mismatch\");\n    }\n\n    return new SignedCertificateTimestamp({\n      version,\n      logID,\n      timestamp,\n      extensions,\n      hashAlgorithm,\n      signatureAlgorithm,\n      signature,\n    });\n  }\n}\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nimport { ASN1Obj, ByteStream, Uint8ArrayToString } from \"@freedomofpress/crypto-browser\";\nimport { SignedCertificateTimestamp } from \"./sct.js\";\n\n// https://www.rfc-editor.org/rfc/rfc5280#section-4.1\nexport class X509Extension {\n  protected root: ASN1Obj;\n\n  constructor(asn1: ASN1Obj) {\n    this.root = asn1;\n  }\n\n  get oid(): string {\n    return this.root.subs[0].toOID();\n  }\n\n  get critical(): boolean {\n    // The critical field is optional and will be the second element of the\n    // extension sequence if present. Default to false if not present.\n    return this.root.subs.length === 3 ? this.root.subs[1].toBoolean() : false;\n  }\n\n  get value(): Uint8Array {\n    return this.extnValueObj.value;\n  }\n\n  get valueObj(): ASN1Obj {\n    return this.extnValueObj;\n  }\n\n  protected get extnValueObj(): ASN1Obj {\n    // The extnValue field will be the last element of the extension sequence\n    return this.root.subs[this.root.subs.length - 1];\n  }\n}\n\n// https://www.rfc-editor.org/rfc/rfc5280#section-4.2.1.9\nexport class X509BasicConstraintsExtension extends X509Extension {\n  get isCA(): boolean {\n    return this.sequence.subs[0]?.toBoolean() ?? false;\n  }\n\n  get pathLenConstraint(): bigint | undefined {\n    return this.sequence.subs.length > 1\n      ? this.sequence.subs[1].toInteger()\n      : undefined;\n  }\n\n  // The extnValue field contains a single sequence wrapping the isCA and\n  // pathLenConstraint.\n  private get sequence(): ASN1Obj {\n    return this.extnValueObj.subs[0];\n  }\n}\n\n// https://www.rfc-editor.org/rfc/rfc5280#section-4.2.1.3\nexport class X509KeyUsageExtension extends X509Extension {\n  get digitalSignature(): boolean {\n    return this.bitString[0] === 1;\n  }\n\n  get keyCertSign(): boolean {\n    return this.bitString[5] === 1;\n  }\n\n  get crlSign(): boolean {\n    return this.bitString[6] === 1;\n  }\n\n  // The extnValue field contains a single bit string which is a bit mask\n  // indicating which key usages are enabled.\n  private get bitString(): number[] {\n    return this.extnValueObj.subs[0].toBitString();\n  }\n}\n\n// https://www.rfc-editor.org/rfc/rfc5280#section-4.2.1.6\nexport class X509SubjectAlternativeNameExtension extends X509Extension {\n  get rfc822Name(): string | undefined {\n    const rfc822Name = this.findGeneralName(0x01)?.value;\n    if (rfc822Name === undefined) {\n      return undefined;\n    } else {\n      return Uint8ArrayToString(rfc822Name);\n    }\n  }\n\n  get uri(): string | undefined {\n    const uri = this.findGeneralName(0x06)?.value;\n    if (uri === undefined) {\n      return undefined;\n    } else {\n      return Uint8ArrayToString(uri);\n    }\n  }\n\n  // Retrieve the value of an otherName with the given OID.\n  public otherName(oid: string): string | undefined {\n    const otherName = this.findGeneralName(0x00);\n\n    if (otherName === undefined) {\n      return undefined;\n    }\n\n    // The otherName is a sequence containing an OID and a value.\n    // Need to check that the OID matches the one we're looking for.\n    const otherNameOID = otherName.subs[0].toOID();\n    if (otherNameOID !== oid) {\n      return undefined;\n    }\n\n    // The otherNameValue is a sequence containing the actual value.\n    const otherNameValue = otherName.subs[1];\n    return Uint8ArrayToString(otherNameValue.subs[0].value);\n  }\n\n  private findGeneralName(tag: number): ASN1Obj | undefined {\n    return this.generalNames.find((gn) => gn.tag.isContextSpecific(tag));\n  }\n\n  // The extnValue field contains a sequence of GeneralNames.\n  private get generalNames(): ASN1Obj[] {\n    return this.extnValueObj.subs[0].subs;\n  }\n}\n\n// https://www.rfc-editor.org/rfc/rfc5280#section-4.2.1.1\nexport class X509AuthorityKeyIDExtension extends X509Extension {\n  get keyIdentifier(): Uint8Array | undefined {\n    return this.findSequenceMember(0x00)?.value;\n  }\n\n  private findSequenceMember(tag: number): ASN1Obj | undefined {\n    return this.sequence.subs.find((el) => el.tag.isContextSpecific(tag));\n  }\n\n  // The extnValue field contains a single sequence wrapping the keyIdentifier\n  private get sequence(): ASN1Obj {\n    return this.extnValueObj.subs[0];\n  }\n}\n\n// https://www.rfc-editor.org/rfc/rfc5280#section-4.2.1.2\nexport class X509SubjectKeyIDExtension extends X509Extension {\n  get keyIdentifier(): Uint8Array {\n    return this.extnValueObj.subs[0].value;\n  }\n}\n\n// Base class for Fulcio extensions with V1 format (raw OCTET STRING value)\n// https://github.com/sigstore/fulcio/blob/main/docs/oid-info.md\nclass X509FulcioExtensionV1 extends X509Extension {\n  get stringValue(): string {\n    return Uint8ArrayToString(this.extnValueObj.value);\n  }\n}\n\n// Base class for Fulcio extensions with V2 format (DER-encoded UTF8String)\nclass X509FulcioExtensionV2 extends X509Extension {\n  get stringValue(): string {\n    return Uint8ArrayToString(this.extnValueObj.subs[0].value);\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.1 - OIDC Issuer (V1)\nexport class X509FulcioIssuerV1 extends X509FulcioExtensionV1 {\n  get issuer(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.2 - GitHub Workflow Trigger (V1)\nexport class X509GitHubWorkflowTriggerExtension extends X509FulcioExtensionV1 {\n  get workflowTrigger(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.3 - GitHub Workflow SHA (V1)\nexport class X509GitHubWorkflowSHAExtension extends X509FulcioExtensionV1 {\n  get workflowSHA(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.4 - GitHub Workflow Name (V1)\nexport class X509GitHubWorkflowNameExtension extends X509FulcioExtensionV1 {\n  get workflowName(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.5 - GitHub Workflow Repository (V1)\nexport class X509GitHubWorkflowRepositoryExtension extends X509FulcioExtensionV1 {\n  get workflowRepository(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.6 - GitHub Workflow Ref (V1)\nexport class X509GitHubWorkflowRefExtension extends X509FulcioExtensionV1 {\n  get workflowRef(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.8 - OIDC Issuer (V2)\nexport class X509FulcioIssuerV2 extends X509FulcioExtensionV2 {\n  get issuer(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.9 - Build Signer URI (V2)\nexport class X509BuildSignerURIExtension extends X509FulcioExtensionV2 {\n  get buildSignerURI(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.10 - Build Signer Digest (V2)\nexport class X509BuildSignerDigestExtension extends X509FulcioExtensionV2 {\n  get buildSignerDigest(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.11 - Runner Environment (V2)\nexport class X509RunnerEnvironmentExtension extends X509FulcioExtensionV2 {\n  get runnerEnvironment(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.12 - Source Repository URI (V2)\nexport class X509SourceRepositoryURIExtension extends X509FulcioExtensionV2 {\n  get sourceRepositoryURI(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.13 - Source Repository Digest (V2)\nexport class X509SourceRepositoryDigestExtension extends X509FulcioExtensionV2 {\n  get sourceRepositoryDigest(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.14 - Source Repository Ref (V2)\nexport class X509SourceRepositoryRefExtension extends X509FulcioExtensionV2 {\n  get sourceRepositoryRef(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.15 - Source Repository Identifier (V2)\nexport class X509SourceRepositoryIdentifierExtension extends X509FulcioExtensionV2 {\n  get sourceRepositoryIdentifier(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.16 - Source Repository Owner URI (V2)\nexport class X509SourceRepositoryOwnerURIExtension extends X509FulcioExtensionV2 {\n  get sourceRepositoryOwnerURI(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.17 - Source Repository Owner Identifier (V2)\nexport class X509SourceRepositoryOwnerIdentifierExtension extends X509FulcioExtensionV2 {\n  get sourceRepositoryOwnerIdentifier(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.18 - Build Config URI (V2)\nexport class X509BuildConfigURIExtension extends X509FulcioExtensionV2 {\n  get buildConfigURI(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.19 - Build Config Digest (V2)\nexport class X509BuildConfigDigestExtension extends X509FulcioExtensionV2 {\n  get buildConfigDigest(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.20 - Build Trigger (V2)\nexport class X509BuildTriggerExtension extends X509FulcioExtensionV2 {\n  get buildTrigger(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.21 - Run Invocation URI (V2)\nexport class X509RunInvocationURIExtension extends X509FulcioExtensionV2 {\n  get runInvocationURI(): string {\n    return this.stringValue;\n  }\n}\n\n// OID 1.3.6.1.4.1.57264.1.22 - Source Repository Visibility (V2)\nexport class X509SourceRepositoryVisibilityExtension extends X509FulcioExtensionV2 {\n  get sourceRepositoryVisibility(): string {\n    return this.stringValue;\n  }\n}\n\n// https://www.rfc-editor.org/rfc/rfc6962#section-3.3\nexport class X509SCTExtension extends X509Extension {\n  constructor(asn1: ASN1Obj) {\n    super(asn1);\n  }\n\n  get signedCertificateTimestamps(): SignedCertificateTimestamp[] {\n    const buf = this.extnValueObj.subs[0].value;\n    const stream = new ByteStream(buf);\n\n    // The overall list length is encoded in the first two bytes -- note this\n    // is the length of the list in bytes, NOT the number of SCTs in the list\n    const end = stream.getUint16() + 2;\n\n    const sctList: SignedCertificateTimestamp[] = [];\n    while (stream.position < end) {\n      // Read the length of the next SCT\n      const sctLength = stream.getUint16();\n\n      // Slice out the bytes for the next SCT and parse it\n      const sct = stream.getBlock(sctLength);\n      sctList.push(SignedCertificateTimestamp.parse(sct));\n    }\n\n    if (stream.position !== end) {\n      throw new Error(\"SCT list length does not match actual length\");\n    }\n\n    return sctList;\n  }\n}\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nimport {\n  ASN1Obj,\n  importKey,\n  toDER,\n  Uint8ArrayToBase64,\n  uint8ArrayEqual,\n  verifySignature,\n} from \"@freedomofpress/crypto-browser\";\nimport { KeyTypes } from \"../interfaces.js\";\nimport { DEFAULT_HASH_ALGORITHM, ECDSA_CURVE_NAMES, ECDSA_SIGNATURE_ALGOS, OID_RSASSA_PSS, RSA_SIGNATURE_ALGOS, SHA2_HASH_ALGOS } from \"../oid.js\";\nimport {\n  X509AuthorityKeyIDExtension,\n  X509BasicConstraintsExtension,\n  X509BuildConfigDigestExtension,\n  X509BuildConfigURIExtension,\n  X509BuildSignerDigestExtension,\n  X509BuildSignerURIExtension,\n  X509BuildTriggerExtension,\n  X509Extension,\n  X509FulcioIssuerV1,\n  X509FulcioIssuerV2,\n  X509GitHubWorkflowNameExtension,\n  X509GitHubWorkflowRefExtension,\n  X509GitHubWorkflowRepositoryExtension,\n  X509GitHubWorkflowSHAExtension,\n  X509GitHubWorkflowTriggerExtension,\n  X509KeyUsageExtension,\n  X509RunInvocationURIExtension,\n  X509RunnerEnvironmentExtension,\n  X509SCTExtension,\n  X509SourceRepositoryDigestExtension,\n  X509SourceRepositoryIdentifierExtension,\n  X509SourceRepositoryOwnerIdentifierExtension,\n  X509SourceRepositoryOwnerURIExtension,\n  X509SourceRepositoryRefExtension,\n  X509SourceRepositoryURIExtension,\n  X509SourceRepositoryVisibilityExtension,\n  X509SubjectAlternativeNameExtension,\n  X509SubjectKeyIDExtension,\n} from \"./ext.js\";\n\n// Standard X.509 extension OIDs\nconst EXTENSION_OID_SUBJECT_KEY_ID = \"2.5.29.14\";\nconst EXTENSION_OID_KEY_USAGE = \"2.5.29.15\";\nconst EXTENSION_OID_SUBJECT_ALT_NAME = \"2.5.29.17\";\nconst EXTENSION_OID_BASIC_CONSTRAINTS = \"2.5.29.19\";\nconst EXTENSION_OID_AUTHORITY_KEY_ID = \"2.5.29.35\";\n\n// CT Log SCT extension OID\nexport const EXTENSION_OID_SCT = \"1.3.6.1.4.1.11129.2.4.2\";\n\n// Fulcio extension OIDs\n// https://github.com/sigstore/fulcio/blob/main/docs/oid-info.md\nexport const EXTENSION_OID_FULCIO_ISSUER_V1 = \"1.3.6.1.4.1.57264.1.1\";\nexport const EXTENSION_OID_GITHUB_WORKFLOW_TRIGGER = \"1.3.6.1.4.1.57264.1.2\";\nexport const EXTENSION_OID_GITHUB_WORKFLOW_SHA = \"1.3.6.1.4.1.57264.1.3\";\nexport const EXTENSION_OID_GITHUB_WORKFLOW_NAME = \"1.3.6.1.4.1.57264.1.4\";\nexport const EXTENSION_OID_GITHUB_WORKFLOW_REPOSITORY = \"1.3.6.1.4.1.57264.1.5\";\nexport const EXTENSION_OID_GITHUB_WORKFLOW_REF = \"1.3.6.1.4.1.57264.1.6\";\nexport const EXTENSION_OID_OTHERNAME = \"1.3.6.1.4.1.57264.1.7\";\nexport const EXTENSION_OID_FULCIO_ISSUER_V2 = \"1.3.6.1.4.1.57264.1.8\";\nexport const EXTENSION_OID_BUILD_SIGNER_URI = \"1.3.6.1.4.1.57264.1.9\";\nexport const EXTENSION_OID_BUILD_SIGNER_DIGEST = \"1.3.6.1.4.1.57264.1.10\";\nexport const EXTENSION_OID_RUNNER_ENVIRONMENT = \"1.3.6.1.4.1.57264.1.11\";\nexport const EXTENSION_OID_SOURCE_REPOSITORY_URI = \"1.3.6.1.4.1.57264.1.12\";\nexport const EXTENSION_OID_SOURCE_REPOSITORY_DIGEST = \"1.3.6.1.4.1.57264.1.13\";\nexport const EXTENSION_OID_SOURCE_REPOSITORY_REF = \"1.3.6.1.4.1.57264.1.14\";\nexport const EXTENSION_OID_SOURCE_REPOSITORY_IDENTIFIER = \"1.3.6.1.4.1.57264.1.15\";\nexport const EXTENSION_OID_SOURCE_REPOSITORY_OWNER_URI = \"1.3.6.1.4.1.57264.1.16\";\nexport const EXTENSION_OID_SOURCE_REPOSITORY_OWNER_IDENTIFIER = \"1.3.6.1.4.1.57264.1.17\";\nexport const EXTENSION_OID_BUILD_CONFIG_URI = \"1.3.6.1.4.1.57264.1.18\";\nexport const EXTENSION_OID_BUILD_CONFIG_DIGEST = \"1.3.6.1.4.1.57264.1.19\";\nexport const EXTENSION_OID_BUILD_TRIGGER = \"1.3.6.1.4.1.57264.1.20\";\nexport const EXTENSION_OID_RUN_INVOCATION_URI = \"1.3.6.1.4.1.57264.1.21\";\nexport const EXTENSION_OID_SOURCE_REPOSITORY_VISIBILITY = \"1.3.6.1.4.1.57264.1.22\";\n\nexport class X509Certificate {\n  public root: ASN1Obj;\n\n  constructor(asn1: ASN1Obj) {\n    this.root = asn1;\n  }\n\n  public static parse(cert: Uint8Array | string): X509Certificate {\n    const der = typeof cert === \"string\" ? toDER(cert) : cert;\n    const asn1 = ASN1Obj.parseBuffer(der);\n    return new X509Certificate(asn1);\n  }\n\n  get tbsCertificate(): ASN1Obj {\n    return this.tbsCertificateObj;\n  }\n\n  get version(): string {\n    // version number is the first element of the version context specific tag\n    const ver = this.versionObj.subs[0].toInteger();\n    return `v${(ver + BigInt(1)).toString()}`;\n  }\n\n  get serialNumber(): Uint8Array {\n    return this.serialNumberObj.value;\n  }\n\n  get notBefore(): Date {\n    // notBefore is the first element of the validity sequence\n    return this.validityObj.subs[0].toDate();\n  }\n\n  get notAfter(): Date {\n    // notAfter is the second element of the validity sequence\n    return this.validityObj.subs[1].toDate();\n  }\n\n  get issuer(): Uint8Array {\n    return this.issuerObj.value;\n  }\n\n  get subject(): Uint8Array {\n    return this.subjectObj.value;\n  }\n\n  get publicKey(): Uint8Array {\n    return this.subjectPublicKeyInfoObj.toDER();\n  }\n\n  /**\n   * Import the public key with a specific hash algorithm and signature scheme for RSA keys.\n   * For ECDSA keys, both parameters are ignored.\n   * @param hashAlg - Hash algorithm (e.g., \"sha384\") for RSA keys\n   * @param usePss - If true, import as RSA-PSS key; if false, import as PKCS#1 v1.5\n   */\n  public async getPublicKeyObj(hashAlg?: string, usePss?: boolean): Promise<CryptoKey> {\n    const publicKey = this.subjectPublicKeyInfoObj.toDER();\n    const spki = ASN1Obj.parseBuffer(publicKey);\n    const algorithmOID = spki.subs[0].subs[0].toOID();\n\n    // RSA key (OID 1.2.840.113549.1.1.1) or RSA-PSS key (OID 1.2.840.113549.1.1.10)\n    const isRsaKey = algorithmOID === \"1.2.840.113549.1.1.1\";\n    const isRsaPssKey = algorithmOID === OID_RSASSA_PSS;\n\n    if (isRsaPssKey) {\n      // WebCrypto doesn't support importing keys with id-RSASSA-PSS OID, only rsaEncryption\n      throw new Error(\n        \"RSA-PSS public keys (id-RSASSA-PSS OID) are not supported by WebCrypto. \" +\n        \"Only certificates with standard RSA keys (rsaEncryption OID) signed using RSA-PSS are supported.\"\n      );\n    }\n\n    if (isRsaKey) {\n      const hash = hashAlg || DEFAULT_HASH_ALGORITHM;\n      // crypto-browser extracts hash from scheme and uses PSS unless \"PKCS1\" is present\n      const scheme = usePss ? hash : `PKCS1_${hash}`;\n      return importKey(KeyTypes.RSA, scheme, Uint8ArrayToBase64(publicKey));\n    } else {\n      // ECDSA key - the curve OID is in the second element\n      const curveOID = spki.subs[0].subs[1]?.toOID();\n      const curve = ECDSA_CURVE_NAMES[curveOID];\n      if (!curve) {\n        throw new Error(`Unknown ECDSA curve OID: ${curveOID}`);\n      }\n      return importKey(KeyTypes.Ecdsa, curve, Uint8ArrayToBase64(publicKey));\n    }\n  }\n\n  get publicKeyObj(): Promise<CryptoKey> {\n    return this.getPublicKeyObj();\n  }\n\n  get signatureAlgorithm(): string {\n    const oid: string = this.signatureAlgorithmObj.subs[0].toOID();\n    return ECDSA_SIGNATURE_ALGOS[oid] || RSA_SIGNATURE_ALGOS[oid] || this.parseRsaPssHashAlgorithm();\n  }\n\n  get signatureAlgorithmOid(): string {\n    return this.signatureAlgorithmObj.subs[0].toOID();\n  }\n\n  /**\n   * Parse hash algorithm from RSA-PSS signature algorithm parameters.\n   * RSA-PSS parameters are: SEQUENCE { hashAlgorithm, maskGenAlgorithm, saltLength, trailerField }\n   */\n  private parseRsaPssHashAlgorithm(): string {\n    const sigAlgOid = this.signatureAlgorithmObj.subs[0].toOID();\n    if (sigAlgOid !== OID_RSASSA_PSS) {\n      return \"\";\n    }\n\n    // RSA-PSS has parameters in the second element of the signature algorithm sequence\n    const params = this.signatureAlgorithmObj.subs[1];\n    if (!params || params.subs.length === 0) {\n      return DEFAULT_HASH_ALGORITHM;\n    }\n\n    // First element is hashAlgorithm [0] EXPLICIT\n    const hashAlgWrapper = params.subs[0];\n    if (hashAlgWrapper && hashAlgWrapper.subs.length > 0) {\n      // The wrapper contains a SEQUENCE with the hash algorithm OID\n      const hashAlgSeq = hashAlgWrapper.subs[0];\n      if (hashAlgSeq && hashAlgSeq.subs.length > 0) {\n        const hashOid = hashAlgSeq.subs[0].toOID();\n        return SHA2_HASH_ALGOS[hashOid] || DEFAULT_HASH_ALGORITHM;\n      }\n    }\n\n    return DEFAULT_HASH_ALGORITHM;\n  }\n\n  get signatureValue(): Uint8Array {\n    // Signature value is a bit string, so we need to skip the first byte\n    return this.signatureValueObj.value.subarray(1);\n  }\n\n  get subjectAltName(): string | undefined {\n    const ext = this.extSubjectAltName;\n    return ext?.uri || ext?.rfc822Name;\n  }\n\n  get extensions(): ASN1Obj[] {\n    // The extension list is the first (and only) element of the extensions\n    // context specific tag\n    const extSeq = this.extensionsObj?.subs[0];\n    return extSeq?.subs || /* istanbul ignore next */ [];\n  }\n\n  get extKeyUsage(): X509KeyUsageExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_KEY_USAGE);\n    return ext ? new X509KeyUsageExtension(ext) : undefined;\n  }\n\n  get extBasicConstraints(): X509BasicConstraintsExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_BASIC_CONSTRAINTS);\n    return ext ? new X509BasicConstraintsExtension(ext) : undefined;\n  }\n\n  get extSubjectAltName(): X509SubjectAlternativeNameExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SUBJECT_ALT_NAME);\n    return ext ? new X509SubjectAlternativeNameExtension(ext) : undefined;\n  }\n\n  get extAuthorityKeyID(): X509AuthorityKeyIDExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_AUTHORITY_KEY_ID);\n    return ext ? new X509AuthorityKeyIDExtension(ext) : undefined;\n  }\n\n  get extSubjectKeyID(): X509SubjectKeyIDExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SUBJECT_KEY_ID);\n    return ext\n      ? new X509SubjectKeyIDExtension(ext)\n      : /* istanbul ignore next */ undefined;\n  }\n\n  get extSCT(): X509SCTExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SCT);\n    return ext ? new X509SCTExtension(ext) : undefined;\n  }\n\n  get extFulcioIssuerV1(): X509FulcioIssuerV1 | undefined {\n    const ext = this.findExtension(EXTENSION_OID_FULCIO_ISSUER_V1);\n    return ext ? new X509FulcioIssuerV1(ext) : undefined;\n  }\n\n  get extFulcioIssuerV2(): X509FulcioIssuerV2 | undefined {\n    const ext = this.findExtension(EXTENSION_OID_FULCIO_ISSUER_V2);\n    return ext ? new X509FulcioIssuerV2(ext) : undefined;\n  }\n\n  get extGitHubWorkflowTrigger(): X509GitHubWorkflowTriggerExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_GITHUB_WORKFLOW_TRIGGER);\n    return ext ? new X509GitHubWorkflowTriggerExtension(ext) : undefined;\n  }\n\n  get extGitHubWorkflowSHA(): X509GitHubWorkflowSHAExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_GITHUB_WORKFLOW_SHA);\n    return ext ? new X509GitHubWorkflowSHAExtension(ext) : undefined;\n  }\n\n  get extGitHubWorkflowName(): X509GitHubWorkflowNameExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_GITHUB_WORKFLOW_NAME);\n    return ext ? new X509GitHubWorkflowNameExtension(ext) : undefined;\n  }\n\n  get extGitHubWorkflowRepository(): X509GitHubWorkflowRepositoryExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_GITHUB_WORKFLOW_REPOSITORY);\n    return ext ? new X509GitHubWorkflowRepositoryExtension(ext) : undefined;\n  }\n\n  get extGitHubWorkflowRef(): X509GitHubWorkflowRefExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_GITHUB_WORKFLOW_REF);\n    return ext ? new X509GitHubWorkflowRefExtension(ext) : undefined;\n  }\n\n  get extBuildSignerURI(): X509BuildSignerURIExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_BUILD_SIGNER_URI);\n    return ext ? new X509BuildSignerURIExtension(ext) : undefined;\n  }\n\n  get extBuildSignerDigest(): X509BuildSignerDigestExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_BUILD_SIGNER_DIGEST);\n    return ext ? new X509BuildSignerDigestExtension(ext) : undefined;\n  }\n\n  get extRunnerEnvironment(): X509RunnerEnvironmentExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_RUNNER_ENVIRONMENT);\n    return ext ? new X509RunnerEnvironmentExtension(ext) : undefined;\n  }\n\n  get extSourceRepositoryURI(): X509SourceRepositoryURIExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SOURCE_REPOSITORY_URI);\n    return ext ? new X509SourceRepositoryURIExtension(ext) : undefined;\n  }\n\n  get extSourceRepositoryDigest(): X509SourceRepositoryDigestExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SOURCE_REPOSITORY_DIGEST);\n    return ext ? new X509SourceRepositoryDigestExtension(ext) : undefined;\n  }\n\n  get extSourceRepositoryRef(): X509SourceRepositoryRefExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SOURCE_REPOSITORY_REF);\n    return ext ? new X509SourceRepositoryRefExtension(ext) : undefined;\n  }\n\n  get extSourceRepositoryIdentifier(): X509SourceRepositoryIdentifierExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SOURCE_REPOSITORY_IDENTIFIER);\n    return ext ? new X509SourceRepositoryIdentifierExtension(ext) : undefined;\n  }\n\n  get extSourceRepositoryOwnerURI(): X509SourceRepositoryOwnerURIExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SOURCE_REPOSITORY_OWNER_URI);\n    return ext ? new X509SourceRepositoryOwnerURIExtension(ext) : undefined;\n  }\n\n  get extSourceRepositoryOwnerIdentifier(): X509SourceRepositoryOwnerIdentifierExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SOURCE_REPOSITORY_OWNER_IDENTIFIER);\n    return ext ? new X509SourceRepositoryOwnerIdentifierExtension(ext) : undefined;\n  }\n\n  get extBuildConfigURI(): X509BuildConfigURIExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_BUILD_CONFIG_URI);\n    return ext ? new X509BuildConfigURIExtension(ext) : undefined;\n  }\n\n  get extBuildConfigDigest(): X509BuildConfigDigestExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_BUILD_CONFIG_DIGEST);\n    return ext ? new X509BuildConfigDigestExtension(ext) : undefined;\n  }\n\n  get extBuildTrigger(): X509BuildTriggerExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_BUILD_TRIGGER);\n    return ext ? new X509BuildTriggerExtension(ext) : undefined;\n  }\n\n  get extRunInvocationURI(): X509RunInvocationURIExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_RUN_INVOCATION_URI);\n    return ext ? new X509RunInvocationURIExtension(ext) : undefined;\n  }\n\n  get extSourceRepositoryVisibility(): X509SourceRepositoryVisibilityExtension | undefined {\n    const ext = this.findExtension(EXTENSION_OID_SOURCE_REPOSITORY_VISIBILITY);\n    return ext ? new X509SourceRepositoryVisibilityExtension(ext) : undefined;\n  }\n\n  get isCA(): boolean {\n    const ca = this.extBasicConstraints?.isCA || false;\n\n    // If the KeyUsage extension is present, keyCertSign must be set\n    if (this.extKeyUsage) {\n      return ca && this.extKeyUsage.keyCertSign;\n    }\n\n    return ca;\n  }\n\n  public extension(oid: string): X509Extension | undefined {\n    const ext = this.findExtension(oid);\n    return ext ? new X509Extension(ext) : undefined;\n  }\n\n  public async verify(issuerCertificate?: X509Certificate): Promise<boolean> {\n    // Extract the hash algorithm from this certificate's signature algorithm\n    const sigAlgOID = this.signatureAlgorithmOid;\n    const isRsaPss = sigAlgOID === OID_RSASSA_PSS;\n\n    // Get hash algorithm - for RSA-PSS, parse from parameters; otherwise lookup in tables\n    const hashAlg = isRsaPss\n      ? this.parseRsaPssHashAlgorithm()\n      : (RSA_SIGNATURE_ALGOS[sigAlgOID] || ECDSA_SIGNATURE_ALGOS[sigAlgOID]);\n\n    // Use the issuer's public key if provided, otherwise use the subject's (for self-signed certs)\n    // Import with the correct hash algorithm and key type for this certificate's signature\n    const publicKeyObj = issuerCertificate\n      ? await issuerCertificate.getPublicKeyObj(hashAlg, isRsaPss)\n      : await this.getPublicKeyObj(hashAlg, isRsaPss);\n\n    return await verifySignature(\n      publicKeyObj,\n      this.tbsCertificate.toDER(),\n      this.signatureValue,\n      this.signatureAlgorithm,\n    );\n  }\n\n  public validForDate(date: Date): boolean {\n    return this.notBefore <= date && date <= this.notAfter;\n  }\n\n  public equals(other: X509Certificate): boolean {\n    return uint8ArrayEqual(this.root.toDER(), other.root.toDER());\n  }\n\n  // Creates a copy of the certificate with a new buffer\n  public clone(): X509Certificate {\n    const der = this.root.toDER();\n    const clone = new Uint8Array(der);\n    return X509Certificate.parse(clone);\n  }\n\n  private findExtension(oid: string): ASN1Obj | undefined {\n    // Find the extension with the given OID. The OID will always be the first\n    // element of the extension sequence\n    return this.extensions.find((ext) => ext.subs[0].toOID() === oid);\n  }\n\n  /////////////////////////////////////////////////////////////////////////////\n  // The following properties use the documented x509 structure to locate the\n  // desired ASN.1 object\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.1.1\n  private get tbsCertificateObj(): ASN1Obj {\n    // tbsCertificate is the first element of the certificate sequence\n    return this.root.subs[0];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.1.2\n  private get signatureAlgorithmObj(): ASN1Obj {\n    // signatureAlgorithm is the second element of the certificate sequence\n    return this.root.subs[1];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.1.3\n  private get signatureValueObj(): ASN1Obj {\n    // signatureValue is the third element of the certificate sequence\n    return this.root.subs[2];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.2.1\n  private get versionObj(): ASN1Obj {\n    // version is the first element of the tbsCertificate sequence\n    return this.tbsCertificateObj.subs[0];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.2.2\n  private get serialNumberObj(): ASN1Obj {\n    // serialNumber is the second element of the tbsCertificate sequence\n    return this.tbsCertificateObj.subs[1];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.2.4\n  private get issuerObj(): ASN1Obj {\n    // issuer is the fourth element of the tbsCertificate sequence\n    return this.tbsCertificateObj.subs[3];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.2.5\n  private get validityObj(): ASN1Obj {\n    // version is the fifth element of the tbsCertificate sequence\n    return this.tbsCertificateObj.subs[4];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.2.6\n  private get subjectObj(): ASN1Obj {\n    // subject is the sixth element of the tbsCertificate sequence\n    return this.tbsCertificateObj.subs[5];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.2.7\n  private get subjectPublicKeyInfoObj(): ASN1Obj {\n    // subjectPublicKeyInfo is the seventh element of the tbsCertificate sequence\n    return this.tbsCertificateObj.subs[6];\n  }\n\n  // Extensions can't be located by index because their position varies. Instead,\n  // we need to find the extensions context specific tag\n  // https://www.rfc-editor.org/rfc/rfc5280#section-4.1.2.9\n  private get extensionsObj(): ASN1Obj | undefined {\n    return this.tbsCertificateObj.subs.find((sub) =>\n      sub.tag.isContextSpecific(0x03),\n    );\n  }\n}\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n/*\n * Certificate chain verification for browser environments\n *\n * Ported from sigstore-js:\n * https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/key/certificate.ts\n *\n * Key differences from sigstore-js:\n * - Browser-compatible: async verify() method for Web Crypto API\n * - Uses Uint8Array instead of Buffer for binary data\n * - Uses uint8ArrayEqual for Uint8Array comparisons\n */\n\nimport { uint8ArrayEqual } from \"@freedomofpress/crypto-browser\";\nimport { X509Certificate } from \"./cert.js\";\n\ninterface CertificateChainVerifierOptions {\n  trustedCerts: X509Certificate[];\n  untrustedCert: X509Certificate;\n  timestamp: Date;\n}\n\nexport class CertificateChainVerifier {\n  private untrustedCert: X509Certificate;\n  private trustedCerts: X509Certificate[];\n  private localCerts: X509Certificate[];\n  private timestamp: Date;\n\n  constructor(opts: CertificateChainVerifierOptions) {\n    this.untrustedCert = opts.untrustedCert;\n    this.trustedCerts = opts.trustedCerts;\n    this.localCerts = dedupeCertificates([\n      ...opts.trustedCerts,\n      opts.untrustedCert,\n    ]);\n    this.timestamp = opts.timestamp;\n  }\n\n  public async verify(): Promise<X509Certificate[]> {\n    const certificatePath = await this.sort();\n\n    this.checkPath(certificatePath);\n\n    const validForDate = certificatePath.every((cert) =>\n      cert.validForDate(this.timestamp)\n    );\n\n    if (!validForDate) {\n      throw new Error(\n        \"certificate is not valid or expired at the specified date\"\n      );\n    }\n\n    return certificatePath;\n  }\n\n  private async sort(): Promise<X509Certificate[]> {\n    const leafCert = this.untrustedCert;\n\n    let paths = await this.buildPaths(leafCert);\n\n    paths = paths.filter((path) =>\n      path.some((cert) => this.trustedCerts.includes(cert))\n    );\n\n    if (paths.length === 0) {\n      throw new Error(\"no trusted certificate path found\");\n    }\n\n    const path = paths.reduce((prev, curr) =>\n      prev.length < curr.length ? prev : curr\n    );\n\n    return [leafCert, ...path].slice(0, -1);\n  }\n\n  private async buildPaths(\n    certificate: X509Certificate\n  ): Promise<X509Certificate[][]> {\n    const paths = [];\n    const issuers = await this.findIssuer(certificate);\n\n    if (issuers.length === 0) {\n      throw new Error(\"no valid certificate path found\");\n    }\n\n    for (let i = 0; i < issuers.length; i++) {\n      const issuer = issuers[i];\n\n      if (issuer.equals(certificate)) {\n        paths.push([certificate]);\n        continue;\n      }\n\n      const subPaths = await this.buildPaths(issuer);\n\n      for (let j = 0; j < subPaths.length; j++) {\n        paths.push([issuer, ...subPaths[j]]);\n      }\n    }\n\n    return paths;\n  }\n\n  private async findIssuer(\n    certificate: X509Certificate\n  ): Promise<X509Certificate[]> {\n    let issuers: X509Certificate[] = [];\n    let keyIdentifier: Uint8Array | undefined;\n\n    if (uint8ArrayEqual(certificate.subject, certificate.issuer)) {\n      if (await certificate.verify()) {\n        return [certificate];\n      }\n    }\n\n    if (certificate.extAuthorityKeyID) {\n      keyIdentifier = certificate.extAuthorityKeyID.keyIdentifier;\n    }\n\n    this.localCerts.forEach((possibleIssuer) => {\n      if (keyIdentifier) {\n        if (possibleIssuer.extSubjectKeyID) {\n          if (\n            uint8ArrayEqual(\n              possibleIssuer.extSubjectKeyID.keyIdentifier,\n              keyIdentifier\n            )\n          ) {\n            issuers.push(possibleIssuer);\n          }\n          return;\n        }\n      }\n\n      if (uint8ArrayEqual(possibleIssuer.subject, certificate.issuer)) {\n        issuers.push(possibleIssuer);\n      }\n    });\n\n    const verifiedIssuers: X509Certificate[] = [];\n    for (const issuer of issuers) {\n      try {\n        if (await certificate.verify(issuer)) {\n          verifiedIssuers.push(issuer);\n        }\n      } catch (ex) {\n        // Ignore verification failures\n      }\n    }\n\n    return verifiedIssuers;\n  }\n\n  private checkPath(path: X509Certificate[]): void {\n    if (path.length < 1) {\n      throw new Error(\n        \"certificate chain must contain at least one certificate\"\n      );\n    }\n\n    const validCAs = path.slice(1).every((cert) => cert.isCA);\n    if (!validCAs) {\n      throw new Error(\"intermediate certificate is not a CA\");\n    }\n\n    for (let i = path.length - 2; i >= 0; i--) {\n      if (!uint8ArrayEqual(path[i].issuer, path[i + 1].subject)) {\n        throw new Error(\"incorrect certificate name chaining\");\n      }\n    }\n\n    for (let i = 0; i < path.length; i++) {\n      const cert = path[i];\n\n      if (cert.extBasicConstraints?.isCA) {\n        const pathLength = cert.extBasicConstraints.pathLenConstraint;\n\n        if (pathLength !== undefined && pathLength < BigInt(i - 1)) {\n          throw new Error(\"path length constraint exceeded\");\n        }\n      }\n    }\n  }\n}\n\nfunction dedupeCertificates(certs: X509Certificate[]): X509Certificate[] {\n  for (let i = 0; i < certs.length; i++) {\n    for (let j = i + 1; j < certs.length; j++) {\n      if (certs[i].equals(certs[j])) {\n        certs.splice(j, 1);\n        j--;\n      }\n    }\n  }\n  return certs;\n}\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nconst PAE_PREFIX = \"DSSEv1\";\n\n// DSSE Pre-Authentication Encoding\nexport function preAuthEncoding(\n  payloadType: string,\n  payload: Uint8Array,\n): Uint8Array {\n  const prefix = [\n    PAE_PREFIX,\n    payloadType.length,\n    payloadType,\n    payload.length,\n    \"\",\n  ].join(\" \");\n\n  // DSSE spec requires ASCII encoding for the prefix\n  // TextEncoder will throw if the string contains non-ASCII characters\n  const encoder = new TextEncoder();\n  const prefixBuffer = encoder.encode(prefix);\n\n  // Verify all characters are ASCII (< 128)\n  for (let i = 0; i < prefixBuffer.length; i++) {\n    if (prefixBuffer[i] > 127) {\n      throw new Error(`Invalid non-ASCII character in PAE prefix at position ${i}`);\n    }\n  }\n\n  // Concatenate prefix and payload\n  const combinedArray = new Uint8Array(prefixBuffer.length + payload.length);\n\n  combinedArray.set(prefixBuffer, 0);\n  combinedArray.set(payload, prefixBuffer.length);\n  return combinedArray;\n}\n","/*\nAdapted from sigstore-js for browser compatibility:\nhttps://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/timestamp/merkle.ts\n\nKey differences:\n- Uses Uint8Array instead of Buffer\n- Uses async Web Crypto API (crypto.subtle.digest) instead of sync Node.js crypto\n- Base64 decoding via custom base64ToUint8Array instead of Buffer.from\n- uint8ArrayEqual from crypto-browser instead of Node.js crypto.timingSafeEqual\n*/\nimport { base64ToUint8Array, uint8ArrayEqual } from \"@freedomofpress/crypto-browser\";\nimport { HashAlgorithms } from \"../interfaces.js\";\nimport type { TLogEntry } from \"../bundle.js\";\n\nconst RFC6962_LEAF_HASH_PREFIX = new Uint8Array([0x00]);\nconst RFC6962_NODE_HASH_PREFIX = new Uint8Array([0x01]);\n\nexport async function verifyMerkleInclusion(\n  entry: TLogEntry\n): Promise<void> {\n  if (!entry.inclusionProof) {\n    throw new Error(\"Missing inclusion proof\");\n  }\n\n  const inclusionProof = entry.inclusionProof;\n  const logIndex = BigInt(inclusionProof.logIndex);\n  const treeSize = BigInt(inclusionProof.treeSize);\n\n  if (logIndex < 0n || logIndex >= treeSize) {\n    throw new Error(`Invalid log index: ${logIndex}`);\n  }\n\n  // Figure out which subset of hashes corresponds to the inner and border\n  // nodes\n  const { inner, border } = decompInclProof(logIndex, treeSize);\n\n  if (inclusionProof.hashes.length !== inner + border) {\n    throw new Error(\"Invalid hash count in inclusion proof\");\n  }\n\n  const innerHashes = inclusionProof.hashes\n    .slice(0, inner)\n    .map((h) => base64ToUint8Array(h));\n  const borderHashes = inclusionProof.hashes\n    .slice(inner)\n    .map((h) => base64ToUint8Array(h));\n\n  // The entry's hash is the leaf hash\n  const leafHash = await hashLeaf(base64ToUint8Array(entry.canonicalizedBody));\n\n  // Chain the hashes belonging to the inner and border portions\n  const calculatedHash = await chainBorderRight(\n    await chainInner(leafHash, innerHashes, logIndex),\n    borderHashes\n  );\n\n  const rootHash = base64ToUint8Array(inclusionProof.rootHash);\n\n  // Calculated hash should match the root hash in the inclusion proof\n  if (!uint8ArrayEqual(calculatedHash, rootHash)) {\n    throw new Error(\"Calculated root hash does not match inclusion proof\");\n  }\n}\n\n// Breaks down inclusion proof for a leaf at the specified index in a tree of\n// the specified size. The split point is where paths to the index leaf and\n// the (size - 1) leaf diverge. Returns lengths of the bottom and upper proof\n// parts.\nfunction decompInclProof(\n  index: bigint,\n  size: bigint\n): { inner: number; border: number } {\n  const inner = innerProofSize(index, size);\n  const border = onesCount(index >> BigInt(inner));\n  return { inner, border };\n}\n\n// Computes a subtree hash for a node on or below the tree's right border.\n// Assumes the provided proof hashes are ordered from lower to higher levels\n// and seed is the initial hash of the node specified by the index.\nasync function chainInner(\n  seed: Uint8Array,\n  hashes: Uint8Array[],\n  index: bigint\n): Promise<Uint8Array> {\n  let acc = seed;\n  for (let i = 0; i < hashes.length; i++) {\n    const h = hashes[i];\n    if ((index >> BigInt(i)) & BigInt(1)) {\n      acc = await hashChildren(h, acc);\n    } else {\n      acc = await hashChildren(acc, h);\n    }\n  }\n  return acc;\n}\n\n// Computes a subtree hash for nodes along the tree's right border.\nasync function chainBorderRight(\n  seed: Uint8Array,\n  hashes: Uint8Array[]\n): Promise<Uint8Array> {\n  let acc = seed;\n  for (const h of hashes) {\n    acc = await hashChildren(h, acc);\n  }\n  return acc;\n}\n\nfunction innerProofSize(index: bigint, size: bigint): number {\n  return bitLength(index ^ (size - BigInt(1)));\n}\n\n// Counts the number of ones in the binary representation of the given number.\n// https://en.wikipedia.org/wiki/Hamming_weight\nfunction onesCount(num: bigint): number {\n  return num.toString(2).split(\"1\").length - 1;\n}\n\n// Returns the number of bits necessary to represent an integer in binary.\nfunction bitLength(n: bigint): number {\n  if (n === 0n) {\n    return 0;\n  }\n  return n.toString(2).length;\n}\n\n// Hashing logic according to RFC6962.\n// https://datatracker.ietf.org/doc/html/rfc6962#section-2\nasync function hashChildren(\n  left: Uint8Array,\n  right: Uint8Array\n): Promise<Uint8Array> {\n  const data = new Uint8Array(\n    RFC6962_NODE_HASH_PREFIX.length + left.length + right.length\n  );\n  data.set(RFC6962_NODE_HASH_PREFIX, 0);\n  data.set(left, RFC6962_NODE_HASH_PREFIX.length);\n  data.set(right, RFC6962_NODE_HASH_PREFIX.length + left.length);\n\n  const hash = await crypto.subtle.digest(HashAlgorithms.SHA256, data as Uint8Array<ArrayBuffer>);\n  return new Uint8Array(hash);\n}\n\nasync function hashLeaf(leaf: Uint8Array): Promise<Uint8Array> {\n  const data = new Uint8Array(RFC6962_LEAF_HASH_PREFIX.length + leaf.length);\n  data.set(RFC6962_LEAF_HASH_PREFIX, 0);\n  data.set(leaf, RFC6962_LEAF_HASH_PREFIX.length);\n\n  const hash = await crypto.subtle.digest(HashAlgorithms.SHA256, data as Uint8Array<ArrayBuffer>);\n  return new Uint8Array(hash);\n}\n","/*\nCheckpoint verification for transparency log entries.\n\nAdapted from sigstore-js for browser compatibility:\nhttps://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/timestamp/checkpoint.ts\n\nKey differences:\n- Uses Uint8Array instead of Buffer\n- Uses Web Crypto API instead of Node.js crypto module\n- Manual handling of ED25519 (raw) vs ECDSA (DER) signature formats\n- Inline key import from raw bytes\n\nAdditional functionality not in reference:\n- filterTLogsByDate() - inlined from sigstore-js/packages/verify/src/trust/filter.ts\n- importTLogKey() - new browser-compatible key import with multiple format support\n- Special handling for Rekor v2 bundles without integratedTime\n\nFollows the signed note format specification:\nhttps://github.com/transparency-dev/formats/blob/main/log/README.md\n*/\n\nimport {\n  base64ToUint8Array,\n  importKey,\n  KeyTypes,\n  stringToUint8Array,\n  uint8ArrayEqual,\n  verifySignature,\n} from \"@freedomofpress/crypto-browser\";\nimport type { TLogEntry } from \"../bundle.js\";\nimport type { RawLogs } from \"../interfaces.js\";\n\n// Signed note format per https://github.com/transparency-dev/formats\n// Body is separated from signatures by a blank line\nconst CHECKPOINT_SEPARATOR = \"\\n\\n\";\n// Signature lines format: \"— <identity> <base64(key_hint+signature)>\\n\"\n// \\u2014 is the em-dash character (—)\nconst SIGNATURE_REGEX = /\\u2014 (\\S+) (\\S+)\\n/g;\n\nexport interface TLogSignature {\n  name: string;\n  keyHint: Uint8Array;\n  signature: Uint8Array;\n}\n\n// Signed checkpoint note with cryptographic signatures\nexport class SignedNote {\n  readonly note: string;\n  readonly signatures: TLogSignature[];\n\n  constructor(note: string, signatures: TLogSignature[]) {\n    this.note = note;\n    this.signatures = signatures;\n  }\n\n  static fromString(envelope: string): SignedNote {\n    if (!envelope.includes(CHECKPOINT_SEPARATOR)) {\n      throw new Error(\"Missing checkpoint separator\");\n    }\n\n    // Split body from signature lines at blank line\n    const split = envelope.indexOf(CHECKPOINT_SEPARATOR);\n    const header = envelope.slice(0, split + 1);\n    const data = envelope.slice(split + CHECKPOINT_SEPARATOR.length);\n\n    // Parse signature lines: \"— <identity> <base64(key_hint+signature)>\\n\"\n    const matches = data.matchAll(SIGNATURE_REGEX);\n\n    const signatures: TLogSignature[] = [];\n    for (const match of matches) {\n      const [, name, signature] = match;\n      const sigBytes = base64ToUint8Array(signature);\n\n      // First 4 bytes are key hint (SHA256 hash prefix), rest is signature\n      if (sigBytes.length < 5) {\n        throw new Error(\"Malformed checkpoint signature\");\n      }\n\n      signatures.push({\n        name,\n        keyHint: sigBytes.subarray(0, 4),\n        signature: sigBytes.subarray(4),\n      });\n    }\n\n    if (signatures.length === 0) {\n      throw new Error(\"No signatures found in checkpoint\");\n    }\n\n    return new SignedNote(header, signatures);\n  }\n}\n\n// Parsed checkpoint containing tree state (origin, size, root hash)\nexport class LogCheckpoint {\n  readonly origin: string;\n  readonly logSize: bigint;\n  readonly logHash: Uint8Array;\n  readonly rest: string[];\n\n  constructor(\n    origin: string,\n    logSize: bigint,\n    logHash: Uint8Array,\n    rest: string[]\n  ) {\n    this.origin = origin;\n    this.logSize = logSize;\n    this.logHash = logHash;\n    this.rest = rest;\n  }\n\n  static fromString(note: string): LogCheckpoint {\n    const lines = note.trimEnd().split(\"\\n\");\n\n    if (lines.length < 3) {\n      throw new Error(\"Too few lines in checkpoint header\");\n    }\n\n    const origin = lines[0];\n    const logSize = BigInt(lines[1]);\n    const rootHash = base64ToUint8Array(lines[2]);\n    const rest = lines.slice(3);\n\n    return new LogCheckpoint(origin, logSize, rootHash, rest);\n  }\n}\n\n// Verifies checkpoint signature and ensures root hash matches inclusion proof\nexport async function verifyCheckpoint(\n  entry: TLogEntry,\n  tlogs: RawLogs\n): Promise<void> {\n  if (!entry.inclusionProof?.checkpoint) {\n    throw new Error(\"Missing checkpoint in inclusion proof\");\n  }\n\n  // Filter by log ID first (matches entry's log ID)\n  const entryLogId = base64ToUint8Array(entry.logId.keyId);\n  const matchingTLogs = tlogs.filter((tlog) => {\n    const tlogId = base64ToUint8Array(tlog.logId.keyId);\n    return uint8ArrayEqual(tlogId, entryLogId);\n  });\n\n  // Then filter by date if integratedTime is available\n  // For Rekor v2 bundles, integratedTime may be null, so we skip date filtering\n  const validTLogs = entry.integratedTime\n    ? filterTLogsByDate(matchingTLogs, new Date(Number(entry.integratedTime) * 1000))\n    : matchingTLogs;\n\n  const inclusionProof = entry.inclusionProof;\n  const signedNote = SignedNote.fromString(inclusionProof.checkpoint.envelope);\n  const checkpoint = LogCheckpoint.fromString(signedNote.note);\n\n  if (!(await verifySignedNote(signedNote, validTLogs))) {\n    throw new Error(\"Invalid checkpoint signature\");\n  }\n\n  const rootHash = base64ToUint8Array(inclusionProof.rootHash);\n  if (!uint8ArrayEqual(checkpoint.logHash, rootHash)) {\n    throw new Error(\"Root hash mismatch between checkpoint and inclusion proof\");\n  }\n}\n\n// Verifies checkpoint signatures using trusted TLog keys\nasync function verifySignedNote(\n  signedNote: SignedNote,\n  tlogs: RawLogs\n): Promise<boolean> {\n  const data = stringToUint8Array(signedNote.note);\n\n  // We need at least one valid signature from a known TLog\n  let hasValidSignature = false;\n\n  for (const signature of signedNote.signatures) {\n    // Match signature to TLog using key hint (first 4 bytes of key ID)\n    const tlog = tlogs.find((tlog) => {\n      const logId = base64ToUint8Array(tlog.logId.keyId);\n      return uint8ArrayEqual(logId.subarray(0, 4), signature.keyHint);\n    });\n\n    if (!tlog) {\n      // Skip unknown signatures (e.g., from witnesses we don't know about)\n      continue;\n    }\n\n    const publicKey = await importTLogKey(tlog);\n\n    // Both ED25519 and ECDSA verification are now handled by verifySignature\n    // ED25519 signatures are raw (64 bytes), ECDSA signatures are DER-encoded\n    const verified = await verifySignature(\n      publicKey,\n      data,\n      signature.signature,\n      tlog.hashAlgorithm\n    );\n\n    if (verified) {\n      hasValidSignature = true;\n    }\n  }\n\n  return hasValidSignature;\n}\n\n\n// Inlined from sigstore-js/packages/verify/src/trust/filter.ts\nfunction filterTLogsByDate(tlogs: RawLogs, targetDate: Date): RawLogs {\n  return tlogs.filter((tlog) => {\n    const start = new Date(tlog.publicKey.validFor.start);\n    const end = tlog.publicKey.validFor.end\n      ? new Date(tlog.publicKey.validFor.end)\n      : null;\n\n    return targetDate >= start && (!end || targetDate <= end);\n  });\n}\n\n// Browser-compatible key import supporting multiple formats (not in sigstore-js reference)\nasync function importTLogKey(tlog: RawLogs[0]): Promise<CryptoKey> {\n  // Parse keyDetails to extract key type and scheme\n  // Formats can be:\n  // - \"PKIX_ECDSA_P256_SHA_256\" (production format)\n  // - \"PKIX_ED25519\"\n  // - \"ecdsa-sha2-nistp256\" (SSH/test format)\n  const keyDetails = tlog.publicKey.keyDetails;\n  let keyType: string;\n  let scheme: string;\n\n  if (keyDetails === \"ecdsa-sha2-nistp256\") {\n    // SSH-style ECDSA P-256 format used in tests\n    keyType = KeyTypes.Ecdsa;\n    scheme = \"P256-SHA256\";\n  } else if (keyDetails.includes(\"ECDSA\")) {\n    keyType = KeyTypes.Ecdsa;\n    // Extract the curve and hash, e.g., \"P256_SHA_256\" from \"PKIX_ECDSA_P256_SHA_256\"\n    scheme = keyDetails.replace(\"PKIX_ECDSA_\", \"\").replaceAll(\"_\", \"-\");\n  } else if (keyDetails.includes(\"ED25519\")) {\n    keyType = KeyTypes.Ed25519;\n    scheme = KeyTypes.Ed25519;\n  } else if (keyDetails.includes(\"RSA\")) {\n    keyType = KeyTypes.RSA;\n    // Extract RSA details, e.g., \"PSS_SHA_256\" from \"PKIX_RSA_PSS_SHA_256\"\n    scheme = keyDetails.replace(\"PKIX_RSA_\", \"\").replaceAll(\"_\", \"-\");\n  } else {\n    throw new Error(`Unsupported key type in keyDetails: ${keyDetails}`);\n  }\n\n  return importKey(\n    keyType,\n    scheme,\n    tlog.publicKey.rawBytes\n  );\n}\n","/*\n * HashedRekord transparency log entry verification\n *\n * Based on sigstore-js:\n * https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/tlog/hashedrekord.ts\n *\n * Key differences from sigstore-js:\n * - Browser-compatible: uses Uint8Array instead of Buffer for binary data\n * - Direct bundle field comparison instead of SignatureContent abstraction\n * - Adds verifyHashedRekordV002Body() - new functionality (reference only supports v0.0.1)\n */\n\nimport { base64ToUint8Array, hexToUint8Array, uint8ArrayEqual } from \"@freedomofpress/crypto-browser\";\nimport type { SigstoreBundle } from \"../bundle.js\";\nimport type { RekorEntry } from \"./body.js\";\n\ninterface HashedRekordSpec {\n  signature: {\n    content: string;\n    publicKey: {\n      content: string;\n    };\n  };\n  data: {\n    hash: {\n      algorithm: string;\n      value: string;\n    };\n  };\n}\n\ninterface HashedRekordEntry extends RekorEntry {\n  apiVersion: \"0.0.1\" | \"0.0.2\";\n  kind: \"hashedrekord\";\n  spec: HashedRekordSpec | HashedRekordV002Spec;\n}\n\ninterface HashedRekordV002Spec {\n  hashedRekordV002: {\n    signature: {\n      content: string;\n      verifier: {\n        x509Certificate: {\n          rawBytes: string;\n        };\n      };\n    };\n    data: {\n      algorithm: string;\n      digest: string;\n    };\n  };\n}\n\nexport async function verifyHashedRekordBody(\n  entry: RekorEntry,\n  bundle: SigstoreBundle\n): Promise<void> {\n  const hashedRekordEntry = entry as HashedRekordEntry;\n\n  switch (hashedRekordEntry.apiVersion) {\n    case \"0.0.1\":\n      return verifyHashedRekordV001Body(hashedRekordEntry, bundle);\n    case \"0.0.2\":\n      return verifyHashedRekordV002Body(hashedRekordEntry, bundle);\n    default:\n      throw new Error(\n        `Unsupported hashedrekord version: ${hashedRekordEntry.apiVersion}`\n      );\n  }\n}\n\nfunction verifyHashedRekordV001Body(\n  entry: HashedRekordEntry,\n  bundle: SigstoreBundle\n): void {\n  const spec = entry.spec as HashedRekordSpec;\n  if (!bundle.messageSignature) {\n    throw new Error(\"Bundle missing messageSignature for hashedrekord entry\");\n  }\n\n  const tlogSig = spec.signature.content || \"\";\n  const tlogSigBytes = base64ToUint8Array(tlogSig);\n  const bundleSigBytes = base64ToUint8Array(bundle.messageSignature.signature);\n\n  if (!uint8ArrayEqual(tlogSigBytes, bundleSigBytes)) {\n    throw new Error(\"Signature mismatch between TLog entry and bundle\");\n  }\n\n  const tlogDigest = spec.data.hash?.value || \"\";\n  const tlogDigestBytes = hexToUint8Array(tlogDigest);\n  const bundleDigestBytes = base64ToUint8Array(\n    bundle.messageSignature.messageDigest.digest\n  );\n\n  if (!uint8ArrayEqual(tlogDigestBytes, bundleDigestBytes)) {\n    throw new Error(\"Digest mismatch between TLog entry and bundle\");\n  }\n}\n\n// New functionality for HashedRekord v0.0.2 (not in sigstore-js reference, which only supports v0.0.1)\nfunction verifyHashedRekordV002Body(\n  entry: HashedRekordEntry,\n  bundle: SigstoreBundle\n): void {\n  const spec = (entry.spec as HashedRekordV002Spec).hashedRekordV002;\n  if (!bundle.messageSignature) {\n    throw new Error(\"Bundle missing messageSignature for hashedrekord v0.0.2 entry\");\n  }\n\n  // NOTE: HashedRekord v0.0.2 uses single base64 encoding (unlike intoto which is double-encoded)\n  // Verified against Sigstore conformance test suite bundles\n  const tlogSig = spec.signature.content || \"\";\n  const tlogSigBytes = base64ToUint8Array(tlogSig);\n  const bundleSigBytes = base64ToUint8Array(bundle.messageSignature.signature);\n\n  if (!uint8ArrayEqual(tlogSigBytes, bundleSigBytes)) {\n    throw new Error(\"Signature mismatch between TLog entry and bundle (v0.0.2)\");\n  }\n\n  const tlogDigest = spec.data.digest || \"\";\n  const tlogDigestBytes = base64ToUint8Array(tlogDigest);\n  const bundleDigestBytes = base64ToUint8Array(\n    bundle.messageSignature.messageDigest.digest\n  );\n\n  if (!uint8ArrayEqual(tlogDigestBytes, bundleDigestBytes)) {\n    throw new Error(\"Digest mismatch between TLog entry and bundle (v0.0.2)\");\n  }\n}\n","/*\n * DSSE transparency log entry verification\n *\n * Based on sigstore-js:\n * https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/tlog/dsse.ts\n *\n * Key differences from sigstore-js:\n * - Browser-compatible: uses Uint8Array instead of Buffer for binary data\n * - Direct bundle field comparison instead of SignatureContent abstraction\n * - Uses crypto.subtle.digest for hash computation instead of Node.js crypto\n * - Adds verifyDSSE002Body() - new functionality (reference only supports v0.0.1)\n */\n\nimport { base64ToUint8Array, hexToUint8Array, uint8ArrayEqual } from \"@freedomofpress/crypto-browser\";\nimport { getHashAlgorithm } from \"../interfaces.js\";\nimport type { SigstoreBundle } from \"../bundle.js\";\nimport type { RekorEntry } from \"./body.js\";\n\ninterface DSSESpec {\n  signatures?: Array<{\n    signature: string;\n    verifier?: string;\n    keyid?: string;\n  }>;\n  payloadHash?: {\n    algorithm: string;\n    value: string;\n  };\n  envelopeHash?: {\n    algorithm: string;\n    value: string;\n  };\n}\n\ninterface DSSEEntry extends RekorEntry {\n  apiVersion: \"0.0.1\" | \"0.0.2\";\n  kind: \"dsse\";\n  spec: DSSESpec;\n}\n\nexport async function verifyDSSEBody(\n  entry: RekorEntry,\n  bundle: SigstoreBundle\n): Promise<void> {\n  const dsseEntry = entry as DSSEEntry;\n\n  switch (dsseEntry.apiVersion) {\n    case \"0.0.1\":\n      return verifyDSSE001Body(dsseEntry, bundle);\n    case \"0.0.2\":\n      return verifyDSSE002Body(dsseEntry, bundle);\n    default:\n      throw new Error(\n        `Unsupported dsse version: ${dsseEntry.apiVersion}`\n      );\n  }\n}\n\nasync function verifyDSSE001Body(\n  entry: DSSEEntry,\n  bundle: SigstoreBundle\n): Promise<void> {\n  if (!bundle.dsseEnvelope) {\n    throw new Error(\"Bundle missing dsseEnvelope for DSSE entry\");\n  }\n\n  if (!entry.spec.signatures || entry.spec.signatures.length !== 1) {\n    throw new Error(\"DSSE entry must have exactly one signature\");\n  }\n\n  const tlogSig = entry.spec.signatures[0].signature;\n  const tlogSigBytes = base64ToUint8Array(tlogSig);\n\n  if (bundle.dsseEnvelope.signatures.length === 0) {\n    throw new Error(\"Bundle DSSE envelope missing signatures\");\n  }\n\n  const bundleSigBytes = base64ToUint8Array(bundle.dsseEnvelope.signatures[0].sig);\n\n  if (!uint8ArrayEqual(tlogSigBytes, bundleSigBytes)) {\n    throw new Error(\"DSSE signature mismatch between TLog entry and bundle\");\n  }\n\n  if (!entry.spec.payloadHash?.value || !entry.spec.payloadHash?.algorithm) {\n    throw new Error(\"DSSE entry missing payloadHash or algorithm\");\n  }\n\n  const hashAlg = getHashAlgorithm(entry.spec.payloadHash.algorithm);\n  const tlogHashBytes = hexToUint8Array(entry.spec.payloadHash.value);\n\n  const payloadBytes = base64ToUint8Array(bundle.dsseEnvelope.payload);\n  const bundleHashBytes = new Uint8Array(\n    await crypto.subtle.digest(hashAlg, payloadBytes as Uint8Array<ArrayBuffer>)\n  );\n\n  if (!uint8ArrayEqual(tlogHashBytes, bundleHashBytes)) {\n    throw new Error(\"DSSE payload hash mismatch between TLog entry and bundle\");\n  }\n}\n\n// New functionality for DSSE v0.0.2 (not in sigstore-js reference, which only supports v0.0.1)\nasync function verifyDSSE002Body(\n  entry: DSSEEntry,\n  bundle: SigstoreBundle\n): Promise<void> {\n  if (!bundle.dsseEnvelope) {\n    throw new Error(\"Bundle missing dsseEnvelope for DSSE v0.0.2 entry\");\n  }\n\n  const spec = (entry.spec as any).dsseV002;\n  if (!spec) {\n    throw new Error(\"DSSE v0.0.2 entry missing dsseV002 spec\");\n  }\n\n  if (!spec.signatures || spec.signatures.length !== 1) {\n    throw new Error(\"DSSE v0.0.2 entry must have exactly one signature\");\n  }\n\n  const tlogSig = spec.signatures[0].content;\n  const tlogSigBytes = base64ToUint8Array(tlogSig);\n\n  if (bundle.dsseEnvelope.signatures.length === 0) {\n    throw new Error(\"Bundle DSSE envelope missing signatures\");\n  }\n\n  const bundleSigBytes = base64ToUint8Array(bundle.dsseEnvelope.signatures[0].sig);\n\n  if (!uint8ArrayEqual(tlogSigBytes, bundleSigBytes)) {\n    throw new Error(\"DSSE signature mismatch between TLog entry and bundle (v0.0.2)\");\n  }\n\n  if (!spec.payloadHash?.digest || !spec.payloadHash?.algorithm) {\n    throw new Error(\"DSSE v0.0.2 entry missing payloadHash or algorithm\");\n  }\n\n  const hashAlg = getHashAlgorithm(spec.payloadHash.algorithm);\n  const tlogHashBytes = base64ToUint8Array(spec.payloadHash.digest);\n\n  const payloadBytes = base64ToUint8Array(bundle.dsseEnvelope.payload);\n  const bundleHashBytes = new Uint8Array(\n    await crypto.subtle.digest(hashAlg, payloadBytes as Uint8Array<ArrayBuffer>)\n  );\n\n  if (!uint8ArrayEqual(tlogHashBytes, bundleHashBytes)) {\n    throw new Error(\"DSSE payload hash mismatch between TLog entry and bundle (v0.0.2)\");\n  }\n}\n","/*\n * Intoto transparency log entry verification\n *\n * Based on sigstore-js:\n * https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/tlog/intoto.ts\n *\n * Key differences from sigstore-js:\n * - Browser-compatible: uses Uint8Array instead of Buffer for binary data\n * - Direct bundle field comparison instead of SignatureContent abstraction\n * - Uses crypto.subtle.digest for hash computation instead of Node.js crypto\n */\n\nimport { base64Decode, base64ToUint8Array, hexToUint8Array, uint8ArrayEqual } from \"@freedomofpress/crypto-browser\";\nimport { getHashAlgorithm } from \"../interfaces.js\";\nimport type { SigstoreBundle } from \"../bundle.js\";\nimport type { RekorEntry } from \"./body.js\";\n\ninterface IntotoEnvelope {\n  payload: string;\n  payloadType: string;\n  signatures: Array<{\n    keyid?: string;\n    sig: string;\n    publicKey?: string;\n  }>;\n}\n\ninterface IntotoSpec {\n  content: {\n    envelope: IntotoEnvelope;\n    hash?: {\n      algorithm: string;\n      value: string;\n    };\n    payloadHash?: {\n      algorithm: string;\n      value: string;\n    };\n  };\n  publicKey?: string;\n}\n\ninterface IntotoEntry extends RekorEntry {\n  apiVersion: \"0.0.2\";\n  kind: \"intoto\";\n  spec: IntotoSpec;\n}\n\nexport async function verifyIntotoBody(\n  entry: RekorEntry,\n  bundle: SigstoreBundle\n): Promise<void> {\n  const intotoEntry = entry as IntotoEntry;\n\n  if (intotoEntry.apiVersion !== \"0.0.2\") {\n    throw new Error(\n      `Unsupported intoto version: ${intotoEntry.apiVersion}`\n    );\n  }\n\n  if (!bundle.dsseEnvelope) {\n    throw new Error(\"Bundle missing dsseEnvelope for intoto entry\");\n  }\n\n  const tlogEnvelope = intotoEntry.spec.content.envelope;\n\n  if (!tlogEnvelope.signatures || tlogEnvelope.signatures.length !== 1) {\n    throw new Error(\"Intoto entry must have exactly one signature\");\n  }\n\n  // The signature in the intoto tlog entry is double-base64-encoded:\n  // 1. Raw signature bytes are base64-encoded (normal)\n  // 2. That base64 string is base64-encoded again (for storage in JSON)\n  // So we decode twice: base64 -> string -> base64 -> bytes\n  const tlogSigBase64 = tlogEnvelope.signatures[0].sig;\n  const tlogSigDecoded = base64Decode(tlogSigBase64); // First decode: base64 -> UTF-8 string (which contains base64)\n  const tlogSigBytes = base64ToUint8Array(tlogSigDecoded); // Second decode: base64 string -> raw bytes\n\n  if (bundle.dsseEnvelope.signatures.length === 0) {\n    throw new Error(\"Bundle DSSE envelope missing signatures\");\n  }\n\n  const bundleSigBytes = base64ToUint8Array(bundle.dsseEnvelope.signatures[0].sig);\n\n  if (!uint8ArrayEqual(tlogSigBytes, bundleSigBytes)) {\n    throw new Error(\"Intoto signature mismatch between TLog entry and bundle\");\n  }\n\n  if (intotoEntry.spec.content.payloadHash) {\n    if (!intotoEntry.spec.content.payloadHash.algorithm) {\n      throw new Error(\"Intoto entry missing payloadHash algorithm\");\n    }\n\n    const hashAlg = getHashAlgorithm(intotoEntry.spec.content.payloadHash.algorithm);\n    const tlogHashBytes = hexToUint8Array(intotoEntry.spec.content.payloadHash.value);\n\n    const payloadBytes = base64ToUint8Array(bundle.dsseEnvelope.payload);\n    const bundleHashBytes = new Uint8Array(\n      await crypto.subtle.digest(hashAlg, payloadBytes as Uint8Array<ArrayBuffer>)\n    );\n\n    if (!uint8ArrayEqual(tlogHashBytes, bundleHashBytes)) {\n      throw new Error(\"Intoto payload hash mismatch between TLog entry and bundle\");\n    }\n  }\n}\n","/*\n * Transparency log body verification\n *\n * Based on sigstore-js:\n * https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/tlog/index.ts\n *\n * Key differences from sigstore-js:\n * - Browser-compatible: uses Uint8Array instead of Buffer for binary data\n * - Direct bundle comparison instead of SignatureContent abstraction\n */\n\nimport { base64Decode } from \"@freedomofpress/crypto-browser\";\nimport type { SigstoreBundle, TLogEntry } from \"../bundle.js\";\nimport { verifyHashedRekordBody } from \"./hashedrekord.js\";\nimport { verifyDSSEBody } from \"./dsse.js\";\nimport { verifyIntotoBody } from \"./intoto.js\";\n\nexport interface RekorEntry {\n  apiVersion: string;\n  kind: string;\n  spec: unknown;\n}\n\nexport async function verifyTLogBody(\n  entry: TLogEntry,\n  bundle: SigstoreBundle\n): Promise<void> {\n  const rekorEntry = parseCanonicalBody(entry);\n\n  const { kind, version } = entry.kindVersion;\n\n  if (kind !== rekorEntry.kind || version !== rekorEntry.apiVersion) {\n    throw new Error(\n      `kind/version mismatch - expected: ${kind}/${version}, received: ${rekorEntry.kind}/${rekorEntry.apiVersion}`\n    );\n  }\n\n  switch (rekorEntry.kind) {\n    case \"hashedrekord\":\n      return verifyHashedRekordBody(rekorEntry, bundle);\n    case \"dsse\":\n      return verifyDSSEBody(rekorEntry, bundle);\n    case \"intoto\":\n      return verifyIntotoBody(rekorEntry, bundle);\n    default:\n      throw new Error(`Unsupported TLog entry kind: ${rekorEntry.kind}`);\n  }\n}\n\nfunction parseCanonicalBody(entry: TLogEntry): RekorEntry {\n  try {\n    const decodedBody = base64Decode(entry.canonicalizedBody);\n    const rekorEntry = JSON.parse(decodedBody) as RekorEntry;\n\n    if (!rekorEntry.apiVersion || !rekorEntry.kind || !rekorEntry.spec) {\n      throw new Error(\"Invalid Rekor entry structure\");\n    }\n\n    return rekorEntry;\n  } catch (error) {\n    throw new Error(\n      `Failed to parse canonicalized body: ${error instanceof Error ? error.message : String(error)}`\n    );\n  }\n}\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nexport class RFC3161TimestampVerificationError extends Error {}\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nimport { ASN1Obj, uint8ArrayEqual } from \"@freedomofpress/crypto-browser\";\nimport { HashAlgorithms } from \"../interfaces.js\";\nimport { SHA2_HASH_ALGOS } from \"../oid.js\";\nimport { RFC3161TimestampVerificationError } from \"./error.js\";\n\nexport class TSTInfo {\n  public root: ASN1Obj;\n\n  constructor(asn1: ASN1Obj) {\n    this.root = asn1;\n  }\n\n  get version(): bigint {\n    return this.root.subs[0].toInteger();\n  }\n\n  get genTime(): Date {\n    return this.root.subs[4].toDate();\n  }\n\n  get messageImprintHashAlgorithm(): string {\n    const oid = this.messageImprintObj.subs[0].subs[0].toOID();\n    const algo = SHA2_HASH_ALGOS[oid];\n    if (!algo) {\n      throw new Error(`Unknown message imprint hash algorithm OID: ${oid}`);\n    }\n    return algo;\n  }\n\n  get messageImprintHashedMessage(): Uint8Array {\n    return this.messageImprintObj.subs[1].value;\n  }\n\n  get raw(): Uint8Array {\n    return this.root.toDER();\n  }\n\n  public async verify(data: Uint8Array): Promise<void> {\n    const hashAlg = this.messageImprintHashAlgorithm;\n\n    // Convert hash algorithm name to the format expected by WebCrypto\n    const hashAlgName = hashAlg === \"sha256\" ? HashAlgorithms.SHA256 :\n                       hashAlg === \"sha384\" ? HashAlgorithms.SHA384 :\n                       hashAlg === \"sha512\" ? HashAlgorithms.SHA512 : hashAlg;\n\n    const digest = await crypto.subtle.digest(\n      hashAlgName,\n      data as Uint8Array<ArrayBuffer>,\n    );\n    if (\n      !uint8ArrayEqual(new Uint8Array(digest), this.messageImprintHashedMessage)\n    ) {\n      throw new RFC3161TimestampVerificationError(\n        \"message imprint does not match artifact\",\n      );\n    }\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc3161#section-2.4.2\n  private get messageImprintObj(): ASN1Obj {\n    return this.root.subs[2];\n  }\n}\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\nimport { ASN1Obj, uint8ArrayEqual, verifySignature } from \"@freedomofpress/crypto-browser\";\nimport { HashAlgorithms } from \"../interfaces.js\";\nimport { ECDSA_SIGNATURE_ALGOS, RSA_SIGNATURE_ALGOS, SHA2_HASH_ALGOS } from \"../oid.js\";\nimport { RFC3161TimestampVerificationError } from \"./error.js\";\nimport { TSTInfo } from \"./tstinfo.js\";\n\nconst OID_PKCS9_CONTENT_TYPE_SIGNED_DATA = \"1.2.840.113549.1.7.2\";\nconst OID_PKCS9_CONTENT_TYPE_TSTINFO = \"1.2.840.113549.1.9.16.1.4\";\nconst OID_PKCS9_MESSAGE_DIGEST_KEY = \"1.2.840.113549.1.9.4\";\n\nexport class RFC3161Timestamp {\n  public root: ASN1Obj;\n\n  constructor(asn1: ASN1Obj) {\n    this.root = asn1;\n  }\n\n  public static parse(der: Uint8Array): RFC3161Timestamp {\n    const asn1 = ASN1Obj.parseBuffer(der);\n    return new RFC3161Timestamp(asn1);\n  }\n\n  get status(): bigint {\n    return this.pkiStatusInfoObj.subs[0].toInteger();\n  }\n\n  get contentType(): string {\n    return this.contentTypeObj.toOID();\n  }\n\n  get eContentType(): string {\n    return this.eContentTypeObj.toOID();\n  }\n\n  get signingTime(): Date {\n    return this.tstInfo.genTime;\n  }\n\n  get signerIssuer(): Uint8Array {\n    return this.signerSidObj.subs[0].value;\n  }\n\n  get signerSerialNumber(): Uint8Array {\n    return this.signerSidObj.subs[1].value;\n  }\n\n  get signerDigestAlgorithm(): string {\n    const oid = this.signerDigestAlgorithmObj.subs[0].toOID();\n    const algo = SHA2_HASH_ALGOS[oid];\n    if (!algo) {\n      throw new Error(`Unknown digest algorithm OID: ${oid}`);\n    }\n    return algo;\n  }\n\n  get signatureAlgorithm(): string {\n    const oid = this.signatureAlgorithmObj.subs[0].toOID();\n    const algo = ECDSA_SIGNATURE_ALGOS[oid] || RSA_SIGNATURE_ALGOS[oid];\n    return algo;\n  }\n\n  get signatureValue(): Uint8Array {\n    return this.signatureValueObj.value;\n  }\n\n  get tstInfo(): TSTInfo {\n    // Need to unpack tstInfo from an OCTET STRING\n    return new TSTInfo(this.eContentObj.subs[0].subs[0]);\n  }\n\n  public async verify(data: Uint8Array, publicKey: CryptoKey): Promise<void> {\n    if (!this.timeStampTokenObj) {\n      throw new RFC3161TimestampVerificationError(\"timeStampToken is missing\");\n    }\n\n    // Check for expected ContentInfo content type\n    if (this.contentType !== OID_PKCS9_CONTENT_TYPE_SIGNED_DATA) {\n      throw new RFC3161TimestampVerificationError(\n        `incorrect content type: ${this.contentType}`,\n      );\n    }\n\n    // Check for expected encapsulated content type\n    if (this.eContentType !== OID_PKCS9_CONTENT_TYPE_TSTINFO) {\n      throw new RFC3161TimestampVerificationError(\n        `incorrect encapsulated content type: ${this.eContentType}`,\n      );\n    }\n\n    // Check that the tstInfo references the correct artifact\n    await this.tstInfo.verify(data);\n    // Check that the signed message digest matches the tstInfo\n    await this.verifyMessageDigest();\n    // Check that the signature is valid for the signed attributes\n    await this.verifySignature(publicKey);\n  }\n\n  private async verifyMessageDigest(): Promise<void> {\n    // Check that the tstInfo matches the signed data\n    const hashAlg = this.signerDigestAlgorithm;\n\n    // Convert hash algorithm name to the format expected by WebCrypto\n    const hashAlgName = hashAlg === \"sha256\" ? HashAlgorithms.SHA256 :\n                       hashAlg === \"sha384\" ? HashAlgorithms.SHA384 :\n                       hashAlg === \"sha512\" ? HashAlgorithms.SHA512 : hashAlg;\n\n    const tstInfoDigest = await crypto.subtle.digest(\n      hashAlgName,\n      this.tstInfo.raw as Uint8Array<ArrayBuffer>,\n    );\n    const expectedDigest = this.messageDigestAttributeObj.subs[1].subs[0].value;\n\n    if (!uint8ArrayEqual(new Uint8Array(tstInfoDigest), expectedDigest)) {\n      throw new RFC3161TimestampVerificationError(\n        \"signed data does not match tstInfo\",\n      );\n    }\n  }\n\n  private async verifySignature(key: CryptoKey): Promise<void> {\n    // Encode the signed attributes for verification\n    const signedAttrs = this.signedAttrsObj.toDER();\n    signedAttrs[0] = 0x31; // Change context-specific tag to SET\n\n    const oid = this.signatureAlgorithmObj.subs[0].toOID();\n    // Try both ECDSA and RSA signature algorithms\n    const algo = ECDSA_SIGNATURE_ALGOS[oid] || RSA_SIGNATURE_ALGOS[oid];\n\n    if (!algo) {\n      throw new RFC3161TimestampVerificationError(\n        `Unsupported signature algorithm OID: ${oid}`,\n      );\n    }\n\n    // Check that the signature is valid for the signed attributes\n    const verified = await verifySignature(\n      key,\n      signedAttrs,\n      this.signatureValue,\n      algo,\n    );\n\n    if (!verified) {\n      throw new RFC3161TimestampVerificationError(\n        \"signature verification failed\",\n      );\n    }\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc3161#section-2.4.2\n  private get pkiStatusInfoObj(): ASN1Obj {\n    // pkiStatusInfo is the first element of the timestamp response sequence\n    return this.root.subs[0];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc3161#section-2.4.2\n  private get timeStampTokenObj(): ASN1Obj {\n    // timeStampToken is the first element of the timestamp response sequence\n    return this.root.subs[1];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-3\n  private get contentTypeObj(): ASN1Obj {\n    return this.timeStampTokenObj.subs[0];\n  }\n  // https://www.rfc-editor.org/rfc/rfc5652#section-3\n  private get signedDataObj(): ASN1Obj {\n    const obj = this.timeStampTokenObj.subs.find((sub) =>\n      sub.tag.isContextSpecific(0x00),\n    );\n    if (!obj) {\n      throw new RFC3161TimestampVerificationError(\n        \"Missing timeStampTokenObj sub.\",\n      );\n    }\n    return obj.subs[0];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.1\n  private get encapContentInfoObj(): ASN1Obj {\n    return this.signedDataObj.subs[2];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.1\n  private get signerInfosObj(): ASN1Obj {\n    // SignerInfos is the last element of the signed data sequence\n    const sd = this.signedDataObj;\n    return sd.subs[sd.subs.length - 1];\n  }\n\n  // https://www.rfc-editor.org/rfc/rfc5652#section-5.1\n  private get signerInfoObj(): ASN1Obj {\n    // Only supporting one signer\n    return this.signerInfosObj.subs[0];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.2\n  private get eContentTypeObj(): ASN1Obj {\n    return this.encapContentInfoObj.subs[0];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.2\n  private get eContentObj(): ASN1Obj {\n    return this.encapContentInfoObj.subs[1];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.3\n  private get signedAttrsObj(): ASN1Obj {\n    const signedAttrs = this.signerInfoObj.subs.find((sub) =>\n      sub.tag.isContextSpecific(0x00),\n    );\n    if (!signedAttrs) {\n      throw new RFC3161TimestampVerificationError(\"Missing signedAttrsObj.\");\n    }\n    return signedAttrs;\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.3\n  private get messageDigestAttributeObj(): ASN1Obj {\n    const messageDigest = this.signedAttrsObj.subs.find(\n      (sub) =>\n        sub.subs[0].tag.isOID() &&\n        sub.subs[0].toOID() === OID_PKCS9_MESSAGE_DIGEST_KEY,\n    );\n    if (!messageDigest) {\n      throw new RFC3161TimestampVerificationError(\"Missing messageDigest.\");\n    }\n    return messageDigest;\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.3\n  private get signerSidObj(): ASN1Obj {\n    return this.signerInfoObj.subs[1];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.3\n  private get signerDigestAlgorithmObj(): ASN1Obj {\n    // Signature is the 2nd element of the signerInfoObj object\n    return this.signerInfoObj.subs[2];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.3\n  private get signatureAlgorithmObj(): ASN1Obj {\n    // Signature is the 4th element of the signerInfoObj object\n    return this.signerInfoObj.subs[4];\n  }\n\n  // https://datatracker.ietf.org/doc/html/rfc5652#section-5.3\n  private get signatureValueObj(): ASN1Obj {\n    // Signature is the 6th element of the signerInfoObj object\n    return this.signerInfoObj.subs[5];\n  }\n}\n","/*\n * TSA (Time-Stamping Authority) timestamp verification\n *\n * Based on sigstore-js:\n * https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/timestamp/tsa.ts\n *\n * Key differences from sigstore-js:\n * - Browser-compatible: uses Uint8Array instead of Buffer for binary data\n * - Uses Web Crypto API for all cryptographic operations\n * - Integrates with existing RFC3161 timestamp implementation\n * - Uses CertificateChainVerifier for full X.509 path validation\n * - Implements filterCertAuthorities inline (from sigstore-js/packages/verify/src/trust/filter.ts)\n * - Adds verifyBundleTimestamp for Sigstore bundle integration (new functionality)\n */\n\nimport { base64ToUint8Array, uint8ArrayEqual } from \"@freedomofpress/crypto-browser\";\nimport { CertificateChainVerifier, X509Certificate } from \"../x509/index.js\";\nimport { RawTimestampAuthority } from \"../interfaces.js\";\nimport { RFC3161Timestamp } from \"../rfc3161/index.js\";\n\n/**\n * Verifies an RFC3161 timestamp against a set of timestamp authorities\n *\n * @param timestamp - The RFC3161 timestamp to verify\n * @param data - The data that was timestamped\n * @param timestampAuthorities - List of trusted timestamp authorities\n * @returns The verified signing time\n * @throws Error if timestamp cannot be verified\n */\nexport async function verifyRFC3161Timestamp(\n  timestamp: RFC3161Timestamp,\n  data: Uint8Array,\n  timestampAuthorities: RawTimestampAuthority[]\n): Promise<Date> {\n  const signingTime = timestamp.signingTime;\n\n  // Filter for CAs which were valid at the time of signing\n  let validAuthorities = filterCertAuthorities(\n    timestampAuthorities,\n    signingTime\n  );\n\n  // Filter for CAs which match serial and issuer embedded in the timestamp\n  validAuthorities = filterCAsBySerialAndIssuer(validAuthorities, {\n    serialNumber: timestamp.signerSerialNumber,\n    issuer: timestamp.signerIssuer,\n  });\n\n  // Check that we can verify the timestamp with AT LEAST ONE of the remaining CAs\n  const verificationResults = await Promise.allSettled(\n    validAuthorities.map(ca => verifyTimestampForCA(timestamp, data, ca))\n  );\n\n  const verified = verificationResults.some(\n    result => result.status === \"fulfilled\"\n  );\n\n  if (!verified) {\n    const errors = verificationResults\n      .filter(r => r.status === \"rejected\")\n      .map(r => (r as PromiseRejectedResult).reason?.message || 'Unknown error');\n    throw new Error(`Timestamp could not be verified against any trusted authority. Errors: ${errors.join(', ')}`);\n  }\n\n  return signingTime;\n}\n\n/**\n * Filters certificate authorities to those valid at a specific time\n *\n * Adapted from sigstore-js/packages/verify/src/trust/filter.ts\n */\nfunction filterCertAuthorities(\n  authorities: RawTimestampAuthority[],\n  validAt: Date\n): RawTimestampAuthority[] {\n  return authorities.filter(ca => {\n    if (ca.validFor) {\n      const start = ca.validFor.start ? new Date(ca.validFor.start) : null;\n      const end = ca.validFor.end ? new Date(ca.validFor.end) : null;\n\n      if (start && validAt < start) {\n        return false;\n      }\n      if (end && validAt > end) {\n        return false;\n      }\n    }\n    return true;\n  });\n}\n\n/**\n * Filters certificate authorities by serial number and issuer\n *\n * Only checks the LEAF certificate (TSA signing cert), not the entire chain.\n * This matches the sigstore-js reference implementation.\n */\nfunction filterCAsBySerialAndIssuer(\n  timestampAuthorities: RawTimestampAuthority[],\n  criteria: { serialNumber: Uint8Array; issuer: Uint8Array }\n): RawTimestampAuthority[] {\n  return timestampAuthorities.filter(ca => {\n    if (!ca.certChain || ca.certChain.certificates.length === 0) {\n      return false;\n    }\n\n    const leafCert = X509Certificate.parse(\n      base64ToUint8Array(ca.certChain.certificates[0].rawBytes)\n    );\n\n    return uint8ArrayEqual(leafCert.serialNumber, criteria.serialNumber) &&\n           uint8ArrayEqual(leafCert.issuer, criteria.issuer);\n  });\n}\n\n/**\n * Verifies a timestamp against a specific certificate authority\n */\nasync function verifyTimestampForCA(\n  timestamp: RFC3161Timestamp,\n  data: Uint8Array,\n  ca: RawTimestampAuthority\n): Promise<void> {\n  if (!ca.certChain || ca.certChain.certificates.length === 0) {\n    throw new Error(\"Certificate authority missing certificate chain\");\n  }\n\n  const leafCert = X509Certificate.parse(\n    base64ToUint8Array(ca.certChain.certificates[0].rawBytes)\n  );\n  const signingTime = timestamp.signingTime;\n\n  const trustedCerts = ca.certChain.certificates\n    .slice(1)\n    .map(cert => X509Certificate.parse(base64ToUint8Array(cert.rawBytes)));\n\n  try {\n    const verifier = new CertificateChainVerifier({\n      untrustedCert: leafCert,\n      trustedCerts: trustedCerts,\n      timestamp: signingTime,\n    });\n    await verifier.verify();\n  } catch (e) {\n    throw new Error(`TSA certificate chain verification failed: ${e instanceof Error ? e.message : String(e)}`);\n  }\n\n  const publicKey = await leafCert.publicKeyObj;\n\n  await timestamp.verify(data, publicKey);\n}\n\n/**\n * Verifies all timestamps in a bundle's timestamp verification data\n *\n * Matches sigstore-js behavior: all timestamps must successfully verify.\n * Reference: https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/verifier.ts#L64-L108\n *\n * @param timestampData - The timestamp verification data from the bundle\n * @param signature - The signature being verified\n * @param timestampAuthorities - List of trusted timestamp authorities\n * @returns Array of verified signing times (empty if no timestamps present)\n * @throws Error if any timestamp fails verification or duplicates are found\n */\nexport async function verifyBundleTimestamp(\n  timestampData: any,\n  signature: Uint8Array,\n  timestampAuthorities: RawTimestampAuthority[]\n): Promise<Date[]> {\n  if (!timestampData?.rfc3161Timestamps?.length) {\n    return [];\n  }\n\n  // Verify ALL timestamps - each must succeed (matches sigstore-js behavior)\n  // Collect verification results for duplicate checking after verification\n  // Reference: https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/verifier.ts#L86-L92\n  const verifiedResults: Array<{ signingTime: Date; signerSerialNumber: string }> = [];\n\n  for (const tsData of timestampData.rfc3161Timestamps) {\n    // Decode the base64-encoded timestamp\n    const timestampBytes = base64ToUint8Array(tsData.signedTimestamp);\n    const timestamp = RFC3161Timestamp.parse(timestampBytes);\n\n    const signingTime = await verifyRFC3161Timestamp(\n      timestamp,\n      signature,\n      timestampAuthorities\n    );\n\n    verifiedResults.push({\n      signingTime,\n      signerSerialNumber: Array.from(timestamp.signerSerialNumber).join(','),\n    });\n  }\n\n  // Check for duplicate timestamps using deep equality on parsed values\n  // sigstore-js uses isDeepStrictEqual on {type, logID, timestamp} objects\n  for (let i = 0; i < verifiedResults.length; i++) {\n    for (let j = i + 1; j < verifiedResults.length; j++) {\n      if (\n        verifiedResults[i].signingTime.getTime() === verifiedResults[j].signingTime.getTime() &&\n        verifiedResults[i].signerSerialNumber === verifiedResults[j].signerSerialNumber\n      ) {\n        throw new Error(\"Duplicate TSA timestamp detected\");\n      }\n    }\n  }\n\n  return verifiedResults.map(r => r.signingTime);\n}","/*\n * TUF (The Update Framework) integration for trusted root management\n *\n * Provides secure updates for Sigstore trusted root metadata using TUF.\n * Uses tuf-browser for browser-compatible TUF client functionality.\n *\n * Reference: https://github.com/freedomofpress/tuf-browser\n */\n\nimport { Uint8ArrayToString } from \"@freedomofpress/crypto-browser\";\nimport type { TUFClient } from \"@freedomofpress/tuf-browser\";\nimport { TrustedRoot } from \"../interfaces.js\";\n\n/**\n * Options for TrustedRootProvider configuration\n */\nexport interface TrustedRootProviderOptions {\n  /**\n   * TUF repository URL for metadata\n   * Default: Sigstore production TUF repository\n   */\n  metadataUrl?: string;\n\n  /**\n   * Target base URL for fetching target files\n   * If not specified, uses the same as metadataUrl\n   */\n  targetBaseUrl?: string;\n\n  /**\n   * Initial root metadata (1.root.json content)\n   * If not provided, will use embedded default\n   */\n  initialRoot?: string;\n\n  /**\n   * Namespace for TUF cache storage\n   * Default: 'sigstore-browser'\n   */\n  namespace?: string;\n\n  /**\n   * Name of the trusted root target file\n   * Default: 'trusted_root.json'\n   */\n  trustedRootTarget?: string;\n\n  /**\n   * Cache TTL in milliseconds\n   * Default: 1 hour (3600000 ms)\n   */\n  cacheTTL?: number;\n}\n\n/**\n * Default configuration for Sigstore production TUF repository\n */\nconst DEFAULT_CONFIG = {\n  metadataUrl: 'https://tuf-repo-cdn.sigstore.dev/',\n  targetBaseUrl: 'https://tuf-repo-cdn.sigstore.dev/targets/',\n  namespace: 'sigstore-browser',\n  trustedRootTarget: 'trusted_root.json',\n  cacheTTL: 3600000, // 1 hour\n};\n\n/**\n * Provides Sigstore trusted root via TUF for secure updates\n *\n * This class manages fetching and caching of Sigstore trusted root metadata\n * using The Update Framework (TUF) for secure, verified updates.\n *\n * Example usage:\n * ```typescript\n * const provider = new TrustedRootProvider();\n * const trustedRoot = await provider.getTrustedRoot();\n * ```\n */\nexport class TrustedRootProvider {\n  private metadataUrl: string;\n  private targetBaseUrl?: string;\n  private initialRoot?: string;\n  private namespace: string;\n  private trustedRootTarget: string;\n  private cacheTTL: number;\n\n  private tufClient?: TUFClient;\n  private cachedRoot?: TrustedRoot;\n  private cacheTimestamp?: number;\n\n  constructor(options: TrustedRootProviderOptions = {}) {\n    const metadataUrl = options.metadataUrl || DEFAULT_CONFIG.metadataUrl;\n    this.metadataUrl = metadataUrl.endsWith('/') ? metadataUrl : `${metadataUrl}/`;\n    const targetBaseUrl = options.targetBaseUrl || DEFAULT_CONFIG.targetBaseUrl;\n    this.targetBaseUrl = targetBaseUrl.endsWith('/') ? targetBaseUrl : `${targetBaseUrl}/`;\n    this.initialRoot = options.initialRoot;\n    this.namespace = options.namespace || DEFAULT_CONFIG.namespace;\n    this.trustedRootTarget = options.trustedRootTarget || DEFAULT_CONFIG.trustedRootTarget;\n    this.cacheTTL = options.cacheTTL ?? DEFAULT_CONFIG.cacheTTL;\n  }\n\n  /**\n   * Initialize the TUF client\n   * Lazy initialization to avoid loading TUF client until needed\n   */\n  private async initTUFClient(): Promise<void> {\n    if (this.tufClient) {\n      return;\n    }\n\n    try {\n      const { TUFClient } = await import('@freedomofpress/tuf-browser');\n\n      // Get initial root metadata\n      const rootMetadata = this.initialRoot || await this.getDefaultRoot();\n\n      this.tufClient = new TUFClient(\n        this.metadataUrl,\n        rootMetadata,\n        this.namespace,\n        this.targetBaseUrl\n      );\n    } catch (error) {\n      throw new Error(\n        `Failed to initialize TUF client: ${error instanceof Error ? error.message : String(error)}`\n      );\n    }\n  }\n\n  /**\n   * Get the default embedded root metadata\n   * Returns the TUF root.json that bootstraps the TUF client\n   */\n  private async getDefaultRoot(): Promise<string> {\n    // Import the embedded TUF root metadata (base64-encoded 1.root.json as JSON string)\n    // This is the root of trust for TUF, not to be confused with the Sigstore trusted root\n    const tufRootModule = await import('./tuf-root.json', { with: { type: 'json' } });\n    const tufRootBase64 = tufRootModule.default as string;\n\n    // Decode from base64 to get the actual root.json content\n    const decoder = new TextDecoder();\n    const rootBytes = Uint8Array.from(atob(tufRootBase64), c => c.charCodeAt(0));\n    return decoder.decode(rootBytes);\n  }\n\n  /**\n   * Check if cached trusted root is still valid\n   */\n  private isCacheValid(): boolean {\n    if (!this.cachedRoot || !this.cacheTimestamp) {\n      return false;\n    }\n\n    const now = Date.now();\n    return (now - this.cacheTimestamp) < this.cacheTTL;\n  }\n\n  /**\n   * Get the Sigstore trusted root metadata\n   * Uses TUF to securely fetch and verify the trusted root\n   *\n   * @returns Promise<TrustedRoot> The verified trusted root metadata\n   * @throws Error if TUF verification fails or root cannot be fetched\n   */\n  async getTrustedRoot(): Promise<TrustedRoot> {\n    // Return cached root if still valid\n    if (this.isCacheValid() && this.cachedRoot) {\n      return this.cachedRoot;\n    }\n\n    // Initialize TUF client if needed\n    await this.initTUFClient();\n\n    if (!this.tufClient) {\n      throw new Error('TUF client not initialized');\n    }\n\n    try {\n      // Update TUF metadata (root, timestamp, snapshot, targets)\n      // This must be called before getTarget() to populate the metadata cache\n      await this.tufClient.updateTUF();\n\n      // Fetch the trusted root target via TUF\n      // TUF will handle all verification (signatures, rollback protection, etc.)\n      const trustedRootBuffer = await this.tufClient.getTarget(this.trustedRootTarget);\n\n      // Parse the trusted root JSON\n      const trustedRootJson = Uint8ArrayToString(new Uint8Array(trustedRootBuffer));\n      const trustedRoot = JSON.parse(trustedRootJson) as TrustedRoot;\n\n      // Cache the result\n      this.cachedRoot = trustedRoot;\n      this.cacheTimestamp = Date.now();\n\n      return trustedRoot;\n    } catch (error) {\n      throw new Error(\n        `Failed to fetch trusted root via TUF: ${error instanceof Error ? error.message : String(error)}`\n      );\n    }\n  }\n\n  /**\n   * Manually refresh the trusted root from TUF\n   * Bypasses cache and forces a fresh fetch\n   *\n   * @returns Promise<TrustedRoot> The updated trusted root metadata\n   */\n  async refreshTrustedRoot(): Promise<TrustedRoot> {\n    // Clear cache\n    this.cachedRoot = undefined;\n    this.cacheTimestamp = undefined;\n\n    // Fetch fresh root\n    return await this.getTrustedRoot();\n  }\n\n  /**\n   * Clear the cached trusted root\n   * Next call to getTrustedRoot() will fetch fresh data\n   */\n  clearCache(): void {\n    this.cachedRoot = undefined;\n    this.cacheTimestamp = undefined;\n  }\n}\n","import {\n  base64ToUint8Array,\n  ByteStream,\n  canonicalize,\n  importKey,\n  stringToUint8Array,\n  uint8ArrayEqual,\n  Uint8ArrayToHex,\n  Uint8ArrayToString,\n  verifySignature,\n  verifySignatureOverDigest,\n} from \"@freedomofpress/crypto-browser\";\nimport { HashAlgorithms } from \"./interfaces.js\";\nimport {\n  CertificateChainVerifier,\n  EXTENSION_OID_SCT,\n  X509Certificate,\n  X509SCTExtension,\n} from \"./x509/index.js\";\nimport { SigstoreBundle } from \"./bundle.js\";\nimport { preAuthEncoding } from \"./dsse.js\";\nimport {\n  CertAuthority,\n  CTLog,\n  RawCAs,\n  RawLogs,\n  RawTimestampAuthorities,\n  RekorKeyInfo,\n  Sigstore,\n  SigstoreRoots,\n  TrustedRoot,\n} from \"./interfaces.js\";\nimport { verifyMerkleInclusion } from \"./tlog/merkle.js\";\nimport { verifyCheckpoint } from \"./tlog/checkpoint.js\";\nimport { verifyTLogBody } from \"./tlog/body.js\";\nimport { verifyBundleTimestamp } from \"./timestamp/tsa.js\";\nimport { TrustedRootProvider } from \"./trust/tuf.js\";\n\nconst MEDIA_TYPE_BASE = \"application/vnd.dev.sigstore.bundle\";\n\n/**\n * Extract bundle version from mediaType string\n * Reference: https://github.com/sigstore/sigstore-go/blob/main/pkg/bundle/bundle.go#L159-L177\n */\nfunction getBundleVersion(mediaType: string): string {\n  switch (mediaType) {\n    case `${MEDIA_TYPE_BASE}+json;version=0.1`:\n      return \"0.1\";\n    case `${MEDIA_TYPE_BASE}+json;version=0.2`:\n      return \"0.2\";\n    case `${MEDIA_TYPE_BASE}+json;version=0.3`:\n      return \"0.3\";\n  }\n\n  // New format: \"application/vnd.dev.sigstore.bundle.v0.3+json\"\n  if (mediaType.startsWith(`${MEDIA_TYPE_BASE}.v`) && mediaType.endsWith(\"+json\")) {\n    const version = mediaType\n      .replace(`${MEDIA_TYPE_BASE}.v`, \"\")\n      .replace(\"+json\", \"\");\n    // Basic semver validation (major.minor or major.minor.patch)\n    if (/^\\d+\\.\\d+(\\.\\d+)?$/.test(version)) {\n      return version;\n    }\n  }\n\n  // Default to 0.1 for unknown formats\n  return \"0.1\";\n}\n\nexport interface SigstoreVerifierOptions {\n  tlogThreshold?: number;\n  ctlogThreshold?: number;\n  tsaThreshold?: number;\n}\n\nexport class SigstoreVerifier {\n  private root: Sigstore | undefined;\n  private rawRoot: TrustedRoot | undefined;\n  private options: Required<SigstoreVerifierOptions>;\n\n  constructor(options: SigstoreVerifierOptions = {}) {\n    this.root = undefined;\n    this.rawRoot = undefined;\n    this.options = {\n      tlogThreshold: options.tlogThreshold ?? 1,\n      ctlogThreshold: options.ctlogThreshold ?? 1,\n      tsaThreshold: options.tsaThreshold ?? 0,\n    };\n  }\n\n  async loadLog(frozenTimestamp: Date, logs: RawLogs): Promise<RekorKeyInfo | undefined> {\n    // Load the first Rekor transparency log key that's valid at the frozen timestamp\n    // and store its log ID for verification. This matches sigstore-go's approach of\n    // looking up the verifier by log ID (verify/tlog.go:80-83).\n\n    for (const log of logs) {\n      // if start date is not in the future, and if an end doesn't exist or is in the future\n      if (\n        frozenTimestamp > new Date(log.publicKey.validFor.start) &&\n        (!log.publicKey.validFor.end ||\n          new Date(log.publicKey.validFor.end) > frozenTimestamp)\n      ) {\n        return {\n          publicKey: await importKey(\n            log.publicKey.keyDetails,\n            log.publicKey.keyDetails,\n            log.publicKey.rawBytes,\n          ),\n          logId: base64ToUint8Array(log.logId.keyId),\n        };\n      }\n    }\n\n    // Return undefined instead of throwing - some bundles don't need Rekor keys\n    // (e.g., v0.3 bundles with inclusion proofs)\n    return undefined;\n  }\n\n  async loadCTLogs(frozenTimestamp: Date, ctlogs: RawLogs): Promise<CTLog[]> {\n    const result: CTLog[] = [];\n\n    for (const log of ctlogs) {\n      const start = new Date(log.publicKey.validFor.start);\n      const end = log.publicKey.validFor.end\n        ? new Date(log.publicKey.validFor.end)\n        : new Date('9999-12-31'); // No expiry means valid forever\n\n      // Include logs that are valid (started before frozen timestamp)\n      // We keep all logs, even expired ones, for historical verification\n      if (start <= frozenTimestamp) {\n        const publicKey = await importKey(\n          log.publicKey.keyDetails,\n          log.publicKey.keyDetails,\n          log.publicKey.rawBytes,\n        );\n\n        result.push({\n          logID: base64ToUint8Array(log.logId.keyId),\n          publicKey,\n          validFor: { start, end },\n        });\n      }\n    }\n\n    if (result.length === 0) {\n      throw new Error(\"Could not find any valid CT logs in sigstore root.\");\n    }\n\n    return result;\n  }\n\n  // Adapted from https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/key/certificate.ts#L22-L53\n  // Verifies that the leaf certificate chains to a trusted CA and is valid at the given timestamp.\n  // Differences from sigstore-js:\n  // - This is async (uses await) because our CertificateChainVerifier.verify() is async\n  // - sigstore-js filters CAs using filterCertAuthorities() before calling this function,\n  //   we do the timestamp filtering inline within this function\n  async verifyCertificateChain(\n    timestamp: Date,\n    leaf: X509Certificate,\n    certificateAuthorities: CertAuthority[]\n  ): Promise<X509Certificate[]> {\n    let lastError: any;\n\n    for (const ca of certificateAuthorities) {\n      // Check if this CA is valid for the given timestamp\n      if (timestamp < ca.validFor.start || timestamp > ca.validFor.end) {\n        continue;\n      }\n\n      try {\n        const verifier = new CertificateChainVerifier({\n          trustedCerts: ca.certChain,\n          untrustedCert: leaf,\n          timestamp,\n        });\n        return await verifier.verify();\n      } catch (err) {\n        lastError = err;\n      }\n    }\n\n    throw new Error(`Failed to verify certificate chain: ${lastError?.message || 'No valid CAs found'}`);\n  }\n\n  // Load timestamp authorities that are valid at the frozen timestamp.\n  // Unlike sigstore-js which doesn't pre-load TSAs (it passes raw TSA data to timestamp verification),\n  // we parse and filter them at initialization time for consistency with how we handle CAs and other roots.\n  loadTSA(\n    frozenTimestamp: Date,\n    tsas?: RawTimestampAuthorities,\n  ): CertAuthority[] {\n    if (!tsas || tsas.length === 0) {\n      return [];\n    }\n\n    const result: CertAuthority[] = [];\n\n    for (const tsa of tsas) {\n      const start = new Date(tsa.validFor.start);\n      const end = tsa.validFor.end ? new Date(tsa.validFor.end) : new Date(8640000000000000);\n\n      if (frozenTimestamp > start && frozenTimestamp < end) {\n        const certChain = tsa.certChain.certificates.map(cert =>\n          X509Certificate.parse(base64ToUint8Array(cert.rawBytes))\n        );\n\n        if (certChain.length > 0) {\n          result.push({\n            certChain,\n            validFor: { start, end },\n          });\n        }\n      }\n    }\n\n    return result;\n  }\n\n  // Load certificate authorities (Fulcio CAs) that are valid at the frozen timestamp.\n  // Similar to sigstore-js's filterCertAuthorities() in trust/filter.ts, but we also\n  // parse the certificates at load time whereas sigstore-js keeps them in the trust material\n  // and parses them during verification. This pre-loading approach is consistent with our\n  // architecture of loading all trusted roots at initialization.\n  loadCA(frozenTimestamp: Date, cas: RawCAs): CertAuthority[] {\n    const result: CertAuthority[] = [];\n\n    for (const ca of cas) {\n      const start = new Date(ca.validFor.start);\n      const end = ca.validFor.end ? new Date(ca.validFor.end) : new Date(8640000000000000);\n\n      if (frozenTimestamp > start && frozenTimestamp < end) {\n        const certChain = ca.certChain.certificates.map(cert =>\n          X509Certificate.parse(base64ToUint8Array(cert.rawBytes))\n        );\n\n        if (certChain.length > 0) {\n          result.push({\n            certChain,\n            validFor: { start, end },\n          });\n        }\n      }\n    }\n\n    return result;\n  }\n\n  async loadSigstoreRoot(rawRoot: TrustedRoot) {\n    const frozenTimestamp = new Date();\n\n    this.rawRoot = rawRoot;\n    this.root = {\n      rekor: await this.loadLog(frozenTimestamp, rawRoot[SigstoreRoots.tlogs]),\n      ctlogs: await this.loadCTLogs(frozenTimestamp, rawRoot[SigstoreRoots.ctlogs]),\n      certificateAuthorities: this.loadCA(\n        frozenTimestamp,\n        rawRoot[SigstoreRoots.certificateAuthorities],\n      ),\n      timestampAuthorities: this.loadTSA(frozenTimestamp, rawRoot.timestampAuthorities),\n    };\n  }\n\n  /**\n   * Load Sigstore trusted root via TUF\n   * Uses The Update Framework for secure, verified updates of trusted root metadata\n   *\n   * @param tufProvider Optional TrustedRootProvider instance. If not provided, uses default Sigstore TUF repository\n   */\n  async loadSigstoreRootWithTUF(tufProvider?: TrustedRootProvider): Promise<void> {\n    const provider = tufProvider || new TrustedRootProvider();\n    const trustedRoot = await provider.getTrustedRoot();\n    await this.loadSigstoreRoot(trustedRoot);\n  }\n\n  // Adapted from https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/key/sct.ts\n  // Key differences:\n  // - Adds duplicate SCT detection (not in reference)\n  // - Inline CT log filtering by logID and validity period (reference uses filterTLogAuthorities)\n  // - Returns array of verified SCT logIDs for threshold checking (matches reference behavior)\n  async verifySCT(\n    cert: X509Certificate,\n    issuer: X509Certificate,\n    ctlogs: CTLog[],\n  ): Promise<Uint8Array[]> {\n    let extSCT: X509SCTExtension | undefined;\n\n    // Verifying the SCT requires that we remove the SCT extension and\n    // re-encode the TBS structure to DER -- this value is part of the data\n    // over which the signature is calculated. Since this is a destructive action\n    // we create a copy of the certificate so we can remove the SCT extension\n    // without affecting the original certificate.\n    const clone = cert.clone();\n\n    // Intentionally not using the findExtension method here because we want to\n    // remove the the SCT extension from the certificate before calculating the\n    // PreCert structure\n    for (let i = 0; i < clone.extensions.length; i++) {\n      const ext = clone.extensions[i];\n\n      if (ext.subs[0].toOID() === EXTENSION_OID_SCT) {\n        extSCT = new X509SCTExtension(ext);\n\n        // Remove the extension from the certificate\n        clone.extensions.splice(i, 1);\n        break;\n      }\n    }\n\n    // No SCT extension found - fail verification\n    if (!extSCT) {\n      throw new Error(\"Certificate is missing required SCT extension\");\n    }\n\n    // Found an SCT extension but it has no SCTs - fail verification\n    if (extSCT.signedCertificateTimestamps.length === 0) {\n      throw new Error(\"SCT extension is present but contains no SCTs\");\n    }\n\n    // Check for duplicate SCTs (same log ID)\n    const seenLogIds = new Set<string>();\n    for (const sct of extSCT.signedCertificateTimestamps) {\n      const logIdHex = Uint8ArrayToHex(sct.logID);\n      if (seenLogIds.has(logIdHex)) {\n        throw new Error(`Duplicate SCT found for log ID: ${logIdHex}`);\n      }\n      seenLogIds.add(logIdHex);\n    }\n\n    // Construct the PreCert structure\n    // https://www.rfc-editor.org/rfc/rfc6962#section-3.2\n    const preCert = new ByteStream();\n\n    // Calculate hash of the issuer's public key\n    const issuerId = new Uint8Array(\n      await crypto.subtle.digest(HashAlgorithms.SHA256, issuer.publicKey as Uint8Array<ArrayBuffer>),\n    );\n    preCert.appendView(issuerId);\n\n    // Re-encodes the certificate to DER after removing the SCT extension\n    const tbs = clone.tbsCertificate.toDER();\n    preCert.appendUint24(tbs.length);\n    preCert.appendView(tbs);\n\n    // Calculate and return the verification results for each SCT\n    // Unlike sigstore-go which counts verified SCTs and checks threshold at the end,\n    // sigstore-js throws immediately if any SCT fails verification\n    const verifiedSCTs: Uint8Array[] = [];\n\n    for (const sct of extSCT.signedCertificateTimestamps) {\n      // Find the CT log that matches this SCT's log ID and is valid for the SCT datetime\n      const validCTLogs = ctlogs.filter((log) => {\n        // Check if log IDs match\n        if (!uint8ArrayEqual(log.logID, sct.logID)) return false;\n        // Check that the SCT datetime is within the log's validity period\n        return log.validFor.start <= sct.datetime && sct.datetime <= log.validFor.end;\n      });\n\n      // See if the SCT is valid for any of the CT logs\n      const verified = await (async () => {\n        for (const log of validCTLogs) {\n          try {\n            if (await sct.verify(preCert.buffer, log.publicKey)) {\n              return true;\n            }\n          } catch {\n            // Continue trying other logs\n          }\n        }\n        return false;\n      })();\n\n      if (!verified) {\n        throw new Error(\"SCT verification failed\");\n      }\n\n      verifiedSCTs.push(sct.logID);\n    }\n\n    return verifiedSCTs;\n  }\n\n  async verifyInclusionPromise(\n    cert: X509Certificate,\n    bundle: SigstoreBundle,\n    rekor: RekorKeyInfo | undefined,\n  ): Promise<boolean> {\n    const entries = bundle.verificationMaterial.tlogEntries;\n\n    // Check that bundle has enough tlog entries to meet threshold\n    if (entries.length < this.options.tlogThreshold) {\n      throw new Error(\n        `Not enough tlog entries: ${entries.length} < ${this.options.tlogThreshold}`,\n      );\n    }\n\n    // Prevent DoS via excessive entries and threshold bypass via duplicates\n    // Matches sigstore-go limits (verify/tlog.go:46-57)\n    const MAX_TLOG_ENTRIES = 32;\n    if (entries.length > MAX_TLOG_ENTRIES) {\n      throw new Error(\n        `Too many tlog entries: ${entries.length} > ${MAX_TLOG_ENTRIES}`,\n      );\n    }\n\n    for (let i = 0; i < entries.length; i++) {\n      for (let j = i + 1; j < entries.length; j++) {\n        const iLogId = Uint8ArrayToHex(base64ToUint8Array(entries[i].logId.keyId));\n        const jLogId = Uint8ArrayToHex(base64ToUint8Array(entries[j].logId.keyId));\n        if (iLogId === jLogId && entries[i].logIndex === entries[j].logIndex) {\n          throw new Error(\n            `Duplicate tlog entry found: logID=${iLogId}, logIndex=${entries[i].logIndex}`,\n          );\n        }\n      }\n    }\n\n    const entry = entries[0];\n\n    // Extract bundle version from mediaType\n    // Reference: https://github.com/sigstore/sigstore-go/blob/main/pkg/bundle/bundle.go#L159-L177\n    const bundleVersion = getBundleVersion(bundle.mediaType);\n    const isV02OrLater = parseFloat(bundleVersion) >= 0.2;\n\n    // Bundle v0.2+ requires an inclusion proof\n    if (isV02OrLater && !entry.inclusionProof) {\n      throw new Error(\n        \"Bundle v0.2+ requires an inclusion proof.\",\n      );\n    }\n\n    // For rekor2/v0.3 bundles with inclusion proofs, the inclusion promise is optional\n    if (!entry.inclusionPromise?.signedEntryTimestamp) {\n      // If there's no inclusion promise, there must be an inclusion proof\n      if (!entry.inclusionProof) {\n        throw new Error(\n          \"Bundle must have either an inclusion promise or an inclusion proof.\",\n        );\n      }\n    } else {\n      // Verify the inclusion promise signature if present\n      // For v0.3 bundles that have both inclusion promise and proof,\n      // we can skip the promise verification if we don't have a Rekor key\n      // and there's a valid inclusion proof\n      if (!rekor && entry.inclusionProof) {\n        // Skip promise verification if we have an inclusion proof\n        // The inclusion proof will be verified later\n      } else {\n        if (!rekor) {\n          throw new Error(\"Rekor public key not found in trusted root\");\n        }\n\n        // Verify the log ID matches (matches sigstore-go verify/tlog.go:80-83)\n        const entryLogId = base64ToUint8Array(entry.logId.keyId);\n        if (!uint8ArrayEqual(rekor.logId, entryLogId)) {\n          throw new Error(\n            `Rekor log ID mismatch: bundle uses ${Uint8ArrayToHex(entryLogId)} but loaded key is for ${Uint8ArrayToHex(rekor.logId)}`\n          );\n        }\n\n        const signature = base64ToUint8Array(\n          entry.inclusionPromise.signedEntryTimestamp,\n        );\n\n        const keyId = Uint8ArrayToHex(entryLogId);\n        const integratedTime = Number(entry.integratedTime);\n\n        const signed = stringToUint8Array(\n          canonicalize({\n            body: entry.canonicalizedBody,\n            integratedTime: integratedTime,\n            logIndex: Number(entry.logIndex),\n            logID: keyId,\n          }),\n        );\n\n        if (!(await verifySignature(rekor.publicKey, signed, signature))) {\n          throw new Error(\n            \"Failed to verify the inclusion promise in the provided bundle.\",\n          );\n        }\n      }\n    }\n\n    // Validate integrated time and logged certificate\n    // Note: Rekor v2 bundles don't have integrated time in the tlog entry\n    if (entry.integratedTime) {\n      const integratedTime = Number(entry.integratedTime);\n      const integratedDate = new Date(integratedTime * 1000);\n\n      if (!cert.validForDate(integratedDate)) {\n        throw new Error(\n          \"Artifact signing was logged outside of the certificate validity.\",\n        );\n      }\n    } else {\n      // Rekor v2 bundles (no integratedTime) require a timestamp for verification\n      if (!bundle.verificationMaterial.timestampVerificationData) {\n        throw new Error(\n          \"Rekor v2 bundles require a timestamp for verification.\",\n        );\n      }\n    }\n\n    // Verify that the certificate in the log matches the signing certificate\n    // The format depends on the entry type (hashedrekord vs dsse) and version\n    const bodyJson = JSON.parse(Uint8ArrayToString(base64ToUint8Array(entry.canonicalizedBody)));\n\n    if (bodyJson.kind === \"hashedrekord\") {\n      let loggedCertContent: string | undefined;\n\n      // Check for hashedRekordV002 structure (Rekor v2)\n      if (bodyJson.spec.hashedRekordV002) {\n        const verifier = bodyJson.spec.hashedRekordV002.signature.verifier;\n        if (verifier?.x509Certificate) {\n          loggedCertContent = verifier.x509Certificate.rawBytes;\n        }\n      }\n      // Check for older hashedrekord structure\n      else if (bodyJson.spec.signature?.publicKey) {\n        loggedCertContent = bodyJson.spec.signature.publicKey.content;\n      }\n\n      if (loggedCertContent) {\n        // For hashedrekord v0.0.1, publicKey.content is base64-encoded PEM\n        // For hashedRekordV002, x509Certificate.rawBytes is base64-encoded DER\n        let loggedCert: X509Certificate;\n        if (bodyJson.spec.hashedRekordV002) {\n          loggedCert = X509Certificate.parse(base64ToUint8Array(loggedCertContent));\n        } else {\n          const pemString = Uint8ArrayToString(base64ToUint8Array(loggedCertContent));\n          loggedCert = X509Certificate.parse(pemString);\n        }\n\n        if (!cert.equals(loggedCert)) {\n          throw new Error(\n            \"Certificate in Rekor log does not match the signing certificate.\",\n          );\n        }\n      }\n    } else if (bodyJson.kind === \"dsse\") {\n      // DSSE v0.0.1: certificate is in spec.signatures[0].verifier (base64-encoded PEM)\n      // https://github.com/sigstore/sigstore-go/blob/main/pkg/tlog/entry.go#L356-L357\n      const verifierContent = bodyJson.spec.signatures?.[0]?.verifier;\n      if (verifierContent) {\n        const pemString = Uint8ArrayToString(base64ToUint8Array(verifierContent));\n        const loggedCert = X509Certificate.parse(pemString);\n        if (!cert.equals(loggedCert)) {\n          throw new Error(\n            \"Certificate in DSSE tlog entry does not match the signing certificate.\",\n          );\n        }\n      }\n    } else if (bodyJson.kind === \"intoto\") {\n      // intoto v0.0.2: certificate is in spec.content.envelope.signatures[0].publicKey (base64-encoded PEM)\n      // https://github.com/sigstore/sigstore-go/blob/main/pkg/tlog/entry.go#L360-L361\n      const publicKeyContent = bodyJson.spec.content?.envelope?.signatures?.[0]?.publicKey;\n      if (publicKeyContent) {\n        const pemString = Uint8ArrayToString(base64ToUint8Array(publicKeyContent));\n        const loggedCert = X509Certificate.parse(pemString);\n        if (!cert.equals(loggedCert)) {\n          throw new Error(\n            \"Certificate in intoto tlog entry does not match the signing certificate.\",\n          );\n        }\n      }\n    } else {\n      // Unknown entry type - this should not happen with standard Sigstore bundles\n      throw new Error(`Unsupported tlog entry kind: ${bodyJson.kind}`);\n    }\n\n    return true;\n  }\n\n  async verifyInclusionProof(bundle: SigstoreBundle): Promise<void> {\n    if (!this.rawRoot) {\n      throw new Error(\"Sigstore root is undefined\");\n    }\n\n    if (bundle.verificationMaterial.tlogEntries.length < 1) {\n      throw new Error(\"No transparency log entries found in bundle\");\n    }\n\n    // Verify inclusion proof for ALL entries, not just the first one\n    // Reference: https://github.com/sigstore/sigstore-go/blob/main/pkg/verify/tlog.go#L74-L127\n    for (const entry of bundle.verificationMaterial.tlogEntries) {\n      // Only verify if there's an inclusion proof (v0.3/rekor2 bundles)\n      // v0.1 bundles use inclusion promises instead, verified in verifyInclusionPromise\n      if (entry.inclusionProof) {\n        await verifyMerkleInclusion(entry);\n\n        if (entry.inclusionProof.checkpoint) {\n          await verifyCheckpoint(entry, this.rawRoot.tlogs);\n        }\n      }\n    }\n  }\n\n  public async verifyArtifact(\n    identity: string,\n    issuer: string,\n    bundle: SigstoreBundle,\n    data: Uint8Array,\n    isDigestOnly: boolean = false,\n  ): Promise<boolean> {\n    // Quick checks first: does the signing certificate have the correct identity?\n\n    if (!this.root) {\n      throw new Error(\"Sigstore root is undefined\");\n    }\n\n    const cert = bundle.verificationMaterial.certificate ||\n      bundle.verificationMaterial.x509CertificateChain?.certificates[0];\n\n    if (!cert) {\n      throw new Error(\"No certificate found in bundle\");\n    }\n\n    const signingCert = X509Certificate.parse(base64ToUint8Array(cert.rawBytes));\n\n    // Handle both regular bundles (messageSignature) and DSSE bundles (dsseEnvelope)\n    let signature: Uint8Array;\n    if (bundle.messageSignature) {\n      signature = base64ToUint8Array(bundle.messageSignature.signature);\n    } else if (bundle.dsseEnvelope) {\n      if (!bundle.dsseEnvelope.signatures || bundle.dsseEnvelope.signatures.length === 0) {\n        throw new Error(\"DSSE envelope has no signatures\");\n      }\n      signature = base64ToUint8Array(bundle.dsseEnvelope.signatures[0].sig);\n    } else {\n      throw new Error(\"Bundle does not contain a message signature or DSSE envelope\");\n    }\n\n    // # 1 Basic stuff\n    if (signingCert.subjectAltName !== identity) {\n      throw new Error(\n        \"Certificate identity (subjectAltName) do not match the verifying one.\",\n      );\n    }\n\n    // Check for issuer - try V2 first, fall back to V1 (like sigstore-js does)\n    const certIssuer = signingCert.extFulcioIssuerV2?.issuer || signingCert.extFulcioIssuerV1?.issuer;\n    if (certIssuer !== issuer) {\n      throw new Error(\"Identity issuer is not the verifying one.\");\n    }\n\n    // # 2 Certificate validity - verify chain to trusted CA\n    // Similar to sigstore-js key/index.ts:59-64 which calls verifyCertificateChain()\n    // Returns the verified certificate path [leaf, intermediate(s), root]\n    const certPath = await this.verifyCertificateChain(\n      signingCert.notBefore,\n      signingCert,\n      this.root.certificateAuthorities\n    );\n\n    // # 3 To verify the SCT we need to build a preCert (because the cert was logged without the SCT)\n    // https://github.com/sigstore/sigstore-js/packages/verify/src/key/sct.ts#L45\n    // Similar to sigstore-js key/index.ts:67 which uses path[0] (leaf) and path[1] (issuer)\n    // for SCT verification. Handle edge case where path has only one cert (self-signed root).\n    const issuerCert = certPath.length > 1 ? certPath[1] : certPath[0];\n    const verifiedSCTs = await this.verifySCT(signingCert, issuerCert, this.root.ctlogs);\n    if (verifiedSCTs.length < this.options.ctlogThreshold) {\n      throw new Error(\n        `Not enough valid SCTs: found ${verifiedSCTs.length}, required ${this.options.ctlogThreshold}`\n      );\n    }\n\n    // # 4 Rekor inclusion promise\n    if (\n      !(await this.verifyInclusionPromise(signingCert, bundle, this.root.rekor))\n    ) {\n      throw new Error(\"Inclusion promise validation failed.\");\n    }\n\n    // # 5 Rekor inclusion proof (Merkle tree verification)\n    await this.verifyInclusionProof(bundle);\n\n    // # 5.1 Rekor body verification - verify ALL entries (matches sigstore-js verifier.ts:147)\n    for (const entry of bundle.verificationMaterial.tlogEntries) {\n      await verifyTLogBody(entry, bundle);\n    }\n\n    // # 6 TSA Timestamp Verification\n    // Verify all timestamps and enforce threshold\n    // Reference: https://github.com/sigstore/sigstore-js/blob/main/packages/verify/src/verifier.ts#L101-L106\n    const verifiedTimestamps = await verifyBundleTimestamp(\n      bundle.verificationMaterial.timestampVerificationData,\n      signature,\n      this.rawRoot?.timestampAuthorities || []\n    );\n\n    if (verifiedTimestamps.length < this.options.tsaThreshold) {\n      throw new Error(\n        `Not enough verified TSA timestamps: ${verifiedTimestamps.length} < ${this.options.tsaThreshold}`\n      );\n    }\n\n    // If we have verified timestamps, check certificate validity at each timestamp time\n    for (const verifiedTimestamp of verifiedTimestamps) {\n      if (!signingCert.validForDate(verifiedTimestamp)) {\n        throw new Error(\n          \"Certificate was not valid at the time of timestamping\"\n        );\n      }\n    }\n\n    // # 7 Revocation *skipping* not really a thing (unsurprisingly)\n\n    // # 8 verify the signed data\n    if (bundle.dsseEnvelope) {\n      // For DSSE bundles, verify the signature over the PAE\n      const payloadBytes = base64ToUint8Array(bundle.dsseEnvelope.payload);\n      const payload = JSON.parse(Uint8ArrayToString(payloadBytes));\n\n      // Verify the artifact digest matches a subject in the in-toto statement\n      if (!payload.subject || payload.subject.length === 0) {\n        throw new Error(\"DSSE payload has no subject\");\n      }\n\n      // Compute or extract the artifact digest\n      let artifactDigest: string;\n      if (isDigestOnly) {\n        // data is already the digest bytes\n        artifactDigest = Uint8ArrayToHex(data);\n      } else {\n        // data is the file content, compute the digest\n        artifactDigest = Uint8ArrayToHex(\n          new Uint8Array(await crypto.subtle.digest(HashAlgorithms.SHA256, data as Uint8Array<ArrayBuffer>))\n        );\n      }\n\n      // Find matching subject by scanning all subjects (not just [0])\n      let matchedSubject = null;\n      for (const subject of payload.subject) {\n        const subjectDigest = subject.digest?.[\"sha256\"];\n        if (subjectDigest && artifactDigest === subjectDigest.toLowerCase()) {\n          matchedSubject = subject;\n          break;\n        }\n      }\n\n      if (!matchedSubject) {\n        throw new Error(\n          `Artifact digest ${artifactDigest} does not match any subject in DSSE payload`\n        );\n      }\n\n      // Create PAE (Pre-Authentication Encoding) for signature verification\n      const pae = preAuthEncoding(bundle.dsseEnvelope.payloadType, payloadBytes);\n\n      const publicKey = await signingCert.publicKeyObj;\n      const verified = await verifySignature(publicKey, pae, signature);\n      if (!verified) {\n        throw new Error(\"DSSE signature verification failed\");\n      }\n    } else {\n      const publicKey = await signingCert.publicKeyObj;\n\n      if (isDigestOnly) {\n        // For hashedrekord bundles, verify signature over the digest directly.\n        // Uses the same elliptic.js workaround as sigstore-js conformance CLI.\n        const verified = await verifySignatureOverDigest(publicKey, data, signature);\n        if (!verified) {\n          throw new Error(\"Error verifying signature over digest\");\n        }\n      } else {\n        // For regular bundles, verify the signature over the artifact data\n        const verified = await verifySignature(publicKey, data, signature);\n        if (!verified) {\n          const keyAlg = publicKey.algorithm.name || 'unknown';\n          throw new Error(`Error verifying artifact signature. Key algorithm: ${keyAlg}, Data length: ${data.length}, Signature length: ${signature.length}`);\n        }\n      }\n    }\n\n    return true;\n  }\n}\n","/*\nCopyright 2023 The Sigstore Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n/**\n * Base class for all verification errors\n * Provides structured error handling with error codes\n */\nexport class VerificationError extends Error {\n  constructor(public code: string, message: string) {\n    super(message);\n    this.name = 'VerificationError';\n    Object.setPrototypeOf(this, VerificationError.prototype);\n  }\n}\n\n/**\n * Error thrown when timestamp verification fails\n */\nexport class TimestampError extends VerificationError {\n  constructor(message: string) {\n    super('TIMESTAMP_ERROR', message);\n    this.name = 'TimestampError';\n    Object.setPrototypeOf(this, TimestampError.prototype);\n  }\n}\n\n/**\n * Error thrown when certificate verification fails\n */\nexport class CertificateError extends VerificationError {\n  constructor(message: string) {\n    super('CERTIFICATE_ERROR', message);\n    this.name = 'CertificateError';\n    Object.setPrototypeOf(this, CertificateError.prototype);\n  }\n}\n\n/**\n * Error thrown when transparency log verification fails\n */\nexport class TLogError extends VerificationError {\n  constructor(message: string) {\n    super('TLOG_ERROR', message);\n    this.name = 'TLogError';\n    Object.setPrototypeOf(this, TLogError.prototype);\n  }\n}\n\n/**\n * Error thrown when signature verification fails\n */\nexport class SignatureError extends VerificationError {\n  constructor(message: string) {\n    super('SIGNATURE_ERROR', message);\n    this.name = 'SignatureError';\n    Object.setPrototypeOf(this, SignatureError.prototype);\n  }\n}\n\n/**\n * Error thrown when policy verification fails\n */\nexport class PolicyError extends VerificationError {\n  constructor(message: string) {\n    super('POLICY_ERROR', message);\n    this.name = 'PolicyError';\n    Object.setPrototypeOf(this, PolicyError.prototype);\n  }\n}\n","/**\n * Adapted from sigstore-python sigstore/verify/policy.py\n *\n * This module provides policy verification for checking certificate identity claims.\n * Each policy class verifies a specific X.509 extension value against an expected value.\n *\n * There are two types of extension formats:\n * - V1 extensions: Raw OCTET STRING containing the value directly\n * - V2 extensions: DER-encoded UTF8String (RFC 5280 compliant)\n *\n * Policies can be combined using:\n * - AllOf: All child policies must pass (logical AND)\n * - AnyOf: At least one child policy must pass (logical OR)\n * - Identity: Verifies SAN with optional issuer check\n */\n\nimport { PolicyError } from \"./errors.js\";\nimport {\n  X509Certificate,\n  EXTENSION_OID_FULCIO_ISSUER_V1,\n  EXTENSION_OID_GITHUB_WORKFLOW_TRIGGER,\n  EXTENSION_OID_GITHUB_WORKFLOW_SHA,\n  EXTENSION_OID_GITHUB_WORKFLOW_NAME,\n  EXTENSION_OID_GITHUB_WORKFLOW_REPOSITORY,\n  EXTENSION_OID_GITHUB_WORKFLOW_REF,\n  EXTENSION_OID_OTHERNAME,\n  EXTENSION_OID_FULCIO_ISSUER_V2,\n  EXTENSION_OID_BUILD_SIGNER_URI,\n  EXTENSION_OID_BUILD_SIGNER_DIGEST,\n  EXTENSION_OID_RUNNER_ENVIRONMENT,\n  EXTENSION_OID_SOURCE_REPOSITORY_URI,\n  EXTENSION_OID_SOURCE_REPOSITORY_DIGEST,\n  EXTENSION_OID_SOURCE_REPOSITORY_REF,\n  EXTENSION_OID_SOURCE_REPOSITORY_IDENTIFIER,\n  EXTENSION_OID_SOURCE_REPOSITORY_OWNER_URI,\n  EXTENSION_OID_SOURCE_REPOSITORY_OWNER_IDENTIFIER,\n  EXTENSION_OID_BUILD_CONFIG_URI,\n  EXTENSION_OID_BUILD_CONFIG_DIGEST,\n  EXTENSION_OID_BUILD_TRIGGER,\n  EXTENSION_OID_RUN_INVOCATION_URI,\n  EXTENSION_OID_SOURCE_REPOSITORY_VISIBILITY,\n} from \"./x509/cert.js\";\n\n// Standard GitHub Actions OIDC issuer\n// https://docs.github.com/en/actions/security-for-github-actions/security-hardening-your-deployments/about-security-hardening-with-openid-connect\nexport const GITHUB_OIDC_ISSUER = \"https://token.actions.githubusercontent.com\";\n\n/**\n * Interface that all verification policies conform to.\n */\nexport interface VerificationPolicy {\n  verify(cert: X509Certificate): void;\n}\n\n/**\n * Base class for V1 extension policies (raw OCTET STRING value).\n */\nabstract class SingleX509ExtPolicyV1 implements VerificationPolicy {\n  abstract readonly oid: string;\n  abstract readonly name: string;\n  protected readonly expectedValue: string;\n\n  constructor(value: string) {\n    this.expectedValue = value;\n  }\n\n  protected abstract getExtensionValue(cert: X509Certificate): string | undefined;\n\n  verify(cert: X509Certificate): void {\n    const extValue = this.getExtensionValue(cert);\n    if (extValue === undefined) {\n      throw new PolicyError(\n        `Certificate does not contain ${this.name} (${this.oid}) extension`\n      );\n    }\n    if (extValue !== this.expectedValue) {\n      throw new PolicyError(\n        `Certificate's ${this.name} does not match ` +\n        `(got '${extValue}', expected '${this.expectedValue}')`\n      );\n    }\n  }\n}\n\n/**\n * Base class for V2 extension policies (DER-encoded UTF8String).\n * Uses the same verify logic as V1 since our extension classes handle the parsing.\n */\nabstract class SingleX509ExtPolicyV2 extends SingleX509ExtPolicyV1 {}\n\n// ============================================================================\n// V1 Extension Policies (OID 1.3.6.1.4.1.57264.1.1 - 1.3.6.1.4.1.57264.1.6)\n// ============================================================================\n\n/**\n * Verifies the certificate's OIDC issuer (V1 format).\n * OID: 1.3.6.1.4.1.57264.1.1\n */\nexport class OIDCIssuer extends SingleX509ExtPolicyV1 {\n  readonly oid = EXTENSION_OID_FULCIO_ISSUER_V1;\n  readonly name = \"OIDCIssuer\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extFulcioIssuerV1?.issuer;\n  }\n}\n\n/**\n * Verifies the certificate's GitHub Actions workflow trigger.\n * OID: 1.3.6.1.4.1.57264.1.2\n */\nexport class GitHubWorkflowTrigger extends SingleX509ExtPolicyV1 {\n  readonly oid = EXTENSION_OID_GITHUB_WORKFLOW_TRIGGER;\n  readonly name = \"GitHubWorkflowTrigger\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extGitHubWorkflowTrigger?.workflowTrigger;\n  }\n}\n\n/**\n * Verifies the certificate's GitHub Actions workflow commit SHA.\n * OID: 1.3.6.1.4.1.57264.1.3\n */\nexport class GitHubWorkflowSHA extends SingleX509ExtPolicyV1 {\n  readonly oid = EXTENSION_OID_GITHUB_WORKFLOW_SHA;\n  readonly name = \"GitHubWorkflowSHA\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extGitHubWorkflowSHA?.workflowSHA;\n  }\n}\n\n/**\n * Verifies the certificate's GitHub Actions workflow name.\n * OID: 1.3.6.1.4.1.57264.1.4\n */\nexport class GitHubWorkflowName extends SingleX509ExtPolicyV1 {\n  readonly oid = EXTENSION_OID_GITHUB_WORKFLOW_NAME;\n  readonly name = \"GitHubWorkflowName\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extGitHubWorkflowName?.workflowName;\n  }\n}\n\n/**\n * Verifies the certificate's GitHub Actions workflow repository.\n * OID: 1.3.6.1.4.1.57264.1.5\n */\nexport class GitHubWorkflowRepository extends SingleX509ExtPolicyV1 {\n  readonly oid = EXTENSION_OID_GITHUB_WORKFLOW_REPOSITORY;\n  readonly name = \"GitHubWorkflowRepository\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extGitHubWorkflowRepository?.workflowRepository;\n  }\n}\n\n/**\n * Verifies the certificate's GitHub Actions workflow ref.\n * OID: 1.3.6.1.4.1.57264.1.6\n */\nexport class GitHubWorkflowRef extends SingleX509ExtPolicyV1 {\n  readonly oid = EXTENSION_OID_GITHUB_WORKFLOW_REF;\n  readonly name = \"GitHubWorkflowRef\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extGitHubWorkflowRef?.workflowRef;\n  }\n}\n\n// ============================================================================\n// V2 Extension Policies (OID 1.3.6.1.4.1.57264.1.8 - 1.3.6.1.4.1.57264.1.22)\n// ============================================================================\n\n/**\n * Verifies the certificate's OIDC issuer (V2 format, DER-encoded).\n * OID: 1.3.6.1.4.1.57264.1.8\n */\nexport class OIDCIssuerV2 extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_FULCIO_ISSUER_V2;\n  readonly name = \"OIDCIssuerV2\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extFulcioIssuerV2?.issuer;\n  }\n}\n\n/**\n * Verifies the certificate's Build Signer URI.\n * OID: 1.3.6.1.4.1.57264.1.9\n */\nexport class OIDCBuildSignerURI extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_BUILD_SIGNER_URI;\n  readonly name = \"OIDCBuildSignerURI\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extBuildSignerURI?.buildSignerURI;\n  }\n}\n\n/**\n * Verifies the certificate's Build Signer Digest.\n * OID: 1.3.6.1.4.1.57264.1.10\n */\nexport class OIDCBuildSignerDigest extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_BUILD_SIGNER_DIGEST;\n  readonly name = \"OIDCBuildSignerDigest\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extBuildSignerDigest?.buildSignerDigest;\n  }\n}\n\n/**\n * Verifies the certificate's Runner Environment.\n * OID: 1.3.6.1.4.1.57264.1.11\n */\nexport class OIDCRunnerEnvironment extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_RUNNER_ENVIRONMENT;\n  readonly name = \"OIDCRunnerEnvironment\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extRunnerEnvironment?.runnerEnvironment;\n  }\n}\n\n/**\n * Verifies the certificate's Source Repository URI.\n * OID: 1.3.6.1.4.1.57264.1.12\n */\nexport class OIDCSourceRepositoryURI extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_SOURCE_REPOSITORY_URI;\n  readonly name = \"OIDCSourceRepositoryURI\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extSourceRepositoryURI?.sourceRepositoryURI;\n  }\n}\n\n/**\n * Verifies the certificate's Source Repository Digest.\n * OID: 1.3.6.1.4.1.57264.1.13\n */\nexport class OIDCSourceRepositoryDigest extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_SOURCE_REPOSITORY_DIGEST;\n  readonly name = \"OIDCSourceRepositoryDigest\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extSourceRepositoryDigest?.sourceRepositoryDigest;\n  }\n}\n\n/**\n * Verifies the certificate's Source Repository Ref.\n * OID: 1.3.6.1.4.1.57264.1.14\n */\nexport class OIDCSourceRepositoryRef extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_SOURCE_REPOSITORY_REF;\n  readonly name = \"OIDCSourceRepositoryRef\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extSourceRepositoryRef?.sourceRepositoryRef;\n  }\n}\n\n/**\n * Verifies the certificate's Source Repository Identifier.\n * OID: 1.3.6.1.4.1.57264.1.15\n */\nexport class OIDCSourceRepositoryIdentifier extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_SOURCE_REPOSITORY_IDENTIFIER;\n  readonly name = \"OIDCSourceRepositoryIdentifier\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extSourceRepositoryIdentifier?.sourceRepositoryIdentifier;\n  }\n}\n\n/**\n * Verifies the certificate's Source Repository Owner URI.\n * OID: 1.3.6.1.4.1.57264.1.16\n */\nexport class OIDCSourceRepositoryOwnerURI extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_SOURCE_REPOSITORY_OWNER_URI;\n  readonly name = \"OIDCSourceRepositoryOwnerURI\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extSourceRepositoryOwnerURI?.sourceRepositoryOwnerURI;\n  }\n}\n\n/**\n * Verifies the certificate's Source Repository Owner Identifier.\n * OID: 1.3.6.1.4.1.57264.1.17\n */\nexport class OIDCSourceRepositoryOwnerIdentifier extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_SOURCE_REPOSITORY_OWNER_IDENTIFIER;\n  readonly name = \"OIDCSourceRepositoryOwnerIdentifier\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extSourceRepositoryOwnerIdentifier?.sourceRepositoryOwnerIdentifier;\n  }\n}\n\n/**\n * Verifies the certificate's Build Config URI.\n * OID: 1.3.6.1.4.1.57264.1.18\n */\nexport class OIDCBuildConfigURI extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_BUILD_CONFIG_URI;\n  readonly name = \"OIDCBuildConfigURI\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extBuildConfigURI?.buildConfigURI;\n  }\n}\n\n/**\n * Verifies the certificate's Build Config Digest.\n * OID: 1.3.6.1.4.1.57264.1.19\n */\nexport class OIDCBuildConfigDigest extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_BUILD_CONFIG_DIGEST;\n  readonly name = \"OIDCBuildConfigDigest\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extBuildConfigDigest?.buildConfigDigest;\n  }\n}\n\n/**\n * Verifies the certificate's Build Trigger.\n * OID: 1.3.6.1.4.1.57264.1.20\n */\nexport class OIDCBuildTrigger extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_BUILD_TRIGGER;\n  readonly name = \"OIDCBuildTrigger\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extBuildTrigger?.buildTrigger;\n  }\n}\n\n/**\n * Verifies the certificate's Run Invocation URI.\n * OID: 1.3.6.1.4.1.57264.1.21\n */\nexport class OIDCRunInvocationURI extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_RUN_INVOCATION_URI;\n  readonly name = \"OIDCRunInvocationURI\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extRunInvocationURI?.runInvocationURI;\n  }\n}\n\n/**\n * Verifies the certificate's Source Repository Visibility at signing.\n * OID: 1.3.6.1.4.1.57264.1.22\n */\nexport class OIDCSourceRepositoryVisibility extends SingleX509ExtPolicyV2 {\n  readonly oid = EXTENSION_OID_SOURCE_REPOSITORY_VISIBILITY;\n  readonly name = \"OIDCSourceRepositoryVisibility\";\n\n  protected getExtensionValue(cert: X509Certificate): string | undefined {\n    return cert.extSourceRepositoryVisibility?.sourceRepositoryVisibility;\n  }\n}\n\n// ============================================================================\n// Policy Combinators\n// ============================================================================\n\n/**\n * The \"any of\" policy, corresponding to a logical OR between child policies.\n * An empty list of child policies is considered trivially invalid.\n */\nexport class AnyOf implements VerificationPolicy {\n  private children: VerificationPolicy[];\n\n  constructor(children: VerificationPolicy[]) {\n    this.children = children;\n  }\n\n  verify(cert: X509Certificate): void {\n    for (const child of this.children) {\n      try {\n        child.verify(cert);\n        return;\n      } catch {\n        // Continue to next policy\n      }\n    }\n    throw new PolicyError(`0 of ${this.children.length} policies succeeded`);\n  }\n}\n\n/**\n * The \"all of\" policy, corresponding to a logical AND between child policies.\n * An empty list of child policies is considered trivially invalid.\n */\nexport class AllOf implements VerificationPolicy {\n  private children: VerificationPolicy[];\n\n  constructor(children: VerificationPolicy[]) {\n    this.children = children;\n  }\n\n  verify(cert: X509Certificate): void {\n    if (this.children.length < 1) {\n      throw new PolicyError(\"no child policies to verify\");\n    }\n    for (const child of this.children) {\n      child.verify(cert);\n    }\n  }\n}\n\n// ============================================================================\n// Identity Policy\n// ============================================================================\n\n/**\n * Verifies the certificate's \"identity\", corresponding to the X.509v3 SAN.\n *\n * Identities can be verified modulo an OIDC issuer, to prevent an unexpected\n * issuer from offering a particular identity.\n *\n * Supported SAN types include emails, URIs, and Sigstore-specific \"other names\".\n */\nexport class Identity implements VerificationPolicy {\n  private identity: string;\n  private issuerPolicy: OIDCIssuer | null;\n\n  constructor(options: { identity: string; issuer?: string }) {\n    this.identity = options.identity;\n    this.issuerPolicy = options.issuer ? new OIDCIssuer(options.issuer) : null;\n  }\n\n  verify(cert: X509Certificate): void {\n    if (this.issuerPolicy) {\n      this.issuerPolicy.verify(cert);\n    }\n\n    const sanExt = cert.extSubjectAltName;\n    if (!sanExt) {\n      throw new PolicyError(\"Certificate does not contain SubjectAlternativeName extension\");\n    }\n\n    const allSans = new Set<string>();\n\n    // Add email (rfc822Name)\n    if (sanExt.rfc822Name) {\n      allSans.add(sanExt.rfc822Name);\n    }\n\n    // Add URI\n    if (sanExt.uri) {\n      allSans.add(sanExt.uri);\n    }\n\n    // Add Sigstore-specific otherName\n    const otherName = sanExt.otherName(EXTENSION_OID_OTHERNAME);\n    if (otherName) {\n      allSans.add(otherName);\n    }\n\n    if (!allSans.has(this.identity)) {\n      throw new PolicyError(\n        `Certificate's SANs do not match ${this.identity}; actual SANs: ${Array.from(allSans).join(\", \")}`\n      );\n    }\n  }\n}\n"],"names":["ASN1ParseError","ASN1TypeError","UNIVERSAL_TAG","TAG_CLASS","ASN1Tag","enc","num","res","decodeLength","stream","buf","byteCount","len","i","encodeLength","val","bytes","base64ToUint8Array","base64","binaryString","length","base64UrlToUint8Array","base64url","Uint8ArrayToBase64","uint8Array","hexToUint8Array","hex","Uint8ArrayToHex","data","hexString","stringToUint8Array","str","Uint8ArrayToString","readBigInt64BE","offset","base64Decode","uint8ArrayEqual","a","b","result","RE_TIME_SHORT_YEAR","RE_TIME_LONG_YEAR","parseInteger","pos","end","neg","pad","n","parseStringASCII","parseTime","shortYear","timeStr","m","year","parseOID","first","second","oid","parseBoolean","parseBitString","unused","start","bits","byte","skip","j","StreamError","ByteStream","buffer","position","char","value","view","size","block","blockSize","newView","ASN1Obj","tag","subs","parseStream","valueStream","sub","obj","collectSubs","PEM_HEADER","PEM_FOOTER","toDER","certificate","der","line","COMMA","COLON","LEFT_SQUARE_BRACKET","RIGHT_SQUARE_BRACKET","LEFT_CURLY_BRACKET","RIGHT_CURLY_BRACKET","canonicalizeString","string","canonicalize","object","element","property","KeyTypes","EcdsaTypes","HashAlgorithms","RsaAlgorithms","RsaSchemes","crypto","isBytes","anumber","abytes","lengths","ahash","h","aexists","instance","checkFinished","aoutput","out","min","clean","arrays","createView","arr","rotr","word","shift","hasHexBuiltin","hexes","_","bytesToHex","asciis","asciiToBase16","ch","hexToBytes","hl","al","array","ai","hi","n1","n2","utf8ToBytes","toBytes","concatBytes","sum","Hash","createHasher","hashCons","hashC","msg","tmp","randomBytes","bytesLength","setBigUint64","byteOffset","isLE","_32n","_u32_max","wh","wl","Chi","c","Maj","HashMD","blockLen","outputLen","padOffset","take","dataView","oview","outLen","state","to","finished","destroyed","SHA256_IV","SHA384_IV","SHA512_IV","U32_MASK64","fromBig","le","split","lst","Ah","Al","l","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","add","Bh","Bl","add3L","Cl","add3H","low","Ch","add4L","Dl","add4H","Dh","add5L","El","add5H","Eh","SHA256_K","SHA256_W","SHA256","A","B","C","D","E","F","G","H","W15","W2","s0","s1","sigma1","T1","T2","K512","u64.split","SHA512_Kh","SHA512_Kl","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","u64.rotrSH","u64.shrSH","s0l","u64.rotrSL","u64.shrSL","W2h","W2l","s1h","u64.rotrBH","s1l","u64.rotrBL","SUMl","u64.add4L","SUMh","u64.add4H","sigma1h","sigma1l","CHIh","CHIl","T1ll","u64.add5L","T1h","u64.add5H","T1l","sigma0h","sigma0l","MAJh","MAJl","u64.add","All","u64.add3L","u64.add3H","SHA384","sha256","sha512","sha384","HMAC","hash","_key","key","oHash","iHash","hmac","message","_0n","_1n","_abool2","title","prefix","_abytes2","isBytes_","needsLen","ofLen","got","numberToHexUnpadded","hexToNumber","bytesToNumberBE","bytesToHex_","bytesToNumberLE","abytes_","numberToBytesBE","hexToBytes_","numberToBytesLE","ensureBytes","expectedLength","e","isPosBig","inRange","max","aInRange","bitLen","bitMask","createHmacDrbg","hashLen","qByteLen","hmacFn","u8n","u8of","v","k","reset","reseed","seed","gen","sl","concatBytes_","pred","_validateObject","fields","optFields","checkField","fieldName","expectedType","isOpt","current","memoized","fn","map","arg","args","computed","_2n","_3n","_4n","_5n","_7n","_8n","_9n","_16n","mod","invert","number","modulo","x","u","q","r","assertIsSquare","Fp","root","sqrt3mod4","p1div4","sqrt5mod8","p5div8","nv","sqrt9mod16","P","Fp_","Field","tn","tonelliShanks","c1","c2","c3","c4","tv1","tv2","tv3","tv4","e1","e2","e3","Q","S","Z","_Fp","FpLegendre","cc","Q1div2","M","t","R","t_tmp","exponent","FpSqrt","FIELD_FIELDS","validateField","field","initial","opts","FpPow","power","p","d","FpInvertBatch","nums","passZero","inverted","multipliedAcc","acc","invertedAcc","p1mod2","powered","yes","zero","no","nLength","nBitLength","_nBitLength","nByteLength","ORDER","bitLenOrOpts","_nbitLength","_sqrt","modFromBytes","allowedLengths","_opts","BITS","BYTES","sqrtP","f","lhs","rhs","skipValidation","padded","scalar","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","mapHashToField","fieldLen","minLen","reduced","negateCt","condition","item","normalizeZ","points","invertedZs","validateW","W","calcWOpts","scalarBits","windows","windowSize","maxNumber","mask","shiftBy","calcOffsets","window","wOpts","wbits","nextN","offsetStart","isZero","isNeg","isNegF","validateMSMPoints","validateMSMScalars","scalars","pointPrecomputes","pointWindowSizes","getW","assert0","wNAF","Point","elm","point","base","precomputes","wo","offsetF","transform","comp","prev","mulEndoUnsafe","k1","k2","p1","p2","pippenger","fieldN","plength","slength","MASK","buckets","lastBits","resI","sumI","createField","order","_createCurveFields","type","CURVE","curveOpts","FpFnLE","Fn","params","divNearest","den","_splitEndoScalar","basis","a1","b1","a2","b2","k1neg","k2neg","MAX_NUM","validateSigFormat","format","validateSigOpts","def","optsn","optName","abool","DERErr","DER","dataLen","lenLen","isLong","lengthBytes","int","tlv","seqBytes","seqLeftBytes","rBytes","rLeftBytes","sBytes","sLeftBytes","sig","rs","ss","seq","_normFnElement","expected","weierstrassN","extraOpts","validated","cofactor","CURVE_ORDER","endo","getWLengths","assertCompressionIsSupported","pointToBytes","_c","isCompressed","bx","hasEvenY","pprefix","pointFromBytes","uncomp","head","tail","y2","weierstrassEquation","y","sqrtError","err","isYOdd","L","isValidXY","encodePoint","decodePoint","x2","x3","left","right","_4a3","_27b2","acoord","banZero","aprjpoint","other","splitEndoScalarN","toAffineMemo","iz","X","Y","is0","zz","assertValidMemo","finishEndo","endoBeta","k1p","k2p","isLazy","wnaf","X1","Y1","Z1","X2","Y2","Z2","U1","U2","b3","X3","Y3","Z3","t0","t1","t2","t3","t4","t5","fake","mul","k1f","k2f","sc","invertedZ","isTorsionFree","clearCofactor","privateKey","ecdh","ecdhOpts","randomBytes_","randomBytesWeb","isValidSecretKey","secretKey","isValidPublicKey","publicKey","publicKeyUncompressed","randomSecretKey","getPublicKey","keygen","isProbPub","getSharedSecret","secretKeyA","publicKeyB","s","ecdsa","ecdsaOpts","msgs","nobleHmac","fnBits","utils","defaultSigOpts","defaultSigOpts_format","isBiggerThanHalfOrder","HALF","validateRS","validateSigLength","sizer","Signature","recovery","recid","messageHash","FIELD_ORDER","rec","radj","ir","bits2int_modN","u1","u2","bits2int","delta","ORDER_MASK","int2octets","validateMsgAndHash","prehash","prepSig","lowS","extraEntropy","h1int","seedArgs","k2sig","kBytes","ik","normS","sign","tryParsingSig","sg","isHex","isObj","derError","verify","signature","is","recoverPublicKey","_weierstrass_legacy_opts_to_new","_ecdsa_legacy_opts_to_new","_ecdsa_new_output_to_legacy","_ecdsa","weierstrass","signs","createCurve","curveDef","defHash","create","p256_CURVE","p384_CURVE","p521_CURVE","Fp256","Fp384","Fp521","p256","p384","p521","pkcs1ToSpki","pkcs1Bytes","algorithmIdentifier","bitStringLength","totalContentLength","totalLengthBytes","bitStringLengthBytes","importKey","keytype","scheme","importParams","keyBytes","hashName","normalizedScheme","verifySignature","signed","options","namedCurve","sig_size","raw_signature","asn1_sig","binr","bins","hashAlg","saltLength","verifySignatureOverDigest","digest","curve","jwk","SigstoreRoots","SUPPORTED_HASH_ALGORITHMS","getHashAlgorithm","algorithm","ECDSA_SIGNATURE_ALGOS","RSA_SIGNATURE_ALGOS","OID_RSASSA_PSS","SHA2_HASH_ALGOS","DEFAULT_HASH_ALGORITHM","ECDSA_CURVE_NAMES","SignedCertificateTimestamp","preCert","version","logID","timestamp","extenstionLength","extensions","hashAlgorithm","signatureAlgorithm","sigLength","X509Extension","asn1","X509BasicConstraintsExtension","X509KeyUsageExtension","X509SubjectAlternativeNameExtension","rfc822Name","uri","otherName","otherNameValue","gn","X509AuthorityKeyIDExtension","el","X509SubjectKeyIDExtension","X509FulcioExtensionV1","X509FulcioExtensionV2","X509FulcioIssuerV1","X509GitHubWorkflowTriggerExtension","X509GitHubWorkflowSHAExtension","X509GitHubWorkflowNameExtension","X509GitHubWorkflowRepositoryExtension","X509GitHubWorkflowRefExtension","X509FulcioIssuerV2","X509BuildSignerURIExtension","X509BuildSignerDigestExtension","X509RunnerEnvironmentExtension","X509SourceRepositoryURIExtension","X509SourceRepositoryDigestExtension","X509SourceRepositoryRefExtension","X509SourceRepositoryIdentifierExtension","X509SourceRepositoryOwnerURIExtension","X509SourceRepositoryOwnerIdentifierExtension","X509BuildConfigURIExtension","X509BuildConfigDigestExtension","X509BuildTriggerExtension","X509RunInvocationURIExtension","X509SourceRepositoryVisibilityExtension","X509SCTExtension","sctList","sctLength","sct","EXTENSION_OID_SUBJECT_KEY_ID","EXTENSION_OID_KEY_USAGE","EXTENSION_OID_SUBJECT_ALT_NAME","EXTENSION_OID_BASIC_CONSTRAINTS","EXTENSION_OID_AUTHORITY_KEY_ID","EXTENSION_OID_SCT","EXTENSION_OID_FULCIO_ISSUER_V1","EXTENSION_OID_GITHUB_WORKFLOW_TRIGGER","EXTENSION_OID_GITHUB_WORKFLOW_SHA","EXTENSION_OID_GITHUB_WORKFLOW_NAME","EXTENSION_OID_GITHUB_WORKFLOW_REPOSITORY","EXTENSION_OID_GITHUB_WORKFLOW_REF","EXTENSION_OID_OTHERNAME","EXTENSION_OID_FULCIO_ISSUER_V2","EXTENSION_OID_BUILD_SIGNER_URI","EXTENSION_OID_BUILD_SIGNER_DIGEST","EXTENSION_OID_RUNNER_ENVIRONMENT","EXTENSION_OID_SOURCE_REPOSITORY_URI","EXTENSION_OID_SOURCE_REPOSITORY_DIGEST","EXTENSION_OID_SOURCE_REPOSITORY_REF","EXTENSION_OID_SOURCE_REPOSITORY_IDENTIFIER","EXTENSION_OID_SOURCE_REPOSITORY_OWNER_URI","EXTENSION_OID_SOURCE_REPOSITORY_OWNER_IDENTIFIER","EXTENSION_OID_BUILD_CONFIG_URI","EXTENSION_OID_BUILD_CONFIG_DIGEST","EXTENSION_OID_BUILD_TRIGGER","EXTENSION_OID_RUN_INVOCATION_URI","EXTENSION_OID_SOURCE_REPOSITORY_VISIBILITY","X509Certificate","cert","usePss","spki","algorithmOID","isRsaKey","curveOID","hashAlgWrapper","hashAlgSeq","hashOid","ext","ca","issuerCertificate","sigAlgOID","isRsaPss","publicKeyObj","date","clone","CertificateChainVerifier","dedupeCertificates","certificatePath","leafCert","paths","path","curr","issuers","issuer","subPaths","keyIdentifier","possibleIssuer","verifiedIssuers","pathLength","certs","PAE_PREFIX","preAuthEncoding","payloadType","payload","prefixBuffer","combinedArray","RFC6962_LEAF_HASH_PREFIX","RFC6962_NODE_HASH_PREFIX","verifyMerkleInclusion","entry","inclusionProof","logIndex","treeSize","inner","border","decompInclProof","innerHashes","borderHashes","leafHash","hashLeaf","calculatedHash","chainBorderRight","chainInner","rootHash","index","innerProofSize","onesCount","hashes","hashChildren","leaf","CHECKPOINT_SEPARATOR","SIGNATURE_REGEX","SignedNote","note","signatures","envelope","header","matches","match","name","sigBytes","LogCheckpoint","origin","logSize","logHash","rest","lines","verifyCheckpoint","tlogs","entryLogId","matchingTLogs","tlog","tlogId","validTLogs","filterTLogsByDate","signedNote","checkpoint","verifySignedNote","hasValidSignature","logId","importTLogKey","targetDate","keyDetails","keyType","verifyHashedRekordBody","bundle","hashedRekordEntry","verifyHashedRekordV001Body","verifyHashedRekordV002Body","spec","tlogSig","tlogSigBytes","bundleSigBytes","tlogDigest","tlogDigestBytes","bundleDigestBytes","verifyDSSEBody","dsseEntry","verifyDSSE001Body","verifyDSSE002Body","tlogHashBytes","payloadBytes","bundleHashBytes","verifyIntotoBody","intotoEntry","tlogEnvelope","tlogSigBase64","tlogSigDecoded","verifyTLogBody","rekorEntry","parseCanonicalBody","kind","decodedBody","error","RFC3161TimestampVerificationError","TSTInfo","algo","hashAlgName","OID_PKCS9_CONTENT_TYPE_SIGNED_DATA","OID_PKCS9_CONTENT_TYPE_TSTINFO","OID_PKCS9_MESSAGE_DIGEST_KEY","RFC3161Timestamp","tstInfoDigest","expectedDigest","signedAttrs","sd","messageDigest","verifyRFC3161Timestamp","timestampAuthorities","signingTime","validAuthorities","filterCertAuthorities","filterCAsBySerialAndIssuer","verificationResults","verifyTimestampForCA","errors","authorities","validAt","criteria","trustedCerts","verifyBundleTimestamp","timestampData","verifiedResults","tsData","timestampBytes","DEFAULT_CONFIG","TrustedRootProvider","metadataUrl","targetBaseUrl","TUFClient","rootMetadata","tufRootBase64","decoder","rootBytes","trustedRootBuffer","trustedRootJson","trustedRoot","MEDIA_TYPE_BASE","getBundleVersion","mediaType","SigstoreVerifier","frozenTimestamp","logs","log","ctlogs","certificateAuthorities","lastError","tsas","tsa","certChain","cas","rawRoot","tufProvider","extSCT","seenLogIds","logIdHex","issuerId","tbs","verifiedSCTs","validCTLogs","rekor","entries","MAX_TLOG_ENTRIES","iLogId","jLogId","bundleVersion","keyId","integratedTime","integratedDate","bodyJson","loggedCertContent","verifier","loggedCert","pemString","verifierContent","publicKeyContent","identity","isDigestOnly","signingCert","certPath","issuerCert","verifiedTimestamps","verifiedTimestamp","artifactDigest","matchedSubject","subject","subjectDigest","pae","keyAlg","VerificationError","code","TimestampError","CertificateError","TLogError","SignatureError","PolicyError","GITHUB_OIDC_ISSUER","SingleX509ExtPolicyV1","extValue","SingleX509ExtPolicyV2","OIDCIssuer","GitHubWorkflowTrigger","GitHubWorkflowSHA","GitHubWorkflowName","GitHubWorkflowRepository","GitHubWorkflowRef","OIDCIssuerV2","OIDCBuildSignerURI","OIDCBuildSignerDigest","OIDCRunnerEnvironment","OIDCSourceRepositoryURI","OIDCSourceRepositoryDigest","OIDCSourceRepositoryRef","OIDCSourceRepositoryIdentifier","OIDCSourceRepositoryOwnerURI","OIDCSourceRepositoryOwnerIdentifier","OIDCBuildConfigURI","OIDCBuildConfigDigest","OIDCBuildTrigger","OIDCRunInvocationURI","OIDCSourceRepositoryVisibility","AnyOf","children","child","AllOf","Identity","sanExt","allSans"],"mappings":"AAiBO,MAAMA,WAAuB,MAAM;AAC1C;AACO,MAAMC,WAAsB,MAAM;AACzC;ACDA,MAAMC,KAAgB;AAAA,EAClB,SAAS;AAAA,EACT,SAAS;AAAA,EACT,YAAY;AAAA,EACZ,cAAc;AAAA,EACd,mBAAmB;AAAA,EAInB,UAAU;AAAA,EACV,kBAAkB;AACtB,GACMC,KAAY;AAAA,EACd,WAAW;AAAA,EAEX,kBAAkB;AAEtB;AACO,MAAMC,GAAQ;AAAA,EACjB,YAAYC,GAAK;AAIb,QAHA,KAAK,SAASA,IAAM,IACpB,KAAK,eAAeA,IAAM,QAAU,IACpC,KAAK,QAAQA,KAAO,GAChB,KAAK,WAAW;AAChB,YAAM,IAAIL,GAAe,8BAA8B;AAE3D,QAAI,KAAK,UAAUG,GAAU,aAAa,KAAK,WAAW;AACtD,YAAM,IAAIH,GAAe,sBAAsB;AAAA,EAEvD;AAAA,EACA,cAAc;AACV,WAAO,KAAK,UAAUG,GAAU;AAAA,EACpC;AAAA,EACA,kBAAkBG,GAAK;AACnB,UAAMC,IAAM,KAAK,UAAUJ,GAAU;AACrC,WAAOG,MAAQ,SAAYC,KAAO,KAAK,WAAWD,IAAMC;AAAA,EAC5D;AAAA,EACA,YAAY;AACR,WAAO,KAAK,YAAW,KAAM,KAAK,WAAWL,GAAc;AAAA,EAC/D;AAAA,EACA,YAAY;AACR,WAAO,KAAK,YAAW,KAAM,KAAK,WAAWA,GAAc;AAAA,EAC/D;AAAA,EACA,cAAc;AACV,WAAO,KAAK,YAAW,KAAM,KAAK,WAAWA,GAAc;AAAA,EAC/D;AAAA,EACA,gBAAgB;AACZ,WAAO,KAAK,YAAW,KAAM,KAAK,WAAWA,GAAc;AAAA,EAC/D;AAAA,EACA,QAAQ;AACJ,WAAQ,KAAK,YAAW,KAAM,KAAK,WAAWA,GAAc;AAAA,EAChE;AAAA,EACA,YAAY;AACR,WAAO,KAAK,YAAW,KAAM,KAAK,WAAWA,GAAc;AAAA,EAC/D;AAAA,EACA,oBAAoB;AAChB,WAAO,KAAK,YAAW,KAAM,KAAK,WAAWA,GAAc;AAAA,EAC/D;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,UAAU,KAAK,cAAc,KAAO,KAAS,KAAK,SAAS;AAAA,EAC3E;AACJ;AC3DO,SAASM,GAAaC,GAAQ;AACjC,QAAMC,IAAMD,EAAO,SAAQ;AAG3B,OAAKC,IAAM,SAAU;AACjB,WAAOA;AAIX,QAAMC,IAAYD,IAAM;AAExB,MAAIC,IAAY;AACZ,UAAM,IAAIX,GAAe,6BAA6B;AAG1D,MAAIY,IAAM;AACV,WAASC,IAAI,GAAGA,IAAIF,GAAWE;AAC3B,IAAAD,IAAMA,IAAM,MAAMH,EAAO,SAAQ;AAGrC,MAAIG,MAAQ;AACR,UAAM,IAAIZ,GAAe,0CAA0C;AAEvE,SAAOY;AACX;AAEO,SAASE,GAAaF,GAAK;AAC9B,MAAIA,IAAM;AACN,WAAO,IAAI,WAAW,CAACA,CAAG,CAAC;AAI/B,MAAIG,IAAM,OAAOH,CAAG;AACpB,QAAMI,IAAQ,CAAA;AACd,SAAOD,IAAM;AACT,IAAAC,EAAM,QAAQ,OAAOD,IAAM,IAAI,CAAC,GAChCA,IAAMA,KAAO;AAEjB,SAAO,IAAI,WAAW,CAAC,MAAOC,EAAM,QAAQ,GAAGA,CAAK,CAAC;AACzD;AC5DO,SAASC,EAAmBC,GAAQ;AACvC,QAAMC,IAAe,KAAKD,CAAM,GAC1BE,IAASD,EAAa,QACtBH,IAAQ,IAAI,WAAWI,CAAM;AACnC,WAASP,IAAI,GAAGA,IAAIO,GAAQP;AACxB,IAAAG,EAAMH,CAAC,IAAIM,EAAa,WAAWN,CAAC;AAExC,SAAOG;AACX;AACO,SAASK,GAAsBC,GAAW;AAC7C,MAAIJ,IAASI,EAAU,QAAQ,MAAM,GAAG,EAAE,QAAQ,MAAM,GAAG;AAC3D,SAAOJ,EAAO,SAAS,MAAM;AACzB,IAAAA,KAAU;AAEd,SAAOD,EAAmBC,CAAM;AACpC;AACO,SAASK,GAAmBC,GAAY;AAC3C,MAAIL,IAAe;AACnB,WAASN,IAAI,GAAGA,IAAIW,EAAW,QAAQX;AACnC,IAAAM,KAAgB,OAAO,aAAaK,EAAWX,CAAC,CAAC;AAErD,SAAO,KAAKM,CAAY;AAC5B;AACO,SAASM,GAAgBC,GAAK;AACjC,MAAIA,EAAI,SAAS,MAAM;AACnB,UAAM,IAAI,MAAM,qCAAqC;AAEzD,QAAMN,IAASM,EAAI,SAAS,GACtBF,IAAa,IAAI,WAAWJ,CAAM;AACxC,WAASP,IAAI,GAAGA,IAAIO,GAAQP;AACxB,IAAAW,EAAWX,CAAC,IAAI,SAASa,EAAI,MAAMb,IAAI,GAAGA,IAAI,IAAI,CAAC,GAAG,EAAE;AAE5D,SAAOW;AACX;AACO,SAASG,GAAgBC,GAAM;AAClC,MAAIC,IAAY;AAChB,WAAShB,IAAI,GAAGA,IAAIe,EAAK,QAAQf,KAAK;AAClC,QAAIa,IAAME,EAAKf,CAAC,EAAE,SAAS,EAAE;AAC7B,IAAIa,EAAI,WAAW,MACfA,IAAM,MAAMA,IAEhBG,KAAaH;AAAA,EACjB;AACA,SAAOG;AACX;AACO,SAASC,GAAmBC,GAAK;AAEpC,SADgB,IAAI,YAAW,EAChB,OAAOA,CAAG;AAC7B;AACO,SAASC,EAAmBR,GAAY;AAE3C,SADgB,IAAI,YAAY,OAAO,EACxB,OAAOA,CAAU;AACpC;AACO,SAASS,GAAeT,GAAYU,GAAQ;AAC/C,EAAIA,MAAW,WACXA,IAAS;AAEb,QAAMR,IAAMC,GAAgBH,EAAW,MAAMU,GAAQA,IAAS,CAAC,CAAC;AAChE,SAAO,OAAO,KAAKR,CAAG,EAAE;AAC5B;AAIO,SAASS,GAAaJ,GAAK;AAC9B,SAAOC,EAAmBf,EAAmBc,CAAG,CAAC;AACrD;AACO,SAASK,EAAgBC,GAAGC,GAAG;AAClC,MAAID,EAAE,eAAeC,EAAE;AACnB,WAAO;AAEX,MAAIC,IAAS;AACb,WAAS1B,IAAI,GAAGA,IAAIwB,EAAE,YAAYxB;AAC9B,IAAA0B,KAAUF,EAAExB,CAAC,IAAIyB,EAAEzB,CAAC;AAExB,SAAO0B,MAAW;AACtB;ACxDA,MAAMC,KAAqB,2DACrBC,KAAoB;AAGnB,SAASC,GAAahC,GAAK;AAC9B,MAAIiC,IAAM;AACV,QAAMC,IAAMlC,EAAI;AAChB,MAAIK,IAAML,EAAIiC,CAAG;AACjB,QAAME,IAAM9B,IAAM,KAEZ+B,IAAMD,IAAM,MAAO;AACzB,SAAO9B,KAAO+B,KAAO,EAAEH,IAAMC;AACzB,IAAA7B,IAAML,EAAIiC,CAAG;AAIjB,MADYC,IAAMD,MACN;AACR,WAAO,OAAOE,IAAM,KAAK,CAAC;AAE9B,EAAA9B,IAAM8B,IAAM9B,IAAM,MAAMA;AAExB,MAAIgC,IAAI,OAAOhC,CAAG;AAClB,WAASF,IAAI8B,IAAM,GAAG9B,IAAI+B,GAAK,EAAE/B;AAC7B,IAAAkC,IAAIA,IAAI,OAAO,GAAG,IAAI,OAAOrC,EAAIG,CAAC,CAAC;AAEvC,SAAOkC;AACX;AAGO,SAASC,GAAiBtC,GAAK;AAClC,SAAOsB,EAAmBtB,CAAG;AACjC;AAGO,SAASuC,GAAUvC,GAAKwC,GAAW;AACtC,QAAMC,IAAUH,GAAiBtC,CAAG,GAE9B0C,IAAIF,IACJV,GAAmB,KAAKW,CAAO,IAC/BV,GAAkB,KAAKU,CAAO;AACpC,MAAI,CAACC;AACD,UAAM,IAAI,MAAM,cAAc;AAGlC,MAAIF,GAAW;AACX,QAAIG,IAAO,OAAOD,EAAE,CAAC,CAAC;AACtB,IAAAC,KAAQA,KAAQ,KAAK,OAAO,KAC5BD,EAAE,CAAC,IAAIC,EAAK,SAAQ;AAAA,EACxB;AAEA,SAAO,oBAAI,KAAK,GAAGD,EAAE,CAAC,CAAC,IAAIA,EAAE,CAAC,CAAC,IAAIA,EAAE,CAAC,CAAC,IAAIA,EAAE,CAAC,CAAC,IAAIA,EAAE,CAAC,CAAC,IAAIA,EAAE,CAAC,CAAC,GAAG;AACtE;AAGO,SAASE,GAAS5C,GAAK;AAC1B,MAAIiC,IAAM;AACV,QAAMC,IAAMlC,EAAI;AAEhB,MAAI,IAAIA,EAAIiC,GAAK;AACjB,QAAMY,IAAQ,KAAK,MAAM,IAAI,EAAE,GACzBC,IAAS,IAAI;AACnB,MAAIC,IAAM,GAAGF,CAAK,IAAIC,CAAM,IAExBzC,IAAM;AACV,SAAO4B,IAAMC,GAAK,EAAED;AAChB,QAAIjC,EAAIiC,CAAG,GACX5B,KAAOA,KAAO,MAAM,IAAI,OAGnB,IAAI,SAAU,MACf0C,KAAO,IAAI1C,CAAG,IACdA,IAAM;AAGd,SAAO0C;AACX;AAGO,SAASC,GAAahD,GAAK;AAC9B,SAAOA,EAAI,CAAC,MAAM;AACtB;AAGO,SAASiD,GAAejD,GAAK;AAEhC,QAAMkD,IAASlD,EAAI,CAAC,GACdmD,IAAQ,GACRjB,IAAMlC,EAAI,QACVoD,IAAO,CAAA;AACb,WAAS,IAAID,GAAO,IAAIjB,GAAK,EAAE,GAAG;AAC9B,UAAMmB,IAAOrD,EAAI,CAAC,GAEZsD,IAAO,MAAMpB,IAAM,IAAIgB,IAAS;AAEtC,aAASK,IAAI,GAAGA,KAAKD,GAAM,EAAEC;AAEzB,MAAAH,EAAK,KAAMC,KAAQE,IAAK,CAAI;AAAA,EAEpC;AACA,SAAOH;AACX;ACrGA,MAAMI,WAAoB,MAAM;AAChC;AACO,MAAMC,GAAW;AAAA,EACpB,YAAYC,GAAQ;AAChB,SAAK,QAAQ,GACb,KAAK,OAAOA,KAAU,IAAI,WAAW,CAAC;AAAA,EAC1C;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,KAAK,SAAS,GAAG,KAAK,KAAK;AAAA,EAC3C;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,KAAK;AAAA,EACrB;AAAA,EACA,IAAI,WAAW;AACX,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,KAAKC,GAAU;AACX,SAAK,QAAQA;AAAA,EACjB;AAAA,EACA,MAAMR,GAAOjD,GAAK;AACd,UAAMgC,IAAMiB,IAAQjD;AACpB,QAAIgC,IAAM,KAAK;AACX,YAAM,IAAIsB,GAAY,4BAA4B;AAEtD,WAAO,KAAK,KAAK,SAASL,GAAOjB,CAAG;AAAA,EACxC;AAAA,EACA,WAAW0B,GAAM;AACb,SAAK,eAAe,CAAC,GACrB,KAAK,KAAK,KAAK,KAAK,IAAIA,GACxB,KAAK,SAAS;AAAA,EAClB;AAAA,EACA,aAAahE,GAAK;AACd,SAAK,eAAe,CAAC;AACrB,UAAMiE,IAAQ,IAAI,YAAY,CAACjE,CAAG,CAAC,GAC7BkE,IAAO,IAAI,WAAWD,EAAM,MAAM;AACxC,SAAK,KAAK,KAAK,KAAK,IAAIC,EAAK,CAAC,GAC9B,KAAK,KAAK,KAAK,QAAQ,CAAC,IAAIA,EAAK,CAAC,GAClC,KAAK,SAAS;AAAA,EAClB;AAAA,EACA,aAAalE,GAAK;AACd,SAAK,eAAe,CAAC;AACrB,UAAMiE,IAAQ,IAAI,YAAY,CAACjE,CAAG,CAAC,GAC7BkE,IAAO,IAAI,WAAWD,EAAM,MAAM;AACxC,SAAK,KAAK,KAAK,KAAK,IAAIC,EAAK,CAAC,GAC9B,KAAK,KAAK,KAAK,QAAQ,CAAC,IAAIA,EAAK,CAAC,GAClC,KAAK,KAAK,KAAK,QAAQ,CAAC,IAAIA,EAAK,CAAC,GAClC,KAAK,SAAS;AAAA,EAClB;AAAA,EACA,WAAWA,GAAM;AACb,SAAK,eAAeA,EAAK,MAAM,GAC/B,KAAK,KAAK,IAAIA,GAAM,KAAK,KAAK,GAC9B,KAAK,SAASA,EAAK;AAAA,EACvB;AAAA,EACA,SAASC,GAAM;AACX,QAAIA,KAAQ;AACR,aAAO,IAAI,WAAW,CAAC;AAE3B,QAAI,KAAK,QAAQA,IAAO,KAAK,KAAK;AAC9B,YAAM,IAAI,MAAM,4BAA4B;AAEhD,UAAMlC,IAAS,KAAK,KAAK,SAAS,KAAK,OAAO,KAAK,QAAQkC,CAAI;AAC/D,gBAAK,SAASA,GACPlC;AAAA,EACX;AAAA,EACA,WAAW;AACP,WAAO,KAAK,SAAS,CAAC,EAAE,CAAC;AAAA,EAC7B;AAAA,EACA,YAAY;AACR,UAAMmC,IAAQ,KAAK,SAAS,CAAC;AAC7B,WAAQA,EAAM,CAAC,KAAK,IAAKA,EAAM,CAAC;AAAA,EACpC;AAAA,EACA,eAAeD,GAAM;AACjB,QAAI,KAAK,QAAQA,IAAO,KAAK,KAAK,YAAY;AAC1C,YAAME,IAAYR,GAAW,cAAcM,IAAON,GAAW,aAAaM,IAAO;AACjF,WAAK,QAAQ,KAAK,KAAK,aAAaE,CAAS;AAAA,IACjD;AAAA,EACJ;AAAA,EACA,QAAQF,GAAM;AACV,UAAMG,IAAU,IAAI,WAAWH,CAAI;AACnC,IAAAG,EAAQ,IAAI,KAAK,IAAI,GACrB,KAAK,OAAOA;AAAA,EAChB;AACJ;AACAT,GAAW,aAAa;AC9EjB,MAAMU,GAAQ;AAAA,EACjB,YAAYC,GAAKP,GAAOQ,GAAM;AAC1B,SAAK,MAAMD,GACX,KAAK,QAAQP,GACb,KAAK,OAAOQ;AAAA,EAChB;AAAA;AAAA,EAEA,OAAO,YAAYrE,GAAK;AACpB,WAAOsE,GAAY,IAAIb,GAAWzD,CAAG,CAAC;AAAA,EAC1C;AAAA,EACA,QAAQ;AACJ,UAAMuE,IAAc,IAAId,GAAU;AAClC,QAAI,KAAK,KAAK,SAAS;AACnB,iBAAWe,KAAO,KAAK;AACnB,QAAAD,EAAY,WAAWC,EAAI,OAAO;AAAA;AAItC,MAAAD,EAAY,WAAW,KAAK,KAAK;AAErC,UAAMV,IAAQU,EAAY,QAEpBE,IAAM,IAAIhB,GAAU;AAC1B,WAAAgB,EAAI,WAAW,KAAK,IAAI,MAAK,CAAE,GAC/BA,EAAI,WAAWrE,GAAayD,EAAM,MAAM,CAAC,GACzCY,EAAI,WAAWZ,CAAK,GACbY,EAAI;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY;AACR,QAAI,CAAC,KAAK,IAAI;AACV,YAAM,IAAIlF,GAAc,eAAe;AAE3C,WAAOyD,GAAa,KAAK,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA,EAGA,YAAY;AACR,QAAI,CAAC,KAAK,IAAI;AACV,YAAM,IAAIzD,GAAc,gBAAgB;AAE5C,WAAOyC,GAAa,KAAK,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA,EAGA,QAAQ;AACJ,QAAI,CAAC,KAAK,IAAI;AACV,YAAM,IAAIzC,GAAc,YAAY;AAExC,WAAOqD,GAAS,KAAK,KAAK;AAAA,EAC9B;AAAA;AAAA;AAAA,EAGA,SAAS;AACL,YAAQ,IAAI;AAAA,MACR,KAAK,KAAK,IAAI,UAAS;AACnB,eAAOL,GAAU,KAAK,OAAO,EAAI;AAAA,MACrC,KAAK,KAAK,IAAI,kBAAiB;AAC3B,eAAOA,GAAU,KAAK,OAAO,EAAK;AAAA,MACtC;AACI,cAAM,IAAIhD,GAAc,YAAY;AAAA,IACpD;AAAA,EACI;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc;AACV,QAAI,CAAC,KAAK,IAAI;AACV,YAAM,IAAIA,GAAc,kBAAkB;AAE9C,WAAO0D,GAAe,KAAK,KAAK;AAAA,EACpC;AACJ;AAGA,SAASqB,GAAYvE,GAAQ;AAEzB,QAAMqE,IAAM,IAAI1E,GAAQK,EAAO,SAAQ,CAAE,GACnCG,IAAMJ,GAAaC,CAAM,GACzB8D,IAAQ9D,EAAO,MAAMA,EAAO,UAAUG,CAAG,GACzCiD,IAAQpD,EAAO;AACrB,MAAIsE,IAAO,CAAA;AAIX,MAAID,EAAI;AACJ,IAAAC,IAAOK,GAAY3E,GAAQG,CAAG;AAAA,WAEzBkE,EAAI;AAGT,QAAI;AACA,MAAAC,IAAOK,GAAY3E,GAAQG,CAAG;AAAA,IAClC,QACU;AAAA,IAEV;AAGJ,SAAImE,EAAK,WAAW,KAChBtE,EAAO,KAAKoD,IAAQjD,CAAG,GAEpB,IAAIiE,GAAQC,GAAKP,GAAOQ,CAAI;AACvC;AACA,SAASK,GAAY3E,GAAQG,GAAK;AAE9B,QAAMgC,IAAMnC,EAAO,WAAWG;AAK9B,MAAIgC,IAAMnC,EAAO;AACb,UAAM,IAAIT,GAAe,gBAAgB;AAG7C,QAAM+E,IAAO,CAAA;AACb,SAAOtE,EAAO,WAAWmC;AACrB,IAAAmC,EAAK,KAAKC,GAAYvE,CAAM,CAAC;AAGjC,MAAIA,EAAO,aAAamC;AACpB,UAAM,IAAI5C,GAAe,gBAAgB;AAE7C,SAAO+E;AACX;ACnIA,MAAMM,KAAa,wBACbC,KAAa;AACZ,SAASC,GAAMC,GAAa;AAC/B,MAAIC,IAAM;AACV,SAAAD,EAAY,MAAM;AAAA,CAAI,EAAE,QAAQ,CAACE,MAAS;AACtC,IAAIA,EAAK,MAAML,EAAU,KAAKK,EAAK,MAAMJ,EAAU,MAGnDG,KAAOC;AAAA,EACX,CAAC,GACMzE,EAAmBwE,CAAG;AACjC;AC7BA,MAAME,KAAQ,KACRC,KAAQ,KACRC,KAAsB,KACtBC,KAAuB,KACvBC,KAAqB,KACrBC,KAAsB;AAC5B,SAASC,GAAmBC,GAAQ;AAEhC,SAAO,MADeA,EAAO,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK,IAC1C;AACjC;AAKO,SAASC,GAAaC,GAAQ;AACjC,QAAMhC,IAAS,CAAA;AACf,MAAI,OAAOgC,KAAW;AAClB,IAAAhC,EAAO,KAAK6B,GAAmBG,CAAM,CAAC;AAAA,WAEjC,OAAOA,KAAW;AACvB,IAAAhC,EAAO,KAAK,KAAK,UAAUgC,CAAM,CAAC;AAAA,WAE7B,OAAO,UAAUA,CAAM;AAC5B,IAAAhC,EAAO,KAAK,KAAK,UAAUgC,CAAM,CAAC;AAAA,WAE7BA,MAAW;AAChB,IAAAhC,EAAO,KAAK,KAAK,UAAUgC,CAAM,CAAC;AAAA,WAE7B,MAAM,QAAQA,CAAM,GAAG;AAC5B,IAAAhC,EAAO,KAAKyB,EAAmB;AAC/B,QAAItC,IAAQ;AACZ,IAAA6C,EAAO,QAAQ,CAACC,MAAY;AACxB,MAAK9C,KACDa,EAAO,KAAKuB,EAAK,GAErBpC,IAAQ,IACRa,EAAO,KAAK+B,GAAaE,CAAO,CAAC;AAAA,IACrC,CAAC,GACDjC,EAAO,KAAK0B,EAAoB;AAAA,EACpC,WACS,OAAOM,KAAW,UAAU;AACjC,IAAAhC,EAAO,KAAK2B,EAAkB;AAC9B,QAAIxC,IAAQ;AACZ,WAAO,KAAK6C,CAAM,EACb,KAAI,EACJ,QAAQ,CAACE,MAAa;AACvB,MAAK/C,KACDa,EAAO,KAAKuB,EAAK,GAErBpC,IAAQ,IACRa,EAAO,KAAK6B,GAAmBK,CAAQ,CAAC,GACxClC,EAAO,KAAKwB,EAAK,GAEjBxB,EAAO,KAAK+B,GAAaC,EAAOE,CAAQ,CAAC,CAAC;AAAA,IAC9C,CAAC,GACDlC,EAAO,KAAK4B,EAAmB;AAAA,EACnC;AAEI,UAAM,IAAI,UAAU,mBAAmBI,CAAM;AAEjD,SAAOhC,EAAO,KAAK,EAAE;AACzB;AC9DO,IAAImC;AAAA,CACV,SAAUA,GAAU;AACjB,EAAAA,EAAS,QAAW,SACpBA,EAAS,UAAa,WACtBA,EAAS,MAAS;AACtB,GAAGA,MAAaA,IAAW,CAAA,EAAG;AACvB,IAAIC;AAAA,CACV,SAAUA,GAAY;AACnB,EAAAA,EAAW,OAAU,SACrBA,EAAW,OAAU,SACrBA,EAAW,OAAU;AACzB,GAAGA,OAAeA,KAAa,CAAA,EAAG;AACxB,IAACC;AAAA,CACV,SAAUA,GAAgB;AACvB,EAAAA,EAAe,SAAY,WAC3BA,EAAe,SAAY,WAC3BA,EAAe,SAAY;AAC/B,GAAGA,MAAmBA,IAAiB,CAAA,EAAG;AACnC,IAAIC;AAAA,CACV,SAAUA,GAAe;AACtB,EAAAA,EAAc,WAAc,qBAC5BA,EAAc,MAAS;AAC3B,GAAGA,OAAkBA,KAAgB,CAAA,EAAG;AACjC,IAAIC;AAAA,CACV,SAAUA,GAAY;AACnB,EAAAA,EAAW,QAAW,SACtBA,EAAW,WAAc;AAC7B,GAAGA,OAAeA,KAAa,CAAA,EAAG;AC3B3B,MAAMC,KAAS,OAAO,cAAe,YAAY,YAAY,aAAa,WAAW,SAAS;ACIrG;AASO,SAASC,GAAQxE,GAAG;AACvB,SAAOA,aAAa,cAAe,YAAY,OAAOA,CAAC,KAAKA,EAAE,YAAY,SAAS;AACvF;AAEO,SAASyE,GAAQ/D,GAAG;AACvB,MAAI,CAAC,OAAO,cAAcA,CAAC,KAAKA,IAAI;AAChC,UAAM,IAAI,MAAM,oCAAoCA,CAAC;AAC7D;AAEO,SAASgE,GAAOzE,MAAM0E,GAAS;AAClC,MAAI,CAACH,GAAQvE,CAAC;AACV,UAAM,IAAI,MAAM,qBAAqB;AACzC,MAAI0E,EAAQ,SAAS,KAAK,CAACA,EAAQ,SAAS1E,EAAE,MAAM;AAChD,UAAM,IAAI,MAAM,mCAAmC0E,IAAU,kBAAkB1E,EAAE,MAAM;AAC/F;AAEO,SAAS2E,GAAMC,GAAG;AACrB,MAAI,OAAOA,KAAM,cAAc,OAAOA,EAAE,UAAW;AAC/C,UAAM,IAAI,MAAM,8CAA8C;AAClE,EAAAJ,GAAQI,EAAE,SAAS,GACnBJ,GAAQI,EAAE,QAAQ;AACtB;AAEO,SAASC,GAAQC,GAAUC,IAAgB,IAAM;AACpD,MAAID,EAAS;AACT,UAAM,IAAI,MAAM,kCAAkC;AACtD,MAAIC,KAAiBD,EAAS;AAC1B,UAAM,IAAI,MAAM,uCAAuC;AAC/D;AAEO,SAASE,GAAQC,GAAKH,GAAU;AACnC,EAAAL,GAAOQ,CAAG;AACV,QAAMC,IAAMJ,EAAS;AACrB,MAAIG,EAAI,SAASC;AACb,UAAM,IAAI,MAAM,2DAA2DA,CAAG;AAEtF;AAUO,SAASC,MAASC,GAAQ;AAC7B,WAAS7G,IAAI,GAAGA,IAAI6G,EAAO,QAAQ7G;AAC/B,IAAA6G,EAAO7G,CAAC,EAAE,KAAK,CAAC;AAExB;AAEO,SAAS8G,GAAWC,GAAK;AAC5B,SAAO,IAAI,SAASA,EAAI,QAAQA,EAAI,YAAYA,EAAI,UAAU;AAClE;AAEO,SAASC,GAAKC,GAAMC,GAAO;AAC9B,SAAQD,KAAS,KAAKC,IAAWD,MAASC;AAC9C;AA+BA,MAAMC,sBAEN,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,SAAU,cAAc,OAAO,WAAW,WAAY,YAE3EC,KAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAACC,GAAGrH,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAK5F,SAASsH,GAAWnH,GAAO;AAG9B,MAFA+F,GAAO/F,CAAK,GAERgH;AACA,WAAOhH,EAAM,MAAK;AAEtB,MAAIU,IAAM;AACV,WAASb,IAAI,GAAGA,IAAIG,EAAM,QAAQH;AAC9B,IAAAa,KAAOuG,GAAMjH,EAAMH,CAAC,CAAC;AAEzB,SAAOa;AACX;AAEA,MAAM0G,KAAS,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAG;AAC5D,SAASC,GAAcC,GAAI;AACvB,MAAIA,KAAMF,GAAO,MAAME,KAAMF,GAAO;AAChC,WAAOE,IAAKF,GAAO;AACvB,MAAIE,KAAMF,GAAO,KAAKE,KAAMF,GAAO;AAC/B,WAAOE,KAAMF,GAAO,IAAI;AAC5B,MAAIE,KAAMF,GAAO,KAAKE,KAAMF,GAAO;AAC/B,WAAOE,KAAMF,GAAO,IAAI;AAEhC;AAKO,SAASG,GAAW7G,GAAK;AAC5B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAE5D,MAAIsG;AACA,WAAO,WAAW,QAAQtG,CAAG;AACjC,QAAM8G,IAAK9G,EAAI,QACT+G,IAAKD,IAAK;AAChB,MAAIA,IAAK;AACL,UAAM,IAAI,MAAM,qDAAqDA,CAAE;AAC3E,QAAME,IAAQ,IAAI,WAAWD,CAAE;AAC/B,WAASE,IAAK,GAAGC,IAAK,GAAGD,IAAKF,GAAIE,KAAMC,KAAM,GAAG;AAC7C,UAAMC,IAAKR,GAAc3G,EAAI,WAAWkH,CAAE,CAAC,GACrCE,IAAKT,GAAc3G,EAAI,WAAWkH,IAAK,CAAC,CAAC;AAC/C,QAAIC,MAAO,UAAaC,MAAO,QAAW;AACtC,YAAMxE,IAAO5C,EAAIkH,CAAE,IAAIlH,EAAIkH,IAAK,CAAC;AACjC,YAAM,IAAI,MAAM,iDAAiDtE,IAAO,gBAAgBsE,CAAE;AAAA,IAC9F;AACA,IAAAF,EAAMC,CAAE,IAAIE,IAAK,KAAKC;AAAA,EAC1B;AACA,SAAOJ;AACX;AAwBO,SAASK,GAAYhH,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,iBAAiB;AACrC,SAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAOA,CAAG,CAAC;AACvD;AAaO,SAASiH,GAAQpH,GAAM;AAC1B,SAAI,OAAOA,KAAS,aAChBA,IAAOmH,GAAYnH,CAAI,IAC3BmF,GAAOnF,CAAI,GACJA;AACX;AAYO,SAASqH,MAAevB,GAAQ;AACnC,MAAIwB,IAAM;AACV,WAASrI,IAAI,GAAGA,IAAI6G,EAAO,QAAQ7G,KAAK;AACpC,UAAMwB,IAAIqF,EAAO7G,CAAC;AAClB,IAAAkG,GAAO1E,CAAC,GACR6G,KAAO7G,EAAE;AAAA,EACb;AACA,QAAM9B,IAAM,IAAI,WAAW2I,CAAG;AAC9B,WAASrI,IAAI,GAAGiC,IAAM,GAAGjC,IAAI6G,EAAO,QAAQ7G,KAAK;AAC7C,UAAMwB,IAAIqF,EAAO7G,CAAC;AAClB,IAAAN,EAAI,IAAI8B,GAAGS,CAAG,GACdA,KAAOT,EAAE;AAAA,EACb;AACA,SAAO9B;AACX;AAQO,MAAM4I,GAAK;AAClB;AAEO,SAASC,GAAaC,GAAU;AACnC,QAAMC,IAAQ,CAACC,MAAQF,EAAQ,EAAG,OAAOL,GAAQO,CAAG,CAAC,EAAE,OAAM,GACvDC,IAAMH,EAAQ;AACpB,SAAAC,EAAM,YAAYE,EAAI,WACtBF,EAAM,WAAWE,EAAI,UACrBF,EAAM,SAAS,MAAMD,EAAQ,GACtBC;AACX;AAqBO,SAASG,GAAYC,IAAc,IAAI;AAC1C,MAAI9C,MAAU,OAAOA,GAAO,mBAAoB;AAC5C,WAAOA,GAAO,gBAAgB,IAAI,WAAW8C,CAAW,CAAC;AAG7D,MAAI9C,MAAU,OAAOA,GAAO,eAAgB;AACxC,WAAO,WAAW,KAAKA,GAAO,YAAY8C,CAAW,CAAC;AAE1D,QAAM,IAAI,MAAM,wCAAwC;AAC5D;ACjRO,SAASC,GAAanF,GAAMoF,GAAYrF,GAAOsF,GAAM;AACxD,MAAI,OAAOrF,EAAK,gBAAiB;AAC7B,WAAOA,EAAK,aAAaoF,GAAYrF,GAAOsF,CAAI;AACpD,QAAMC,IAAO,OAAO,EAAE,GAChBC,IAAW,OAAO,UAAU,GAC5BC,IAAK,OAAQzF,KAASuF,IAAQC,CAAQ,GACtCE,IAAK,OAAO1F,IAAQwF,CAAQ,GAC5B7C,IAAI2C,IAAO,IAAI,GACf,IAAIA,IAAO,IAAI;AACrB,EAAArF,EAAK,UAAUoF,IAAa1C,GAAG8C,GAAIH,CAAI,GACvCrF,EAAK,UAAUoF,IAAa,GAAGK,GAAIJ,CAAI;AAC3C;AAEO,SAASK,GAAI7H,GAAGC,GAAG6H,GAAG;AACzB,SAAQ9H,IAAIC,IAAM,CAACD,IAAI8H;AAC3B;AAEO,SAASC,GAAI/H,GAAGC,GAAG6H,GAAG;AACzB,SAAQ9H,IAAIC,IAAMD,IAAI8H,IAAM7H,IAAI6H;AACpC;AAKO,MAAME,WAAelB,GAAK;AAAA,EAC7B,YAAYmB,GAAUC,GAAWC,GAAWX,GAAM;AAC9C,UAAK,GACL,KAAK,WAAW,IAChB,KAAK,SAAS,GACd,KAAK,MAAM,GACX,KAAK,YAAY,IACjB,KAAK,WAAWS,GAChB,KAAK,YAAYC,GACjB,KAAK,YAAYC,GACjB,KAAK,OAAOX,GACZ,KAAK,SAAS,IAAI,WAAWS,CAAQ,GACrC,KAAK,OAAO3C,GAAW,KAAK,MAAM;AAAA,EACtC;AAAA,EACA,OAAO/F,GAAM;AACT,IAAAuF,GAAQ,IAAI,GACZvF,IAAOoH,GAAQpH,CAAI,GACnBmF,GAAOnF,CAAI;AACX,UAAM,EAAE,MAAA4C,GAAM,QAAAJ,GAAQ,UAAAkG,EAAQ,IAAK,MAC7B1J,IAAMgB,EAAK;AACjB,aAASe,IAAM,GAAGA,IAAM/B,KAAM;AAC1B,YAAM6J,IAAO,KAAK,IAAIH,IAAW,KAAK,KAAK1J,IAAM+B,CAAG;AAEpD,UAAI8H,MAASH,GAAU;AACnB,cAAMI,IAAW/C,GAAW/F,CAAI;AAChC,eAAO0I,KAAY1J,IAAM+B,GAAKA,KAAO2H;AACjC,eAAK,QAAQI,GAAU/H,CAAG;AAC9B;AAAA,MACJ;AACA,MAAAyB,EAAO,IAAIxC,EAAK,SAASe,GAAKA,IAAM8H,CAAI,GAAG,KAAK,GAAG,GACnD,KAAK,OAAOA,GACZ9H,KAAO8H,GACH,KAAK,QAAQH,MACb,KAAK,QAAQ9F,GAAM,CAAC,GACpB,KAAK,MAAM;AAAA,IAEnB;AACA,gBAAK,UAAU5C,EAAK,QACpB,KAAK,WAAU,GACR;AAAA,EACX;AAAA,EACA,WAAW2F,GAAK;AACZ,IAAAJ,GAAQ,IAAI,GACZG,GAAQC,GAAK,IAAI,GACjB,KAAK,WAAW;AAIhB,UAAM,EAAE,QAAAnD,GAAQ,MAAAI,GAAM,UAAA8F,GAAU,MAAAT,EAAI,IAAK;AACzC,QAAI,EAAE,KAAAlH,EAAG,IAAK;AAEd,IAAAyB,EAAOzB,GAAK,IAAI,KAChB8E,GAAM,KAAK,OAAO,SAAS9E,CAAG,CAAC,GAG3B,KAAK,YAAY2H,IAAW3H,MAC5B,KAAK,QAAQ6B,GAAM,CAAC,GACpB7B,IAAM;AAGV,aAAS9B,IAAI8B,GAAK9B,IAAIyJ,GAAUzJ;AAC5B,MAAAuD,EAAOvD,CAAC,IAAI;AAIhB,IAAA8I,GAAanF,GAAM8F,IAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGT,CAAI,GAC9D,KAAK,QAAQrF,GAAM,CAAC;AACpB,UAAMmG,IAAQhD,GAAWJ,CAAG,GACtB3G,IAAM,KAAK;AAEjB,QAAIA,IAAM;AACN,YAAM,IAAI,MAAM,6CAA6C;AACjE,UAAMgK,IAAShK,IAAM,GACfiK,IAAQ,KAAK,IAAG;AACtB,QAAID,IAASC,EAAM;AACf,YAAM,IAAI,MAAM,oCAAoC;AACxD,aAAShK,IAAI,GAAGA,IAAI+J,GAAQ/J;AACxB,MAAA8J,EAAM,UAAU,IAAI9J,GAAGgK,EAAMhK,CAAC,GAAGgJ,CAAI;AAAA,EAC7C;AAAA,EACA,SAAS;AACL,UAAM,EAAE,QAAAzF,GAAQ,WAAAmG,EAAS,IAAK;AAC9B,SAAK,WAAWnG,CAAM;AACtB,UAAM7D,IAAM6D,EAAO,MAAM,GAAGmG,CAAS;AACrC,gBAAK,QAAO,GACLhK;AAAA,EACX;AAAA,EACA,WAAWuK,GAAI;AACX,IAAAA,MAAOA,IAAK,IAAI,KAAK,YAAW,IAChCA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAAR,GAAU,QAAAlG,GAAQ,QAAAhD,GAAQ,UAAA2J,GAAU,WAAAC,GAAW,KAAArI,EAAG,IAAK;AAC/D,WAAAmI,EAAG,YAAYE,GACfF,EAAG,WAAWC,GACdD,EAAG,SAAS1J,GACZ0J,EAAG,MAAMnI,GACLvB,IAASkJ,KACTQ,EAAG,OAAO,IAAI1G,CAAM,GACjB0G;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,WAAU;AAAA,EAC1B;AACJ;AAMO,MAAMG,KAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAMYC,IAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAEYC,IAA4B,4BAAY,KAAK;AAAA,EACtD;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GCpJKC,KAA6B,uBAAO,KAAK,KAAK,CAAC,GAC/CtB,KAAuB,uBAAO,EAAE;AACtC,SAASuB,GAAQtI,GAAGuI,IAAK,IAAO;AAC5B,SAAIA,IACO,EAAE,GAAG,OAAOvI,IAAIqI,EAAU,GAAG,GAAG,OAAQrI,KAAK+G,KAAQsB,EAAU,EAAC,IACpE,EAAE,GAAG,OAAQrI,KAAK+G,KAAQsB,EAAU,IAAI,GAAG,GAAG,OAAOrI,IAAIqI,EAAU,IAAI,EAAC;AACnF;AACA,SAASG,GAAMC,GAAKF,IAAK,IAAO;AAC5B,QAAM1K,IAAM4K,EAAI;AAChB,MAAIC,IAAK,IAAI,YAAY7K,CAAG,GACxB8K,IAAK,IAAI,YAAY9K,CAAG;AAC5B,WAAS,IAAI,GAAG,IAAIA,GAAK,KAAK;AAC1B,UAAM,EAAE,GAAAsG,GAAG,GAAAyE,EAAC,IAAKN,GAAQG,EAAI,CAAC,GAAGF,CAAE;AACnC,KAACG,EAAG,CAAC,GAAGC,EAAG,CAAC,CAAC,IAAI,CAACxE,GAAGyE,CAAC;AAAA,EAC1B;AACA,SAAO,CAACF,GAAIC,CAAE;AAClB;AAGA,MAAME,KAAQ,CAAC1E,GAAG2E,GAAI,MAAM3E,MAAM,GAC5B4E,KAAQ,CAAC5E,GAAGyE,GAAG,MAAOzE,KAAM,KAAK,IAAOyE,MAAM,GAE9CI,KAAS,CAAC7E,GAAGyE,GAAG,MAAOzE,MAAM,IAAMyE,KAAM,KAAK,GAC9CK,KAAS,CAAC9E,GAAGyE,GAAG,MAAOzE,KAAM,KAAK,IAAOyE,MAAM,GAE/CM,KAAS,CAAC/E,GAAGyE,GAAG,MAAOzE,KAAM,KAAK,IAAOyE,MAAO,IAAI,IACpDO,KAAS,CAAChF,GAAGyE,GAAG,MAAOzE,MAAO,IAAI,KAAQyE,KAAM,KAAK;AAY3D,SAASQ,GAAIV,GAAIC,GAAIU,GAAIC,GAAI;AACzB,QAAMV,KAAKD,MAAO,MAAMW,MAAO;AAC/B,SAAO,EAAE,GAAIZ,IAAKW,KAAOT,IAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,IAAI,EAAC;AAC7D;AAEA,MAAMW,KAAQ,CAACZ,GAAIW,GAAIE,OAAQb,MAAO,MAAMW,MAAO,MAAME,MAAO,IAC1DC,KAAQ,CAACC,GAAKhB,GAAIW,GAAIM,MAAQjB,IAAKW,IAAKM,KAAOD,IAAM,KAAK,KAAM,KAAM,GACtEE,KAAQ,CAACjB,GAAIW,GAAIE,GAAIK,OAAQlB,MAAO,MAAMW,MAAO,MAAME,MAAO,MAAMK,MAAO,IAC3EC,KAAQ,CAACJ,GAAKhB,GAAIW,GAAIM,GAAII,MAAQrB,IAAKW,IAAKM,IAAKI,KAAOL,IAAM,KAAK,KAAM,KAAM,GAC/EM,KAAQ,CAACrB,GAAIW,GAAIE,GAAIK,GAAII,OAAQtB,MAAO,MAAMW,MAAO,MAAME,MAAO,MAAMK,MAAO,MAAMI,MAAO,IAC5FC,KAAQ,CAACR,GAAKhB,GAAIW,GAAIM,GAAII,GAAII,MAAQzB,IAAKW,IAAKM,IAAKI,IAAKI,KAAOT,IAAM,KAAK,KAAM,KAAM,GCtCxFU,KAA2B,4BAAY,KAAK;AAAA,EAC9C;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EACpF;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AAAA,EAAY;AACxF,CAAC,GAEKC,KAA2B,oBAAI,YAAY,EAAE;AAC5C,MAAMC,WAAehD,GAAO;AAAA,EAC/B,YAAYE,IAAY,IAAI;AACxB,UAAM,IAAIA,GAAW,GAAG,EAAK,GAG7B,KAAK,IAAIU,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI,GACxB,KAAK,IAAIA,GAAU,CAAC,IAAI;AAAA,EAC5B;AAAA,EACA,MAAM;AACF,UAAM,EAAE,GAAAqC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAK;AACnC,WAAO,CAACP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EAClC;AAAA;AAAA,EAEA,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAG;AACxB,SAAK,IAAIP,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI,GACb,KAAK,IAAIC,IAAI;AAAA,EACjB;AAAA,EACA,QAAQrJ,GAAMtC,GAAQ;AAElB,aAASrB,IAAI,GAAGA,IAAI,IAAIA,KAAKqB,KAAU;AACnC,MAAAkL,GAASvM,CAAC,IAAI2D,EAAK,UAAUtC,GAAQ,EAAK;AAC9C,aAASrB,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAC1B,YAAMiN,IAAMV,GAASvM,IAAI,EAAE,GACrBkN,IAAKX,GAASvM,IAAI,CAAC,GACnBmN,IAAKnG,GAAKiG,GAAK,CAAC,IAAIjG,GAAKiG,GAAK,EAAE,IAAKA,MAAQ,GAC7CG,IAAKpG,GAAKkG,GAAI,EAAE,IAAIlG,GAAKkG,GAAI,EAAE,IAAKA,MAAO;AACjD,MAAAX,GAASvM,CAAC,IAAKoN,IAAKb,GAASvM,IAAI,CAAC,IAAImN,IAAKZ,GAASvM,IAAI,EAAE,IAAK;AAAA,IACnE;AAEA,QAAI,EAAE,GAAAyM,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAK;AACjC,aAAShN,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,YAAMqN,IAASrG,GAAK6F,GAAG,CAAC,IAAI7F,GAAK6F,GAAG,EAAE,IAAI7F,GAAK6F,GAAG,EAAE,GAC9CS,IAAMN,IAAIK,IAAShE,GAAIwD,GAAGC,GAAGC,CAAC,IAAIT,GAAStM,CAAC,IAAIuM,GAASvM,CAAC,IAAK,GAE/DuN,KADSvG,GAAKyF,GAAG,CAAC,IAAIzF,GAAKyF,GAAG,EAAE,IAAIzF,GAAKyF,GAAG,EAAE,KAC/BlD,GAAIkD,GAAGC,GAAGC,CAAC,IAAK;AACrC,MAAAK,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKD,IAAIU,IAAM,GACfV,IAAID,GACJA,IAAID,GACJA,IAAID,GACJA,IAAKa,IAAKC,IAAM;AAAA,IACpB;AAEA,IAAAd,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnBC,IAAKA,IAAI,KAAK,IAAK,GACnB,KAAK,IAAIP,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,CAAC;AAAA,EACnC;AAAA,EACA,aAAa;AACT,IAAApG,GAAM2F,EAAQ;AAAA,EAClB;AAAA,EACA,UAAU;AACN,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAC/B3F,GAAM,KAAK,MAAM;AAAA,EACrB;AACJ;AAkBA,MAAM4G,KAA8BC,GAAU;AAAA,EAC1C;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAClE;AAAA,EAAsB;AAAA,EAAsB;AAAA,EAAsB;AACtE,EAAE,IAAI,CAAAvL,MAAK,OAAOA,CAAC,CAAC,CAAC,GACfwL,KAAmCF,GAAK,CAAC,GACzCG,KAAmCH,GAAK,CAAC,GAEzCI,KAA6B,oBAAI,YAAY,EAAE,GAC/CC,KAA6B,oBAAI,YAAY,EAAE;AAC9C,MAAMC,WAAetE,GAAO;AAAA,EAC/B,YAAYE,IAAY,IAAI;AACxB,UAAM,KAAKA,GAAW,IAAI,EAAK,GAI/B,KAAK,KAAKY,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI;AAAA,EAC9B;AAAA;AAAA,EAEA,MAAM;AACF,UAAM,EAAE,IAAAM,GAAI,IAAAC,GAAI,IAAAU,GAAI,IAAAC,GAAI,IAAAK,GAAI,IAAAH,GAAI,IAAAO,GAAI,IAAAF,GAAI,IAAAM,GAAI,IAAAF,GAAI,IAAA4B,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,EAAE,IAAK;AAC3E,WAAO,CAACxD,GAAIC,GAAIU,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAI4B,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,CAAE;AAAA,EAC1E;AAAA;AAAA,EAEA,IAAIxD,GAAIC,GAAIU,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAI4B,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AAChE,SAAK,KAAKxD,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKU,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKK,IAAK,GACf,KAAK,KAAKH,IAAK,GACf,KAAK,KAAKO,IAAK,GACf,KAAK,KAAKF,IAAK,GACf,KAAK,KAAKM,IAAK,GACf,KAAK,KAAKF,IAAK,GACf,KAAK,KAAK4B,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK,GACf,KAAK,KAAKC,IAAK;AAAA,EACnB;AAAA,EACA,QAAQzK,GAAMtC,GAAQ;AAElB,aAASrB,IAAI,GAAGA,IAAI,IAAIA,KAAKqB,KAAU;AACnC,MAAAuM,GAAW5N,CAAC,IAAI2D,EAAK,UAAUtC,CAAM,GACrCwM,GAAW7N,CAAC,IAAI2D,EAAK,UAAWtC,KAAU,CAAC;AAE/C,aAASrB,IAAI,IAAIA,IAAI,IAAIA,KAAK;AAE1B,YAAMqO,IAAOT,GAAW5N,IAAI,EAAE,IAAI,GAC5BsO,IAAOT,GAAW7N,IAAI,EAAE,IAAI,GAC5BuO,KAAMC,GAAWH,GAAMC,GAAM,CAAC,IAAIE,GAAWH,GAAMC,GAAM,CAAC,IAAIG,GAAUJ,GAAMC,GAAM,CAAC,GACrFI,KAAMC,GAAWN,GAAMC,GAAM,CAAC,IAAIK,GAAWN,GAAMC,GAAM,CAAC,IAAIM,GAAUP,GAAMC,GAAM,CAAC,GAErFO,IAAMjB,GAAW5N,IAAI,CAAC,IAAI,GAC1B8O,IAAMjB,GAAW7N,IAAI,CAAC,IAAI,GAC1B+O,KAAMP,GAAWK,GAAKC,GAAK,EAAE,IAAIE,GAAWH,GAAKC,GAAK,EAAE,IAAIL,GAAUI,GAAKC,GAAK,CAAC,GACjFG,KAAMN,GAAWE,GAAKC,GAAK,EAAE,IAAII,GAAWL,GAAKC,GAAK,EAAE,IAAIF,GAAUC,GAAKC,GAAK,CAAC,GAEjFK,IAAOC,GAAUV,IAAKO,IAAKpB,GAAW7N,IAAI,CAAC,GAAG6N,GAAW7N,IAAI,EAAE,CAAC,GAChEqP,IAAOC,GAAUH,GAAMZ,IAAKQ,IAAKnB,GAAW5N,IAAI,CAAC,GAAG4N,GAAW5N,IAAI,EAAE,CAAC;AAC5E,MAAA4N,GAAW5N,CAAC,IAAIqP,IAAO,GACvBxB,GAAW7N,CAAC,IAAImP,IAAO;AAAA,IAC3B;AACA,QAAI,EAAE,IAAAvE,GAAI,IAAAC,GAAI,IAAAU,GAAI,IAAAC,GAAI,IAAAK,GAAI,IAAAH,GAAI,IAAAO,GAAI,IAAAF,GAAI,IAAAM,GAAI,IAAAF,GAAI,IAAA4B,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAI,IAAAC,GAAE,IAAK;AAEzE,aAASpO,IAAI,GAAGA,IAAI,IAAIA,KAAK;AAEzB,YAAMuP,IAAUf,GAAWnC,GAAIF,GAAI,EAAE,IAAIqC,GAAWnC,GAAIF,GAAI,EAAE,IAAI6C,GAAW3C,GAAIF,GAAI,EAAE,GACjFqD,IAAUb,GAAWtC,GAAIF,GAAI,EAAE,IAAIwC,GAAWtC,GAAIF,GAAI,EAAE,IAAI+C,GAAW7C,GAAIF,GAAI,EAAE,GAEjFsD,KAAQpD,IAAK0B,IAAO,CAAC1B,IAAK4B,GAC1ByB,KAAQvD,IAAK6B,IAAO,CAAC7B,IAAK+B,GAG1ByB,IAAOC,GAAUxB,IAAIoB,GAASE,IAAM/B,GAAU3N,CAAC,GAAG6N,GAAW7N,CAAC,CAAC,GAC/D6P,IAAMC,GAAUH,GAAMxB,GAAIoB,GAASE,IAAM/B,GAAU1N,CAAC,GAAG4N,GAAW5N,CAAC,CAAC,GACpE+P,KAAMJ,IAAO,GAEbK,KAAUxB,GAAW5D,GAAIC,GAAI,EAAE,IAAImE,GAAWpE,GAAIC,GAAI,EAAE,IAAImE,GAAWpE,GAAIC,GAAI,EAAE,GACjFoF,IAAUtB,GAAW/D,GAAIC,GAAI,EAAE,IAAIqE,GAAWtE,GAAIC,GAAI,EAAE,IAAIqE,GAAWtE,GAAIC,GAAI,EAAE,GACjFqF,IAAQtF,IAAKW,IAAOX,IAAKiB,IAAON,IAAKM,GACrCsE,IAAQtF,IAAKW,IAAOX,IAAKa,IAAOF,IAAKE;AAC3C,MAAAyC,IAAKF,IAAK,GACVG,KAAKF,IAAK,GACVD,IAAKF,IAAK,GACVG,IAAKF,IAAK,GACVD,IAAK1B,IAAK,GACV2B,IAAK7B,IAAK,GACT,EAAE,GAAGE,GAAI,GAAGF,EAAE,IAAKiE,GAAQnE,IAAK,GAAGF,IAAK,GAAG8D,IAAM,GAAGE,KAAM,CAAC,GAC5D9D,IAAKJ,IAAK,GACVE,IAAKL,IAAK,GACVG,IAAKN,IAAK,GACVG,IAAKF,IAAK,GACVD,IAAKX,IAAK,GACVY,IAAKX,IAAK;AACV,YAAMwF,IAAMC,GAAUP,IAAKE,GAASE,CAAI;AACxC,MAAAvF,IAAK2F,GAAUF,GAAKR,GAAKG,IAASE,CAAI,GACtCrF,IAAKwF,IAAM;AAAA,IACf;AAEA,KAAC,EAAE,GAAGzF,GAAI,GAAGC,EAAE,IAAKuF,GAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGxF,IAAK,GAAGC,IAAK,CAAC,IACnE,EAAE,GAAGU,GAAI,GAAGC,EAAE,IAAK4E,GAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG7E,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGK,GAAI,GAAGH,EAAE,IAAK0E,GAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGvE,IAAK,GAAGH,IAAK,CAAC,GACnE,EAAE,GAAGO,GAAI,GAAGF,EAAE,IAAKqE,GAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGnE,IAAK,GAAGF,IAAK,CAAC,GACnE,EAAE,GAAGM,GAAI,GAAGF,EAAE,IAAKiE,GAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG/D,IAAK,GAAGF,IAAK,CAAC,GACnE,EAAE,GAAG4B,GAAI,GAAGC,EAAE,IAAKoC,GAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGrC,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGC,GAAI,GAAGC,EAAE,IAAKkC,GAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGnC,IAAK,GAAGC,IAAK,CAAC,GACnE,EAAE,GAAGC,GAAI,GAAGC,GAAE,IAAKgC,GAAQ,KAAK,KAAK,GAAG,KAAK,KAAK,GAAGjC,IAAK,GAAGC,KAAK,CAAC,GACpE,KAAK,IAAIxD,GAAIC,GAAIU,GAAIC,GAAIK,GAAIH,GAAIO,GAAIF,GAAIM,GAAIF,GAAI4B,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,EAAE;AAAA,EAC3E;AAAA,EACA,aAAa;AACT,IAAAxH,GAAMgH,IAAYC,EAAU;AAAA,EAChC;AAAA,EACA,UAAU;AACN,IAAAjH,GAAM,KAAK,MAAM,GACjB,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,EAC3D;AACJ;AACO,MAAM4J,WAAe1C,GAAO;AAAA,EAC/B,cAAc;AACV,UAAM,EAAE,GACR,KAAK,KAAKzD,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,CAAC,IAAI,GACzB,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI,GAC1B,KAAK,KAAKA,EAAU,EAAE,IAAI;AAAA,EAC9B;AACJ;AAkEO,MAAMoG,KAAyB,gBAAAlI,GAAa,MAAM,IAAIiE,IAAQ,GAIxDkE,KAAyB,gBAAAnI,GAAa,MAAM,IAAIuF,IAAQ,GAExD6C,KAAyB,gBAAApI,GAAa,MAAM,IAAIiI,IAAQ;ACtW9D,MAAMI,WAAatI,GAAK;AAAA,EAC3B,YAAYuI,GAAMC,GAAM;AACpB,UAAK,GACL,KAAK,WAAW,IAChB,KAAK,YAAY,IACjB1K,GAAMyK,CAAI;AACV,UAAME,IAAM5I,GAAQ2I,CAAI;AAExB,QADA,KAAK,QAAQD,EAAK,OAAM,GACpB,OAAO,KAAK,MAAM,UAAW;AAC7B,YAAM,IAAI,MAAM,qDAAqD;AACzE,SAAK,WAAW,KAAK,MAAM,UAC3B,KAAK,YAAY,KAAK,MAAM;AAC5B,UAAMpH,IAAW,KAAK,UAChBxH,IAAM,IAAI,WAAWwH,CAAQ;AAEnC,IAAAxH,EAAI,IAAI8O,EAAI,SAAStH,IAAWoH,EAAK,OAAM,EAAG,OAAOE,CAAG,EAAE,OAAM,IAAKA,CAAG;AACxE,aAAS/Q,IAAI,GAAGA,IAAIiC,EAAI,QAAQjC;AAC5B,MAAAiC,EAAIjC,CAAC,KAAK;AACd,SAAK,MAAM,OAAOiC,CAAG,GAErB,KAAK,QAAQ4O,EAAK,OAAM;AAExB,aAAS7Q,IAAI,GAAGA,IAAIiC,EAAI,QAAQjC;AAC5B,MAAAiC,EAAIjC,CAAC,KAAK;AACd,SAAK,MAAM,OAAOiC,CAAG,GACrB2E,GAAM3E,CAAG;AAAA,EACb;AAAA,EACA,OAAOpC,GAAK;AACR,WAAAyG,GAAQ,IAAI,GACZ,KAAK,MAAM,OAAOzG,CAAG,GACd;AAAA,EACX;AAAA,EACA,WAAW6G,GAAK;AACZ,IAAAJ,GAAQ,IAAI,GACZJ,GAAOQ,GAAK,KAAK,SAAS,GAC1B,KAAK,WAAW,IAChB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,MAAM,OAAOA,CAAG,GACrB,KAAK,MAAM,WAAWA,CAAG,GACzB,KAAK,QAAO;AAAA,EAChB;AAAA,EACA,SAAS;AACL,UAAMA,IAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,gBAAK,WAAWA,CAAG,GACZA;AAAA,EACX;AAAA,EACA,WAAWuD,GAAI;AAEX,IAAAA,MAAOA,IAAK,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACzD,UAAM,EAAE,OAAA+G,GAAO,OAAAC,GAAO,UAAA/G,GAAU,WAAAC,GAAW,UAAAV,GAAU,WAAAC,EAAS,IAAK;AACnE,WAAAO,IAAKA,GACLA,EAAG,WAAWC,GACdD,EAAG,YAAYE,GACfF,EAAG,WAAWR,GACdQ,EAAG,YAAYP,GACfO,EAAG,QAAQ+G,EAAM,WAAW/G,EAAG,KAAK,GACpCA,EAAG,QAAQgH,EAAM,WAAWhH,EAAG,KAAK,GAC7BA;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,WAAU;AAAA,EAC1B;AAAA,EACA,UAAU;AACN,SAAK,YAAY,IACjB,KAAK,MAAM,QAAO,GAClB,KAAK,MAAM,QAAO;AAAA,EACtB;AACJ;AAWO,MAAMiH,KAAO,CAACL,GAAME,GAAKI,MAAY,IAAIP,GAAKC,GAAME,CAAG,EAAE,OAAOI,CAAO,EAAE,OAAM;AACtFD,GAAK,SAAS,CAACL,GAAME,MAAQ,IAAIH,GAAKC,GAAME,CAAG;AChF/C;AAGA,MAAMK,KAAsB,uBAAO,CAAC,GAC9BC,KAAsB,uBAAO,CAAC;AAM7B,SAASC,GAAQ5N,GAAO6N,IAAQ,IAAI;AACvC,MAAI,OAAO7N,KAAU,WAAW;AAC5B,UAAM8N,IAASD,KAAS,IAAIA,CAAK;AACjC,UAAM,IAAI,MAAMC,IAAS,gCAAgC,OAAO9N,CAAK;AAAA,EACzE;AACA,SAAOA;AACX;AAGO,SAAS+N,GAAS/N,GAAOnD,GAAQgR,IAAQ,IAAI;AAChD,QAAMpR,IAAQuR,GAAShO,CAAK,GACtB3D,IAAM2D,GAAO,QACbiO,IAAWpR,MAAW;AAC5B,MAAI,CAACJ,KAAUwR,KAAY5R,MAAQQ,GAAS;AACxC,UAAMiR,IAASD,KAAS,IAAIA,CAAK,MAC3BK,IAAQD,IAAW,cAAcpR,CAAM,KAAK,IAC5CsR,IAAM1R,IAAQ,UAAUJ,CAAG,KAAK,QAAQ,OAAO2D,CAAK;AAC1D,UAAM,IAAI,MAAM8N,IAAS,wBAAwBI,IAAQ,WAAWC,CAAG;AAAA,EAC3E;AACA,SAAOnO;AACX;AAEO,SAASoO,GAAoBrS,GAAK;AACrC,QAAMoB,IAAMpB,EAAI,SAAS,EAAE;AAC3B,SAAOoB,EAAI,SAAS,IAAI,MAAMA,IAAMA;AACxC;AACO,SAASkR,GAAYlR,GAAK;AAC7B,MAAI,OAAOA,KAAQ;AACf,UAAM,IAAI,MAAM,8BAA8B,OAAOA,CAAG;AAC5D,SAAOA,MAAQ,KAAKuQ,KAAM,OAAO,OAAOvQ,CAAG;AAC/C;AAEO,SAASmR,GAAgB7R,GAAO;AACnC,SAAO4R,GAAYE,GAAY9R,CAAK,CAAC;AACzC;AACO,SAAS+R,GAAgB/R,GAAO;AACnCgS,SAAAA,GAAQhS,CAAK,GACN4R,GAAYE,GAAY,WAAW,KAAK9R,CAAK,EAAE,QAAO,CAAE,CAAC;AACpE;AACO,SAASiS,GAAgBlQ,GAAGnC,GAAK;AACpC,SAAOsS,GAAYnQ,EAAE,SAAS,EAAE,EAAE,SAASnC,IAAM,GAAG,GAAG,CAAC;AAC5D;AACO,SAASuS,GAAgBpQ,GAAGnC,GAAK;AACpC,SAAOqS,GAAgBlQ,GAAGnC,CAAG,EAAE,QAAO;AAC1C;AAcO,SAASwS,EAAYhB,GAAO1Q,GAAK2R,GAAgB;AACpD,MAAI9S;AACJ,MAAI,OAAOmB,KAAQ;AACf,QAAI;AACA,MAAAnB,IAAM2S,GAAYxR,CAAG;AAAA,IACzB,SACO4R,GAAG;AACN,YAAM,IAAI,MAAMlB,IAAQ,+CAA+CkB,CAAC;AAAA,IAC5E;AAAA,WAEKf,GAAS7Q,CAAG;AAGjB,IAAAnB,IAAM,WAAW,KAAKmB,CAAG;AAAA;AAGzB,UAAM,IAAI,MAAM0Q,IAAQ,mCAAmC;AAEnD,SAAA7R,EAAI,QAGTA;AACX;AAyCA,MAAMgT,KAAW,CAACxQ,MAAM,OAAOA,KAAM,YAAYkP,MAAOlP;AACjD,SAASyQ,GAAQzQ,GAAGyE,GAAKiM,GAAK;AACjC,SAAOF,GAASxQ,CAAC,KAAKwQ,GAAS/L,CAAG,KAAK+L,GAASE,CAAG,KAAKjM,KAAOzE,KAAKA,IAAI0Q;AAC5E;AAMO,SAASC,GAAStB,GAAOrP,GAAGyE,GAAKiM,GAAK;AAMzC,MAAI,CAACD,GAAQzQ,GAAGyE,GAAKiM,CAAG;AACpB,UAAM,IAAI,MAAM,oBAAoBrB,IAAQ,OAAO5K,IAAM,aAAaiM,IAAM,WAAW1Q,CAAC;AAChG;AAOO,SAAS4Q,GAAO5Q,GAAG;AACtB,MAAInC;AACJ,OAAKA,IAAM,GAAGmC,IAAIkP,IAAKlP,MAAMmP,IAAKtR,KAAO;AACrC;AACJ,SAAOA;AACX;AAmBO,MAAMgT,KAAU,CAAC7Q,OAAOmP,MAAO,OAAOnP,CAAC,KAAKmP;AAQ5C,SAAS2B,GAAeC,GAASC,GAAUC,GAAQ;AACtD,MAAI,OAAOF,KAAY,YAAYA,IAAU;AACzC,UAAM,IAAI,MAAM,0BAA0B;AAC9C,MAAI,OAAOC,KAAa,YAAYA,IAAW;AAC3C,UAAM,IAAI,MAAM,2BAA2B;AAC/C,MAAI,OAAOC,KAAW;AAClB,UAAM,IAAI,MAAM,2BAA2B;AAE/C,QAAMC,IAAM,CAACrT,MAAQ,IAAI,WAAWA,CAAG,GACjCsT,IAAO,CAACnQ,MAAS,WAAW,GAAGA,CAAI;AACzC,MAAIoQ,IAAIF,EAAIH,CAAO,GACfM,IAAIH,EAAIH,CAAO,GACfjT,IAAI;AACR,QAAMwT,IAAQ,MAAM;AAChB,IAAAF,EAAE,KAAK,CAAC,GACRC,EAAE,KAAK,CAAC,GACRvT,IAAI;AAAA,EACR,GACMqG,IAAI,IAAI5E,MAAM0R,EAAOI,GAAGD,GAAG,GAAG7R,CAAC,GAC/BgS,IAAS,CAACC,IAAON,EAAI,CAAC,MAAM;AAI9B,IAFAG,IAAIlN,EAAEgN,EAAK,CAAI,GAAGK,CAAI,GACtBJ,IAAIjN,EAAC,GACDqN,EAAK,WAAW,MAEpBH,IAAIlN,EAAEgN,EAAK,CAAI,GAAGK,CAAI,GACtBJ,IAAIjN,EAAC;AAAA,EACT,GACMsN,IAAM,MAAM;AAEd,QAAI3T,OAAO;AACP,YAAM,IAAI,MAAM,yBAAyB;AAC7C,QAAID,IAAM;AACV,UAAM2G,IAAM,CAAA;AACZ,WAAO3G,IAAMmT,KAAU;AACnB,MAAAI,IAAIjN,EAAC;AACL,YAAMuN,IAAKN,EAAE,MAAK;AAClB,MAAA5M,EAAI,KAAKkN,CAAE,GACX7T,KAAOuT,EAAE;AAAA,IACb;AACA,WAAOO,GAAa,GAAGnN,CAAG;AAAA,EAC9B;AAUA,SATiB,CAACgN,GAAMI,MAAS;AAC7B,IAAAN,EAAK,GACLC,EAAOC,CAAI;AACX,QAAIhU;AACJ,WAAO,EAAEA,IAAMoU,EAAKH,EAAG,CAAE;AACrB,MAAAF,EAAM;AACV,WAAAD,EAAK,GACE9T;AAAA,EACX;AAEJ;AA2CO,SAASqU,GAAgBxO,GAAQyO,GAAQC,IAAY,CAAA,GAAI;AAC5D,MAAI,CAAC1O,KAAU,OAAOA,KAAW;AAC7B,UAAM,IAAI,MAAM,+BAA+B;AACnD,WAAS2O,EAAWC,GAAWC,GAAcC,GAAO;AAChD,UAAMnU,IAAMqF,EAAO4O,CAAS;AAC5B,QAAIE,KAASnU,MAAQ;AACjB;AACJ,UAAMoU,IAAU,OAAOpU;AACvB,QAAIoU,MAAYF,KAAgBlU,MAAQ;AACpC,YAAM,IAAI,MAAM,UAAUiU,CAAS,0BAA0BC,CAAY,SAASE,CAAO,EAAE;AAAA,EACnG;AACA,SAAO,QAAQN,CAAM,EAAE,QAAQ,CAAC,CAACT,GAAGD,CAAC,MAAMY,EAAWX,GAAGD,GAAG,EAAK,CAAC,GAClE,OAAO,QAAQW,CAAS,EAAE,QAAQ,CAAC,CAACV,GAAGD,CAAC,MAAMY,EAAWX,GAAGD,GAAG,EAAI,CAAC;AACxE;AAWO,SAASiB,GAASC,GAAI;AACzB,QAAMC,IAAM,oBAAI,QAAO;AACvB,SAAO,CAACC,MAAQC,MAAS;AACrB,UAAMzU,IAAMuU,EAAI,IAAIC,CAAG;AACvB,QAAIxU,MAAQ;AACR,aAAOA;AACX,UAAM0U,IAAWJ,EAAGE,GAAK,GAAGC,CAAI;AAChC,WAAAF,EAAI,IAAIC,GAAKE,CAAQ,GACdA;AAAA,EACX;AACJ;AC1TA;AAGA,MAAMxD,KAAM,OAAO,CAAC,GAAGC,IAAM,OAAO,CAAC,GAAGwD,KAAsB,uBAAO,CAAC,GAAGC,KAAsB,uBAAO,CAAC,GAEjGC,KAAsB,uBAAO,CAAC,GAAGC,KAAsB,uBAAO,CAAC,GAAGC,KAAsB,uBAAO,CAAC,GAEhGC,KAAsB,uBAAO,CAAC,GAAGC,KAAsB,uBAAO,CAAC,GAAGC,KAAuB,uBAAO,EAAE;AAEjG,SAASC,GAAI7T,GAAGC,GAAG;AACtB,QAAMC,IAASF,IAAIC;AACnB,SAAOC,KAAU0P,KAAM1P,IAASD,IAAIC;AACxC;AAuBO,SAAS4T,GAAOC,GAAQC,GAAQ;AACnC,MAAID,MAAWnE;AACX,UAAM,IAAI,MAAM,kCAAkC;AACtD,MAAIoE,KAAUpE;AACV,UAAM,IAAI,MAAM,4CAA4CoE,CAAM;AAEtE,MAAIhU,IAAI6T,GAAIE,GAAQC,CAAM,GACtB/T,IAAI+T,GAEJC,IAAIrE,IAAcsE,IAAIrE;AAC1B,SAAO7P,MAAM4P,MAAK;AAEd,UAAMuE,IAAIlU,IAAID,GACRoU,IAAInU,IAAID,GACRe,IAAIkT,IAAIC,IAAIC;AAGlB,IAAAlU,IAAID,GAAGA,IAAIoU,GAAGH,IAAIC,GAAUA,IAAInT;AAAA,EACpC;AAEA,MADYd,MACA4P;AACR,UAAM,IAAI,MAAM,wBAAwB;AAC5C,SAAOgE,GAAII,GAAGD,CAAM;AACxB;AACA,SAASK,GAAeC,GAAIC,GAAM7T,GAAG;AACjC,MAAI,CAAC4T,EAAG,IAAIA,EAAG,IAAIC,CAAI,GAAG7T,CAAC;AACvB,UAAM,IAAI,MAAM,yBAAyB;AACjD;AAKA,SAAS8T,GAAUF,GAAI5T,GAAG;AACtB,QAAM+T,KAAUH,EAAG,QAAQzE,KAAO0D,IAC5BgB,IAAOD,EAAG,IAAI5T,GAAG+T,CAAM;AAC7B,SAAAJ,GAAeC,GAAIC,GAAM7T,CAAC,GACnB6T;AACX;AACA,SAASG,GAAUJ,GAAI5T,GAAG;AACtB,QAAMiU,KAAUL,EAAG,QAAQd,MAAOE,IAC5BjN,IAAK6N,EAAG,IAAI5T,GAAG2S,EAAG,GAClBvB,IAAIwC,EAAG,IAAI7N,GAAIkO,CAAM,GACrBC,IAAKN,EAAG,IAAI5T,GAAGoR,CAAC,GAChBtT,IAAI8V,EAAG,IAAIA,EAAG,IAAIM,GAAIvB,EAAG,GAAGvB,CAAC,GAC7ByC,IAAOD,EAAG,IAAIM,GAAIN,EAAG,IAAI9V,GAAG8V,EAAG,GAAG,CAAC;AACzC,SAAAD,GAAeC,GAAIC,GAAM7T,CAAC,GACnB6T;AACX;AAGA,SAASM,GAAWC,GAAG;AACnB,QAAMC,IAAMC,GAAMF,CAAC,GACbG,IAAKC,GAAcJ,CAAC,GACpBK,IAAKF,EAAGF,GAAKA,EAAI,IAAIA,EAAI,GAAG,CAAC,GAC7BK,IAAKH,EAAGF,GAAKI,CAAE,GACfE,IAAKJ,EAAGF,GAAKA,EAAI,IAAII,CAAE,CAAC,GACxBG,KAAMR,IAAIrB,MAAOG;AACvB,SAAO,CAACU,GAAI5T,MAAM;AACd,QAAI6U,IAAMjB,EAAG,IAAI5T,GAAG4U,CAAE,GAClBE,IAAMlB,EAAG,IAAIiB,GAAKJ,CAAE;AACxB,UAAMM,IAAMnB,EAAG,IAAIiB,GAAKH,CAAE,GACpBM,IAAMpB,EAAG,IAAIiB,GAAKF,CAAE,GACpBM,IAAKrB,EAAG,IAAIA,EAAG,IAAIkB,CAAG,GAAG9U,CAAC,GAC1BkV,IAAKtB,EAAG,IAAIA,EAAG,IAAImB,CAAG,GAAG/U,CAAC;AAChC,IAAA6U,IAAMjB,EAAG,KAAKiB,GAAKC,GAAKG,CAAE,GAC1BH,IAAMlB,EAAG,KAAKoB,GAAKD,GAAKG,CAAE;AAC1B,UAAMC,IAAKvB,EAAG,IAAIA,EAAG,IAAIkB,CAAG,GAAG9U,CAAC,GAC1B6T,IAAOD,EAAG,KAAKiB,GAAKC,GAAKK,CAAE;AACjC,WAAAxB,GAAeC,GAAIC,GAAM7T,CAAC,GACnB6T;AAAA,EACX;AACJ;AAQO,SAASW,GAAcJ,GAAG;AAG7B,MAAIA,IAAIxB;AACJ,UAAM,IAAI,MAAM,qCAAqC;AAEzD,MAAIwC,IAAIhB,IAAIjF,GACRkG,IAAI;AACR,SAAOD,IAAIzC,OAAQzD;AACf,IAAAkG,KAAKzC,IACL0C;AAGJ,MAAIC,IAAI3C;AACR,QAAM4C,IAAMjB,GAAMF,CAAC;AACnB,SAAOoB,GAAWD,GAAKD,CAAC,MAAM;AAG1B,QAAIA,MAAM;AACN,YAAM,IAAI,MAAM,+CAA+C;AAGvE,MAAID,MAAM;AACN,WAAOvB;AAGX,MAAI2B,IAAKF,EAAI,IAAID,GAAGF,CAAC;AACrB,QAAMM,KAAUN,IAAIjG,KAAOwD;AAC3B,SAAO,SAAqBiB,GAAI5T,GAAG;AAC/B,QAAI4T,EAAG,IAAI5T,CAAC;AACR,aAAOA;AAEX,QAAIwV,GAAW5B,GAAI5T,CAAC,MAAM;AACtB,YAAM,IAAI,MAAM,yBAAyB;AAE7C,QAAI2V,IAAIN,GACJjO,IAAIwM,EAAG,IAAIA,EAAG,KAAK6B,CAAE,GACrBG,IAAIhC,EAAG,IAAI5T,GAAGoV,CAAC,GACfS,IAAIjC,EAAG,IAAI5T,GAAG0V,CAAM;AAGxB,WAAO,CAAC9B,EAAG,IAAIgC,GAAGhC,EAAG,GAAG,KAAG;AACvB,UAAIA,EAAG,IAAIgC,CAAC;AACR,eAAOhC,EAAG;AACd,UAAI9V,IAAI,GAEJgY,IAAQlC,EAAG,IAAIgC,CAAC;AACpB,aAAO,CAAChC,EAAG,IAAIkC,GAAOlC,EAAG,GAAG;AAGxB,YAFA9V,KACAgY,IAAQlC,EAAG,IAAIkC,CAAK,GAChBhY,MAAM6X;AACN,gBAAM,IAAI,MAAM,yBAAyB;AAGjD,YAAMI,IAAW5G,KAAO,OAAOwG,IAAI7X,IAAI,CAAC,GAClCyB,IAAIqU,EAAG,IAAIxM,GAAG2O,CAAQ;AAE5B,MAAAJ,IAAI7X,GACJsJ,IAAIwM,EAAG,IAAIrU,CAAC,GACZqW,IAAIhC,EAAG,IAAIgC,GAAGxO,CAAC,GACfyO,IAAIjC,EAAG,IAAIiC,GAAGtW,CAAC;AAAA,IACnB;AACA,WAAOsW;AAAA,EACX;AACJ;AAYO,SAASG,GAAO5B,GAAG;AAEtB,SAAIA,IAAIvB,OAAQD,KACLkB,KAEPM,IAAIpB,OAAQF,KACLkB,KAEPI,IAAIlB,OAASD,KACNkB,GAAWC,CAAC,IAEhBI,GAAcJ,CAAC;AAC1B;AAIA,MAAM6B,KAAe;AAAA,EACjB;AAAA,EAAU;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAClD;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EACnC;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAC5B;AACO,SAASC,GAAcC,GAAO;AACjC,QAAMC,IAAU;AAAA,IACZ,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,EACd,GACUC,IAAOJ,GAAa,OAAO,CAAC1D,GAAKvU,OACnCuU,EAAIvU,CAAG,IAAI,YACJuU,IACR6D,CAAO;AACV,SAAAvE,GAAgBsE,GAAOE,CAAI,GAIpBF;AACX;AAMO,SAASG,GAAM1C,GAAIrW,GAAKgZ,GAAO;AAClC,MAAIA,IAAQrH;AACR,UAAM,IAAI,MAAM,yCAAyC;AAC7D,MAAIqH,MAAUrH;AACV,WAAO0E,EAAG;AACd,MAAI2C,MAAUpH;AACV,WAAO5R;AACX,MAAIiZ,IAAI5C,EAAG,KACP6C,IAAIlZ;AACR,SAAOgZ,IAAQrH;AACX,IAAIqH,IAAQpH,MACRqH,IAAI5C,EAAG,IAAI4C,GAAGC,CAAC,IACnBA,IAAI7C,EAAG,IAAI6C,CAAC,GACZF,MAAUpH;AAEd,SAAOqH;AACX;AAMO,SAASE,GAAc9C,GAAI+C,GAAMC,IAAW,IAAO;AACtD,QAAMC,IAAW,IAAI,MAAMF,EAAK,MAAM,EAAE,KAAKC,IAAWhD,EAAG,OAAO,MAAS,GAErEkD,IAAgBH,EAAK,OAAO,CAACI,GAAKxZ,GAAKO,MACrC8V,EAAG,IAAIrW,CAAG,IACHwZ,KACXF,EAAS/Y,CAAC,IAAIiZ,GACPnD,EAAG,IAAImD,GAAKxZ,CAAG,IACvBqW,EAAG,GAAG,GAEHoD,IAAcpD,EAAG,IAAIkD,CAAa;AAExC,SAAAH,EAAK,YAAY,CAACI,GAAKxZ,GAAKO,MACpB8V,EAAG,IAAIrW,CAAG,IACHwZ,KACXF,EAAS/Y,CAAC,IAAI8V,EAAG,IAAImD,GAAKF,EAAS/Y,CAAC,CAAC,GAC9B8V,EAAG,IAAImD,GAAKxZ,CAAG,IACvByZ,CAAW,GACPH;AACX;AAcO,SAASrB,GAAW5B,GAAI5T,GAAG;AAG9B,QAAMiX,KAAUrD,EAAG,QAAQzE,KAAOwD,IAC5BuE,IAAUtD,EAAG,IAAI5T,GAAGiX,CAAM,GAC1BE,IAAMvD,EAAG,IAAIsD,GAAStD,EAAG,GAAG,GAC5BwD,IAAOxD,EAAG,IAAIsD,GAAStD,EAAG,IAAI,GAC9ByD,IAAKzD,EAAG,IAAIsD,GAAStD,EAAG,IAAIA,EAAG,GAAG,CAAC;AACzC,MAAI,CAACuD,KAAO,CAACC,KAAQ,CAACC;AAClB,UAAM,IAAI,MAAM,gCAAgC;AACpD,SAAOF,IAAM,IAAIC,IAAO,IAAI;AAChC;AAOO,SAASE,GAAQtX,GAAGuX,GAAY;AAEnC,EAAIA,MAAe,UACfxT,GAAQwT,CAAU;AACtB,QAAMC,IAAcD,MAAe,SAAYA,IAAavX,EAAE,SAAS,CAAC,EAAE,QACpEyX,IAAc,KAAK,KAAKD,IAAc,CAAC;AAC7C,SAAO,EAAE,YAAYA,GAAa,aAAAC,EAAW;AACjD;AAoBO,SAASnD,GAAMoD,GAAOC,GAC7B7Q,IAAO,IAAOuP,IAAO,IAAI;AACrB,MAAIqB,KAASxI;AACT,UAAM,IAAI,MAAM,4CAA4CwI,CAAK;AACrE,MAAIE,GACAC,GACAC,IAAe,IACfC;AACJ,MAAI,OAAOJ,KAAiB,YAAYA,KAAgB,MAAM;AAC1D,QAAItB,EAAK,QAAQvP;AACb,YAAM,IAAI,MAAM,sCAAsC;AAC1D,UAAMkR,IAAQL;AACd,IAAIK,EAAM,SACNJ,IAAcI,EAAM,OACpBA,EAAM,SACNH,IAAQG,EAAM,OACd,OAAOA,EAAM,QAAS,cACtBlR,IAAOkR,EAAM,OACb,OAAOA,EAAM,gBAAiB,cAC9BF,IAAeE,EAAM,eACzBD,IAAiBC,EAAM;AAAA,EAC3B;AAEI,IAAI,OAAOL,KAAiB,aACxBC,IAAcD,IACdtB,EAAK,SACLwB,IAAQxB,EAAK;AAErB,QAAM,EAAE,YAAY4B,GAAM,aAAaC,EAAK,IAAKZ,GAAQI,GAAOE,CAAW;AAC3E,MAAIM,IAAQ;AACR,UAAM,IAAI,MAAM,gDAAgD;AACpE,MAAIC;AACJ,QAAMC,IAAI,OAAO,OAAO;AAAA,IACpB,OAAAV;AAAA,IACA,MAAA5Q;AAAA,IACA,MAAAmR;AAAA,IACA,OAAAC;AAAA,IACA,MAAMrH,GAAQoH,CAAI;AAAA,IAClB,MAAM/I;AAAAA,IACN,KAAKC;AAAAA,IACL,gBAAgB4I;AAAA,IAChB,QAAQ,CAACxa,MAAQ4V,GAAI5V,GAAKma,CAAK;AAAA,IAC/B,SAAS,CAACna,MAAQ;AACd,UAAI,OAAOA,KAAQ;AACf,cAAM,IAAI,MAAM,iDAAiD,OAAOA,CAAG;AAC/E,aAAO2R,MAAO3R,KAAOA,IAAMma;AAAA,IAC/B;AAAA,IACA,KAAK,CAACna,MAAQA,MAAQ2R;AAAAA;AAAAA,IAEtB,aAAa,CAAC3R,MAAQ,CAAC6a,EAAE,IAAI7a,CAAG,KAAK6a,EAAE,QAAQ7a,CAAG;AAAA,IAClD,OAAO,CAACA,OAASA,IAAM4R,OAASA;AAAAA,IAChC,KAAK,CAAC5R,MAAQ4V,GAAI,CAAC5V,GAAKma,CAAK;AAAA,IAC7B,KAAK,CAACW,GAAKC,MAAQD,MAAQC;AAAA,IAC3B,KAAK,CAAC/a,MAAQ4V,GAAI5V,IAAMA,GAAKma,CAAK;AAAA,IAClC,KAAK,CAACW,GAAKC,MAAQnF,GAAIkF,IAAMC,GAAKZ,CAAK;AAAA,IACvC,KAAK,CAACW,GAAKC,MAAQnF,GAAIkF,IAAMC,GAAKZ,CAAK;AAAA,IACvC,KAAK,CAACW,GAAKC,MAAQnF,GAAIkF,IAAMC,GAAKZ,CAAK;AAAA,IACvC,KAAK,CAACna,GAAKgZ,MAAUD,GAAM8B,GAAG7a,GAAKgZ,CAAK;AAAA,IACxC,KAAK,CAAC8B,GAAKC,MAAQnF,GAAIkF,IAAMjF,GAAOkF,GAAKZ,CAAK,GAAGA,CAAK;AAAA;AAAA,IAEtD,MAAM,CAACna,MAAQA,IAAMA;AAAA,IACrB,MAAM,CAAC8a,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,MAAM,CAACD,GAAKC,MAAQD,IAAMC;AAAA,IAC1B,KAAK,CAAC/a,MAAQ6V,GAAO7V,GAAKma,CAAK;AAAA,IAC/B,MAAMG,MACD,CAAC7X,OACOmY,MACDA,IAAQnC,GAAO0B,CAAK,IACjBS,EAAMC,GAAGpY,CAAC;AAAA,IAEzB,SAAS,CAACzC,MAASuJ,IAAOsJ,GAAgB7S,GAAK2a,CAAK,IAAIhI,GAAgB3S,GAAK2a,CAAK;AAAA,IAClF,WAAW,CAACja,GAAOsa,IAAiB,OAAS;AACzC,UAAIR,GAAgB;AAChB,YAAI,CAACA,EAAe,SAAS9Z,EAAM,MAAM,KAAKA,EAAM,SAASia;AACzD,gBAAM,IAAI,MAAM,+BAA+BH,IAAiB,iBAAiB9Z,EAAM,MAAM;AAEjG,cAAMua,IAAS,IAAI,WAAWN,CAAK;AAEnC,QAAAM,EAAO,IAAIva,GAAO6I,IAAO,IAAI0R,EAAO,SAASva,EAAM,MAAM,GACzDA,IAAQua;AAAA,MACZ;AACA,UAAIva,EAAM,WAAWia;AACjB,cAAM,IAAI,MAAM,+BAA+BA,IAAQ,iBAAiBja,EAAM,MAAM;AACxF,UAAIwa,IAAS3R,IAAOkJ,GAAgB/R,CAAK,IAAI6R,GAAgB7R,CAAK;AAGlE,UAFI6Z,MACAW,IAAStF,GAAIsF,GAAQf,CAAK,IAC1B,CAACa,KACG,CAACH,EAAE,QAAQK,CAAM;AACjB,cAAM,IAAI,MAAM,kDAAkD;AAG1E,aAAOA;AAAA,IACX;AAAA;AAAA,IAEA,aAAa,CAAChQ,MAAQiO,GAAc0B,GAAG3P,CAAG;AAAA;AAAA;AAAA,IAG1C,MAAM,CAACnJ,GAAGC,GAAG6H,MAAOA,IAAI7H,IAAID;AAAA,EACpC,CAAK;AACD,SAAO,OAAO,OAAO8Y,CAAC;AAC1B;AA+CO,SAASM,GAAoBC,GAAY;AAC5C,MAAI,OAAOA,KAAe;AACtB,UAAM,IAAI,MAAM,4BAA4B;AAChD,QAAMC,IAAYD,EAAW,SAAS,CAAC,EAAE;AACzC,SAAO,KAAK,KAAKC,IAAY,CAAC;AAClC;AAQO,SAASC,GAAiBF,GAAY;AACzC,QAAMta,IAASqa,GAAoBC,CAAU;AAC7C,SAAOta,IAAS,KAAK,KAAKA,IAAS,CAAC;AACxC;AAcO,SAASya,GAAejK,GAAK8J,GAAY7R,IAAO,IAAO;AAC1D,QAAMjJ,IAAMgR,EAAI,QACVkK,IAAWL,GAAoBC,CAAU,GACzCK,IAASH,GAAiBF,CAAU;AAE1C,MAAI9a,IAAM,MAAMA,IAAMmb,KAAUnb,IAAM;AAClC,UAAM,IAAI,MAAM,cAAcmb,IAAS,+BAA+Bnb,CAAG;AAC7E,QAAMN,IAAMuJ,IAAOkJ,GAAgBnB,CAAG,IAAIiB,GAAgBjB,CAAG,GAEvDoK,IAAU9F,GAAI5V,GAAKob,IAAaxJ,CAAG,IAAIA;AAC7C,SAAOrI,IAAOsJ,GAAgB6I,GAASF,CAAQ,IAAI7I,GAAgB+I,GAASF,CAAQ;AACxF;AC3gBA;AAGA,MAAM7J,KAAM,OAAO,CAAC,GACdC,KAAM,OAAO,CAAC;AACb,SAAS+J,GAASC,GAAWC,GAAM;AACtC,QAAMtZ,IAAMsZ,EAAK,OAAM;AACvB,SAAOD,IAAYrZ,IAAMsZ;AAC7B;AAOO,SAASC,GAAWjS,GAAGkS,GAAQ;AAClC,QAAMC,IAAa7C,GAActP,EAAE,IAAIkS,EAAO,IAAI,CAAC9C,MAAMA,EAAE,CAAC,CAAC;AAC7D,SAAO8C,EAAO,IAAI,CAAC9C,GAAG1Y,MAAMsJ,EAAE,WAAWoP,EAAE,SAAS+C,EAAWzb,CAAC,CAAC,CAAC,CAAC;AACvE;AACA,SAAS0b,GAAUC,GAAG1Y,GAAM;AACxB,MAAI,CAAC,OAAO,cAAc0Y,CAAC,KAAKA,KAAK,KAAKA,IAAI1Y;AAC1C,UAAM,IAAI,MAAM,uCAAuCA,IAAO,cAAc0Y,CAAC;AACrF;AACA,SAASC,GAAUD,GAAGE,GAAY;AAC9B,EAAAH,GAAUC,GAAGE,CAAU;AACvB,QAAMC,IAAU,KAAK,KAAKD,IAAaF,CAAC,IAAI,GACtCI,IAAa,MAAMJ,IAAI,IACvBK,IAAY,KAAKL,GACjBM,IAAOlJ,GAAQ4I,CAAC,GAChBO,IAAU,OAAOP,CAAC;AACxB,SAAO,EAAE,SAAAG,GAAS,YAAAC,GAAY,MAAAE,GAAM,WAAAD,GAAW,SAAAE,EAAO;AAC1D;AACA,SAASC,GAAYja,GAAGka,GAAQC,GAAO;AACnC,QAAM,EAAE,YAAAN,GAAY,MAAAE,GAAM,WAAAD,GAAW,SAAAE,EAAO,IAAKG;AACjD,MAAIC,IAAQ,OAAOpa,IAAI+Z,CAAI,GACvBM,IAAQra,KAAKga;AAMjB,EAAII,IAAQP,MAERO,KAASN,GACTO,KAASlL;AAEb,QAAMmL,IAAcJ,IAASL,GACvB1a,IAASmb,IAAc,KAAK,IAAIF,CAAK,IAAI,GACzCG,IAASH,MAAU,GACnBI,IAAQJ,IAAQ,GAChBK,IAASP,IAAS,MAAM;AAE9B,SAAO,EAAE,OAAAG,GAAO,QAAAlb,GAAQ,QAAAob,GAAQ,OAAAC,GAAO,QAAAC,GAAQ,SAD/BH,EACsC;AAC1D;AACA,SAASI,GAAkBpB,GAAQlS,GAAG;AAClC,MAAI,CAAC,MAAM,QAAQkS,CAAM;AACrB,UAAM,IAAI,MAAM,gBAAgB;AACpC,EAAAA,EAAO,QAAQ,CAAC9C,GAAG1Y,MAAM;AACrB,QAAI,EAAE0Y,aAAapP;AACf,YAAM,IAAI,MAAM,4BAA4BtJ,CAAC;AAAA,EACrD,CAAC;AACL;AACA,SAAS6c,GAAmBC,GAASzE,GAAO;AACxC,MAAI,CAAC,MAAM,QAAQyE,CAAO;AACtB,UAAM,IAAI,MAAM,2BAA2B;AAC/C,EAAAA,EAAQ,QAAQ,CAAC,GAAG9c,MAAM;AACtB,QAAI,CAACqY,EAAM,QAAQ,CAAC;AAChB,YAAM,IAAI,MAAM,6BAA6BrY,CAAC;AAAA,EACtD,CAAC;AACL;AAIA,MAAM+c,KAAmB,oBAAI,QAAO,GAC9BC,KAAmB,oBAAI,QAAO;AACpC,SAASC,GAAK3G,GAAG;AAGb,SAAO0G,GAAiB,IAAI1G,CAAC,KAAK;AACtC;AACA,SAAS4G,GAAQhb,GAAG;AAChB,MAAIA,MAAMkP;AACN,UAAM,IAAI,MAAM,cAAc;AACtC;AAmBO,MAAM+L,GAAK;AAAA;AAAA,EAEd,YAAYC,GAAOna,GAAM;AACrB,SAAK,OAAOma,EAAM,MAClB,KAAK,OAAOA,EAAM,MAClB,KAAK,KAAKA,EAAM,IAChB,KAAK,OAAOna;AAAA,EAChB;AAAA;AAAA,EAEA,cAAcoa,GAAKnb,GAAGwW,IAAI,KAAK,MAAM;AACjC,QAAIC,IAAI0E;AACR,WAAOnb,IAAIkP;AACP,MAAIlP,IAAImP,OACJqH,IAAIA,EAAE,IAAIC,CAAC,IACfA,IAAIA,EAAE,OAAM,GACZzW,MAAMmP;AAEV,WAAOqH;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,iBAAiB4E,GAAO3B,GAAG;AACvB,UAAM,EAAE,SAAAG,GAAS,YAAAC,EAAU,IAAKH,GAAUD,GAAG,KAAK,IAAI,GAChDH,IAAS,CAAA;AACf,QAAI9C,IAAI4E,GACJC,IAAO7E;AACX,aAAS0D,IAAS,GAAGA,IAASN,GAASM,KAAU;AAC7C,MAAAmB,IAAO7E,GACP8C,EAAO,KAAK+B,CAAI;AAEhB,eAASvd,IAAI,GAAGA,IAAI+b,GAAY/b;AAC5B,QAAAud,IAAOA,EAAK,IAAI7E,CAAC,GACjB8C,EAAO,KAAK+B,CAAI;AAEpB,MAAA7E,IAAI6E,EAAK,OAAM;AAAA,IACnB;AACA,WAAO/B;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAKG,GAAG6B,GAAa,GAAG;AAEpB,QAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;AAClB,YAAM,IAAI,MAAM,gBAAgB;AAEpC,QAAI9E,IAAI,KAAK,MACT4B,IAAI,KAAK;AAMb,UAAMmD,IAAK7B,GAAUD,GAAG,KAAK,IAAI;AACjC,aAASS,IAAS,GAAGA,IAASqB,EAAG,SAASrB,KAAU;AAEhD,YAAM,EAAE,OAAAG,GAAO,QAAAlb,GAAQ,QAAAob,GAAQ,OAAAC,GAAO,QAAAC,GAAQ,SAAAe,EAAO,IAAKvB,GAAY,GAAGC,GAAQqB,CAAE;AACnF,UAAIlB,GACAE,IAGAnC,IAAIA,EAAE,IAAIc,GAASuB,GAAQa,EAAYE,CAAO,CAAC,CAAC,IAIhDhF,IAAIA,EAAE,IAAI0C,GAASsB,GAAOc,EAAYnc,CAAM,CAAC,CAAC;AAAA,IAEtD;AACA,WAAA6b,GAAQ,CAAC,GAIF,EAAE,GAAAxE,GAAG,GAAA4B,EAAC;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAWqB,GAAG6B,GAAa,GAAGvE,IAAM,KAAK,MAAM;AAC3C,UAAMwE,IAAK7B,GAAUD,GAAG,KAAK,IAAI;AACjC,aAASS,IAAS,GAAGA,IAASqB,EAAG,WACzB,MAAMrM,IAD4BgL,KAAU;AAGhD,YAAM,EAAE,OAAAG,GAAO,QAAAlb,GAAQ,QAAAob,GAAQ,OAAAC,EAAK,IAAKP,GAAY,GAAGC,GAAQqB,CAAE;AAElE,UADA,IAAIlB,GACA,CAAAE,GAKC;AACD,cAAMnB,IAAOkC,EAAYnc,CAAM;AAC/B,QAAA4X,IAAMA,EAAI,IAAIyD,IAAQpB,EAAK,OAAM,IAAKA,CAAI;AAAA,MAC9C;AAAA,IACJ;AACA,WAAA4B,GAAQ,CAAC,GACFjE;AAAA,EACX;AAAA,EACA,eAAe0C,GAAG2B,GAAOK,GAAW;AAEhC,QAAIC,IAAOb,GAAiB,IAAIO,CAAK;AACrC,WAAKM,MACDA,IAAO,KAAK,iBAAiBN,GAAO3B,CAAC,GACjCA,MAAM,MAEF,OAAOgC,KAAc,eACrBC,IAAOD,EAAUC,CAAI,IACzBb,GAAiB,IAAIO,GAAOM,CAAI,KAGjCA;AAAA,EACX;AAAA,EACA,OAAON,GAAO3C,GAAQgD,GAAW;AAC7B,UAAMhC,IAAIsB,GAAKK,CAAK;AACpB,WAAO,KAAK,KAAK3B,GAAG,KAAK,eAAeA,GAAG2B,GAAOK,CAAS,GAAGhD,CAAM;AAAA,EACxE;AAAA,EACA,OAAO2C,GAAO3C,GAAQgD,GAAWE,GAAM;AACnC,UAAMlC,IAAIsB,GAAKK,CAAK;AACpB,WAAI3B,MAAM,IACC,KAAK,cAAc2B,GAAO3C,GAAQkD,CAAI,IAC1C,KAAK,WAAWlC,GAAG,KAAK,eAAeA,GAAG2B,GAAOK,CAAS,GAAGhD,GAAQkD,CAAI;AAAA,EACpF;AAAA;AAAA;AAAA;AAAA,EAIA,YAAYvH,GAAGqF,GAAG;AACd,IAAAD,GAAUC,GAAG,KAAK,IAAI,GACtBqB,GAAiB,IAAI1G,GAAGqF,CAAC,GACzBoB,GAAiB,OAAOzG,CAAC;AAAA,EAC7B;AAAA,EACA,SAAS+G,GAAK;AACV,WAAOJ,GAAKI,CAAG,MAAM;AAAA,EACzB;AACJ;AAKO,SAASS,GAAcV,GAAOE,GAAOS,GAAIC,GAAI;AAChD,MAAI/E,IAAMqE,GACNW,IAAKb,EAAM,MACXc,IAAKd,EAAM;AACf,SAAOW,IAAK3M,MAAO4M,IAAK5M;AACpB,IAAI2M,IAAK1M,OACL4M,IAAKA,EAAG,IAAIhF,CAAG,IACf+E,IAAK3M,OACL6M,IAAKA,EAAG,IAAIjF,CAAG,IACnBA,IAAMA,EAAI,OAAM,GAChB8E,MAAO1M,IACP2M,MAAO3M;AAEX,SAAO,EAAE,IAAA4M,GAAI,IAAAC,EAAE;AACnB;AAWO,SAASC,GAAU7U,GAAG8U,GAAQ5C,GAAQsB,GAAS;AAOlD,EAAAF,GAAkBpB,GAAQlS,CAAC,GAC3BuT,GAAmBC,GAASsB,CAAM;AAClC,QAAMC,IAAU7C,EAAO,QACjB8C,IAAUxB,EAAQ;AACxB,MAAIuB,MAAYC;AACZ,UAAM,IAAI,MAAM,qDAAqD;AAEzE,QAAMhF,IAAOhQ,EAAE,MACTgT,IAAQxJ,GAAO,OAAOuL,CAAO,CAAC;AACpC,MAAItC,IAAa;AACjB,EAAIO,IAAQ,KACRP,IAAaO,IAAQ,IAChBA,IAAQ,IACbP,IAAaO,IAAQ,IAChBA,IAAQ,MACbP,IAAa;AACjB,QAAMwC,IAAOxL,GAAQgJ,CAAU,GACzByC,IAAU,IAAI,MAAM,OAAOD,CAAI,IAAI,CAAC,EAAE,KAAKjF,CAAI,GAC/CmF,IAAW,KAAK,OAAOL,EAAO,OAAO,KAAKrC,CAAU,IAAIA;AAC9D,MAAI1T,IAAMiR;AACV,WAAStZ,IAAIye,GAAUze,KAAK,GAAGA,KAAK+b,GAAY;AAC5C,IAAAyC,EAAQ,KAAKlF,CAAI;AACjB,aAASlW,IAAI,GAAGA,IAAIkb,GAASlb,KAAK;AAC9B,YAAMuX,IAASmC,EAAQ1Z,CAAC,GAClBkZ,IAAQ,OAAQ3B,KAAU,OAAO3a,CAAC,IAAKue,CAAI;AACjD,MAAAC,EAAQlC,CAAK,IAAIkC,EAAQlC,CAAK,EAAE,IAAId,EAAOpY,CAAC,CAAC;AAAA,IACjD;AACA,QAAIsb,IAAOpF;AAEX,aAASlW,IAAIob,EAAQ,SAAS,GAAGG,IAAOrF,GAAMlW,IAAI,GAAGA;AACjD,MAAAub,IAAOA,EAAK,IAAIH,EAAQpb,CAAC,CAAC,GAC1Bsb,IAAOA,EAAK,IAAIC,CAAI;AAGxB,QADAtW,IAAMA,EAAI,IAAIqW,CAAI,GACd1e,MAAM;AACN,eAASoD,IAAI,GAAGA,IAAI2Y,GAAY3Y;AAC5B,QAAAiF,IAAMA,EAAI,OAAM;AAAA,EAC5B;AACA,SAAOA;AACX;AAoGA,SAASuW,GAAYC,GAAOxG,GAAOrP,GAAM;AACrC,MAAIqP,GAAO;AACP,QAAIA,EAAM,UAAUwG;AAChB,YAAM,IAAI,MAAM,gDAAgD;AACpE,WAAAzG,GAAcC,CAAK,GACZA;AAAA,EACX;AAEI,WAAO7B,GAAMqI,GAAO,EAAE,MAAA7V,GAAM;AAEpC;AAEO,SAAS8V,GAAmBC,GAAMC,GAAOC,IAAY,CAAA,GAAIC,GAAQ;AAGpE,MAFIA,MAAW,WACXA,IAASH,MAAS,YAClB,CAACC,KAAS,OAAOA,KAAU;AAC3B,UAAM,IAAI,MAAM,kBAAkBD,CAAI,eAAe;AACzD,aAAWrG,KAAK,CAAC,KAAK,KAAK,GAAG,GAAG;AAC7B,UAAMxY,IAAM8e,EAAMtG,CAAC;AACnB,QAAI,EAAE,OAAOxY,KAAQ,YAAYA,IAAMkR;AACnC,YAAM,IAAI,MAAM,SAASsH,CAAC,0BAA0B;AAAA,EAC5D;AACA,QAAM5C,IAAK8I,GAAYI,EAAM,GAAGC,EAAU,IAAIC,CAAM,GAC9CC,IAAKP,GAAYI,EAAM,GAAGC,EAAU,IAAIC,CAAM,GAE9CE,IAAS,CAAC,MAAM,MAAM,KADQ,GACD;AACnC,aAAW1G,KAAK0G;AAEZ,QAAI,CAACtJ,EAAG,QAAQkJ,EAAMtG,CAAC,CAAC;AACpB,YAAM,IAAI,MAAM,SAASA,CAAC,0CAA0C;AAE5E,SAAAsG,IAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIA,CAAK,CAAC,GACvC,EAAE,OAAAA,GAAO,IAAAlJ,GAAI,IAAAqJ,EAAE;AAC1B;ACrbA;AAOA,MAAME,KAAa,CAAC5f,GAAK6f,OAAS7f,KAAOA,KAAO,IAAI6f,IAAM,CAACA,KAAOzK,MAAOyK;AAIlE,SAASC,GAAiBhM,GAAGiM,GAAOtd,GAAG;AAI1C,QAAM,CAAC,CAACud,GAAIC,CAAE,GAAG,CAACC,GAAIC,CAAE,CAAC,IAAIJ,GACvB7I,IAAK0I,GAAWO,IAAKrM,GAAGrR,CAAC,GACzB0U,IAAKyI,GAAW,CAACK,IAAKnM,GAAGrR,CAAC;AAGhC,MAAI6b,IAAKxK,IAAIoD,IAAK8I,IAAK7I,IAAK+I,GACxB3B,IAAK,CAACrH,IAAK+I,IAAK9I,IAAKgJ;AACzB,QAAMC,IAAQ9B,IAAK3M,IACb0O,IAAQ9B,IAAK5M;AACnB,EAAIyO,MACA9B,IAAK,CAACA,IACN+B,MACA9B,IAAK,CAACA;AAGV,QAAM+B,IAAUhN,GAAQ,KAAK,KAAKD,GAAO5Q,CAAC,IAAI,CAAC,CAAC,IAAImP;AACpD,MAAI0M,IAAK3M,MAAO2M,KAAMgC,KAAW/B,IAAK5M,MAAO4M,KAAM+B;AAC/C,UAAM,IAAI,MAAM,2CAA2CxM,CAAC;AAEhE,SAAO,EAAE,OAAAsM,GAAO,IAAA9B,GAAI,OAAA+B,GAAO,IAAA9B,EAAE;AACjC;AACA,SAASgC,GAAkBC,GAAQ;AAC/B,MAAI,CAAC,CAAC,WAAW,aAAa,KAAK,EAAE,SAASA,CAAM;AAChD,UAAM,IAAI,MAAM,2DAA2D;AAC/E,SAAOA;AACX;AACA,SAASC,GAAgB3H,GAAM4H,GAAK;AAChC,QAAMC,IAAQ,CAAA;AACd,WAASC,KAAW,OAAO,KAAKF,CAAG;AAE/B,IAAAC,EAAMC,CAAO,IAAI9H,EAAK8H,CAAO,MAAM,SAAYF,EAAIE,CAAO,IAAI9H,EAAK8H,CAAO;AAE9EC,SAAAA,GAAMF,EAAM,MAAM,MAAM,GACxBE,GAAMF,EAAM,SAAS,SAAS,GAC1BA,EAAM,WAAW,UACjBJ,GAAkBI,EAAM,MAAM,GAC3BA;AACX;AACO,MAAMG,WAAe,MAAM;AAAA,EAC9B,YAAYhe,IAAI,IAAI;AAChB,UAAMA,CAAC;AAAA,EACX;AACJ;AAQO,MAAMie,KAAM;AAAA;AAAA,EAEf,KAAKD;AAAA;AAAA,EAEL,MAAM;AAAA,IACF,QAAQ,CAACtc,GAAKlD,MAAS;AACnB,YAAM,EAAE,KAAK8L,EAAC,IAAK2T;AACnB,UAAIvc,IAAM,KAAKA,IAAM;AACjB,cAAM,IAAI4I,EAAE,uBAAuB;AACvC,UAAI9L,EAAK,SAAS;AACd,cAAM,IAAI8L,EAAE,2BAA2B;AAC3C,YAAM4T,IAAU1f,EAAK,SAAS,GACxBhB,IAAM+R,GAAoB2O,CAAO;AACvC,UAAK1gB,EAAI,SAAS,IAAK;AACnB,cAAM,IAAI8M,EAAE,sCAAsC;AAEtD,YAAM6T,IAASD,IAAU,MAAM3O,GAAqB/R,EAAI,SAAS,IAAK,GAAG,IAAI;AAE7E,aADU+R,GAAoB7N,CAAG,IACtByc,IAAS3gB,IAAMgB;AAAA,IAC9B;AAAA;AAAA,IAEA,OAAOkD,GAAKlD,GAAM;AACd,YAAM,EAAE,KAAK8L,EAAC,IAAK2T;AACnB,UAAI1e,IAAM;AACV,UAAImC,IAAM,KAAKA,IAAM;AACjB,cAAM,IAAI4I,EAAE,uBAAuB;AACvC,UAAI9L,EAAK,SAAS,KAAKA,EAAKe,GAAK,MAAMmC;AACnC,cAAM,IAAI4I,EAAE,uBAAuB;AACvC,YAAMnK,IAAQ3B,EAAKe,GAAK,GAClB6e,IAAS,CAAC,EAAEje,IAAQ;AAC1B,UAAInC,IAAS;AACb,UAAI,CAACogB;AACD,QAAApgB,IAASmC;AAAA,WACR;AAED,cAAMge,IAAShe,IAAQ;AACvB,YAAI,CAACge;AACD,gBAAM,IAAI7T,EAAE,mDAAmD;AACnE,YAAI6T,IAAS;AACT,gBAAM,IAAI7T,EAAE,0CAA0C;AAC1D,cAAM+T,IAAc7f,EAAK,SAASe,GAAKA,IAAM4e,CAAM;AACnD,YAAIE,EAAY,WAAWF;AACvB,gBAAM,IAAI7T,EAAE,uCAAuC;AACvD,YAAI+T,EAAY,CAAC,MAAM;AACnB,gBAAM,IAAI/T,EAAE,sCAAsC;AACtD,mBAAWpL,KAAKmf;AACZ,UAAArgB,IAAUA,KAAU,IAAKkB;AAE7B,YADAK,KAAO4e,GACHngB,IAAS;AACT,gBAAM,IAAIsM,EAAE,wCAAwC;AAAA,MAC5D;AACA,YAAMyG,IAAIvS,EAAK,SAASe,GAAKA,IAAMvB,CAAM;AACzC,UAAI+S,EAAE,WAAW/S;AACb,cAAM,IAAIsM,EAAE,gCAAgC;AAChD,aAAO,EAAE,GAAAyG,GAAG,GAAGvS,EAAK,SAASe,IAAMvB,CAAM,EAAC;AAAA,IAC9C;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA,EAKI,MAAM;AAAA,IACF,OAAOd,GAAK;AACR,YAAM,EAAE,KAAKoN,EAAC,IAAK2T;AACnB,UAAI/gB,IAAM2R;AACN,cAAM,IAAIvE,EAAE,4CAA4C;AAC5D,UAAIhM,IAAMiR,GAAoBrS,CAAG;AAIjC,UAFI,OAAO,SAASoB,EAAI,CAAC,GAAG,EAAE,IAAI,MAC9BA,IAAM,OAAOA,IACbA,EAAI,SAAS;AACb,cAAM,IAAIgM,EAAE,gDAAgD;AAChE,aAAOhM;AAAA,IACX;AAAA,IACA,OAAOE,GAAM;AACT,YAAM,EAAE,KAAK8L,EAAC,IAAK2T;AACnB,UAAIzf,EAAK,CAAC,IAAI;AACV,cAAM,IAAI8L,EAAE,qCAAqC;AACrD,UAAI9L,EAAK,CAAC,MAAM,KAAQ,EAAEA,EAAK,CAAC,IAAI;AAChC,cAAM,IAAI8L,EAAE,qDAAqD;AACrE,aAAOmF,GAAgBjR,CAAI;AAAA,IAC/B;AAAA,EACR;AAAA,EACI,MAAMF,GAAK;AAEP,UAAM,EAAE,KAAKgM,GAAG,MAAMgU,GAAK,MAAMC,EAAG,IAAKN,IACnCzf,IAAOwR,EAAY,aAAa1R,CAAG,GACnC,EAAE,GAAGkgB,GAAU,GAAGC,EAAY,IAAKF,EAAI,OAAO,IAAM/f,CAAI;AAC9D,QAAIigB,EAAa;AACb,YAAM,IAAInU,EAAE,6CAA6C;AAC7D,UAAM,EAAE,GAAGoU,GAAQ,GAAGC,EAAU,IAAKJ,EAAI,OAAO,GAAMC,CAAQ,GACxD,EAAE,GAAGI,GAAQ,GAAGC,EAAU,IAAKN,EAAI,OAAO,GAAMI,CAAU;AAChE,QAAIE,EAAW;AACX,YAAM,IAAIvU,EAAE,6CAA6C;AAC7D,WAAO,EAAE,GAAGgU,EAAI,OAAOI,CAAM,GAAG,GAAGJ,EAAI,OAAOM,CAAM,EAAC;AAAA,EACzD;AAAA,EACA,WAAWE,GAAK;AACZ,UAAM,EAAE,MAAMP,GAAK,MAAMD,EAAG,IAAKL,IAC3Bc,IAAKR,EAAI,OAAO,GAAMD,EAAI,OAAOQ,EAAI,CAAC,CAAC,GACvCE,IAAKT,EAAI,OAAO,GAAMD,EAAI,OAAOQ,EAAI,CAAC,CAAC,GACvCG,IAAMF,IAAKC;AACjB,WAAOT,EAAI,OAAO,IAAMU,CAAG;AAAA,EAC/B;AACJ,GAGMpQ,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGwD,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC,GAAGC,KAAM,OAAO,CAAC;AACjF,SAAS0M,GAAetC,GAAIpO,GAAK;AACpC,QAAM,EAAE,OAAO2Q,EAAQ,IAAKvC;AAC5B,MAAI1f;AACJ,MAAI,OAAOsR,KAAQ;AACf,IAAAtR,IAAMsR;AAAA,OAEL;AACD,QAAI5Q,IAAQoS,EAAY,eAAexB,CAAG;AAC1C,QAAI;AACA,MAAAtR,IAAM0f,EAAG,UAAUhf,CAAK;AAAA,IAC5B,QACc;AACV,YAAM,IAAI,MAAM,8CAA8CuhB,CAAQ,SAAS,OAAO3Q,CAAG,EAAE;AAAA,IAC/F;AAAA,EACJ;AACA,MAAI,CAACoO,EAAG,YAAY1f,CAAG;AACnB,UAAM,IAAI,MAAM,4CAA4C;AAChE,SAAOA;AACX;AAkBO,SAASkiB,GAAavC,GAAQwC,IAAY,IAAI;AACjD,QAAMC,IAAY/C,GAAmB,eAAeM,GAAQwC,CAAS,GAC/D,EAAE,IAAA9L,GAAI,IAAAqJ,EAAE,IAAK0C;AACnB,MAAI7C,IAAQ6C,EAAU;AACtB,QAAM,EAAE,GAAGC,GAAU,GAAGC,EAAW,IAAK/C;AACxC,EAAAjL,GAAgB6N,GAAW,IAAI;AAAA,IAC3B,oBAAoB;AAAA,IACpB,eAAe;AAAA,IACf,eAAe;AAAA,IACf,WAAW;AAAA,IACX,SAAS;AAAA,IACT,MAAM;AAAA,IACN,gBAAgB;AAAA,EACxB,CAAK;AACD,QAAM,EAAE,MAAAI,EAAI,IAAKJ;AACjB,MAAII,MAEI,CAAClM,EAAG,IAAIkJ,EAAM,CAAC,KAAK,OAAOgD,EAAK,QAAS,YAAY,CAAC,MAAM,QAAQA,EAAK,OAAO;AAChF,UAAM,IAAI,MAAM,4DAA4D;AAGpF,QAAM7b,IAAU8b,GAAYnM,GAAIqJ,CAAE;AAClC,WAAS+C,IAA+B;AACpC,QAAI,CAACpM,EAAG;AACJ,YAAM,IAAI,MAAM,4DAA4D;AAAA,EACpF;AAEA,WAASqM,EAAaC,GAAI9E,GAAO+E,GAAc;AAC3C,UAAM,EAAE,GAAA5M,GAAG,MAAM6H,EAAM,SAAQ,GACzBgF,IAAKxM,EAAG,QAAQL,CAAC;AAEvB,QADA6K,GAAM+B,GAAc,cAAc,GAC9BA,GAAc;AACd,MAAAH,EAA4B;AAC5B,YAAMK,IAAW,CAACzM,EAAG,MAAM,CAAC;AAC5B,aAAO1N,GAAYoa,GAAQD,CAAQ,GAAGD,CAAE;AAAA,IAC5C;AAEI,aAAOla,GAAY,WAAW,GAAG,CAAI,GAAGka,GAAIxM,EAAG,QAAQ,CAAC,CAAC;AAAA,EAEjE;AACA,WAAS2M,EAAetiB,GAAO;AAC3B+F,IAAAA,GAAO/F,GAAO,QAAW,OAAO;AAChC,UAAM,EAAE,WAAWyd,GAAM,uBAAuB8E,EAAM,IAAKvc,GACrD5F,IAASJ,EAAM,QACfwiB,IAAOxiB,EAAM,CAAC,GACdyiB,IAAOziB,EAAM,SAAS,CAAC;AAE7B,QAAII,MAAWqd,MAAS+E,MAAS,KAAQA,MAAS,IAAO;AACrD,YAAMlN,IAAIK,EAAG,UAAU8M,CAAI;AAC3B,UAAI,CAAC9M,EAAG,QAAQL,CAAC;AACb,cAAM,IAAI,MAAM,qCAAqC;AACzD,YAAMoN,IAAKC,EAAoBrN,CAAC;AAChC,UAAIsN;AACJ,UAAI;AACA,QAAAA,IAAIjN,EAAG,KAAK+M,CAAE;AAAA,MAClB,SACOG,GAAW;AACd,cAAMC,IAAMD,aAAqB,QAAQ,OAAOA,EAAU,UAAU;AACpE,cAAM,IAAI,MAAM,2CAA2CC,CAAG;AAAA,MAClE;AACA,MAAAf,EAA4B;AAC5B,YAAMgB,IAASpN,EAAG,MAAMiN,CAAC;AAEzB,cADmBJ,IAAO,OAAO,MACfO,MACdH,IAAIjN,EAAG,IAAIiN,CAAC,IACT,EAAE,GAAAtN,GAAG,GAAAsN,EAAC;AAAA,IACjB,WACSxiB,MAAWmiB,KAAUC,MAAS,GAAM;AAEzC,YAAMQ,IAAIrN,EAAG,OACPL,IAAIK,EAAG,UAAU8M,EAAK,SAAS,GAAGO,CAAC,CAAC,GACpCJ,IAAIjN,EAAG,UAAU8M,EAAK,SAASO,GAAGA,IAAI,CAAC,CAAC;AAC9C,UAAI,CAACC,EAAU3N,GAAGsN,CAAC;AACf,cAAM,IAAI,MAAM,4BAA4B;AAChD,aAAO,EAAE,GAAAtN,GAAG,GAAAsN,EAAC;AAAA,IACjB;AAEI,YAAM,IAAI,MAAM,yBAAyBxiB,CAAM,yBAAyBqd,CAAI,oBAAoB8E,CAAM,EAAE;AAAA,EAEhH;AACA,QAAMW,IAAczB,EAAU,WAAWO,GACnCmB,IAAc1B,EAAU,aAAaa;AAC3C,WAASK,EAAoBrN,GAAG;AAC5B,UAAM8N,IAAKzN,EAAG,IAAIL,CAAC,GACb+N,IAAK1N,EAAG,IAAIyN,GAAI9N,CAAC;AACvB,WAAOK,EAAG,IAAIA,EAAG,IAAI0N,GAAI1N,EAAG,IAAIL,GAAGuJ,EAAM,CAAC,CAAC,GAAGA,EAAM,CAAC;AAAA,EACzD;AAGA,WAASoE,EAAU3N,GAAGsN,GAAG;AACrB,UAAMU,IAAO3N,EAAG,IAAIiN,CAAC,GACfW,IAAQZ,EAAoBrN,CAAC;AACnC,WAAOK,EAAG,IAAI2N,GAAMC,CAAK;AAAA,EAC7B;AAGA,MAAI,CAACN,EAAUpE,EAAM,IAAIA,EAAM,EAAE;AAC7B,UAAM,IAAI,MAAM,mCAAmC;AAGvD,QAAM2E,IAAO7N,EAAG,IAAIA,EAAG,IAAIkJ,EAAM,GAAGlK,EAAG,GAAGC,EAAG,GACvC6O,KAAQ9N,EAAG,IAAIA,EAAG,IAAIkJ,EAAM,CAAC,GAAG,OAAO,EAAE,CAAC;AAChD,MAAIlJ,EAAG,IAAIA,EAAG,IAAI6N,GAAMC,EAAK,CAAC;AAC1B,UAAM,IAAI,MAAM,0BAA0B;AAE9C,WAASC,EAAOtS,GAAOrP,GAAG4hB,IAAU,IAAO;AACvC,QAAI,CAAChO,EAAG,QAAQ5T,CAAC,KAAM4hB,KAAWhO,EAAG,IAAI5T,CAAC;AACtC,YAAM,IAAI,MAAM,wBAAwBqP,CAAK,EAAE;AACnD,WAAOrP;AAAA,EACX;AACA,WAAS6hB,EAAUC,GAAO;AACtB,QAAI,EAAEA,aAAiB5G;AACnB,YAAM,IAAI,MAAM,0BAA0B;AAAA,EAClD;AACA,WAAS6G,EAAiB1Q,GAAG;AACzB,QAAI,CAACyO,KAAQ,CAACA,EAAK;AACf,YAAM,IAAI,MAAM,SAAS;AAC7B,WAAOzC,GAAiBhM,GAAGyO,EAAK,SAAS7C,EAAG,KAAK;AAAA,EACrD;AAKA,QAAM+E,KAAe3P,GAAS,CAACmE,GAAGyL,MAAO;AACrC,UAAM,EAAE,GAAAC,GAAG,GAAAC,GAAG,GAAA7M,EAAC,IAAKkB;AAEpB,QAAI5C,EAAG,IAAI0B,GAAG1B,EAAG,GAAG;AAChB,aAAO,EAAE,GAAGsO,GAAG,GAAGC,EAAC;AACvB,UAAMC,IAAM5L,EAAE,IAAG;AAGjB,IAAIyL,KAAM,SACNA,IAAKG,IAAMxO,EAAG,MAAMA,EAAG,IAAI0B,CAAC;AAChC,UAAM/B,IAAIK,EAAG,IAAIsO,GAAGD,CAAE,GAChBpB,IAAIjN,EAAG,IAAIuO,GAAGF,CAAE,GAChBI,IAAKzO,EAAG,IAAI0B,GAAG2M,CAAE;AACvB,QAAIG;AACA,aAAO,EAAE,GAAGxO,EAAG,MAAM,GAAGA,EAAG,KAAI;AACnC,QAAI,CAACA,EAAG,IAAIyO,GAAIzO,EAAG,GAAG;AAClB,YAAM,IAAI,MAAM,kBAAkB;AACtC,WAAO,EAAE,GAAAL,GAAG,GAAAsN,EAAC;AAAA,EACjB,CAAC,GAGKyB,KAAkBjQ,GAAS,CAACmE,MAAM;AACpC,QAAIA,EAAE,OAAO;AAIT,UAAIkJ,EAAU,sBAAsB,CAAC9L,EAAG,IAAI4C,EAAE,CAAC;AAC3C;AACJ,YAAM,IAAI,MAAM,iBAAiB;AAAA,IACrC;AAEA,UAAM,EAAE,GAAAjD,GAAG,GAAAsN,MAAMrK,EAAE,SAAQ;AAC3B,QAAI,CAAC5C,EAAG,QAAQL,CAAC,KAAK,CAACK,EAAG,QAAQiN,CAAC;AAC/B,YAAM,IAAI,MAAM,sCAAsC;AAC1D,QAAI,CAACK,EAAU3N,GAAGsN,CAAC;AACf,YAAM,IAAI,MAAM,mCAAmC;AACvD,QAAI,CAACrK,EAAE,cAAa;AAChB,YAAM,IAAI,MAAM,wCAAwC;AAC5D,WAAO;AAAA,EACX,CAAC;AACD,WAAS+L,EAAWC,GAAUC,GAAKC,GAAK/E,GAAOC,GAAO;AAClD,WAAA8E,IAAM,IAAIxH,EAAMtH,EAAG,IAAI8O,EAAI,GAAGF,CAAQ,GAAGE,EAAI,GAAGA,EAAI,CAAC,GACrDD,IAAMvJ,GAASyE,GAAO8E,CAAG,GACzBC,IAAMxJ,GAAS0E,GAAO8E,CAAG,GAClBD,EAAI,IAAIC,CAAG;AAAA,EACtB;AAAA,EAMA,MAAMxH,EAAM;AAAA;AAAA,IAER,YAAYgH,GAAGC,GAAG7M,GAAG;AACjB,WAAK,IAAIqM,EAAO,KAAKO,CAAC,GACtB,KAAK,IAAIP,EAAO,KAAKQ,GAAG,EAAI,GAC5B,KAAK,IAAIR,EAAO,KAAKrM,CAAC,GACtB,OAAO,OAAO,IAAI;AAAA,IACtB;AAAA,IACA,OAAO,QAAQ;AACX,aAAOwH;AAAA,IACX;AAAA;AAAA,IAEA,OAAO,WAAWtG,GAAG;AACjB,YAAM,EAAE,GAAAjD,GAAG,GAAAsN,EAAC,IAAKrK,KAAK,CAAA;AACtB,UAAI,CAACA,KAAK,CAAC5C,EAAG,QAAQL,CAAC,KAAK,CAACK,EAAG,QAAQiN,CAAC;AACrC,cAAM,IAAI,MAAM,sBAAsB;AAC1C,UAAIrK,aAAa0E;AACb,cAAM,IAAI,MAAM,8BAA8B;AAElD,aAAItH,EAAG,IAAIL,CAAC,KAAKK,EAAG,IAAIiN,CAAC,IACd3F,EAAM,OACV,IAAIA,EAAM3H,GAAGsN,GAAGjN,EAAG,GAAG;AAAA,IACjC;AAAA,IACA,OAAO,UAAU3V,GAAO;AACpB,YAAMmW,IAAI8G,EAAM,WAAWkG,EAAYpd,GAAO/F,GAAO,QAAW,OAAO,CAAC,CAAC;AACzE,aAAAmW,EAAE,eAAc,GACTA;AAAA,IACX;AAAA,IACA,OAAO,QAAQzV,GAAK;AAChB,aAAOuc,EAAM,UAAU7K,EAAY,YAAY1R,CAAG,CAAC;AAAA,IACvD;AAAA,IACA,IAAI,IAAI;AACJ,aAAO,KAAK,SAAQ,EAAG;AAAA,IAC3B;AAAA,IACA,IAAI,IAAI;AACJ,aAAO,KAAK,SAAQ,EAAG;AAAA,IAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,WAAWkb,IAAa,GAAG8I,IAAS,IAAM;AACtC,aAAAC,GAAK,YAAY,MAAM/I,CAAU,GAC5B8I,KACD,KAAK,SAAS/P,EAAG,GACd;AAAA,IACX;AAAA;AAAA;AAAA,IAGA,iBAAiB;AACb,MAAA0P,GAAgB,IAAI;AAAA,IACxB;AAAA,IACA,WAAW;AACP,YAAM,EAAE,GAAAzB,EAAC,IAAK,KAAK,SAAQ;AAC3B,UAAI,CAACjN,EAAG;AACJ,cAAM,IAAI,MAAM,6BAA6B;AACjD,aAAO,CAACA,EAAG,MAAMiN,CAAC;AAAA,IACtB;AAAA;AAAA,IAEA,OAAOiB,GAAO;AACV,MAAAD,EAAUC,CAAK;AACf,YAAM,EAAE,GAAGe,GAAI,GAAGC,GAAI,GAAGC,EAAE,IAAK,MAC1B,EAAE,GAAGC,GAAI,GAAGC,GAAI,GAAGC,EAAE,IAAKpB,GAC1BqB,IAAKvP,EAAG,IAAIA,EAAG,IAAIiP,GAAIK,CAAE,GAAGtP,EAAG,IAAIoP,GAAID,CAAE,CAAC,GAC1CK,IAAKxP,EAAG,IAAIA,EAAG,IAAIkP,GAAII,CAAE,GAAGtP,EAAG,IAAIqP,GAAIF,CAAE,CAAC;AAChD,aAAOI,KAAMC;AAAA,IACjB;AAAA;AAAA,IAEA,SAAS;AACL,aAAO,IAAIlI,EAAM,KAAK,GAAGtH,EAAG,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,SAAS;AACL,YAAM,EAAE,GAAAtU,GAAG,GAAAC,EAAC,IAAKud,GACXuG,IAAKzP,EAAG,IAAIrU,GAAGqT,EAAG,GAClB,EAAE,GAAGiQ,GAAI,GAAGC,GAAI,GAAGC,EAAE,IAAK;AAChC,UAAIO,IAAK1P,EAAG,MAAM2P,IAAK3P,EAAG,MAAM4P,IAAK5P,EAAG,MACpC6P,IAAK7P,EAAG,IAAIiP,GAAIA,CAAE,GAClBa,IAAK9P,EAAG,IAAIkP,GAAIA,CAAE,GAClBa,IAAK/P,EAAG,IAAImP,GAAIA,CAAE,GAClBa,IAAKhQ,EAAG,IAAIiP,GAAIC,CAAE;AACtB,aAAAc,IAAKhQ,EAAG,IAAIgQ,GAAIA,CAAE,GAClBJ,IAAK5P,EAAG,IAAIiP,GAAIE,CAAE,GAClBS,IAAK5P,EAAG,IAAI4P,GAAIA,CAAE,GAClBF,IAAK1P,EAAG,IAAItU,GAAGkkB,CAAE,GACjBD,IAAK3P,EAAG,IAAIyP,GAAIM,CAAE,GAClBJ,IAAK3P,EAAG,IAAI0P,GAAIC,CAAE,GAClBD,IAAK1P,EAAG,IAAI8P,GAAIH,CAAE,GAClBA,IAAK3P,EAAG,IAAI8P,GAAIH,CAAE,GAClBA,IAAK3P,EAAG,IAAI0P,GAAIC,CAAE,GAClBD,IAAK1P,EAAG,IAAIgQ,GAAIN,CAAE,GAClBE,IAAK5P,EAAG,IAAIyP,GAAIG,CAAE,GAClBG,IAAK/P,EAAG,IAAItU,GAAGqkB,CAAE,GACjBC,IAAKhQ,EAAG,IAAI6P,GAAIE,CAAE,GAClBC,IAAKhQ,EAAG,IAAItU,GAAGskB,CAAE,GACjBA,IAAKhQ,EAAG,IAAIgQ,GAAIJ,CAAE,GAClBA,IAAK5P,EAAG,IAAI6P,GAAIA,CAAE,GAClBA,IAAK7P,EAAG,IAAI4P,GAAIC,CAAE,GAClBA,IAAK7P,EAAG,IAAI6P,GAAIE,CAAE,GAClBF,IAAK7P,EAAG,IAAI6P,GAAIG,CAAE,GAClBL,IAAK3P,EAAG,IAAI2P,GAAIE,CAAE,GAClBE,IAAK/P,EAAG,IAAIkP,GAAIC,CAAE,GAClBY,IAAK/P,EAAG,IAAI+P,GAAIA,CAAE,GAClBF,IAAK7P,EAAG,IAAI+P,GAAIC,CAAE,GAClBN,IAAK1P,EAAG,IAAI0P,GAAIG,CAAE,GAClBD,IAAK5P,EAAG,IAAI+P,GAAID,CAAE,GAClBF,IAAK5P,EAAG,IAAI4P,GAAIA,CAAE,GAClBA,IAAK5P,EAAG,IAAI4P,GAAIA,CAAE,GACX,IAAItI,EAAMoI,GAAIC,GAAIC,CAAE;AAAA,IAC/B;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI1B,GAAO;AACP,MAAAD,EAAUC,CAAK;AACf,YAAM,EAAE,GAAGe,GAAI,GAAGC,GAAI,GAAGC,EAAE,IAAK,MAC1B,EAAE,GAAGC,GAAI,GAAGC,GAAI,GAAGC,EAAE,IAAKpB;AAChC,UAAIwB,IAAK1P,EAAG,MAAM2P,IAAK3P,EAAG,MAAM4P,IAAK5P,EAAG;AACxC,YAAMtU,IAAIwd,EAAM,GACVuG,IAAKzP,EAAG,IAAIkJ,EAAM,GAAGlK,EAAG;AAC9B,UAAI6Q,IAAK7P,EAAG,IAAIiP,GAAIG,CAAE,GAClBU,IAAK9P,EAAG,IAAIkP,GAAIG,CAAE,GAClBU,IAAK/P,EAAG,IAAImP,GAAIG,CAAE,GAClBU,IAAKhQ,EAAG,IAAIiP,GAAIC,CAAE,GAClBe,IAAKjQ,EAAG,IAAIoP,GAAIC,CAAE;AACtB,MAAAW,IAAKhQ,EAAG,IAAIgQ,GAAIC,CAAE,GAClBA,IAAKjQ,EAAG,IAAI6P,GAAIC,CAAE,GAClBE,IAAKhQ,EAAG,IAAIgQ,GAAIC,CAAE,GAClBA,IAAKjQ,EAAG,IAAIiP,GAAIE,CAAE;AAClB,UAAIe,IAAKlQ,EAAG,IAAIoP,GAAIE,CAAE;AACtB,aAAAW,IAAKjQ,EAAG,IAAIiQ,GAAIC,CAAE,GAClBA,IAAKlQ,EAAG,IAAI6P,GAAIE,CAAE,GAClBE,IAAKjQ,EAAG,IAAIiQ,GAAIC,CAAE,GAClBA,IAAKlQ,EAAG,IAAIkP,GAAIC,CAAE,GAClBO,IAAK1P,EAAG,IAAIqP,GAAIC,CAAE,GAClBY,IAAKlQ,EAAG,IAAIkQ,GAAIR,CAAE,GAClBA,IAAK1P,EAAG,IAAI8P,GAAIC,CAAE,GAClBG,IAAKlQ,EAAG,IAAIkQ,GAAIR,CAAE,GAClBE,IAAK5P,EAAG,IAAItU,GAAGukB,CAAE,GACjBP,IAAK1P,EAAG,IAAIyP,GAAIM,CAAE,GAClBH,IAAK5P,EAAG,IAAI0P,GAAIE,CAAE,GAClBF,IAAK1P,EAAG,IAAI8P,GAAIF,CAAE,GAClBA,IAAK5P,EAAG,IAAI8P,GAAIF,CAAE,GAClBD,IAAK3P,EAAG,IAAI0P,GAAIE,CAAE,GAClBE,IAAK9P,EAAG,IAAI6P,GAAIA,CAAE,GAClBC,IAAK9P,EAAG,IAAI8P,GAAID,CAAE,GAClBE,IAAK/P,EAAG,IAAItU,GAAGqkB,CAAE,GACjBE,IAAKjQ,EAAG,IAAIyP,GAAIQ,CAAE,GAClBH,IAAK9P,EAAG,IAAI8P,GAAIC,CAAE,GAClBA,IAAK/P,EAAG,IAAI6P,GAAIE,CAAE,GAClBA,IAAK/P,EAAG,IAAItU,GAAGqkB,CAAE,GACjBE,IAAKjQ,EAAG,IAAIiQ,GAAIF,CAAE,GAClBF,IAAK7P,EAAG,IAAI8P,GAAIG,CAAE,GAClBN,IAAK3P,EAAG,IAAI2P,GAAIE,CAAE,GAClBA,IAAK7P,EAAG,IAAIkQ,GAAID,CAAE,GAClBP,IAAK1P,EAAG,IAAIgQ,GAAIN,CAAE,GAClBA,IAAK1P,EAAG,IAAI0P,GAAIG,CAAE,GAClBA,IAAK7P,EAAG,IAAIgQ,GAAIF,CAAE,GAClBF,IAAK5P,EAAG,IAAIkQ,GAAIN,CAAE,GAClBA,IAAK5P,EAAG,IAAI4P,GAAIC,CAAE,GACX,IAAIvI,EAAMoI,GAAIC,GAAIC,CAAE;AAAA,IAC/B;AAAA,IACA,SAAS1B,GAAO;AACZ,aAAO,KAAK,IAAIA,EAAM,OAAM,CAAE;AAAA,IAClC;AAAA,IACA,MAAM;AACF,aAAO,KAAK,OAAO5G,EAAM,IAAI;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUA,SAASzC,GAAQ;AACb,YAAM,EAAE,MAAAqH,EAAI,IAAKJ;AACjB,UAAI,CAACzC,EAAG,YAAYxE,CAAM;AACtB,cAAM,IAAI,MAAM,8BAA8B;AAClD,UAAI2C,GAAO2I;AACX,YAAMC,IAAM,CAAChkB,MAAM4iB,GAAK,OAAO,MAAM5iB,GAAG,CAACwW,MAAM6C,GAAW6B,GAAO1E,CAAC,CAAC;AAEnE,UAAIsJ,GAAM;AACN,cAAM,EAAE,OAAAnC,GAAO,IAAA9B,GAAI,OAAA+B,GAAO,IAAA9B,EAAE,IAAKiG,EAAiBtJ,CAAM,GAClD,EAAE,GAAGgK,GAAK,GAAGwB,EAAG,IAAKD,EAAInI,CAAE,GAC3B,EAAE,GAAG6G,GAAK,GAAGwB,EAAG,IAAKF,EAAIlI,CAAE;AACjC,QAAAiI,IAAOE,EAAI,IAAIC,CAAG,GAClB9I,IAAQmH,EAAWzC,EAAK,MAAM2C,GAAKC,GAAK/E,GAAOC,CAAK;AAAA,MACxD,OACK;AACD,cAAM,EAAE,GAAApH,GAAG,GAAA4B,MAAM4L,EAAIvL,CAAM;AAC3B,QAAA2C,IAAQ5E,GACRuN,IAAO3L;AAAA,MACX;AAEA,aAAOiB,GAAW6B,GAAO,CAACE,GAAO2I,CAAI,CAAC,EAAE,CAAC;AAAA,IAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,eAAeI,GAAI;AACf,YAAM,EAAE,MAAArE,EAAI,IAAKJ,GACXlJ,IAAI;AACV,UAAI,CAACyG,EAAG,QAAQkH,CAAE;AACd,cAAM,IAAI,MAAM,8BAA8B;AAClD,UAAIA,MAAOjV,MAAOsH,EAAE,IAAG;AACnB,eAAO0E,EAAM;AACjB,UAAIiJ,MAAOhV;AACP,eAAOqH;AACX,UAAIoM,GAAK,SAAS,IAAI;AAClB,eAAO,KAAK,SAASuB,CAAE;AAC3B,UAAIrE,GAAM;AACN,cAAM,EAAE,OAAAnC,GAAO,IAAA9B,GAAI,OAAA+B,GAAO,IAAA9B,EAAE,IAAKiG,EAAiBoC,CAAE,GAC9C,EAAE,IAAApI,GAAI,IAAAC,MAAOJ,GAAcV,GAAO1E,GAAGqF,GAAIC,CAAE;AACjD,eAAOyG,EAAWzC,EAAK,MAAM/D,GAAIC,GAAI2B,GAAOC,CAAK;AAAA,MACrD;AAEI,eAAOgF,GAAK,OAAOpM,GAAG2N,CAAE;AAAA,IAEhC;AAAA,IACA,qBAAqB/O,GAAG9V,GAAGC,GAAG;AAC1B,YAAM4G,IAAM,KAAK,eAAe7G,CAAC,EAAE,IAAI8V,EAAE,eAAe7V,CAAC,CAAC;AAC1D,aAAO4G,EAAI,QAAQ,SAAYA;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,SAASie,GAAW;AAChB,aAAOpC,GAAa,MAAMoC,CAAS;AAAA,IACvC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,gBAAgB;AACZ,YAAM,EAAE,eAAAC,EAAa,IAAK3E;AAC1B,aAAIE,MAAazQ,KACN,KACPkV,IACOA,EAAcnJ,GAAO,IAAI,IAC7B0H,GAAK,OAAO,MAAM/C,CAAW,EAAE,IAAG;AAAA,IAC7C;AAAA,IACA,gBAAgB;AACZ,YAAM,EAAE,eAAAyE,EAAa,IAAK5E;AAC1B,aAAIE,MAAazQ,KACN,OACPmV,IACOA,EAAcpJ,GAAO,IAAI,IAC7B,KAAK,eAAe0E,CAAQ;AAAA,IACvC;AAAA,IACA,eAAe;AAEX,aAAO,KAAK,eAAeA,CAAQ,EAAE,IAAG;AAAA,IAC5C;AAAA,IACA,QAAQO,IAAe,IAAM;AACzB/B,aAAAA,GAAM+B,GAAc,cAAc,GAClC,KAAK,eAAc,GACZgB,EAAYjG,GAAO,MAAMiF,CAAY;AAAA,IAChD;AAAA,IACA,MAAMA,IAAe,IAAM;AACvB,aAAO/a,GAAW,KAAK,QAAQ+a,CAAY,CAAC;AAAA,IAChD;AAAA,IACA,WAAW;AACP,aAAO,UAAU,KAAK,IAAG,IAAK,SAAS,KAAK,MAAK,CAAE;AAAA,IACvD;AAAA;AAAA,IAEA,IAAI,KAAK;AACL,aAAO,KAAK;AAAA,IAChB;AAAA,IACA,IAAI,KAAK;AACL,aAAO,KAAK;AAAA,IAChB;AAAA,IACA,IAAI,KAAK;AACL,aAAO,KAAK;AAAA,IAChB;AAAA,IACA,WAAWA,IAAe,IAAM;AAC5B,aAAO,KAAK,QAAQA,CAAY;AAAA,IACpC;AAAA,IACA,eAAetG,GAAY;AACvB,WAAK,WAAWA,CAAU;AAAA,IAC9B;AAAA,IACA,OAAO,WAAWP,GAAQ;AACtB,aAAOD,GAAW6B,GAAO5B,CAAM;AAAA,IACnC;AAAA,IACA,OAAO,IAAIA,GAAQsB,GAAS;AACxB,aAAOqB,GAAUf,GAAO+B,GAAI3D,GAAQsB,CAAO;AAAA,IAC/C;AAAA,IACA,OAAO,eAAe2J,GAAY;AAC9B,aAAOrJ,EAAM,KAAK,SAASqE,GAAetC,GAAIsH,CAAU,CAAC;AAAA,IAC7D;AAAA,EACR;AAEI,EAAArJ,EAAM,OAAO,IAAIA,EAAM4B,EAAM,IAAIA,EAAM,IAAIlJ,EAAG,GAAG,GAEjDsH,EAAM,OAAO,IAAIA,EAAMtH,EAAG,MAAMA,EAAG,KAAKA,EAAG,IAAI,GAE/CsH,EAAM,KAAKtH,GAEXsH,EAAM,KAAK+B;AACX,QAAMlc,KAAOkc,EAAG,MACV2F,KAAO,IAAI3H,GAAKC,GAAOwE,EAAU,OAAO,KAAK,KAAK3e,KAAO,CAAC,IAAIA,EAAI;AACxE,SAAAma,EAAM,KAAK,WAAW,CAAC,GAChBA;AACX;AAEA,SAASoF,GAAQD,GAAU;AACvB,SAAO,WAAW,GAAGA,IAAW,IAAO,CAAI;AAC/C;AA6HA,SAASN,GAAYnM,GAAIqJ,GAAI;AACzB,SAAO;AAAA,IACH,WAAWA,EAAG;AAAA,IACd,WAAW,IAAIrJ,EAAG;AAAA,IAClB,uBAAuB,IAAI,IAAIA,EAAG;AAAA,IAClC,oBAAoB;AAAA,IACpB,WAAW,IAAIqJ,EAAG;AAAA,EAC1B;AACA;AAKO,SAASuH,GAAKtJ,GAAOuJ,IAAW,IAAI;AACvC,QAAM,EAAE,IAAAxH,EAAE,IAAK/B,GACTwJ,IAAeD,EAAS,eAAeE,IACvC1gB,IAAU,OAAO,OAAO8b,GAAY7E,EAAM,IAAI+B,CAAE,GAAG,EAAE,MAAMpE,GAAiBoE,EAAG,KAAK,EAAC,CAAE;AAC7F,WAAS2H,EAAiBC,GAAW;AACjC,QAAI;AACA,aAAO,CAAC,CAACtF,GAAetC,GAAI4H,CAAS;AAAA,IACzC,QACc;AACV,aAAO;AAAA,IACX;AAAA,EACJ;AACA,WAASC,EAAiBC,GAAW5E,GAAc;AAC/C,UAAM,EAAE,WAAWzE,GAAM,uBAAAsJ,EAAqB,IAAK/gB;AACnD,QAAI;AACA,YAAM2E,IAAImc,EAAU;AAGpB,aAFI5E,MAAiB,MAAQvX,MAAM8S,KAE/ByE,MAAiB,MAASvX,MAAMoc,IACzB,KACJ,CAAC,CAAC9J,EAAM,UAAU6J,CAAS;AAAA,IACtC,QACc;AACV,aAAO;AAAA,IACX;AAAA,EACJ;AAKA,WAASE,EAAgBzT,IAAOkT,EAAazgB,EAAQ,IAAI,GAAG;AACxD,WAAO6U,GAAe9U,GAAOwN,GAAMvN,EAAQ,MAAM,MAAM,GAAGgZ,EAAG,KAAK;AAAA,EACtE;AAMA,WAASiI,EAAaL,GAAW1E,IAAe,IAAM;AAClD,WAAOjF,EAAM,KAAK,SAASqE,GAAetC,GAAI4H,CAAS,CAAC,EAAE,QAAQ1E,CAAY;AAAA,EAClF;AACA,WAASgF,EAAO3T,GAAM;AAClB,UAAMqT,IAAYI,EAAgBzT,CAAI;AACtC,WAAO,EAAE,WAAAqT,GAAW,WAAWK,EAAaL,CAAS,EAAC;AAAA,EAC1D;AAIA,WAASO,EAAUhM,GAAM;AACrB,QAAI,OAAOA,KAAS;AAChB,aAAO;AACX,QAAIA,aAAgB8B;AAChB,aAAO;AACX,UAAM,EAAE,WAAA2J,GAAW,WAAAE,GAAW,uBAAAC,EAAqB,IAAK/gB;AACxD,QAAIgZ,EAAG,kBAAkB4H,MAAcE;AACnC;AACJ,UAAMnc,IAAIyH,EAAY,OAAO+I,CAAI,EAAE;AACnC,WAAOxQ,MAAMmc,KAAanc,MAAMoc;AAAA,EACpC;AASA,WAASK,EAAgBC,GAAYC,GAAYpF,IAAe,IAAM;AAClE,QAAIiF,EAAUE,CAAU,MAAM;AAC1B,YAAM,IAAI,MAAM,+BAA+B;AACnD,QAAIF,EAAUG,CAAU,MAAM;AAC1B,YAAM,IAAI,MAAM,+BAA+B;AACnD,UAAMC,IAAIjG,GAAetC,GAAIqI,CAAU;AAEvC,WADUpK,EAAM,QAAQqK,CAAU,EACzB,SAASC,CAAC,EAAE,QAAQrF,CAAY;AAAA,EAC7C;AAaA,SAAO,OAAO,OAAO,EAAE,cAAA+E,GAAc,iBAAAG,GAAiB,QAAAF,GAAQ,OAAAjK,GAAO,OAZvD;AAAA,IACV,kBAAA0J;AAAA,IACA,kBAAAE;AAAA,IACA,iBAAAG;AAAA;AAAA,IAEA,mBAAmBL;AAAA,IACnB,kBAAkBK;AAAA,IAClB,wBAAwB,CAACpW,MAAQ0Q,GAAetC,GAAIpO,CAAG;AAAA,IACvD,WAAWgL,IAAa,GAAGuB,IAAQF,EAAM,MAAM;AAC3C,aAAOE,EAAM,WAAWvB,GAAY,EAAK;AAAA,IAC7C;AAAA,EACR,GACgF,SAAA5V,GAAS;AACzF;AAiBO,SAASwhB,GAAMvK,GAAOvM,GAAM+W,IAAY,CAAA,GAAI;AAC/C,EAAAxhB,GAAMyK,CAAI,GACVkD,GAAgB6T,GAAW,IAAI;AAAA,IAC3B,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,UAAU;AAAA,IACV,eAAe;AAAA,EACvB,CAAK;AACD,QAAMhf,IAAcgf,EAAU,eAAef,IACvC3V,IAAO0W,EAAU,SAClB,CAAC7W,MAAQ8W,MAASC,GAAUjX,GAAME,GAAK3I,GAAY,GAAGyf,CAAI,CAAC,IAC1D,EAAE,IAAA/R,GAAI,IAAAqJ,EAAE,IAAK/B,GACb,EAAE,OAAO2E,GAAa,MAAMgG,EAAM,IAAK5I,GACvC,EAAE,QAAAkI,GAAQ,cAAAD,GAAc,iBAAAG,GAAiB,OAAAS,GAAO,SAAA7hB,MAAYugB,GAAKtJ,GAAOwK,CAAS,GACjFK,IAAiB;AAAA,IACnB,SAAS;AAAA,IACT,MAAM,OAAOL,EAAU,QAAS,YAAYA,EAAU,OAAO;AAAA,IAC7D,QAAQ;AAAA;AAAA,IACR,cAAc;AAAA,EACtB,GACUM,IAAwB;AAC9B,WAASC,EAAsB5S,GAAQ;AACnC,UAAM6S,IAAOrG,KAAe1Q;AAC5B,WAAOkE,IAAS6S;AAAA,EACpB;AACA,WAASC,EAAW9W,GAAO9R,GAAK;AAC5B,QAAI,CAAC0f,EAAG,YAAY1f,CAAG;AACnB,YAAM,IAAI,MAAM,qBAAqB8R,CAAK,kCAAkC;AAChF,WAAO9R;AAAA,EACX;AACA,WAAS6oB,GAAkBnoB,GAAO8f,GAAQ;AACtC,IAAAD,GAAkBC,CAAM;AACxB,UAAMrc,IAAOuC,EAAQ,WACfoiB,IAAQtI,MAAW,YAAYrc,IAAOqc,MAAW,cAAcrc,IAAO,IAAI;AAChF,WAAOsC,GAAO/F,GAAOooB,GAAO,GAAGtI,CAAM,YAAY;AAAA,EACrD;AAAA,EAIA,MAAMuI,EAAU;AAAA,IACZ,YAAY5S,GAAG8R,GAAGe,GAAU;AACxB,WAAK,IAAIJ,EAAW,KAAKzS,CAAC,GAC1B,KAAK,IAAIyS,EAAW,KAAKX,CAAC,GACtBe,KAAY,SACZ,KAAK,WAAWA,IACpB,OAAO,OAAO,IAAI;AAAA,IACtB;AAAA,IACA,OAAO,UAAUtoB,GAAO8f,IAASiI,GAAuB;AACpD,MAAAI,GAAkBnoB,GAAO8f,CAAM;AAC/B,UAAIyI;AACJ,UAAIzI,MAAW,OAAO;AAClB,cAAM,EAAE,GAAArK,GAAG,GAAA8R,EAAC,IAAKlH,GAAI,MAAMta,GAAO/F,CAAK,CAAC;AACxC,eAAO,IAAIqoB,EAAU5S,GAAG8R,CAAC;AAAA,MAC7B;AACA,MAAIzH,MAAW,gBACXyI,IAAQvoB,EAAM,CAAC,GACf8f,IAAS,WACT9f,IAAQA,EAAM,SAAS,CAAC;AAE5B,YAAMgjB,IAAIhE,EAAG,OACPvJ,IAAIzV,EAAM,SAAS,GAAGgjB,CAAC,GACvBuE,IAAIvnB,EAAM,SAASgjB,GAAGA,IAAI,CAAC;AACjC,aAAO,IAAIqF,EAAUrJ,EAAG,UAAUvJ,CAAC,GAAGuJ,EAAG,UAAUuI,CAAC,GAAGgB,CAAK;AAAA,IAChE;AAAA,IACA,OAAO,QAAQ7nB,GAAKof,GAAQ;AACxB,aAAO,KAAK,UAAUvY,GAAW7G,CAAG,GAAGof,CAAM;AAAA,IACjD;AAAA,IACA,eAAewI,GAAU;AACrB,aAAO,IAAID,EAAU,KAAK,GAAG,KAAK,GAAGC,CAAQ;AAAA,IACjD;AAAA,IACA,iBAAiBE,GAAa;AAC1B,YAAMC,IAAc9S,EAAG,OACjB,EAAE,GAAAF,GAAG,GAAA8R,GAAG,UAAUmB,EAAG,IAAK;AAChC,UAAIA,KAAO,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAASA,CAAG;AACzC,cAAM,IAAI,MAAM,qBAAqB;AAUzC,UADoB9G,IAAclN,KAAM+T,KACrBC,IAAM;AACrB,cAAM,IAAI,MAAM,wCAAwC;AAC5D,YAAMC,IAAOD,MAAQ,KAAKA,MAAQ,IAAIjT,IAAImM,IAAcnM;AACxD,UAAI,CAACE,EAAG,QAAQgT,CAAI;AAChB,cAAM,IAAI,MAAM,4BAA4B;AAChD,YAAMrT,IAAIK,EAAG,QAAQgT,CAAI,GACnB/Q,IAAIqF,EAAM,UAAUhV,GAAYoa,IAASqG,IAAM,OAAO,CAAC,GAAGpT,CAAC,CAAC,GAC5DsT,IAAK5J,EAAG,IAAI2J,CAAI,GAChBziB,IAAI2iB,EAAczW,EAAY,WAAWoW,CAAW,CAAC,GACrDM,IAAK9J,EAAG,OAAO,CAAC9Y,IAAI0iB,CAAE,GACtBG,IAAK/J,EAAG,OAAOuI,IAAIqB,CAAE,GAErBzR,IAAI8F,EAAM,KAAK,eAAe6L,CAAE,EAAE,IAAIlR,EAAE,eAAemR,CAAE,CAAC;AAChE,UAAI5R,EAAE,IAAG;AACL,cAAM,IAAI,MAAM,mBAAmB;AACvC,aAAAA,EAAE,eAAc,GACTA;AAAA,IACX;AAAA;AAAA,IAEA,WAAW;AACP,aAAO6Q,EAAsB,KAAK,CAAC;AAAA,IACvC;AAAA,IACA,QAAQlI,IAASiI,GAAuB;AAEpC,UADAlI,GAAkBC,CAAM,GACpBA,MAAW;AACX,eAAOvY,GAAW8Y,GAAI,WAAW,IAAI,CAAC;AAC1C,YAAM5K,IAAIuJ,EAAG,QAAQ,KAAK,CAAC,GACrBuI,IAAIvI,EAAG,QAAQ,KAAK,CAAC;AAC3B,UAAIc,MAAW,aAAa;AACxB,YAAI,KAAK,YAAY;AACjB,gBAAM,IAAI,MAAM,8BAA8B;AAClD,eAAO7X,GAAY,WAAW,GAAG,KAAK,QAAQ,GAAGwN,GAAG8R,CAAC;AAAA,MACzD;AACA,aAAOtf,GAAYwN,GAAG8R,CAAC;AAAA,IAC3B;AAAA,IACA,MAAMzH,GAAQ;AACV,aAAO3Y,GAAW,KAAK,QAAQ2Y,CAAM,CAAC;AAAA,IAC1C;AAAA;AAAA,IAEA,iBAAiB;AAAA,IAAE;AAAA,IACnB,OAAO,YAAYpf,GAAK;AACpB,aAAO2nB,EAAU,UAAUjW,EAAY,OAAO1R,CAAG,GAAG,SAAS;AAAA,IACjE;AAAA,IACA,OAAO,QAAQA,GAAK;AAChB,aAAO2nB,EAAU,UAAUjW,EAAY,OAAO1R,CAAG,GAAG,KAAK;AAAA,IAC7D;AAAA,IACA,aAAa;AACT,aAAO,KAAK,SAAQ,IAAK,IAAI2nB,EAAU,KAAK,GAAGrJ,EAAG,IAAI,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI;AAAA,IACpF;AAAA,IACA,gBAAgB;AACZ,aAAO,KAAK,QAAQ,KAAK;AAAA,IAC7B;AAAA,IACA,WAAW;AACP,aAAO7X,GAAW,KAAK,QAAQ,KAAK,CAAC;AAAA,IACzC;AAAA,IACA,oBAAoB;AAChB,aAAO,KAAK,QAAQ,SAAS;AAAA,IACjC;AAAA,IACA,eAAe;AACX,aAAOA,GAAW,KAAK,QAAQ,SAAS,CAAC;AAAA,IAC7C;AAAA,EACR;AAKI,QAAM6hB,IAAWvB,EAAU,YACvB,SAAsBznB,GAAO;AAEzB,QAAIA,EAAM,SAAS;AACf,YAAM,IAAI,MAAM,oBAAoB;AAGxC,UAAMV,IAAMuS,GAAgB7R,CAAK,GAC3BipB,IAAQjpB,EAAM,SAAS,IAAI4nB;AACjC,WAAOqB,IAAQ,IAAI3pB,KAAO,OAAO2pB,CAAK,IAAI3pB;AAAA,EAC9C,GACEupB,IAAgBpB,EAAU,iBAC5B,SAA2BznB,GAAO;AAC9B,WAAOgf,EAAG,OAAOgK,EAAShpB,CAAK,CAAC;AAAA,EACpC,GAEEkpB,KAAatW,GAAQgV,CAAM;AAEjC,WAASuB,GAAW7pB,GAAK;AAErB,WAAAoT,GAAS,aAAakV,GAAQtoB,GAAK2R,IAAKiY,EAAU,GAC3ClK,EAAG,QAAQ1f,CAAG;AAAA,EACzB;AACA,WAAS8pB,EAAmBpY,GAASqY,GAAS;AAC1CtjB,WAAAA,GAAOiL,GAAS,QAAW,SAAS,GAC7BqY,IAAUtjB,GAAO2K,EAAKM,CAAO,GAAG,QAAW,mBAAmB,IAAIA;AAAA,EAC7E;AASA,WAASsY,EAAQtY,GAASsV,GAAYlO,GAAM;AACxC,QAAI,CAAC,aAAa,WAAW,EAAE,KAAK,CAAChF,MAAMA,KAAKgF,CAAI;AAChD,YAAM,IAAI,MAAM,qCAAqC;AACzD,UAAM,EAAE,MAAAmR,GAAM,SAAAF,GAAS,cAAAG,EAAY,IAAKzJ,GAAgB3H,GAAM0P,CAAc;AAC5E,IAAA9W,IAAUoY,EAAmBpY,GAASqY,CAAO;AAI7C,UAAMI,IAAQZ,EAAc7X,CAAO,GAC7BwH,IAAI8I,GAAetC,GAAIsH,CAAU,GACjCoD,IAAW,CAACP,GAAW3Q,CAAC,GAAG2Q,GAAWM,CAAK,CAAC;AAElD,QAAID,KAAgB,QAAQA,MAAiB,IAAO;AAGhD,YAAMlX,IAAIkX,MAAiB,KAAO/gB,EAAYzC,EAAQ,SAAS,IAAIwjB;AACnE,MAAAE,EAAS,KAAKtX,EAAY,gBAAgBE,CAAC,CAAC;AAAA,IAChD;AACA,UAAMiB,IAAOtL,GAAY,GAAGyhB,CAAQ,GAC9BtnB,IAAIqnB;AASV,aAASE,EAAMC,GAAQ;AAGnB,YAAMxW,IAAI4V,EAASY,CAAM;AACzB,UAAI,CAAC5K,EAAG,YAAY5L,CAAC;AACjB;AACJ,YAAMyW,IAAK7K,EAAG,IAAI5L,CAAC,GACboC,IAAIyH,EAAM,KAAK,SAAS7J,CAAC,EAAE,YAC3BqC,IAAIuJ,EAAG,OAAOxJ,EAAE,CAAC;AACvB,UAAIC,MAAMxE;AACN;AACJ,YAAMsW,KAAIvI,EAAG,OAAO6K,IAAK7K,EAAG,OAAO5c,IAAIqT,IAAI+C,CAAC,CAAC;AAC7C,UAAI+O,OAAMtW;AACN;AACJ,UAAIqX,MAAY9S,EAAE,MAAMC,IAAI,IAAI,KAAK,OAAOD,EAAE,IAAItE,EAAG,GACjD4Y,KAAQvC;AACZ,aAAIgC,KAAQvB,EAAsBT,EAAC,MAC/BuC,KAAQ9K,EAAG,IAAIuI,EAAC,GAChBe,MAAY,IAET,IAAID,EAAU5S,GAAGqU,IAAOxB,EAAQ;AAAA,IAC3C;AACA,WAAO,EAAE,MAAA/U,GAAM,OAAAoW,EAAK;AAAA,EACxB;AAYA,WAASI,GAAK/Y,GAAS4V,GAAWxO,IAAO,CAAA,GAAI;AACzC,IAAApH,IAAUoB,EAAY,WAAWpB,CAAO;AACxC,UAAM,EAAE,MAAAuC,GAAM,OAAAoW,EAAK,IAAKL,EAAQtY,GAAS4V,GAAWxO,CAAI;AAGxD,WAFavF,GAAenC,EAAK,WAAWsO,EAAG,OAAOjO,CAAI,EACzCwC,GAAMoW,CAAK;AAAA,EAEhC;AACA,WAASK,GAAcC,GAAI;AAEvB,QAAI/I;AACJ,UAAMgJ,IAAQ,OAAOD,KAAO,YAAYpkB,GAAQokB,CAAE,GAC5CE,IAAQ,CAACD,KACXD,MAAO,QACP,OAAOA,KAAO,YACd,OAAOA,EAAG,KAAM,YAChB,OAAOA,EAAG,KAAM;AACpB,QAAI,CAACC,KAAS,CAACC;AACX,YAAM,IAAI,MAAM,0EAA0E;AAC9F,QAAIA;AACA,MAAAjJ,IAAM,IAAImH,EAAU4B,EAAG,GAAGA,EAAG,CAAC;AAAA,aAEzBC,GAAO;AACZ,UAAI;AACA,QAAAhJ,IAAMmH,EAAU,UAAUjW,EAAY,OAAO6X,CAAE,GAAG,KAAK;AAAA,MAC3D,SACOG,GAAU;AACb,YAAI,EAAEA,aAAoB/J,GAAI;AAC1B,gBAAM+J;AAAA,MACd;AACA,UAAI,CAAClJ;AACD,YAAI;AACA,UAAAA,IAAMmH,EAAU,UAAUjW,EAAY,OAAO6X,CAAE,GAAG,SAAS;AAAA,QAC/D,QACc;AACV,iBAAO;AAAA,QACX;AAAA,IAER;AACA,WAAK/I,KACM;AAAA,EAEf;AAcA,WAASmJ,EAAOC,GAAWtZ,GAAS8V,GAAW1O,IAAO,CAAA,GAAI;AACtD,UAAM,EAAE,MAAAmR,GAAM,SAAAF,GAAS,QAAAvJ,EAAM,IAAKC,GAAgB3H,GAAM0P,CAAc;AAGtE,QAFAhB,IAAY1U,EAAY,aAAa0U,CAAS,GAC9C9V,IAAUoY,EAAmBhX,EAAY,WAAWpB,CAAO,GAAGqY,CAAO,GACjE,YAAYjR;AACZ,YAAM,IAAI,MAAM,oCAAoC;AACxD,UAAM8I,IAAMpB,MAAW,SACjBkK,GAAcM,CAAS,IACvBjC,EAAU,UAAUjW,EAAY,OAAOkY,CAAS,GAAGxK,CAAM;AAC/D,QAAIoB,MAAQ;AACR,aAAO;AACX,QAAI;AACA,YAAM/K,IAAI8G,EAAM,UAAU6J,CAAS;AACnC,UAAIyC,KAAQrI,EAAI,SAAQ;AACpB,eAAO;AACX,YAAM,EAAE,GAAAzL,GAAG,GAAA8R,EAAC,IAAKrG,GACXhb,IAAI2iB,EAAc7X,CAAO,GACzBuZ,IAAKvL,EAAG,IAAIuI,CAAC,GACbuB,IAAK9J,EAAG,OAAO9Y,IAAIqkB,CAAE,GACrBxB,IAAK/J,EAAG,OAAOvJ,IAAI8U,CAAE,GACrB3S,IAAIqF,EAAM,KAAK,eAAe6L,CAAE,EAAE,IAAI3S,EAAE,eAAe4S,CAAE,CAAC;AAChE,aAAInR,EAAE,IAAG,IACE,KACDoH,EAAG,OAAOpH,EAAE,CAAC,MACVnC;AAAA,IACjB,QACU;AACN,aAAO;AAAA,IACX;AAAA,EACJ;AACA,WAAS+U,EAAiBF,GAAWtZ,GAASoH,IAAO,CAAA,GAAI;AACrD,UAAM,EAAE,SAAAiR,EAAO,IAAKtJ,GAAgB3H,GAAM0P,CAAc;AACxD,WAAA9W,IAAUoY,EAAmBpY,GAASqY,CAAO,GACtChB,EAAU,UAAUiC,GAAW,WAAW,EAAE,iBAAiBtZ,CAAO,EAAE,QAAO;AAAA,EACxF;AACA,SAAO,OAAO,OAAO;AAAA,IACjB,QAAAkW;AAAA,IACA,cAAAD;AAAA,IACA,iBAAAG;AAAA,IACA,OAAAS;AAAA,IACA,SAAA7hB;AAAA,IACA,OAAAiX;AAAA,IACA,MAAA8M;AAAA,IACA,QAAAM;AAAA,IACA,kBAAAG;AAAA,IACA,WAAAnC;AAAA,IACA,MAAA3X;AAAA,EACR,CAAK;AACL;AAOA,SAAS+Z,GAAgCthB,GAAG;AACxC,QAAM0V,IAAQ;AAAA,IACV,GAAG1V,EAAE;AAAA,IACL,GAAGA,EAAE;AAAA,IACL,GAAGA,EAAE,GAAG;AAAA,IACR,GAAGA,EAAE;AAAA,IACL,GAAGA,EAAE;AAAA,IACL,IAAIA,EAAE;AAAA,IACN,IAAIA,EAAE;AAAA,EACd,GACUwM,IAAKxM,EAAE;AACb,MAAI2Q,IAAiB3Q,EAAE,2BACjB,MAAM,KAAK,IAAI,IAAIA,EAAE,yBAAyB,IAAI,CAACwB,MAAM,KAAK,KAAKA,IAAI,CAAC,CAAC,CAAC,CAAC,IAC3E;AACN,QAAMqU,IAAK3I,GAAMwI,EAAM,GAAG;AAAA,IACtB,MAAM1V,EAAE;AAAA,IACR,gBAAgB2Q;AAAA,IAChB,cAAc3Q,EAAE;AAAA,EACxB,CAAK,GACK2V,IAAY;AAAA,IACd,IAAAnJ;AAAA,IACA,IAAAqJ;AAAA,IACA,oBAAoB7V,EAAE;AAAA,IACtB,MAAMA,EAAE;AAAA,IACR,eAAeA,EAAE;AAAA,IACjB,eAAeA,EAAE;AAAA,IACjB,WAAWA,EAAE;AAAA,IACb,SAASA,EAAE;AAAA,EACnB;AACI,SAAO,EAAE,OAAA0V,GAAO,WAAAC,EAAS;AAC7B;AACA,SAAS4L,GAA0BvhB,GAAG;AAClC,QAAM,EAAE,OAAA0V,GAAO,WAAAC,MAAc2L,GAAgCthB,CAAC,GACxDse,IAAY;AAAA,IACd,MAAMte,EAAE;AAAA,IACR,aAAaA,EAAE;AAAA,IACf,MAAMA,EAAE;AAAA,IACR,UAAUA,EAAE;AAAA,IACZ,eAAeA,EAAE;AAAA,EACzB;AACI,SAAO,EAAE,OAAA0V,GAAO,WAAAC,GAAW,MAAM3V,EAAE,MAAM,WAAAse,EAAS;AACtD;AA4BA,SAASkD,GAA4BxhB,GAAGyhB,GAAQ;AAC5C,QAAM3N,IAAQ2N,EAAO;AACrB,SAAO,OAAO,OAAO,CAAA,GAAIA,GAAQ;AAAA,IAC7B,iBAAiB3N;AAAA,IACjB,OAAO,OAAO,OAAO,CAAA,GAAI9T,GAAGkQ,GAAQ4D,EAAM,GAAG,OAAOA,EAAM,GAAG,IAAI,CAAC;AAAA,EAC1E,CAAK;AACL;AAEO,SAAS4N,GAAY1hB,GAAG;AAC3B,QAAM,EAAE,OAAA0V,GAAO,WAAAC,GAAW,MAAApO,GAAM,WAAA+W,EAAS,IAAKiD,GAA0BvhB,CAAC,GACnE8T,IAAQuE,GAAa3C,GAAOC,CAAS,GACrCgM,IAAQtD,GAAMvK,GAAOvM,GAAM+W,CAAS;AAC1C,SAAOkD,GAA4BxhB,GAAG2hB,CAAK;AAC/C;AC/3CA;AAOO,SAASC,GAAYC,GAAUC,GAAS;AAC3C,QAAMC,IAAS,CAACxa,MAASma,GAAY,EAAE,GAAGG,GAAU,MAAMta,GAAM;AAChE,SAAO,EAAE,GAAGwa,EAAOD,CAAO,GAAG,QAAAC,EAAM;AACvC;ACTA;AAQA,MAAMC,KAAa;AAAA,EACf,GAAG,OAAO,oEAAoE;AAAA,EAC9E,GAAG,OAAO,oEAAoE;AAAA,EAC9E,GAAG,OAAO,CAAC;AAAA,EACX,GAAG,OAAO,oEAAoE;AAAA,EAC9E,GAAG,OAAO,oEAAoE;AAAA,EAC9E,IAAI,OAAO,oEAAoE;AAAA,EAC/E,IAAI,OAAO,oEAAoE;AACnF,GAEMC,KAAa;AAAA,EACf,GAAG,OAAO,oGAAoG;AAAA,EAC9G,GAAG,OAAO,oGAAoG;AAAA,EAC9G,GAAG,OAAO,CAAC;AAAA,EACX,GAAG,OAAO,oGAAoG;AAAA,EAC9G,GAAG,OAAO,oGAAoG;AAAA,EAC9G,IAAI,OAAO,oGAAoG;AAAA,EAC/G,IAAI,OAAO,oGAAoG;AACnH,GAEMC,KAAa;AAAA,EACf,GAAG,OAAO,uIAAuI;AAAA,EACjJ,GAAG,OAAO,wIAAwI;AAAA,EAClJ,GAAG,OAAO,CAAC;AAAA,EACX,GAAG,OAAO,uIAAuI;AAAA,EACjJ,GAAG,OAAO,wIAAwI;AAAA,EAClJ,IAAI,OAAO,wIAAwI;AAAA,EACnJ,IAAI,OAAO,wIAAwI;AACvJ,GACMC,KAAQjV,GAAM8U,GAAW,CAAC,GAC1BI,KAAQlV,GAAM+U,GAAW,CAAC,GAC1BI,KAAQnV,GAAMgV,GAAW,CAAC,GAMnBI,KAAOV,GAAY,EAAE,GAAGI,IAAY,IAAIG,IAAO,MAAM,GAAK,GAAIhb,EAAM,GAyBpEob,KAAOX,GAAY,EAAE,GAAGK,IAAY,IAAIG,IAAO,MAAM,GAAK,GAAI/a,EAAM,GA0BpEmb,KAAOZ,GAAY,EAAE,GAAGM,IAAY,IAAIG,IAAO,MAAM,IAAO,0BAA0B,CAAC,KAAK,KAAK,GAAG,EAAC,GAAIjb,EAAM;AChG5H,SAASqb,GAAYC,GAAY;AAC7B,QAAMC,IAAsB,IAAI,WAAW;AAAA,IACvC;AAAA,IAAM;AAAA,IACN;AAAA,IAAM;AAAA,IAAM;AAAA,IAAM;AAAA,IAAM;AAAA,IAAM;AAAA,IAAM;AAAA,IAAM;AAAA,IAAM;AAAA,IAAM;AAAA,IAAM;AAAA,IAC5D;AAAA,IAAM;AAAA,EACd,CAAK,GACKC,IAAkBF,EAAW,SAAS,GACtCG,IAAqBF,EAAoB,SAAS,IAAIrL,GAAYsL,CAAe,EAAE,SAASA,GAC5FxqB,IAAS,IAAI,WAAW,IAAIkf,GAAYuL,CAAkB,EAAE,SAASA,CAAkB;AAC7F,MAAI9qB,IAAS;AACb,EAAAK,EAAOL,GAAQ,IAAI;AACnB,QAAM+qB,IAAmBxL,GAAYuL,CAAkB;AACvD,EAAAzqB,EAAO,IAAI0qB,GAAkB/qB,CAAM,GACnCA,KAAU+qB,EAAiB,QAC3B1qB,EAAO,IAAIuqB,GAAqB5qB,CAAM,GACtCA,KAAU4qB,EAAoB,QAC9BvqB,EAAOL,GAAQ,IAAI;AACnB,QAAMgrB,IAAuBzL,GAAYsL,CAAe;AACxD,SAAAxqB,EAAO,IAAI2qB,GAAsBhrB,CAAM,GACvCA,KAAUgrB,EAAqB,QAC/B3qB,EAAOL,GAAQ,IAAI,GACnBK,EAAO,IAAIsqB,GAAY3qB,CAAM,GACtBK;AACX;AAOA,SAASkf,GAAYrgB,GAAQ;AACzB,SAAIA,IAAS,MACF,IAAI,WAAW,CAACA,CAAM,CAAC,IAEzBA,IAAS,MACP,IAAI,WAAW,CAAC,KAAMA,CAAM,CAAC,IAG7B,IAAI,WAAW,CAAC,KAAOA,KAAU,IAAK,KAAMA,IAAS,GAAI,CAAC;AAEzE;AAsBO,eAAe+rB,GAAUC,GAASC,GAAQzb,GAAK;AAAA,EAClD,MAAM0b,EAAa;AAAA,IACf,cAAc;AACV,WAAK,SAAS,QACd,KAAK,UAAU,IAAI,WAAW,CAAC,GAC/B,KAAK,YAAY,EAAE,MAAM/mB,EAAS,MAAK,GACvC,KAAK,cAAc,IACnB,KAAK,QAAQ,CAAC,QAAQ;AAAA,IAC1B;AAAA,EACR;AACI,QAAM0Z,IAAS,IAAIqN,EAAY;AAC/B,MAAI1b,EAAI,SAAS,OAAO;AACpB,IAAAqO,EAAO,SAAS,QAChBA,EAAO,UAAU1a,GAAMqM,CAAG;AAAA,WAErB,iBAAiB,KAAKA,CAAG;AAC9B,IAAAqO,EAAO,SAAS,OAChBA,EAAO,UAAUxe,GAAgBmQ,CAAG;AAAA,OAEnC;AACD,IAAAqO,EAAO,SAAS;AAChB,UAAMsN,IAAWtsB,EAAmB2Q,CAAG;AACvC,IAAIwb,EAAQ,cAAc,SAAS,OAAO,KACtCG,EAAS,CAAC,MAAM,MAAQA,EAAS,CAAC,MAAM,OACxCA,EAAS,CAAC,MAAM,KAAQA,EAAS,CAAC,MAAM,MACxCtN,EAAO,UAAU2M,GAAYW,CAAQ,IAGrCtN,EAAO,UAAUsN;AAAA,EAEzB;AACA,MAAIH,EAAQ,YAAW,EAAG,SAAS,OAAO;AACtC,QAAIC,EAAO,SAAS,KAAK;AACrB,MAAApN,EAAO,YAAY,EAAE,MAAM1Z,EAAS,OAAO,YAAYC,GAAW,KAAI;AAAA,aAEjE6mB,EAAO,SAAS,KAAK;AAC1B,MAAApN,EAAO,YAAY,EAAE,MAAM1Z,EAAS,OAAO,YAAYC,GAAW,KAAI;AAAA,aAEjE6mB,EAAO,SAAS,KAAK;AAC1B,MAAApN,EAAO,YAAY,EAAE,MAAM1Z,EAAS,OAAO,YAAYC,GAAW,KAAI;AAAA;AAGtE,YAAM,IAAI,MAAM,kCAAkC;AAAA,WAGjD4mB,EAAQ,YAAW,EAAG,SAAS,SAAS;AAC7C,IAAAnN,EAAO,YAAY,EAAE,MAAM1Z,EAAS,QAAO;AAAA,WAEtC6mB,EAAQ,cAAc,SAAS,KAAK,KAAKA,EAAQ,YAAW,EAAG,SAAS,OAAO,GAAG;AACvF,QAAII,IAAW/mB,EAAe;AAE9B,UAAMgnB,IAAmBJ,EAAO,YAAW,EAAG,QAAQ,SAAS,EAAE;AACjE,IAAII,EAAiB,SAAS,QAAQ,KAAKA,EAAiB,SAAS,KAAK,IACtED,IAAW/mB,EAAe,SAErBgnB,EAAiB,SAAS,QAAQ,KAAKA,EAAiB,SAAS,KAAK,IAC3ED,IAAW/mB,EAAe,UAErBgnB,EAAiB,SAAS,QAAQ,KAAKA,EAAiB,SAAS,KAAK,OAC3ED,IAAW/mB,EAAe,SAE1BgnB,EAAiB,SAAS9mB,GAAW,KAAK,KAAK8mB,EAAiB,SAAS9mB,GAAW,QAAQ,IAC5FsZ,EAAO,YAAY;AAAA,MACf,MAAMvZ,GAAc;AAAA,MACpB,MAAM,EAAE,MAAM8mB,EAAQ;AAAA,IACtC,IAGYvN,EAAO,YAAY;AAAA,MACf,MAAMvZ,GAAc;AAAA,MACpB,MAAM,EAAE,MAAM8mB,EAAQ;AAAA,IACtC;AAAA,EAEI;AAEI,UAAM,IAAI,MAAM,eAAeJ,CAAO,EAAE;AAE5C,SAAO,MAAM,OAAO,OAAO,UAAUnN,EAAO,QAAQA,EAAO,SAASA,EAAO,WAAWA,EAAO,aAAaA,EAAO,KAAK;AAC1H;AACO,eAAeyN,GAAgB9b,GAAK+b,GAAQzL,GAAKxQ,IAAO,UAAU;AACrE,QAAMkc,IAAU;AAAA,IACZ,MAAMhc,EAAI,UAAU;AAAA,EAC5B;AACI,MAAIA,EAAI,UAAU,SAASrL,EAAS,OAAO;AACvC,UAAMsnB,IAAajc,EAAI,UAAU;AACjC,QAAIkc,IAAW;AAWf,QAVID,MAAernB,GAAW,OAC1BsnB,IAAW,KAEND,MAAernB,GAAW,OAC/BsnB,IAAW,KAEND,MAAernB,GAAW,SAC/BsnB,IAAW,KAEfF,EAAQ,OAAO,EAAE,MAAM,GAAE,GACrBlc,EAAK,SAAS,KAAK;AACnB,MAAAkc,EAAQ,KAAK,OAAOnnB,EAAe;AAAA,aAE9BiL,EAAK,SAAS,KAAK;AACxB,MAAAkc,EAAQ,KAAK,OAAOnnB,EAAe;AAAA,aAE9BiL,EAAK,SAAS,KAAK;AACxB,MAAAkc,EAAQ,KAAK,OAAOnnB,EAAe;AAAA;AAGnC,YAAM,IAAI,MAAM,qCAAqC;AAEzD,QAAIsnB;AACJ,QAAI;AACA,YAAMC,IAAWnpB,GAAQ,YAAYqd,CAAG,GAClCzL,IAAIuX,EAAS,KAAK,CAAC,EAAE,UAAS,GAC9BzF,IAAIyF,EAAS,KAAK,CAAC,EAAE,UAAS,GAC9BC,IAAOxsB,GAAgBgV,EAAE,SAAS,EAAE,EAAE,SAASqX,IAAW,GAAG,GAAG,CAAC,GACjEI,IAAOzsB,GAAgB8mB,EAAE,SAAS,EAAE,EAAE,SAASuF,IAAW,GAAG,GAAG,CAAC;AACvE,MAAAC,IAAgB,IAAI,WAAWE,EAAK,SAASC,EAAK,MAAM,GACxDH,EAAc,IAAIE,GAAM,CAAC,GACzBF,EAAc,IAAIG,GAAMD,EAAK,MAAM;AAAA,IACvC,QACM;AACF,aAAO;AAAA,IACX;AACA,WAAO,MAAM,OAAO,OAAO,OAAOL,GAAShc,GAAKmc,GAAeJ,CAAM;AAAA,EACzE,OACK;AAAA,QAAI/b,EAAI,UAAU,SAASrL,EAAS;AACrC,aAAO,MAAM,OAAO,OAAO,OAAOqL,EAAI,UAAU,MAAMA,GAAKsQ,GAAKyL,CAAM;AAErE,QAAI/b,EAAI,UAAU,SAASlL,GAAc,KAAK;AAC/C,YAAMynB,IAAUvc,EAAI,UAAU,KAAK,MAC7Bwc,IAAaD,MAAY1nB,EAAe,SAAS,KACnD0nB,MAAY1nB,EAAe,SAAS,KAChC0nB,MAAY1nB,EAAe,SAAS,KAAK;AACjD,aAAO,MAAM,OAAO,OAAO,OAAO;AAAA,QAC9B,MAAMC,GAAc;AAAA,QACpB,YAAY0nB;AAAA,MACxB,GAAWxc,GAAKsQ,GAAKyL,CAAM;AAAA,IACvB,OACK;AAAA,UAAI/b,EAAI,UAAU,SAASlL,GAAc;AAC1C,eAAO,MAAM,OAAO,OAAO,OAAOkL,EAAI,UAAU,MAAMA,GAAKsQ,GAAKyL,CAAM;AAGtE,YAAM,IAAI,MAAM,uBAAuB;AAAA;AAAA;AAE/C;AAMO,eAAeU,GAA0Bzc,GAAK0c,GAAQpM,GAAK;AAC9D,MAAItQ,EAAI,UAAU,SAASrL,EAAS;AAChC,UAAM,IAAI,MAAM,oDAAoD;AAExE,QAAMsnB,IAAajc,EAAI,UAAU;AACjC,MAAI2c;AACJ,MAAIV,MAAernB,GAAW;AAC1B,IAAA+nB,IAAQ9B;AAAA,WAEHoB,MAAernB,GAAW;AAC/B,IAAA+nB,IAAQ7B;AAAA,WAEHmB,MAAernB,GAAW;AAC/B,IAAA+nB,IAAQ5B;AAAA;AAGR,UAAM,IAAI,MAAM,sBAAsBkB,CAAU,EAAE;AAGtD,QAAMW,IAAM,MAAM,OAAO,OAAO,UAAU,OAAO5c,CAAG;AACpD,MAAI,CAAC4c,EAAI,KAAK,CAACA,EAAI;AACf,UAAM,IAAI,MAAM,sDAAsD;AAG1E,QAAMlY,IAAIjV,GAAsBmtB,EAAI,CAAC,GAC/B5K,IAAIviB,GAAsBmtB,EAAI,CAAC,GAE/B1G,IAAY,IAAI,WAAW,IAAIxR,EAAE,SAASsN,EAAE,MAAM;AACxD,SAAAkE,EAAU,CAAC,IAAI,GACfA,EAAU,IAAIxR,GAAG,CAAC,GAClBwR,EAAU,IAAIlE,GAAG,IAAItN,EAAE,MAAM,GAQtBiY,EAAM,OAAOrM,GAAKoM,GAAQxG,GAAW,EAAE,QAAQ,OAAO,SAAS,IAAO,MAAM,GAAK,CAAE;AAC9F;AC7PO,IAAK2G,uBAAAA,OACVA,EAAA,yBAAyB,0BACzBA,EAAA,SAAS,UACTA,EAAA,uBAAuB,wBACvBA,EAAA,QAAQ,SAJEA,IAAAA,MAAA,CAAA,CAAA;AAyGZ,MAAMC,KAAoD;AAAA,EACxD,QAAUjoB,EAAe;AAAA,EACzB,QAAUA,EAAe;AAAA,EACzB,QAAUA,EAAe;AAAA,EACzB,UAAYA,EAAe;AAAA,EAC3B,UAAYA,EAAe;AAAA,EAC3B,UAAYA,EAAe;AAC7B;AAEO,SAASkoB,GAAiBC,GAA2B;AAC1D,QAAMT,IAAUO,GAA0BE,CAAS;AACnD,MAAI,CAACT;AACH,UAAM,IAAI,MAAM,+BAA+BS,CAAS,EAAE;AAE5D,SAAOT;AACT;ACxHO,MAAMU,KAAgD;AAAA,EAC3D,uBAAuB;AAAA,EACvB,uBAAuB;AAAA,EACvB,uBAAuB;AAAA,EACvB,uBAAuB;AACzB,GAGaC,KAA8C;AAAA,EACzD,yBAAyB;AAAA;AAAA,EACzB,yBAAyB;AAAA;AAAA,EACzB,yBAAyB;AAAA;AAAA,EACzB,wBAAwB;AAAA;AAC1B,GAGaC,KAAiB,yBAEjBC,KAA0C;AAAA,EACrD,0BAA0B;AAAA,EAC1B,0BAA0B;AAAA,EAC1B,0BAA0B;AAC5B,GAGaC,KAAyB,UAEzBC,KAA4C;AAAA,EACvD,uBAAuB;AAAA,EACvB,gBAAgB;AAAA,EAChB,gBAAgB;AAClB;ACNO,MAAMC,GAA2B;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAYvB,GAAqB;AAC/B,SAAK,UAAUA,EAAQ,SACvB,KAAK,QAAQA,EAAQ,OACrB,KAAK,YAAYA,EAAQ,WACzB,KAAK,aAAaA,EAAQ,YAC1B,KAAK,gBAAgBA,EAAQ,eAC7B,KAAK,qBAAqBA,EAAQ,oBAClC,KAAK,YAAYA,EAAQ;AAAA,EAC3B;AAAA,EAEA,IAAI,WAAiB;AACnB,WAAO,IAAI,KAAK,OAAO3rB,GAAe,KAAK,SAAS,CAAC,CAAC;AAAA,EACxD;AAAA;AAAA;AAAA,EAIA,IAAI,YAAoB;AACtB,YAAQ,KAAK,eAAA;AAAA;AAAA,MAEX,KAAK;AACH,eAAO;AAAA;AAAA,MAET,KAAK;AACH,eAAO;AAAA;AAAA,MAET,KAAK;AACH,eAAO;AAAA;AAAA,MAET,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA;AAAA,MAET,KAAK;AACH,eAAO;AAAA;AAAA,MAET,KAAK;AACH,eAAO;AAAA;AAAA,MAET;AACE,eAAO;AAAA,IAAA;AAAA,EAEb;AAAA,EAEA,MAAa,OAAOmtB,GAAqBxd,GAAkC;AAIzE,UAAMnR,IAAS,IAAI0D,GAAA;AACnB,WAAA1D,EAAO,WAAW,KAAK,OAAO,GAC9BA,EAAO,WAAW,CAAI,GACtBA,EAAO,WAAW,KAAK,SAAS,GAChCA,EAAO,aAAa,CAAI,GACxBA,EAAO,WAAW2uB,CAAO,GACzB3uB,EAAO,aAAa,KAAK,WAAW,UAAU,GAG1C,KAAK,WAAW,aAAa,KAC/BA,EAAO,WAAW,KAAK,UAAU,GAG5B,MAAMitB;AAAA,MACX9b;AAAA,MACAnR,EAAO;AAAA,MACP,KAAK;AAAA,MACL,KAAK;AAAA,IAAA;AAAA,EAET;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAc,MAAMC,GAA6C;AAC/D,UAAMD,IAAS,IAAI0D,GAAWzD,CAAG,GAI3B2uB,IAAU5uB,EAAO,SAAA;AACvB,QAAI4uB,MAAY;AACd,YAAM,IAAI,MAAM,4BAA4BA,CAAO,sBAAsB;AAI3E,UAAMC,IAAQ7uB,EAAO,SAAS,EAAE,GAG1B8uB,IAAY9uB,EAAO,SAAS,CAAC,GAG7B+uB,IAAmB/uB,EAAO,UAAA,GAC1BgvB,IAAahvB,EAAO,SAAS+uB,CAAgB,GAG7CE,IAAgBjvB,EAAO,SAAA,GAGvBkvB,IAAqBlvB,EAAO,SAAA,GAG5BmvB,IAAYnvB,EAAO,UAAA,GACnB6qB,IAAY7qB,EAAO,SAASmvB,CAAS;AAG3C,QAAInvB,EAAO,aAAaC,EAAI;AAC1B,YAAM,IAAI,MAAM,4BAA4B;AAG9C,WAAO,IAAIyuB,GAA2B;AAAA,MACpC,SAAAE;AAAA,MACA,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAE;AAAA,MACA,eAAAC;AAAA,MACA,oBAAAC;AAAA,MACA,WAAArE;AAAA,IAAA,CACD;AAAA,EACH;AACF;ACxIO,MAAMuE,GAAc;AAAA,EACf;AAAA,EAEV,YAAYC,GAAe;AACzB,SAAK,OAAOA;AAAA,EACd;AAAA,EAEA,IAAI,MAAc;AAChB,WAAO,KAAK,KAAK,KAAK,CAAC,EAAE,MAAA;AAAA,EAC3B;AAAA,EAEA,IAAI,WAAoB;AAGtB,WAAO,KAAK,KAAK,KAAK,WAAW,IAAI,KAAK,KAAK,KAAK,CAAC,EAAE,UAAA,IAAc;AAAA,EACvE;AAAA,EAEA,IAAI,QAAoB;AACtB,WAAO,KAAK,aAAa;AAAA,EAC3B;AAAA,EAEA,IAAI,WAAoB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAc,eAAwB;AAEpC,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,SAAS,CAAC;AAAA,EACjD;AACF;AAGO,MAAMC,WAAsCF,GAAc;AAAA,EAC/D,IAAI,OAAgB;AAClB,WAAO,KAAK,SAAS,KAAK,CAAC,GAAG,eAAe;AAAA,EAC/C;AAAA,EAEA,IAAI,oBAAwC;AAC1C,WAAO,KAAK,SAAS,KAAK,SAAS,IAC/B,KAAK,SAAS,KAAK,CAAC,EAAE,UAAA,IACtB;AAAA,EACN;AAAA;AAAA;AAAA,EAIA,IAAY,WAAoB;AAC9B,WAAO,KAAK,aAAa,KAAK,CAAC;AAAA,EACjC;AACF;AAGO,MAAMG,WAA8BH,GAAc;AAAA,EACvD,IAAI,mBAA4B;AAC9B,WAAO,KAAK,UAAU,CAAC,MAAM;AAAA,EAC/B;AAAA,EAEA,IAAI,cAAuB;AACzB,WAAO,KAAK,UAAU,CAAC,MAAM;AAAA,EAC/B;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,KAAK,UAAU,CAAC,MAAM;AAAA,EAC/B;AAAA;AAAA;AAAA,EAIA,IAAY,YAAsB;AAChC,WAAO,KAAK,aAAa,KAAK,CAAC,EAAE,YAAA;AAAA,EACnC;AACF;AAGO,MAAMI,WAA4CJ,GAAc;AAAA,EACrE,IAAI,aAAiC;AACnC,UAAMK,IAAa,KAAK,gBAAgB,CAAI,GAAG;AAC/C,QAAIA,MAAe;AAGjB,aAAOluB,EAAmBkuB,CAAU;AAAA,EAExC;AAAA,EAEA,IAAI,MAA0B;AAC5B,UAAMC,IAAM,KAAK,gBAAgB,CAAI,GAAG;AACxC,QAAIA,MAAQ;AAGV,aAAOnuB,EAAmBmuB,CAAG;AAAA,EAEjC;AAAA;AAAA,EAGO,UAAU1sB,GAAiC;AAChD,UAAM2sB,IAAY,KAAK,gBAAgB,CAAI;AAS3C,QAPIA,MAAc,UAMGA,EAAU,KAAK,CAAC,EAAE,MAAA,MAClB3sB;AACnB;AAIF,UAAM4sB,IAAiBD,EAAU,KAAK,CAAC;AACvC,WAAOpuB,EAAmBquB,EAAe,KAAK,CAAC,EAAE,KAAK;AAAA,EACxD;AAAA,EAEQ,gBAAgBvrB,GAAkC;AACxD,WAAO,KAAK,aAAa,KAAK,CAACwrB,MAAOA,EAAG,IAAI,kBAAkBxrB,CAAG,CAAC;AAAA,EACrE;AAAA;AAAA,EAGA,IAAY,eAA0B;AACpC,WAAO,KAAK,aAAa,KAAK,CAAC,EAAE;AAAA,EACnC;AACF;AAGO,MAAMyrB,WAAoCV,GAAc;AAAA,EAC7D,IAAI,gBAAwC;AAC1C,WAAO,KAAK,mBAAmB,CAAI,GAAG;AAAA,EACxC;AAAA,EAEQ,mBAAmB/qB,GAAkC;AAC3D,WAAO,KAAK,SAAS,KAAK,KAAK,CAAC0rB,MAAOA,EAAG,IAAI,kBAAkB1rB,CAAG,CAAC;AAAA,EACtE;AAAA;AAAA,EAGA,IAAY,WAAoB;AAC9B,WAAO,KAAK,aAAa,KAAK,CAAC;AAAA,EACjC;AACF;AAGO,MAAM2rB,WAAkCZ,GAAc;AAAA,EAC3D,IAAI,gBAA4B;AAC9B,WAAO,KAAK,aAAa,KAAK,CAAC,EAAE;AAAA,EACnC;AACF;AAIA,MAAMa,WAA8Bb,GAAc;AAAA,EAChD,IAAI,cAAsB;AACxB,WAAO7tB,EAAmB,KAAK,aAAa,KAAK;AAAA,EACnD;AACF;AAGA,MAAM2uB,UAA8Bd,GAAc;AAAA,EAChD,IAAI,cAAsB;AACxB,WAAO7tB,EAAmB,KAAK,aAAa,KAAK,CAAC,EAAE,KAAK;AAAA,EAC3D;AACF;AAGO,MAAM4uB,WAA2BF,GAAsB;AAAA,EAC5D,IAAI,SAAiB;AACnB,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMG,WAA2CH,GAAsB;AAAA,EAC5E,IAAI,kBAA0B;AAC5B,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMI,WAAuCJ,GAAsB;AAAA,EACxE,IAAI,cAAsB;AACxB,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMK,WAAwCL,GAAsB;AAAA,EACzE,IAAI,eAAuB;AACzB,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMM,WAA8CN,GAAsB;AAAA,EAC/E,IAAI,qBAA6B;AAC/B,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMO,WAAuCP,GAAsB;AAAA,EACxE,IAAI,cAAsB;AACxB,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMQ,WAA2BP,EAAsB;AAAA,EAC5D,IAAI,SAAiB;AACnB,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMQ,WAAoCR,EAAsB;AAAA,EACrE,IAAI,iBAAyB;AAC3B,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMS,WAAuCT,EAAsB;AAAA,EACxE,IAAI,oBAA4B;AAC9B,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMU,WAAuCV,EAAsB;AAAA,EACxE,IAAI,oBAA4B;AAC9B,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMW,WAAyCX,EAAsB;AAAA,EAC1E,IAAI,sBAA8B;AAChC,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMY,WAA4CZ,EAAsB;AAAA,EAC7E,IAAI,yBAAiC;AACnC,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMa,WAAyCb,EAAsB;AAAA,EAC1E,IAAI,sBAA8B;AAChC,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMc,WAAgDd,EAAsB;AAAA,EACjF,IAAI,6BAAqC;AACvC,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMe,WAA8Cf,EAAsB;AAAA,EAC/E,IAAI,2BAAmC;AACrC,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMgB,WAAqDhB,EAAsB;AAAA,EACtF,IAAI,kCAA0C;AAC5C,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMiB,WAAoCjB,EAAsB;AAAA,EACrE,IAAI,iBAAyB;AAC3B,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMkB,WAAuClB,EAAsB;AAAA,EACxE,IAAI,oBAA4B;AAC9B,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMmB,WAAkCnB,EAAsB;AAAA,EACnE,IAAI,eAAuB;AACzB,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMoB,WAAsCpB,EAAsB;AAAA,EACvE,IAAI,mBAA2B;AAC7B,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMqB,WAAgDrB,EAAsB;AAAA,EACjF,IAAI,6BAAqC;AACvC,WAAO,KAAK;AAAA,EACd;AACF;AAGO,MAAMsB,WAAyBpC,GAAc;AAAA,EAClD,YAAYC,GAAe;AACzB,UAAMA,CAAI;AAAA,EACZ;AAAA,EAEA,IAAI,8BAA4D;AAC9D,UAAMpvB,IAAM,KAAK,aAAa,KAAK,CAAC,EAAE,OAChCD,IAAS,IAAI0D,GAAWzD,CAAG,GAI3BkC,IAAMnC,EAAO,UAAA,IAAc,GAE3ByxB,IAAwC,CAAA;AAC9C,WAAOzxB,EAAO,WAAWmC,KAAK;AAE5B,YAAMuvB,IAAY1xB,EAAO,UAAA,GAGnB2xB,IAAM3xB,EAAO,SAAS0xB,CAAS;AACrC,MAAAD,EAAQ,KAAK/C,GAA2B,MAAMiD,CAAG,CAAC;AAAA,IACpD;AAEA,QAAI3xB,EAAO,aAAamC;AACtB,YAAM,IAAI,MAAM,8CAA8C;AAGhE,WAAOsvB;AAAA,EACT;AACF;AC1SA,MAAMG,KAA+B,aAC/BC,KAA0B,aAC1BC,KAAiC,aACjCC,KAAkC,aAClCC,KAAiC,aAG1BC,KAAoB,2BAIpBC,KAAiC,yBACjCC,KAAwC,yBACxCC,KAAoC,yBACpCC,KAAqC,yBACrCC,KAA2C,yBAC3CC,KAAoC,yBACpCC,KAA0B,yBAC1BC,KAAiC,yBACjCC,KAAiC,yBACjCC,KAAoC,0BACpCC,KAAmC,0BACnCC,KAAsC,0BACtCC,KAAyC,0BACzCC,KAAsC,0BACtCC,KAA6C,0BAC7CC,KAA4C,0BAC5CC,KAAmD,0BACnDC,KAAiC,0BACjCC,KAAoC,0BACpCC,KAA8B,0BAC9BC,KAAmC,0BACnCC,KAA6C;AAEnD,MAAMC,EAAgB;AAAA,EACpB;AAAA,EAEP,YAAYnE,GAAe;AACzB,SAAK,OAAOA;AAAA,EACd;AAAA,EAEA,OAAc,MAAMoE,GAA4C;AAC9D,UAAMzuB,IAAM,OAAOyuB,KAAS,WAAW3uB,GAAM2uB,CAAI,IAAIA,GAC/CpE,IAAOjrB,GAAQ,YAAYY,CAAG;AACpC,WAAO,IAAIwuB,EAAgBnE,CAAI;AAAA,EACjC;AAAA,EAEA,IAAI,iBAA0B;AAC5B,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,UAAkB;AAGpB,WAAO,KADK,KAAK,WAAW,KAAK,CAAC,EAAE,UAAA,IAClB,OAAO,CAAC,GAAG,UAAU;AAAA,EACzC;AAAA,EAEA,IAAI,eAA2B;AAC7B,WAAO,KAAK,gBAAgB;AAAA,EAC9B;AAAA,EAEA,IAAI,YAAkB;AAEpB,WAAO,KAAK,YAAY,KAAK,CAAC,EAAE,OAAA;AAAA,EAClC;AAAA,EAEA,IAAI,WAAiB;AAEnB,WAAO,KAAK,YAAY,KAAK,CAAC,EAAE,OAAA;AAAA,EAClC;AAAA,EAEA,IAAI,SAAqB;AACvB,WAAO,KAAK,UAAU;AAAA,EACxB;AAAA,EAEA,IAAI,UAAsB;AACxB,WAAO,KAAK,WAAW;AAAA,EACzB;AAAA,EAEA,IAAI,YAAwB;AAC1B,WAAO,KAAK,wBAAwB,MAAA;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAa,gBAAgB3B,GAAkBgG,GAAsC;AACnF,UAAMrM,IAAY,KAAK,wBAAwB,MAAA,GACzCsM,IAAOvvB,GAAQ,YAAYijB,CAAS,GACpCuM,IAAeD,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAA,GAGpCE,IAAWD,MAAiB;AAGlC,QAFoBA,MAAiBtF;AAInC,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAKJ,QAAIuF,GAAU;AACZ,YAAM5iB,IAAOyc,KAAWc,IAElB5B,IAAS8G,IAASziB,IAAO,SAASA,CAAI;AAC5C,aAAOyb,GAAU5mB,EAAS,KAAK8mB,GAAQ9rB,GAAmBumB,CAAS,CAAC;AAAA,IACtE,OAAO;AAEL,YAAMyM,IAAWH,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAA,GACjC7F,IAAQW,GAAkBqF,CAAQ;AACxC,UAAI,CAAChG;AACH,cAAM,IAAI,MAAM,4BAA4BgG,CAAQ,EAAE;AAExD,aAAOpH,GAAU5mB,EAAS,OAAOgoB,GAAOhtB,GAAmBumB,CAAS,CAAC;AAAA,IACvE;AAAA,EACF;AAAA,EAEA,IAAI,eAAmC;AACrC,WAAO,KAAK,gBAAA;AAAA,EACd;AAAA,EAEA,IAAI,qBAA6B;AAC/B,UAAMrkB,IAAc,KAAK,sBAAsB,KAAK,CAAC,EAAE,MAAA;AACvD,WAAOorB,GAAsBprB,CAAG,KAAKqrB,GAAoBrrB,CAAG,KAAK,KAAK,yBAAA;AAAA,EACxE;AAAA,EAEA,IAAI,wBAAgC;AAClC,WAAO,KAAK,sBAAsB,KAAK,CAAC,EAAE,MAAA;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,2BAAmC;AAEzC,QADkB,KAAK,sBAAsB,KAAK,CAAC,EAAE,MAAA,MACnCsrB;AAChB,aAAO;AAIT,UAAM9O,IAAS,KAAK,sBAAsB,KAAK,CAAC;AAChD,QAAI,CAACA,KAAUA,EAAO,KAAK,WAAW;AACpC,aAAOgP;AAIT,UAAMuF,IAAiBvU,EAAO,KAAK,CAAC;AACpC,QAAIuU,KAAkBA,EAAe,KAAK,SAAS,GAAG;AAEpD,YAAMC,IAAaD,EAAe,KAAK,CAAC;AACxC,UAAIC,KAAcA,EAAW,KAAK,SAAS,GAAG;AAC5C,cAAMC,IAAUD,EAAW,KAAK,CAAC,EAAE,MAAA;AACnC,eAAOzF,GAAgB0F,CAAO,KAAKzF;AAAA,MACrC;AAAA,IACF;AAEA,WAAOA;AAAA,EACT;AAAA,EAEA,IAAI,iBAA6B;AAE/B,WAAO,KAAK,kBAAkB,MAAM,SAAS,CAAC;AAAA,EAChD;AAAA,EAEA,IAAI,iBAAqC;AACvC,UAAM0F,IAAM,KAAK;AACjB,WAAOA,GAAK,OAAOA,GAAK;AAAA,EAC1B;AAAA,EAEA,IAAI,aAAwB;AAI1B,WADe,KAAK,eAAe,KAAK,CAAC,GAC1B;AAAA,IAAmC,CAAA;AAAA,EACpD;AAAA,EAEA,IAAI,cAAiD;AACnD,UAAMA,IAAM,KAAK,cAAcrC,EAAuB;AACtD,WAAOqC,IAAM,IAAI3E,GAAsB2E,CAAG,IAAI;AAAA,EAChD;AAAA,EAEA,IAAI,sBAAiE;AACnE,UAAMA,IAAM,KAAK,cAAcnC,EAA+B;AAC9D,WAAOmC,IAAM,IAAI5E,GAA8B4E,CAAG,IAAI;AAAA,EACxD;AAAA,EAEA,IAAI,oBAAqE;AACvE,UAAMA,IAAM,KAAK,cAAcpC,EAA8B;AAC7D,WAAOoC,IAAM,IAAI1E,GAAoC0E,CAAG,IAAI;AAAA,EAC9D;AAAA,EAEA,IAAI,oBAA6D;AAC/D,UAAMA,IAAM,KAAK,cAAclC,EAA8B;AAC7D,WAAOkC,IAAM,IAAIpE,GAA4BoE,CAAG,IAAI;AAAA,EACtD;AAAA,EAEA,IAAI,kBAAyD;AAC3D,UAAMA,IAAM,KAAK,cAActC,EAA4B;AAC3D,WAAOsC,IACH,IAAIlE,GAA0BkE,CAAG;AAAA;AAAA,MACN;AAAA;AAAA,EACjC;AAAA,EAEA,IAAI,SAAuC;AACzC,UAAMA,IAAM,KAAK,cAAcjC,EAAiB;AAChD,WAAOiC,IAAM,IAAI1C,GAAiB0C,CAAG,IAAI;AAAA,EAC3C;AAAA,EAEA,IAAI,oBAAoD;AACtD,UAAMA,IAAM,KAAK,cAAchC,EAA8B;AAC7D,WAAOgC,IAAM,IAAI/D,GAAmB+D,CAAG,IAAI;AAAA,EAC7C;AAAA,EAEA,IAAI,oBAAoD;AACtD,UAAMA,IAAM,KAAK,cAAczB,EAA8B;AAC7D,WAAOyB,IAAM,IAAIzD,GAAmByD,CAAG,IAAI;AAAA,EAC7C;AAAA,EAEA,IAAI,2BAA2E;AAC7E,UAAMA,IAAM,KAAK,cAAc/B,EAAqC;AACpE,WAAO+B,IAAM,IAAI9D,GAAmC8D,CAAG,IAAI;AAAA,EAC7D;AAAA,EAEA,IAAI,uBAAmE;AACrE,UAAMA,IAAM,KAAK,cAAc9B,EAAiC;AAChE,WAAO8B,IAAM,IAAI7D,GAA+B6D,CAAG,IAAI;AAAA,EACzD;AAAA,EAEA,IAAI,wBAAqE;AACvE,UAAMA,IAAM,KAAK,cAAc7B,EAAkC;AACjE,WAAO6B,IAAM,IAAI5D,GAAgC4D,CAAG,IAAI;AAAA,EAC1D;AAAA,EAEA,IAAI,8BAAiF;AACnF,UAAMA,IAAM,KAAK,cAAc5B,EAAwC;AACvE,WAAO4B,IAAM,IAAI3D,GAAsC2D,CAAG,IAAI;AAAA,EAChE;AAAA,EAEA,IAAI,uBAAmE;AACrE,UAAMA,IAAM,KAAK,cAAc3B,EAAiC;AAChE,WAAO2B,IAAM,IAAI1D,GAA+B0D,CAAG,IAAI;AAAA,EACzD;AAAA,EAEA,IAAI,oBAA6D;AAC/D,UAAMA,IAAM,KAAK,cAAcxB,EAA8B;AAC7D,WAAOwB,IAAM,IAAIxD,GAA4BwD,CAAG,IAAI;AAAA,EACtD;AAAA,EAEA,IAAI,uBAAmE;AACrE,UAAMA,IAAM,KAAK,cAAcvB,EAAiC;AAChE,WAAOuB,IAAM,IAAIvD,GAA+BuD,CAAG,IAAI;AAAA,EACzD;AAAA,EAEA,IAAI,uBAAmE;AACrE,UAAMA,IAAM,KAAK,cAActB,EAAgC;AAC/D,WAAOsB,IAAM,IAAItD,GAA+BsD,CAAG,IAAI;AAAA,EACzD;AAAA,EAEA,IAAI,yBAAuE;AACzE,UAAMA,IAAM,KAAK,cAAcrB,EAAmC;AAClE,WAAOqB,IAAM,IAAIrD,GAAiCqD,CAAG,IAAI;AAAA,EAC3D;AAAA,EAEA,IAAI,4BAA6E;AAC/E,UAAMA,IAAM,KAAK,cAAcpB,EAAsC;AACrE,WAAOoB,IAAM,IAAIpD,GAAoCoD,CAAG,IAAI;AAAA,EAC9D;AAAA,EAEA,IAAI,yBAAuE;AACzE,UAAMA,IAAM,KAAK,cAAcnB,EAAmC;AAClE,WAAOmB,IAAM,IAAInD,GAAiCmD,CAAG,IAAI;AAAA,EAC3D;AAAA,EAEA,IAAI,gCAAqF;AACvF,UAAMA,IAAM,KAAK,cAAclB,EAA0C;AACzE,WAAOkB,IAAM,IAAIlD,GAAwCkD,CAAG,IAAI;AAAA,EAClE;AAAA,EAEA,IAAI,8BAAiF;AACnF,UAAMA,IAAM,KAAK,cAAcjB,EAAyC;AACxE,WAAOiB,IAAM,IAAIjD,GAAsCiD,CAAG,IAAI;AAAA,EAChE;AAAA,EAEA,IAAI,qCAA+F;AACjG,UAAMA,IAAM,KAAK,cAAchB,EAAgD;AAC/E,WAAOgB,IAAM,IAAIhD,GAA6CgD,CAAG,IAAI;AAAA,EACvE;AAAA,EAEA,IAAI,oBAA6D;AAC/D,UAAMA,IAAM,KAAK,cAAcf,EAA8B;AAC7D,WAAOe,IAAM,IAAI/C,GAA4B+C,CAAG,IAAI;AAAA,EACtD;AAAA,EAEA,IAAI,uBAAmE;AACrE,UAAMA,IAAM,KAAK,cAAcd,EAAiC;AAChE,WAAOc,IAAM,IAAI9C,GAA+B8C,CAAG,IAAI;AAAA,EACzD;AAAA,EAEA,IAAI,kBAAyD;AAC3D,UAAMA,IAAM,KAAK,cAAcb,EAA2B;AAC1D,WAAOa,IAAM,IAAI7C,GAA0B6C,CAAG,IAAI;AAAA,EACpD;AAAA,EAEA,IAAI,sBAAiE;AACnE,UAAMA,IAAM,KAAK,cAAcZ,EAAgC;AAC/D,WAAOY,IAAM,IAAI5C,GAA8B4C,CAAG,IAAI;AAAA,EACxD;AAAA,EAEA,IAAI,gCAAqF;AACvF,UAAMA,IAAM,KAAK,cAAcX,EAA0C;AACzE,WAAOW,IAAM,IAAI3C,GAAwC2C,CAAG,IAAI;AAAA,EAClE;AAAA,EAEA,IAAI,OAAgB;AAClB,UAAMC,IAAK,KAAK,qBAAqB,QAAQ;AAG7C,WAAI,KAAK,cACAA,KAAM,KAAK,YAAY,cAGzBA;AAAA,EACT;AAAA,EAEO,UAAUnxB,GAAwC;AACvD,UAAMkxB,IAAM,KAAK,cAAclxB,CAAG;AAClC,WAAOkxB,IAAM,IAAI9E,GAAc8E,CAAG,IAAI;AAAA,EACxC;AAAA,EAEA,MAAa,OAAOE,GAAuD;AAEzE,UAAMC,IAAY,KAAK,uBACjBC,IAAWD,MAAc/F,IAGzBZ,IAAU4G,IACZ,KAAK,yBAAA,IACJjG,GAAoBgG,CAAS,KAAKjG,GAAsBiG,CAAS,GAIhEE,IAAeH,IACjB,MAAMA,EAAkB,gBAAgB1G,GAAS4G,CAAQ,IACzD,MAAM,KAAK,gBAAgB5G,GAAS4G,CAAQ;AAEhD,WAAO,MAAMrH;AAAA,MACXsH;AAAA,MACA,KAAK,eAAe,MAAA;AAAA,MACpB,KAAK;AAAA,MACL,KAAK;AAAA,IAAA;AAAA,EAET;AAAA,EAEO,aAAaC,GAAqB;AACvC,WAAO,KAAK,aAAaA,KAAQA,KAAQ,KAAK;AAAA,EAChD;AAAA,EAEO,OAAOpQ,GAAiC;AAC7C,WAAOziB,EAAgB,KAAK,KAAK,MAAA,GAASyiB,EAAM,KAAK,OAAO;AAAA,EAC9D;AAAA;AAAA,EAGO,QAAyB;AAC9B,UAAMpf,IAAM,KAAK,KAAK,MAAA,GAChByvB,IAAQ,IAAI,WAAWzvB,CAAG;AAChC,WAAOwuB,EAAgB,MAAMiB,CAAK;AAAA,EACpC;AAAA,EAEQ,cAAczxB,GAAkC;AAGtD,WAAO,KAAK,WAAW,KAAK,CAACkxB,MAAQA,EAAI,KAAK,CAAC,EAAE,MAAA,MAAYlxB,CAAG;AAAA,EAClE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAY,oBAA6B;AAEvC,WAAO,KAAK,KAAK,KAAK,CAAC;AAAA,EACzB;AAAA;AAAA,EAGA,IAAY,wBAAiC;AAE3C,WAAO,KAAK,KAAK,KAAK,CAAC;AAAA,EACzB;AAAA;AAAA,EAGA,IAAY,oBAA6B;AAEvC,WAAO,KAAK,KAAK,KAAK,CAAC;AAAA,EACzB;AAAA;AAAA,EAGA,IAAY,aAAsB;AAEhC,WAAO,KAAK,kBAAkB,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA,EAGA,IAAY,kBAA2B;AAErC,WAAO,KAAK,kBAAkB,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA,EAGA,IAAY,YAAqB;AAE/B,WAAO,KAAK,kBAAkB,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA,EAGA,IAAY,cAAuB;AAEjC,WAAO,KAAK,kBAAkB,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA,EAGA,IAAY,aAAsB;AAEhC,WAAO,KAAK,kBAAkB,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA,EAGA,IAAY,0BAAmC;AAE7C,WAAO,KAAK,kBAAkB,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,IAAY,gBAAqC;AAC/C,WAAO,KAAK,kBAAkB,KAAK;AAAA,MAAK,CAACyB,MACvCA,EAAI,IAAI,kBAAkB,CAAI;AAAA,IAAA;AAAA,EAElC;AACF;ACndO,MAAMiwB,GAAyB;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAER,YAAY/b,GAAuC;AACjD,SAAK,gBAAgBA,EAAK,eAC1B,KAAK,eAAeA,EAAK,cACzB,KAAK,aAAagc,GAAmB;AAAA,MACnC,GAAGhc,EAAK;AAAA,MACRA,EAAK;AAAA,IAAA,CACN,GACD,KAAK,YAAYA,EAAK;AAAA,EACxB;AAAA,EAEA,MAAa,SAAqC;AAChD,UAAMic,IAAkB,MAAM,KAAK,KAAA;AAQnC,QANA,KAAK,UAAUA,CAAe,GAM1B,CAJiBA,EAAgB;AAAA,MAAM,CAACnB,MAC1CA,EAAK,aAAa,KAAK,SAAS;AAAA,IAAA;AAIhC,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAIJ,WAAOmB;AAAA,EACT;AAAA,EAEA,MAAc,OAAmC;AAC/C,UAAMC,IAAW,KAAK;AAEtB,QAAIC,IAAQ,MAAM,KAAK,WAAWD,CAAQ;AAM1C,QAJAC,IAAQA,EAAM;AAAA,MAAO,CAACC,MACpBA,EAAK,KAAK,CAACtB,MAAS,KAAK,aAAa,SAASA,CAAI,CAAC;AAAA,IAAA,GAGlDqB,EAAM,WAAW;AACnB,YAAM,IAAI,MAAM,mCAAmC;AAGrD,UAAMC,IAAOD,EAAM;AAAA,MAAO,CAAC7W,GAAM+W,MAC/B/W,EAAK,SAAS+W,EAAK,SAAS/W,IAAO+W;AAAA,IAAA;AAGrC,WAAO,CAACH,GAAU,GAAGE,CAAI,EAAE,MAAM,GAAG,EAAE;AAAA,EACxC;AAAA,EAEA,MAAc,WACZhwB,GAC8B;AAC9B,UAAM+vB,IAAQ,CAAA,GACRG,IAAU,MAAM,KAAK,WAAWlwB,CAAW;AAEjD,QAAIkwB,EAAQ,WAAW;AACrB,YAAM,IAAI,MAAM,iCAAiC;AAGnD,aAAS70B,IAAI,GAAGA,IAAI60B,EAAQ,QAAQ70B,KAAK;AACvC,YAAM80B,IAASD,EAAQ70B,CAAC;AAExB,UAAI80B,EAAO,OAAOnwB,CAAW,GAAG;AAC9B,QAAA+vB,EAAM,KAAK,CAAC/vB,CAAW,CAAC;AACxB;AAAA,MACF;AAEA,YAAMowB,IAAW,MAAM,KAAK,WAAWD,CAAM;AAE7C,eAAS1xB,IAAI,GAAGA,IAAI2xB,EAAS,QAAQ3xB;AACnC,QAAAsxB,EAAM,KAAK,CAACI,GAAQ,GAAGC,EAAS3xB,CAAC,CAAC,CAAC;AAAA,IAEvC;AAEA,WAAOsxB;AAAA,EACT;AAAA,EAEA,MAAc,WACZ/vB,GAC4B;AAC5B,QAAIkwB,IAA6B,CAAA,GAC7BG;AAEJ,QAAIzzB,EAAgBoD,EAAY,SAASA,EAAY,MAAM,KACrD,MAAMA,EAAY;AACpB,aAAO,CAACA,CAAW;AAIvB,IAAIA,EAAY,sBACdqwB,IAAgBrwB,EAAY,kBAAkB,gBAGhD,KAAK,WAAW,QAAQ,CAACswB,MAAmB;AAC1C,UAAID,KACEC,EAAe,iBAAiB;AAClC,QACE1zB;AAAA,UACE0zB,EAAe,gBAAgB;AAAA,UAC/BD;AAAA,QAAA,KAGFH,EAAQ,KAAKI,CAAc;AAE7B;AAAA,MACF;AAGF,MAAI1zB,EAAgB0zB,EAAe,SAAStwB,EAAY,MAAM,KAC5DkwB,EAAQ,KAAKI,CAAc;AAAA,IAE/B,CAAC;AAED,UAAMC,IAAqC,CAAA;AAC3C,eAAWJ,KAAUD;AACnB,UAAI;AACF,QAAI,MAAMlwB,EAAY,OAAOmwB,CAAM,KACjCI,EAAgB,KAAKJ,CAAM;AAAA,MAE/B,QAAa;AAAA,MAEb;AAGF,WAAOI;AAAA,EACT;AAAA,EAEQ,UAAUP,GAA+B;AAC/C,QAAIA,EAAK,SAAS;AAChB,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAKJ,QAAI,CADaA,EAAK,MAAM,CAAC,EAAE,MAAM,CAACtB,MAASA,EAAK,IAAI;AAEtD,YAAM,IAAI,MAAM,sCAAsC;AAGxD,aAASrzB,IAAI20B,EAAK,SAAS,GAAG30B,KAAK,GAAGA;AACpC,UAAI,CAACuB,EAAgBozB,EAAK30B,CAAC,EAAE,QAAQ20B,EAAK30B,IAAI,CAAC,EAAE,OAAO;AACtD,cAAM,IAAI,MAAM,qCAAqC;AAIzD,aAASA,IAAI,GAAGA,IAAI20B,EAAK,QAAQ30B,KAAK;AACpC,YAAMqzB,IAAOsB,EAAK30B,CAAC;AAEnB,UAAIqzB,EAAK,qBAAqB,MAAM;AAClC,cAAM8B,IAAa9B,EAAK,oBAAoB;AAE5C,YAAI8B,MAAe,UAAaA,IAAa,OAAOn1B,IAAI,CAAC;AACvD,gBAAM,IAAI,MAAM,iCAAiC;AAAA,MAErD;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAASu0B,GAAmBa,GAA6C;AACvE,WAASp1B,IAAI,GAAGA,IAAIo1B,EAAM,QAAQp1B;AAChC,aAASoD,IAAIpD,IAAI,GAAGoD,IAAIgyB,EAAM,QAAQhyB;AACpC,MAAIgyB,EAAMp1B,CAAC,EAAE,OAAOo1B,EAAMhyB,CAAC,CAAC,MAC1BgyB,EAAM,OAAOhyB,GAAG,CAAC,GACjBA;AAIN,SAAOgyB;AACT;ACpMA,MAAMC,KAAa;AAGZ,SAASC,GACdC,GACAC,GACY;AACZ,QAAMhkB,IAAS;AAAA,IACb6jB;AAAA,IACAE,EAAY;AAAA,IACZA;AAAA,IACAC,EAAQ;AAAA,IACR;AAAA,EAAA,EACA,KAAK,GAAG,GAKJC,IADU,IAAI,YAAA,EACS,OAAOjkB,CAAM;AAG1C,WAASxR,IAAI,GAAGA,IAAIy1B,EAAa,QAAQz1B;AACvC,QAAIy1B,EAAaz1B,CAAC,IAAI;AACpB,YAAM,IAAI,MAAM,yDAAyDA,CAAC,EAAE;AAKhF,QAAM01B,IAAgB,IAAI,WAAWD,EAAa,SAASD,EAAQ,MAAM;AAEzE,SAAAE,EAAc,IAAID,GAAc,CAAC,GACjCC,EAAc,IAAIF,GAASC,EAAa,MAAM,GACvCC;AACT;AClCA,MAAMC,KAA2B,IAAI,WAAW,CAAC,CAAI,CAAC,GAChDC,KAA2B,IAAI,WAAW,CAAC,CAAI,CAAC;AAEtD,eAAsBC,GACpBC,GACe;AACf,MAAI,CAACA,EAAM;AACT,UAAM,IAAI,MAAM,yBAAyB;AAG3C,QAAMC,IAAiBD,EAAM,gBACvBE,IAAW,OAAOD,EAAe,QAAQ,GACzCE,IAAW,OAAOF,EAAe,QAAQ;AAE/C,MAAIC,IAAW,MAAMA,KAAYC;AAC/B,UAAM,IAAI,MAAM,sBAAsBD,CAAQ,EAAE;AAKlD,QAAM,EAAE,OAAAE,GAAO,QAAAC,EAAA,IAAWC,GAAgBJ,GAAUC,CAAQ;AAE5D,MAAIF,EAAe,OAAO,WAAWG,IAAQC;AAC3C,UAAM,IAAI,MAAM,uCAAuC;AAGzD,QAAME,IAAcN,EAAe,OAChC,MAAM,GAAGG,CAAK,EACd,IAAI,CAAC7vB,MAAMjG,EAAmBiG,CAAC,CAAC,GAC7BiwB,IAAeP,EAAe,OACjC,MAAMG,CAAK,EACX,IAAI,CAAC7vB,MAAMjG,EAAmBiG,CAAC,CAAC,GAG7BkwB,IAAW,MAAMC,GAASp2B,EAAmB01B,EAAM,iBAAiB,CAAC,GAGrEW,IAAiB,MAAMC;AAAA,IAC3B,MAAMC,GAAWJ,GAAUF,GAAaL,CAAQ;AAAA,IAChDM;AAAA,EAAA,GAGIM,IAAWx2B,EAAmB21B,EAAe,QAAQ;AAG3D,MAAI,CAACx0B,EAAgBk1B,GAAgBG,CAAQ;AAC3C,UAAM,IAAI,MAAM,qDAAqD;AAEzE;AAMA,SAASR,GACPS,GACAjzB,GACmC;AACnC,QAAMsyB,IAAQY,GAAeD,GAAOjzB,CAAI,GAClCuyB,IAASY,GAAUF,KAAS,OAAOX,CAAK,CAAC;AAC/C,SAAO,EAAE,OAAAA,GAAO,QAAAC,EAAA;AAClB;AAKA,eAAeQ,GACbjjB,GACAsjB,GACAH,GACqB;AACrB,MAAI5d,IAAMvF;AACV,WAAS1T,IAAI,GAAGA,IAAIg3B,EAAO,QAAQh3B,KAAK;AACtC,UAAMqG,IAAI2wB,EAAOh3B,CAAC;AAClB,IAAK62B,KAAS,OAAO72B,CAAC,IAAK,OAAO,CAAC,IACjCiZ,IAAM,MAAMge,GAAa5wB,GAAG4S,CAAG,IAE/BA,IAAM,MAAMge,GAAahe,GAAK5S,CAAC;AAAA,EAEnC;AACA,SAAO4S;AACT;AAGA,eAAeyd,GACbhjB,GACAsjB,GACqB;AACrB,MAAI/d,IAAMvF;AACV,aAAWrN,KAAK2wB;AACd,IAAA/d,IAAM,MAAMge,GAAa5wB,GAAG4S,CAAG;AAEjC,SAAOA;AACT;AAEA,SAAS6d,GAAeD,GAAejzB,GAAsB;AAC3D,SAAOkX,GAAU+b,IAASjzB,IAAO,OAAO,CAAC,CAAE;AAC7C;AAIA,SAASmzB,GAAUt3B,GAAqB;AACtC,SAAOA,EAAI,SAAS,CAAC,EAAE,MAAM,GAAG,EAAE,SAAS;AAC7C;AAGA,SAASqb,GAAU5Y,GAAmB;AACpC,SAAIA,MAAM,KACD,IAEFA,EAAE,SAAS,CAAC,EAAE;AACvB;AAIA,eAAe+0B,GACbxT,GACAC,GACqB;AACrB,QAAM3iB,IAAO,IAAI;AAAA,IACf60B,GAAyB,SAASnS,EAAK,SAASC,EAAM;AAAA,EAAA;AAExD,EAAA3iB,EAAK,IAAI60B,IAA0B,CAAC,GACpC70B,EAAK,IAAI0iB,GAAMmS,GAAyB,MAAM,GAC9C70B,EAAK,IAAI2iB,GAAOkS,GAAyB,SAASnS,EAAK,MAAM;AAE7D,QAAM5S,IAAO,MAAM,OAAO,OAAO,OAAOjL,EAAe,QAAQ7E,CAA+B;AAC9F,SAAO,IAAI,WAAW8P,CAAI;AAC5B;AAEA,eAAe2lB,GAASU,GAAuC;AAC7D,QAAMn2B,IAAO,IAAI,WAAW40B,GAAyB,SAASuB,EAAK,MAAM;AACzE,EAAAn2B,EAAK,IAAI40B,IAA0B,CAAC,GACpC50B,EAAK,IAAIm2B,GAAMvB,GAAyB,MAAM;AAE9C,QAAM9kB,IAAO,MAAM,OAAO,OAAO,OAAOjL,EAAe,QAAQ7E,CAA+B;AAC9F,SAAO,IAAI,WAAW8P,CAAI;AAC5B;ACrHA,MAAMsmB,KAAuB;AAAA;AAAA,GAGvBC,KAAkB;AASjB,MAAMC,GAAW;AAAA,EACb;AAAA,EACA;AAAA,EAET,YAAYC,GAAcC,GAA6B;AACrD,SAAK,OAAOD,GACZ,KAAK,aAAaC;AAAA,EACpB;AAAA,EAEA,OAAO,WAAWC,GAA8B;AAC9C,QAAI,CAACA,EAAS,SAASL,EAAoB;AACzC,YAAM,IAAI,MAAM,8BAA8B;AAIhD,UAAMzsB,IAAQ8sB,EAAS,QAAQL,EAAoB,GAC7CM,IAASD,EAAS,MAAM,GAAG9sB,IAAQ,CAAC,GAIpCgtB,IAHOF,EAAS,MAAM9sB,IAAQysB,GAAqB,MAAM,EAG1C,SAASC,EAAe,GAEvCG,IAA8B,CAAA;AACpC,eAAWI,KAASD,GAAS;AAC3B,YAAM,CAAA,EAAGE,GAAMnN,CAAS,IAAIkN,GACtBE,IAAWz3B,EAAmBqqB,CAAS;AAG7C,UAAIoN,EAAS,SAAS;AACpB,cAAM,IAAI,MAAM,gCAAgC;AAGlD,MAAAN,EAAW,KAAK;AAAA,QACd,MAAAK;AAAA,QACA,SAASC,EAAS,SAAS,GAAG,CAAC;AAAA,QAC/B,WAAWA,EAAS,SAAS,CAAC;AAAA,MAAA,CAC/B;AAAA,IACH;AAEA,QAAIN,EAAW,WAAW;AACxB,YAAM,IAAI,MAAM,mCAAmC;AAGrD,WAAO,IAAIF,GAAWI,GAAQF,CAAU;AAAA,EAC1C;AACF;AAGO,MAAMO,GAAc;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YACEC,GACAC,GACAC,GACAC,GACA;AACA,SAAK,SAASH,GACd,KAAK,UAAUC,GACf,KAAK,UAAUC,GACf,KAAK,OAAOC;AAAA,EACd;AAAA,EAEA,OAAO,WAAWZ,GAA6B;AAC7C,UAAMa,IAAQb,EAAK,QAAA,EAAU,MAAM;AAAA,CAAI;AAEvC,QAAIa,EAAM,SAAS;AACjB,YAAM,IAAI,MAAM,oCAAoC;AAGtD,UAAMJ,IAASI,EAAM,CAAC,GAChBH,IAAU,OAAOG,EAAM,CAAC,CAAC,GACzBvB,IAAWx2B,EAAmB+3B,EAAM,CAAC,CAAC,GACtCD,IAAOC,EAAM,MAAM,CAAC;AAE1B,WAAO,IAAIL,GAAcC,GAAQC,GAASpB,GAAUsB,CAAI;AAAA,EAC1D;AACF;AAGA,eAAsBE,GACpBtC,GACAuC,GACe;AACf,MAAI,CAACvC,EAAM,gBAAgB;AACzB,UAAM,IAAI,MAAM,uCAAuC;AAIzD,QAAMwC,IAAal4B,EAAmB01B,EAAM,MAAM,KAAK,GACjDyC,IAAgBF,EAAM,OAAO,CAACG,MAAS;AAC3C,UAAMC,IAASr4B,EAAmBo4B,EAAK,MAAM,KAAK;AAClD,WAAOj3B,EAAgBk3B,GAAQH,CAAU;AAAA,EAC3C,CAAC,GAIKI,IAAa5C,EAAM,iBACrB6C,GAAkBJ,GAAe,IAAI,KAAK,OAAOzC,EAAM,cAAc,IAAI,GAAI,CAAC,IAC9EyC,GAEExC,IAAiBD,EAAM,gBACvB8C,IAAavB,GAAW,WAAWtB,EAAe,WAAW,QAAQ,GACrE8C,IAAaf,GAAc,WAAWc,EAAW,IAAI;AAE3D,MAAI,CAAE,MAAME,GAAiBF,GAAYF,CAAU;AACjD,UAAM,IAAI,MAAM,8BAA8B;AAGhD,QAAM9B,IAAWx2B,EAAmB21B,EAAe,QAAQ;AAC3D,MAAI,CAACx0B,EAAgBs3B,EAAW,SAASjC,CAAQ;AAC/C,UAAM,IAAI,MAAM,2DAA2D;AAE/E;AAGA,eAAekC,GACbF,GACAP,GACkB;AAClB,QAAMt3B,IAAOE,GAAmB23B,EAAW,IAAI;AAG/C,MAAIG,IAAoB;AAExB,aAAWtO,KAAamO,EAAW,YAAY;AAE7C,UAAMJ,IAAOH,EAAM,KAAK,CAACG,MAAS;AAChC,YAAMQ,IAAQ54B,EAAmBo4B,EAAK,MAAM,KAAK;AACjD,aAAOj3B,EAAgBy3B,EAAM,SAAS,GAAG,CAAC,GAAGvO,EAAU,OAAO;AAAA,IAChE,CAAC;AAED,QAAI,CAAC+N;AAEH;AAGF,UAAMvR,IAAY,MAAMgS,GAAcT,CAAI;AAW1C,IAPiB,MAAM3L;AAAA,MACrB5F;AAAA,MACAlmB;AAAA,MACA0pB,EAAU;AAAA,MACV+N,EAAK;AAAA,IAAA,MAILO,IAAoB;AAAA,EAExB;AAEA,SAAOA;AACT;AAIA,SAASJ,GAAkBN,GAAgBa,GAA2B;AACpE,SAAOb,EAAM,OAAO,CAACG,MAAS;AAC5B,UAAMx1B,IAAQ,IAAI,KAAKw1B,EAAK,UAAU,SAAS,KAAK,GAC9Cz2B,IAAMy2B,EAAK,UAAU,SAAS,MAChC,IAAI,KAAKA,EAAK,UAAU,SAAS,GAAG,IACpC;AAEJ,WAAOU,KAAcl2B,MAAU,CAACjB,KAAOm3B,KAAcn3B;AAAA,EACvD,CAAC;AACH;AAGA,eAAek3B,GAAcT,GAAsC;AAMjE,QAAMW,IAAaX,EAAK,UAAU;AAClC,MAAIY,GACA5M;AAEJ,MAAI2M,MAAe;AAEjB,IAAAC,IAAU1zB,EAAS,OACnB8mB,IAAS;AAAA,WACA2M,EAAW,SAAS,OAAO;AACpC,IAAAC,IAAU1zB,EAAS,OAEnB8mB,IAAS2M,EAAW,QAAQ,eAAe,EAAE,EAAE,WAAW,KAAK,GAAG;AAAA,WACzDA,EAAW,SAAS,SAAS;AACtC,IAAAC,IAAU1zB,EAAS,SACnB8mB,IAAS9mB,EAAS;AAAA,WACTyzB,EAAW,SAAS,KAAK;AAClC,IAAAC,IAAU1zB,EAAS,KAEnB8mB,IAAS2M,EAAW,QAAQ,aAAa,EAAE,EAAE,WAAW,KAAK,GAAG;AAAA;AAEhE,UAAM,IAAI,MAAM,uCAAuCA,CAAU,EAAE;AAGrE,SAAO7M;AAAA,IACL8M;AAAA,IACA5M;AAAA,IACAgM,EAAK,UAAU;AAAA,EAAA;AAEnB;ACvMA,eAAsBa,GACpBvD,GACAwD,GACe;AACf,QAAMC,IAAoBzD;AAE1B,UAAQyD,EAAkB,YAAA;AAAA,IACxB,KAAK;AACH,aAAOC,GAA2BD,GAAmBD,CAAM;AAAA,IAC7D,KAAK;AACH,aAAOG,GAA2BF,GAAmBD,CAAM;AAAA,IAC7D;AACE,YAAM,IAAI;AAAA,QACR,qCAAqCC,EAAkB,UAAU;AAAA,MAAA;AAAA,EACnE;AAEN;AAEA,SAASC,GACP1D,GACAwD,GACM;AACN,QAAMI,IAAO5D,EAAM;AACnB,MAAI,CAACwD,EAAO;AACV,UAAM,IAAI,MAAM,wDAAwD;AAG1E,QAAMK,IAAUD,EAAK,UAAU,WAAW,IACpCE,IAAex5B,EAAmBu5B,CAAO,GACzCE,IAAiBz5B,EAAmBk5B,EAAO,iBAAiB,SAAS;AAE3E,MAAI,CAAC/3B,EAAgBq4B,GAAcC,CAAc;AAC/C,UAAM,IAAI,MAAM,kDAAkD;AAGpE,QAAMC,IAAaJ,EAAK,KAAK,MAAM,SAAS,IACtCK,IAAkBn5B,GAAgBk5B,CAAU,GAC5CE,IAAoB55B;AAAA,IACxBk5B,EAAO,iBAAiB,cAAc;AAAA,EAAA;AAGxC,MAAI,CAAC/3B,EAAgBw4B,GAAiBC,CAAiB;AACrD,UAAM,IAAI,MAAM,+CAA+C;AAEnE;AAGA,SAASP,GACP3D,GACAwD,GACM;AACN,QAAMI,IAAQ5D,EAAM,KAA8B;AAClD,MAAI,CAACwD,EAAO;AACV,UAAM,IAAI,MAAM,+DAA+D;AAKjF,QAAMK,IAAUD,EAAK,UAAU,WAAW,IACpCE,IAAex5B,EAAmBu5B,CAAO,GACzCE,IAAiBz5B,EAAmBk5B,EAAO,iBAAiB,SAAS;AAE3E,MAAI,CAAC/3B,EAAgBq4B,GAAcC,CAAc;AAC/C,UAAM,IAAI,MAAM,2DAA2D;AAG7E,QAAMC,IAAaJ,EAAK,KAAK,UAAU,IACjCK,IAAkB35B,EAAmB05B,CAAU,GAC/CE,IAAoB55B;AAAA,IACxBk5B,EAAO,iBAAiB,cAAc;AAAA,EAAA;AAGxC,MAAI,CAAC/3B,EAAgBw4B,GAAiBC,CAAiB;AACrD,UAAM,IAAI,MAAM,wDAAwD;AAE5E;ACzFA,eAAsBC,GACpBnE,GACAwD,GACe;AACf,QAAMY,IAAYpE;AAElB,UAAQoE,EAAU,YAAA;AAAA,IAChB,KAAK;AACH,aAAOC,GAAkBD,GAAWZ,CAAM;AAAA,IAC5C,KAAK;AACH,aAAOc,GAAkBF,GAAWZ,CAAM;AAAA,IAC5C;AACE,YAAM,IAAI;AAAA,QACR,6BAA6BY,EAAU,UAAU;AAAA,MAAA;AAAA,EACnD;AAEN;AAEA,eAAeC,GACbrE,GACAwD,GACe;AACf,MAAI,CAACA,EAAO;AACV,UAAM,IAAI,MAAM,4CAA4C;AAG9D,MAAI,CAACxD,EAAM,KAAK,cAAcA,EAAM,KAAK,WAAW,WAAW;AAC7D,UAAM,IAAI,MAAM,4CAA4C;AAG9D,QAAM6D,IAAU7D,EAAM,KAAK,WAAW,CAAC,EAAE,WACnC8D,IAAex5B,EAAmBu5B,CAAO;AAE/C,MAAIL,EAAO,aAAa,WAAW,WAAW;AAC5C,UAAM,IAAI,MAAM,yCAAyC;AAG3D,QAAMO,IAAiBz5B,EAAmBk5B,EAAO,aAAa,WAAW,CAAC,EAAE,GAAG;AAE/E,MAAI,CAAC/3B,EAAgBq4B,GAAcC,CAAc;AAC/C,UAAM,IAAI,MAAM,uDAAuD;AAGzE,MAAI,CAAC/D,EAAM,KAAK,aAAa,SAAS,CAACA,EAAM,KAAK,aAAa;AAC7D,UAAM,IAAI,MAAM,6CAA6C;AAG/D,QAAMxI,IAAUQ,GAAiBgI,EAAM,KAAK,YAAY,SAAS,GAC3DuE,IAAgBz5B,GAAgBk1B,EAAM,KAAK,YAAY,KAAK,GAE5DwE,IAAel6B,EAAmBk5B,EAAO,aAAa,OAAO,GAC7DiB,IAAkB,IAAI;AAAA,IAC1B,MAAM,OAAO,OAAO,OAAOjN,GAASgN,CAAuC;AAAA,EAAA;AAG7E,MAAI,CAAC/4B,EAAgB84B,GAAeE,CAAe;AACjD,UAAM,IAAI,MAAM,0DAA0D;AAE9E;AAGA,eAAeH,GACbtE,GACAwD,GACe;AACf,MAAI,CAACA,EAAO;AACV,UAAM,IAAI,MAAM,mDAAmD;AAGrE,QAAMI,IAAQ5D,EAAM,KAAa;AACjC,MAAI,CAAC4D;AACH,UAAM,IAAI,MAAM,yCAAyC;AAG3D,MAAI,CAACA,EAAK,cAAcA,EAAK,WAAW,WAAW;AACjD,UAAM,IAAI,MAAM,mDAAmD;AAGrE,QAAMC,IAAUD,EAAK,WAAW,CAAC,EAAE,SAC7BE,IAAex5B,EAAmBu5B,CAAO;AAE/C,MAAIL,EAAO,aAAa,WAAW,WAAW;AAC5C,UAAM,IAAI,MAAM,yCAAyC;AAG3D,QAAMO,IAAiBz5B,EAAmBk5B,EAAO,aAAa,WAAW,CAAC,EAAE,GAAG;AAE/E,MAAI,CAAC/3B,EAAgBq4B,GAAcC,CAAc;AAC/C,UAAM,IAAI,MAAM,gEAAgE;AAGlF,MAAI,CAACH,EAAK,aAAa,UAAU,CAACA,EAAK,aAAa;AAClD,UAAM,IAAI,MAAM,oDAAoD;AAGtE,QAAMpM,IAAUQ,GAAiB4L,EAAK,YAAY,SAAS,GACrDW,IAAgBj6B,EAAmBs5B,EAAK,YAAY,MAAM,GAE1DY,IAAel6B,EAAmBk5B,EAAO,aAAa,OAAO,GAC7DiB,IAAkB,IAAI;AAAA,IAC1B,MAAM,OAAO,OAAO,OAAOjN,GAASgN,CAAuC;AAAA,EAAA;AAG7E,MAAI,CAAC/4B,EAAgB84B,GAAeE,CAAe;AACjD,UAAM,IAAI,MAAM,mEAAmE;AAEvF;AClGA,eAAsBC,GACpB1E,GACAwD,GACe;AACf,QAAMmB,IAAc3E;AAEpB,MAAI2E,EAAY,eAAe;AAC7B,UAAM,IAAI;AAAA,MACR,+BAA+BA,EAAY,UAAU;AAAA,IAAA;AAIzD,MAAI,CAACnB,EAAO;AACV,UAAM,IAAI,MAAM,8CAA8C;AAGhE,QAAMoB,IAAeD,EAAY,KAAK,QAAQ;AAE9C,MAAI,CAACC,EAAa,cAAcA,EAAa,WAAW,WAAW;AACjE,UAAM,IAAI,MAAM,8CAA8C;AAOhE,QAAMC,IAAgBD,EAAa,WAAW,CAAC,EAAE,KAC3CE,IAAiBt5B,GAAaq5B,CAAa,GAC3Cf,IAAex5B,EAAmBw6B,CAAc;AAEtD,MAAItB,EAAO,aAAa,WAAW,WAAW;AAC5C,UAAM,IAAI,MAAM,yCAAyC;AAG3D,QAAMO,IAAiBz5B,EAAmBk5B,EAAO,aAAa,WAAW,CAAC,EAAE,GAAG;AAE/E,MAAI,CAAC/3B,EAAgBq4B,GAAcC,CAAc;AAC/C,UAAM,IAAI,MAAM,yDAAyD;AAG3E,MAAIY,EAAY,KAAK,QAAQ,aAAa;AACxC,QAAI,CAACA,EAAY,KAAK,QAAQ,YAAY;AACxC,YAAM,IAAI,MAAM,4CAA4C;AAG9D,UAAMnN,IAAUQ,GAAiB2M,EAAY,KAAK,QAAQ,YAAY,SAAS,GACzEJ,IAAgBz5B,GAAgB65B,EAAY,KAAK,QAAQ,YAAY,KAAK,GAE1EH,IAAel6B,EAAmBk5B,EAAO,aAAa,OAAO,GAC7DiB,IAAkB,IAAI;AAAA,MAC1B,MAAM,OAAO,OAAO,OAAOjN,GAASgN,CAAuC;AAAA,IAAA;AAG7E,QAAI,CAAC/4B,EAAgB84B,GAAeE,CAAe;AACjD,YAAM,IAAI,MAAM,4DAA4D;AAAA,EAEhF;AACF;AClFA,eAAsBM,GACpB/E,GACAwD,GACe;AACf,QAAMwB,IAAaC,GAAmBjF,CAAK,GAErC,EAAE,MAAAkF,GAAM,SAAAxM,EAAA,IAAYsH,EAAM;AAEhC,MAAIkF,MAASF,EAAW,QAAQtM,MAAYsM,EAAW;AACrD,UAAM,IAAI;AAAA,MACR,qCAAqCE,CAAI,IAAIxM,CAAO,eAAesM,EAAW,IAAI,IAAIA,EAAW,UAAU;AAAA,IAAA;AAI/G,UAAQA,EAAW,MAAA;AAAA,IACjB,KAAK;AACH,aAAOzB,GAAuByB,GAAYxB,CAAM;AAAA,IAClD,KAAK;AACH,aAAOW,GAAea,GAAYxB,CAAM;AAAA,IAC1C,KAAK;AACH,aAAOkB,GAAiBM,GAAYxB,CAAM;AAAA,IAC5C;AACE,YAAM,IAAI,MAAM,gCAAgCwB,EAAW,IAAI,EAAE;AAAA,EAAA;AAEvE;AAEA,SAASC,GAAmBjF,GAA8B;AACxD,MAAI;AACF,UAAMmF,IAAc35B,GAAaw0B,EAAM,iBAAiB,GAClDgF,IAAa,KAAK,MAAMG,CAAW;AAEzC,QAAI,CAACH,EAAW,cAAc,CAACA,EAAW,QAAQ,CAACA,EAAW;AAC5D,YAAM,IAAI,MAAM,+BAA+B;AAGjD,WAAOA;AAAA,EACT,SAASI,GAAO;AACd,UAAM,IAAI;AAAA,MACR,uCAAuCA,aAAiB,QAAQA,EAAM,UAAU,OAAOA,CAAK,CAAC;AAAA,IAAA;AAAA,EAEjG;AACF;ACjDO,MAAMC,WAA0C,MAAM;AAAC;ACKvD,MAAMC,GAAQ;AAAA,EACZ;AAAA,EAEP,YAAYnM,GAAe;AACzB,SAAK,OAAOA;AAAA,EACd;AAAA,EAEA,IAAI,UAAkB;AACpB,WAAO,KAAK,KAAK,KAAK,CAAC,EAAE,UAAA;AAAA,EAC3B;AAAA,EAEA,IAAI,UAAgB;AAClB,WAAO,KAAK,KAAK,KAAK,CAAC,EAAE,OAAA;AAAA,EAC3B;AAAA,EAEA,IAAI,8BAAsC;AACxC,UAAMrsB,IAAM,KAAK,kBAAkB,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,MAAA,GAC7Cy4B,IAAOlN,GAAgBvrB,CAAG;AAChC,QAAI,CAACy4B;AACH,YAAM,IAAI,MAAM,+CAA+Cz4B,CAAG,EAAE;AAEtE,WAAOy4B;AAAA,EACT;AAAA,EAEA,IAAI,8BAA0C;AAC5C,WAAO,KAAK,kBAAkB,KAAK,CAAC,EAAE;AAAA,EACxC;AAAA,EAEA,IAAI,MAAkB;AACpB,WAAO,KAAK,KAAK,MAAA;AAAA,EACnB;AAAA,EAEA,MAAa,OAAOt6B,GAAiC;AACnD,UAAMusB,IAAU,KAAK,6BAGfgO,IAAchO,MAAY,WAAW1nB,EAAe,SACvC0nB,MAAY,WAAW1nB,EAAe,SACtC0nB,MAAY,WAAW1nB,EAAe,SAAS0nB,GAE5DG,IAAS,MAAM,OAAO,OAAO;AAAA,MACjC6N;AAAA,MACAv6B;AAAA,IAAA;AAEF,QACE,CAACQ,EAAgB,IAAI,WAAWksB,CAAM,GAAG,KAAK,2BAA2B;AAEzE,YAAM,IAAI0N;AAAA,QACR;AAAA,MAAA;AAAA,EAGN;AAAA;AAAA,EAGA,IAAY,oBAA6B;AACvC,WAAO,KAAK,KAAK,KAAK,CAAC;AAAA,EACzB;AACF;ACxDA,MAAMI,KAAqC,wBACrCC,KAAiC,6BACjCC,KAA+B;AAE9B,MAAMC,GAAiB;AAAA,EACrB;AAAA,EAEP,YAAYzM,GAAe;AACzB,SAAK,OAAOA;AAAA,EACd;AAAA,EAEA,OAAc,MAAMrqB,GAAmC;AACrD,UAAMqqB,IAAOjrB,GAAQ,YAAYY,CAAG;AACpC,WAAO,IAAI82B,GAAiBzM,CAAI;AAAA,EAClC;AAAA,EAEA,IAAI,SAAiB;AACnB,WAAO,KAAK,iBAAiB,KAAK,CAAC,EAAE,UAAA;AAAA,EACvC;AAAA,EAEA,IAAI,cAAsB;AACxB,WAAO,KAAK,eAAe,MAAA;AAAA,EAC7B;AAAA,EAEA,IAAI,eAAuB;AACzB,WAAO,KAAK,gBAAgB,MAAA;AAAA,EAC9B;AAAA,EAEA,IAAI,cAAoB;AACtB,WAAO,KAAK,QAAQ;AAAA,EACtB;AAAA,EAEA,IAAI,eAA2B;AAC7B,WAAO,KAAK,aAAa,KAAK,CAAC,EAAE;AAAA,EACnC;AAAA,EAEA,IAAI,qBAAiC;AACnC,WAAO,KAAK,aAAa,KAAK,CAAC,EAAE;AAAA,EACnC;AAAA,EAEA,IAAI,wBAAgC;AAClC,UAAMrsB,IAAM,KAAK,yBAAyB,KAAK,CAAC,EAAE,MAAA,GAC5Cy4B,IAAOlN,GAAgBvrB,CAAG;AAChC,QAAI,CAACy4B;AACH,YAAM,IAAI,MAAM,iCAAiCz4B,CAAG,EAAE;AAExD,WAAOy4B;AAAA,EACT;AAAA,EAEA,IAAI,qBAA6B;AAC/B,UAAMz4B,IAAM,KAAK,sBAAsB,KAAK,CAAC,EAAE,MAAA;AAE/C,WADaorB,GAAsBprB,CAAG,KAAKqrB,GAAoBrrB,CAAG;AAAA,EAEpE;AAAA,EAEA,IAAI,iBAA6B;AAC/B,WAAO,KAAK,kBAAkB;AAAA,EAChC;AAAA,EAEA,IAAI,UAAmB;AAErB,WAAO,IAAIw4B,GAAQ,KAAK,YAAY,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;AAAA,EACrD;AAAA,EAEA,MAAa,OAAOr6B,GAAkBkmB,GAAqC;AACzE,QAAI,CAAC,KAAK;AACR,YAAM,IAAIkU,GAAkC,2BAA2B;AAIzE,QAAI,KAAK,gBAAgBI;AACvB,YAAM,IAAIJ;AAAA,QACR,2BAA2B,KAAK,WAAW;AAAA,MAAA;AAK/C,QAAI,KAAK,iBAAiBK;AACxB,YAAM,IAAIL;AAAA,QACR,wCAAwC,KAAK,YAAY;AAAA,MAAA;AAK7D,UAAM,KAAK,QAAQ,OAAOp6B,CAAI,GAE9B,MAAM,KAAK,oBAAA,GAEX,MAAM,KAAK,gBAAgBkmB,CAAS;AAAA,EACtC;AAAA,EAEA,MAAc,sBAAqC;AAEjD,UAAMqG,IAAU,KAAK,uBAGfgO,IAAchO,MAAY,WAAW1nB,EAAe,SACvC0nB,MAAY,WAAW1nB,EAAe,SACtC0nB,MAAY,WAAW1nB,EAAe,SAAS0nB,GAE5DqO,IAAgB,MAAM,OAAO,OAAO;AAAA,MACxCL;AAAA,MACA,KAAK,QAAQ;AAAA,IAAA,GAETM,IAAiB,KAAK,0BAA0B,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE;AAEtE,QAAI,CAACr6B,EAAgB,IAAI,WAAWo6B,CAAa,GAAGC,CAAc;AAChE,YAAM,IAAIT;AAAA,QACR;AAAA,MAAA;AAAA,EAGN;AAAA,EAEA,MAAc,gBAAgBpqB,GAA+B;AAE3D,UAAM8qB,IAAc,KAAK,eAAe,MAAA;AACxC,IAAAA,EAAY,CAAC,IAAI;AAEjB,UAAMj5B,IAAM,KAAK,sBAAsB,KAAK,CAAC,EAAE,MAAA,GAEzCy4B,IAAOrN,GAAsBprB,CAAG,KAAKqrB,GAAoBrrB,CAAG;AAElE,QAAI,CAACy4B;AACH,YAAM,IAAIF;AAAA,QACR,wCAAwCv4B,CAAG;AAAA,MAAA;AAY/C,QAAI,CAPa,MAAMiqB;AAAA,MACrB9b;AAAA,MACA8qB;AAAA,MACA,KAAK;AAAA,MACLR;AAAA,IAAA;AAIA,YAAM,IAAIF;AAAA,QACR;AAAA,MAAA;AAAA,EAGN;AAAA;AAAA,EAGA,IAAY,mBAA4B;AAEtC,WAAO,KAAK,KAAK,KAAK,CAAC;AAAA,EACzB;AAAA;AAAA,EAGA,IAAY,oBAA6B;AAEvC,WAAO,KAAK,KAAK,KAAK,CAAC;AAAA,EACzB;AAAA;AAAA,EAGA,IAAY,iBAA0B;AACpC,WAAO,KAAK,kBAAkB,KAAK,CAAC;AAAA,EACtC;AAAA;AAAA,EAEA,IAAY,gBAAyB;AACnC,UAAM72B,IAAM,KAAK,kBAAkB,KAAK;AAAA,MAAK,CAACD,MAC5CA,EAAI,IAAI,kBAAkB,CAAI;AAAA,IAAA;AAEhC,QAAI,CAACC;AACH,YAAM,IAAI62B;AAAA,QACR;AAAA,MAAA;AAGJ,WAAO72B,EAAI,KAAK,CAAC;AAAA,EACnB;AAAA;AAAA,EAGA,IAAY,sBAA+B;AACzC,WAAO,KAAK,cAAc,KAAK,CAAC;AAAA,EAClC;AAAA;AAAA,EAGA,IAAY,iBAA0B;AAEpC,UAAMw3B,IAAK,KAAK;AAChB,WAAOA,EAAG,KAAKA,EAAG,KAAK,SAAS,CAAC;AAAA,EACnC;AAAA;AAAA,EAGA,IAAY,gBAAyB;AAEnC,WAAO,KAAK,eAAe,KAAK,CAAC;AAAA,EACnC;AAAA;AAAA,EAGA,IAAY,kBAA2B;AACrC,WAAO,KAAK,oBAAoB,KAAK,CAAC;AAAA,EACxC;AAAA;AAAA,EAGA,IAAY,cAAuB;AACjC,WAAO,KAAK,oBAAoB,KAAK,CAAC;AAAA,EACxC;AAAA;AAAA,EAGA,IAAY,iBAA0B;AACpC,UAAMD,IAAc,KAAK,cAAc,KAAK;AAAA,MAAK,CAACx3B,MAChDA,EAAI,IAAI,kBAAkB,CAAI;AAAA,IAAA;AAEhC,QAAI,CAACw3B;AACH,YAAM,IAAIV,GAAkC,yBAAyB;AAEvE,WAAOU;AAAA,EACT;AAAA;AAAA,EAGA,IAAY,4BAAqC;AAC/C,UAAME,IAAgB,KAAK,eAAe,KAAK;AAAA,MAC7C,CAAC13B,MACCA,EAAI,KAAK,CAAC,EAAE,IAAI,MAAA,KAChBA,EAAI,KAAK,CAAC,EAAE,YAAYo3B;AAAA,IAAA;AAE5B,QAAI,CAACM;AACH,YAAM,IAAIZ,GAAkC,wBAAwB;AAEtE,WAAOY;AAAA,EACT;AAAA;AAAA,EAGA,IAAY,eAAwB;AAClC,WAAO,KAAK,cAAc,KAAK,CAAC;AAAA,EAClC;AAAA;AAAA,EAGA,IAAY,2BAAoC;AAE9C,WAAO,KAAK,cAAc,KAAK,CAAC;AAAA,EAClC;AAAA;AAAA,EAGA,IAAY,wBAAiC;AAE3C,WAAO,KAAK,cAAc,KAAK,CAAC;AAAA,EAClC;AAAA;AAAA,EAGA,IAAY,oBAA6B;AAEvC,WAAO,KAAK,cAAc,KAAK,CAAC;AAAA,EAClC;AACF;AC9OA,eAAsBC,GACpBtN,GACA3tB,GACAk7B,GACe;AACf,QAAMC,IAAcxN,EAAU;AAG9B,MAAIyN,IAAmBC;AAAA,IACrBH;AAAA,IACAC;AAAA,EAAA;AAIF,EAAAC,IAAmBE,GAA2BF,GAAkB;AAAA,IAC9D,cAAczN,EAAU;AAAA,IACxB,QAAQA,EAAU;AAAA,EAAA,CACnB;AAGD,QAAM4N,IAAsB,MAAM,QAAQ;AAAA,IACxCH,EAAiB,IAAI,CAAApI,MAAMwI,GAAqB7N,GAAW3tB,GAAMgzB,CAAE,CAAC;AAAA,EAAA;AAOtE,MAAI,CAJauI,EAAoB;AAAA,IACnC,CAAA56B,MAAUA,EAAO,WAAW;AAAA,EAAA,GAGf;AACb,UAAM86B,IAASF,EACZ,OAAO,CAAA1mB,MAAKA,EAAE,WAAW,UAAU,EACnC,IAAI,CAAAA,MAAMA,EAA4B,QAAQ,WAAW,eAAe;AAC3E,UAAM,IAAI,MAAM,0EAA0E4mB,EAAO,KAAK,IAAI,CAAC,EAAE;AAAA,EAC/G;AAEA,SAAON;AACT;AAOA,SAASE,GACPK,GACAC,GACyB;AACzB,SAAOD,EAAY,OAAO,CAAA1I,MAAM;AAC9B,QAAIA,EAAG,UAAU;AACf,YAAM/wB,IAAQ+wB,EAAG,SAAS,QAAQ,IAAI,KAAKA,EAAG,SAAS,KAAK,IAAI,MAC1DhyB,IAAMgyB,EAAG,SAAS,MAAM,IAAI,KAAKA,EAAG,SAAS,GAAG,IAAI;AAK1D,UAHI/wB,KAAS05B,IAAU15B,KAGnBjB,KAAO26B,IAAU36B;AACnB,eAAO;AAAA,IAEX;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAQA,SAASs6B,GACPJ,GACAU,GACyB;AACzB,SAAOV,EAAqB,OAAO,CAAAlI,MAAM;AACvC,QAAI,CAACA,EAAG,aAAaA,EAAG,UAAU,aAAa,WAAW;AACxD,aAAO;AAGT,UAAMU,IAAWrB,EAAgB;AAAA,MAC/BhzB,EAAmB2zB,EAAG,UAAU,aAAa,CAAC,EAAE,QAAQ;AAAA,IAAA;AAG1D,WAAOxyB,EAAgBkzB,EAAS,cAAckI,EAAS,YAAY,KAC5Dp7B,EAAgBkzB,EAAS,QAAQkI,EAAS,MAAM;AAAA,EACzD,CAAC;AACH;AAKA,eAAeJ,GACb7N,GACA3tB,GACAgzB,GACe;AACf,MAAI,CAACA,EAAG,aAAaA,EAAG,UAAU,aAAa,WAAW;AACxD,UAAM,IAAI,MAAM,iDAAiD;AAGnE,QAAMU,IAAWrB,EAAgB;AAAA,IAC/BhzB,EAAmB2zB,EAAG,UAAU,aAAa,CAAC,EAAE,QAAQ;AAAA,EAAA,GAEpDmI,IAAcxN,EAAU,aAExBkO,IAAe7I,EAAG,UAAU,aAC/B,MAAM,CAAC,EACP,IAAI,CAAAV,MAAQD,EAAgB,MAAMhzB,EAAmBizB,EAAK,QAAQ,CAAC,CAAC;AAEvE,MAAI;AAMF,UALiB,IAAIiB,GAAyB;AAAA,MAC5C,eAAeG;AAAA,MACf,cAAAmI;AAAA,MACA,WAAWV;AAAA,IAAA,CACZ,EACc,OAAA;AAAA,EACjB,SAASzpB,GAAG;AACV,UAAM,IAAI,MAAM,8CAA8CA,aAAa,QAAQA,EAAE,UAAU,OAAOA,CAAC,CAAC,EAAE;AAAA,EAC5G;AAEA,QAAMwU,IAAY,MAAMwN,EAAS;AAEjC,QAAM/F,EAAU,OAAO3tB,GAAMkmB,CAAS;AACxC;AAcA,eAAsB4V,GACpBC,GACArS,GACAwR,GACiB;AACjB,MAAI,CAACa,GAAe,mBAAmB;AACrC,WAAO,CAAA;AAMT,QAAMC,IAA4E,CAAA;AAElF,aAAWC,KAAUF,EAAc,mBAAmB;AAEpD,UAAMG,IAAiB78B,EAAmB48B,EAAO,eAAe,GAC1DtO,IAAYgN,GAAiB,MAAMuB,CAAc,GAEjDf,IAAc,MAAMF;AAAA,MACxBtN;AAAA,MACAjE;AAAA,MACAwR;AAAA,IAAA;AAGF,IAAAc,EAAgB,KAAK;AAAA,MACnB,aAAAb;AAAA,MACA,oBAAoB,MAAM,KAAKxN,EAAU,kBAAkB,EAAE,KAAK,GAAG;AAAA,IAAA,CACtE;AAAA,EACH;AAIA,WAAS1uB,IAAI,GAAGA,IAAI+8B,EAAgB,QAAQ/8B;AAC1C,aAASoD,IAAIpD,IAAI,GAAGoD,IAAI25B,EAAgB,QAAQ35B;AAC9C,UACE25B,EAAgB/8B,CAAC,EAAE,YAAY,cAAc+8B,EAAgB35B,CAAC,EAAE,YAAY,QAAA,KAC5E25B,EAAgB/8B,CAAC,EAAE,uBAAuB+8B,EAAgB35B,CAAC,EAAE;AAE7D,cAAM,IAAI,MAAM,kCAAkC;AAKxD,SAAO25B,EAAgB,IAAI,CAAA,MAAK,EAAE,WAAW;AAC/C;ACzJA,MAAMG,KAAiB;AAAA,EACrB,aAAa;AAAA,EACb,eAAe;AAAA,EACf,WAAW;AAAA,EACX,mBAAmB;AAAA,EACnB,UAAU;AAAA;AACZ;AAcO,MAAMC,GAAoB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EAER,YAAYpQ,IAAsC,IAAI;AACpD,UAAMqQ,IAAcrQ,EAAQ,eAAemQ,GAAe;AAC1D,SAAK,cAAcE,EAAY,SAAS,GAAG,IAAIA,IAAc,GAAGA,CAAW;AAC3E,UAAMC,IAAgBtQ,EAAQ,iBAAiBmQ,GAAe;AAC9D,SAAK,gBAAgBG,EAAc,SAAS,GAAG,IAAIA,IAAgB,GAAGA,CAAa,KACnF,KAAK,cAActQ,EAAQ,aAC3B,KAAK,YAAYA,EAAQ,aAAamQ,GAAe,WACrD,KAAK,oBAAoBnQ,EAAQ,qBAAqBmQ,GAAe,mBACrE,KAAK,WAAWnQ,EAAQ,YAAYmQ,GAAe;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,gBAA+B;AAC3C,QAAI,MAAK;AAIT,UAAI;AACF,cAAM,EAAE,WAAAI,EAAA,IAAc,MAAM,OAAO,mBAA6B,GAG1DC,IAAe,KAAK,eAAe,MAAM,KAAK,eAAA;AAEpD,aAAK,YAAY,IAAID;AAAA,UACnB,KAAK;AAAA,UACLC;AAAA,UACA,KAAK;AAAA,UACL,KAAK;AAAA,QAAA;AAAA,MAET,SAASrC,GAAO;AACd,cAAM,IAAI;AAAA,UACR,oCAAoCA,aAAiB,QAAQA,EAAM,UAAU,OAAOA,CAAK,CAAC;AAAA,QAAA;AAAA,MAE9F;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,iBAAkC;AAI9C,UAAMsC,KADgB,MAAM,OAAO,wBAA6C,GAC5C,SAG9BC,IAAU,IAAI,YAAA,GACdC,IAAY,WAAW,KAAK,KAAKF,CAAa,GAAG,CAAAl0B,MAAKA,EAAE,WAAW,CAAC,CAAC;AAC3E,WAAOm0B,EAAQ,OAAOC,CAAS;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAwB;AAC9B,WAAI,CAAC,KAAK,cAAc,CAAC,KAAK,iBACrB,KAGG,KAAK,IAAA,IACH,KAAK,iBAAkB,KAAK;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,iBAAuC;AAE3C,QAAI,KAAK,kBAAkB,KAAK;AAC9B,aAAO,KAAK;AAMd,QAFA,MAAM,KAAK,cAAA,GAEP,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,4BAA4B;AAG9C,QAAI;AAGF,YAAM,KAAK,UAAU,UAAA;AAIrB,YAAMC,IAAoB,MAAM,KAAK,UAAU,UAAU,KAAK,iBAAiB,GAGzEC,IAAkBz8B,EAAmB,IAAI,WAAWw8B,CAAiB,CAAC,GACtEE,IAAc,KAAK,MAAMD,CAAe;AAG9C,kBAAK,aAAaC,GAClB,KAAK,iBAAiB,KAAK,IAAA,GAEpBA;AAAA,IACT,SAAS3C,GAAO;AACd,YAAM,IAAI;AAAA,QACR,yCAAyCA,aAAiB,QAAQA,EAAM,UAAU,OAAOA,CAAK,CAAC;AAAA,MAAA;AAAA,IAEnG;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,qBAA2C;AAE/C,gBAAK,aAAa,QAClB,KAAK,iBAAiB,QAGf,MAAM,KAAK,eAAA;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAmB;AACjB,SAAK,aAAa,QAClB,KAAK,iBAAiB;AAAA,EACxB;AACF;AC1LA,MAAM4C,KAAkB;AAMxB,SAASC,GAAiBC,GAA2B;AACnD,UAAQA,GAAA;AAAA,IACN,KAAK,GAAGF,EAAe;AACrB,aAAO;AAAA,IACT,KAAK,GAAGA,EAAe;AACrB,aAAO;AAAA,IACT,KAAK,GAAGA,EAAe;AACrB,aAAO;AAAA,EAAA;AAIX,MAAIE,EAAU,WAAW,GAAGF,EAAe,IAAI,KAAKE,EAAU,SAAS,OAAO,GAAG;AAC/E,UAAMxP,IAAUwP,EACb,QAAQ,GAAGF,EAAe,MAAM,EAAE,EAClC,QAAQ,SAAS,EAAE;AAEtB,QAAI,qBAAqB,KAAKtP,CAAO;AACnC,aAAOA;AAAA,EAEX;AAGA,SAAO;AACT;AAQO,MAAMyP,GAAiB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EAER,YAAYlR,IAAmC,IAAI;AACjD,SAAK,OAAO,QACZ,KAAK,UAAU,QACf,KAAK,UAAU;AAAA,MACb,eAAeA,EAAQ,iBAAiB;AAAA,MACxC,gBAAgBA,EAAQ,kBAAkB;AAAA,MAC1C,cAAcA,EAAQ,gBAAgB;AAAA,IAAA;AAAA,EAE1C;AAAA,EAEA,MAAM,QAAQmR,GAAuBC,GAAkD;AAKrF,eAAWC,KAAOD;AAEhB,UACED,IAAkB,IAAI,KAAKE,EAAI,UAAU,SAAS,KAAK,MACtD,CAACA,EAAI,UAAU,SAAS,OACvB,IAAI,KAAKA,EAAI,UAAU,SAAS,GAAG,IAAIF;AAEzC,eAAO;AAAA,UACL,WAAW,MAAM5R;AAAA,YACf8R,EAAI,UAAU;AAAA,YACdA,EAAI,UAAU;AAAA,YACdA,EAAI,UAAU;AAAA,UAAA;AAAA,UAEhB,OAAOh+B,EAAmBg+B,EAAI,MAAM,KAAK;AAAA,QAAA;AAAA,EAQjD;AAAA,EAEA,MAAM,WAAWF,GAAuBG,GAAmC;AACzE,UAAM38B,IAAkB,CAAA;AAExB,eAAW08B,KAAOC,GAAQ;AACxB,YAAMr7B,IAAQ,IAAI,KAAKo7B,EAAI,UAAU,SAAS,KAAK,GAC7Cr8B,IAAMq8B,EAAI,UAAU,SAAS,MAC/B,IAAI,KAAKA,EAAI,UAAU,SAAS,GAAG,IACnC,oBAAI,KAAK,YAAY;AAIzB,UAAIp7B,KAASk7B,GAAiB;AAC5B,cAAMjX,IAAY,MAAMqF;AAAA,UACtB8R,EAAI,UAAU;AAAA,UACdA,EAAI,UAAU;AAAA,UACdA,EAAI,UAAU;AAAA,QAAA;AAGhB,QAAA18B,EAAO,KAAK;AAAA,UACV,OAAOtB,EAAmBg+B,EAAI,MAAM,KAAK;AAAA,UACzC,WAAAnX;AAAA,UACA,UAAU,EAAE,OAAAjkB,GAAO,KAAAjB,EAAA;AAAA,QAAI,CACxB;AAAA,MACH;AAAA,IACF;AAEA,QAAIL,EAAO,WAAW;AACpB,YAAM,IAAI,MAAM,oDAAoD;AAGtE,WAAOA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,uBACJgtB,GACAwI,GACAoH,GAC4B;AAC5B,QAAIC;AAEJ,eAAWxK,KAAMuK;AAEf,UAAI,EAAA5P,IAAYqF,EAAG,SAAS,SAASrF,IAAYqF,EAAG,SAAS;AAI7D,YAAI;AAMF,iBAAO,MALU,IAAIO,GAAyB;AAAA,YAC5C,cAAcP,EAAG;AAAA,YACjB,eAAemD;AAAA,YACf,WAAAxI;AAAA,UAAA,CACD,EACqB,OAAA;AAAA,QACxB,SAASzL,GAAK;AACZ,UAAAsb,IAAYtb;AAAA,QACd;AAGF,UAAM,IAAI,MAAM,uCAAuCsb,GAAW,WAAW,oBAAoB,EAAE;AAAA,EACrG;AAAA;AAAA;AAAA;AAAA,EAKA,QACEL,GACAM,GACiB;AACjB,QAAI,CAACA,KAAQA,EAAK,WAAW;AAC3B,aAAO,CAAA;AAGT,UAAM98B,IAA0B,CAAA;AAEhC,eAAW+8B,KAAOD,GAAM;AACtB,YAAMx7B,IAAQ,IAAI,KAAKy7B,EAAI,SAAS,KAAK,GACnC18B,IAAM08B,EAAI,SAAS,MAAM,IAAI,KAAKA,EAAI,SAAS,GAAG,IAAI,oBAAI,KAAK,MAAgB;AAErF,UAAIP,IAAkBl7B,KAASk7B,IAAkBn8B,GAAK;AACpD,cAAM28B,IAAYD,EAAI,UAAU,aAAa;AAAA,UAAI,OAC/CrL,EAAgB,MAAMhzB,EAAmBizB,EAAK,QAAQ,CAAC;AAAA,QAAA;AAGzD,QAAIqL,EAAU,SAAS,KACrBh9B,EAAO,KAAK;AAAA,UACV,WAAAg9B;AAAA,UACA,UAAU,EAAE,OAAA17B,GAAO,KAAAjB,EAAA;AAAA,QAAI,CACxB;AAAA,MAEL;AAAA,IACF;AAEA,WAAOL;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAOw8B,GAAuBS,GAA8B;AAC1D,UAAMj9B,IAA0B,CAAA;AAEhC,eAAWqyB,KAAM4K,GAAK;AACpB,YAAM37B,IAAQ,IAAI,KAAK+wB,EAAG,SAAS,KAAK,GAClChyB,IAAMgyB,EAAG,SAAS,MAAM,IAAI,KAAKA,EAAG,SAAS,GAAG,IAAI,oBAAI,KAAK,MAAgB;AAEnF,UAAImK,IAAkBl7B,KAASk7B,IAAkBn8B,GAAK;AACpD,cAAM28B,IAAY3K,EAAG,UAAU,aAAa;AAAA,UAAI,OAC9CX,EAAgB,MAAMhzB,EAAmBizB,EAAK,QAAQ,CAAC;AAAA,QAAA;AAGzD,QAAIqL,EAAU,SAAS,KACrBh9B,EAAO,KAAK;AAAA,UACV,WAAAg9B;AAAA,UACA,UAAU,EAAE,OAAA17B,GAAO,KAAAjB,EAAA;AAAA,QAAI,CACxB;AAAA,MAEL;AAAA,IACF;AAEA,WAAOL;AAAA,EACT;AAAA,EAEA,MAAM,iBAAiBk9B,GAAsB;AAC3C,UAAMV,wBAAsB,KAAA;AAE5B,SAAK,UAAUU,GACf,KAAK,OAAO;AAAA,MACV,OAAO,MAAM,KAAK,QAAQV,GAAiBU,EAAQhR,GAAc,KAAK,CAAC;AAAA,MACvE,QAAQ,MAAM,KAAK,WAAWsQ,GAAiBU,EAAQhR,GAAc,MAAM,CAAC;AAAA,MAC5E,wBAAwB,KAAK;AAAA,QAC3BsQ;AAAA,QACAU,EAAQhR,GAAc,sBAAsB;AAAA,MAAA;AAAA,MAE9C,sBAAsB,KAAK,QAAQsQ,GAAiBU,EAAQ,oBAAoB;AAAA,IAAA;AAAA,EAEpF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,wBAAwBC,GAAkD;AAE9E,UAAMhB,IAAc,OADHgB,KAAe,IAAI1B,GAAA,GACD,eAAA;AACnC,UAAM,KAAK,iBAAiBU,CAAW;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,UACJxK,GACAyB,GACAuJ,GACuB;AACvB,QAAIS;AAOJ,UAAMzK,IAAQhB,EAAK,MAAA;AAKnB,aAASrzB,IAAI,GAAGA,IAAIq0B,EAAM,WAAW,QAAQr0B,KAAK;AAChD,YAAM8zB,IAAMO,EAAM,WAAWr0B,CAAC;AAE9B,UAAI8zB,EAAI,KAAK,CAAC,EAAE,MAAA,MAAYjC,IAAmB;AAC7C,QAAAiN,IAAS,IAAI1N,GAAiB0C,CAAG,GAGjCO,EAAM,WAAW,OAAOr0B,GAAG,CAAC;AAC5B;AAAA,MACF;AAAA,IACF;AAGA,QAAI,CAAC8+B;AACH,YAAM,IAAI,MAAM,+CAA+C;AAIjE,QAAIA,EAAO,4BAA4B,WAAW;AAChD,YAAM,IAAI,MAAM,+CAA+C;AAIjE,UAAMC,wBAAiB,IAAA;AACvB,eAAWxN,KAAOuN,EAAO,6BAA6B;AACpD,YAAME,IAAWl+B,GAAgBywB,EAAI,KAAK;AAC1C,UAAIwN,EAAW,IAAIC,CAAQ;AACzB,cAAM,IAAI,MAAM,mCAAmCA,CAAQ,EAAE;AAE/D,MAAAD,EAAW,IAAIC,CAAQ;AAAA,IACzB;AAIA,UAAMzQ,IAAU,IAAIjrB,GAAA,GAGd27B,IAAW,IAAI;AAAA,MACnB,MAAM,OAAO,OAAO,OAAOr5B,EAAe,QAAQkvB,EAAO,SAAoC;AAAA,IAAA;AAE/F,IAAAvG,EAAQ,WAAW0Q,CAAQ;AAG3B,UAAMC,IAAM7K,EAAM,eAAe,MAAA;AACjC,IAAA9F,EAAQ,aAAa2Q,EAAI,MAAM,GAC/B3Q,EAAQ,WAAW2Q,CAAG;AAKtB,UAAMC,IAA6B,CAAA;AAEnC,eAAW5N,KAAOuN,EAAO,6BAA6B;AAEpD,YAAMM,IAAcf,EAAO,OAAO,CAACD,MAE5B78B,EAAgB68B,EAAI,OAAO7M,EAAI,KAAK,IAElC6M,EAAI,SAAS,SAAS7M,EAAI,YAAYA,EAAI,YAAY6M,EAAI,SAAS,MAFvB,EAGpD;AAgBD,UAAI,CAba,OAAO,YAAY;AAClC,mBAAWA,KAAOgB;AAChB,cAAI;AACF,gBAAI,MAAM7N,EAAI,OAAOhD,EAAQ,QAAQ6P,EAAI,SAAS;AAChD,qBAAO;AAAA,UAEX,QAAQ;AAAA,UAER;AAEF,eAAO;AAAA,MACT,GAAA;AAGE,cAAM,IAAI,MAAM,yBAAyB;AAG3C,MAAAe,EAAa,KAAK5N,EAAI,KAAK;AAAA,IAC7B;AAEA,WAAO4N;AAAA,EACT;AAAA,EAEA,MAAM,uBACJ9L,GACAiG,GACA+F,GACkB;AAClB,UAAMC,IAAUhG,EAAO,qBAAqB;AAG5C,QAAIgG,EAAQ,SAAS,KAAK,QAAQ;AAChC,YAAM,IAAI;AAAA,QACR,4BAA4BA,EAAQ,MAAM,MAAM,KAAK,QAAQ,aAAa;AAAA,MAAA;AAM9E,UAAMC,IAAmB;AACzB,QAAID,EAAQ,SAASC;AACnB,YAAM,IAAI;AAAA,QACR,0BAA0BD,EAAQ,MAAM,MAAMC,CAAgB;AAAA,MAAA;AAIlE,aAASv/B,IAAI,GAAGA,IAAIs/B,EAAQ,QAAQt/B;AAClC,eAASoD,IAAIpD,IAAI,GAAGoD,IAAIk8B,EAAQ,QAAQl8B,KAAK;AAC3C,cAAMo8B,IAAS1+B,GAAgBV,EAAmBk/B,EAAQt/B,CAAC,EAAE,MAAM,KAAK,CAAC,GACnEy/B,IAAS3+B,GAAgBV,EAAmBk/B,EAAQl8B,CAAC,EAAE,MAAM,KAAK,CAAC;AACzE,YAAIo8B,MAAWC,KAAUH,EAAQt/B,CAAC,EAAE,aAAas/B,EAAQl8B,CAAC,EAAE;AAC1D,gBAAM,IAAI;AAAA,YACR,qCAAqCo8B,CAAM,cAAcF,EAAQt/B,CAAC,EAAE,QAAQ;AAAA,UAAA;AAAA,MAGlF;AAGF,UAAM81B,IAAQwJ,EAAQ,CAAC,GAIjBI,IAAgB3B,GAAiBzE,EAAO,SAAS;AAIvD,QAHqB,WAAWoG,CAAa,KAAK,OAG9B,CAAC5J,EAAM;AACzB,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAKJ,QAAKA,EAAM,kBAAkB;AAY3B,UAAI,GAACuJ,KAASvJ,EAAM,iBAGb;AACL,YAAI,CAACuJ;AACH,gBAAM,IAAI,MAAM,4CAA4C;AAI9D,cAAM/G,IAAal4B,EAAmB01B,EAAM,MAAM,KAAK;AACvD,YAAI,CAACv0B,EAAgB89B,EAAM,OAAO/G,CAAU;AAC1C,gBAAM,IAAI;AAAA,YACR,sCAAsCx3B,GAAgBw3B,CAAU,CAAC,0BAA0Bx3B,GAAgBu+B,EAAM,KAAK,CAAC;AAAA,UAAA;AAI3H,cAAM5U,IAAYrqB;AAAA,UAChB01B,EAAM,iBAAiB;AAAA,QAAA,GAGnB6J,IAAQ7+B,GAAgBw3B,CAAU,GAClCsH,IAAiB,OAAO9J,EAAM,cAAc,GAE5ChJ,IAAS7rB;AAAA,UACbqE,GAAa;AAAA,YACX,MAAMwwB,EAAM;AAAA,YACZ,gBAAA8J;AAAA,YACA,UAAU,OAAO9J,EAAM,QAAQ;AAAA,YAC/B,OAAO6J;AAAA,UAAA,CACR;AAAA,QAAA;AAGH,YAAI,CAAE,MAAM9S,GAAgBwS,EAAM,WAAWvS,GAAQrC,CAAS;AAC5D,gBAAM,IAAI;AAAA,YACR;AAAA,UAAA;AAAA,MAGN;AAAA,eA/CI,CAACqL,EAAM;AACT,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAkDN,QAAIA,EAAM,gBAAgB;AACxB,YAAM8J,IAAiB,OAAO9J,EAAM,cAAc,GAC5C+J,IAAiB,IAAI,KAAKD,IAAiB,GAAI;AAErD,UAAI,CAACvM,EAAK,aAAawM,CAAc;AACnC,cAAM,IAAI;AAAA,UACR;AAAA,QAAA;AAAA,IAGN,WAEM,CAACvG,EAAO,qBAAqB;AAC/B,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAON,UAAMwG,IAAW,KAAK,MAAM3+B,EAAmBf,EAAmB01B,EAAM,iBAAiB,CAAC,CAAC;AAE3F,QAAIgK,EAAS,SAAS,gBAAgB;AACpC,UAAIC;AAGJ,UAAID,EAAS,KAAK,kBAAkB;AAClC,cAAME,IAAWF,EAAS,KAAK,iBAAiB,UAAU;AAC1D,QAAIE,GAAU,oBACZD,IAAoBC,EAAS,gBAAgB;AAAA,MAEjD,MAAA,CAESF,EAAS,KAAK,WAAW,cAChCC,IAAoBD,EAAS,KAAK,UAAU,UAAU;AAGxD,UAAIC,GAAmB;AAGrB,YAAIE;AACJ,YAAIH,EAAS,KAAK;AAChB,UAAAG,IAAa7M,EAAgB,MAAMhzB,EAAmB2/B,CAAiB,CAAC;AAAA,aACnE;AACL,gBAAMG,IAAY/+B,EAAmBf,EAAmB2/B,CAAiB,CAAC;AAC1E,UAAAE,IAAa7M,EAAgB,MAAM8M,CAAS;AAAA,QAC9C;AAEA,YAAI,CAAC7M,EAAK,OAAO4M,CAAU;AACzB,gBAAM,IAAI;AAAA,YACR;AAAA,UAAA;AAAA,MAGN;AAAA,IACF,WAAWH,EAAS,SAAS,QAAQ;AAGnC,YAAMK,IAAkBL,EAAS,KAAK,aAAa,CAAC,GAAG;AACvD,UAAIK,GAAiB;AACnB,cAAMD,IAAY/+B,EAAmBf,EAAmB+/B,CAAe,CAAC,GAClEF,IAAa7M,EAAgB,MAAM8M,CAAS;AAClD,YAAI,CAAC7M,EAAK,OAAO4M,CAAU;AACzB,gBAAM,IAAI;AAAA,YACR;AAAA,UAAA;AAAA,MAGN;AAAA,IACF,WAAWH,EAAS,SAAS,UAAU;AAGrC,YAAMM,IAAmBN,EAAS,KAAK,SAAS,UAAU,aAAa,CAAC,GAAG;AAC3E,UAAIM,GAAkB;AACpB,cAAMF,IAAY/+B,EAAmBf,EAAmBggC,CAAgB,CAAC,GACnEH,IAAa7M,EAAgB,MAAM8M,CAAS;AAClD,YAAI,CAAC7M,EAAK,OAAO4M,CAAU;AACzB,gBAAM,IAAI;AAAA,YACR;AAAA,UAAA;AAAA,MAGN;AAAA,IACF;AAEE,YAAM,IAAI,MAAM,gCAAgCH,EAAS,IAAI,EAAE;AAGjE,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,qBAAqBxG,GAAuC;AAChE,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,4BAA4B;AAG9C,QAAIA,EAAO,qBAAqB,YAAY,SAAS;AACnD,YAAM,IAAI,MAAM,6CAA6C;AAK/D,eAAWxD,KAASwD,EAAO,qBAAqB;AAG9C,MAAIxD,EAAM,mBACR,MAAMD,GAAsBC,CAAK,GAE7BA,EAAM,eAAe,cACvB,MAAMsC,GAAiBtC,GAAO,KAAK,QAAQ,KAAK;AAAA,EAIxD;AAAA,EAEA,MAAa,eACXuK,GACAvL,GACAwE,GACAv4B,GACAu/B,IAAwB,IACN;AAGlB,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,4BAA4B;AAG9C,UAAMjN,IAAOiG,EAAO,qBAAqB,eACvCA,EAAO,qBAAqB,sBAAsB,aAAa,CAAC;AAElE,QAAI,CAACjG;AACH,YAAM,IAAI,MAAM,gCAAgC;AAGlD,UAAMkN,IAAcnN,EAAgB,MAAMhzB,EAAmBizB,EAAK,QAAQ,CAAC;AAG3E,QAAI5I;AACJ,QAAI6O,EAAO;AACT,MAAA7O,IAAYrqB,EAAmBk5B,EAAO,iBAAiB,SAAS;AAAA,aACvDA,EAAO,cAAc;AAC9B,UAAI,CAACA,EAAO,aAAa,cAAcA,EAAO,aAAa,WAAW,WAAW;AAC/E,cAAM,IAAI,MAAM,iCAAiC;AAEnD,MAAA7O,IAAYrqB,EAAmBk5B,EAAO,aAAa,WAAW,CAAC,EAAE,GAAG;AAAA,IACtE;AACE,YAAM,IAAI,MAAM,8DAA8D;AAIhF,QAAIiH,EAAY,mBAAmBF;AACjC,YAAM,IAAI;AAAA,QACR;AAAA,MAAA;AAMJ,SADmBE,EAAY,mBAAmB,UAAUA,EAAY,mBAAmB,YACxEzL;AACjB,YAAM,IAAI,MAAM,2CAA2C;AAM7D,UAAM0L,IAAW,MAAM,KAAK;AAAA,MAC1BD,EAAY;AAAA,MACZA;AAAA,MACA,KAAK,KAAK;AAAA,IAAA,GAONE,IAAaD,EAAS,SAAS,IAAIA,EAAS,CAAC,IAAIA,EAAS,CAAC,GAC3DrB,IAAe,MAAM,KAAK,UAAUoB,GAAaE,GAAY,KAAK,KAAK,MAAM;AACnF,QAAItB,EAAa,SAAS,KAAK,QAAQ;AACrC,YAAM,IAAI;AAAA,QACR,gCAAgCA,EAAa,MAAM,cAAc,KAAK,QAAQ,cAAc;AAAA,MAAA;AAKhG,QACE,CAAE,MAAM,KAAK,uBAAuBoB,GAAajH,GAAQ,KAAK,KAAK,KAAK;AAExE,YAAM,IAAI,MAAM,sCAAsC;AAIxD,UAAM,KAAK,qBAAqBA,CAAM;AAGtC,eAAWxD,KAASwD,EAAO,qBAAqB;AAC9C,YAAMuB,GAAe/E,GAAOwD,CAAM;AAMpC,UAAMoH,IAAqB,MAAM7D;AAAA,MAC/BvD,EAAO,qBAAqB;AAAA,MAC5B7O;AAAA,MACA,KAAK,SAAS,wBAAwB,CAAA;AAAA,IAAC;AAGzC,QAAIiW,EAAmB,SAAS,KAAK,QAAQ;AAC3C,YAAM,IAAI;AAAA,QACR,uCAAuCA,EAAmB,MAAM,MAAM,KAAK,QAAQ,YAAY;AAAA,MAAA;AAKnG,eAAWC,KAAqBD;AAC9B,UAAI,CAACH,EAAY,aAAaI,CAAiB;AAC7C,cAAM,IAAI;AAAA,UACR;AAAA,QAAA;AAQN,QAAIrH,EAAO,cAAc;AAEvB,YAAMgB,IAAel6B,EAAmBk5B,EAAO,aAAa,OAAO,GAC7D9D,IAAU,KAAK,MAAMr0B,EAAmBm5B,CAAY,CAAC;AAG3D,UAAI,CAAC9E,EAAQ,WAAWA,EAAQ,QAAQ,WAAW;AACjD,cAAM,IAAI,MAAM,6BAA6B;AAI/C,UAAIoL;AACJ,MAAIN,IAEFM,IAAiB9/B,GAAgBC,CAAI,IAGrC6/B,IAAiB9/B;AAAA,QACf,IAAI,WAAW,MAAM,OAAO,OAAO,OAAO8E,EAAe,QAAQ7E,CAA+B,CAAC;AAAA,MAAA;AAKrG,UAAI8/B,IAAiB;AACrB,iBAAWC,KAAWtL,EAAQ,SAAS;AACrC,cAAMuL,KAAgBD,EAAQ,QAAS;AACvC,YAAIC,MAAiBH,MAAmBG,GAAc,YAAA,GAAe;AACnE,UAAAF,IAAiBC;AACjB;AAAA,QACF;AAAA,MACF;AAEA,UAAI,CAACD;AACH,cAAM,IAAI;AAAA,UACR,mBAAmBD,CAAc;AAAA,QAAA;AAKrC,YAAMI,KAAM1L,GAAgBgE,EAAO,aAAa,aAAagB,CAAY,GAEnErT,IAAY,MAAMsZ,EAAY;AAEpC,UAAI,CADa,MAAM1T,GAAgB5F,GAAW+Z,IAAKvW,CAAS;AAE9D,cAAM,IAAI,MAAM,oCAAoC;AAAA,IAExD,OAAO;AACL,YAAMxD,IAAY,MAAMsZ,EAAY;AAEpC,UAAID;AAIF,YAAI,CADa,MAAM9S,GAA0BvG,GAAWlmB,GAAM0pB,CAAS;AAEzE,gBAAM,IAAI,MAAM,uCAAuC;AAAA,iBAKrD,CADa,MAAMoC,GAAgB5F,GAAWlmB,GAAM0pB,CAAS,GAClD;AACb,cAAMwW,IAASha,EAAU,UAAU,QAAQ;AAC3C,cAAM,IAAI,MAAM,sDAAsDga,CAAM,kBAAkBlgC,EAAK,MAAM,uBAAuB0pB,EAAU,MAAM,EAAE;AAAA,MACpJ;AAAA,IAEJ;AAEA,WAAO;AAAA,EACT;AACF;ACrvBO,MAAMyW,WAA0B,MAAM;AAAA,EAC3C,YAAmBC,GAAchwB,GAAiB;AAChD,UAAMA,CAAO,GADI,KAAA,OAAAgwB,GAEjB,KAAK,OAAO,qBACZ,OAAO,eAAe,MAAMD,GAAkB,SAAS;AAAA,EACzD;AACF;AAKO,MAAME,WAAuBF,GAAkB;AAAA,EACpD,YAAY/vB,GAAiB;AAC3B,UAAM,mBAAmBA,CAAO,GAChC,KAAK,OAAO,kBACZ,OAAO,eAAe,MAAMiwB,GAAe,SAAS;AAAA,EACtD;AACF;AAKO,MAAMC,WAAyBH,GAAkB;AAAA,EACtD,YAAY/vB,GAAiB;AAC3B,UAAM,qBAAqBA,CAAO,GAClC,KAAK,OAAO,oBACZ,OAAO,eAAe,MAAMkwB,GAAiB,SAAS;AAAA,EACxD;AACF;AAKO,MAAMC,WAAkBJ,GAAkB;AAAA,EAC/C,YAAY/vB,GAAiB;AAC3B,UAAM,cAAcA,CAAO,GAC3B,KAAK,OAAO,aACZ,OAAO,eAAe,MAAMmwB,GAAU,SAAS;AAAA,EACjD;AACF;AAKO,MAAMC,WAAuBL,GAAkB;AAAA,EACpD,YAAY/vB,GAAiB;AAC3B,UAAM,mBAAmBA,CAAO,GAChC,KAAK,OAAO,kBACZ,OAAO,eAAe,MAAMowB,GAAe,SAAS;AAAA,EACtD;AACF;AAKO,MAAMC,WAAoBN,GAAkB;AAAA,EACjD,YAAY/vB,GAAiB;AAC3B,UAAM,gBAAgBA,CAAO,GAC7B,KAAK,OAAO,eACZ,OAAO,eAAe,MAAMqwB,GAAY,SAAS;AAAA,EACnD;AACF;ACpCO,MAAMC,KAAqB;AAYlC,MAAeC,GAAoD;AAAA,EAG9C;AAAA,EAEnB,YAAYh+B,GAAe;AACzB,SAAK,gBAAgBA;AAAA,EACvB;AAAA,EAIA,OAAO2vB,GAA6B;AAClC,UAAMsO,IAAW,KAAK,kBAAkBtO,CAAI;AAC5C,QAAIsO,MAAa;AACf,YAAM,IAAIH;AAAA,QACR,gCAAgC,KAAK,IAAI,KAAK,KAAK,GAAG;AAAA,MAAA;AAG1D,QAAIG,MAAa,KAAK;AACpB,YAAM,IAAIH;AAAA,QACR,iBAAiB,KAAK,IAAI,yBACjBG,CAAQ,gBAAgB,KAAK,aAAa;AAAA,MAAA;AAAA,EAGzD;AACF;AAMA,MAAeC,UAA8BF,GAAsB;AAAC;AAU7D,MAAMG,WAAmBH,GAAsB;AAAA,EAC3C,MAAM5P;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBuB,GAA2C;AACrE,WAAOA,EAAK,mBAAmB;AAAA,EACjC;AACF;AAMO,MAAMyO,WAA8BJ,GAAsB;AAAA,EACtD,MAAM3P;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBsB,GAA2C;AACrE,WAAOA,EAAK,0BAA0B;AAAA,EACxC;AACF;AAMO,MAAM0O,WAA0BL,GAAsB;AAAA,EAClD,MAAM1P;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBqB,GAA2C;AACrE,WAAOA,EAAK,sBAAsB;AAAA,EACpC;AACF;AAMO,MAAM2O,WAA2BN,GAAsB;AAAA,EACnD,MAAMzP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBoB,GAA2C;AACrE,WAAOA,EAAK,uBAAuB;AAAA,EACrC;AACF;AAMO,MAAM4O,WAAiCP,GAAsB;AAAA,EACzD,MAAMxP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBmB,GAA2C;AACrE,WAAOA,EAAK,6BAA6B;AAAA,EAC3C;AACF;AAMO,MAAM6O,WAA0BR,GAAsB;AAAA,EAClD,MAAMvP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBkB,GAA2C;AACrE,WAAOA,EAAK,sBAAsB;AAAA,EACpC;AACF;AAUO,MAAM8O,WAAqBP,EAAsB;AAAA,EAC7C,MAAMvP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBgB,GAA2C;AACrE,WAAOA,EAAK,mBAAmB;AAAA,EACjC;AACF;AAMO,MAAM+O,WAA2BR,EAAsB;AAAA,EACnD,MAAMtP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBe,GAA2C;AACrE,WAAOA,EAAK,mBAAmB;AAAA,EACjC;AACF;AAMO,MAAMgP,WAA8BT,EAAsB;AAAA,EACtD,MAAMrP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBc,GAA2C;AACrE,WAAOA,EAAK,sBAAsB;AAAA,EACpC;AACF;AAMO,MAAMiP,WAA8BV,EAAsB;AAAA,EACtD,MAAMpP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBa,GAA2C;AACrE,WAAOA,EAAK,sBAAsB;AAAA,EACpC;AACF;AAMO,MAAMkP,WAAgCX,EAAsB;AAAA,EACxD,MAAMnP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBY,GAA2C;AACrE,WAAOA,EAAK,wBAAwB;AAAA,EACtC;AACF;AAMO,MAAMmP,WAAmCZ,EAAsB;AAAA,EAC3D,MAAMlP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBW,GAA2C;AACrE,WAAOA,EAAK,2BAA2B;AAAA,EACzC;AACF;AAMO,MAAMoP,WAAgCb,EAAsB;AAAA,EACxD,MAAMjP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBU,GAA2C;AACrE,WAAOA,EAAK,wBAAwB;AAAA,EACtC;AACF;AAMO,MAAMqP,WAAuCd,EAAsB;AAAA,EAC/D,MAAMhP;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBS,GAA2C;AACrE,WAAOA,EAAK,+BAA+B;AAAA,EAC7C;AACF;AAMO,MAAMsP,WAAqCf,EAAsB;AAAA,EAC7D,MAAM/O;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBQ,GAA2C;AACrE,WAAOA,EAAK,6BAA6B;AAAA,EAC3C;AACF;AAMO,MAAMuP,WAA4ChB,EAAsB;AAAA,EACpE,MAAM9O;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBO,GAA2C;AACrE,WAAOA,EAAK,oCAAoC;AAAA,EAClD;AACF;AAMO,MAAMwP,WAA2BjB,EAAsB;AAAA,EACnD,MAAM7O;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBM,GAA2C;AACrE,WAAOA,EAAK,mBAAmB;AAAA,EACjC;AACF;AAMO,MAAMyP,WAA8BlB,EAAsB;AAAA,EACtD,MAAM5O;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBK,GAA2C;AACrE,WAAOA,EAAK,sBAAsB;AAAA,EACpC;AACF;AAMO,MAAM0P,WAAyBnB,EAAsB;AAAA,EACjD,MAAM3O;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBI,GAA2C;AACrE,WAAOA,EAAK,iBAAiB;AAAA,EAC/B;AACF;AAMO,MAAM2P,WAA6BpB,EAAsB;AAAA,EACrD,MAAM1O;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBG,GAA2C;AACrE,WAAOA,EAAK,qBAAqB;AAAA,EACnC;AACF;AAMO,MAAM4P,WAAuCrB,EAAsB;AAAA,EAC/D,MAAMzO;AAAA,EACN,OAAO;AAAA,EAEN,kBAAkBE,GAA2C;AACrE,WAAOA,EAAK,+BAA+B;AAAA,EAC7C;AACF;AAUO,MAAM6P,GAAoC;AAAA,EACvC;AAAA,EAER,YAAYC,GAAgC;AAC1C,SAAK,WAAWA;AAAA,EAClB;AAAA,EAEA,OAAO9P,GAA6B;AAClC,eAAW+P,KAAS,KAAK;AACvB,UAAI;AACF,QAAAA,EAAM,OAAO/P,CAAI;AACjB;AAAA,MACF,QAAQ;AAAA,MAER;AAEF,UAAM,IAAImO,GAAY,QAAQ,KAAK,SAAS,MAAM,qBAAqB;AAAA,EACzE;AACF;AAMO,MAAM6B,GAAoC;AAAA,EACvC;AAAA,EAER,YAAYF,GAAgC;AAC1C,SAAK,WAAWA;AAAA,EAClB;AAAA,EAEA,OAAO9P,GAA6B;AAClC,QAAI,KAAK,SAAS,SAAS;AACzB,YAAM,IAAImO,GAAY,6BAA6B;AAErD,eAAW4B,KAAS,KAAK;AACvB,MAAAA,EAAM,OAAO/P,CAAI;AAAA,EAErB;AACF;AAcO,MAAMiQ,GAAuC;AAAA,EAC1C;AAAA,EACA;AAAA,EAER,YAAYvW,GAAgD;AAC1D,SAAK,WAAWA,EAAQ,UACxB,KAAK,eAAeA,EAAQ,SAAS,IAAI8U,GAAW9U,EAAQ,MAAM,IAAI;AAAA,EACxE;AAAA,EAEA,OAAOsG,GAA6B;AAClC,IAAI,KAAK,gBACP,KAAK,aAAa,OAAOA,CAAI;AAG/B,UAAMkQ,IAASlQ,EAAK;AACpB,QAAI,CAACkQ;AACH,YAAM,IAAI/B,GAAY,+DAA+D;AAGvF,UAAMgC,wBAAc,IAAA;AAGpB,IAAID,EAAO,cACTC,EAAQ,IAAID,EAAO,UAAU,GAI3BA,EAAO,OACTC,EAAQ,IAAID,EAAO,GAAG;AAIxB,UAAMhU,IAAYgU,EAAO,UAAUnR,EAAuB;AAK1D,QAJI7C,KACFiU,EAAQ,IAAIjU,CAAS,GAGnB,CAACiU,EAAQ,IAAI,KAAK,QAAQ;AAC5B,YAAM,IAAIhC;AAAA,QACR,mCAAmC,KAAK,QAAQ,kBAAkB,MAAM,KAAKgC,CAAO,EAAE,KAAK,IAAI,CAAC;AAAA,MAAA;AAAA,EAGtG;AACF;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]}