@smartledger/keys 1.3.0 → 1.5.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (28) hide show
  1. package/LICENSE +23 -23
  2. package/README.md +535 -492
  3. package/dist/cjs/browser.d.ts.map +1 -1
  4. package/dist/cjs/browser.js +5 -2
  5. package/dist/cjs/browser.js.map +1 -1
  6. package/dist/cjs/sdk.d.ts +30 -1
  7. package/dist/cjs/sdk.d.ts.map +1 -1
  8. package/dist/cjs/sdk.js +127 -4
  9. package/dist/cjs/sdk.js.map +1 -1
  10. package/dist/cjs/types.d.ts +47 -0
  11. package/dist/cjs/types.d.ts.map +1 -1
  12. package/dist/esm/browser.d.ts.map +1 -1
  13. package/dist/esm/browser.js +6 -3
  14. package/dist/esm/browser.js.map +1 -1
  15. package/dist/esm/package.json +1 -1
  16. package/dist/esm/sdk.d.ts +30 -1
  17. package/dist/esm/sdk.d.ts.map +1 -1
  18. package/dist/esm/sdk.js +127 -4
  19. package/dist/esm/sdk.js.map +1 -1
  20. package/dist/esm/types.d.ts +47 -0
  21. package/dist/esm/types.d.ts.map +1 -1
  22. package/dist/lumen-keys.js +157 -34
  23. package/dist/lumen-keys.js.map +3 -3
  24. package/dist/lumen-keys.min.js +3 -3
  25. package/dist/lumen-keys.min.js.map +3 -3
  26. package/dist/tsconfig.esm.tsbuildinfo +1 -1
  27. package/dist/tsconfig.tsbuildinfo +1 -1
  28. package/package.json +76 -76
package/dist/lumen-keys.js.map CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "version": 3,
3
3
  "sources": ["../esbuild-shims.js", "../node_modules/@noble/hashes/src/utils.ts", "../node_modules/@noble/hashes/src/_md.ts", "../node_modules/@noble/hashes/src/_u64.ts", "../node_modules/@noble/hashes/src/sha2.ts", "../node_modules/@noble/hashes/src/sha3.ts", "../crypto-browser-shim.js", "../../../node_modules/dilithium-crystals/dist/index.js", "../src/browser.ts", "../src/sdk.ts", "../../crypto/dist/esm/index.js", "../../crypto/dist/esm/types.js", "../../crypto/dist/esm/registry.js", "../../crypto/dist/esm/utils.js", "../../crypto/dist/esm/signing.js", "../../crypto/dist/esm/key-registry.js", "../../crypto/dist/esm/errors.js", "../../crypto/dist/esm/stateless.js", "../../crypto/dist/esm/suites/bsv-ecdsa.js", "../../../node_modules/@noble/secp256k1/index.js", "../../../node_modules/@noble/hashes/src/hmac.ts", "../../../node_modules/@noble/hashes/src/utils.ts", "../../../node_modules/@noble/hashes/src/sha256.ts", "../../../node_modules/@noble/hashes/src/sha2.ts", "../../../node_modules/@noble/hashes/src/_md.ts", "../../crypto/dist/esm/derivation/bip32.js", "../../../node_modules/@scure/bip32/index.ts", "../../../node_modules/@noble/curves/src/secp256k1.ts", "../../../node_modules/@noble/curves/node_modules/@noble/hashes/src/sha2.ts", "../../../node_modules/@noble/curves/node_modules/@noble/hashes/src/_md.ts", "../../../node_modules/@noble/curves/node_modules/@noble/hashes/src/utils.ts", "../../../node_modules/@noble/curves/src/abstract/curve.ts", "../../../node_modules/@noble/curves/src/utils.ts", "../../../node_modules/@noble/curves/src/abstract/modular.ts", "../../../node_modules/@noble/curves/src/abstract/weierstrass.ts", "../../../node_modules/@noble/curves/node_modules/@noble/hashes/src/hmac.ts", "../../../node_modules/@scure/bip32/node_modules/@noble/hashes/src/hmac.ts", "../../../node_modules/@scure/bip32/node_modules/@noble/hashes/src/utils.ts", "../../../node_modules/@scure/bip32/node_modules/@noble/hashes/src/legacy.ts", "../../../node_modules/@scure/bip32/node_modules/@noble/hashes/src/_md.ts", "../../../node_modules/@scure/bip32/node_modules/@noble/hashes/src/sha2.ts", "../../../node_modules/@scure/bip32/node_modules/@noble/hashes/src/_u64.ts", "../../../node_modules/@scure/base/index.ts", "../../../node_modules/@scure/bip39/index.js", "../../../node_modules/@scure/bip39/node_modules/@noble/hashes/src/pbkdf2.ts", "../../../node_modules/@scure/bip39/node_modules/@noble/hashes/src/hmac.ts", "../../../node_modules/@scure/bip39/node_modules/@noble/hashes/src/utils.ts", "../../../node_modules/@scure/bip39/node_modules/@noble/hashes/src/sha2.ts", "../../../node_modules/@scure/bip39/node_modules/@noble/hashes/src/_md.ts", "../../../node_modules/@scure/bip39/node_modules/@noble/hashes/src/_u64.ts", "../../../node_modules/@scure/bip39/wordlists/english.js", "../../crypto/dist/esm/derivation/wif.js", "../../crypto/dist/esm/suites/ml-dsa.js", "../src/types.ts"],
4
- "sourcesContent": ["/**\n * Polyfills for browser environment\n * Provides Node.js compatibility shims\n */\n\n// Buffer polyfill for browser\nexport const Buffer = {\n from: function(data, encoding) {\n if (typeof data === 'string') {\n if (encoding === 'base64') {\n const binaryString = atob(data);\n const bytes = new Uint8Array(binaryString.length);\n for (let i = 0; i < binaryString.length; i++) {\n bytes[i] = binaryString.charCodeAt(i);\n }\n return bytes;\n }\n // Default to UTF-8\n const encoder = new TextEncoder();\n return encoder.encode(data);\n }\n // Assume Uint8Array or ArrayBuffer\n return new Uint8Array(data);\n }\n};\n\n// Add toString method to Uint8Array prototype for base64 encoding\nif (typeof Uint8Array.prototype.toString !== 'function' || \n !Uint8Array.prototype.toString.toString().includes('[native code]')) {\n const originalToString = Uint8Array.prototype.toString;\n Uint8Array.prototype.toString = function(encoding) {\n if (encoding === 'base64') {\n let binary = '';\n const bytes = new Uint8Array(this);\n for (let i = 0; i < bytes.byteLength; i++) {\n binary += String.fromCharCode(bytes[i]);\n }\n return btoa(binary);\n }\n return originalToString.call(this);\n };\n}\n\n// Process shim\nexport const process = {\n env: {\n NODE_ENV: 'production'\n }\n};\n\n// Global shim\nif (typeof global === 'undefined') {\n window.global = window;\n}\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\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\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\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: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\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: Uint8Array): this {\n aexists(this);\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) 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: Uint8Array): void {\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++) 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 view.setBigUint64(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 must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\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);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) 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}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\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}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\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(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\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: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\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", "/**\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://www.rfc-editor.org/rfc/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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal 32-byte base SHA2 hash class. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n constructor() {\n super(32);\n }\n}\n\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal 64-byte base SHA2 hash class. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\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 protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor() {\n super(64);\n }\n}\n\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n */\nexport const sha256: CHash<_SHA256> = /* @__PURE__ */ createHasher(\n () => new _SHA256(),\n /* @__PURE__ */ oidNist(0x01)\n);\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash<_SHA224> = /* @__PURE__ */ createHasher(\n () => new _SHA224(),\n /* @__PURE__ */ oidNist(0x04)\n);\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash<_SHA512> = /* @__PURE__ */ createHasher(\n () => new _SHA512(),\n /* @__PURE__ */ oidNist(0x03)\n);\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash<_SHA384> = /* @__PURE__ */ createHasher(\n () => new _SHA384(),\n /* @__PURE__ */ oidNist(0x02)\n);\n\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: CHash<_SHA512_256> = /* @__PURE__ */ createHasher(\n () => new _SHA512_256(),\n /* @__PURE__ */ oidNist(0x06)\n);\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: CHash<_SHA512_224> = /* @__PURE__ */ createHasher(\n () => new _SHA512_224(),\n /* @__PURE__ */ oidNist(0x05)\n);\n", "/**\n * SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n *\n * Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),\n * [Website](https://keccak.team/keccak.html),\n * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).\n *\n * Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n */\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.ts';\n// prettier-ignore\nimport {\n abytes, aexists, anumber, aoutput,\n clean, createHasher,\n oidNist,\n swap32IfBE,\n u32,\n type CHash, type CHashXOF,\n type Hash,\n type HashInfo,\n type HashXOF\n} from './utils.ts';\n\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI: number[] = [];\nconst SHA3_ROTL: number[] = [];\nconst _SHA3_IOTA: bigint[] = []; // no pure annotation: var is always used\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 * x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n) t ^= _1n << ((_1n << BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h: number, l: number, s: number) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h: number, l: number, s: number) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n\n/** `keccakf1600` internal function, additionally allows to adjust round count. */\nexport function keccakP(s: Uint32Array, rounds: number = 24): void {\n const B = new Uint32Array(5 * 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta \u03B8\n for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (\u03C1) and Pi (\u03C0)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (\u03C7)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++) B[x] = s[y + x];\n for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (\u03B9)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n clean(B);\n}\n\n/** Keccak sponge function. */\nexport class Keccak implements Hash<Keccak>, HashXOF<Keccak> {\n protected state: Uint8Array;\n protected pos = 0;\n protected posOut = 0;\n protected finished = false;\n protected state32: Uint32Array;\n protected destroyed = false;\n\n public blockLen: number;\n public suffix: number;\n public outputLen: number;\n protected enableXOF = false;\n protected rounds: number;\n\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(\n blockLen: number,\n suffix: number,\n outputLen: number,\n enableXOF = false,\n rounds: number = 24\n ) {\n this.blockLen = blockLen;\n this.suffix = suffix;\n this.outputLen = outputLen;\n this.enableXOF = enableXOF;\n this.rounds = rounds;\n // Can be passed from user as dkLen\n anumber(outputLen, 'outputLen');\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n // 0 < blockLen < 200\n if (!(0 < blockLen && blockLen < 200))\n throw new Error('only keccak-f1600 function is supported');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n clone(): Keccak {\n return this._cloneInto();\n }\n protected keccak(): void {\n swap32IfBE(this.state32);\n keccakP(this.state32, this.rounds);\n swap32IfBE(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data: Uint8Array): this {\n aexists(this);\n abytes(data);\n const { blockLen, state } = this;\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen) this.keccak();\n }\n return this;\n }\n protected finish(): void {\n if (this.finished) return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1) this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n protected writeInto(out: Uint8Array): Uint8Array {\n aexists(this, false);\n abytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len; ) {\n if (this.posOut >= blockLen) this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out: Uint8Array): Uint8Array {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF) throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes: number): Uint8Array {\n anumber(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out: Uint8Array): Uint8Array {\n aoutput(out, this);\n if (this.finished) throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest(): Uint8Array {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy(): void {\n this.destroyed = true;\n clean(this.state);\n }\n _cloneInto(to?: Keccak): Keccak {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\n\nconst genKeccak = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher(() => new Keccak(blockLen, suffix, outputLen), info);\n\n/** SHA3-224 hash function. */\nexport const sha3_224: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 144,\n 28,\n /* @__PURE__ */ oidNist(0x07)\n);\n/** SHA3-256 hash function. Different from keccak-256. */\nexport const sha3_256: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 136,\n 32,\n /* @__PURE__ */ oidNist(0x08)\n);\n/** SHA3-384 hash function. */\nexport const sha3_384: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 104,\n 48,\n /* @__PURE__ */ oidNist(0x09)\n);\n/** SHA3-512 hash function. */\nexport const sha3_512: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 72,\n 64,\n /* @__PURE__ */ oidNist(0x0a)\n);\n\n/** keccak-224 hash function. */\nexport const keccak_224: CHash = /* @__PURE__ */ genKeccak(0x01, 144, 28);\n/** keccak-256 hash function. Different from SHA3-256. */\nexport const keccak_256: CHash = /* @__PURE__ */ genKeccak(0x01, 136, 32);\n/** keccak-384 hash function. */\nexport const keccak_384: CHash = /* @__PURE__ */ genKeccak(0x01, 104, 48);\n/** keccak-512 hash function. */\nexport const keccak_512: CHash = /* @__PURE__ */ genKeccak(0x01, 72, 64);\n\n/** Options for SHAKE XOF. */\nexport type ShakeOpts = { dkLen?: number };\n\nconst genShake = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher<Keccak, ShakeOpts>(\n (opts: ShakeOpts = {}) =>\n new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true),\n info\n );\n\n/** SHAKE128 XOF with 128-bit security. */\nexport const shake128: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 168, 16, /* @__PURE__ */ oidNist(0x0b));\n/** SHAKE256 XOF with 256-bit security. */\nexport const shake256: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 136, 32, /* @__PURE__ */ oidNist(0x0c));\n\n/** SHAKE128 XOF with 256-bit output (NIST version). */\nexport const shake128_32: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 168, 32, /* @__PURE__ */ oidNist(0x0b));\n/** SHAKE256 XOF with 512-bit output (NIST version). */\nexport const shake256_64: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 136, 64, /* @__PURE__ */ oidNist(0x0c));\n", "/**\n * Browser shim for Node.js crypto module\n * Uses @noble/hashes for browser-compatible cryptography\n */\n\nimport { sha256, sha512 } from '@noble/hashes/sha2.js';\nimport { sha3_256 } from '@noble/hashes/sha3.js';\n\n/**\n * Browser-compatible createHash function\n */\nfunction createHash(algorithm) {\n let data = new Uint8Array(0);\n let hashFn;\n\n // Select the appropriate hash function\n switch (algorithm.toLowerCase()) {\n case 'sha256':\n case 'sha-256':\n hashFn = sha256;\n break;\n case 'sha512':\n case 'sha-512':\n hashFn = sha512;\n break;\n case 'sha3-256':\n hashFn = sha3_256;\n break;\n default:\n throw new Error(`Unsupported hash algorithm: ${algorithm}`);\n }\n\n return {\n update(chunk) {\n // Concatenate data\n const chunkArray = chunk instanceof Uint8Array ? chunk : new Uint8Array(chunk);\n const newData = new Uint8Array(data.length + chunkArray.length);\n newData.set(data);\n newData.set(chunkArray, data.length);\n data = newData;\n return this;\n },\n \n digest() {\n return hashFn(data);\n }\n };\n}\n\n// Export for both ESM and CommonJS compatibility\nexport { createHash };\nexport default { createHash };\n", "var dilithium=function(){var A,I,g,C={};function B(A,I){if(0===A)return I;throw new Error(\"Dilithium error: \"+A)}function Q(A,I){return new Uint8Array(new Uint8Array(C.HEAPU8.buffer,A,I))}function i(A){try{C._free(A)}catch(A){setTimeout((function(){throw A}),0)}}C.ready=new Promise((function(A,I){function g(A){return g=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(A){return typeof A}:function(A){return A&&\"function\"==typeof Symbol&&A.constructor===Symbol&&A!==Symbol.prototype?\"symbol\":typeof A},g(A)}(Q={}).onAbort=I,Q.onRuntimeInitialized=function(){try{Q._dilithiumjs_public_key_bytes(),A(Q)}catch(A){I(A)}};var C,B,Q=void 0!==Q?Q:{},i=Object.assign({},Q),E=function(A,I){throw I},o=\"object\"==(\"undefined\"==typeof window?\"undefined\":g(window)),n=\"function\"==typeof importScripts,r=\"object\"==(\"undefined\"==typeof process?\"undefined\":g(process))&&\"object\"==g(process.versions)&&\"string\"==typeof process.versions.node,t=\"\";if(r){var a=eval(\"require\")(\"fs\"),e=eval(\"require\")(\"path\");t=n?e.dirname(t)+\"/\":__dirname+\"/\",C=function(A,I){var g=x(A);return g?I?g:g.toString():(A=q(A)?new URL(A):e.normalize(A),a.readFileSync(A,I?void 0:\"utf8\"))},B=function(A){var I=C(A,!0);return I.buffer||(I=new Uint8Array(I)),I},function(A,I,g){var C=!(arguments.length>3&&void 0!==arguments[3])||arguments[3],B=x(A);B&&I(B),A=q(A)?new URL(A):e.normalize(A),a.readFile(A,C?void 0:\"utf8\",(function(A,B){A?g(A):I(C?B.buffer:B)}))},!Q.thisProgram&&process.argv.length>1&&process.argv[1].replace(/\\\\/g,\"/\"),process.argv.slice(2),\"undefined\"!=typeof module&&(module.exports=Q),process.on(\"uncaughtException\",(function(A){if(!(\"unwind\"===A||A instanceof p||A.context instanceof p))throw A})),E=function(A,I){throw process.exitCode=A,I},Q.inspect=function(){return\"[Emscripten Module object]\"}}else(o||n)&&(n?t=self.location.href:\"undefined\"!=typeof document&&document.currentScript&&(t=document.currentScript.src),t=0!==t.indexOf(\"blob:\")?t.substr(0,t.replace(/[?#].*/,\"\").lastIndexOf(\"/\")+1):\"\",C=function(A){try{var I=new XMLHttpRequest;return I.open(\"GET\",A,!1),I.send(null),I.responseText}catch(I){var g=x(A);if(g)return function(A){for(var I=[],g=0;g<A.length;g++){var C=A[g];C>255&&(C&=255),I.push(String.fromCharCode(C))}return I.join(\"\")}(g);throw I}},n&&(B=function(A){try{var I=new XMLHttpRequest;return I.open(\"GET\",A,!1),I.responseType=\"arraybuffer\",I.send(null),new Uint8Array(I.response)}catch(I){var g=x(A);if(g)return g;throw I}}),function(A,I,g){var C=new XMLHttpRequest;C.open(\"GET\",A,!0),C.responseType=\"arraybuffer\",C.onload=function(){if(200==C.status||0==C.status&&C.response)I(C.response);else{var B=x(A);B?I(B.buffer):g()}},C.onerror=g,C.send(null)},function(A){return document.title=A});Q.print||console.log.bind(console);var f,D=Q.printErr||console.error.bind(console);Object.assign(Q,i),i=null,Q.arguments&&Q.arguments,Q.thisProgram&&Q.thisProgram,Q.quit&&(E=Q.quit),Q.wasmBinary&&(f=Q.wasmBinary);var c,G=Q.noExitRuntime||!0;\"object\"!=(\"undefined\"==typeof WebAssembly?\"undefined\":g(WebAssembly))&&U(\"no native wasm support detected\");var h,y,u,s,F=!1;var Y=[],N=[],w=[];var S=0,k=null,H=null;function U(A){throw Q.onAbort&&Q.onAbort(A),D(A=\"Aborted(\"+A+\")\"),F=!0,1,A+=\". Build with -sASSERTIONS for more info.\",new WebAssembly.RuntimeError(A)}var R,d,M=\"data:application/octet-stream;base64,\";function J(A){return A.startsWith(M)}function q(A){return A.startsWith(\"file://\")}function l(A){return Promise.resolve().then((function(){return function(A){if(A==R&&f)return new Uint8Array(f);var I=x(A);if(I)return I;if(B)return B(A);throw\"both async and sync fetching of the wasm failed\"}(A)}))}function m(A,I,g,C){return function(A,I,g){return l(A).then((function(A){return WebAssembly.instantiate(A,I)})).then((function(A){return A})).then(g,(function(A){D(\"failed to asynchronously prepare wasm: \"+A),U(A)}))}(I,g,C)}J(R=\"data:application/octet-stream;base64,AGFzbQEAAAABOApgA39/fwBgAX8AYAJ/fwBgAX8Bf2ACf38Bf2AAAX9gA39/fwF/YAR/f39/AGAAAGAEf39/fwF/AhkEAWEBYQABAWEBYgAGAWEBYwADAWEBZAAAA0FAAAAAAQICAAQBAQAAAQACAgICAgAGAAABAAECAgABAQMEAQEBAQcBAwAAAQEAAggAAgAEAAADBwIACQkEBQUFCAQFAXABAQEFBgEBgAKAAgYJAX8BQZCcgAQLBzEMAWUCAAFmADIBZwEAAWgAKwFpACoBagBDAWsAQgFsAEEBbQBAAW4APwFvAD4BcAA9CuuEAkD5BAIHfwF+IwBB4AZrIgUkACMAQRBrIgQkACAEIAI7AA4gBUEMaiICECEgAiABQSAQPCACIARBDmpBAhA8IAIoAgAiASABKQPIASIKp0F4cWoiAyADKQMAQh8gCkIDhoaFNwMAIAFCADcDyAEgASABKQOgAUKAgICAgICAgIB/hTcDoAEgBEEQaiQAIAVBEGpByAYgAhA1QQAhAUEDIQQDQCAFQRBqIAFqIgEvAAAgAS0AAkEQdEGAgPwDcXIiAUGAwP8DTQRAIAAgBkECdGogATYCACAGQQFqIQYLIAQiAUHFBk0EQCABQQNqIQQgBkGAAkkNAQsLIAZB/wFNBEBByAYhAwNAIANBA3AiCARAIAMgCGshB0EAIQRBACECQQAhCSADQQNwQQFrQQNPBEADQCAFQRBqIgEgAmogAiAHaiABai0AADoAACABIAJBAXIiA2ogAyAHaiABai0AADoAACABIAJBAnIiA2ogAyAHaiABai0AADoAACABIAJBA3IiA2ogAyAHaiABai0AADoAACACQQRqIQIgCUEEaiIJDQALCwNAIAVBEGoiASACaiACIAdqIAFqLQAAOgAAIAJBAWohAiAEQQFqIgQgCEcNAAsLIAVBEGogCHJBqAEgBUEMahA1QYACIAZrIQcgCEGoAXIhAyAAIAZBAnRqIQhBACECQQMhBEEAIQEDQCAFQRBqIAJqIgIvAAAgAi0AAkEQdEGAgPwDcXIiAkGAwP8DTQRAIAggAUECdGogAjYCACABQQFqIQELIAEgB0kgAyAEIgJBA2oiBE9xDQALIAEgBmoiBkGAAkkNAAsLIAVBDGoQECAFQeAGaiQAC1ACAn8BfgNAIAAgA0ECdCIEaiACIARqNAIAIAEgBGo0AgB+IgUgBUKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACADQQFqIgNBgAJHDQALC1ABAn8DQCAAIARBAnQiA2ogAiADaigCACABIANqKAIAajYCACAAIANBBHIiA2ogAiADaigCACABIANqKAIAajYCACAEQQJqIgRBgAJHDQALC8UaAgZ/An4DQCAAIAZBAnRqIgU0AoAEQvfJAX4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAUgBSgCACIBIAJrNgKABCAFIAEgAmo2AgAgBkEBaiIGQYABRw0ACwNAIAAgA0ECdGoiBjQCgAJCguLgfn4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyEFIAYgBigCACICIAVrNgKAAiAGIAIgBWo2AgAgA0EBaiIDQcAARw0AC0GAASEDA0AgACADQQJ0aiIGNAKAAkKDqmB+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchBSAGIAYoAgAiAiAFazYCgAIgBiACIAVqNgIAIANBAWoiA0HAAUcNAAtBACEDA0AgACADQQJ0aiIGNAKAAULEvA5+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchBSAGIAYoAgAiAiAFazYCgAEgBiACIAVqNgIAIANBAWoiA0EgRw0AC0HAACEGA0BBgAEhAyAAIAZBAnRqIgU0AoABQpjCUH4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAUgBSgCACIBIAJrNgKAASAFIAEgAmo2AgAgBkEBaiIGQeAARw0ACwNAIAAgA0ECdGoiBjQCgAFCqMJKfiIHIAdCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQUgBiAGKAIAIgIgBWs2AoABIAYgAiAFajYCACADQQFqIgNBoAFHDQALQcABIQMDQCAAIANBAnRqIgY0AoABQqS8HH4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyEFIAYgBigCACICIAVrNgKAASAGIAIgBWo2AgAgA0EBaiIDQeABRw0AC0EHIQZBACEFA0AgBkEBaiIGQQJ0QaAKajQCACIHIAAgBUECdCIDQcAAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQcQAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQcgAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQhyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQcwAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQxyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQdAAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRByaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQdQAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQdgAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRhyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQdwAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRxyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQeAAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQSByaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQeQAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQSRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQegAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQShyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQewAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQSxyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQfAAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQTByaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQfQAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQTRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQfgAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQThyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQfwAcmoiATQCAH4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQTxyaiIDKAIAIgEgAms2AgAgAyABIAJqNgIAIAVB4AFJIQMgBUEgaiEFIAMNAAtBACEFA0AgBkEBaiIGQQJ0QaAKajQCACIHIAAgBUECdCIDQSByaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIANqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIANBJHJqIgE0AgB+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgA0EEcmoiASgCACIEIAJrNgIAIAEgAiAEajYCACAHIAAgA0EocmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQhyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQSxyaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIANBDHJqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIANBMHJqIgE0AgB+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgA0EQcmoiASgCACIEIAJrNgIAIAEgAiAEajYCACAHIAAgA0E0cmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQThyaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIANBGHJqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIANBPHJqIgE0AgB+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgA0EccmoiAygCACIBIAJrNgIAIAMgASACajYCACAFQfABSSEDIAVBEGohBSADDQALQQAhBQNAIAZBAWoiBkECdEGgCmo0AgAiByAAIAVBAnQiA0EQcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQRRyaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIANBBHJqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIANBGHJqIgE0AgB+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgA0EIcmoiASgCACIEIAJrNgIAIAEgAiAEajYCACAHIAAgA0EccmoiATQCAH4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQxyaiIDKAIAIgEgAms2AgAgAyABIAJqNgIAIAVB+AFJIQMgBUEIaiEFIAMNAAtBACEDA0AgBkEBaiIGQQJ0QaAKajQCACIHIAAgA0ECdCIFQQhyaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIAVqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIAVBDHJqIgE0AgB+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgBUEEcmoiBSgCACIBIAJrNgIAIAUgASACajYCACADQfwBSSEFIANBBGohAyAFDQALQQAhAwNAIAAgA0ECdCICQQRyaiIBNAIAIAZBAWoiBkECdEGgCmo0AgB+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchBSABIAAgAmoiAigCACIBIAVrNgIAIAIgASAFajYCACADQf4BSSEFIANBAmohAyAFDQALC4oCAQp/A0AgACAEQQV0aiICIAEgBEEDbGoiAy0AAEEHcSIFNgIAIAIgAy0AAEEDdkEHcSIGNgIEIAIgAy0AAUECdEEEcSADLQAAQQZ2ciIHNgIIIAIgAy0AAUEBdkEHcSIINgIMIAIgAy0AAUEEdkEHcSIJNgIQIAIgAy0AAkEBdEEGcSADLQABQQd2ciIKNgIUIAIgAy0AAkECdkEHcSILNgIYIAMtAAIhAyACQQIgBms2AgQgAkECIAVrNgIAIAJBAiAHazYCCCACQQIgCGs2AgwgAkECIAlrNgIQIAJBAiAKazYCFCACQQIgC2s2AhggAkECIANBBXZrNgIcIARBAWoiBEEgRw0ACwu5AQEIfwNAIAEgA0EFdGoiAigCECEGIAIoAgwhByACKAIcIQQgAigCFCEIIAIoAhghCSAAIANBA2xqIgVBECACKAIEQQN0a0ECIAIoAgBrckECIAIoAghrIgJBBnRyOgAAIAVBwAAgBEEFdGtBCCAJQQJ0a0ECIAhrIgRB/gFxQQF2cnI6AAIgBUEgIAZBBHRrQQQgB0EBdGsgAkH8AXFBAnZyciAEQQd0cjoAASADQQFqIgNBIEcNAAsLpgMBBn8jAEGgAWsiBCQAIARBDGoiAyABIAIQMyAEQRBqQYgBIAMQD0EAIQJBACEDA0AgBEEQaiACai0AACIFQQR2IQEgBUEPcSIFQQ9HBEAgACADQQJ0aiAFQc0BbEEKdkEFbCAFa0ECajYCACADQQFqIQMLAkAgAUEPRg0AIANB/wFLDQAgACADQQJ0aiABQc0BbEEKdkEFbCABa0ECajYCACADQQFqIQMLIAJBhgFNBEAgAkEBaiECIANBgAJJDQELCyADQf8BTQRAA0AgBEEQakGIASAEQQxqEA9BgAIgA2shByAAIANBAnRqIQhBACEBQQAhAgNAIARBEGogAWotAAAiBkEEdiEFIAZBD3EiBkEPRwRAIAggAkECdGogBkHNAWxBCnZBBWwgBmtBAmo2AgAgAkEBaiECCwJAIAVBD0YNACACIAdPDQAgCCACQQJ0aiAFQc0BbEEKdkEFbCAFa0ECajYCACACQQFqIQILIAFBhgFNBEAgAUEBaiEBIAIgB0kNAQsLIAIgA2oiA0GAAkkNAAsLIARBDGoQECAEQaABaiQAC2kBA38Cf0EBIAFBgPg/Sg0AGgNAQQEgACADQQJ0IgRqKAIAIgIgAkEBdCACQR91cWsgAU4NARpBASAAIARBBHJqKAIAIgIgAkEBdCACQR91cWsgAU4NARogA0ECaiIDQYACRw0AC0EACws6AQJ/A0AgACACQQJ0aiIBIAEoAgAiASABQYCAgAJqQRd1Qf+/gHxsajYCACACQQFqIgJBgAJHDQALC6MeAgd/An5BgAIhBgNAIAAgBUECdCIEaiICIAAgBEEEcmoiBCgCACIBIAIoAgAiAmo2AgAgBCACIAFrIgI2AgAgBCACrEEAIAZBAWsiBkECdEGgCmooAgBrrH4iCSAJQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAVB/gFJIQQgBUECaiEFIAQNAAsDQCAAIANBAnQiBGoiBSAAIARBCHJqIgIoAgAiASAFKAIAIgVqNgIAIAIgBSABayIBNgIAQQAhBSACQQAgBkEBayIGQQJ0QaAKaigCAGusIgkgAax+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIARBBHJqIgIgACAEQQxyaiIEKAIAIgEgAigCACICajYCACAEIAIgAWsiAjYCACAEIAKsIAl+IgkgCUKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACADQfwBSSEEIANBBGohAyAEDQALA0AgACAFQQJ0IgRqIgMgACAEQRByaiICKAIAIgEgAygCACIDajYCACACIAMgAWsiATYCAEEAIQMgAkEAIAZBAWsiBkECdEGgCmooAgBrrCIJIAGsfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACAEQQRyaiIBIAAgBEEUcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACAEQQhyaiIBIAAgBEEYcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACAEQQxyaiICIAAgBEEccmoiBCgCACIBIAIoAgAiAmo2AgAgBCACIAFrIgI2AgAgBCACrCAJfiIJIAlCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgBUH4AUkhBCAFQQhqIQUgBA0ACwNAIAAgA0ECdCIEaiIFIAAgBEEgcmoiAigCACIBIAUoAgAiBWo2AgAgAiAFIAFrIgE2AgBBACEFIAJBACAGQQFrIgZBAnRBoApqKAIAa6wiCSABrH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEEcmoiASAAIARBJHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEIcmoiASAAIARBKHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEMcmoiASAAIARBLHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEQcmoiASAAIARBMHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEUcmoiASAAIARBNHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEYcmoiASAAIARBOHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEccmoiAiAAIARBPHJqIgQoAgAiASACKAIAIgJqNgIAIAQgAiABayICNgIAIAQgAqwgCX4iCSAJQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIANB8AFJIQQgA0EQaiEDIAQNAAsDQCAAIAVBAnQiA2oiAiAAIANBwAByaiIEKAIAIgEgAigCACICajYCACAEIAIgAWsiAjYCACAEQQAgBiIEQQFrIgZBAnRBoApqKAIAa6wiCSACrH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0EEcmoiASAAIANBxAByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBCHJqIgEgACADQcgAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQQxyaiIBIAAgA0HMAHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0EQcmoiASAAIANB0AByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBFHJqIgEgACADQdQAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQRhyaiIBIAAgA0HYAHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0EccmoiASAAIANB3AByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBIHJqIgEgACADQeAAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQSRyaiIBIAAgA0HkAHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0EocmoiASAAIANB6AByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBLHJqIgEgACADQewAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQTByaiIBIAAgA0HwAHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0E0cmoiASAAIANB9AByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBOHJqIgEgACADQfgAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQTxyaiICIAAgA0H8AHJqIgMoAgAiASACKAIAIgJqNgIAIAMgAiABayICNgIAIAMgAqwgCX4iCSAJQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAVB4AFJIQMgBUEgaiEFIAMNAAtBACEDQQAgBEECdEGYCmooAgBrrCEJA0AgACADQQJ0aiIGIAYoAoABIgUgBigCACICajYCACAGIAIgBWsiBTYCgAEgBiAFrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AoABIANBAWoiA0EgRw0AC0EAIARBAnRBlApqKAIAa6whCUHAACEDA0AgACADQQJ0aiIGIAYoAoABIgUgBigCACICajYCACAGIAIgBWsiBTYCgAEgBiAFrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AoABIANBAWoiA0HgAEcNAAtBACAEQQJ0QZAKaigCAGusIQlBgAEhAwNAIAAgA0ECdGoiBiAGKAKAASIFIAYoAgAiAmo2AgAgBiACIAVrIgU2AoABIAYgBawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgKAASADQQFqIgNBoAFHDQALQQAgBEECdEGMCmooAgBrrCEJQcABIQMDQCAAIANBAnRqIgYgBigCgAEiBSAGKAIAIgJqNgIAIAYgAiAFayIFNgKAASAGIAWsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CgAEgA0EBaiIDQeABRw0AC0EAIQNBACAEQQJ0QYgKaigCAGusIQkDQCAAIANBAnRqIgYgBigCgAIiBSAGKAIAIgJqNgIAIAYgAiAFayIFNgKAAiAGIAWsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CgAIgA0EBaiIDQcAARw0AC0EAIARBAnRBhApqKAIAa6whCUGAASEDA0AgACADQQJ0aiIGIAYoAoACIgUgBigCACICajYCACAGIAIgBWsiBTYCgAIgBiAFrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AoACIANBAWoiA0HAAUcNAAtBACEDQQAgBEECdEGACmooAgBrrCEJQQAhBgNAIAAgBkECdGoiBCAEKAKABCIFIAQoAgAiAmo2AgAgBCACIAVrIgU2AoAEIAQgBawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgKABCAGQQFqIgZBgAFHDQALA0AgACADQQJ0aiIGIAY0AgBC+scCfiIJIAlCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgA0EBaiIDQYACRw0ACwsQACAAKAIAQYgBIAEgAhA6C8kCAgd/A34gAigCACEDAn9BACABRQ0AGiABrSEMA0AgCqciAiAKIAMpA8gBIgtaDQEaIAAgAmogAyAKIAt9IgunQYgBakF4cWopAwAgC0IDhog8AAAgCkIBfCIKIAxSDQALIAELIQIgAyADKQPIASACrX03A8gBIAEgAmsiBQRAIAAgAmohAANAIAMQJUGIASAFIAVBiAFPGyIEQQFxIQZBACECIARBAUcEQCAEQf4BcSEHQQAhAQNAIAAgAmogAyACQXhxaiIIKQMAIAJBA3RBMHGtiDwAACAAIAJBAXIiCWogCCkDACAJQQN0QThxrYg8AAAgAkECaiECIAFBAmoiASAHRw0ACwsgBgRAIAAgAmogAyACQXhxaikDACACQQN0QThxrYg8AAALIANBiAEgBGutNwPIASAAIARqIQAgBSAEayIFDQALCwsJACAAKAIAECoLrgEBAX8jAEGACGsiAyQAIAAgASACEAUgAyABQYAIaiACQYAIahAFIAAgACADEAYgAyABQYAQaiACQYAQahAFIAAgACADEAYgAyABQYAYaiACQYAYahAFIAAgACADEAYgAyABQYAgaiACQYAgahAFIAAgACADEAYgAyABQYAoaiACQYAoahAFIAAgACADEAYgAyABQYAwaiACQYAwahAFIAAgACADEAYgA0GACGokAAtVAQJ/A0AgACACaiABIAJBA3RqIgMoAgRBBHQgAygCAHI6AAAgACACQQFyIgNqIAEgA0EDdGoiAygCBEEEdCADKAIAcjoAACACQQJqIgJBgAFHDQALC98DAQt/A0AgACAIQQV0aiICIAEgCEENbGoiAy0AACIJNgIAIAIgCSADLQABQQh0QYA+cXIiCTYCACACIAMtAAFBBXYiBDYCBCACIAMtAAJBA3QgBHIiBDYCBCACIAMtAANBC3RBgDBxIARyIgQ2AgQgAiADLQADQQJ2Igo2AgggAiADLQAEQQZ0QcA/cSAKciIKNgIIIAIgAy0ABEEHdiIFNgIMIAIgAy0ABUEBdCAFciIFNgIMIAIgAy0ABkEJdEGAPHEgBXIiBTYCDCACIAMtAAZBBHYiBjYCECACIAMtAAdBBHQgBnIiBjYCECACIAMtAAhBDHRBgCBxIAZyIgY2AhAgAiADLQAIQQF2Igs2AhQgAiADLQAJQQd0QYA/cSALciILNgIUIAIgAy0ACUEGdiIHNgIYIAIgAy0ACkECdCAHciIHNgIYIAIgAy0AC0EKdEGAOHEgB3IiBzYCGCACIAMtAAtBA3YiDDYCHCADLQAMIQMgAkGAICAEazYCBCACQYAgIAlrNgIAIAJBgCAgCms2AgggAkGAICAFazYCDCACQYAgIAZrNgIQIAJBgCAgC2s2AhQgAkGAICAHazYCGCACQYAgIANBBXQgDHJrNgIcIAhBAWoiCEEgRw0ACwuwAgELfwNAIAEgBEEFdGoiAigCFCEKIAIoAgghCCACKAIcIQkgAigCGCEFIAIoAhAhBiACKAIMIQcgAigCBCELIAAgBEENbGoiA0GAICACKAIAayIMOgAAIANBgCAgC2siAkEDdjoAAiADQYAgIAdrIgdBAXY6AAUgA0GAICAGayIGQQR2OgAHIANBgCAgBWsiBUECdjoACiADQYAgIAlrIglBBXY6AAwgAyACQQV0IAxBCHZyOgABIANBgCAgCGsiCEECdCACQQt2cjoAAyADIAdBB3QgCEEGdnI6AAQgAyAGQQR0IAdBCXZyOgAGIANBgCAgCmsiAkEBdCAGQQx2cjoACCADIAVBBnQgAkEHdnI6AAkgAyAJQQN0IAVBCnZyOgALIARBAWoiBEEgRw0ACwuIAQEDfwNAIAAgA0EEdGoiBCABIANBBWxqIgJBAWotAABBCHRBgAZxIAItAAByNgIAIAQgAi0AAkEGdEHAB3EgAi0AAUECdnI2AgQgBCACLQADQQR0QfAHcSACLQACQQR2cjYCCCAEIAItAARBAnQgAi0AA0EGdnI2AgwgA0EBaiIDQcAARw0ACwt9AQN/A0AgACADQQVsaiIEIAEgA0EEdGoiAigCADoAACAEIAIoAgRBAnQgAigCAEEIdnI6AAEgBCACKAIIQQR0IAIoAgRBBnZyOgACIAQgAigCDEEGdCACKAIIQQR2cjoAAyAEIAIoAgxBAnY6AAQgA0EBaiIDQcAARw0ACwuKAQEFfwNAIAAgBEECdCIDagJ/IAEgA2ooAgAiB0H/AGpBB3VBgQhsQYCAgAFqQRZ2IgVBD3EhBiACIANqKAIABH8gBUEBakEPcUH/v4B8QQAgBkGAhGBsIAdqIgNBgOD/AUobIANqQQBKDQEaIAVBAWtBD3EFIAYLCzYCACAEQQFqIgRBgAJHDQALC1QBBH8DQCAAIARBAnQiA2ogASADaigCACIGQYCCcEYgAiADaigCAEEAR3EgBkGB/g9rQf+DYElyIgM2AgAgAyAFaiEFIARBAWoiBEGAAkcNAAsgBQttAQR/A0AgACAEQQJ0IgNqIQYgASADakH/v4B8QQAgAiADaigCACIDIANB/wBqQQd1QYEIbEGAgIABakEWdkEPcSIDQYCEYGxqIgVBgOD/AUobIAVqNgIAIAYgAzYCACAEQQFqIgRBgAJHDQALC0kBA38DQCAAIARBAnQiA2ohBSABIANqIAIgA2ooAgAiAyADQf8faiIDQYBAcWs2AgAgBSADQQ11NgIAIARBAWoiBEGAAkcNAAsLagEDfwNAIAAgA0ECdCIBaiICIAIoAgBBDXQ2AgAgACABQQRyaiICIAIoAgBBDXQ2AgAgACABQQhyaiICIAIoAgBBDXQ2AgAgACABQQxyaiIBIAEoAgBBDXQ2AgAgA0EEaiIDQYACRw0ACwtQAQJ/A0AgACAEQQJ0IgNqIAEgA2ooAgAgAiADaigCAGs2AgAgACADQQRyIgNqIAEgA2ooAgAgAiADaigCAGs2AgAgBEECaiIEQYACRw0ACws0AQJ/A0AgACACQQJ0aiIBIAEoAgAiASABQR91QYHA/wNxajYCACACQQFqIgJBgAJHDQALC3EBBH8DQCABIAJBA3RqIgMoAgQhBCAAIAJBBWxqIgVBgIAgIAMoAgBrIgM6AAAgBSADQQh2OgABIAVBgIAgIARrIgRBBHY6AAMgBSAEQQx2OgAEIAUgBEEEdCADQRB2cjoAAiACQQFqIgJBgAFHDQALC58BAQV/A0AgACAFQQN0aiIDIAEgBUEFbGoiAi0AACIENgIAIAMgBCACLQABQQh0ciIENgIAIAMgAi0AAkEQdEGAgDxxIARyIgQ2AgAgAyACLQACQQR2IgY2AgQgAyACLQADQQR0IAZyIgY2AgQgAi0ABCECIANBgIAgIARrNgIAIANBgIAgIAJBDHQgBnJrNgIEIAVBAWoiBUGAAUcNAAsLngEBBH8jAEHABWsiAyQAIANBDGoiBCABIAIQMyADQRBqQagFIAQQDyAEEBBBACECA0AgA0EQaiACQQVsaiIBLwAAIQQgACACQQN0aiIFQYCAICABLQADQQR0IAEtAAIiBkEEdnIgAS0ABEEMdHJrNgIEIAVBgIAgIAQgBkEQdEGAgDxxcms2AgAgAkEBaiICQYABRw0ACyADQcAFaiQACyIAIABB0AEQKyIANgIAIABFBEBB7wAQAAALIABB0AEQJBoLTQIBfgF/IAAoAgAiACAAKQPIASIBp0F4cWoiAiACKQMAQh8gAUIDhoaFNwMAIABCADcDyAEgACAAKQOAAUKAgICAgICAgIB/hTcDgAELTwECf0GgEigCACIBIABBB2pBeHEiAmohAAJAIAJBACAAIAFNGw0AIAA/AEEQdEsEQCAAEAJFDQELQaASIAA2AgAgAQ8LQZwYQTA2AgBBfwvYAgECfwJAIAFFDQAgAEEAOgAAIAAgAWoiAkEBa0EAOgAAIAFBA0kNACAAQQA6AAIgAEEAOgABIAJBA2tBADoAACACQQJrQQA6AAAgAUEHSQ0AIABBADoAAyACQQRrQQA6AAAgAUEJSQ0AIABBACAAa0EDcSIDaiICQQA2AgAgAiABIANrQXxxIgNqIgFBBGtBADYCACADQQlJDQAgAkEANgIIIAJBADYCBCABQQhrQQA2AgAgAUEMa0EANgIAIANBGUkNACACQQA2AhggAkEANgIUIAJBADYCECACQQA2AgwgAUEQa0EANgIAIAFBFGtBADYCACABQRhrQQA2AgAgAUEca0EANgIAIAMgAkEEcUEYciIDayIBQSBJDQAgAiADaiECA0AgAkIANwMYIAJCADcDECACQgA3AwggAkIANwMAIAJBIGohAiABQSBrIgFBH0sNAAsLIAAL5QwCLn4CfyAAKQPAASEXIAApA7gBIRggACkDsAEhDiAAKQOoASEIIAApA6ABIQ8gACkDmAEhCSAAKQOQASEQIAApA4gBIREgACkDgAEhCiAAKQN4IRIgACkDcCETIAApA2ghBCAAKQNgIRQgACkDWCEFIAApA1AhCyAAKQNIIRkgACkDQCENIAApAzghASAAKQMwIQIgACkDKCEHIAApAyAhGyAAKQMYIQwgACkDECEGIAApAwghAyAAKQMAIRUDQCAQIBiFIASFIA2FIAyFIh8gDyAShSALhSAHhSAVhSIaQgGJhSIcIBuFQhuJIhYgGiAOIBGFIBSFIAGFIAaFIh5CAYmFIhogBYVCCokiHSAJIBeFIBOFIBmFIBuFIiAgCCAKhSAFhSAChSADhSIhQgGJhSIFIAeFQiSJIgdCf4WDhSIiIAMgGoVCAYkiGyAEIB4gIEIBiYUiBIVCGYkiAyABICEgH0IBiYUiAYVCBokiH0J/hYOFIiGFIAQgDIVCHIkiDCAFIAuFQgOJIgsgGSAchUIUiSIeQn+Fg4UiI4UgASAGhUI+iSIGIBMgHIVCJ4kiEyAEIA2FQjeJIiBCf4WDhSIkhSAFIBWFIhUgL0EDdCIwQeAIaikDACABIBSFQiuJIhQgAiAahUIsiSICQn+Fg4WFIiWFIg1CAYkgASARhUIPiSIRIBYgBCAYhUI4iSIYQn+Fg4UiJiAEIBCFQhWJIhAgFSAXIByFQg6JIhdCf4WDhSInIAUgEoVCKYkiEiAGIAggGoVCAokiCEJ/hYOFIgQgCSAchUIIiSIJIBsgBSAPhUISiSIPQn+Fg4UiKCAKIBqFQi2JIgogDCABIA6FQj2JIg5Cf4WDhSIFhYWFhSIphSIZIAggICAGQn+Fg4UiAYVCDokiHCANIA8gCUJ/hYMgA4UiKiAXIBBCf4WDIBSFIgYgEyAIIBJCf4WDhSIrIA4gCkJ/hYMgC4UiLCAdIBggEUJ/hYOFIi2FhYWFIghCAYmFIg0gHiAKIAtCf4WDhSIKhUIsiSIaICUgByAWQn+FgyAYhSIWIB4gDEJ/hYMgDoUiHiAfIBtCf4WDIA+FIgsgFyACIBVCf4WDhSIuIAGFhYWFIhcgEiATQn+FgyAghSIYIAkgA0J/hYMgH4UiAyARIB1Cf4WDIAeFIh0gCiACIBAgFEJ/hYOFIgKFhYWFIglCAYmFIgGFIhVCf4WDhSEbIA0gGIVCAokiDiAXQgGJIAiFIgwgBYVCN4kiDyAGIClCAYkgCYUiBoVCPokiCUJ/hYOFIRcgASAihUIpiSIIIAkgDkJ/hYOFIRggCyAZhUIniSIQIA4gCEJ/hYOFIQ4gCCAQQn+FgyAPhSEIIBAgD0J/hYMgCYUhDyAEIAyFQjiJIhEgASAjhUIkiSISIBkgLoVCG4kiE0J/hYOFIQkgBiAthUIPiSIKIBMgEUJ/hYOFIRAgAyANhUIKiSIEIBEgCkJ/hYOFIREgCiAEQn+FgyAShSEKIBMgBCASQn+Fg4UhEiABICSFQhKJIhQgBiAshUIGiSILIAIgDYVCAYkiAkJ/hYOFIRMgFiAZhUIIiSIFIAIgFEJ/hYOFIQQgDCAohUIZiSIHIBQgBUJ/hYOFIRQgBSAHQn+FgyALhSEFIAIgByALQn+Fg4UhCyAGICuFQj2JIgIgGSAehUIUiSIHIAwgJ4VCHIkiA0J/hYOFIRkgDSAdhUItiSIWIAMgAkJ/hYOFIQ0gASAhhUIDiSIdIAIgFkJ/hYOFIQEgByAWIB1Cf4WDhSECIB0gB0J/hYMgA4UhByAMICaFQhWJIgMgFSAcQn+Fg4UhDCAGICqFQiuJIhYgHCADQn+Fg4UhBiAaIAMgFkJ/hYOFIQMgMEEIckHgCGopAwAgFiAaQn+Fg4UgFYUhFSAvQRZJITAgL0ECaiEvIDANAAsgACAXNwPAASAAIBg3A7gBIAAgDjcDsAEgACAINwOoASAAIA83A6ABIAAgCTcDmAEgACAQNwOQASAAIBE3A4gBIAAgCjcDgAEgACASNwN4IAAgEzcDcCAAIAQ3A2ggACAUNwNgIAAgBTcDWCAAIAs3A1AgACAZNwNIIAAgDTcDQCAAIAE3AzggACACNwMwIAAgBzcDKCAAIBs3AyAgACAMNwMYIAAgBjcDECAAIAM3AwggACAVNwMACz4AIAAQDSAAQYAIahANIABBgBBqEA0gAEGAGGoQDSAAQYAgahANIABBgChqEA0gAEGAMGoQDSAAQYA4ahANCz4AIAAQDCAAQYAIahAMIABBgBBqEAwgAEGAGGoQDCAAQYAgahAMIABBgChqEAwgAEGAMGoQDCAAQYA4ahAMCzYAIAAQByAAQYAIahAHIABBgBBqEAcgAEGAGGoQByAAQYAgahAHIABBgChqEAcgAEGAMGoQBwvHCAEHfyMAQaABayIIJAAgAiEFIwBB0AFrIgQkAAJAQcgBECsiAkUNACACQQRrLQAAQQNxRQ0AIAJByAEQJBoLIAggAjYCDAJAIAIEQCADQYgBTwRAA0AgAiACKQMAIAUpAACFNwMAIAIgAikDCCAFKQAIhTcDCCACIAIpAxAgBSkAEIU3AxAgAiACKQMYIAUpABiFNwMYIAIgAikDICAFKQAghTcDICACIAIpAyggBSkAKIU3AyggAiACKQMwIAUpADCFNwMwIAIgAikDOCAFKQA4hTcDOCACIAIpA0AgBSkAQIU3A0AgAiACKQNIIAUpAEiFNwNIIAIgAikDUCAFKQBQhTcDUCACIAIpA1ggBSkAWIU3A1ggAiACKQNgIAUpAGCFNwNgIAIgAikDaCAFKQBohTcDaCACIAIpA3AgBSkAcIU3A3AgAiACKQN4IAUpAHiFNwN4IAIgAikDgAEgBSkAgAGFNwOAASACECUgBUGIAWohBSADQYgBayIDQYcBSw0ACwsgBEGIARAkIQQCQCADRQ0AIANBBE8EQCADQXxxIQoDQCAEIAZqIAUgBmotAAA6AAAgBCAGQQFyIglqIAUgCWotAAA6AAAgBCAGQQJyIglqIAUgCWotAAA6AAAgBCAGQQNyIglqIAUgCWotAAA6AAAgBkEEaiEGIAdBBGoiByAKRw0ACwsgA0EDcSIKRQ0AQQAhBwNAIAQgBmogBSAGai0AADoAACAGQQFqIQYgB0EBaiIHIApHDQALCyADIARqQR86AAAgBCAELQCHAUGAAXI6AIcBIAIgAikDACAEKQMAhTcDACACIAIpAwggBCkDCIU3AwggAiACKQMQIAQpAxCFNwMQIAIgAikDGCAEKQMYhTcDGCACIAIpAyAgBCkDIIU3AyAgAiACKQMoIAQpAyiFNwMoIAIgAikDMCAEKQMwhTcDMCACIAIpAzggBCkDOIU3AzggAiACKQNAIAQpA0CFNwNAIAIgAikDSCAEKQNIhTcDSCACIAIpA1AgBCkDUIU3A1AgAiACKQNYIAQpA1iFNwNYIAIgAikDYCAEKQNghTcDYCACIAIpA2ggBCkDaIU3A2ggAiACKQNwIAQpA3CFNwNwIAIgAikDeCAEKQN4hTcDeCACIAIpA4ABIAQpA4ABhTcDgAEgBEHQAWokAAwBC0HvABAAAAsgAUGIAW4hBSAIKAIMIQYgAUGIAU8EQCAAIQIgBSEEA0AgBhAlQQAhAwNAIAIgA0EDdCIHaiAGIAdqKQMANwAAIANBAWoiA0ERRw0ACyACQYgBaiECIARBAWsiBA0ACwsgBUGIAWwiAiABRwRAIAEgAmshASAAIAJqIQAgBhAlQQAhAwNAIANBA3QiAiAIQRBqaiACIAZqKQMANwMAIANBAWoiA0ERRw0ACyAAIAhBEGpBASABIAFBAU0bECwLIAYQKiAIQaABaiQAC9ILAQd/AkAgAEUNACAAQQhrIgIgAEEEaygCACIBQXhxIgBqIQUCQCABQQFxDQAgAUEDcUUNASACIAIoAgAiAWsiAkGwGCgCAEkNASAAIAFqIQACQAJAQbQYKAIAIAJHBEAgAUH/AU0EQCABQQN2IQQgAigCDCIBIAIoAggiA0YEQEGgGEGgGCgCAEF+IAR3cTYCAAwFCyADIAE2AgwgASADNgIIDAQLIAIoAhghBiACIAIoAgwiAUcEQCACKAIIIgMgATYCDCABIAM2AggMAwsgAkEUaiIEKAIAIgNFBEAgAigCECIDRQ0CIAJBEGohBAsDQCAEIQcgAyIBQRRqIgQoAgAiAw0AIAFBEGohBCABKAIQIgMNAAsgB0EANgIADAILIAUoAgQiAUEDcUEDRw0CQagYIAA2AgAgBSABQX5xNgIEIAIgAEEBcjYCBCAFIAA2AgAPC0EAIQELIAZFDQACQCACKAIcIgNBAnRB0BpqIgQoAgAgAkYEQCAEIAE2AgAgAQ0BQaQYQaQYKAIAQX4gA3dxNgIADAILIAZBEEEUIAYoAhAgAkYbaiABNgIAIAFFDQELIAEgBjYCGCACKAIQIgMEQCABIAM2AhAgAyABNgIYCyACKAIUIgNFDQAgASADNgIUIAMgATYCGAsgAiAFTw0AIAUoAgQiAUEBcUUNAAJAAkACQAJAIAFBAnFFBEBBuBgoAgAgBUYEQEG4GCACNgIAQawYQawYKAIAIABqIgA2AgAgAiAAQQFyNgIEIAJBtBgoAgBHDQZBqBhBADYCAEG0GEEANgIADwtBtBgoAgAgBUYEQEG0GCACNgIAQagYQagYKAIAIABqIgA2AgAgAiAAQQFyNgIEIAAgAmogADYCAA8LIAFBeHEgAGohACABQf8BTQRAIAFBA3YhBCAFKAIMIgEgBSgCCCIDRgRAQaAYQaAYKAIAQX4gBHdxNgIADAULIAMgATYCDCABIAM2AggMBAsgBSgCGCEGIAUgBSgCDCIBRwRAQbAYKAIAGiAFKAIIIgMgATYCDCABIAM2AggMAwsgBUEUaiIEKAIAIgNFBEAgBSgCECIDRQ0CIAVBEGohBAsDQCAEIQcgAyIBQRRqIgQoAgAiAw0AIAFBEGohBCABKAIQIgMNAAsgB0EANgIADAILIAUgAUF+cTYCBCACIABBAXI2AgQgACACaiAANgIADAMLQQAhAQsgBkUNAAJAIAUoAhwiA0ECdEHQGmoiBCgCACAFRgRAIAQgATYCACABDQFBpBhBpBgoAgBBfiADd3E2AgAMAgsgBkEQQRQgBigCECAFRhtqIAE2AgAgAUUNAQsgASAGNgIYIAUoAhAiAwRAIAEgAzYCECADIAE2AhgLIAUoAhQiA0UNACABIAM2AhQgAyABNgIYCyACIABBAXI2AgQgACACaiAANgIAIAJBtBgoAgBHDQBBqBggADYCAA8LIABB/wFNBEAgAEF4cUHIGGohAQJ/QaAYKAIAIgNBASAAQQN2dCIAcUUEQEGgGCAAIANyNgIAIAEMAQsgASgCCAshACABIAI2AgggACACNgIMIAIgATYCDCACIAA2AggPC0EfIQMgAEH///8HTQRAIABBJiAAQQh2ZyIBa3ZBAXEgAUEBdGtBPmohAwsgAiADNgIcIAJCADcCECADQQJ0QdAaaiEBAkACQAJAQaQYKAIAIgRBASADdCIHcUUEQEGkGCAEIAdyNgIAIAEgAjYCACACIAE2AhgMAQsgAEEZIANBAXZrQQAgA0EfRxt0IQMgASgCACEBA0AgASIEKAIEQXhxIABGDQIgA0EddiEBIANBAXQhAyAEIAFBBHFqIgdBEGooAgAiAQ0ACyAHIAI2AhAgAiAENgIYCyACIAI2AgwgAiACNgIIDAELIAQoAggiACACNgIMIAQgAjYCCCACQQA2AhggAiAENgIMIAIgADYCCAtBwBhBwBgoAgBBAWsiAEF/IAAbNgIACwucKAELfyMAQRBrIgskAAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkAgAEH0AU0EQEGgGCgCACIGQRAgAEELakF4cSAAQQtJGyIFQQN2IgB2IgFBA3EEQAJAIAFBf3NBAXEgAGoiAkEDdCIBQcgYaiIAIAFB0BhqKAIAIgEoAggiBEYEQEGgGCAGQX4gAndxNgIADAELIAQgADYCDCAAIAQ2AggLIAFBCGohACABIAJBA3QiAkEDcjYCBCABIAJqIgEgASgCBEEBcjYCBAwPCyAFQagYKAIAIgdNDQEgAQRAAkBBAiAAdCICQQAgAmtyIAEgAHRxIgBBACAAa3FoIgFBA3QiAEHIGGoiAiAAQdAYaigCACIAKAIIIgRGBEBBoBggBkF+IAF3cSIGNgIADAELIAQgAjYCDCACIAQ2AggLIAAgBUEDcjYCBCAAIAVqIgggAUEDdCIBIAVrIgRBAXI2AgQgACABaiAENgIAIAcEQCAHQXhxQcgYaiEBQbQYKAIAIQICfyAGQQEgB0EDdnQiA3FFBEBBoBggAyAGcjYCACABDAELIAEoAggLIQMgASACNgIIIAMgAjYCDCACIAE2AgwgAiADNgIICyAAQQhqIQBBtBggCDYCAEGoGCAENgIADA8LQaQYKAIAIgpFDQEgCkEAIAprcWhBAnRB0BpqKAIAIgIoAgRBeHEgBWshAyACIQEDQAJAIAEoAhAiAEUEQCABKAIUIgBFDQELIAAoAgRBeHEgBWsiASADIAEgA0kiARshAyAAIAIgARshAiAAIQEMAQsLIAIoAhghCSACIAIoAgwiBEcEQEGwGCgCABogAigCCCIAIAQ2AgwgBCAANgIIDA4LIAJBFGoiASgCACIARQRAIAIoAhAiAEUNAyACQRBqIQELA0AgASEIIAAiBEEUaiIBKAIAIgANACAEQRBqIQEgBCgCECIADQALIAhBADYCAAwNC0F/IQUgAEG/f0sNACAAQQtqIgBBeHEhBUGkGCgCACIIRQ0AQQAgBWshAwJAAkACQAJ/QQAgBUGAAkkNABpBHyAFQf///wdLDQAaIAVBJiAAQQh2ZyIAa3ZBAXEgAEEBdGtBPmoLIgdBAnRB0BpqKAIAIgFFBEBBACEADAELQQAhACAFQRkgB0EBdmtBACAHQR9HG3QhAgNAAkAgASgCBEF4cSAFayIGIANPDQAgASEEIAYiAw0AQQAhAyABIQAMAwsgACABKAIUIgYgBiABIAJBHXZBBHFqKAIQIgFGGyAAIAYbIQAgAkEBdCECIAENAAsLIAAgBHJFBEBBACEEQQIgB3QiAEEAIABrciAIcSIARQ0DIABBACAAa3FoQQJ0QdAaaigCACEACyAARQ0BCwNAIAAoAgRBeHEgBWsiAiADSSEBIAIgAyABGyEDIAAgBCABGyEEIAAoAhAiAQR/IAEFIAAoAhQLIgANAAsLIARFDQAgA0GoGCgCACAFa08NACAEKAIYIQcgBCAEKAIMIgJHBEBBsBgoAgAaIAQoAggiACACNgIMIAIgADYCCAwMCyAEQRRqIgEoAgAiAEUEQCAEKAIQIgBFDQMgBEEQaiEBCwNAIAEhBiAAIgJBFGoiASgCACIADQAgAkEQaiEBIAIoAhAiAA0ACyAGQQA2AgAMCwsgBUGoGCgCACIETQRAQbQYKAIAIQACQCAEIAVrIgFBEE8EQCAAIAVqIgIgAUEBcjYCBCAAIARqIAE2AgAgACAFQQNyNgIEDAELIAAgBEEDcjYCBCAAIARqIgEgASgCBEEBcjYCBEEAIQJBACEBC0GoGCABNgIAQbQYIAI2AgAgAEEIaiEADA0LIAVBrBgoAgAiAkkEQEGsGCACIAVrIgE2AgBBuBhBuBgoAgAiACAFaiICNgIAIAIgAUEBcjYCBCAAIAVBA3I2AgQgAEEIaiEADA0LQQAhACAFQS9qIgMCf0H4GygCAARAQYAcKAIADAELQYQcQn83AgBB/BtCgKCAgICABDcCAEH4GyALQQxqQXBxQdiq1aoFczYCAEGMHEEANgIAQdwbQQA2AgBBgCALIgFqIgZBACABayIIcSIBIAVNDQxB2BsoAgAiBARAQdAbKAIAIgcgAWoiCSAHTQ0NIAQgCUkNDQsCQEHcGy0AAEEEcUUEQAJAAkACQAJAQbgYKAIAIgQEQEHgGyEAA0AgBCAAKAIAIgdPBEAgByAAKAIEaiAESw0DCyAAKAIIIgANAAsLQQAQIyICQX9GDQMgASEGQfwbKAIAIgBBAWsiBCACcQRAIAEgAmsgAiAEakEAIABrcWohBgsgBSAGTw0DQdgbKAIAIgAEQEHQGygCACIEIAZqIgggBE0NBCAAIAhJDQQLIAYQIyIAIAJHDQEMBQsgBiACayAIcSIGECMiAiAAKAIAIAAoAgRqRg0BIAIhAAsgAEF/Rg0BIAVBMGogBk0EQCAAIQIMBAtBgBwoAgAiAiADIAZrakEAIAJrcSICECNBf0YNASACIAZqIQYgACECDAMLIAJBf0cNAgtB3BtB3BsoAgBBBHI2AgALIAEQIyECQQAQIyEAIAJBf0YNBSAAQX9GDQUgACACTQ0FIAAgAmsiBiAFQShqTQ0FC0HQG0HQGygCACAGaiIANgIAQdQbKAIAIABJBEBB1BsgADYCAAsCQEG4GCgCACIDBEBB4BshAANAIAIgACgCACIBIAAoAgQiBGpGDQIgACgCCCIADQALDAQLQbAYKAIAIgBBACAAIAJNG0UEQEGwGCACNgIAC0EAIQBB5BsgBjYCAEHgGyACNgIAQcAYQX82AgBBxBhB+BsoAgA2AgBB7BtBADYCAANAIABBA3QiAUHQGGogAUHIGGoiBDYCACABQdQYaiAENgIAIABBAWoiAEEgRw0AC0GsGCAGQShrIgBBeCACa0EHcUEAIAJBCGpBB3EbIgFrIgQ2AgBBuBggASACaiIBNgIAIAEgBEEBcjYCBCAAIAJqQSg2AgRBvBhBiBwoAgA2AgAMBAsgAiADTQ0CIAEgA0sNAiAAKAIMQQhxDQIgACAEIAZqNgIEQbgYIANBeCADa0EHcUEAIANBCGpBB3EbIgBqIgE2AgBBrBhBrBgoAgAgBmoiAiAAayIANgIAIAEgAEEBcjYCBCACIANqQSg2AgRBvBhBiBwoAgA2AgAMAwtBACEEDAoLQQAhAgwIC0GwGCgCACACSwRAQbAYIAI2AgALIAIgBmohAUHgGyEAAkACQAJAA0AgASAAKAIARwRAIAAoAggiAA0BDAILCyAALQAMQQhxRQ0BC0HgGyEAA0AgAyAAKAIAIgFPBEAgASAAKAIEaiIEIANLDQMLIAAoAgghAAwACwALIAAgAjYCACAAIAAoAgQgBmo2AgQgAkF4IAJrQQdxQQAgAkEIakEHcRtqIgcgBUEDcjYCBCABQXggAWtBB3FBACABQQhqQQdxG2oiBiAFIAdqIgVrIQAgAyAGRgRAQbgYIAU2AgBBrBhBrBgoAgAgAGoiADYCACAFIABBAXI2AgQMCAtBtBgoAgAgBkYEQEG0GCAFNgIAQagYQagYKAIAIABqIgA2AgAgBSAAQQFyNgIEIAAgBWogADYCAAwICyAGKAIEIgNBA3FBAUcNBiADQXhxIQkgA0H/AU0EQCAGKAIMIgEgBigCCCICRgRAQaAYQaAYKAIAQX4gA0EDdndxNgIADAcLIAIgATYCDCABIAI2AggMBgsgBigCGCEIIAYgBigCDCICRwRAIAYoAggiASACNgIMIAIgATYCCAwFCyAGQRRqIgEoAgAiA0UEQCAGKAIQIgNFDQQgBkEQaiEBCwNAIAEhBCADIgJBFGoiASgCACIDDQAgAkEQaiEBIAIoAhAiAw0ACyAEQQA2AgAMBAtBrBggBkEoayIAQXggAmtBB3FBACACQQhqQQdxGyIBayIINgIAQbgYIAEgAmoiATYCACABIAhBAXI2AgQgACACakEoNgIEQbwYQYgcKAIANgIAIAMgBEEnIARrQQdxQQAgBEEna0EHcRtqQS9rIgAgACADQRBqSRsiAUEbNgIEIAFB6BspAgA3AhAgAUHgGykCADcCCEHoGyABQQhqNgIAQeQbIAY2AgBB4BsgAjYCAEHsG0EANgIAIAFBGGohAANAIABBBzYCBCAAQQhqIQIgAEEEaiEAIAIgBEkNAAsgASADRg0AIAEgASgCBEF+cTYCBCADIAEgA2siAkEBcjYCBCABIAI2AgAgAkH/AU0EQCACQXhxQcgYaiEAAn9BoBgoAgAiAUEBIAJBA3Z0IgJxRQRAQaAYIAEgAnI2AgAgAAwBCyAAKAIICyEBIAAgAzYCCCABIAM2AgwgAyAANgIMIAMgATYCCAwBC0EfIQAgAkH///8HTQRAIAJBJiACQQh2ZyIAa3ZBAXEgAEEBdGtBPmohAAsgAyAANgIcIANCADcCECAAQQJ0QdAaaiEBAkACQEGkGCgCACIEQQEgAHQiBnFFBEBBpBggBCAGcjYCACABIAM2AgAMAQsgAkEZIABBAXZrQQAgAEEfRxt0IQAgASgCACEEA0AgBCIBKAIEQXhxIAJGDQIgAEEddiEEIABBAXQhACABIARBBHFqIgYoAhAiBA0ACyAGIAM2AhALIAMgATYCGCADIAM2AgwgAyADNgIIDAELIAEoAggiACADNgIMIAEgAzYCCCADQQA2AhggAyABNgIMIAMgADYCCAtBrBgoAgAiACAFTQ0AQawYIAAgBWsiATYCAEG4GEG4GCgCACIAIAVqIgI2AgAgAiABQQFyNgIEIAAgBUEDcjYCBCAAQQhqIQAMCAtBnBhBMDYCAEEAIQAMBwtBACECCyAIRQ0AAkAgBigCHCIBQQJ0QdAaaiIEKAIAIAZGBEAgBCACNgIAIAINAUGkGEGkGCgCAEF+IAF3cTYCAAwCCyAIQRBBFCAIKAIQIAZGG2ogAjYCACACRQ0BCyACIAg2AhggBigCECIBBEAgAiABNgIQIAEgAjYCGAsgBigCFCIBRQ0AIAIgATYCFCABIAI2AhgLIAAgCWohACAGIAlqIgYoAgQhAwsgBiADQX5xNgIEIAUgAEEBcjYCBCAAIAVqIAA2AgAgAEH/AU0EQCAAQXhxQcgYaiEBAn9BoBgoAgAiAkEBIABBA3Z0IgBxRQRAQaAYIAAgAnI2AgAgAQwBCyABKAIICyEAIAEgBTYCCCAAIAU2AgwgBSABNgIMIAUgADYCCAwBC0EfIQMgAEH///8HTQRAIABBJiAAQQh2ZyIBa3ZBAXEgAUEBdGtBPmohAwsgBSADNgIcIAVCADcCECADQQJ0QdAaaiEBAkACQEGkGCgCACICQQEgA3QiBHFFBEBBpBggAiAEcjYCACABIAU2AgAMAQsgAEEZIANBAXZrQQAgA0EfRxt0IQMgASgCACECA0AgAiIBKAIEQXhxIABGDQIgA0EddiECIANBAXQhAyABIAJBBHFqIgQoAhAiAg0ACyAEIAU2AhALIAUgATYCGCAFIAU2AgwgBSAFNgIIDAELIAEoAggiACAFNgIMIAEgBTYCCCAFQQA2AhggBSABNgIMIAUgADYCCAsgB0EIaiEADAILAkAgB0UNAAJAIAQoAhwiAEECdEHQGmoiASgCACAERgRAIAEgAjYCACACDQFBpBggCEF+IAB3cSIINgIADAILIAdBEEEUIAcoAhAgBEYbaiACNgIAIAJFDQELIAIgBzYCGCAEKAIQIgAEQCACIAA2AhAgACACNgIYCyAEKAIUIgBFDQAgAiAANgIUIAAgAjYCGAsCQCADQQ9NBEAgBCADIAVqIgBBA3I2AgQgACAEaiIAIAAoAgRBAXI2AgQMAQsgBCAFQQNyNgIEIAQgBWoiAiADQQFyNgIEIAIgA2ogAzYCACADQf8BTQRAIANBeHFByBhqIQACf0GgGCgCACIBQQEgA0EDdnQiA3FFBEBBoBggASADcjYCACAADAELIAAoAggLIQEgACACNgIIIAEgAjYCDCACIAA2AgwgAiABNgIIDAELQR8hACADQf///wdNBEAgA0EmIANBCHZnIgBrdkEBcSAAQQF0a0E+aiEACyACIAA2AhwgAkIANwIQIABBAnRB0BpqIQECQAJAIAhBASAAdCIGcUUEQEGkGCAGIAhyNgIAIAEgAjYCAAwBCyADQRkgAEEBdmtBACAAQR9HG3QhACABKAIAIQUDQCAFIgEoAgRBeHEgA0YNAiAAQR12IQYgAEEBdCEAIAEgBkEEcWoiBigCECIFDQALIAYgAjYCEAsgAiABNgIYIAIgAjYCDCACIAI2AggMAQsgASgCCCIAIAI2AgwgASACNgIIIAJBADYCGCACIAE2AgwgAiAANgIICyAEQQhqIQAMAQsCQCAJRQ0AAkAgAigCHCIAQQJ0QdAaaiIBKAIAIAJGBEAgASAENgIAIAQNAUGkGCAKQX4gAHdxNgIADAILIAlBEEEUIAkoAhAgAkYbaiAENgIAIARFDQELIAQgCTYCGCACKAIQIgAEQCAEIAA2AhAgACAENgIYCyACKAIUIgBFDQAgBCAANgIUIAAgBDYCGAsCQCADQQ9NBEAgAiADIAVqIgBBA3I2AgQgACACaiIAIAAoAgRBAXI2AgQMAQsgAiAFQQNyNgIEIAIgBWoiBCADQQFyNgIEIAMgBGogAzYCACAHBEAgB0F4cUHIGGohAEG0GCgCACEBAn9BASAHQQN2dCIFIAZxRQRAQaAYIAUgBnI2AgAgAAwBCyAAKAIICyEGIAAgATYCCCAGIAE2AgwgASAANgIMIAEgBjYCCAtBtBggBDYCAEGoGCADNgIACyACQQhqIQALIAtBEGokACAAC/wDAQJ/IAJBgARPBEAgACABIAIQAw8LIAAgAmohAwJAIAAgAXNBA3FFBEACQCAAQQNxRQRAIAAhAgwBCyACRQRAIAAhAgwBCyAAIQIDQCACIAEtAAA6AAAgAUEBaiEBIAJBAWoiAkEDcUUNASACIANJDQALCwJAIANBfHEiAEHAAEkNACACIABBQGoiBEsNAANAIAIgASgCADYCACACIAEoAgQ2AgQgAiABKAIINgIIIAIgASgCDDYCDCACIAEoAhA2AhAgAiABKAIUNgIUIAIgASgCGDYCGCACIAEoAhw2AhwgAiABKAIgNgIgIAIgASgCJDYCJCACIAEoAig2AiggAiABKAIsNgIsIAIgASgCMDYCMCACIAEoAjQ2AjQgAiABKAI4NgI4IAIgASgCPDYCPCABQUBrIQEgAkFAayICIARNDQALCyAAIAJNDQEDQCACIAEoAgA2AgAgAUEEaiEBIAJBBGoiAiAASQ0ACwwBCyADQQRJBEAgACECDAELIAAgA0EEayIESwRAIAAhAgwBCyAAIQIDQCACIAEtAAA6AAAgAiABLQABOgABIAIgAS0AAjoAAiACIAEtAAM6AAMgAUEEaiEBIAJBBGoiAiAETQ0ACwsgAiADSQRAA0AgAiABLQAAOgAAIAFBAWohASACQQFqIgIgA0cNAAsLC3oAIAAgASACEAUgAEGACGogASACQYAIahAFIABBgBBqIAEgAkGAEGoQBSAAQYAYaiABIAJBgBhqEAUgAEGAIGogASACQYAgahAFIABBgChqIAEgAkGAKGoQBSAAQYAwaiABIAJBgDBqEAUgAEGAOGogASACQYA4ahAFCz4AIAAQByAAQYAIahAHIABBgBBqEAcgAEGAGGoQByAAQYAgahAHIABBgChqEAcgAEGAMGoQByAAQYA4ahAHCz4AIAAQHSAAQYAIahAdIABBgBBqEB0gAEGAGGoQHSAAQYAgahAdIABBgChqEB0gAEGAMGoQHSAAQYA4ahAdC4ABACAAIAEgAhARIABBgAhqIAFBgDhqIAIQESAAQYAQaiABQYDwAGogAhARIABBgBhqIAFBgKgBaiACEBEgAEGAIGogAUGA4AFqIAIQESAAQYAoaiABQYCYAmogAhARIABBgDBqIAFBgNACaiACEBEgAEGAOGogAUGAiANqIAIQEQv+BQAgACABQQAQBCAAQYAIaiABQQEQBCAAQYAQaiABQQIQBCAAQYAYaiABQQMQBCAAQYAgaiABQQQQBCAAQYAoaiABQQUQBCAAQYAwaiABQQYQBCAAQYA4aiABQYACEAQgAEGAQGsgAUGBAhAEIABBgMgAaiABQYICEAQgAEGA0ABqIAFBgwIQBCAAQYDYAGogAUGEAhAEIABBgOAAaiABQYUCEAQgAEGA6ABqIAFBhgIQBCAAQYDwAGogAUGABBAEIABBgPgAaiABQYEEEAQgAEGAgAFqIAFBggQQBCAAQYCIAWogAUGDBBAEIABBgJABaiABQYQEEAQgAEGAmAFqIAFBhQQQBCAAQYCgAWogAUGGBBAEIABBgKgBaiABQYAGEAQgAEGAsAFqIAFBgQYQBCAAQYC4AWogAUGCBhAEIABBgMABaiABQYMGEAQgAEGAyAFqIAFBhAYQBCAAQYDQAWogAUGFBhAEIABBgNgBaiABQYYGEAQgAEGA4AFqIAFBgAgQBCAAQYDoAWogAUGBCBAEIABBgPABaiABQYIIEAQgAEGA+AFqIAFBgwgQBCAAQYCAAmogAUGECBAEIABBgIgCaiABQYUIEAQgAEGAkAJqIAFBhggQBCAAQYCYAmogAUGAChAEIABBgKACaiABQYEKEAQgAEGAqAJqIAFBggoQBCAAQYCwAmogAUGDChAEIABBgLgCaiABQYQKEAQgAEGAwAJqIAFBhQoQBCAAQYDIAmogAUGGChAEIABBgNACaiABQYAMEAQgAEGA2AJqIAFBgQwQBCAAQYDgAmogAUGCDBAEIABBgOgCaiABQYMMEAQgAEGA8AJqIAFBhAwQBCAAQYD4AmogAUGFDBAEIABBgIADaiABQYYMEAQgAEGAiANqIAFBgA4QBCAAQYCQA2ogAUGBDhAEIABBgJgDaiABQYIOEAQgAEGAoANqIAFBgw4QBCAAQYCoA2ogAUGEDhAEIABBgLADaiABQYUOEAQgAEGAuANqIAFBhg4QBAsDAAELNwEBfyMAQRBrIgMkACADIAI7AA4gABAhIAAgAUHAABAOIAAgA0EOakECEA4gABAiIANBEGokAAtqACAAIAEQEiAAQYABaiABQYAIahASIABBgAJqIAFBgBBqEBIgAEGAA2ogAUGAGGoQEiAAQYAEaiABQYAgahASIABBgAVqIAFBgChqEBIgAEGABmogAUGAMGoQEiAAQYAHaiABQYA4ahASC8kCAgd/A34gAigCACEDAn9BACABRQ0AGiABrSEMA0AgCqciAiAKIAMpA8gBIgtaDQEaIAAgAmogAyAKIAt9IgunQagBakF4cWopAwAgC0IDhog8AAAgCkIBfCIKIAxSDQALIAELIQIgAyADKQPIASACrX03A8gBIAEgAmsiBQRAIAAgAmohAANAIAMQJUGoASAFIAVBqAFPGyIEQQFxIQZBACECIARBAUcEQCAEQf4BcSEHQQAhAQNAIAAgAmogAyACQXhxaiIIKQMAIAJBA3RBMHGtiDwAACAAIAJBAXIiCWogCCkDACAJQQN0QThxrYg8AAAgAkECaiECIAFBAmoiASAHRw0ACwsgBgRAIAAgAmogAyACQXhxaikDACACQQN0QThxrYg8AAALIANBqAEgBGutNwPIASAAIARqIQAgBSAEayIFDQALCwtsAQF/QQEhAgJAIAAgARALDQAgAEGACGogARALDQAgAEGAEGogARALDQAgAEGAGGogARALDQAgAEGAIGogARALDQAgAEGAKGogARALDQAgAEGAMGogARALDQAgAEGAOGogARALQQBHIQILIAILlgEAIAAgASACEBwgAEGACGogAUGACGogAkGACGoQHCAAQYAQaiABQYAQaiACQYAQahAcIABBgBhqIAFBgBhqIAJBgBhqEBwgAEGAIGogAUGAIGogAkGAIGoQHCAAQYAoaiABQYAoaiACQYAoahAcIABBgDBqIAFBgDBqIAJBgDBqEBwgAEGAOGogAUGAOGogAkGAOGoQHAuWAQAgACABIAIQBiAAQYAIaiABQYAIaiACQYAIahAGIABBgBBqIAFBgBBqIAJBgBBqEAYgAEGAGGogAUGAGGogAkGAGGoQBiAAQYAgaiABQYAgaiACQYAgahAGIABBgChqIAFBgChqIAJBgChqEAYgAEGAMGogAUGAMGogAkGAMGoQBiAAQYA4aiABQYA4aiACQYA4ahAGC24BAX9BASEBAkAgAEGI/x8QCw0AIABBgAhqQYj/HxALDQAgAEGAEGpBiP8fEAsNACAAQYAYakGI/x8QCw0AIABBgCBqQYj/HxALDQAgAEGAKGpBiP8fEAsNACAAQYAwakGI/x8QC0EARyEBCyABC4EDAgd+AX8gAa0iBiAAKQPIASIEIAOtIgh8WARAA0BBACELQgAhBSABIASnRwRAA0AgACAEIAV8IgSnQXhxaiILIAspAwAgAiAFp2oxAAAgBEIDhoaFNwMAIAVCAXwiBSABIAApA8gBIgSnayILrVQNAAsLIABCADcDyAEgABAlIAIgC2ohAiAAKQPIASIEIAMgC2siA60iCHwgBloNAAsLIAAgAwR+IAOtIgRCAYMhBkIAIQUgA0EBRwRAIARC/v///w+DIQlCACEEA0AgACAAKQPIASAFfCIHp0F4cWoiASABKQMAIAIgBadqMQAAIAdCA4aGhTcDACAAIAVCAYQiByAAKQPIAXwiCqdBeHFqIgEgASkDACACIAenajEAACAKQgOGhoU3AwAgBUICfCEFIARCAnwiBCAJUg0ACwsgBqcEQCAAIAApA8gBIAV8IgSnQXhxaiIBIAEpAwAgAiAFp2oxAAAgBEIDhoaFNwMACyAAKQPIAQUgBAsgCHw3A8gBC9IBAgN/AX4jAEGgAWsiAyQAIANBDGoiAhAhIAIgAUEgEA4gAhAiIANBEGpBiAEgAhAPIAMpAxAhBSAAQYAIECQhBEHEASEAQQghAQNAIAFBiAFPBEAgA0EQakGIASADQQxqEA9BACEBCyADQRBqIAFqIQIgAUEBaiEBIAAgAi0AACICSQ0AIAQgAEECdGogBCACQQJ0aiICKAIANgIAIAJBASAFp0EBdEECcWs2AgAgBUIBiCEFIABBAWoiAEGAAkcNAAsgA0EMahAQIANBoAFqJAALEAAgACgCAEGoASABIAIQOgvqEAELfyACQQJqIQYgAi8BACECIAMhBSMAQbDJBWsiBCQAQX8hDAJAIAJB8yNHDQAgBEGQwQVqIgIgBS0AADoAACACIAUtAAE6AAEgAiAFLQACOgACIAIgBS0AAzoAAyACIAUtAAQ6AAQgAiAFLQAFOgAFIAIgBS0ABjoABiACIAUtAAc6AAcgAiAFLQAIOgAIIAIgBS0ACToACSACIAUtAAo6AAogAiAFLQALOgALIAIgBS0ADDoADCACIAUtAA06AA0gAiAFLQAOOgAOIAIgBS0ADzoADyACIAUtABA6ABAgAiAFLQAROgARIAIgBS0AEjoAEiACIAUtABM6ABMgAiAFLQAUOgAUIAIgBS0AFToAFSACIAUtABY6ABYgAiAFLQAXOgAXIAIgBS0AGDoAGCACIAUtABk6ABkgAiAFLQAaOgAaIAIgBS0AGzoAGyACIAUtABw6ABwgAiAFLQAdOgAdIAIgBS0AHjoAHiACIAUtAB86AB8gBEGQgAFqIgIgBUEgahAVIAJBgAhqIAVB4AJqEBUgAkGAEGogBUGgBWoQFSACQYAYaiAFQeAHahAVIAJBgCBqIAVBoApqEBUgAkGAKGogBUHgDGoQFSACQYAwaiAFQaAPahAVIAJBgDhqIAVB4BFqEBUgBEEQaiEHIARBsMAFaiICIAYtAAA6AAAgAiAGLQABOgABIAIgBi0AAjoAAiACIAYtAAM6AAMgAiAGLQAEOgAEIAIgBi0ABToABSACIAYtAAY6AAYgAiAGLQAHOgAHIAIgBi0ACDoACCACIAYtAAk6AAkgAiAGLQAKOgAKIAIgBi0ACzoACyACIAYtAAw6AAwgAiAGLQANOgANIAIgBi0ADjoADiACIAYtAA86AA8gAiAGLQAQOgAQIAIgBi0AEToAESACIAYtABI6ABIgAiAGLQATOgATIAIgBi0AFDoAFCACIAYtABU6ABUgAiAGLQAWOgAWIAIgBi0AFzoAFyACIAYtABg6ABggAiAGLQAZOgAZIAIgBi0AGjoAGiACIAYtABs6ABsgAiAGLQAcOgAcIAIgBi0AHToAHSACIAYtAB46AB4gAiAGLQAfOgAfIARBkMABaiICIAZBIGoQHyACQYAIaiAGQaAFahAfIAJBgBBqIAZBoApqEB8gAkGAGGogBkGgD2oQHyACQYAgaiAGQaAUahAfIAJBgChqIAZBoBlqEB8gAkGAMGogBkGgHmoQHyAGQaAjaiEJQQEhC0EAIQMCQANAIAMhAiAHIAhBCnRqQYAIECQhDSAIIAlqIg4tAEsiA0HLAEsNASACIANLDQECQCACIANPDQAgDSACIAlqLQAAQQJ0akEBNgIAIAJBAWoiCiAOLQBLIgNPDQADQCAJIApqIgMtAAAhBiACIApJBEAgBiADQQFrLQAATQ0ECyANIAZBAnRqQQE2AgAgCkEBaiIKIA4tAEsiA0kNAAsLIAhBAWoiCEEIRw0AC0EAIQsgA0HLAE8NAANAIAMgCWotAABFBEAgA0EBaiIDQcsARw0BDAILC0EBIQsLIAsNACAEQZDAAWoQOQ0AIARB0MAFaiIDQSAgBUGgFBApIARBDGoiBRAhIAUgA0EgEA4gBSAAIAEQDiAFECIgA0HAACAFEA8gBRAQIARBkLgFaiICIARBsMAFahA7IARBkPgBaiIBIARBkMEFahAxIARBkMABaiIAECggBEGQwABqIgcgASAAEDAgAhAHIARBkIABaiIAEBsgAEGACGoQGyAAQYAQahAbIABBgBhqEBsgAEGAIGoQGyAAQYAoahAbIABBgDBqEBsgAEGAOGoQGyAAEC4gACACIAAQLSAHIAcgABA3IAcQJyAHECYgBxAvIAcgByAEQRBqIgEQFyAHQYAIaiIAIAAgAUGACGoQFyAHQYAQaiIAIAAgAUGAEGoQFyAHQYAYaiIAIAAgAUGAGGoQFyAHQYAgaiIAIAAgAUGAIGoQFyAHQYAoaiIAIAAgAUGAKGoQFyAHQYAwaiIAIAAgAUGAMGoQFyAHQYA4aiIAIAAgAUGAOGoQFyAEQbDBBWoiACAHEDQgBRAhIAUgA0HAABAOIAUgAEGACBAOIAUQIiAEQZDABWpBICAFEA8gBRAQIAQtALDABSAELQCQwAVHDQAgBC0AscAFIAQtAJHABUcNACAELQCywAUgBC0AksAFRw0AIAQtALPABSAELQCTwAVHDQAgBC0AtMAFIAQtAJTABUcNACAELQC1wAUgBC0AlcAFRw0AIAQtALbABSAELQCWwAVHDQAgBC0At8AFIAQtAJfABUcNACAELQC4wAUgBC0AmMAFRw0AIAQtALnABSAELQCZwAVHDQAgBC0AusAFIAQtAJrABUcNACAELQC7wAUgBC0Am8AFRw0AIAQtALzABSAELQCcwAVHDQAgBC0AvcAFIAQtAJ3ABUcNACAELQC+wAUgBC0AnsAFRw0AIAQtAL/ABSAELQCfwAVHDQAgBC0AwMAFIAQtAKDABUcNACAELQDBwAUgBC0AocAFRw0AIAQtAMLABSAELQCiwAVHDQAgBC0Aw8AFIAQtAKPABUcNACAELQDEwAUgBC0ApMAFRw0AIAQtAMXABSAELQClwAVHDQAgBC0AxsAFIAQtAKbABUcNACAELQDHwAUgBC0Ap8AFRw0AIAQtAMjABSAELQCowAVHDQAgBC0AycAFIAQtAKnABUcNACAELQDKwAUgBC0AqsAFRw0AIAQtAMvABSAELQCrwAVHDQAgBC0AzMAFIAQtAKzABUcNACAELQDNwAUgBC0ArcAFRw0AIAQtAM7ABSAELQCuwAVHDQBBf0EAIAQtAM/ABSAELQCvwAVHGyEMCyAEQbDJBWokACAMC4sdARN/IwBBEGsiDiQAIABBAmohBSMAQfCxB2siByQAIAdBkLAHaiIGIgQgAy0AADoAACAEIAMtAAE6AAEgBCADLQACOgACIAQgAy0AAzoAAyAEIAMtAAQ6AAQgBCADLQAFOgAFIAQgAy0ABjoABiAEIAMtAAc6AAcgBCADLQAIOgAIIAQgAy0ACToACSAEIAMtAAo6AAogBCADLQALOgALIAQgAy0ADDoADCAEIAMtAA06AA0gBCADLQAOOgAOIAQgAy0ADzoADyAEIAMtABA6ABAgBCADLQAROgARIAQgAy0AEjoAEiAEIAMtABM6ABMgBCADLQAUOgAUIAQgAy0AFToAFSAEIAMtABY6ABYgBCADLQAXOgAXIAQgAy0AGDoAGCAEIAMtABk6ABkgBCADLQAaOgAaIAQgAy0AGzoAGyAEIAMtABw6ABwgBCADLQAdOgAdIAQgAy0AHjoAHiAEIAMtAB86AB8gB0HQsAdqIgkiBCADLQAgOgAAIAQgAy0AIToAASAEIAMtACI6AAIgBCADLQAjOgADIAQgAy0AJDoABCAEIAMtACU6AAUgBCADLQAmOgAGIAQgAy0AJzoAByAEIAMtACg6AAggBCADLQApOgAJIAQgAy0AKjoACiAEIAMtACs6AAsgBCADLQAsOgAMIAQgAy0ALToADSAEIAMtAC46AA4gBCADLQAvOgAPIAQgAy0AMDoAECAEIAMtADE6ABEgBCADLQAyOgASIAQgAy0AMzoAEyAEIAMtADQ6ABQgBCADLQA1OgAVIAQgAy0ANjoAFiAEIAMtADc6ABcgBCADLQA4OgAYIAQgAy0AOToAGSAEIAMtADo6ABogBCADLQA7OgAbIAQgAy0APDoAHCAEIAMtAD06AB0gBCADLQA+OgAeIAQgAy0APzoAHyAHQbCwB2oiCCIEIAMtAEA6AAAgBCADLQBBOgABIAQgAy0AQjoAAiAEIAMtAEM6AAMgBCADLQBEOgAEIAQgAy0ARToABSAEIAMtAEY6AAYgBCADLQBHOgAHIAQgAy0ASDoACCAEIAMtAEk6AAkgBCADLQBKOgAKIAQgAy0ASzoACyAEIAMtAEw6AAwgBCADLQBNOgANIAQgAy0ATjoADiAEIAMtAE86AA8gBCADLQBQOgAQIAQgAy0AUToAESAEIAMtAFI6ABIgBCADLQBTOgATIAQgAy0AVDoAFCAEIAMtAFU6ABUgBCADLQBWOgAWIAQgAy0AVzoAFyAEIAMtAFg6ABggBCADLQBZOgAZIAQgAy0AWjoAGiAEIAMtAFs6ABsgBCADLQBcOgAcIAQgAy0AXToAHSAEIAMtAF46AB4gBCADLQBfOgAfIAdBkLgDaiIKIgQgA0HgAGoQCCAEQYAIaiADQcABahAIIARBgBBqIANBoAJqEAggBEGAGGogA0GAA2oQCCAEQYAgaiADQeADahAIIARBgChqIANBwARqEAggBEGAMGogA0GgBWoQCCAHQZDIAWoiCyIEIANBgAZqEAggBEGACGogA0HgBmoQCCAEQYAQaiADQcAHahAIIARBgBhqIANBoAhqEAggBEGAIGogA0GACWoQCCAEQYAoaiADQeAJahAIIARBgDBqIANBwApqEAggBEGAOGogA0GgC2oQCCAHQZCIAmoiBCADQYAMahATIARBgAhqIANBoA9qEBMgBEGAEGogA0HAEmoQEyAEQYAYaiADQeAVahATIARBgCBqIANBgBlqEBMgBEGAKGogA0GgHGoQEyAEQYAwaiADQcAfahATIARBgDhqIANB4CJqEBMgB0EMaiIDECEgAyAIQSAQDiADIAEgAhAOIAMQIiAHQfCwB2oiEEHAACADEA8gAxAQIAdBsLEHaiIIQcAAIAlB4AAQKSAHQZDwA2ogBhAxIAoQKCALEC4gBBAuA0AgB0GQgANqIgMgCCAPQf//A3FBB2wiAUH//wNxECAgA0GACGoiESAIIAFBAWpB//8DcRAgIANBgBBqIhIgCCABQQJqQf//A3EQICADQYAYaiITIAggAUEDakH//wNxECAgA0GAIGoiFCAIIAFBBGpB//8DcRAgIANBgChqIhUgCCABQQVqQf//A3EQICADQYAwaiIWIAggAUEGakH//wNxECAgB0GQyAJqIgEgA0GAOBAsIAEQKCAHQZCIAWoiAiAHQZDwA2ogARAwIAIQJyACECYgAhAvIAIgB0GQyABqIgQgAhAZIAJBgAhqIgYgBEGACGogBhAZIAJBgBBqIgYgBEGAEGogBhAZIAJBgBhqIgYgBEGAGGogBhAZIAJBgCBqIgYgBEGAIGogBhAZIAJBgChqIgYgBEGAKGogBhAZIAJBgDBqIgYgBEGAMGogBhAZIAJBgDhqIgYgBEGAOGogBhAZIAUgAhA0IAdBDGoiAhAhIAIgEEHAABAOIAIgBUGACBAOIAIQIiAFQSAgAhAPIAIQECAHQRBqIgIgBRA7IA9BAWohDyACEAcgASACIAdBkLgDaiIEEAUgAUGACGoiBiACIARBgAhqEAUgAUGAEGoiCSACIARBgBBqEAUgAUGAGGoiCiACIARBgBhqEAUgAUGAIGoiCyACIARBgCBqEAUgAUGAKGoiDCACIARBgChqEAUgAUGAMGoiDSACIARBgDBqEAUgARANIAYQDSAJEA0gChANIAsQDSAMEA0gDRANIAEgASADEAYgBiAGIBEQBiAJIAkgEhAGIAogCiATEAYgCyALIBQQBiAMIAwgFRAGIA0gDSAWEAYgARAMIAYQDCAJEAwgChAMIAsQDCAMEAwgDRAMIAEQOQ0AIAdBkAhqIgIgB0EQaiAHQZDIAWoQLSACECYgB0GQyABqIgEgASACEDcgARAnIAFBiP0PEDYNACAHQZAIaiIBIAdBEGogB0GQiAJqEC0gARAmIAEQJyABQYD+DxA2DQAgB0GQyABqIgEgASAHQZAIaiICEDggAiABIAdBkIgBaiIDEBghBCACQYAIaiABQYAIaiADQYAIahAYIQYgAkGAEGogAUGAEGogA0GAEGoQGCEJIAJBgBhqIAFBgBhqIANBgBhqEBghCiACQYAgaiABQYAgaiADQYAgahAYIQsgAkGAKGogAUGAKGogA0GAKGoQGCEMIAJBgDBqIAFBgDBqIANBgDBqEBghDSACQYA4aiABQYA4aiADQYA4ahAYIA0gDCALIAogCSAEIAZqampqampqQcsASw0ACyAHQZAIaiEEIAUgBS0AADoAACAFIAUtAAE6AAEgBSAFLQACOgACIAUgBS0AAzoAAyAFIAUtAAQ6AAQgBSAFLQAFOgAFIAUgBS0ABjoABiAFIAUtAAc6AAcgBSAFLQAIOgAIIAUgBS0ACToACSAFIAUtAAo6AAogBSAFLQALOgALIAUgBS0ADDoADCAFIAUtAA06AA0gBSAFLQAOOgAOIAUgBS0ADzoADyAFIAUtABA6ABAgBSAFLQAROgARIAUgBS0AEjoAEiAFIAUtABM6ABMgBSAFLQAUOgAUIAUgBS0AFToAFSAFIAUtABY6ABYgBSAFLQAXOgAXIAUgBS0AGDoAGCAFIAUtABk6ABkgBSAFLQAaOgAaIAUgBS0AGzoAGyAFIAUtABw6ABwgBSAFLQAdOgAdIAUgBS0AHjoAHiAFIAUtAB86AB8gBUEgaiAHQZDIAmoiARAeIAVBoAVqIAFBgAhqEB4gBUGgCmogAUGAEGoQHiAFQaAPaiABQYAYahAeIAVBoBRqIAFBgCBqEB4gBUGgGWogAUGAKGoQHiAFQaAeaiABQYAwahAeQQAhASAFQaAjakHTABAkIQNBACECA0AgBCACQQJ0aigCAARAIAEgA2ogAjoAACABQQFqIQELIAQgAkEBciIIQQJ0aigCAARAIAEgA2ogCDoAACABQQFqIQELIAJBAmoiAkGAAkcNAAsgBSABOgDrIyAEQYAIaiEIQQAhAgNAIAggAkECdGooAgAEQCABIANqIAI6AAAgAUEBaiEBCyAIIAJBAXIiBkECdGooAgAEQCABIANqIAY6AAAgAUEBaiEBCyACQQJqIgJBgAJHDQALIAUgAToA7CMgBEGAEGohCEEAIQIDQCAIIAJBAnRqKAIABEAgASADaiACOgAAIAFBAWohAQsgCCACQQFyIgZBAnRqKAIABEAgASADaiAGOgAAIAFBAWohAQsgAkECaiICQYACRw0ACyAFIAE6AO0jIARBgBhqIQhBACECA0AgCCACQQJ0aigCAARAIAEgA2ogAjoAACABQQFqIQELIAggAkEBciIGQQJ0aigCAARAIAEgA2ogBjoAACABQQFqIQELIAJBAmoiAkGAAkcNAAsgBSABOgDuIyAEQYAgaiEIQQAhAgNAIAggAkECdGooAgAEQCABIANqIAI6AAAgAUEBaiEBCyAIIAJBAXIiBkECdGooAgAEQCABIANqIAY6AAAgAUEBaiEBCyACQQJqIgJBgAJHDQALIAUgAToA7yMgBEGAKGohCEEAIQIDQCAIIAJBAnRqKAIABEAgASADaiACOgAAIAFBAWohAQsgCCACQQFyIgZBAnRqKAIABEAgASADaiAGOgAAIAFBAWohAQsgAkECaiICQYACRw0ACyAFIAE6APAjIARBgDBqIQhBACECA0AgCCACQQJ0aigCAARAIAEgA2ogAjoAACABQQFqIQELIAggAkEBciIGQQJ0aigCAARAIAEgA2ogBjoAACABQQFqIQELIAJBAmoiAkGAAkcNAAsgBSABOgDxIyAEQYA4aiEEQQAhAgNAIAQgAkECdGooAgAEQCABIANqIAI6AAAgAUEBaiEBCyAEIAJBAXIiCEECdGooAgAEQCABIANqIAg6AAAgAUEBaiEBCyACQQJqIgJBgAJHDQALIAUgAToA8iMgDkHzIzYCDCAHQfCxB2okACAAIA4oAgw7AQAgDkEQaiQAQQALghEBFH8jAEGg8QVrIgUkACAFQaDwBWohAiMAQRBrIgQkAANAIARBADoADyACIANqQaQSIARBD2pBABABOgAAIANBAWoiA0EgRw0ACyAEQRBqJAAgAkGAASACQSAQKSAFQYCwAmoiCCACEDEgBUGA+AFqIgYiBCAFQcDwBWoiA0EAEAogBEGACGogA0EBEAogBEGAEGogA0ECEAogBEGAGGogA0EDEAogBEGAIGogA0EEEAogBEGAKGogA0EFEAogBEGAMGogA0EGEAogBUGAgAFqIgQgA0EHEAogBEGACGogA0EIEAogBEGAEGogA0EJEAogBEGAGGogA0EKEAogBEGAIGogA0ELEAogBEGAKGogA0EMEAogBEGAMGogA0ENEAogBEGAOGoiDiADQQ4QCiAFQYDAAWoiByAGQYA4ECwgBxAoIAVBgEBrIgMgCCAHEDAgAxAnIAMQJiADIAMgBBA4IAMQLyADIAUgAxAaIANBgAhqIgcgBUGACGoiDyAHEBogA0GAEGoiCCAFQYAQaiIQIAgQGiADQYAYaiIJIAVBgBhqIhEgCRAaIANBgCBqIgogBUGAIGoiEiAKEBogA0GAKGoiCyAFQYAoaiITIAsQGiADQYAwaiIMIAVBgDBqIhQgDBAaIANBgDhqIg0gBUGAOGoiFSANEBogACACLQAAOgAAIAAgAi0AAToAASAAIAItAAI6AAIgACACLQADOgADIAAgAi0ABDoABCAAIAItAAU6AAUgACACLQAGOgAGIAAgAi0ABzoAByAAIAItAAg6AAggACACLQAJOgAJIAAgAi0ACjoACiAAIAItAAs6AAsgACACLQAMOgAMIAAgAi0ADToADSAAIAItAA46AA4gACACLQAPOgAPIAAgAi0AEDoAECAAIAItABE6ABEgACACLQASOgASIAAgAi0AEzoAEyAAIAItABQ6ABQgACACLQAVOgAVIAAgAi0AFjoAFiAAIAItABc6ABcgACACLQAYOgAYIAAgAi0AGToAGSAAIAItABo6ABogACACLQAbOgAbIAAgAi0AHDoAHCAAIAItAB06AB0gACACLQAeOgAeIAAgAi0AHzoAHyAAQSBqIAMQFiAAQeACaiAHEBYgAEGgBWogCBAWIABB4AdqIAkQFiAAQaAKaiAKEBYgAEHgDGogCxAWIABBoA9qIAwQFiAAQeARaiANEBYgBUGA8AVqIgNBICAAQaAUECkgASACLQAAOgAAIAEgAi0AAToAASABIAItAAI6AAIgASACLQADOgADIAEgAi0ABDoABCABIAItAAU6AAUgASACLQAGOgAGIAEgAi0ABzoAByABIAItAAg6AAggASACLQAJOgAJIAEgAi0ACjoACiABIAItAAs6AAsgASACLQAMOgAMIAEgAi0ADToADSABIAItAA46AA4gASACLQAPOgAPIAEgAi0AEDoAECABIAItABE6ABEgASACLQASOgASIAEgAi0AEzoAEyABIAItABQ6ABQgASACLQAVOgAVIAEgAi0AFjoAFiABIAItABc6ABcgASACLQAYOgAYIAEgAi0AGToAGSABIAItABo6ABogASACLQAbOgAbIAEgAi0AHDoAHCABIAItAB06AB0gASACLQAeOgAeIAEgAi0AHzoAHyABIAVBgPEFaiIALQAAOgAgIAEgAC0AAToAISABIAAtAAI6ACIgASAALQADOgAjIAEgAC0ABDoAJCABIAAtAAU6ACUgASAALQAGOgAmIAEgAC0ABzoAJyABIAAtAAg6ACggASAALQAJOgApIAEgAC0ACjoAKiABIAAtAAs6ACsgASAALQAMOgAsIAEgAC0ADToALSABIAAtAA46AC4gASAALQAPOgAvIAEgAC0AEDoAMCABIAAtABE6ADEgASAALQASOgAyIAEgAC0AEzoAMyABIAAtABQ6ADQgASAALQAVOgA1IAEgAC0AFjoANiABIAAtABc6ADcgASAALQAYOgA4IAEgAC0AGToAOSABIAAtABo6ADogASAALQAbOgA7IAEgAC0AHDoAPCABIAAtAB06AD0gASAALQAeOgA+IAEgAC0AHzoAPyABIAMtAAA6AEAgASADLQABOgBBIAEgAy0AAjoAQiABIAMtAAM6AEMgASADLQAEOgBEIAEgAy0ABToARSABIAMtAAY6AEYgASADLQAHOgBHIAEgAy0ACDoASCABIAMtAAk6AEkgASADLQAKOgBKIAEgAy0ACzoASyABIAMtAAw6AEwgASADLQANOgBNIAEgAy0ADjoATiABIAMtAA86AE8gASADLQAQOgBQIAEgAy0AEToAUSABIAMtABI6AFIgASADLQATOgBTIAEgAy0AFDoAVCABIAMtABU6AFUgASADLQAWOgBWIAEgAy0AFzoAVyABIAMtABg6AFggASADLQAZOgBZIAEgAy0AGjoAWiABIAMtABs6AFsgASADLQAcOgBcIAEgAy0AHToAXSABIAMtAB46AF4gASADLQAfOgBfIAFB4ABqIAYQCSABQcABaiAGQYAIahAJIAFBoAJqIAZBgBBqEAkgAUGAA2ogBkGAGGoQCSABQeADaiAGQYAgahAJIAFBwARqIAZBgChqEAkgAUGgBWogBkGAMGoQCSABQYAGaiAEEAkgAUHgBmogBEGACGoQCSABQcAHaiAEQYAQahAJIAFBoAhqIARBgBhqEAkgAUGACWogBEGAIGoQCSABQeAJaiAEQYAoahAJIAFBwApqIARBgDBqEAkgAUGgC2ogDhAJIAFBgAxqIAUQFCABQaAPaiAPEBQgAUHAEmogEBAUIAFB4BVqIBEQFCABQYAZaiASEBQgAUGgHGogExAUIAFBwB9qIBQQFCABQeAiaiAVEBQgBUGg8QVqJABBAAsFAEH1IwsFAEGAJgsFAEGgFAsoAQF/IwBBEGsiACQAIABBADoAD0HIEiAAQQ9qQQAQARogAEEQaiQACwunCgMAQYAIC1FyYW5kb21ieXRlcwBsaWJzb2RpdW0vc3JjL2xpYnNvZGl1bS9yYW5kb21ieXRlcy9yYW5kb21ieXRlcy5jAGJ1Zl9sZW4gPD0gU0laRV9NQVgAQeAIC78JAQAAAAAAAACCgAAAAAAAAIqAAAAAAACAAIAAgAAAAICLgAAAAAAAAAEAAIAAAAAAgYAAgAAAAIAJgAAAAAAAgIoAAAAAAAAAiAAAAAAAAAAJgACAAAAAAAoAAIAAAAAAi4AAgAAAAACLAAAAAAAAgImAAAAAAACAA4AAAAAAAIACgAAAAAAAgIAAAAAAAACACoAAAAAAAAAKAACAAAAAgIGAAIAAAACAgIAAAAAAAIABAACAAAAAAAiAAIAAAACAAAAAAPdkAAACMdj/AxX4/0SeAwAYIfT/KKHy/yQeBwAr3hsAK+kjAK2E+v9/FOD/dZovAAn70/9Jei8AJ+UoAFiWKQBwoA8ApIXv/4i3NgCQnff/oOru/2j5JwB709//1q3f/+caxf/3pOr/mPzN/zXQGgAitP//ATI9AMVFBABnSikAIHYBAM30LgDF3jUAA6Xm/ywwyf/UR9n/r747AIUVxf98jtH/loo2AEE+1P8ABDYATWr7/5zWIwBdxff/PRLm/9bq5v8efjUAWa/F/z+ENQAXVt//XJTn/4xzOACoYwwAmhsIAHaPDgBTODsANIU7ADD82P9UnR8ALU/V/+UGxP+BrOj/z+HH/xmY0f9d1un/7gk1AMc1IQC7z+f/dc/s/3KXHQBysMH/9rzw/4BSz/+u0s//4JDI/8rvAQDyEDQAhf7w/zjGIACfbikAo7fS/0ukx/9tuvn/CTTa/4LC9f8TQe3/O6b///cJ7P/dK/r/1JUUAGNFHABiLOr/6fvM//AKBAAXxAcAiEUvAACtAAC+Nu//RM0NAFpnPADKK8f/ft7//0g5GQDAac7/bHUkAN/H/P+hmAsACOjr/2zkAgAIyMn/wjYwAPa/4/+TPNv/4Er9/wUTFACSdxQAJZ4TAODQ5/9EmfP/Agjq/6Lu0f+cx8T/V6DI/9mXOgCT6h8AWv8zANRYIwD4QToAcv/M//s9IgCfq9r/IqTJ//USBACHJSUA8CTt/12bNQCgSMr//KLG/1a77f/eRc//Xr4NABpeHADm4A0AWn8MAIOPBwCKYuf/BFf///wG+P8hAPb/9lrQ/4QAHwCG7zAAfbnJ/9b89/+SRfT/wiHJ/xk5BQAMYQQAQc3a/xuwPgDncjQAOwDN/8d8GgAkGQMA5V4rAJkRKQA6etj/cU0TABzhPQCECRMAUfAlAEZaGAAYhcb/vhQTAJE4KACQ28n/iVDS/z+FHABLCx0Apvbv/76o6/8b4RIAPl7N/y8t6v/kHfn/xwYUAINyMgBuDeL/U3ns/5lAHQB4Jdn/rQXr/wXkFgDn2wsA6B0iAM/4MwA0uff/DMrU//h/5v9X0eP/G5HY/xIsx//YEAkAH17G/1hG4f+LHSUAt3MlAI98/f+Y3R0AmGgzALvUAgCnk+3/vmzP/xx8AgAIqhgAcf0tAKVcDACaNxkAZ6HH/z2M5P88odH/OcU1ABUBOwDAHQQA98QhAPQb8f/nNRoADjQHAEV9+f/QTBoArnzk/2gmHQCYjub/Mybv/9oF/P/bf8X/ZCfT/6/h3f/dk/n/CR3d/5PMAgAFGPH/KpwYAKnlyf9Qivf/LM87AE5D///fNuv/yhU8AGheFQC2FvP/zikeAEGgEgsDEA6A\")||(d=R,R=Q.locateFile?Q.locateFile(d,t):t+d);var L={2340:function(){return Q.getRandomValue()},2376:function(){if(void 0===Q.getRandomValue)try{var A=\"object\"===(\"undefined\"==typeof window?\"undefined\":g(window))?window:self,I=void 0!==A.crypto?A.crypto:A.msCrypto,C=function(){var A=new Uint32Array(1);return I.getRandomValues(A),A[0]>>>0};C(),Q.getRandomValue=C}catch(A){try{var B=eval(\"require\")(\"crypto\"),i=function(){var A=B.randomBytes(4);return(A[0]<<24|A[1]<<16|A[2]<<8|A[3])>>>0};i(),Q.getRandomValue=i}catch(A){throw\"No secure random number generator found\"}}}};function p(A){this.name=\"ExitStatus\",this.message=\"Program terminated with exit(\".concat(A,\")\"),this.status=A}var K=function(A){for(;A.length>0;)A.shift()(Q)};\"undefined\"!=typeof TextDecoder&&new TextDecoder(\"utf8\");var b,v=[],j=function(A,I,g){var C=function(A,I){var g;for(v.length=0,I>>=2;g=y[A++];)I+=105!=g&I,v.push(105==g?u[I]:s[I++>>1]),++I;return v}(I,g);return L[A].apply(null,C)},O=function(A){A,G||(Q.onExit&&Q.onExit(A),F=!0),E(A,new p(A))},T={b:function(A,I,g){return j(A,I,g)},d:function(A,I,g){return y.copyWithin(A,I,I+g)},c:function(A){y.length;U(\"OOM\")},a:function(A,I){A,O(A)}};(function(){var A={a:T};function I(A,I){var g,C,B=A.exports;return Q.asm=B,c=Q.asm.e,g=c.buffer,Q.HEAP8=h=new Int8Array(g),Q.HEAP16=new Int16Array(g),Q.HEAP32=u=new Int32Array(g),Q.HEAPU8=y=new Uint8Array(g),Q.HEAPU16=new Uint16Array(g),Q.HEAPU32=new Uint32Array(g),Q.HEAPF32=new Float32Array(g),Q.HEAPF64=s=new Float64Array(g),Q.asm.g,C=Q.asm.f,N.unshift(C),function(A){if(S--,Q.monitorRunDependencies&&Q.monitorRunDependencies(S),0==S&&(null!==k&&(clearInterval(k),k=null),H)){var I=H;H=null,I()}}(),B}if(S++,Q.monitorRunDependencies&&Q.monitorRunDependencies(S),Q.instantiateWasm)try{return Q.instantiateWasm(A,I)}catch(A){return D(\"Module.instantiateWasm callback failed with error: \"+A),!1}m(0,R,A,(function(A){I(A.instance)}))})(),Q._malloc=function(){return(Q._malloc=Q.asm.h).apply(null,arguments)},Q._free=function(){return(Q._free=Q.asm.i).apply(null,arguments)},Q._dilithiumjs_init=function(){return(Q._dilithiumjs_init=Q.asm.j).apply(null,arguments)},Q._dilithiumjs_public_key_bytes=function(){return(Q._dilithiumjs_public_key_bytes=Q.asm.k).apply(null,arguments)},Q._dilithiumjs_secret_key_bytes=function(){return(Q._dilithiumjs_secret_key_bytes=Q.asm.l).apply(null,arguments)},Q._dilithiumjs_signature_bytes=function(){return(Q._dilithiumjs_signature_bytes=Q.asm.m).apply(null,arguments)},Q._dilithiumjs_keypair=function(){return(Q._dilithiumjs_keypair=Q.asm.n).apply(null,arguments)},Q._dilithiumjs_sign=function(){return(Q._dilithiumjs_sign=Q.asm.o).apply(null,arguments)},Q._dilithiumjs_verify=function(){return(Q._dilithiumjs_verify=Q.asm.p).apply(null,arguments)};function x(A){if(J(A))return function(A){if(void 0!==r&&r){var I=Buffer.from(A,\"base64\");return new Uint8Array(I.buffer,I.byteOffset,I.byteLength)}try{for(var g=atob(A),C=new Uint8Array(g.length),B=0;B<g.length;++B)C[B]=g.charCodeAt(B);return C}catch(A){throw new Error(\"Converting base64 string to bytes failed.\")}}(A.slice(M.length))}function W(){function A(){b||(b=!0,Q.calledRun=!0,F||(!0,K(N),Q.onRuntimeInitialized&&Q.onRuntimeInitialized(),function(){if(Q.postRun)for(\"function\"==typeof Q.postRun&&(Q.postRun=[Q.postRun]);Q.postRun.length;)A=Q.postRun.shift(),w.unshift(A);var A;K(w)}()))}S>0||(!function(){if(Q.preRun)for(\"function\"==typeof Q.preRun&&(Q.preRun=[Q.preRun]);Q.preRun.length;)A=Q.preRun.shift(),Y.unshift(A);var A;K(Y)}(),S>0||(Q.setStatus?(Q.setStatus(\"Running...\"),setTimeout((function(){setTimeout((function(){Q.setStatus(\"\")}),1),A()}),1)):A()))}if(Q.writeArrayToMemory=function(A,I){h.set(A,I)},H=function A(){b||W(),b||(H=A)},Q.preInit)for(\"function\"==typeof Q.preInit&&(Q.preInit=[Q.preInit]);Q.preInit.length>0;)Q.preInit.pop()();W()})).catch((function(){function A(I){return A=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(A){return typeof A}:function(A){return A&&\"function\"==typeof Symbol&&A.constructor===Symbol&&A!==Symbol.prototype?\"symbol\":typeof A},A(I)}var I,g,C=void 0!==(C={})?C:{},B=Object.assign({},C),Q=function(A,I){throw I},i=\"object\"==(\"undefined\"==typeof window?\"undefined\":A(window)),E=\"function\"==typeof importScripts,o=\"object\"==(\"undefined\"==typeof process?\"undefined\":A(process))&&\"object\"==A(process.versions)&&\"string\"==typeof process.versions.node,n=\"\";if(o){var r=eval(\"require\")(\"fs\"),t=eval(\"require\")(\"path\");n=E?t.dirname(n)+\"/\":__dirname+\"/\",I=function(A,I){var g=P(A);return g?I?g:g.toString():(A=m(A)?new URL(A):t.normalize(A),r.readFileSync(A,I?void 0:\"utf8\"))},g=function(A){var g=I(A,!0);return g.buffer||(g=new Uint8Array(g)),g},function(A,I,g){var C=!(arguments.length>3&&void 0!==arguments[3])||arguments[3],B=P(A);B&&I(B),A=m(A)?new URL(A):t.normalize(A),r.readFile(A,C?void 0:\"utf8\",(function(A,B){A?g(A):I(C?B.buffer:B)}))},!C.thisProgram&&process.argv.length>1&&process.argv[1].replace(/\\\\/g,\"/\"),process.argv.slice(2),\"undefined\"!=typeof module&&(module.exports=C),process.on(\"uncaughtException\",(function(A){if(!(\"unwind\"===A||A instanceof b||A.context instanceof b))throw A})),Q=function(A,I){throw process.exitCode=A,I},C.inspect=function(){return\"[Emscripten Module object]\"}}else(i||E)&&(E?n=self.location.href:\"undefined\"!=typeof document&&document.currentScript&&(n=document.currentScript.src),n=0!==n.indexOf(\"blob:\")?n.substr(0,n.replace(/[?#].*/,\"\").lastIndexOf(\"/\")+1):\"\",I=function(A){try{var I=new XMLHttpRequest;return I.open(\"GET\",A,!1),I.send(null),I.responseText}catch(I){var g=P(A);if(g)return function(A){for(var I=[],g=0;g<A.length;g++){var C=A[g];C>255&&(C&=255),I.push(String.fromCharCode(C))}return I.join(\"\")}(g);throw I}},E&&(g=function(A){try{var I=new XMLHttpRequest;return I.open(\"GET\",A,!1),I.responseType=\"arraybuffer\",I.send(null),new Uint8Array(I.response)}catch(I){var g=P(A);if(g)return g;throw I}}),function(A,I,g){var C=new XMLHttpRequest;C.open(\"GET\",A,!0),C.responseType=\"arraybuffer\",C.onload=function(){if(200==C.status||0==C.status&&C.response)I(C.response);else{var B=P(A);B?I(B.buffer):g()}},C.onerror=g,C.send(null)},function(A){return document.title=A});C.print||console.log.bind(console);var a,e=C.printErr||console.error.bind(console);Object.assign(C,B),B=null,C.arguments&&C.arguments,C.thisProgram&&C.thisProgram,C.quit&&(Q=C.quit),C.wasmBinary&&(a=C.wasmBinary);var f,D=C.noExitRuntime||!0,c={Memory:function(A){this.buffer=new ArrayBuffer(65536*A.initial)},Module:function(A){},Instance:function(A,I){this.exports=function(A){for(var I,g=new Uint8Array(123),C=25;C>=0;--C)g[48+C]=52+C,g[65+C]=C,g[97+C]=26+C;function B(A,I,C){for(var B,Q,i=0,E=I,o=C.length,n=I+(3*o>>2)-(\"=\"==C[o-2])-(\"=\"==C[o-1]);i<o;i+=4)B=g[C.charCodeAt(i+1)],Q=g[C.charCodeAt(i+2)],A[E++]=g[C.charCodeAt(i)]<<2|B>>4,E<n&&(A[E++]=B<<4|Q>>2),E<n&&(A[E++]=Q<<6|g[C.charCodeAt(i+3)])}function Q(){throw new Error(\"abort\")}return g[43]=62,g[47]=63,function(A){var g=A.a,C=g.a.buffer,i=new Int8Array(C),E=new Int16Array(C),o=new Int32Array(C),n=new Uint8Array(C),r=new Uint16Array(C),t=new Uint32Array(C),a=(new Float32Array(C),new Float64Array(C),Math.imul),e=(Math.fround,Math.abs,Math.clz32),f=(Math.min,Math.max,Math.floor,Math.ceil,Math.trunc,Math.sqrt,g.b),D=g.c,c=g.d,G=8392208,h=0;function y(A){var I,g=0,C=0,B=0,Q=0,i=0,E=0,r=0,a=0,f=0,D=0;G=I=G-16|0;A:{I:{g:{C:{B:{Q:{i:{E:{o:{n:{r:{t:{a:{e:{if((A|=0)>>>0<=244){if(3&(g=(E=o[776])>>>(C=(r=A>>>0<11?16:A+11&-8)>>>3|0)|0)){g=(A=(C=C+(1&(-1^g))|0)<<3)+3144|0,B=o[A+3152>>2],(0|g)!=(0|(A=o[B+8>>2]))?(o[A+12>>2]=g,o[g+8>>2]=A):o[776]=EA(C)&E,A=B+8|0,g=C<<3,o[B+4>>2]=3|g,o[(g=g+B|0)+4>>2]=1|o[g+4>>2];break A}if((D=o[778])>>>0>=r>>>0)break e;if(g){g=(A=(B=oA(0-(A=(0-(A=2<<C)|A)&g<<C)&A))<<3)+3144|0,Q=o[A+3152>>2],(0|g)!=(0|(A=o[Q+8>>2]))?(o[A+12>>2]=g,o[g+8>>2]=A):(E=EA(B)&E,o[776]=E),o[Q+4>>2]=3|r,B=(A=B<<3)-r|0,o[(C=Q+r|0)+4>>2]=1|B,o[A+Q>>2]=B,D&&(g=3144+(-8&D)|0,i=o[781],(A=1<<(D>>>3))&E?A=o[g+8>>2]:(o[776]=A|E,A=g),o[g+8>>2]=i,o[A+12>>2]=i,o[i+12>>2]=g,o[i+8>>2]=A),A=Q+8|0,o[781]=C,o[778]=B;break A}if(!(f=o[777]))break e;for(C=o[3408+(oA(0-f&f)<<2)>>2],i=(-8&o[C+4>>2])-r|0,g=C;(A=o[g+16>>2])||(A=o[g+20>>2]);)i=(B=(g=(-8&o[A+4>>2])-r|0)>>>0<i>>>0)?g:i,C=B?A:C,g=A;if(a=o[C+24>>2],(0|(B=o[C+12>>2]))!=(0|C)){A=o[C+8>>2],o[A+12>>2]=B,o[B+8>>2]=A;break I}if(!(A=o[(g=C+20|0)>>2])){if(!(A=o[C+16>>2]))break a;g=C+16|0}for(;Q=g,B=A,(A=o[(g=A+20|0)>>2])||(g=B+16|0,A=o[B+16>>2]););o[Q>>2]=0;break I}if(r=-1,!(A>>>0>4294967231)&&(r=-8&(A=A+11|0),f=o[777])){i=0-r|0,E=0,r>>>0<256||(E=31,r>>>0>16777215||(E=62+((r>>>38-(A=e(A>>>8|0))&1)-(A<<1)|0)|0));f:{D:{if(g=o[3408+(E<<2)>>2])for(A=0,C=r<<(31!=(0|E)?25-(E>>>1|0)|0:0);;){if(!((Q=(-8&o[g+4>>2])-r|0)>>>0>=i>>>0||(B=g,i=Q,Q))){i=0,A=g;break D}if(Q=o[g+20>>2],g=o[16+((C>>>29&4)+g|0)>>2],A=Q?(0|Q)==(0|g)?A:Q:A,C<<=1,!g)break}else A=0;if(!(A|B)){if(B=0,!(A=(0-(A=2<<E)|A)&f))break e;A=o[3408+(oA(A&0-A)<<2)>>2]}if(!A)break f}for(;i=(C=(g=(-8&o[A+4>>2])-r|0)>>>0<i>>>0)?g:i,B=C?A:B,A=(g=o[A+16>>2])||o[A+20>>2];);}if(!(!B|o[778]-r>>>0<=i>>>0)){if(E=o[B+24>>2],(0|B)!=(0|(C=o[B+12>>2]))){A=o[B+8>>2],o[A+12>>2]=C,o[C+8>>2]=A;break g}if(!(A=o[(g=B+20|0)>>2])){if(!(A=o[B+16>>2]))break t;g=B+16|0}for(;Q=g,C=A,(A=o[(g=A+20|0)>>2])||(g=C+16|0,A=o[C+16>>2]););o[Q>>2]=0;break g}}}if((A=o[778])>>>0>=r>>>0){B=o[781],(g=A-r|0)>>>0>=16?(o[(C=B+r|0)+4>>2]=1|g,o[A+B>>2]=g,o[B+4>>2]=3|r):(o[B+4>>2]=3|A,o[(A=A+B|0)+4>>2]=1|o[A+4>>2],C=0,g=0),o[778]=g,o[781]=C,A=B+8|0;break A}if((a=o[779])>>>0>r>>>0){g=a-r|0,o[779]=g,A=(C=o[782])+r|0,o[782]=A,o[A+4>>2]=1|g,o[C+4>>2]=3|r,A=C+8|0;break A}if(A=0,f=r+47|0,o[894]?C=o[896]:(o[897]=-1,o[898]=-1,o[895]=4096,o[896]=4096,o[894]=I+12&-16^1431655768,o[899]=0,o[887]=0,C=4096),(g=(Q=f+C|0)&(i=0-C|0))>>>0<=r>>>0)break A;if((B=o[886])&&B>>>0<(E=(C=o[884])+g|0)>>>0|C>>>0>=E>>>0)break A;e:{if(!(4&n[3548])){f:{D:{c:{G:{if(B=o[782])for(A=3552;;){if((C=o[A>>2])>>>0<=B>>>0&B>>>0<C+o[A+4>>2]>>>0)break G;if(!(A=o[A+8>>2]))break}if(-1==(0|(C=W(0))))break f;if(E=g,(A=(B=o[895])-1|0)&C&&(E=(g-C|0)+(A+C&0-B)|0),E>>>0<=r>>>0)break f;if((B=o[886])&&B>>>0<(i=(A=o[884])+E|0)>>>0|A>>>0>=i>>>0)break f;if((0|C)!=(0|(A=W(E))))break c;break e}if((0|(C=W(E=i&Q-a)))==(o[A>>2]+o[A+4>>2]|0))break D;A=C}if(-1==(0|A))break f;if(r+48>>>0<=E>>>0){C=A;break e}if(-1==(0|W(C=(C=o[896])+(f-E|0)&0-C)))break f;E=C+E|0,C=A;break e}if(-1!=(0|C))break e}o[887]=4|o[887]}if(-1==(0|(C=W(g)))|-1==(0|(A=W(0)))|A>>>0<=C>>>0)break o;if((E=A-C|0)>>>0<=r+40>>>0)break o}A=o[884]+E|0,o[884]=A,A>>>0>t[885]&&(o[885]=A);e:{if(Q=o[782]){for(A=3552;;){if(((B=o[A>>2])+(g=o[A+4>>2])|0)==(0|C))break e;if(!(A=o[A+8>>2]))break}break r}for((A=o[780])>>>0<=C>>>0&&A||(o[780]=C),A=0,o[889]=E,o[888]=C,o[784]=-1,o[785]=o[894],o[891]=0;g=(B=A<<3)+3144|0,o[B+3152>>2]=g,o[B+3156>>2]=g,32!=(0|(A=A+1|0)););g=(B=E-40|0)-(A=C+8&7?-8-C&7:0)|0,o[779]=g,A=A+C|0,o[782]=A,o[A+4>>2]=1|g,o[4+(C+B|0)>>2]=40,o[783]=o[898];break n}if(8&o[A+12>>2]|C>>>0<=Q>>>0|B>>>0>Q>>>0)break r;o[A+4>>2]=g+E,C=(A=Q+8&7?-8-Q&7:0)+Q|0,o[782]=C,A=(g=o[779]+E|0)-A|0,o[779]=A,o[C+4>>2]=1|A,o[4+(g+Q|0)>>2]=40,o[783]=o[898];break n}B=0;break I}C=0;break g}t[780]>C>>>0&&(o[780]=C),g=C+E|0,A=3552;r:{t:{a:{for(;;){if((0|g)!=o[A>>2]){if(A=o[A+8>>2])continue;break a}break}if(!(8&n[A+12|0]))break t}for(A=3552;;){if((g=o[A>>2])>>>0<=Q>>>0&&(i=g+o[A+4>>2]|0)>>>0>Q>>>0)break r;A=o[A+8>>2]}}if(o[A>>2]=C,o[A+4>>2]=o[A+4>>2]+E,o[(f=(C+8&7?-8-C&7:0)+C|0)+4>>2]=3|r,A=(E=g+(g+8&7?-8-g&7:0)|0)-(a=r+f|0)|0,(0|Q)==(0|E)){o[782]=a,A=o[779]+A|0,o[779]=A,o[a+4>>2]=1|A;break C}if(o[781]==(0|E)){o[781]=a,A=o[778]+A|0,o[778]=A,o[a+4>>2]=1|A,o[A+a>>2]=A;break C}if(1!=(3&(i=o[E+4>>2])))break B;if(Q=-8&i,i>>>0<=255){if((0|(C=o[E+12>>2]))==(0|(g=o[E+8>>2]))){o[776]=o[776]&EA(i>>>3|0);break Q}o[g+12>>2]=C,o[C+8>>2]=g;break Q}if(r=o[E+24>>2],(0|E)!=(0|(C=o[E+12>>2]))){g=o[E+8>>2],o[g+12>>2]=C,o[C+8>>2]=g;break i}if(!(i=o[(g=E+20|0)>>2])){if(!(i=o[E+16>>2]))break E;g=E+16|0}for(;B=g,(i=o[(g=(C=i)+20|0)>>2])||(g=C+16|0,i=o[C+16>>2]););o[B>>2]=0;break i}for(g=(B=E-40|0)-(A=C+8&7?-8-C&7:0)|0,o[779]=g,A=A+C|0,o[782]=A,o[A+4>>2]=1|g,o[4+(C+B|0)>>2]=40,o[783]=o[898],o[(B=(A=(i+(i-39&7?39-i&7:0)|0)-47|0)>>>0<Q+16>>>0?Q:A)+4>>2]=27,A=o[891],o[B+16>>2]=o[890],o[B+20>>2]=A,A=o[889],o[B+8>>2]=o[888],o[B+12>>2]=A,o[890]=B+8,o[889]=E,o[888]=C,o[891]=0,A=B+24|0;o[A+4>>2]=7,g=A+8|0,A=A+4|0,g>>>0<i>>>0;);if((0|B)!=(0|Q))if(o[B+4>>2]=-2&o[B+4>>2],i=B-Q|0,o[Q+4>>2]=1|i,o[B>>2]=i,i>>>0<=255)g=3144+(-8&i)|0,(C=o[776])&(A=1<<(i>>>3))?A=o[g+8>>2]:(o[776]=A|C,A=g),o[g+8>>2]=Q,o[A+12>>2]=Q,o[Q+12>>2]=g,o[Q+8>>2]=A;else{A=31,i>>>0<=16777215&&(A=62+((i>>>38-(A=e(i>>>8|0))&1)-(A<<1)|0)|0),o[Q+28>>2]=A,o[Q+16>>2]=0,o[Q+20>>2]=0,g=3408+(A<<2)|0;r:{if((B=o[777])&(C=1<<A)){for(A=i<<(31!=(0|A)?25-(A>>>1|0)|0:0),B=o[g>>2];;){if((0|i)==(-8&o[(g=B)+4>>2]))break r;if(C=A>>>29|0,A<<=1,!(B=o[(C=(4&C)+g|0)+16>>2]))break}o[C+16>>2]=Q}else o[777]=C|B,o[g>>2]=Q;o[Q+24>>2]=g,o[Q+12>>2]=Q,o[Q+8>>2]=Q;break n}A=o[g+8>>2],o[A+12>>2]=Q,o[g+8>>2]=Q,o[Q+24>>2]=0,o[Q+12>>2]=g,o[Q+8>>2]=A}}if(!((A=o[779])>>>0<=r>>>0)){g=A-r|0,o[779]=g,A=(C=o[782])+r|0,o[782]=A,o[A+4>>2]=1|g,o[C+4>>2]=3|r,A=C+8|0;break A}}o[775]=48,A=0;break A}C=0}if(r){B=o[E+28>>2];i:{if(o[(g=3408+(B<<2)|0)>>2]==(0|E)){if(o[g>>2]=C,C)break i;o[777]=o[777]&EA(B);break Q}if(o[r+(o[r+16>>2]==(0|E)?16:20)>>2]=C,!C)break Q}o[C+24>>2]=r,(g=o[E+16>>2])&&(o[C+16>>2]=g,o[g+24>>2]=C),(g=o[E+20>>2])&&(o[C+20>>2]=g,o[g+24>>2]=C)}}A=A+Q|0,i=o[(E=Q+E|0)+4>>2]}if(o[E+4>>2]=-2&i,o[a+4>>2]=1|A,o[A+a>>2]=A,A>>>0<=255)g=3144+(-8&A)|0,(C=o[776])&(A=1<<(A>>>3))?A=o[g+8>>2]:(o[776]=A|C,A=g),o[g+8>>2]=a,o[A+12>>2]=a,o[a+12>>2]=g,o[a+8>>2]=A;else{i=31,A>>>0<=16777215&&(i=62+((A>>>38-(g=e(A>>>8|0))&1)-(g<<1)|0)|0),o[a+28>>2]=i,o[a+16>>2]=0,o[a+20>>2]=0,g=3408+(i<<2)|0;B:{if((B=o[777])&(C=1<<i)){for(i=A<<(31!=(0|i)?25-(i>>>1|0)|0:0),C=o[g>>2];;){if(g=C,(-8&o[C+4>>2])==(0|A))break B;if(C=i>>>29|0,i<<=1,!(C=o[(B=(4&C)+g|0)+16>>2]))break}o[B+16>>2]=a}else o[777]=C|B,o[g>>2]=a;o[a+24>>2]=g,o[a+12>>2]=a,o[a+8>>2]=a;break C}A=o[g+8>>2],o[A+12>>2]=a,o[g+8>>2]=a,o[a+24>>2]=0,o[a+12>>2]=g,o[a+8>>2]=A}}A=f+8|0;break A}g:if(E){g=o[B+28>>2];C:{if(o[(A=3408+(g<<2)|0)>>2]==(0|B)){if(o[A>>2]=C,C)break C;f=EA(g)&f,o[777]=f;break g}if(o[E+(o[E+16>>2]==(0|B)?16:20)>>2]=C,!C)break g}o[C+24>>2]=E,(A=o[B+16>>2])&&(o[C+16>>2]=A,o[A+24>>2]=C),(A=o[B+20>>2])&&(o[C+20>>2]=A,o[A+24>>2]=C)}g:if(i>>>0<=15)A=i+r|0,o[B+4>>2]=3|A,o[(A=A+B|0)+4>>2]=1|o[A+4>>2];else if(o[B+4>>2]=3|r,o[(Q=B+r|0)+4>>2]=1|i,o[Q+i>>2]=i,i>>>0<=255)g=3144+(-8&i)|0,(C=o[776])&(A=1<<(i>>>3))?A=o[g+8>>2]:(o[776]=A|C,A=g),o[g+8>>2]=Q,o[A+12>>2]=Q,o[Q+12>>2]=g,o[Q+8>>2]=A;else{A=31,i>>>0<=16777215&&(A=62+((i>>>38-(A=e(i>>>8|0))&1)-(A<<1)|0)|0),o[Q+28>>2]=A,o[Q+16>>2]=0,o[Q+20>>2]=0,g=3408+(A<<2)|0;C:{if((C=1<<A)&f){for(A=i<<(31!=(0|A)?25-(A>>>1|0)|0:0),r=o[g>>2];;){if((-8&o[(g=r)+4>>2])==(0|i))break C;if(C=A>>>29|0,A<<=1,!(r=o[(C=(4&C)+g|0)+16>>2]))break}o[C+16>>2]=Q}else o[777]=C|f,o[g>>2]=Q;o[Q+24>>2]=g,o[Q+12>>2]=Q,o[Q+8>>2]=Q;break g}A=o[g+8>>2],o[A+12>>2]=Q,o[g+8>>2]=Q,o[Q+24>>2]=0,o[Q+12>>2]=g,o[Q+8>>2]=A}A=B+8|0;break A}I:if(a){g=o[C+28>>2];g:{if(o[(A=3408+(g<<2)|0)>>2]==(0|C)){if(o[A>>2]=B,B)break g;o[777]=EA(g)&f;break I}if(o[a+(o[a+16>>2]==(0|C)?16:20)>>2]=B,!B)break I}o[B+24>>2]=a,(A=o[C+16>>2])&&(o[B+16>>2]=A,o[A+24>>2]=B),(A=o[C+20>>2])&&(o[B+20>>2]=A,o[A+24>>2]=B)}i>>>0<=15?(A=i+r|0,o[C+4>>2]=3|A,o[(A=A+C|0)+4>>2]=1|o[A+4>>2]):(o[C+4>>2]=3|r,o[(B=C+r|0)+4>>2]=1|i,o[B+i>>2]=i,D&&(g=3144+(-8&D)|0,Q=o[781],(A=1<<(D>>>3))&E?A=o[g+8>>2]:(o[776]=A|E,A=g),o[g+8>>2]=Q,o[A+12>>2]=Q,o[Q+12>>2]=g,o[Q+8>>2]=A),o[781]=B,o[778]=i),A=C+8|0}return G=I+16|0,0|A}function u(A){var I=0,g=0,C=0,B=0,Q=0,i=0,E=0,n=0,r=0,t=0,a=0,e=0,f=0,D=0,c=0,G=0,y=0,u=0,s=0,F=0,Y=0,N=0,w=0,S=0,k=0,H=0,R=0,d=0,M=0,J=0,q=0,l=0,m=0,L=0,p=0,K=0,b=0,v=0,j=0,O=0,T=0,x=0,W=0,P=0,V=0,X=0,Z=0,_=0,z=0,$=0,AA=0,IA=0,gA=0,CA=0,BA=0,QA=0,iA=0,EA=0,oA=0,nA=0,rA=0,tA=0,aA=0,eA=0,fA=0,DA=0,cA=0,GA=0,hA=0,yA=0,uA=0,sA=0,FA=0,YA=0,NA=0,wA=0,SA=0,kA=0,HA=0,UA=0,RA=0,dA=0,MA=0,JA=0,qA=0,lA=0,mA=0,LA=0,pA=0,KA=0,bA=0,vA=0,jA=0,OA=0,TA=0,xA=0;for(P=o[A+192>>2],V=o[A+196>>2],M=o[A+184>>2],X=o[A+188>>2],Z=o[A+176>>2],_=o[A+180>>2],J=o[A+168>>2],z=o[A+172>>2],u=o[A+160>>2],EA=o[A+164>>2],$=o[A+152>>2],oA=o[A+156>>2],AA=o[A+144>>2],IA=o[A+148>>2],q=o[A+136>>2],l=o[A+140>>2],m=o[A+128>>2],nA=o[A+132>>2],gA=o[A+120>>2],rA=o[A+124>>2],L=o[A+112>>2],p=o[A+116>>2],D=o[A+104>>2],k=o[A+108>>2],K=o[A+96>>2],b=o[A+100>>2],r=o[A+88>>2],H=o[A+92>>2],E=o[A+80>>2],v=o[A+84>>2],i=o[A+72>>2],j=o[A+76>>2],e=o[A+64>>2],y=o[A+68>>2],s=o[A+56>>2],f=o[A+60>>2],g=o[A+48>>2],CA=o[A+52>>2],B=o[A+40>>2],c=o[A+44>>2],F=o[A+32>>2],O=o[A+36>>2],a=o[A+24>>2],Y=o[A+28>>2],t=o[A+16>>2],R=o[A+20>>2],C=o[A+8>>2],N=o[A+12>>2],n=o[A>>2],w=o[A+4>>2];hA>>>0<=23;)I=a^e^D^M^AA,T=U(G=n^B^E^u^gA,S=w^c^v^EA^rA,1)^I,Q=U(F^T,O^(x=(tA=Y^y^k^X^IA)^h),27),aA=h,BA=d=R^f^b^l^_,d=U(W=t^s^K^q^Z,d,1)^G,G=U(r^d,H^(QA=h^S),10),eA=h,iA=S=N^CA^H^z^nA,fA=F^i^L^P^$,F=U(cA=C^g^r^J^m,S,1)^fA,S=U(S=B^F,c^(H=(B=O^j^p^V^oA)^h),36),DA=h,r=U(C^d,N^QA,1),N=h,c=U(fA,B,1)^W,D=U(c^D,(W=k)^(k=h^BA),25),BA=h,O=U(I,tA,1)^cA,C=U(O^s,(W=f)^(f=h^iA),6),tA=h,s=U(a^c,Y^k,28),Y=h,E=U(E^F,H^v,3),v=h,I=U(i^T,j^x,20),W=a=h,i=U(t^O,f^R,62),j=h,L=U(L^T,p^x,39),p=h,B=U(e^c,y^k,55),R=t=h,y=o[(e=(cA=hA<<3)+1120|0)>>2],e=o[e+4>>2],K=U(K^O,f^b,43),b=h,g=U(g^d,CA^QA,44),GA=t=(yA=(w^=H)^(-1^(CA=h))&b^e)^(uA=(-1^t)&p^j)^(sA=(-1^a)&v^Y)^(FA=(-1^DA)&eA^aA)^(YA=(-1^tA)&BA^N),e=U(y=(NA=(iA=n^F)^(-1^g)&K^y)^(wA=(-1^B)&L^i)^(SA=(-1^I)&E^s)^(kA=(-1^S)&G^Q)^(HA=(-1^C)&D^r),t,1),a=h,q=U(q^O,f^l,15),l=h,M=U(c^M,k^X,56),fA=h,AA=U(c^AA,k^IA,21),X=h,P=U(P^T,V^x,14),IA=h,gA=U(F^gA,H^rA,41),V=h,t=U(J^d,z^QA,2),n=h,$=U($^T,x^oA,8),z=h,J=U(u^F,H^EA,18),F=h,u=U(m^d,QA^nA,45),m=h,UA=(-1^M)&Q^q,c=(-1^P)&iA^AA,oA=(-1^t)&i^gA,H=(-1^J)&r^$,Z=U(O^Z,f^_,61),i=U((e^=nA=UA^c^oA^H^(EA=(-1^Z)&s^u))^(rA=(-1^i)&B^t),(a^=JA=(RA=(-1^fA)&aA^l)^(dA=(-1^IA)&w^X)^(k=(-1^n)&j^V)^(f=(-1^F)&N^z)^(MA=(-1^(_=h))&Y^m))^(j=(-1^j)&R^n),14),T=h,xA=n=(qA=BA^(-1^z)&F)^(lA=b^(-1^X)&IA)^(mA=(-1^V)&n^p)^(LA=v^(-1^m)&_)^(pA=(-1^l)&fA^eA),n=U(TA=(KA=D^(-1^$)&J)^(bA=K^(-1^AA)&P)^(vA=(-1^gA)&t^L)^(jA=E^(-1^u)&Z)^(OA=(-1^q)&M^G),n,1)^y,E=U(n^(t=(-1^E)&u^I),(y=h^GA)^(u=(-1^v)&m^W),44),x=h,m=R^(-1^p)&V,p=tA^(-1^BA)&z,eA=DA^(-1^eA)&l,G=(M=(BA=M^(-1^Q)&S)^(GA=Z^(-1^s)&I)^(Q=J^(-1^r)&C)^rA^(l=(-1^iA)&g^P))^U(C=(I=B^(-1^L)&gA)^(L=C^(-1^D)&$)^(iA=S^(-1^G)&q)^(K=(-1^K)&AA^g)^t,u^=m^p^eA^(b=(-1^b)&X^CA),1),QA=g=(s=(B=(aA=fA^(-1^aA)&DA)^(DA=_^(-1^Y)&W)^(J=F^(-1^N)&tA)^j^(q=(-1^w)&CA^IA))^h)^yA,t=i,S=E,F=i^E&(-1^(d=G^NA)),O=(-1^g)&x^T,I=U(I^n,y^m,2),r=h,Y=U(M,B,1)^TA,B=U(EA^Y,MA^(R=xA^h),55),D=h,N=U(nA,JA,1)^C,C=U(N^bA,(w=u^h)^lA,62),E=g=h,P=(-1^C)&B^I,V=(-1^g)&D^r,M=(g=U(G^kA,s^FA,41))^(-1^I)&C,X=(i=h)^(-1^r)&E,Z=(Q=U(Q^e,a^J,39))^(-1^g)&I,_=(I=h)^(-1^i)&r,J=B^(-1^Q)&g,z=D^(-1^I)&i,u=C^(-1^B)&Q,EA=E^(-1^D)&I,I=U(Y^oA,R^k,56),r=h,B=U(G^SA,s^sA,36),D=h,C=U(e^l,a^q,27),E=g=h,$=(-1^C)&B^I,oA=(-1^g)&D^r,AA=(g=U(N^OA,w^pA,15))^(-1^I)&C,IA=(i=h)^(-1^r)&E,q=(Q=U(n^L,y^p,10))^(-1^g)&I,l=(I=h)^(-1^i)&r,m=B^(-1^Q)&g,nA=D^(-1^I)&i,gA=(-1^B)&Q^C,rA=(-1^D)&I^E,I=U(G^wA,s^uA,18),r=h,B=U(N^jA,w^LA,6),i=h,C=U(n^K,y^b,1),v=g=h,L=(-1^C)&B^I,p=(-1^g)&i^r,D=(g=U(e^BA,a^aA,8))^(-1^I)&C,k=(E=h)^(-1^r)&v,K=(Q=U(Y^H,f^R,25))^(-1^g)&I,b=(I=h)^(-1^E)&r,r=B^(-1^Q)&g,H=i^(-1^I)&E,E=(-1^B)&Q^C,v^=(-1^i)&I,I=U(N^vA,w^mA,61),f=h,B=U(e^GA,a^DA,20),a=h,C=U(c^Y,R^dA,28),c=g=h,i=(-1^C)&B^I,j=(-1^g)&a^f,e=(g=U(n^iA,y^eA,45))^(-1^I)&C,y=(n=h)^(-1^f)&c,s=(Q=U(G^HA,s^YA,3))^(-1^g)&I,f=(I=h)^(-1^n)&f,g=(-1^Q)&g^B,CA=(-1^I)&n^a,B=C^(-1^B)&Q,c^=(-1^a)&I,a=(C=U(Y^UA,R^RA,21))^(-1^t)&d,Y=(Q=h)^(-1^T)&QA,t=(I=U(N^KA,w^qA,43))^(-1^C)&t,R=(G=h)^(-1^Q)&T,C=(-1^I)&C^S,N=(-1^G)&Q^x,n=d^o[(Q=1120+(8|cA)|0)>>2]^(-1^S)&I,w=QA^o[Q+4>>2]^(-1^x)&G,hA=hA+2|0;o[A+192>>2]=P,o[A+196>>2]=V,o[A+184>>2]=M,o[A+188>>2]=X,o[A+176>>2]=Z,o[A+180>>2]=_,o[A+168>>2]=J,o[A+172>>2]=z,o[A+160>>2]=u,o[A+164>>2]=EA,o[A+152>>2]=$,o[A+156>>2]=oA,o[A+144>>2]=AA,o[A+148>>2]=IA,o[A+136>>2]=q,o[A+140>>2]=l,o[A+128>>2]=m,o[A+132>>2]=nA,o[A+120>>2]=gA,o[A+124>>2]=rA,o[A+112>>2]=L,o[A+116>>2]=p,o[A+104>>2]=D,o[A+108>>2]=k,o[A+96>>2]=K,o[A+100>>2]=b,o[A+88>>2]=r,o[A+92>>2]=H,o[A+80>>2]=E,o[A+84>>2]=v,o[A+72>>2]=i,o[A+76>>2]=j,o[A+64>>2]=e,o[A+68>>2]=y,o[A+56>>2]=s,o[A+60>>2]=f,o[A+48>>2]=g,o[A+52>>2]=CA,o[A+40>>2]=B,o[A+44>>2]=c,o[A+32>>2]=F,o[A+36>>2]=O,o[A+24>>2]=a,o[A+28>>2]=Y,o[A+16>>2]=t,o[A+20>>2]=R,o[A+8>>2]=C,o[A+12>>2]=N,o[A>>2]=n,o[A+4>>2]=w}function s(A){var I=0,g=0,C=0,B=0,Q=0,i=0,E=0;A:if(A|=0){Q=(C=A-8|0)+(A=-8&(I=o[A-4>>2]))|0;I:if(!(1&I)){if(!(3&I))break A;if((C=C-(I=o[C>>2])|0)>>>0<t[780])break A;A=A+I|0;g:{C:{if(o[781]!=(0|C)){if(I>>>0<=255){if(B=I>>>3|0,(0|(I=o[C+12>>2]))==(0|(g=o[C+8>>2]))){o[776]=o[776]&EA(B);break I}o[g+12>>2]=I,o[I+8>>2]=g;break I}if(i=o[C+24>>2],(0|C)!=(0|(I=o[C+12>>2]))){g=o[C+8>>2],o[g+12>>2]=I,o[I+8>>2]=g;break g}if(!(g=o[(B=C+20|0)>>2])){if(!(g=o[C+16>>2]))break C;B=C+16|0}for(;E=B,(g=o[(B=(I=g)+20|0)>>2])||(B=I+16|0,g=o[I+16>>2]););o[E>>2]=0;break g}if(3!=(3&(I=o[Q+4>>2])))break I;return o[778]=A,o[Q+4>>2]=-2&I,o[C+4>>2]=1|A,void(o[Q>>2]=A)}I=0}if(i){g=o[C+28>>2];g:{if(o[(B=3408+(g<<2)|0)>>2]==(0|C)){if(o[B>>2]=I,I)break g;o[777]=o[777]&EA(g);break I}if(o[i+(o[i+16>>2]==(0|C)?16:20)>>2]=I,!I)break I}o[I+24>>2]=i,(g=o[C+16>>2])&&(o[I+16>>2]=g,o[g+24>>2]=I),(g=o[C+20>>2])&&(o[I+20>>2]=g,o[g+24>>2]=I)}}if(!(C>>>0>=Q>>>0)&&1&(I=o[Q+4>>2])){I:{g:{C:{B:{if(!(2&I)){if(o[782]==(0|Q)){if(o[782]=C,A=o[779]+A|0,o[779]=A,o[C+4>>2]=1|A,o[781]!=(0|C))break A;return o[778]=0,void(o[781]=0)}if(o[781]==(0|Q))return o[781]=C,A=o[778]+A|0,o[778]=A,o[C+4>>2]=1|A,void(o[A+C>>2]=A);if(A=(-8&I)+A|0,I>>>0<=255){if(B=I>>>3|0,(0|(I=o[Q+12>>2]))==(0|(g=o[Q+8>>2]))){o[776]=o[776]&EA(B);break g}o[g+12>>2]=I,o[I+8>>2]=g;break g}if(i=o[Q+24>>2],(0|Q)!=(0|(I=o[Q+12>>2]))){g=o[Q+8>>2],o[g+12>>2]=I,o[I+8>>2]=g;break C}if(!(g=o[(B=Q+20|0)>>2])){if(!(g=o[Q+16>>2]))break B;B=Q+16|0}for(;E=B,(g=o[(B=(I=g)+20|0)>>2])||(B=I+16|0,g=o[I+16>>2]););o[E>>2]=0;break C}o[Q+4>>2]=-2&I,o[C+4>>2]=1|A,o[A+C>>2]=A;break I}I=0}if(i){g=o[Q+28>>2];C:{if(o[(B=3408+(g<<2)|0)>>2]==(0|Q)){if(o[B>>2]=I,I)break C;o[777]=o[777]&EA(g);break g}if(o[i+(o[i+16>>2]==(0|Q)?16:20)>>2]=I,!I)break g}o[I+24>>2]=i,(g=o[Q+16>>2])&&(o[I+16>>2]=g,o[g+24>>2]=I),(g=o[Q+20>>2])&&(o[I+20>>2]=g,o[g+24>>2]=I)}}if(o[C+4>>2]=1|A,o[A+C>>2]=A,o[781]==(0|C))return void(o[778]=A)}if(A>>>0<=255)return I=3144+(-8&A)|0,(g=o[776])&(A=1<<(A>>>3))?A=o[I+8>>2]:(o[776]=A|g,A=I),o[I+8>>2]=C,o[A+12>>2]=C,o[C+12>>2]=I,void(o[C+8>>2]=A);g=31,A>>>0<=16777215&&(g=62+((A>>>38-(I=e(A>>>8|0))&1)-(I<<1)|0)|0),o[C+28>>2]=g,o[C+16>>2]=0,o[C+20>>2]=0,I=3408+(g<<2)|0;I:{g:{if((B=o[777])&(E=1<<g)){for(g=A<<(31!=(0|g)?25-(g>>>1|0)|0:0),I=o[I>>2];;){if(B=I,(-8&o[I+4>>2])==(0|A))break g;if(I=g>>>29|0,g<<=1,!(I=o[(E=B+(4&I)|0)+16>>2]))break}o[E+16>>2]=C,o[C+24>>2]=B}else o[777]=B|E,o[I>>2]=C,o[C+24>>2]=I;o[C+12>>2]=C,o[C+8>>2]=C;break I}A=o[B+8>>2],o[A+12>>2]=C,o[B+8>>2]=C,o[C+24>>2]=0,o[C+12>>2]=B,o[C+8>>2]=A}A=o[784]-1|0,o[784]=A||-1}}}function F(A,I,g,C){var B,E,r,t,e=0,D=0,c=0,F=0,Y=0;for(G=E=G-160|0,t=E+12|0,r=y(200),o[t>>2]=r,r||(f(111),Q()),G=B=G-208|0;;){if(25==(0|e)){for(;;){if(e=0,C>>>0<136){for(D=0;;){if(136==(0|e)){for(;(0|C)!=(0|D);)i[D+B|0]=n[g+D|0],D=D+1|0;break}i[e+B|0]=0,e=e+1|0}for(i[C+B|0]=31,i[B+135|0]=128|n[B+135|0],e=0;17!=(0|e);)D=o[(g=(C=e<<3)+r|0)>>2],c=o[g+4>>2],o[g>>2]=p(C+B|0)^D,o[g+4>>2]=h^c,e=e+1|0;G=B+208|0;break}for(;17!=(0|e);)F=o[(D=(c=e<<3)+r|0)>>2],Y=o[D+4>>2],o[D>>2]=p(g+c|0)^F,o[D+4>>2]=h^Y,e=e+1|0;u(r),g=g+136|0,C=C-136|0}break}o[(D=(e<<3)+r|0)>>2]=0,o[D+4>>2]=0,e=e+1|0}J(A,g=(I>>>0)/136|0,t);A:if((0|(g=a(g,136)))!=(0|I))for(C=I-g|0,A=A+g|0,J(E+16|0,1,E+12|0),I=0;;){if((0|I)==(0|C))break A;i[A+I|0]=n[(E+16|0)+I|0],I=I+1|0}s(o[E+12>>2]),G=E+160|0}function Y(A,I,g,C){for(var B=0,Q=0,i=0,E=0,r=0,t=0,a=0,e=0,f=0;;){A:{if(E=0,i=0,r=a=o[A+204>>2],!(!((t=C+(B=o[A+200>>2])|0)>>>0<C>>>0?r+1|0:r)&I>>>0>t>>>0)){for(;!(!i&(Q=I-B|0)>>>0<=E>>>0|0!=(0|i));)a=o[(r=(-8&(B=B+E|0))+A|0)+4>>2],t=n[g+E|0],Q=31&(B<<=3),(63&B)>>>0>=32?(B=t<<Q,Q=0):(B=(1<<Q)-1&t>>>32-Q,Q=t<<Q),o[r>>2]=Q^o[r>>2],o[r+4>>2]=B^a,i=(E=E+1|0)?i:i+1|0,B=o[A+200>>2],a=o[A+204>>2];o[A+200>>2]=0,o[A+204>>2]=0,u(A),g=g+Q|0,C=C-Q|0;continue}for(;;){if(!f&(0|C)==(0|e))break A;I=e+o[A+200>>2]|0,Q=o[(i=(-8&I)+A|0)+4>>2],E=n[g+e|0],I=31&(B=I<<3),(63&B)>>>0>=32?(B=E<<I,I=0):(B=(1<<I)-1&E>>>32-I,I=E<<I),o[i>>2]=I^o[i>>2],o[i+4>>2]=B^Q,I=f,f=(e=e+1|0)?I:I+1|0}}break}I=o[A+204>>2],I=(g=C+o[A+200>>2]|0)>>>0<C>>>0?I+1|0:I,o[A+200>>2]=g,o[A+204>>2]=I}function N(A,I,g,C){var B=0,Q=0,E=0,n=0,r=0,t=0,a=0,e=0;for(t=I;;){E=o[g+200>>2],n=o[g+204>>2];A:{if(!r&(0|B)==(0|t))Q=I;else{if(Q=B,(0|r)==(0|n)&E>>>0>B>>>0|r>>>0<n>>>0)break A;t=B}for(B=E-t|0,r=n-((E>>>0<t>>>0)+0|0)|0,t=I-Q|0,I=A+Q|0;o[g+200>>2]=B,o[g+204>>2]=r,t;){for(u(g),A=C>>>0>t>>>0?t:C,Q=0;(0|A)!=(0|Q);)n=o[(B=(-8&Q)+g|0)>>2],E=o[B+4>>2],B=31&(r=Q<<3&56),i[I+Q|0]=(63&r)>>>0>=32?E>>>B|0:((1<<B)-1&E)<<32-B|n>>>B,Q=Q+1|0;t=t-A|0,I=A+I|0,B=C-A|0,r=0}return}e=a=A+Q|0,a=o[(n=(-8&(E=B+(C-E|0)|0))+g|0)>>2],n=o[n+4>>2],Q=31&(E<<=3),i[0|e]=(63&E)>>>0>=32?n>>>Q|0:((1<<Q)-1&n)<<32-Q|a>>>Q,r=(B=B+1|0)?r:r+1|0}}function w(A,I){var g,C=0,B=0,Q=0,i=0,E=0,r=0;for(G=g=G-160|0,T(Q=g+12|0),aA(Q,I,32),eA(Q),tA(g+16|0,136,Q);;){if(!C&8==(0|B)){for(I=0;;){if(256==(0|I)){for(I=8,B=196;256!=(0|B);){for(;I>>>0>=136&&(tA(g+16|0,136,g+12|0),I=0),C=(g+16|0)+I|0,I=I+1|0,(C=n[0|C])>>>0>B>>>0;);C=(C<<2)+A|0,o[(B<<2)+A>>2]=o[C>>2],o[C>>2]=1-(E<<1&2),B=B+1|0,E=(1&r)<<31|E>>>1,r=r>>>1|0}fA(g+12|0),G=g+160|0;break}o[(I<<2)+A>>2]=0,I=I+1|0}break}Q=n[(g+16|0)+B|0],I=31&(i=B<<3),(63&i)>>>0>=32?(i=Q<<I,I=0):(i=(1<<I)-1&Q>>>32-I,I=Q<<I),E|=I,r|=i,C=(B=B+1|0)?C:C+1|0}}function S(A,I){for(var g=0,C=0,B=0,Q=0,E=0,r=0,t=0,e=0,f=0,D=0,c=0;8!=(0|r);){for(D=r<<8,c=a(r,7168)+A|0,E=0;7!=(0|E);){for(G=g=(G=B=G-864|0)-16|0,C=E+D|0,i[g+14|0]=C,i[g+15|0]=C>>>8,T(C=B+12|0),rA(C,I,32),rA(C,g+14|0,2),d(o[C>>2],168),G=g+16|0,g=840,nA(Q=B+16|0,840,C),C=L(e=(E<<10)+c|0,256,Q,840);C>>>0<=255;){for(t=g-(Q=(g>>>0)%3|0)|0,g=0;(0|g)!=(0|Q);)i[(f=B+16|0)+g|0]=n[(g+t|0)+f|0],g=g+1|0;nA((g=B+16|0)|Q,168,B+12|0),C=L((C<<2)+e|0,256-C|0,t=g,g=168|Q)+C|0}fA(B+12|0),G=B+864|0,E=E+1|0}r=r+1|0}}function k(A){var I=0,g=0,C=0,B=0,Q=0,i=0,E=0,n=0,r=0,t=0,a=0;Q=256,C=1;A:for(;;){I:{if(g=0,C>>>0>255)for(;;){if(256==(0|i))break I;I=K(I=o[(B=(i<<2)+A|0)>>2],I>>31,41978,0),o[B>>2]=AA(I,h),i=i+1|0}for(;;){g:{if(g>>>0<=255)for(n=g+C|0,t=(B=0-o[1312+((Q=Q-1|0)<<2)>>2]|0)>>31;;){if((0|g)==(0|n))break g;r=o[(I=(g<<2)+A|0)>>2],a=I,I=o[(E=(g+C<<2)+A|0)>>2],o[a>>2]=r+I,I=r-I|0,o[E>>2]=I,o[E>>2]=AA(K(I,I>>31,B,t),h),g=g+1|0}C<<=1;continue A}g=C+n|0}}break}}function H(A,I){for(var g=0,C=0,B=0,Q=0,i=0,E=0,r=0,t=0,e=0,f=0;32!=(0|B);)g=(B<<5)+A|0,C=a(B,3)+I|0,Q=7&n[0|C],o[g>>2]=Q,i=n[0|C]>>>3&7,o[g+4>>2]=i,E=n[C+1|0]<<2&4|n[0|C]>>>6,o[g+8>>2]=E,r=n[C+1|0]>>>1&7,o[g+12>>2]=r,t=n[C+1|0]>>>4&7,o[g+16>>2]=t,e=n[C+2|0]<<1&6|n[C+1|0]>>>7,o[g+20>>2]=e,f=n[C+2|0]>>>2&7,o[g+24>>2]=f,C=n[C+2|0],o[g+4>>2]=2-i,o[g>>2]=2-Q,o[g+8>>2]=2-E,o[g+12>>2]=2-r,o[g+16>>2]=2-t,o[g+20>>2]=2-e,o[g+24>>2]=2-f,o[g+28>>2]=2-(C>>>5|0),B=B+1|0}function U(A,I,g){var C=0,B=0,Q=0,i=0;return B=31&(Q=i=63&g),Q=Q>>>0>=32?-1>>>B|0:(C=-1>>>B|0)|(1<<B)-1<<32-B,Q&=A,C&=I,B=31&i,i>>>0>=32?(C=Q<<B,i=0):(C=(1<<B)-1&Q>>>32-B|C<<B,i=Q<<B),Q=C,C=31&(B=0-g&63),B>>>0>=32?(C=-1<<C,g=0):C=(g=-1<<C)|(1<<C)-1&-1>>>32-C,A&=g,I&=C,C=31&B,B>>>0>=32?(g=0,A=I>>>C|0):(g=I>>>C|0,A=((1<<C)-1&I)<<32-C|A>>>C),h=g|Q,A|=i}function R(A){var I=0,g=0,C=0,B=0,Q=0,i=0,E=0,n=0,r=0,t=0;for(g=128;I=0,g;){for(;I>>>0<=255;){for(i=I>>>0>(C=I+g|0)>>>0?I:C,r=(C=o[1312+((E=E+1|0)<<2)>>2])>>31;(0|I)!=(0|i);)Q=AA(K(Q=o[(B=(I+g<<2)+A|0)>>2],Q>>31,C,r),h),t=B,n=o[(B=(I<<2)+A|0)>>2],o[t>>2]=n-Q,o[B>>2]=Q+n,I=I+1|0;I=g+i|0}g=g>>>1|0}}function d(A,I){var g,C=0,B=0,Q=0;C=o[A+200>>2],g=o[(B=A+(-8&C)|0)+4>>2],C=31&(Q=C<<3),(63&Q)>>>0>=32?(Q=31<<C,C=0):(Q=(1<<C)-1&31>>>32-C,C=31<<C),o[B>>2]=C^o[B>>2],o[B+4>>2]=Q^g,Q=o[(I=(-8&(C=I-1|0))+A|0)+4>>2],C=31&(B=C<<3&56),(63&B)>>>0>=32?(B=128<<C,C=0):(B=(1<<C)-1&128>>>32-C,C=128<<C),o[I>>2]=C^o[I>>2],o[I+4>>2]=B^Q,o[A+200>>2]=0,o[A+204>>2]=0}function M(A,I){for(var g=0,C=0,B=0,Q=0,E=0,n=0,r=0,t=0,e=0;32!=(0|C);)n=o[(g=(C<<5)+I|0)+16>>2],r=o[g+12>>2],B=o[g+28>>2],t=o[g+20>>2],e=o[g+24>>2],Q=a(C,3)+A|0,E=16-(o[g+4>>2]<<3)|2-o[g>>2],g=2-o[g+8>>2]|0,i[0|Q]=E|g<<6,E=64-(B<<5)|0,B=2-t|0,i[Q+2|0]=E|8-(e<<2)|(254&B)>>>1,i[Q+1|0]=32-(n<<4)|4-(r<<1)|(252&g)>>>2|B<<7,C=C+1|0}function J(A,I,g){var C,B=0,Q=0,E=0,n=0,r=0,t=0,a=0;C=o[g>>2];A:for(;;){if(I)for(u(C),g=0;;){if(17==(0|g)){I=I-1|0,A=A+136|0;continue A}for(t=(B=g<<3)+A|0,a=o[(B=B+C|0)>>2],n=o[B+4>>2],Q=0,B=0;8!=(0|Q)|B;)E=31&(r=Q<<3),i[Q+t|0]=(63&r)>>>0>=32?n>>>E|0:((1<<E)-1&n)<<32-E|a>>>E,B=(Q=Q+1|0)?B:B+1|0;g=g+1|0;continue}break}}function q(A,I){for(var g=0,C=0,B=0,Q=0,i=0;128!=(0|i);)B=(i<<3)+A|0,g=a(i,5)+I|0,C=n[0|g],o[B>>2]=C,C|=n[g+1|0]<<8,o[B>>2]=C,C|=n[g+2|0]<<16&983040,o[B>>2]=C,Q=n[g+2|0]>>>4|0,o[B+4>>2]=Q,Q|=n[g+3|0]<<4,o[B+4>>2]=Q,g=n[g+4|0],o[B>>2]=524288-C,o[B+4>>2]=524288-(Q|g<<12),i=i+1|0}function l(A,I,g){for(var C=0,B=0,Q=0,i=0;!(I>>>0<=C>>>0|Q>>>0>135);)i=(B=n[g+Q|0])>>>4|0,Q=Q+1|0,15!=(0|(B&=15))&&(o[(C<<2)+A>>2]=2+(a(a(B,205)>>>10|0,5)-B|0),C=C+1|0),15==(0|i)|I>>>0<=C>>>0||(o[(C<<2)+A>>2]=2+(a(a(i,205)>>>10|0,5)-i|0),C=C+1|0);return C}function m(A,I,g){for(var C=0,B=0,Q=0,i=0,E=0,o=0;8!=(0|C);){for(G=B=G-1024|0,x(i=(C<<10)+A|0,E=a(C,7168)+I|0,g),Q=1;7!=(0|Q);)x(B,(o=Q<<10)+E|0,g+o|0),z(i,i,B),Q=Q+1|0;G=B+1024|0,C=C+1|0}}function L(A,I,g,C){for(var B=0,Q=0,i=0,E=0;!(I>>>0<=Q>>>0||(B=E+3|0)>>>0>C>>>0);)i=g+E|0,E=B,(B=n[i+2|0]<<16&8323072|n[0|i]|n[i+1|0]<<8)>>>0>8380416||(o[(Q<<2)+A>>2]=B,Q=Q+1|0);return Q}function p(A){for(var I=0,g=0,C=0,B=0,Q=0,i=0,E=0;!(!B&8==(0|g));)Q=n[A+g|0],I=31&(C=g<<3),(63&C)>>>0>=32?(C=Q<<I,I=0):(C=(1<<I)-1&Q>>>32-I,I=Q<<I),i|=I,E|=C,B=(g=g+1|0)?B:B+1|0;return h=E,i}function K(A,I,g,C){var B,Q,i,E,o=0,n=0;return E=a(o=g>>>16|0,n=A>>>16|0),o=(65535&(n=((i=a(B=65535&g,Q=65535&A))>>>16|0)+a(n,B)|0))+a(o,Q)|0,h=(a(I,g)+E|0)+a(A,C)+(n>>>16)+(o>>>16)|0,65535&i|o<<16}function b(A,I,g){for(var C=0,B=0,Q=0,i=0,E=0,n=0;8!=(0|B);){for(i=(C=B<<10)+A|0,E=I+C|0,n=g+C|0,C=0;256!=(0|C);)o[i+(Q=C<<2)>>2]=o[Q+E>>2]-o[Q+n>>2],C=C+1|0;B=B+1|0}}function v(A,I,g){var C,B;for(G=C=G-160|0,$(B=C+12|0,I,g),tA(I=C+16|0,136,B),g=l(A,256,I);g>>>0<=255;)tA(I=C+16|0,136,C+12|0),g=l((g<<2)+A|0,256-g|0,I)+g|0;fA(C+12|0),G=C+160|0}function j(A,I){for(var g=0,C=0,B=0,Q=0,E=0;8!=(0|C);){for(Q=(C<<7)+A|0,E=(C<<10)+I|0,g=0;128!=(0|g);)B=(g<<3)+E|0,i[g+Q|0]=o[B+4>>2]<<4|o[B>>2],g=g+1|0;C=C+1|0}}function O(A){for(var I=0,g=0,C=0,B=0,Q=0;8!=(0|g);){for(Q=(g<<10)+A|0,I=0;256!=(0|I);)B=o[(C=(I<<2)+Q|0)>>2],o[C>>2]=B+(B>>31&8380417),I=I+1|0;g=g+1|0}}function T(A){var I=0,g=0;for(I=A,A=y(208),o[I>>2]=A,A||(f(111),Q());25!=(0|g);)o[(I=A+(g<<3)|0)>>2]=0,o[I+4>>2]=0,g=g+1|0;o[A+200>>2]=0,o[A+204>>2]=0}function x(A,I,g){for(var C=0,B=0,Q=0;256!=(0|B);)C=K(C=o[(Q=B<<2)+g>>2],C>>31,C=o[I+Q>>2],C>>31),o[A+Q>>2]=AA(C,h),B=B+1|0}function W(A){var I,g;return(A=(I=o[584])+(g=A+7&-8)|0)>>>0<=I>>>0&&g||A>>>0>(C.byteLength/65536|0)<<16>>>0&&!(0|c(0|A))?(o[775]=48,-1):(o[584]=A,I)}function P(A,I){var g=0,C=0;if((0|I)<=1047552)for(;;){if(256==(0|C))return 0;if(g=C<<2,C=C+1|0,!(((g=o[A+g>>2])-(g<<1&g>>31)|0)<(0|I)))break}return 1}function V(A){for(var I=0,g=0,C=0;256!=(0|I);)C=o[(g=(I<<2)+A|0)>>2],o[g>>2]=C+a(C+4194304>>23,-8380417),I=I+1|0}function X(A,I){var g;return g=A,A=a(I+127>>7,1025)+2097152>>>22&15,I=a(A,-523776)+I|0,o[g>>2]=((0|I)>4190208?-8380417:0)+I,A}function Z(A){for(var I=0,g=0;;){if(7==(0|I))return 0;if(g=I<<10,I=I+1|0,P(A+g|0,524168))break}return 1}function _(A,I){for(var g=0,C=0;;){if(8==(0|g))return 0;if(C=g<<10,g=g+1|0,P(A+C|0,I))break}return 1}function z(A,I,g){for(var C=0,B=0;256!=(0|C);)o[(B=C<<2)+A>>2]=o[g+B>>2]+o[I+B>>2],C=C+1|0}function $(A,I,g){var C;G=C=G-16|0,i[C+14|0]=g,i[C+15|0]=g>>>8,T(A),aA(A,I,64),aA(A,C+14|0,2),eA(A),G=C+16|0}function AA(A,I){var g=0;return K(A,I,0,58728449),g=K(g=h,g>>31,-8380417,-1),I=I+h|0,A+g>>>0<A>>>0?I+1|0:I}function IA(A,I,g){for(var C=0,B=0;8!=(0|C);)z((B=C<<10)+A|0,I+B|0,g+B|0),C=C+1|0}function gA(A,I,g){for(var C=0,B=0;8!=(0|C);)x((B=C<<10)+A|0,I,g+B|0),C=C+1|0}function CA(A,I){var g=0;for(g=7168;i[0|A]=n[0|I],A=A+1|0,I=I+1|0,g=g-1|0;);}function BA(A,I){for(var g=0;(0|I)!=(0|g);)R((g<<10)+A|0),g=g+1|0}function QA(A){for(var I=0;8!=(0|I);)V((I<<10)+A|0),I=I+1|0}function iA(A){for(var I=0;8!=(0|I);)k((I<<10)+A|0),I=I+1|0}function EA(A){var I;return(-1>>>(I=31&A)&-2)<<I|(-1<<(A=0-A&31)&-2)>>>A}function oA(A){return A?31-e(A-1^A)|0:32}function nA(A,I,g){N(A,I,o[g>>2],168)}function rA(A,I,g){Y(o[A>>2],168,I,g)}function tA(A,I,g){N(A,I,o[g>>2],136)}function aA(A,I,g){Y(o[A>>2],136,I,g)}function eA(A){d(o[A>>2],136)}function fA(A){s(o[A>>2])}function DA(A){BA(A,8)}function cA(A){BA(A,7)}B(I=n,1024,\"cmFuZG9tYnl0ZXMAbGlic29kaXVtL3NyYy9saWJzb2RpdW0vcmFuZG9tYnl0ZXMvcmFuZG9tYnl0ZXMuYwBidWZfbGVuIDw9IFNJWkVfTUFY\"),B(I,1120,\"AQAAAAAAAACCgAAAAAAAAIqAAAAAAACAAIAAgAAAAICLgAAAAAAAAAEAAIAAAAAAgYAAgAAAAIAJgAAAAAAAgIoAAAAAAAAAiAAAAAAAAAAJgACAAAAAAAoAAIAAAAAAi4AAgAAAAACLAAAAAAAAgImAAAAAAACAA4AAAAAAAIACgAAAAAAAgIAAAAAAAACACoAAAAAAAAAKAACAAAAAgIGAAIAAAACAgIAAAAAAAIABAACAAAAAAAiAAIAAAACAAAAAAPdkAAACMdj/AxX4/0SeAwAYIfT/KKHy/yQeBwAr3hsAK+kjAK2E+v9/FOD/dZovAAn70/9Jei8AJ+UoAFiWKQBwoA8ApIXv/4i3NgCQnff/oOru/2j5JwB709//1q3f/+caxf/3pOr/mPzN/zXQGgAitP//ATI9AMVFBABnSikAIHYBAM30LgDF3jUAA6Xm/ywwyf/UR9n/r747AIUVxf98jtH/loo2AEE+1P8ABDYATWr7/5zWIwBdxff/PRLm/9bq5v8efjUAWa/F/z+ENQAXVt//XJTn/4xzOACoYwwAmhsIAHaPDgBTODsANIU7ADD82P9UnR8ALU/V/+UGxP+BrOj/z+HH/xmY0f9d1un/7gk1AMc1IQC7z+f/dc/s/3KXHQBysMH/9rzw/4BSz/+u0s//4JDI/8rvAQDyEDQAhf7w/zjGIACfbikAo7fS/0ukx/9tuvn/CTTa/4LC9f8TQe3/O6b///cJ7P/dK/r/1JUUAGNFHABiLOr/6fvM//AKBAAXxAcAiEUvAACtAAC+Nu//RM0NAFpnPADKK8f/ft7//0g5GQDAac7/bHUkAN/H/P+hmAsACOjr/2zkAgAIyMn/wjYwAPa/4/+TPNv/4Er9/wUTFACSdxQAJZ4TAODQ5/9EmfP/Agjq/6Lu0f+cx8T/V6DI/9mXOgCT6h8AWv8zANRYIwD4QToAcv/M//s9IgCfq9r/IqTJ//USBACHJSUA8CTt/12bNQCgSMr//KLG/1a77f/eRc//Xr4NABpeHADm4A0AWn8MAIOPBwCKYuf/BFf///wG+P8hAPb/9lrQ/4QAHwCG7zAAfbnJ/9b89/+SRfT/wiHJ/xk5BQAMYQQAQc3a/xuwPgDncjQAOwDN/8d8GgAkGQMA5V4rAJkRKQA6etj/cU0TABzhPQCECRMAUfAlAEZaGAAYhcb/vhQTAJE4KACQ28n/iVDS/z+FHABLCx0Apvbv/76o6/8b4RIAPl7N/y8t6v/kHfn/xwYUAINyMgBuDeL/U3ns/5lAHQB4Jdn/rQXr/wXkFgDn2wsA6B0iAM/4MwA0uff/DMrU//h/5v9X0eP/G5HY/xIsx//YEAkAH17G/1hG4f+LHSUAt3MlAI98/f+Y3R0AmGgzALvUAgCnk+3/vmzP/xx8AgAIqhgAcf0tAKVcDACaNxkAZ6HH/z2M5P88odH/OcU1ABUBOwDAHQQA98QhAPQb8f/nNRoADjQHAEV9+f/QTBoArnzk/2gmHQCYjub/Mybv/9oF/P/bf8X/ZCfT/6/h3f/dk/n/CR3d/5PMAgAFGPH/KpwYAKnlyf9Qivf/LM87AE5D///fNuv/yhU8AGheFQC2FvP/zike\"),B(I,2336,\"EA6A\");var GA,hA=((GA=[]).set=function(A,I){this[A]=I},GA.get=function(A){return this[A]},GA);return{e:function(){},f:hA,g:y,h:s,i:function(){var A;G=A=G-16|0,i[A+15|0]=0,D(2376,A+15|0,0),G=A+16|0},j:function(){return 2592},k:function(){return 4864},l:function(){return 4597},m:function(A,I){A|=0,I|=0;var g,C=0,B=0,Q=0,E=0,r=0,t=0,e=0,f=0,c=0,h=0,y=0,u=0,s=0;for(G=g=G-96416|0,r=g+96288|0;32!=(0|B);)G=E=G-16|0,i[E+15|0]=0,t=0|D(2340,E+15|0,0),G=E+16|0,i[B+r|0]=t,B=B+1|0;for(F(r,128,r,32),S(E=g+38912|0,r),c=g+31744|0,B=g+96320|0;7!=(0|C);)v(c+(C<<10)|0,B,65535&Q),C=C+1|0,Q=Q+1|0;for(h=g+16384|0,C=0,Q=7;8!=(0|C);)v(h+(C<<10)|0,B,65535&Q),C=C+1|0,Q=Q+1|0;for(CA(C=g+24576|0,c),cA(C),m(Q=g- -8192|0,E,C),QA(Q),iA(Q),IA(Q,Q,h),O(Q),C=0;8!=(0|C);){for(y=(B=C<<10)+Q|0,e=B+g|0,f=B+Q|0,B=0;256!=(0|B);)t=(u=o[(E=B<<2)+f>>2])+4095|0,o[E+e>>2]=u-(-8192&t),o[E+y>>2]=t>>13,B=B+1|0;C=C+1|0}for(C=0;32!=(0|C);)i[A+C|0]=n[C+r|0],C=C+1|0;for(y=A+32|0,C=0;8!=(0|C);){for(e=y+a(C,320)|0,f=Q+(C<<10)|0,E=0;64!=(0|E);)t=e+a(E,5)|0,B=f+(E<<4)|0,i[0|t]=o[B>>2],i[t+1|0]=o[B+4>>2]<<2|o[B>>2]>>>8,i[t+2|0]=o[B+8>>2]<<4|o[B+4>>2]>>>6,i[t+3|0]=o[B+12>>2]<<6|o[B+8>>2]>>>4,i[t+4|0]=o[B+12>>2]>>>2,E=E+1|0;C=C+1|0}for(F(Q=g+96256|0,32,A,2592),A=g+96384|0,C=0;32!=(0|C);)i[I+C|0]=n[C+r|0],C=C+1|0;for(B=I+32|0,C=0;32!=(0|C);)i[C+B|0]=n[A+C|0],C=C+1|0;for(A=I- -64|0,C=0;32!=(0|C);)i[A+C|0]=n[C+Q|0],C=C+1|0;for(A=I+96|0,C=0;7!=(0|C);)M(A+a(C,96)|0,c+(C<<10)|0),C=C+1|0;for(A=I+768|0,C=0;8!=(0|C);)M(A+a(C,96)|0,h+(C<<10)|0),C=C+1|0;for(t=I+1536|0,C=0;8!=(0|C);){for(c=t+a(C,416)|0,h=(C<<10)+g|0,Q=0;32!=(0|Q);)y=o[(I=h+(Q<<5)|0)+20>>2],e=o[I+8>>2],f=o[I+28>>2],E=o[I+24>>2],r=o[I+16>>2],B=o[I+12>>2],u=o[I+4>>2],A=c+a(Q,13)|0,s=4096-o[I>>2]|0,i[0|A]=s,I=4096-u|0,i[A+2|0]=I>>>3,B=4096-B|0,i[A+5|0]=B>>>1,r=4096-r|0,i[A+7|0]=r>>>4,E=4096-E|0,i[A+10|0]=E>>>2,f=4096-f|0,i[A+12|0]=f>>>5,i[A+1|0]=I<<5|s>>>8,e=4096-e|0,i[A+3|0]=e<<2|I>>>11,i[A+4|0]=B<<7|e>>>6,i[A+6|0]=r<<4|B>>>9,I=4096-y|0,i[A+8|0]=I<<1|r>>>12,i[A+9|0]=E<<6|I>>>7,i[A+11|0]=f<<3|E>>>10,Q=Q+1|0;C=C+1|0}return G=g+96416|0,0},n:function(A,I,g,C){I|=0,g|=0,C|=0;var B,Q,r,t=0,e=0,f=0,D=0,c=0,h=0,y=0,u=0,s=0,Y=0,N=0,U=0,d=0,M=0,J=0,l=0,L=0,p=0,K=0,v=0;for(Q=(A|=0)+2|0,G=B=(G=r=G-16|0)-121072|0,e=U=B+120848|0,f=d=B+120880|0,D=B+120912|0,c=B+33808|0,h=B+56336|0,y=B+25616|0;32!=(0|t);)i[t+e|0]=n[C+t|0],t=t+1|0;for(e=C+32|0,t=0;32!=(0|t);)i[t+D|0]=n[t+e|0],t=t+1|0;for(e=C- -64|0,t=0;32!=(0|t);)i[t+f|0]=n[t+e|0],t=t+1|0;for(e=C+96|0,t=0;7!=(0|t);)H(h+(t<<10)|0,e+a(t,96)|0),t=t+1|0;for(e=C+768|0,t=0;8!=(0|t);)H(y+(t<<10)|0,e+a(t,96)|0),t=t+1|0;for(L=C+1536|0,t=0;8!=(0|t);){for(p=c+(t<<10)|0,K=L+a(t,416)|0,f=0;32!=(0|f);)C=p+(f<<5)|0,e=K+a(f,13)|0,M=n[0|e],o[C>>2]=M,M|=n[e+1|0]<<8&7936,o[C>>2]=M,u=n[e+1|0]>>>5|0,o[C+4>>2]=u,u|=n[e+2|0]<<3,o[C+4>>2]=u,u|=n[e+3|0]<<11&6144,o[C+4>>2]=u,J=n[e+3|0]>>>2|0,o[C+8>>2]=J,J|=n[e+4|0]<<6&8128,o[C+8>>2]=J,s=n[e+4|0]>>>7|0,o[C+12>>2]=s,s|=n[e+5|0]<<1,o[C+12>>2]=s,s|=n[e+6|0]<<9&7680,o[C+12>>2]=s,Y=n[e+6|0]>>>4|0,o[C+16>>2]=Y,Y|=n[e+7|0]<<4,o[C+16>>2]=Y,Y|=n[e+8|0]<<12&4096,o[C+16>>2]=Y,l=n[e+8|0]>>>1|0,o[C+20>>2]=l,l|=n[e+9|0]<<7&8064,o[C+20>>2]=l,N=n[e+9|0]>>>6|0,o[C+24>>2]=N,N|=n[e+10|0]<<2,o[C+24>>2]=N,N|=n[e+11|0]<<10&7168,o[C+24>>2]=N,v=n[e+11|0]>>>3|0,o[C+28>>2]=v,e=n[e+12|0],o[C+4>>2]=4096-u,o[C>>2]=4096-M,o[C+8>>2]=4096-J,o[C+12>>2]=4096-s,o[C+16>>2]=4096-Y,o[C+20>>2]=4096-l,o[C+24>>2]=4096-N,o[C+28>>2]=4096-(e<<5|v),f=f+1|0;t=t+1|0}for(T(C=B+12|0),aA(C,d,32),aA(C,I,g),eA(C),tA(d=B+120944|0,64,C),fA(C),F(L=B+121008|0,64,D,96),S(B+63504|0,U),cA(h),DA(y),DA(c),t=0;;){for(e=B+49168|0,f=a(65535&t,7),I=0;7!=(0|I);)G=g=G-704|0,$(C=g+12|0,L,I+f&65535),tA(D=g+16|0,680,C),fA(C),q(e+(I<<10)|0,D),G=g+704|0,I=I+1|0;for(CA(C=B+42e3|0,e),cA(C),m(I=B+17424|0,B+63504|0,C),QA(I),iA(I),O(I),c=B+9232|0,g=0;8!=(0|g);){for(h=(f=g<<10)+I|0,y=f+c|0,U=I+f|0,f=0;256!=(0|f);)o[(D=f<<2)+h>>2]=X(D+y|0,o[D+U>>2]),f=f+1|0;g=g+1|0}for(j(Q,I),T(I=B+12|0),aA(I,d,64),aA(I,Q,1024),eA(I),tA(Q,32,I),fA(I),w(I=B+16|0,Q),t=t+1|0,R(I),f=B+56336|0,g=0;7!=(0|g);)x((D=g<<10)+C|0,I,f+D|0),g=g+1|0;for(I=0;7!=(0|I);)k(C+(I<<10)|0),I=I+1|0;for(I=0;7!=(0|I);)z((g=I<<10)+C|0,g+C|0,g+e|0),I=I+1|0;for(g=0;7!=(0|g);)V(C+(g<<10)|0),g=g+1|0;if(!Z(C)&&(gA(g=B+1040|0,B+16|0,B+25616|0),iA(g),b(I=B+9232|0,I,g),QA(I),!_(I,261768)&&(gA(I=B+1040|0,B+16|0,B+33808|0),iA(I),QA(I),!_(I,261888)))){for(IA(e=B+9232|0,e,h=B+1040|0),y=B+17424|0,I=0,g=0;8!=(0|I);){for(U=(C=I<<10)+h|0,p=C+e|0,K=C+y|0,C=0,f=0;256!=(0|C);)c=-261888==(0|(c=o[(D=C<<2)+p>>2]))&0!=o[D+K>>2]|c-261889>>>0<4294443519,o[D+U>>2]=c,f=f+c|0,C=C+1|0;g=g+f|0,I=I+1|0}if(!(g>>>0>75))break}}for(f=B+42e3|0,D=B+1040|0,I=0;32!=(0|I);)i[0|(g=I+Q|0)]=n[0|g],I=I+1|0;for(c=Q+32|0,I=0;7!=(0|I);){for(h=c+a(I,640)|0,y=f+(I<<10)|0,g=0;128!=(0|g);)e=o[(t=y+(g<<3)|0)+4>>2],C=h+a(g,5)|0,t=524288-o[t>>2]|0,i[0|C]=t,i[C+1|0]=t>>>8,e=524288-e|0,i[C+3|0]=e>>>4,i[C+4|0]=e>>>12,i[C+2|0]=e<<4|t>>>16,g=g+1|0;I=I+1|0}for(t=Q+4512|0,g=0,I=0;;){if(83==(0|I)){for(C=0;8!=(0|g);){for(e=D+(g<<10)|0,I=0;256!=(0|I);)o[e+(I<<2)>>2]&&(i[C+t|0]=I,C=C+1|0),I=I+1|0;i[75+(g+t|0)|0]=C,g=g+1|0}break}i[I+t|0]=0,I=I+1|0}return o[r+12>>2]=4595,G=B+121072|0,E[A>>1]=o[r+12>>2],G=r+16|0,0},o:function(A,I,g,C){A|=0,I|=0,C|=0;var B,Q=0,E=0,t=0,e=0,f=0,D=0,c=0,h=0,y=0,u=0,s=0;t=(g|=0)+2|0,Q=r[g>>1],f=A,E=I,g=0,G=B=G-91312|0,u=-1;A:if(4595==(0|Q)){for(A=B+90256|0,h=B+16400|0,I=0;32!=(0|I);)i[A+I|0]=n[I+C|0],I=I+1|0;for(D=C+32|0,I=0;8!=(0|I);){for(c=h+(I<<10)|0,y=D+a(I,320)|0,Q=0;64!=(0|Q);)e=c+(Q<<4)|0,A=a(Q,5)+y|0,o[e>>2]=n[A+1|0]<<8&768|n[0|A],o[e+4>>2]=n[A+2|0]<<6&960|n[A+1|0]>>>2,o[e+8>>2]=n[A+3|0]<<4&1008|n[A+2|0]>>>4,o[e+12>>2]=n[A+4|0]<<2|n[A+3|0]>>>6,Q=Q+1|0;I=I+1|0}for(A=B+90160|0,I=B+24592|0,h=B+16|0;32!=(0|g);)i[A+g|0]=n[g+t|0],g=g+1|0;for(A=t+32|0,g=0;7!=(0|g);)q(I+(g<<10)|0,A+a(g,640)|0),g=g+1|0;t=t+4512|0,Q=0,A=0;I:{for(;;){g:if(8!=(0|Q)){for(e=h+(Q<<10)|0,g=0;256!=(0|g);)o[e+(g<<2)>>2]=0,g=g+1|0;if(!((I=n[(D=Q+t|0)+75|0])>>>0>75||(g=A,I>>>0<A>>>0))){for(;I>>>0>g>>>0;){if(A>>>0<g>>>0&(I=n[0|(c=g+t|0)])>>>0<=n[c-1|0])break g;o[e+(I<<2)>>2]=1,g=g+1|0,I=n[D+75|0]}Q=Q+1|0,A=I;continue}}else for(g=A>>>0<=75?75:A;;){if(I=0,(0|A)==(0|g))break I;if(I=A+t|0,A=A+1|0,n[0|I])break}break}I=1}if(!I&&!Z(B+24592|0)){for(F(Q=B+90192|0,32,C,2592),T(A=B+12|0),aA(A,Q,32),aA(A,f,E),eA(A),tA(Q,64,A),fA(A),w(E=B+89104|0,B+90160|0),S(I=B+31760|0,B+90256|0),cA(C=B+24592|0),m(g=B+8208|0,I,C),R(E),C=B+16400|0,I=0;8!=(0|I);){for(t=C+(I<<10)|0,f=0;256!=(0|f);)o[(e=t+(f<<2)|0)>>2]=o[e>>2]<<13,f=f+1|0;I=I+1|0}for(DA(C),gA(C,E,C),b(g,g,C),QA(g),iA(g),O(g),e=B+16|0,C=0;8!=(0|C);){for(h=(I=C<<10)+g|0,D=I+g|0,c=I+e|0,I=0;256!=(0|I);)y=(E=I<<2)+h|0,s=o[E+c>>2],G=f=G-16|0,E=t=X(f+12|0,o[E+D>>2]),s&&(E=t+1&15,o[f+12>>2]>0||(E=t-1&15)),G=f+16|0,o[y>>2]=E,I=I+1|0;C=C+1|0}for(j(I=B+90288|0,g),T(A),aA(A,Q,64),aA(A,I,1024),eA(A),tA(B+90128|0,32,A),fA(A),I=0;;){if(32==(0|I)){u=0;break A}if(A=(B+90128|0)+I|0,g=(B+90160|0)+I|0,I=I+1|0,n[0|g]!=n[0|A])break}}}return G=B+91312|0,0|u}}}(A)}(I)},instantiate:function(A,I){return{then:function(g){var C=new c.Module(A);g({instance:new c.Instance(C,I)})}}},RuntimeError:Error};a=[],\"object\"!=A(c)&&d(\"no native wasm support detected\");var G,h,y,u,s=!1;var F,Y,N=C.INITIAL_MEMORY||16777216;F=\"INITIAL_MEMORY should be larger than STACK_SIZE, was \"+N+\"! (STACK_SIZE=8388608)\",N>=8388608||d(F),f=C.wasmMemory?C.wasmMemory:new c.Memory({initial:N/65536,maximum:N/65536}),Y=f.buffer,C.HEAP8=G=new Int8Array(Y),C.HEAP16=new Int16Array(Y),C.HEAP32=y=new Int32Array(Y),C.HEAPU8=h=new Uint8Array(Y),C.HEAPU16=new Uint16Array(Y),C.HEAPU32=new Uint32Array(Y),C.HEAPF32=new Float32Array(Y),C.HEAPF64=u=new Float64Array(Y),N=f.buffer.byteLength;var w=[],S=[],k=[];var H=0,U=null,R=null;function d(A){throw C.onAbort&&C.onAbort(A),e(A=\"Aborted(\"+A+\")\"),s=!0,1,A+=\". Build with -sASSERTIONS for more info.\",new c.RuntimeError(A)}var M,J,q=\"data:application/octet-stream;base64,\";function l(A){return A.startsWith(q)}function m(A){return A.startsWith(\"file://\")}function L(A){return Promise.resolve().then((function(){return function(A){if(A==M&&a)return new Uint8Array(a);var I=P(A);if(I)return I;if(g)return g(A);throw\"both async and sync fetching of the wasm failed\"}(A)}))}function p(A,I,g,C){return function(A,I,g){return L(A).then((function(A){return c.instantiate(A,I)})).then((function(A){return A})).then(g,(function(A){e(\"failed to asynchronously prepare wasm: \"+A),d(A)}))}(I,g,C)}l(M=\"<<< WASM_BINARY_FILE >>>\")||(J=M,M=C.locateFile?C.locateFile(J,n):n+J);var K={2340:function(){return C.getRandomValue()},2376:function(){if(void 0===C.getRandomValue)try{var I=\"object\"===(\"undefined\"==typeof window?\"undefined\":A(window))?window:self,g=void 0!==I.crypto?I.crypto:I.msCrypto,B=function(){var A=new Uint32Array(1);return g.getRandomValues(A),A[0]>>>0};B(),C.getRandomValue=B}catch(A){try{var Q=eval(\"require\")(\"crypto\"),i=function(){var A=Q.randomBytes(4);return(A[0]<<24|A[1]<<16|A[2]<<8|A[3])>>>0};i(),C.getRandomValue=i}catch(A){throw\"No secure random number generator found\"}}}};function b(A){this.name=\"ExitStatus\",this.message=\"Program terminated with exit(\".concat(A,\")\"),this.status=A}var v=function(A){for(;A.length>0;)A.shift()(C)};\"undefined\"!=typeof TextDecoder&&new TextDecoder(\"utf8\");var j,O=[],T=function(A,I,g){var C=function(A,I){var g;for(O.length=0,I>>=2;g=h[A++];)I+=105!=g&I,O.push(105==g?y[I]:u[I++>>1]),++I;return O}(I,g);return K[A].apply(null,C)},x=function(A){A,D||(C.onExit&&C.onExit(A),s=!0),Q(A,new b(A))},W={c:function(A,I,g){return T(A,I,g)},d:function(A){h.length;d(\"OOM\")},b:function(A,I){A,x(A)},a:f};(function(){var A={a:W};function I(A,I){var g,B=A.exports;return C.asm=B,C.asm.f,g=C.asm.e,S.unshift(g),function(A){if(H--,C.monitorRunDependencies&&C.monitorRunDependencies(H),0==H&&(null!==U&&(clearInterval(U),U=null),R)){var I=R;R=null,I()}}(),B}if(H++,C.monitorRunDependencies&&C.monitorRunDependencies(H),C.instantiateWasm)try{return C.instantiateWasm(A,I)}catch(A){return e(\"Module.instantiateWasm callback failed with error: \"+A),!1}p(0,M,A,(function(A){I(A.instance)}))})(),C._malloc=function(){return(C._malloc=C.asm.g).apply(null,arguments)},C._free=function(){return(C._free=C.asm.h).apply(null,arguments)},C._dilithiumjs_init=function(){return(C._dilithiumjs_init=C.asm.i).apply(null,arguments)},C._dilithiumjs_public_key_bytes=function(){return(C._dilithiumjs_public_key_bytes=C.asm.j).apply(null,arguments)},C._dilithiumjs_secret_key_bytes=function(){return(C._dilithiumjs_secret_key_bytes=C.asm.k).apply(null,arguments)},C._dilithiumjs_signature_bytes=function(){return(C._dilithiumjs_signature_bytes=C.asm.l).apply(null,arguments)},C._dilithiumjs_keypair=function(){return(C._dilithiumjs_keypair=C.asm.m).apply(null,arguments)},C._dilithiumjs_sign=function(){return(C._dilithiumjs_sign=C.asm.n).apply(null,arguments)},C._dilithiumjs_verify=function(){return(C._dilithiumjs_verify=C.asm.o).apply(null,arguments)};function P(A){if(l(A))return function(A){if(void 0!==o&&o){var I=Buffer.from(A,\"base64\");return new Uint8Array(I.buffer,I.byteOffset,I.byteLength)}try{for(var g=atob(A),C=new Uint8Array(g.length),B=0;B<g.length;++B)C[B]=g.charCodeAt(B);return C}catch(A){throw new Error(\"Converting base64 string to bytes failed.\")}}(A.slice(q.length))}function V(){function A(){j||(j=!0,C.calledRun=!0,s||(!0,v(S),C.onRuntimeInitialized&&C.onRuntimeInitialized(),function(){if(C.postRun)for(\"function\"==typeof C.postRun&&(C.postRun=[C.postRun]);C.postRun.length;)A=C.postRun.shift(),k.unshift(A);var A;v(k)}()))}H>0||(!function(){if(C.preRun)for(\"function\"==typeof C.preRun&&(C.preRun=[C.preRun]);C.preRun.length;)A=C.preRun.shift(),w.unshift(A);var A;v(w)}(),H>0||(C.setStatus?(C.setStatus(\"Running...\"),setTimeout((function(){setTimeout((function(){C.setStatus(\"\")}),1),A()}),1)):A()))}if(C.writeArrayToMemory=function(A,I){G.set(A,I)},R=function A(){j||V(),j||(R=A)},C.preInit)for(\"function\"==typeof C.preInit&&(C.preInit=[C.preInit]);C.preInit.length>0;)C.preInit.pop()();return V(),new Promise((function(A,I){C.onAbort=I,C.onRuntimeInitialized=function(){A(C)}}))})).then((function(A){Object.keys(A).forEach((function(I){C[I]=A[I]}))}));var E=C.ready.then((function(){C._dilithiumjs_init(),A=C._dilithiumjs_public_key_bytes(),I=C._dilithiumjs_secret_key_bytes(),g=C._dilithiumjs_signature_bytes()})),o={publicKeyBytes:E.then((function(){return A})),privateKeyBytes:E.then((function(){return I})),bytes:E.then((function(){return g})),keyPair:function(){return E.then((function(){var g=C._malloc(A),E=C._malloc(I);try{return B(C._dilithiumjs_keypair(g,E),{publicKey:Q(g,A),privateKey:Q(E,I)})}finally{i(g),i(E)}}))},sign:function(A,I){return o.signDetached(A,I).then((function(I){var C=new Uint8Array(g+A.length);return C.set(I),C.set(A,g),C}))},signDetached:function(A,o){return E.then((function(){var E=C._malloc(g),n=C._malloc(A.length),r=C._malloc(I);C.writeArrayToMemory(new Uint8Array(g),E),C.writeArrayToMemory(A,n),C.writeArrayToMemory(o,r);try{return B(C._dilithiumjs_sign(E,n,A.length,r),Q(E,g))}finally{i(E),i(n),i(r)}}))},open:function(A,I){return E.then((function(){var C=new Uint8Array(A.buffer,A.byteOffset,g),B=new Uint8Array(A.buffer,A.byteOffset+g,A.length-g);return o.verifyDetached(C,B,I).then((function(A){if(A)return B;throw new Error(\"Failed to open Dilithium signed message.\")}))}))},verifyDetached:function(I,B,Q){return E.then((function(){var E=C._malloc(g),o=C._malloc(B.length),n=C._malloc(A);C.writeArrayToMemory(I,E),C.writeArrayToMemory(B,o),C.writeArrayToMemory(Q,n);try{return 0===C._dilithiumjs_verify(o,B.length,E,n)}finally{i(E),i(o),i(n)}}))}};return o}();\"undefined\"!=typeof module&&module.exports?(dilithium.dilithium=dilithium,module.exports=dilithium):self.dilithium=dilithium;", "/**\n * Browser entry point for @lumen/keys SDK\n * Includes WASM initialization and browser-compatible exports\n */\n\nimport { DefaultKeySDK } from './sdk.js';\nimport { \n InMemoryKeyStorage, \n KeyRegistry,\n SignatureSuiteRegistry,\n BsvEcdsaSuite,\n MlDsaSuite,\n} from '@smartledger/crypto';\nimport type { KeySDK } from './types.js';\n\n// Re-export all types for browser usage\nexport * from './types.js';\nexport { InMemoryKeyStorage } from '@smartledger/crypto';\n\n/**\n * Creates a new KeySDK instance for browser usage\n * Handles WASM initialization automatically\n */\nexport async function createKeySDK(): Promise<KeySDK> {\n const storage = new InMemoryKeyStorage();\n const keyRegistry = new KeyRegistry(storage);\n \n // Initialize suite registry with both ECDSA and ML-DSA\n const suiteRegistry = new SignatureSuiteRegistry();\n suiteRegistry.register(new BsvEcdsaSuite());\n suiteRegistry.register(new MlDsaSuite());\n \n const sdk = new DefaultKeySDK({\n keyRegistry,\n suiteRegistry,\n });\n \n // Pre-initialize WASM for ML-DSA if needed\n // The dilithium-crystals library will lazy-load WASM on first use\n \n return sdk;\n}\n\n/**\n * Browser-ready default export\n */\nexport default {\n createKeySDK,\n};\n\n// Global export for CDN usage\nif (typeof window !== 'undefined') {\n (window as any).LumenKeys = {\n createKeySDK,\n };\n}\n", "/**\n * Default implementation of KeySDK.\n * \n * Integrates KeyRegistry and SignatureSuiteRegistry to provide\n * a clean, high-level API for key operations.\n */\n\nimport {\n KeyRegistry,\n SignatureSuiteRegistry,\n KeyMeta,\n CryptoProfile,\n hashBytes,\n BIP32Derivation,\n InMemoryKeyStorage,\n BsvEcdsaSuite,\n MlDsa87Suite,\n} from '@smartledger/crypto';\nimport {\n KeySDK,\n KeyRecord,\n CreateKeyOptions,\n AgentKeyConfig,\n} from './types.js';\n\n/**\n * Configuration for DefaultKeySDK.\n */\nexport interface KeySDKConfig {\n /** Key registry instance */\n keyRegistry: KeyRegistry;\n \n /** Signature suite registry instance */\n suiteRegistry: SignatureSuiteRegistry;\n}\n\n/**\n * Default KeySDK implementation.\n * \n * Provides a simple, safe API for key operations while hiding complexity.\n */\nexport class DefaultKeySDK implements KeySDK {\n private keyRegistry: KeyRegistry;\n private suiteRegistry: SignatureSuiteRegistry;\n private keyCounter = new Map<string, number>(); // agentId -> counter\n \n constructor(config: KeySDKConfig) {\n this.keyRegistry = config.keyRegistry;\n this.suiteRegistry = config.suiteRegistry;\n }\n \n /**\n * Create a new key for an agent.\n */\n async createKey(\n agentId: string,\n profile: CryptoProfile,\n options: CreateKeyOptions = {}\n ): Promise<KeyRecord> {\n // Get suite\n const suite = this.suiteRegistry.getSuite(profile.primarySignatureSuite);\n \n // Generate keypair (with optional derivation)\n let keypair;\n \n if (options.derivationContext) {\n // Check if suite supports derivation\n if (!suite.capabilities?.derivation) {\n const available = this.getSuitesWithCapability('derivation');\n throw new Error(\n `Suite '${suite.suiteId}' does not support key derivation.\\n` +\n (available.length > 0\n ? `Suites with derivation capability: ${available.join(', ')}\\n` +\n `Consider using one of these suites or remove the derivationContext option.`\n : `No suites currently support derivation. Remove the derivationContext option.`)\n );\n }\n \n // Use derivation capability\n keypair = await suite.capabilities.derivation.deriveKeypair(options.derivationContext);\n } else {\n // Standard random key generation\n keypair = await suite.generateKeypair();\n }\n \n // Generate unique keyId\n const counter = this.getNextCounter(agentId);\n const suiteName = profile.primarySignatureSuite.split('-')[0]; // 'ml-dsa' or 'bsv'\n const keyId = `${agentId}:pk-${suiteName}-${counter}`;\n \n // Register key\n const meta = await this.keyRegistry.registerKey(\n keyId,\n keypair,\n profile.primarySignatureSuite,\n {\n expiresAt: options.expiresAt,\n usage: options.usage || ['signing'],\n cryptoProfileVersion: options.cryptoProfileVersion || '1.0.0',\n }\n );\n \n return {\n meta,\n publicKey: keypair.publicKey,\n };\n }\n \n /**\n * Get an existing key.\n */\n async getKey(keyId: string): Promise<KeyRecord | null> {\n const result = await this.keyRegistry.getPublicKey(keyId);\n \n if (!result) {\n return null;\n }\n \n return {\n meta: result.meta,\n publicKey: result.publicKey,\n };\n }\n \n /**\n * Sign with a key (private key never exposed).\n */\n async signWithKey(\n keyId: string,\n message: Uint8Array\n ): Promise<Uint8Array> {\n // Get full keypair (private access)\n const result = await this.keyRegistry.getKey(keyId);\n \n if (!result) {\n throw new Error(`Key not found: ${keyId}`);\n }\n \n if (result.meta.status !== 'active') {\n throw new Error(`Key is not active: ${keyId} (status: ${result.meta.status})`);\n }\n \n // Get suite and sign\n const suite = this.suiteRegistry.getSuite(result.meta.suiteId);\n \n // Hash the message (consistent with signAgentResponse)\n const hashAlg = this.getHashAlgorithm(result.meta.suiteId);\n const messageHash = await hashBytes(message, hashAlg);\n \n return await suite.sign(result.keypair.privateKey, messageHash);\n }\n \n /**\n * Verify a signature.\n */\n async verifySignature(\n keyId: string,\n message: Uint8Array,\n signature: Uint8Array\n ): Promise<boolean> {\n const result = await this.keyRegistry.getPublicKey(keyId);\n \n if (!result) {\n return false;\n }\n \n const suite = this.suiteRegistry.getSuite(result.meta.suiteId);\n \n // Hash the message\n const hashAlg = this.getHashAlgorithm(result.meta.suiteId);\n const messageHash = await hashBytes(message, hashAlg);\n \n try {\n return await suite.verify(result.publicKey, messageHash, signature);\n } catch {\n return false;\n }\n }\n \n /**\n * List keys for an agent.\n */\n async listKeysForAgent(\n agentId: string,\n activeOnly: boolean = true\n ): Promise<KeyRecord[]> {\n const keys = activeOnly\n ? await this.keyRegistry.listActiveKeys()\n : await this.keyRegistry.listKeys();\n \n // Filter by agentId prefix\n const agentKeys = keys.filter(meta => meta.keyId.startsWith(`${agentId}:`));\n \n // Convert to KeyRecords\n const records: KeyRecord[] = [];\n \n for (const meta of agentKeys) {\n const result = await this.keyRegistry.getPublicKey(meta.keyId);\n if (result) {\n records.push({\n meta: result.meta,\n publicKey: result.publicKey,\n });\n }\n }\n \n return records;\n }\n \n /**\n * Get active crypto profile for an agent.\n */\n async getActiveCryptoProfile(agentId: string): Promise<CryptoProfile | null> {\n const keys = await this.listKeysForAgent(agentId, true);\n \n if (keys.length === 0) {\n return null;\n }\n \n // Group by suite\n const suites = new Set(keys.map(k => k.meta.suiteId));\n const suiteArray = Array.from(suites);\n \n // Assume first is primary, second is secondary\n return {\n primarySignatureSuite: suiteArray[0],\n secondarySignatureSuite: suiteArray[1],\n };\n }\n \n /**\n * Rotate all keys for an agent.\n */\n async rotateAgentKeys(agentId: string): Promise<KeyRecord[]> {\n const activeKeys = await this.listKeysForAgent(agentId, true);\n const newKeys: KeyRecord[] = [];\n \n for (const keyRecord of activeKeys) {\n // Generate new keypair\n const suite = this.suiteRegistry.getSuite(keyRecord.meta.suiteId);\n const newKeypair = await suite.generateKeypair();\n \n // Generate new keyId (increment counter)\n const counter = this.getNextCounter(agentId);\n const suiteName = keyRecord.meta.suiteId.split('-')[0];\n const newKeyId = `${agentId}:pk-${suiteName}-${counter}`;\n \n // Rotate\n const newMeta = await this.keyRegistry.rotateKey(\n keyRecord.meta.keyId,\n newKeyId,\n newKeypair\n );\n \n newKeys.push({\n meta: newMeta,\n publicKey: newKeypair.publicKey,\n });\n }\n \n return newKeys;\n }\n \n /**\n * Get or create key (idempotent).\n */\n async getOrCreateKey(\n agentId: string,\n profile: CryptoProfile,\n options: CreateKeyOptions = {}\n ): Promise<KeyRecord> {\n // Check if key exists\n const existingKeys = await this.listKeysForAgent(agentId, true);\n \n const primaryKey = existingKeys.find(\n k => k.meta.suiteId === profile.primarySignatureSuite\n );\n \n if (primaryKey) {\n return primaryKey;\n }\n \n // Create new key\n return await this.createKey(agentId, profile, options);\n }\n \n /**\n * Generate a new BIP39 mnemonic phrase.\n * \n * @param strength 128 (12 words) or 256 (24 words)\n * @returns Mnemonic phrase\n */\n generateMnemonic(strength: 128 | 256 = 256): string {\n const bip32 = new BIP32Derivation();\n return bip32.generateMnemonic(strength);\n }\n \n /**\n * Create a key from a BIP39 mnemonic using HD derivation.\n * \n * Only works with suites that support BIP32 derivation (e.g., bsv-ecdsa-secp256k1).\n * \n * @param agentId Agent identifier\n * @param profile Crypto profile (must use derivation-capable suite)\n * @param mnemonic BIP39 mnemonic phrase\n * @param path BIP32 derivation path (default: \"m/44'/0'/0'/0/0\")\n * @param passphrase Optional BIP39 passphrase\n * @param options Additional key creation options\n * @returns KeyRecord with derived key\n */\n async createKeyFromMnemonic(\n agentId: string,\n profile: CryptoProfile,\n mnemonic: string,\n path: string = BIP32Derivation.bitcoinPath(0, 0, 0),\n passphrase?: string,\n options: CreateKeyOptions = {}\n ): Promise<KeyRecord> {\n const bip32 = new BIP32Derivation();\n const seed = bip32.mnemonicToSeed(mnemonic, passphrase);\n \n return await this.createKey(agentId, profile, {\n ...options,\n derivationContext: {\n seed,\n path,\n },\n });\n }\n \n /**\n * Get available capabilities for a specific suite.\n * \n * @param suiteId Suite identifier\n * @returns Array of capability names\n */\n getCapabilities(suiteId: string): string[] {\n const suite = this.suiteRegistry.getSuite(suiteId);\n const caps: string[] = [];\n \n if (suite.capabilities?.derivation) caps.push('derivation');\n if ((suite.capabilities as any)?.encryption) caps.push('encryption');\n if ((suite.capabilities as any)?.threshold) caps.push('threshold');\n \n return caps;\n }\n \n /**\n * Get all suite IDs that support a specific capability.\n * \n * @param capability Capability name\n * @returns Array of suite IDs\n */\n getSuitesWithCapability(capability: 'derivation' | 'encryption' | 'threshold'): string[] {\n const allSuites = this.suiteRegistry.getAllSuites();\n return allSuites\n .filter(suite => !!(suite.capabilities as any)?.[capability])\n .map(suite => suite.suiteId);\n }\n \n /**\n * Create a Bitcoin wallet key from mnemonic (convenience method).\n * \n * Uses standard BIP44 Bitcoin path: m/44'/0'/account'/change/addressIndex\n * \n * @param agentId Agent identifier\n * @param mnemonic BIP39 mnemonic phrase\n * @param accountIndex Account index (default: 0)\n * @param addressIndex Address index (default: 0)\n * @param isChange Use change address path (default: false)\n * @param options Additional key creation options\n * @returns KeyRecord with Bitcoin-compatible key\n */\n async createBitcoinWalletKey(\n agentId: string,\n mnemonic: string,\n accountIndex = 0,\n addressIndex = 0,\n isChange = false,\n options: CreateKeyOptions = {}\n ): Promise<KeyRecord> {\n const path = BIP32Derivation.bitcoinPath(accountIndex, isChange ? 1 : 0, addressIndex);\n \n return this.createKeyFromMnemonic(\n agentId,\n { primarySignatureSuite: 'bsv-ecdsa-secp256k1' },\n mnemonic,\n path,\n undefined,\n options\n );\n }\n \n /**\n * Helper: Get hash algorithm for a suite.\n */\n private getHashAlgorithm(suiteId: string): 'sha256' | 'sha3-256' | 'sha512' {\n if (suiteId.startsWith('ml-dsa')) {\n return 'sha3-256';\n }\n return 'sha256';\n }\n \n /**\n * Helper: Get next counter for an agent.\n */\n private getNextCounter(agentId: string): number {\n const current = this.keyCounter.get(agentId) || 0;\n const next = current + 1;\n this.keyCounter.set(agentId, next);\n return next;\n }\n}\n\n/**\n * Create a KeySDK instance with default configuration\n * \n * Uses in-memory storage and registers both ECDSA and ML-DSA suites.\n * For custom storage or different suites, instantiate DefaultKeySDK directly.\n * \n * @example\n * ```typescript\n * import { createKeySDK } from '@smartledger/keys';\n * \n * const sdk = createKeySDK();\n * const key = await sdk.createKey('my-agent', { primarySignatureSuite: 'ml-dsa-87' });\n * ```\n */\nexport function createKeySDK(config?: Partial<KeySDKConfig>): KeySDK {\n const keyRegistry = config?.keyRegistry || new KeyRegistry(new InMemoryKeyStorage());\n const suiteRegistry = config?.suiteRegistry || new SignatureSuiteRegistry();\n \n // Register default suites if not provided\n if (!config?.suiteRegistry) {\n suiteRegistry.register(new BsvEcdsaSuite());\n suiteRegistry.register(new MlDsa87Suite());\n }\n \n return new DefaultKeySDK({\n keyRegistry,\n suiteRegistry,\n });\n}\n", "/**\n * @smartledger/crypto - Pluggable cryptographic signature suite system\n *\n * Provides crypto-agnostic signing and verification for agent black-box modules\n * with support for ECDSA, post-quantum signatures (ML-DSA), and hybrid modes.\n */\nexport * from './types.js';\nexport * from './registry.js';\nexport * from './utils.js';\nexport * from './signing.js';\nexport * from './key-registry.js';\nexport * from './errors.js';\nexport * from './stateless.js';\n// Suite implementations\nexport { BsvEcdsaSuite } from './suites/bsv-ecdsa.js';\nexport { MlDsaSuite, MlDsa87Suite } from './suites/ml-dsa.js';\n// Derivation utilities\nexport { BIP32Derivation } from './derivation/bip32.js';\nexport { encodeWIF, decodeWIF } from './derivation/wif.js';\n// Re-export global registry for convenience\nexport { globalRegistry } from './registry.js';\n", "/**\n * Core types for the pluggable cryptographic signature system\n */\nexport {};\n", "/**\n * Registry for managing signature suite implementations\n */\nexport class SignatureSuiteRegistry {\n suites = new Map();\n /**\n * Register a signature suite implementation\n */\n register(suite) {\n if (this.suites.has(suite.suiteId)) {\n throw new Error(`Signature suite already registered: ${suite.suiteId}`);\n }\n this.suites.set(suite.suiteId, suite);\n }\n /**\n * Get a signature suite by ID\n * @throws Error if suite is not registered\n */\n getSuite(suiteId) {\n const suite = this.suites.get(suiteId);\n if (!suite) {\n throw new Error(`Unknown signature suite: ${suiteId}. Available: ${this.listSuites().join(', ')}`);\n }\n return suite;\n }\n /**\n * Check if a suite is registered\n */\n hasSuite(suiteId) {\n return this.suites.has(suiteId);\n }\n /**\n * List all registered suite IDs\n */\n listSuites() {\n return [...this.suites.keys()];\n }\n /**\n * Get all registered suite objects\n */\n getAllSuites() {\n return [...this.suites.values()];\n }\n /**\n * Unregister a suite (primarily for testing)\n */\n unregister(suiteId) {\n return this.suites.delete(suiteId);\n }\n /**\n * Clear all registered suites (primarily for testing)\n */\n clear() {\n this.suites.clear();\n }\n}\n// Global singleton instance\nexport const globalRegistry = new SignatureSuiteRegistry();\n", "/**\n * Utility functions for cryptographic operations\n */\n/**\n * Canonicalize a JSON object to a stable string representation\n * Uses RFC 8785 (JSON Canonicalization Scheme) approach\n */\nexport function canonicalizeJson(obj) {\n if (obj === null)\n return 'null';\n if (typeof obj !== 'object')\n return JSON.stringify(obj);\n if (Array.isArray(obj)) {\n return '[' + obj.map(canonicalizeJson).join(',') + ']';\n }\n // Sort object keys and recursively canonicalize\n const keys = Object.keys(obj).sort();\n const pairs = keys.map(key => `\"${key}\":${canonicalizeJson(obj[key])}`);\n return '{' + pairs.join(',') + '}';\n}\n/**\n * Convert string to UTF-8 bytes\n */\nexport function stringToBytes(str) {\n return new TextEncoder().encode(str);\n}\n/**\n * Convert bytes to UTF-8 string\n */\nexport function bytesToString(bytes) {\n return new TextDecoder().decode(bytes);\n}\n/**\n * Convert bytes to hex string\n */\nexport function bytesToHex(bytes) {\n return Array.from(bytes)\n .map(b => b.toString(16).padStart(2, '0'))\n .join('');\n}\n/**\n * Convert hex string to bytes\n */\nexport function hexToBytes(hex) {\n if (hex.length % 2 !== 0) {\n throw new Error('Hex string must have even length');\n }\n const bytes = new Uint8Array(hex.length / 2);\n for (let i = 0; i < hex.length; i += 2) {\n bytes[i / 2] = parseInt(hex.slice(i, i + 2), 16);\n }\n return bytes;\n}\n/**\n * Convert bytes to base64url (URL-safe base64 without padding)\n */\nexport function bytesToBase64Url(bytes) {\n const base64 = Buffer.from(bytes).toString('base64');\n return base64\n .replace(/\\+/g, '-')\n .replace(/\\//g, '_')\n .replace(/=/g, '');\n}\n/**\n * Convert base64url to bytes\n */\nexport function base64UrlToBytes(base64url) {\n // Add padding if needed\n let base64 = base64url.replace(/-/g, '+').replace(/_/g, '/');\n const padding = base64.length % 4;\n if (padding) {\n base64 += '='.repeat(4 - padding);\n }\n return new Uint8Array(Buffer.from(base64, 'base64'));\n}\n/**\n * Secure constant-time comparison of two byte arrays\n */\nexport function constantTimeEqual(a, b) {\n if (a.length !== b.length)\n return false;\n let result = 0;\n for (let i = 0; i < a.length; i++) {\n result |= a[i] ^ b[i];\n }\n return result === 0;\n}\n/**\n * Zero out a byte array (for secure key cleanup)\n */\nexport function zeroBytes(bytes) {\n bytes.fill(0);\n}\n/**\n * Create a hash of the given bytes using the specified algorithm\n */\nexport async function hashBytes(bytes, algorithm) {\n if (algorithm === 'sha256') {\n const crypto = await import('crypto');\n return new Uint8Array(crypto.createHash('sha256').update(bytes).digest());\n }\n else if (algorithm === 'sha512') {\n const crypto = await import('crypto');\n return new Uint8Array(crypto.createHash('sha512').update(bytes).digest());\n }\n else if (algorithm === 'sha3-256') {\n const crypto = await import('crypto');\n return new Uint8Array(crypto.createHash('sha3-256').update(bytes).digest());\n }\n throw new Error(`Unsupported hash algorithm: ${algorithm}`);\n}\n", "import { canonicalizeJson, stringToBytes, bytesToBase64Url, base64UrlToBytes, hashBytes, } from './utils.js';\n/**\n * Sign an agent response with one or two signature suites\n */\nexport async function signAgentResponse(agentMeta, payload, primaryKey, primaryKeyBytes, registry, secondaryKey, secondaryKeyBytes) {\n // Canonicalize the payload\n const canonicalPayload = canonicalizeJson(payload);\n const payloadBytes = stringToBytes(canonicalPayload);\n const signatures = [];\n // Primary signature\n const primarySuite = registry.getSuite(primaryKey.suiteId);\n const primaryHashAlg = getHashAlgorithm(primaryKey.suiteId);\n const primaryHash = await hashBytes(payloadBytes, primaryHashAlg);\n const primarySig = await primarySuite.sign(primaryKeyBytes, primaryHash);\n signatures.push({\n suiteId: primaryKey.suiteId,\n keyId: primaryKey.keyId,\n hashAlgorithm: primaryHashAlg,\n payloadHash: bytesToBase64Url(primaryHash),\n signature: bytesToBase64Url(primarySig),\n });\n // Secondary signature (for hybrid mode)\n if (secondaryKey && secondaryKeyBytes) {\n const secondarySuite = registry.getSuite(secondaryKey.suiteId);\n const secondaryHashAlg = getHashAlgorithm(secondaryKey.suiteId);\n const secondaryHash = await hashBytes(payloadBytes, secondaryHashAlg);\n const secondarySig = await secondarySuite.sign(secondaryKeyBytes, secondaryHash);\n signatures.push({\n suiteId: secondaryKey.suiteId,\n keyId: secondaryKey.keyId,\n hashAlgorithm: secondaryHashAlg,\n payloadHash: bytesToBase64Url(secondaryHash),\n signature: bytesToBase64Url(secondarySig),\n });\n }\n const signatureMetadata = {\n format: 'lumen.signature.v1',\n mode: signatures.length > 1 ? 'hybrid' : 'single',\n signatures,\n };\n // Add policy for hybrid mode\n if (signatures.length > 1 && agentMeta.cryptoProfile.primarySignatureSuite) {\n signatureMetadata.policy = {\n threshold: 'all',\n requiredSuites: [agentMeta.cryptoProfile.primarySignatureSuite],\n };\n }\n return {\n agent: agentMeta.agentId,\n version: agentMeta.version,\n timestamp: new Date().toISOString(),\n payload,\n _signature: signatureMetadata,\n };\n}\n/**\n * Verify a signed envelope\n */\nexport async function verifySignedEnvelope(envelope, registry, publicKeys) {\n const results = [];\n // Canonicalize the payload\n const canonicalPayload = canonicalizeJson(envelope.payload);\n const payloadBytes = stringToBytes(canonicalPayload);\n // Verify each signature\n for (const sigEntry of envelope._signature.signatures) {\n try {\n const suite = registry.getSuite(sigEntry.suiteId);\n const publicKey = publicKeys.get(sigEntry.keyId);\n if (!publicKey) {\n results.push({\n suiteId: sigEntry.suiteId,\n keyId: sigEntry.keyId,\n valid: false,\n error: 'Public key not found',\n });\n continue;\n }\n // Verify hash matches\n const computedHash = await hashBytes(payloadBytes, sigEntry.hashAlgorithm);\n const expectedHash = base64UrlToBytes(sigEntry.payloadHash);\n if (!arraysEqual(computedHash, expectedHash)) {\n results.push({\n suiteId: sigEntry.suiteId,\n keyId: sigEntry.keyId,\n valid: false,\n error: 'Payload hash mismatch',\n });\n continue;\n }\n // Verify signature\n const signature = base64UrlToBytes(sigEntry.signature);\n const valid = await suite.verify(publicKey, computedHash, signature);\n results.push({\n suiteId: sigEntry.suiteId,\n keyId: sigEntry.keyId,\n valid,\n error: valid ? undefined : 'Signature verification failed',\n });\n }\n catch (error) {\n results.push({\n suiteId: sigEntry.suiteId,\n keyId: sigEntry.keyId,\n valid: false,\n error: error instanceof Error ? error.message : String(error),\n });\n }\n }\n // Apply policy\n const policyMet = checkPolicy(envelope._signature, results);\n return {\n valid: policyMet && results.every(r => r.valid),\n details: {\n signatureResults: results,\n policyMet,\n timestamp: new Date().toISOString(),\n },\n };\n}\n/**\n * Check if signature policy is satisfied\n */\nfunction checkPolicy(signature, results) {\n const policy = signature.policy;\n if (!policy) {\n // No policy - all signatures must be valid\n return results.every(r => r.valid);\n }\n const validResults = results.filter(r => r.valid);\n // Check required suites\n if (policy.requiredSuites) {\n const requiredValid = policy.requiredSuites.every(suiteId => validResults.some(r => r.suiteId === suiteId));\n if (!requiredValid)\n return false;\n }\n // Check threshold\n switch (policy.threshold) {\n case 'any':\n return validResults.length > 0;\n case 'all':\n return validResults.length === results.length;\n case 'quorum':\n return validResults.length >= (policy.quorumCount || 0);\n default:\n return validResults.length === results.length;\n }\n}\n/**\n * Get recommended hash algorithm for a suite\n */\nfunction getHashAlgorithm(suiteId) {\n if (suiteId.startsWith('bsv-ecdsa'))\n return 'sha256';\n if (suiteId.startsWith('ml-dsa'))\n return 'sha3-256';\n if (suiteId.startsWith('fn-dsa'))\n return 'sha3-256';\n if (suiteId.startsWith('slh-dsa'))\n return 'sha256';\n return 'sha256'; // default\n}\n/**\n * Helper to compare byte arrays\n */\nfunction arraysEqual(a, b) {\n if (a.length !== b.length)\n return false;\n for (let i = 0; i < a.length; i++) {\n if (a[i] !== b[i])\n return false;\n }\n return true;\n}\n", "/**\n * Key Registry for managing cryptographic keypairs across signature suites.\n *\n * Handles:\n * - Key lifecycle (creation, rotation, expiration, revocation)\n * - Storage abstraction (in-memory, file, KMS/HSM)\n * - Key metadata tracking (suiteId, usage, timestamps)\n * - Security best practices (key zeroing, access control)\n */\n/**\n * In-memory key storage (for testing/development only).\n */\nexport class InMemoryKeyStorage {\n keys = new Map();\n async store(keyId, keypair, meta) {\n this.keys.set(keyId, { keypair, meta });\n }\n async load(keyId) {\n return this.keys.get(keyId) || null;\n }\n async list(filter) {\n const allMeta = Array.from(this.keys.values()).map(k => k.meta);\n if (!filter) {\n return allMeta;\n }\n return allMeta.filter(meta => {\n return Object.entries(filter).every(([key, value]) => {\n if (key === 'usage' && Array.isArray(value)) {\n // Check if any usage matches\n return value.some(u => meta.usage.includes(u));\n }\n return meta[key] === value;\n });\n });\n }\n async delete(keyId) {\n this.keys.delete(keyId);\n }\n async updateMeta(keyId, updates) {\n const existing = this.keys.get(keyId);\n if (!existing) {\n throw new Error(`Key not found: ${keyId}`);\n }\n this.keys.set(keyId, {\n keypair: existing.keypair,\n meta: { ...existing.meta, ...updates },\n });\n }\n /**\n * Clear all keys (testing only).\n */\n clear() {\n this.keys.clear();\n }\n}\n/**\n * KeyRegistry manages the lifecycle of cryptographic keys.\n *\n * Features:\n * - Register new keypairs with metadata\n * - Retrieve keys by ID or filter\n * - Key rotation with audit trail\n * - Expiration and revocation\n * - Storage backend abstraction\n */\nexport class KeyRegistry {\n storage;\n constructor(storage = new InMemoryKeyStorage()) {\n this.storage = storage;\n }\n /**\n * Register a new keypair with metadata.\n */\n async registerKey(keyId, keypair, suiteId, options = {}) {\n const meta = {\n keyId,\n suiteId,\n createdAt: new Date().toISOString(),\n expiresAt: options.expiresAt,\n usage: options.usage || ['signing'],\n cryptoProfileVersion: options.cryptoProfileVersion || '1.0.0',\n status: options.status || 'active',\n };\n await this.storage.store(keyId, keypair, meta);\n return meta;\n }\n /**\n * Get a keypair and its metadata.\n */\n async getKey(keyId) {\n return await this.storage.load(keyId);\n }\n /**\n * Get only the public key (no private key).\n */\n async getPublicKey(keyId) {\n const result = await this.storage.load(keyId);\n if (!result)\n return null;\n return {\n publicKey: result.keypair.publicKey,\n meta: result.meta,\n };\n }\n /**\n * List all keys matching optional filter.\n */\n async listKeys(filter) {\n return await this.storage.list(filter);\n }\n /**\n * List only active, non-expired keys.\n */\n async listActiveKeys(filter) {\n const allKeys = await this.storage.list(filter);\n const now = new Date();\n return allKeys.filter(meta => {\n // Check status\n if (meta.status && meta.status !== 'active') {\n return false;\n }\n // Check expiration\n if (meta.expiresAt && new Date(meta.expiresAt) < now) {\n return false;\n }\n return true;\n });\n }\n /**\n * Rotate a key: generate new keypair, mark old as 'rotated'.\n *\n * Returns the new key's metadata.\n */\n async rotateKey(oldKeyId, newKeyId, newKeypair) {\n // Get old key to copy metadata\n const oldKey = await this.storage.load(oldKeyId);\n if (!oldKey) {\n throw new Error(`Cannot rotate: key not found: ${oldKeyId}`);\n }\n // Mark old key as rotated\n await this.storage.updateMeta(oldKeyId, {\n status: 'rotated',\n });\n // Register new key with same suite/usage\n await this.registerKey(newKeyId, newKeypair, oldKey.meta.suiteId, {\n usage: oldKey.meta.usage,\n cryptoProfileVersion: oldKey.meta.cryptoProfileVersion,\n expiresAt: oldKey.meta.expiresAt,\n status: 'active',\n });\n // Add rotation link\n await this.storage.updateMeta(newKeyId, {\n rotatedFrom: oldKeyId,\n });\n // Return updated metadata\n const result = await this.storage.load(newKeyId);\n return result.meta;\n }\n /**\n * Revoke a key (marks as unusable, but doesn't delete).\n */\n async revokeKey(keyId, reason) {\n await this.storage.updateMeta(keyId, {\n status: 'revoked',\n revokedAt: new Date().toISOString(),\n });\n }\n /**\n * Delete a key permanently (use with caution).\n */\n async deleteKey(keyId) {\n await this.storage.delete(keyId);\n }\n /**\n * Mark expired keys as 'expired' status.\n * Returns count of keys marked expired.\n */\n async markExpiredKeys() {\n const allKeys = await this.storage.list();\n const now = new Date();\n let count = 0;\n for (const meta of allKeys) {\n if (meta.expiresAt && new Date(meta.expiresAt) < now && meta.status === 'active') {\n await this.storage.updateMeta(meta.keyId, {\n status: 'expired',\n });\n count++;\n }\n }\n return count;\n }\n /**\n * Cleanup: delete keys that have been revoked/expired for longer than retention period.\n *\n * @param retentionDays How many days to keep revoked/expired keys (default: 90)\n */\n async pruneOldKeys(retentionDays = 90) {\n const allKeys = await this.storage.list();\n const cutoffDate = new Date();\n cutoffDate.setDate(cutoffDate.getDate() - retentionDays);\n let count = 0;\n for (const meta of allKeys) {\n const shouldPrune = (meta.status === 'revoked' && meta.revokedAt && new Date(meta.revokedAt) < cutoffDate) ||\n (meta.status === 'expired' && meta.expiresAt && new Date(meta.expiresAt) < cutoffDate);\n if (shouldPrune) {\n await this.storage.delete(meta.keyId);\n count++;\n }\n }\n return count;\n }\n}\n", "/**\n * Explicit error types for SmartLedger cryptographic operations.\n * These errors provide clear, actionable feedback for debugging and auditing.\n */\n/**\n * Base class for all SmartLedger crypto errors.\n */\nexport class SmartLedgerCryptoError extends Error {\n code;\n constructor(message, code) {\n super(message);\n this.code = code;\n this.name = this.constructor.name;\n Error.captureStackTrace(this, this.constructor);\n }\n}\n/**\n * Thrown when a requested key cannot be found.\n */\nexport class KeyNotFoundError extends SmartLedgerCryptoError {\n keyId;\n constructor(keyId) {\n super(`Key not found: ${keyId}`, 'KEY_NOT_FOUND');\n this.keyId = keyId;\n }\n}\n/**\n * Thrown when attempting to use an expired key.\n */\nexport class KeyExpiredError extends SmartLedgerCryptoError {\n keyId;\n expiresAt;\n constructor(keyId, expiresAt) {\n super(`Key expired: ${keyId} (expired at ${expiresAt})`, 'KEY_EXPIRED');\n this.keyId = keyId;\n this.expiresAt = expiresAt;\n }\n}\n/**\n * Thrown when a key is in an invalid state for the requested operation.\n */\nexport class KeyInvalidStateError extends SmartLedgerCryptoError {\n keyId;\n currentState;\n requiredState;\n constructor(keyId, currentState, requiredState) {\n super(`Key in invalid state: ${keyId} (current: ${currentState}, required: ${requiredState})`, 'KEY_INVALID_STATE');\n this.keyId = keyId;\n this.currentState = currentState;\n this.requiredState = requiredState;\n }\n}\n/**\n * Thrown when a suite is not allowed by the active compliance profile.\n */\nexport class SuiteNotAllowedError extends SmartLedgerCryptoError {\n suiteId;\n profileName;\n constructor(suiteId, profileName) {\n const profileMsg = profileName ? ` in profile ${profileName}` : '';\n super(`Suite not allowed: ${suiteId}${profileMsg}`, 'SUITE_NOT_ALLOWED');\n this.suiteId = suiteId;\n this.profileName = profileName;\n }\n}\n/**\n * Thrown when a requested suite cannot be found.\n */\nexport class SuiteNotFoundError extends SmartLedgerCryptoError {\n suiteId;\n constructor(suiteId) {\n super(`Suite not found: ${suiteId}`, 'SUITE_NOT_FOUND');\n this.suiteId = suiteId;\n }\n}\n/**\n * Thrown when signature verification fails.\n */\nexport class InvalidSignatureError extends SmartLedgerCryptoError {\n keyId;\n constructor(keyId, message = 'Signature verification failed') {\n super(message, 'INVALID_SIGNATURE');\n this.keyId = keyId;\n }\n}\n/**\n * Thrown when a cryptographic operation fails.\n */\nexport class CryptoOperationError extends SmartLedgerCryptoError {\n operation;\n cause;\n constructor(operation, message, cause) {\n super(`Cryptographic operation failed (${operation}): ${message}`, 'CRYPTO_OPERATION_FAILED');\n this.operation = operation;\n this.cause = cause;\n }\n}\n/**\n * Thrown when key parameters are invalid.\n */\nexport class InvalidKeyParametersError extends SmartLedgerCryptoError {\n constructor(message) {\n super(`Invalid key parameters: ${message}`, 'INVALID_KEY_PARAMETERS');\n }\n}\n/**\n * Thrown when a compliance profile violation is detected.\n */\nexport class ComplianceViolationError extends SmartLedgerCryptoError {\n profileName;\n violation;\n constructor(profileName, violation) {\n super(`Compliance violation in profile ${profileName}: ${violation}`, 'COMPLIANCE_VIOLATION');\n this.profileName = profileName;\n this.violation = violation;\n }\n}\n", "/**\n * Stateless cryptographic helpers for unmanaged keys.\n *\n * These functions allow external systems, auditors, and governments to use\n * SmartLedger algorithms with their own key material, without the managed\n * key infrastructure.\n *\n * @example\n * ```typescript\n * // External system with their own key management\n * import { signUsingSuite, verifyUsingSuite } from '@smartledger/crypto';\n *\n * const signature = await signUsingSuite(\n * 'ml-dsa-87',\n * privateKey, // Their own key material\n * message\n * );\n *\n * const valid = await verifyUsingSuite(\n * 'ml-dsa-87',\n * publicKey,\n * message,\n * signature\n * );\n * ```\n */\nimport { SignatureSuiteRegistry } from './registry.js';\nimport { SuiteNotFoundError, CryptoOperationError } from './errors.js';\n/**\n * Global registry instance for stateless operations.\n * Can be configured with custom suites before use.\n */\nlet globalRegistry = null;\n/**\n * Set the global registry for stateless operations.\n */\nexport function setGlobalRegistry(registry) {\n globalRegistry = registry;\n}\n/**\n * Get or create the global registry.\n */\nfunction getRegistry() {\n if (!globalRegistry) {\n globalRegistry = new SignatureSuiteRegistry();\n }\n return globalRegistry;\n}\n/**\n * Sign a message using a specific suite with provided private key.\n *\n * This is a stateless operation for external key management systems.\n *\n * @param suiteId - Signature suite identifier (e.g. 'ml-dsa-87')\n * @param privateKey - Private key bytes\n * @param message - Message to sign\n * @returns Signature bytes\n * @throws {SuiteNotFoundError} If suite is not registered\n * @throws {CryptoOperationError} If signing fails\n */\nexport async function signUsingSuite(suiteId, privateKey, message) {\n const registry = getRegistry();\n if (!registry.hasSuite(suiteId)) {\n throw new SuiteNotFoundError(suiteId);\n }\n try {\n const suite = registry.getSuite(suiteId);\n return await suite.sign(privateKey, message);\n }\n catch (error) {\n throw new CryptoOperationError('sign', error instanceof Error ? error.message : 'Unknown error', error instanceof Error ? error : undefined);\n }\n}\n/**\n * Verify a signature using a specific suite with provided public key.\n *\n * This is a stateless operation for external verification systems.\n *\n * @param suiteId - Signature suite identifier (e.g. 'ml-dsa-87')\n * @param publicKey - Public key bytes\n * @param message - Original message\n * @param signature - Signature to verify\n * @returns true if signature is valid\n * @throws {SuiteNotFoundError} If suite is not registered\n * @throws {CryptoOperationError} If verification fails unexpectedly\n */\nexport async function verifyUsingSuite(suiteId, publicKey, message, signature) {\n const registry = getRegistry();\n if (!registry.hasSuite(suiteId)) {\n throw new SuiteNotFoundError(suiteId);\n }\n try {\n const suite = registry.getSuite(suiteId);\n return await suite.verify(publicKey, message, signature);\n }\n catch (error) {\n throw new CryptoOperationError('verify', error instanceof Error ? error.message : 'Unknown error', error instanceof Error ? error : undefined);\n }\n}\n/**\n * Generate a keypair using a specific suite.\n *\n * This is a stateless operation for external key generation.\n *\n * @param suiteId - Signature suite identifier (e.g. 'ml-dsa-87')\n * @returns Keypair with public and private keys\n * @throws {SuiteNotFoundError} If suite is not registered\n * @throws {CryptoOperationError} If key generation fails\n */\nexport async function generateKeypairUsingSuite(suiteId) {\n const registry = getRegistry();\n if (!registry.hasSuite(suiteId)) {\n throw new SuiteNotFoundError(suiteId);\n }\n try {\n const suite = registry.getSuite(suiteId);\n return await suite.generateKeypair();\n }\n catch (error) {\n throw new CryptoOperationError('generateKeypair', error instanceof Error ? error.message : 'Unknown error', error instanceof Error ? error : undefined);\n }\n}\n/**\n * List all available suite IDs in the global registry.\n *\n * @returns Array of suite IDs\n */\nexport function listAvailableSuites() {\n const registry = getRegistry();\n return registry.listSuites();\n}\n", "import * as secp256k1 from '@noble/secp256k1';\nimport { hmac } from '@noble/hashes/hmac';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { bytesToHex, hexToBytes } from '../utils.js';\nimport { BIP32Derivation } from '../derivation/bip32.js';\nimport { encodeWIF, decodeWIF } from '../derivation/wif.js';\n// Set up HMAC for secp256k1\nsecp256k1.etc.hmacSha256Sync = (key, ...msgs) => hmac(sha256, key, secp256k1.etc.concatBytes(...msgs));\n/**\n * BSV ECDSA signature suite using secp256k1\n * Compatible with Bitcoin SV / smartledger-bsv\n *\n * Supports BIP32 HD wallet derivation for deterministic key generation.\n */\nexport class BsvEcdsaSuite {\n suiteId = 'bsv-ecdsa-secp256k1';\n version = '1.0.0';\n capabilities = {\n derivation: new BIP32Derivation(),\n };\n async generateKeypair() {\n const privateKey = secp256k1.utils.randomPrivateKey();\n const publicKey = secp256k1.getPublicKey(privateKey, true); // compressed\n return {\n privateKey,\n publicKey,\n };\n }\n async sign(privateKey, message) {\n try {\n // Create deterministic signature (RFC 6979)\n const signature = await secp256k1.sign(message, privateKey);\n return signature.toCompactRawBytes();\n }\n catch (error) {\n throw new Error(`BsvEcdsaSuite signing failed: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n async verify(publicKey, message, signature) {\n try {\n return secp256k1.verify(signature, message, publicKey);\n }\n catch (error) {\n // Invalid signature format or other errors count as verification failure\n return false;\n }\n }\n exportPublicKey(pub) {\n // Export as hex (standard format)\n return bytesToHex(pub);\n }\n importPublicKey(encoded) {\n return hexToBytes(encoded);\n }\n exportPrivateKey(priv) {\n // Export as Bitcoin WIF format for maximum compatibility\n return encodeWIF(priv, true, 'mainnet');\n }\n importPrivateKey(encoded) {\n // Support both hex and WIF formats\n if (encoded.length === 64) {\n // Hex format (64 hex chars = 32 bytes)\n const bytes = hexToBytes(encoded);\n if (bytes.length !== 32) {\n throw new Error('Private key must be 32 bytes');\n }\n return bytes;\n }\n else {\n // WIF format (starts with '5', 'K', or 'L' for mainnet compressed)\n try {\n const { privateKey } = decodeWIF(encoded);\n return privateKey;\n }\n catch (error) {\n throw new Error(`Invalid private key format: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n }\n}\n", "/*! noble-secp256k1 - MIT License (c) 2019 Paul Miller (paulmillr.com) */\n/**\n * 4KB JS implementation of secp256k1 ECDSA / Schnorr signatures & ECDH.\n * Compliant with RFC6979 & BIP340.\n * @module\n */\n/**\n * Curve params. secp256k1 is short weierstrass / koblitz curve. Equation is y\u00B2 == x\u00B3 + ax + b.\n * * P = `2n**256n-2n**32n-2n**977n` // field over which calculations are done\n * * N = `2n**256n - 0x14551231950b75fc4402da1732fc9bebfn` // group order, amount of curve points\n * * h = `1n` // cofactor\n * * a = `0n` // equation param\n * * b = `7n` // equation param\n * * Gx, Gy are coordinates of Generator / base point\n */\nconst secp256k1_CURVE = {\n p: 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn,\n n: 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141n,\n h: 1n,\n a: 0n,\n b: 7n,\n Gx: 0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798n,\n Gy: 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8n,\n};\nconst { p: P, n: N, Gx, Gy, b: _b } = secp256k1_CURVE;\nconst L = 32; // field / group byte length\nconst L2 = 64;\n// Helpers and Precomputes sections are reused between libraries\n// ## Helpers\n// ----------\n// error helper, messes-up stack trace\nconst err = (m = '') => {\n throw new Error(m);\n};\nconst isBig = (n) => typeof n === 'bigint'; // is big integer\nconst isStr = (s) => typeof s === 'string'; // is string\nconst isBytes = (a) => a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n/** assert is Uint8Array (of specific length) */\nconst abytes = (a, l) => !isBytes(a) || (typeof l === 'number' && l > 0 && a.length !== l)\n ? err('Uint8Array expected')\n : a;\n/** create Uint8Array */\nconst u8n = (len) => new Uint8Array(len);\nconst u8fr = (buf) => Uint8Array.from(buf);\nconst padh = (n, pad) => n.toString(16).padStart(pad, '0');\nconst bytesToHex = (b) => Array.from(abytes(b))\n .map((e) => padh(e, 2))\n .join('');\nconst C = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }; // ASCII characters\nconst _ch = (ch) => {\n if (ch >= C._0 && ch <= C._9)\n return ch - C._0; // '2' => 50-48\n if (ch >= C.A && ch <= C.F)\n return ch - (C.A - 10); // 'B' => 66-(65-10)\n if (ch >= C.a && ch <= C.f)\n return ch - (C.a - 10); // 'b' => 98-(97-10)\n return;\n};\nconst hexToBytes = (hex) => {\n const e = 'hex invalid';\n if (!isStr(hex))\n return err(e);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n return err(e);\n const array = u8n(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n // treat each char as ASCII\n const n1 = _ch(hex.charCodeAt(hi)); // parse first char, multiply it by 16\n const n2 = _ch(hex.charCodeAt(hi + 1)); // parse second char\n if (n1 === undefined || n2 === undefined)\n return err(e);\n array[ai] = n1 * 16 + n2; // example: 'A9' => 10*16 + 9\n }\n return array;\n};\n/** normalize hex or ui8a to ui8a */\nconst toU8 = (a, len) => abytes(isStr(a) ? hexToBytes(a) : u8fr(abytes(a)), len);\nconst cr = () => globalThis?.crypto; // WebCrypto is available in all modern environments\nconst subtle = () => cr()?.subtle ?? err('crypto.subtle must be defined');\n// prettier-ignore\nconst concatBytes = (...arrs) => {\n const r = u8n(arrs.reduce((sum, a) => sum + abytes(a).length, 0)); // create u8a of summed length\n let pad = 0; // walk through each array,\n arrs.forEach(a => { r.set(a, pad); pad += a.length; }); // ensure they have proper type\n return r;\n};\n/** WebCrypto OS-level CSPRNG (random number generator). Will throw when not available. */\nconst randomBytes = (len = L) => {\n const c = cr();\n return c.getRandomValues(u8n(len));\n};\nconst big = BigInt;\nconst arange = (n, min, max, msg = 'bad number: out of range') => isBig(n) && min <= n && n < max ? n : err(msg);\n/** modular division */\nconst M = (a, b = P) => {\n const r = a % b;\n return r >= 0n ? r : b + r;\n};\nconst modN = (a) => M(a, N);\n/** Modular inversion using eucledian GCD (non-CT). No negative exponent for now. */\n// prettier-ignore\nconst invert = (num, md) => {\n if (num === 0n || md <= 0n)\n err('no inverse n=' + num + ' mod=' + md);\n let a = M(num, md), b = md, x = 0n, y = 1n, u = 1n, v = 0n;\n while (a !== 0n) {\n const q = b / a, r = b % a;\n const m = x - u * q, n = y - v * q;\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n return b === 1n ? M(x, md) : err('no inverse'); // b is gcd at this point\n};\nconst callHash = (name) => {\n // @ts-ignore\n const fn = etc[name];\n if (typeof fn !== 'function')\n err('hashes.' + name + ' not set');\n return fn;\n};\nconst apoint = (p) => (p instanceof Point ? p : err('Point expected'));\n// ## End of Helpers\n// -----------------\n/** secp256k1 formula. Koblitz curves are subclass of weierstrass curves with a=0, making it x\u00B3+b */\nconst koblitz = (x) => M(M(x * x) * x + _b);\n/** assert is field element or 0 */\nconst afield0 = (n) => arange(n, 0n, P);\n/** assert is field element */\nconst afield = (n) => arange(n, 1n, P);\n/** assert is group elem */\nconst agroup = (n) => arange(n, 1n, N);\nconst isEven = (y) => (y & 1n) === 0n;\n/** create Uint8Array of byte n */\nconst u8of = (n) => Uint8Array.of(n);\nconst getPrefix = (y) => u8of(isEven(y) ? 0x02 : 0x03);\n/** lift_x from BIP340 calculates square root. Validates x, then validates root*root. */\nconst lift_x = (x) => {\n // Let c = x\u00B3 + 7 mod p. Fail if x \u2265 p. (also fail if x < 1)\n const c = koblitz(afield(x));\n // c = \u221Ay\n // y = c^((p+1)/4) mod p\n // This formula works for fields p = 3 mod 4 -- a special, fast case.\n // Paper: \"Square Roots from 1;24,51,10 to Dan Shanks\".\n let r = 1n;\n for (let num = c, e = (P + 1n) / 4n; e > 0n; e >>= 1n) {\n // powMod: modular exponentiation.\n if (e & 1n)\n r = (r * num) % P; // Uses exponentiation by squaring.\n num = (num * num) % P; // Not constant-time.\n }\n return M(r * r) === c ? r : err('sqrt invalid'); // check if result is valid\n};\n/** Point in 3d xyz projective coordinates. 3d takes less inversions than 2d. */\nclass Point {\n static BASE;\n static ZERO;\n px;\n py;\n pz;\n constructor(px, py, pz) {\n this.px = afield0(px);\n this.py = afield(py); // y can't be 0 in Projective\n this.pz = afield0(pz);\n Object.freeze(this);\n }\n /** Convert Uint8Array or hex string to Point. */\n static fromBytes(bytes) {\n abytes(bytes);\n let p = undefined;\n // First byte is prefix, rest is data. There are 2 kinds: compressed & uncompressed:\n // * [0x02 or 0x03][32-byte x coordinate]\n // * [0x04] [32-byte x coordinate][32-byte y coordinate]\n const head = bytes[0];\n const tail = bytes.subarray(1);\n const x = sliceBytesNumBE(tail, 0, L);\n const len = bytes.length;\n // Compressed 33-byte point, 0x02 or 0x03 prefix\n if (len === L + 1 && [0x02, 0x03].includes(head)) {\n // Equation is y\u00B2 == x\u00B3 + ax + b. We calculate y from x.\n // y = \u221Ay\u00B2; there are two solutions: y, -y. Determine proper solution based on prefix\n let y = lift_x(x);\n const evenY = isEven(y);\n const evenH = isEven(big(head));\n if (evenH !== evenY)\n y = M(-y);\n p = new Point(x, y, 1n);\n }\n // Uncompressed 65-byte point, 0x04 prefix\n if (len === L2 + 1 && head === 0x04)\n p = new Point(x, sliceBytesNumBE(tail, L, L2), 1n);\n // Validate point\n return p ? p.assertValidity() : err('bad point: not on curve');\n }\n /** Equality check: compare points P&Q. */\n equals(other) {\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = apoint(other); // checks class equality\n const X1Z2 = M(X1 * Z2);\n const X2Z1 = M(X2 * Z1);\n const Y1Z2 = M(Y1 * Z2);\n const Y2Z1 = M(Y2 * Z1);\n return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n }\n is0() {\n return this.equals(I);\n }\n /** Flip point over y coordinate. */\n negate() {\n return new Point(this.px, M(-this.py), this.pz);\n }\n /** Point doubling: P+P, complete formula. */\n double() {\n return this.add(this);\n }\n /**\n * Point addition: P+Q, complete, exception-free formula\n * (Renes-Costello-Batina, algo 1 of [2015/1060](https://eprint.iacr.org/2015/1060)).\n * Cost: `12M + 0S + 3*a + 3*b3 + 23add`.\n */\n // prettier-ignore\n add(other) {\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = apoint(other);\n const a = 0n;\n const b = _b;\n let X3 = 0n, Y3 = 0n, Z3 = 0n;\n const b3 = M(b * 3n);\n let t0 = M(X1 * X2), t1 = M(Y1 * Y2), t2 = M(Z1 * Z2), t3 = M(X1 + Y1); // step 1\n let t4 = M(X2 + Y2); // step 5\n t3 = M(t3 * t4);\n t4 = M(t0 + t1);\n t3 = M(t3 - t4);\n t4 = M(X1 + Z1);\n let t5 = M(X2 + Z2); // step 10\n t4 = M(t4 * t5);\n t5 = M(t0 + t2);\n t4 = M(t4 - t5);\n t5 = M(Y1 + Z1);\n X3 = M(Y2 + Z2); // step 15\n t5 = M(t5 * X3);\n X3 = M(t1 + t2);\n t5 = M(t5 - X3);\n Z3 = M(a * t4);\n X3 = M(b3 * t2); // step 20\n Z3 = M(X3 + Z3);\n X3 = M(t1 - Z3);\n Z3 = M(t1 + Z3);\n Y3 = M(X3 * Z3);\n t1 = M(t0 + t0); // step 25\n t1 = M(t1 + t0);\n t2 = M(a * t2);\n t4 = M(b3 * t4);\n t1 = M(t1 + t2);\n t2 = M(t0 - t2); // step 30\n t2 = M(a * t2);\n t4 = M(t4 + t2);\n t0 = M(t1 * t4);\n Y3 = M(Y3 + t0);\n t0 = M(t5 * t4); // step 35\n X3 = M(t3 * X3);\n X3 = M(X3 - t0);\n t0 = M(t3 * t1);\n Z3 = M(t5 * Z3);\n Z3 = M(Z3 + t0); // step 40\n return new Point(X3, Y3, Z3);\n }\n /**\n * Point-by-scalar multiplication. Scalar must be in range 1 <= n < CURVE.n.\n * Uses {@link wNAF} for base point.\n * Uses fake point to mitigate side-channel leakage.\n * @param n scalar by which point is multiplied\n * @param safe safe mode guards against timing attacks; unsafe mode is faster\n */\n multiply(n, safe = true) {\n if (!safe && n === 0n)\n return I;\n agroup(n);\n if (n === 1n)\n return this;\n if (this.equals(G))\n return wNAF(n).p;\n // init result point & fake point\n let p = I;\n let f = G;\n for (let d = this; n > 0n; d = d.double(), n >>= 1n) {\n // if bit is present, add to point\n // if not present, add to fake, for timing safety\n if (n & 1n)\n p = p.add(d);\n else if (safe)\n f = f.add(d);\n }\n return p;\n }\n /** Convert point to 2d xy affine point. (X, Y, Z) \u220B (x=X/Z, y=Y/Z) */\n toAffine() {\n const { px: x, py: y, pz: z } = this;\n // fast-paths for ZERO point OR Z=1\n if (this.equals(I))\n return { x: 0n, y: 0n };\n if (z === 1n)\n return { x, y };\n const iz = invert(z, P);\n // (Z * Z^-1) must be 1, otherwise bad math\n if (M(z * iz) !== 1n)\n err('inverse invalid');\n // x = X*Z^-1; y = Y*Z^-1\n return { x: M(x * iz), y: M(y * iz) };\n }\n /** Checks if the point is valid and on-curve. */\n assertValidity() {\n const { x, y } = this.toAffine(); // convert to 2d xy affine point.\n afield(x); // must be in range 1 <= x,y < P\n afield(y);\n // y\u00B2 == x\u00B3 + ax + b, equation sides must be equal\n return M(y * y) === koblitz(x) ? this : err('bad point: not on curve');\n }\n /** Converts point to 33/65-byte Uint8Array. */\n toBytes(isCompressed = true) {\n const { x, y } = this.assertValidity().toAffine();\n const x32b = numTo32b(x);\n if (isCompressed)\n return concatBytes(getPrefix(y), x32b);\n return concatBytes(u8of(0x04), x32b, numTo32b(y));\n }\n /** Create 3d xyz point from 2d xy. (0, 0) => (0, 1, 0), not (0, 0, 1) */\n static fromAffine(ap) {\n const { x, y } = ap;\n return x === 0n && y === 0n ? I : new Point(x, y, 1n);\n }\n toHex(isCompressed) {\n return bytesToHex(this.toBytes(isCompressed));\n }\n static fromPrivateKey(k) {\n return G.multiply(toPrivScalar(k));\n }\n static fromHex(hex) {\n return Point.fromBytes(toU8(hex));\n }\n get x() {\n return this.toAffine().x;\n }\n get y() {\n return this.toAffine().y;\n }\n toRawBytes(isCompressed) {\n return this.toBytes(isCompressed);\n }\n}\n/** Generator / base point */\nconst G = new Point(Gx, Gy, 1n);\n/** Identity / zero point */\nconst I = new Point(0n, 1n, 0n);\n// Static aliases\nPoint.BASE = G;\nPoint.ZERO = I;\n/** `Q = u1\u22C5G + u2\u22C5R`. Verifies Q is not ZERO. Unsafe: non-CT. */\nconst doubleScalarMulUns = (R, u1, u2) => {\n return G.multiply(u1, false).add(R.multiply(u2, false)).assertValidity();\n};\nconst bytesToNumBE = (b) => big('0x' + (bytesToHex(b) || '0'));\nconst sliceBytesNumBE = (b, from, to) => bytesToNumBE(b.subarray(from, to));\nconst B256 = 2n ** 256n; // secp256k1 is weierstrass curve. Equation is x\u00B3 + ax + b.\n/** Number to 32b. Must be 0 <= num < B256. validate, pad, to bytes. */\nconst numTo32b = (num) => hexToBytes(padh(arange(num, 0n, B256), L2));\n/** Normalize private key to scalar (bigint). Verifies scalar is in range 1<s<N */\nconst toPrivScalar = (pr) => {\n const num = isBig(pr) ? pr : bytesToNumBE(toU8(pr, L));\n return arange(num, 1n, N, 'private key invalid 3');\n};\n/** For Signature malleability, validates sig.s is bigger than N/2. */\nconst highS = (n) => n > N >> 1n;\n/** Creates 33/65-byte public key from 32-byte private key. */\nconst getPublicKey = (privKey, isCompressed = true) => {\n return G.multiply(toPrivScalar(privKey)).toBytes(isCompressed);\n};\n/** ECDSA Signature class. Supports only compact 64-byte representation, not DER. */\nclass Signature {\n r;\n s;\n recovery;\n constructor(r, s, recovery) {\n this.r = agroup(r); // 1 <= r < N\n this.s = agroup(s); // 1 <= s < N\n if (recovery != null)\n this.recovery = recovery;\n Object.freeze(this);\n }\n /** Create signature from 64b compact (r || s) representation. */\n static fromBytes(b) {\n abytes(b, L2);\n const r = sliceBytesNumBE(b, 0, L);\n const s = sliceBytesNumBE(b, L, L2);\n return new Signature(r, s);\n }\n toBytes() {\n const { r, s } = this;\n return concatBytes(numTo32b(r), numTo32b(s));\n }\n /** Copy signature, with newly added recovery bit. */\n addRecoveryBit(bit) {\n return new Signature(this.r, this.s, bit);\n }\n hasHighS() {\n return highS(this.s);\n }\n toCompactRawBytes() {\n return this.toBytes();\n }\n toCompactHex() {\n return bytesToHex(this.toBytes());\n }\n recoverPublicKey(msg) {\n return recoverPublicKey(this, msg);\n }\n static fromCompact(hex) {\n return Signature.fromBytes(toU8(hex, L2));\n }\n assertValidity() {\n return this;\n }\n normalizeS() {\n const { r, s, recovery } = this;\n return highS(s) ? new Signature(r, modN(-s), recovery) : this;\n }\n}\n/**\n * RFC6979: ensure ECDSA msg is X bytes, convert to BigInt.\n * RFC suggests optional truncating via bits2octets.\n * FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits,\n * which matches bits2int. bits2int can produce res>N.\n */\nconst bits2int = (bytes) => {\n const delta = bytes.length * 8 - 256;\n if (delta > 1024)\n err('msg invalid'); // our CUSTOM check, \"just-in-case\": prohibit long inputs\n const num = bytesToNumBE(bytes);\n return delta > 0 ? num >> big(delta) : num;\n};\n/** int2octets can't be used; pads small msgs with 0: BAD for truncation as per RFC vectors */\nconst bits2int_modN = (bytes) => modN(bits2int(abytes(bytes)));\nconst signOpts = { lowS: true };\nconst veriOpts = { lowS: true };\n// RFC6979 signature generation, preparation step.\nconst prepSig = (msgh, priv, opts = signOpts) => {\n if (['der', 'recovered', 'canonical'].some((k) => k in opts))\n // legacy opts\n err('option not supported');\n let { lowS, extraEntropy } = opts; // generates low-s sigs by default\n if (lowS == null)\n lowS = true; // RFC6979 3.2: we skip step A\n const i2o = numTo32b; // int to octets\n const h1i = bits2int_modN(toU8(msgh)); // msg bigint\n const h1o = i2o(h1i); // msg octets\n const d = toPrivScalar(priv); // validate private key, convert to bigint\n const seed = [i2o(d), h1o]; // Step D of RFC6979 3.2\n /** RFC6979 3.6: additional k' (optional). See {@link ExtraEntropy}. */\n // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n if (extraEntropy)\n seed.push(extraEntropy === true ? randomBytes(L) : toU8(extraEntropy));\n const m = h1i; // convert msg to bigint\n // Converts signature params into point w r/s, checks result for validity.\n // To transform k => Signature:\n // q = k\u22C5G\n // r = q.x mod n\n // s = k^-1(m + rd) mod n\n const 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);\n if (!(1n <= k && k < N))\n return; // Check 0 < k < CURVE.n\n const q = G.multiply(k).toAffine(); // q = k\u22C5G\n const r = modN(q.x); // r = q.x mod n\n if (r === 0n)\n return;\n const ik = invert(k, N); // k^-1 mod n, NOT mod P\n const s = modN(ik * modN(m + modN(d * r))); // s = k^-1(m + rd) mod n\n if (s === 0n)\n return;\n let normS = s; // normalized S\n let recovery = (q.x === r ? 0 : 2) | Number(q.y & 1n); // recovery bit (2 or 3, when q.x > n)\n if (lowS && highS(s)) {\n // if lowS was passed, ensure s is always\n normS = modN(-s); // in the bottom half of CURVE.n\n recovery ^= 1;\n }\n return new Signature(r, normS, recovery); // use normS, not s\n };\n return { seed: concatBytes(...seed), k2sig };\n};\n// HMAC-DRBG from NIST 800-90. Minimal, non-full-spec - used for RFC6979 signatures.\nconst hmacDrbg = (asynchronous) => {\n let v = u8n(L); // Steps B, C of RFC6979 3.2: set hashLen\n let k = u8n(L); // In our case, it's always equal to L\n let i = 0; // Iterations counter, will throw when over max\n const NULL = u8n(0);\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const max = 1000;\n const _e = 'drbg: tried 1000 values';\n if (asynchronous) {\n // asynchronous=true\n // h = hmac(K || V || ...)\n const h = (...b) => etc.hmacSha256Async(k, v, ...b);\n const reseed = async (seed = NULL) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = await h(u8of(0x00), seed); // k = hmac(K || V || 0x00 || seed)\n v = await h(); // v = hmac(K || V)\n if (seed.length === 0)\n return;\n k = await h(u8of(0x01), seed); // k = hmac(K || V || 0x01 || seed)\n v = await h(); // v = hmac(K || V)\n };\n // HMAC-DRBG generate() function\n const gen = async () => {\n if (i++ >= max)\n err(_e);\n v = await h(); // v = hmac(K || V)\n return v; // this diverges from noble-curves: we don't allow arbitrary output len!\n };\n // Do not reuse returned fn for more than 1 sig:\n // 1) it's slower (JIT screws up). 2. unsafe (async race conditions)\n return async (seed, pred) => {\n reset();\n await reseed(seed); // Steps D-G\n let res = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(await gen())))\n await reseed(); // test predicate until it returns ok\n reset();\n return res;\n };\n }\n else {\n // asynchronous=false; same as above, but synchronous\n // h = hmac(K || V || ...)\n const h = (...b) => callHash('hmacSha256Sync')(k, v, ...b);\n const reseed = (seed = NULL) => {\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 // HMAC-DRBG generate() function\n const gen = () => {\n if (i++ >= max)\n err(_e);\n v = h(); // v = hmac(k || v)\n return v; // this diverges from noble-curves: we don't allow arbitrary output len!\n };\n // Do not reuse returned fn for more than 1 sig:\n // 1) it's slower (JIT screws up). 2. unsafe (async race conditions)\n return (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(); // test predicate until it returns ok\n reset();\n return res;\n };\n }\n};\n/**\n * Sign a msg hash using secp256k1. Async.\n * Follows [SEC1](https://secg.org/sec1-v2.pdf) 4.1.2 & RFC6979.\n * It's suggested to enable hedging ({@link ExtraEntropy}) to prevent fault attacks.\n * @param msgh - message HASH, not message itself e.g. sha256(message)\n * @param priv - private key\n * @param opts - `lowS: true` prevents malleability, `extraEntropy: true` enables hedging\n */\nconst signAsync = async (msgh, priv, opts = signOpts) => {\n // Re-run drbg until k2sig returns ok\n const { seed, k2sig } = prepSig(msgh, priv, opts);\n const sig = await hmacDrbg(true)(seed, k2sig);\n return sig;\n};\n/**\n * Sign a msg hash using secp256k1.\n * Follows [SEC1](https://secg.org/sec1-v2.pdf) 4.1.2 & RFC6979.\n * It's suggested to enable hedging ({@link ExtraEntropy}) to prevent fault attacks.\n * @param msgh - message HASH, not message itself e.g. sha256(message)\n * @param priv - private key\n * @param opts - `lowS: true` prevents malleability, `extraEntropy: true` enables hedging\n * @example\n * const sig = sign(sha256('hello'), privKey, { extraEntropy: true }).toBytes();\n */\nconst sign = (msgh, priv, opts = signOpts) => {\n // Re-run drbg until k2sig returns ok\n const { seed, k2sig } = prepSig(msgh, priv, opts);\n const sig = hmacDrbg(false)(seed, k2sig);\n return sig;\n};\n/**\n * Verify a signature using secp256k1.\n * Follows [SEC1](https://secg.org/sec1-v2.pdf) 4.1.4.\n * Default lowS=true, prevents malleability.\n * @param sig - signature, 64-byte or Signature instance\n * @param msgh - message HASH, not message itself e.g. sha256(message)\n * @param pub - public key\n * @param opts - { lowS: true } is default, prohibits s >= CURVE.n/2 to prevent malleability\n */\nconst verify = (sig, msgh, pub, opts = veriOpts) => {\n let { lowS } = opts;\n if (lowS == null)\n lowS = true;\n if ('strict' in opts)\n err('option not supported');\n let sigg;\n // Previous ver supported DER sigs.\n // We throw error when DER is suspected now.\n const rs = sig && typeof sig === 'object' && 'r' in sig;\n if (!rs && toU8(sig).length !== L2)\n err('signature must be 64 bytes');\n try {\n sigg = rs ? new Signature(sig.r, sig.s) : Signature.fromCompact(sig);\n const h = bits2int_modN(toU8(msgh)); // Truncate hash\n const P = Point.fromBytes(toU8(pub)); // Validate public key\n const { r, s } = sigg;\n if (lowS && highS(s))\n return false; // lowS bans sig.s >= CURVE.n/2\n const is = invert(s, N); // s^-1\n const u1 = modN(h * is); // u1 = hs^-1 mod n\n const u2 = modN(r * is); // u2 = rs^-1 mod n\n const R = doubleScalarMulUns(P, u1, u2).toAffine(); // R = u1\u22C5G + u2\u22C5P\n // Stop if R is identity / zero point. Check is done inside `doubleScalarMulUns`\n const v = modN(R.x); // R.x must be in N's field, not P's\n return v === r; // mod(R.x, n) == r\n }\n catch (error) {\n return false;\n }\n};\n/**\n * ECDSA public key recovery. Requires msg hash and recovery id.\n * Follows [SEC1](https://secg.org/sec1-v2.pdf) 4.1.6.\n */\nconst recoverPublicKey = (sig, msgh) => {\n const { r, s, recovery } = sig;\n // 0 or 1 recovery id determines sign of \"y\" coordinate.\n // 2 or 3 means q.x was >N.\n if (![0, 1, 2, 3].includes(recovery))\n err('recovery id invalid');\n const h = bits2int_modN(toU8(msgh, L)); // Truncate hash\n const radj = recovery === 2 || recovery === 3 ? r + N : r;\n afield(radj); // ensure q.x is still a field element\n const head = getPrefix(big(recovery)); // head is 0x02 or 0x03\n const Rb = concatBytes(head, numTo32b(radj)); // concat head + r\n const R = Point.fromBytes(Rb);\n const ir = invert(radj, N); // r^-1\n const u1 = modN(-h * ir); // -hr^-1\n const u2 = modN(s * ir); // sr^-1\n return doubleScalarMulUns(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n};\n/**\n * Elliptic Curve Diffie-Hellman (ECDH) on secp256k1.\n * Result is **NOT hashed**. Use hash or KDF on it if you need.\n * @param privA private key A\n * @param pubB public key B\n * @param isCompressed 33-byte (true) or 65-byte (false) output\n * @returns public key C\n */\nconst getSharedSecret = (privA, pubB, isCompressed = true) => {\n return Point.fromBytes(toU8(pubB)).multiply(toPrivScalar(privA)).toBytes(isCompressed);\n};\n// FIPS 186 B.4.1 compliant key generation produces private keys with modulo bias being neglible.\n// takes >N+8 bytes, returns (hash mod n-1)+1\nconst hashToPrivateKey = (hash) => {\n hash = toU8(hash);\n if (hash.length < L + 8 || hash.length > 1024)\n err('expected 40-1024b');\n const num = M(bytesToNumBE(hash), N - 1n);\n return numTo32b(num + 1n);\n};\nconst randomPrivateKey = () => hashToPrivateKey(randomBytes(L + 16)); // FIPS 186 B.4.1.\nconst _sha = 'SHA-256';\n/** Math, hex, byte helpers. Not in `utils` because utils share API with noble-curves. */\nconst etc = {\n hexToBytes: hexToBytes,\n bytesToHex: bytesToHex,\n concatBytes: concatBytes,\n bytesToNumberBE: bytesToNumBE,\n numberToBytesBE: numTo32b,\n mod: M,\n invert: invert, // math utilities\n hmacSha256Async: async (key, ...msgs) => {\n const s = subtle();\n const name = 'HMAC';\n const k = await s.importKey('raw', key, { name, hash: { name: _sha } }, false, ['sign']);\n return u8n(await s.sign(name, k, concatBytes(...msgs)));\n },\n hmacSha256Sync: undefined, // For TypeScript. Actual logic is below\n hashToPrivateKey: hashToPrivateKey,\n randomBytes: randomBytes,\n};\n/** Curve-specific utilities for private keys. */\nconst utils = {\n normPrivateKeyToScalar: toPrivScalar,\n isValidPrivateKey: (key) => {\n try {\n return !!toPrivScalar(key);\n }\n catch (e) {\n return false;\n }\n },\n randomPrivateKey: randomPrivateKey,\n precompute: (w = 8, p = G) => {\n p.multiply(3n);\n w;\n return p;\n },\n};\n// ## Precomputes\n// --------------\nconst W = 8; // W is window size\nconst scalarBits = 256;\nconst pwindows = Math.ceil(scalarBits / W) + 1; // 33 for W=8\nconst pwindowSize = 2 ** (W - 1); // 128 for W=8\nconst precompute = () => {\n const points = [];\n let p = G;\n let b = p;\n for (let w = 0; w < pwindows; w++) {\n b = p;\n points.push(b);\n for (let i = 1; i < pwindowSize; i++) {\n b = b.add(p);\n points.push(b);\n } // i=1, bc we skip 0\n p = b.double();\n }\n return points;\n};\nlet Gpows = undefined; // precomputes for base point G\n// const-time negate\nconst ctneg = (cnd, p) => {\n const n = p.negate();\n return cnd ? n : p;\n};\n/**\n * Precomputes give 12x faster getPublicKey(), 10x sign(), 2x verify() by\n * caching multiples of G (base point). Cache is stored in 32MB of RAM.\n * Any time `G.multiply` is done, precomputes are used.\n * Not used for getSharedSecret, which instead multiplies random pubkey `P.multiply`.\n *\n * w-ary non-adjacent form (wNAF) precomputation method is 10% slower than windowed method,\n * but takes 2x less RAM. RAM reduction is possible by utilizing `.subtract`.\n *\n * !! Precomputes can be disabled by commenting-out call of the wNAF() inside Point#multiply().\n */\nconst wNAF = (n) => {\n const comp = Gpows || (Gpows = precompute());\n let p = I;\n let f = G; // f must be G, or could become I in the end\n const pow_2_w = 2 ** W; // 256 for W=8\n const maxNum = pow_2_w; // 256 for W=8\n const mask = big(pow_2_w - 1); // 255 for W=8 == mask 0b11111111\n const shiftBy = big(W); // 8 for W=8\n for (let w = 0; w < pwindows; w++) {\n let wbits = Number(n & mask); // extract W bits.\n n >>= shiftBy; // shift number by W bits.\n if (wbits > pwindowSize) {\n wbits -= maxNum;\n n += 1n;\n } // split if bits > max: +224 => 256-32\n const off = w * pwindowSize;\n const offF = off; // offsets, evaluate both\n const offP = off + Math.abs(wbits) - 1;\n const isEven = w % 2 !== 0; // conditions, evaluate both\n const isNeg = wbits < 0;\n if (wbits === 0) {\n // off == I: can't add it. Adding random offF instead.\n f = f.add(ctneg(isEven, comp[offF])); // bits are 0: add garbage to fake point\n }\n else {\n p = p.add(ctneg(isNeg, comp[offP])); // bits are 1: add to result point\n }\n }\n return { p, f }; // return both real and fake points for JIT\n};\n// !! Remove the export below to easily use in REPL / browser console\nexport { secp256k1_CURVE as CURVE, etc, getPublicKey, getSharedSecret, Point, Point as ProjectivePoint, sign, signAsync, Signature, utils, verify, };\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, Hash, toBytes, type CHash, type Input } from './utils.ts';\n\nexport class HMAC<T extends Hash<T>> extends Hash<HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, _key: Input) {\n super();\n ahash(hash);\n const key = toBytes(_key);\n this.iHash = hash.create() as T;\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++) 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() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n clean(pad);\n }\n update(buf: Input): this {\n aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array): void {\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(): Uint8Array {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: HMAC<T>): HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\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(): HMAC<T> {\n return this._cloneInto();\n }\n destroy(): void {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\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: {\n (hash: CHash, key: Input, message: Input): Uint8Array;\n create(hash: CHash, key: Input): HMAC<any>;\n} = (hash: CHash, key: Input, message: Input): Uint8Array =>\n new HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Input) => new HMAC<any>(hash, key);\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\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\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number): void {\n if (!Number.isSafeInteger(n) || n < 0) throw new Error('positive integer expected, got ' + n);\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(b: Uint8Array | undefined, ...lengths: number[]): void {\n if (!isBytes(b)) 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\n/** Asserts something is hash */\nexport function ahash(h: IHash): void {\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\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\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\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** @deprecated */\nexport const byteSwapIfBE: typeof swap8IfBE = swap8IfBE;\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\ndeclare const TextDecoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes: Uint8Array): string {\n return new TextDecoder().decode(bytes);\n}\n\n/** Accepted input of hash functions. Strings are converted to byte arrays. */\nexport type Input = string | Uint8Array;\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: Input): Uint8Array {\n if (typeof data === 'string') data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data: KDFInput): Uint8Array {\n if (typeof data === 'string') data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\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 as T1 & T2;\n}\n\n/** Hash interface. */\nexport type IHash = {\n (data: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create: any;\n};\n\n/** For runtime check if class implements interface */\nexport abstract class Hash<T extends Hash<T>> {\n abstract blockLen: number; // Bytes per block\n abstract outputLen: number; // Bytes in output\n abstract update(buf: Input): this;\n // Writes digest into buf\n abstract digestInto(buf: Uint8Array): void;\n abstract digest(): Uint8Array;\n /**\n * Resets internal state. Makes Hash instance unusable.\n * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n * by user, they will need to manually call `destroy()` when zeroing is necessary.\n */\n abstract destroy(): void;\n /**\n * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n * when no options are passed.\n * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n * There are no guarantees for clean-up because it's impossible in JS.\n */\n abstract _cloneInto(to?: T): T;\n // Safe version that clones internal state\n abstract clone(): T;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash function */\nexport type CHash = ReturnType<typeof createHasher>;\n/** Hash function with output */\nexport type CHashO = ReturnType<typeof createOptHasher>;\n/** XOF with output */\nexport type CHashXO = ReturnType<typeof createXOFer>;\n\n/** Wraps hash function, creating an interface on top of it */\nexport function createHasher<T extends Hash<T>>(\n hashCons: () => Hash<T>\n): {\n (msg: Input): Uint8Array;\n outputLen: number;\n blockLen: number;\n create(): Hash<T>;\n} {\n const hashC = (msg: Input): Uint8Array => 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}\n\nexport function createOptHasher<H extends Hash<H>, T extends Object>(\n hashCons: (opts?: T) => Hash<H>\n): {\n (msg: Input, opts?: T): Uint8Array;\n outputLen: number;\n blockLen: number;\n create(opts?: T): Hash<H>;\n} {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: T) => hashCons(opts);\n return hashC;\n}\n\nexport function createXOFer<H extends HashXOF<H>, T extends Object>(\n hashCons: (opts?: T) => HashXOF<H>\n): {\n (msg: Input, opts?: T): Uint8Array;\n outputLen: number;\n blockLen: number;\n create(opts?: T): HashXOF<H>;\n} {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: T) => hashCons(opts);\n return hashC;\n}\nexport const wrapConstructor: typeof createHasher = createHasher;\nexport const wrapConstructorWithOpts: typeof createOptHasher = createOptHasher;\nexport const wrapXOFConstructorWithOpts: typeof createXOFer = createXOFer;\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\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", "/**\n * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.\n *\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 *\n * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n * @deprecated\n */\nimport {\n SHA224 as SHA224n,\n sha224 as sha224n,\n SHA256 as SHA256n,\n sha256 as sha256n,\n} from './sha2.ts';\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const SHA256: typeof SHA256n = SHA256n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const sha256: typeof sha256n = sha256n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const SHA224: typeof SHA224n = SHA224n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const sha224: typeof sha224n = sha224n;\n", "/**\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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nexport class SHA256 extends HashMD<SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n\n constructor(outputLen: number = 32) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\nexport class SHA224 extends SHA256 {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\nexport class SHA512 extends HashMD<SHA512> {\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 protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor(outputLen: number = 64) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\nexport class SHA384 extends SHA512 {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\nexport class SHA512_224 extends SHA512 {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\nexport class SHA512_256 extends SHA512 {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\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: CHash = /* @__PURE__ */ createHasher(() => new SHA256());\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash = /* @__PURE__ */ createHasher(() => new SHA224());\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash = /* @__PURE__ */ createHasher(() => new SHA512());\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash = /* @__PURE__ */ createHasher(() => new SHA384());\n\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: CHash = /* @__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: CHash = /* @__PURE__ */ createHasher(() => new SHA512_224());\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { type Input, Hash, abytes, aexists, aoutput, clean, createView, toBytes } from './utils.ts';\n\n/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */\nexport function setBigUint64(\n view: DataView,\n byteOffset: number,\n value: bigint,\n isLE: boolean\n): void {\n if (typeof view.setBigUint64 === 'function') 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\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> extends Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\n super();\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: Input): this {\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) 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: Uint8Array): void {\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++) 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) 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) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\n * BIP32 Hierarchical Deterministic (HD) wallet derivation\n *\n * Implements standard Bitcoin wallet derivation (BIP32/BIP44/BIP84)\n * for ECDSA secp256k1 keys.\n *\n * Supports:\n * - BIP39 mnemonic \u2192 seed conversion\n * - BIP32 path derivation (e.g., \"m/44'/0'/0'/0/0\")\n * - Standard Bitcoin wallet paths\n *\n * References:\n * - BIP32: https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki\n * - BIP39: https://github.com/bitcoin/bips/blob/master/bip-0039.mediawiki\n * - BIP44: https://github.com/bitcoin/bips/blob/master/bip-0044.mediawiki\n */\nimport { HDKey } from '@scure/bip32';\nimport { mnemonicToSeedSync, generateMnemonic as generateBIP39Mnemonic } from '@scure/bip39';\nimport { wordlist } from '@scure/bip39/wordlists/english.js';\n/**\n * BIP32 derivation implementation for HD wallets.\n *\n * Usage:\n * ```typescript\n * const derivation = new BIP32Derivation();\n *\n * // From mnemonic\n * const mnemonic = \"abandon abandon abandon...\";\n * const keypair = await derivation.deriveKeypair({\n * seed: derivation.mnemonicToSeed(mnemonic),\n * path: \"m/44'/0'/0'/0/0\"\n * });\n *\n * // From existing seed\n * const keypair = await derivation.deriveKeypair({\n * seed: myExistingSeed,\n * path: \"m/44'/0'/0'/0/1\"\n * });\n * ```\n */\nexport class BIP32Derivation {\n /**\n * Derive a keypair from BIP32 path.\n *\n * @param context Must include `seed` and `path`\n * @returns Secp256k1 keypair (compressed public key)\n * @throws If seed or path is missing, or path is invalid\n */\n async deriveKeypair(context) {\n if (!context.seed) {\n throw new Error('BIP32 derivation requires a seed');\n }\n if (!context.path) {\n throw new Error('BIP32 derivation requires a path (e.g., \"m/44\\'/0\\'/0\\'/0/0\")');\n }\n try {\n // Create HD key from seed\n const masterKey = HDKey.fromMasterSeed(context.seed);\n // Derive child key at path\n const childKey = masterKey.derive(context.path);\n if (!childKey.privateKey) {\n throw new Error(`Failed to derive private key at path ${context.path}`);\n }\n if (!childKey.publicKey) {\n throw new Error(`Failed to derive public key at path ${context.path}`);\n }\n return {\n privateKey: childKey.privateKey,\n publicKey: childKey.publicKey, // Already compressed (33 bytes)\n };\n }\n catch (error) {\n throw new Error(`BIP32 derivation failed at path ${context.path}: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n /**\n * Convert BIP39 mnemonic to BIP32 seed.\n *\n * @param mnemonic 12, 15, 18, 21, or 24 word mnemonic\n * @param passphrase Optional BIP39 passphrase\n * @returns 64-byte seed suitable for BIP32\n */\n mnemonicToSeed(mnemonic, passphrase) {\n return mnemonicToSeedSync(mnemonic, passphrase);\n }\n /**\n * Generate a new BIP39 mnemonic.\n *\n * @param strength Entropy bits: 128 (12 words), 256 (24 words), etc.\n * @returns Space-separated mnemonic phrase\n */\n generateMnemonic(strength = 256) {\n return generateBIP39Mnemonic(wordlist, strength);\n }\n /**\n * Standard BIP44 path for Bitcoin.\n *\n * @param account Account index (default: 0)\n * @param change 0 = external (receive), 1 = internal (change)\n * @param index Address index\n * @returns BIP44 path string\n */\n static bitcoinPath(account = 0, change = 0, index = 0) {\n return `m/44'/0'/${account}'/${change}/${index}`;\n }\n /**\n * Standard BIP84 path for Bitcoin SegWit (native).\n *\n * @param account Account index (default: 0)\n * @param change 0 = external (receive), 1 = internal (change)\n * @param index Address index\n * @returns BIP84 path string\n */\n static bitcoinSegWitPath(account = 0, change = 0, index = 0) {\n return `m/84'/0'/${account}'/${change}/${index}`;\n }\n}\n", "/**\n * BIP32 hierarchical deterministic (HD) wallets over secp256k1.\n * @module\n * @example\n * ```js\n * import { HDKey } from \"@scure/bip32\";\n * const hdkey1 = HDKey.fromMasterSeed(seed);\n * const hdkey2 = HDKey.fromExtendedKey(base58key);\n * const hdkey3 = HDKey.fromJSON({ xpriv: string });\n *\n * // props\n * [hdkey1.depth, hdkey1.index, hdkey1.chainCode];\n * console.log(hdkey2.privateKey, hdkey2.publicKey);\n * console.log(hdkey3.derive(\"m/0/2147483647'/1\"));\n * const sig = hdkey3.sign(hash);\n * hdkey3.verify(hash, sig);\n * ```\n */\n/*! scure-bip32 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */\nimport { secp256k1 as secp } from '@noble/curves/secp256k1.js';\nimport { hmac } from '@noble/hashes/hmac.js';\nimport { ripemd160 } from '@noble/hashes/legacy.js';\nimport { sha256, sha512 } from '@noble/hashes/sha2.js';\nimport { abytes, concatBytes, createView } from '@noble/hashes/utils.js';\nimport { createBase58check } from '@scure/base';\n\nconst Point = secp.Point;\nconst { Fn } = Point;\nconst base58check = createBase58check(sha256);\n\nconst MASTER_SECRET = Uint8Array.from('Bitcoin seed'.split(''), (char) => char.charCodeAt(0));\n\n/** Network-specific versioning. */\nexport interface Versions {\n private: number;\n public: number;\n}\n\nconst BITCOIN_VERSIONS: Versions = { private: 0x0488ade4, public: 0x0488b21e };\n/** Hardened offset from Bitcoin, default */\nexport const HARDENED_OFFSET: number = 0x80000000;\n\nconst hash160 = (data: Uint8Array) => ripemd160(sha256(data));\nconst fromU32 = (data: Uint8Array) => createView(data).getUint32(0, false);\nconst toU32 = (n: number): Uint8Array => {\n if (!Number.isSafeInteger(n) || n < 0 || n > 2 ** 32 - 1) {\n throw new Error('invalid number, should be from 0 to 2**32-1, got ' + n);\n }\n const buf = new Uint8Array(4);\n createView(buf).setUint32(0, n, false);\n return buf;\n};\n\ninterface HDKeyOpt {\n versions?: Versions;\n depth?: number;\n index?: number;\n parentFingerprint?: number;\n chainCode?: Uint8Array;\n publicKey?: Uint8Array;\n privateKey?: Uint8Array;\n}\n\n/**\n * HDKey from BIP32\n * @example\n```js\nconst hdkey1 = HDKey.fromMasterSeed(seed);\nconst hdkey2 = HDKey.fromExtendedKey(base58key);\nconst hdkey3 = HDKey.fromJSON({ xpriv: string });\n```\n */\nexport class HDKey {\n get fingerprint(): number {\n if (!this.pubHash) {\n throw new Error('No publicKey set!');\n }\n return fromU32(this.pubHash);\n }\n get identifier(): Uint8Array | undefined {\n return this.pubHash;\n }\n get pubKeyHash(): Uint8Array | undefined {\n return this.pubHash;\n }\n get privateKey(): Uint8Array | null {\n return this._privateKey || null;\n }\n get publicKey(): Uint8Array | null {\n return this._publicKey || null;\n }\n get privateExtendedKey(): string {\n const priv = this._privateKey;\n if (!priv) {\n throw new Error('No private key');\n }\n return base58check.encode(\n this.serialize(this.versions.private, concatBytes(Uint8Array.of(0), priv))\n );\n }\n get publicExtendedKey(): string {\n if (!this._publicKey) {\n throw new Error('No public key');\n }\n return base58check.encode(this.serialize(this.versions.public, this._publicKey));\n }\n\n static fromMasterSeed(seed: Uint8Array, versions: Versions = BITCOIN_VERSIONS): HDKey {\n abytes(seed);\n if (8 * seed.length < 128 || 8 * seed.length > 512) {\n throw new Error(\n 'HDKey: seed length must be between 128 and 512 bits; 256 bits is advised, got ' +\n seed.length\n );\n }\n const I = hmac(sha512, MASTER_SECRET, seed);\n const privateKey = I.slice(0, 32);\n const chainCode = I.slice(32);\n return new HDKey({ versions, chainCode, privateKey });\n }\n\n static fromExtendedKey(base58key: string, versions: Versions = BITCOIN_VERSIONS): HDKey {\n // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n const keyBuffer: Uint8Array = base58check.decode(base58key);\n const keyView = createView(keyBuffer);\n const version = keyView.getUint32(0, false);\n const opt = {\n versions,\n depth: keyBuffer[4],\n parentFingerprint: keyView.getUint32(5, false),\n index: keyView.getUint32(9, false),\n chainCode: keyBuffer.slice(13, 45),\n };\n const key = keyBuffer.slice(45);\n const isPriv = key[0] === 0;\n if (version !== versions[isPriv ? 'private' : 'public']) {\n throw new Error('Version mismatch');\n }\n if (isPriv) {\n return new HDKey({ ...opt, privateKey: key.slice(1) });\n } else {\n return new HDKey({ ...opt, publicKey: key });\n }\n }\n\n public static fromJSON(json: { xpriv: string }): HDKey {\n return HDKey.fromExtendedKey(json.xpriv);\n }\n readonly versions: Versions;\n readonly depth: number = 0;\n readonly index: number = 0;\n readonly chainCode: Uint8Array | null = null;\n readonly parentFingerprint: number = 0;\n private _privateKey?: Uint8Array;\n private _publicKey?: Uint8Array;\n private pubHash: Uint8Array | undefined;\n\n constructor(opt: HDKeyOpt) {\n if (!opt || typeof opt !== 'object') {\n throw new Error('HDKey.constructor must not be called directly');\n }\n this.versions = opt.versions || BITCOIN_VERSIONS;\n this.depth = opt.depth || 0;\n this.chainCode = opt.chainCode || null;\n this.index = opt.index || 0;\n this.parentFingerprint = opt.parentFingerprint || 0;\n if (!this.depth) {\n if (this.parentFingerprint || this.index) {\n throw new Error('HDKey: zero depth with non-zero index/parent fingerprint');\n }\n }\n if (this.depth > 255) {\n throw new Error('HDKey: depth exceeds the serializable value 255');\n }\n if (opt.publicKey && opt.privateKey) {\n throw new Error('HDKey: publicKey and privateKey at same time.');\n }\n if (opt.privateKey) {\n if (!secp.utils.isValidSecretKey(opt.privateKey)) throw new Error('Invalid private key');\n this._privateKey = opt.privateKey;\n this._publicKey = secp.getPublicKey(opt.privateKey, true);\n } else if (opt.publicKey) {\n this._publicKey = Point.fromBytes(opt.publicKey).toBytes(true); // force compressed point\n } else {\n throw new Error('HDKey: no public or private key provided');\n }\n this.pubHash = hash160(this._publicKey);\n }\n\n derive(path: string): HDKey {\n if (!/^[mM]'?/.test(path)) {\n throw new Error('Path must start with \"m\" or \"M\"');\n }\n if (/^[mM]'?$/.test(path)) {\n return this;\n }\n const parts = path.replace(/^[mM]'?\\//, '').split('/');\n // tslint:disable-next-line\n let child: HDKey = this;\n for (const c of parts) {\n const m = /^(\\d+)('?)$/.exec(c);\n const m1 = m && m[1];\n if (!m || m.length !== 3 || typeof m1 !== 'string')\n throw new Error('invalid child index: ' + c);\n let idx = +m1;\n if (!Number.isSafeInteger(idx) || idx >= HARDENED_OFFSET) {\n throw new Error('Invalid index');\n }\n // hardened key\n if (m[2] === \"'\") {\n idx += HARDENED_OFFSET;\n }\n child = child.deriveChild(idx);\n }\n return child;\n }\n\n deriveChild(index: number): HDKey {\n if (!this._publicKey || !this.chainCode) {\n throw new Error('No publicKey or chainCode set');\n }\n let data = toU32(index);\n if (index >= HARDENED_OFFSET) {\n // Hardened\n const priv = this._privateKey;\n if (!priv) {\n throw new Error('Could not derive hardened child key');\n }\n // Hardened child: 0x00 || ser256(kpar) || ser32(index)\n data = concatBytes(Uint8Array.of(0), priv, data);\n } else {\n // Normal child: serP(point(kpar)) || ser32(index)\n data = concatBytes(this._publicKey, data);\n }\n const I = hmac(sha512, this.chainCode, data);\n const childTweak = I.slice(0, 32);\n const chainCode = I.slice(32);\n if (!secp.utils.isValidSecretKey(childTweak)) {\n throw new Error('Tweak bigger than curve order');\n }\n const opt: HDKeyOpt = {\n versions: this.versions,\n chainCode,\n depth: this.depth + 1,\n parentFingerprint: this.fingerprint,\n index,\n };\n const ctweak = Fn.fromBytes(childTweak);\n try {\n // Private parent key -> private child key\n if (this._privateKey) {\n const added = Fn.create(Fn.fromBytes(this._privateKey) + ctweak);\n if (!Fn.isValidNot0(added)) {\n throw new Error('The tweak was out of range or the resulted private key is invalid');\n }\n opt.privateKey = Fn.toBytes(added);\n } else {\n const added = Point.fromBytes(this._publicKey).add(Point.BASE.multiply(ctweak));\n // Cryptographically impossible: hmac-sha512 preimage would need to be found\n if (added.equals(Point.ZERO)) {\n throw new Error('The tweak was equal to negative P, which made the result key invalid');\n }\n opt.publicKey = added.toBytes(true);\n }\n return new HDKey(opt);\n } catch (err) {\n return this.deriveChild(index + 1);\n }\n }\n\n sign(hash: Uint8Array): Uint8Array {\n if (!this._privateKey) {\n throw new Error('No privateKey set!');\n }\n abytes(hash, 32);\n return secp.sign(hash, this._privateKey, { prehash: false });\n }\n\n verify(hash: Uint8Array, signature: Uint8Array): boolean {\n abytes(hash, 32);\n abytes(signature, 64);\n if (!this._publicKey) {\n throw new Error('No publicKey set!');\n }\n return secp.verify(signature, hash, this._publicKey, { prehash: false });\n }\n\n wipePrivateData(): this {\n if (this._privateKey) {\n this._privateKey.fill(0);\n this._privateKey = undefined;\n }\n return this;\n }\n toJSON(): { xpriv: string; xpub: string } {\n return {\n xpriv: this.privateExtendedKey,\n xpub: this.publicExtendedKey,\n };\n }\n\n private serialize(version: number, key: Uint8Array) {\n if (!this.chainCode) {\n throw new Error('No chainCode set');\n }\n abytes(key, 33);\n // version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n return concatBytes(\n toU32(version),\n new Uint8Array([this.depth]),\n toU32(this.parentFingerprint),\n toU32(this.index),\n this.chainCode,\n key\n );\n }\n}\n", "/**\n * SECG secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).\n *\n * Belongs to Koblitz curves: it has efficiently-computable GLV endomorphism \u03C8,\n * check out {@link EndomorphismOpts}. Seems to be rigid (not backdoored).\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha2.js';\nimport { randomBytes } from '@noble/hashes/utils.js';\nimport { createKeygen, type CurveLengths } from './abstract/curve.ts';\nimport { createHasher, type H2CHasher, isogenyMap } from './abstract/hash-to-curve.ts';\nimport { Field, mapHashToField, pow2 } from './abstract/modular.ts';\nimport {\n type ECDSA,\n ecdsa,\n type EndomorphismOpts,\n mapToCurveSimpleSWU,\n type WeierstrassPoint as PointType,\n weierstrass,\n type WeierstrassOpts,\n type WeierstrassPointCons,\n} from './abstract/weierstrass.ts';\nimport { abytes, asciiToBytes, bytesToNumberBE, concatBytes } from './utils.ts';\n\n// Seems like generator was produced from some seed:\n// `Pointk1.BASE.multiply(Pointk1.Fn.inv(2n, N)).toAffine().x`\n// // gives short x 0x3b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63n\nconst secp256k1_CURVE: WeierstrassOpts<bigint> = {\n p: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n h: BigInt(1),\n a: BigInt(0),\n b: BigInt(7),\n Gx: BigInt('0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798'),\n Gy: BigInt('0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8'),\n};\n\nconst secp256k1_ENDO: EndomorphismOpts = {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n basises: [\n [BigInt('0x3086d221a7d46bcde86c90e49284eb15'), -BigInt('0xe4437ed6010e88286f547fa90abfe4c3')],\n [BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8'), BigInt('0x3086d221a7d46bcde86c90e49284eb15')],\n ],\n};\n\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _2n = /* @__PURE__ */ BigInt(2);\n\n/**\n * \u221An = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y: bigint): bigint {\n const P = secp256k1_CURVE.p;\n // prettier-ignore\n const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n // prettier-ignore\n const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n const b2 = (y * y * y) % P; // x^3, 11\n const b3 = (b2 * b2 * y) % P; // x^7\n const b6 = (pow2(b3, _3n, P) * b3) % P;\n const b9 = (pow2(b6, _3n, P) * b3) % P;\n const b11 = (pow2(b9, _2n, P) * b2) % P;\n const b22 = (pow2(b11, _11n, P) * b11) % P;\n const b44 = (pow2(b22, _22n, P) * b22) % P;\n const b88 = (pow2(b44, _44n, P) * b44) % P;\n const b176 = (pow2(b88, _88n, P) * b88) % P;\n const b220 = (pow2(b176, _44n, P) * b44) % P;\n const b223 = (pow2(b220, _3n, P) * b3) % P;\n const t1 = (pow2(b223, _23n, P) * b22) % P;\n const t2 = (pow2(t1, _6n, P) * b2) % P;\n const root = pow2(t2, _2n, P);\n if (!Fpk1.eql(Fpk1.sqr(root), y)) throw new Error('Cannot find square root');\n return root;\n}\n\nconst Fpk1 = Field(secp256k1_CURVE.p, { sqrt: sqrtMod });\nconst Pointk1 = /* @__PURE__ */ weierstrass(secp256k1_CURVE, {\n Fp: Fpk1,\n endo: secp256k1_ENDO,\n});\n\n/**\n * secp256k1 curve: ECDSA and ECDH methods.\n *\n * Uses sha256 to hash messages. To use a different hash,\n * pass `{ prehash: false }` to sign / verify.\n *\n * @example\n * ```js\n * import { secp256k1 } from '@noble/curves/secp256k1.js';\n * const { secretKey, publicKey } = secp256k1.keygen();\n * // const publicKey = secp256k1.getPublicKey(secretKey);\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = secp256k1.sign(msg, secretKey);\n * const isValid = secp256k1.verify(sig, msg, publicKey);\n * // const sigKeccak = secp256k1.sign(keccak256(msg), secretKey, { prehash: false });\n * ```\n */\nexport const secp256k1: ECDSA = /* @__PURE__ */ ecdsa(Pointk1, sha256);\n\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES: { [tag: string]: Uint8Array } = {};\nfunction taggedHash(tag: string, ...messages: Uint8Array[]): Uint8Array {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = sha256(asciiToBytes(tag));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return sha256(concatBytes(tagP, ...messages));\n}\n\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point: PointType<bigint>) => point.toBytes(true).slice(1);\nconst hasEven = (y: bigint) => y % _2n === _0n;\n\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv: Uint8Array) {\n const { Fn, BASE } = Pointk1;\n const d_ = Fn.fromBytes(priv);\n const p = BASE.multiply(d_); // P = d'\u22C5G; 0 < d' < n check is done inside\n const scalar = hasEven(p.y) ? d_ : Fn.neg(d_);\n return { scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x: bigint): PointType<bigint> {\n const Fp = Fpk1;\n if (!Fp.isValidNot0(x)) throw new Error('invalid x: Fail if x \u2265 p');\n const xx = Fp.create(x * x);\n const c = Fp.create(xx * x + BigInt(7)); // Let c = x\u00B3 + 7 mod p.\n let y = Fp.sqrt(c); // Let y = c^(p+1)/4 mod p. Same as sqrt().\n // Return the unique point P such that x(P) = x and\n // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n if (!hasEven(y)) y = Fp.neg(y);\n const p = Pointk1.fromAffine({ x, y });\n p.assertValidity();\n return p;\n}\nconst num = bytesToNumberBE;\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args: Uint8Array[]): bigint {\n return Pointk1.Fn.create(num(taggedHash('BIP0340/challenge', ...args)));\n}\n\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(secretKey: Uint8Array): Uint8Array {\n return schnorrGetExtPubKey(secretKey).bytes; // d'=int(sk). Fail if d'=0 or d'\u2265n. Ret bytes(d'\u22C5G)\n}\n\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(\n message: Uint8Array,\n secretKey: Uint8Array,\n auxRand: Uint8Array = randomBytes(32)\n): Uint8Array {\n const { Fn } = Pointk1;\n const m = abytes(message, undefined, 'message');\n const { bytes: px, scalar: d } = schnorrGetExtPubKey(secretKey); // checks for isWithinCurveOrder\n const a = abytes(auxRand, 32, 'auxRand'); // Auxiliary random data a: a 32-byte array\n const t = Fn.toBytes(d ^ num(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n // Let k' = int(rand) mod n. Fail if k' = 0. Let R = k'\u22C5G\n const { bytes: rx, scalar: k } = schnorrGetExtPubKey(rand);\n const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n sig.set(rx, 0);\n sig.set(Fn.toBytes(Fn.create(k + e * d)), 32);\n // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n if (!schnorrVerify(sig, m, px)) throw new Error('sign: Invalid signature produced');\n return sig;\n}\n\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature: Uint8Array, message: Uint8Array, publicKey: Uint8Array): boolean {\n const { Fp, Fn, BASE } = Pointk1;\n const sig = abytes(signature, 64, 'signature');\n const m = abytes(message, undefined, 'message');\n const pub = abytes(publicKey, 32, 'publicKey');\n try {\n const P = lift_x(num(pub)); // P = lift_x(int(pk)); fail if that fails\n const r = num(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r \u2265 p.\n if (!Fp.isValidNot0(r)) return false;\n const s = num(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s \u2265 n.\n if (!Fn.isValidNot0(s)) return false;\n\n const e = challenge(Fn.toBytes(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n // R = s\u22C5G - e\u22C5P, where -eP == (n-e)P\n const R = BASE.multiplyUnsafe(s).add(P.multiplyUnsafe(Fn.neg(e)));\n const { x, y } = R.toAffine();\n // Fail if is_infinite(R) / not has_even_y(R) / x(R) \u2260 r.\n if (R.is0() || !hasEven(y) || x !== r) return false;\n return true;\n } catch (error) {\n return false;\n }\n}\n\nexport type SecpSchnorr = {\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: typeof schnorrGetPublicKey;\n sign: typeof schnorrSign;\n verify: typeof schnorrVerify;\n Point: WeierstrassPointCons<bigint>;\n utils: {\n randomSecretKey: (seed?: Uint8Array) => Uint8Array;\n pointToBytes: (point: PointType<bigint>) => Uint8Array;\n lift_x: typeof lift_x;\n taggedHash: typeof taggedHash;\n };\n lengths: CurveLengths;\n};\n/**\n * Schnorr signatures over secp256k1.\n * https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n * @example\n * ```js\n * import { schnorr } from '@noble/curves/secp256k1.js';\n * const { secretKey, publicKey } = schnorr.keygen();\n * // const publicKey = schnorr.getPublicKey(secretKey);\n * const msg = new TextEncoder().encode('hello');\n * const sig = schnorr.sign(msg, secretKey);\n * const isValid = schnorr.verify(sig, msg, publicKey);\n * ```\n */\nexport const schnorr: SecpSchnorr = /* @__PURE__ */ (() => {\n const size = 32;\n const seedLength = 48;\n const randomSecretKey = (seed = randomBytes(seedLength)): Uint8Array => {\n return mapHashToField(seed, secp256k1_CURVE.n);\n };\n return {\n keygen: createKeygen(randomSecretKey, schnorrGetPublicKey),\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n Point: Pointk1,\n utils: {\n randomSecretKey,\n taggedHash,\n lift_x,\n pointToBytes,\n },\n lengths: {\n secretKey: size,\n publicKey: size,\n publicKeyHasPrefix: false,\n signature: size * 2,\n seed: seedLength,\n },\n };\n})();\n\nconst isoMap = /* @__PURE__ */ (() =>\n isogenyMap(\n Fpk1,\n [\n // xNum\n [\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n ],\n // xDen\n [\n '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n // yNum\n [\n '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n ],\n // yDen\n [\n '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n ].map((i) => i.map((j) => BigInt(j))) as [bigint[], bigint[], bigint[], bigint[]]\n ))();\nconst mapSWU = /* @__PURE__ */ (() =>\n mapToCurveSimpleSWU(Fpk1, {\n A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n B: BigInt('1771'),\n Z: Fpk1.create(BigInt('-11')),\n }))();\n\n/** Hashing / encoding to secp256k1 points / field. RFC 9380 methods. */\nexport const secp256k1_hasher: H2CHasher<WeierstrassPointCons<bigint>> = /* @__PURE__ */ (() =>\n createHasher(\n Pointk1,\n (scalars: bigint[]) => {\n const { x, y } = mapSWU(Fpk1.create(scalars[0]));\n return isoMap(x, y);\n },\n {\n DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n p: Fpk1.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha256,\n }\n ))();\n", "/**\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://www.rfc-editor.org/rfc/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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal 32-byte base SHA2 hash class. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n constructor() {\n super(32);\n }\n}\n\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal 64-byte base SHA2 hash class. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\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 protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor() {\n super(64);\n }\n}\n\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n */\nexport const sha256: CHash<_SHA256> = /* @__PURE__ */ createHasher(\n () => new _SHA256(),\n /* @__PURE__ */ oidNist(0x01)\n);\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash<_SHA224> = /* @__PURE__ */ createHasher(\n () => new _SHA224(),\n /* @__PURE__ */ oidNist(0x04)\n);\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash<_SHA512> = /* @__PURE__ */ createHasher(\n () => new _SHA512(),\n /* @__PURE__ */ oidNist(0x03)\n);\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash<_SHA384> = /* @__PURE__ */ createHasher(\n () => new _SHA384(),\n /* @__PURE__ */ oidNist(0x02)\n);\n\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: CHash<_SHA512_256> = /* @__PURE__ */ createHasher(\n () => new _SHA512_256(),\n /* @__PURE__ */ oidNist(0x06)\n);\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: CHash<_SHA512_224> = /* @__PURE__ */ createHasher(\n () => new _SHA512_224(),\n /* @__PURE__ */ oidNist(0x05)\n);\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\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: Uint8Array): this {\n aexists(this);\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) 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: Uint8Array): void {\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++) 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 view.setBigUint64(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 must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\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\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\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: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\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, type Signer } from '../utils.ts';\nimport { Field, FpInvertBatch, validateField, type IField } from './modular.ts';\n\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\n\nexport type AffinePoint<T> = {\n x: T;\n y: T;\n} & { Z?: never };\n\n// We can't \"abstract out\" coordinates (X, Y, Z; and T in Edwards): argument names of constructor\n// are not accessible. See Typescript gh-56093, gh-41594.\n//\n// We have to use recursive types, so it will return actual point, not constained `CurvePoint`.\n// If, at any point, P is `any`, it will erase all types and replace it\n// with `any`, because of recursion, `any implements CurvePoint`,\n// but we lose all constrains on methods.\n\n/** Base interface for all elliptic curve Points. */\nexport interface CurvePoint<F, P extends CurvePoint<F, P>> {\n /** Affine x coordinate. Different from projective / extended X coordinate. */\n x: F;\n /** Affine y coordinate. Different from projective / extended Y coordinate. */\n y: F;\n Z?: F;\n double(): P;\n negate(): P;\n add(other: P): P;\n subtract(other: P): P;\n equals(other: P): boolean;\n multiply(scalar: bigint): P;\n assertValidity(): void;\n clearCofactor(): P;\n is0(): boolean;\n isTorsionFree(): boolean;\n isSmallOrder(): boolean;\n multiplyUnsafe(scalar: bigint): P;\n /**\n * Massively speeds up `p.multiply(n)` by using precompute tables (caching). See {@link wNAF}.\n * @param isLazy calculate cache now. Default (true) ensures it's deferred to first `multiply()`\n */\n precompute(windowSize?: number, isLazy?: boolean): P;\n /** Converts point to 2D xy affine coordinates */\n toAffine(invertedZ?: F): AffinePoint<F>;\n toBytes(): Uint8Array;\n toHex(): string;\n}\n\n/** Base interface for all elliptic curve Point constructors. */\nexport interface CurvePointCons<P extends CurvePoint<any, P>> {\n [Symbol.hasInstance]: (item: unknown) => boolean;\n BASE: P;\n ZERO: P;\n /** Field for basic curve math */\n Fp: IField<P_F<P>>;\n /** Scalar field, for scalars in multiply and others */\n Fn: IField<bigint>;\n /** Creates point from x, y. Does NOT validate if the point is valid. Use `.assertValidity()`. */\n fromAffine(p: AffinePoint<P_F<P>>): P;\n fromBytes(bytes: Uint8Array): P;\n fromHex(hex: string): P;\n}\n\n// Type inference helpers: PC - PointConstructor, P - Point, Fp - Field element\n// Short names, because we use them a lot in result types:\n// * we can't do 'P = GetCurvePoint<PC>': this is default value and doesn't constrain anything\n// * we can't do 'type X = GetCurvePoint<PC>': it won't be accesible for arguments/return types\n// * `CurvePointCons<P extends CurvePoint<any, P>>` constraints from interface definition\n// won't propagate, if `PC extends CurvePointCons<any>`: the P would be 'any', which is incorrect\n// * PC could be super specific with super specific P, which implements CurvePoint<any, P>.\n// this means we need to do stuff like\n// `function test<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(`\n// if we want type safety around P, otherwise PC_P<PC> will be any\n\n/** Returns Fp type from Point (P_F<P> == P.F) */\nexport type P_F<P extends CurvePoint<any, P>> = P extends CurvePoint<infer F, P> ? F : never;\n/** Returns Fp type from PointCons (PC_F<PC> == PC.P.F) */\nexport type PC_F<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['Fp']['ZERO'];\n/** Returns Point type from PointCons (PC_P<PC> == PC.P) */\nexport type PC_P<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['ZERO'];\n\n// Ugly hack to get proper type inference, because in typescript fails to infer resursively.\n// The hack allows to do up to 10 chained operations without applying type erasure.\n//\n// Types which won't work:\n// * `CurvePointCons<CurvePoint<any, any>>`, will return `any` after 1 operation\n// * `CurvePointCons<any>: WeierstrassPointCons<bigint> extends CurvePointCons<any> = false`\n// * `P extends CurvePoint, PC extends CurvePointCons<P>`\n// * It can't infer P from PC alone\n// * Too many relations between F, P & PC\n// * It will infer P/F if `arg: CurvePointCons<F, P>`, but will fail if PC is generic\n// * It will work correctly if there is an additional argument of type P\n// * But generally, we don't want to parametrize `CurvePointCons` over `F`: it will complicate\n// types, making them un-inferable\n// prettier-ignore\nexport type PC_ANY = CurvePointCons<\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any, any>\n >>>>>>>>>\n>;\n\nexport interface CurveLengths {\n secretKey?: number;\n publicKey?: number;\n publicKeyUncompressed?: number;\n publicKeyHasPrefix?: boolean;\n signature?: number;\n seed?: number;\n}\n\nexport type Mapper<T> = (i: T[]) => T[];\n\nexport function negateCt<T extends { negate: () => T }>(condition: boolean, item: T): T {\n const neg = item.negate();\n return condition ? neg : item;\n}\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<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[]\n): P[] {\n const invertedZs = FpInvertBatch(\n c.Fp,\n points.map((p) => p.Z!)\n );\n return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));\n}\n\nfunction validateW(W: number, bits: number) {\n if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\n\n/** Internal wNAF opts for specific W and scalarBits */\ntype WOpts = {\n windows: number;\n windowSize: number;\n mask: bigint;\n maxNumber: number;\n shiftBy: bigint;\n};\n\nfunction calcWOpts(W: number, scalarBits: number): WOpts {\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}\n\nfunction calcOffsets(n: bigint, window: number, wOpts: 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\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\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}\n\nfunction validateMSMPoints(points: any[], c: any) {\n if (!Array.isArray(points)) throw new Error('array expected');\n points.forEach((p, i) => {\n if (!(p instanceof c)) throw new Error('invalid point at index ' + i);\n });\n}\nfunction validateMSMScalars(scalars: any[], field: any) {\n if (!Array.isArray(scalars)) throw new Error('array of scalars expected');\n scalars.forEach((s, i) => {\n if (!field.isValid(s)) throw new Error('invalid scalar at index ' + i);\n });\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<any, any[]>();\nconst pointWindowSizes = new WeakMap<any, number>();\n\nfunction getW(P: any): number {\n // To disable precomputes:\n // return 1;\n return pointWindowSizes.get(P) || 1;\n}\n\nfunction assert0(n: bigint): void {\n if (n !== _0n) throw new Error('invalid wNAF');\n}\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 / \uD835\uDC4A) + 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<PC extends PC_ANY> {\n private readonly BASE: PC_P<PC>;\n private readonly ZERO: PC_P<PC>;\n private readonly Fn: PC['Fn'];\n readonly bits: number;\n\n // Parametrized with a given Point class (not individual point)\n constructor(Point: PC, bits: number) {\n this.BASE = Point.BASE;\n this.ZERO = Point.ZERO;\n this.Fn = Point.Fn;\n this.bits = bits;\n }\n\n // non-const time multiplication ladder\n _unsafeLadder(elm: PC_P<PC>, n: bigint, p: PC_P<PC> = this.ZERO): PC_P<PC> {\n let d: PC_P<PC> = elm;\n while (n > _0n) {\n if (n & _1n) p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\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^(\uD835\uDC4A\u22121) * (Math.ceil(\uD835\uDC5B / \uD835\uDC4A) + 1), where:\n * - \uD835\uDC4A is the window size\n * - \uD835\uDC5B 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 private precomputeWindow(point: PC_P<PC>, W: number): PC_P<PC>[] {\n const { windows, windowSize } = calcWOpts(W, this.bits);\n const points: PC_P<PC>[] = [];\n let p: PC_P<PC> = 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 /**\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 private wNAF(W: number, precomputes: PC_P<PC>[], n: bigint): { p: PC_P<PC>; f: PC_P<PC> } {\n // Scalar should be smaller than field order\n if (!this.Fn.isValid(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 } 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 /**\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 private wNAFUnsafe(\n W: number,\n precomputes: PC_P<PC>[],\n n: bigint,\n acc: PC_P<PC> = this.ZERO\n ): PC_P<PC> {\n const wo = calcWOpts(W, this.bits);\n for (let window = 0; window < wo.windows; window++) {\n if (n === _0n) 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 } 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\n private getPrecomputes(W: number, point: PC_P<PC>, transform?: Mapper<PC_P<PC>>): PC_P<PC>[] {\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) as PC_P<PC>[];\n if (W !== 1) {\n // Doing transform outside of if brings 15% perf hit\n if (typeof transform === 'function') comp = transform(comp);\n pointPrecomputes.set(point, comp);\n }\n }\n return comp;\n }\n\n cached(\n point: PC_P<PC>,\n scalar: bigint,\n transform?: Mapper<PC_P<PC>>\n ): { p: PC_P<PC>; f: PC_P<PC> } {\n const W = getW(point);\n return this.wNAF(W, this.getPrecomputes(W, point, transform), scalar);\n }\n\n unsafe(point: PC_P<PC>, scalar: bigint, transform?: Mapper<PC_P<PC>>, prev?: PC_P<PC>): PC_P<PC> {\n const W = getW(point);\n if (W === 1) 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\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: PC_P<PC>, W: number): void {\n validateW(W, this.bits);\n pointWindowSizes.set(P, W);\n pointPrecomputes.delete(P);\n }\n\n hasCache(elm: PC_P<PC>): boolean {\n return getW(elm) !== 1;\n }\n}\n\n/**\n * Endomorphism-specific multiplication for Koblitz curves.\n * Cost: 128 dbl, 0-256 adds.\n */\nexport function mulEndoUnsafe<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n Point: PC,\n point: P,\n k1: bigint,\n k2: bigint\n): { p1: P; p2: P } {\n let acc = point;\n let p1 = Point.ZERO;\n let p2 = Point.ZERO;\n while (k1 > _0n || k2 > _0n) {\n if (k1 & _1n) p1 = p1.add(acc);\n if (k2 & _1n) p2 = p2.add(acc);\n acc = acc.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n return { p1, p2 };\n}\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<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[],\n scalars: bigint[]\n): P {\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 const fieldN = c.Fn;\n validateMSMPoints(points, c);\n validateMSMScalars(scalars, fieldN);\n const plength = points.length;\n const slength = scalars.length;\n if (plength !== slength) 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) windowSize = wbits - 3;\n else if (wbits > 4) windowSize = wbits - 2;\n else if (wbits > 0) 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) for (let j = 0; j < windowSize; j++) sum = sum.double();\n }\n return sum as P;\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<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[],\n windowSize: number\n): (scalars: bigint[]) => P {\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 \u00D7 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 \u00D7 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 \u00D7 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 const fieldN = c.Fn;\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: 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: bigint[]): P => {\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) for (let j = 0; j < windowSize; j++) 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) continue; // skip zero scalars chunks\n res = res.add(tables[j][curr - 1]);\n }\n }\n return res;\n };\n}\n\nexport type ValidCurveParams<T> = {\n p: bigint;\n n: bigint;\n h: bigint;\n a: T;\n b?: T;\n d?: T;\n Gx: T;\n Gy: T;\n};\n\nfunction createField<T>(order: bigint, field?: IField<T>, isLE?: boolean): IField<T> {\n if (field) {\n if (field.ORDER !== order) throw new Error('Field.ORDER must match order: Fp == p, Fn == n');\n validateField(field);\n return field;\n } else {\n return Field(order, { isLE }) as unknown as IField<T>;\n }\n}\nexport type FpFn<T> = { Fp: IField<T>; Fn: IField<bigint> };\n\n/** Validates CURVE opts and creates fields */\nexport function createCurveFields<T>(\n type: 'weierstrass' | 'edwards',\n CURVE: ValidCurveParams<T>,\n curveOpts: Partial<FpFn<T>> = {},\n FpFnLE?: boolean\n): FpFn<T> & { CURVE: ValidCurveParams<T> } {\n if (FpFnLE === undefined) FpFnLE = type === 'edwards';\n if (!CURVE || typeof CURVE !== 'object') throw new Error(`expected valid ${type} CURVE object`);\n for (const p of ['p', 'n', 'h'] as const) {\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: 'b' | 'd' = type === 'weierstrass' ? 'b' : 'd';\n const params = ['Gx', 'Gy', 'a', _b] as const;\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\ntype KeygenFn = (\n seed?: Uint8Array,\n isCompressed?: boolean\n) => { secretKey: Uint8Array; publicKey: Uint8Array };\nexport function createKeygen(\n randomSecretKey: Function,\n getPublicKey: Signer['getPublicKey']\n): KeygenFn {\n return function keygen(seed?: Uint8Array) {\n const secretKey = randomSecretKey(seed);\n return { secretKey, publicKey: getPublicKey(secretKey) };\n };\n}\n", "/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport {\n abytes as abytes_,\n anumber,\n bytesToHex as bytesToHex_,\n concatBytes as concatBytes_,\n hexToBytes as hexToBytes_,\n} from '@noble/hashes/utils.js';\nexport {\n abytes,\n anumber,\n bytesToHex,\n concatBytes,\n hexToBytes,\n isBytes,\n randomBytes,\n} from '@noble/hashes/utils.js';\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\n\nexport type CHash = {\n (message: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array) => Uint8Array;\nexport function abool(value: boolean, title: string = ''): boolean {\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\n// Used in weierstrass, der\nfunction abignumber(n: number | bigint) {\n if (typeof n === 'bigint') {\n if (!isPosBig(n)) throw new Error('positive bigint expected, got ' + n);\n } else anumber(n);\n return n;\n}\n\nexport function asafenumber(value: number, title: string = ''): void {\n if (!Number.isSafeInteger(value)) {\n const prefix = title && `\"${title}\" `;\n throw new Error(prefix + 'expected safe integer, got type=' + typeof value);\n }\n}\n\nexport function numberToHexUnpadded(num: number | bigint): string {\n const hex = abignumber(num).toString(16);\n return hex.length & 1 ? '0' + hex : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex_(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n anumber(len);\n n = abignumber(n);\n const res = hexToBytes_(n.toString(16).padStart(len * 2, '0'));\n if (res.length !== len) throw new Error('number too large');\n return res;\n}\nexport function numberToBytesLE(n: number | bigint, len: number): Uint8Array {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number | bigint): Uint8Array {\n return hexToBytes_(numberToHexUnpadded(abignumber(n)));\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array): boolean {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n return diff === 0;\n}\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: Uint8Array): Uint8Array {\n return Uint8Array.from(bytes);\n}\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 `TextEncoder` for ASCII or throws.\n */\nexport function asciiToBytes(ascii: string): Uint8Array {\n return Uint8Array.from(ascii, (c, i) => {\n const charCode = c.charCodeAt(0);\n if (c.length !== 1 || charCode > 127) {\n throw new Error(\n `string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`\n );\n }\n return charCode;\n });\n}\n\n// Is positive bigint\nconst isPosBig = (n: bigint) => typeof n === 'bigint' && _0n <= n;\n\nexport function inRange(n: bigint, min: bigint, max: bigint): boolean {\n return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\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: string, n: bigint, min: bigint, max: bigint): void {\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\n// Bit operations\n\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: bigint): number {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1);\n return len;\n}\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: bigint, pos: number): bigint {\n return (n >> BigInt(pos)) & _1n;\n}\n\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n: bigint, pos: number, value: boolean): bigint {\n return n | ((value ? _1n : _0n) << BigInt(pos));\n}\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: number): bigint => (_1n << BigInt(n)) - _1n;\n\n// DRBG\n\ntype Pred<T> = (v: Uint8Array) => T | undefined;\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<T>(\n hashLen: number,\n qByteLen: number,\n hmacFn: (key: Uint8Array, message: Uint8Array) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n anumber(hashLen, 'hashLen');\n anumber(qByteLen, 'qByteLen');\n if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\n const u8n = (len: number): Uint8Array => new Uint8Array(len); // creates Uint8Array\n const NULL = Uint8Array.of();\n const byte0 = Uint8Array.of(0x00);\n const byte1 = Uint8Array.of(0x01);\n const _maxDrbgIters = 1000;\n\n // Step B, Step C: set hashLen to 8*ceil(hlen/8)\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 = (...msgs: Uint8Array[]) => hmacFn(k, concatBytes_(v, ...msgs)); // hmac(k)(v, ...values)\n const reseed = (seed: Uint8Array = NULL) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(byte0, seed); // k = hmac(k || v || 0x00 || seed)\n v = h(); // v = hmac(k || v)\n if (seed.length === 0) return;\n k = h(byte1, 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++ >= _maxDrbgIters) throw new Error('drbg: tried max amount of iterations');\n let len = 0;\n const out: Uint8Array[] = [];\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: Uint8Array, pred: Pred<T>): T => {\n reset();\n reseed(seed); // Steps D-G\n let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen()))) reseed();\n reset();\n return res;\n };\n return genUntil;\n}\n\nexport function validateObject(\n object: Record<string, any>,\n fields: Record<string, string> = {},\n optFields: Record<string, string> = {}\n): void {\n if (!object || typeof object !== 'object') throw new Error('expected valid options object');\n type Item = keyof typeof object;\n function checkField(fieldName: Item, expectedType: string, isOpt: boolean) {\n const val = object[fieldName];\n if (isOpt && val === undefined) 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 const iter = (f: typeof fields, isOpt: boolean) =>\n Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n iter(fields, false);\n iter(optFields, true);\n}\n\n/**\n * throws not implemented error\n */\nexport const notImplemented = (): never => {\n throw new Error('not implemented');\n};\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<T extends object, R, O extends any[]>(\n fn: (arg: T, ...args: O) => R\n): (arg: T, ...args: O) => R {\n const map = new WeakMap<T, R>();\n return (arg: T, ...args: O): R => {\n const val = map.get(arg);\n if (val !== undefined) return val;\n const computed = fn(arg, ...args);\n map.set(arg, computed);\n return computed;\n };\n}\n\nexport interface CryptoKeys {\n lengths: { seed?: number; public?: number; secret?: number };\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: (secretKey: Uint8Array) => Uint8Array;\n}\n\n/** Generic interface for signatures. Has keygen, sign and verify. */\nexport interface Signer extends CryptoKeys {\n // Interfaces are fun. We cannot just add new fields without copying old ones.\n lengths: {\n seed?: number;\n public?: number;\n secret?: number;\n signRand?: number;\n signature?: number;\n };\n sign: (msg: Uint8Array, secretKey: Uint8Array) => Uint8Array;\n verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array) => boolean;\n}\n", "/**\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 {\n abytes,\n anumber,\n bytesToNumberBE,\n bytesToNumberLE,\n numberToBytesBE,\n numberToBytesLE,\n validateObject,\n} from '../utils.ts';\n\n// Numbers aren't used in x25519 / x448 builds\n// prettier-ignore\nconst _0n = /* @__PURE__ */ BigInt(0), _1n = /* @__PURE__ */ BigInt(1), _2n = /* @__PURE__ */ BigInt(2);\n// prettier-ignore\nconst _3n = /* @__PURE__ */ BigInt(3), _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5);\n// prettier-ignore\nconst _7n = /* @__PURE__ */ BigInt(7), _8n = /* @__PURE__ */ BigInt(8), _9n = /* @__PURE__ */ BigInt(9);\nconst _16n = /* @__PURE__ */ BigInt(16);\n\n// Calculates a modulo b\nexport function mod(a: bigint, b: bigint): bigint {\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: bigint, power: bigint, modulo: bigint): bigint {\n return FpPow(Field(modulo), num, power);\n}\n\n/** Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` */\nexport function pow2(x: bigint, power: bigint, modulo: bigint): bigint {\n let res = x;\n while (power-- > _0n) {\n res *= res;\n res %= modulo;\n }\n return res;\n}\n\n/**\n * Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n */\nexport function invert(number: bigint, modulo: bigint): bigint {\n if (number === _0n) throw new Error('invert: expected non-zero number');\n if (modulo <= _0n) 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) throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\n\nfunction assertIsSquare<T>(Fp: IField<T>, root: T, n: T): void {\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n}\n\n// Not all roots are possible! Example which will throw:\n// const NUM =\n// n = 72057594037927816n;\n// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));\nfunction sqrt3mod4<T>(Fp: IField<T>, n: T) {\n const p1div4 = (Fp.ORDER + _1n) / _4n;\n const root = Fp.pow(n, p1div4);\n assertIsSquare(Fp, root, n);\n return root;\n}\n\nfunction sqrt5mod8<T>(Fp: IField<T>, n: T) {\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\n// Based on RFC9380, Kong algorithm\n// prettier-ignore\nfunction sqrt9mod16(P: bigint): <T>(Fp: IField<T>, n: T) => T {\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 <T>(Fp: IField<T>, n: T) => {\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/**\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: bigint): <T>(Fp: IField<T>, n: T) => T {\n // Initialization (precomputation).\n // Caching initialization could boost perf by 7%.\n if (P < _3n) 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\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) 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) return sqrt3mod4;\n\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<T>(Fp: IField<T>, n: T): T {\n if (Fp.is0(n)) return n;\n // Check if n is a quadratic residue using Legendre symbol\n if (FpLegendre(Fp, n) !== 1) throw new Error('Cannot find square root');\n\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\n // Main loop\n // while t != 1\n while (!Fp.eql(t, Fp.ONE)) {\n if (Fp.is0(t)) return Fp.ZERO; // if t=0 return R=0\n let i = 1;\n\n // Find the smallest i >= 1 such that t^(2^i) \u2261 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) throw new Error('Cannot find square root');\n }\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\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/**\n * Square root for a finite field. Will try optimized versions first:\n *\n * 1. P \u2261 3 (mod 4)\n * 2. P \u2261 5 (mod 8)\n * 3. P \u2261 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: bigint): <T>(Fp: IField<T>, n: T) => T {\n // P \u2261 3 (mod 4) => \u221An = n^((P+1)/4)\n if (P % _4n === _3n) return sqrt3mod4;\n // P \u2261 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf\n if (P % _8n === _5n) return sqrt5mod8;\n // P \u2261 9 (mod 16) => Kong algorithm, page 11 of https://eprint.iacr.org/2012/685.pdf (algorithm 4)\n if (P % _16n === _9n) return sqrt9mod16(P);\n // Tonelli-Shanks algorithm\n return tonelliShanks(P);\n}\n\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num: bigint, modulo: bigint): boolean =>\n (mod(num, modulo) & _1n) === _1n;\n\n/** Field is not always over prime: for example, Fp2 has ORDER(q)=p^m. */\nexport interface IField<T> {\n ORDER: bigint;\n BYTES: number;\n BITS: number;\n isLE: boolean;\n ZERO: T;\n ONE: T;\n // 1-arg\n create: (num: T) => T;\n isValid: (num: T) => boolean;\n is0: (num: T) => boolean;\n isValidNot0: (num: T) => boolean;\n neg(num: T): T;\n inv(num: T): T;\n sqrt(num: T): T;\n sqr(num: T): T;\n // 2-args\n eql(lhs: T, rhs: T): boolean;\n add(lhs: T, rhs: T): T;\n sub(lhs: T, rhs: T): T;\n mul(lhs: T, rhs: T | bigint): T;\n pow(lhs: T, power: bigint): T;\n div(lhs: T, rhs: T | bigint): T;\n // N for NonNormalized (for now)\n addN(lhs: T, rhs: T): T;\n subN(lhs: T, rhs: T): T;\n mulN(lhs: T, rhs: T | bigint): T;\n sqrN(num: T): T;\n\n // Optional\n // Should be same as sgn0 function in\n // [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#section-4.1).\n // NOTE: sgn0 is 'negative in LE', which is same as odd. And negative in LE is kinda strange definition anyway.\n isOdd?(num: T): boolean; // Odd instead of even since we have it for Fp2\n // legendre?(num: T): T;\n invertBatch: (lst: T[]) => T[];\n toBytes(num: T): Uint8Array;\n fromBytes(bytes: Uint8Array, skipValidation?: boolean): T;\n // If c is False, CMOV returns a, otherwise it returns b.\n cmov(a: T, b: T, c: boolean): T;\n}\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] as const;\nexport function validateField<T>(field: IField<T>): IField<T> {\n const initial = {\n ORDER: 'bigint',\n BYTES: 'number',\n BITS: 'number',\n } as Record<string, string>;\n const opts = FIELD_FIELDS.reduce((map, val: string) => {\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\n// Generic field functions\n\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<T>(Fp: IField<T>, num: T, power: bigint): T {\n if (power < _0n) throw new Error('invalid exponent, negatives unsupported');\n if (power === _0n) return Fp.ONE;\n if (power === _1n) return num;\n let p = Fp.ONE;\n let d = num;\n while (power > _0n) {\n if (power & _1n) p = Fp.mul(p, d);\n d = Fp.sqr(d);\n power >>= _1n;\n }\n return p;\n}\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<T>(Fp: IField<T>, nums: T[], passZero = false): T[] {\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)) 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)) return acc;\n inverted[i] = Fp.mul(acc, inverted[i]);\n return Fp.mul(acc, num);\n }, invertedAcc);\n return inverted;\n}\n\n// TODO: remove\nexport function FpDiv<T>(Fp: IField<T>, lhs: T, rhs: T | bigint): T {\n return Fp.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, Fp.ORDER) : Fp.inv(rhs));\n}\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) \u2261 1 if a is a square (mod p), quadratic residue\n * * (a | p) \u2261 -1 if a is not a square (mod p), quadratic non residue\n * * (a | p) \u2261 0 if a \u2261 0 (mod p)\n */\nexport function FpLegendre<T>(Fp: IField<T>, n: T): -1 | 0 | 1 {\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) throw new Error('invalid Legendre symbol result');\n return yes ? 1 : zero ? 0 : -1;\n}\n\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare<T>(Fp: IField<T>, n: T): boolean {\n const l = FpLegendre(Fp, n);\n return l === 1;\n}\n\nexport type NLength = { nByteLength: number; nBitLength: number };\n// CURVE.n lengths\nexport function nLength(n: bigint, nBitLength?: number): NLength {\n // Bit size, byte size of CURVE.n\n if (nBitLength !== undefined) 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\ntype FpField = IField<bigint> & Required<Pick<IField<bigint>, 'isOdd'>>;\ntype SqrtFn = (n: bigint) => bigint;\ntype FieldOpts = Partial<{\n isLE: boolean;\n BITS: number;\n sqrt: SqrtFn;\n allowedLengths?: readonly number[]; // for P521 (adds padding for smaller sizes)\n modFromBytes: boolean; // bls12-381 requires mod(n) instead of rejecting keys >= n\n}>;\nclass _Field implements IField<bigint> {\n readonly ORDER: bigint;\n readonly BITS: number;\n readonly BYTES: number;\n readonly isLE: boolean;\n readonly ZERO = _0n;\n readonly ONE = _1n;\n readonly _lengths?: number[];\n private _sqrt: ReturnType<typeof FpSqrt> | undefined; // cached sqrt\n private readonly _mod?: boolean;\n constructor(ORDER: bigint, opts: FieldOpts = {}) {\n if (ORDER <= _0n) throw new Error('invalid field: expected ORDER > 0, got ' + ORDER);\n let _nbitLength: number | undefined = undefined;\n this.isLE = false;\n if (opts != null && typeof opts === 'object') {\n if (typeof opts.BITS === 'number') _nbitLength = opts.BITS;\n if (typeof opts.sqrt === 'function') this.sqrt = opts.sqrt;\n if (typeof opts.isLE === 'boolean') this.isLE = opts.isLE;\n if (opts.allowedLengths) this._lengths = opts.allowedLengths?.slice();\n if (typeof opts.modFromBytes === 'boolean') this._mod = opts.modFromBytes;\n }\n const { nBitLength, nByteLength } = nLength(ORDER, _nbitLength);\n if (nByteLength > 2048) throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n this.ORDER = ORDER;\n this.BITS = nBitLength;\n this.BYTES = nByteLength;\n this._sqrt = undefined;\n Object.preventExtensions(this);\n }\n\n create(num: bigint) {\n return mod(num, this.ORDER);\n }\n isValid(num: bigint) {\n if (typeof num !== 'bigint')\n throw new Error('invalid field element: expected bigint, got ' + typeof num);\n return _0n <= num && num < this.ORDER; // 0 is valid element, but it's not invertible\n }\n is0(num: bigint) {\n return num === _0n;\n }\n // is valid and invertible\n isValidNot0(num: bigint) {\n return !this.is0(num) && this.isValid(num);\n }\n isOdd(num: bigint) {\n return (num & _1n) === _1n;\n }\n neg(num: bigint) {\n return mod(-num, this.ORDER);\n }\n eql(lhs: bigint, rhs: bigint) {\n return lhs === rhs;\n }\n\n sqr(num: bigint) {\n return mod(num * num, this.ORDER);\n }\n add(lhs: bigint, rhs: bigint) {\n return mod(lhs + rhs, this.ORDER);\n }\n sub(lhs: bigint, rhs: bigint) {\n return mod(lhs - rhs, this.ORDER);\n }\n mul(lhs: bigint, rhs: bigint) {\n return mod(lhs * rhs, this.ORDER);\n }\n pow(num: bigint, power: bigint): bigint {\n return FpPow(this, num, power);\n }\n div(lhs: bigint, rhs: bigint) {\n return mod(lhs * invert(rhs, this.ORDER), this.ORDER);\n }\n\n // Same as above, but doesn't normalize\n sqrN(num: bigint) {\n return num * num;\n }\n addN(lhs: bigint, rhs: bigint) {\n return lhs + rhs;\n }\n subN(lhs: bigint, rhs: bigint) {\n return lhs - rhs;\n }\n mulN(lhs: bigint, rhs: bigint) {\n return lhs * rhs;\n }\n\n inv(num: bigint) {\n return invert(num, this.ORDER);\n }\n sqrt(num: bigint): bigint {\n // Caching _sqrt speeds up sqrt9mod16 by 5x and tonneli-shanks by 10%\n if (!this._sqrt) this._sqrt = FpSqrt(this.ORDER);\n return this._sqrt(this, num);\n }\n toBytes(num: bigint) {\n return this.isLE ? numberToBytesLE(num, this.BYTES) : numberToBytesBE(num, this.BYTES);\n }\n fromBytes(bytes: Uint8Array, skipValidation = false) {\n abytes(bytes);\n const { _lengths: allowedLengths, BYTES, isLE, ORDER, _mod: modFromBytes } = this;\n if (allowedLengths) {\n if (!allowedLengths.includes(bytes.length) || bytes.length > BYTES) {\n throw new Error(\n 'Field.fromBytes: expected ' + allowedLengths + ' bytes, got ' + bytes.length\n );\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) scalar = mod(scalar, ORDER);\n if (!skipValidation)\n if (!this.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: bigint[]): bigint[] {\n return FpInvertBatch(this, lst);\n }\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: bigint, b: bigint, condition: boolean) {\n return condition ? b : a;\n }\n}\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: bigint, opts: FieldOpts = {}): Readonly<FpField> {\n return new _Field(ORDER, opts);\n}\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// },\n\nexport function FpSqrtOdd<T>(Fp: IField<T>, elm: T): T {\n if (!Fp.isOdd) throw new Error(\"Field doesn't have isOdd\");\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? root : Fp.neg(root);\n}\n\nexport function FpSqrtEven<T>(Fp: IField<T>, elm: T): T {\n if (!Fp.isOdd) 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/**\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: bigint): number {\n if (typeof fieldOrder !== 'bigint') throw new Error('field order must be bigint');\n const bitLength = fieldOrder.toString(2).length;\n return Math.ceil(bitLength / 8);\n}\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: bigint): number {\n const length = getFieldBytesLength(fieldOrder);\n return length + Math.ceil(length / 2);\n}\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.Point.Fn.ORDER)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key: Uint8Array, fieldOrder: bigint, isLE = false): Uint8Array {\n abytes(key);\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", "/**\n * Short Weierstrass curve methods. The formula is: y\u00B2 = x\u00B3 + 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.js';\nimport {\n abool,\n abytes,\n aInRange,\n bitLen,\n bitMask,\n bytesToHex,\n bytesToNumberBE,\n concatBytes,\n createHmacDrbg,\n hexToBytes,\n isBytes,\n memoized,\n numberToHexUnpadded,\n validateObject,\n randomBytes as wcRandomBytes,\n type CHash,\n type Signer,\n} from '../utils.ts';\nimport {\n createCurveFields,\n createKeygen,\n mulEndoUnsafe,\n negateCt,\n normalizeZ,\n wNAF,\n type AffinePoint,\n type CurveLengths,\n type CurvePoint,\n type CurvePointCons,\n} from './curve.ts';\nimport {\n FpInvertBatch,\n getMinHashLength,\n mapHashToField,\n validateField,\n type IField,\n} from './modular.ts';\n\nexport type { AffinePoint };\n\ntype EndoBasis = [[bigint, bigint], [bigint, bigint]];\n/**\n * When Weierstrass curve has `a=0`, it becomes Koblitz curve.\n * Koblitz curves allow using **efficiently-computable GLV endomorphism \u03C8**.\n * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n *\n * Endomorphism consists of beta, lambda and splitScalar:\n *\n * 1. GLV endomorphism \u03C8 transforms a point: `P = (x, y) \u21A6 \u03C8(P) = (\u03B2\u00B7x mod p, y)`\n * 2. GLV scalar decomposition transforms a scalar: `k \u2261 k\u2081 + k\u2082\u00B7\u03BB (mod n)`\n * 3. Then these are combined: `k\u00B7P = k\u2081\u00B7P + k\u2082\u00B7\u03C8(P)`\n * 4. Two 128-bit point-by-scalar multiplications + one point addition is faster than\n * one 256-bit multiplication.\n *\n * where\n * * beta: \u03B2 \u2208 F\u209A with \u03B2\u00B3 = 1, \u03B2 \u2260 1\n * * lambda: \u03BB \u2208 F\u2099 with \u03BB\u00B3 = 1, \u03BB \u2260 1\n * * splitScalar decomposes k \u21A6 k\u2081, k\u2082, by using reduced basis vectors.\n * Gauss lattice reduction calculates them from initial basis vectors `(n, 0), (-\u03BB, 0)`\n *\n * Check out `test/misc/endomorphism.js` and\n * [gist](https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066).\n */\nexport type EndomorphismOpts = {\n beta: bigint;\n basises?: EndoBasis;\n splitScalar?: (k: bigint) => { k1neg: boolean; k1: bigint; k2neg: boolean; k2: bigint };\n};\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: bigint, den: bigint) => (num + (num >= 0 ? den : -den) / _2n) / den;\n\nexport type ScalarEndoParts = { k1neg: boolean; k1: bigint; k2neg: boolean; k2: bigint };\n\n/**\n * Splits scalar for GLV endomorphism.\n */\nexport function _splitEndoScalar(k: bigint, basis: EndoBasis, n: bigint): ScalarEndoParts {\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) k1 = -k1;\n if (k2neg) 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}\n\n/**\n * Option to enable hedged signatures with improved security.\n *\n * * Randomly generated k is bad, because broken CSPRNG would leak private keys.\n * * Deterministic k (RFC6979) is better; but is suspectible to fault attacks.\n *\n * We allow using technique described in RFC6979 3.6: additional k', a.k.a. adding randomness\n * to deterministic sig. If CSPRNG is broken & randomness is weak, it would STILL be as secure\n * as ordinary sig without ExtraEntropy.\n *\n * * `true` means \"fetch data, from CSPRNG, incorporate it into k generation\"\n * * `false` means \"disable extra entropy, use purely deterministic k\"\n * * `Uint8Array` passed means \"incorporate following data into k generation\"\n *\n * https://paulmillr.com/posts/deterministic-signatures/\n */\nexport type ECDSAExtraEntropy = boolean | Uint8Array;\n/**\n * - `compact` is the default format\n * - `recovered` is the same as compact, but with an extra byte indicating recovery byte\n * - `der` is ASN.1 DER encoding\n */\nexport type ECDSASignatureFormat = 'compact' | 'recovered' | 'der';\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n * When a custom hash is used, it must be set to `false`.\n */\nexport type ECDSARecoverOpts = {\n prehash?: boolean;\n};\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n * When a custom hash is used, it must be set to `false`.\n * - `lowS`: (default: true) prohibits signatures which have (sig.s >= CURVE.n/2n).\n * Compatible with BTC/ETH. Setting `lowS: false` allows to create malleable signatures,\n * which is default openssl behavior.\n * Non-malleable signatures can still be successfully verified in openssl.\n * - `format`: (default: 'compact') 'compact' or 'recovered' with recovery byte\n */\nexport type ECDSAVerifyOpts = {\n prehash?: boolean;\n lowS?: boolean;\n format?: ECDSASignatureFormat;\n};\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n * When a custom hash is used, it must be set to `false`.\n * - `lowS`: (default: true) prohibits signatures which have (sig.s >= CURVE.n/2n).\n * Compatible with BTC/ETH. Setting `lowS: false` allows to create malleable signatures,\n * which is default openssl behavior.\n * Non-malleable signatures can still be successfully verified in openssl.\n * - `format`: (default: 'compact') 'compact' or 'recovered' with recovery byte\n * - `extraEntropy`: (default: false) creates sigs with increased security, see {@link ECDSAExtraEntropy}\n */\nexport type ECDSASignOpts = {\n prehash?: boolean;\n lowS?: boolean;\n format?: ECDSASignatureFormat;\n extraEntropy?: ECDSAExtraEntropy;\n};\n\nfunction validateSigFormat(format: string): ECDSASignatureFormat {\n if (!['compact', 'recovered', 'der'].includes(format))\n throw new Error('Signature format must be \"compact\", \"recovered\", or \"der\"');\n return format as ECDSASignatureFormat;\n}\n\nfunction validateSigOpts<T extends ECDSASignOpts, D extends Required<ECDSASignOpts>>(\n opts: T,\n def: D\n): Required<ECDSASignOpts> {\n const optsn: ECDSASignOpts = {};\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) validateSigFormat(optsn.format);\n return optsn as Required<ECDSASignOpts>;\n}\n\n/** Instance methods for 3D XYZ projective points. */\nexport interface WeierstrassPoint<T> extends CurvePoint<T, WeierstrassPoint<T>> {\n /** projective X coordinate. Different from affine x. */\n readonly X: T;\n /** projective Y coordinate. Different from affine y. */\n readonly Y: T;\n /** projective z coordinate */\n readonly Z: T;\n /** affine x coordinate. Different from projective X. */\n get x(): T;\n /** affine y coordinate. Different from projective Y. */\n get y(): T;\n /** Encodes point using IEEE P1363 (DER) encoding. First byte is 2/3/4. Default = isCompressed. */\n toBytes(isCompressed?: boolean): Uint8Array;\n toHex(isCompressed?: boolean): string;\n}\n\n/** Static methods for 3D XYZ projective points. */\nexport interface WeierstrassPointCons<T> extends CurvePointCons<WeierstrassPoint<T>> {\n /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n new (X: T, Y: T, Z: T): WeierstrassPoint<T>;\n CURVE(): WeierstrassOpts<T>;\n}\n\n/**\n * Weierstrass curve options.\n *\n * * p: prime characteristic (order) of finite field, in which arithmetics is done\n * * n: order of prime subgroup a.k.a total amount of valid curve points\n * * h: cofactor, usually 1. h*n is group order; n is subgroup order\n * * a: formula param, must be in field of p\n * * b: formula param, must be in field of p\n * * Gx: x coordinate of generator point a.k.a. base point\n * * Gy: y coordinate of generator point\n */\nexport type WeierstrassOpts<T> = Readonly<{\n p: bigint;\n n: bigint;\n h: bigint;\n a: T;\n b: T;\n Gx: T;\n Gy: T;\n}>;\n\n// When a cofactor != 1, there can be an effective methods to:\n// 1. Determine whether a point is torsion-free\n// 2. Clear torsion component\nexport type WeierstrassExtraOpts<T> = Partial<{\n Fp: IField<T>;\n Fn: IField<bigint>;\n allowInfinityPoint: boolean;\n endo: EndomorphismOpts;\n isTorsionFree: (c: WeierstrassPointCons<T>, point: WeierstrassPoint<T>) => boolean;\n clearCofactor: (c: WeierstrassPointCons<T>, point: WeierstrassPoint<T>) => WeierstrassPoint<T>;\n fromBytes: (bytes: Uint8Array) => AffinePoint<T>;\n toBytes: (\n c: WeierstrassPointCons<T>,\n point: WeierstrassPoint<T>,\n isCompressed: boolean\n ) => Uint8Array;\n}>;\n\n/**\n * Options for ECDSA signatures over a Weierstrass curve.\n *\n * * lowS: (default: true) whether produced / verified signatures occupy low half of ecdsaOpts.p. Prevents malleability.\n * * hmac: (default: noble-hashes hmac) function, would be used to init hmac-drbg for k generation.\n * * randomBytes: (default: webcrypto os-level CSPRNG) custom method for fetching secure randomness.\n * * bits2int, bits2int_modN: used in sigs, sometimes overridden by curves\n */\nexport type ECDSAOpts = Partial<{\n lowS: boolean;\n hmac: (key: Uint8Array, message: Uint8Array) => Uint8Array;\n randomBytes: (bytesLength?: number) => Uint8Array;\n bits2int: (bytes: Uint8Array) => bigint;\n bits2int_modN: (bytes: Uint8Array) => bigint;\n}>;\n\n/**\n * Elliptic Curve Diffie-Hellman interface.\n * Provides keygen, secret-to-public conversion, calculating shared secrets.\n */\nexport interface ECDH {\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: (secretKey: Uint8Array, isCompressed?: boolean) => Uint8Array;\n getSharedSecret: (\n secretKeyA: Uint8Array,\n publicKeyB: Uint8Array,\n isCompressed?: boolean\n ) => Uint8Array;\n Point: WeierstrassPointCons<bigint>;\n utils: {\n isValidSecretKey: (secretKey: Uint8Array) => boolean;\n isValidPublicKey: (publicKey: Uint8Array, isCompressed?: boolean) => boolean;\n randomSecretKey: (seed?: Uint8Array) => Uint8Array;\n };\n lengths: CurveLengths;\n}\n\n/**\n * ECDSA interface.\n * Only supported for prime fields, not Fp2 (extension fields).\n */\nexport interface ECDSA extends ECDH {\n sign: (message: Uint8Array, secretKey: Uint8Array, opts?: ECDSASignOpts) => Uint8Array;\n verify: (\n signature: Uint8Array,\n message: Uint8Array,\n publicKey: Uint8Array,\n opts?: ECDSAVerifyOpts\n ) => boolean;\n recoverPublicKey(signature: Uint8Array, message: Uint8Array, opts?: ECDSARecoverOpts): Uint8Array;\n Signature: ECDSASignatureCons;\n}\nexport class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n}\nexport type IDER = {\n // asn.1 DER encoding utils\n Err: typeof DERErr;\n // Basic building block is TLV (Tag-Length-Value)\n _tlv: {\n encode: (tag: number, data: string) => string;\n // v - value, l - left bytes (unparsed)\n decode(tag: number, data: Uint8Array): { v: Uint8Array; l: Uint8Array };\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: bigint): string;\n decode(data: Uint8Array): bigint;\n };\n toSig(hex: string | Uint8Array): { r: bigint; s: bigint };\n hexFromSig(sig: { r: bigint; s: bigint }): string;\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: IDER = {\n // asn.1 DER encoding utils\n Err: DERErr,\n // Basic building block is TLV (Tag-Length-Value)\n _tlv: {\n encode: (tag: number, data: string): string => {\n const { Err: E } = DER;\n if (tag < 0 || tag > 256) throw new E('tlv.encode: wrong tag');\n if (data.length & 1) throw new E('tlv.encode: unpadded data');\n const dataLen = data.length / 2;\n const len = numberToHexUnpadded(dataLen);\n if ((len.length / 2) & 0b1000_0000) 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) | 0b1000_0000) : '';\n const t = numberToHexUnpadded(tag);\n return t + lenLen + len + data;\n },\n // v - value, l - left bytes (unparsed)\n decode(tag: number, data: Uint8Array): { v: Uint8Array; l: Uint8Array } {\n const { Err: E } = DER;\n let pos = 0;\n if (tag < 0 || tag > 256) throw new E('tlv.encode: wrong tag');\n if (data.length < 2 || data[pos++] !== tag) throw new E('tlv.decode: wrong tlv');\n const first = data[pos++];\n const isLong = !!(first & 0b1000_0000); // First bit of first length byte is flag for short/long form\n let length = 0;\n if (!isLong) length = first;\n else {\n // Long form: [longFlag(1bit), lengthLength(7bit), length (BE)]\n const lenLen = first & 0b0111_1111;\n if (!lenLen) throw new E('tlv.decode(long): indefinite length not supported');\n if (lenLen > 4) 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) throw new E('tlv.decode: length bytes not complete');\n if (lengthBytes[0] === 0) throw new E('tlv.decode(long): zero leftmost byte');\n for (const b of lengthBytes) length = (length << 8) | b;\n pos += lenLen;\n if (length < 128) throw new E('tlv.decode(long): not minimal encoding');\n }\n const v = data.subarray(pos, pos + length);\n if (v.length !== length) 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: bigint): string {\n const { Err: E } = DER;\n if (num < _0n) 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) hex = '00' + hex;\n if (hex.length & 1) throw new E('unexpected DER parsing assertion: unpadded hex');\n return hex;\n },\n decode(data: Uint8Array): bigint {\n const { Err: E } = DER;\n if (data[0] & 0b1000_0000) throw new E('invalid signature integer: negative');\n if (data[0] === 0x00 && !(data[1] & 0b1000_0000))\n throw new E('invalid signature integer: unnecessary leading zero');\n return bytesToNumberBE(data);\n },\n },\n toSig(bytes: Uint8Array): { r: bigint; s: bigint } {\n // parse DER signature\n const { Err: E, _int: int, _tlv: tlv } = DER;\n const data = abytes(bytes, undefined, 'signature');\n const { v: seqBytes, l: seqLeftBytes } = tlv.decode(0x30, data);\n if (seqLeftBytes.length) 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) throw new E('invalid signature: left bytes after parsing');\n return { r: int.decode(rBytes), s: int.decode(sBytes) };\n },\n hexFromSig(sig: { r: bigint; s: bigint }): string {\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\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);\n\n/**\n * Creates weierstrass Point constructor, based on specified curve options.\n *\n * See {@link WeierstrassOpts}.\n *\n * @example\n```js\nconst opts = {\n p: 0xfffffffffffffffffffffffffffffffeffffac73n,\n n: 0x100000000000000000001b8fa16dfab9aca16b6b3n,\n h: 1n,\n a: 0n,\n b: 7n,\n Gx: 0x3b4c382ce37aa192a4019e763036f4f5dd4d7ebbn,\n Gy: 0x938cf935318fdced6bc28286531733c3f03c4feen,\n};\nconst secp160k1_Point = weierstrass(opts);\n```\n */\nexport function weierstrass<T>(\n params: WeierstrassOpts<T>,\n extraOpts: WeierstrassExtraOpts<T> = {}\n): WeierstrassPointCons<T> {\n const validated = createCurveFields('weierstrass', params, extraOpts);\n const { Fp, Fn } = validated;\n let CURVE = validated.CURVE as WeierstrassOpts<T>;\n const { h: cofactor, n: CURVE_ORDER } = CURVE;\n validateObject(\n extraOpts,\n {},\n {\n allowInfinityPoint: 'boolean',\n clearCofactor: 'function',\n isTorsionFree: 'function',\n fromBytes: 'function',\n toBytes: 'function',\n endo: 'object',\n }\n );\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\n const lengths = getWLengths(Fp, Fn);\n\n function assertCompressionIsSupported() {\n if (!Fp.isOdd) throw new Error('compression is not supported: Field does not have .isOdd()');\n }\n\n // Implements IEEE P1363 point encoding\n function pointToBytes(\n _c: WeierstrassPointCons<T>,\n point: WeierstrassPoint<T>,\n isCompressed: boolean\n ): Uint8Array {\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 } else {\n return concatBytes(Uint8Array.of(0x04), bx, Fp.toBytes(y));\n }\n }\n function pointFromBytes(bytes: Uint8Array) {\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)) throw new Error('bad point: is not on curve, wrong x');\n const y2 = weierstrassEquation(x); // y\u00B2 = x\u00B3 + ax + b\n let y: T;\n try {\n y = Fp.sqrt(y2); // y = y\u00B2 ^ (p+1)/4\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 evenY = Fp.isOdd!(y);\n const evenH = (head & 1) === 1; // ECDSA-specific\n if (evenH !== evenY) y = Fp.neg(y);\n return { x, y };\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)) throw new Error('bad point: is not on curve');\n return { x, y };\n } else {\n throw new Error(\n `bad point: got length ${length}, expected compressed=${comp} or uncompressed=${uncomp}`\n );\n }\n }\n\n const encodePoint = extraOpts.toBytes || pointToBytes;\n const decodePoint = extraOpts.fromBytes || pointFromBytes;\n function weierstrassEquation(x: T): T {\n const x2 = Fp.sqr(x); // x * x\n const x3 = Fp.mul(x2, x); // x\u00B2 * x\n return Fp.add(Fp.add(x3, Fp.mul(x, CURVE.a)), CURVE.b); // x\u00B3 + a * x + b\n }\n\n // TODO: move top-level\n /** Checks whether equation holds for given x, y: y\u00B2 == x\u00B3 + ax + b */\n function isValidXY(x: T, y: T): boolean {\n const left = Fp.sqr(y); // y\u00B2\n const right = weierstrassEquation(x); // x\u00B3 + ax + b\n return Fp.eql(left, right);\n }\n\n // Validate whether the passed curve params are valid.\n // Test 1: equation y\u00B2 = x\u00B3 + ax + b should work for generator point.\n if (!isValidXY(CURVE.Gx, CURVE.Gy)) throw new Error('bad curve params: generator point');\n\n // Test 2: discriminant \u0394 part should be non-zero: 4a\u00B3 + 27b\u00B2 != 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))) throw new Error('bad curve params: a or b');\n\n /** Asserts coordinate is valid: 0 <= n < Fp.ORDER. */\n function acoord(title: string, n: T, banZero = false) {\n if (!Fp.isValid(n) || (banZero && Fp.is0(n))) throw new Error(`bad point coordinate ${title}`);\n return n;\n }\n\n function aprjpoint(other: unknown) {\n if (!(other instanceof Point)) throw new Error('Weierstrass Point expected');\n }\n\n function splitEndoScalarN(k: bigint) {\n if (!endo || !endo.basises) throw new Error('no endo');\n return _splitEndoScalar(k, endo.basises, Fn.ORDER);\n }\n\n // Memoized toAffine / validity check. They are heavy. Points are immutable.\n\n // Converts Projective point to affine (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n // (X, Y, Z) \u220B (x=X/Z, y=Y/Z)\n const toAffineMemo = memoized((p: Point, iz?: T): AffinePoint<T> => {\n const { X, Y, Z } = p;\n // Fast-path for normalized points\n if (Fp.eql(Z, Fp.ONE)) 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) 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) return { x: Fp.ZERO, y: Fp.ZERO };\n if (!Fp.eql(zz, Fp.ONE)) 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: Point) => {\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)) 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)) throw new Error('bad point: x or y not field elements');\n if (!isValidXY(x, y)) throw new Error('bad point: equation left != right');\n if (!p.isTorsionFree()) throw new Error('bad point: not in prime-order subgroup');\n return true;\n });\n\n function finishEndo(\n endoBeta: EndomorphismOpts['beta'],\n k1p: Point,\n k2p: Point,\n k1neg: boolean,\n k2neg: boolean\n ) {\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 /**\n * Projective Point works in 3d / projective (homogeneous) coordinates:(X, Y, Z) \u220B (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 implements WeierstrassPoint<T> {\n // base / generator point\n static readonly BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n // zero / infinity / identity point\n static readonly ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO); // 0, 1, 0\n // math field\n static readonly Fp = Fp;\n // scalar field\n static readonly Fn = Fn;\n\n readonly X: T;\n readonly Y: T;\n readonly Z: T;\n\n /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n constructor(X: T, Y: T, Z: T) {\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\n static CURVE(): WeierstrassOpts<T> {\n return CURVE;\n }\n\n /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n static fromAffine(p: AffinePoint<T>): Point {\n const { x, y } = p || {};\n if (!p || !Fp.isValid(x) || !Fp.isValid(y)) throw new Error('invalid affine point');\n if (p instanceof Point) 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)) return Point.ZERO;\n return new Point(x, y, Fp.ONE);\n }\n\n static fromBytes(bytes: Uint8Array): Point {\n const P = Point.fromAffine(decodePoint(abytes(bytes, undefined, 'point')));\n P.assertValidity();\n return P;\n }\n\n static fromHex(hex: string): Point {\n return Point.fromBytes(hexToBytes(hex));\n }\n\n get x(): T {\n return this.toAffine().x;\n }\n get y(): T {\n return this.toAffine().y;\n }\n\n /**\n *\n * @param windowSize\n * @param isLazy true will defer table computation until the first multiplication\n * @returns\n */\n precompute(windowSize: number = 8, isLazy = true): Point {\n wnaf.createCache(this, windowSize);\n if (!isLazy) this.multiply(_3n); // random number\n return this;\n }\n\n // TODO: return `this`\n /** A point on curve is valid if it conforms to equation. */\n assertValidity(): void {\n assertValidMemo(this);\n }\n\n hasEvenY(): boolean {\n const { y } = this.toAffine();\n if (!Fp.isOdd) throw new Error(\"Field doesn't support isOdd\");\n return !Fp.isOdd(y);\n }\n\n /** Compare one point to another. */\n equals(other: Point): boolean {\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\n /** Flips point to one corresponding to (x, -y) in Affine coordinates. */\n negate(): Point {\n return new Point(this.X, Fp.neg(this.Y), this.Z);\n }\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\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: Point): Point {\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\n subtract(other: Point) {\n return this.add(other.negate());\n }\n\n is0(): boolean {\n return this.equals(Point.ZERO);\n }\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: bigint): Point {\n const { endo } = extraOpts;\n if (!Fn.isValidNot0(scalar)) throw new Error('invalid scalar: out of range'); // 0 is invalid\n let point: Point, fake: Point; // Fake point is used to const-time mult\n const mul = (n: bigint) => 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 } 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 /**\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: bigint): Point {\n const { endo } = extraOpts;\n const p = this as Point;\n if (!Fn.isValid(sc)) throw new Error('invalid scalar: out of range'); // 0 is valid\n if (sc === _0n || p.is0()) return Point.ZERO; // 0\n if (sc === _1n) return p; // 1\n if (wnaf.hasCache(this)) return this.multiply(sc); // precomputes\n // We don't have method for double scalar multiplication (aP + bQ):\n // Even with using Strauss-Shamir trick, it's 35% slower than na\u00EFve mul+add.\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 } else {\n return wnaf.unsafe(p, sc);\n }\n }\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?: T): AffinePoint<T> {\n return toAffineMemo(this, invertedZ);\n }\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(): boolean {\n const { isTorsionFree } = extraOpts;\n if (cofactor === _1n) return true;\n if (isTorsionFree) return isTorsionFree(Point, this);\n return wnaf.unsafe(this, CURVE_ORDER).is0();\n }\n\n clearCofactor(): Point {\n const { clearCofactor } = extraOpts;\n if (cofactor === _1n) return this; // Fast-path\n if (clearCofactor) return clearCofactor(Point, this) as Point;\n return this.multiplyUnsafe(cofactor);\n }\n\n isSmallOrder(): boolean {\n // can we use this.clearCofactor()?\n return this.multiplyUnsafe(cofactor).is0();\n }\n\n toBytes(isCompressed = true): Uint8Array {\n abool(isCompressed, 'isCompressed');\n this.assertValidity();\n return encodePoint(Point, this, isCompressed);\n }\n\n toHex(isCompressed = true): string {\n return bytesToHex(this.toBytes(isCompressed));\n }\n\n toString() {\n return `<Point ${this.is0() ? 'ZERO' : this.toHex()}>`;\n }\n }\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\n/** Methods of ECDSA signature instance. */\nexport interface ECDSASignature {\n readonly r: bigint;\n readonly s: bigint;\n readonly recovery?: number;\n addRecoveryBit(recovery: number): ECDSASignature & { readonly recovery: number };\n hasHighS(): boolean;\n recoverPublicKey(messageHash: Uint8Array): WeierstrassPoint<bigint>;\n toBytes(format?: string): Uint8Array;\n toHex(format?: string): string;\n}\n/** Methods of ECDSA signature constructor. */\nexport type ECDSASignatureCons = {\n new (r: bigint, s: bigint, recovery?: number): ECDSASignature;\n fromBytes(bytes: Uint8Array, format?: ECDSASignatureFormat): ECDSASignature;\n fromHex(hex: string, format?: ECDSASignatureFormat): ECDSASignature;\n};\n\n// Points start with byte 0x02 when y is even; otherwise 0x03\nfunction pprefix(hasEvenY: boolean): Uint8Array {\n return Uint8Array.of(hasEvenY ? 0x02 : 0x03);\n}\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<T>(\n Fp: IField<T>,\n Z: T\n): (u: T, v: T) => { isValid: boolean; value: T } {\n // Generic implementation\n const q = Fp.ORDER;\n let l = _0n;\n for (let o = q - _1n; o % _2n === _0n; o /= _2n) 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: T, v: T): { isValid: boolean; value: T } => {\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: T, v: T) => {\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<T>(\n Fp: IField<T>,\n opts: {\n A: T;\n B: T;\n Z: T;\n }\n): (u: T) => { x: T; y: T } {\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) 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: T): { x: T; y: T } => {\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}\n\nfunction getWLengths<T>(Fp: IField<T>, Fn: IField<bigint>) {\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/**\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(\n Point: WeierstrassPointCons<bigint>,\n ecdhOpts: { randomBytes?: (bytesLength?: number) => Uint8Array } = {}\n): ECDH {\n const { Fn } = Point;\n const randomBytes_ = ecdhOpts.randomBytes || wcRandomBytes;\n const lengths = Object.assign(getWLengths(Point.Fp, Fn), { seed: getMinHashLength(Fn.ORDER) });\n\n function isValidSecretKey(secretKey: Uint8Array) {\n try {\n const num = Fn.fromBytes(secretKey);\n return Fn.isValidNot0(num);\n } catch (error) {\n return false;\n }\n }\n\n function isValidPublicKey(publicKey: Uint8Array, isCompressed?: boolean): boolean {\n const { publicKey: comp, publicKeyUncompressed } = lengths;\n try {\n const l = publicKey.length;\n if (isCompressed === true && l !== comp) return false;\n if (isCompressed === false && l !== publicKeyUncompressed) return false;\n return !!Point.fromBytes(publicKey);\n } catch (error) {\n return false;\n }\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)): Uint8Array {\n return mapHashToField(abytes(seed, lengths.seed, 'seed'), Fn.ORDER);\n }\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: Uint8Array, isCompressed = true): Uint8Array {\n return Point.BASE.multiply(Fn.fromBytes(secretKey)).toBytes(isCompressed);\n }\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: Uint8Array): boolean | undefined {\n const { secretKey, publicKey, publicKeyUncompressed } = lengths;\n if (!isBytes(item)) return undefined;\n if (('_lengths' in Fn && Fn._lengths) || secretKey === publicKey) return undefined;\n const l = abytes(item, undefined, 'key').length;\n return l === publicKey || l === publicKeyUncompressed;\n }\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(\n secretKeyA: Uint8Array,\n publicKeyB: Uint8Array,\n isCompressed = true\n ): Uint8Array {\n if (isProbPub(secretKeyA) === true) throw new Error('first arg must be private key');\n if (isProbPub(publicKeyB) === false) throw new Error('second arg must be public key');\n const s = Fn.fromBytes(secretKeyA);\n const b = Point.fromBytes(publicKeyB); // checks for being on-curve\n return b.multiply(s).toBytes(isCompressed);\n }\n\n const utils = {\n isValidSecretKey,\n isValidPublicKey,\n randomSecretKey,\n };\n const keygen = createKeygen(randomSecretKey, getPublicKey);\n\n return Object.freeze({ getPublicKey, getSharedSecret, keygen, Point, utils, lengths });\n}\n\n/**\n * Creates ECDSA signing interface for given elliptic curve `Point` and `hash` function.\n *\n * @param Point created using {@link weierstrass} function\n * @param hash used for 1) message prehash-ing 2) k generation in `sign`, using hmac_drbg(hash)\n * @param ecdsaOpts rarely needed, see {@link ECDSAOpts}\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(\n Point: WeierstrassPointCons<bigint>,\n hash: CHash,\n ecdsaOpts: ECDSAOpts = {}\n): ECDSA {\n ahash(hash);\n validateObject(\n ecdsaOpts,\n {},\n {\n hmac: 'function',\n lowS: 'boolean',\n randomBytes: 'function',\n bits2int: 'function',\n bits2int_modN: 'function',\n }\n );\n ecdsaOpts = Object.assign({}, ecdsaOpts);\n const randomBytes = ecdsaOpts.randomBytes || wcRandomBytes;\n const hmac = ecdsaOpts.hmac || ((key, msg) => nobleHmac(hash, key, msg));\n\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: Required<ECDSASignOpts> = {\n prehash: true,\n lowS: typeof ecdsaOpts.lowS === 'boolean' ? ecdsaOpts.lowS : true,\n format: 'compact' as ECDSASignatureFormat,\n extraEntropy: false,\n };\n const hasLargeCofactor = CURVE_ORDER * _2n < Fp.ORDER; // Won't CURVE().h > 2n be more effective?\n\n function isBiggerThanHalfOrder(number: bigint) {\n const HALF = CURVE_ORDER >> _1n;\n return number > HALF;\n }\n function validateRS(title: string, num: bigint): bigint {\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 assertSmallCofactor(): void {\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 if (hasLargeCofactor)\n throw new Error('\"recovered\" sig type is not supported for cofactor >2 curves');\n }\n function validateSigLength(bytes: Uint8Array, format: ECDSASignatureFormat) {\n validateSigFormat(format);\n const size = lengths.signature!;\n const sizer = format === 'compact' ? size : format === 'recovered' ? size + 1 : undefined;\n return abytes(bytes, sizer);\n }\n\n /**\n * ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.\n */\n class Signature implements ECDSASignature {\n readonly r: bigint;\n readonly s: bigint;\n readonly recovery?: number;\n\n constructor(r: bigint, s: bigint, recovery?: number) {\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 assertSmallCofactor();\n if (![0, 1, 2, 3].includes(recovery)) throw new Error('invalid recovery id');\n this.recovery = recovery;\n }\n Object.freeze(this);\n }\n\n static fromBytes(\n bytes: Uint8Array,\n format: ECDSASignatureFormat = defaultSigOpts.format\n ): Signature {\n validateSigLength(bytes, format);\n let recid: number | undefined;\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 = lengths.signature! / 2;\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\n static fromHex(hex: string, format?: ECDSASignatureFormat) {\n return this.fromBytes(hexToBytes(hex), format);\n }\n\n private assertRecovery(): number {\n const { recovery } = this;\n if (recovery == null) throw new Error('invalid recovery id: must be present');\n return recovery;\n }\n\n addRecoveryBit(recovery: number): RecoveredSignature {\n return new Signature(this.r, this.s, recovery) as RecoveredSignature;\n }\n\n recoverPublicKey(messageHash: Uint8Array): WeierstrassPoint<bigint> {\n const { r, s } = this;\n const recovery = this.assertRecovery();\n const radj = recovery === 2 || recovery === 3 ? r + CURVE_ORDER : r;\n if (!Fp.isValid(radj)) throw new Error('invalid recovery id: sig.r+curve.n != R.x');\n const x = Fp.toBytes(radj);\n const R = Point.fromBytes(concatBytes(pprefix((recovery & 1) === 0), x));\n const ir = Fn.inv(radj); // r^-1\n const h = bits2int_modN(abytes(messageHash, undefined, 'msgHash')); // 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()) throw new Error('invalid recovery: point at infinify');\n Q.assertValidity();\n return Q;\n }\n\n // Signatures should be low-s, to prevent malleability.\n hasHighS(): boolean {\n return isBiggerThanHalfOrder(this.s);\n }\n\n toBytes(format: ECDSASignatureFormat = defaultSigOpts.format) {\n validateSigFormat(format);\n if (format === 'der') return hexToBytes(DER.hexFromSig(this));\n const { r, s } = this;\n const rb = Fn.toBytes(r);\n const sb = Fn.toBytes(s);\n if (format === 'recovered') {\n assertSmallCofactor();\n return concatBytes(Uint8Array.of(this.assertRecovery()), rb, sb);\n }\n return concatBytes(rb, sb);\n }\n\n toHex(format?: ECDSASignatureFormat) {\n return bytesToHex(this.toBytes(format));\n }\n }\n type RecoveredSignature = Signature & { recovery: number };\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 =\n ecdsaOpts.bits2int ||\n function bits2int_def(bytes: Uint8Array): bigint {\n // Our custom check \"just in case\", for protection against DoS\n if (bytes.length > 8192) 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 =\n ecdsaOpts.bits2int_modN ||\n function bits2int_modN_def(bytes: Uint8Array): bigint {\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: bigint): Uint8Array {\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\n function validateMsgAndHash(message: Uint8Array, prehash: boolean) {\n abytes(message, undefined, 'message');\n return prehash ? abytes(hash(message), undefined, 'prehashed message') : message;\n }\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: Uint8Array, secretKey: Uint8Array, opts: ECDSASignOpts) {\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 = Fn.fromBytes(secretKey); // validate secret key, convert to bigint\n if (!Fn.isValidNot0(d)) throw new Error('invalid private key');\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(abytes(e, undefined, 'extraEntropy')); // check for being bytes\n }\n const seed = concatBytes(...seedArgs); // Step D of RFC6979 3.2\n const m = h1int; // 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\u22C5G\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 \u2208 [1,q\u22121] 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: Uint8Array): Signature | undefined {\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); // Cannot use fields methods, since it is group element\n if (!Fn.isValidNot0(k)) 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\u22C5G\n const r = Fn.create(q.x); // r = q.x mod n\n if (r === _0n) return;\n const s = Fn.create(ik * Fn.create(m + r * d)); // s = k^-1(m + rd) mod n\n if (s === _0n) 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 in the bottom half of N\n recovery ^= 1;\n }\n return new Signature(r, normS, hasLargeCofactor ? undefined : recovery);\n }\n return { seed, k2sig };\n }\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 \u00D7 k\n * r = x mod n\n * s = (m + dr) / k mod n\n * ```\n */\n function sign(message: Uint8Array, secretKey: Uint8Array, opts: ECDSASignOpts = {}): Uint8Array {\n const { seed, k2sig } = prepSig(message, secretKey, opts); // Steps A, D of RFC6979 3.2.\n const drbg = createHmacDrbg<Signature>(hash.outputLen, Fn.BYTES, hmac);\n const sig = drbg(seed, k2sig); // Steps B, C, D, E, F, G\n return sig.toBytes(opts.format);\n }\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\u22C5G + u2\u22C5P\n * mod(R.x, n) == r\n * ```\n */\n function verify(\n signature: Uint8Array,\n message: Uint8Array,\n publicKey: Uint8Array,\n opts: ECDSAVerifyOpts = {}\n ): boolean {\n const { lowS, prehash, format } = validateSigOpts(opts, defaultSigOpts);\n publicKey = abytes(publicKey, undefined, 'publicKey');\n message = validateMsgAndHash(message, prehash);\n if (!isBytes(signature as any)) {\n const end = signature instanceof Signature ? ', use sig.toBytes()' : '';\n throw new Error('verify expects Uint8Array signature' + end);\n }\n validateSigLength(signature, format); // execute this twice because we want loud error\n try {\n const sig = Signature.fromBytes(signature, format);\n const P = Point.fromBytes(publicKey);\n if (lowS && sig.hasHighS()) 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\u22C5G + u2\u22C5P\n if (R.is0()) return false;\n const v = Fn.create(R.x); // v = r.x mod n\n return v === r;\n } catch (e) {\n return false;\n }\n }\n\n function recoverPublicKey(\n signature: Uint8Array,\n message: Uint8Array,\n opts: ECDSARecoverOpts = {}\n ): Uint8Array {\n const { prehash } = validateSigOpts(opts, defaultSigOpts);\n message = validateMsgAndHash(message, prehash);\n return Signature.fromBytes(signature, 'recovered').recoverPublicKey(message).toBytes();\n }\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 }) satisfies Signer;\n}\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, type CHash, type Hash } from './utils.ts';\n\n/** Internal class for HMAC. */\nexport class _HMAC<T extends Hash<T>> implements Hash<_HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, key: Uint8Array) {\n ahash(hash);\n abytes(key, undefined, 'key');\n this.iHash = hash.create() as T;\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++) 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() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n clean(pad);\n }\n update(buf: Uint8Array): this {\n aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array): void {\n aexists(this);\n abytes(out, this.outputLen, 'output');\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(): Uint8Array {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: _HMAC<T>): _HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\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(): _HMAC<T> {\n return this._cloneInto();\n }\n destroy(): void {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\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: {\n (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array;\n create(hash: CHash, key: Uint8Array): _HMAC<any>;\n} = (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array =>\n new _HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Uint8Array) => new _HMAC<any>(hash, key);\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, type CHash, type Hash } from './utils.ts';\n\n/** Internal class for HMAC. */\nexport class _HMAC<T extends Hash<T>> implements Hash<_HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, key: Uint8Array) {\n ahash(hash);\n abytes(key, undefined, 'key');\n this.iHash = hash.create() as T;\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++) 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() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n clean(pad);\n }\n update(buf: Uint8Array): this {\n aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array): void {\n aexists(this);\n abytes(out, this.outputLen, 'output');\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(): Uint8Array {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: _HMAC<T>): _HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\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(): _HMAC<T> {\n return this._cloneInto();\n }\n destroy(): void {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\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: {\n (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array;\n create(hash: CHash, key: Uint8Array): _HMAC<any>;\n} = (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array =>\n new _HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Uint8Array) => new _HMAC<any>(hash, key);\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\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\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\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: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\n\nSHA1 (RFC 3174), MD5 (RFC 1321) and RIPEMD160 (RFC 2286) legacy, weak hash functions.\nDon't use them in a new protocol. What \"weak\" means:\n\n- Collisions can be made with 2^18 effort in MD5, 2^60 in SHA1, 2^80 in RIPEMD160.\n- No practical pre-image attacks (only theoretical, 2^123.4)\n- HMAC seems kinda ok: https://www.rfc-editor.org/rfc/rfc6151\n * @module\n */\nimport { Chi, HashMD, Maj } from './_md.ts';\nimport { type CHash, clean, createHasher, rotl } from './utils.ts';\n\n/** Initial SHA1 state */\nconst SHA1_IV = /* @__PURE__ */ Uint32Array.from([\n 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n\n// Reusable temporary buffer\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal SHA1 legacy hash class. */\nexport class _SHA1 extends HashMD<_SHA1> {\n private A = SHA1_IV[0] | 0;\n private B = SHA1_IV[1] | 0;\n private C = SHA1_IV[2] | 0;\n private D = SHA1_IV[3] | 0;\n private E = SHA1_IV[4] | 0;\n\n constructor() {\n super(64, 20, 8, false);\n }\n protected get(): [number, number, number, number, number] {\n const { A, B, C, D, E } = this;\n return [A, B, C, D, E];\n }\n protected set(A: number, B: number, C: number, D: number, E: number): void {\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 }\n protected process(view: DataView, offset: number): void {\n for (let i = 0; i < 16; i++, offset += 4) SHA1_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 80; i++)\n SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);\n // Compression function main loop, 80 rounds\n let { A, B, C, D, E } = this;\n for (let i = 0; i < 80; i++) {\n let F, K;\n if (i < 20) {\n F = Chi(B, C, D);\n K = 0x5a827999;\n } else if (i < 40) {\n F = B ^ C ^ D;\n K = 0x6ed9eba1;\n } else if (i < 60) {\n F = Maj(B, C, D);\n K = 0x8f1bbcdc;\n } else {\n F = B ^ C ^ D;\n K = 0xca62c1d6;\n }\n const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;\n E = D;\n D = C;\n C = rotl(B, 30);\n B = A;\n A = T;\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 this.set(A, B, C, D, E);\n }\n protected roundClean(): void {\n clean(SHA1_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** SHA1 (RFC 3174) legacy hash function. It was cryptographically broken. */\nexport const sha1: CHash = /* @__PURE__ */ createHasher(() => new _SHA1());\n\n/** Per-round constants */\nconst p32 = /* @__PURE__ */ Math.pow(2, 32);\nconst K = /* @__PURE__ */ Array.from({ length: 64 }, (_, i) =>\n Math.floor(p32 * Math.abs(Math.sin(i + 1)))\n);\n\n/** md5 initial state: same as sha1, but 4 u32 instead of 5. */\nconst MD5_IV = /* @__PURE__ */ SHA1_IV.slice(0, 4);\n\n// Reusable temporary buffer\nconst MD5_W = /* @__PURE__ */ new Uint32Array(16);\n/** Internal MD5 legacy hash class. */\nexport class _MD5 extends HashMD<_MD5> {\n private A = MD5_IV[0] | 0;\n private B = MD5_IV[1] | 0;\n private C = MD5_IV[2] | 0;\n private D = MD5_IV[3] | 0;\n\n constructor() {\n super(64, 16, 8, true);\n }\n protected get(): [number, number, number, number] {\n const { A, B, C, D } = this;\n return [A, B, C, D];\n }\n protected set(A: number, B: number, C: number, D: number): void {\n this.A = A | 0;\n this.B = B | 0;\n this.C = C | 0;\n this.D = D | 0;\n }\n protected process(view: DataView, offset: number): void {\n for (let i = 0; i < 16; i++, offset += 4) MD5_W[i] = view.getUint32(offset, true);\n // Compression function main loop, 64 rounds\n let { A, B, C, D } = this;\n for (let i = 0; i < 64; i++) {\n let F, g, s;\n if (i < 16) {\n F = Chi(B, C, D);\n g = i;\n s = [7, 12, 17, 22];\n } else if (i < 32) {\n F = Chi(D, B, C);\n g = (5 * i + 1) % 16;\n s = [5, 9, 14, 20];\n } else if (i < 48) {\n F = B ^ C ^ D;\n g = (3 * i + 5) % 16;\n s = [4, 11, 16, 23];\n } else {\n F = C ^ (B | ~D);\n g = (7 * i) % 16;\n s = [6, 10, 15, 21];\n }\n F = F + A + K[i] + MD5_W[g];\n A = D;\n D = C;\n C = B;\n B = B + rotl(F, s[i % 4]);\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 this.set(A, B, C, D);\n }\n protected roundClean(): void {\n clean(MD5_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/**\n * MD5 (RFC 1321) legacy hash function. It was cryptographically broken.\n * MD5 architecture is similar to SHA1, with some differences:\n * - Reduced output length: 16 bytes (128 bit) instead of 20\n * - 64 rounds, instead of 80\n * - Little-endian: could be faster, but will require more code\n * - Non-linear index selection: huge speed-up for unroll\n * - Per round constants: more memory accesses, additional speed-up for unroll\n */\nexport const md5: CHash = /* @__PURE__ */ createHasher(() => new _MD5());\n\n// RIPEMD-160\n\nconst Rho160 = /* @__PURE__ */ Uint8Array.from([\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n]);\nconst Id160 = /* @__PURE__ */ (() => Uint8Array.from(new Array(16).fill(0).map((_, i) => i)))();\nconst Pi160 = /* @__PURE__ */ (() => Id160.map((i) => (9 * i + 5) % 16))();\nconst idxLR = /* @__PURE__ */ (() => {\n const L = [Id160];\n const R = [Pi160];\n const res = [L, R];\n for (let i = 0; i < 4; i++) for (let j of res) j.push(j[i].map((k) => Rho160[k]));\n return res;\n})();\nconst idxL = /* @__PURE__ */ (() => idxLR[0])();\nconst idxR = /* @__PURE__ */ (() => idxLR[1])();\n// const [idxL, idxR] = idxLR;\n\nconst shifts160 = /* @__PURE__ */ [\n [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => Uint8Array.from(i));\nconst shiftsL160 = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts160[i][j]));\nconst shiftsR160 = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts160[i][j]));\nconst Kl160 = /* @__PURE__ */ Uint32Array.from([\n 0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr160 = /* @__PURE__ */ Uint32Array.from([\n 0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// It's called f() in spec.\nfunction ripemd_f(group: number, x: number, y: number, z: number): number {\n if (group === 0) return x ^ y ^ z;\n if (group === 1) return (x & y) | (~x & z);\n if (group === 2) return (x | ~y) ^ z;\n if (group === 3) return (x & z) | (y & ~z);\n return x ^ (y | ~z);\n}\n// Reusable temporary buffer\nconst BUF_160 = /* @__PURE__ */ new Uint32Array(16);\nexport class _RIPEMD160 extends HashMD<_RIPEMD160> {\n private h0 = 0x67452301 | 0;\n private h1 = 0xefcdab89 | 0;\n private h2 = 0x98badcfe | 0;\n private h3 = 0x10325476 | 0;\n private h4 = 0xc3d2e1f0 | 0;\n\n constructor() {\n super(64, 20, 8, true);\n }\n protected get(): [number, number, number, number, number] {\n const { h0, h1, h2, h3, h4 } = this;\n return [h0, h1, h2, h3, h4];\n }\n protected set(h0: number, h1: number, h2: number, h3: number, h4: number): void {\n this.h0 = h0 | 0;\n this.h1 = h1 | 0;\n this.h2 = h2 | 0;\n this.h3 = h3 | 0;\n this.h4 = h4 | 0;\n }\n protected process(view: DataView, offset: number): void {\n for (let i = 0; i < 16; i++, offset += 4) BUF_160[i] = view.getUint32(offset, true);\n // prettier-ignore\n let al = this.h0 | 0, ar = al,\n bl = this.h1 | 0, br = bl,\n cl = this.h2 | 0, cr = cl,\n dl = this.h3 | 0, dr = dl,\n el = this.h4 | 0, er = el;\n\n // Instead of iterating 0 to 80, we split it into 5 groups\n // And use the groups in constants, functions, etc. Much simpler\n for (let group = 0; group < 5; group++) {\n const rGroup = 4 - group;\n const hbl = Kl160[group], hbr = Kr160[group]; // prettier-ignore\n const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n const sl = shiftsL160[group], sr = shiftsR160[group]; // prettier-ignore\n for (let i = 0; i < 16; i++) {\n const tl = (rotl(al + ripemd_f(group, bl, cl, dl) + BUF_160[rl[i]] + hbl, sl[i]) + el) | 0;\n al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n }\n // 2 loops are 10% faster\n for (let i = 0; i < 16; i++) {\n const tr = (rotl(ar + ripemd_f(rGroup, br, cr, dr) + BUF_160[rr[i]] + hbr, sr[i]) + er) | 0;\n ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n }\n }\n // Add the compressed chunk to the current hash value\n this.set(\n (this.h1 + cl + dr) | 0,\n (this.h2 + dl + er) | 0,\n (this.h3 + el + ar) | 0,\n (this.h4 + al + br) | 0,\n (this.h0 + bl + cr) | 0\n );\n }\n protected roundClean(): void {\n clean(BUF_160);\n }\n destroy(): void {\n this.destroyed = true;\n clean(this.buffer);\n this.set(0, 0, 0, 0, 0);\n }\n}\n\n/**\n * RIPEMD-160 - a legacy hash function from 1990s.\n * * https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n * * https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\n */\nexport const ripemd160: CHash = /* @__PURE__ */ createHasher(() => new _RIPEMD160());\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\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: Uint8Array): this {\n aexists(this);\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) 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: Uint8Array): void {\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++) 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 view.setBigUint64(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 must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\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://www.rfc-editor.org/rfc/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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal 32-byte base SHA2 hash class. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n constructor() {\n super(32);\n }\n}\n\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal 64-byte base SHA2 hash class. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\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 protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor() {\n super(64);\n }\n}\n\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n */\nexport const sha256: CHash<_SHA256> = /* @__PURE__ */ createHasher(\n () => new _SHA256(),\n /* @__PURE__ */ oidNist(0x01)\n);\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash<_SHA224> = /* @__PURE__ */ createHasher(\n () => new _SHA224(),\n /* @__PURE__ */ oidNist(0x04)\n);\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash<_SHA512> = /* @__PURE__ */ createHasher(\n () => new _SHA512(),\n /* @__PURE__ */ oidNist(0x03)\n);\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash<_SHA384> = /* @__PURE__ */ createHasher(\n () => new _SHA384(),\n /* @__PURE__ */ oidNist(0x02)\n);\n\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: CHash<_SHA512_256> = /* @__PURE__ */ createHasher(\n () => new _SHA512_256(),\n /* @__PURE__ */ oidNist(0x06)\n);\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: CHash<_SHA512_224> = /* @__PURE__ */ createHasher(\n () => new _SHA512_224(),\n /* @__PURE__ */ oidNist(0x05)\n);\n", "/**\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);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) 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}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\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}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\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(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\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: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\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", "/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\nexport interface Coder<F, T> {\n encode(from: F): T;\n decode(to: T): F;\n}\n\nexport interface BytesCoder extends Coder<Uint8Array, string> {\n encode: (data: Uint8Array) => string;\n decode: (str: string) => Uint8Array;\n}\n\nfunction isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is Uint8Array. */\nfunction abytes(b: Uint8Array | undefined): void {\n if (!isBytes(b)) throw new Error('Uint8Array expected');\n}\n\nfunction isArrayOf(isString: boolean, arr: any[]) {\n if (!Array.isArray(arr)) return false;\n if (arr.length === 0) return true;\n if (isString) {\n return arr.every((item) => typeof item === 'string');\n } else {\n return arr.every((item) => Number.isSafeInteger(item));\n }\n}\n\nfunction afn(input: Function): input is Function {\n if (typeof input !== 'function') throw new Error('function expected');\n return true;\n}\n\nfunction astr(label: string, input: unknown): input is string {\n if (typeof input !== 'string') throw new Error(`${label}: string expected`);\n return true;\n}\n\nfunction anumber(n: number): void {\n if (!Number.isSafeInteger(n)) throw new Error(`invalid integer: ${n}`);\n}\n\nfunction aArr(input: any[]) {\n if (!Array.isArray(input)) throw new Error('array expected');\n}\nfunction astrArr(label: string, input: string[]) {\n if (!isArrayOf(true, input)) throw new Error(`${label}: array of strings expected`);\n}\nfunction anumArr(label: string, input: number[]) {\n if (!isArrayOf(false, input)) throw new Error(`${label}: array of numbers expected`);\n}\n\n// TODO: some recusive type inference so it would check correct order of input/output inside rest?\n// like <string, number>, <number, bytes>, <bytes, float>\ntype Chain = [Coder<any, any>, ...Coder<any, any>[]];\n// Extract info from Coder type\ntype Input<F> = F extends Coder<infer T, any> ? T : never;\ntype Output<F> = F extends Coder<any, infer T> ? T : never;\n// Generic function for arrays\ntype First<T> = T extends [infer U, ...any[]] ? U : never;\ntype Last<T> = T extends [...any[], infer U] ? U : never;\ntype Tail<T> = T extends [any, ...infer U] ? U : never;\n\ntype AsChain<C extends Chain, Rest = Tail<C>> = {\n // C[K] = Coder<Input<C[K]>, Input<Rest[k]>>\n [K in keyof C]: Coder<Input<C[K]>, Input<K extends keyof Rest ? Rest[K] : any>>;\n};\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction chain<T extends Chain & AsChain<T>>(...args: T): Coder<Input<First<T>>, Output<Last<T>>> {\n const id = (a: any) => a;\n // Wrap call in closure so JIT can inline calls\n const wrap = (a: any, b: any) => (c: any) => a(b(c));\n // Construct chain of args[-1].encode(args[-2].encode([...]))\n const encode = args.map((x) => x.encode).reduceRight(wrap, id);\n // Construct chain of args[0].decode(args[1].decode(...))\n const decode = args.map((x) => x.decode).reduce(wrap, id);\n return { encode, decode };\n}\n\n/**\n * Encodes integer radix representation to array of strings using alphabet and back.\n * Could also be array of strings.\n * @__NO_SIDE_EFFECTS__\n */\nfunction alphabet(letters: string | string[]): Coder<number[], string[]> {\n // mapping 1 to \"b\"\n const lettersA = typeof letters === 'string' ? letters.split('') : letters;\n const len = lettersA.length;\n astrArr('alphabet', lettersA);\n\n // mapping \"b\" to 1\n const indexes = new Map(lettersA.map((l, i) => [l, i]));\n return {\n encode: (digits: number[]) => {\n aArr(digits);\n return digits.map((i) => {\n if (!Number.isSafeInteger(i) || i < 0 || i >= len)\n throw new Error(\n `alphabet.encode: digit index outside alphabet \"${i}\". Allowed: ${letters}`\n );\n return lettersA[i]!;\n });\n },\n decode: (input: string[]): number[] => {\n aArr(input);\n return input.map((letter) => {\n astr('alphabet.decode', letter);\n const i = indexes.get(letter);\n if (i === undefined) throw new Error(`Unknown letter: \"${letter}\". Allowed: ${letters}`);\n return i;\n });\n },\n };\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction join(separator = ''): Coder<string[], string> {\n astr('join', separator);\n return {\n encode: (from) => {\n astrArr('join.decode', from);\n return from.join(separator);\n },\n decode: (to) => {\n astr('join.decode', to);\n return to.split(separator);\n },\n };\n}\n\n/**\n * Pad strings array so it has integer number of bits\n * @__NO_SIDE_EFFECTS__\n */\nfunction padding(bits: number, chr = '='): Coder<string[], string[]> {\n anumber(bits);\n astr('padding', chr);\n return {\n encode(data: string[]): string[] {\n astrArr('padding.encode', data);\n while ((data.length * bits) % 8) data.push(chr);\n return data;\n },\n decode(input: string[]): string[] {\n astrArr('padding.decode', input);\n let end = input.length;\n if ((end * bits) % 8)\n throw new Error('padding: invalid, string should have whole number of bytes');\n for (; end > 0 && input[end - 1] === chr; end--) {\n const last = end - 1;\n const byte = last * bits;\n if (byte % 8 === 0) throw new Error('padding: invalid, string has too much padding');\n }\n return input.slice(0, end);\n },\n };\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction normalize<T>(fn: (val: T) => T): Coder<T, T> {\n afn(fn);\n return { encode: (from: T) => from, decode: (to: T) => fn(to) };\n}\n\n/**\n * Slow: O(n^2) time complexity\n */\nfunction convertRadix(data: number[], from: number, to: number): number[] {\n // base 1 is impossible\n if (from < 2) throw new Error(`convertRadix: invalid from=${from}, base cannot be less than 2`);\n if (to < 2) throw new Error(`convertRadix: invalid to=${to}, base cannot be less than 2`);\n aArr(data);\n if (!data.length) return [];\n let pos = 0;\n const res = [];\n const digits = Array.from(data, (d) => {\n anumber(d);\n if (d < 0 || d >= from) throw new Error(`invalid integer: ${d}`);\n return d;\n });\n const dlen = digits.length;\n while (true) {\n let carry = 0;\n let done = true;\n for (let i = pos; i < dlen; i++) {\n const digit = digits[i]!;\n const fromCarry = from * carry;\n const digitBase = fromCarry + digit;\n if (\n !Number.isSafeInteger(digitBase) ||\n fromCarry / from !== carry ||\n digitBase - digit !== fromCarry\n ) {\n throw new Error('convertRadix: carry overflow');\n }\n const div = digitBase / to;\n carry = digitBase % to;\n const rounded = Math.floor(div);\n digits[i] = rounded;\n if (!Number.isSafeInteger(rounded) || rounded * to + carry !== digitBase)\n throw new Error('convertRadix: carry overflow');\n if (!done) continue;\n else if (!rounded) pos = i;\n else done = false;\n }\n res.push(carry);\n if (done) break;\n }\n for (let i = 0; i < data.length - 1 && data[i] === 0; i++) res.push(0);\n return res.reverse();\n}\n\nconst gcd = (a: number, b: number): number => (b === 0 ? a : gcd(b, a % b));\nconst radix2carry = /* @__NO_SIDE_EFFECTS__ */ (from: number, to: number) =>\n from + (to - gcd(from, to));\nconst powers: number[] = /* @__PURE__ */ (() => {\n let res = [];\n for (let i = 0; i < 40; i++) res.push(2 ** i);\n return res;\n})();\n/**\n * Implemented with numbers, because BigInt is 5x slower\n */\nfunction convertRadix2(data: number[], from: number, to: number, padding: boolean): number[] {\n aArr(data);\n if (from <= 0 || from > 32) throw new Error(`convertRadix2: wrong from=${from}`);\n if (to <= 0 || to > 32) throw new Error(`convertRadix2: wrong to=${to}`);\n if (radix2carry(from, to) > 32) {\n throw new Error(\n `convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`\n );\n }\n let carry = 0;\n let pos = 0; // bitwise position in current element\n const max = powers[from]!;\n const mask = powers[to]! - 1;\n const res: number[] = [];\n for (const n of data) {\n anumber(n);\n if (n >= max) throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n carry = (carry << from) | n;\n if (pos + from > 32) throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n pos += from;\n for (; pos >= to; pos -= to) res.push(((carry >> (pos - to)) & mask) >>> 0);\n const pow = powers[pos];\n if (pow === undefined) throw new Error('invalid carry');\n carry &= pow - 1; // clean carry, otherwise it will cause overflow\n }\n carry = (carry << (to - pos)) & mask;\n if (!padding && pos >= from) throw new Error('Excess padding');\n if (!padding && carry > 0) throw new Error(`Non-zero padding: ${carry}`);\n if (padding && pos > 0) res.push(carry >>> 0);\n return res;\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix(num: number): Coder<Uint8Array, number[]> {\n anumber(num);\n const _256 = 2 ** 8;\n return {\n encode: (bytes: Uint8Array) => {\n if (!isBytes(bytes)) throw new Error('radix.encode input should be Uint8Array');\n return convertRadix(Array.from(bytes), _256, num);\n },\n decode: (digits: number[]) => {\n anumArr('radix.decode', digits);\n return Uint8Array.from(convertRadix(digits, num, _256));\n },\n };\n}\n\n/**\n * If both bases are power of same number (like `2**8 <-> 2**64`),\n * there is a linear algorithm. For now we have implementation for power-of-two bases only.\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix2(bits: number, revPadding = false): Coder<Uint8Array, number[]> {\n anumber(bits);\n if (bits <= 0 || bits > 32) throw new Error('radix2: bits should be in (0..32]');\n if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)\n throw new Error('radix2: carry overflow');\n return {\n encode: (bytes: Uint8Array) => {\n if (!isBytes(bytes)) throw new Error('radix2.encode input should be Uint8Array');\n return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n },\n decode: (digits: number[]) => {\n anumArr('radix2.decode', digits);\n return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n },\n };\n}\n\ntype ArgumentTypes<F extends Function> = F extends (...args: infer A) => any ? A : never;\nfunction unsafeWrapper<T extends (...args: any) => any>(fn: T) {\n afn(fn);\n return function (...args: ArgumentTypes<T>): ReturnType<T> | void {\n try {\n return fn.apply(null, args);\n } catch (e) {}\n };\n}\n\nfunction checksum(\n len: number,\n fn: (data: Uint8Array) => Uint8Array\n): Coder<Uint8Array, Uint8Array> {\n anumber(len);\n afn(fn);\n return {\n encode(data: Uint8Array) {\n if (!isBytes(data)) throw new Error('checksum.encode: input should be Uint8Array');\n const sum = fn(data).slice(0, len);\n const res = new Uint8Array(data.length + len);\n res.set(data);\n res.set(sum, data.length);\n return res;\n },\n decode(data: Uint8Array) {\n if (!isBytes(data)) throw new Error('checksum.decode: input should be Uint8Array');\n const payload = data.slice(0, -len);\n const oldChecksum = data.slice(-len);\n const newChecksum = fn(payload).slice(0, len);\n for (let i = 0; i < len; i++)\n if (newChecksum[i] !== oldChecksum[i]) throw new Error('Invalid checksum');\n return payload;\n },\n };\n}\n\n// prettier-ignore\nexport const utils: { alphabet: typeof alphabet; chain: typeof chain; checksum: typeof checksum; convertRadix: typeof convertRadix; convertRadix2: typeof convertRadix2; radix: typeof radix; radix2: typeof radix2; join: typeof join; padding: typeof padding; } = {\n alphabet, chain, checksum, convertRadix, convertRadix2, radix, radix2, join, padding,\n};\n\n// RFC 4648 aka RFC 3548\n// ---------------------\n\n/**\n * base16 encoding from RFC 4648.\n * @example\n * ```js\n * base16.encode(Uint8Array.from([0x12, 0xab]));\n * // => '12AB'\n * ```\n */\nexport const base16: BytesCoder = chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\n\n/**\n * base32 encoding from RFC 4648. Has padding.\n * Use `base32nopad` for unpadded version.\n * Also check out `base32hex`, `base32hexnopad`, `base32crockford`.\n * @example\n * ```js\n * base32.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'CKVQ===='\n * base32.decode('CKVQ====');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32: BytesCoder = chain(\n radix2(5),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'),\n padding(5),\n join('')\n);\n\n/**\n * base32 encoding from RFC 4648. No padding.\n * Use `base32` for padded version.\n * Also check out `base32hex`, `base32hexnopad`, `base32crockford`.\n * @example\n * ```js\n * base32nopad.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'CKVQ'\n * base32nopad.decode('CKVQ');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32nopad: BytesCoder = chain(\n radix2(5),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'),\n join('')\n);\n/**\n * base32 encoding from RFC 4648. Padded. Compared to ordinary `base32`, slightly different alphabet.\n * Use `base32hexnopad` for unpadded version.\n * @example\n * ```js\n * base32hex.encode(Uint8Array.from([0x12, 0xab]));\n * // => '2ALG===='\n * base32hex.decode('2ALG====');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32hex: BytesCoder = chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'),\n padding(5),\n join('')\n);\n\n/**\n * base32 encoding from RFC 4648. No padding. Compared to ordinary `base32`, slightly different alphabet.\n * Use `base32hex` for padded version.\n * @example\n * ```js\n * base32hexnopad.encode(Uint8Array.from([0x12, 0xab]));\n * // => '2ALG'\n * base32hexnopad.decode('2ALG');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32hexnopad: BytesCoder = chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'),\n join('')\n);\n/**\n * base32 encoding from RFC 4648. Doug Crockford's version.\n * https://www.crockford.com/base32.html\n * @example\n * ```js\n * base32crockford.encode(Uint8Array.from([0x12, 0xab]));\n * // => '2ANG'\n * base32crockford.decode('2ANG');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32crockford: BytesCoder = chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'),\n join(''),\n normalize((s: string) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1'))\n);\n\n// Built-in base64 conversion https://caniuse.com/mdn-javascript_builtins_uint8array_frombase64\n// prettier-ignore\nconst hasBase64Builtin: boolean = /* @__PURE__ */ (() =>\n typeof (Uint8Array as any).from([]).toBase64 === 'function' &&\n typeof (Uint8Array as any).fromBase64 === 'function')();\n\nconst decodeBase64Builtin = (s: string, isUrl: boolean) => {\n astr('base64', s);\n const re = isUrl ? /^[A-Za-z0-9=_-]+$/ : /^[A-Za-z0-9=+/]+$/;\n const alphabet = isUrl ? 'base64url' : 'base64';\n if (s.length > 0 && !re.test(s)) throw new Error('invalid base64');\n return (Uint8Array as any).fromBase64(s, { alphabet, lastChunkHandling: 'strict' });\n};\n\n/**\n * base64 from RFC 4648. Padded.\n * Use `base64nopad` for unpadded version.\n * Also check out `base64url`, `base64urlnopad`.\n * Falls back to built-in function, when available.\n * @example\n * ```js\n * base64.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'Eqs='\n * base64.decode('Eqs=');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\n// prettier-ignore\nexport const base64: BytesCoder = hasBase64Builtin ? {\n encode(b) { abytes(b); return (b as any).toBase64(); },\n decode(s) { return decodeBase64Builtin(s, false); },\n} : chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'),\n padding(6),\n join('')\n);\n/**\n * base64 from RFC 4648. No padding.\n * Use `base64` for padded version.\n * @example\n * ```js\n * base64nopad.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'Eqs'\n * base64nopad.decode('Eqs');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base64nopad: BytesCoder = chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'),\n join('')\n);\n\n/**\n * base64 from RFC 4648, using URL-safe alphabet. Padded.\n * Use `base64urlnopad` for unpadded version.\n * Falls back to built-in function, when available.\n * @example\n * ```js\n * base64url.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'Eqs='\n * base64url.decode('Eqs=');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\n// prettier-ignore\nexport const base64url: BytesCoder = hasBase64Builtin ? {\n encode(b) { abytes(b); return (b as any).toBase64({ alphabet: 'base64url' }); },\n decode(s) { return decodeBase64Builtin(s, true); },\n} : chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'),\n padding(6),\n join('')\n);\n\n/**\n * base64 from RFC 4648, using URL-safe alphabet. No padding.\n * Use `base64url` for padded version.\n * @example\n * ```js\n * base64urlnopad.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'Eqs'\n * base64urlnopad.decode('Eqs');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base64urlnopad: BytesCoder = chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'),\n join('')\n);\n\n// base58 code\n// -----------\nconst genBase58 = /* @__NO_SIDE_EFFECTS__ */ (abc: string) =>\n chain(radix(58), alphabet(abc), join(''));\n\n/**\n * base58: base64 without ambigous characters +, /, 0, O, I, l.\n * Quadratic (O(n^2)) - so, can't be used on large inputs.\n * @example\n * ```js\n * base58.decode('01abcdef');\n * // => '3UhJW'\n * ```\n */\nexport const base58: BytesCoder = genBase58(\n '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n);\n/**\n * base58: flickr version. Check out `base58`.\n */\nexport const base58flickr: BytesCoder = genBase58(\n '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'\n);\n/**\n * base58: XRP version. Check out `base58`.\n */\nexport const base58xrp: BytesCoder = genBase58(\n 'rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz'\n);\n\n// Data len (index) -> encoded block len\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\n\n/**\n * base58: XMR version. Check out `base58`.\n * Done in 8-byte blocks (which equals 11 chars in decoding). Last (non-full) block padded with '1' to size in XMR_BLOCK_LEN.\n * Block encoding significantly reduces quadratic complexity of base58.\n */\nexport const base58xmr: BytesCoder = {\n encode(data: Uint8Array) {\n let res = '';\n for (let i = 0; i < data.length; i += 8) {\n const block = data.subarray(i, i + 8);\n res += base58.encode(block).padStart(XMR_BLOCK_LEN[block.length]!, '1');\n }\n return res;\n },\n decode(str: string) {\n let res: number[] = [];\n for (let i = 0; i < str.length; i += 11) {\n const slice = str.slice(i, i + 11);\n const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);\n const block = base58.decode(slice);\n for (let j = 0; j < block.length - blockLen; j++) {\n if (block[j] !== 0) throw new Error('base58xmr: wrong padding');\n }\n res = res.concat(Array.from(block.slice(block.length - blockLen)));\n }\n return Uint8Array.from(res);\n },\n};\n\n/**\n * Method, which creates base58check encoder.\n * Requires function, calculating sha256.\n */\nexport const createBase58check = (sha256: (data: Uint8Array) => Uint8Array): BytesCoder =>\n chain(\n checksum(4, (data) => sha256(sha256(data))),\n base58\n );\n\n/**\n * Use `createBase58check` instead.\n * @deprecated\n */\nexport const base58check: (sha256: (data: Uint8Array) => Uint8Array) => BytesCoder =\n createBase58check;\n\n// Bech32 code\n// -----------\nexport interface Bech32Decoded<Prefix extends string = string> {\n prefix: Prefix;\n words: number[];\n}\nexport interface Bech32DecodedWithArray<Prefix extends string = string> {\n prefix: Prefix;\n words: number[];\n bytes: Uint8Array;\n}\n\nconst BECH_ALPHABET: Coder<number[], string> = chain(\n alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'),\n join('')\n);\n\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\nfunction bech32Polymod(pre: number): number {\n const b = pre >> 25;\n let chk = (pre & 0x1ffffff) << 5;\n for (let i = 0; i < POLYMOD_GENERATORS.length; i++) {\n if (((b >> i) & 1) === 1) chk ^= POLYMOD_GENERATORS[i]!;\n }\n return chk;\n}\n\nfunction bechChecksum(prefix: string, words: number[], encodingConst = 1): string {\n const len = prefix.length;\n let chk = 1;\n for (let i = 0; i < len; i++) {\n const c = prefix.charCodeAt(i);\n if (c < 33 || c > 126) throw new Error(`Invalid prefix (${prefix})`);\n chk = bech32Polymod(chk) ^ (c >> 5);\n }\n chk = bech32Polymod(chk);\n for (let i = 0; i < len; i++) chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n for (let v of words) chk = bech32Polymod(chk) ^ v;\n for (let i = 0; i < 6; i++) chk = bech32Polymod(chk);\n chk ^= encodingConst;\n return BECH_ALPHABET.encode(convertRadix2([chk % powers[30]!], 30, 5, false));\n}\n\nexport interface Bech32 {\n encode<Prefix extends string>(\n prefix: Prefix,\n words: number[] | Uint8Array,\n limit?: number | false\n ): `${Lowercase<Prefix>}1${string}`;\n decode<Prefix extends string>(\n str: `${Prefix}1${string}`,\n limit?: number | false\n ): Bech32Decoded<Prefix>;\n encodeFromBytes(prefix: string, bytes: Uint8Array): string;\n decodeToBytes(str: string): Bech32DecodedWithArray;\n decodeUnsafe(str: string, limit?: number | false): void | Bech32Decoded<string>;\n fromWords(to: number[]): Uint8Array;\n fromWordsUnsafe(to: number[]): void | Uint8Array;\n toWords(from: Uint8Array): number[];\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction genBech32(encoding: 'bech32' | 'bech32m'): Bech32 {\n const ENCODING_CONST = encoding === 'bech32' ? 1 : 0x2bc830a3;\n const _words = radix2(5);\n const fromWords = _words.decode;\n const toWords = _words.encode;\n const fromWordsUnsafe = unsafeWrapper(fromWords);\n\n function encode<Prefix extends string>(\n prefix: Prefix,\n words: number[] | Uint8Array,\n limit: number | false = 90\n ): `${Lowercase<Prefix>}1${string}` {\n astr('bech32.encode prefix', prefix);\n if (isBytes(words)) words = Array.from(words);\n anumArr('bech32.encode', words);\n const plen = prefix.length;\n if (plen === 0) throw new TypeError(`Invalid prefix length ${plen}`);\n const actualLength = plen + 7 + words.length;\n if (limit !== false && actualLength > limit)\n throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n const lowered = prefix.toLowerCase();\n const sum = bechChecksum(lowered, words, ENCODING_CONST);\n return `${lowered}1${BECH_ALPHABET.encode(words)}${sum}` as `${Lowercase<Prefix>}1${string}`;\n }\n\n function decode<Prefix extends string>(\n str: `${Prefix}1${string}`,\n limit?: number | false\n ): Bech32Decoded<Prefix>;\n function decode(str: string, limit?: number | false): Bech32Decoded;\n function decode(str: string, limit: number | false = 90): Bech32Decoded {\n astr('bech32.decode input', str);\n const slen = str.length;\n if (slen < 8 || (limit !== false && slen > limit))\n throw new TypeError(`invalid string length: ${slen} (${str}). Expected (8..${limit})`);\n // don't allow mixed case\n const lowered = str.toLowerCase();\n if (str !== lowered && str !== str.toUpperCase())\n throw new Error(`String must be lowercase or uppercase`);\n const sepIndex = lowered.lastIndexOf('1');\n if (sepIndex === 0 || sepIndex === -1)\n throw new Error(`Letter \"1\" must be present between prefix and data only`);\n const prefix = lowered.slice(0, sepIndex);\n const data = lowered.slice(sepIndex + 1);\n if (data.length < 6) throw new Error('Data must be at least 6 characters long');\n const words = BECH_ALPHABET.decode(data).slice(0, -6);\n const sum = bechChecksum(prefix, words, ENCODING_CONST);\n if (!data.endsWith(sum)) throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n return { prefix, words };\n }\n\n const decodeUnsafe = unsafeWrapper(decode);\n\n function decodeToBytes(str: string): Bech32DecodedWithArray {\n const { prefix, words } = decode(str, false);\n return { prefix, words, bytes: fromWords(words) };\n }\n\n function encodeFromBytes(prefix: string, bytes: Uint8Array) {\n return encode(prefix, toWords(bytes));\n }\n\n return {\n encode,\n decode,\n encodeFromBytes,\n decodeToBytes,\n decodeUnsafe,\n fromWords,\n fromWordsUnsafe,\n toWords,\n };\n}\n\n/**\n * bech32 from BIP 173. Operates on words.\n * For high-level, check out scure-btc-signer:\n * https://github.com/paulmillr/scure-btc-signer.\n */\nexport const bech32: Bech32 = genBech32('bech32');\n\n/**\n * bech32m from BIP 350. Operates on words.\n * It was to mitigate `bech32` weaknesses.\n * For high-level, check out scure-btc-signer:\n * https://github.com/paulmillr/scure-btc-signer.\n */\nexport const bech32m: Bech32 = genBech32('bech32m');\n\ndeclare const TextEncoder: any;\ndeclare const TextDecoder: any;\n\n/**\n * UTF-8-to-byte decoder. Uses built-in TextDecoder / TextEncoder.\n * @example\n * ```js\n * const b = utf8.decode(\"hey\"); // => new Uint8Array([ 104, 101, 121 ])\n * const str = utf8.encode(b); // \"hey\"\n * ```\n */\nexport const utf8: BytesCoder = {\n encode: (data) => new TextDecoder().decode(data),\n decode: (str) => new TextEncoder().encode(str),\n};\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\n// prettier-ignore\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n typeof (Uint8Array as any).from([]).toHex === 'function' &&\n typeof (Uint8Array as any).fromHex === 'function')();\n// prettier-ignore\nconst hexBuiltin: BytesCoder = {\n encode(data) { abytes(data); return (data as any).toHex(); },\n decode(s) { astr('hex', s); return (Uint8Array as any).fromHex(s); },\n};\n/**\n * hex string decoder. Uses built-in function, when available.\n * @example\n * ```js\n * const b = hex.decode(\"0102ff\"); // => new Uint8Array([ 1, 2, 255 ])\n * const str = hex.encode(b); // \"0102ff\"\n * ```\n */\nexport const hex: BytesCoder = hasHexBuiltin\n ? hexBuiltin\n : chain(\n radix2(4),\n alphabet('0123456789abcdef'),\n join(''),\n normalize((s: string) => {\n if (typeof s !== 'string' || s.length % 2 !== 0)\n throw new TypeError(\n `hex.decode: expected string, got ${typeof s} with length ${s.length}`\n );\n return s.toLowerCase();\n })\n );\n\nexport type SomeCoders = {\n utf8: BytesCoder;\n hex: BytesCoder;\n base16: BytesCoder;\n base32: BytesCoder;\n base64: BytesCoder;\n base64url: BytesCoder;\n base58: BytesCoder;\n base58xmr: BytesCoder;\n};\n// prettier-ignore\nconst CODERS: SomeCoders = {\n utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\ntype CoderType = keyof SomeCoders;\nconst coderTypeError =\n 'Invalid encoding type. Available types: utf8, hex, base16, base32, base64, base64url, base58, base58xmr';\n\n/** @deprecated */\nexport const bytesToString = (type: CoderType, bytes: Uint8Array): string => {\n if (typeof type !== 'string' || !CODERS.hasOwnProperty(type)) throw new TypeError(coderTypeError);\n if (!isBytes(bytes)) throw new TypeError('bytesToString() expects Uint8Array');\n return CODERS[type].encode(bytes);\n};\n\n/** @deprecated */\nexport const str: (type: CoderType, bytes: Uint8Array) => string = bytesToString; // as in python, but for bytes only\n\n/** @deprecated */\nexport const stringToBytes = (type: CoderType, str: string): Uint8Array => {\n if (!CODERS.hasOwnProperty(type)) throw new TypeError(coderTypeError);\n if (typeof str !== 'string') throw new TypeError('stringToBytes() expects string');\n return CODERS[type].decode(str);\n};\n/** @deprecated */\nexport const bytes: (type: CoderType, str: string) => Uint8Array = stringToBytes;\n", "/*! scure-bip39 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */\nimport { pbkdf2, pbkdf2Async } from '@noble/hashes/pbkdf2.js';\nimport { sha256, sha512 } from '@noble/hashes/sha2.js';\nimport { abytes, anumber, randomBytes } from '@noble/hashes/utils.js';\nimport { pbkdf2 as pbkdf2web, sha512 as sha512web } from '@noble/hashes/webcrypto.js';\nimport { utils as baseUtils } from '@scure/base';\n// Japanese wordlist\nconst isJapanese = (wordlist) => wordlist[0] === '\\u3042\\u3044\\u3053\\u304f\\u3057\\u3093';\n// Normalization replaces equivalent sequences of characters\n// so that any two texts that are equivalent will be reduced\n// to the same sequence of code points, called the normal form of the original text.\n// https://tonsky.me/blog/unicode/#why-is-a----\nfunction nfkd(str) {\n if (typeof str !== 'string')\n throw new TypeError('invalid mnemonic type: ' + typeof str);\n return str.normalize('NFKD');\n}\nfunction normalize(str) {\n const norm = nfkd(str);\n const words = norm.split(' ');\n if (![12, 15, 18, 21, 24].includes(words.length))\n throw new Error('Invalid mnemonic');\n return { nfkd: norm, words };\n}\nfunction aentropy(ent) {\n abytes(ent);\n if (![16, 20, 24, 28, 32].includes(ent.length))\n throw new Error('invalid entropy length');\n}\n/**\n * Generate x random words. Uses Cryptographically-Secure Random Number Generator.\n * @param wordlist imported wordlist for specific language\n * @param strength mnemonic strength 128-256 bits\n * @example\n * generateMnemonic(wordlist, 128)\n * // 'legal winner thank year wave sausage worth useful legal winner thank yellow'\n */\nexport function generateMnemonic(wordlist, strength = 128) {\n anumber(strength);\n if (strength % 32 !== 0 || strength > 256)\n throw new TypeError('Invalid entropy');\n return entropyToMnemonic(randomBytes(strength / 8), wordlist);\n}\nconst calcChecksum = (entropy) => {\n // Checksum is ent.length/4 bits long\n const bitsLeft = 8 - entropy.length / 4;\n // Zero rightmost \"bitsLeft\" bits in byte\n // For example: bitsLeft=4 val=10111101 -> 10110000\n return new Uint8Array([(sha256(entropy)[0] >> bitsLeft) << bitsLeft]);\n};\nfunction getCoder(wordlist) {\n if (!Array.isArray(wordlist) || wordlist.length !== 2048 || typeof wordlist[0] !== 'string')\n throw new Error('Wordlist: expected array of 2048 strings');\n wordlist.forEach((i) => {\n if (typeof i !== 'string')\n throw new Error('wordlist: non-string element: ' + i);\n });\n return baseUtils.chain(baseUtils.checksum(1, calcChecksum), baseUtils.radix2(11, true), baseUtils.alphabet(wordlist));\n}\n/**\n * Reversible: Converts mnemonic string to raw entropy in form of byte array.\n * @param mnemonic 12-24 words\n * @param wordlist imported wordlist for specific language\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * mnemonicToEntropy(mnem, wordlist)\n * // Produces\n * new Uint8Array([\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f,\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f\n * ])\n */\nexport function mnemonicToEntropy(mnemonic, wordlist) {\n const { words } = normalize(mnemonic);\n const entropy = getCoder(wordlist).decode(words);\n aentropy(entropy);\n return entropy;\n}\n/**\n * Reversible: Converts raw entropy in form of byte array to mnemonic string.\n * @param entropy byte array\n * @param wordlist imported wordlist for specific language\n * @returns 12-24 words\n * @example\n * const ent = new Uint8Array([\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f,\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f\n * ]);\n * entropyToMnemonic(ent, wordlist);\n * // 'legal winner thank year wave sausage worth useful legal winner thank yellow'\n */\nexport function entropyToMnemonic(entropy, wordlist) {\n aentropy(entropy);\n const words = getCoder(wordlist).encode(entropy);\n return words.join(isJapanese(wordlist) ? '\\u3000' : ' ');\n}\n/**\n * Validates mnemonic for being 12-24 words contained in `wordlist`.\n */\nexport function validateMnemonic(mnemonic, wordlist) {\n try {\n mnemonicToEntropy(mnemonic, wordlist);\n }\n catch (e) {\n return false;\n }\n return true;\n}\nconst psalt = (passphrase) => nfkd('mnemonic' + passphrase);\n/**\n * Irreversible: Uses KDF to derive 64 bytes of key data from mnemonic + optional password.\n * @param mnemonic 12-24 words\n * @param passphrase string that will additionally protect the key\n * @returns 64 bytes of key data\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * await mnemonicToSeed(mnem, 'password');\n * // new Uint8Array([...64 bytes])\n */\nexport function mnemonicToSeed(mnemonic, passphrase = '') {\n return pbkdf2Async(sha512, normalize(mnemonic).nfkd, psalt(passphrase), { c: 2048, dkLen: 64 });\n}\n/**\n * Irreversible: Uses KDF to derive 64 bytes of key data from mnemonic + optional password.\n * @param mnemonic 12-24 words\n * @param passphrase string that will additionally protect the key\n * @returns 64 bytes of key data\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * mnemonicToSeedSync(mnem, 'password');\n * // new Uint8Array([...64 bytes])\n */\nexport function mnemonicToSeedSync(mnemonic, passphrase = '') {\n return pbkdf2(sha512, normalize(mnemonic).nfkd, psalt(passphrase), { c: 2048, dkLen: 64 });\n}\n/**\n * Uses native, built-in functionality, provided by globalThis.crypto.\n * Irreversible: Uses KDF to derive 64 bytes of key data from mnemonic + optional password.\n * @param mnemonic 12-24 words\n * @param passphrase string that will additionally protect the key\n * @returns 64 bytes of key data\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * mnemonicToSeedWebcrypto(mnem, 'password');\n * // new Uint8Array([...64 bytes])\n */\nexport function mnemonicToSeedWebcrypto(mnemonic, passphrase = '') {\n return pbkdf2web(sha512web, normalize(mnemonic).nfkd, psalt(passphrase), { c: 2048, dkLen: 64 });\n}\n", "/**\n * PBKDF (RFC 2898). Can be used to create a key from password and salt.\n * @module\n */\nimport { hmac } from './hmac.ts';\n// prettier-ignore\nimport {\n ahash, anumber,\n asyncLoop, checkOpts, clean, createView, kdfInputToBytes,\n type CHash,\n type Hash,\n type KDFInput\n} from './utils.ts';\n\n/**\n * PBKDF2 options:\n * * c: iterations, should probably be higher than 100_000\n * * dkLen: desired length of derived key in bytes\n * * asyncTick: max time in ms for which async function can block execution\n */\nexport type Pbkdf2Opt = {\n c: number;\n dkLen?: number;\n asyncTick?: number;\n};\n// Common start and end for sync/async functions\nfunction pbkdf2Init(hash: CHash, _password: KDFInput, _salt: KDFInput, _opts: Pbkdf2Opt) {\n ahash(hash);\n const opts = checkOpts({ dkLen: 32, asyncTick: 10 }, _opts);\n const { c, dkLen, asyncTick } = opts;\n anumber(c, 'c');\n anumber(dkLen, 'dkLen');\n anumber(asyncTick, 'asyncTick');\n if (c < 1) throw new Error('iterations (c) must be >= 1');\n const password = kdfInputToBytes(_password, 'password');\n const salt = kdfInputToBytes(_salt, 'salt');\n // DK = PBKDF2(PRF, Password, Salt, c, dkLen);\n const DK = new Uint8Array(dkLen);\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n const PRF = hmac.create(hash, password);\n const PRFSalt = PRF._cloneInto().update(salt);\n return { c, dkLen, asyncTick, DK, PRF, PRFSalt };\n}\n\nfunction pbkdf2Output<T extends Hash<T>>(\n PRF: Hash<T>,\n PRFSalt: Hash<T>,\n DK: Uint8Array,\n prfW: Hash<T>,\n u: Uint8Array\n) {\n PRF.destroy();\n PRFSalt.destroy();\n if (prfW) prfW.destroy();\n clean(u);\n return DK;\n}\n\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function\n * @param hash - hash function that would be used e.g. sha256\n * @param password - password from which a derived key is generated\n * @param salt - cryptographic salt\n * @param opts - {c, dkLen} where c is work factor and dkLen is output message size\n * @example\n * const key = pbkdf2(sha256, 'password', 'salt', { dkLen: 32, c: Math.pow(2, 18) });\n */\nexport function pbkdf2(\n hash: CHash,\n password: KDFInput,\n salt: KDFInput,\n opts: Pbkdf2Opt\n): Uint8Array {\n const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW: any; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + \u22EF + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ \u22EF ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n for (let ui = 1; ui < c; ui++) {\n // Uc = PRF(Password, Uc\u22121)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++) Ti[i] ^= u[i];\n }\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function. Async version.\n * @example\n * await pbkdf2Async(sha256, 'password', 'salt', { dkLen: 32, c: 500_000 });\n */\nexport async function pbkdf2Async(\n hash: CHash,\n password: KDFInput,\n salt: KDFInput,\n opts: Pbkdf2Opt\n): Promise<Uint8Array> {\n const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW: any; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + \u22EF + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ \u22EF ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n await asyncLoop(c - 1, asyncTick, () => {\n // Uc = PRF(Password, Uc\u22121)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++) Ti[i] ^= u[i];\n });\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, type CHash, type Hash } from './utils.ts';\n\n/** Internal class for HMAC. */\nexport class _HMAC<T extends Hash<T>> implements Hash<_HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, key: Uint8Array) {\n ahash(hash);\n abytes(key, undefined, 'key');\n this.iHash = hash.create() as T;\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++) 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() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n clean(pad);\n }\n update(buf: Uint8Array): this {\n aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array): void {\n aexists(this);\n abytes(out, this.outputLen, 'output');\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(): Uint8Array {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: _HMAC<T>): _HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\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(): _HMAC<T> {\n return this._cloneInto();\n }\n destroy(): void {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\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: {\n (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array;\n create(hash: CHash, key: Uint8Array): _HMAC<any>;\n} = (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array =>\n new _HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Uint8Array) => new _HMAC<any>(hash, key);\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\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\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\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: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\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://www.rfc-editor.org/rfc/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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal 32-byte base SHA2 hash class. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n constructor() {\n super(32);\n }\n}\n\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal 64-byte base SHA2 hash class. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\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 protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor() {\n super(64);\n }\n}\n\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n */\nexport const sha256: CHash<_SHA256> = /* @__PURE__ */ createHasher(\n () => new _SHA256(),\n /* @__PURE__ */ oidNist(0x01)\n);\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash<_SHA224> = /* @__PURE__ */ createHasher(\n () => new _SHA224(),\n /* @__PURE__ */ oidNist(0x04)\n);\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash<_SHA512> = /* @__PURE__ */ createHasher(\n () => new _SHA512(),\n /* @__PURE__ */ oidNist(0x03)\n);\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash<_SHA384> = /* @__PURE__ */ createHasher(\n () => new _SHA384(),\n /* @__PURE__ */ oidNist(0x02)\n);\n\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: CHash<_SHA512_256> = /* @__PURE__ */ createHasher(\n () => new _SHA512_256(),\n /* @__PURE__ */ oidNist(0x06)\n);\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: CHash<_SHA512_224> = /* @__PURE__ */ createHasher(\n () => new _SHA512_224(),\n /* @__PURE__ */ oidNist(0x05)\n);\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\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: Uint8Array): this {\n aexists(this);\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) 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: Uint8Array): void {\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++) 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 view.setBigUint64(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 must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\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);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) 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}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\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}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\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(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\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: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\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", "export const wordlist = `abandon\nability\nable\nabout\nabove\nabsent\nabsorb\nabstract\nabsurd\nabuse\naccess\naccident\naccount\naccuse\nachieve\nacid\nacoustic\nacquire\nacross\nact\naction\nactor\nactress\nactual\nadapt\nadd\naddict\naddress\nadjust\nadmit\nadult\nadvance\nadvice\naerobic\naffair\nafford\nafraid\nagain\nage\nagent\nagree\nahead\naim\nair\nairport\naisle\nalarm\nalbum\nalcohol\nalert\nalien\nall\nalley\nallow\nalmost\nalone\nalpha\nalready\nalso\nalter\nalways\namateur\namazing\namong\namount\namused\nanalyst\nanchor\nancient\nanger\nangle\nangry\nanimal\nankle\nannounce\nannual\nanother\nanswer\nantenna\nantique\nanxiety\nany\napart\napology\nappear\napple\napprove\napril\narch\narctic\narea\narena\nargue\narm\narmed\narmor\narmy\naround\narrange\narrest\narrive\narrow\nart\nartefact\nartist\nartwork\nask\naspect\nassault\nasset\nassist\nassume\nasthma\nathlete\natom\nattack\nattend\nattitude\nattract\nauction\naudit\naugust\naunt\nauthor\nauto\nautumn\naverage\navocado\navoid\nawake\naware\naway\nawesome\nawful\nawkward\naxis\nbaby\nbachelor\nbacon\nbadge\nbag\nbalance\nbalcony\nball\nbamboo\nbanana\nbanner\nbar\nbarely\nbargain\nbarrel\nbase\nbasic\nbasket\nbattle\nbeach\nbean\nbeauty\nbecause\nbecome\nbeef\nbefore\nbegin\nbehave\nbehind\nbelieve\nbelow\nbelt\nbench\nbenefit\nbest\nbetray\nbetter\nbetween\nbeyond\nbicycle\nbid\nbike\nbind\nbiology\nbird\nbirth\nbitter\nblack\nblade\nblame\nblanket\nblast\nbleak\nbless\nblind\nblood\nblossom\nblouse\nblue\nblur\nblush\nboard\nboat\nbody\nboil\nbomb\nbone\nbonus\nbook\nboost\nborder\nboring\nborrow\nboss\nbottom\nbounce\nbox\nboy\nbracket\nbrain\nbrand\nbrass\nbrave\nbread\nbreeze\nbrick\nbridge\nbrief\nbright\nbring\nbrisk\nbroccoli\nbroken\nbronze\nbroom\nbrother\nbrown\nbrush\nbubble\nbuddy\nbudget\nbuffalo\nbuild\nbulb\nbulk\nbullet\nbundle\nbunker\nburden\nburger\nburst\nbus\nbusiness\nbusy\nbutter\nbuyer\nbuzz\ncabbage\ncabin\ncable\ncactus\ncage\ncake\ncall\ncalm\ncamera\ncamp\ncan\ncanal\ncancel\ncandy\ncannon\ncanoe\ncanvas\ncanyon\ncapable\ncapital\ncaptain\ncar\ncarbon\ncard\ncargo\ncarpet\ncarry\ncart\ncase\ncash\ncasino\ncastle\ncasual\ncat\ncatalog\ncatch\ncategory\ncattle\ncaught\ncause\ncaution\ncave\nceiling\ncelery\ncement\ncensus\ncentury\ncereal\ncertain\nchair\nchalk\nchampion\nchange\nchaos\nchapter\ncharge\nchase\nchat\ncheap\ncheck\ncheese\nchef\ncherry\nchest\nchicken\nchief\nchild\nchimney\nchoice\nchoose\nchronic\nchuckle\nchunk\nchurn\ncigar\ncinnamon\ncircle\ncitizen\ncity\ncivil\nclaim\nclap\nclarify\nclaw\nclay\nclean\nclerk\nclever\nclick\nclient\ncliff\nclimb\nclinic\nclip\nclock\nclog\nclose\ncloth\ncloud\nclown\nclub\nclump\ncluster\nclutch\ncoach\ncoast\ncoconut\ncode\ncoffee\ncoil\ncoin\ncollect\ncolor\ncolumn\ncombine\ncome\ncomfort\ncomic\ncommon\ncompany\nconcert\nconduct\nconfirm\ncongress\nconnect\nconsider\ncontrol\nconvince\ncook\ncool\ncopper\ncopy\ncoral\ncore\ncorn\ncorrect\ncost\ncotton\ncouch\ncountry\ncouple\ncourse\ncousin\ncover\ncoyote\ncrack\ncradle\ncraft\ncram\ncrane\ncrash\ncrater\ncrawl\ncrazy\ncream\ncredit\ncreek\ncrew\ncricket\ncrime\ncrisp\ncritic\ncrop\ncross\ncrouch\ncrowd\ncrucial\ncruel\ncruise\ncrumble\ncrunch\ncrush\ncry\ncrystal\ncube\nculture\ncup\ncupboard\ncurious\ncurrent\ncurtain\ncurve\ncushion\ncustom\ncute\ncycle\ndad\ndamage\ndamp\ndance\ndanger\ndaring\ndash\ndaughter\ndawn\nday\ndeal\ndebate\ndebris\ndecade\ndecember\ndecide\ndecline\ndecorate\ndecrease\ndeer\ndefense\ndefine\ndefy\ndegree\ndelay\ndeliver\ndemand\ndemise\ndenial\ndentist\ndeny\ndepart\ndepend\ndeposit\ndepth\ndeputy\nderive\ndescribe\ndesert\ndesign\ndesk\ndespair\ndestroy\ndetail\ndetect\ndevelop\ndevice\ndevote\ndiagram\ndial\ndiamond\ndiary\ndice\ndiesel\ndiet\ndiffer\ndigital\ndignity\ndilemma\ndinner\ndinosaur\ndirect\ndirt\ndisagree\ndiscover\ndisease\ndish\ndismiss\ndisorder\ndisplay\ndistance\ndivert\ndivide\ndivorce\ndizzy\ndoctor\ndocument\ndog\ndoll\ndolphin\ndomain\ndonate\ndonkey\ndonor\ndoor\ndose\ndouble\ndove\ndraft\ndragon\ndrama\ndrastic\ndraw\ndream\ndress\ndrift\ndrill\ndrink\ndrip\ndrive\ndrop\ndrum\ndry\nduck\ndumb\ndune\nduring\ndust\ndutch\nduty\ndwarf\ndynamic\neager\neagle\nearly\nearn\nearth\neasily\neast\neasy\necho\necology\neconomy\nedge\nedit\neducate\neffort\negg\neight\neither\nelbow\nelder\nelectric\nelegant\nelement\nelephant\nelevator\nelite\nelse\nembark\nembody\nembrace\nemerge\nemotion\nemploy\nempower\nempty\nenable\nenact\nend\nendless\nendorse\nenemy\nenergy\nenforce\nengage\nengine\nenhance\nenjoy\nenlist\nenough\nenrich\nenroll\nensure\nenter\nentire\nentry\nenvelope\nepisode\nequal\nequip\nera\nerase\nerode\nerosion\nerror\nerupt\nescape\nessay\nessence\nestate\neternal\nethics\nevidence\nevil\nevoke\nevolve\nexact\nexample\nexcess\nexchange\nexcite\nexclude\nexcuse\nexecute\nexercise\nexhaust\nexhibit\nexile\nexist\nexit\nexotic\nexpand\nexpect\nexpire\nexplain\nexpose\nexpress\nextend\nextra\neye\neyebrow\nfabric\nface\nfaculty\nfade\nfaint\nfaith\nfall\nfalse\nfame\nfamily\nfamous\nfan\nfancy\nfantasy\nfarm\nfashion\nfat\nfatal\nfather\nfatigue\nfault\nfavorite\nfeature\nfebruary\nfederal\nfee\nfeed\nfeel\nfemale\nfence\nfestival\nfetch\nfever\nfew\nfiber\nfiction\nfield\nfigure\nfile\nfilm\nfilter\nfinal\nfind\nfine\nfinger\nfinish\nfire\nfirm\nfirst\nfiscal\nfish\nfit\nfitness\nfix\nflag\nflame\nflash\nflat\nflavor\nflee\nflight\nflip\nfloat\nflock\nfloor\nflower\nfluid\nflush\nfly\nfoam\nfocus\nfog\nfoil\nfold\nfollow\nfood\nfoot\nforce\nforest\nforget\nfork\nfortune\nforum\nforward\nfossil\nfoster\nfound\nfox\nfragile\nframe\nfrequent\nfresh\nfriend\nfringe\nfrog\nfront\nfrost\nfrown\nfrozen\nfruit\nfuel\nfun\nfunny\nfurnace\nfury\nfuture\ngadget\ngain\ngalaxy\ngallery\ngame\ngap\ngarage\ngarbage\ngarden\ngarlic\ngarment\ngas\ngasp\ngate\ngather\ngauge\ngaze\ngeneral\ngenius\ngenre\ngentle\ngenuine\ngesture\nghost\ngiant\ngift\ngiggle\nginger\ngiraffe\ngirl\ngive\nglad\nglance\nglare\nglass\nglide\nglimpse\nglobe\ngloom\nglory\nglove\nglow\nglue\ngoat\ngoddess\ngold\ngood\ngoose\ngorilla\ngospel\ngossip\ngovern\ngown\ngrab\ngrace\ngrain\ngrant\ngrape\ngrass\ngravity\ngreat\ngreen\ngrid\ngrief\ngrit\ngrocery\ngroup\ngrow\ngrunt\nguard\nguess\nguide\nguilt\nguitar\ngun\ngym\nhabit\nhair\nhalf\nhammer\nhamster\nhand\nhappy\nharbor\nhard\nharsh\nharvest\nhat\nhave\nhawk\nhazard\nhead\nhealth\nheart\nheavy\nhedgehog\nheight\nhello\nhelmet\nhelp\nhen\nhero\nhidden\nhigh\nhill\nhint\nhip\nhire\nhistory\nhobby\nhockey\nhold\nhole\nholiday\nhollow\nhome\nhoney\nhood\nhope\nhorn\nhorror\nhorse\nhospital\nhost\nhotel\nhour\nhover\nhub\nhuge\nhuman\nhumble\nhumor\nhundred\nhungry\nhunt\nhurdle\nhurry\nhurt\nhusband\nhybrid\nice\nicon\nidea\nidentify\nidle\nignore\nill\nillegal\nillness\nimage\nimitate\nimmense\nimmune\nimpact\nimpose\nimprove\nimpulse\ninch\ninclude\nincome\nincrease\nindex\nindicate\nindoor\nindustry\ninfant\ninflict\ninform\ninhale\ninherit\ninitial\ninject\ninjury\ninmate\ninner\ninnocent\ninput\ninquiry\ninsane\ninsect\ninside\ninspire\ninstall\nintact\ninterest\ninto\ninvest\ninvite\ninvolve\niron\nisland\nisolate\nissue\nitem\nivory\njacket\njaguar\njar\njazz\njealous\njeans\njelly\njewel\njob\njoin\njoke\njourney\njoy\njudge\njuice\njump\njungle\njunior\njunk\njust\nkangaroo\nkeen\nkeep\nketchup\nkey\nkick\nkid\nkidney\nkind\nkingdom\nkiss\nkit\nkitchen\nkite\nkitten\nkiwi\nknee\nknife\nknock\nknow\nlab\nlabel\nlabor\nladder\nlady\nlake\nlamp\nlanguage\nlaptop\nlarge\nlater\nlatin\nlaugh\nlaundry\nlava\nlaw\nlawn\nlawsuit\nlayer\nlazy\nleader\nleaf\nlearn\nleave\nlecture\nleft\nleg\nlegal\nlegend\nleisure\nlemon\nlend\nlength\nlens\nleopard\nlesson\nletter\nlevel\nliar\nliberty\nlibrary\nlicense\nlife\nlift\nlight\nlike\nlimb\nlimit\nlink\nlion\nliquid\nlist\nlittle\nlive\nlizard\nload\nloan\nlobster\nlocal\nlock\nlogic\nlonely\nlong\nloop\nlottery\nloud\nlounge\nlove\nloyal\nlucky\nluggage\nlumber\nlunar\nlunch\nluxury\nlyrics\nmachine\nmad\nmagic\nmagnet\nmaid\nmail\nmain\nmajor\nmake\nmammal\nman\nmanage\nmandate\nmango\nmansion\nmanual\nmaple\nmarble\nmarch\nmargin\nmarine\nmarket\nmarriage\nmask\nmass\nmaster\nmatch\nmaterial\nmath\nmatrix\nmatter\nmaximum\nmaze\nmeadow\nmean\nmeasure\nmeat\nmechanic\nmedal\nmedia\nmelody\nmelt\nmember\nmemory\nmention\nmenu\nmercy\nmerge\nmerit\nmerry\nmesh\nmessage\nmetal\nmethod\nmiddle\nmidnight\nmilk\nmillion\nmimic\nmind\nminimum\nminor\nminute\nmiracle\nmirror\nmisery\nmiss\nmistake\nmix\nmixed\nmixture\nmobile\nmodel\nmodify\nmom\nmoment\nmonitor\nmonkey\nmonster\nmonth\nmoon\nmoral\nmore\nmorning\nmosquito\nmother\nmotion\nmotor\nmountain\nmouse\nmove\nmovie\nmuch\nmuffin\nmule\nmultiply\nmuscle\nmuseum\nmushroom\nmusic\nmust\nmutual\nmyself\nmystery\nmyth\nnaive\nname\nnapkin\nnarrow\nnasty\nnation\nnature\nnear\nneck\nneed\nnegative\nneglect\nneither\nnephew\nnerve\nnest\nnet\nnetwork\nneutral\nnever\nnews\nnext\nnice\nnight\nnoble\nnoise\nnominee\nnoodle\nnormal\nnorth\nnose\nnotable\nnote\nnothing\nnotice\nnovel\nnow\nnuclear\nnumber\nnurse\nnut\noak\nobey\nobject\noblige\nobscure\nobserve\nobtain\nobvious\noccur\nocean\noctober\nodor\noff\noffer\noffice\noften\noil\nokay\nold\nolive\nolympic\nomit\nonce\none\nonion\nonline\nonly\nopen\nopera\nopinion\noppose\noption\norange\norbit\norchard\norder\nordinary\norgan\norient\noriginal\norphan\nostrich\nother\noutdoor\nouter\noutput\noutside\noval\noven\nover\nown\nowner\noxygen\noyster\nozone\npact\npaddle\npage\npair\npalace\npalm\npanda\npanel\npanic\npanther\npaper\nparade\nparent\npark\nparrot\nparty\npass\npatch\npath\npatient\npatrol\npattern\npause\npave\npayment\npeace\npeanut\npear\npeasant\npelican\npen\npenalty\npencil\npeople\npepper\nperfect\npermit\nperson\npet\nphone\nphoto\nphrase\nphysical\npiano\npicnic\npicture\npiece\npig\npigeon\npill\npilot\npink\npioneer\npipe\npistol\npitch\npizza\nplace\nplanet\nplastic\nplate\nplay\nplease\npledge\npluck\nplug\nplunge\npoem\npoet\npoint\npolar\npole\npolice\npond\npony\npool\npopular\nportion\nposition\npossible\npost\npotato\npottery\npoverty\npowder\npower\npractice\npraise\npredict\nprefer\nprepare\npresent\npretty\nprevent\nprice\npride\nprimary\nprint\npriority\nprison\nprivate\nprize\nproblem\nprocess\nproduce\nprofit\nprogram\nproject\npromote\nproof\nproperty\nprosper\nprotect\nproud\nprovide\npublic\npudding\npull\npulp\npulse\npumpkin\npunch\npupil\npuppy\npurchase\npurity\npurpose\npurse\npush\nput\npuzzle\npyramid\nquality\nquantum\nquarter\nquestion\nquick\nquit\nquiz\nquote\nrabbit\nraccoon\nrace\nrack\nradar\nradio\nrail\nrain\nraise\nrally\nramp\nranch\nrandom\nrange\nrapid\nrare\nrate\nrather\nraven\nraw\nrazor\nready\nreal\nreason\nrebel\nrebuild\nrecall\nreceive\nrecipe\nrecord\nrecycle\nreduce\nreflect\nreform\nrefuse\nregion\nregret\nregular\nreject\nrelax\nrelease\nrelief\nrely\nremain\nremember\nremind\nremove\nrender\nrenew\nrent\nreopen\nrepair\nrepeat\nreplace\nreport\nrequire\nrescue\nresemble\nresist\nresource\nresponse\nresult\nretire\nretreat\nreturn\nreunion\nreveal\nreview\nreward\nrhythm\nrib\nribbon\nrice\nrich\nride\nridge\nrifle\nright\nrigid\nring\nriot\nripple\nrisk\nritual\nrival\nriver\nroad\nroast\nrobot\nrobust\nrocket\nromance\nroof\nrookie\nroom\nrose\nrotate\nrough\nround\nroute\nroyal\nrubber\nrude\nrug\nrule\nrun\nrunway\nrural\nsad\nsaddle\nsadness\nsafe\nsail\nsalad\nsalmon\nsalon\nsalt\nsalute\nsame\nsample\nsand\nsatisfy\nsatoshi\nsauce\nsausage\nsave\nsay\nscale\nscan\nscare\nscatter\nscene\nscheme\nschool\nscience\nscissors\nscorpion\nscout\nscrap\nscreen\nscript\nscrub\nsea\nsearch\nseason\nseat\nsecond\nsecret\nsection\nsecurity\nseed\nseek\nsegment\nselect\nsell\nseminar\nsenior\nsense\nsentence\nseries\nservice\nsession\nsettle\nsetup\nseven\nshadow\nshaft\nshallow\nshare\nshed\nshell\nsheriff\nshield\nshift\nshine\nship\nshiver\nshock\nshoe\nshoot\nshop\nshort\nshoulder\nshove\nshrimp\nshrug\nshuffle\nshy\nsibling\nsick\nside\nsiege\nsight\nsign\nsilent\nsilk\nsilly\nsilver\nsimilar\nsimple\nsince\nsing\nsiren\nsister\nsituate\nsix\nsize\nskate\nsketch\nski\nskill\nskin\nskirt\nskull\nslab\nslam\nsleep\nslender\nslice\nslide\nslight\nslim\nslogan\nslot\nslow\nslush\nsmall\nsmart\nsmile\nsmoke\nsmooth\nsnack\nsnake\nsnap\nsniff\nsnow\nsoap\nsoccer\nsocial\nsock\nsoda\nsoft\nsolar\nsoldier\nsolid\nsolution\nsolve\nsomeone\nsong\nsoon\nsorry\nsort\nsoul\nsound\nsoup\nsource\nsouth\nspace\nspare\nspatial\nspawn\nspeak\nspecial\nspeed\nspell\nspend\nsphere\nspice\nspider\nspike\nspin\nspirit\nsplit\nspoil\nsponsor\nspoon\nsport\nspot\nspray\nspread\nspring\nspy\nsquare\nsqueeze\nsquirrel\nstable\nstadium\nstaff\nstage\nstairs\nstamp\nstand\nstart\nstate\nstay\nsteak\nsteel\nstem\nstep\nstereo\nstick\nstill\nsting\nstock\nstomach\nstone\nstool\nstory\nstove\nstrategy\nstreet\nstrike\nstrong\nstruggle\nstudent\nstuff\nstumble\nstyle\nsubject\nsubmit\nsubway\nsuccess\nsuch\nsudden\nsuffer\nsugar\nsuggest\nsuit\nsummer\nsun\nsunny\nsunset\nsuper\nsupply\nsupreme\nsure\nsurface\nsurge\nsurprise\nsurround\nsurvey\nsuspect\nsustain\nswallow\nswamp\nswap\nswarm\nswear\nsweet\nswift\nswim\nswing\nswitch\nsword\nsymbol\nsymptom\nsyrup\nsystem\ntable\ntackle\ntag\ntail\ntalent\ntalk\ntank\ntape\ntarget\ntask\ntaste\ntattoo\ntaxi\nteach\nteam\ntell\nten\ntenant\ntennis\ntent\nterm\ntest\ntext\nthank\nthat\ntheme\nthen\ntheory\nthere\nthey\nthing\nthis\nthought\nthree\nthrive\nthrow\nthumb\nthunder\nticket\ntide\ntiger\ntilt\ntimber\ntime\ntiny\ntip\ntired\ntissue\ntitle\ntoast\ntobacco\ntoday\ntoddler\ntoe\ntogether\ntoilet\ntoken\ntomato\ntomorrow\ntone\ntongue\ntonight\ntool\ntooth\ntop\ntopic\ntopple\ntorch\ntornado\ntortoise\ntoss\ntotal\ntourist\ntoward\ntower\ntown\ntoy\ntrack\ntrade\ntraffic\ntragic\ntrain\ntransfer\ntrap\ntrash\ntravel\ntray\ntreat\ntree\ntrend\ntrial\ntribe\ntrick\ntrigger\ntrim\ntrip\ntrophy\ntrouble\ntruck\ntrue\ntruly\ntrumpet\ntrust\ntruth\ntry\ntube\ntuition\ntumble\ntuna\ntunnel\nturkey\nturn\nturtle\ntwelve\ntwenty\ntwice\ntwin\ntwist\ntwo\ntype\ntypical\nugly\numbrella\nunable\nunaware\nuncle\nuncover\nunder\nundo\nunfair\nunfold\nunhappy\nuniform\nunique\nunit\nuniverse\nunknown\nunlock\nuntil\nunusual\nunveil\nupdate\nupgrade\nuphold\nupon\nupper\nupset\nurban\nurge\nusage\nuse\nused\nuseful\nuseless\nusual\nutility\nvacant\nvacuum\nvague\nvalid\nvalley\nvalve\nvan\nvanish\nvapor\nvarious\nvast\nvault\nvehicle\nvelvet\nvendor\nventure\nvenue\nverb\nverify\nversion\nvery\nvessel\nveteran\nviable\nvibrant\nvicious\nvictory\nvideo\nview\nvillage\nvintage\nviolin\nvirtual\nvirus\nvisa\nvisit\nvisual\nvital\nvivid\nvocal\nvoice\nvoid\nvolcano\nvolume\nvote\nvoyage\nwage\nwagon\nwait\nwalk\nwall\nwalnut\nwant\nwarfare\nwarm\nwarrior\nwash\nwasp\nwaste\nwater\nwave\nway\nwealth\nweapon\nwear\nweasel\nweather\nweb\nwedding\nweekend\nweird\nwelcome\nwest\nwet\nwhale\nwhat\nwheat\nwheel\nwhen\nwhere\nwhip\nwhisper\nwide\nwidth\nwife\nwild\nwill\nwin\nwindow\nwine\nwing\nwink\nwinner\nwinter\nwire\nwisdom\nwise\nwish\nwitness\nwolf\nwoman\nwonder\nwood\nwool\nword\nwork\nworld\nworry\nworth\nwrap\nwreck\nwrestle\nwrist\nwrite\nwrong\nyard\nyear\nyellow\nyou\nyoung\nyouth\nzebra\nzero\nzone\nzoo`.split('\\n');\n", "/**\n * Bitcoin WIF (Wallet Import Format) utilities\n *\n * Encodes/decodes private keys in Bitcoin's standard format.\n * Supports both compressed and uncompressed formats.\n *\n * Reference: https://en.bitcoin.it/wiki/Wallet_import_format\n */\nimport { sha256 } from '@noble/hashes/sha256';\n// Base58 alphabet (Bitcoin)\nconst BASE58_ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\n/**\n * Encode bytes to Base58.\n */\nfunction base58Encode(data) {\n let num = 0n;\n for (const byte of data) {\n num = num * 256n + BigInt(byte);\n }\n let encoded = '';\n while (num > 0n) {\n const remainder = Number(num % 58n);\n encoded = BASE58_ALPHABET[remainder] + encoded;\n num = num / 58n;\n }\n // Preserve leading zeros\n for (const byte of data) {\n if (byte !== 0)\n break;\n encoded = '1' + encoded;\n }\n return encoded;\n}\n/**\n * Decode Base58 string to bytes.\n */\nfunction base58Decode(str) {\n let num = 0n;\n for (const char of str) {\n const index = BASE58_ALPHABET.indexOf(char);\n if (index === -1) {\n throw new Error(`Invalid Base58 character: ${char}`);\n }\n num = num * 58n + BigInt(index);\n }\n // Convert to bytes\n const bytes = [];\n while (num > 0n) {\n bytes.unshift(Number(num % 256n));\n num = num / 256n;\n }\n // Preserve leading zeros\n for (const char of str) {\n if (char !== '1')\n break;\n bytes.unshift(0);\n }\n return new Uint8Array(bytes);\n}\n/**\n * Encode a private key to WIF format.\n *\n * @param privateKey 32-byte private key\n * @param compressed Whether to indicate compressed public key (default: true)\n * @param network 'mainnet' or 'testnet' (default: 'mainnet')\n * @returns WIF-encoded private key string\n */\nexport function encodeWIF(privateKey, compressed = true, network = 'mainnet') {\n if (privateKey.length !== 32) {\n throw new Error('Private key must be 32 bytes');\n }\n // Version byte: 0x80 for mainnet, 0xEF for testnet\n const version = network === 'mainnet' ? 0x80 : 0xEF;\n // Build payload: version + key + (optional compression flag)\n const payload = new Uint8Array(compressed ? 34 : 33);\n payload[0] = version;\n payload.set(privateKey, 1);\n if (compressed) {\n payload[33] = 0x01; // Compression flag\n }\n // Checksum: first 4 bytes of double SHA256\n const hash1 = sha256(payload);\n const hash2 = sha256(hash1);\n const checksum = hash2.slice(0, 4);\n // Combine payload + checksum\n const data = new Uint8Array(payload.length + 4);\n data.set(payload);\n data.set(checksum, payload.length);\n return base58Encode(data);\n}\n/**\n * Decode a WIF-encoded private key.\n *\n * @param wif WIF string\n * @returns Object with privateKey, compressed flag, and network\n * @throws If WIF is invalid or checksum fails\n */\nexport function decodeWIF(wif) {\n const data = base58Decode(wif);\n if (data.length !== 37 && data.length !== 38) {\n throw new Error('Invalid WIF length');\n }\n // Extract checksum\n const payload = data.slice(0, -4);\n const checksum = data.slice(-4);\n // Verify checksum\n const hash1 = sha256(payload);\n const hash2 = sha256(hash1);\n const expectedChecksum = hash2.slice(0, 4);\n if (!checksum.every((byte, i) => byte === expectedChecksum[i])) {\n throw new Error('Invalid WIF checksum');\n }\n // Extract version\n const version = payload[0];\n const network = version === 0x80 ? 'mainnet' : version === 0xEF ? 'testnet' : null;\n if (!network) {\n throw new Error(`Invalid WIF version byte: 0x${version.toString(16)}`);\n }\n // Extract private key and compression flag\n const compressed = payload.length === 34 && payload[33] === 0x01;\n const privateKey = payload.slice(1, 33);\n return {\n privateKey,\n compressed,\n network,\n };\n}\n", "import { bytesToHex, hexToBytes } from '../utils.js';\n// Lazy-load the Dilithium library\nlet dilithiumLib = null;\nasync function getDilithium() {\n if (!dilithiumLib) {\n const module = await import('dilithium-crystals');\n // dilithium-crystals exports a default object, not named exports\n dilithiumLib = module.default || module;\n }\n return dilithiumLib;\n}\n/**\n * ML-DSA-87 Suite (Module-Lattice-Based Digital Signature Algorithm)\n * Previously known as Dilithium5 - NIST PQC standard\n *\n * Security Level 5 (highest)\n * Public key: 2592 bytes\n * Private key: 4864 bytes\n * Signature: ~4597 bytes\n *\n * Based on dilithium-crystals library (WebAssembly implementation)\n */\nexport class MlDsa87Suite {\n suiteId = 'ml-dsa-87';\n version = '1.0.0';\n capabilities = {}; // No capabilities yet, reserved for future (custom KDF, etc.)\n async generateKeypair() {\n try {\n const dilithium = await getDilithium();\n const keypair = await dilithium.keyPair();\n return {\n publicKey: new Uint8Array(keypair.publicKey),\n privateKey: new Uint8Array(keypair.privateKey),\n };\n }\n catch (error) {\n throw new Error(`ML-DSA-87 key generation failed: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n async sign(privateKey, message) {\n try {\n const dilithium = await getDilithium();\n const signature = await dilithium.signDetached(Buffer.from(message), Buffer.from(privateKey));\n return new Uint8Array(signature);\n }\n catch (error) {\n throw new Error(`ML-DSA-87 signing failed: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n async verify(publicKey, message, signature) {\n try {\n const dilithium = await getDilithium();\n return await dilithium.verifyDetached(Buffer.from(signature), Buffer.from(message), Buffer.from(publicKey));\n }\n catch (error) {\n // Verification failures should return false, not throw\n return false;\n }\n }\n exportPublicKey(pub) {\n return bytesToHex(pub);\n }\n importPublicKey(encoded) {\n const bytes = hexToBytes(encoded);\n if (bytes.length !== 2592) {\n throw new Error(`ML-DSA-87 public key must be 2592 bytes, got ${bytes.length}`);\n }\n return bytes;\n }\n exportPrivateKey(priv) {\n return bytesToHex(priv);\n }\n importPrivateKey(encoded) {\n const bytes = hexToBytes(encoded);\n if (bytes.length !== 4864) {\n throw new Error(`ML-DSA-87 private key must be 4864 bytes, got ${bytes.length}`);\n }\n return bytes;\n }\n}\n/**\n * ML-DSA-65 Suite (Medium security level)\n * Security Level 3 - Dilithium3 equivalent\n *\n * Note: dilithium-crystals only provides Dilithium5 (ML-DSA-87).\n * This is an alias to ML-DSA-87 for compatibility.\n * For true ML-DSA-65, use a library like liboqs-node.\n */\nexport class MlDsaSuite {\n suiteId = 'ml-dsa-65';\n version = '1.0.0';\n impl = new MlDsa87Suite();\n async generateKeypair() {\n return this.impl.generateKeypair();\n }\n async sign(privateKey, message) {\n return this.impl.sign(privateKey, message);\n }\n async verify(publicKey, message, signature) {\n return this.impl.verify(publicKey, message, signature);\n }\n exportPublicKey(pub) {\n return this.impl.exportPublicKey(pub);\n }\n importPublicKey(encoded) {\n return this.impl.importPublicKey(encoded);\n }\n exportPrivateKey(priv) {\n return this.impl.exportPrivateKey(priv);\n }\n importPrivateKey(encoded) {\n return this.impl.importPrivateKey(encoded);\n }\n}\n", "/**\n * @smartledger/keys - Key Management SDK\n * \n * Single source of truth for cryptographic key operations.\n * Provides a clean API that hides complexity and ensures consistency.\n */\n\nimport { KeyMeta, CryptoProfile, DerivationContext } from '@smartledger/crypto';\n\n/**\n * Public key record (safe to expose, no private key).\n */\nexport interface KeyRecord {\n meta: KeyMeta;\n publicKey: Uint8Array;\n}\n\n/**\n * Key creation options.\n */\nexport interface CreateKeyOptions {\n /** Optional expiration date (ISO 8601) */\n expiresAt?: string;\n \n /** Key usage (default: ['signing']) */\n usage?: Array<'signing' | 'encryption' | 'both'>;\n \n /** Crypto profile version (default: '1.0.0') */\n cryptoProfileVersion?: string;\n \n /** Optional derivation context for deterministic key generation */\n derivationContext?: DerivationContext;\n}\n\n/**\n * Key SDK - Single interface for all key operations.\n * \n * Design principles:\n * - Hide private keys from most callers\n * - Single source of truth for suite selection\n * - Crypto-agnostic API (suite is config, not code)\n * - Easy to audit (all key operations go through this)\n */\nexport interface KeySDK {\n /**\n * Create a new key for an agent/module.\n * \n * @param agentId Agent identifier (e.g. 'agent-resonance')\n * @param profile Crypto configuration (which suites to use)\n * @param options Optional expiration, usage, etc.\n * @returns KeyRecord with metadata and public key\n */\n createKey(\n agentId: string,\n profile: CryptoProfile,\n options?: CreateKeyOptions\n ): Promise<KeyRecord>;\n \n /**\n * Get an existing key by ID.\n * \n * @param keyId Key identifier\n * @returns KeyRecord or null if not found\n */\n getKey(keyId: string): Promise<KeyRecord | null>;\n \n /**\n * Sign a message with a key.\n * \n * Private key never leaves the SDK.\n * \n * @param keyId Which key to sign with\n * @param message Message to sign (will be hashed internally)\n * @returns Signature bytes\n */\n signWithKey(\n keyId: string,\n message: Uint8Array\n ): Promise<Uint8Array>;\n \n /**\n * Verify a signature against a public key.\n * \n * @param keyId Which key to verify with\n * @param message Original message\n * @param signature Signature to verify\n * @returns true if valid\n */\n verifySignature(\n keyId: string,\n message: Uint8Array,\n signature: Uint8Array\n ): Promise<boolean>;\n \n /**\n * List all keys for an agent.\n * \n * @param agentId Agent identifier\n * @param activeOnly If true, only return active keys (default: true)\n * @returns Array of KeyRecords\n */\n listKeysForAgent(\n agentId: string,\n activeOnly?: boolean\n ): Promise<KeyRecord[]>;\n \n /**\n * Get the active crypto profile for an agent.\n * \n * Looks up the most recent active keys and infers the profile.\n * \n * @param agentId Agent identifier\n * @returns CryptoProfile or null if no keys found\n */\n getActiveCryptoProfile(agentId: string): Promise<CryptoProfile | null>;\n \n /**\n * Rotate an agent's keys.\n * \n * Generates new keypairs for all active keys, marks old ones as rotated.\n * \n * @param agentId Agent identifier\n * @returns Array of new KeyRecords\n */\n rotateAgentKeys(agentId: string): Promise<KeyRecord[]>;\n \n /**\n * Create key if it doesn't exist, otherwise return existing.\n * \n * Idempotent key creation for agent setup.\n * \n * @param agentId Agent identifier\n * @param profile Crypto configuration\n * @param options Creation options\n * @returns KeyRecord (new or existing)\n */\n getOrCreateKey(\n agentId: string,\n profile: CryptoProfile,\n options?: CreateKeyOptions\n ): Promise<KeyRecord>;\n \n /**\n * Generate a new BIP39 mnemonic phrase.\n * \n * @param strength 128 (12 words) or 256 (24 words)\n * @returns Mnemonic phrase\n */\n generateMnemonic(strength?: 128 | 256): string;\n \n /**\n * Create a key from a BIP39 mnemonic using HD derivation.\n * \n * @param agentId Agent identifier\n * @param profile Crypto profile (must use derivation-capable suite)\n * @param mnemonic BIP39 mnemonic phrase\n * @param path BIP32 derivation path\n * @param passphrase Optional BIP39 passphrase\n * @param options Additional key creation options\n * @returns KeyRecord with derived key\n */\n createKeyFromMnemonic(\n agentId: string,\n profile: CryptoProfile,\n mnemonic: string,\n path?: string,\n passphrase?: string,\n options?: CreateKeyOptions\n ): Promise<KeyRecord>;\n \n /**\n * Get available capabilities for a specific suite.\n * \n * @param suiteId Suite identifier\n * @returns Array of capability names\n */\n getCapabilities(suiteId: string): string[];\n \n /**\n * Find suites that support a specific capability.\n * \n * @param capability Capability name\n * @returns Array of suite IDs\n */\n getSuitesWithCapability(capability: 'derivation' | 'encryption' | 'threshold'): string[];\n}\n\n/**\n * Agent metadata with crypto configuration.\n */\nexport interface AgentKeyConfig {\n agentId: string;\n version: string;\n cryptoProfile: CryptoProfile;\n}\n"],
5
- "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,MAMa,QAsCA;AA5Cb;AAAA;AAAA;AAMO,MAAM,SAAS;AAAA,QACpB,MAAM,SAAS,MAAM,UAAU;AAC7B,cAAI,OAAO,SAAS,UAAU;AAC5B,gBAAI,aAAa,UAAU;AACzB,oBAAM,eAAe,KAAK,IAAI;AAC9B,oBAAM,QAAQ,IAAI,WAAW,aAAa,MAAM;AAChD,uBAASA,KAAI,GAAGA,KAAI,aAAa,QAAQA,MAAK;AAC5C,sBAAMA,EAAC,IAAI,aAAa,WAAWA,EAAC;AAAA,cACtC;AACA,qBAAO;AAAA,YACT;AAEA,kBAAM,UAAU,IAAI,YAAY;AAChC,mBAAO,QAAQ,OAAO,IAAI;AAAA,UAC5B;AAEA,iBAAO,IAAI,WAAW,IAAI;AAAA,QAC5B;AAAA,MACF;AAGA,UAAI,OAAO,WAAW,UAAU,aAAa,cACzC,CAAC,WAAW,UAAU,SAAS,SAAS,EAAE,SAAS,eAAe,GAAG;AACvE,cAAM,mBAAmB,WAAW,UAAU;AAC9C,mBAAW,UAAU,WAAW,SAAS,UAAU;AACjD,cAAI,aAAa,UAAU;AACzB,gBAAI,SAAS;AACb,kBAAM,QAAQ,IAAI,WAAW,IAAI;AACjC,qBAASA,KAAI,GAAGA,KAAI,MAAM,YAAYA,MAAK;AACzC,wBAAU,OAAO,aAAa,MAAMA,EAAC,CAAC;AAAA,YACxC;AACA,mBAAO,KAAK,MAAM;AAAA,UACpB;AACA,iBAAO,iBAAiB,KAAK,IAAI;AAAA,QACnC;AAAA,MACF;AAGO,MAAM,UAAU;AAAA,QACrB,KAAK;AAAA,UACH,UAAU;AAAA,QACZ;AAAA,MACF;AAGA,UAAI,OAAO,WAAW,aAAa;AACjC,eAAO,SAAS;AAAA,MAClB;AAAA;AAAA;;;AC/CM,WAAU,QAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAU,QAAQC,IAAW,QAAgB,IAAE;AACnD,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,GAAG;AACrC,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,GAAG,MAAM,8BAA8BA,EAAC,EAAE;IAC5D;EACF;AAGM,WAAU,OAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,UAAM,QAAQ,QAAQ,KAAK;AAC3B,UAAM,MAAM,OAAO;AACnB,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,YAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,YAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;IACzE;AACA,WAAO;EACT;AAWM,WAAU,QAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAU,QAAQ,KAAU,UAAa;AAC7C,WAAO,KAAK,QAAW,qBAAqB;AAC5C,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,sDAAsD,GAAG;IAC3E;EACF;AAaM,WAAU,IAAI,KAAe;AACjC,WAAO,IAAI,YAAY,IAAI,QAAQ,IAAI,YAAY,KAAK,MAAM,IAAI,aAAa,CAAC,CAAC;EACnF;AAGM,WAAU,SAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAU,WAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAU,KAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAYM,WAAU,SAAS,MAAY;AACnC,WACI,QAAQ,KAAM,aACd,QAAQ,IAAK,WACb,SAAS,IAAK,QACd,SAAS,KAAM;EAErB;AAOM,WAAU,WAAW,KAAgB;AACzC,aAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AACnC,UAAIA,EAAC,IAAI,SAAS,IAAIA,EAAC,CAAC;IAC1B;AACA,WAAO;EACT;AAqMM,WAAU,aACd,UACA,OAAiB,CAAA,GAAE;AAEnB,UAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,UAAM,MAAM,SAAS,MAAS;AAC9B,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,WAAO,OAAO,OAAO,IAAI;AACzB,WAAO,OAAO,OAAO,KAAK;EAC5B;AApUA,MA6Fa,MAyBA,YAyNA;AA/Ub;;;AA6FO,MAAM,OAAiC,uBAC5C,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM,IAAK;AAwB5D,MAAM,aAA8C,OACvD,CAACC,OAAmBA,KACpB;AAuNG,MAAM,UAAU,CAAC,YAAwC;QAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;;;ACzUrF,WAAU,IAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAU,IAAIF,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAdA,MAoBsB,QAoHT,WAgBA;AAxJb;;;AAIA;AAgBM,MAAgB,SAAhB,MAAsB;QAoB1B,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,0CAAW;AACX,wCAAS;AACT,qCAAM;AACN,2CAAY;AAGpB,eAAK,WAAW;AAChB,eAAK,YAAY;AACjB,eAAK,YAAY;AACjB,eAAK,OAAOA;AACZ,eAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,eAAK,OAAO,WAAW,KAAK,MAAM;QACpC;QACA,OAAO,MAAgB;AACrB,kBAAQ,IAAI;AACZ,iBAAO,IAAI;AACX,gBAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,gBAAM,MAAM,KAAK;AACjB,mBAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,kBAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,gBAAI,SAAS,UAAU;AACrB,oBAAM,WAAW,WAAW,IAAI;AAChC,qBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,qBAAK,QAAQ,UAAU,GAAG;AACzE;YACF;AACA,mBAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,iBAAK,OAAO;AACZ,mBAAO;AACP,gBAAI,KAAK,QAAQ,UAAU;AACzB,mBAAK,QAAQ,MAAM,CAAC;AACpB,mBAAK,MAAM;YACb;UACF;AACA,eAAK,UAAU,KAAK;AACpB,eAAK,WAAU;AACf,iBAAO;QACT;QACA,WAAW,KAAe;AACxB,kBAAQ,IAAI;AACZ,kBAAQ,KAAK,IAAI;AACjB,eAAK,WAAW;AAIhB,gBAAM,EAAE,QAAQ,MAAM,UAAU,MAAAA,MAAI,IAAK;AACzC,cAAI,EAAE,IAAG,IAAK;AAEd,iBAAO,KAAK,IAAI;AAChB,gBAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,cAAI,KAAK,YAAY,WAAW,KAAK;AACnC,iBAAK,QAAQ,MAAM,CAAC;AACpB,kBAAM;UACR;AAEA,mBAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,mBAAOA,EAAC,IAAI;AAIjD,eAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGD,KAAI;AAC7D,eAAK,QAAQ,MAAM,CAAC;AACpB,gBAAM,QAAQ,WAAW,GAAG;AAC5B,gBAAM,MAAM,KAAK;AAEjB,cAAI,MAAM;AAAG,kBAAM,IAAI,MAAM,2CAA2C;AACxE,gBAAM,SAAS,MAAM;AACrB,gBAAM,QAAQ,KAAK,IAAG;AACtB,cAAI,SAAS,MAAM;AAAQ,kBAAM,IAAI,MAAM,oCAAoC;AAC/E,mBAASC,KAAI,GAAGA,KAAI,QAAQA;AAAK,kBAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGD,KAAI;QACxE;QACA,SAAM;AACJ,gBAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,eAAK,WAAW,MAAM;AACtB,gBAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,eAAK,QAAO;AACZ,iBAAO;QACT;QACA,WAAW,IAAM;AACf,sBAAO,IAAK,KAAK,YAAmB;AACpC,aAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,gBAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,aAAG,YAAY;AACf,aAAG,WAAW;AACd,aAAG,SAAS;AACZ,aAAG,MAAM;AACT,cAAI,SAAS;AAAU,eAAG,OAAO,IAAI,MAAM;AAC3C,iBAAO;QACT;QACA,QAAK;AACH,iBAAO,KAAK,WAAU;QACxB;;AASK,MAAM,YAAyC,4BAAY,KAAK;QACrE;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;OACrF;AAcM,MAAM,YAAyC,4BAAY,KAAK;QACrE;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;OACrF;;;;;ACnJD,WAAS,QACPE,IACA,KAAK,OAAK;AAKV,QAAI;AAAI,aAAO,EAAE,GAAG,OAAOA,KAAI,UAAU,GAAG,GAAG,OAAQA,MAAK,OAAQ,UAAU,EAAC;AAC/E,WAAO,EAAE,GAAG,OAAQA,MAAK,OAAQ,UAAU,IAAI,GAAG,GAAG,OAAOA,KAAI,UAAU,IAAI,EAAC;EACjF;AAEA,WAAS,MAAM,KAAe,KAAK,OAAK;AACtC,UAAM,MAAM,IAAI;AAChB,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,aAASC,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC5B,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAC,IAAK,QAAQ,IAAIF,EAAC,GAAG,EAAE;AACnC,OAAC,GAAGA,EAAC,GAAG,GAAGA,EAAC,CAAC,IAAI,CAACC,IAAGC,EAAC;IACxB;AACA,WAAO,CAAC,IAAI,EAAE;EAChB;AAwBA,WAAS,IACP,IACA,IACA,IACA,IAAU;AAKV,UAAMA,MAAK,OAAO,MAAM,OAAO;AAC/B,WAAO,EAAE,GAAI,KAAK,MAAOA,KAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,KAAI,EAAC;EAC3D;AA/DA,MAKM,YACA,MA0BA,OACA,OAEA,QACA,QAEA,QACA,QAKA,QACA,QAEA,QACA,QAiBA,OACA,OAEA,OAEA,OAEA,OAEA;AA1EN;;;AAKA,MAAM,aAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,MAAM,OAAuB,uBAAO,EAAE;AA0BtC,MAAM,QAAQ,CAACD,IAAW,IAAYE,OAAsBF,OAAME;AAClE,MAAM,QAAQ,CAACF,IAAWC,IAAWC,OAAuBF,MAAM,KAAKE,KAAOD,OAAMC;AAEpF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,OAAME,KAAMD,MAAM,KAAKC;AACpF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,MAAM,KAAKE,KAAOD,OAAMC;AAErF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,MAAM,KAAKE,KAAOD,OAAOC,KAAI;AAC1F,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,OAAOE,KAAI,KAAQD,MAAM,KAAKC;AAK3F,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,MAAKE,KAAMD,OAAO,KAAKC;AACpF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBD,MAAKC,KAAMF,OAAO,KAAKE;AAEpF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBD,MAAMC,KAAI,KAAQF,OAAO,KAAKE;AAC3F,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,MAAME,KAAI,KAAQD,OAAO,KAAKC;AAiB3F,MAAM,QAAQ,CAAC,IAAY,IAAY,QAAwB,OAAO,MAAM,OAAO,MAAM,OAAO;AAChG,MAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,OACjD,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAC3C,MAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,QAChD,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AACjD,MAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,OAC7D,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAChD,MAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,QAC5D,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC9D,MAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,OACzE,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;;;AC3ErD,MAgBM,UAYA,UAGS,UA+EF,SAoCP,MAsBA,WACA,WAGA,YACA,YAGS,UAsIF,SA0HA,QAWA;AA3bb;;;AAOA;AACA;AACA;AAOA,MAAM,WAA2B,4BAAY,KAAK;QAChD;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;OACrF;AAGD,MAAM,WAA2B,oBAAI,YAAY,EAAE;AAGnD,MAAe,WAAf,cAAuD,OAAS;QAY9D,YAAY,WAAiB;AAC3B,gBAAM,IAAI,WAAW,GAAG,KAAK;QAC/B;QACU,MAAG;AACX,gBAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,iBAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;QAChC;;QAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,eAAK,IAAIP,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;QACf;QACU,QAAQ,MAAgB,QAAc;AAE9C,mBAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,qBAASA,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,mBAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,kBAAM,MAAM,SAASA,KAAI,EAAE;AAC3B,kBAAMC,MAAK,SAASD,KAAI,CAAC;AACzB,kBAAM,KAAK,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,kBAAM,KAAK,KAAKC,KAAI,EAAE,IAAI,KAAKA,KAAI,EAAE,IAAKA,QAAO;AACjD,qBAASD,EAAC,IAAK,KAAK,SAASA,KAAI,CAAC,IAAI,KAAK,SAASA,KAAI,EAAE,IAAK;UACjE;AAEA,cAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,mBAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,kBAAM,SAAS,KAAKJ,IAAG,CAAC,IAAI,KAAKA,IAAG,EAAE,IAAI,KAAKA,IAAG,EAAE;AACpD,kBAAM,KAAMG,KAAI,SAAS,IAAIH,IAAGC,IAAGC,EAAC,IAAI,SAASE,EAAC,IAAI,SAASA,EAAC,IAAK;AACrE,kBAAM,SAAS,KAAKR,IAAG,CAAC,IAAI,KAAKA,IAAG,EAAE,IAAI,KAAKA,IAAG,EAAE;AACpD,kBAAM,KAAM,SAAS,IAAIA,IAAGC,IAAGC,EAAC,IAAK;AACrC,YAAAK,KAAID;AACJ,YAAAA,KAAID;AACJ,YAAAA,KAAID;AACJ,YAAAA,KAAKD,KAAI,KAAM;AACf,YAAAA,KAAID;AACJ,YAAAA,KAAID;AACJ,YAAAA,KAAID;AACJ,YAAAA,KAAK,KAAK,KAAM;UAClB;AAEA,UAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,eAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;QACjC;QACU,aAAU;AAClB,gBAAM,QAAQ;QAChB;QACA,UAAO;AACL,eAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,gBAAM,KAAK,MAAM;QACnB;;AAII,MAAO,UAAP,cAAuB,SAAiB;QAW5C,cAAA;AACE,gBAAM,EAAE;AATA;;mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;QAGrC;;AAuBF,MAAM,OAAwB,uBAAU,MAAM;QAC5C;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE,IAAI,CAAAG,OAAK,OAAOA,EAAC,CAAC,CAAC,GAAE;AACvB,MAAM,YAA6B,uBAAM,KAAK,CAAC,GAAE;AACjD,MAAM,YAA6B,uBAAM,KAAK,CAAC,GAAE;AAGjD,MAAM,aAA6B,oBAAI,YAAY,EAAE;AACrD,MAAM,aAA6B,oBAAI,YAAY,EAAE;AAGrD,MAAe,WAAf,cAAuD,OAAS;QAqB9D,YAAY,WAAiB;AAC3B,gBAAM,KAAK,WAAW,IAAI,KAAK;QACjC;;QAEU,MAAG;AAIX,gBAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC3E,iBAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;QACxE;;QAEU,IACR,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IACpF,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAU;AAE9F,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;QACjB;QACU,QAAQ,MAAgB,QAAc;AAE9C,mBAASF,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU,GAAG;AACxC,uBAAWA,EAAC,IAAI,KAAK,UAAU,MAAM;AACrC,uBAAWA,EAAC,IAAI,KAAK,UAAW,UAAU,CAAE;UAC9C;AACA,mBAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAE5B,kBAAM,OAAO,WAAWA,KAAI,EAAE,IAAI;AAClC,kBAAM,OAAO,WAAWA,KAAI,EAAE,IAAI;AAClC,kBAAM,MAAU,OAAO,MAAM,MAAM,CAAC,IAAQ,OAAO,MAAM,MAAM,CAAC,IAAQ,MAAM,MAAM,MAAM,CAAC;AAC3F,kBAAM,MAAU,OAAO,MAAM,MAAM,CAAC,IAAQ,OAAO,MAAM,MAAM,CAAC,IAAQ,MAAM,MAAM,MAAM,CAAC;AAE3F,kBAAM,MAAM,WAAWA,KAAI,CAAC,IAAI;AAChC,kBAAM,MAAM,WAAWA,KAAI,CAAC,IAAI;AAChC,kBAAM,MAAU,OAAO,KAAK,KAAK,EAAE,IAAQ,OAAO,KAAK,KAAK,EAAE,IAAQ,MAAM,KAAK,KAAK,CAAC;AACvF,kBAAM,MAAU,OAAO,KAAK,KAAK,EAAE,IAAQ,OAAO,KAAK,KAAK,EAAE,IAAQ,MAAM,KAAK,KAAK,CAAC;AAEvF,kBAAM,OAAW,MAAM,KAAK,KAAK,WAAWA,KAAI,CAAC,GAAG,WAAWA,KAAI,EAAE,CAAC;AACtE,kBAAM,OAAW,MAAM,MAAM,KAAK,KAAK,WAAWA,KAAI,CAAC,GAAG,WAAWA,KAAI,EAAE,CAAC;AAC5E,uBAAWA,EAAC,IAAI,OAAO;AACvB,uBAAWA,EAAC,IAAI,OAAO;UACzB;AACA,cAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAEzE,mBAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAE3B,kBAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,kBAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AAEvF,kBAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,kBAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,kBAAM,OAAW,MAAM,IAAI,SAAS,MAAM,UAAUA,EAAC,GAAG,WAAWA,EAAC,CAAC;AACrE,kBAAM,MAAU,MAAM,MAAM,IAAI,SAAS,MAAM,UAAUA,EAAC,GAAG,WAAWA,EAAC,CAAC;AAC1E,kBAAM,MAAM,OAAO;AAEnB,kBAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,kBAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,kBAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,kBAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,aAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,kBAAM,MAAU,MAAM,KAAK,SAAS,IAAI;AACxC,iBAAS,MAAM,KAAK,KAAK,SAAS,IAAI;AACtC,iBAAK,MAAM;UACb;AAEA,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,eAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;QACzE;QACU,aAAU;AAClB,gBAAM,YAAY,UAAU;QAC9B;QACA,UAAO;AACL,gBAAM,KAAK,MAAM;AACjB,eAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;QACzD;;AAII,MAAO,UAAP,cAAuB,SAAiB;QAkB5C,cAAA;AACE,gBAAM,EAAE;AAlBA,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;QAIvC;;AAsGK,MAAM,SAAyC;QACpD,MAAM,IAAI,QAAO;QACD,wBAAQ,CAAI;MAAC;AASxB,MAAM,SAAyC;QACpD,MAAM,IAAI,QAAO;QACD,wBAAQ,CAAI;MAAC;;;;;ACjYzB,WAAU,QAAQG,IAAgB,SAAiB,IAAE;AACzD,UAAMC,KAAI,IAAI,YAAY,IAAI,CAAC;AAE/B,aAAS,QAAQ,KAAK,QAAQ,QAAQ,IAAI,SAAS;AAEjD,eAASC,KAAI,GAAGA,KAAI,IAAIA;AAAK,QAAAD,GAAEC,EAAC,IAAIF,GAAEE,EAAC,IAAIF,GAAEE,KAAI,EAAE,IAAIF,GAAEE,KAAI,EAAE,IAAIF,GAAEE,KAAI,EAAE,IAAIF,GAAEE,KAAI,EAAE;AACvF,eAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK,GAAG;AAC9B,cAAM,QAAQA,KAAI,KAAK;AACvB,cAAM,QAAQA,KAAI,KAAK;AACvB,cAAM,KAAKD,GAAE,IAAI;AACjB,cAAM,KAAKA,GAAE,OAAO,CAAC;AACrB,cAAM,KAAK,MAAM,IAAI,IAAI,CAAC,IAAIA,GAAE,IAAI;AACpC,cAAM,KAAK,MAAM,IAAI,IAAI,CAAC,IAAIA,GAAE,OAAO,CAAC;AACxC,iBAASE,KAAI,GAAGA,KAAI,IAAIA,MAAK,IAAI;AAC/B,UAAAH,GAAEE,KAAIC,EAAC,KAAK;AACZ,UAAAH,GAAEE,KAAIC,KAAI,CAAC,KAAK;QAClB;MACF;AAEA,UAAI,OAAOH,GAAE,CAAC;AACd,UAAI,OAAOA,GAAE,CAAC;AACd,eAASI,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,QAAQ,UAAUA,EAAC;AACzB,cAAM,KAAK,MAAM,MAAM,MAAM,KAAK;AAClC,cAAM,KAAK,MAAM,MAAM,MAAM,KAAK;AAClC,cAAM,KAAK,QAAQA,EAAC;AACpB,eAAOJ,GAAE,EAAE;AACX,eAAOA,GAAE,KAAK,CAAC;AACf,QAAAA,GAAE,EAAE,IAAI;AACR,QAAAA,GAAE,KAAK,CAAC,IAAI;MACd;AAEA,eAASG,KAAI,GAAGA,KAAI,IAAIA,MAAK,IAAI;AAC/B,iBAASD,KAAI,GAAGA,KAAI,IAAIA;AAAK,UAAAD,GAAEC,EAAC,IAAIF,GAAEG,KAAID,EAAC;AAC3C,iBAASA,KAAI,GAAGA,KAAI,IAAIA;AAAK,UAAAF,GAAEG,KAAID,EAAC,KAAK,CAACD,IAAGC,KAAI,KAAK,EAAE,IAAID,IAAGC,KAAI,KAAK,EAAE;MAC5E;AAEA,MAAAF,GAAE,CAAC,KAAK,YAAY,KAAK;AACzB,MAAAA,GAAE,CAAC,KAAK,YAAY,KAAK;IAC3B;AACA,UAAMC,EAAC;EACT;AArGA,MA4BM,KACA,KACA,KACA,KACA,OACA,QACA,SACA,WACA,YAeA,OACA,aACA,aAGA,OACA,OA+CO,QA2HP,WAWO;AA9Ob;;;AAWA;AAEA;AAeA,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,QAAQ,OAAO,GAAG;AACxB,MAAM,SAAS,OAAO,GAAI;AAC1B,MAAM,UAAoB,CAAA;AAC1B,MAAM,YAAsB,CAAA;AAC5B,MAAM,aAAuB,CAAA;AAC7B,eAAS,QAAQ,GAAGI,KAAI,KAAKH,KAAI,GAAGC,KAAI,GAAG,QAAQ,IAAI,SAAS;AAE9D,SAACD,IAAGC,EAAC,IAAI,CAACA,KAAI,IAAID,KAAI,IAAIC,MAAK,CAAC;AAChC,gBAAQ,KAAK,KAAK,IAAIA,KAAID,GAAE;AAE5B,kBAAU,MAAQ,QAAQ,MAAM,QAAQ,KAAM,IAAK,EAAE;AAErD,YAAIE,KAAI;AACR,iBAASE,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,UAAAD,MAAMA,MAAK,OAASA,MAAK,OAAO,UAAW;AAC3C,cAAIA,KAAI;AAAK,YAAAD,MAAK,QAAS,OAAO,OAAOE,EAAC,KAAK;QACjD;AACA,mBAAW,KAAKF,EAAC;MACnB;AACA,MAAM,QAAQ,MAAM,YAAY,IAAI;AACpC,MAAM,cAAc,MAAM,CAAC;AAC3B,MAAM,cAAc,MAAM,CAAC;AAG3B,MAAM,QAAQ,CAACG,IAAWC,IAAWR,OAAeA,KAAI,KAAK,OAAOO,IAAGC,IAAGR,EAAC,IAAI,OAAOO,IAAGC,IAAGR,EAAC;AAC7F,MAAM,QAAQ,CAACO,IAAWC,IAAWR,OAAeA,KAAI,KAAK,OAAOO,IAAGC,IAAGR,EAAC,IAAI,OAAOO,IAAGC,IAAGR,EAAC;AA+CvF,MAAO,SAAP,MAAO,QAAM;;QAejB,YACE,UACA,QACA,WACA,YAAY,OACZ,SAAiB,IAAE;AAnBX;AACA,qCAAM;AACN,wCAAS;AACT,0CAAW;AACX;AACA,2CAAY;AAEf;AACA;AACA;AACG,2CAAY;AACZ;AAUR,eAAK,WAAW;AAChB,eAAK,SAAS;AACd,eAAK,YAAY;AACjB,eAAK,YAAY;AACjB,eAAK,SAAS;AAEd,kBAAQ,WAAW,WAAW;AAG9B,cAAI,EAAE,IAAI,YAAY,WAAW;AAC/B,kBAAM,IAAI,MAAM,yCAAyC;AAC3D,eAAK,QAAQ,IAAI,WAAW,GAAG;AAC/B,eAAK,UAAU,IAAI,KAAK,KAAK;QAC/B;QACA,QAAK;AACH,iBAAO,KAAK,WAAU;QACxB;QACU,SAAM;AACd,qBAAW,KAAK,OAAO;AACvB,kBAAQ,KAAK,SAAS,KAAK,MAAM;AACjC,qBAAW,KAAK,OAAO;AACvB,eAAK,SAAS;AACd,eAAK,MAAM;QACb;QACA,OAAO,MAAgB;AACrB,kBAAQ,IAAI;AACZ,iBAAO,IAAI;AACX,gBAAM,EAAE,UAAU,MAAK,IAAK;AAC5B,gBAAM,MAAM,KAAK;AACjB,mBAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,kBAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AACpD,qBAASS,KAAI,GAAGA,KAAI,MAAMA;AAAK,oBAAM,KAAK,KAAK,KAAK,KAAK,KAAK;AAC9D,gBAAI,KAAK,QAAQ;AAAU,mBAAK,OAAM;UACxC;AACA,iBAAO;QACT;QACU,SAAM;AACd,cAAI,KAAK;AAAU;AACnB,eAAK,WAAW;AAChB,gBAAM,EAAE,OAAO,QAAQ,KAAK,SAAQ,IAAK;AAEzC,gBAAM,GAAG,KAAK;AACd,eAAK,SAAS,SAAU,KAAK,QAAQ,WAAW;AAAG,iBAAK,OAAM;AAC9D,gBAAM,WAAW,CAAC,KAAK;AACvB,eAAK,OAAM;QACb;QACU,UAAU,KAAe;AACjC,kBAAQ,MAAM,KAAK;AACnB,iBAAO,GAAG;AACV,eAAK,OAAM;AACX,gBAAM,YAAY,KAAK;AACvB,gBAAM,EAAE,SAAQ,IAAK;AACrB,mBAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,MAAM,OAAO;AAC/C,gBAAI,KAAK,UAAU;AAAU,mBAAK,OAAM;AACxC,kBAAM,OAAO,KAAK,IAAI,WAAW,KAAK,QAAQ,MAAM,GAAG;AACvD,gBAAI,IAAI,UAAU,SAAS,KAAK,QAAQ,KAAK,SAAS,IAAI,GAAG,GAAG;AAChE,iBAAK,UAAU;AACf,mBAAO;UACT;AACA,iBAAO;QACT;QACA,QAAQ,KAAe;AAErB,cAAI,CAAC,KAAK;AAAW,kBAAM,IAAI,MAAM,uCAAuC;AAC5E,iBAAO,KAAK,UAAU,GAAG;QAC3B;QACA,IAAI,OAAa;AACf,kBAAQ,KAAK;AACb,iBAAO,KAAK,QAAQ,IAAI,WAAW,KAAK,CAAC;QAC3C;QACA,WAAW,KAAe;AACxB,kBAAQ,KAAK,IAAI;AACjB,cAAI,KAAK;AAAU,kBAAM,IAAI,MAAM,6BAA6B;AAChE,eAAK,UAAU,GAAG;AAClB,eAAK,QAAO;AACZ,iBAAO;QACT;QACA,SAAM;AACJ,iBAAO,KAAK,WAAW,IAAI,WAAW,KAAK,SAAS,CAAC;QACvD;QACA,UAAO;AACL,eAAK,YAAY;AACjB,gBAAM,KAAK,KAAK;QAClB;QACA,WAAW,IAAW;AACpB,gBAAM,EAAE,UAAU,QAAQ,WAAW,QAAQ,UAAS,IAAK;AAC3D,sBAAO,IAAI,QAAO,UAAU,QAAQ,WAAW,WAAW,MAAM;AAChE,aAAG,QAAQ,IAAI,KAAK,OAAO;AAC3B,aAAG,MAAM,KAAK;AACd,aAAG,SAAS,KAAK;AACjB,aAAG,WAAW,KAAK;AACnB,aAAG,SAAS;AAEZ,aAAG,SAAS;AACZ,aAAG,YAAY;AACf,aAAG,YAAY;AACf,aAAG,YAAY,KAAK;AACpB,iBAAO;QACT;;AAGF,MAAM,YAAY,CAAC,QAAgB,UAAkB,WAAmB,OAAiB,CAAA,MACvF,aAAa,MAAM,IAAI,OAAO,UAAU,QAAQ,SAAS,GAAG,IAAI;AAU3D,MAAM,WAAkC;QAC7C;QACA;QACA;QACgB,wBAAQ,CAAI;MAAC;;;;;AClP/B;AAAA;AAAA;AAAA;AAAA;AAWA,WAAS,WAAW,WAAW;AAC7B,QAAI,OAAO,IAAI,WAAW,CAAC;AAC3B,QAAI;AAGJ,YAAQ,UAAU,YAAY,GAAG;AAAA,MAC/B,KAAK;AAAA,MACL,KAAK;AACH,iBAAS;AACT;AAAA,MACF,KAAK;AAAA,MACL,KAAK;AACH,iBAAS;AACT;AAAA,MACF,KAAK;AACH,iBAAS;AACT;AAAA,MACF;AACE,cAAM,IAAI,MAAM,+BAA+B,SAAS,EAAE;AAAA,IAC9D;AAEA,WAAO;AAAA,MACL,OAAO,OAAO;AAEZ,cAAM,aAAa,iBAAiB,aAAa,QAAQ,IAAI,WAAW,KAAK;AAC7E,cAAM,UAAU,IAAI,WAAW,KAAK,SAAS,WAAW,MAAM;AAC9D,gBAAQ,IAAI,IAAI;AAChB,gBAAQ,IAAI,YAAY,KAAK,MAAM;AACnC,eAAO;AACP,eAAO;AAAA,MACT;AAAA,MAEA,SAAS;AACP,eAAO,OAAO,IAAI;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AA/CA,MAmDO;AAnDP;AAAA;AAAA;AAAA;AAKA;AACA;AA6CA,MAAO,8BAAQ,EAAE,WAAW;AAAA;AAAA;;;ACnD5B;AAAA;AAAA;AAAA,UAAI,aAAU,WAAU;AAAC,YAAI,GAAE,GAAE,GAAE,IAAE,CAAC;AAAE,iBAAS,EAAEC,IAAEC,IAAE;AAAC,cAAG,MAAID,GAAE,QAAOC;AAAE,gBAAM,IAAI,MAAM,sBAAoBD,EAAC;AAAA,QAAC;AAAC,iBAAS,EAAEA,IAAEC,IAAE;AAAC,iBAAO,IAAI,WAAW,IAAI,WAAW,EAAE,OAAO,QAAOD,IAAEC,EAAC,CAAC;AAAA,QAAC;AAAC,iBAAS,EAAED,IAAE;AAAC,cAAG;AAAC,cAAE,MAAMA,EAAC;AAAA,UAAC,SAAOA,IAAE;AAAC,wBAAY,WAAU;AAAC,oBAAMA;AAAA,YAAC,IAAG,CAAC;AAAA,UAAC;AAAA,QAAC;AAAC,UAAE,QAAM,IAAI,SAAS,SAAS,GAAE,GAAE;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAO,IAAE,cAAY,OAAO,UAAQ,YAAU,OAAO,OAAO,WAAS,SAASA,IAAE;AAAC,qBAAO,OAAOA;AAAA,YAAC,IAAE,SAASA,IAAE;AAAC,qBAAOA,MAAG,cAAY,OAAO,UAAQA,GAAE,gBAAc,UAAQA,OAAI,OAAO,YAAU,WAAS,OAAOA;AAAA,YAAC,GAAE,EAAEA,EAAC;AAAA,UAAC;AAAC,WAAC,IAAE,CAAC,GAAG,UAAQ,GAAE,EAAE,uBAAqB,WAAU;AAAC,gBAAG;AAAC,gBAAE,8BAA8B,GAAE,EAAE,CAAC;AAAA,YAAC,SAAOA,IAAE;AAAC,gBAAEA,EAAC;AAAA,YAAC;AAAA,UAAC;AAAE,cAAI,GAAE,GAAE,IAAE,WAAS,IAAE,IAAE,CAAC,GAAE,IAAE,OAAO,OAAO,CAAC,GAAE,CAAC,GAAE,IAAE,SAASA,IAAEC,IAAE;AAAC,kBAAMA;AAAA,UAAC,GAAE,IAAE,aAAW,eAAa,OAAO,SAAO,cAAY,EAAE,MAAM,IAAG,IAAE,cAAY,OAAO,eAAc,IAAE,aAAW,eAAa,OAAO,UAAQ,cAAY,EAAE,OAAO,MAAI,YAAU,EAAE,QAAQ,QAAQ,KAAG,YAAU,OAAO,QAAQ,SAAS,MAAK,IAAE;AAAG,cAAG,GAAE;AAAC,gBAAI,IAAE,KAAK,SAAS,EAAE,IAAI,GAAE,IAAE,KAAK,SAAS,EAAE,MAAM;AAAE,gBAAE,IAAE,EAAE,QAAQ,CAAC,IAAE,MAAI,YAAU,KAAI,IAAE,SAASD,IAAEC,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,qBAAOE,KAAED,KAAEC,KAAEA,GAAE,SAAS,KAAGF,KAAE,EAAEA,EAAC,IAAE,IAAI,IAAIA,EAAC,IAAE,EAAE,UAAUA,EAAC,GAAE,EAAE,aAAaA,IAAEC,KAAE,SAAO,MAAM;AAAA,YAAE,GAAE,IAAE,SAASD,IAAE;AAAC,kBAAIC,KAAE,EAAED,IAAE,IAAE;AAAE,qBAAOC,GAAE,WAASA,KAAE,IAAI,WAAWA,EAAC,IAAGA;AAAA,YAAC,GAAE,SAASD,IAAEC,IAAEC,IAAE;AAAC,kBAAIC,KAAE,EAAE,UAAU,SAAO,KAAG,WAAS,UAAU,CAAC,MAAI,UAAU,CAAC,GAAEC,KAAE,EAAEJ,EAAC;AAAE,cAAAI,MAAGH,GAAEG,EAAC,GAAEJ,KAAE,EAAEA,EAAC,IAAE,IAAI,IAAIA,EAAC,IAAE,EAAE,UAAUA,EAAC,GAAE,EAAE,SAASA,IAAEG,KAAE,SAAO,SAAQ,SAASH,IAAEI,IAAE;AAAC,gBAAAJ,KAAEE,GAAEF,EAAC,IAAEC,GAAEE,KAAEC,GAAE,SAAOA,EAAC;AAAA,cAAC,EAAE;AAAA,YAAC,GAAE,CAAC,EAAE,eAAa,QAAQ,KAAK,SAAO,KAAG,QAAQ,KAAK,CAAC,EAAE,QAAQ,OAAM,GAAG,GAAE,QAAQ,KAAK,MAAM,CAAC,GAAE,eAAa,OAAO,WAAS,OAAO,UAAQ,IAAG,QAAQ,GAAG,sBAAqB,SAASJ,IAAE;AAAC,kBAAG,EAAE,aAAWA,MAAGA,cAAa,KAAGA,GAAE,mBAAmB,GAAG,OAAMA;AAAA,YAAC,EAAE,GAAE,IAAE,SAASA,IAAEC,IAAE;AAAC,oBAAM,QAAQ,WAASD,IAAEC;AAAA,YAAC,GAAE,EAAE,UAAQ,WAAU;AAAC,qBAAM;AAAA,YAA4B;AAAA,UAAC,MAAK,EAAC,KAAG,OAAK,IAAE,IAAE,KAAK,SAAS,OAAK,eAAa,OAAO,YAAU,SAAS,kBAAgB,IAAE,SAAS,cAAc,MAAK,IAAE,MAAI,EAAE,QAAQ,OAAO,IAAE,EAAE,OAAO,GAAE,EAAE,QAAQ,UAAS,EAAE,EAAE,YAAY,GAAG,IAAE,CAAC,IAAE,IAAG,IAAE,SAASD,IAAE;AAAC,gBAAG;AAAC,kBAAIC,KAAE,IAAI;AAAe,qBAAOA,GAAE,KAAK,OAAMD,IAAE,KAAE,GAAEC,GAAE,KAAK,IAAI,GAAEA,GAAE;AAAA,YAAY,SAAOA,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,kBAAGE,GAAE,SAAO,SAASF,IAAE;AAAC,yBAAQC,KAAE,CAAC,GAAEC,KAAE,GAAEA,KAAEF,GAAE,QAAOE,MAAI;AAAC,sBAAIC,KAAEH,GAAEE,EAAC;AAAE,kBAAAC,KAAE,QAAMA,MAAG,MAAKF,GAAE,KAAK,OAAO,aAAaE,EAAC,CAAC;AAAA,gBAAC;AAAC,uBAAOF,GAAE,KAAK,EAAE;AAAA,cAAC,GAAEC,EAAC;AAAE,oBAAMD;AAAA,YAAC;AAAA,UAAC,GAAE,MAAI,IAAE,SAASD,IAAE;AAAC,gBAAG;AAAC,kBAAIC,KAAE,IAAI;AAAe,qBAAOA,GAAE,KAAK,OAAMD,IAAE,KAAE,GAAEC,GAAE,eAAa,eAAcA,GAAE,KAAK,IAAI,GAAE,IAAI,WAAWA,GAAE,QAAQ;AAAA,YAAC,SAAOA,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,kBAAGE,GAAE,QAAOA;AAAE,oBAAMD;AAAA,YAAC;AAAA,UAAC,IAAG,SAASD,IAAEC,IAAEC,IAAE;AAAC,gBAAIC,KAAE,IAAI;AAAe,YAAAA,GAAE,KAAK,OAAMH,IAAE,IAAE,GAAEG,GAAE,eAAa,eAAcA,GAAE,SAAO,WAAU;AAAC,kBAAG,OAAKA,GAAE,UAAQ,KAAGA,GAAE,UAAQA,GAAE,SAAS,CAAAF,GAAEE,GAAE,QAAQ;AAAA,mBAAM;AAAC,oBAAIC,KAAE,EAAEJ,EAAC;AAAE,gBAAAI,KAAEH,GAAEG,GAAE,MAAM,IAAEF,GAAE;AAAA,cAAC;AAAA,YAAC,GAAEC,GAAE,UAAQD,IAAEC,GAAE,KAAK,IAAI;AAAA,UAAC,GAAE,SAASH,IAAE;AAAC,mBAAO,SAAS,QAAMA;AAAA,UAAC;AAAG,YAAE,SAAO,QAAQ,IAAI,KAAK,OAAO;AAAE,cAAI,GAAE,IAAE,EAAE,YAAU,QAAQ,MAAM,KAAK,OAAO;AAAE,iBAAO,OAAO,GAAE,CAAC,GAAE,IAAE,MAAK,EAAE,aAAW,EAAE,WAAU,EAAE,eAAa,EAAE,aAAY,EAAE,SAAO,IAAE,EAAE,OAAM,EAAE,eAAa,IAAE,EAAE;AAAY,cAAI,GAAE,IAAE,EAAE,iBAAe;AAAG,uBAAW,eAAa,OAAO,cAAY,cAAY,EAAE,WAAW,MAAI,EAAE,iCAAiC;AAAE,cAAI,GAAE,GAAE,GAAE,GAAE,IAAE;AAAG,cAAI,IAAE,CAAC,GAAE,IAAE,CAAC,GAAE,IAAE,CAAC;AAAE,cAAI,IAAE,GAAE,IAAE,MAAK,IAAE;AAAK,mBAAS,EAAEA,IAAE;AAAC,kBAAM,EAAE,WAAS,EAAE,QAAQA,EAAC,GAAE,EAAEA,KAAE,aAAWA,KAAE,GAAG,GAAE,IAAE,MAAG,GAAEA,MAAG,4CAA2C,IAAI,YAAY,aAAaA,EAAC;AAAA,UAAC;AAAC,cAAI,GAAE,GAAE,IAAE;AAAwC,mBAAS,EAAEA,IAAE;AAAC,mBAAOA,GAAE,WAAW,CAAC;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAOA,GAAE,WAAW,SAAS;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAO,QAAQ,QAAQ,EAAE,MAAM,WAAU;AAAC,sBAAO,SAASA,IAAE;AAAC,oBAAGA,MAAG,KAAG,EAAE,QAAO,IAAI,WAAW,CAAC;AAAE,oBAAIC,KAAE,EAAED,EAAC;AAAE,oBAAGC,GAAE,QAAOA;AAAE,oBAAG,EAAE,QAAO,EAAED,EAAC;AAAE,sBAAK;AAAA,cAAiD,GAAEA,EAAC;AAAA,YAAC,EAAE;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAEC,IAAEC,IAAEC,IAAE;AAAC,oBAAO,SAASH,IAAEC,IAAEC,IAAE;AAAC,qBAAO,EAAEF,EAAC,EAAE,MAAM,SAASA,IAAE;AAAC,uBAAO,YAAY,YAAYA,IAAEC,EAAC;AAAA,cAAC,EAAE,EAAE,MAAM,SAASD,IAAE;AAAC,uBAAOA;AAAA,cAAC,EAAE,EAAE,KAAKE,KAAG,SAASF,IAAE;AAAC,kBAAE,4CAA0CA,EAAC,GAAE,EAAEA,EAAC;AAAA,cAAC,EAAE;AAAA,YAAC,GAAEC,IAAEC,IAAEC,EAAC;AAAA,UAAC;AAAC,YAAE,IAAE,+i7CAA+i7C,MAAI,IAAE,GAAE,IAAE,EAAE,aAAW,EAAE,WAAW,GAAE,CAAC,IAAE,IAAE;AAAG,cAAI,IAAE,EAAC,MAAK,WAAU;AAAC,mBAAO,EAAE,eAAe;AAAA,UAAC,GAAE,MAAK,WAAU;AAAC,gBAAG,WAAS,EAAE,eAAe,KAAG;AAAC,kBAAI,IAAE,cAAY,eAAa,OAAO,SAAO,cAAY,EAAE,MAAM,KAAG,SAAO,MAAK,IAAE,WAAS,EAAE,SAAO,EAAE,SAAO,EAAE,UAAS,IAAE,WAAU;AAAC,oBAAIH,KAAE,IAAI,YAAY,CAAC;AAAE,uBAAO,EAAE,gBAAgBA,EAAC,GAAEA,GAAE,CAAC,MAAI;AAAA,cAAC;AAAE,gBAAE,GAAE,EAAE,iBAAe;AAAA,YAAC,SAAO,GAAE;AAAC,kBAAG;AAAC,oBAAI,IAAE,KAAK,SAAS,EAAE,QAAQ,GAAE,IAAE,WAAU;AAAC,sBAAIA,KAAE,EAAE,YAAY,CAAC;AAAE,0BAAOA,GAAE,CAAC,KAAG,KAAGA,GAAE,CAAC,KAAG,KAAGA,GAAE,CAAC,KAAG,IAAEA,GAAE,CAAC,OAAK;AAAA,gBAAC;AAAE,kBAAE,GAAE,EAAE,iBAAe;AAAA,cAAC,SAAOA,IAAE;AAAC,sBAAK;AAAA,cAAyC;AAAA,YAAC;AAAA,UAAC,EAAC;AAAE,mBAAS,EAAEA,IAAE;AAAC,iBAAK,OAAK,cAAa,KAAK,UAAQ,gCAAgC,OAAOA,IAAE,GAAG,GAAE,KAAK,SAAOA;AAAA,UAAC;AAAC,cAAI,IAAE,SAASA,IAAE;AAAC,mBAAKA,GAAE,SAAO,IAAG,CAAAA,GAAE,MAAM,EAAE,CAAC;AAAA,UAAC;AAAE,yBAAa,OAAO,eAAa,IAAI,YAAY,MAAM;AAAE,cAAI,GAAE,IAAE,CAAC,GAAE,IAAE,SAASA,IAAEC,IAAEC,IAAE;AAAC,gBAAIC,MAAE,SAASH,IAAEC,IAAE;AAAC,kBAAIC;AAAE,mBAAI,EAAE,SAAO,GAAED,OAAI,GAAEC,KAAE,EAAEF,IAAG,IAAG,CAAAC,MAAG,OAAKC,KAAED,IAAE,EAAE,KAAK,OAAKC,KAAE,EAAED,EAAC,IAAE,EAAEA,QAAK,CAAC,CAAC,GAAE,EAAEA;AAAE,qBAAO;AAAA,YAAC,GAAEA,IAAEC,EAAC;AAAE,mBAAO,EAAEF,EAAC,EAAE,MAAM,MAAKG,EAAC;AAAA,UAAC,GAAE,IAAE,SAASH,IAAE;AAAC,YAAAA,IAAE,MAAI,EAAE,UAAQ,EAAE,OAAOA,EAAC,GAAE,IAAE,OAAI,EAAEA,IAAE,IAAI,EAAEA,EAAC,CAAC;AAAA,UAAC,GAAE,IAAE,EAAC,GAAE,SAASA,IAAEC,IAAEC,IAAE;AAAC,mBAAO,EAAEF,IAAEC,IAAEC,EAAC;AAAA,UAAC,GAAE,GAAE,SAASF,IAAEC,IAAEC,IAAE;AAAC,mBAAO,EAAE,WAAWF,IAAEC,IAAEA,KAAEC,EAAC;AAAA,UAAC,GAAE,GAAE,SAASF,IAAE;AAAC,cAAE;AAAO,cAAE,KAAK;AAAA,UAAC,GAAE,GAAE,SAASA,IAAEC,IAAE;AAAC,YAAAD,IAAE,EAAEA,EAAC;AAAA,UAAC,EAAC;AAAE,WAAC,WAAU;AAAC,gBAAIA,KAAE,EAAC,GAAE,EAAC;AAAE,qBAASC,GAAED,IAAEC,IAAE;AAAC,kBAAIC,IAAEC,IAAEC,KAAEJ,GAAE;AAAQ,qBAAO,EAAE,MAAII,IAAE,IAAE,EAAE,IAAI,GAAEF,KAAE,EAAE,QAAO,EAAE,QAAM,IAAE,IAAI,UAAUA,EAAC,GAAE,EAAE,SAAO,IAAI,WAAWA,EAAC,GAAE,EAAE,SAAO,IAAE,IAAI,WAAWA,EAAC,GAAE,EAAE,SAAO,IAAE,IAAI,WAAWA,EAAC,GAAE,EAAE,UAAQ,IAAI,YAAYA,EAAC,GAAE,EAAE,UAAQ,IAAI,YAAYA,EAAC,GAAE,EAAE,UAAQ,IAAI,aAAaA,EAAC,GAAE,EAAE,UAAQ,IAAE,IAAI,aAAaA,EAAC,GAAE,EAAE,IAAI,GAAEC,KAAE,EAAE,IAAI,GAAE,EAAE,QAAQA,EAAC,IAAE,SAASH,IAAE;AAAC,oBAAG,KAAI,EAAE,0BAAwB,EAAE,uBAAuB,CAAC,GAAE,KAAG,MAAI,SAAO,MAAI,cAAc,CAAC,GAAE,IAAE,OAAM,IAAG;AAAC,sBAAIC,KAAE;AAAE,sBAAE,MAAKA,GAAE;AAAA,gBAAC;AAAA,cAAC,GAAE,GAAEG;AAAA,YAAC;AAAC,gBAAG,KAAI,EAAE,0BAAwB,EAAE,uBAAuB,CAAC,GAAE,EAAE,gBAAgB,KAAG;AAAC,qBAAO,EAAE,gBAAgBJ,IAAEC,EAAC;AAAA,YAAC,SAAOD,IAAE;AAAC,qBAAO,EAAE,wDAAsDA,EAAC,GAAE;AAAA,YAAE;AAAC,cAAE,GAAE,GAAEA,KAAG,SAASA,IAAE;AAAC,cAAAC,GAAED,GAAE,QAAQ;AAAA,YAAC,EAAE;AAAA,UAAC,GAAG,GAAE,EAAE,UAAQ,WAAU;AAAC,oBAAO,EAAE,UAAQ,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,QAAM,WAAU;AAAC,oBAAO,EAAE,QAAM,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,oBAAkB,WAAU;AAAC,oBAAO,EAAE,oBAAkB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,gCAA8B,WAAU;AAAC,oBAAO,EAAE,gCAA8B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,gCAA8B,WAAU;AAAC,oBAAO,EAAE,gCAA8B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,+BAA6B,WAAU;AAAC,oBAAO,EAAE,+BAA6B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,uBAAqB,WAAU;AAAC,oBAAO,EAAE,uBAAqB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,oBAAkB,WAAU;AAAC,oBAAO,EAAE,oBAAkB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,sBAAoB,WAAU;AAAC,oBAAO,EAAE,sBAAoB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC;AAAE,mBAAS,EAAEA,IAAE;AAAC,gBAAG,EAAEA,EAAC,EAAE,SAAO,SAASA,IAAE;AAAC,kBAAG,WAAS,KAAG,GAAE;AAAC,oBAAIC,KAAE,OAAO,KAAKD,IAAE,QAAQ;AAAE,uBAAO,IAAI,WAAWC,GAAE,QAAOA,GAAE,YAAWA,GAAE,UAAU;AAAA,cAAC;AAAC,kBAAG;AAAC,yBAAQC,KAAE,KAAKF,EAAC,GAAEG,KAAE,IAAI,WAAWD,GAAE,MAAM,GAAEE,KAAE,GAAEA,KAAEF,GAAE,QAAO,EAAEE,GAAE,CAAAD,GAAEC,EAAC,IAAEF,GAAE,WAAWE,EAAC;AAAE,uBAAOD;AAAA,cAAC,SAAOH,IAAE;AAAC,sBAAM,IAAI,MAAM,2CAA2C;AAAA,cAAC;AAAA,YAAC,GAAEA,GAAE,MAAM,EAAE,MAAM,CAAC;AAAA,UAAC;AAAC,mBAAS,IAAG;AAAC,qBAASA,KAAG;AAAC,oBAAI,IAAE,MAAG,EAAE,YAAU,MAAG,MAAI,MAAG,EAAE,CAAC,GAAE,EAAE,wBAAsB,EAAE,qBAAqB,IAAE,WAAU;AAAC,oBAAG,EAAE,QAAQ,MAAI,cAAY,OAAO,EAAE,YAAU,EAAE,UAAQ,CAAC,EAAE,OAAO,IAAG,EAAE,QAAQ,SAAQ,CAAAA,KAAE,EAAE,QAAQ,MAAM,GAAE,EAAE,QAAQA,EAAC;AAAE,oBAAIA;AAAE,kBAAE,CAAC;AAAA,cAAC,GAAE;AAAA,YAAG;AAAC,gBAAE,MAAI,EAAC,WAAU;AAAC,kBAAG,EAAE,OAAO,MAAI,cAAY,OAAO,EAAE,WAAS,EAAE,SAAO,CAAC,EAAE,MAAM,IAAG,EAAE,OAAO,SAAQ,CAAAA,KAAE,EAAE,OAAO,MAAM,GAAE,EAAE,QAAQA,EAAC;AAAE,kBAAIA;AAAE,gBAAE,CAAC;AAAA,YAAC,GAAE,GAAE,IAAE,MAAI,EAAE,aAAW,EAAE,UAAU,YAAY,GAAE,YAAY,WAAU;AAAC,0BAAY,WAAU;AAAC,kBAAE,UAAU,EAAE;AAAA,cAAC,IAAG,CAAC,GAAEA,GAAE;AAAA,YAAC,IAAG,CAAC,KAAGA,GAAE;AAAA,UAAG;AAAC,cAAG,EAAE,qBAAmB,SAASA,IAAEC,IAAE;AAAC,cAAE,IAAID,IAAEC,EAAC;AAAA,UAAC,GAAE,IAAE,SAASD,KAAG;AAAC,iBAAG,EAAE,GAAE,MAAI,IAAEA;AAAA,UAAE,GAAE,EAAE,QAAQ,MAAI,cAAY,OAAO,EAAE,YAAU,EAAE,UAAQ,CAAC,EAAE,OAAO,IAAG,EAAE,QAAQ,SAAO,IAAG,GAAE,QAAQ,IAAI,EAAE;AAAE,YAAE;AAAA,QAAC,EAAE,EAAE,OAAO,WAAU;AAAC,mBAAS,EAAEC,IAAE;AAAC,mBAAO,IAAE,cAAY,OAAO,UAAQ,YAAU,OAAO,OAAO,WAAS,SAASD,IAAE;AAAC,qBAAO,OAAOA;AAAA,YAAC,IAAE,SAASA,IAAE;AAAC,qBAAOA,MAAG,cAAY,OAAO,UAAQA,GAAE,gBAAc,UAAQA,OAAI,OAAO,YAAU,WAAS,OAAOA;AAAA,YAAC,GAAE,EAAEC,EAAC;AAAA,UAAC;AAAC,cAAI,GAAE,GAAE,IAAE,YAAU,IAAE,CAAC,KAAG,IAAE,CAAC,GAAE,IAAE,OAAO,OAAO,CAAC,GAAE,CAAC,GAAE,IAAE,SAASD,IAAEC,IAAE;AAAC,kBAAMA;AAAA,UAAC,GAAE,IAAE,aAAW,eAAa,OAAO,SAAO,cAAY,EAAE,MAAM,IAAG,IAAE,cAAY,OAAO,eAAc,IAAE,aAAW,eAAa,OAAO,UAAQ,cAAY,EAAE,OAAO,MAAI,YAAU,EAAE,QAAQ,QAAQ,KAAG,YAAU,OAAO,QAAQ,SAAS,MAAK,IAAE;AAAG,cAAG,GAAE;AAAC,gBAAI,IAAE,KAAK,SAAS,EAAE,IAAI,GAAE,IAAE,KAAK,SAAS,EAAE,MAAM;AAAE,gBAAE,IAAE,EAAE,QAAQ,CAAC,IAAE,MAAI,YAAU,KAAI,IAAE,SAASD,IAAEC,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,qBAAOE,KAAED,KAAEC,KAAEA,GAAE,SAAS,KAAGF,KAAE,EAAEA,EAAC,IAAE,IAAI,IAAIA,EAAC,IAAE,EAAE,UAAUA,EAAC,GAAE,EAAE,aAAaA,IAAEC,KAAE,SAAO,MAAM;AAAA,YAAE,GAAE,IAAE,SAASD,IAAE;AAAC,kBAAIE,KAAE,EAAEF,IAAE,IAAE;AAAE,qBAAOE,GAAE,WAASA,KAAE,IAAI,WAAWA,EAAC,IAAGA;AAAA,YAAC,GAAE,SAASF,IAAEC,IAAEC,IAAE;AAAC,kBAAIC,KAAE,EAAE,UAAU,SAAO,KAAG,WAAS,UAAU,CAAC,MAAI,UAAU,CAAC,GAAEC,KAAE,EAAEJ,EAAC;AAAE,cAAAI,MAAGH,GAAEG,EAAC,GAAEJ,KAAE,EAAEA,EAAC,IAAE,IAAI,IAAIA,EAAC,IAAE,EAAE,UAAUA,EAAC,GAAE,EAAE,SAASA,IAAEG,KAAE,SAAO,SAAQ,SAASH,IAAEI,IAAE;AAAC,gBAAAJ,KAAEE,GAAEF,EAAC,IAAEC,GAAEE,KAAEC,GAAE,SAAOA,EAAC;AAAA,cAAC,EAAE;AAAA,YAAC,GAAE,CAAC,EAAE,eAAa,QAAQ,KAAK,SAAO,KAAG,QAAQ,KAAK,CAAC,EAAE,QAAQ,OAAM,GAAG,GAAE,QAAQ,KAAK,MAAM,CAAC,GAAE,eAAa,OAAO,WAAS,OAAO,UAAQ,IAAG,QAAQ,GAAG,sBAAqB,SAASJ,IAAE;AAAC,kBAAG,EAAE,aAAWA,MAAGA,cAAa,KAAGA,GAAE,mBAAmB,GAAG,OAAMA;AAAA,YAAC,EAAE,GAAE,IAAE,SAASA,IAAEC,IAAE;AAAC,oBAAM,QAAQ,WAASD,IAAEC;AAAA,YAAC,GAAE,EAAE,UAAQ,WAAU;AAAC,qBAAM;AAAA,YAA4B;AAAA,UAAC,MAAK,EAAC,KAAG,OAAK,IAAE,IAAE,KAAK,SAAS,OAAK,eAAa,OAAO,YAAU,SAAS,kBAAgB,IAAE,SAAS,cAAc,MAAK,IAAE,MAAI,EAAE,QAAQ,OAAO,IAAE,EAAE,OAAO,GAAE,EAAE,QAAQ,UAAS,EAAE,EAAE,YAAY,GAAG,IAAE,CAAC,IAAE,IAAG,IAAE,SAASD,IAAE;AAAC,gBAAG;AAAC,kBAAIC,KAAE,IAAI;AAAe,qBAAOA,GAAE,KAAK,OAAMD,IAAE,KAAE,GAAEC,GAAE,KAAK,IAAI,GAAEA,GAAE;AAAA,YAAY,SAAOA,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,kBAAGE,GAAE,SAAO,SAASF,IAAE;AAAC,yBAAQC,KAAE,CAAC,GAAEC,KAAE,GAAEA,KAAEF,GAAE,QAAOE,MAAI;AAAC,sBAAIC,KAAEH,GAAEE,EAAC;AAAE,kBAAAC,KAAE,QAAMA,MAAG,MAAKF,GAAE,KAAK,OAAO,aAAaE,EAAC,CAAC;AAAA,gBAAC;AAAC,uBAAOF,GAAE,KAAK,EAAE;AAAA,cAAC,GAAEC,EAAC;AAAE,oBAAMD;AAAA,YAAC;AAAA,UAAC,GAAE,MAAI,IAAE,SAASD,IAAE;AAAC,gBAAG;AAAC,kBAAIC,KAAE,IAAI;AAAe,qBAAOA,GAAE,KAAK,OAAMD,IAAE,KAAE,GAAEC,GAAE,eAAa,eAAcA,GAAE,KAAK,IAAI,GAAE,IAAI,WAAWA,GAAE,QAAQ;AAAA,YAAC,SAAOA,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,kBAAGE,GAAE,QAAOA;AAAE,oBAAMD;AAAA,YAAC;AAAA,UAAC,IAAG,SAASD,IAAEC,IAAEC,IAAE;AAAC,gBAAIC,KAAE,IAAI;AAAe,YAAAA,GAAE,KAAK,OAAMH,IAAE,IAAE,GAAEG,GAAE,eAAa,eAAcA,GAAE,SAAO,WAAU;AAAC,kBAAG,OAAKA,GAAE,UAAQ,KAAGA,GAAE,UAAQA,GAAE,SAAS,CAAAF,GAAEE,GAAE,QAAQ;AAAA,mBAAM;AAAC,oBAAIC,KAAE,EAAEJ,EAAC;AAAE,gBAAAI,KAAEH,GAAEG,GAAE,MAAM,IAAEF,GAAE;AAAA,cAAC;AAAA,YAAC,GAAEC,GAAE,UAAQD,IAAEC,GAAE,KAAK,IAAI;AAAA,UAAC,GAAE,SAASH,IAAE;AAAC,mBAAO,SAAS,QAAMA;AAAA,UAAC;AAAG,YAAE,SAAO,QAAQ,IAAI,KAAK,OAAO;AAAE,cAAI,GAAE,IAAE,EAAE,YAAU,QAAQ,MAAM,KAAK,OAAO;AAAE,iBAAO,OAAO,GAAE,CAAC,GAAE,IAAE,MAAK,EAAE,aAAW,EAAE,WAAU,EAAE,eAAa,EAAE,aAAY,EAAE,SAAO,IAAE,EAAE,OAAM,EAAE,eAAa,IAAE,EAAE;AAAY,cAAI,GAAE,IAAE,EAAE,iBAAe,MAAG,IAAE,EAAC,QAAO,SAASA,IAAE;AAAC,iBAAK,SAAO,IAAI,YAAY,QAAMA,GAAE,OAAO;AAAA,UAAC,GAAE,QAAO,SAASA,IAAE;AAAA,UAAC,GAAE,UAAS,SAASA,IAAEC,IAAE;AAAC,iBAAK,WAAQ,SAASD,IAAE;AAAC,uBAAQC,IAAEC,KAAE,IAAI,WAAW,GAAG,GAAEC,KAAE,IAAGA,MAAG,GAAE,EAAEA,GAAE,CAAAD,GAAE,KAAGC,EAAC,IAAE,KAAGA,IAAED,GAAE,KAAGC,EAAC,IAAEA,IAAED,GAAE,KAAGC,EAAC,IAAE,KAAGA;AAAE,uBAASC,GAAEJ,IAAEC,IAAEE,IAAE;AAAC,yBAAQC,IAAEC,IAAEC,KAAE,GAAEC,KAAEN,IAAEO,KAAEL,GAAE,QAAOM,KAAER,MAAG,IAAEO,MAAG,MAAI,OAAKL,GAAEK,KAAE,CAAC,MAAI,OAAKL,GAAEK,KAAE,CAAC,IAAGF,KAAEE,IAAEF,MAAG,EAAE,CAAAF,KAAEF,GAAEC,GAAE,WAAWG,KAAE,CAAC,CAAC,GAAED,KAAEH,GAAEC,GAAE,WAAWG,KAAE,CAAC,CAAC,GAAEN,GAAEO,IAAG,IAAEL,GAAEC,GAAE,WAAWG,EAAC,CAAC,KAAG,IAAEF,MAAG,GAAEG,KAAEE,OAAIT,GAAEO,IAAG,IAAEH,MAAG,IAAEC,MAAG,IAAGE,KAAEE,OAAIT,GAAEO,IAAG,IAAEF,MAAG,IAAEH,GAAEC,GAAE,WAAWG,KAAE,CAAC,CAAC;AAAA,cAAE;AAAC,uBAASD,KAAG;AAAC,sBAAM,IAAI,MAAM,OAAO;AAAA,cAAC;AAAC,qBAAOH,GAAE,EAAE,IAAE,IAAGA,GAAE,EAAE,IAAE,KAAG,SAASF,IAAE;AAAC,oBAAIE,KAAEF,GAAE,GAAEG,KAAED,GAAE,EAAE,QAAOI,KAAE,IAAI,UAAUH,EAAC,GAAEI,KAAE,IAAI,WAAWJ,EAAC,GAAEK,KAAE,IAAI,WAAWL,EAAC,GAAEM,KAAE,IAAI,WAAWN,EAAC,GAAEO,KAAE,IAAI,YAAYP,EAAC,GAAEQ,KAAE,IAAI,YAAYR,EAAC,GAAES,MAAG,IAAI,aAAaT,EAAC,GAAE,IAAI,aAAaA,EAAC,GAAE,KAAK,OAAMU,MAAG,KAAK,QAAO,KAAK,KAAI,KAAK,QAAOC,MAAG,KAAK,KAAI,KAAK,KAAI,KAAK,OAAM,KAAK,MAAK,KAAK,OAAM,KAAK,MAAKZ,GAAE,IAAGa,KAAEb,GAAE,GAAEc,KAAEd,GAAE,GAAEe,KAAE,SAAQC,KAAE;AAAE,yBAASC,GAAEnB,IAAE;AAAC,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEG,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE;AAAE,kBAAAE,KAAEhB,KAAEgB,KAAE,KAAG;AAAE,qBAAE;AAAC,uBAAE;AAAC,yBAAE;AAAC,2BAAE;AAAC,6BAAE;AAAC,+BAAE;AAAC,iCAAE;AAAC,mCAAE;AAAC,qCAAE;AAAC,uCAAE;AAAC,yCAAE;AAAC,2CAAE;AAAC,6CAAE;AAAC,+CAAE;AAAC,mDAAIjB,MAAG,OAAK,KAAG,KAAI;AAAC,oDAAG,KAAGE,MAAGK,KAAEC,GAAE,GAAG,QAAML,MAAGO,KAAEV,OAAI,IAAE,KAAG,KAAGA,KAAE,KAAG,QAAM,IAAE,KAAG,IAAG;AAAC,kDAAAE,MAAGF,MAAGG,KAAEA,MAAG,KAAG,KAAGD,OAAI,MAAI,KAAG,OAAK,GAAEE,KAAEI,GAAER,KAAE,QAAM,CAAC,IAAG,IAAEE,QAAK,KAAGF,KAAEQ,GAAEJ,KAAE,KAAG,CAAC,OAAKI,GAAER,KAAE,MAAI,CAAC,IAAEE,IAAEM,GAAEN,KAAE,KAAG,CAAC,IAAEF,MAAGQ,GAAE,GAAG,IAAE,GAAGL,EAAC,IAAEI,IAAEP,KAAEI,KAAE,IAAE,GAAEF,KAAEC,MAAG,GAAEK,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEF,IAAEM,IAAGN,KAAEA,KAAEE,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEI,GAAEN,KAAE,KAAG,CAAC;AAAE,wDAAM;AAAA,gDAAC;AAAC,qDAAIa,KAAEP,GAAE,GAAG,OAAK,KAAGE,OAAI,EAAE,OAAM;AAAE,oDAAGR,IAAE;AAAC,kDAAAA,MAAGF,MAAGI,KAAE,GAAG,KAAGJ,MAAG,KAAGA,KAAE,KAAGG,MAAGH,MAAGE,MAAGC,MAAGH,EAAC,MAAI,KAAG,OAAK,GAAEK,KAAEG,GAAER,KAAE,QAAM,CAAC,IAAG,IAAEE,QAAK,KAAGF,KAAEQ,GAAEH,KAAE,KAAG,CAAC,OAAKG,GAAER,KAAE,MAAI,CAAC,IAAEE,IAAEM,GAAEN,KAAE,KAAG,CAAC,IAAEF,OAAIO,KAAE,GAAGH,EAAC,IAAEG,IAAEC,GAAE,GAAG,IAAED,KAAGC,GAAEH,KAAE,KAAG,CAAC,IAAE,IAAEK,IAAEN,MAAGJ,KAAEI,MAAG,KAAGM,KAAE,GAAEF,IAAGL,KAAEE,KAAEK,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEN,IAAEI,GAAER,KAAEK,MAAG,CAAC,IAAED,IAAEW,OAAIb,KAAE,QAAM,KAAGa,MAAG,GAAET,KAAEE,GAAE,GAAG,IAAGR,KAAE,MAAIe,OAAI,MAAIR,KAAEP,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEO,IAAEP,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEI,IAAEE,GAAER,KAAE,MAAI,CAAC,IAAEM,IAAEE,GAAEF,KAAE,MAAI,CAAC,IAAEJ,IAAEM,GAAEF,KAAE,KAAG,CAAC,IAAEN,KAAGA,KAAEK,KAAE,IAAE,GAAEG,GAAE,GAAG,IAAEL,IAAEK,GAAE,GAAG,IAAEJ;AAAE,wDAAM;AAAA,gDAAC;AAAC,oDAAG,EAAEU,KAAEN,GAAE,GAAG,GAAG,OAAM;AAAE,qDAAIL,KAAEK,GAAE,QAAM,GAAG,IAAEM,KAAEA,EAAC,KAAG,MAAI,CAAC,GAAER,MAAG,KAAGE,GAAEL,KAAE,KAAG,CAAC,KAAGO,KAAE,GAAER,KAAEC,KAAGH,KAAEQ,GAAEN,KAAE,MAAI,CAAC,OAAKF,KAAEQ,GAAEN,KAAE,MAAI,CAAC,KAAI,CAAAI,MAAGF,MAAGF,MAAG,KAAGM,GAAER,KAAE,KAAG,CAAC,KAAGU,KAAE,OAAK,IAAEJ,OAAI,KAAGJ,KAAEI,IAAEH,KAAEC,KAAEJ,KAAEG,IAAED,KAAEF;AAAE,oDAAGY,KAAEJ,GAAEL,KAAE,MAAI,CAAC,IAAG,KAAGC,KAAEI,GAAEL,KAAE,MAAI,CAAC,QAAM,IAAEA,KAAG;AAAC,kDAAAH,KAAEQ,GAAEL,KAAE,KAAG,CAAC,GAAEK,GAAER,KAAE,MAAI,CAAC,IAAEI,IAAEI,GAAEJ,KAAE,KAAG,CAAC,IAAEJ;AAAE,wDAAM;AAAA,gDAAC;AAAC,oDAAG,EAAEA,KAAEQ,IAAGN,KAAEC,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,sDAAG,EAAEH,KAAEQ,GAAEL,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,kDAAAD,KAAEC,KAAE,KAAG;AAAA,gDAAC;AAAC,uDAAKE,KAAEH,IAAEE,KAAEJ,KAAGA,KAAEQ,IAAGN,KAAEF,KAAE,KAAG,MAAI,CAAC,OAAKE,KAAEE,KAAE,KAAG,GAAEJ,KAAEQ,GAAEJ,KAAE,MAAI,CAAC,KAAI;AAAC,gDAAAI,GAAEH,MAAG,CAAC,IAAE;AAAE,sDAAM;AAAA,8CAAC;AAAC,kDAAGK,KAAE,IAAG,EAAEV,OAAI,IAAE,gBAAcU,KAAE,MAAIV,KAAEA,KAAE,KAAG,IAAGc,KAAEN,GAAE,GAAG,IAAG;AAAC,gDAAAF,KAAE,IAAEI,KAAE,GAAEH,KAAE,GAAEG,OAAI,IAAE,QAAMH,KAAE,IAAGG,OAAI,IAAE,aAAWH,KAAE,OAAKG,OAAI,MAAIV,KAAEa,GAAEb,OAAI,IAAE,CAAC,KAAG,MAAIA,MAAG,KAAG,KAAG;AAAI,mDAAE;AAAC,qDAAE;AAAC,wDAAGE,KAAEM,GAAE,QAAMD,MAAG,MAAI,CAAC,EAAE,MAAIP,KAAE,GAAEG,KAAEO,OAAI,OAAK,IAAEH,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,QAAK;AAAC,0DAAG,GAAGF,MAAG,KAAGG,GAAEN,KAAE,KAAG,CAAC,KAAGQ,KAAE,OAAK,KAAGJ,OAAI,MAAIF,KAAEF,IAAEI,KAAED,IAAEA,MAAI;AAAC,wDAAAC,KAAE,GAAEN,KAAEE;AAAE,8DAAM;AAAA,sDAAC;AAAC,0DAAGG,KAAEG,GAAEN,KAAE,MAAI,CAAC,GAAEA,KAAEM,GAAE,OAAKL,OAAI,KAAG,KAAGD,KAAE,MAAI,CAAC,GAAEF,KAAEK,MAAG,IAAEA,QAAK,IAAEH,MAAGF,KAAEK,KAAEL,IAAEG,OAAI,GAAE,CAACD,GAAE;AAAA,oDAAK;AAAA,wDAAM,CAAAF,KAAE;AAAE,wDAAG,EAAEA,KAAEI,KAAG;AAAC,0DAAGA,KAAE,GAAE,EAAEJ,MAAG,KAAGA,KAAE,KAAGO,MAAGP,MAAGc,IAAG,OAAM;AAAE,sDAAAd,KAAEQ,GAAE,QAAM,GAAGR,KAAE,IAAEA,EAAC,KAAG,MAAI,CAAC;AAAA,oDAAC;AAAC,wDAAG,CAACA,GAAE,OAAM;AAAA,kDAAC;AAAC,yDAAKM,MAAGH,MAAGD,MAAG,KAAGM,GAAER,KAAE,KAAG,CAAC,KAAGU,KAAE,OAAK,IAAEJ,OAAI,KAAGJ,KAAEI,IAAEF,KAAED,KAAEH,KAAEI,IAAEJ,MAAGE,KAAEM,GAAER,KAAE,MAAI,CAAC,MAAIQ,GAAER,KAAE,MAAI,CAAC,IAAG;AAAA,gDAAC;AAAC,oDAAG,EAAE,CAACI,KAAEI,GAAE,GAAG,IAAEE,OAAI,KAAGJ,OAAI,IAAG;AAAC,sDAAGC,KAAEC,GAAEJ,KAAE,MAAI,CAAC,IAAG,IAAEA,QAAK,KAAGD,KAAEK,GAAEJ,KAAE,MAAI,CAAC,KAAI;AAAC,oDAAAJ,KAAEQ,GAAEJ,KAAE,KAAG,CAAC,GAAEI,GAAER,KAAE,MAAI,CAAC,IAAEG,IAAEK,GAAEL,KAAE,KAAG,CAAC,IAAEH;AAAE,0DAAM;AAAA,kDAAC;AAAC,sDAAG,EAAEA,KAAEQ,IAAGN,KAAEE,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,wDAAG,EAAEJ,KAAEQ,GAAEJ,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,oDAAAF,KAAEE,KAAE,KAAG;AAAA,kDAAC;AAAC,yDAAKC,KAAEH,IAAEC,KAAEH,KAAGA,KAAEQ,IAAGN,KAAEF,KAAE,KAAG,MAAI,CAAC,OAAKE,KAAEC,KAAE,KAAG,GAAEH,KAAEQ,GAAEL,KAAE,MAAI,CAAC,KAAI;AAAC,kDAAAK,GAAEH,MAAG,CAAC,IAAE;AAAE,wDAAM;AAAA,gDAAC;AAAA,8CAAC;AAAA,4CAAC;AAAC,iDAAIL,KAAEQ,GAAE,GAAG,OAAK,KAAGE,OAAI,GAAE;AAAC,8CAAAN,KAAEI,GAAE,GAAG,IAAGN,KAAEF,KAAEU,KAAE,OAAK,KAAG,MAAIF,IAAGL,KAAEC,KAAEM,KAAE,KAAG,KAAG,CAAC,IAAE,IAAER,IAAEM,GAAER,KAAEI,MAAG,CAAC,IAAEF,IAAEM,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEM,OAAIF,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEJ,IAAEQ,IAAGR,KAAEA,KAAEI,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEI,GAAER,KAAE,KAAG,CAAC,GAAEG,KAAE,GAAED,KAAE,IAAGM,GAAE,GAAG,IAAEN,IAAEM,GAAE,GAAG,IAAEL,IAAEH,KAAEI,KAAE,IAAE;AAAE,oDAAM;AAAA,4CAAC;AAAC,iDAAIQ,KAAEJ,GAAE,GAAG,OAAK,IAAEE,OAAI,GAAE;AAAC,8CAAAR,KAAEU,KAAEF,KAAE,GAAEF,GAAE,GAAG,IAAEN,IAAEF,MAAGG,KAAEK,GAAE,GAAG,KAAGE,KAAE,GAAEF,GAAE,GAAG,IAAER,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,IAAEE,IAAEM,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEO,IAAEV,KAAEG,KAAE,IAAE;AAAE,oDAAM;AAAA,4CAAC;AAAC,gDAAGH,KAAE,GAAEc,KAAEJ,KAAE,KAAG,GAAEF,GAAE,GAAG,IAAEL,KAAEK,GAAE,GAAG,KAAGA,GAAE,GAAG,IAAE,IAAGA,GAAE,GAAG,IAAE,IAAGA,GAAE,GAAG,IAAE,MAAKA,GAAE,GAAG,IAAE,MAAKA,GAAE,GAAG,IAAEP,KAAE,KAAG,MAAI,YAAWO,GAAE,GAAG,IAAE,GAAEA,GAAE,GAAG,IAAE,GAAEL,KAAE,QAAOD,MAAGG,KAAES,KAAEX,KAAE,MAAIG,KAAE,IAAEH,KAAE,QAAM,KAAGO,OAAI,EAAE,OAAM;AAAE,iDAAIN,KAAEI,GAAE,GAAG,MAAIJ,OAAI,KAAGG,MAAGJ,KAAEK,GAAE,GAAG,KAAGN,KAAE,OAAK,IAAEC,OAAI,KAAGI,OAAI,EAAE,OAAM;AAAE,+CAAE;AAAC,kDAAG,EAAE,IAAEE,GAAE,IAAI,IAAG;AAAC,mDAAE;AAAC,qDAAE;AAAC,uDAAE;AAAC,yDAAE;AAAC,4DAAGL,KAAEI,GAAE,GAAG,EAAE,MAAIR,KAAE,UAAO;AAAC,+DAAIG,KAAEK,GAAER,MAAG,CAAC,OAAK,KAAGI,OAAI,IAAEA,OAAI,IAAED,KAAEK,GAAER,KAAE,KAAG,CAAC,MAAI,EAAE,OAAM;AAAE,8DAAG,EAAEA,KAAEQ,GAAER,KAAE,KAAG,CAAC,GAAG;AAAA,wDAAK;AAAC,4DAAG,OAAK,KAAGG,KAAEiB,GAAE,CAAC,IAAI,OAAM;AAAE,4DAAGb,KAAEL,KAAGF,MAAGI,KAAEI,GAAE,GAAG,KAAG,IAAE,KAAGL,OAAII,MAAGL,KAAEC,KAAE,MAAIH,KAAEG,KAAE,IAAEC,MAAG,IAAGG,OAAI,KAAGG,OAAI,EAAE,OAAM;AAAE,6DAAIN,KAAEI,GAAE,GAAG,MAAIJ,OAAI,KAAGE,MAAGN,KAAEQ,GAAE,GAAG,KAAGD,KAAE,OAAK,IAAEP,OAAI,KAAGM,OAAI,EAAE,OAAM;AAAE,6DAAI,IAAEH,QAAK,KAAGH,KAAEoB,GAAEb,EAAC,IAAI,OAAM;AAAE,8DAAM;AAAA,sDAAC;AAAC,2DAAI,KAAGJ,KAAEiB,GAAEb,KAAED,KAAED,KAAEO,EAAC,QAAMJ,GAAER,MAAG,CAAC,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,GAAG,OAAM;AAAE,sDAAAA,KAAEG;AAAA,oDAAC;AAAC,wDAAG,OAAK,IAAEH,IAAG,OAAM;AAAE,wDAAGU,KAAE,OAAK,KAAGH,OAAI,GAAE;AAAC,sDAAAJ,KAAEH;AAAE,4DAAM;AAAA,oDAAC;AAAC,wDAAG,OAAK,IAAEoB,GAAEjB,MAAGA,KAAEK,GAAE,GAAG,MAAIM,KAAEP,KAAE,KAAG,IAAEJ,EAAC,GAAG,OAAM;AAAE,oDAAAI,KAAEJ,KAAEI,KAAE,GAAEJ,KAAEH;AAAE,0DAAM;AAAA,kDAAC;AAAC,sDAAG,OAAK,IAAEG,IAAG,OAAM;AAAA,gDAAC;AAAC,gDAAAK,GAAE,GAAG,IAAE,IAAEA,GAAE,GAAG;AAAA,8CAAC;AAAC,kDAAG,OAAK,KAAGL,KAAEiB,GAAElB,EAAC,MAAI,OAAK,KAAGF,KAAEoB,GAAE,CAAC,MAAIpB,OAAI,KAAGG,OAAI,EAAE,OAAM;AAAE,mDAAII,KAAEP,KAAEG,KAAE,OAAK,KAAGO,KAAE,OAAK,EAAE,OAAM;AAAA,4CAAC;AAAC,4CAAAV,KAAEQ,GAAE,GAAG,IAAED,KAAE,GAAEC,GAAE,GAAG,IAAER,IAAEA,OAAI,IAAEW,GAAE,GAAG,MAAIH,GAAE,GAAG,IAAER;AAAG,+CAAE;AAAC,kDAAGK,KAAEG,GAAE,GAAG,GAAE;AAAC,qDAAIR,KAAE,UAAO;AAAC,wDAAKI,KAAEI,GAAER,MAAG,CAAC,MAAIE,KAAEM,GAAER,KAAE,KAAG,CAAC,KAAG,OAAK,IAAEG,IAAG,OAAM;AAAE,sDAAG,EAAEH,KAAEQ,GAAER,KAAE,KAAG,CAAC,GAAG;AAAA,gDAAK;AAAC,sDAAM;AAAA,8CAAC;AAAC,oDAAKA,KAAEQ,GAAE,GAAG,OAAK,KAAGL,OAAI,KAAGH,OAAIQ,GAAE,GAAG,IAAEL,KAAGH,KAAE,GAAEQ,GAAE,GAAG,IAAED,IAAEC,GAAE,GAAG,IAAEL,IAAEK,GAAE,GAAG,IAAE,IAAGA,GAAE,GAAG,IAAEA,GAAE,GAAG,GAAEA,GAAE,GAAG,IAAE,GAAEN,MAAGE,KAAEJ,MAAG,KAAG,OAAK,GAAEQ,GAAEJ,KAAE,QAAM,CAAC,IAAEF,IAAEM,GAAEJ,KAAE,QAAM,CAAC,IAAEF,IAAE,OAAK,KAAGF,KAAEA,KAAE,IAAE,MAAK;AAAC,8CAAAE,MAAGE,KAAEG,KAAE,KAAG,MAAIP,KAAEG,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAG,GAAEK,GAAE,GAAG,IAAEN,IAAEF,KAAEA,KAAEG,KAAE,GAAEK,GAAE,GAAG,IAAER,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,IAAEE,IAAEM,GAAE,KAAGL,KAAEC,KAAE,MAAI,CAAC,IAAE,IAAGI,GAAE,GAAG,IAAEA,GAAE,GAAG;AAAE,oDAAM;AAAA,4CAAC;AAAC,gDAAG,IAAEA,GAAER,KAAE,MAAI,CAAC,IAAEG,OAAI,KAAGE,OAAI,IAAED,OAAI,IAAEC,OAAI,EAAE,OAAM;AAAE,4CAAAG,GAAER,KAAE,KAAG,CAAC,IAAEE,KAAEK,IAAEJ,MAAGH,KAAEK,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAGA,KAAE,GAAEG,GAAE,GAAG,IAAEL,IAAEH,MAAGE,KAAEM,GAAE,GAAG,IAAED,KAAE,KAAGP,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,GAAE,KAAGN,KAAEG,KAAE,MAAI,CAAC,IAAE,IAAGG,GAAE,GAAG,IAAEA,GAAE,GAAG;AAAE,kDAAM;AAAA,0CAAC;AAAC,0CAAAJ,KAAE;AAAE,gDAAM;AAAA,wCAAC;AAAC,wCAAAD,KAAE;AAAE,8CAAM;AAAA,sCAAC;AAAC,sCAAAQ,GAAE,GAAG,IAAER,OAAI,MAAIK,GAAE,GAAG,IAAEL,KAAGD,KAAEC,KAAEI,KAAE,GAAEP,KAAE;AAAK,yCAAE;AAAC,2CAAE;AAAC,6CAAE;AAAC,uDAAO;AAAC,mDAAI,IAAEE,OAAIM,GAAER,MAAG,CAAC,GAAE;AAAC,oDAAGA,KAAEQ,GAAER,KAAE,KAAG,CAAC,EAAE;AAAS,sDAAM;AAAA,8CAAC;AAAC;AAAA,4CAAK;AAAC,gDAAG,EAAE,IAAES,GAAET,KAAE,KAAG,CAAC,GAAG,OAAM;AAAA,0CAAC;AAAC,+CAAIA,KAAE,UAAO;AAAC,iDAAIE,KAAEM,GAAER,MAAG,CAAC,OAAK,KAAGK,OAAI,MAAIC,KAAEJ,KAAEM,GAAER,KAAE,KAAG,CAAC,IAAE,OAAK,IAAEK,OAAI,EAAE,OAAM;AAAE,4CAAAL,KAAEQ,GAAER,KAAE,KAAG,CAAC;AAAA,0CAAC;AAAA,wCAAC;AAAC,4CAAGQ,GAAER,MAAG,CAAC,IAAEG,IAAEK,GAAER,KAAE,KAAG,CAAC,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAEO,IAAEC,IAAGM,MAAGX,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAGA,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEO,IAAEV,MAAGO,KAAEL,MAAGA,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAG,MAAIU,KAAEF,KAAEI,KAAE,KAAG,IAAG,IAAET,QAAK,IAAEE,KAAG;AAAC,0CAAAC,GAAE,GAAG,IAAEI,IAAEZ,KAAEQ,GAAE,GAAG,IAAER,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEI,KAAE,KAAG,CAAC,IAAE,IAAEZ;AAAE,gDAAM;AAAA,wCAAC;AAAC,4CAAGQ,GAAE,GAAG,MAAI,IAAED,KAAG;AAAC,0CAAAC,GAAE,GAAG,IAAEI,IAAEZ,KAAEQ,GAAE,GAAG,IAAER,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEI,KAAE,KAAG,CAAC,IAAE,IAAEZ,IAAEQ,GAAER,KAAEY,MAAG,CAAC,IAAEZ;AAAE,gDAAM;AAAA,wCAAC;AAAC,4CAAG,MAAI,KAAGM,KAAEE,GAAED,KAAE,KAAG,CAAC,IAAI,OAAM;AAAE,4CAAGF,KAAE,KAAGC,IAAEA,OAAI,KAAG,KAAI;AAAC,+CAAI,KAAGH,KAAEK,GAAED,KAAE,MAAI,CAAC,QAAM,KAAGL,KAAEM,GAAED,KAAE,KAAG,CAAC,KAAI;AAAC,4CAAAC,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGF,OAAI,IAAE,CAAC;AAAE,kDAAM;AAAA,0CAAC;AAAC,0CAAAE,GAAEN,KAAE,MAAI,CAAC,IAAEC,IAAEK,GAAEL,KAAE,KAAG,CAAC,IAAED;AAAE,gDAAM;AAAA,wCAAC;AAAC,4CAAGQ,KAAEF,GAAED,KAAE,MAAI,CAAC,IAAG,IAAEA,QAAK,KAAGJ,KAAEK,GAAED,KAAE,MAAI,CAAC,KAAI;AAAC,0CAAAL,KAAEM,GAAED,KAAE,KAAG,CAAC,GAAEC,GAAEN,KAAE,MAAI,CAAC,IAAEC,IAAEK,GAAEL,KAAE,KAAG,CAAC,IAAED;AAAE,gDAAM;AAAA,wCAAC;AAAC,4CAAG,EAAEI,KAAEE,IAAGN,KAAEK,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,8CAAG,EAAED,KAAEE,GAAED,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,0CAAAL,KAAEK,KAAE,KAAG;AAAA,wCAAC;AAAC,+CAAKH,KAAEF,KAAGI,KAAEE,IAAGN,MAAGC,KAAEG,MAAG,KAAG,MAAI,CAAC,OAAKJ,KAAEC,KAAE,KAAG,GAAEG,KAAEE,GAAEL,KAAE,MAAI,CAAC,KAAI;AAAC,wCAAAK,GAAEJ,MAAG,CAAC,IAAE;AAAE,8CAAM;AAAA,sCAAC;AAAC,2CAAIF,MAAGE,KAAEG,KAAE,KAAG,MAAIP,KAAEG,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAG,GAAEK,GAAE,GAAG,IAAEN,IAAEF,KAAEA,KAAEG,KAAE,GAAEK,GAAE,GAAG,IAAER,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,IAAEE,IAAEM,GAAE,KAAGL,KAAEC,KAAE,MAAI,CAAC,IAAE,IAAGI,GAAE,GAAG,IAAEA,GAAE,GAAG,GAAEA,IAAGJ,MAAGJ,MAAGM,MAAGA,KAAE,KAAG,IAAE,KAAGA,KAAE,IAAE,KAAG,KAAG,KAAG,OAAK,IAAED,KAAE,OAAK,IAAEA,KAAEL,MAAG,KAAG,CAAC,IAAE,IAAGA,KAAEQ,GAAE,GAAG,GAAEA,GAAEJ,KAAE,MAAI,CAAC,IAAEI,GAAE,GAAG,GAAEA,GAAEJ,KAAE,MAAI,CAAC,IAAEJ,IAAEA,KAAEQ,GAAE,GAAG,GAAEA,GAAEJ,KAAE,KAAG,CAAC,IAAEI,GAAE,GAAG,GAAEA,GAAEJ,KAAE,MAAI,CAAC,IAAEJ,IAAEQ,GAAE,GAAG,IAAEJ,KAAE,GAAEI,GAAE,GAAG,IAAED,IAAEC,GAAE,GAAG,IAAEL,IAAEK,GAAE,GAAG,IAAE,GAAER,KAAEI,KAAE,KAAG,GAAEI,GAAER,KAAE,KAAG,CAAC,IAAE,GAAEE,KAAEF,KAAE,IAAE,GAAEA,KAAEA,KAAE,IAAE,GAAEE,OAAI,IAAEI,OAAI,IAAG;AAAC,2CAAI,IAAEF,QAAK,IAAEC,IAAG,KAAGG,GAAEJ,KAAE,KAAG,CAAC,IAAE,KAAGI,GAAEJ,KAAE,KAAG,CAAC,GAAEE,KAAEF,KAAEC,KAAE,GAAEG,GAAEH,KAAE,KAAG,CAAC,IAAE,IAAEC,IAAEE,GAAEJ,MAAG,CAAC,IAAEE,IAAEA,OAAI,KAAG,IAAI,CAAAJ,KAAE,QAAM,KAAGI,MAAG,IAAGH,KAAEK,GAAE,GAAG,MAAIR,KAAE,MAAIM,OAAI,MAAIN,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEG,IAAEH,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL;AAAA,2CAAM;AAAC,wCAAAA,KAAE,IAAGM,OAAI,KAAG,aAAWN,KAAE,OAAKM,OAAI,MAAIN,KAAEa,GAAEP,OAAI,IAAE,CAAC,KAAG,MAAIN,MAAG,KAAG,KAAG,IAAGQ,GAAEH,KAAE,MAAI,CAAC,IAAEL,IAAEQ,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEG,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEH,KAAE,QAAMF,MAAG,KAAG;AAAE,2CAAE;AAAC,+CAAII,KAAEI,GAAE,GAAG,MAAIL,KAAE,KAAGH,KAAG;AAAC,iDAAIA,KAAEM,OAAI,OAAK,IAAEN,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,IAAGI,KAAEI,GAAEN,MAAG,CAAC,OAAI;AAAC,mDAAI,IAAEI,QAAK,KAAGE,IAAGN,KAAEE,MAAG,KAAG,CAAC,GAAG,OAAM;AAAE,kDAAGD,KAAEH,OAAI,KAAG,GAAEA,OAAI,GAAE,EAAEI,KAAEI,IAAGL,MAAG,IAAEA,MAAGD,KAAE,KAAG,MAAI,CAAC,GAAG;AAAA,4CAAK;AAAC,4CAAAM,GAAEL,KAAE,MAAI,CAAC,IAAEE;AAAA,0CAAC,MAAM,CAAAG,GAAE,GAAG,IAAEL,KAAEC,IAAEI,GAAEN,MAAG,CAAC,IAAEG;AAAE,0CAAAG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,MAAI,CAAC,IAAEA,IAAEG,GAAEH,KAAE,KAAG,CAAC,IAAEA;AAAE,gDAAM;AAAA,wCAAC;AAAC,wCAAAL,KAAEQ,GAAEN,KAAE,KAAG,CAAC,GAAEM,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL;AAAA,sCAAC;AAAA,oCAAC;AAAC,wCAAG,GAAGA,KAAEQ,GAAE,GAAG,OAAK,KAAGE,OAAI,IAAG;AAAC,sCAAAR,KAAEF,KAAEU,KAAE,GAAEF,GAAE,GAAG,IAAEN,IAAEF,MAAGG,KAAEK,GAAE,GAAG,KAAGE,KAAE,GAAEF,GAAE,GAAG,IAAER,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,IAAEE,IAAEM,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEO,IAAEV,KAAEG,KAAE,IAAE;AAAE,4CAAM;AAAA,oCAAC;AAAA,kCAAC;AAAC,kCAAAK,GAAE,GAAG,IAAE,IAAGR,KAAE;AAAE,wCAAM;AAAA,gCAAC;AAAC,gCAAAG,KAAE;AAAA,8BAAC;AAAC,kCAAGO,IAAE;AAAC,gCAAAN,KAAEI,GAAED,KAAE,MAAI,CAAC;AAAE,mCAAE;AAAC,sCAAGC,IAAGN,KAAE,QAAME,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEG,KAAG;AAAC,wCAAGC,GAAEN,MAAG,CAAC,IAAEC,IAAEA,GAAE,OAAM;AAAE,oCAAAK,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGJ,EAAC;AAAE,0CAAM;AAAA,kCAAC;AAAC,sCAAGI,GAAEE,MAAGF,GAAEE,KAAE,MAAI,CAAC,MAAI,IAAEH,MAAG,KAAG,OAAK,CAAC,IAAEJ,IAAE,CAACA,GAAE,OAAM;AAAA,gCAAC;AAAC,gCAAAK,GAAEL,KAAE,MAAI,CAAC,IAAEO,KAAGR,KAAEM,GAAED,KAAE,MAAI,CAAC,OAAKC,GAAEL,KAAE,MAAI,CAAC,IAAED,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAEC,MAAID,KAAEM,GAAED,KAAE,MAAI,CAAC,OAAKC,GAAEL,KAAE,MAAI,CAAC,IAAED,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAEC;AAAA,8BAAE;AAAA,4BAAC;AAAC,4BAAAH,KAAEA,KAAEK,KAAE,GAAEC,KAAEE,IAAGD,KAAEF,KAAEE,KAAE,KAAG,KAAG,CAAC;AAAA,0BAAC;AAAC,8BAAGC,GAAED,KAAE,KAAG,CAAC,IAAE,KAAGD,IAAEE,GAAEI,KAAE,KAAG,CAAC,IAAE,IAAEZ,IAAEQ,GAAER,KAAEY,MAAG,CAAC,IAAEZ,IAAEA,OAAI,KAAG,IAAI,CAAAE,KAAE,QAAM,KAAGF,MAAG,IAAGG,KAAEK,GAAE,GAAG,MAAIR,KAAE,MAAIA,OAAI,MAAIA,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEG,IAAEH,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEU,IAAEJ,GAAER,KAAE,MAAI,CAAC,IAAEY,IAAEJ,GAAEI,KAAE,MAAI,CAAC,IAAEV,IAAEM,GAAEI,KAAE,KAAG,CAAC,IAAEZ;AAAA,+BAAM;AAAC,4BAAAM,KAAE,IAAGN,OAAI,KAAG,aAAWM,KAAE,OAAKN,OAAI,MAAIE,KAAEW,GAAEb,OAAI,IAAE,CAAC,KAAG,MAAIE,MAAG,KAAG,KAAG,IAAGM,GAAEI,KAAE,MAAI,CAAC,IAAEN,IAAEE,GAAEI,KAAE,MAAI,CAAC,IAAE,GAAEJ,GAAEI,KAAE,MAAI,CAAC,IAAE,GAAEV,KAAE,QAAMI,MAAG,KAAG;AAAE,+BAAE;AAAC,mCAAIF,KAAEI,GAAE,GAAG,MAAIL,KAAE,KAAGG,KAAG;AAAC,qCAAIA,KAAEN,OAAI,OAAK,IAAEM,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,IAAGH,KAAEK,GAAEN,MAAG,CAAC,OAAI;AAAC,sCAAGA,KAAEC,KAAG,KAAGK,GAAEL,KAAE,KAAG,CAAC,OAAK,IAAEH,IAAG,OAAM;AAAE,sCAAGG,KAAEG,OAAI,KAAG,GAAEA,OAAI,GAAE,EAAEH,KAAEK,IAAGJ,MAAG,IAAED,MAAGD,KAAE,KAAG,MAAI,CAAC,GAAG;AAAA,gCAAK;AAAC,gCAAAM,GAAEJ,KAAE,MAAI,CAAC,IAAEQ;AAAA,8BAAC,MAAM,CAAAJ,GAAE,GAAG,IAAEL,KAAEC,IAAEI,GAAEN,MAAG,CAAC,IAAEU;AAAE,8BAAAJ,GAAEI,KAAE,MAAI,CAAC,IAAEV,IAAEM,GAAEI,KAAE,MAAI,CAAC,IAAEA,IAAEJ,GAAEI,KAAE,KAAG,CAAC,IAAEA;AAAE,oCAAM;AAAA,4BAAC;AAAC,4BAAAZ,KAAEQ,GAAEN,KAAE,KAAG,CAAC,GAAEM,GAAER,KAAE,MAAI,CAAC,IAAEY,IAAEJ,GAAEN,KAAE,KAAG,CAAC,IAAEU,IAAEJ,GAAEI,KAAE,MAAI,CAAC,IAAE,GAAEJ,GAAEI,KAAE,MAAI,CAAC,IAAEV,IAAEM,GAAEI,KAAE,KAAG,CAAC,IAAEZ;AAAA,0BAAC;AAAA,wBAAC;AAAC,wBAAAA,KAAEc,KAAE,IAAE;AAAE,8BAAM;AAAA,sBAAC;AAAC,wBAAE,KAAGP,IAAE;AAAC,wBAAAL,KAAEM,GAAEJ,KAAE,MAAI,CAAC;AAAE,2BAAE;AAAC,8BAAGI,IAAGR,KAAE,QAAME,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEE,KAAG;AAAC,gCAAGI,GAAER,MAAG,CAAC,IAAEG,IAAEA,GAAE,OAAM;AAAE,4BAAAW,KAAE,GAAGZ,EAAC,IAAEY,IAAEN,GAAE,GAAG,IAAEM;AAAE,kCAAM;AAAA,0BAAC;AAAC,8BAAGN,GAAED,MAAGC,GAAED,KAAE,MAAI,CAAC,MAAI,IAAEH,MAAG,KAAG,OAAK,CAAC,IAAED,IAAE,CAACA,GAAE,OAAM;AAAA,wBAAC;AAAC,wBAAAK,GAAEL,KAAE,MAAI,CAAC,IAAEI,KAAGP,KAAEQ,GAAEJ,KAAE,MAAI,CAAC,OAAKI,GAAEL,KAAE,MAAI,CAAC,IAAEH,IAAEQ,GAAER,KAAE,MAAI,CAAC,IAAEG,MAAIH,KAAEQ,GAAEJ,KAAE,MAAI,CAAC,OAAKI,GAAEL,KAAE,MAAI,CAAC,IAAEH,IAAEQ,GAAER,KAAE,MAAI,CAAC,IAAEG;AAAA,sBAAE;AAAC,wBAAE,KAAGG,OAAI,KAAG,GAAG,CAAAN,KAAEM,KAAEI,KAAE,GAAEF,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEJ,IAAEQ,IAAGR,KAAEA,KAAEI,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEI,GAAER,KAAE,KAAG,CAAC;AAAA,+BAAUQ,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEM,IAAEF,IAAGH,KAAED,KAAEM,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEJ,IAAEE,GAAEH,KAAEC,MAAG,CAAC,IAAEA,IAAEA,OAAI,KAAG,IAAI,CAAAJ,KAAE,QAAM,KAAGI,MAAG,IAAGH,KAAEK,GAAE,GAAG,MAAIR,KAAE,MAAIM,OAAI,MAAIN,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEG,IAAEH,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL;AAAA,2BAAM;AAAC,wBAAAA,KAAE,IAAGM,OAAI,KAAG,aAAWN,KAAE,OAAKM,OAAI,MAAIN,KAAEa,GAAEP,OAAI,IAAE,CAAC,KAAG,MAAIN,MAAG,KAAG,KAAG,IAAGQ,GAAEH,KAAE,MAAI,CAAC,IAAEL,IAAEQ,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEG,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEH,KAAE,QAAMF,MAAG,KAAG;AAAE,2BAAE;AAAC,+BAAIG,KAAE,KAAGH,MAAGc,IAAE;AAAC,iCAAId,KAAEM,OAAI,OAAK,IAAEN,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,IAAGU,KAAEF,GAAEN,MAAG,CAAC,OAAI;AAAC,mCAAI,KAAGM,IAAGN,KAAEQ,MAAG,KAAG,CAAC,OAAK,IAAEJ,IAAG,OAAM;AAAE,kCAAGH,KAAEH,OAAI,KAAG,GAAEA,OAAI,GAAE,EAAEU,KAAEF,IAAGL,MAAG,IAAEA,MAAGD,KAAE,KAAG,MAAI,CAAC,GAAG;AAAA,4BAAK;AAAC,4BAAAM,GAAEL,KAAE,MAAI,CAAC,IAAEE;AAAA,0BAAC,MAAM,CAAAG,GAAE,GAAG,IAAEL,KAAEW,IAAEN,GAAEN,MAAG,CAAC,IAAEG;AAAE,0BAAAG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,MAAI,CAAC,IAAEA,IAAEG,GAAEH,KAAE,KAAG,CAAC,IAAEA;AAAE,gCAAM;AAAA,wBAAC;AAAC,wBAAAL,KAAEQ,GAAEN,KAAE,KAAG,CAAC,GAAEM,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL;AAAA,sBAAC;AAAC,sBAAAA,KAAEI,KAAE,IAAE;AAAE,4BAAM;AAAA,oBAAC;AAAC,sBAAE,KAAGQ,IAAE;AAAC,sBAAAV,KAAEM,GAAEL,KAAE,MAAI,CAAC;AAAE,yBAAE;AAAC,4BAAGK,IAAGR,KAAE,QAAME,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEC,KAAG;AAAC,8BAAGK,GAAER,MAAG,CAAC,IAAEI,IAAEA,GAAE,OAAM;AAAE,0BAAAI,GAAE,GAAG,IAAE,GAAGN,EAAC,IAAEY;AAAE,gCAAM;AAAA,wBAAC;AAAC,4BAAGN,GAAEI,MAAGJ,GAAEI,KAAE,MAAI,CAAC,MAAI,IAAET,MAAG,KAAG,OAAK,CAAC,IAAEC,IAAE,CAACA,GAAE,OAAM;AAAA,sBAAC;AAAC,sBAAAI,GAAEJ,KAAE,MAAI,CAAC,IAAEQ,KAAGZ,KAAEQ,GAAEL,KAAE,MAAI,CAAC,OAAKK,GAAEJ,KAAE,MAAI,CAAC,IAAEJ,IAAEQ,GAAER,KAAE,MAAI,CAAC,IAAEI,MAAIJ,KAAEQ,GAAEL,KAAE,MAAI,CAAC,OAAKK,GAAEJ,KAAE,MAAI,CAAC,IAAEJ,IAAEQ,GAAER,KAAE,MAAI,CAAC,IAAEI;AAAA,oBAAE;AAAC,oBAAAE,OAAI,KAAG,MAAIN,KAAEM,KAAEI,KAAE,GAAEF,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,IAAGR,KAAEA,KAAEG,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEK,GAAER,KAAE,KAAG,CAAC,MAAIQ,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEO,IAAEF,IAAGJ,KAAED,KAAEO,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEJ,IAAEE,GAAEJ,KAAEE,MAAG,CAAC,IAAEA,IAAES,OAAIb,KAAE,QAAM,KAAGa,MAAG,GAAEV,KAAEG,GAAE,GAAG,IAAGR,KAAE,MAAIe,OAAI,MAAIR,KAAEP,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEO,IAAEP,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL,KAAGQ,GAAE,GAAG,IAAEJ,IAAEI,GAAE,GAAG,IAAEF,KAAGN,KAAEG,KAAE,IAAE;AAAA,kBAAC;AAAC,yBAAOc,KAAEhB,KAAE,KAAG,GAAE,IAAED;AAAA,gBAAC;AAAC,yBAASqB,GAAErB,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEzB,KAAE,GAAE0B,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG;AAAE,uBAAIzB,KAAEtC,GAAER,KAAE,OAAK,CAAC,GAAE+C,KAAEvC,GAAER,KAAE,OAAK,CAAC,GAAEgC,KAAExB,GAAER,KAAE,OAAK,CAAC,GAAEgD,KAAExC,GAAER,KAAE,OAAK,CAAC,GAAEiD,KAAEzC,GAAER,KAAE,OAAK,CAAC,GAAEkD,KAAE1C,GAAER,KAAE,OAAK,CAAC,GAAEiC,KAAEzB,GAAER,KAAE,OAAK,CAAC,GAAEmD,KAAE3C,GAAER,KAAE,OAAK,CAAC,GAAEqB,KAAEb,GAAER,KAAE,OAAK,CAAC,GAAE4D,MAAGpD,GAAER,KAAE,OAAK,CAAC,GAAEoD,KAAE5C,GAAER,KAAE,OAAK,CAAC,GAAE6D,MAAGrD,GAAER,KAAE,OAAK,CAAC,GAAEqD,MAAG7C,GAAER,KAAE,OAAK,CAAC,GAAEsD,MAAG9C,GAAER,KAAE,OAAK,CAAC,GAAEkC,KAAE1B,GAAER,KAAE,OAAK,CAAC,GAAEmC,KAAE3B,GAAER,KAAE,OAAK,CAAC,GAAEoC,KAAE5B,GAAER,KAAE,OAAK,CAAC,GAAE8D,MAAGtD,GAAER,KAAE,OAAK,CAAC,GAAEuD,MAAG/C,GAAER,KAAE,OAAK,CAAC,GAAE+D,MAAGvD,GAAER,KAAE,OAAK,CAAC,GAAEqC,KAAE7B,GAAER,KAAE,OAAK,CAAC,GAAEsC,KAAE9B,GAAER,KAAE,OAAK,CAAC,GAAEe,KAAEP,GAAER,KAAE,OAAK,CAAC,GAAE4B,KAAEpB,GAAER,KAAE,OAAK,CAAC,GAAEuC,KAAE/B,GAAER,KAAE,MAAI,CAAC,GAAEwC,KAAEhC,GAAER,KAAE,OAAK,CAAC,GAAEU,KAAEF,GAAER,KAAE,MAAI,CAAC,GAAE6B,KAAErB,GAAER,KAAE,MAAI,CAAC,GAAEO,KAAEC,GAAER,KAAE,MAAI,CAAC,GAAEyC,KAAEjC,GAAER,KAAE,MAAI,CAAC,GAAEM,KAAEE,GAAER,KAAE,MAAI,CAAC,GAAE0C,KAAElC,GAAER,KAAE,MAAI,CAAC,GAAEa,KAAEL,GAAER,KAAE,MAAI,CAAC,GAAEmB,KAAEX,GAAER,KAAE,MAAI,CAAC,GAAEsB,KAAEd,GAAER,KAAE,MAAI,CAAC,GAAEc,KAAEN,GAAER,KAAE,MAAI,CAAC,GAAEE,KAAEM,GAAER,KAAE,MAAI,CAAC,GAAEwD,MAAGhD,GAAER,KAAE,MAAI,CAAC,GAAEI,KAAEI,GAAER,KAAE,MAAI,CAAC,GAAEgB,KAAER,GAAER,KAAE,MAAI,CAAC,GAAEuB,KAAEf,GAAER,KAAE,MAAI,CAAC,GAAE2C,KAAEnC,GAAER,KAAE,MAAI,CAAC,GAAEY,KAAEJ,GAAER,KAAE,MAAI,CAAC,GAAEwB,KAAEhB,GAAER,KAAE,MAAI,CAAC,GAAEW,KAAEH,GAAER,KAAE,MAAI,CAAC,GAAE8B,KAAEtB,GAAER,KAAE,MAAI,CAAC,GAAEG,KAAEK,GAAER,KAAE,KAAG,CAAC,GAAEyB,KAAEjB,GAAER,KAAE,MAAI,CAAC,GAAES,KAAED,GAAER,MAAG,CAAC,GAAE0B,KAAElB,GAAER,KAAE,KAAG,CAAC,GAAEuE,QAAK,KAAG,KAAI,CAAAtE,KAAEW,KAAEC,KAAEE,KAAEiB,KAAEqB,KAAGT,KAAE4B,GAAEvD,KAAER,KAAEL,KAAEG,KAAEc,KAAEkC,KAAG5B,KAAED,KAAEV,KAAEyB,KAAEmB,MAAGG,KAAG,CAAC,IAAE9D,IAAEI,KAAEmE,GAAEjD,KAAEqB,IAAED,MAAGE,MAAGmB,MAAGxC,KAAEL,KAAES,KAAEoB,KAAEM,OAAIpC,KAAG,EAAE,GAAE+C,MAAG/C,IAAEuC,MAAG1B,KAAED,KAAEhB,KAAE0B,KAAEL,KAAEe,IAAEnB,KAAEyC,GAAEpD,KAAET,KAAEW,KAAEiB,KAAEL,KAAEe,IAAElB,IAAE,CAAC,IAAEd,IAAEA,KAAEuD,GAAE9D,KAAEqB,IAAEF,MAAG6B,MAAGxC,KAAES,KAAG,EAAE,GAAEuC,MAAGhD,IAAEyC,MAAGhC,KAAEF,KAAE+B,MAAG3B,KAAEsB,KAAEW,KAAGK,MAAG5C,KAAEjB,KAAE+B,KAAES,KAAEM,IAAE7B,KAAEiD,GAAEH,MAAGlE,KAAED,KAAEQ,KAAEuB,KAAEG,IAAET,IAAE,CAAC,IAAEwC,KAAGxC,KAAE6C,GAAE7C,KAAEvB,KAAEmB,IAAEP,MAAGa,MAAGzB,KAAEuC,KAAED,KAAEJ,KAAES,KAAEc,OAAI3C,KAAG,EAAE,GAAEkD,MAAGlD,IAAER,KAAE8D,GAAErE,KAAE4B,IAAEN,KAAEiC,KAAG,CAAC,GAAEjC,KAAEP,IAAEF,KAAEwD,GAAEL,KAAG/D,IAAE,CAAC,IAAEgB,IAAEL,KAAEyD,GAAExD,KAAED,KAAGK,KAAEQ,OAAIA,KAAEV,KAAEuC,MAAI,EAAE,GAAEA,MAAGvC,IAAEyB,KAAE6B,GAAEvE,IAAE+D,KAAG,CAAC,IAAEK,KAAGlE,KAAEqE,GAAE7B,KAAErB,KAAGF,KAAEN,OAAIA,KAAEI,KAAEyC,MAAI,CAAC,GAAEK,MAAG9C,IAAEI,KAAEkD,GAAE5D,KAAEI,IAAEQ,KAAEI,IAAE,EAAE,GAAEJ,KAAEN,IAAEX,KAAEiE,GAAEjE,KAAEgB,IAAEM,KAAEY,IAAE,CAAC,GAAEA,KAAEvB,IAAEjB,KAAEuE,GAAElE,KAAEsC,IAAEF,KAAEG,IAAE,EAAE,GAAEzB,KAAER,KAAEM,IAAEZ,KAAEkE,GAAE7D,KAAEgC,IAAE7B,KAAEgB,IAAE,EAAE,GAAEY,KAAExB,IAAEmB,KAAEmC,GAAEnC,KAAEO,IAAEN,KAAEO,IAAE,EAAE,GAAEP,KAAEpB,IAAEd,KAAEoE,GAAE3D,KAAEG,IAAEG,KAAES,IAAE,EAAE,GAAEE,KAAEnB,KAAEO,IAAEC,KAAEX,IAAGK,MAAGwD,MAAGE,OAAI,KAAG,OAAK,MAAI,CAAC,GAAE1D,KAAEL,GAAEK,KAAE,KAAG,CAAC,GAAE0B,KAAEiC,GAAEjC,KAAEI,IAAE7B,KAAE0B,IAAE,EAAE,GAAEA,KAAEtB,IAAEhB,KAAEsE,GAAEtE,KAAE6B,IAAEyB,MAAGE,KAAG,EAAE,GAAEY,MAAG3D,MAAG,MAAIe,MAAGG,OAAI,MAAI2B,MAAGtC,OAAIsB,KAAE3B,OAAI,MAAI,KAAGF,MAAG2B,KAAEI,OAAI,MAAI,KAAG9B,MAAG6B,KAAEjB,OAAI,MAAI,KAAG4C,OAAIF,MAAGD,QAAK,MAAI,KAAGD,OAAIP,MAAGhC,KAAGZ,KAAE2D,GAAErD,MAAG,MAAIwC,MAAGlD,KAAEc,OAAI,KAAGrB,MAAGqC,KAAEpB,OAAI,MAAI,KAAGf,MAAGiC,KAAE/B,OAAI,MAAI,KAAGL,MAAGM,KAAEe,OAAI,MAAI,KAAGK,MAAGV,KAAEZ,OAAI,MAAI,KAAGF,MAAGY,KAAEL,KAAGC,IAAE,CAAC,GAAEC,KAAEM,IAAEgB,KAAEsC,GAAEtC,KAAES,IAAE7B,KAAEqB,IAAE,EAAE,GAAEA,KAAEjB,IAAEc,KAAEwC,GAAExD,KAAEgB,IAAEJ,KAAEoB,IAAE,EAAE,GAAEmB,MAAGjD,IAAEmC,MAAGmB,GAAExD,KAAEqC,KAAGzB,KAAE0B,KAAG,EAAE,GAAEN,KAAE9B,IAAE4B,KAAE0B,GAAE1B,KAAEF,IAAEG,KAAEF,IAAE,EAAE,GAAES,MAAGpC,IAAEqC,MAAGiB,GAAEjD,KAAEgC,KAAG1B,KAAEkC,KAAG,EAAE,GAAEhB,KAAE7B,IAAEP,KAAE6D,GAAEvC,KAAEF,IAAEoB,KAAEO,KAAG,CAAC,GAAEjD,KAAES,IAAEkC,KAAEoB,GAAEpB,KAAER,IAAEC,KAAEgB,KAAG,CAAC,GAAEV,KAAEjC,IAAEe,KAAEuC,GAAEnD,KAAEE,IAAEM,KAAE+B,KAAG,EAAE,GAAErC,KAAEL,IAAEG,KAAEmD,GAAEpC,KAAEL,IAAE2B,MAAGI,KAAG,EAAE,GAAE1B,KAAElB,IAAE,MAAI,KAAGc,MAAG3B,KAAE6B,IAAElB,MAAG,KAAG8B,MAAGa,MAAGN,KAAGQ,OAAI,KAAGlD,MAAGL,KAAEiD,KAAG1B,MAAG,KAAGI,MAAGvB,KAAE0C,IAAEH,KAAEuB,GAAE7B,KAAEM,IAAEnC,KAAEoC,IAAE,EAAE,GAAE5C,KAAEkE,IAAG3D,MAAGiD,MAAG,KAAG9C,KAAE6C,MAAGhC,MAAG+B,OAAI,KAAGX,MAAG3B,KAAED,QAAK0C,OAAI,KAAGzD,MAAGF,KAAEO,MAAIC,MAAG,MAAI,MAAI,KAAGuD,OAAIF,MAAG9B,OAAI,MAAI,KAAGmB,OAAI5B,KAAEsB,OAAIpB,MAAG,KAAGnB,MAAGiC,KAAEK,OAAIjC,MAAG,KAAGS,MAAGE,KAAE0B,OAAI,MAAI,MAAID,KAAEhC,OAAIM,KAAEY,QAAKM,MAAG,KAAGA,MAAGZ,KAAErB,KAAG,EAAE,GAAEmC,KAAE1B,IAAE,KAAGT,MAAG,KAAGgD,OAAI,KAAGN,MAAG5B,OAAI,KAAGiB,MAAG,KAAGQ,MAAGM,QAAK,MAAI,KAAGP,MAAGtC,KAAE6B,OAAI,KAAGG,MAAG,KAAGL,MAAGc,OAAI,MAAI,KAAGf,MAAGgC,MAAGD,MAAIzD,KAAE+D,GAAE,MAAI,KAAGzD,MAAG,KAAGqC,MAAGnB,OAAI,KAAGM,MAAG,KAAGc,OAAIP,OAAI,MAAI,KAAGS,OAAI5C,KAAE0B,OAAI,KAAG9B,MAAG,KAAGc,MAAG4B,OAAI,MAAI,KAAGf,MAAGF,KAAEf,KAAGR,IAAE,CAAC,IAAEU,IAAEZ,KAAEiE,GAAE/D,MAAGE,MAAG,KAAGJ,MAAGc,KAAEpB,MAAIkB,KAAED,KAAEoD,QAAKjD,MAAG,KAAGoB,MAAGL,KAAEhB,KAAG,EAAE,GAAEyB,KAAE3B,IAAEkB,KAAEN,MAAG,KAAGQ,MAAGS,IAAET,KAAE0B,OAAI,KAAGP,OAAIN,IAAEe,MAAGE,OAAI,KAAGF,OAAI/B,IAAElB,MAAGe,MAAGyB,MAAGzB,MAAG,KAAG3B,MAAGsB,OAAI2C,MAAGrB,MAAG,KAAG3B,MAAGrB,OAAII,KAAE4B,MAAG,KAAGvB,MAAGP,MAAG4D,OAAI5B,MAAG,KAAGwB,OAAIzD,KAAE4C,OAAI0B,GAAErE,MAAGF,KAAEG,MAAG,KAAGiC,MAAGkB,QAAKlB,KAAElC,MAAG,KAAGY,MAAGqC,OAAIO,MAAGhC,MAAG,KAAGV,MAAGiB,OAAIK,MAAG,KAAGA,MAAGc,MAAGnD,MAAGS,IAAEU,MAAGe,KAAEE,KAAE4B,OAAI1B,MAAG,KAAGA,MAAGQ,KAAEQ,MAAI,CAAC,GAAEE,MAAGxD,MAAGoB,MAAGlB,MAAG6D,MAAGE,OAAI,KAAGF,OAAIG,QAAKA,MAAGlB,MAAG,KAAG1B,MAAGJ,OAAIa,KAAEV,MAAG,KAAGE,MAAGuC,OAAItB,MAAGR,MAAG,KAAGR,MAAG8B,MAAGF,QAAKpC,MAAG,IAAGP,KAAEL,IAAEqB,KAAEpB,IAAEgB,KAAEjB,KAAEC,MAAG,MAAIwB,KAAEd,KAAE,MAAK0B,MAAG,KAAGzC,MAAG2C,KAAED,IAAE3C,KAAEuE,GAAEvE,KAAEQ,IAAEU,KAAEiB,IAAE,CAAC,GAAE1B,KAAEQ,IAAEM,KAAEgD,GAAExC,IAAE5B,IAAE,CAAC,IAAE,IAAGA,KAAEoE,GAAEZ,MAAGpC,IAAE,MAAIM,KAAE,KAAGZ,KAAG,EAAE,GAAEH,KAAEG,IAAEO,KAAE+C,GAAEV,KAAG,IAAG,CAAC,IAAE3D,IAAEA,KAAEqE,GAAE/C,KAAE,KAAIC,KAAEL,KAAEH,MAAG,IAAG,EAAE,GAAEX,KAAEL,KAAEgB,IAAE4B,MAAG,KAAG3C,MAAGC,KAAEH,IAAE8C,MAAG,KAAG7C,MAAGa,KAAEL,IAAEsB,MAAG9B,KAAEsE,GAAEvD,KAAE,IAAGK,KAAE,IAAG,EAAE,MAAI,KAAGrB,MAAGE,IAAE6C,MAAG1C,KAAEY,OAAI,KAAGR,MAAGH,IAAE0C,MAAG5C,KAAEmE,GAAEnE,KAAEQ,IAAED,KAAEqB,IAAE,EAAE,MAAI,KAAG/B,MAAGD,IAAEiD,MAAGjD,KAAEiB,OAAI,KAAGZ,MAAGI,IAAEuB,KAAE7B,MAAG,KAAGC,MAAGH,IAAEiD,KAAEpC,MAAG,KAAGd,MAAGK,IAAEe,KAAElB,MAAG,KAAGC,MAAGC,IAAEuD,MAAGrD,MAAG,KAAGQ,MAAGd,IAAEA,KAAEuE,GAAEhD,KAAEqC,KAAG/B,KAAEF,IAAE,EAAE,GAAElB,KAAEQ,IAAEd,KAAEoE,GAAEvD,KAAE,IAAGK,KAAE,IAAG,EAAE,GAAEP,KAAEG,IAAEf,KAAEqE,GAAE3D,KAAEsB,IAAEvB,KAAEsB,IAAE,EAAE,GAAE3B,KAAEL,KAAEgB,IAAEkC,MAAG,KAAGjD,MAAGC,KAAEH,IAAE4D,OAAI,KAAG3D,MAAGa,KAAEL,IAAE2C,OAAInD,KAAEsE,GAAE/C,KAAE,IAAGC,KAAE,IAAG,EAAE,MAAI,KAAGzB,MAAGE,IAAEmD,OAAIhD,KAAEY,OAAI,KAAGR,MAAGH,IAAE2B,MAAG7B,KAAEmE,GAAE/D,KAAE4B,IAAElB,KAAEmB,IAAE,EAAE,MAAI,KAAGpC,MAAGD,IAAEkC,MAAGlC,KAAEiB,OAAI,KAAGZ,MAAGI,IAAE0B,KAAEhC,MAAG,KAAGC,MAAGH,IAAE4D,MAAG/C,MAAG,KAAGd,MAAGK,IAAEiD,OAAI,KAAGnD,MAAGC,KAAEF,IAAE4D,OAAI,KAAGhD,MAAGd,KAAEM,IAAEN,KAAEuE,GAAEvD,KAAE,IAAGK,KAAE,IAAG,EAAE,GAAEZ,KAAEQ,IAAEd,KAAEoE,GAAE/C,KAAE,IAAGC,KAAE,IAAG,CAAC,GAAEpB,KAAEY,IAAEf,KAAEqE,GAAE/D,KAAE8B,IAAEpB,KAAEqB,IAAE,CAAC,GAAEC,KAAEvC,KAAEgB,IAAEmB,MAAG,KAAGlC,MAAGC,KAAEH,IAAEqC,MAAG,KAAGpC,MAAGI,KAAEI,IAAEK,MAAGb,KAAEsE,GAAE3D,KAAE4C,KAAG7C,KAAEqD,KAAG,CAAC,MAAI,KAAGhE,MAAGE,IAAEyB,MAAGrB,KAAEW,OAAI,KAAGR,MAAG+B,IAAEF,MAAGlC,KAAEmE,GAAEhD,KAAEK,IAAEf,KAAEgB,IAAE,EAAE,MAAI,KAAG5B,MAAGD,IAAEuC,MAAGvC,KAAEiB,OAAI,KAAGX,MAAGG,IAAEA,KAAEN,MAAG,KAAGC,MAAGH,IAAE2B,KAAEvB,MAAG,KAAGL,MAAGM,IAAEA,MAAG,KAAGH,MAAGC,KAAEF,IAAEsC,OAAI,KAAGnC,MAAGL,IAAEA,KAAEuE,GAAE/C,KAAE,IAAGC,KAAE,IAAG,EAAE,GAAEZ,KAAEI,IAAEd,KAAEoE,GAAE3D,KAAEyD,KAAG1D,KAAEwD,KAAG,EAAE,GAAExD,KAAEM,IAAEf,KAAEqE,GAAExD,KAAEQ,IAAEM,KAAE,IAAG,EAAE,GAAEd,KAAEd,KAAEgB,IAAEZ,MAAG,KAAGH,MAAGC,KAAEH,IAAEyC,MAAG,KAAGxC,MAAGU,KAAEE,IAAED,MAAGX,KAAEsE,GAAE/D,KAAEkD,KAAGxC,KAAE+C,KAAG,EAAE,MAAI,KAAGjE,MAAGE,IAAEgB,MAAGV,KAAES,OAAI,KAAGJ,MAAGE,IAAEM,MAAGjB,KAAEmE,GAAEvD,KAAE,IAAGK,KAAE,IAAG,CAAC,MAAI,KAAGpB,MAAGD,IAAEa,MAAGb,KAAEiB,OAAI,KAAGT,MAAGK,IAAEZ,MAAG,KAAGG,MAAGH,KAAEE,IAAEoD,OAAI,KAAGvD,MAAGQ,KAAEG,IAAER,KAAED,MAAG,KAAGC,MAAGC,IAAEW,OAAI,KAAGJ,MAAGX,IAAEW,MAAGT,KAAEqE,GAAEhD,KAAE,IAAGM,KAAE,IAAG,EAAE,MAAI,KAAGnB,MAAGoB,IAAEP,MAAGnB,KAAEa,OAAI,KAAG0B,MAAGc,KAAG/C,MAAGV,KAAEuE,GAAE/C,KAAE,IAAGC,KAAE,IAAG,EAAE,MAAI,KAAGvB,MAAGQ,IAAEmB,MAAGb,KAAEC,OAAI,KAAGb,MAAGuC,IAAEzC,MAAG,KAAGF,MAAGE,KAAEwB,IAAEF,MAAG,KAAGR,MAAGZ,KAAEwC,IAAEpC,KAAEsB,KAAEvB,IAAGH,KAAE,QAAM,IAAEgE,OAAI,MAAI,CAAC,KAAG,KAAG1C,MAAG1B,IAAEyB,KAAEgC,MAAGlD,GAAEH,KAAE,KAAG,CAAC,KAAG,KAAGwC,MAAG5B,IAAEsD,MAAGA,MAAG,IAAE;AAAE,kBAAA/D,GAAER,KAAE,OAAK,CAAC,IAAE8C,IAAEtC,GAAER,KAAE,OAAK,CAAC,IAAE+C,IAAEvC,GAAER,KAAE,OAAK,CAAC,IAAEgC,IAAExB,GAAER,KAAE,OAAK,CAAC,IAAEgD,IAAExC,GAAER,KAAE,OAAK,CAAC,IAAEiD,IAAEzC,GAAER,KAAE,OAAK,CAAC,IAAEkD,IAAE1C,GAAER,KAAE,OAAK,CAAC,IAAEiC,IAAEzB,GAAER,KAAE,OAAK,CAAC,IAAEmD,IAAE3C,GAAER,KAAE,OAAK,CAAC,IAAEqB,IAAEb,GAAER,KAAE,OAAK,CAAC,IAAE4D,KAAGpD,GAAER,KAAE,OAAK,CAAC,IAAEoD,IAAE5C,GAAER,KAAE,OAAK,CAAC,IAAE6D,KAAGrD,GAAER,KAAE,OAAK,CAAC,IAAEqD,KAAG7C,GAAER,KAAE,OAAK,CAAC,IAAEsD,KAAG9C,GAAER,KAAE,OAAK,CAAC,IAAEkC,IAAE1B,GAAER,KAAE,OAAK,CAAC,IAAEmC,IAAE3B,GAAER,KAAE,OAAK,CAAC,IAAEoC,IAAE5B,GAAER,KAAE,OAAK,CAAC,IAAE8D,KAAGtD,GAAER,KAAE,OAAK,CAAC,IAAEuD,KAAG/C,GAAER,KAAE,OAAK,CAAC,IAAE+D,KAAGvD,GAAER,KAAE,OAAK,CAAC,IAAEqC,IAAE7B,GAAER,KAAE,OAAK,CAAC,IAAEsC,IAAE9B,GAAER,KAAE,OAAK,CAAC,IAAEe,IAAEP,GAAER,KAAE,OAAK,CAAC,IAAE4B,IAAEpB,GAAER,KAAE,MAAI,CAAC,IAAEuC,IAAE/B,GAAER,KAAE,OAAK,CAAC,IAAEwC,IAAEhC,GAAER,KAAE,MAAI,CAAC,IAAEU,IAAEF,GAAER,KAAE,MAAI,CAAC,IAAE6B,IAAErB,GAAER,KAAE,MAAI,CAAC,IAAEO,IAAEC,GAAER,KAAE,MAAI,CAAC,IAAEyC,IAAEjC,GAAER,KAAE,MAAI,CAAC,IAAEM,IAAEE,GAAER,KAAE,MAAI,CAAC,IAAE0C,IAAElC,GAAER,KAAE,MAAI,CAAC,IAAEa,IAAEL,GAAER,KAAE,MAAI,CAAC,IAAEmB,IAAEX,GAAER,KAAE,MAAI,CAAC,IAAEsB,IAAEd,GAAER,KAAE,MAAI,CAAC,IAAEc,IAAEN,GAAER,KAAE,MAAI,CAAC,IAAEE,IAAEM,GAAER,KAAE,MAAI,CAAC,IAAEwD,KAAGhD,GAAER,KAAE,MAAI,CAAC,IAAEI,IAAEI,GAAER,KAAE,MAAI,CAAC,IAAEgB,IAAER,GAAER,KAAE,MAAI,CAAC,IAAEuB,IAAEf,GAAER,KAAE,MAAI,CAAC,IAAE2C,IAAEnC,GAAER,KAAE,MAAI,CAAC,IAAEY,IAAEJ,GAAER,KAAE,MAAI,CAAC,IAAEwB,IAAEhB,GAAER,KAAE,MAAI,CAAC,IAAEW,IAAEH,GAAER,KAAE,MAAI,CAAC,IAAE8B,IAAEtB,GAAER,KAAE,KAAG,CAAC,IAAEG,IAAEK,GAAER,KAAE,MAAI,CAAC,IAAEyB,IAAEjB,GAAER,MAAG,CAAC,IAAES,IAAED,GAAER,KAAE,KAAG,CAAC,IAAE0B;AAAA,gBAAC;AAAC,yBAASJ,GAAEtB,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,oBAAE,KAAGP,MAAG,GAAE;AAAC,oBAAAK,MAAGF,KAAEH,KAAE,IAAE,MAAIA,KAAE,MAAIC,KAAEO,GAAER,KAAE,KAAG,CAAC,MAAI;AAAE,sBAAE,KAAG,EAAE,IAAEC,KAAG;AAAC,0BAAG,EAAE,IAAEA,IAAG,OAAM;AAAE,2BAAIE,KAAEA,MAAGF,KAAEO,GAAEL,MAAG,CAAC,KAAG,OAAK,IAAEQ,GAAE,GAAG,EAAE,OAAM;AAAE,sBAAAX,KAAEA,KAAEC,KAAE;AAAE,yBAAE;AAAC,2BAAE;AAAC,8BAAGO,GAAE,GAAG,MAAI,IAAEL,KAAG;AAAC,gCAAGF,OAAI,KAAG,KAAI;AAAC,kCAAGG,KAAEH,OAAI,IAAE,IAAG,KAAGA,KAAEO,GAAEL,KAAE,MAAI,CAAC,QAAM,KAAGD,KAAEM,GAAEL,KAAE,KAAG,CAAC,KAAI;AAAC,gCAAAK,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGJ,EAAC;AAAE,sCAAM;AAAA,8BAAC;AAAC,8BAAAI,GAAEN,KAAE,MAAI,CAAC,IAAED,IAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEC;AAAE,oCAAM;AAAA,4BAAC;AAAC,gCAAGI,KAAEE,GAAEL,KAAE,MAAI,CAAC,IAAG,IAAEA,QAAK,KAAGF,KAAEO,GAAEL,KAAE,MAAI,CAAC,KAAI;AAAC,8BAAAD,KAAEM,GAAEL,KAAE,KAAG,CAAC,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAED,IAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEC;AAAE,oCAAM;AAAA,4BAAC;AAAC,gCAAG,EAAEA,KAAEM,IAAGJ,KAAED,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,kCAAG,EAAED,KAAEM,GAAEL,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,8BAAAC,KAAED,KAAE,KAAG;AAAA,4BAAC;AAAC,mCAAKI,KAAEH,KAAGF,KAAEM,IAAGJ,MAAGH,KAAEC,MAAG,KAAG,MAAI,CAAC,OAAKE,KAAEH,KAAE,KAAG,GAAEC,KAAEM,GAAEP,KAAE,MAAI,CAAC,KAAI;AAAC,4BAAAO,GAAED,MAAG,CAAC,IAAE;AAAE,kCAAM;AAAA,0BAAC;AAAC,8BAAG,MAAI,KAAGN,KAAEO,GAAEH,KAAE,KAAG,CAAC,IAAI,OAAM;AAAE,iCAAOG,GAAE,GAAG,IAAER,IAAEQ,GAAEH,KAAE,KAAG,CAAC,IAAE,KAAGJ,IAAEO,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAE,MAAKQ,GAAEH,MAAG,CAAC,IAAEL;AAAA,wBAAE;AAAC,wBAAAC,KAAE;AAAA,sBAAC;AAAC,0BAAGK,IAAE;AAAC,wBAAAJ,KAAEM,GAAEL,KAAE,MAAI,CAAC;AAAE,2BAAE;AAAC,8BAAGK,IAAGJ,KAAE,QAAMF,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEC,KAAG;AAAC,gCAAGK,GAAEJ,MAAG,CAAC,IAAEH,IAAEA,GAAE,OAAM;AAAE,4BAAAO,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGN,EAAC;AAAE,kCAAM;AAAA,0BAAC;AAAC,8BAAGM,GAAEF,MAAGE,GAAEF,KAAE,MAAI,CAAC,MAAI,IAAEH,MAAG,KAAG,OAAK,CAAC,IAAEF,IAAE,CAACA,GAAE,OAAM;AAAA,wBAAC;AAAC,wBAAAO,GAAEP,KAAE,MAAI,CAAC,IAAEK,KAAGJ,KAAEM,GAAEL,KAAE,MAAI,CAAC,OAAKK,GAAEP,KAAE,MAAI,CAAC,IAAEC,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAED,MAAIC,KAAEM,GAAEL,KAAE,MAAI,CAAC,OAAKK,GAAEP,KAAE,MAAI,CAAC,IAAEC,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAED;AAAA,sBAAE;AAAA,oBAAC;AAAC,wBAAG,EAAEE,OAAI,KAAGE,OAAI,MAAI,KAAGJ,KAAEO,GAAEH,KAAE,KAAG,CAAC,IAAG;AAAC,yBAAE;AAAC,2BAAE;AAAC,6BAAE;AAAC,+BAAE;AAAC,kCAAG,EAAE,IAAEJ,KAAG;AAAC,oCAAGO,GAAE,GAAG,MAAI,IAAEH,KAAG;AAAC,sCAAGG,GAAE,GAAG,IAAEL,IAAEH,KAAEQ,GAAE,GAAG,IAAER,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,GAAE,GAAG,MAAI,IAAEL,IAAG,OAAM;AAAE,yCAAOK,GAAE,GAAG,IAAE,GAAE,MAAKA,GAAE,GAAG,IAAE;AAAA,gCAAE;AAAC,oCAAGA,GAAE,GAAG,MAAI,IAAEH,IAAG,QAAOG,GAAE,GAAG,IAAEL,IAAEH,KAAEQ,GAAE,GAAG,IAAER,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAE,MAAKQ,GAAER,KAAEG,MAAG,CAAC,IAAEH;AAAG,oCAAGA,MAAG,KAAGC,MAAGD,KAAE,GAAEC,OAAI,KAAG,KAAI;AAAC,sCAAGG,KAAEH,OAAI,IAAE,IAAG,KAAGA,KAAEO,GAAEH,KAAE,MAAI,CAAC,QAAM,KAAGH,KAAEM,GAAEH,KAAE,KAAG,CAAC,KAAI;AAAC,oCAAAG,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGJ,EAAC;AAAE,0CAAM;AAAA,kCAAC;AAAC,kCAAAI,GAAEN,KAAE,MAAI,CAAC,IAAED,IAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEC;AAAE,wCAAM;AAAA,gCAAC;AAAC,oCAAGI,KAAEE,GAAEH,KAAE,MAAI,CAAC,IAAG,IAAEA,QAAK,KAAGJ,KAAEO,GAAEH,KAAE,MAAI,CAAC,KAAI;AAAC,kCAAAH,KAAEM,GAAEH,KAAE,KAAG,CAAC,GAAEG,GAAEN,KAAE,MAAI,CAAC,IAAED,IAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEC;AAAE,wCAAM;AAAA,gCAAC;AAAC,oCAAG,EAAEA,KAAEM,IAAGJ,KAAEC,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,sCAAG,EAAEH,KAAEM,GAAEH,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,kCAAAD,KAAEC,KAAE,KAAG;AAAA,gCAAC;AAAC,uCAAKE,KAAEH,KAAGF,KAAEM,IAAGJ,MAAGH,KAAEC,MAAG,KAAG,MAAI,CAAC,OAAKE,KAAEH,KAAE,KAAG,GAAEC,KAAEM,GAAEP,KAAE,MAAI,CAAC,KAAI;AAAC,gCAAAO,GAAED,MAAG,CAAC,IAAE;AAAE,sCAAM;AAAA,8BAAC;AAAC,8BAAAC,GAAEH,KAAE,KAAG,CAAC,IAAE,KAAGJ,IAAEO,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,GAAER,KAAEG,MAAG,CAAC,IAAEH;AAAE,oCAAM;AAAA,4BAAC;AAAC,4BAAAC,KAAE;AAAA,0BAAC;AAAC,8BAAGK,IAAE;AAAC,4BAAAJ,KAAEM,GAAEH,KAAE,MAAI,CAAC;AAAE,+BAAE;AAAC,kCAAGG,IAAGJ,KAAE,QAAMF,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEG,KAAG;AAAC,oCAAGG,GAAEJ,MAAG,CAAC,IAAEH,IAAEA,GAAE,OAAM;AAAE,gCAAAO,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGN,EAAC;AAAE,sCAAM;AAAA,8BAAC;AAAC,kCAAGM,GAAEF,MAAGE,GAAEF,KAAE,MAAI,CAAC,MAAI,IAAED,MAAG,KAAG,OAAK,CAAC,IAAEJ,IAAE,CAACA,GAAE,OAAM;AAAA,4BAAC;AAAC,4BAAAO,GAAEP,KAAE,MAAI,CAAC,IAAEK,KAAGJ,KAAEM,GAAEH,KAAE,MAAI,CAAC,OAAKG,GAAEP,KAAE,MAAI,CAAC,IAAEC,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAED,MAAIC,KAAEM,GAAEH,KAAE,MAAI,CAAC,OAAKG,GAAEP,KAAE,MAAI,CAAC,IAAEC,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAED;AAAA,0BAAE;AAAA,wBAAC;AAAC,4BAAGO,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,GAAER,KAAEG,MAAG,CAAC,IAAEH,IAAEQ,GAAE,GAAG,MAAI,IAAEL,IAAG,QAAO,MAAKK,GAAE,GAAG,IAAER;AAAA,sBAAE;AAAC,0BAAGA,OAAI,KAAG,IAAI,QAAOC,KAAE,QAAM,KAAGD,MAAG,IAAGE,KAAEM,GAAE,GAAG,MAAIR,KAAE,MAAIA,OAAI,MAAIA,KAAEQ,GAAEP,KAAE,KAAG,CAAC,KAAGO,GAAE,GAAG,IAAER,KAAEE,IAAEF,KAAEC,KAAGO,GAAEP,KAAE,KAAG,CAAC,IAAEE,IAAEK,GAAER,KAAE,MAAI,CAAC,IAAEG,IAAEK,GAAEL,KAAE,MAAI,CAAC,IAAEF,IAAE,MAAKO,GAAEL,KAAE,KAAG,CAAC,IAAEH;AAAG,sBAAAE,KAAE,IAAGF,OAAI,KAAG,aAAWE,KAAE,OAAKF,OAAI,MAAIC,KAAEY,GAAEb,OAAI,IAAE,CAAC,KAAG,MAAIC,MAAG,KAAG,KAAG,IAAGO,GAAEL,KAAE,MAAI,CAAC,IAAED,IAAEM,GAAEL,KAAE,MAAI,CAAC,IAAE,GAAEK,GAAEL,KAAE,MAAI,CAAC,IAAE,GAAEF,KAAE,QAAMC,MAAG,KAAG;AAAE,yBAAE;AAAC,2BAAE;AAAC,+BAAIE,KAAEI,GAAE,GAAG,MAAID,KAAE,KAAGL,KAAG;AAAC,iCAAIA,KAAEF,OAAI,OAAK,IAAEE,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,IAAGD,KAAEO,GAAEP,MAAG,CAAC,OAAI;AAAC,kCAAGG,KAAEH,KAAG,KAAGO,GAAEP,KAAE,KAAG,CAAC,OAAK,IAAED,IAAG,OAAM;AAAE,kCAAGC,KAAEC,OAAI,KAAG,GAAEA,OAAI,GAAE,EAAED,KAAEO,IAAGD,KAAEH,MAAG,IAAEH,MAAG,KAAG,MAAI,CAAC,GAAG;AAAA,4BAAK;AAAC,4BAAAO,GAAED,KAAE,MAAI,CAAC,IAAEJ,IAAEK,GAAEL,KAAE,MAAI,CAAC,IAAEC;AAAA,0BAAC,MAAM,CAAAI,GAAE,GAAG,IAAEJ,KAAEG,IAAEC,GAAEP,MAAG,CAAC,IAAEE,IAAEK,GAAEL,KAAE,MAAI,CAAC,IAAEF;AAAE,0BAAAO,GAAEL,KAAE,MAAI,CAAC,IAAEA,IAAEK,GAAEL,KAAE,KAAG,CAAC,IAAEA;AAAE,gCAAM;AAAA,wBAAC;AAAC,wBAAAH,KAAEQ,GAAEJ,KAAE,KAAG,CAAC,GAAEI,GAAER,KAAE,MAAI,CAAC,IAAEG,IAAEK,GAAEJ,KAAE,KAAG,CAAC,IAAED,IAAEK,GAAEL,KAAE,MAAI,CAAC,IAAE,GAAEK,GAAEL,KAAE,MAAI,CAAC,IAAEC,IAAEI,GAAEL,KAAE,KAAG,CAAC,IAAEH;AAAA,sBAAC;AAAC,sBAAAA,KAAEQ,GAAE,GAAG,IAAE,IAAE,GAAEA,GAAE,GAAG,IAAER,MAAG;AAAA,oBAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASuB,GAAEvB,IAAEC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,IAAEG,IAAEG,IAAEC,IAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEO,KAAE,GAAEC,KAAE;AAAE,uBAAIP,KAAEV,KAAEU,KAAE,MAAI,GAAEN,KAAEJ,KAAE,KAAG,GAAEG,KAAES,GAAE,GAAG,GAAEX,GAAEG,MAAG,CAAC,IAAED,IAAEA,OAAII,GAAE,GAAG,GAAET,GAAE,IAAGY,KAAEb,KAAEa,KAAE,MAAI,OAAI;AAAC,wBAAG,OAAK,IAAEJ,KAAG;AAAC,iCAAO;AAAC,4BAAGA,KAAE,GAAEV,OAAI,IAAE,KAAI;AAAC,+BAAIY,KAAE,OAAI;AAAC,gCAAG,QAAM,IAAEF,KAAG;AAAC,sCAAM,IAAEV,QAAK,IAAEY,MAAI,CAAAT,GAAES,KAAEX,KAAE,CAAC,IAAEK,GAAEP,KAAEa,KAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE;AAAA,4BAAK;AAAC,4BAAAT,GAAEO,KAAET,KAAE,CAAC,IAAE,GAAES,KAAEA,KAAE,IAAE;AAAA,0BAAC;AAAC,+BAAIP,GAAEH,KAAEC,KAAE,CAAC,IAAE,IAAGE,GAAEF,KAAE,MAAI,CAAC,IAAE,MAAIK,GAAEL,KAAE,MAAI,CAAC,GAAES,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAE,KAAEP,IAAGN,MAAGC,KAAEU,MAAG,KAAGH,KAAE,MAAI,CAAC,GAAEM,KAAER,GAAEN,KAAE,KAAG,CAAC,GAAEM,GAAEN,MAAG,CAAC,IAAEoC,GAAEnC,KAAEC,KAAE,CAAC,IAAEW,IAAEP,GAAEN,KAAE,KAAG,CAAC,IAAEgB,KAAEF,IAAEH,KAAEA,KAAE,IAAE;AAAE,0BAAAI,KAAEb,KAAE,MAAI;AAAE;AAAA,wBAAK;AAAC,+BAAK,OAAK,IAAES,MAAI,CAAAU,KAAEf,IAAGO,MAAGC,KAAEH,MAAG,KAAGH,KAAE,MAAI,CAAC,GAAEc,KAAEhB,GAAEO,KAAE,KAAG,CAAC,GAAEP,GAAEO,MAAG,CAAC,IAAEuB,GAAEpC,KAAEc,KAAE,CAAC,IAAEO,IAAEf,GAAEO,KAAE,KAAG,CAAC,IAAEG,KAAEM,IAAEX,KAAEA,KAAE,IAAE;AAAE,wBAAAQ,GAAEX,EAAC,GAAER,KAAEA,KAAE,MAAI,GAAEC,KAAEA,KAAE,MAAI;AAAA,sBAAC;AAAC;AAAA,oBAAK;AAAC,oBAAAK,IAAGO,MAAGF,MAAG,KAAGH,KAAE,MAAI,CAAC,IAAE,GAAEF,GAAEO,KAAE,KAAG,CAAC,IAAE,GAAEF,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,kBAAAoB,GAAEjC,IAAEE,MAAGD,OAAI,KAAG,MAAI,GAAEU,EAAC;AAAE,oBAAE,MAAI,KAAGT,KAAEU,GAAEV,IAAE,GAAG,QAAM,IAAED,IAAG,MAAIE,KAAEF,KAAEC,KAAE,GAAEF,KAAEA,KAAEE,KAAE,GAAE+B,GAAE1B,KAAE,KAAG,GAAE,GAAEA,KAAE,KAAG,CAAC,GAAEN,KAAE,OAAI;AAAC,yBAAI,IAAEA,QAAK,IAAEE,IAAG,OAAM;AAAE,oBAAAG,GAAEN,KAAEC,KAAE,CAAC,IAAEQ,IAAGF,KAAE,KAAG,KAAGN,KAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,kBAAAqB,GAAEd,GAAED,KAAE,MAAI,CAAC,CAAC,GAAEU,KAAEV,KAAE,MAAI;AAAA,gBAAC;AAAC,yBAASiB,GAAExB,IAAEC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEG,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,OAAI;AAAC,uBAAE;AAAC,0BAAGP,KAAE,GAAED,KAAE,GAAEI,KAAEE,KAAEJ,GAAER,KAAE,OAAK,CAAC,GAAE,EAAE,GAAGW,KAAER,MAAGC,KAAEI,GAAER,KAAE,OAAK,CAAC,KAAG,OAAK,IAAEG,OAAI,IAAEO,KAAE,IAAE,IAAEA,MAAGT,OAAI,IAAEU,OAAI,IAAG;AAAC,+BAAK,EAAE,CAACL,MAAGD,KAAEJ,KAAEG,KAAE,OAAK,KAAGG,OAAI,IAAE,MAAI,IAAED,OAAK,CAAAM,KAAEJ,IAAGE,MAAG,MAAIN,KAAEA,KAAEG,KAAE,MAAIP,KAAE,KAAG,KAAG,CAAC,GAAEW,KAAEF,GAAEP,KAAEK,KAAE,CAAC,GAAEF,KAAE,MAAID,OAAI,KAAI,KAAGA,QAAK,KAAG,MAAIA,KAAEO,MAAGN,IAAEA,KAAE,MAAID,MAAG,KAAGC,MAAG,IAAEM,OAAI,KAAGN,IAAEA,KAAEM,MAAGN,KAAGG,GAAEE,MAAG,CAAC,IAAEL,KAAEG,GAAEE,MAAG,CAAC,GAAEF,GAAEE,KAAE,KAAG,CAAC,IAAEN,KAAEQ,IAAEN,MAAGC,KAAEA,KAAE,IAAE,KAAGD,KAAEA,KAAE,IAAE,GAAEF,KAAEI,GAAER,KAAE,OAAK,CAAC,GAAEY,KAAEJ,GAAER,KAAE,OAAK,CAAC;AAAE,wBAAAQ,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEQ,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEqB,GAAErB,EAAC,GAAEE,KAAEA,KAAEG,KAAE,GAAEF,KAAEA,KAAEE,KAAE;AAAE;AAAA,sBAAQ;AAAC,iCAAO;AAAC,4BAAG,CAACS,MAAG,IAAEX,QAAK,IAAEU,IAAG,OAAM;AAAE,wBAAAZ,KAAEY,KAAEL,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEK,KAAEG,IAAGF,MAAG,KAAGL,MAAGD,KAAE,KAAG,KAAG,CAAC,GAAEO,KAAEE,GAAEP,KAAEW,KAAE,CAAC,GAAEZ,KAAE,MAAIG,KAAEH,MAAG,KAAI,KAAGG,QAAK,KAAG,MAAIA,KAAEG,MAAGN,IAAEA,KAAE,MAAIG,MAAG,KAAGH,MAAG,IAAEM,OAAI,KAAGN,IAAEA,KAAEM,MAAGN,KAAGO,GAAEF,MAAG,CAAC,IAAEL,KAAEO,GAAEF,MAAG,CAAC,GAAEE,GAAEF,KAAE,KAAG,CAAC,IAAEF,KAAEC,IAAEJ,KAAEa,IAAEA,MAAGD,KAAEA,KAAE,IAAE,KAAGZ,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAA,oBAAC;AAAC;AAAA,kBAAK;AAAC,kBAAAA,KAAEO,GAAER,KAAE,OAAK,CAAC,GAAEC,MAAGC,KAAEC,KAAEK,GAAER,KAAE,OAAK,CAAC,IAAE,OAAK,IAAEG,OAAI,IAAEF,KAAE,IAAE,IAAEA,IAAEO,GAAER,KAAE,OAAK,CAAC,IAAEE,IAAEM,GAAER,KAAE,OAAK,CAAC,IAAEC;AAAA,gBAAC;AAAC,yBAASwB,GAAEzB,IAAEC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,uBAAIF,KAAEV,QAAI;AAAC,oBAAAM,KAAEC,GAAEN,KAAE,OAAK,CAAC,GAAEO,KAAED,GAAEN,KAAE,OAAK,CAAC;AAAE,uBAAE;AAAC,0BAAG,CAACQ,MAAG,IAAEN,QAAK,IAAEO,IAAG,CAAAN,KAAEJ;AAAA,2BAAM;AAAC,4BAAGI,KAAED,KAAG,IAAEM,QAAK,IAAED,MAAGF,OAAI,IAAEH,OAAI,IAAEM,OAAI,IAAED,OAAI,EAAE,OAAM;AAAE,wBAAAE,KAAEP;AAAA,sBAAC;AAAC,2BAAIA,KAAEG,KAAEI,KAAE,GAAED,KAAED,OAAIF,OAAI,IAAEI,OAAI,KAAG,IAAE,KAAG,GAAEA,KAAEV,KAAEI,KAAE,GAAEJ,KAAED,KAAEK,KAAE,GAAEG,GAAEN,KAAE,OAAK,CAAC,IAAEE,IAAEI,GAAEN,KAAE,OAAK,CAAC,IAAEQ,IAAEC,MAAG;AAAC,6BAAIU,GAAEnB,EAAC,GAAEF,KAAEG,OAAI,IAAEQ,OAAI,IAAEA,KAAER,IAAEE,KAAE,IAAG,IAAEL,QAAK,IAAEK,MAAI,CAAAI,KAAED,IAAGJ,MAAG,KAAGC,MAAGH,KAAE,MAAI,CAAC,GAAEK,KAAEC,GAAEJ,KAAE,KAAG,CAAC,GAAEA,KAAE,MAAIM,KAAEL,MAAG,IAAE,KAAIC,GAAEL,KAAEI,KAAE,CAAC,KAAG,KAAGK,QAAK,KAAG,KAAGH,OAAIH,KAAE,MAAI,KAAGA,MAAG,IAAEG,OAAI,KAAGH,KAAEK,OAAIL,IAAEC,KAAEA,KAAE,IAAE;AAAE,wBAAAM,KAAEA,KAAEX,KAAE,GAAEC,KAAED,KAAEC,KAAE,GAAEG,KAAED,KAAEH,KAAE,GAAEU,KAAE;AAAA,sBAAC;AAAC;AAAA,oBAAM;AAAC,oBAAAG,KAAED,KAAEZ,KAAEK,KAAE,GAAEO,KAAEJ,IAAGC,MAAG,MAAIF,KAAEH,MAAGD,KAAEI,KAAE,KAAG,MAAIL,KAAE,MAAI,CAAC,GAAEO,KAAED,GAAEC,KAAE,KAAG,CAAC,GAAEJ,KAAE,MAAIE,OAAI,IAAGD,GAAE,IAAEO,EAAC,KAAG,KAAGN,QAAK,KAAG,KAAGE,OAAIJ,KAAE,MAAI,KAAGA,MAAG,IAAEI,OAAI,KAAGJ,KAAEO,OAAIP,IAAEK,MAAGN,KAAEA,KAAE,IAAE,KAAGM,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASgB,GAAE1B,IAAEC,IAAE;AAAC,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEG,KAAE;AAAE,uBAAIO,KAAEf,KAAEe,KAAE,MAAI,GAAE2B,GAAEvC,KAAEH,KAAE,KAAG,CAAC,GAAE,GAAGG,IAAEJ,IAAE,EAAE,GAAE,GAAGI,EAAC,GAAE,GAAGH,KAAE,KAAG,GAAE,KAAIG,EAAC,OAAI;AAAC,wBAAG,CAACF,KAAE,MAAI,IAAEC,KAAG;AAAC,2BAAIH,KAAE,OAAI;AAAC,4BAAG,QAAM,IAAEA,KAAG;AAAC,+BAAIA,KAAE,GAAEG,KAAE,KAAI,QAAM,IAAEA,OAAI;AAAC,mCAAKH,OAAI,KAAG,QAAM,GAAGC,KAAE,KAAG,GAAE,KAAIA,KAAE,KAAG,CAAC,GAAED,KAAE,IAAGE,MAAGD,KAAE,KAAG,KAAGD,KAAE,GAAEA,KAAEA,KAAE,IAAE,IAAGE,KAAEM,GAAE,IAAEN,EAAC,OAAK,IAAEC,OAAI,IAAG;AAAC,4BAAAD,MAAGA,MAAG,KAAGH,KAAE,GAAEQ,IAAGJ,MAAG,KAAGJ,MAAG,CAAC,IAAEQ,GAAEL,MAAG,CAAC,GAAEK,GAAEL,MAAG,CAAC,IAAE,KAAGI,MAAG,IAAE,IAAGH,KAAEA,KAAE,IAAE,GAAEG,MAAG,IAAEG,OAAI,KAAGH,OAAI,GAAEG,KAAEA,OAAI,IAAE;AAAA,0BAAC;AAAC,6BAAGR,KAAE,KAAG,CAAC,GAAEe,KAAEf,KAAE,MAAI;AAAE;AAAA,wBAAK;AAAC,wBAAAM,IAAGP,MAAG,KAAGD,MAAG,CAAC,IAAE,GAAEC,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC;AAAA,oBAAK;AAAC,oBAAAI,KAAEI,IAAGP,KAAE,KAAG,KAAGE,KAAE,CAAC,GAAEH,KAAE,MAAIK,KAAEF,MAAG,KAAI,KAAGE,QAAK,KAAG,MAAIA,KAAED,MAAGJ,IAAEA,KAAE,MAAIK,MAAG,KAAGL,MAAG,IAAEI,OAAI,KAAGJ,IAAEA,KAAEI,MAAGJ,KAAGM,MAAGN,IAAES,MAAGJ,IAAEH,MAAGC,KAAEA,KAAE,IAAE,KAAGD,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASwB,GAAE3B,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEG,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAEN,OAAI;AAAC,yBAAIK,KAAEL,MAAG,GAAEM,KAAEJ,GAAEF,IAAE,IAAI,IAAEV,KAAE,GAAEO,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,2BAAIU,KAAEf,MAAGe,KAAEb,KAAEa,KAAE,MAAI,KAAG,KAAG,GAAEd,KAAEI,KAAEQ,KAAE,GAAET,GAAEJ,KAAE,KAAG,CAAC,IAAEC,IAAEG,GAAEJ,KAAE,KAAG,CAAC,IAAEC,OAAI,GAAEyC,GAAEzC,KAAEC,KAAE,KAAG,CAAC,GAAE,GAAGD,IAAEF,IAAE,EAAE,GAAE,GAAGE,IAAED,KAAE,KAAG,GAAE,CAAC,GAAE6B,GAAEvB,GAAEL,MAAG,CAAC,GAAE,GAAG,GAAEc,KAAEf,KAAE,KAAG,GAAEA,KAAE,KAAI,GAAGG,KAAED,KAAE,KAAG,GAAE,KAAID,EAAC,GAAEA,KAAEkC,GAAExB,MAAGN,MAAG,MAAIS,KAAE,GAAE,KAAIX,IAAE,GAAG,GAAEF,OAAI,KAAG,OAAK;AAAC,6BAAIQ,KAAET,MAAGG,MAAGH,OAAI,KAAG,IAAE,KAAG,GAAEA,KAAE,IAAG,IAAEA,QAAK,IAAEG,MAAI,CAAAC,IAAGQ,KAAEV,KAAE,KAAG,KAAGF,KAAE,CAAC,IAAEO,IAAGP,KAAES,KAAE,KAAGG,KAAE,CAAC,GAAEZ,KAAEA,KAAE,IAAE;AAAE,4BAAIA,KAAEE,KAAE,KAAG,KAAGC,IAAE,KAAID,KAAE,KAAG,CAAC,GAAED,KAAEkC,IAAGlC,MAAG,KAAGU,KAAE,GAAE,MAAIV,KAAE,GAAEQ,KAAET,IAAEA,KAAE,MAAIG,EAAC,IAAEF,KAAE;AAAA,sBAAC;AAAC,yBAAGC,KAAE,KAAG,CAAC,GAAEa,KAAEb,KAAE,MAAI,GAAEG,KAAEA,KAAE,IAAE;AAAA,oBAAC;AAAC,oBAAAG,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASkB,GAAE5B,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,kBAAAP,KAAE,KAAIF,KAAE;AAAE,oBAAE,YAAO;AAAC,uBAAE;AAAC,0BAAGD,KAAE,GAAEC,OAAI,IAAE,IAAI,YAAO;AAAC,4BAAG,QAAM,IAAEG,IAAG,OAAM;AAAE,wBAAAL,KAAEsC,GAAEtC,KAAEO,IAAGJ,MAAGE,MAAG,KAAGN,KAAE,MAAI,CAAC,GAAEC,MAAG,IAAG,OAAM,CAAC,GAAEO,GAAEJ,MAAG,CAAC,IAAE,GAAGH,IAAEiB,EAAC,GAAEZ,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC,iCAAO;AAAC,2BAAE;AAAC,8BAAGJ,OAAI,KAAG,IAAI,MAAIO,KAAEP,KAAEC,KAAE,GAAEQ,MAAGP,KAAE,IAAEI,GAAE,SAAOH,KAAEA,KAAE,IAAE,MAAI,MAAI,CAAC,IAAE,MAAI,QAAK;AAAC,iCAAI,IAAEH,QAAK,IAAEO,IAAG,OAAM;AAAE,4BAAAC,KAAEF,IAAGP,MAAGC,MAAG,KAAGF,KAAE,MAAI,CAAC,GAAEY,KAAEX,IAAEA,KAAEO,IAAGD,MAAGL,KAAEC,MAAG,KAAGH,KAAE,MAAI,CAAC,GAAEQ,GAAEI,MAAG,CAAC,IAAEF,KAAET,IAAEA,KAAES,KAAET,KAAE,GAAEO,GAAED,MAAG,CAAC,IAAEN,IAAEO,GAAED,MAAG,CAAC,IAAE,GAAGgC,GAAEtC,IAAEA,MAAG,IAAGG,IAAEO,EAAC,GAAEO,EAAC,GAAEhB,KAAEA,KAAE,IAAE;AAAA,0BAAC;AAAC,0BAAAC,OAAI;AAAE,mCAAS;AAAA,wBAAC;AAAC,wBAAAD,KAAEC,KAAEM,KAAE;AAAA,sBAAC;AAAA,oBAAC;AAAC;AAAA,kBAAK;AAAA,gBAAC;AAAC,yBAASoB,GAAE7B,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEG,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAE,OAAK,IAAEV,MAAI,CAAAF,MAAGE,MAAG,KAAGJ,KAAE,GAAEG,KAAES,GAAER,IAAE,CAAC,IAAEH,KAAE,GAAEI,KAAE,IAAEI,GAAE,IAAEN,EAAC,GAAEK,GAAEN,MAAG,CAAC,IAAEG,IAAEC,KAAEG,GAAE,IAAEN,EAAC,MAAI,IAAE,GAAEK,GAAEN,KAAE,KAAG,CAAC,IAAEI,IAAEC,KAAEE,GAAEN,KAAE,IAAE,CAAC,KAAG,IAAE,IAAEM,GAAE,IAAEN,EAAC,MAAI,GAAEK,GAAEN,KAAE,KAAG,CAAC,IAAEK,IAAEG,KAAED,GAAEN,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAEQ,IAAEC,KAAEF,GAAEN,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAES,IAAEE,KAAEJ,GAAEN,KAAE,IAAE,CAAC,KAAG,IAAE,IAAEM,GAAEN,KAAE,IAAE,CAAC,MAAI,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAEW,IAAEC,KAAEL,GAAEN,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAEY,IAAEX,KAAEM,GAAEN,KAAE,IAAE,CAAC,GAAEK,GAAEN,KAAE,KAAG,CAAC,IAAE,IAAEI,IAAEE,GAAEN,MAAG,CAAC,IAAE,IAAEG,IAAEG,GAAEN,KAAE,KAAG,CAAC,IAAE,IAAEK,IAAEC,GAAEN,KAAE,MAAI,CAAC,IAAE,IAAEQ,IAAEF,GAAEN,KAAE,MAAI,CAAC,IAAE,IAAES,IAAEH,GAAEN,KAAE,MAAI,CAAC,IAAE,IAAEW,IAAEL,GAAEN,KAAE,MAAI,CAAC,IAAE,IAAEY,IAAEN,GAAEN,KAAE,MAAI,CAAC,IAAE,KAAGC,OAAI,IAAE,IAAGC,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAASoE,GAAExE,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,yBAAOF,KAAE,MAAIC,KAAEC,KAAE,KAAGJ,KAAGG,KAAEA,OAAI,KAAG,KAAG,OAAKD,KAAE,KAAGD,KAAE,OAAKC,KAAE,MAAI,KAAGA,MAAG,KAAG,KAAGA,IAAEC,MAAGL,IAAEG,MAAGF,IAAEG,KAAE,KAAGE,IAAEA,OAAI,KAAG,MAAIH,KAAEE,MAAGD,IAAEE,KAAE,MAAIH,MAAG,KAAGC,MAAG,IAAEC,OAAI,KAAGD,KAAED,MAAGC,IAAEE,KAAED,MAAGD,KAAGC,KAAEF,IAAEA,KAAE,MAAIC,KAAE,IAAEF,KAAE,KAAIE,OAAI,KAAG,MAAID,KAAE,MAAIA,IAAED,KAAE,KAAGC,MAAGD,KAAE,MAAIC,OAAI,KAAGA,MAAG,IAAE,OAAK,KAAGA,IAAEH,MAAGE,IAAED,MAAGE,IAAEA,KAAE,KAAGC,IAAEA,OAAI,KAAG,MAAIF,KAAE,GAAEF,KAAEC,OAAIE,KAAE,MAAID,KAAED,OAAIE,KAAE,GAAEH,OAAI,KAAGG,MAAG,IAAEF,OAAI,KAAGE,KAAEH,OAAIG,KAAGe,KAAEhB,KAAEG,IAAEL,MAAGM;AAAA,gBAAC;AAAC,yBAASwB,GAAE9B,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,uBAAIT,KAAE,KAAID,KAAE,GAAEC,MAAG;AAAC,2BAAKD,OAAI,KAAG,OAAK;AAAC,2BAAIK,KAAEL,OAAI,KAAGE,KAAEF,KAAEC,KAAE,OAAK,IAAED,KAAEE,IAAEO,MAAGP,KAAEK,GAAE,SAAOD,KAAEA,KAAE,IAAE,MAAI,MAAI,CAAC,MAAI,KAAI,IAAEN,QAAK,IAAEK,MAAI,CAAAD,KAAE,GAAGkC,GAAElC,KAAEG,IAAGJ,MAAGH,KAAEC,MAAG,KAAGF,KAAE,MAAI,CAAC,GAAEK,MAAG,IAAGF,IAAEO,EAAC,GAAEQ,EAAC,GAAEP,KAAEP,IAAEK,KAAED,IAAGJ,MAAGH,MAAG,KAAGD,KAAE,MAAI,CAAC,GAAEQ,GAAEG,MAAG,CAAC,IAAEF,KAAEJ,IAAEG,GAAEJ,MAAG,CAAC,IAAEC,KAAEI,IAAER,KAAEA,KAAE,IAAE;AAAE,sBAAAA,KAAEC,KAAEI,KAAE;AAAA,oBAAC;AAAC,oBAAAJ,KAAEA,OAAI,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAAS6B,GAAE/B,IAAEC,IAAE;AAAC,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,kBAAAF,KAAEK,GAAER,KAAE,OAAK,CAAC,GAAEE,KAAEM,IAAGJ,KAAEJ,MAAG,KAAGG,MAAG,KAAG,KAAG,CAAC,GAAEA,KAAE,MAAIE,KAAEF,MAAG,KAAI,KAAGE,QAAK,KAAG,MAAIA,KAAE,MAAIF,IAAEA,KAAE,MAAIE,MAAG,KAAGF,MAAG,IAAE,OAAK,KAAGA,IAAEA,KAAE,MAAIA,KAAGK,GAAEJ,MAAG,CAAC,IAAED,KAAEK,GAAEJ,MAAG,CAAC,GAAEI,GAAEJ,KAAE,KAAG,CAAC,IAAEC,KAAEH,IAAEG,KAAEG,IAAGP,MAAG,MAAIE,KAAEF,KAAE,IAAE,MAAID,KAAE,KAAG,KAAG,CAAC,GAAEG,KAAE,MAAIC,KAAED,MAAG,IAAE,MAAK,KAAGC,QAAK,KAAG,MAAIA,KAAE,OAAKD,IAAEA,KAAE,MAAIC,MAAG,KAAGD,MAAG,IAAE,QAAM,KAAGA,IAAEA,KAAE,OAAKA,KAAGK,GAAEP,MAAG,CAAC,IAAEE,KAAEK,GAAEP,MAAG,CAAC,GAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEG,KAAEC,IAAEG,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEQ,GAAER,KAAE,OAAK,CAAC,IAAE;AAAA,gBAAC;AAAC,yBAASgC,GAAEhC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAE,OAAK,IAAEV,MAAI,CAAAM,KAAED,IAAGN,MAAGC,MAAG,KAAGF,KAAE,KAAG,MAAI,CAAC,GAAES,KAAEF,GAAEN,KAAE,MAAI,CAAC,GAAEE,KAAEI,GAAEN,KAAE,MAAI,CAAC,GAAES,KAAEH,GAAEN,KAAE,MAAI,CAAC,GAAEW,KAAEL,GAAEN,KAAE,MAAI,CAAC,GAAEG,KAAEO,GAAET,IAAE,CAAC,IAAEH,KAAE,GAAEO,KAAE,MAAIC,GAAEN,KAAE,KAAG,CAAC,KAAG,KAAG,IAAEM,GAAEN,MAAG,CAAC,GAAEA,KAAE,IAAEM,GAAEN,KAAE,KAAG,CAAC,IAAE,GAAEI,GAAE,IAAED,EAAC,IAAEE,KAAEL,MAAG,GAAEK,KAAE,MAAIH,MAAG,KAAG,GAAEA,KAAE,IAAEO,KAAE,GAAEL,GAAED,KAAE,IAAE,CAAC,IAAEE,KAAE,KAAGM,MAAG,MAAI,MAAIT,QAAK,GAAEE,GAAED,KAAE,IAAE,CAAC,IAAE,MAAII,MAAG,KAAG,KAAGC,MAAG,MAAI,MAAIR,QAAK,IAAEE,MAAG,GAAED,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS8B,GAAEjC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,kBAAAT,KAAEK,GAAEN,MAAG,CAAC;AAAE,oBAAE,YAAO;AAAC,wBAAGD,GAAE,MAAIoB,GAAElB,EAAC,GAAED,KAAE,OAAI;AAAC,0BAAG,OAAK,IAAEA,KAAG;AAAC,wBAAAD,KAAEA,KAAE,IAAE,GAAED,KAAEA,KAAE,MAAI;AAAE,iCAAS;AAAA,sBAAC;AAAC,2BAAIW,MAAGP,KAAEF,MAAG,KAAGF,KAAE,GAAEY,KAAEJ,IAAGJ,KAAEA,KAAED,KAAE,MAAI,CAAC,GAAEM,KAAED,GAAEJ,KAAE,KAAG,CAAC,GAAEC,KAAE,GAAED,KAAE,GAAE,MAAI,IAAEC,MAAGD,KAAG,CAAAG,KAAE,MAAIG,KAAEL,MAAG,IAAGC,GAAED,KAAEM,KAAE,CAAC,KAAG,KAAGD,QAAK,KAAG,KAAGD,OAAIF,KAAE,MAAI,KAAGA,MAAG,IAAEE,OAAI,KAAGF,KAAEK,OAAIL,IAAEH,MAAGC,KAAEA,KAAE,IAAE,KAAGD,KAAEA,KAAE,IAAE;AAAE,sBAAAF,KAAEA,KAAE,IAAE;AAAE;AAAA,oBAAQ;AAAC;AAAA,kBAAK;AAAA,gBAAC;AAAC,yBAASgC,GAAElC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAF,MAAGE,MAAG,KAAGN,KAAE,GAAEE,KAAEU,GAAEN,IAAE,CAAC,IAAEL,KAAE,GAAEE,KAAEM,GAAE,IAAEP,EAAC,GAAEM,GAAEJ,MAAG,CAAC,IAAED,IAAEA,MAAGM,GAAEP,KAAE,IAAE,CAAC,KAAG,GAAEM,GAAEJ,MAAG,CAAC,IAAED,IAAEA,MAAGM,GAAEP,KAAE,IAAE,CAAC,KAAG,KAAG,QAAOM,GAAEJ,MAAG,CAAC,IAAED,IAAEE,KAAEI,GAAEP,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEM,GAAEJ,KAAE,KAAG,CAAC,IAAEC,IAAEA,MAAGI,GAAEP,KAAE,IAAE,CAAC,KAAG,GAAEM,GAAEJ,KAAE,KAAG,CAAC,IAAEC,IAAEH,KAAEO,GAAEP,KAAE,IAAE,CAAC,GAAEM,GAAEJ,MAAG,CAAC,IAAE,SAAOD,IAAEK,GAAEJ,KAAE,KAAG,CAAC,IAAE,UAAQC,KAAEH,MAAG,KAAII,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS6B,GAAEnC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,EAAEL,OAAI,KAAGE,OAAI,IAAEE,OAAI,IAAE,OAAM,CAAAC,MAAGF,KAAEK,GAAEP,KAAEG,KAAE,CAAC,OAAK,IAAE,GAAEA,KAAEA,KAAE,IAAE,GAAE,OAAK,KAAGD,MAAG,SAAOI,IAAGL,MAAG,KAAGH,MAAG,CAAC,IAAE,KAAGY,GAAEA,GAAER,IAAE,GAAG,MAAI,KAAG,GAAE,CAAC,IAAEA,KAAE,IAAGD,KAAEA,KAAE,IAAE,IAAG,OAAK,IAAEG,MAAGL,OAAI,KAAGE,OAAI,MAAIK,IAAGL,MAAG,KAAGH,MAAG,CAAC,IAAE,KAAGY,GAAEA,GAAEN,IAAE,GAAG,MAAI,KAAG,GAAE,CAAC,IAAEA,KAAE,IAAGH,KAAEA,KAAE,IAAE;AAAG,yBAAOA;AAAA,gBAAC;AAAC,yBAASiC,GAAEpC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAEL,OAAI;AAAC,yBAAIc,KAAEb,KAAEa,KAAE,OAAK,GAAE4B,GAAEvC,MAAGH,MAAG,MAAIH,KAAE,GAAEO,KAAEK,GAAET,IAAE,IAAI,IAAEF,KAAE,GAAEC,EAAC,GAAEG,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAwC,GAAEzC,KAAGI,KAAEH,MAAG,MAAIE,KAAE,GAAEL,KAAEM,KAAE,CAAC,GAAE,EAAEF,IAAEA,IAAEF,EAAC,GAAEC,KAAEA,KAAE,IAAE;AAAE,oBAAAY,KAAEb,KAAE,OAAK,GAAED,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASkC,GAAErC,IAAEC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,EAAEN,OAAI,KAAGI,OAAI,MAAID,KAAEG,KAAE,IAAE,OAAK,IAAEJ,OAAI,KAAI,CAAAG,KAAEJ,KAAEK,KAAE,GAAEA,KAAEH,KAAGA,KAAEK,GAAEH,KAAE,IAAE,CAAC,KAAG,KAAG,UAAQG,GAAE,IAAEH,EAAC,IAAEG,GAAEH,KAAE,IAAE,CAAC,KAAG,OAAK,IAAE,YAAUE,IAAGH,MAAG,KAAGL,MAAG,CAAC,IAAEI,IAAEC,KAAEA,KAAE,IAAE;AAAG,yBAAOA;AAAA,gBAAC;AAAC,yBAASiC,GAAEtC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,EAAE,CAACH,KAAE,MAAI,IAAEF,OAAK,CAAAG,KAAEI,GAAET,KAAEE,KAAE,CAAC,GAAED,KAAE,MAAIE,KAAED,MAAG,KAAI,KAAGC,QAAK,KAAG,MAAIA,KAAEE,MAAGJ,IAAEA,KAAE,MAAIE,MAAG,KAAGF,MAAG,IAAEI,OAAI,KAAGJ,IAAEA,KAAEI,MAAGJ,KAAGK,MAAGL,IAAEM,MAAGJ,IAAEC,MAAGF,KAAEA,KAAE,IAAE,KAAGE,KAAEA,KAAE,IAAE;AAAE,yBAAOc,KAAEX,IAAED;AAAA,gBAAC;AAAC,yBAASiC,GAAEvC,IAAEC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,IAAEC,IAAEC,IAAEC,IAAEC,KAAE,GAAEC,KAAE;AAAE,yBAAOF,KAAEK,GAAEJ,KAAEN,OAAI,KAAG,GAAEO,KAAET,OAAI,KAAG,CAAC,GAAEQ,MAAG,SAAOC,OAAIH,KAAEM,GAAER,KAAE,QAAMF,IAAEG,KAAE,QAAML,EAAC,OAAK,KAAG,KAAGY,GAAEH,IAAEL,EAAC,IAAE,MAAIQ,GAAEJ,IAAEH,EAAC,IAAE,GAAEa,MAAGN,GAAEX,IAAEC,EAAC,IAAEK,KAAE,KAAGK,GAAEZ,IAAEG,EAAC,KAAGM,OAAI,OAAKD,OAAI,MAAI,GAAE,QAAMF,KAAEE,MAAG;AAAA,gBAAE;AAAC,yBAASgC,GAAExC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAE,MAAI,IAAEL,OAAI;AAAC,yBAAIE,MAAGH,KAAEC,MAAG,MAAIJ,KAAE,GAAEO,KAAEN,KAAEE,KAAE,GAAEM,KAAEP,KAAEC,KAAE,GAAEA,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAK,GAAEF,MAAGD,KAAEF,MAAG,MAAI,CAAC,IAAEK,GAAEH,KAAEE,MAAG,CAAC,IAAEC,GAAEH,KAAEI,MAAG,CAAC,GAAEN,KAAEA,KAAE,IAAE;AAAE,oBAAAC,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASqC,GAAEzC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,IAAEC;AAAE,uBAAIa,KAAEd,KAAEc,KAAE,MAAI,GAAE,EAAEb,KAAED,KAAE,KAAG,GAAEF,IAAEC,EAAC,GAAE,GAAGD,KAAEE,KAAE,KAAG,GAAE,KAAIC,EAAC,GAAEF,KAAEiC,GAAEnC,IAAE,KAAIC,EAAC,GAAEC,OAAI,KAAG,MAAK,IAAGD,KAAEE,KAAE,KAAG,GAAE,KAAIA,KAAE,KAAG,CAAC,GAAED,KAAEiC,IAAGjC,MAAG,KAAGF,KAAE,GAAE,MAAIE,KAAE,GAAED,EAAC,IAAEC,KAAE;AAAE,qBAAGC,KAAE,KAAG,CAAC,GAAEc,KAAEd,KAAE,MAAI;AAAA,gBAAC;AAAC,yBAASuC,GAAE1C,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAE,MAAI,IAAEJ,OAAI;AAAC,yBAAIE,MAAGF,MAAG,KAAGH,KAAE,GAAEO,MAAGJ,MAAG,MAAIF,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAE,MAAGF,MAAG,KAAGK,KAAE,GAAED,GAAEJ,KAAEG,KAAE,CAAC,IAAEG,GAAEJ,KAAE,KAAG,CAAC,KAAG,IAAEI,GAAEJ,MAAG,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,oBAAAC,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASwC,GAAE3C,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAEH,OAAI;AAAC,yBAAIG,MAAGH,MAAG,MAAIF,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAG,KAAEI,IAAGL,MAAGF,MAAG,KAAGI,KAAE,MAAI,CAAC,GAAEG,GAAEL,MAAG,CAAC,IAAEC,MAAGA,MAAG,KAAG,UAASH,KAAEA,KAAE,IAAE;AAAE,oBAAAC,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAAS0C,GAAE5C,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE;AAAE,uBAAID,KAAED,IAAEA,KAAEmB,GAAE,GAAG,GAAEX,GAAEP,MAAG,CAAC,IAAED,IAAEA,OAAIc,GAAE,GAAG,GAAET,GAAE,IAAG,OAAK,IAAEH,MAAI,CAAAM,IAAGP,KAAED,MAAGE,MAAG,KAAG,MAAI,CAAC,IAAE,GAAEM,GAAEP,KAAE,KAAG,CAAC,IAAE,GAAEC,KAAEA,KAAE,IAAE;AAAE,kBAAAM,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEQ,GAAER,KAAE,OAAK,CAAC,IAAE;AAAA,gBAAC;AAAC,yBAAS6C,GAAE7C,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAED,MAAI,CAAAD,KAAEoC,GAAEpC,KAAEK,IAAGH,KAAED,MAAG,KAAGF,MAAG,CAAC,GAAEC,MAAG,IAAGA,KAAEK,GAAEP,KAAEI,MAAG,CAAC,GAAEF,MAAG,EAAE,GAAEK,GAAER,KAAEK,MAAG,CAAC,IAAE,GAAGF,IAAEe,EAAC,GAAEd,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAASgB,GAAEpB,IAAE;AAAC,sBAAIC,IAAEC;AAAE,0BAAOF,MAAGC,KAAEO,GAAE,GAAG,MAAIN,KAAEF,KAAE,IAAE,MAAI,OAAK,KAAGC,OAAI,KAAGC,MAAGF,OAAI,KAAGG,GAAE,aAAW,QAAM,MAAI,OAAK,KAAG,EAAE,IAAEa,GAAE,IAAEhB,EAAC,MAAIQ,GAAE,GAAG,IAAE,IAAG,OAAKA,GAAE,GAAG,IAAER,IAAEC;AAAA,gBAAE;AAAC,yBAAS6C,GAAE9C,IAAEC,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE;AAAE,uBAAI,IAAEF,OAAI,QAAQ,YAAO;AAAC,wBAAG,QAAM,IAAEE,IAAG,QAAO;AAAE,wBAAGD,KAAEC,MAAG,GAAEA,KAAEA,KAAE,IAAE,GAAE,IAAID,KAAEM,GAAER,KAAEE,MAAG,CAAC,MAAIA,MAAG,IAAEA,MAAG,MAAI,MAAI,IAAED,KAAI;AAAA,kBAAK;AAAC,yBAAO;AAAA,gBAAC;AAAC,yBAAS8C,GAAE/C,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAEF,MAAI,CAAAE,KAAEK,IAAGN,MAAGD,MAAG,KAAGD,KAAE,MAAI,CAAC,GAAEQ,GAAEN,MAAG,CAAC,IAAEC,KAAES,GAAET,KAAE,WAAS,IAAG,QAAQ,GAAEF,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,EAAED,IAAEC,IAAE;AAAC,sBAAIC;AAAE,yBAAOA,KAAEF,IAAEA,KAAEY,GAAEX,KAAE,OAAK,GAAE,IAAI,IAAE,YAAU,KAAG,IAAGA,KAAEW,GAAEZ,IAAE,OAAO,IAAEC,KAAE,GAAEO,GAAEN,MAAG,CAAC,MAAI,IAAED,MAAG,UAAQ,WAAS,KAAGA,IAAED;AAAA,gBAAC;AAAC,yBAAS,EAAEA,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,OAAI;AAAC,wBAAG,MAAI,IAAED,IAAG,QAAO;AAAE,wBAAGC,KAAED,MAAG,IAAGA,KAAEA,KAAE,IAAE,GAAE6C,GAAE9C,KAAEE,KAAE,GAAE,MAAM,EAAE;AAAA,kBAAK;AAAC,yBAAO;AAAA,gBAAC;AAAC,yBAAS,EAAEF,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,OAAI;AAAC,wBAAG,MAAI,IAAED,IAAG,QAAO;AAAE,wBAAGC,KAAED,MAAG,IAAGA,KAAEA,KAAE,IAAE,GAAE4C,GAAE9C,KAAEG,KAAE,GAAEF,EAAC,EAAE;AAAA,kBAAK;AAAC,yBAAO;AAAA,gBAAC;AAAC,yBAAS,EAAED,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAED,MAAI,CAAAK,IAAGJ,KAAED,MAAG,KAAGH,MAAG,CAAC,IAAEQ,GAAEN,KAAEE,MAAG,CAAC,IAAEI,GAAEP,KAAEG,MAAG,CAAC,GAAED,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,EAAEH,IAAEC,IAAEC,IAAE;AAAC,sBAAIC;AAAE,kBAAAc,KAAEd,KAAEc,KAAE,KAAG,GAAEX,GAAEH,KAAE,KAAG,CAAC,IAAED,IAAEI,GAAEH,KAAE,KAAG,CAAC,IAAED,OAAI,GAAE0C,GAAE5C,EAAC,GAAE,GAAGA,IAAEC,IAAE,EAAE,GAAE,GAAGD,IAAEG,KAAE,KAAG,GAAE,CAAC,GAAE,GAAGH,EAAC,GAAEiB,KAAEd,KAAE,KAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGH,IAAEC,IAAE;AAAC,sBAAIC,KAAE;AAAE,yBAAOqC,GAAEvC,IAAEC,IAAE,GAAE,QAAQ,GAAEC,KAAEqC,GAAErC,KAAEgB,IAAEhB,MAAG,IAAG,UAAS,EAAE,GAAED,KAAEA,KAAEiB,KAAE,GAAElB,KAAEE,OAAI,IAAEF,OAAI,IAAEC,KAAE,IAAE,IAAEA;AAAA,gBAAC;AAAC,yBAAS,GAAGD,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAED,MAAI,IAAGC,KAAED,MAAG,MAAIH,KAAE,GAAEC,KAAEG,KAAE,GAAEF,KAAEE,KAAE,CAAC,GAAED,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGH,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAED,MAAI,CAAA0C,IAAGzC,KAAED,MAAG,MAAIH,KAAE,GAAEC,IAAEC,KAAEE,KAAE,CAAC,GAAED,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGH,IAAEC,IAAE;AAAC,sBAAIC,KAAE;AAAE,uBAAIA,KAAE,MAAKI,GAAE,IAAEN,EAAC,IAAES,GAAE,IAAER,EAAC,GAAED,KAAEA,KAAE,IAAE,GAAEC,KAAEA,KAAE,IAAE,GAAEC,KAAEA,KAAE,IAAE,IAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAEC,IAAE;AAAC,2BAAQC,KAAE,IAAG,IAAED,QAAK,IAAEC,MAAI,CAAA4B,IAAG5B,MAAG,MAAIF,KAAE,CAAC,GAAEE,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAE;AAAC,2BAAQC,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA8C,IAAG9C,MAAG,MAAID,KAAE,CAAC,GAAEC,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGD,IAAE;AAAC,2BAAQC,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA2B,IAAG3B,MAAG,MAAID,KAAE,CAAC,GAAEC,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGD,IAAE;AAAC,sBAAIC;AAAE,0BAAO,QAAMA,KAAE,KAAGD,MAAG,OAAKC,MAAG,OAAKD,KAAE,IAAEA,KAAE,MAAI,QAAMA;AAAA,gBAAC;AAAC,yBAAS,GAAGA,IAAE;AAAC,yBAAOA,KAAE,KAAGa,GAAEb,KAAE,IAAEA,EAAC,IAAE,IAAE;AAAA,gBAAE;AAAC,yBAAS,GAAGA,IAAEC,IAAEC,IAAE;AAAC,kBAAAuB,GAAEzB,IAAEC,IAAEO,GAAEN,MAAG,CAAC,GAAE,GAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAEC,IAAEC,IAAE;AAAC,kBAAAsB,GAAEhB,GAAER,MAAG,CAAC,GAAE,KAAIC,IAAEC,EAAC;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAEC,IAAEC,IAAE;AAAC,kBAAAuB,GAAEzB,IAAEC,IAAEO,GAAEN,MAAG,CAAC,GAAE,GAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAEC,IAAEC,IAAE;AAAC,kBAAAsB,GAAEhB,GAAER,MAAG,CAAC,GAAE,KAAIC,IAAEC,EAAC;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAE;AAAC,kBAAA+B,GAAEvB,GAAER,MAAG,CAAC,GAAE,GAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGA,IAAE;AAAC,kBAAAsB,GAAEd,GAAER,MAAG,CAAC,CAAC;AAAA,gBAAC;AAAC,yBAAS,GAAGA,IAAE;AAAC,qBAAGA,IAAE,CAAC;AAAA,gBAAC;AAAC,yBAAS,GAAGA,IAAE;AAAC,qBAAGA,IAAE,CAAC;AAAA,gBAAC;AAAC,gBAAAI,GAAEH,KAAEQ,IAAE,MAAK,8GAA8G,GAAEL,GAAEH,IAAE,MAAK,slDAAslD,GAAEG,GAAEH,IAAE,MAAK,MAAM;AAAE,oBAAI,IAAG,OAAK,KAAG,CAAC,GAAG,MAAI,SAASD,IAAEC,IAAE;AAAC,uBAAKD,EAAC,IAAEC;AAAA,gBAAC,GAAE,GAAG,MAAI,SAASD,IAAE;AAAC,yBAAO,KAAKA,EAAC;AAAA,gBAAC,GAAE;AAAI,uBAAM,EAAC,GAAE,WAAU;AAAA,gBAAC,GAAE,GAAE,IAAG,GAAEmB,IAAE,GAAEG,IAAE,GAAE,WAAU;AAAC,sBAAItB;AAAE,kBAAAiB,KAAEjB,KAAEiB,KAAE,KAAG,GAAEX,GAAEN,KAAE,KAAG,CAAC,IAAE,GAAEe,GAAE,MAAKf,KAAE,KAAG,GAAE,CAAC,GAAEiB,KAAEjB,KAAE,KAAG;AAAA,gBAAC,GAAE,GAAE,WAAU;AAAC,yBAAO;AAAA,gBAAI,GAAE,GAAE,WAAU;AAAC,yBAAO;AAAA,gBAAI,GAAE,GAAE,WAAU;AAAC,yBAAO;AAAA,gBAAI,GAAE,GAAE,SAASA,IAAEC,IAAE;AAAC,kBAAAD,MAAG,GAAEC,MAAG;AAAE,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEG,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE;AAAE,uBAAIL,KAAEf,KAAEe,KAAE,QAAM,GAAEP,KAAER,KAAE,QAAM,GAAE,OAAK,IAAEE,MAAI,CAAAa,KAAEV,KAAEU,KAAE,KAAG,GAAEX,GAAEC,KAAE,KAAG,CAAC,IAAE,GAAEI,KAAE,IAAEI,GAAE,MAAKR,KAAE,KAAG,GAAE,CAAC,GAAEU,KAAEV,KAAE,KAAG,GAAED,GAAEF,KAAEM,KAAE,CAAC,IAAEC,IAAEP,KAAEA,KAAE,IAAE;AAAE,uBAAImB,GAAEb,IAAE,KAAIA,IAAE,EAAE,GAAEiB,GAAEpB,KAAEL,KAAE,QAAM,GAAEQ,EAAC,GAAEM,KAAEd,KAAE,QAAM,GAAEE,KAAEF,KAAE,QAAM,GAAE,MAAI,IAAEC,MAAI,CAAAsC,GAAEzB,MAAGb,MAAG,MAAI,GAAEC,IAAE,QAAMC,EAAC,GAAEF,KAAEA,KAAE,IAAE,GAAEE,KAAEA,KAAE,IAAE;AAAE,uBAAIa,KAAEhB,KAAE,QAAM,GAAEC,KAAE,GAAEE,KAAE,GAAE,MAAI,IAAEF,MAAI,CAAAsC,GAAEvB,MAAGf,MAAG,MAAI,GAAEC,IAAE,QAAMC,EAAC,GAAEF,KAAEA,KAAE,IAAE,GAAEE,KAAEA,KAAE,IAAE;AAAE,uBAAI,GAAGF,KAAED,KAAE,QAAM,GAAEc,EAAC,GAAE,GAAGb,EAAC,GAAEiC,GAAE/B,KAAEH,KAAG,QAAM,GAAEK,IAAEJ,EAAC,GAAE,GAAGE,EAAC,GAAE,GAAGA,EAAC,GAAE,GAAGA,IAAEA,IAAEa,EAAC,GAAEyB,GAAEtC,EAAC,GAAEF,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAIgB,MAAGf,KAAED,MAAG,MAAIE,KAAE,GAAEQ,KAAET,KAAEF,KAAE,GAAEY,KAAEV,KAAEC,KAAE,GAAED,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAO,MAAGU,KAAEb,IAAGD,KAAEH,MAAG,KAAGU,MAAG,CAAC,KAAG,OAAK,GAAEN,GAAED,KAAEM,MAAG,CAAC,IAAEQ,MAAG,QAAMV,KAAGH,GAAED,KAAEY,MAAG,CAAC,IAAER,MAAG,IAAGP,KAAEA,KAAE,IAAE;AAAE,oBAAAD,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,uBAAIA,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAG,GAAEN,KAAEG,KAAE,CAAC,IAAEM,GAAEN,KAAEO,KAAE,CAAC,GAAEP,KAAEA,KAAE,IAAE;AAAE,uBAAIgB,KAAEnB,KAAE,KAAG,GAAEG,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAIU,KAAEM,KAAEP,GAAET,IAAE,GAAG,IAAE,GAAEW,KAAET,MAAGF,MAAG,MAAI,GAAEI,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAI,KAAEE,KAAED,GAAEL,IAAE,CAAC,IAAE,GAAEH,KAAEU,MAAGP,MAAG,KAAG,GAAED,GAAE,IAAEK,EAAC,IAAEH,GAAEJ,MAAG,CAAC,GAAEE,GAAEK,KAAE,IAAE,CAAC,IAAEH,GAAEJ,KAAE,KAAG,CAAC,KAAG,IAAEI,GAAEJ,MAAG,CAAC,MAAI,GAAEE,GAAEK,KAAE,IAAE,CAAC,IAAEH,GAAEJ,KAAE,KAAG,CAAC,KAAG,IAAEI,GAAEJ,KAAE,KAAG,CAAC,MAAI,GAAEE,GAAEK,KAAE,IAAE,CAAC,IAAEH,GAAEJ,KAAE,MAAI,CAAC,KAAG,IAAEI,GAAEJ,KAAE,KAAG,CAAC,MAAI,GAAEE,GAAEK,KAAE,IAAE,CAAC,IAAEH,GAAEJ,KAAE,MAAI,CAAC,MAAI,GAAEG,KAAEA,KAAE,IAAE;AAAE,oBAAAJ,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,uBAAIoB,GAAElB,KAAEH,KAAE,QAAM,GAAE,IAAGF,IAAE,IAAI,GAAEA,KAAEE,KAAE,QAAM,GAAEC,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAG,GAAEL,KAAEE,KAAE,CAAC,IAAEM,GAAEN,KAAEO,KAAE,CAAC,GAAEP,KAAEA,KAAE,IAAE;AAAE,uBAAIC,KAAEH,KAAE,KAAG,GAAEE,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAG,GAAEH,KAAEC,KAAE,CAAC,IAAEK,GAAET,KAAEG,KAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIH,KAAEC,KAAG,MAAI,GAAEE,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAG,GAAEN,KAAEG,KAAE,CAAC,IAAEM,GAAEN,KAAEE,KAAE,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,uBAAIH,KAAEC,KAAE,KAAG,GAAEE,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA6B,GAAEhC,KAAEY,GAAET,IAAE,EAAE,IAAE,GAAEa,MAAGb,MAAG,MAAI,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIH,KAAEC,KAAE,MAAI,GAAEE,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA6B,GAAEhC,KAAEY,GAAET,IAAE,EAAE,IAAE,GAAEe,MAAGf,MAAG,MAAI,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIQ,KAAEV,KAAE,OAAK,GAAEE,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAIa,KAAEL,KAAEC,GAAET,IAAE,GAAG,IAAE,GAAEe,MAAGf,MAAG,MAAID,KAAE,GAAEG,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAc,KAAEX,IAAGP,KAAEiB,MAAGb,MAAG,KAAG,KAAG,MAAI,CAAC,GAAEQ,KAAEL,GAAEP,KAAE,KAAG,CAAC,GAAEa,KAAEN,GAAEP,KAAE,MAAI,CAAC,GAAEM,KAAEC,GAAEP,KAAE,MAAI,CAAC,GAAES,KAAEF,GAAEP,KAAE,MAAI,CAAC,GAAEG,KAAEI,GAAEP,KAAE,MAAI,CAAC,GAAEoB,KAAEb,GAAEP,KAAE,KAAG,CAAC,GAAED,KAAEgB,KAAEJ,GAAEP,IAAE,EAAE,IAAE,GAAEiB,KAAE,OAAKd,GAAEP,MAAG,CAAC,IAAE,GAAEK,GAAE,IAAEN,EAAC,IAAEsB,IAAErB,KAAE,OAAKoB,KAAE,GAAEf,GAAEN,KAAE,IAAE,CAAC,IAAEC,OAAI,GAAEG,KAAE,OAAKA,KAAE,GAAEE,GAAEN,KAAE,IAAE,CAAC,IAAEI,OAAI,GAAEM,KAAE,OAAKA,KAAE,GAAEJ,GAAEN,KAAE,IAAE,CAAC,IAAEU,OAAI,GAAEH,KAAE,OAAKA,KAAE,GAAED,GAAEN,KAAE,KAAG,CAAC,IAAEO,OAAI,GAAEO,KAAE,OAAKA,KAAE,GAAER,GAAEN,KAAE,KAAG,CAAC,IAAEc,OAAI,GAAER,GAAEN,KAAE,IAAE,CAAC,IAAEC,MAAG,IAAEqB,OAAI,GAAET,KAAE,OAAKA,KAAE,GAAEP,GAAEN,KAAE,IAAE,CAAC,IAAEa,MAAG,IAAEZ,OAAI,IAAGK,GAAEN,KAAE,IAAE,CAAC,IAAEI,MAAG,IAAES,OAAI,GAAEP,GAAEN,KAAE,IAAE,CAAC,IAAEU,MAAG,IAAEN,OAAI,GAAEH,KAAE,OAAKkB,KAAE,GAAEb,GAAEN,KAAE,IAAE,CAAC,IAAEC,MAAG,IAAES,OAAI,IAAGJ,GAAEN,KAAE,IAAE,CAAC,IAAEO,MAAG,IAAEN,OAAI,GAAEK,GAAEN,KAAE,KAAG,CAAC,IAAEc,MAAG,IAAEP,OAAI,IAAGF,KAAEA,KAAE,IAAE;AAAE,oBAAAF,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,yBAAOc,KAAEf,KAAE,QAAM,GAAE;AAAA,gBAAC,GAAE,GAAE,SAASF,IAAEC,IAAEC,IAAEC,IAAE;AAAC,kBAAAF,MAAG,GAAEC,MAAG,GAAEC,MAAG;AAAE,sBAAIC,IAAEC,IAAEK,IAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAE+C,KAAE,GAAEzC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE;AAAE,uBAAIpC,MAAGL,MAAG,KAAG,IAAE,GAAEiB,KAAEb,MAAGa,KAAEP,KAAEO,KAAE,KAAG,KAAG,SAAO,GAAEJ,KAAE2D,KAAEpE,KAAE,SAAO,GAAEU,KAAEiB,KAAE3B,KAAE,SAAO,GAAEW,KAAEX,KAAE,SAAO,GAAEY,KAAEZ,KAAE,QAAM,GAAEc,KAAEd,KAAE,QAAM,GAAEe,KAAEf,KAAE,QAAM,GAAE,OAAK,IAAEO,MAAI,CAAAL,GAAEK,KAAEE,KAAE,CAAC,IAAEJ,GAAEN,KAAEQ,KAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIE,KAAEV,KAAE,KAAG,GAAEQ,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAL,GAAEK,KAAEI,KAAE,CAAC,IAAEN,GAAEE,KAAEE,KAAE,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,uBAAIE,KAAEV,KAAG,MAAI,GAAEQ,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAL,GAAEK,KAAEG,KAAE,CAAC,IAAEL,GAAEE,KAAEE,KAAE,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,uBAAIE,KAAEV,KAAE,KAAG,GAAEQ,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAkB,GAAEX,MAAGP,MAAG,MAAI,GAAEE,KAAED,GAAED,IAAE,EAAE,IAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIE,KAAEV,KAAE,MAAI,GAAEQ,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAkB,GAAEV,MAAGR,MAAG,MAAI,GAAEE,KAAED,GAAED,IAAE,EAAE,IAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAI0B,KAAElC,KAAE,OAAK,GAAEQ,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAI2B,KAAEtB,MAAGL,MAAG,MAAI,GAAE4B,KAAEF,KAAEzB,GAAED,IAAE,GAAG,IAAE,GAAEG,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAX,KAAEmC,MAAGxB,MAAG,KAAG,GAAED,KAAE0B,KAAE3B,GAAEE,IAAE,EAAE,IAAE,GAAEkB,KAAEvB,GAAE,IAAEI,EAAC,GAAEL,GAAEL,MAAG,CAAC,IAAE6B,IAAEA,MAAGvB,GAAEI,KAAE,IAAE,CAAC,KAAG,IAAE,MAAKL,GAAEL,MAAG,CAAC,IAAE6B,IAAEX,KAAEZ,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,KAAG,CAAC,IAAEkB,IAAEA,MAAGZ,GAAEI,KAAE,IAAE,CAAC,KAAG,GAAEL,GAAEL,KAAE,KAAG,CAAC,IAAEkB,IAAEA,MAAGZ,GAAEI,KAAE,IAAE,CAAC,KAAG,KAAG,MAAKL,GAAEL,KAAE,KAAG,CAAC,IAAEkB,IAAEY,KAAExB,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,KAAG,CAAC,IAAE8B,IAAEA,MAAGxB,GAAEI,KAAE,IAAE,CAAC,KAAG,IAAE,MAAKL,GAAEL,KAAE,KAAG,CAAC,IAAE8B,IAAEX,KAAEb,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEmB,IAAEA,MAAGb,GAAEI,KAAE,IAAE,CAAC,KAAG,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEmB,IAAEA,MAAGb,GAAEI,KAAE,IAAE,CAAC,KAAG,IAAE,MAAKL,GAAEL,KAAE,MAAI,CAAC,IAAEmB,IAAEE,KAAEf,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEqB,IAAEA,MAAGf,GAAEI,KAAE,IAAE,CAAC,KAAG,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEqB,IAAEA,MAAGf,GAAEI,KAAE,IAAE,CAAC,KAAG,KAAG,MAAKL,GAAEL,KAAE,MAAI,CAAC,IAAEqB,IAAEW,KAAE1B,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEgC,IAAEA,MAAG1B,GAAEI,KAAE,IAAE,CAAC,KAAG,IAAE,MAAKL,GAAEL,KAAE,MAAI,CAAC,IAAEgC,IAAEV,KAAEhB,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEsB,IAAEA,MAAGhB,GAAEI,KAAE,KAAG,CAAC,KAAG,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEsB,IAAEA,MAAGhB,GAAEI,KAAE,KAAG,CAAC,KAAG,KAAG,MAAKL,GAAEL,KAAE,MAAI,CAAC,IAAEsB,IAAEgB,KAAEhC,GAAEI,KAAE,KAAG,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEsC,IAAE5B,KAAEJ,GAAEI,KAAE,KAAG,CAAC,GAAEL,GAAEL,KAAE,KAAG,CAAC,IAAE,OAAKkB,IAAEb,GAAEL,MAAG,CAAC,IAAE,OAAK6B,IAAExB,GAAEL,KAAE,KAAG,CAAC,IAAE,OAAK8B,IAAEzB,GAAEL,KAAE,MAAI,CAAC,IAAE,OAAKmB,IAAEd,GAAEL,KAAE,MAAI,CAAC,IAAE,OAAKqB,IAAEhB,GAAEL,KAAE,MAAI,CAAC,IAAE,OAAKgC,IAAE3B,GAAEL,KAAE,MAAI,CAAC,IAAE,OAAKsB,IAAEjB,GAAEL,KAAE,MAAI,CAAC,IAAE,QAAMU,MAAG,IAAE4B,KAAG3B,KAAEA,KAAE,IAAE;AAAE,oBAAAH,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,uBAAIiC,GAAEzC,KAAEC,KAAE,KAAG,CAAC,GAAE,GAAGD,IAAE4B,IAAE,EAAE,GAAE,GAAG5B,IAAEF,IAAEC,EAAC,GAAE,GAAGC,EAAC,GAAE,GAAG4B,KAAE3B,KAAE,SAAO,GAAE,IAAGD,EAAC,GAAE,GAAGA,EAAC,GAAEoB,GAAEc,KAAEjC,KAAE,SAAO,GAAE,IAAGW,IAAE,EAAE,GAAEY,GAAEvB,KAAE,QAAM,GAAEoE,EAAC,GAAE,GAAGtD,EAAC,GAAE,GAAGC,EAAC,GAAE,GAAGH,EAAC,GAAEL,KAAE,OAAI;AAAC,yBAAIE,KAAET,KAAE,QAAM,GAAEU,KAAEF,GAAE,QAAMD,IAAE,CAAC,GAAEV,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAgB,KAAEf,KAAEe,KAAE,MAAI,GAAE,EAAEd,KAAED,KAAE,KAAG,GAAEmC,IAAEpC,KAAEa,KAAE,KAAK,GAAE,GAAGC,KAAEb,KAAE,KAAG,GAAE,KAAIC,EAAC,GAAE,GAAGA,EAAC,GAAE+B,GAAErB,MAAGZ,MAAG,MAAI,GAAEc,EAAC,GAAEE,KAAEf,KAAE,MAAI,GAAED,KAAEA,KAAE,IAAE;AAAE,yBAAI,GAAGE,KAAEC,KAAE,OAAK,GAAES,EAAC,GAAE,GAAGV,EAAC,GAAEiC,GAAEnC,KAAEG,KAAE,QAAM,GAAEA,KAAE,QAAM,GAAED,EAAC,GAAE,GAAGF,EAAC,GAAE,GAAGA,EAAC,GAAE0C,GAAE1C,EAAC,GAAEe,KAAEZ,KAAE,OAAK,GAAEF,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,2BAAIgB,MAAGJ,KAAEZ,MAAG,MAAID,KAAE,GAAEkB,KAAEL,KAAEE,KAAE,GAAEwD,KAAEvE,KAAEa,KAAE,GAAEA,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAN,IAAGO,KAAED,MAAG,KAAGI,MAAG,CAAC,IAAE,EAAEH,KAAEI,KAAE,GAAEX,GAAEO,KAAEyD,MAAG,CAAC,CAAC,GAAE1D,KAAEA,KAAE,IAAE;AAAE,sBAAAZ,KAAEA,KAAE,IAAE;AAAA,oBAAC;AAAC,yBAAIwC,GAAErC,IAAEJ,EAAC,GAAE2C,GAAE3C,KAAEG,KAAE,KAAG,CAAC,GAAE,GAAGH,IAAE8B,IAAE,EAAE,GAAE,GAAG9B,IAAEI,IAAE,IAAI,GAAE,GAAGJ,EAAC,GAAE,GAAGI,IAAE,IAAGJ,EAAC,GAAE,GAAGA,EAAC,GAAEyB,GAAEzB,KAAEG,KAAE,KAAG,GAAEC,EAAC,GAAEM,KAAEA,KAAE,IAAE,GAAEmB,GAAE7B,EAAC,GAAEa,KAAEV,KAAE,QAAM,GAAEF,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA2C,IAAG9B,KAAEb,MAAG,MAAIC,KAAE,GAAEF,IAAEa,KAAEC,KAAE,CAAC,GAAEb,KAAEA,KAAE,IAAE;AAAE,yBAAID,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA2B,GAAEzB,MAAGF,MAAG,MAAI,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,yBAAIA,KAAE,GAAE,MAAI,IAAEA,MAAI,IAAGC,KAAED,MAAG,MAAIE,KAAE,GAAED,KAAEC,KAAE,GAAED,KAAEW,KAAE,CAAC,GAAEZ,KAAEA,KAAE,IAAE;AAAE,yBAAIC,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA6C,GAAE5C,MAAGD,MAAG,MAAI,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,wBAAG,CAAC,EAAEC,EAAC,MAAI,GAAGD,KAAEE,KAAE,OAAK,GAAEA,KAAE,KAAG,GAAEA,KAAE,QAAM,CAAC,GAAE,GAAGF,EAAC,GAAEsC,GAAEvC,KAAEG,KAAE,OAAK,GAAEH,IAAEC,EAAC,GAAE,GAAGD,EAAC,GAAE,CAAC,EAAEA,IAAE,MAAM,MAAI,GAAGA,KAAEG,KAAE,OAAK,GAAEA,KAAE,KAAG,GAAEA,KAAE,QAAM,CAAC,GAAE,GAAGH,EAAC,GAAE,GAAGA,EAAC,GAAE,CAAC,EAAEA,IAAE,MAAM,KAAI;AAAC,2BAAI,GAAGY,KAAET,KAAE,OAAK,GAAES,IAAEK,KAAEd,KAAE,OAAK,CAAC,GAAEe,KAAEf,KAAE,QAAM,GAAEH,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAED,OAAI;AAAC,6BAAIuE,MAAGrE,KAAEF,MAAG,MAAIiB,KAAE,GAAEoB,KAAEnC,KAAEU,KAAE,GAAE0B,KAAEpC,KAAEgB,KAAE,GAAEhB,KAAE,GAAEW,KAAE,GAAE,QAAM,IAAEX,MAAI,CAAAa,KAAE,YAAU,KAAGA,KAAER,IAAGO,KAAEZ,MAAG,KAAGmC,MAAG,CAAC,MAAI,KAAG9B,GAAEO,KAAEwB,MAAG,CAAC,IAAEvB,KAAE,WAAS,IAAE,YAAWR,GAAEO,KAAEyD,MAAG,CAAC,IAAExD,IAAEF,KAAEA,KAAEE,KAAE,GAAEb,KAAEA,KAAE,IAAE;AAAE,wBAAAD,KAAEA,KAAEY,KAAE,GAAEb,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC,0BAAG,EAAEC,OAAI,IAAE,IAAI;AAAA,oBAAK;AAAA,kBAAC;AAAC,uBAAIY,KAAEV,KAAE,OAAK,GAAEW,KAAEX,KAAE,OAAK,GAAEH,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAK,GAAE,KAAGJ,KAAED,KAAEI,KAAE,EAAE,IAAEI,GAAE,IAAEP,EAAC,GAAED,KAAEA,KAAE,IAAE;AAAE,uBAAIe,KAAEX,KAAE,KAAG,GAAEJ,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAIiB,KAAEF,KAAEJ,GAAEX,IAAE,GAAG,IAAE,GAAEkB,KAAEL,MAAGb,MAAG,MAAI,GAAEC,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAW,KAAEL,IAAGG,KAAEQ,MAAGjB,MAAG,KAAG,KAAG,KAAG,CAAC,GAAEC,KAAEe,KAAEN,GAAEV,IAAE,CAAC,IAAE,GAAES,KAAE,SAAOH,GAAEG,MAAG,CAAC,IAAE,GAAEL,GAAE,IAAEH,EAAC,IAAEQ,IAAEL,GAAEH,KAAE,IAAE,CAAC,IAAEQ,OAAI,GAAEE,KAAE,SAAOA,KAAE,GAAEP,GAAEH,KAAE,IAAE,CAAC,IAAEU,OAAI,GAAEP,GAAEH,KAAE,IAAE,CAAC,IAAEU,OAAI,IAAGP,GAAEH,KAAE,IAAE,CAAC,IAAEU,MAAG,IAAEF,OAAI,IAAGT,KAAEA,KAAE,IAAE;AAAE,oBAAAD,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,uBAAIU,KAAEN,KAAE,OAAK,GAAEH,KAAE,GAAED,KAAE,OAAI;AAAC,wBAAG,OAAK,IAAEA,KAAG;AAAC,2BAAIE,KAAE,GAAE,MAAI,IAAED,OAAI;AAAC,6BAAIW,KAAEE,MAAGb,MAAG,MAAI,GAAED,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAO,GAAEK,MAAGZ,MAAG,MAAI,CAAC,MAAIK,GAAEH,KAAEQ,KAAE,CAAC,IAAEV,IAAEE,KAAEA,KAAE,IAAE,IAAGF,KAAEA,KAAE,IAAE;AAAE,wBAAAK,GAAE,MAAIJ,KAAES,KAAE,KAAG,CAAC,IAAER,IAAED,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC;AAAA,oBAAK;AAAC,oBAAAI,GAAEL,KAAEU,KAAE,CAAC,IAAE,GAAEV,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,yBAAOO,GAAEE,KAAE,MAAI,CAAC,IAAE,MAAKO,KAAEb,KAAE,SAAO,GAAEG,GAAEP,MAAG,CAAC,IAAEQ,GAAEE,KAAE,MAAI,CAAC,GAAEO,KAAEP,KAAE,KAAG,GAAE;AAAA,gBAAC,GAAE,GAAE,SAASV,IAAEC,IAAEC,IAAEC,IAAE;AAAC,kBAAAH,MAAG,GAAEC,MAAG,GAAEE,MAAG;AAAE,sBAAIC,IAAEC,KAAE,GAAEE,KAAE,GAAEI,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE;AAAE,kBAAAX,MAAGT,MAAG,KAAG,IAAE,GAAEG,KAAEK,GAAER,MAAG,CAAC,GAAEY,KAAEd,IAAEO,KAAEN,IAAEC,KAAE,GAAEe,KAAEb,KAAEa,KAAE,QAAM,GAAEI,KAAE;AAAG,oBAAE,KAAG,SAAO,IAAEhB,KAAG;AAAC,yBAAIL,KAAEI,KAAE,QAAM,GAAEc,KAAEd,KAAE,QAAM,GAAEH,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAK,GAAEN,KAAEC,KAAE,CAAC,IAAEQ,GAAER,KAAEE,KAAE,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,yBAAIc,KAAEZ,KAAE,KAAG,GAAEF,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,2BAAIe,KAAEE,MAAGjB,MAAG,MAAI,GAAEkB,KAAEJ,KAAEH,GAAEX,IAAE,GAAG,IAAE,GAAEI,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAQ,KAAEG,MAAGX,MAAG,KAAG,GAAEL,KAAEY,GAAEP,IAAE,CAAC,IAAEc,KAAE,GAAEX,GAAEK,MAAG,CAAC,IAAEJ,GAAET,KAAE,IAAE,CAAC,KAAG,IAAE,MAAIS,GAAE,IAAET,EAAC,GAAEQ,GAAEK,KAAE,KAAG,CAAC,IAAEJ,GAAET,KAAE,IAAE,CAAC,KAAG,IAAE,MAAIS,GAAET,KAAE,IAAE,CAAC,MAAI,GAAEQ,GAAEK,KAAE,KAAG,CAAC,IAAEJ,GAAET,KAAE,IAAE,CAAC,KAAG,IAAE,OAAKS,GAAET,KAAE,IAAE,CAAC,MAAI,GAAEQ,GAAEK,KAAE,MAAI,CAAC,IAAEJ,GAAET,KAAE,IAAE,CAAC,KAAG,IAAES,GAAET,KAAE,IAAE,CAAC,MAAI,GAAEK,KAAEA,KAAE,IAAE;AAAE,sBAAAJ,KAAEA,KAAE,IAAE;AAAA,oBAAC;AAAC,yBAAID,KAAEI,KAAE,QAAM,GAAEH,KAAEG,KAAE,QAAM,GAAEc,KAAEd,KAAE,KAAG,GAAE,OAAK,IAAEF,MAAI,CAAAI,GAAEN,KAAEE,KAAE,CAAC,IAAEO,GAAEP,KAAES,KAAE,CAAC,GAAET,KAAEA,KAAE,IAAE;AAAE,yBAAIF,KAAEW,KAAE,KAAG,GAAET,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAgC,GAAEjC,MAAGC,MAAG,MAAI,GAAEF,KAAEY,GAAEV,IAAE,GAAG,IAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,oBAAAS,KAAEA,KAAE,OAAK,GAAEN,KAAE,GAAEL,KAAE;AAAE,uBAAE;AAAC,iCAAO;AAAC,0BAAE,KAAG,MAAI,IAAEK,KAAG;AAAC,+BAAIQ,KAAEK,MAAGb,MAAG,MAAI,GAAEH,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAM,GAAEK,MAAGX,MAAG,MAAI,CAAC,IAAE,GAAEA,KAAEA,KAAE,IAAE;AAAE,8BAAG,GAAGD,KAAEQ,IAAGM,KAAEV,KAAEM,KAAE,KAAG,KAAG,CAAC,OAAK,IAAE,OAAKT,KAAEF,IAAEC,OAAI,IAAED,OAAI,KAAI;AAAC,mCAAKC,OAAI,IAAEC,OAAI,KAAG;AAAC,kCAAGF,OAAI,IAAEE,OAAI,KAAGD,KAAEQ,GAAE,KAAGO,KAAEd,KAAES,KAAE,EAAE,OAAK,KAAGF,GAAEO,KAAE,IAAE,CAAC,EAAE,OAAM;AAAE,8BAAAR,GAAEK,MAAGZ,MAAG,MAAI,CAAC,IAAE,GAAEC,KAAEA,KAAE,IAAE,GAAED,KAAEQ,GAAEM,KAAE,KAAG,CAAC;AAAA,4BAAC;AAAC,4BAAAV,KAAEA,KAAE,IAAE,GAAEL,KAAEC;AAAE;AAAA,0BAAQ;AAAA,wBAAC,MAAM,MAAIC,KAAEF,OAAI,KAAG,KAAG,KAAGA,QAAI;AAAC,8BAAGC,KAAE,IAAG,IAAED,QAAK,IAAEE,IAAG,OAAM;AAAE,8BAAGD,KAAED,KAAEW,KAAE,GAAEX,KAAEA,KAAE,IAAE,GAAES,GAAE,IAAER,EAAC,EAAE;AAAA,wBAAK;AAAC;AAAA,sBAAK;AAAC,sBAAAA,KAAE;AAAA,oBAAC;AAAC,wBAAG,CAACA,MAAG,CAAC,EAAEG,KAAE,QAAM,CAAC,GAAE;AAAC,2BAAImB,GAAElB,KAAED,KAAE,QAAM,GAAE,IAAGD,IAAE,IAAI,GAAEyC,GAAE5C,KAAEI,KAAE,KAAG,CAAC,GAAE,GAAGJ,IAAEK,IAAE,EAAE,GAAE,GAAGL,IAAEc,IAAEP,EAAC,GAAE,GAAGP,EAAC,GAAE,GAAGK,IAAE,IAAGL,EAAC,GAAE,GAAGA,EAAC,GAAE0B,GAAEnB,KAAEH,KAAE,QAAM,GAAEA,KAAE,QAAM,CAAC,GAAEuB,GAAE1B,KAAEG,KAAE,QAAM,GAAEA,KAAE,QAAM,CAAC,GAAE,GAAGD,KAAEC,KAAE,QAAM,CAAC,GAAEgC,GAAElC,KAAEE,KAAE,OAAK,GAAEH,IAAEE,EAAC,GAAE2B,GAAEvB,EAAC,GAAEJ,KAAEC,KAAE,QAAM,GAAEH,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,6BAAIU,KAAER,MAAGF,MAAG,MAAI,GAAEa,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAN,IAAGK,KAAEF,MAAGG,MAAG,KAAG,MAAI,CAAC,IAAEN,GAAEK,MAAG,CAAC,KAAG,IAAGC,KAAEA,KAAE,IAAE;AAAE,wBAAAb,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC,2BAAI,GAAGE,EAAC,GAAE,GAAGA,IAAEI,IAAEJ,EAAC,GAAEqC,GAAEtC,IAAEA,IAAEC,EAAC,GAAE,GAAGD,EAAC,GAAE,GAAGA,EAAC,GAAEyC,GAAEzC,EAAC,GAAEW,KAAET,KAAE,KAAG,GAAED,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,6BAAIe,MAAGjB,KAAEE,MAAG,MAAID,KAAE,GAAEa,KAAEd,KAAEC,KAAE,GAAEc,KAAEf,KAAEY,KAAE,GAAEZ,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAkB,MAAGZ,KAAEN,MAAG,KAAGiB,KAAE,GAAEI,KAAEd,GAAED,KAAES,MAAG,CAAC,GAAEC,KAAEH,KAAEG,KAAE,KAAG,GAAEV,KAAEI,KAAE,EAAEG,KAAE,KAAG,GAAEN,GAAED,KAAEQ,MAAG,CAAC,CAAC,GAAEO,OAAIf,KAAEI,KAAE,IAAE,IAAGH,GAAEM,KAAE,MAAI,CAAC,IAAE,MAAIP,KAAEI,KAAE,IAAE,MAAKM,KAAEH,KAAE,KAAG,GAAEN,GAAEW,MAAG,CAAC,IAAEZ,IAAEN,KAAEA,KAAE,IAAE;AAAE,wBAAAE,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC,2BAAIuC,GAAEzC,KAAEG,KAAE,QAAM,GAAEF,EAAC,GAAE0C,GAAE5C,EAAC,GAAE,GAAGA,IAAEK,IAAE,EAAE,GAAE,GAAGL,IAAEC,IAAE,IAAI,GAAE,GAAGD,EAAC,GAAE,GAAGI,KAAE,QAAM,GAAE,IAAGJ,EAAC,GAAE,GAAGA,EAAC,GAAEC,KAAE,OAAI;AAAC,4BAAG,OAAK,IAAEA,KAAG;AAAC,0BAAAoB,KAAE;AAAE,gCAAM;AAAA,wBAAC;AAAC,4BAAGrB,MAAGI,KAAE,QAAM,KAAGH,KAAE,GAAEC,MAAGE,KAAE,QAAM,KAAGH,KAAE,GAAEA,KAAEA,KAAE,IAAE,GAAEQ,GAAE,IAAEP,EAAC,KAAGO,GAAE,IAAET,EAAC,EAAE;AAAA,sBAAK;AAAA,oBAAC;AAAA,kBAAC;AAAC,yBAAOiB,KAAEb,KAAE,QAAM,GAAE,IAAEiB;AAAA,gBAAC,EAAC;AAAA,cAAC,GAAErB,EAAC;AAAA,YAAC,GAAEC,EAAC;AAAA,UAAC,GAAE,aAAY,SAASD,IAAEC,IAAE;AAAC,mBAAM,EAAC,MAAK,SAASC,IAAE;AAAC,kBAAIC,KAAE,IAAI,EAAE,OAAOH,EAAC;AAAE,cAAAE,GAAE,EAAC,UAAS,IAAI,EAAE,SAASC,IAAEF,EAAC,EAAC,CAAC;AAAA,YAAC,EAAC;AAAA,UAAC,GAAE,cAAa,MAAK;AAAE,cAAE,CAAC,GAAE,YAAU,EAAE,CAAC,KAAG,EAAE,iCAAiC;AAAE,cAAI,GAAE,GAAE,GAAE,GAAE,IAAE;AAAG,cAAI,GAAE,GAAE,IAAE,EAAE,kBAAgB;AAAS,cAAE,0DAAwD,IAAE,0BAAyB,KAAG,WAAS,EAAE,CAAC,GAAE,IAAE,EAAE,aAAW,EAAE,aAAW,IAAI,EAAE,OAAO,EAAC,SAAQ,IAAE,OAAM,SAAQ,IAAE,MAAK,CAAC,GAAE,IAAE,EAAE,QAAO,EAAE,QAAM,IAAE,IAAI,UAAU,CAAC,GAAE,EAAE,SAAO,IAAI,WAAW,CAAC,GAAE,EAAE,SAAO,IAAE,IAAI,WAAW,CAAC,GAAE,EAAE,SAAO,IAAE,IAAI,WAAW,CAAC,GAAE,EAAE,UAAQ,IAAI,YAAY,CAAC,GAAE,EAAE,UAAQ,IAAI,YAAY,CAAC,GAAE,EAAE,UAAQ,IAAI,aAAa,CAAC,GAAE,EAAE,UAAQ,IAAE,IAAI,aAAa,CAAC,GAAE,IAAE,EAAE,OAAO;AAAW,cAAI,IAAE,CAAC,GAAE,IAAE,CAAC,GAAE,IAAE,CAAC;AAAE,cAAI,IAAE,GAAE,IAAE,MAAK,IAAE;AAAK,mBAAS,EAAED,IAAE;AAAC,kBAAM,EAAE,WAAS,EAAE,QAAQA,EAAC,GAAE,EAAEA,KAAE,aAAWA,KAAE,GAAG,GAAE,IAAE,MAAG,GAAEA,MAAG,4CAA2C,IAAI,EAAE,aAAaA,EAAC;AAAA,UAAC;AAAC,cAAI,GAAE,GAAE,IAAE;AAAwC,mBAAS,EAAEA,IAAE;AAAC,mBAAOA,GAAE,WAAW,CAAC;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAOA,GAAE,WAAW,SAAS;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAO,QAAQ,QAAQ,EAAE,MAAM,WAAU;AAAC,sBAAO,SAASA,IAAE;AAAC,oBAAGA,MAAG,KAAG,EAAE,QAAO,IAAI,WAAW,CAAC;AAAE,oBAAIC,KAAE,EAAED,EAAC;AAAE,oBAAGC,GAAE,QAAOA;AAAE,oBAAG,EAAE,QAAO,EAAED,EAAC;AAAE,sBAAK;AAAA,cAAiD,GAAEA,EAAC;AAAA,YAAC,EAAE;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAEC,IAAEC,IAAEC,IAAE;AAAC,oBAAO,SAASH,IAAEC,IAAEC,IAAE;AAAC,qBAAO,EAAEF,EAAC,EAAE,MAAM,SAASA,IAAE;AAAC,uBAAO,EAAE,YAAYA,IAAEC,EAAC;AAAA,cAAC,EAAE,EAAE,MAAM,SAASD,IAAE;AAAC,uBAAOA;AAAA,cAAC,EAAE,EAAE,KAAKE,KAAG,SAASF,IAAE;AAAC,kBAAE,4CAA0CA,EAAC,GAAE,EAAEA,EAAC;AAAA,cAAC,EAAE;AAAA,YAAC,GAAEC,IAAEC,IAAEC,EAAC;AAAA,UAAC;AAAC,YAAE,IAAE,0BAA0B,MAAI,IAAE,GAAE,IAAE,EAAE,aAAW,EAAE,WAAW,GAAE,CAAC,IAAE,IAAE;AAAG,cAAI,IAAE,EAAC,MAAK,WAAU;AAAC,mBAAO,EAAE,eAAe;AAAA,UAAC,GAAE,MAAK,WAAU;AAAC,gBAAG,WAAS,EAAE,eAAe,KAAG;AAAC,kBAAI,IAAE,cAAY,eAAa,OAAO,SAAO,cAAY,EAAE,MAAM,KAAG,SAAO,MAAK,IAAE,WAAS,EAAE,SAAO,EAAE,SAAO,EAAE,UAAS,IAAE,WAAU;AAAC,oBAAIH,KAAE,IAAI,YAAY,CAAC;AAAE,uBAAO,EAAE,gBAAgBA,EAAC,GAAEA,GAAE,CAAC,MAAI;AAAA,cAAC;AAAE,gBAAE,GAAE,EAAE,iBAAe;AAAA,YAAC,SAAO,GAAE;AAAC,kBAAG;AAAC,oBAAI,IAAE,KAAK,SAAS,EAAE,QAAQ,GAAE,IAAE,WAAU;AAAC,sBAAIA,KAAE,EAAE,YAAY,CAAC;AAAE,0BAAOA,GAAE,CAAC,KAAG,KAAGA,GAAE,CAAC,KAAG,KAAGA,GAAE,CAAC,KAAG,IAAEA,GAAE,CAAC,OAAK;AAAA,gBAAC;AAAE,kBAAE,GAAE,EAAE,iBAAe;AAAA,cAAC,SAAOA,IAAE;AAAC,sBAAK;AAAA,cAAyC;AAAA,YAAC;AAAA,UAAC,EAAC;AAAE,mBAAS,EAAEA,IAAE;AAAC,iBAAK,OAAK,cAAa,KAAK,UAAQ,gCAAgC,OAAOA,IAAE,GAAG,GAAE,KAAK,SAAOA;AAAA,UAAC;AAAC,cAAI,IAAE,SAASA,IAAE;AAAC,mBAAKA,GAAE,SAAO,IAAG,CAAAA,GAAE,MAAM,EAAE,CAAC;AAAA,UAAC;AAAE,yBAAa,OAAO,eAAa,IAAI,YAAY,MAAM;AAAE,cAAI,GAAE,IAAE,CAAC,GAAE,IAAE,SAASA,IAAEC,IAAEC,IAAE;AAAC,gBAAIC,MAAE,SAASH,IAAEC,IAAE;AAAC,kBAAIC;AAAE,mBAAI,EAAE,SAAO,GAAED,OAAI,GAAEC,KAAE,EAAEF,IAAG,IAAG,CAAAC,MAAG,OAAKC,KAAED,IAAE,EAAE,KAAK,OAAKC,KAAE,EAAED,EAAC,IAAE,EAAEA,QAAK,CAAC,CAAC,GAAE,EAAEA;AAAE,qBAAO;AAAA,YAAC,GAAEA,IAAEC,EAAC;AAAE,mBAAO,EAAEF,EAAC,EAAE,MAAM,MAAKG,EAAC;AAAA,UAAC,GAAE,IAAE,SAASH,IAAE;AAAC,YAAAA,IAAE,MAAI,EAAE,UAAQ,EAAE,OAAOA,EAAC,GAAE,IAAE,OAAI,EAAEA,IAAE,IAAI,EAAEA,EAAC,CAAC;AAAA,UAAC,GAAE,IAAE,EAAC,GAAE,SAASA,IAAEC,IAAEC,IAAE;AAAC,mBAAO,EAAEF,IAAEC,IAAEC,EAAC;AAAA,UAAC,GAAE,GAAE,SAASF,IAAE;AAAC,cAAE;AAAO,cAAE,KAAK;AAAA,UAAC,GAAE,GAAE,SAASA,IAAEC,IAAE;AAAC,YAAAD,IAAE,EAAEA,EAAC;AAAA,UAAC,GAAE,GAAE,EAAC;AAAE,WAAC,WAAU;AAAC,gBAAIA,KAAE,EAAC,GAAE,EAAC;AAAE,qBAASC,GAAED,IAAEC,IAAE;AAAC,kBAAIC,IAAEE,KAAEJ,GAAE;AAAQ,qBAAO,EAAE,MAAII,IAAE,EAAE,IAAI,GAAEF,KAAE,EAAE,IAAI,GAAE,EAAE,QAAQA,EAAC,IAAE,SAASF,IAAE;AAAC,oBAAG,KAAI,EAAE,0BAAwB,EAAE,uBAAuB,CAAC,GAAE,KAAG,MAAI,SAAO,MAAI,cAAc,CAAC,GAAE,IAAE,OAAM,IAAG;AAAC,sBAAIC,KAAE;AAAE,sBAAE,MAAKA,GAAE;AAAA,gBAAC;AAAA,cAAC,GAAE,GAAEG;AAAA,YAAC;AAAC,gBAAG,KAAI,EAAE,0BAAwB,EAAE,uBAAuB,CAAC,GAAE,EAAE,gBAAgB,KAAG;AAAC,qBAAO,EAAE,gBAAgBJ,IAAEC,EAAC;AAAA,YAAC,SAAOD,IAAE;AAAC,qBAAO,EAAE,wDAAsDA,EAAC,GAAE;AAAA,YAAE;AAAC,cAAE,GAAE,GAAEA,KAAG,SAASA,IAAE;AAAC,cAAAC,GAAED,GAAE,QAAQ;AAAA,YAAC,EAAE;AAAA,UAAC,GAAG,GAAE,EAAE,UAAQ,WAAU;AAAC,oBAAO,EAAE,UAAQ,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,QAAM,WAAU;AAAC,oBAAO,EAAE,QAAM,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,oBAAkB,WAAU;AAAC,oBAAO,EAAE,oBAAkB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,gCAA8B,WAAU;AAAC,oBAAO,EAAE,gCAA8B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,gCAA8B,WAAU;AAAC,oBAAO,EAAE,gCAA8B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,+BAA6B,WAAU;AAAC,oBAAO,EAAE,+BAA6B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,uBAAqB,WAAU;AAAC,oBAAO,EAAE,uBAAqB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,oBAAkB,WAAU;AAAC,oBAAO,EAAE,oBAAkB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,sBAAoB,WAAU;AAAC,oBAAO,EAAE,sBAAoB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC;AAAE,mBAAS,EAAEA,IAAE;AAAC,gBAAG,EAAEA,EAAC,EAAE,SAAO,SAASA,IAAE;AAAC,kBAAG,WAAS,KAAG,GAAE;AAAC,oBAAIC,KAAE,OAAO,KAAKD,IAAE,QAAQ;AAAE,uBAAO,IAAI,WAAWC,GAAE,QAAOA,GAAE,YAAWA,GAAE,UAAU;AAAA,cAAC;AAAC,kBAAG;AAAC,yBAAQC,KAAE,KAAKF,EAAC,GAAEG,KAAE,IAAI,WAAWD,GAAE,MAAM,GAAEE,KAAE,GAAEA,KAAEF,GAAE,QAAO,EAAEE,GAAE,CAAAD,GAAEC,EAAC,IAAEF,GAAE,WAAWE,EAAC;AAAE,uBAAOD;AAAA,cAAC,SAAOH,IAAE;AAAC,sBAAM,IAAI,MAAM,2CAA2C;AAAA,cAAC;AAAA,YAAC,GAAEA,GAAE,MAAM,EAAE,MAAM,CAAC;AAAA,UAAC;AAAC,mBAAS,IAAG;AAAC,qBAASA,KAAG;AAAC,oBAAI,IAAE,MAAG,EAAE,YAAU,MAAG,MAAI,MAAG,EAAE,CAAC,GAAE,EAAE,wBAAsB,EAAE,qBAAqB,IAAE,WAAU;AAAC,oBAAG,EAAE,QAAQ,MAAI,cAAY,OAAO,EAAE,YAAU,EAAE,UAAQ,CAAC,EAAE,OAAO,IAAG,EAAE,QAAQ,SAAQ,CAAAA,KAAE,EAAE,QAAQ,MAAM,GAAE,EAAE,QAAQA,EAAC;AAAE,oBAAIA;AAAE,kBAAE,CAAC;AAAA,cAAC,GAAE;AAAA,YAAG;AAAC,gBAAE,MAAI,EAAC,WAAU;AAAC,kBAAG,EAAE,OAAO,MAAI,cAAY,OAAO,EAAE,WAAS,EAAE,SAAO,CAAC,EAAE,MAAM,IAAG,EAAE,OAAO,SAAQ,CAAAA,KAAE,EAAE,OAAO,MAAM,GAAE,EAAE,QAAQA,EAAC;AAAE,kBAAIA;AAAE,gBAAE,CAAC;AAAA,YAAC,GAAE,GAAE,IAAE,MAAI,EAAE,aAAW,EAAE,UAAU,YAAY,GAAE,YAAY,WAAU;AAAC,0BAAY,WAAU;AAAC,kBAAE,UAAU,EAAE;AAAA,cAAC,IAAG,CAAC,GAAEA,GAAE;AAAA,YAAC,IAAG,CAAC,KAAGA,GAAE;AAAA,UAAG;AAAC,cAAG,EAAE,qBAAmB,SAASA,IAAEC,IAAE;AAAC,cAAE,IAAID,IAAEC,EAAC;AAAA,UAAC,GAAE,IAAE,SAASD,KAAG;AAAC,iBAAG,EAAE,GAAE,MAAI,IAAEA;AAAA,UAAE,GAAE,EAAE,QAAQ,MAAI,cAAY,OAAO,EAAE,YAAU,EAAE,UAAQ,CAAC,EAAE,OAAO,IAAG,EAAE,QAAQ,SAAO,IAAG,GAAE,QAAQ,IAAI,EAAE;AAAE,iBAAO,EAAE,GAAE,IAAI,SAAS,SAASA,IAAEC,IAAE;AAAC,cAAE,UAAQA,IAAE,EAAE,uBAAqB,WAAU;AAAC,cAAAD,GAAE,CAAC;AAAA,YAAC;AAAA,UAAC,EAAE;AAAA,QAAC,EAAE,EAAE,MAAM,SAASA,IAAE;AAAC,iBAAO,KAAKA,EAAC,EAAE,SAAS,SAASC,IAAE;AAAC,cAAEA,EAAC,IAAED,GAAEC,EAAC;AAAA,UAAC,EAAE;AAAA,QAAC,EAAE;AAAE,YAAI,IAAE,EAAE,MAAM,MAAM,WAAU;AAAC,YAAE,kBAAkB,GAAE,IAAE,EAAE,8BAA8B,GAAE,IAAE,EAAE,8BAA8B,GAAE,IAAE,EAAE,6BAA6B;AAAA,QAAC,EAAE,GAAE,IAAE,EAAC,gBAAe,EAAE,MAAM,WAAU;AAAC,iBAAO;AAAA,QAAC,EAAE,GAAE,iBAAgB,EAAE,MAAM,WAAU;AAAC,iBAAO;AAAA,QAAC,EAAE,GAAE,OAAM,EAAE,MAAM,WAAU;AAAC,iBAAO;AAAA,QAAC,EAAE,GAAE,SAAQ,WAAU;AAAC,iBAAO,EAAE,MAAM,WAAU;AAAC,gBAAIC,KAAE,EAAE,QAAQ,CAAC,GAAEK,KAAE,EAAE,QAAQ,CAAC;AAAE,gBAAG;AAAC,qBAAO,EAAE,EAAE,qBAAqBL,IAAEK,EAAC,GAAE,EAAC,WAAU,EAAEL,IAAE,CAAC,GAAE,YAAW,EAAEK,IAAE,CAAC,EAAC,CAAC;AAAA,YAAC,UAAC;AAAQ,gBAAEL,EAAC,GAAE,EAAEK,EAAC;AAAA,YAAC;AAAA,UAAC,EAAE;AAAA,QAAC,GAAE,MAAK,SAASP,IAAEC,IAAE;AAAC,iBAAO,EAAE,aAAaD,IAAEC,EAAC,EAAE,MAAM,SAASA,IAAE;AAAC,gBAAIE,KAAE,IAAI,WAAW,IAAEH,GAAE,MAAM;AAAE,mBAAOG,GAAE,IAAIF,EAAC,GAAEE,GAAE,IAAIH,IAAE,CAAC,GAAEG;AAAA,UAAC,EAAE;AAAA,QAAC,GAAE,cAAa,SAASH,IAAEQ,IAAE;AAAC,iBAAO,EAAE,MAAM,WAAU;AAAC,gBAAID,KAAE,EAAE,QAAQ,CAAC,GAAEE,KAAE,EAAE,QAAQT,GAAE,MAAM,GAAEU,KAAE,EAAE,QAAQ,CAAC;AAAE,cAAE,mBAAmB,IAAI,WAAW,CAAC,GAAEH,EAAC,GAAE,EAAE,mBAAmBP,IAAES,EAAC,GAAE,EAAE,mBAAmBD,IAAEE,EAAC;AAAE,gBAAG;AAAC,qBAAO,EAAE,EAAE,kBAAkBH,IAAEE,IAAET,GAAE,QAAOU,EAAC,GAAE,EAAEH,IAAE,CAAC,CAAC;AAAA,YAAC,UAAC;AAAQ,gBAAEA,EAAC,GAAE,EAAEE,EAAC,GAAE,EAAEC,EAAC;AAAA,YAAC;AAAA,UAAC,EAAE;AAAA,QAAC,GAAE,MAAK,SAASV,IAAEC,IAAE;AAAC,iBAAO,EAAE,MAAM,WAAU;AAAC,gBAAIE,KAAE,IAAI,WAAWH,GAAE,QAAOA,GAAE,YAAW,CAAC,GAAEI,KAAE,IAAI,WAAWJ,GAAE,QAAOA,GAAE,aAAW,GAAEA,GAAE,SAAO,CAAC;AAAE,mBAAO,EAAE,eAAeG,IAAEC,IAAEH,EAAC,EAAE,MAAM,SAASD,IAAE;AAAC,kBAAGA,GAAE,QAAOI;AAAE,oBAAM,IAAI,MAAM,0CAA0C;AAAA,YAAC,EAAE;AAAA,UAAC,EAAE;AAAA,QAAC,GAAE,gBAAe,SAASH,IAAEG,IAAEC,IAAE;AAAC,iBAAO,EAAE,MAAM,WAAU;AAAC,gBAAIE,KAAE,EAAE,QAAQ,CAAC,GAAEC,KAAE,EAAE,QAAQJ,GAAE,MAAM,GAAEK,KAAE,EAAE,QAAQ,CAAC;AAAE,cAAE,mBAAmBR,IAAEM,EAAC,GAAE,EAAE,mBAAmBH,IAAEI,EAAC,GAAE,EAAE,mBAAmBH,IAAEI,EAAC;AAAE,gBAAG;AAAC,qBAAO,MAAI,EAAE,oBAAoBD,IAAEJ,GAAE,QAAOG,IAAEE,EAAC;AAAA,YAAC,UAAC;AAAQ,gBAAEF,EAAC,GAAE,EAAEC,EAAC,GAAE,EAAEC,EAAC;AAAA,YAAC;AAAA,UAAC,EAAE;AAAA,QAAC,EAAC;AAAE,eAAO;AAAA,MAAC,GAAE;AAAE,qBAAa,OAAO,UAAQ,OAAO,WAAS,UAAU,YAAU,WAAU,OAAO,UAAQ,aAAW,KAAK,YAAU;AAAA;AAAA;;;ACA94gG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA;;;ACAA;;;ACAA;;;ACAA;AAGO,MAAM,yBAAN,MAA6B;AAAA,IAA7B;AACH,oCAAS,oBAAI,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAIjB,SAAS,OAAO;AACZ,UAAI,KAAK,OAAO,IAAI,MAAM,OAAO,GAAG;AAChC,cAAM,IAAI,MAAM,uCAAuC,MAAM,OAAO,EAAE;AAAA,MAC1E;AACA,WAAK,OAAO,IAAI,MAAM,SAAS,KAAK;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,SAAS,SAAS;AACd,YAAM,QAAQ,KAAK,OAAO,IAAI,OAAO;AACrC,UAAI,CAAC,OAAO;AACR,cAAM,IAAI,MAAM,4BAA4B,OAAO,gBAAgB,KAAK,WAAW,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,MACrG;AACA,aAAO;AAAA,IACX;AAAA;AAAA;AAAA;AAAA,IAIA,SAAS,SAAS;AACd,aAAO,KAAK,OAAO,IAAI,OAAO;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAIA,aAAa;AACT,aAAO,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA,IAIA,eAAe;AACX,aAAO,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA,IAIA,WAAW,SAAS;AAChB,aAAO,KAAK,OAAO,OAAO,OAAO;AAAA,IACrC;AAAA;AAAA;AAAA;AAAA,IAIA,QAAQ;AACJ,WAAK,OAAO,MAAM;AAAA,IACtB;AAAA,EACJ;AAEO,MAAM,iBAAiB,IAAI,uBAAuB;;;ACzDzD;AAmCO,WAAS,WAAW,OAAO;AAC9B,WAAO,MAAM,KAAK,KAAK,EAClB,IAAI,CAAAgE,OAAKA,GAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EACxC,KAAK,EAAE;AAAA,EAChB;AAIO,WAAS,WAAW,KAAK;AAC5B,QAAI,IAAI,SAAS,MAAM,GAAG;AACtB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACtD;AACA,UAAM,QAAQ,IAAI,WAAW,IAAI,SAAS,CAAC;AAC3C,aAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK,GAAG;AACpC,YAAMA,KAAI,CAAC,IAAI,SAAS,IAAI,MAAMA,IAAGA,KAAI,CAAC,GAAG,EAAE;AAAA,IACnD;AACA,WAAO;AAAA,EACX;AA4CA,iBAAsB,UAAU,OAAO,WAAW;AAC9C,QAAI,cAAc,UAAU;AACxB,YAAM,SAAS,MAAM;AACrB,aAAO,IAAI,WAAW,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,CAAC;AAAA,IAC5E,WACS,cAAc,UAAU;AAC7B,YAAM,SAAS,MAAM;AACrB,aAAO,IAAI,WAAW,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,CAAC;AAAA,IAC5E,WACS,cAAc,YAAY;AAC/B,YAAM,SAAS,MAAM;AACrB,aAAO,IAAI,WAAW,OAAO,WAAW,UAAU,EAAE,OAAO,KAAK,EAAE,OAAO,CAAC;AAAA,IAC9E;AACA,UAAM,IAAI,MAAM,+BAA+B,SAAS,EAAE;AAAA,EAC9D;;;AC9GA;;;ACAA;AAYO,MAAM,qBAAN,MAAyB;AAAA,IAAzB;AACH,kCAAO,oBAAI,IAAI;AAAA;AAAA,IACf,MAAM,MAAM,OAAO,SAAS,MAAM;AAC9B,WAAK,KAAK,IAAI,OAAO,EAAE,SAAS,KAAK,CAAC;AAAA,IAC1C;AAAA,IACA,MAAM,KAAK,OAAO;AACd,aAAO,KAAK,KAAK,IAAI,KAAK,KAAK;AAAA,IACnC;AAAA,IACA,MAAM,KAAK,QAAQ;AACf,YAAM,UAAU,MAAM,KAAK,KAAK,KAAK,OAAO,CAAC,EAAE,IAAI,CAAAC,OAAKA,GAAE,IAAI;AAC9D,UAAI,CAAC,QAAQ;AACT,eAAO;AAAA,MACX;AACA,aAAO,QAAQ,OAAO,UAAQ;AAC1B,eAAO,OAAO,QAAQ,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,KAAK,MAAM;AAClD,cAAI,QAAQ,WAAW,MAAM,QAAQ,KAAK,GAAG;AAEzC,mBAAO,MAAM,KAAK,CAAAC,OAAK,KAAK,MAAM,SAASA,EAAC,CAAC;AAAA,UACjD;AACA,iBAAO,KAAK,GAAG,MAAM;AAAA,QACzB,CAAC;AAAA,MACL,CAAC;AAAA,IACL;AAAA,IACA,MAAM,OAAO,OAAO;AAChB,WAAK,KAAK,OAAO,KAAK;AAAA,IAC1B;AAAA,IACA,MAAM,WAAW,OAAO,SAAS;AAC7B,YAAM,WAAW,KAAK,KAAK,IAAI,KAAK;AACpC,UAAI,CAAC,UAAU;AACX,cAAM,IAAI,MAAM,kBAAkB,KAAK,EAAE;AAAA,MAC7C;AACA,WAAK,KAAK,IAAI,OAAO;AAAA,QACjB,SAAS,SAAS;AAAA,QAClB,MAAM,EAAE,GAAG,SAAS,MAAM,GAAG,QAAQ;AAAA,MACzC,CAAC;AAAA,IACL;AAAA;AAAA;AAAA;AAAA,IAIA,QAAQ;AACJ,WAAK,KAAK,MAAM;AAAA,IACpB;AAAA,EACJ;AAWO,MAAM,cAAN,MAAkB;AAAA,IAErB,YAAY,UAAU,IAAI,mBAAmB,GAAG;AADhD;AAEI,WAAK,UAAU;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,YAAY,OAAO,SAAS,SAAS,UAAU,CAAC,GAAG;AACrD,YAAM,OAAO;AAAA,QACT;AAAA,QACA;AAAA,QACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,QAClC,WAAW,QAAQ;AAAA,QACnB,OAAO,QAAQ,SAAS,CAAC,SAAS;AAAA,QAClC,sBAAsB,QAAQ,wBAAwB;AAAA,QACtD,QAAQ,QAAQ,UAAU;AAAA,MAC9B;AACA,YAAM,KAAK,QAAQ,MAAM,OAAO,SAAS,IAAI;AAC7C,aAAO;AAAA,IACX;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,OAAO,OAAO;AAChB,aAAO,MAAM,KAAK,QAAQ,KAAK,KAAK;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,aAAa,OAAO;AACtB,YAAM,SAAS,MAAM,KAAK,QAAQ,KAAK,KAAK;AAC5C,UAAI,CAAC;AACD,eAAO;AACX,aAAO;AAAA,QACH,WAAW,OAAO,QAAQ;AAAA,QAC1B,MAAM,OAAO;AAAA,MACjB;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,SAAS,QAAQ;AACnB,aAAO,MAAM,KAAK,QAAQ,KAAK,MAAM;AAAA,IACzC;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,eAAe,QAAQ;AACzB,YAAM,UAAU,MAAM,KAAK,QAAQ,KAAK,MAAM;AAC9C,YAAM,MAAM,oBAAI,KAAK;AACrB,aAAO,QAAQ,OAAO,UAAQ;AAE1B,YAAI,KAAK,UAAU,KAAK,WAAW,UAAU;AACzC,iBAAO;AAAA,QACX;AAEA,YAAI,KAAK,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK;AAClD,iBAAO;AAAA,QACX;AACA,eAAO;AAAA,MACX,CAAC;AAAA,IACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,MAAM,UAAU,UAAU,UAAU,YAAY;AAE5C,YAAM,SAAS,MAAM,KAAK,QAAQ,KAAK,QAAQ;AAC/C,UAAI,CAAC,QAAQ;AACT,cAAM,IAAI,MAAM,iCAAiC,QAAQ,EAAE;AAAA,MAC/D;AAEA,YAAM,KAAK,QAAQ,WAAW,UAAU;AAAA,QACpC,QAAQ;AAAA,MACZ,CAAC;AAED,YAAM,KAAK,YAAY,UAAU,YAAY,OAAO,KAAK,SAAS;AAAA,QAC9D,OAAO,OAAO,KAAK;AAAA,QACnB,sBAAsB,OAAO,KAAK;AAAA,QAClC,WAAW,OAAO,KAAK;AAAA,QACvB,QAAQ;AAAA,MACZ,CAAC;AAED,YAAM,KAAK,QAAQ,WAAW,UAAU;AAAA,QACpC,aAAa;AAAA,MACjB,CAAC;AAED,YAAM,SAAS,MAAM,KAAK,QAAQ,KAAK,QAAQ;AAC/C,aAAO,OAAO;AAAA,IAClB;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,UAAU,OAAO,QAAQ;AAC3B,YAAM,KAAK,QAAQ,WAAW,OAAO;AAAA,QACjC,QAAQ;AAAA,QACR,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MACtC,CAAC;AAAA,IACL;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,UAAU,OAAO;AACnB,YAAM,KAAK,QAAQ,OAAO,KAAK;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,kBAAkB;AACpB,YAAM,UAAU,MAAM,KAAK,QAAQ,KAAK;AACxC,YAAM,MAAM,oBAAI,KAAK;AACrB,UAAI,QAAQ;AACZ,iBAAW,QAAQ,SAAS;AACxB,YAAI,KAAK,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,WAAW,UAAU;AAC9E,gBAAM,KAAK,QAAQ,WAAW,KAAK,OAAO;AAAA,YACtC,QAAQ;AAAA,UACZ,CAAC;AACD;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,MAAM,aAAa,gBAAgB,IAAI;AACnC,YAAM,UAAU,MAAM,KAAK,QAAQ,KAAK;AACxC,YAAM,aAAa,oBAAI,KAAK;AAC5B,iBAAW,QAAQ,WAAW,QAAQ,IAAI,aAAa;AACvD,UAAI,QAAQ;AACZ,iBAAW,QAAQ,SAAS;AACxB,cAAM,cAAe,KAAK,WAAW,aAAa,KAAK,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI,cAC1F,KAAK,WAAW,aAAa,KAAK,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI;AAC/E,YAAI,aAAa;AACb,gBAAM,KAAK,QAAQ,OAAO,KAAK,KAAK;AACpC;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAAA,EACJ;;;ACnNA;;;ACAA;;;ACAA;;;ACAA;AAeA,MAAM,kBAAkB;AAAA,IACpB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,IAAI;AAAA,EACR;AACA,MAAM,EAAE,GAAGC,IAAG,GAAGC,IAAG,IAAI,IAAI,GAAG,GAAG,IAAI;AACtC,MAAMC,KAAI;AACV,MAAMC,MAAK;AAKX,MAAM,MAAM,CAACC,KAAI,OAAO;AACpB,UAAM,IAAI,MAAMA,EAAC;AAAA,EACrB;AACA,MAAM,QAAQ,CAACC,OAAM,OAAOA,OAAM;AAClC,MAAM,QAAQ,CAACC,OAAM,OAAOA,OAAM;AAClC,MAAMC,WAAU,CAACC,OAAMA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;AAEnG,MAAMC,UAAS,CAACD,IAAGE,OAAM,CAACH,SAAQC,EAAC,KAAM,OAAOE,OAAM,YAAYA,KAAI,KAAKF,GAAE,WAAWE,KAClF,IAAI,qBAAqB,IACzBF;AAEN,MAAM,MAAM,CAAC,QAAQ,IAAI,WAAW,GAAG;AACvC,MAAM,OAAO,CAAC,QAAQ,WAAW,KAAK,GAAG;AACzC,MAAM,OAAO,CAACH,IAAG,QAAQA,GAAE,SAAS,EAAE,EAAE,SAAS,KAAK,GAAG;AACzD,MAAMM,cAAa,CAACC,OAAM,MAAM,KAAKH,QAAOG,EAAC,CAAC,EACzC,IAAI,CAACC,OAAM,KAAKA,IAAG,CAAC,CAAC,EACrB,KAAK,EAAE;AACZ,MAAMC,KAAI,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;AACxD,MAAM,MAAM,CAAC,OAAO;AAChB,QAAI,MAAMA,GAAE,MAAM,MAAMA,GAAE;AACtB,aAAO,KAAKA,GAAE;AAClB,QAAI,MAAMA,GAAE,KAAK,MAAMA,GAAE;AACrB,aAAO,MAAMA,GAAE,IAAI;AACvB,QAAI,MAAMA,GAAE,KAAK,MAAMA,GAAE;AACrB,aAAO,MAAMA,GAAE,IAAI;AACvB;AAAA,EACJ;AACA,MAAMC,cAAa,CAAC,QAAQ;AACxB,UAAMF,KAAI;AACV,QAAI,CAAC,MAAM,GAAG;AACV,aAAO,IAAIA,EAAC;AAChB,UAAM,KAAK,IAAI;AACf,UAAM,KAAK,KAAK;AAChB,QAAI,KAAK;AACL,aAAO,IAAIA,EAAC;AAChB,UAAM,QAAQ,IAAI,EAAE;AACpB,aAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAE7C,YAAM,KAAK,IAAI,IAAI,WAAW,EAAE,CAAC;AACjC,YAAM,KAAK,IAAI,IAAI,WAAW,KAAK,CAAC,CAAC;AACrC,UAAI,OAAO,UAAa,OAAO;AAC3B,eAAO,IAAIA,EAAC;AAChB,YAAM,EAAE,IAAI,KAAK,KAAK;AAAA,IAC1B;AACA,WAAO;AAAA,EACX;AAEA,MAAM,OAAO,CAACL,IAAG,QAAQC,QAAO,MAAMD,EAAC,IAAIO,YAAWP,EAAC,IAAI,KAAKC,QAAOD,EAAC,CAAC,GAAG,GAAG;AAC/E,MAAM,KAAK,MAAM,YAAY;AAC7B,MAAM,SAAS,MAAM,GAAG,GAAG,UAAU,IAAI,+BAA+B;AAExE,MAAM,cAAc,IAAI,SAAS;AAC7B,UAAMQ,KAAI,IAAI,KAAK,OAAO,CAAC,KAAKR,OAAM,MAAMC,QAAOD,EAAC,EAAE,QAAQ,CAAC,CAAC;AAChE,QAAI,MAAM;AACV,SAAK,QAAQ,CAAAA,OAAK;AAAE,MAAAQ,GAAE,IAAIR,IAAG,GAAG;AAAG,aAAOA,GAAE;AAAA,IAAQ,CAAC;AACrD,WAAOQ;AAAA,EACX;AAEA,MAAM,cAAc,CAAC,MAAMd,OAAM;AAC7B,UAAMe,KAAI,GAAG;AACb,WAAOA,GAAE,gBAAgB,IAAI,GAAG,CAAC;AAAA,EACrC;AACA,MAAM,MAAM;AACZ,MAAM,SAAS,CAACZ,IAAG,KAAK,KAAK,MAAM,+BAA+B,MAAMA,EAAC,KAAK,OAAOA,MAAKA,KAAI,MAAMA,KAAI,IAAI,GAAG;AAE/G,MAAMa,KAAI,CAACV,IAAGI,KAAIZ,OAAM;AACpB,UAAMgB,KAAIR,KAAII;AACd,WAAOI,MAAK,KAAKA,KAAIJ,KAAII;AAAA,EAC7B;AACA,MAAM,OAAO,CAACR,OAAMU,GAAEV,IAAGP,EAAC;AAG1B,MAAM,SAAS,CAAC,KAAK,OAAO;AACxB,QAAI,QAAQ,MAAM,MAAM;AACpB,UAAI,kBAAkB,MAAM,UAAU,EAAE;AAC5C,QAAIO,KAAIU,GAAE,KAAK,EAAE,GAAGN,KAAI,IAAIO,KAAI,IAAIC,KAAI,IAAIC,KAAI,IAAIC,KAAI;AACxD,WAAOd,OAAM,IAAI;AACb,YAAMe,KAAIX,KAAIJ,IAAGQ,KAAIJ,KAAIJ;AACzB,YAAMJ,KAAIe,KAAIE,KAAIE,IAAGlB,KAAIe,KAAIE,KAAIC;AACjC,MAAAX,KAAIJ,IAAGA,KAAIQ,IAAGG,KAAIE,IAAGD,KAAIE,IAAGD,KAAIjB,IAAGkB,KAAIjB;AAAA,IAC3C;AACA,WAAOO,OAAM,KAAKM,GAAEC,IAAG,EAAE,IAAI,IAAI,YAAY;AAAA,EACjD;AACA,MAAM,WAAW,CAAC,SAAS;AAEvB,UAAM,KAAK,IAAI,IAAI;AACnB,QAAI,OAAO,OAAO;AACd,UAAI,YAAY,OAAO,UAAU;AACrC,WAAO;AAAA,EACX;AACA,MAAM,SAAS,CAACK,OAAOA,cAAa,QAAQA,KAAI,IAAI,gBAAgB;AAIpE,MAAM,UAAU,CAACL,OAAMD,GAAEA,GAAEC,KAAIA,EAAC,IAAIA,KAAI,EAAE;AAE1C,MAAM,UAAU,CAACd,OAAM,OAAOA,IAAG,IAAIL,EAAC;AAEtC,MAAM,SAAS,CAACK,OAAM,OAAOA,IAAG,IAAIL,EAAC;AAErC,MAAM,SAAS,CAACK,OAAM,OAAOA,IAAG,IAAIJ,EAAC;AACrC,MAAM,SAAS,CAACmB,QAAOA,KAAI,QAAQ;AAEnC,MAAM,OAAO,CAACf,OAAM,WAAW,GAAGA,EAAC;AACnC,MAAM,YAAY,CAACe,OAAM,KAAK,OAAOA,EAAC,IAAI,IAAO,CAAI;AAErD,MAAM,SAAS,CAACD,OAAM;AAElB,UAAMF,KAAI,QAAQ,OAAOE,EAAC,CAAC;AAK3B,QAAIH,KAAI;AACR,aAAS,MAAMC,IAAGJ,MAAKb,KAAI,MAAM,IAAIa,KAAI,IAAIA,OAAM,IAAI;AAEnD,UAAIA,KAAI;AACJ,QAAAG,KAAKA,KAAI,MAAOhB;AACpB,YAAO,MAAM,MAAOA;AAAA,IACxB;AACA,WAAOkB,GAAEF,KAAIA,EAAC,MAAMC,KAAID,KAAI,IAAI,cAAc;AAAA,EAClD;AAEA,MAAM,SAAN,MAAM,OAAM;AAAA,IAMR,YAAY,IAAI,IAAI,IAAI;AAHxB;AACA;AACA;AAEI,WAAK,KAAK,QAAQ,EAAE;AACpB,WAAK,KAAK,OAAO,EAAE;AACnB,WAAK,KAAK,QAAQ,EAAE;AACpB,aAAO,OAAO,IAAI;AAAA,IACtB;AAAA;AAAA,IAEA,OAAO,UAAU,OAAO;AACpB,MAAAP,QAAO,KAAK;AACZ,UAAIe,KAAI;AAIR,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,OAAO,MAAM,SAAS,CAAC;AAC7B,YAAML,KAAI,gBAAgB,MAAM,GAAGjB,EAAC;AACpC,YAAM,MAAM,MAAM;AAElB,UAAI,QAAQA,KAAI,KAAK,CAAC,GAAM,CAAI,EAAE,SAAS,IAAI,GAAG;AAG9C,YAAIkB,KAAI,OAAOD,EAAC;AAChB,cAAM,QAAQ,OAAOC,EAAC;AACtB,cAAM,QAAQ,OAAO,IAAI,IAAI,CAAC;AAC9B,YAAI,UAAU;AACV,UAAAA,KAAIF,GAAE,CAACE,EAAC;AACZ,QAAAI,KAAI,IAAI,OAAML,IAAGC,IAAG,EAAE;AAAA,MAC1B;AAEA,UAAI,QAAQjB,MAAK,KAAK,SAAS;AAC3B,QAAAqB,KAAI,IAAI,OAAML,IAAG,gBAAgB,MAAMjB,IAAGC,GAAE,GAAG,EAAE;AAErD,aAAOqB,KAAIA,GAAE,eAAe,IAAI,IAAI,yBAAyB;AAAA,IACjE;AAAA;AAAA,IAEA,OAAO,OAAO;AACV,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI;AACnC,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;AAC/C,YAAM,OAAON,GAAE,KAAK,EAAE;AACtB,YAAM,OAAOA,GAAE,KAAK,EAAE;AACtB,YAAM,OAAOA,GAAE,KAAK,EAAE;AACtB,YAAM,OAAOA,GAAE,KAAK,EAAE;AACtB,aAAO,SAAS,QAAQ,SAAS;AAAA,IACrC;AAAA,IACA,MAAM;AACF,aAAO,KAAK,OAAOO,EAAC;AAAA,IACxB;AAAA;AAAA,IAEA,SAAS;AACL,aAAO,IAAI,OAAM,KAAK,IAAIP,GAAE,CAAC,KAAK,EAAE,GAAG,KAAK,EAAE;AAAA,IAClD;AAAA;AAAA,IAEA,SAAS;AACL,aAAO,KAAK,IAAI,IAAI;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,IAAI,OAAO;AACP,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI;AACnC,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;AAC/C,YAAMV,KAAI;AACV,YAAMI,KAAI;AACV,UAAI,KAAK,IAAI,KAAK,IAAI,KAAK;AAC3B,YAAM,KAAKM,GAAEN,KAAI,EAAE;AACnB,UAAI,KAAKM,GAAE,KAAK,EAAE,GAAG,KAAKA,GAAE,KAAK,EAAE,GAAG,KAAKA,GAAE,KAAK,EAAE,GAAG,KAAKA,GAAE,KAAK,EAAE;AACrE,UAAI,KAAKA,GAAE,KAAK,EAAE;AAClB,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,UAAI,KAAKA,GAAE,KAAK,EAAE;AAClB,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAEV,KAAI,EAAE;AACb,WAAKU,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAEV,KAAI,EAAE;AACb,WAAKU,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAEV,KAAI,EAAE;AACb,WAAKU,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,aAAO,IAAI,OAAM,IAAI,IAAI,EAAE;AAAA,IAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,SAASb,IAAG,OAAO,MAAM;AACrB,UAAI,CAAC,QAAQA,OAAM;AACf,eAAOoB;AACX,aAAOpB,EAAC;AACR,UAAIA,OAAM;AACN,eAAO;AACX,UAAI,KAAK,OAAOqB,EAAC;AACb,eAAO,KAAKrB,EAAC,EAAE;AAEnB,UAAImB,KAAIC;AACR,UAAIE,KAAID;AACR,eAASE,KAAI,MAAMvB,KAAI,IAAIuB,KAAIA,GAAE,OAAO,GAAGvB,OAAM,IAAI;AAGjD,YAAIA,KAAI;AACJ,UAAAmB,KAAIA,GAAE,IAAII,EAAC;AAAA,iBACN;AACL,UAAAD,KAAIA,GAAE,IAAIC,EAAC;AAAA,MACnB;AACA,aAAOJ;AAAA,IACX;AAAA;AAAA,IAEA,WAAW;AACP,YAAM,EAAE,IAAIL,IAAG,IAAIC,IAAG,IAAI,EAAE,IAAI;AAEhC,UAAI,KAAK,OAAOK,EAAC;AACb,eAAO,EAAE,GAAG,IAAI,GAAG,GAAG;AAC1B,UAAI,MAAM;AACN,eAAO,EAAE,GAAAN,IAAG,GAAAC,GAAE;AAClB,YAAM,KAAK,OAAO,GAAGpB,EAAC;AAEtB,UAAIkB,GAAE,IAAI,EAAE,MAAM;AACd,YAAI,iBAAiB;AAEzB,aAAO,EAAE,GAAGA,GAAEC,KAAI,EAAE,GAAG,GAAGD,GAAEE,KAAI,EAAE,EAAE;AAAA,IACxC;AAAA;AAAA,IAEA,iBAAiB;AACb,YAAM,EAAE,GAAAD,IAAG,GAAAC,GAAE,IAAI,KAAK,SAAS;AAC/B,aAAOD,EAAC;AACR,aAAOC,EAAC;AAER,aAAOF,GAAEE,KAAIA,EAAC,MAAM,QAAQD,EAAC,IAAI,OAAO,IAAI,yBAAyB;AAAA,IACzE;AAAA;AAAA,IAEA,QAAQ,eAAe,MAAM;AACzB,YAAM,EAAE,GAAAA,IAAG,GAAAC,GAAE,IAAI,KAAK,eAAe,EAAE,SAAS;AAChD,YAAM,OAAO,SAASD,EAAC;AACvB,UAAI;AACA,eAAO,YAAY,UAAUC,EAAC,GAAG,IAAI;AACzC,aAAO,YAAY,KAAK,CAAI,GAAG,MAAM,SAASA,EAAC,CAAC;AAAA,IACpD;AAAA;AAAA,IAEA,OAAO,WAAW,IAAI;AAClB,YAAM,EAAE,GAAAD,IAAG,GAAAC,GAAE,IAAI;AACjB,aAAOD,OAAM,MAAMC,OAAM,KAAKK,KAAI,IAAI,OAAMN,IAAGC,IAAG,EAAE;AAAA,IACxD;AAAA,IACA,MAAM,cAAc;AAChB,aAAOT,YAAW,KAAK,QAAQ,YAAY,CAAC;AAAA,IAChD;AAAA,IACA,OAAO,eAAekB,IAAG;AACrB,aAAOH,GAAE,SAAS,aAAaG,EAAC,CAAC;AAAA,IACrC;AAAA,IACA,OAAO,QAAQ,KAAK;AAChB,aAAO,OAAM,UAAU,KAAK,GAAG,CAAC;AAAA,IACpC;AAAA,IACA,IAAI,IAAI;AACJ,aAAO,KAAK,SAAS,EAAE;AAAA,IAC3B;AAAA,IACA,IAAI,IAAI;AACJ,aAAO,KAAK,SAAS,EAAE;AAAA,IAC3B;AAAA,IACA,WAAW,cAAc;AACrB,aAAO,KAAK,QAAQ,YAAY;AAAA,IACpC;AAAA,EACJ;AAlMI,gBADE,QACK;AACP,gBAFE,QAEK;AAFX,MAAM,QAAN;AAqMA,MAAMH,KAAI,IAAI,MAAM,IAAI,IAAI,EAAE;AAE9B,MAAMD,KAAI,IAAI,MAAM,IAAI,IAAI,EAAE;AAE9B,QAAM,OAAOC;AACb,QAAM,OAAOD;AAEb,MAAM,qBAAqB,CAACK,IAAG,IAAI,OAAO;AACtC,WAAOJ,GAAE,SAAS,IAAI,KAAK,EAAE,IAAII,GAAE,SAAS,IAAI,KAAK,CAAC,EAAE,eAAe;AAAA,EAC3E;AACA,MAAM,eAAe,CAAClB,OAAM,IAAI,QAAQD,YAAWC,EAAC,KAAK,IAAI;AAC7D,MAAM,kBAAkB,CAACA,IAAG,MAAM,OAAO,aAAaA,GAAE,SAAS,MAAM,EAAE,CAAC;AAC1E,MAAM,OAAO,MAAM;AAEnB,MAAM,WAAW,CAAC,QAAQG,YAAW,KAAK,OAAO,KAAK,IAAI,IAAI,GAAGZ,GAAE,CAAC;AAEpE,MAAM,eAAe,CAAC,OAAO;AACzB,UAAM,MAAM,MAAM,EAAE,IAAI,KAAK,aAAa,KAAK,IAAID,EAAC,CAAC;AACrD,WAAO,OAAO,KAAK,IAAID,IAAG,uBAAuB;AAAA,EACrD;AAEA,MAAM,QAAQ,CAACI,OAAMA,KAAIJ,MAAK;AAE9B,MAAM,eAAe,CAAC,SAAS,eAAe,SAAS;AACnD,WAAOyB,GAAE,SAAS,aAAa,OAAO,CAAC,EAAE,QAAQ,YAAY;AAAA,EACjE;AAEA,MAAM,YAAN,MAAM,WAAU;AAAA,IAIZ,YAAYV,IAAGV,IAAG,UAAU;AAH5B;AACA;AACA;AAEI,WAAK,IAAI,OAAOU,EAAC;AACjB,WAAK,IAAI,OAAOV,EAAC;AACjB,UAAI,YAAY;AACZ,aAAK,WAAW;AACpB,aAAO,OAAO,IAAI;AAAA,IACtB;AAAA;AAAA,IAEA,OAAO,UAAUM,IAAG;AAChB,MAAAH,QAAOG,IAAGT,GAAE;AACZ,YAAMa,KAAI,gBAAgBJ,IAAG,GAAGV,EAAC;AACjC,YAAMI,KAAI,gBAAgBM,IAAGV,IAAGC,GAAE;AAClC,aAAO,IAAI,WAAUa,IAAGV,EAAC;AAAA,IAC7B;AAAA,IACA,UAAU;AACN,YAAM,EAAE,GAAAU,IAAG,GAAAV,GAAE,IAAI;AACjB,aAAO,YAAY,SAASU,EAAC,GAAG,SAASV,EAAC,CAAC;AAAA,IAC/C;AAAA;AAAA,IAEA,eAAe,KAAK;AAChB,aAAO,IAAI,WAAU,KAAK,GAAG,KAAK,GAAG,GAAG;AAAA,IAC5C;AAAA,IACA,WAAW;AACP,aAAO,MAAM,KAAK,CAAC;AAAA,IACvB;AAAA,IACA,oBAAoB;AAChB,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,eAAe;AACX,aAAOK,YAAW,KAAK,QAAQ,CAAC;AAAA,IACpC;AAAA,IACA,iBAAiB,KAAK;AAClB,aAAO,iBAAiB,MAAM,GAAG;AAAA,IACrC;AAAA,IACA,OAAO,YAAY,KAAK;AACpB,aAAO,WAAU,UAAU,KAAK,KAAKR,GAAE,CAAC;AAAA,IAC5C;AAAA,IACA,iBAAiB;AACb,aAAO;AAAA,IACX;AAAA,IACA,aAAa;AACT,YAAM,EAAE,GAAAa,IAAG,GAAAV,IAAG,SAAS,IAAI;AAC3B,aAAO,MAAMA,EAAC,IAAI,IAAI,WAAUU,IAAG,KAAK,CAACV,EAAC,GAAG,QAAQ,IAAI;AAAA,IAC7D;AAAA,EACJ;AAOA,MAAM,WAAW,CAAC,UAAU;AACxB,UAAM,QAAQ,MAAM,SAAS,IAAI;AACjC,QAAI,QAAQ;AACR,UAAI,aAAa;AACrB,UAAM,MAAM,aAAa,KAAK;AAC9B,WAAO,QAAQ,IAAI,OAAO,IAAI,KAAK,IAAI;AAAA,EAC3C;AAEA,MAAM,gBAAgB,CAAC,UAAU,KAAK,SAASG,QAAO,KAAK,CAAC,CAAC;AAC7D,MAAM,WAAW,EAAE,MAAM,KAAK;AAC9B,MAAM,WAAW,EAAE,MAAM,KAAK;AAE9B,MAAM,UAAU,CAAC,MAAM,MAAM,OAAO,aAAa;AAC7C,QAAI,CAAC,OAAO,aAAa,WAAW,EAAE,KAAK,CAACoB,OAAMA,MAAK,IAAI;AAEvD,UAAI,sBAAsB;AAC9B,QAAI,EAAE,MAAM,aAAa,IAAI;AAC7B,QAAI,QAAQ;AACR,aAAO;AACX,UAAM,MAAM;AACZ,UAAM,MAAM,cAAc,KAAK,IAAI,CAAC;AACpC,UAAM,MAAM,IAAI,GAAG;AACnB,UAAMD,KAAI,aAAa,IAAI;AAC3B,UAAM,OAAO,CAAC,IAAIA,EAAC,GAAG,GAAG;AAGzB,QAAI;AACA,WAAK,KAAK,iBAAiB,OAAO,YAAY1B,EAAC,IAAI,KAAK,YAAY,CAAC;AACzE,UAAME,KAAI;AAMV,UAAM,QAAQ,CAAC,WAAW;AAGtB,YAAMyB,KAAI,SAAS,MAAM;AACzB,UAAI,EAAE,MAAMA,MAAKA,KAAI5B;AACjB;AACJ,YAAMsB,KAAIG,GAAE,SAASG,EAAC,EAAE,SAAS;AACjC,YAAMb,KAAI,KAAKO,GAAE,CAAC;AAClB,UAAIP,OAAM;AACN;AACJ,YAAM,KAAK,OAAOa,IAAG5B,EAAC;AACtB,YAAMK,KAAI,KAAK,KAAK,KAAKF,KAAI,KAAKwB,KAAIZ,EAAC,CAAC,CAAC;AACzC,UAAIV,OAAM;AACN;AACJ,UAAI,QAAQA;AACZ,UAAI,YAAYiB,GAAE,MAAMP,KAAI,IAAI,KAAK,OAAOO,GAAE,IAAI,EAAE;AACpD,UAAI,QAAQ,MAAMjB,EAAC,GAAG;AAElB,gBAAQ,KAAK,CAACA,EAAC;AACf,oBAAY;AAAA,MAChB;AACA,aAAO,IAAI,UAAUU,IAAG,OAAO,QAAQ;AAAA,IAC3C;AACA,WAAO,EAAE,MAAM,YAAY,GAAG,IAAI,GAAG,MAAM;AAAA,EAC/C;AAEA,MAAM,WAAW,CAAC,iBAAiB;AAC/B,QAAIM,KAAI,IAAIpB,EAAC;AACb,QAAI2B,KAAI,IAAI3B,EAAC;AACb,QAAI6B,KAAI;AACR,UAAM,OAAO,IAAI,CAAC;AAClB,UAAM,QAAQ,MAAM;AAChB,MAAAT,GAAE,KAAK,CAAC;AACR,MAAAO,GAAE,KAAK,CAAC;AACR,MAAAE,KAAI;AAAA,IACR;AACA,UAAM,MAAM;AACZ,UAAM,KAAK;AACX,QAAI,cAAc;AAGd,YAAMC,KAAI,IAAIpB,OAAM,IAAI,gBAAgBiB,IAAGP,IAAG,GAAGV,EAAC;AAClD,YAAM,SAAS,OAAO,OAAO,SAAS;AAElC,QAAAiB,KAAI,MAAMG,GAAE,KAAK,CAAI,GAAG,IAAI;AAC5B,QAAAV,KAAI,MAAMU,GAAE;AACZ,YAAI,KAAK,WAAW;AAChB;AACJ,QAAAH,KAAI,MAAMG,GAAE,KAAK,CAAI,GAAG,IAAI;AAC5B,QAAAV,KAAI,MAAMU,GAAE;AAAA,MAChB;AAEA,YAAM,MAAM,YAAY;AACpB,YAAID,QAAO;AACP,cAAI,EAAE;AACV,QAAAT,KAAI,MAAMU,GAAE;AACZ,eAAOV;AAAA,MACX;AAGA,aAAO,OAAO,MAAM,SAAS;AACzB,cAAM;AACN,cAAM,OAAO,IAAI;AACjB,YAAI,MAAM;AACV,eAAO,EAAE,MAAM,KAAK,MAAM,IAAI,CAAC;AAC3B,gBAAM,OAAO;AACjB,cAAM;AACN,eAAO;AAAA,MACX;AAAA,IACJ,OACK;AAGD,YAAMU,KAAI,IAAIpB,OAAM,SAAS,gBAAgB,EAAEiB,IAAGP,IAAG,GAAGV,EAAC;AACzD,YAAM,SAAS,CAAC,OAAO,SAAS;AAE5B,QAAAiB,KAAIG,GAAE,KAAK,CAAI,GAAG,IAAI;AACtB,QAAAV,KAAIU,GAAE;AACN,YAAI,KAAK,WAAW;AAChB;AACJ,QAAAH,KAAIG,GAAE,KAAK,CAAI,GAAG,IAAI;AACtB,QAAAV,KAAIU,GAAE;AAAA,MACV;AAEA,YAAM,MAAM,MAAM;AACd,YAAID,QAAO;AACP,cAAI,EAAE;AACV,QAAAT,KAAIU,GAAE;AACN,eAAOV;AAAA,MACX;AAGA,aAAO,CAAC,MAAM,SAAS;AACnB,cAAM;AACN,eAAO,IAAI;AACX,YAAI,MAAM;AACV,eAAO,EAAE,MAAM,KAAK,IAAI,CAAC;AACrB,iBAAO;AACX,cAAM;AACN,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,EACJ;AAyBA,MAAM,OAAO,CAAC,MAAM,MAAM,OAAO,aAAa;AAE1C,UAAM,EAAE,MAAM,MAAM,IAAI,QAAQ,MAAM,MAAM,IAAI;AAChD,UAAM,MAAM,SAAS,KAAK,EAAE,MAAM,KAAK;AACvC,WAAO;AAAA,EACX;AAUA,MAAM,SAAS,CAAC,KAAK,MAAM,KAAK,OAAO,aAAa;AAChD,QAAI,EAAE,KAAK,IAAI;AACf,QAAI,QAAQ;AACR,aAAO;AACX,QAAI,YAAY;AACZ,UAAI,sBAAsB;AAC9B,QAAI;AAGJ,UAAM,KAAK,OAAO,OAAO,QAAQ,YAAY,OAAO;AACpD,QAAI,CAAC,MAAM,KAAK,GAAG,EAAE,WAAWW;AAC5B,UAAI,4BAA4B;AACpC,QAAI;AACA,aAAO,KAAK,IAAI,UAAU,IAAI,GAAG,IAAI,CAAC,IAAI,UAAU,YAAY,GAAG;AACnE,YAAMC,KAAI,cAAc,KAAK,IAAI,CAAC;AAClC,YAAMC,KAAI,MAAM,UAAU,KAAK,GAAG,CAAC;AACnC,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAE,IAAI;AACjB,UAAI,QAAQ,MAAMA,EAAC;AACf,eAAO;AACX,YAAM,KAAK,OAAOA,IAAGC,EAAC;AACtB,YAAM,KAAK,KAAKJ,KAAI,EAAE;AACtB,YAAM,KAAK,KAAKE,KAAI,EAAE;AACtB,YAAMG,KAAI,mBAAmBJ,IAAG,IAAI,EAAE,EAAE,SAAS;AAEjD,YAAMK,KAAI,KAAKD,GAAE,CAAC;AAClB,aAAOC,OAAMJ;AAAA,IACjB,SACO,OAAO;AACV,aAAO;AAAA,IACX;AAAA,EACJ;AAKA,MAAM,mBAAmB,CAAC,KAAK,SAAS;AACpC,UAAM,EAAE,GAAAA,IAAG,GAAAC,IAAG,SAAS,IAAI;AAG3B,QAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAAS,QAAQ;AAC/B,UAAI,qBAAqB;AAC7B,UAAMH,KAAI,cAAc,KAAK,MAAMO,EAAC,CAAC;AACrC,UAAM,OAAO,aAAa,KAAK,aAAa,IAAIL,KAAIE,KAAIF;AACxD,WAAO,IAAI;AACX,UAAM,OAAO,UAAU,IAAI,QAAQ,CAAC;AACpC,UAAM,KAAK,YAAY,MAAM,SAAS,IAAI,CAAC;AAC3C,UAAMG,KAAI,MAAM,UAAU,EAAE;AAC5B,UAAM,KAAK,OAAO,MAAMD,EAAC;AACzB,UAAM,KAAK,KAAK,CAACJ,KAAI,EAAE;AACvB,UAAM,KAAK,KAAKG,KAAI,EAAE;AACtB,WAAO,mBAAmBE,IAAG,IAAI,EAAE;AAAA,EACvC;AAcA,MAAM,mBAAmB,CAAC,SAAS;AAC/B,WAAO,KAAK,IAAI;AAChB,QAAI,KAAK,SAASG,KAAI,KAAK,KAAK,SAAS;AACrC,UAAI,mBAAmB;AAC3B,UAAM,MAAMC,GAAE,aAAa,IAAI,GAAGC,KAAI,EAAE;AACxC,WAAO,SAAS,MAAM,EAAE;AAAA,EAC5B;AACA,MAAM,mBAAmB,MAAM,iBAAiB,YAAYF,KAAI,EAAE,CAAC;AACnE,MAAM,OAAO;AAEb,MAAM,MAAM;AAAA,IACR,YAAYG;AAAA,IACZ,YAAYC;AAAA,IACZ;AAAA,IACA,iBAAiB;AAAA,IACjB,iBAAiB;AAAA,IACjB,KAAKH;AAAA,IACL;AAAA;AAAA,IACA,iBAAiB,OAAO,QAAQ,SAAS;AACrC,YAAMI,KAAI,OAAO;AACjB,YAAM,OAAO;AACb,YAAMC,KAAI,MAAMD,GAAE,UAAU,OAAO,KAAK,EAAE,MAAM,MAAM,EAAE,MAAM,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC;AACvF,aAAO,IAAI,MAAMA,GAAE,KAAK,MAAMC,IAAG,YAAY,GAAG,IAAI,CAAC,CAAC;AAAA,IAC1D;AAAA,IACA,gBAAgB;AAAA;AAAA,IAChB;AAAA,IACA;AAAA,EACJ;AAEA,MAAM,QAAQ;AAAA,IACV,wBAAwB;AAAA,IACxB,mBAAmB,CAAC,QAAQ;AACxB,UAAI;AACA,eAAO,CAAC,CAAC,aAAa,GAAG;AAAA,MAC7B,SACOC,IAAG;AACN,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA;AAAA,IACA,YAAY,CAACC,KAAI,GAAGC,KAAIC,OAAM;AAC1B,MAAAD,GAAE,SAAS,EAAE;AACb,MAAAD;AACA,aAAOC;AAAA,IACX;AAAA,EACJ;AAGA,MAAME,KAAI;AACV,MAAM,aAAa;AACnB,MAAM,WAAW,KAAK,KAAK,aAAaA,EAAC,IAAI;AAC7C,MAAM,cAAc,MAAMA,KAAI;AAC9B,MAAM,aAAa,MAAM;AACrB,UAAM,SAAS,CAAC;AAChB,QAAIF,KAAIC;AACR,QAAIE,KAAIH;AACR,aAASD,KAAI,GAAGA,KAAI,UAAUA,MAAK;AAC/B,MAAAI,KAAIH;AACJ,aAAO,KAAKG,EAAC;AACb,eAASC,KAAI,GAAGA,KAAI,aAAaA,MAAK;AAClC,QAAAD,KAAIA,GAAE,IAAIH,EAAC;AACX,eAAO,KAAKG,EAAC;AAAA,MACjB;AACA,MAAAH,KAAIG,GAAE,OAAO;AAAA,IACjB;AACA,WAAO;AAAA,EACX;AACA,MAAI,QAAQ;AAEZ,MAAM,QAAQ,CAAC,KAAKH,OAAM;AACtB,UAAMK,KAAIL,GAAE,OAAO;AACnB,WAAO,MAAMK,KAAIL;AAAA,EACrB;AAYA,MAAM,OAAO,CAACK,OAAM;AAChB,UAAM,OAAO,UAAU,QAAQ,WAAW;AAC1C,QAAIL,KAAIM;AACR,QAAIC,KAAIN;AACR,UAAM,UAAU,KAAKC;AACrB,UAAM,SAAS;AACf,UAAM,OAAO,IAAI,UAAU,CAAC;AAC5B,UAAM,UAAU,IAAIA,EAAC;AACrB,aAASH,KAAI,GAAGA,KAAI,UAAUA,MAAK;AAC/B,UAAI,QAAQ,OAAOM,KAAI,IAAI;AAC3B,MAAAA,OAAM;AACN,UAAI,QAAQ,aAAa;AACrB,iBAAS;AACT,QAAAA,MAAK;AAAA,MACT;AACA,YAAM,MAAMN,KAAI;AAChB,YAAM,OAAO;AACb,YAAM,OAAO,MAAM,KAAK,IAAI,KAAK,IAAI;AACrC,YAAMS,UAAST,KAAI,MAAM;AACzB,YAAM,QAAQ,QAAQ;AACtB,UAAI,UAAU,GAAG;AAEb,QAAAQ,KAAIA,GAAE,IAAI,MAAMC,SAAQ,KAAK,IAAI,CAAC,CAAC;AAAA,MACvC,OACK;AACD,QAAAR,KAAIA,GAAE,IAAI,MAAM,OAAO,KAAK,IAAI,CAAC,CAAC;AAAA,MACtC;AAAA,IACJ;AACA,WAAO,EAAE,GAAAA,IAAG,GAAAO,GAAE;AAAA,EAClB;;;ACnxBA;;;ACAA;AAeM,WAAUE,SAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAUC,SAAQC,IAAS;AAC/B,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI;AAAG,YAAM,IAAI,MAAM,oCAAoCA,EAAC;EAC9F;AAGM,WAAUC,QAAOC,OAA8B,SAAiB;AACpE,QAAI,CAACL,SAAQK,EAAC;AAAG,YAAM,IAAI,MAAM,qBAAqB;AACtD,QAAI,QAAQ,SAAS,KAAK,CAAC,QAAQ,SAASA,GAAE,MAAM;AAClD,YAAM,IAAI,MAAM,mCAAmC,UAAU,kBAAkBA,GAAE,MAAM;EAC3F;AAGM,WAAU,MAAMC,IAAQ;AAC5B,QAAI,OAAOA,OAAM,cAAc,OAAOA,GAAE,WAAW;AACjD,YAAM,IAAI,MAAM,8CAA8C;AAChE,IAAAJ,SAAQI,GAAE,SAAS;AACnB,IAAAJ,SAAQI,GAAE,QAAQ;EACpB;AAGM,WAAUC,SAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAUC,SAAQ,KAAU,UAAa;AAC7C,IAAAJ,QAAO,GAAG;AACV,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,2DAA2D,GAAG;IAChF;EACF;AAkBM,WAAUK,UAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAUC,YAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAUC,MAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAkIM,WAAU,YAAY,KAAW;AACrC,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,iBAAiB;AAC9D,WAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;EACrD;AAiBM,WAAU,QAAQ,MAAW;AACjC,QAAI,OAAO,SAAS;AAAU,aAAO,YAAY,IAAI;AACrD,IAAAC,QAAO,IAAI;AACX,WAAO;EACT;AAmDM,MAAgB,OAAhB,MAAoB;;AA4CpB,WAAUC,cACd,UAAuB;AAOvB,UAAM,QAAQ,CAAC,QAA2B,SAAQ,EAAG,OAAO,QAAQ,GAAG,CAAC,EAAE,OAAM;AAChF,UAAM,MAAM,SAAQ;AACpB,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,MAAM,SAAQ;AAC7B,WAAO;EACT;;;ADrVM,MAAO,OAAP,cAAuC,KAAa;IAQxD,YAAY,MAAa,MAAW;AAClC,YAAK;AAJC,WAAA,WAAW;AACX,WAAA,YAAY;AAIlB,YAAM,IAAI;AACV,YAAM,MAAM,QAAQ,IAAI;AACxB,WAAK,QAAQ,KAAK,OAAM;AACxB,UAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,cAAM,IAAI,MAAM,qDAAqD;AACvE,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,YAAY,KAAK,MAAM;AAC5B,YAAM,WAAW,KAAK;AACtB,YAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,UAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,eAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK;AAC/C,WAAK,MAAM,OAAO,GAAG;AAErB,WAAK,QAAQ,KAAK,OAAM;AAExB,eAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK,KAAO;AACtD,WAAK,MAAM,OAAO,GAAG;AACrB,MAAAC,OAAM,GAAG;IACX;IACA,OAAO,KAAU;AACf,MAAAC,SAAQ,IAAI;AACZ,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAA,SAAQ,IAAI;AACZ,MAAAC,QAAO,KAAK,KAAK,SAAS;AAC1B,WAAK,WAAW;AAChB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,QAAO;IACd;IACA,SAAM;AACJ,YAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,WAAK,WAAW,GAAG;AACnB,aAAO;IACT;IACA,WAAW,IAAY;AAErB,aAAA,KAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,YAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,WAAK;AACL,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;IACA,UAAO;AACL,WAAK,YAAY;AACjB,WAAK,MAAM,QAAO;AAClB,WAAK,MAAM,QAAO;IACpB;;AAaK,MAAM,OAGT,CAAC,MAAa,KAAY,YAC5B,IAAI,KAAU,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AACjD,OAAK,SAAS,CAAC,MAAa,QAAe,IAAI,KAAU,MAAM,GAAG;;;AE7FlE;;;ACAA;;;ACAA;AAOM,WAAU,aACd,MACA,YACA,OACAC,OAAa;AAEb,QAAI,OAAO,KAAK,iBAAiB;AAAY,aAAO,KAAK,aAAa,YAAY,OAAOA,KAAI;AAC7F,UAAMC,QAAO,OAAO,EAAE;AACtB,UAAM,WAAW,OAAO,UAAU;AAClC,UAAM,KAAK,OAAQ,SAASA,QAAQ,QAAQ;AAC5C,UAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,UAAMC,KAAIF,QAAO,IAAI;AACrB,UAAMG,KAAIH,QAAO,IAAI;AACrB,SAAK,UAAU,aAAaE,IAAG,IAAIF,KAAI;AACvC,SAAK,UAAU,aAAaG,IAAG,IAAIH,KAAI;EACzC;AAGM,WAAUI,KAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAUC,KAAIH,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAMM,MAAgBE,UAAhB,cAAoD,KAAO;IAoB/D,YAAY,UAAkB,WAAmB,WAAmBT,OAAa;AAC/E,YAAK;AANG,WAAA,WAAW;AACX,WAAA,SAAS;AACT,WAAA,MAAM;AACN,WAAA,YAAY;AAIpB,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,OAAOA;AACZ,WAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,WAAK,OAAOU,YAAW,KAAK,MAAM;IACpC;IACA,OAAO,MAAW;AAChB,MAAAC,SAAQ,IAAI;AACZ,aAAO,QAAQ,IAAI;AACnB,MAAAC,QAAO,IAAI;AACX,YAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,YAAM,MAAM,KAAK;AACjB,eAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,cAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,YAAI,SAAS,UAAU;AACrB,gBAAM,WAAWF,YAAW,IAAI;AAChC,iBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,iBAAK,QAAQ,UAAU,GAAG;AACzE;QACF;AACA,eAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,aAAK,OAAO;AACZ,eAAO;AACP,YAAI,KAAK,QAAQ,UAAU;AACzB,eAAK,QAAQ,MAAM,CAAC;AACpB,eAAK,MAAM;QACb;MACF;AACA,WAAK,UAAU,KAAK;AACpB,WAAK,WAAU;AACf,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAC,SAAQ,IAAI;AACZ,MAAAE,SAAQ,KAAK,IAAI;AACjB,WAAK,WAAW;AAIhB,YAAM,EAAE,QAAQ,MAAM,UAAU,MAAAb,MAAI,IAAK;AACzC,UAAI,EAAE,IAAG,IAAK;AAEd,aAAO,KAAK,IAAI;AAChB,MAAAc,OAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,UAAI,KAAK,YAAY,WAAW,KAAK;AACnC,aAAK,QAAQ,MAAM,CAAC;AACpB,cAAM;MACR;AAEA,eAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,eAAOA,EAAC,IAAI;AAIjD,mBAAa,MAAM,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGf,KAAI;AAC9D,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM,QAAQU,YAAW,GAAG;AAC5B,YAAM,MAAM,KAAK;AAEjB,UAAI,MAAM;AAAG,cAAM,IAAI,MAAM,6CAA6C;AAC1E,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,IAAG;AACtB,UAAI,SAAS,MAAM;AAAQ,cAAM,IAAI,MAAM,oCAAoC;AAC/E,eAASK,KAAI,GAAGA,KAAI,QAAQA;AAAK,cAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGf,KAAI;IACxE;IACA,SAAM;AACJ,YAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,WAAK,WAAW,MAAM;AACtB,YAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,WAAK,QAAO;AACZ,aAAO;IACT;IACA,WAAW,IAAM;AACf,aAAA,KAAO,IAAK,KAAK,YAAmB;AACpC,SAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,YAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,SAAS;AACZ,SAAG,MAAM;AACT,UAAI,SAAS;AAAU,WAAG,OAAO,IAAI,MAAM;AAC3C,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;;AASK,MAAMgB,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;;;AD9ID,MAAMC,YAA2B,4BAAY,KAAK;IAChD;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAGD,MAAMC,YAA2B,oBAAI,YAAY,EAAE;AAC7C,MAAO,SAAP,cAAsBC,QAAc;IAYxC,YAAY,YAAoB,IAAE;AAChC,YAAM,IAAI,WAAW,GAAG,KAAK;AAVrB,WAAA,IAAYC,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;IAIrC;IACU,MAAG;AACX,YAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,aAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IAChC;;IAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,WAAK,IAAIP,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;IACf;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,QAAAX,UAASW,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,cAAM,MAAMX,UAASW,KAAI,EAAE;AAC3B,cAAMC,MAAKZ,UAASW,KAAI,CAAC;AACzB,cAAM,KAAKE,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,cAAM,KAAKA,MAAKD,KAAI,EAAE,IAAIC,MAAKD,KAAI,EAAE,IAAKA,QAAO;AACjD,QAAAZ,UAASW,EAAC,IAAK,KAAKX,UAASW,KAAI,CAAC,IAAI,KAAKX,UAASW,KAAI,EAAE,IAAK;MACjE;AAEA,UAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,SAASE,MAAKN,IAAG,CAAC,IAAIM,MAAKN,IAAG,EAAE,IAAIM,MAAKN,IAAG,EAAE;AACpD,cAAM,KAAMG,KAAI,SAASI,KAAIP,IAAGC,IAAGC,EAAC,IAAIV,UAASY,EAAC,IAAIX,UAASW,EAAC,IAAK;AACrE,cAAM,SAASE,MAAKV,IAAG,CAAC,IAAIU,MAAKV,IAAG,EAAE,IAAIU,MAAKV,IAAG,EAAE;AACpD,cAAM,KAAM,SAASY,KAAIZ,IAAGC,IAAGC,EAAC,IAAK;AACrC,QAAAK,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAKD,KAAI,KAAM;AACf,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAK,KAAK,KAAM;MAClB;AAEA,MAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,WAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IACjC;IACU,aAAU;AAClB,MAAAM,OAAMhB,SAAQ;IAChB;IACA,UAAO;AACL,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,MAAAgB,OAAM,KAAK,MAAM;IACnB;;AAuRK,MAAMC,UAAgC,gBAAAC,cAAa,MAAM,IAAI,OAAM,CAAE;;;AD5WrE,MAAMC,UAAyBA;;;AGnBtC;;;ACAA;;;ACAA;;;ACAA;;;ACAA;;;ACAA;AAMM,WAAUC,SAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAUC,SAAQC,IAAW,QAAgB,IAAE;AACnD,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,GAAG;AACrC,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,GAAG,MAAM,8BAA8BA,EAAC,EAAE;IAC5D;EACF;AAGM,WAAUC,QAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,UAAM,QAAQJ,SAAQ,KAAK;AAC3B,UAAM,MAAM,OAAO;AACnB,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,YAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,YAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;IACzE;AACA,WAAO;EACT;AAGM,WAAUK,OAAMC,IAAQ;AAC5B,QAAI,OAAOA,OAAM,cAAc,OAAOA,GAAE,WAAW;AACjD,YAAM,IAAI,MAAM,yCAAyC;AAC3D,IAAAJ,SAAQI,GAAE,SAAS;AACnB,IAAAJ,SAAQI,GAAE,QAAQ;EACpB;AAGM,WAAUC,SAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAUC,SAAQ,KAAU,UAAa;AAC7C,IAAAJ,QAAO,KAAK,QAAW,qBAAqB;AAC5C,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,sDAAsD,GAAG;IAC3E;EACF;AAkBM,WAAUK,UAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAUC,YAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAUC,MAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAsCA,MAAM,gBAA0C;;IAE9C,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,UAAU,cAAc,OAAO,WAAW,YAAY;KAAW;AAG9F,MAAM,QAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAAC,GAAGC,OAC5DA,GAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAO3B,WAAUC,YAAW,OAAiB;AAC1C,IAAAC,QAAO,KAAK;AAEZ,QAAI;AAAe,aAAO,MAAM,MAAK;AAErC,QAAI,MAAM;AACV,aAASF,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,aAAO,MAAM,MAAMA,EAAC,CAAC;IACvB;AACA,WAAO;EACT;AAGA,MAAM,SAAS,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAG;AAC5D,WAAS,cAAc,IAAU;AAC/B,QAAI,MAAM,OAAO,MAAM,MAAM,OAAO;AAAI,aAAO,KAAK,OAAO;AAC3D,QAAI,MAAM,OAAO,KAAK,MAAM,OAAO;AAAG,aAAO,MAAM,OAAO,IAAI;AAC9D,QAAI,MAAM,OAAO,KAAK,MAAM,OAAO;AAAG,aAAO,MAAM,OAAO,IAAI;AAC9D;EACF;AAMM,WAAUG,YAAW,KAAW;AACpC,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AAErF,QAAI;AAAe,aAAO,WAAW,QAAQ,GAAG;AAChD,UAAM,KAAK,IAAI;AACf,UAAM,KAAK,KAAK;AAChB,QAAI,KAAK;AAAG,YAAM,IAAI,MAAM,qDAAqD,EAAE;AACnF,UAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,aAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAC/C,YAAM,KAAK,cAAc,IAAI,WAAW,EAAE,CAAC;AAC3C,YAAM,KAAK,cAAc,IAAI,WAAW,KAAK,CAAC,CAAC;AAC/C,UAAI,OAAO,UAAa,OAAO,QAAW;AACxC,cAAM,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AACjC,cAAM,IAAI,MAAM,iDAAiD,OAAO,gBAAgB,EAAE;MAC5F;AACA,YAAM,EAAE,IAAI,KAAK,KAAK;IACxB;AACA,WAAO;EACT;AAoDM,WAAUC,gBAAe,QAAoB;AACjD,QAAI,MAAM;AACV,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,YAAMC,KAAI,OAAOD,EAAC;AAClB,MAAAE,QAAOD,EAAC;AACR,aAAOA,GAAE;IACX;AACA,UAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,aAASD,KAAI,GAAG,MAAM,GAAGA,KAAI,OAAO,QAAQA,MAAK;AAC/C,YAAMC,KAAI,OAAOD,EAAC;AAClB,UAAI,IAAIC,IAAG,GAAG;AACd,aAAOA,GAAE;IACX;AACA,WAAO;EACT;AAoEM,WAAUE,cACd,UACA,OAAiB,CAAA,GAAE;AAEnB,UAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,UAAM,MAAM,SAAS,MAAS;AAC9B,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,WAAO,OAAO,OAAO,IAAI;AACzB,WAAO,OAAO,OAAO,KAAK;EAC5B;AAGM,WAAUC,aAAY,cAAc,IAAE;AAC1C,UAAMC,MAAK,OAAO,eAAe,WAAY,WAAmB,SAAS;AACzE,QAAI,OAAOA,KAAI,oBAAoB;AACjC,YAAM,IAAI,MAAM,wCAAwC;AAC1D,WAAOA,IAAG,gBAAgB,IAAI,WAAW,WAAW,CAAC;EACvD;AAGO,MAAMC,WAAU,CAAC,YAAwC;IAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;ADzUrF,WAAUC,KAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAUC,KAAIH,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAMM,MAAgBE,UAAhB,MAAsB;IAoB1B,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,sCAAW;AACX,oCAAS;AACT,iCAAM;AACN,uCAAY;AAGpB,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,OAAOA;AACZ,WAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,WAAK,OAAOC,YAAW,KAAK,MAAM;IACpC;IACA,OAAO,MAAgB;AACrB,MAAAC,SAAQ,IAAI;AACZ,MAAAC,QAAO,IAAI;AACX,YAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,YAAM,MAAM,KAAK;AACjB,eAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,cAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,YAAI,SAAS,UAAU;AACrB,gBAAM,WAAWF,YAAW,IAAI;AAChC,iBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,iBAAK,QAAQ,UAAU,GAAG;AACzE;QACF;AACA,eAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,aAAK,OAAO;AACZ,eAAO;AACP,YAAI,KAAK,QAAQ,UAAU;AACzB,eAAK,QAAQ,MAAM,CAAC;AACpB,eAAK,MAAM;QACb;MACF;AACA,WAAK,UAAU,KAAK;AACpB,WAAK,WAAU;AACf,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAC,SAAQ,IAAI;AACZ,MAAAE,SAAQ,KAAK,IAAI;AACjB,WAAK,WAAW;AAIhB,YAAM,EAAE,QAAQ,MAAM,UAAU,MAAAJ,MAAI,IAAK;AACzC,UAAI,EAAE,IAAG,IAAK;AAEd,aAAO,KAAK,IAAI;AAChB,MAAAK,OAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,UAAI,KAAK,YAAY,WAAW,KAAK;AACnC,aAAK,QAAQ,MAAM,CAAC;AACpB,cAAM;MACR;AAEA,eAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,eAAOA,EAAC,IAAI;AAIjD,WAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGN,KAAI;AAC7D,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM,QAAQC,YAAW,GAAG;AAC5B,YAAM,MAAM,KAAK;AAEjB,UAAI,MAAM;AAAG,cAAM,IAAI,MAAM,2CAA2C;AACxE,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,IAAG;AACtB,UAAI,SAAS,MAAM;AAAQ,cAAM,IAAI,MAAM,oCAAoC;AAC/E,eAASK,KAAI,GAAGA,KAAI,QAAQA;AAAK,cAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGN,KAAI;IACxE;IACA,SAAM;AACJ,YAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,WAAK,WAAW,MAAM;AACtB,YAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,WAAK,QAAO;AACZ,aAAO;IACT;IACA,WAAW,IAAM;AACf,kBAAO,IAAK,KAAK,YAAmB;AACpC,SAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,YAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,SAAS;AACZ,SAAG,MAAM;AACT,UAAI,SAAS;AAAU,WAAG,OAAO,IAAI,MAAM;AAC3C,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;;AASK,MAAMO,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;;;AD1HD,MAAMC,YAA2B,4BAAY,KAAK;IAChD;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAGD,MAAMC,YAA2B,oBAAI,YAAY,EAAE;AAGnD,MAAeC,YAAf,cAAuDC,QAAS;IAY9D,YAAY,WAAiB;AAC3B,YAAM,IAAI,WAAW,GAAG,KAAK;IAC/B;IACU,MAAG;AACX,YAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,aAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IAChC;;IAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,WAAK,IAAIP,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;IACf;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,QAAAX,UAASW,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,cAAM,MAAMX,UAASW,KAAI,EAAE;AAC3B,cAAMC,MAAKZ,UAASW,KAAI,CAAC;AACzB,cAAM,KAAKE,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,cAAM,KAAKA,MAAKD,KAAI,EAAE,IAAIC,MAAKD,KAAI,EAAE,IAAKA,QAAO;AACjD,QAAAZ,UAASW,EAAC,IAAK,KAAKX,UAASW,KAAI,CAAC,IAAI,KAAKX,UAASW,KAAI,EAAE,IAAK;MACjE;AAEA,UAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,SAASE,MAAKN,IAAG,CAAC,IAAIM,MAAKN,IAAG,EAAE,IAAIM,MAAKN,IAAG,EAAE;AACpD,cAAM,KAAMG,KAAI,SAASI,KAAIP,IAAGC,IAAGC,EAAC,IAAIV,UAASY,EAAC,IAAIX,UAASW,EAAC,IAAK;AACrE,cAAM,SAASE,MAAKV,IAAG,CAAC,IAAIU,MAAKV,IAAG,EAAE,IAAIU,MAAKV,IAAG,EAAE;AACpD,cAAM,KAAM,SAASY,KAAIZ,IAAGC,IAAGC,EAAC,IAAK;AACrC,QAAAK,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAKD,KAAI,KAAM;AACf,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAK,KAAK,KAAM;MAClB;AAEA,MAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,WAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IACjC;IACU,aAAU;AAClB,MAAAM,OAAMhB,SAAQ;IAChB;IACA,UAAO;AACL,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,MAAAgB,OAAM,KAAK,MAAM;IACnB;;AAII,MAAOC,WAAP,cAAuBhB,UAAiB;IAW5C,cAAA;AACE,YAAM,EAAE;AATA;;+BAAYiB,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;IAGrC;;AAqTK,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;;;AGlb/B;;;ACAA;AAqBA,MAAMC,OAAsB,uBAAO,CAAC;AACpC,MAAMC,OAAsB,uBAAO,CAAC;AAS9B,WAAU,MAAM,OAAgB,QAAgB,IAAE;AACtD,QAAI,OAAO,UAAU,WAAW;AAC9B,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,SAAS,gCAAgC,OAAO,KAAK;IACvE;AACA,WAAO;EACT;AAGA,WAAS,WAAWC,IAAkB;AACpC,QAAI,OAAOA,OAAM,UAAU;AACzB,UAAI,CAAC,SAASA,EAAC;AAAG,cAAM,IAAI,MAAM,mCAAmCA,EAAC;IACxE;AAAO,MAAAC,SAAQD,EAAC;AAChB,WAAOA;EACT;AASM,WAAU,oBAAoB,KAAoB;AACtD,UAAM,MAAM,WAAW,GAAG,EAAE,SAAS,EAAE;AACvC,WAAO,IAAI,SAAS,IAAI,MAAM,MAAM;EACtC;AAEM,WAAU,YAAY,KAAW;AACrC,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AACrF,WAAO,QAAQ,KAAKE,OAAM,OAAO,OAAO,GAAG;EAC7C;AAGM,WAAU,gBAAgB,OAAiB;AAC/C,WAAO,YAAYC,YAAY,KAAK,CAAC;EACvC;AACM,WAAU,gBAAgB,OAAiB;AAC/C,WAAO,YAAYA,YAAY,UAAUC,QAAQ,KAAK,CAAC,EAAE,QAAO,CAAE,CAAC;EACrE;AAEM,WAAU,gBAAgBC,IAAoB,KAAW;AAC7D,IAAAC,SAAQ,GAAG;AACX,IAAAD,KAAI,WAAWA,EAAC;AAChB,UAAM,MAAME,YAAYF,GAAE,SAAS,EAAE,EAAE,SAAS,MAAM,GAAG,GAAG,CAAC;AAC7D,QAAI,IAAI,WAAW;AAAK,YAAM,IAAI,MAAM,kBAAkB;AAC1D,WAAO;EACT;AACM,WAAU,gBAAgBA,IAAoB,KAAW;AAC7D,WAAO,gBAAgBA,IAAG,GAAG,EAAE,QAAO;EACxC;AAkBM,WAAU,UAAU,OAAiB;AACzC,WAAO,WAAW,KAAK,KAAK;EAC9B;AAoBA,MAAM,WAAW,CAACG,OAAc,OAAOA,OAAM,YAAYC,QAAOD;AAE1D,WAAU,QAAQA,IAAW,KAAa,KAAW;AACzD,WAAO,SAASA,EAAC,KAAK,SAAS,GAAG,KAAK,SAAS,GAAG,KAAK,OAAOA,MAAKA,KAAI;EAC1E;AAOM,WAAU,SAAS,OAAeA,IAAW,KAAa,KAAW;AAMzE,QAAI,CAAC,QAAQA,IAAG,KAAK,GAAG;AACtB,YAAM,IAAI,MAAM,oBAAoB,QAAQ,OAAO,MAAM,aAAa,MAAM,WAAWA,EAAC;EAC5F;AASM,WAAU,OAAOA,IAAS;AAC9B,QAAI;AACJ,SAAK,MAAM,GAAGA,KAAIC,MAAKD,OAAME,MAAK,OAAO;AAAE;AAC3C,WAAO;EACT;AAsBO,MAAM,UAAU,CAACC,QAAuBC,QAAO,OAAOD,EAAC,KAAKC;AAY7D,WAAU,eACd,SACA,UACA,QAA4D;AAE5D,IAAAC,SAAQ,SAAS,SAAS;AAC1B,IAAAA,SAAQ,UAAU,UAAU;AAC5B,QAAI,OAAO,WAAW;AAAY,YAAM,IAAI,MAAM,2BAA2B;AAC7E,UAAMC,OAAM,CAAC,QAA4B,IAAI,WAAW,GAAG;AAC3D,UAAM,OAAO,WAAW,GAAE;AAC1B,UAAM,QAAQ,WAAW,GAAG,CAAI;AAChC,UAAM,QAAQ,WAAW,GAAG,CAAI;AAChC,UAAM,gBAAgB;AAGtB,QAAIC,KAAID,KAAI,OAAO;AACnB,QAAIE,KAAIF,KAAI,OAAO;AACnB,QAAIG,KAAI;AACR,UAAM,QAAQ,MAAK;AACjB,MAAAF,GAAE,KAAK,CAAC;AACR,MAAAC,GAAE,KAAK,CAAC;AACR,MAAAC,KAAI;IACN;AACA,UAAMC,KAAI,IAAI,SAAuB,OAAOF,IAAGG,aAAaJ,IAAG,GAAG,IAAI,CAAC;AACvE,UAAM,SAAS,CAAC,OAAmB,SAAQ;AAEzC,MAAAC,KAAIE,GAAE,OAAO,IAAI;AACjB,MAAAH,KAAIG,GAAC;AACL,UAAI,KAAK,WAAW;AAAG;AACvB,MAAAF,KAAIE,GAAE,OAAO,IAAI;AACjB,MAAAH,KAAIG,GAAC;IACP;AACA,UAAM,MAAM,MAAK;AAEf,UAAID,QAAO;AAAe,cAAM,IAAI,MAAM,sCAAsC;AAChF,UAAI,MAAM;AACV,YAAM,MAAoB,CAAA;AAC1B,aAAO,MAAM,UAAU;AACrB,QAAAF,KAAIG,GAAC;AACL,cAAM,KAAKH,GAAE,MAAK;AAClB,YAAI,KAAK,EAAE;AACX,eAAOA,GAAE;MACX;AACA,aAAOI,aAAa,GAAG,GAAG;IAC5B;AACA,UAAM,WAAW,CAAC,MAAkB,SAAoB;AACtD,YAAK;AACL,aAAO,IAAI;AACX,UAAI,MAAqB;AACzB,aAAO,EAAE,MAAM,KAAK,IAAG,CAAE;AAAI,eAAM;AACnC,YAAK;AACL,aAAO;IACT;AACA,WAAO;EACT;AAEM,WAAU,eACd,QACA,SAAiC,CAAA,GACjC,YAAoC,CAAA,GAAE;AAEtC,QAAI,CAAC,UAAU,OAAO,WAAW;AAAU,YAAM,IAAI,MAAM,+BAA+B;AAE1F,aAAS,WAAW,WAAiB,cAAsB,OAAc;AACvE,YAAM,MAAM,OAAO,SAAS;AAC5B,UAAI,SAAS,QAAQ;AAAW;AAChC,YAAM,UAAU,OAAO;AACvB,UAAI,YAAY,gBAAgB,QAAQ;AACtC,cAAM,IAAI,MAAM,UAAU,SAAS,0BAA0B,YAAY,SAAS,OAAO,EAAE;IAC/F;AACA,UAAM,OAAO,CAACC,IAAkB,UAC9B,OAAO,QAAQA,EAAC,EAAE,QAAQ,CAAC,CAACJ,IAAGD,EAAC,MAAM,WAAWC,IAAGD,IAAG,KAAK,CAAC;AAC/D,SAAK,QAAQ,KAAK;AAClB,SAAK,WAAW,IAAI;EACtB;AAaM,WAAU,SACd,IAA6B;AAE7B,UAAM,MAAM,oBAAI,QAAO;AACvB,WAAO,CAAC,QAAW,SAAc;AAC/B,YAAM,MAAM,IAAI,IAAI,GAAG;AACvB,UAAI,QAAQ;AAAW,eAAO;AAC9B,YAAM,WAAW,GAAG,KAAK,GAAG,IAAI;AAChC,UAAI,IAAI,KAAK,QAAQ;AACrB,aAAO;IACT;EACF;;;AC7RA;AAmBA,MAAMM,OAAsB,uBAAO,CAAC;AAApC,MAAuCC,OAAsB,uBAAO,CAAC;AAArE,MAAwEC,OAAsB,uBAAO,CAAC;AAEtG,MAAM,MAAsB,uBAAO,CAAC;AAApC,MAAuC,MAAsB,uBAAO,CAAC;AAArE,MAAwE,MAAsB,uBAAO,CAAC;AAEtG,MAAMC,OAAsB,uBAAO,CAAC;AAApC,MAAuC,MAAsB,uBAAO,CAAC;AAArE,MAAwE,MAAsB,uBAAO,CAAC;AACtG,MAAM,OAAuB,uBAAO,EAAE;AAGhC,WAAU,IAAIC,IAAWC,IAAS;AACtC,UAAM,SAASD,KAAIC;AACnB,WAAO,UAAUL,OAAM,SAASK,KAAI;EACtC;AAYM,WAAU,KAAKC,IAAW,OAAe,QAAc;AAC3D,QAAI,MAAMA;AACV,WAAO,UAAUC,MAAK;AACpB,aAAO;AACP,aAAO;IACT;AACA,WAAO;EACT;AAMM,WAAUC,QAAO,QAAgB,QAAc;AACnD,QAAI,WAAWD;AAAK,YAAM,IAAI,MAAM,kCAAkC;AACtE,QAAI,UAAUA;AAAK,YAAM,IAAI,MAAM,4CAA4C,MAAM;AAErF,QAAIE,KAAI,IAAI,QAAQ,MAAM;AAC1B,QAAIC,KAAI;AAER,QAAIJ,KAAIC,MAAKI,KAAIC,MAAKC,KAAID,MAAKE,KAAIP;AACnC,WAAOE,OAAMF,MAAK;AAEhB,YAAMQ,KAAIL,KAAID;AACd,YAAMO,KAAIN,KAAID;AACd,YAAMQ,KAAIX,KAAIO,KAAIE;AAClB,YAAMG,KAAIP,KAAIG,KAAIC;AAElB,MAAAL,KAAID,IAAGA,KAAIO,IAAGV,KAAIO,IAAGF,KAAIG,IAAGD,KAAII,IAAGH,KAAII;IACzC;AACA,UAAMC,OAAMT;AACZ,QAAIS,SAAQP;AAAK,YAAM,IAAI,MAAM,wBAAwB;AACzD,WAAO,IAAIN,IAAG,MAAM;EACtB;AAEA,WAAS,eAAkB,IAAe,MAASY,IAAI;AACrD,QAAI,CAAC,GAAG,IAAI,GAAG,IAAI,IAAI,GAAGA,EAAC;AAAG,YAAM,IAAI,MAAM,yBAAyB;EACzE;AAMA,WAAS,UAAa,IAAeA,IAAI;AACvC,UAAM,UAAU,GAAG,QAAQN,QAAO;AAClC,UAAM,OAAO,GAAG,IAAIM,IAAG,MAAM;AAC7B,mBAAe,IAAI,MAAMA,EAAC;AAC1B,WAAO;EACT;AAEA,WAAS,UAAa,IAAeA,IAAI;AACvC,UAAM,UAAU,GAAG,QAAQ,OAAO;AAClC,UAAME,MAAK,GAAG,IAAIF,IAAGG,IAAG;AACxB,UAAMP,KAAI,GAAG,IAAIM,KAAI,MAAM;AAC3B,UAAM,KAAK,GAAG,IAAIF,IAAGJ,EAAC;AACtB,UAAMQ,KAAI,GAAG,IAAI,GAAG,IAAI,IAAID,IAAG,GAAGP,EAAC;AACnC,UAAM,OAAO,GAAG,IAAI,IAAI,GAAG,IAAIQ,IAAG,GAAG,GAAG,CAAC;AACzC,mBAAe,IAAI,MAAMJ,EAAC;AAC1B,WAAO;EACT;AAIA,WAAS,WAAWK,IAAS;AAC3B,UAAM,MAAM,MAAMA,EAAC;AACnB,UAAM,KAAK,cAAcA,EAAC;AAC1B,UAAM,KAAK,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AACnC,UAAM,KAAK,GAAG,KAAK,EAAE;AACrB,UAAM,KAAK,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC;AAC9B,UAAM,MAAMA,KAAIC,QAAO;AACvB,WAAO,CAAI,IAAeN,OAAQ;AAChC,UAAI,MAAM,GAAG,IAAIA,IAAG,EAAE;AACtB,UAAI,MAAM,GAAG,IAAI,KAAK,EAAE;AACxB,YAAM,MAAM,GAAG,IAAI,KAAK,EAAE;AAC1B,YAAM,MAAM,GAAG,IAAI,KAAK,EAAE;AAC1B,YAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAGA,EAAC;AAChC,YAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAGA,EAAC;AAChC,YAAM,GAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,YAAM,GAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,YAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAGA,EAAC;AAChC,YAAM,OAAO,GAAG,KAAK,KAAK,KAAK,EAAE;AACjC,qBAAe,IAAI,MAAMA,EAAC;AAC1B,aAAO;IACT;EACF;AASM,WAAU,cAAcK,IAAS;AAGrC,QAAIA,KAAI;AAAK,YAAM,IAAI,MAAM,qCAAqC;AAElE,QAAIE,KAAIF,KAAIX;AACZ,QAAIc,KAAI;AACR,WAAOD,KAAIJ,SAAQd,MAAK;AACtB,MAAAkB,MAAKJ;AACL,MAAAK;IACF;AAGA,QAAI,IAAIL;AACR,UAAM,MAAM,MAAME,EAAC;AACnB,WAAO,WAAW,KAAK,CAAC,MAAM,GAAG;AAG/B,UAAI,MAAM;AAAM,cAAM,IAAI,MAAM,+CAA+C;IACjF;AAEA,QAAIG,OAAM;AAAG,aAAO;AAIpB,QAAI,KAAK,IAAI,IAAI,GAAGD,EAAC;AACrB,UAAM,UAAUA,KAAIb,QAAOS;AAC3B,WAAO,SAAS,YAAe,IAAeH,IAAI;AAChD,UAAI,GAAG,IAAIA,EAAC;AAAG,eAAOA;AAEtB,UAAI,WAAW,IAAIA,EAAC,MAAM;AAAG,cAAM,IAAI,MAAM,yBAAyB;AAGtE,UAAIS,KAAID;AACR,UAAIE,KAAI,GAAG,IAAI,GAAG,KAAK,EAAE;AACzB,UAAIC,KAAI,GAAG,IAAIX,IAAGO,EAAC;AACnB,UAAIK,KAAI,GAAG,IAAIZ,IAAG,MAAM;AAIxB,aAAO,CAAC,GAAG,IAAIW,IAAG,GAAG,GAAG,GAAG;AACzB,YAAI,GAAG,IAAIA,EAAC;AAAG,iBAAO,GAAG;AACzB,YAAIP,KAAI;AAGR,YAAI,QAAQ,GAAG,IAAIO,EAAC;AACpB,eAAO,CAAC,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG;AAC7B,UAAAP;AACA,kBAAQ,GAAG,IAAI,KAAK;AACpB,cAAIA,OAAMK;AAAG,kBAAM,IAAI,MAAM,yBAAyB;QACxD;AAGA,cAAM,WAAWf,QAAO,OAAOe,KAAIL,KAAI,CAAC;AACxC,cAAMZ,KAAI,GAAG,IAAIkB,IAAG,QAAQ;AAG5B,QAAAD,KAAIL;AACJ,QAAAM,KAAI,GAAG,IAAIlB,EAAC;AACZ,QAAAmB,KAAI,GAAG,IAAIA,IAAGD,EAAC;AACf,QAAAE,KAAI,GAAG,IAAIA,IAAGpB,EAAC;MACjB;AACA,aAAOoB;IACT;EACF;AAaM,WAAU,OAAOP,IAAS;AAE9B,QAAIA,KAAI,QAAQ;AAAK,aAAO;AAE5B,QAAIA,KAAI,QAAQ;AAAK,aAAO;AAE5B,QAAIA,KAAI,SAAS;AAAK,aAAO,WAAWA,EAAC;AAEzC,WAAO,cAAcA,EAAC;EACxB;AAiDA,MAAM,eAAe;IACnB;IAAU;IAAW;IAAO;IAAO;IAAO;IAAQ;IAClD;IAAO;IAAO;IAAO;IAAO;IAAO;IACnC;IAAQ;IAAQ;IAAQ;;AAEpB,WAAU,cAAiB,OAAgB;AAC/C,UAAM,UAAU;MACd,OAAO;MACP,OAAO;MACP,MAAM;;AAER,UAAM,OAAO,aAAa,OAAO,CAAC,KAAK,QAAe;AACpD,UAAI,GAAG,IAAI;AACX,aAAO;IACT,GAAG,OAAO;AACV,mBAAe,OAAO,IAAI;AAI1B,WAAO;EACT;AAQM,WAAU,MAAS,IAAe,KAAQ,OAAa;AAC3D,QAAI,QAAQQ;AAAK,YAAM,IAAI,MAAM,yCAAyC;AAC1E,QAAI,UAAUA;AAAK,aAAO,GAAG;AAC7B,QAAI,UAAUC;AAAK,aAAO;AAC1B,QAAIC,KAAI,GAAG;AACX,QAAIC,KAAI;AACR,WAAO,QAAQH,MAAK;AAClB,UAAI,QAAQC;AAAK,QAAAC,KAAI,GAAG,IAAIA,IAAGC,EAAC;AAChC,MAAAA,KAAI,GAAG,IAAIA,EAAC;AACZ,gBAAUF;IACZ;AACA,WAAOC;EACT;AAOM,WAAU,cAAiB,IAAe,MAAW,WAAW,OAAK;AACzE,UAAM,WAAW,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,WAAW,GAAG,OAAO,MAAS;AAE3E,UAAM,gBAAgB,KAAK,OAAO,CAAC,KAAK,KAAKE,OAAK;AAChD,UAAI,GAAG,IAAI,GAAG;AAAG,eAAO;AACxB,eAASA,EAAC,IAAI;AACd,aAAO,GAAG,IAAI,KAAK,GAAG;IACxB,GAAG,GAAG,GAAG;AAET,UAAM,cAAc,GAAG,IAAI,aAAa;AAExC,SAAK,YAAY,CAAC,KAAK,KAAKA,OAAK;AAC/B,UAAI,GAAG,IAAI,GAAG;AAAG,eAAO;AACxB,eAASA,EAAC,IAAI,GAAG,IAAI,KAAK,SAASA,EAAC,CAAC;AACrC,aAAO,GAAG,IAAI,KAAK,GAAG;IACxB,GAAG,WAAW;AACd,WAAO;EACT;AAgBM,WAAU,WAAc,IAAeC,IAAI;AAG/C,UAAM,UAAU,GAAG,QAAQC,QAAOC;AAClC,UAAM,UAAU,GAAG,IAAIF,IAAG,MAAM;AAChC,UAAM,MAAM,GAAG,IAAI,SAAS,GAAG,GAAG;AAClC,UAAM,OAAO,GAAG,IAAI,SAAS,GAAG,IAAI;AACpC,UAAM,KAAK,GAAG,IAAI,SAAS,GAAG,IAAI,GAAG,GAAG,CAAC;AACzC,QAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;AAAI,YAAM,IAAI,MAAM,gCAAgC;AAC1E,WAAO,MAAM,IAAI,OAAO,IAAI;EAC9B;AAUM,WAAU,QAAQG,IAAW,YAAmB;AAEpD,QAAI,eAAe;AAAW,MAAAC,SAAQ,UAAU;AAChD,UAAM,cAAc,eAAe,SAAY,aAAaD,GAAE,SAAS,CAAC,EAAE;AAC1E,UAAM,cAAc,KAAK,KAAK,cAAc,CAAC;AAC7C,WAAO,EAAE,YAAY,aAAa,YAAW;EAC/C;AAWA,MAAM,SAAN,MAAY;IAUV,YAAY,OAAe,OAAkB,CAAA,GAAE;AATtC;AACA;AACA;AACA;AACA,kCAAOE;AACP,iCAAMC;AACN;AACD;AACS;;AAEf,UAAI,SAASD;AAAK,cAAM,IAAI,MAAM,4CAA4C,KAAK;AACnF,UAAI,cAAkC;AACtC,WAAK,OAAO;AACZ,UAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC5C,YAAI,OAAO,KAAK,SAAS;AAAU,wBAAc,KAAK;AACtD,YAAI,OAAO,KAAK,SAAS;AAAY,eAAK,OAAO,KAAK;AACtD,YAAI,OAAO,KAAK,SAAS;AAAW,eAAK,OAAO,KAAK;AACrD,YAAI,KAAK;AAAgB,eAAK,WAAW,KAAK,gBAAgB,MAAK;AACnE,YAAI,OAAO,KAAK,iBAAiB;AAAW,eAAK,OAAO,KAAK;MAC/D;AACA,YAAM,EAAE,YAAY,YAAW,IAAK,QAAQ,OAAO,WAAW;AAC9D,UAAI,cAAc;AAAM,cAAM,IAAI,MAAM,gDAAgD;AACxF,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,aAAO,kBAAkB,IAAI;IAC/B;IAEA,OAAO,KAAW;AAChB,aAAO,IAAI,KAAK,KAAK,KAAK;IAC5B;IACA,QAAQ,KAAW;AACjB,UAAI,OAAO,QAAQ;AACjB,cAAM,IAAI,MAAM,iDAAiD,OAAO,GAAG;AAC7E,aAAOA,QAAO,OAAO,MAAM,KAAK;IAClC;IACA,IAAI,KAAW;AACb,aAAO,QAAQA;IACjB;;IAEA,YAAY,KAAW;AACrB,aAAO,CAAC,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,GAAG;IAC3C;IACA,MAAM,KAAW;AACf,cAAQ,MAAMC,UAASA;IACzB;IACA,IAAI,KAAW;AACb,aAAO,IAAI,CAAC,KAAK,KAAK,KAAK;IAC7B;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,QAAQ;IACjB;IAEA,IAAI,KAAW;AACb,aAAO,IAAI,MAAM,KAAK,KAAK,KAAK;IAClC;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,IAAI,MAAM,KAAK,KAAK,KAAK;IAClC;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,IAAI,MAAM,KAAK,KAAK,KAAK;IAClC;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,IAAI,MAAM,KAAK,KAAK,KAAK;IAClC;IACA,IAAI,KAAa,OAAa;AAC5B,aAAO,MAAM,MAAM,KAAK,KAAK;IAC/B;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,IAAI,MAAMC,QAAO,KAAK,KAAK,KAAK,GAAG,KAAK,KAAK;IACtD;;IAGA,KAAK,KAAW;AACd,aAAO,MAAM;IACf;IACA,KAAK,KAAa,KAAW;AAC3B,aAAO,MAAM;IACf;IACA,KAAK,KAAa,KAAW;AAC3B,aAAO,MAAM;IACf;IACA,KAAK,KAAa,KAAW;AAC3B,aAAO,MAAM;IACf;IAEA,IAAI,KAAW;AACb,aAAOA,QAAO,KAAK,KAAK,KAAK;IAC/B;IACA,KAAK,KAAW;AAEd,UAAI,CAAC,KAAK;AAAO,aAAK,QAAQ,OAAO,KAAK,KAAK;AAC/C,aAAO,KAAK,MAAM,MAAM,GAAG;IAC7B;IACA,QAAQ,KAAW;AACjB,aAAO,KAAK,OAAO,gBAAgB,KAAK,KAAK,KAAK,IAAI,gBAAgB,KAAK,KAAK,KAAK;IACvF;IACA,UAAU,OAAmB,iBAAiB,OAAK;AACjD,MAAAC,QAAO,KAAK;AACZ,YAAM,EAAE,UAAU,gBAAgB,OAAO,MAAAC,OAAM,OAAO,MAAM,aAAY,IAAK;AAC7E,UAAI,gBAAgB;AAClB,YAAI,CAAC,eAAe,SAAS,MAAM,MAAM,KAAK,MAAM,SAAS,OAAO;AAClE,gBAAM,IAAI,MACR,+BAA+B,iBAAiB,iBAAiB,MAAM,MAAM;QAEjF;AACA,cAAM,SAAS,IAAI,WAAW,KAAK;AAEnC,eAAO,IAAI,OAAOA,QAAO,IAAI,OAAO,SAAS,MAAM,MAAM;AACzD,gBAAQ;MACV;AACA,UAAI,MAAM,WAAW;AACnB,cAAM,IAAI,MAAM,+BAA+B,QAAQ,iBAAiB,MAAM,MAAM;AACtF,UAAI,SAASA,QAAO,gBAAgB,KAAK,IAAI,gBAAgB,KAAK;AAClE,UAAI;AAAc,iBAAS,IAAI,QAAQ,KAAK;AAC5C,UAAI,CAAC;AACH,YAAI,CAAC,KAAK,QAAQ,MAAM;AACtB,gBAAM,IAAI,MAAM,kDAAkD;;AAGtE,aAAO;IACT;;IAEA,YAAY,KAAa;AACvB,aAAO,cAAc,MAAM,GAAG;IAChC;;;IAGA,KAAKC,IAAWC,IAAW,WAAkB;AAC3C,aAAO,YAAYA,KAAID;IACzB;;AAsBI,WAAU,MAAM,OAAe,OAAkB,CAAA,GAAE;AACvD,WAAO,IAAI,OAAO,OAAO,IAAI;EAC/B;AAkCM,WAAU,oBAAoB,YAAkB;AACpD,QAAI,OAAO,eAAe;AAAU,YAAM,IAAI,MAAM,4BAA4B;AAChF,UAAM,YAAY,WAAW,SAAS,CAAC,EAAE;AACzC,WAAO,KAAK,KAAK,YAAY,CAAC;EAChC;AASM,WAAU,iBAAiB,YAAkB;AACjD,UAAM,SAAS,oBAAoB,UAAU;AAC7C,WAAO,SAAS,KAAK,KAAK,SAAS,CAAC;EACtC;AAeM,WAAU,eAAe,KAAiB,YAAoBE,QAAO,OAAK;AAC9E,IAAAC,QAAO,GAAG;AACV,UAAM,MAAM,IAAI;AAChB,UAAM,WAAW,oBAAoB,UAAU;AAC/C,UAAM,SAAS,iBAAiB,UAAU;AAE1C,QAAI,MAAM,MAAM,MAAM,UAAU,MAAM;AACpC,YAAM,IAAI,MAAM,cAAc,SAAS,+BAA+B,GAAG;AAC3E,UAAM,MAAMD,QAAO,gBAAgB,GAAG,IAAI,gBAAgB,GAAG;AAE7D,UAAM,UAAU,IAAI,KAAK,aAAaE,IAAG,IAAIA;AAC7C,WAAOF,QAAO,gBAAgB,SAAS,QAAQ,IAAI,gBAAgB,SAAS,QAAQ;EACtF;;;AFnmBA,MAAMG,OAAsB,uBAAO,CAAC;AACpC,MAAMC,OAAsB,uBAAO,CAAC;AAqH9B,WAAU,SAAwC,WAAoB,MAAO;AACjF,UAAM,MAAM,KAAK,OAAM;AACvB,WAAO,YAAY,MAAM;EAC3B;AAQM,WAAU,WACdC,IACA,QAAW;AAEX,UAAM,aAAa,cACjBA,GAAE,IACF,OAAO,IAAI,CAACC,OAAMA,GAAE,CAAE,CAAC;AAEzB,WAAO,OAAO,IAAI,CAACA,IAAGC,OAAMF,GAAE,WAAWC,GAAE,SAAS,WAAWC,EAAC,CAAC,CAAC,CAAC;EACrE;AAEA,WAAS,UAAUC,IAAW,MAAY;AACxC,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,MAAK,KAAKA,KAAI;AAC5C,YAAM,IAAI,MAAM,uCAAuC,OAAO,cAAcA,EAAC;EACjF;AAWA,WAAS,UAAUA,IAAWC,aAAkB;AAC9C,cAAUD,IAAGC,WAAU;AACvB,UAAM,UAAU,KAAK,KAAKA,cAAaD,EAAC,IAAI;AAC5C,UAAM,aAAa,MAAMA,KAAI;AAC7B,UAAM,YAAY,KAAKA;AACvB,UAAM,OAAO,QAAQA,EAAC;AACtB,UAAM,UAAU,OAAOA,EAAC;AACxB,WAAO,EAAE,SAAS,YAAY,MAAM,WAAW,QAAO;EACxD;AAEA,WAAS,YAAYE,IAAWC,SAAgB,OAAY;AAC1D,UAAM,EAAE,YAAY,MAAM,WAAW,QAAO,IAAK;AACjD,QAAI,QAAQ,OAAOD,KAAI,IAAI;AAC3B,QAAI,QAAQA,MAAK;AAQjB,QAAI,QAAQ,YAAY;AAEtB,eAAS;AACT,eAASN;IACX;AACA,UAAM,cAAcO,UAAS;AAC7B,UAAM,SAAS,cAAc,KAAK,IAAI,KAAK,IAAI;AAC/C,UAAM,SAAS,UAAU;AACzB,UAAM,QAAQ,QAAQ;AACtB,UAAM,SAASA,UAAS,MAAM;AAC9B,UAAM,UAAU;AAChB,WAAO,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO;EACxD;AAkBA,MAAM,mBAAmB,oBAAI,QAAO;AACpC,MAAM,mBAAmB,oBAAI,QAAO;AAEpC,WAAS,KAAKC,IAAM;AAGlB,WAAO,iBAAiB,IAAIA,EAAC,KAAK;EACpC;AAEA,WAAS,QAAQC,IAAS;AACxB,QAAIA,OAAMC;AAAK,YAAM,IAAI,MAAM,cAAc;EAC/C;AAoBM,MAAOC,QAAP,MAAW;;IAOf,YAAYC,QAAW,MAAY;AANlB;AACA;AACA;AACR;AAIP,WAAK,OAAOA,OAAM;AAClB,WAAK,OAAOA,OAAM;AAClB,WAAK,KAAKA,OAAM;AAChB,WAAK,OAAO;IACd;;IAGA,cAAc,KAAeH,IAAWI,KAAc,KAAK,MAAI;AAC7D,UAAIC,KAAc;AAClB,aAAOL,KAAIC,MAAK;AACd,YAAID,KAAIM;AAAK,UAAAF,KAAIA,GAAE,IAAIC,EAAC;AACxB,QAAAA,KAAIA,GAAE,OAAM;AACZ,QAAAL,OAAMM;MACR;AACA,aAAOF;IACT;;;;;;;;;;;;;IAcQ,iBAAiB,OAAiBG,IAAS;AACjD,YAAM,EAAE,SAAS,WAAU,IAAK,UAAUA,IAAG,KAAK,IAAI;AACtD,YAAM,SAAqB,CAAA;AAC3B,UAAIH,KAAc;AAClB,UAAI,OAAOA;AACX,eAASI,UAAS,GAAGA,UAAS,SAASA,WAAU;AAC/C,eAAOJ;AACP,eAAO,KAAK,IAAI;AAEhB,iBAASK,KAAI,GAAGA,KAAI,YAAYA,MAAK;AACnC,iBAAO,KAAK,IAAIL,EAAC;AACjB,iBAAO,KAAK,IAAI;QAClB;AACA,QAAAA,KAAI,KAAK,OAAM;MACjB;AACA,aAAO;IACT;;;;;;;IAQQ,KAAKG,IAAW,aAAyBP,IAAS;AAExD,UAAI,CAAC,KAAK,GAAG,QAAQA,EAAC;AAAG,cAAM,IAAI,MAAM,gBAAgB;AAEzD,UAAII,KAAI,KAAK;AACb,UAAIM,KAAI,KAAK;AAMb,YAAM,KAAK,UAAUH,IAAG,KAAK,IAAI;AACjC,eAASC,UAAS,GAAGA,UAAS,GAAG,SAASA,WAAU;AAElD,cAAM,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO,IAAK,YAAYR,IAAGQ,SAAQ,EAAE;AACnF,QAAAR,KAAI;AACJ,YAAI,QAAQ;AAGV,UAAAU,KAAIA,GAAE,IAAI,SAAS,QAAQ,YAAY,OAAO,CAAC,CAAC;QAClD,OAAO;AAEL,UAAAN,KAAIA,GAAE,IAAI,SAAS,OAAO,YAAY,MAAM,CAAC,CAAC;QAChD;MACF;AACA,cAAQJ,EAAC;AAIT,aAAO,EAAE,GAAAI,IAAG,GAAAM,GAAC;IACf;;;;;;IAOQ,WACNH,IACA,aACAP,IACA,MAAgB,KAAK,MAAI;AAEzB,YAAM,KAAK,UAAUO,IAAG,KAAK,IAAI;AACjC,eAASC,UAAS,GAAGA,UAAS,GAAG,SAASA,WAAU;AAClD,YAAIR,OAAMC;AAAK;AACf,cAAM,EAAE,OAAO,QAAQ,QAAQ,MAAK,IAAK,YAAYD,IAAGQ,SAAQ,EAAE;AAClE,QAAAR,KAAI;AACJ,YAAI,QAAQ;AAGV;QACF,OAAO;AACL,gBAAM,OAAO,YAAY,MAAM;AAC/B,gBAAM,IAAI,IAAI,QAAQ,KAAK,OAAM,IAAK,IAAI;QAC5C;MACF;AACA,cAAQA,EAAC;AACT,aAAO;IACT;IAEQ,eAAeO,IAAW,OAAiB,WAA4B;AAE7E,UAAI,OAAO,iBAAiB,IAAI,KAAK;AACrC,UAAI,CAAC,MAAM;AACT,eAAO,KAAK,iBAAiB,OAAOA,EAAC;AACrC,YAAIA,OAAM,GAAG;AAEX,cAAI,OAAO,cAAc;AAAY,mBAAO,UAAU,IAAI;AAC1D,2BAAiB,IAAI,OAAO,IAAI;QAClC;MACF;AACA,aAAO;IACT;IAEA,OACE,OACA,QACA,WAA4B;AAE5B,YAAMA,KAAI,KAAK,KAAK;AACpB,aAAO,KAAK,KAAKA,IAAG,KAAK,eAAeA,IAAG,OAAO,SAAS,GAAG,MAAM;IACtE;IAEA,OAAO,OAAiB,QAAgB,WAA8B,MAAe;AACnF,YAAMA,KAAI,KAAK,KAAK;AACpB,UAAIA,OAAM;AAAG,eAAO,KAAK,cAAc,OAAO,QAAQ,IAAI;AAC1D,aAAO,KAAK,WAAWA,IAAG,KAAK,eAAeA,IAAG,OAAO,SAAS,GAAG,QAAQ,IAAI;IAClF;;;;IAKA,YAAYR,IAAaQ,IAAS;AAChC,gBAAUA,IAAG,KAAK,IAAI;AACtB,uBAAiB,IAAIR,IAAGQ,EAAC;AACzB,uBAAiB,OAAOR,EAAC;IAC3B;IAEA,SAAS,KAAa;AACpB,aAAO,KAAK,GAAG,MAAM;IACvB;;AAOI,WAAU,cACdI,QACA,OACA,IACA,IAAU;AAEV,QAAI,MAAM;AACV,QAAI,KAAKA,OAAM;AACf,QAAI,KAAKA,OAAM;AACf,WAAO,KAAKF,QAAO,KAAKA,MAAK;AAC3B,UAAI,KAAKK;AAAK,aAAK,GAAG,IAAI,GAAG;AAC7B,UAAI,KAAKA;AAAK,aAAK,GAAG,IAAI,GAAG;AAC7B,YAAM,IAAI,OAAM;AAChB,aAAOA;AACP,aAAOA;IACT;AACA,WAAO,EAAE,IAAI,GAAE;EACjB;AAuJA,WAAS,YAAe,OAAe,OAAmBK,OAAc;AACtE,QAAI,OAAO;AACT,UAAI,MAAM,UAAU;AAAO,cAAM,IAAI,MAAM,gDAAgD;AAC3F,oBAAc,KAAK;AACnB,aAAO;IACT,OAAO;AACL,aAAO,MAAM,OAAO,EAAE,MAAAA,MAAI,CAAE;IAC9B;EACF;AAIM,WAAU,kBACd,MACA,OACA,YAA8B,CAAA,GAC9B,QAAgB;AAEhB,QAAI,WAAW;AAAW,eAAS,SAAS;AAC5C,QAAI,CAAC,SAAS,OAAO,UAAU;AAAU,YAAM,IAAI,MAAM,kBAAkB,IAAI,eAAe;AAC9F,eAAWC,MAAK,CAAC,KAAK,KAAK,GAAG,GAAY;AACxC,YAAM,MAAM,MAAMA,EAAC;AACnB,UAAI,EAAE,OAAO,QAAQ,YAAY,MAAMC;AACrC,cAAM,IAAI,MAAM,SAASD,EAAC,0BAA0B;IACxD;AACA,UAAM,KAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,UAAME,MAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,UAAMC,MAAgB,SAAS,gBAAgB,MAAM;AACrD,UAAM,SAAS,CAAC,MAAM,MAAM,KAAKA,GAAE;AACnC,eAAWH,MAAK,QAAQ;AAEtB,UAAI,CAAC,GAAG,QAAQ,MAAMA,EAAC,CAAC;AACtB,cAAM,IAAI,MAAM,SAASA,EAAC,0CAA0C;IACxE;AACA,YAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,KAAK,CAAC;AAC9C,WAAO,EAAE,OAAO,IAAI,IAAAE,IAAE;EACxB;AAMM,WAAU,aACd,iBACAE,eAAoC;AAEpC,WAAO,SAAS,OAAO,MAAiB;AACtC,YAAM,YAAY,gBAAgB,IAAI;AACtC,aAAO,EAAE,WAAW,WAAWA,cAAa,SAAS,EAAC;IACxD;EACF;;;AGxnBA;;;ACAA;AAOM,MAAO,QAAP,MAAY;IAQhB,YAAY,MAAa,KAAe;AAPxC;AACA;AACA;AACA;AACQ,sCAAW;AACX,uCAAY;AAGlB,MAAAC,OAAM,IAAI;AACV,MAAAC,QAAO,KAAK,QAAW,KAAK;AAC5B,WAAK,QAAQ,KAAK,OAAM;AACxB,UAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,cAAM,IAAI,MAAM,qDAAqD;AACvE,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,YAAY,KAAK,MAAM;AAC5B,YAAM,WAAW,KAAK;AACtB,YAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,UAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,eAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK;AAC/C,WAAK,MAAM,OAAO,GAAG;AAErB,WAAK,QAAQ,KAAK,OAAM;AAExB,eAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK,KAAO;AACtD,WAAK,MAAM,OAAO,GAAG;AACrB,MAAAC,OAAM,GAAG;IACX;IACA,OAAO,KAAe;AACpB,MAAAC,SAAQ,IAAI;AACZ,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAA,SAAQ,IAAI;AACZ,MAAAH,QAAO,KAAK,KAAK,WAAW,QAAQ;AACpC,WAAK,WAAW;AAChB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,QAAO;IACd;IACA,SAAM;AACJ,YAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,WAAK,WAAW,GAAG;AACnB,aAAO;IACT;IACA,WAAW,IAAa;AAEtB,kBAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,YAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,WAAK;AACL,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;IACA,UAAO;AACL,WAAK,YAAY;AACjB,WAAK,MAAM,QAAO;AAClB,WAAK,MAAM,QAAO;IACpB;;AAaK,MAAMI,QAGT,CAAC,MAAa,KAAiB,YACjC,IAAI,MAAW,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AAClD,EAAAA,MAAK,SAAS,CAAC,MAAa,QAAoB,IAAI,MAAW,MAAM,GAAG;;;ADOxE,MAAM,aAAa,CAAC,KAAa,SAAiB,OAAO,OAAO,IAAI,MAAM,CAAC,OAAOC,QAAO;AAOnF,WAAU,iBAAiBC,IAAW,OAAkBC,IAAS;AAIrE,UAAM,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI;AAC7B,UAAM,KAAK,WAAW,KAAKD,IAAGC,EAAC;AAC/B,UAAM,KAAK,WAAW,CAAC,KAAKD,IAAGC,EAAC;AAGhC,QAAI,KAAKD,KAAI,KAAK,KAAK,KAAK;AAC5B,QAAIE,MAAK,CAAC,KAAK,KAAK,KAAK;AACzB,UAAM,QAAQ,KAAKC;AACnB,UAAM,QAAQD,MAAKC;AACnB,QAAI;AAAO,WAAK,CAAC;AACjB,QAAI;AAAO,MAAAD,MAAK,CAACA;AAGjB,UAAM,UAAU,QAAQ,KAAK,KAAK,OAAOD,EAAC,IAAI,CAAC,CAAC,IAAIG;AACpD,QAAI,KAAKD,QAAO,MAAM,WAAWD,MAAKC,QAAOD,OAAM,SAAS;AAC1D,YAAM,IAAI,MAAM,2CAA2CF,EAAC;IAC9D;AACA,WAAO,EAAE,OAAO,IAAI,OAAO,IAAAE,IAAE;EAC/B;AA+DA,WAAS,kBAAkB,QAAc;AACvC,QAAI,CAAC,CAAC,WAAW,aAAa,KAAK,EAAE,SAAS,MAAM;AAClD,YAAM,IAAI,MAAM,2DAA2D;AAC7E,WAAO;EACT;AAEA,WAAS,gBACP,MACA,KAAM;AAEN,UAAM,QAAuB,CAAA;AAC7B,aAAS,WAAW,OAAO,KAAK,GAAG,GAAG;AAEpC,YAAM,OAAO,IAAI,KAAK,OAAO,MAAM,SAAY,IAAI,OAAO,IAAI,KAAK,OAAO;IAC5E;AACA,UAAM,MAAM,MAAO,MAAM;AACzB,UAAM,MAAM,SAAU,SAAS;AAC/B,QAAI,MAAM,WAAW;AAAW,wBAAkB,MAAM,MAAM;AAC9D,WAAO;EACT;AAqHM,MAAO,SAAP,cAAsB,MAAK;IAC/B,YAAYG,KAAI,IAAE;AAChB,YAAMA,EAAC;IACT;;AA6BK,MAAM,MAAY;;IAEvB,KAAK;;IAEL,MAAM;MACJ,QAAQ,CAAC,KAAa,SAAwB;AAC5C,cAAM,EAAE,KAAKC,GAAC,IAAK;AACnB,YAAI,MAAM,KAAK,MAAM;AAAK,gBAAM,IAAIA,GAAE,uBAAuB;AAC7D,YAAI,KAAK,SAAS;AAAG,gBAAM,IAAIA,GAAE,2BAA2B;AAC5D,cAAM,UAAU,KAAK,SAAS;AAC9B,cAAM,MAAM,oBAAoB,OAAO;AACvC,YAAK,IAAI,SAAS,IAAK;AAAa,gBAAM,IAAIA,GAAE,sCAAsC;AAEtF,cAAM,SAAS,UAAU,MAAM,oBAAqB,IAAI,SAAS,IAAK,GAAW,IAAI;AACrF,cAAMC,KAAI,oBAAoB,GAAG;AACjC,eAAOA,KAAI,SAAS,MAAM;MAC5B;;MAEA,OAAO,KAAa,MAAgB;AAClC,cAAM,EAAE,KAAKD,GAAC,IAAK;AACnB,YAAI,MAAM;AACV,YAAI,MAAM,KAAK,MAAM;AAAK,gBAAM,IAAIA,GAAE,uBAAuB;AAC7D,YAAI,KAAK,SAAS,KAAK,KAAK,KAAK,MAAM;AAAK,gBAAM,IAAIA,GAAE,uBAAuB;AAC/E,cAAM,QAAQ,KAAK,KAAK;AACxB,cAAM,SAAS,CAAC,EAAE,QAAQ;AAC1B,YAAI,SAAS;AACb,YAAI,CAAC;AAAQ,mBAAS;aACjB;AAEH,gBAAM,SAAS,QAAQ;AACvB,cAAI,CAAC;AAAQ,kBAAM,IAAIA,GAAE,mDAAmD;AAC5E,cAAI,SAAS;AAAG,kBAAM,IAAIA,GAAE,0CAA0C;AACtE,gBAAM,cAAc,KAAK,SAAS,KAAK,MAAM,MAAM;AACnD,cAAI,YAAY,WAAW;AAAQ,kBAAM,IAAIA,GAAE,uCAAuC;AACtF,cAAI,YAAY,CAAC,MAAM;AAAG,kBAAM,IAAIA,GAAE,sCAAsC;AAC5E,qBAAWE,MAAK;AAAa,qBAAU,UAAU,IAAKA;AACtD,iBAAO;AACP,cAAI,SAAS;AAAK,kBAAM,IAAIF,GAAE,wCAAwC;QACxE;AACA,cAAMG,KAAI,KAAK,SAAS,KAAK,MAAM,MAAM;AACzC,YAAIA,GAAE,WAAW;AAAQ,gBAAM,IAAIH,GAAE,gCAAgC;AACrE,eAAO,EAAE,GAAAG,IAAG,GAAG,KAAK,SAAS,MAAM,MAAM,EAAC;MAC5C;;;;;;IAMF,MAAM;MACJ,OAAO,KAAW;AAChB,cAAM,EAAE,KAAKH,GAAC,IAAK;AACnB,YAAI,MAAMH;AAAK,gBAAM,IAAIG,GAAE,4CAA4C;AACvE,YAAI,MAAM,oBAAoB,GAAG;AAEjC,YAAI,OAAO,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI;AAAQ,gBAAM,OAAO;AACvD,YAAI,IAAI,SAAS;AAAG,gBAAM,IAAIA,GAAE,gDAAgD;AAChF,eAAO;MACT;MACA,OAAO,MAAgB;AACrB,cAAM,EAAE,KAAKA,GAAC,IAAK;AACnB,YAAI,KAAK,CAAC,IAAI;AAAa,gBAAM,IAAIA,GAAE,qCAAqC;AAC5E,YAAI,KAAK,CAAC,MAAM,KAAQ,EAAE,KAAK,CAAC,IAAI;AAClC,gBAAM,IAAIA,GAAE,qDAAqD;AACnE,eAAO,gBAAgB,IAAI;MAC7B;;IAEF,MAAM,OAAiB;AAErB,YAAM,EAAE,KAAKA,IAAG,MAAM,KAAK,MAAM,IAAG,IAAK;AACzC,YAAM,OAAOI,QAAO,OAAO,QAAW,WAAW;AACjD,YAAM,EAAE,GAAG,UAAU,GAAG,aAAY,IAAK,IAAI,OAAO,IAAM,IAAI;AAC9D,UAAI,aAAa;AAAQ,cAAM,IAAIJ,GAAE,6CAA6C;AAClF,YAAM,EAAE,GAAG,QAAQ,GAAG,WAAU,IAAK,IAAI,OAAO,GAAM,QAAQ;AAC9D,YAAM,EAAE,GAAG,QAAQ,GAAG,WAAU,IAAK,IAAI,OAAO,GAAM,UAAU;AAChE,UAAI,WAAW;AAAQ,cAAM,IAAIA,GAAE,6CAA6C;AAChF,aAAO,EAAE,GAAG,IAAI,OAAO,MAAM,GAAG,GAAG,IAAI,OAAO,MAAM,EAAC;IACvD;IACA,WAAW,KAA6B;AACtC,YAAM,EAAE,MAAM,KAAK,MAAM,IAAG,IAAK;AACjC,YAAM,KAAK,IAAI,OAAO,GAAM,IAAI,OAAO,IAAI,CAAC,CAAC;AAC7C,YAAM,KAAK,IAAI,OAAO,GAAM,IAAI,OAAO,IAAI,CAAC,CAAC;AAC7C,YAAM,MAAM,KAAK;AACjB,aAAO,IAAI,OAAO,IAAM,GAAG;IAC7B;;AAKF,MAAMH,OAAM,OAAO,CAAC;AAApB,MAAuBC,OAAM,OAAO,CAAC;AAArC,MAAwCL,OAAM,OAAO,CAAC;AAAtD,MAAyDY,OAAM,OAAO,CAAC;AAAvE,MAA0EC,OAAM,OAAO,CAAC;AAqBlF,WAAU,YACd,QACA,YAAqC,CAAA,GAAE;AAEvC,UAAM,YAAY,kBAAkB,eAAe,QAAQ,SAAS;AACpE,UAAM,EAAE,IAAI,IAAAC,IAAE,IAAK;AACnB,QAAI,QAAQ,UAAU;AACtB,UAAM,EAAE,GAAG,UAAU,GAAG,YAAW,IAAK;AACxC,mBACE,WACA,CAAA,GACA;MACE,oBAAoB;MACpB,eAAe;MACf,eAAe;MACf,WAAW;MACX,SAAS;MACT,MAAM;KACP;AAGH,UAAM,EAAE,KAAI,IAAK;AACjB,QAAI,MAAM;AAER,UAAI,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK,OAAO,KAAK,SAAS,YAAY,CAAC,MAAM,QAAQ,KAAK,OAAO,GAAG;AACrF,cAAM,IAAI,MAAM,4DAA4D;MAC9E;IACF;AAEA,UAAM,UAAU,YAAY,IAAIA,GAAE;AAElC,aAAS,+BAA4B;AACnC,UAAI,CAAC,GAAG;AAAO,cAAM,IAAI,MAAM,4DAA4D;IAC7F;AAGA,aAAS,aACP,IACA,OACA,cAAqB;AAErB,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAC,IAAK,MAAM,SAAQ;AAC/B,YAAM,KAAK,GAAG,QAAQD,EAAC;AACvB,YAAM,cAAc,cAAc;AAClC,UAAI,cAAc;AAChB,qCAA4B;AAC5B,cAAM,WAAW,CAAC,GAAG,MAAOC,EAAC;AAC7B,eAAOC,aAAY,QAAQ,QAAQ,GAAG,EAAE;MAC1C,OAAO;AACL,eAAOA,aAAY,WAAW,GAAG,CAAI,GAAG,IAAI,GAAG,QAAQD,EAAC,CAAC;MAC3D;IACF;AACA,aAAS,eAAe,OAAiB;AACvC,MAAAL,QAAO,OAAO,QAAW,OAAO;AAChC,YAAM,EAAE,WAAW,MAAM,uBAAuB,OAAM,IAAK;AAC3D,YAAM,SAAS,MAAM;AACrB,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,OAAO,MAAM,SAAS,CAAC;AAE7B,UAAI,WAAW,SAAS,SAAS,KAAQ,SAAS,IAAO;AACvD,cAAMI,KAAI,GAAG,UAAU,IAAI;AAC3B,YAAI,CAAC,GAAG,QAAQA,EAAC;AAAG,gBAAM,IAAI,MAAM,qCAAqC;AACzE,cAAM,KAAK,oBAAoBA,EAAC;AAChC,YAAIC;AACJ,YAAI;AACF,UAAAA,KAAI,GAAG,KAAK,EAAE;QAChB,SAAS,WAAW;AAClB,gBAAME,OAAM,qBAAqB,QAAQ,OAAO,UAAU,UAAU;AACpE,gBAAM,IAAI,MAAM,2CAA2CA,IAAG;QAChE;AACA,qCAA4B;AAC5B,cAAM,QAAQ,GAAG,MAAOF,EAAC;AACzB,cAAM,SAAS,OAAO,OAAO;AAC7B,YAAI,UAAU;AAAO,UAAAA,KAAI,GAAG,IAAIA,EAAC;AACjC,eAAO,EAAE,GAAAD,IAAG,GAAAC,GAAC;MACf,WAAW,WAAW,UAAU,SAAS,GAAM;AAE7C,cAAMG,KAAI,GAAG;AACb,cAAMJ,KAAI,GAAG,UAAU,KAAK,SAAS,GAAGI,EAAC,CAAC;AAC1C,cAAMH,KAAI,GAAG,UAAU,KAAK,SAASG,IAAGA,KAAI,CAAC,CAAC;AAC9C,YAAI,CAAC,UAAUJ,IAAGC,EAAC;AAAG,gBAAM,IAAI,MAAM,4BAA4B;AAClE,eAAO,EAAE,GAAAD,IAAG,GAAAC,GAAC;MACf,OAAO;AACL,cAAM,IAAI,MACR,yBAAyB,MAAM,yBAAyB,IAAI,oBAAoB,MAAM,EAAE;MAE5F;IACF;AAEA,UAAM,cAAc,UAAU,WAAW;AACzC,UAAM,cAAc,UAAU,aAAa;AAC3C,aAAS,oBAAoBD,IAAI;AAC/B,YAAMK,MAAK,GAAG,IAAIL,EAAC;AACnB,YAAM,KAAK,GAAG,IAAIK,KAAIL,EAAC;AACvB,aAAO,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,IAAIA,IAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;IACvD;AAIA,aAAS,UAAUA,IAAMC,IAAI;AAC3B,YAAM,OAAO,GAAG,IAAIA,EAAC;AACrB,YAAM,QAAQ,oBAAoBD,EAAC;AACnC,aAAO,GAAG,IAAI,MAAM,KAAK;IAC3B;AAIA,QAAI,CAAC,UAAU,MAAM,IAAI,MAAM,EAAE;AAAG,YAAM,IAAI,MAAM,mCAAmC;AAIvF,UAAM,OAAO,GAAG,IAAI,GAAG,IAAI,MAAM,GAAGH,IAAG,GAAGC,IAAG;AAC7C,UAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC;AAChD,QAAI,GAAG,IAAI,GAAG,IAAI,MAAM,KAAK,CAAC;AAAG,YAAM,IAAI,MAAM,0BAA0B;AAG3E,aAAS,OAAO,OAAeX,IAAM,UAAU,OAAK;AAClD,UAAI,CAAC,GAAG,QAAQA,EAAC,KAAM,WAAW,GAAG,IAAIA,EAAC;AAAI,cAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE;AAC7F,aAAOA;IACT;AAEA,aAAS,UAAU,OAAc;AAC/B,UAAI,EAAE,iBAAiBmB;AAAQ,cAAM,IAAI,MAAM,4BAA4B;IAC7E;AAEA,aAAS,iBAAiBpB,IAAS;AACjC,UAAI,CAAC,QAAQ,CAAC,KAAK;AAAS,cAAM,IAAI,MAAM,SAAS;AACrD,aAAO,iBAAiBA,IAAG,KAAK,SAASa,IAAG,KAAK;IACnD;AAOA,UAAM,eAAe,SAAS,CAACQ,IAAU,OAA0B;AACjE,YAAM,EAAE,GAAG,GAAAC,IAAG,EAAC,IAAKD;AAEpB,UAAI,GAAG,IAAI,GAAG,GAAG,GAAG;AAAG,eAAO,EAAE,GAAG,GAAG,GAAGC,GAAC;AAC1C,YAAM,MAAMD,GAAE,IAAG;AAGjB,UAAI,MAAM;AAAM,aAAK,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;AAC5C,YAAMP,KAAI,GAAG,IAAI,GAAG,EAAE;AACtB,YAAMC,KAAI,GAAG,IAAIO,IAAG,EAAE;AACtB,YAAM,KAAK,GAAG,IAAI,GAAG,EAAE;AACvB,UAAI;AAAK,eAAO,EAAE,GAAG,GAAG,MAAM,GAAG,GAAG,KAAI;AACxC,UAAI,CAAC,GAAG,IAAI,IAAI,GAAG,GAAG;AAAG,cAAM,IAAI,MAAM,kBAAkB;AAC3D,aAAO,EAAE,GAAAR,IAAG,GAAAC,GAAC;IACf,CAAC;AAGD,UAAM,kBAAkB,SAAS,CAACM,OAAY;AAC5C,UAAIA,GAAE,IAAG,GAAI;AAIX,YAAI,UAAU,sBAAsB,CAAC,GAAG,IAAIA,GAAE,CAAC;AAAG;AAClD,cAAM,IAAI,MAAM,iBAAiB;MACnC;AAEA,YAAM,EAAE,GAAAP,IAAG,GAAAC,GAAC,IAAKM,GAAE,SAAQ;AAC3B,UAAI,CAAC,GAAG,QAAQP,EAAC,KAAK,CAAC,GAAG,QAAQC,EAAC;AAAG,cAAM,IAAI,MAAM,sCAAsC;AAC5F,UAAI,CAAC,UAAUD,IAAGC,EAAC;AAAG,cAAM,IAAI,MAAM,mCAAmC;AACzE,UAAI,CAACM,GAAE,cAAa;AAAI,cAAM,IAAI,MAAM,wCAAwC;AAChF,aAAO;IACT,CAAC;AAED,aAAS,WACP,UACA,KACA,KACA,OACA,OAAc;AAEd,YAAM,IAAID,OAAM,GAAG,IAAI,IAAI,GAAG,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;AACrD,YAAM,SAAS,OAAO,GAAG;AACzB,YAAM,SAAS,OAAO,GAAG;AACzB,aAAO,IAAI,IAAI,GAAG;IACpB;AAOA,UAAMG,UAAN,MAAMA,QAAK;;MAeT,YAAY,GAAMD,IAAM,GAAI;AALnB;AACA;AACA;AAIP,aAAK,IAAI,OAAO,KAAK,CAAC;AACtB,aAAK,IAAI,OAAO,KAAKA,IAAG,IAAI;AAC5B,aAAK,IAAI,OAAO,KAAK,CAAC;AACtB,eAAO,OAAO,IAAI;MACpB;MAEA,OAAO,QAAK;AACV,eAAO;MACT;;MAGA,OAAO,WAAWD,IAAiB;AACjC,cAAM,EAAE,GAAAP,IAAG,GAAAC,GAAC,IAAKM,MAAK,CAAA;AACtB,YAAI,CAACA,MAAK,CAAC,GAAG,QAAQP,EAAC,KAAK,CAAC,GAAG,QAAQC,EAAC;AAAG,gBAAM,IAAI,MAAM,sBAAsB;AAClF,YAAIM,cAAaE;AAAO,gBAAM,IAAI,MAAM,8BAA8B;AAEtE,YAAI,GAAG,IAAIT,EAAC,KAAK,GAAG,IAAIC,EAAC;AAAG,iBAAOQ,QAAM;AACzC,eAAO,IAAIA,QAAMT,IAAGC,IAAG,GAAG,GAAG;MAC/B;MAEA,OAAO,UAAU,OAAiB;AAChC,cAAMS,KAAID,QAAM,WAAW,YAAYb,QAAO,OAAO,QAAW,OAAO,CAAC,CAAC;AACzE,QAAAc,GAAE,eAAc;AAChB,eAAOA;MACT;MAEA,OAAO,QAAQ,KAAW;AACxB,eAAOD,QAAM,UAAUE,YAAW,GAAG,CAAC;MACxC;MAEA,IAAI,IAAC;AACH,eAAO,KAAK,SAAQ,EAAG;MACzB;MACA,IAAI,IAAC;AACH,eAAO,KAAK,SAAQ,EAAG;MACzB;;;;;;;MAQA,WAAW,aAAqB,GAAG,SAAS,MAAI;AAC9C,aAAK,YAAY,MAAM,UAAU;AACjC,YAAI,CAAC;AAAQ,eAAK,SAASd,IAAG;AAC9B,eAAO;MACT;;;MAIA,iBAAc;AACZ,wBAAgB,IAAI;MACtB;MAEA,WAAQ;AACN,cAAM,EAAE,GAAAI,GAAC,IAAK,KAAK,SAAQ;AAC3B,YAAI,CAAC,GAAG;AAAO,gBAAM,IAAI,MAAM,6BAA6B;AAC5D,eAAO,CAAC,GAAG,MAAMA,EAAC;MACpB;;MAGA,OAAO,OAAY;AACjB,kBAAU,KAAK;AACf,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,cAAM,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AAChD,cAAM,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AAChD,eAAO,MAAM;MACf;;MAGA,SAAM;AACJ,eAAO,IAAIQ,QAAM,KAAK,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;MACjD;;;;;MAMA,SAAM;AACJ,cAAM,EAAE,GAAAG,IAAG,GAAAlB,GAAC,IAAK;AACjB,cAAM,KAAK,GAAG,IAAIA,IAAGG,IAAG;AACxB,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAI,KAAK,GAAG,MAAM,KAAK,GAAG,MAAM,KAAK,GAAG;AACxC,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIe,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIA,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIA,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,eAAO,IAAIH,QAAM,IAAI,IAAI,EAAE;MAC7B;;;;;MAMA,IAAI,OAAY;AACd,kBAAU,KAAK;AACf,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAI,KAAK,GAAG,MAAM,KAAK,GAAG,MAAM,KAAK,GAAG;AACxC,cAAMG,KAAI,MAAM;AAChB,cAAM,KAAK,GAAG,IAAI,MAAM,GAAGf,IAAG;AAC9B,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIe,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIA,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIA,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,eAAO,IAAIH,QAAM,IAAI,IAAI,EAAE;MAC7B;MAEA,SAAS,OAAY;AACnB,eAAO,KAAK,IAAI,MAAM,OAAM,CAAE;MAChC;MAEA,MAAG;AACD,eAAO,KAAK,OAAOA,QAAM,IAAI;MAC/B;;;;;;;;;;MAWA,SAAS,QAAc;AACrB,cAAM,EAAE,MAAAI,MAAI,IAAK;AACjB,YAAI,CAACd,IAAG,YAAY,MAAM;AAAG,gBAAM,IAAI,MAAM,8BAA8B;AAC3E,YAAI,OAAc;AAClB,cAAM,MAAM,CAACZ,OAAc,KAAK,OAAO,MAAMA,IAAG,CAACoB,OAAM,WAAWE,SAAOF,EAAC,CAAC;AAE3E,YAAIM,OAAM;AACR,gBAAM,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,iBAAiB,MAAM;AACxD,gBAAM,EAAE,GAAG,KAAK,GAAG,IAAG,IAAK,IAAI,EAAE;AACjC,gBAAM,EAAE,GAAG,KAAK,GAAG,IAAG,IAAK,IAAI,EAAE;AACjC,iBAAO,IAAI,IAAI,GAAG;AAClB,kBAAQ,WAAWA,MAAK,MAAM,KAAK,KAAK,OAAO,KAAK;QACtD,OAAO;AACL,gBAAM,EAAE,GAAAN,IAAG,GAAAO,GAAC,IAAK,IAAI,MAAM;AAC3B,kBAAQP;AACR,iBAAOO;QACT;AAEA,eAAO,WAAWL,SAAO,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC;MAC3C;;;;;;MAOA,eAAe,IAAU;AACvB,cAAM,EAAE,MAAAI,MAAI,IAAK;AACjB,cAAMN,KAAI;AACV,YAAI,CAACR,IAAG,QAAQ,EAAE;AAAG,gBAAM,IAAI,MAAM,8BAA8B;AACnE,YAAI,OAAOV,QAAOkB,GAAE,IAAG;AAAI,iBAAOE,QAAM;AACxC,YAAI,OAAOnB;AAAK,iBAAOiB;AACvB,YAAI,KAAK,SAAS,IAAI;AAAG,iBAAO,KAAK,SAAS,EAAE;AAGhD,YAAIM,OAAM;AACR,gBAAM,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,iBAAiB,EAAE;AACpD,gBAAM,EAAE,IAAI,IAAAE,IAAE,IAAK,cAAcN,SAAOF,IAAG,IAAI,EAAE;AACjD,iBAAO,WAAWM,MAAK,MAAM,IAAIE,KAAI,OAAO,KAAK;QACnD,OAAO;AACL,iBAAO,KAAK,OAAOR,IAAG,EAAE;QAC1B;MACF;;;;;MAMA,SAAS,WAAa;AACpB,eAAO,aAAa,MAAM,SAAS;MACrC;;;;;MAMA,gBAAa;AACX,cAAM,EAAE,cAAa,IAAK;AAC1B,YAAI,aAAajB;AAAK,iBAAO;AAC7B,YAAI;AAAe,iBAAO,cAAcmB,SAAO,IAAI;AACnD,eAAO,KAAK,OAAO,MAAM,WAAW,EAAE,IAAG;MAC3C;MAEA,gBAAa;AACX,cAAM,EAAE,cAAa,IAAK;AAC1B,YAAI,aAAanB;AAAK,iBAAO;AAC7B,YAAI;AAAe,iBAAO,cAAcmB,SAAO,IAAI;AACnD,eAAO,KAAK,eAAe,QAAQ;MACrC;MAEA,eAAY;AAEV,eAAO,KAAK,eAAe,QAAQ,EAAE,IAAG;MAC1C;MAEA,QAAQ,eAAe,MAAI;AACzB,cAAM,cAAc,cAAc;AAClC,aAAK,eAAc;AACnB,eAAO,YAAYA,SAAO,MAAM,YAAY;MAC9C;MAEA,MAAM,eAAe,MAAI;AACvB,eAAOO,YAAW,KAAK,QAAQ,YAAY,CAAC;MAC9C;MAEA,WAAQ;AACN,eAAO,UAAU,KAAK,IAAG,IAAK,SAAS,KAAK,MAAK,CAAE;MACrD;;AAnSA;kBAFIP,SAEY,QAAO,IAAIA,QAAM,MAAM,IAAI,MAAM,IAAI,GAAG,GAAG;AAE3D;kBAJIA,SAIY,QAAO,IAAIA,QAAM,GAAG,MAAM,GAAG,KAAK,GAAG,IAAI;AAEzD;;kBANIA,SAMY,MAAK;AAErB;kBARIA,SAQY,MAAKV;AARvB,QAAMO,SAANG;AAuSA,UAAM,OAAOV,IAAG;AAChB,UAAM,OAAO,IAAIkB,MAAKX,QAAO,UAAU,OAAO,KAAK,KAAK,OAAO,CAAC,IAAI,IAAI;AACxE,IAAAA,OAAM,KAAK,WAAW,CAAC;AACvB,WAAOA;EACT;AAqBA,WAAS,QAAQ,UAAiB;AAChC,WAAO,WAAW,GAAG,WAAW,IAAO,CAAI;EAC7C;AAuIA,WAAS,YAAe,IAAeY,KAAkB;AACvD,WAAO;MACL,WAAWA,IAAG;MACd,WAAW,IAAI,GAAG;MAClB,uBAAuB,IAAI,IAAI,GAAG;MAClC,oBAAoB;MACpB,WAAW,IAAIA,IAAG;;EAEtB;AAMM,WAAU,KACdC,QACA,WAAmE,CAAA,GAAE;AAErE,UAAM,EAAE,IAAAD,IAAE,IAAKC;AACf,UAAM,eAAe,SAAS,eAAeC;AAC7C,UAAM,UAAU,OAAO,OAAO,YAAYD,OAAM,IAAID,GAAE,GAAG,EAAE,MAAM,iBAAiBA,IAAG,KAAK,EAAC,CAAE;AAE7F,aAAS,iBAAiB,WAAqB;AAC7C,UAAI;AACF,cAAM,MAAMA,IAAG,UAAU,SAAS;AAClC,eAAOA,IAAG,YAAY,GAAG;MAC3B,SAAS,OAAO;AACd,eAAO;MACT;IACF;AAEA,aAAS,iBAAiB,WAAuB,cAAsB;AACrE,YAAM,EAAE,WAAW,MAAM,sBAAqB,IAAK;AACnD,UAAI;AACF,cAAMG,KAAI,UAAU;AACpB,YAAI,iBAAiB,QAAQA,OAAM;AAAM,iBAAO;AAChD,YAAI,iBAAiB,SAASA,OAAM;AAAuB,iBAAO;AAClE,eAAO,CAAC,CAACF,OAAM,UAAU,SAAS;MACpC,SAAS,OAAO;AACd,eAAO;MACT;IACF;AAMA,aAAS,gBAAgB,OAAO,aAAa,QAAQ,IAAI,GAAC;AACxD,aAAO,eAAeG,QAAO,MAAM,QAAQ,MAAM,MAAM,GAAGJ,IAAG,KAAK;IACpE;AAOA,aAASK,cAAa,WAAuB,eAAe,MAAI;AAC9D,aAAOJ,OAAM,KAAK,SAASD,IAAG,UAAU,SAAS,CAAC,EAAE,QAAQ,YAAY;IAC1E;AAKA,aAAS,UAAU,MAAgB;AACjC,YAAM,EAAE,WAAW,WAAW,sBAAqB,IAAK;AACxD,UAAI,CAACM,SAAQ,IAAI;AAAG,eAAO;AAC3B,UAAK,cAAcN,OAAMA,IAAG,YAAa,cAAc;AAAW,eAAO;AACzE,YAAMG,KAAIC,QAAO,MAAM,QAAW,KAAK,EAAE;AACzC,aAAOD,OAAM,aAAaA,OAAM;IAClC;AAUA,aAAS,gBACP,YACA,YACA,eAAe,MAAI;AAEnB,UAAI,UAAU,UAAU,MAAM;AAAM,cAAM,IAAI,MAAM,+BAA+B;AACnF,UAAI,UAAU,UAAU,MAAM;AAAO,cAAM,IAAI,MAAM,+BAA+B;AACpF,YAAMI,KAAIP,IAAG,UAAU,UAAU;AACjC,YAAMQ,KAAIP,OAAM,UAAU,UAAU;AACpC,aAAOO,GAAE,SAASD,EAAC,EAAE,QAAQ,YAAY;IAC3C;AAEA,UAAME,SAAQ;MACZ;MACA;MACA;;AAEF,UAAM,SAAS,aAAa,iBAAiBJ,aAAY;AAEzD,WAAO,OAAO,OAAO,EAAE,cAAAA,eAAc,iBAAiB,QAAQ,OAAAJ,QAAO,OAAAQ,QAAO,QAAO,CAAE;EACvF;AAiBM,WAAU,MACdR,QACA,MACA,YAAuB,CAAA,GAAE;AAEzB,IAAAS,OAAM,IAAI;AACV,mBACE,WACA,CAAA,GACA;MACE,MAAM;MACN,MAAM;MACN,aAAa;MACb,UAAU;MACV,eAAe;KAChB;AAEH,gBAAY,OAAO,OAAO,CAAA,GAAI,SAAS;AACvC,UAAMR,eAAc,UAAU,eAAeA;AAC7C,UAAMS,QAAO,UAAU,SAAS,CAAC,KAAK,QAAQA,MAAU,MAAM,KAAK,GAAG;AAEtE,UAAM,EAAE,IAAI,IAAAX,IAAE,IAAKC;AACnB,UAAM,EAAE,OAAO,aAAa,MAAM,OAAM,IAAKD;AAC7C,UAAM,EAAE,QAAQ,cAAAK,eAAc,iBAAiB,OAAAI,QAAO,QAAO,IAAK,KAAKR,QAAO,SAAS;AACvF,UAAM,iBAA0C;MAC9C,SAAS;MACT,MAAM,OAAO,UAAU,SAAS,YAAY,UAAU,OAAO;MAC7D,QAAQ;MACR,cAAc;;AAEhB,UAAM,mBAAmB,cAAcW,OAAM,GAAG;AAEhD,aAAS,sBAAsB,QAAc;AAC3C,YAAM,OAAO,eAAeC;AAC5B,aAAO,SAAS;IAClB;AACA,aAAS,WAAW,OAAe,KAAW;AAC5C,UAAI,CAACb,IAAG,YAAY,GAAG;AACrB,cAAM,IAAI,MAAM,qBAAqB,KAAK,kCAAkC;AAC9E,aAAO;IACT;AACA,aAAS,sBAAmB;AAS1B,UAAI;AACF,cAAM,IAAI,MAAM,8DAA8D;IAClF;AACA,aAAS,kBAAkB,OAAmB,QAA4B;AACxE,wBAAkB,MAAM;AACxB,YAAM,OAAO,QAAQ;AACrB,YAAM,QAAQ,WAAW,YAAY,OAAO,WAAW,cAAc,OAAO,IAAI;AAChF,aAAOI,QAAO,OAAO,KAAK;IAC5B;IAKA,MAAMU,WAAS;MAKb,YAAYC,IAAWR,IAAW,UAAiB;AAJ1C;AACA;AACA;AAGP,aAAK,IAAI,WAAW,KAAKQ,EAAC;AAC1B,aAAK,IAAI,WAAW,KAAKR,EAAC;AAC1B,YAAI,YAAY,MAAM;AACpB,8BAAmB;AACnB,cAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAAS,QAAQ;AAAG,kBAAM,IAAI,MAAM,qBAAqB;AAC3E,eAAK,WAAW;QAClB;AACA,eAAO,OAAO,IAAI;MACpB;MAEA,OAAO,UACL,OACA,SAA+B,eAAe,QAAM;AAEpD,0BAAkB,OAAO,MAAM;AAC/B,YAAI;AACJ,YAAI,WAAW,OAAO;AACpB,gBAAM,EAAE,GAAAQ,IAAG,GAAAR,GAAC,IAAK,IAAI,MAAMH,QAAO,KAAK,CAAC;AACxC,iBAAO,IAAIU,WAAUC,IAAGR,EAAC;QAC3B;AACA,YAAI,WAAW,aAAa;AAC1B,kBAAQ,MAAM,CAAC;AACf,mBAAS;AACT,kBAAQ,MAAM,SAAS,CAAC;QAC1B;AACA,cAAMS,KAAI,QAAQ,YAAa;AAC/B,cAAMD,KAAI,MAAM,SAAS,GAAGC,EAAC;AAC7B,cAAMT,KAAI,MAAM,SAASS,IAAGA,KAAI,CAAC;AACjC,eAAO,IAAIF,WAAUd,IAAG,UAAUe,EAAC,GAAGf,IAAG,UAAUO,EAAC,GAAG,KAAK;MAC9D;MAEA,OAAO,QAAQ,KAAa,QAA6B;AACvD,eAAO,KAAK,UAAUU,YAAW,GAAG,GAAG,MAAM;MAC/C;MAEQ,iBAAc;AACpB,cAAM,EAAE,SAAQ,IAAK;AACrB,YAAI,YAAY;AAAM,gBAAM,IAAI,MAAM,sCAAsC;AAC5E,eAAO;MACT;MAEA,eAAe,UAAgB;AAC7B,eAAO,IAAIH,WAAU,KAAK,GAAG,KAAK,GAAG,QAAQ;MAC/C;MAEA,iBAAiB,aAAuB;AACtC,cAAM,EAAE,GAAAC,IAAG,GAAAR,GAAC,IAAK;AACjB,cAAM,WAAW,KAAK,eAAc;AACpC,cAAM,OAAO,aAAa,KAAK,aAAa,IAAIQ,KAAI,cAAcA;AAClE,YAAI,CAAC,GAAG,QAAQ,IAAI;AAAG,gBAAM,IAAI,MAAM,2CAA2C;AAClF,cAAMG,KAAI,GAAG,QAAQ,IAAI;AACzB,cAAMC,KAAIlB,OAAM,UAAUmB,aAAY,SAAS,WAAW,OAAO,CAAC,GAAGF,EAAC,CAAC;AACvE,cAAM,KAAKlB,IAAG,IAAI,IAAI;AACtB,cAAMqB,KAAIC,eAAclB,QAAO,aAAa,QAAW,SAAS,CAAC;AACjE,cAAM,KAAKJ,IAAG,OAAO,CAACqB,KAAI,EAAE;AAC5B,cAAM,KAAKrB,IAAG,OAAOO,KAAI,EAAE;AAE3B,cAAMgB,KAAItB,OAAM,KAAK,eAAe,EAAE,EAAE,IAAIkB,GAAE,eAAe,EAAE,CAAC;AAChE,YAAII,GAAE,IAAG;AAAI,gBAAM,IAAI,MAAM,qCAAqC;AAClE,QAAAA,GAAE,eAAc;AAChB,eAAOA;MACT;;MAGA,WAAQ;AACN,eAAO,sBAAsB,KAAK,CAAC;MACrC;MAEA,QAAQ,SAA+B,eAAe,QAAM;AAC1D,0BAAkB,MAAM;AACxB,YAAI,WAAW;AAAO,iBAAON,YAAW,IAAI,WAAW,IAAI,CAAC;AAC5D,cAAM,EAAE,GAAAF,IAAG,GAAAR,GAAC,IAAK;AACjB,cAAM,KAAKP,IAAG,QAAQe,EAAC;AACvB,cAAM,KAAKf,IAAG,QAAQO,EAAC;AACvB,YAAI,WAAW,aAAa;AAC1B,8BAAmB;AACnB,iBAAOa,aAAY,WAAW,GAAG,KAAK,eAAc,CAAE,GAAG,IAAI,EAAE;QACjE;AACA,eAAOA,aAAY,IAAI,EAAE;MAC3B;MAEA,MAAM,QAA6B;AACjC,eAAOI,YAAW,KAAK,QAAQ,MAAM,CAAC;MACxC;;AAQF,UAAMC,YACJ,UAAU,YACV,SAAS,aAAa,OAAiB;AAErC,UAAI,MAAM,SAAS;AAAM,cAAM,IAAI,MAAM,oBAAoB;AAG7D,YAAM,MAAM,gBAAgB,KAAK;AACjC,YAAM,QAAQ,MAAM,SAAS,IAAI;AACjC,aAAO,QAAQ,IAAI,OAAO,OAAO,KAAK,IAAI;IAC5C;AACF,UAAMH,iBACJ,UAAU,iBACV,SAAS,kBAAkB,OAAiB;AAC1C,aAAOtB,IAAG,OAAOyB,UAAS,KAAK,CAAC;IAClC;AAEF,UAAM,aAAa,QAAQ,MAAM;AAEjC,aAAS,WAAW,KAAW;AAE7B,eAAS,aAAa,QAAQ,KAAKC,MAAK,UAAU;AAClD,aAAO1B,IAAG,QAAQ,GAAG;IACvB;AAEA,aAAS,mBAAmB,SAAqB,SAAgB;AAC/D,MAAAI,QAAO,SAAS,QAAW,SAAS;AACpC,aAAO,UAAUA,QAAO,KAAK,OAAO,GAAG,QAAW,mBAAmB,IAAI;IAC3E;AAUA,aAASuB,SAAQ,SAAqB,WAAuB,MAAmB;AAC9E,YAAM,EAAE,MAAM,SAAS,aAAY,IAAK,gBAAgB,MAAM,cAAc;AAC5E,gBAAU,mBAAmB,SAAS,OAAO;AAI7C,YAAM,QAAQL,eAAc,OAAO;AACnC,YAAMM,KAAI5B,IAAG,UAAU,SAAS;AAChC,UAAI,CAACA,IAAG,YAAY4B,EAAC;AAAG,cAAM,IAAI,MAAM,qBAAqB;AAC7D,YAAM,WAAW,CAAC,WAAWA,EAAC,GAAG,WAAW,KAAK,CAAC;AAElD,UAAI,gBAAgB,QAAQ,iBAAiB,OAAO;AAGlD,cAAMC,KAAI,iBAAiB,OAAO3B,aAAY,QAAQ,SAAS,IAAI;AACnE,iBAAS,KAAKE,QAAOyB,IAAG,QAAW,cAAc,CAAC;MACpD;AACA,YAAM,OAAOT,aAAY,GAAG,QAAQ;AACpC,YAAMU,KAAI;AASV,eAAS,MAAM,QAAkB;AAG/B,cAAMC,KAAIN,UAAS,MAAM;AACzB,YAAI,CAACzB,IAAG,YAAY+B,EAAC;AAAG;AACxB,cAAM,KAAK/B,IAAG,IAAI+B,EAAC;AACnB,cAAMC,KAAI/B,OAAM,KAAK,SAAS8B,EAAC,EAAE,SAAQ;AACzC,cAAMhB,KAAIf,IAAG,OAAOgC,GAAE,CAAC;AACvB,YAAIjB,OAAMW;AAAK;AACf,cAAMnB,KAAIP,IAAG,OAAO,KAAKA,IAAG,OAAO8B,KAAIf,KAAIa,EAAC,CAAC;AAC7C,YAAIrB,OAAMmB;AAAK;AACf,YAAI,YAAYM,GAAE,MAAMjB,KAAI,IAAI,KAAK,OAAOiB,GAAE,IAAInB,IAAG;AACrD,YAAI,QAAQN;AACZ,YAAI,QAAQ,sBAAsBA,EAAC,GAAG;AACpC,kBAAQP,IAAG,IAAIO,EAAC;AAChB,sBAAY;QACd;AACA,eAAO,IAAIO,WAAUC,IAAG,OAAO,mBAAmB,SAAY,QAAQ;MACxE;AACA,aAAO,EAAE,MAAM,MAAK;IACtB;AAaA,aAASkB,MAAK,SAAqB,WAAuB,OAAsB,CAAA,GAAE;AAChF,YAAM,EAAE,MAAM,MAAK,IAAKN,SAAQ,SAAS,WAAW,IAAI;AACxD,YAAM,OAAO,eAA0B,KAAK,WAAW3B,IAAG,OAAOW,KAAI;AACrE,YAAM,MAAM,KAAK,MAAM,KAAK;AAC5B,aAAO,IAAI,QAAQ,KAAK,MAAM;IAChC;AAeA,aAASuB,QACP,WACA,SACA,WACA,OAAwB,CAAA,GAAE;AAE1B,YAAM,EAAE,MAAM,SAAS,OAAM,IAAK,gBAAgB,MAAM,cAAc;AACtE,kBAAY9B,QAAO,WAAW,QAAW,WAAW;AACpD,gBAAU,mBAAmB,SAAS,OAAO;AAC7C,UAAI,CAACE,SAAQ,SAAgB,GAAG;AAC9B,cAAM,MAAM,qBAAqBQ,aAAY,wBAAwB;AACrE,cAAM,IAAI,MAAM,wCAAwC,GAAG;MAC7D;AACA,wBAAkB,WAAW,MAAM;AACnC,UAAI;AACF,cAAM,MAAMA,WAAU,UAAU,WAAW,MAAM;AACjD,cAAMqB,KAAIlC,OAAM,UAAU,SAAS;AACnC,YAAI,QAAQ,IAAI,SAAQ;AAAI,iBAAO;AACnC,cAAM,EAAE,GAAAc,IAAG,GAAAR,GAAC,IAAK;AACjB,cAAMc,KAAIC,eAAc,OAAO;AAC/B,cAAM,KAAKtB,IAAG,IAAIO,EAAC;AACnB,cAAM,KAAKP,IAAG,OAAOqB,KAAI,EAAE;AAC3B,cAAM,KAAKrB,IAAG,OAAOe,KAAI,EAAE;AAC3B,cAAMI,KAAIlB,OAAM,KAAK,eAAe,EAAE,EAAE,IAAIkC,GAAE,eAAe,EAAE,CAAC;AAChE,YAAIhB,GAAE,IAAG;AAAI,iBAAO;AACpB,cAAMiB,KAAIpC,IAAG,OAAOmB,GAAE,CAAC;AACvB,eAAOiB,OAAMrB;MACf,SAASc,IAAG;AACV,eAAO;MACT;IACF;AAEA,aAASQ,kBACP,WACA,SACA,OAAyB,CAAA,GAAE;AAE3B,YAAM,EAAE,QAAO,IAAK,gBAAgB,MAAM,cAAc;AACxD,gBAAU,mBAAmB,SAAS,OAAO;AAC7C,aAAOvB,WAAU,UAAU,WAAW,WAAW,EAAE,iBAAiB,OAAO,EAAE,QAAO;IACtF;AAEA,WAAO,OAAO,OAAO;MACnB;MACA,cAAAT;MACA;MACA,OAAAI;MACA;MACA,OAAAR;MACA,MAAAgC;MACA,QAAAC;MACA,kBAAAG;MACA,WAAAvB;MACA;KACD;EACH;;;AP7/CA,MAAMwB,mBAA2C;IAC/C,GAAG,OAAO,oEAAoE;IAC9E,GAAG,OAAO,oEAAoE;IAC9E,GAAG,OAAO,CAAC;IACX,GAAG,OAAO,CAAC;IACX,GAAG,OAAO,CAAC;IACX,IAAI,OAAO,oEAAoE;IAC/E,IAAI,OAAO,oEAAoE;;AAGjF,MAAM,iBAAmC;IACvC,MAAM,OAAO,oEAAoE;IACjF,SAAS;MACP,CAAC,OAAO,oCAAoC,GAAG,CAAC,OAAO,oCAAoC,CAAC;MAC5F,CAAC,OAAO,qCAAqC,GAAG,OAAO,oCAAoC,CAAC;;;AAKhG,MAAMC,OAAsB,uBAAO,CAAC;AAMpC,WAAS,QAAQC,IAAS;AACxB,UAAMC,KAAIC,iBAAgB;AAE1B,UAAMC,OAAM,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAE3E,UAAM,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAC5D,UAAM,KAAMH,KAAIA,KAAIA,KAAKC;AACzB,UAAM,KAAM,KAAK,KAAKD,KAAKC;AAC3B,UAAM,KAAM,KAAK,IAAIE,MAAKF,EAAC,IAAI,KAAMA;AACrC,UAAM,KAAM,KAAK,IAAIE,MAAKF,EAAC,IAAI,KAAMA;AACrC,UAAM,MAAO,KAAK,IAAIF,MAAKE,EAAC,IAAI,KAAMA;AACtC,UAAM,MAAO,KAAK,KAAK,MAAMA,EAAC,IAAI,MAAOA;AACzC,UAAM,MAAO,KAAK,KAAK,MAAMA,EAAC,IAAI,MAAOA;AACzC,UAAM,MAAO,KAAK,KAAK,MAAMA,EAAC,IAAI,MAAOA;AACzC,UAAM,OAAQ,KAAK,KAAK,MAAMA,EAAC,IAAI,MAAOA;AAC1C,UAAM,OAAQ,KAAK,MAAM,MAAMA,EAAC,IAAI,MAAOA;AAC3C,UAAM,OAAQ,KAAK,MAAME,MAAKF,EAAC,IAAI,KAAMA;AACzC,UAAM,KAAM,KAAK,MAAM,MAAMA,EAAC,IAAI,MAAOA;AACzC,UAAM,KAAM,KAAK,IAAI,KAAKA,EAAC,IAAI,KAAMA;AACrC,UAAM,OAAO,KAAK,IAAIF,MAAKE,EAAC;AAC5B,QAAI,CAAC,KAAK,IAAI,KAAK,IAAI,IAAI,GAAGD,EAAC;AAAG,YAAM,IAAI,MAAM,yBAAyB;AAC3E,WAAO;EACT;AAEA,MAAM,OAAO,MAAME,iBAAgB,GAAG,EAAE,MAAM,QAAO,CAAE;AACvD,MAAM,UAA0B,4BAAYA,kBAAiB;IAC3D,IAAI;IACJ,MAAM;GACP;AAmBM,MAAM,YAAmC,sBAAM,SAASE,OAAM;;;ASpGrE;;;ACAA;AAMM,WAAUC,SAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAUC,SAAQC,IAAW,QAAgB,IAAE;AACnD,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,GAAG;AACrC,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,GAAG,MAAM,8BAA8BA,EAAC,EAAE;IAC5D;EACF;AAGM,WAAUC,QAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,UAAM,QAAQJ,SAAQ,KAAK;AAC3B,UAAM,MAAM,OAAO;AACnB,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,YAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,YAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;IACzE;AACA,WAAO;EACT;AAGM,WAAUK,OAAMC,IAAQ;AAC5B,QAAI,OAAOA,OAAM,cAAc,OAAOA,GAAE,WAAW;AACjD,YAAM,IAAI,MAAM,yCAAyC;AAC3D,IAAAJ,SAAQI,GAAE,SAAS;AACnB,IAAAJ,SAAQI,GAAE,QAAQ;EACpB;AAGM,WAAUC,SAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAUC,SAAQ,KAAU,UAAa;AAC7C,IAAAJ,QAAO,KAAK,QAAW,qBAAqB;AAC5C,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,sDAAsD,GAAG;IAC3E;EACF;AAkBM,WAAUK,UAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAUC,YAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAUC,MAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAGM,WAAU,KAAK,MAAc,OAAa;AAC9C,WAAQ,QAAQ,QAAW,SAAU,KAAK,UAAY;EACxD;AA6IM,WAAUC,gBAAe,QAAoB;AACjD,QAAI,MAAM;AACV,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,YAAMC,KAAI,OAAOD,EAAC;AAClB,MAAAE,QAAOD,EAAC;AACR,aAAOA,GAAE;IACX;AACA,UAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,aAASD,KAAI,GAAG,MAAM,GAAGA,KAAI,OAAO,QAAQA,MAAK;AAC/C,YAAMC,KAAI,OAAOD,EAAC;AAClB,UAAI,IAAIC,IAAG,GAAG;AACd,aAAOA,GAAE;IACX;AACA,WAAO;EACT;AAoEM,WAAUE,cACd,UACA,OAAiB,CAAA,GAAE;AAEnB,UAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,UAAM,MAAM,SAAS,MAAS;AAC9B,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,WAAO,OAAO,OAAO,IAAI;AACzB,WAAO,OAAO,OAAO,KAAK;EAC5B;AAWO,MAAMC,WAAU,CAAC,YAAwC;IAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;ADzUrF,MAAOC,SAAP,MAAY;IAQhB,YAAY,MAAa,KAAe;AAPxC;AACA;AACA;AACA;AACQ,sCAAW;AACX,uCAAY;AAGlB,MAAAC,OAAM,IAAI;AACV,MAAAC,QAAO,KAAK,QAAW,KAAK;AAC5B,WAAK,QAAQ,KAAK,OAAM;AACxB,UAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,cAAM,IAAI,MAAM,qDAAqD;AACvE,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,YAAY,KAAK,MAAM;AAC5B,YAAM,WAAW,KAAK;AACtB,YAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,UAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,eAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK;AAC/C,WAAK,MAAM,OAAO,GAAG;AAErB,WAAK,QAAQ,KAAK,OAAM;AAExB,eAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK,KAAO;AACtD,WAAK,MAAM,OAAO,GAAG;AACrB,MAAAC,OAAM,GAAG;IACX;IACA,OAAO,KAAe;AACpB,MAAAC,SAAQ,IAAI;AACZ,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAA,SAAQ,IAAI;AACZ,MAAAH,QAAO,KAAK,KAAK,WAAW,QAAQ;AACpC,WAAK,WAAW;AAChB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,QAAO;IACd;IACA,SAAM;AACJ,YAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,WAAK,WAAW,GAAG;AACnB,aAAO;IACT;IACA,WAAW,IAAa;AAEtB,kBAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,YAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,WAAK;AACL,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;IACA,UAAO;AACL,WAAK,YAAY;AACjB,WAAK,MAAM,QAAO;AAClB,WAAK,MAAM,QAAO;IACpB;;AAaK,MAAMI,QAGT,CAAC,MAAa,KAAiB,YACjC,IAAIN,OAAW,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AAClD,EAAAM,MAAK,SAAS,CAAC,MAAa,QAAoB,IAAIN,OAAW,MAAM,GAAG;;;AE7FxE;;;ACAA;AAOM,WAAUO,KAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAUC,KAAIH,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAMM,MAAgBE,UAAhB,MAAsB;IAoB1B,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,sCAAW;AACX,oCAAS;AACT,iCAAM;AACN,uCAAY;AAGpB,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,OAAOA;AACZ,WAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,WAAK,OAAOC,YAAW,KAAK,MAAM;IACpC;IACA,OAAO,MAAgB;AACrB,MAAAC,SAAQ,IAAI;AACZ,MAAAC,QAAO,IAAI;AACX,YAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,YAAM,MAAM,KAAK;AACjB,eAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,cAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,YAAI,SAAS,UAAU;AACrB,gBAAM,WAAWF,YAAW,IAAI;AAChC,iBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,iBAAK,QAAQ,UAAU,GAAG;AACzE;QACF;AACA,eAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,aAAK,OAAO;AACZ,eAAO;AACP,YAAI,KAAK,QAAQ,UAAU;AACzB,eAAK,QAAQ,MAAM,CAAC;AACpB,eAAK,MAAM;QACb;MACF;AACA,WAAK,UAAU,KAAK;AACpB,WAAK,WAAU;AACf,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAC,SAAQ,IAAI;AACZ,MAAAE,SAAQ,KAAK,IAAI;AACjB,WAAK,WAAW;AAIhB,YAAM,EAAE,QAAQ,MAAM,UAAU,MAAAJ,MAAI,IAAK;AACzC,UAAI,EAAE,IAAG,IAAK;AAEd,aAAO,KAAK,IAAI;AAChB,MAAAK,OAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,UAAI,KAAK,YAAY,WAAW,KAAK;AACnC,aAAK,QAAQ,MAAM,CAAC;AACpB,cAAM;MACR;AAEA,eAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,eAAOA,EAAC,IAAI;AAIjD,WAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGN,KAAI;AAC7D,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM,QAAQC,YAAW,GAAG;AAC5B,YAAM,MAAM,KAAK;AAEjB,UAAI,MAAM;AAAG,cAAM,IAAI,MAAM,2CAA2C;AACxE,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,IAAG;AACtB,UAAI,SAAS,MAAM;AAAQ,cAAM,IAAI,MAAM,oCAAoC;AAC/E,eAASK,KAAI,GAAGA,KAAI,QAAQA;AAAK,cAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGN,KAAI;IACxE;IACA,SAAM;AACJ,YAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,WAAK,WAAW,MAAM;AACtB,YAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,WAAK,QAAO;AACZ,aAAO;IACT;IACA,WAAW,IAAM;AACf,kBAAO,IAAK,KAAK,YAAmB;AACpC,SAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,YAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,SAAS;AACZ,SAAG,MAAM;AACT,UAAI,SAAS;AAAU,WAAG,OAAO,IAAI,MAAM;AAC3C,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;;AASK,MAAMO,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAcM,MAAMC,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;;;ADyBD,MAAM,SAAyB,2BAAW,KAAK;IAC7C;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;GACpD;AACD,MAAM,QAAyB,uBAAM,WAAW,KAAK,IAAI,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAGC,OAAMA,EAAC,CAAC,GAAE;AAC7F,MAAM,QAAyB,uBAAM,MAAM,IAAI,CAACA,QAAO,IAAIA,KAAI,KAAK,EAAE,GAAE;AACxE,MAAM,QAAyB,uBAAK;AAClC,UAAMC,KAAI,CAAC,KAAK;AAChB,UAAMC,KAAI,CAAC,KAAK;AAChB,UAAM,MAAM,CAACD,IAAGC,EAAC;AACjB,aAASF,KAAI,GAAGA,KAAI,GAAGA;AAAK,eAASG,MAAK;AAAK,QAAAA,GAAE,KAAKA,GAAEH,EAAC,EAAE,IAAI,CAACI,OAAM,OAAOA,EAAC,CAAC,CAAC;AAChF,WAAO;EACT,GAAE;AACF,MAAM,OAAwB,uBAAM,MAAM,CAAC,GAAE;AAC7C,MAAM,OAAwB,uBAAM,MAAM,CAAC,GAAE;AAG7C,MAAM,YAA4B;IAChC,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,IAAI,CAACJ,OAAM,WAAW,KAAKA,EAAC,CAAC;AAC/B,MAAM,aAA6B,qBAAK,IAAI,CAAC,KAAKA,OAAM,IAAI,IAAI,CAACG,OAAM,UAAUH,EAAC,EAAEG,EAAC,CAAC,CAAC;AACvF,MAAM,aAA6B,qBAAK,IAAI,CAAC,KAAKH,OAAM,IAAI,IAAI,CAACG,OAAM,UAAUH,EAAC,EAAEG,EAAC,CAAC,CAAC;AACvF,MAAM,QAAwB,4BAAY,KAAK;IAC7C;IAAY;IAAY;IAAY;IAAY;GACjD;AACD,MAAM,QAAwB,4BAAY,KAAK;IAC7C;IAAY;IAAY;IAAY;IAAY;GACjD;AAED,WAAS,SAAS,OAAeE,IAAWC,IAAW,GAAS;AAC9D,QAAI,UAAU;AAAG,aAAOD,KAAIC,KAAI;AAChC,QAAI,UAAU;AAAG,aAAQD,KAAIC,KAAM,CAACD,KAAI;AACxC,QAAI,UAAU;AAAG,cAAQA,KAAI,CAACC,MAAK;AACnC,QAAI,UAAU;AAAG,aAAQD,KAAI,IAAMC,KAAI,CAAC;AACxC,WAAOD,MAAKC,KAAI,CAAC;EACnB;AAEA,MAAM,UAA0B,oBAAI,YAAY,EAAE;AAC5C,MAAO,aAAP,cAA0BC,QAAkB;IAOhD,cAAA;AACE,YAAM,IAAI,IAAI,GAAG,IAAI;AAPf,gCAAK,aAAa;AAClB,gCAAK,aAAa;AAClB,gCAAK,aAAa;AAClB,gCAAK,YAAa;AAClB,gCAAK,aAAa;IAI1B;IACU,MAAG;AACX,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC/B,aAAO,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE;IAC5B;IACU,IAAI,IAAY,IAAY,IAAY,IAAY,IAAU;AACtE,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;IACjB;IACU,QAAQ,MAAgB,QAAc;AAC9C,eAASP,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,gBAAQA,EAAC,IAAI,KAAK,UAAU,QAAQ,IAAI;AAElF,UAAI,KAAK,KAAK,KAAK,GAAG,KAAK,IACvB,KAAK,KAAK,KAAK,GAAG,KAAK,IACvB,KAAK,KAAK,KAAK,GAAGQ,MAAK,IACvB,KAAK,KAAK,KAAK,GAAG,KAAK,IACvB,KAAK,KAAK,KAAK,GAAG,KAAK;AAI3B,eAAS,QAAQ,GAAG,QAAQ,GAAG,SAAS;AACtC,cAAM,SAAS,IAAI;AACnB,cAAM,MAAM,MAAM,KAAK,GAAG,MAAM,MAAM,KAAK;AAC3C,cAAM,KAAK,KAAK,KAAK,GAAG,KAAK,KAAK,KAAK;AACvC,cAAM,KAAK,WAAW,KAAK,GAAG,KAAK,WAAW,KAAK;AACnD,iBAASR,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,gBAAM,KAAM,KAAK,KAAK,SAAS,OAAO,IAAI,IAAI,EAAE,IAAI,QAAQ,GAAGA,EAAC,CAAC,IAAI,KAAK,GAAGA,EAAC,CAAC,IAAI,KAAM;AACzF,eAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,EAAE,IAAI,GAAG,KAAK,IAAI,KAAK;QACzD;AAEA,iBAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,gBAAM,KAAM,KAAK,KAAK,SAAS,QAAQ,IAAIQ,KAAI,EAAE,IAAI,QAAQ,GAAGR,EAAC,CAAC,IAAI,KAAK,GAAGA,EAAC,CAAC,IAAI,KAAM;AAC1F,eAAK,IAAI,KAAK,IAAI,KAAK,KAAKQ,KAAI,EAAE,IAAI,GAAGA,MAAK,IAAI,KAAK;QACzD;MACF;AAEA,WAAK,IACF,KAAK,KAAK,KAAK,KAAM,GACrB,KAAK,KAAK,KAAK,KAAM,GACrB,KAAK,KAAK,KAAK,KAAM,GACrB,KAAK,KAAK,KAAK,KAAM,GACrB,KAAK,KAAK,KAAKA,MAAM,CAAC;IAE3B;IACU,aAAU;AAClB,MAAAC,OAAM,OAAO;IACf;IACA,UAAO;AACL,WAAK,YAAY;AACjB,MAAAA,OAAM,KAAK,MAAM;AACjB,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;IACxB;;AAQK,MAAM,YAAmC,gBAAAC,cAAa,MAAM,IAAI,WAAU,CAAE;;;AEpSnF;;;ACAA;AAKA,MAAMC,cAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,MAAMC,QAAuB,uBAAO,EAAE;AAEtC,WAASC,SACPC,IACA,KAAK,OAAK;AAKV,QAAI;AAAI,aAAO,EAAE,GAAG,OAAOA,KAAIH,WAAU,GAAG,GAAG,OAAQG,MAAKF,QAAQD,WAAU,EAAC;AAC/E,WAAO,EAAE,GAAG,OAAQG,MAAKF,QAAQD,WAAU,IAAI,GAAG,GAAG,OAAOG,KAAIH,WAAU,IAAI,EAAC;EACjF;AAEA,WAASI,OAAM,KAAe,KAAK,OAAK;AACtC,UAAM,MAAM,IAAI;AAChB,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,aAASC,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC5B,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAC,IAAKL,SAAQ,IAAIG,EAAC,GAAG,EAAE;AACnC,OAAC,GAAGA,EAAC,GAAG,GAAGA,EAAC,CAAC,IAAI,CAACC,IAAGC,EAAC;IACxB;AACA,WAAO,CAAC,IAAI,EAAE;EAChB;AAIA,MAAMC,SAAQ,CAACC,IAAW,IAAYC,OAAsBD,OAAMC;AAClE,MAAMC,SAAQ,CAACF,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAMF;AAEpF,MAAMG,UAAS,CAACJ,IAAWG,IAAWF,OAAuBD,OAAMC,KAAME,MAAM,KAAKF;AACpF,MAAMI,UAAS,CAACL,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAMF;AAErF,MAAMK,UAAS,CAACN,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAOF,KAAI;AAC1F,MAAMM,UAAS,CAACP,IAAWG,IAAWF,OAAuBD,OAAOC,KAAI,KAAQE,MAAM,KAAKF;AAa3F,WAASO,KACP,IACA,IACA,IACA,IAAU;AAKV,UAAMC,MAAK,OAAO,MAAM,OAAO;AAC/B,WAAO,EAAE,GAAI,KAAK,MAAOA,KAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,KAAI,EAAC;EAC3D;AAEA,MAAMC,SAAQ,CAAC,IAAY,IAAY,QAAwB,OAAO,MAAM,OAAO,MAAM,OAAO;AAChG,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,OACjD,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAC3C,MAAMC,SAAQ,CAAC,IAAY,IAAY,IAAY,QAChD,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AACjD,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,OAC7D,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAChD,MAAMC,SAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,QAC5D,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC9D,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,OACzE,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;AD3DrD,MAAMC,YAA2B,4BAAY,KAAK;IAChD;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAGD,MAAMC,YAA2B,oBAAI,YAAY,EAAE;AAGnD,MAAeC,YAAf,cAAuDC,QAAS;IAY9D,YAAY,WAAiB;AAC3B,YAAM,IAAI,WAAW,GAAG,KAAK;IAC/B;IACU,MAAG;AACX,YAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,aAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IAChC;;IAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,WAAK,IAAIP,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;IACf;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,QAAAX,UAASW,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,cAAM,MAAMX,UAASW,KAAI,EAAE;AAC3B,cAAMC,MAAKZ,UAASW,KAAI,CAAC;AACzB,cAAM,KAAKE,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,cAAM,KAAKA,MAAKD,KAAI,EAAE,IAAIC,MAAKD,KAAI,EAAE,IAAKA,QAAO;AACjD,QAAAZ,UAASW,EAAC,IAAK,KAAKX,UAASW,KAAI,CAAC,IAAI,KAAKX,UAASW,KAAI,EAAE,IAAK;MACjE;AAEA,UAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,SAASE,MAAKN,IAAG,CAAC,IAAIM,MAAKN,IAAG,EAAE,IAAIM,MAAKN,IAAG,EAAE;AACpD,cAAM,KAAMG,KAAI,SAASI,KAAIP,IAAGC,IAAGC,EAAC,IAAIV,UAASY,EAAC,IAAIX,UAASW,EAAC,IAAK;AACrE,cAAM,SAASE,MAAKV,IAAG,CAAC,IAAIU,MAAKV,IAAG,EAAE,IAAIU,MAAKV,IAAG,EAAE;AACpD,cAAM,KAAM,SAASY,KAAIZ,IAAGC,IAAGC,EAAC,IAAK;AACrC,QAAAK,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAKD,KAAI,KAAM;AACf,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAK,KAAK,KAAM;MAClB;AAEA,MAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,WAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IACjC;IACU,aAAU;AAClB,MAAAM,OAAMhB,SAAQ;IAChB;IACA,UAAO;AACL,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,MAAAgB,OAAM,KAAK,MAAM;IACnB;;AAII,MAAOC,WAAP,cAAuBhB,UAAiB;IAW5C,cAAA;AACE,YAAM,EAAE;AATA;;+BAAYiB,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;IAGrC;;AAuBF,MAAMC,QAAwB,uBAAUC,OAAM;IAC5C;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE,IAAI,CAAAC,OAAK,OAAOA,EAAC,CAAC,CAAC,GAAE;AACvB,MAAMC,aAA6B,uBAAMH,MAAK,CAAC,GAAE;AACjD,MAAMI,aAA6B,uBAAMJ,MAAK,CAAC,GAAE;AAGjD,MAAMK,cAA6B,oBAAI,YAAY,EAAE;AACrD,MAAMC,cAA6B,oBAAI,YAAY,EAAE;AAGrD,MAAeC,YAAf,cAAuDC,QAAS;IAqB9D,YAAY,WAAiB;AAC3B,YAAM,KAAK,WAAW,IAAI,KAAK;IACjC;;IAEU,MAAG;AAIX,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC3E,aAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;IACxE;;IAEU,IACR,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IACpF,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAU;AAE9F,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;IACjB;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU,GAAG;AACxC,QAAAJ,YAAWI,EAAC,IAAI,KAAK,UAAU,MAAM;AACrC,QAAAH,YAAWG,EAAC,IAAI,KAAK,UAAW,UAAU,CAAE;MAC9C;AACA,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAE5B,cAAM,OAAOJ,YAAWI,KAAI,EAAE,IAAI;AAClC,cAAM,OAAOH,YAAWG,KAAI,EAAE,IAAI;AAClC,cAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAC3F,cAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAE3F,cAAM,MAAMR,YAAWI,KAAI,CAAC,IAAI;AAChC,cAAM,MAAMH,YAAWG,KAAI,CAAC,IAAI;AAChC,cAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQI,QAAO,KAAK,KAAK,EAAE,IAAQH,OAAM,KAAK,KAAK,CAAC;AACvF,cAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQG,QAAO,KAAK,KAAK,EAAE,IAAQF,OAAM,KAAK,KAAK,CAAC;AAEvF,cAAM,OAAWG,OAAM,KAAK,KAAKV,YAAWG,KAAI,CAAC,GAAGH,YAAWG,KAAI,EAAE,CAAC;AACtE,cAAM,OAAWQ,OAAM,MAAM,KAAK,KAAKZ,YAAWI,KAAI,CAAC,GAAGJ,YAAWI,KAAI,EAAE,CAAC;AAC5E,QAAAJ,YAAWI,EAAC,IAAI,OAAO;AACvB,QAAAH,YAAWG,EAAC,IAAI,OAAO;MACzB;AACA,UAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAEzE,eAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAE3B,cAAM,UAAcC,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE;AAEvF,cAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,cAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,cAAM,OAAWG,OAAM,IAAI,SAAS,MAAMd,WAAUK,EAAC,GAAGH,YAAWG,EAAC,CAAC;AACrE,cAAM,MAAUU,OAAM,MAAM,IAAI,SAAS,MAAMhB,WAAUM,EAAC,GAAGJ,YAAWI,EAAC,CAAC;AAC1E,cAAM,MAAM,OAAO;AAEnB,cAAM,UAAcC,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,cAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,SAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASK,KAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,cAAM,MAAUC,OAAM,KAAK,SAAS,IAAI;AACxC,aAASC,OAAM,KAAK,KAAK,SAAS,IAAI;AACtC,aAAK,MAAM;MACb;AAEA,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASF,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;IACzE;IACU,aAAU;AAClB,MAAAG,OAAMlB,aAAYC,WAAU;IAC9B;IACA,UAAO;AACL,MAAAiB,OAAM,KAAK,MAAM;AACjB,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACzD;;AAII,MAAOC,WAAP,cAAuBjB,UAAiB;IAkB5C,cAAA;AACE,YAAM,EAAE;AAlBA,gCAAakB,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;IAIvC;;AAsGK,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;AASxB,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;;;AE7b/B;AAYA,WAASC,SAAQC,IAAU;AACzB,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAMA,WAAS,UAAU,UAAmB,KAAU;AAC9C,QAAI,CAAC,MAAM,QAAQ,GAAG;AAAG,aAAO;AAChC,QAAI,IAAI,WAAW;AAAG,aAAO;AAC7B,QAAI,UAAU;AACZ,aAAO,IAAI,MAAM,CAAC,SAAS,OAAO,SAAS,QAAQ;IACrD,OAAO;AACL,aAAO,IAAI,MAAM,CAAC,SAAS,OAAO,cAAc,IAAI,CAAC;IACvD;EACF;AAEA,WAAS,IAAI,OAAe;AAC1B,QAAI,OAAO,UAAU;AAAY,YAAM,IAAI,MAAM,mBAAmB;AACpE,WAAO;EACT;AAEA,WAAS,KAAK,OAAe,OAAc;AACzC,QAAI,OAAO,UAAU;AAAU,YAAM,IAAI,MAAM,GAAG,KAAK,mBAAmB;AAC1E,WAAO;EACT;AAEA,WAASC,SAAQC,IAAS;AACxB,QAAI,CAAC,OAAO,cAAcA,EAAC;AAAG,YAAM,IAAI,MAAM,oBAAoBA,EAAC,EAAE;EACvE;AAEA,WAAS,KAAK,OAAY;AACxB,QAAI,CAAC,MAAM,QAAQ,KAAK;AAAG,YAAM,IAAI,MAAM,gBAAgB;EAC7D;AACA,WAAS,QAAQ,OAAe,OAAe;AAC7C,QAAI,CAAC,UAAU,MAAM,KAAK;AAAG,YAAM,IAAI,MAAM,GAAG,KAAK,6BAA6B;EACpF;AACA,WAAS,QAAQ,OAAe,OAAe;AAC7C,QAAI,CAAC,UAAU,OAAO,KAAK;AAAG,YAAM,IAAI,MAAM,GAAG,KAAK,6BAA6B;EACrF;;AAqBA,WAAS,SAAuC,MAAO;AACrD,UAAM,KAAK,CAACC,OAAWA;AAEvB,UAAM,OAAO,CAACA,IAAQC,OAAW,CAACC,OAAWF,GAAEC,GAAEC,EAAC,CAAC;AAEnD,UAAM,SAAS,KAAK,IAAI,CAACC,OAAMA,GAAE,MAAM,EAAE,YAAY,MAAM,EAAE;AAE7D,UAAM,SAAS,KAAK,IAAI,CAACA,OAAMA,GAAE,MAAM,EAAE,OAAO,MAAM,EAAE;AACxD,WAAO,EAAE,QAAQ,OAAM;EACzB;;AAOA,WAAS,SAAS,SAA0B;AAE1C,UAAM,WAAW,OAAO,YAAY,WAAW,QAAQ,MAAM,EAAE,IAAI;AACnE,UAAM,MAAM,SAAS;AACrB,YAAQ,YAAY,QAAQ;AAG5B,UAAM,UAAU,IAAI,IAAI,SAAS,IAAI,CAACC,IAAGC,OAAM,CAACD,IAAGC,EAAC,CAAC,CAAC;AACtD,WAAO;MACL,QAAQ,CAAC,WAAoB;AAC3B,aAAK,MAAM;AACX,eAAO,OAAO,IAAI,CAACA,OAAK;AACtB,cAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,KAAKA,MAAK;AAC5C,kBAAM,IAAI,MACR,kDAAkDA,EAAC,eAAe,OAAO,EAAE;AAE/E,iBAAO,SAASA,EAAC;QACnB,CAAC;MACH;MACA,QAAQ,CAAC,UAA6B;AACpC,aAAK,KAAK;AACV,eAAO,MAAM,IAAI,CAAC,WAAU;AAC1B,eAAK,mBAAmB,MAAM;AAC9B,gBAAMA,KAAI,QAAQ,IAAI,MAAM;AAC5B,cAAIA,OAAM;AAAW,kBAAM,IAAI,MAAM,oBAAoB,MAAM,eAAe,OAAO,EAAE;AACvF,iBAAOA;QACT,CAAC;MACH;;EAEJ;;AAKA,WAAS,KAAK,YAAY,IAAE;AAC1B,SAAK,QAAQ,SAAS;AACtB,WAAO;MACL,QAAQ,CAAC,SAAQ;AACf,gBAAQ,eAAe,IAAI;AAC3B,eAAO,KAAK,KAAK,SAAS;MAC5B;MACA,QAAQ,CAAC,OAAM;AACb,aAAK,eAAe,EAAE;AACtB,eAAO,GAAG,MAAM,SAAS;MAC3B;;EAEJ;;AAMA,WAAS,QAAQ,MAAc,MAAM,KAAG;AACtC,IAAAP,SAAQ,IAAI;AACZ,SAAK,WAAW,GAAG;AACnB,WAAO;MACL,OAAO,MAAc;AACnB,gBAAQ,kBAAkB,IAAI;AAC9B,eAAQ,KAAK,SAAS,OAAQ;AAAG,eAAK,KAAK,GAAG;AAC9C,eAAO;MACT;MACA,OAAO,OAAe;AACpB,gBAAQ,kBAAkB,KAAK;AAC/B,YAAI,MAAM,MAAM;AAChB,YAAK,MAAM,OAAQ;AACjB,gBAAM,IAAI,MAAM,4DAA4D;AAC9E,eAAO,MAAM,KAAK,MAAM,MAAM,CAAC,MAAM,KAAK,OAAO;AAC/C,gBAAM,OAAO,MAAM;AACnB,gBAAM,OAAO,OAAO;AACpB,cAAI,OAAO,MAAM;AAAG,kBAAM,IAAI,MAAM,+CAA+C;QACrF;AACA,eAAO,MAAM,MAAM,GAAG,GAAG;MAC3B;;EAEJ;AAaA,WAAS,aAAa,MAAgB,MAAc,IAAU;AAE5D,QAAI,OAAO;AAAG,YAAM,IAAI,MAAM,8BAA8B,IAAI,8BAA8B;AAC9F,QAAI,KAAK;AAAG,YAAM,IAAI,MAAM,4BAA4B,EAAE,8BAA8B;AACxF,SAAK,IAAI;AACT,QAAI,CAAC,KAAK;AAAQ,aAAO,CAAA;AACzB,QAAI,MAAM;AACV,UAAM,MAAM,CAAA;AACZ,UAAM,SAAS,MAAM,KAAK,MAAM,CAACQ,OAAK;AACpC,MAAAC,SAAQD,EAAC;AACT,UAAIA,KAAI,KAAKA,MAAK;AAAM,cAAM,IAAI,MAAM,oBAAoBA,EAAC,EAAE;AAC/D,aAAOA;IACT,CAAC;AACD,UAAM,OAAO,OAAO;AACpB,WAAO,MAAM;AACX,UAAI,QAAQ;AACZ,UAAI,OAAO;AACX,eAASE,KAAI,KAAKA,KAAI,MAAMA,MAAK;AAC/B,cAAM,QAAQ,OAAOA,EAAC;AACtB,cAAM,YAAY,OAAO;AACzB,cAAM,YAAY,YAAY;AAC9B,YACE,CAAC,OAAO,cAAc,SAAS,KAC/B,YAAY,SAAS,SACrB,YAAY,UAAU,WACtB;AACA,gBAAM,IAAI,MAAM,8BAA8B;QAChD;AACA,cAAM,MAAM,YAAY;AACxB,gBAAQ,YAAY;AACpB,cAAM,UAAU,KAAK,MAAM,GAAG;AAC9B,eAAOA,EAAC,IAAI;AACZ,YAAI,CAAC,OAAO,cAAc,OAAO,KAAK,UAAU,KAAK,UAAU;AAC7D,gBAAM,IAAI,MAAM,8BAA8B;AAChD,YAAI,CAAC;AAAM;iBACF,CAAC;AAAS,gBAAMA;;AACpB,iBAAO;MACd;AACA,UAAI,KAAK,KAAK;AACd,UAAI;AAAM;IACZ;AACA,aAASA,KAAI,GAAGA,KAAI,KAAK,SAAS,KAAK,KAAKA,EAAC,MAAM,GAAGA;AAAK,UAAI,KAAK,CAAC;AACrE,WAAO,IAAI,QAAO;EACpB;AAEA,MAAM,MAAM,CAACC,IAAWC,OAAuBA,OAAM,IAAID,KAAI,IAAIC,IAAGD,KAAIC,EAAC;AACzE,MAAM,yCAAyC,CAAC,MAAc,OAC5D,QAAQ,KAAK,IAAI,MAAM,EAAE;AAC3B,MAAM,SAAoC,uBAAK;AAC7C,QAAI,MAAM,CAAA;AACV,aAASF,KAAI,GAAGA,KAAI,IAAIA;AAAK,UAAI,KAAK,KAAKA,EAAC;AAC5C,WAAO;EACT,GAAE;AAIF,WAAS,cAAc,MAAgB,MAAc,IAAYG,UAAgB;AAC/E,SAAK,IAAI;AACT,QAAI,QAAQ,KAAK,OAAO;AAAI,YAAM,IAAI,MAAM,6BAA6B,IAAI,EAAE;AAC/E,QAAI,MAAM,KAAK,KAAK;AAAI,YAAM,IAAI,MAAM,2BAA2B,EAAE,EAAE;AACvE,QAAI,4BAAY,MAAM,EAAE,IAAI,IAAI;AAC9B,YAAM,IAAI,MACR,sCAAsC,IAAI,OAAO,EAAE,cAAc,4BAAY,MAAM,EAAE,CAAC,EAAE;IAE5F;AACA,QAAI,QAAQ;AACZ,QAAI,MAAM;AACV,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,OAAO,OAAO,EAAE,IAAK;AAC3B,UAAM,MAAgB,CAAA;AACtB,eAAWC,MAAK,MAAM;AACpB,MAAAL,SAAQK,EAAC;AACT,UAAIA,MAAK;AAAK,cAAM,IAAI,MAAM,oCAAoCA,EAAC,SAAS,IAAI,EAAE;AAClF,cAAS,SAAS,OAAQA;AAC1B,UAAI,MAAM,OAAO;AAAI,cAAM,IAAI,MAAM,qCAAqC,GAAG,SAAS,IAAI,EAAE;AAC5F,aAAO;AACP,aAAO,OAAO,IAAI,OAAO;AAAI,YAAI,MAAO,SAAU,MAAM,KAAO,UAAU,CAAC;AAC1E,YAAM,MAAM,OAAO,GAAG;AACtB,UAAI,QAAQ;AAAW,cAAM,IAAI,MAAM,eAAe;AACtD,eAAS,MAAM;IACjB;AACA,YAAS,SAAU,KAAK,MAAQ;AAChC,QAAI,CAACD,YAAW,OAAO;AAAM,YAAM,IAAI,MAAM,gBAAgB;AAC7D,QAAI,CAACA,YAAW,QAAQ;AAAG,YAAM,IAAI,MAAM,qBAAqB,KAAK,EAAE;AACvE,QAAIA,YAAW,MAAM;AAAG,UAAI,KAAK,UAAU,CAAC;AAC5C,WAAO;EACT;;AAKA,WAAS,MAAM,KAAW;AACxB,IAAAJ,SAAQ,GAAG;AACX,UAAM,OAAO,KAAK;AAClB,WAAO;MACL,QAAQ,CAAC,UAAqB;AAC5B,YAAI,CAACM,SAAQ,KAAK;AAAG,gBAAM,IAAI,MAAM,yCAAyC;AAC9E,eAAO,aAAa,MAAM,KAAK,KAAK,GAAG,MAAM,GAAG;MAClD;MACA,QAAQ,CAAC,WAAoB;AAC3B,gBAAQ,gBAAgB,MAAM;AAC9B,eAAO,WAAW,KAAK,aAAa,QAAQ,KAAK,IAAI,CAAC;MACxD;;EAEJ;;AAOA,WAAS,OAAO,MAAc,aAAa,OAAK;AAC9C,IAAAN,SAAQ,IAAI;AACZ,QAAI,QAAQ,KAAK,OAAO;AAAI,YAAM,IAAI,MAAM,mCAAmC;AAC/E,QAAI,4BAAY,GAAG,IAAI,IAAI,MAAM,4BAAY,MAAM,CAAC,IAAI;AACtD,YAAM,IAAI,MAAM,wBAAwB;AAC1C,WAAO;MACL,QAAQ,CAAC,UAAqB;AAC5B,YAAI,CAACM,SAAQ,KAAK;AAAG,gBAAM,IAAI,MAAM,0CAA0C;AAC/E,eAAO,cAAc,MAAM,KAAK,KAAK,GAAG,GAAG,MAAM,CAAC,UAAU;MAC9D;MACA,QAAQ,CAAC,WAAoB;AAC3B,gBAAQ,iBAAiB,MAAM;AAC/B,eAAO,WAAW,KAAK,cAAc,QAAQ,MAAM,GAAG,UAAU,CAAC;MACnE;;EAEJ;AAYA,WAAS,SACP,KACA,IAAoC;AAEpC,IAAAC,SAAQ,GAAG;AACX,QAAI,EAAE;AACN,WAAO;MACL,OAAO,MAAgB;AACrB,YAAI,CAACC,SAAQ,IAAI;AAAG,gBAAM,IAAI,MAAM,6CAA6C;AACjF,cAAM,MAAM,GAAG,IAAI,EAAE,MAAM,GAAG,GAAG;AACjC,cAAM,MAAM,IAAI,WAAW,KAAK,SAAS,GAAG;AAC5C,YAAI,IAAI,IAAI;AACZ,YAAI,IAAI,KAAK,KAAK,MAAM;AACxB,eAAO;MACT;MACA,OAAO,MAAgB;AACrB,YAAI,CAACA,SAAQ,IAAI;AAAG,gBAAM,IAAI,MAAM,6CAA6C;AACjF,cAAM,UAAU,KAAK,MAAM,GAAG,CAAC,GAAG;AAClC,cAAM,cAAc,KAAK,MAAM,CAAC,GAAG;AACnC,cAAM,cAAc,GAAG,OAAO,EAAE,MAAM,GAAG,GAAG;AAC5C,iBAASC,KAAI,GAAGA,KAAI,KAAKA;AACvB,cAAI,YAAYA,EAAC,MAAM,YAAYA,EAAC;AAAG,kBAAM,IAAI,MAAM,kBAAkB;AAC3E,eAAO;MACT;;EAEJ;AAGO,MAAMC,SAAwP;IACnQ;IAAU;IAAO;IAAU;IAAc;IAAe;IAAO;IAAQ;IAAM;;AAwM/E,MAAM,uCAAuC,CAAC,QAC5C,sBAAM,sBAAM,EAAE,GAAG,yBAAS,GAAG,GAAG,qBAAK,EAAE,CAAC;AAWnC,MAAM,SAAqB,0BAChC,4DAA4D;AAmDvD,MAAM,oBAAoB,CAACC,YAChC,sBACE,SAAS,GAAG,CAAC,SAASA,QAAOA,QAAO,IAAI,CAAC,CAAC,GAC1C,MAAM;;;AhBxkBV,MAAMC,SAAQ,UAAK;AACnB,MAAM,EAAE,GAAE,IAAKA;AACf,MAAM,cAAc,kBAAkBC,OAAM;AAE5C,MAAM,gBAAgB,WAAW,KAAK,eAAe,MAAM,EAAE,GAAG,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC;AAQ5F,MAAM,mBAA6B,EAAE,SAAS,UAAY,QAAQ,SAAU;AAErE,MAAM,kBAA0B;AAEvC,MAAM,UAAU,CAAC,SAAqB,UAAUA,QAAO,IAAI,CAAC;AAC5D,MAAM,UAAU,CAAC,SAAqBC,YAAW,IAAI,EAAE,UAAU,GAAG,KAAK;AACzE,MAAM,QAAQ,CAACC,OAAyB;AACtC,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,KAAKA,KAAI,KAAK,KAAK,GAAG;AACxD,YAAM,IAAI,MAAM,sDAAsDA,EAAC;IACzE;AACA,UAAM,MAAM,IAAI,WAAW,CAAC;AAC5B,IAAAD,YAAW,GAAG,EAAE,UAAU,GAAGC,IAAG,KAAK;AACrC,WAAO;EACT;AAqBM,MAAO,QAAP,MAAO,OAAK;IAqFhB,YAAY,KAAa;AAThB;AACA,mCAAgB;AAChB,mCAAgB;AAChB,uCAA+B;AAC/B,+CAA4B;AAC7B;AACA;AACA;AAGN,UAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;AACnC,cAAM,IAAI,MAAM,+CAA+C;MACjE;AACA,WAAK,WAAW,IAAI,YAAY;AAChC,WAAK,QAAQ,IAAI,SAAS;AAC1B,WAAK,YAAY,IAAI,aAAa;AAClC,WAAK,QAAQ,IAAI,SAAS;AAC1B,WAAK,oBAAoB,IAAI,qBAAqB;AAClD,UAAI,CAAC,KAAK,OAAO;AACf,YAAI,KAAK,qBAAqB,KAAK,OAAO;AACxC,gBAAM,IAAI,MAAM,0DAA0D;QAC5E;MACF;AACA,UAAI,KAAK,QAAQ,KAAK;AACpB,cAAM,IAAI,MAAM,iDAAiD;MACnE;AACA,UAAI,IAAI,aAAa,IAAI,YAAY;AACnC,cAAM,IAAI,MAAM,+CAA+C;MACjE;AACA,UAAI,IAAI,YAAY;AAClB,YAAI,CAAC,UAAK,MAAM,iBAAiB,IAAI,UAAU;AAAG,gBAAM,IAAI,MAAM,qBAAqB;AACvF,aAAK,cAAc,IAAI;AACvB,aAAK,aAAa,UAAK,aAAa,IAAI,YAAY,IAAI;MAC1D,WAAW,IAAI,WAAW;AACxB,aAAK,aAAaH,OAAM,UAAU,IAAI,SAAS,EAAE,QAAQ,IAAI;MAC/D,OAAO;AACL,cAAM,IAAI,MAAM,0CAA0C;MAC5D;AACA,WAAK,UAAU,QAAQ,KAAK,UAAU;IACxC;IAlHA,IAAI,cAAW;AACb,UAAI,CAAC,KAAK,SAAS;AACjB,cAAM,IAAI,MAAM,mBAAmB;MACrC;AACA,aAAO,QAAQ,KAAK,OAAO;IAC7B;IACA,IAAI,aAAU;AACZ,aAAO,KAAK;IACd;IACA,IAAI,aAAU;AACZ,aAAO,KAAK;IACd;IACA,IAAI,aAAU;AACZ,aAAO,KAAK,eAAe;IAC7B;IACA,IAAI,YAAS;AACX,aAAO,KAAK,cAAc;IAC5B;IACA,IAAI,qBAAkB;AACpB,YAAM,OAAO,KAAK;AAClB,UAAI,CAAC,MAAM;AACT,cAAM,IAAI,MAAM,gBAAgB;MAClC;AACA,aAAO,YAAY,OACjB,KAAK,UAAU,KAAK,SAAS,SAASI,aAAY,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAE9E;IACA,IAAI,oBAAiB;AACnB,UAAI,CAAC,KAAK,YAAY;AACpB,cAAM,IAAI,MAAM,eAAe;MACjC;AACA,aAAO,YAAY,OAAO,KAAK,UAAU,KAAK,SAAS,QAAQ,KAAK,UAAU,CAAC;IACjF;IAEA,OAAO,eAAe,MAAkB,WAAqB,kBAAgB;AAC3E,MAAAC,QAAO,IAAI;AACX,UAAI,IAAI,KAAK,SAAS,OAAO,IAAI,KAAK,SAAS,KAAK;AAClD,cAAM,IAAI,MACR,mFACE,KAAK,MAAM;MAEjB;AACA,YAAMC,KAAIC,MAAKC,SAAQ,eAAe,IAAI;AAC1C,YAAM,aAAaF,GAAE,MAAM,GAAG,EAAE;AAChC,YAAM,YAAYA,GAAE,MAAM,EAAE;AAC5B,aAAO,IAAI,OAAM,EAAE,UAAU,WAAW,WAAU,CAAE;IACtD;IAEA,OAAO,gBAAgB,WAAmB,WAAqB,kBAAgB;AAE7E,YAAM,YAAwB,YAAY,OAAO,SAAS;AAC1D,YAAM,UAAUJ,YAAW,SAAS;AACpC,YAAM,UAAU,QAAQ,UAAU,GAAG,KAAK;AAC1C,YAAM,MAAM;QACV;QACA,OAAO,UAAU,CAAC;QAClB,mBAAmB,QAAQ,UAAU,GAAG,KAAK;QAC7C,OAAO,QAAQ,UAAU,GAAG,KAAK;QACjC,WAAW,UAAU,MAAM,IAAI,EAAE;;AAEnC,YAAM,MAAM,UAAU,MAAM,EAAE;AAC9B,YAAM,SAAS,IAAI,CAAC,MAAM;AAC1B,UAAI,YAAY,SAAS,SAAS,YAAY,QAAQ,GAAG;AACvD,cAAM,IAAI,MAAM,kBAAkB;MACpC;AACA,UAAI,QAAQ;AACV,eAAO,IAAI,OAAM,EAAE,GAAG,KAAK,YAAY,IAAI,MAAM,CAAC,EAAC,CAAE;MACvD,OAAO;AACL,eAAO,IAAI,OAAM,EAAE,GAAG,KAAK,WAAW,IAAG,CAAE;MAC7C;IACF;IAEO,OAAO,SAAS,MAAuB;AAC5C,aAAO,OAAM,gBAAgB,KAAK,KAAK;IACzC;IA0CA,OAAO,MAAY;AACjB,UAAI,CAAC,UAAU,KAAK,IAAI,GAAG;AACzB,cAAM,IAAI,MAAM,iCAAiC;MACnD;AACA,UAAI,WAAW,KAAK,IAAI,GAAG;AACzB,eAAO;MACT;AACA,YAAM,QAAQ,KAAK,QAAQ,aAAa,EAAE,EAAE,MAAM,GAAG;AAErD,UAAI,QAAe;AACnB,iBAAWO,MAAK,OAAO;AACrB,cAAMC,KAAI,cAAc,KAAKD,EAAC;AAC9B,cAAM,KAAKC,MAAKA,GAAE,CAAC;AACnB,YAAI,CAACA,MAAKA,GAAE,WAAW,KAAK,OAAO,OAAO;AACxC,gBAAM,IAAI,MAAM,0BAA0BD,EAAC;AAC7C,YAAI,MAAM,CAAC;AACX,YAAI,CAAC,OAAO,cAAc,GAAG,KAAK,OAAO,iBAAiB;AACxD,gBAAM,IAAI,MAAM,eAAe;QACjC;AAEA,YAAIC,GAAE,CAAC,MAAM,KAAK;AAChB,iBAAO;QACT;AACA,gBAAQ,MAAM,YAAY,GAAG;MAC/B;AACA,aAAO;IACT;IAEA,YAAY,OAAa;AACvB,UAAI,CAAC,KAAK,cAAc,CAAC,KAAK,WAAW;AACvC,cAAM,IAAI,MAAM,+BAA+B;MACjD;AACA,UAAI,OAAO,MAAM,KAAK;AACtB,UAAI,SAAS,iBAAiB;AAE5B,cAAM,OAAO,KAAK;AAClB,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI,MAAM,qCAAqC;QACvD;AAEA,eAAON,aAAY,WAAW,GAAG,CAAC,GAAG,MAAM,IAAI;MACjD,OAAO;AAEL,eAAOA,aAAY,KAAK,YAAY,IAAI;MAC1C;AACA,YAAME,KAAIC,MAAKC,SAAQ,KAAK,WAAW,IAAI;AAC3C,YAAM,aAAaF,GAAE,MAAM,GAAG,EAAE;AAChC,YAAM,YAAYA,GAAE,MAAM,EAAE;AAC5B,UAAI,CAAC,UAAK,MAAM,iBAAiB,UAAU,GAAG;AAC5C,cAAM,IAAI,MAAM,+BAA+B;MACjD;AACA,YAAM,MAAgB;QACpB,UAAU,KAAK;QACf;QACA,OAAO,KAAK,QAAQ;QACpB,mBAAmB,KAAK;QACxB;;AAEF,YAAM,SAAS,GAAG,UAAU,UAAU;AACtC,UAAI;AAEF,YAAI,KAAK,aAAa;AACpB,gBAAM,QAAQ,GAAG,OAAO,GAAG,UAAU,KAAK,WAAW,IAAI,MAAM;AAC/D,cAAI,CAAC,GAAG,YAAY,KAAK,GAAG;AAC1B,kBAAM,IAAI,MAAM,mEAAmE;UACrF;AACA,cAAI,aAAa,GAAG,QAAQ,KAAK;QACnC,OAAO;AACL,gBAAM,QAAQN,OAAM,UAAU,KAAK,UAAU,EAAE,IAAIA,OAAM,KAAK,SAAS,MAAM,CAAC;AAE9E,cAAI,MAAM,OAAOA,OAAM,IAAI,GAAG;AAC5B,kBAAM,IAAI,MAAM,sEAAsE;UACxF;AACA,cAAI,YAAY,MAAM,QAAQ,IAAI;QACpC;AACA,eAAO,IAAI,OAAM,GAAG;MACtB,SAASW,MAAK;AACZ,eAAO,KAAK,YAAY,QAAQ,CAAC;MACnC;IACF;IAEA,KAAK,MAAgB;AACnB,UAAI,CAAC,KAAK,aAAa;AACrB,cAAM,IAAI,MAAM,oBAAoB;MACtC;AACA,MAAAN,QAAO,MAAM,EAAE;AACf,aAAO,UAAK,KAAK,MAAM,KAAK,aAAa,EAAE,SAAS,MAAK,CAAE;IAC7D;IAEA,OAAO,MAAkB,WAAqB;AAC5C,MAAAA,QAAO,MAAM,EAAE;AACf,MAAAA,QAAO,WAAW,EAAE;AACpB,UAAI,CAAC,KAAK,YAAY;AACpB,cAAM,IAAI,MAAM,mBAAmB;MACrC;AACA,aAAO,UAAK,OAAO,WAAW,MAAM,KAAK,YAAY,EAAE,SAAS,MAAK,CAAE;IACzE;IAEA,kBAAe;AACb,UAAI,KAAK,aAAa;AACpB,aAAK,YAAY,KAAK,CAAC;AACvB,aAAK,cAAc;MACrB;AACA,aAAO;IACT;IACA,SAAM;AACJ,aAAO;QACL,OAAO,KAAK;QACZ,MAAM,KAAK;;IAEf;IAEQ,UAAU,SAAiB,KAAe;AAChD,UAAI,CAAC,KAAK,WAAW;AACnB,cAAM,IAAI,MAAM,kBAAkB;MACpC;AACA,MAAAA,QAAO,KAAK,EAAE;AAEd,aAAOD,aACL,MAAM,OAAO,GACb,IAAI,WAAW,CAAC,KAAK,KAAK,CAAC,GAC3B,MAAM,KAAK,iBAAiB,GAC5B,MAAM,KAAK,KAAK,GAChB,KAAK,WACL,GAAG;IAEP;;;;AiB3TF;;;ACAA;;;ACAA;;;ACAA;AAMM,WAAUQ,SAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAUC,SAAQC,IAAW,QAAgB,IAAE;AACnD,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,GAAG;AACrC,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,GAAG,MAAM,8BAA8BA,EAAC,EAAE;IAC5D;EACF;AAGM,WAAUC,QAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,UAAM,QAAQJ,SAAQ,KAAK;AAC3B,UAAM,MAAM,OAAO;AACnB,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,YAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,YAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;IACzE;AACA,WAAO;EACT;AAGM,WAAUK,OAAMC,IAAQ;AAC5B,QAAI,OAAOA,OAAM,cAAc,OAAOA,GAAE,WAAW;AACjD,YAAM,IAAI,MAAM,yCAAyC;AAC3D,IAAAJ,SAAQI,GAAE,SAAS;AACnB,IAAAJ,SAAQI,GAAE,QAAQ;EACpB;AAGM,WAAUC,SAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAUC,SAAQ,KAAU,UAAa;AAC7C,IAAAJ,QAAO,KAAK,QAAW,qBAAqB;AAC5C,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,sDAAsD,GAAG;IAC3E;EACF;AAkBM,WAAUK,UAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAUC,YAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAUC,MAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAgIM,WAAUC,aAAY,KAAW;AACrC,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,iBAAiB;AAC9D,WAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;EACrD;AASM,WAAU,gBAAgB,MAAgB,aAAa,IAAE;AAC7D,QAAI,OAAO,SAAS;AAAU,aAAOA,aAAY,IAAI;AACrD,WAAOC,QAAO,MAAM,QAAW,UAAU;EAC3C;AAqBM,WAAU,UACd,UACA,MAAS;AAET,QAAI,SAAS,UAAa,CAAA,EAAG,SAAS,KAAK,IAAI,MAAM;AACnD,YAAM,IAAI,MAAM,qCAAqC;AACvD,UAAM,SAAS,OAAO,OAAO,UAAU,IAAI;AAC3C,WAAO;EACT;AAwDM,WAAUC,cACd,UACA,OAAiB,CAAA,GAAE;AAEnB,UAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,UAAM,MAAM,SAAS,MAAS;AAC9B,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,WAAO,OAAO,OAAO,IAAI;AACzB,WAAO,OAAO,OAAO,KAAK;EAC5B;AAGM,WAAUC,aAAY,cAAc,IAAE;AAC1C,UAAMC,MAAK,OAAO,eAAe,WAAY,WAAmB,SAAS;AACzE,QAAI,OAAOA,KAAI,oBAAoB;AACjC,YAAM,IAAI,MAAM,wCAAwC;AAC1D,WAAOA,IAAG,gBAAgB,IAAI,WAAW,WAAW,CAAC;EACvD;AAGO,MAAMC,WAAU,CAAC,YAAwC;IAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;ADzUrF,MAAOC,SAAP,MAAY;IAQhB,YAAY,MAAa,KAAe;AAPxC;AACA;AACA;AACA;AACQ,sCAAW;AACX,uCAAY;AAGlB,MAAAC,OAAM,IAAI;AACV,MAAAC,QAAO,KAAK,QAAW,KAAK;AAC5B,WAAK,QAAQ,KAAK,OAAM;AACxB,UAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,cAAM,IAAI,MAAM,qDAAqD;AACvE,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,YAAY,KAAK,MAAM;AAC5B,YAAM,WAAW,KAAK;AACtB,YAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,UAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,eAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK;AAC/C,WAAK,MAAM,OAAO,GAAG;AAErB,WAAK,QAAQ,KAAK,OAAM;AAExB,eAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK,KAAO;AACtD,WAAK,MAAM,OAAO,GAAG;AACrB,MAAAC,OAAM,GAAG;IACX;IACA,OAAO,KAAe;AACpB,MAAAC,SAAQ,IAAI;AACZ,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAA,SAAQ,IAAI;AACZ,MAAAH,QAAO,KAAK,KAAK,WAAW,QAAQ;AACpC,WAAK,WAAW;AAChB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,QAAO;IACd;IACA,SAAM;AACJ,YAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,WAAK,WAAW,GAAG;AACnB,aAAO;IACT;IACA,WAAW,IAAa;AAEtB,kBAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,YAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,WAAK;AACL,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;IACA,UAAO;AACL,WAAK,YAAY;AACjB,WAAK,MAAM,QAAO;AAClB,WAAK,MAAM,QAAO;IACpB;;AAaK,MAAMI,QAGT,CAAC,MAAa,KAAiB,YACjC,IAAIN,OAAW,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AAClD,EAAAM,MAAK,SAAS,CAAC,MAAa,QAAoB,IAAIN,OAAW,MAAM,GAAG;;;ADnExE,WAAS,WAAW,MAAa,WAAqB,OAAiB,OAAgB;AACrF,IAAAO,OAAM,IAAI;AACV,UAAM,OAAO,UAAU,EAAE,OAAO,IAAI,WAAW,GAAE,GAAI,KAAK;AAC1D,UAAM,EAAE,GAAAC,IAAG,OAAO,UAAS,IAAK;AAChC,IAAAC,SAAQD,IAAG,GAAG;AACd,IAAAC,SAAQ,OAAO,OAAO;AACtB,IAAAA,SAAQ,WAAW,WAAW;AAC9B,QAAID,KAAI;AAAG,YAAM,IAAI,MAAM,6BAA6B;AACxD,UAAM,WAAW,gBAAgB,WAAW,UAAU;AACtD,UAAM,OAAO,gBAAgB,OAAO,MAAM;AAE1C,UAAM,KAAK,IAAI,WAAW,KAAK;AAE/B,UAAM,MAAME,MAAK,OAAO,MAAM,QAAQ;AACtC,UAAM,UAAU,IAAI,WAAU,EAAG,OAAO,IAAI;AAC5C,WAAO,EAAE,GAAAF,IAAG,OAAO,WAAW,IAAI,KAAK,QAAO;EAChD;AAEA,WAAS,aACP,KACA,SACA,IACA,MACAG,IAAa;AAEb,QAAI,QAAO;AACX,YAAQ,QAAO;AACf,QAAI;AAAM,WAAK,QAAO;AACtB,IAAAC,OAAMD,EAAC;AACP,WAAO;EACT;AAWM,WAAU,OACd,MACA,UACA,MACA,MAAe;AAEf,UAAM,EAAE,GAAAH,IAAG,OAAO,IAAI,KAAK,QAAO,IAAK,WAAW,MAAM,UAAU,MAAM,IAAI;AAC5E,QAAI;AACJ,UAAM,MAAM,IAAI,WAAW,CAAC;AAC5B,UAAM,OAAOK,YAAW,GAAG;AAC3B,UAAMF,KAAI,IAAI,WAAW,IAAI,SAAS;AAEtC,aAAS,KAAK,GAAG,MAAM,GAAG,MAAM,OAAO,MAAM,OAAO,IAAI,WAAW;AAEjE,YAAM,KAAK,GAAG,SAAS,KAAK,MAAM,IAAI,SAAS;AAC/C,WAAK,SAAS,GAAG,IAAI,KAAK;AAG1B,OAAC,OAAO,QAAQ,WAAW,IAAI,GAAG,OAAO,GAAG,EAAE,WAAWA,EAAC;AAC1D,SAAG,IAAIA,GAAE,SAAS,GAAG,GAAG,MAAM,CAAC;AAC/B,eAAS,KAAK,GAAG,KAAKH,IAAG,MAAM;AAE7B,YAAI,WAAW,IAAI,EAAE,OAAOG,EAAC,EAAE,WAAWA,EAAC;AAC3C,iBAASG,KAAI,GAAGA,KAAI,GAAG,QAAQA;AAAK,aAAGA,EAAC,KAAKH,GAAEG,EAAC;MAClD;IACF;AACA,WAAO,aAAa,KAAK,SAAS,IAAI,MAAMH,EAAC;EAC/C;;;AG9FA;;;ACAA;AAOM,WAAUI,KAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAUC,KAAIH,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAMM,MAAgBE,UAAhB,MAAsB;IAoB1B,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,sCAAW;AACX,oCAAS;AACT,iCAAM;AACN,uCAAY;AAGpB,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,OAAOA;AACZ,WAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,WAAK,OAAOC,YAAW,KAAK,MAAM;IACpC;IACA,OAAO,MAAgB;AACrB,MAAAC,SAAQ,IAAI;AACZ,MAAAC,QAAO,IAAI;AACX,YAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,YAAM,MAAM,KAAK;AACjB,eAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,cAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,YAAI,SAAS,UAAU;AACrB,gBAAM,WAAWF,YAAW,IAAI;AAChC,iBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,iBAAK,QAAQ,UAAU,GAAG;AACzE;QACF;AACA,eAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,aAAK,OAAO;AACZ,eAAO;AACP,YAAI,KAAK,QAAQ,UAAU;AACzB,eAAK,QAAQ,MAAM,CAAC;AACpB,eAAK,MAAM;QACb;MACF;AACA,WAAK,UAAU,KAAK;AACpB,WAAK,WAAU;AACf,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAC,SAAQ,IAAI;AACZ,MAAAE,SAAQ,KAAK,IAAI;AACjB,WAAK,WAAW;AAIhB,YAAM,EAAE,QAAQ,MAAM,UAAU,MAAAJ,MAAI,IAAK;AACzC,UAAI,EAAE,IAAG,IAAK;AAEd,aAAO,KAAK,IAAI;AAChB,MAAAK,OAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,UAAI,KAAK,YAAY,WAAW,KAAK;AACnC,aAAK,QAAQ,MAAM,CAAC;AACpB,cAAM;MACR;AAEA,eAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,eAAOA,EAAC,IAAI;AAIjD,WAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGN,KAAI;AAC7D,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM,QAAQC,YAAW,GAAG;AAC5B,YAAM,MAAM,KAAK;AAEjB,UAAI,MAAM;AAAG,cAAM,IAAI,MAAM,2CAA2C;AACxE,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,IAAG;AACtB,UAAI,SAAS,MAAM;AAAQ,cAAM,IAAI,MAAM,oCAAoC;AAC/E,eAASK,KAAI,GAAGA,KAAI,QAAQA;AAAK,cAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGN,KAAI;IACxE;IACA,SAAM;AACJ,YAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,WAAK,WAAW,MAAM;AACtB,YAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,WAAK,QAAO;AACZ,aAAO;IACT;IACA,WAAW,IAAM;AACf,kBAAO,IAAK,KAAK,YAAmB;AACpC,SAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,YAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,SAAS;AACZ,SAAG,MAAM;AACT,UAAI,SAAS;AAAU,WAAG,OAAO,IAAI,MAAM;AAC3C,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;;AASK,MAAMO,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAcM,MAAMC,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;;;AC3JD;AAKA,MAAMC,cAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,MAAMC,QAAuB,uBAAO,EAAE;AAEtC,WAASC,SACPC,IACA,KAAK,OAAK;AAKV,QAAI;AAAI,aAAO,EAAE,GAAG,OAAOA,KAAIH,WAAU,GAAG,GAAG,OAAQG,MAAKF,QAAQD,WAAU,EAAC;AAC/E,WAAO,EAAE,GAAG,OAAQG,MAAKF,QAAQD,WAAU,IAAI,GAAG,GAAG,OAAOG,KAAIH,WAAU,IAAI,EAAC;EACjF;AAEA,WAASI,OAAM,KAAe,KAAK,OAAK;AACtC,UAAM,MAAM,IAAI;AAChB,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,aAASC,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC5B,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAC,IAAKL,SAAQ,IAAIG,EAAC,GAAG,EAAE;AACnC,OAAC,GAAGA,EAAC,GAAG,GAAGA,EAAC,CAAC,IAAI,CAACC,IAAGC,EAAC;IACxB;AACA,WAAO,CAAC,IAAI,EAAE;EAChB;AAIA,MAAMC,SAAQ,CAACC,IAAW,IAAYC,OAAsBD,OAAMC;AAClE,MAAMC,SAAQ,CAACF,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAMF;AAEpF,MAAMG,UAAS,CAACJ,IAAWG,IAAWF,OAAuBD,OAAMC,KAAME,MAAM,KAAKF;AACpF,MAAMI,UAAS,CAACL,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAMF;AAErF,MAAMK,UAAS,CAACN,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAOF,KAAI;AAC1F,MAAMM,UAAS,CAACP,IAAWG,IAAWF,OAAuBD,OAAOC,KAAI,KAAQE,MAAM,KAAKF;AAa3F,WAASO,KACP,IACA,IACA,IACA,IAAU;AAKV,UAAMC,MAAK,OAAO,MAAM,OAAO;AAC/B,WAAO,EAAE,GAAI,KAAK,MAAOA,KAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,KAAI,EAAC;EAC3D;AAEA,MAAMC,SAAQ,CAAC,IAAY,IAAY,QAAwB,OAAO,MAAM,OAAO,MAAM,OAAO;AAChG,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,OACjD,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAC3C,MAAMC,SAAQ,CAAC,IAAY,IAAY,IAAY,QAChD,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AACjD,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,OAC7D,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAChD,MAAMC,SAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,QAC5D,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC9D,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,OACzE,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;AF3DrD,MAAMC,YAA2B,4BAAY,KAAK;IAChD;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAGD,MAAMC,YAA2B,oBAAI,YAAY,EAAE;AAGnD,MAAeC,YAAf,cAAuDC,QAAS;IAY9D,YAAY,WAAiB;AAC3B,YAAM,IAAI,WAAW,GAAG,KAAK;IAC/B;IACU,MAAG;AACX,YAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,aAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IAChC;;IAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,WAAK,IAAIP,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;IACf;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,QAAAX,UAASW,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,cAAM,MAAMX,UAASW,KAAI,EAAE;AAC3B,cAAMC,MAAKZ,UAASW,KAAI,CAAC;AACzB,cAAM,KAAKE,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,cAAM,KAAKA,MAAKD,KAAI,EAAE,IAAIC,MAAKD,KAAI,EAAE,IAAKA,QAAO;AACjD,QAAAZ,UAASW,EAAC,IAAK,KAAKX,UAASW,KAAI,CAAC,IAAI,KAAKX,UAASW,KAAI,EAAE,IAAK;MACjE;AAEA,UAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,SAASE,MAAKN,IAAG,CAAC,IAAIM,MAAKN,IAAG,EAAE,IAAIM,MAAKN,IAAG,EAAE;AACpD,cAAM,KAAMG,KAAI,SAASI,KAAIP,IAAGC,IAAGC,EAAC,IAAIV,UAASY,EAAC,IAAIX,UAASW,EAAC,IAAK;AACrE,cAAM,SAASE,MAAKV,IAAG,CAAC,IAAIU,MAAKV,IAAG,EAAE,IAAIU,MAAKV,IAAG,EAAE;AACpD,cAAM,KAAM,SAASY,KAAIZ,IAAGC,IAAGC,EAAC,IAAK;AACrC,QAAAK,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAKD,KAAI,KAAM;AACf,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAK,KAAK,KAAM;MAClB;AAEA,MAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,WAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IACjC;IACU,aAAU;AAClB,MAAAM,OAAMhB,SAAQ;IAChB;IACA,UAAO;AACL,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,MAAAgB,OAAM,KAAK,MAAM;IACnB;;AAII,MAAOC,WAAP,cAAuBhB,UAAiB;IAW5C,cAAA;AACE,YAAM,EAAE;AATA;;+BAAYiB,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;IAGrC;;AAuBF,MAAMC,QAAwB,uBAAUC,OAAM;IAC5C;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE,IAAI,CAAAC,OAAK,OAAOA,EAAC,CAAC,CAAC,GAAE;AACvB,MAAMC,aAA6B,uBAAMH,MAAK,CAAC,GAAE;AACjD,MAAMI,aAA6B,uBAAMJ,MAAK,CAAC,GAAE;AAGjD,MAAMK,cAA6B,oBAAI,YAAY,EAAE;AACrD,MAAMC,cAA6B,oBAAI,YAAY,EAAE;AAGrD,MAAeC,YAAf,cAAuDC,QAAS;IAqB9D,YAAY,WAAiB;AAC3B,YAAM,KAAK,WAAW,IAAI,KAAK;IACjC;;IAEU,MAAG;AAIX,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC3E,aAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;IACxE;;IAEU,IACR,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IACpF,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAU;AAE9F,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;IACjB;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU,GAAG;AACxC,QAAAJ,YAAWI,EAAC,IAAI,KAAK,UAAU,MAAM;AACrC,QAAAH,YAAWG,EAAC,IAAI,KAAK,UAAW,UAAU,CAAE;MAC9C;AACA,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAE5B,cAAM,OAAOJ,YAAWI,KAAI,EAAE,IAAI;AAClC,cAAM,OAAOH,YAAWG,KAAI,EAAE,IAAI;AAClC,cAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAC3F,cAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAE3F,cAAM,MAAMR,YAAWI,KAAI,CAAC,IAAI;AAChC,cAAM,MAAMH,YAAWG,KAAI,CAAC,IAAI;AAChC,cAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQI,QAAO,KAAK,KAAK,EAAE,IAAQH,OAAM,KAAK,KAAK,CAAC;AACvF,cAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQG,QAAO,KAAK,KAAK,EAAE,IAAQF,OAAM,KAAK,KAAK,CAAC;AAEvF,cAAM,OAAWG,OAAM,KAAK,KAAKV,YAAWG,KAAI,CAAC,GAAGH,YAAWG,KAAI,EAAE,CAAC;AACtE,cAAM,OAAWQ,OAAM,MAAM,KAAK,KAAKZ,YAAWI,KAAI,CAAC,GAAGJ,YAAWI,KAAI,EAAE,CAAC;AAC5E,QAAAJ,YAAWI,EAAC,IAAI,OAAO;AACvB,QAAAH,YAAWG,EAAC,IAAI,OAAO;MACzB;AACA,UAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAEzE,eAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAE3B,cAAM,UAAcC,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE;AAEvF,cAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,cAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,cAAM,OAAWG,OAAM,IAAI,SAAS,MAAMd,WAAUK,EAAC,GAAGH,YAAWG,EAAC,CAAC;AACrE,cAAM,MAAUU,OAAM,MAAM,IAAI,SAAS,MAAMhB,WAAUM,EAAC,GAAGJ,YAAWI,EAAC,CAAC;AAC1E,cAAM,MAAM,OAAO;AAEnB,cAAM,UAAcC,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,cAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,SAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASK,KAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,cAAM,MAAUC,OAAM,KAAK,SAAS,IAAI;AACxC,aAASC,OAAM,KAAK,KAAK,SAAS,IAAI;AACtC,aAAK,MAAM;MACb;AAEA,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASF,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;IACzE;IACU,aAAU;AAClB,MAAAG,OAAMlB,aAAYC,WAAU;IAC9B;IACA,UAAO;AACL,MAAAiB,OAAM,KAAK,MAAM;AACjB,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACzD;;AAII,MAAOC,WAAP,cAAuBjB,UAAiB;IAkB5C,cAAA;AACE,YAAM,EAAE;AAlBA,gCAAakB,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;IAIvC;;AAsGK,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;AASxB,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;;;AJtb/B,MAAM,aAAa,CAACC,cAAaA,UAAS,CAAC,MAAM;AAKjD,WAAS,KAAK,KAAK;AACf,QAAI,OAAO,QAAQ;AACf,YAAM,IAAI,UAAU,4BAA4B,OAAO,GAAG;AAC9D,WAAO,IAAI,UAAU,MAAM;AAAA,EAC/B;AACA,WAAS,UAAU,KAAK;AACpB,UAAM,OAAO,KAAK,GAAG;AACrB,UAAM,QAAQ,KAAK,MAAM,GAAG;AAC5B,QAAI,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,SAAS,MAAM,MAAM;AAC3C,YAAM,IAAI,MAAM,kBAAkB;AACtC,WAAO,EAAE,MAAM,MAAM,MAAM;AAAA,EAC/B;AACA,WAAS,SAAS,KAAK;AACnB,IAAAC,QAAO,GAAG;AACV,QAAI,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,SAAS,IAAI,MAAM;AACzC,YAAM,IAAI,MAAM,wBAAwB;AAAA,EAChD;AASO,WAAS,iBAAiBD,WAAU,WAAW,KAAK;AACvD,IAAAE,SAAQ,QAAQ;AAChB,QAAI,WAAW,OAAO,KAAK,WAAW;AAClC,YAAM,IAAI,UAAU,iBAAiB;AACzC,WAAO,kBAAkBC,aAAY,WAAW,CAAC,GAAGH,SAAQ;AAAA,EAChE;AACA,MAAM,eAAe,CAAC,YAAY;AAE9B,UAAM,WAAW,IAAI,QAAQ,SAAS;AAGtC,WAAO,IAAI,WAAW,CAAEI,QAAO,OAAO,EAAE,CAAC,KAAK,YAAa,QAAQ,CAAC;AAAA,EACxE;AACA,WAAS,SAASJ,WAAU;AACxB,QAAI,CAAC,MAAM,QAAQA,SAAQ,KAAKA,UAAS,WAAW,QAAQ,OAAOA,UAAS,CAAC,MAAM;AAC/E,YAAM,IAAI,MAAM,0CAA0C;AAC9D,IAAAA,UAAS,QAAQ,CAACK,OAAM;AACpB,UAAI,OAAOA,OAAM;AACb,cAAM,IAAI,MAAM,mCAAmCA,EAAC;AAAA,IAC5D,CAAC;AACD,WAAOC,OAAU,MAAMA,OAAU,SAAS,GAAG,YAAY,GAAGA,OAAU,OAAO,IAAI,IAAI,GAAGA,OAAU,SAASN,SAAQ,CAAC;AAAA,EACxH;AAiCO,WAAS,kBAAkB,SAASO,WAAU;AACjD,aAAS,OAAO;AAChB,UAAM,QAAQ,SAASA,SAAQ,EAAE,OAAO,OAAO;AAC/C,WAAO,MAAM,KAAK,WAAWA,SAAQ,IAAI,WAAW,GAAG;AAAA,EAC3D;AAaA,MAAM,QAAQ,CAAC,eAAe,KAAK,aAAa,UAAU;AAwBnD,WAAS,mBAAmB,UAAU,aAAa,IAAI;AAC1D,WAAO,OAAOC,SAAQ,UAAU,QAAQ,EAAE,MAAM,MAAM,UAAU,GAAG,EAAE,GAAG,MAAM,OAAO,GAAG,CAAC;AAAA,EAC7F;;;AOtIA;AAAO,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KA+/DnB,MAAM,IAAI;;;AzBv9DR,MAAM,kBAAN,MAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQzB,MAAM,cAAc,SAAS;AACzB,UAAI,CAAC,QAAQ,MAAM;AACf,cAAM,IAAI,MAAM,kCAAkC;AAAA,MACtD;AACA,UAAI,CAAC,QAAQ,MAAM;AACf,cAAM,IAAI,MAAM,4DAA+D;AAAA,MACnF;AACA,UAAI;AAEA,cAAM,YAAY,MAAM,eAAe,QAAQ,IAAI;AAEnD,cAAM,WAAW,UAAU,OAAO,QAAQ,IAAI;AAC9C,YAAI,CAAC,SAAS,YAAY;AACtB,gBAAM,IAAI,MAAM,wCAAwC,QAAQ,IAAI,EAAE;AAAA,QAC1E;AACA,YAAI,CAAC,SAAS,WAAW;AACrB,gBAAM,IAAI,MAAM,uCAAuC,QAAQ,IAAI,EAAE;AAAA,QACzE;AACA,eAAO;AAAA,UACH,YAAY,SAAS;AAAA,UACrB,WAAW,SAAS;AAAA;AAAA,QACxB;AAAA,MACJ,SACO,OAAO;AACV,cAAM,IAAI,MAAM,mCAAmC,QAAQ,IAAI,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MAChI;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,eAAe,UAAU,YAAY;AACjC,aAAO,mBAAmB,UAAU,UAAU;AAAA,IAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,iBAAiB,WAAW,KAAK;AAC7B,aAAO,iBAAsB,UAAU,QAAQ;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASA,OAAO,YAAY,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG;AACnD,aAAO,YAAY,OAAO,KAAK,MAAM,IAAI,KAAK;AAAA,IAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASA,OAAO,kBAAkB,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG;AACzD,aAAO,YAAY,OAAO,KAAK,MAAM,IAAI,KAAK;AAAA,IAClD;AAAA,EACJ;;;A0BpHA;AAUA,MAAM,kBAAkB;AAIxB,WAAS,aAAa,MAAM;AACxB,QAAI,MAAM;AACV,eAAW,QAAQ,MAAM;AACrB,YAAM,MAAM,OAAO,OAAO,IAAI;AAAA,IAClC;AACA,QAAI,UAAU;AACd,WAAO,MAAM,IAAI;AACb,YAAM,YAAY,OAAO,MAAM,GAAG;AAClC,gBAAU,gBAAgB,SAAS,IAAI;AACvC,YAAM,MAAM;AAAA,IAChB;AAEA,eAAW,QAAQ,MAAM;AACrB,UAAI,SAAS;AACT;AACJ,gBAAU,MAAM;AAAA,IACpB;AACA,WAAO;AAAA,EACX;AAIA,WAAS,aAAa,KAAK;AACvB,QAAI,MAAM;AACV,eAAW,QAAQ,KAAK;AACpB,YAAM,QAAQ,gBAAgB,QAAQ,IAAI;AAC1C,UAAI,UAAU,IAAI;AACd,cAAM,IAAI,MAAM,6BAA6B,IAAI,EAAE;AAAA,MACvD;AACA,YAAM,MAAM,MAAM,OAAO,KAAK;AAAA,IAClC;AAEA,UAAM,QAAQ,CAAC;AACf,WAAO,MAAM,IAAI;AACb,YAAM,QAAQ,OAAO,MAAM,IAAI,CAAC;AAChC,YAAM,MAAM;AAAA,IAChB;AAEA,eAAW,QAAQ,KAAK;AACpB,UAAI,SAAS;AACT;AACJ,YAAM,QAAQ,CAAC;AAAA,IACnB;AACA,WAAO,IAAI,WAAW,KAAK;AAAA,EAC/B;AASO,WAAS,UAAU,YAAY,aAAa,MAAM,UAAU,WAAW;AAC1E,QAAI,WAAW,WAAW,IAAI;AAC1B,YAAM,IAAI,MAAM,8BAA8B;AAAA,IAClD;AAEA,UAAM,UAAU,YAAY,YAAY,MAAO;AAE/C,UAAM,UAAU,IAAI,WAAW,aAAa,KAAK,EAAE;AACnD,YAAQ,CAAC,IAAI;AACb,YAAQ,IAAI,YAAY,CAAC;AACzB,QAAI,YAAY;AACZ,cAAQ,EAAE,IAAI;AAAA,IAClB;AAEA,UAAM,QAAQC,QAAO,OAAO;AAC5B,UAAM,QAAQA,QAAO,KAAK;AAC1B,UAAMC,YAAW,MAAM,MAAM,GAAG,CAAC;AAEjC,UAAM,OAAO,IAAI,WAAW,QAAQ,SAAS,CAAC;AAC9C,SAAK,IAAI,OAAO;AAChB,SAAK,IAAIA,WAAU,QAAQ,MAAM;AACjC,WAAO,aAAa,IAAI;AAAA,EAC5B;AAQO,WAAS,UAAU,KAAK;AAC3B,UAAM,OAAO,aAAa,GAAG;AAC7B,QAAI,KAAK,WAAW,MAAM,KAAK,WAAW,IAAI;AAC1C,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACxC;AAEA,UAAM,UAAU,KAAK,MAAM,GAAG,EAAE;AAChC,UAAMA,YAAW,KAAK,MAAM,EAAE;AAE9B,UAAM,QAAQD,QAAO,OAAO;AAC5B,UAAM,QAAQA,QAAO,KAAK;AAC1B,UAAM,mBAAmB,MAAM,MAAM,GAAG,CAAC;AACzC,QAAI,CAACC,UAAS,MAAM,CAAC,MAAMC,OAAM,SAAS,iBAAiBA,EAAC,CAAC,GAAG;AAC5D,YAAM,IAAI,MAAM,sBAAsB;AAAA,IAC1C;AAEA,UAAM,UAAU,QAAQ,CAAC;AACzB,UAAM,UAAU,YAAY,MAAO,YAAY,YAAY,MAAO,YAAY;AAC9E,QAAI,CAAC,SAAS;AACV,YAAM,IAAI,MAAM,+BAA+B,QAAQ,SAAS,EAAE,CAAC,EAAE;AAAA,IACzE;AAEA,UAAM,aAAa,QAAQ,WAAW,MAAM,QAAQ,EAAE,MAAM;AAC5D,UAAM,aAAa,QAAQ,MAAM,GAAG,EAAE;AACtC,WAAO;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,IACJ;AAAA,EACJ;;;AjCvHA,EAAU,IAAI,iBAAiB,CAAC,QAAQ,SAAS,KAAKC,SAAQ,KAAe,IAAI,YAAY,GAAG,IAAI,CAAC;AAO9F,MAAM,gBAAN,MAAoB;AAAA,IAApB;AACH,qCAAU;AACV,qCAAU;AACV,0CAAe;AAAA,QACX,YAAY,IAAI,gBAAgB;AAAA,MACpC;AAAA;AAAA,IACA,MAAM,kBAAkB;AACpB,YAAM,aAAuB,MAAM,iBAAiB;AACpD,YAAM,YAAsB,aAAa,YAAY,IAAI;AACzD,aAAO;AAAA,QACH;AAAA,QACA;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,MAAM,KAAK,YAAY,SAAS;AAC5B,UAAI;AAEA,cAAM,YAAY,MAAgB,KAAK,SAAS,UAAU;AAC1D,eAAO,UAAU,kBAAkB;AAAA,MACvC,SACO,OAAO;AACV,cAAM,IAAI,MAAM,iCAAiC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MAC7G;AAAA,IACJ;AAAA,IACA,MAAM,OAAO,WAAW,SAAS,WAAW;AACxC,UAAI;AACA,eAAiB,OAAO,WAAW,SAAS,SAAS;AAAA,MACzD,SACO,OAAO;AAEV,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,gBAAgB,KAAK;AAEjB,aAAO,WAAW,GAAG;AAAA,IACzB;AAAA,IACA,gBAAgB,SAAS;AACrB,aAAO,WAAW,OAAO;AAAA,IAC7B;AAAA,IACA,iBAAiB,MAAM;AAEnB,aAAO,UAAU,MAAM,MAAM,SAAS;AAAA,IAC1C;AAAA,IACA,iBAAiB,SAAS;AAEtB,UAAI,QAAQ,WAAW,IAAI;AAEvB,cAAM,QAAQ,WAAW,OAAO;AAChC,YAAI,MAAM,WAAW,IAAI;AACrB,gBAAM,IAAI,MAAM,8BAA8B;AAAA,QAClD;AACA,eAAO;AAAA,MACX,OACK;AAED,YAAI;AACA,gBAAM,EAAE,WAAW,IAAI,UAAU,OAAO;AACxC,iBAAO;AAAA,QACX,SACO,OAAO;AACV,gBAAM,IAAI,MAAM,+BAA+B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,QAC3G;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;;;AkC/EA;AAEA,MAAI,eAAe;AACnB,iBAAe,eAAe;AAC1B,QAAI,CAAC,cAAc;AACf,YAAMC,UAAS,MAAM;AAErB,qBAAeA,QAAO,WAAWA;AAAA,IACrC;AACA,WAAO;AAAA,EACX;AAYO,MAAM,eAAN,MAAmB;AAAA,IAAnB;AACH,qCAAU;AACV,qCAAU;AACV,0CAAe,CAAC;AAAA;AAAA;AAAA,IAChB,MAAM,kBAAkB;AACpB,UAAI;AACA,cAAMC,aAAY,MAAM,aAAa;AACrC,cAAM,UAAU,MAAMA,WAAU,QAAQ;AACxC,eAAO;AAAA,UACH,WAAW,IAAI,WAAW,QAAQ,SAAS;AAAA,UAC3C,YAAY,IAAI,WAAW,QAAQ,UAAU;AAAA,QACjD;AAAA,MACJ,SACO,OAAO;AACV,cAAM,IAAI,MAAM,oCAAoC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MAChH;AAAA,IACJ;AAAA,IACA,MAAM,KAAK,YAAY,SAAS;AAC5B,UAAI;AACA,cAAMA,aAAY,MAAM,aAAa;AACrC,cAAM,YAAY,MAAMA,WAAU,aAAa,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,UAAU,CAAC;AAC5F,eAAO,IAAI,WAAW,SAAS;AAAA,MACnC,SACO,OAAO;AACV,cAAM,IAAI,MAAM,6BAA6B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MACzG;AAAA,IACJ;AAAA,IACA,MAAM,OAAO,WAAW,SAAS,WAAW;AACxC,UAAI;AACA,cAAMA,aAAY,MAAM,aAAa;AACrC,eAAO,MAAMA,WAAU,eAAe,OAAO,KAAK,SAAS,GAAG,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,SAAS,CAAC;AAAA,MAC9G,SACO,OAAO;AAEV,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,gBAAgB,KAAK;AACjB,aAAO,WAAW,GAAG;AAAA,IACzB;AAAA,IACA,gBAAgB,SAAS;AACrB,YAAM,QAAQ,WAAW,OAAO;AAChC,UAAI,MAAM,WAAW,MAAM;AACvB,cAAM,IAAI,MAAM,gDAAgD,MAAM,MAAM,EAAE;AAAA,MAClF;AACA,aAAO;AAAA,IACX;AAAA,IACA,iBAAiB,MAAM;AACnB,aAAO,WAAW,IAAI;AAAA,IAC1B;AAAA,IACA,iBAAiB,SAAS;AACtB,YAAM,QAAQ,WAAW,OAAO;AAChC,UAAI,MAAM,WAAW,MAAM;AACvB,cAAM,IAAI,MAAM,iDAAiD,MAAM,MAAM,EAAE;AAAA,MACnF;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AASO,MAAM,aAAN,MAAiB;AAAA,IAAjB;AACH,qCAAU;AACV,qCAAU;AACV,kCAAO,IAAI,aAAa;AAAA;AAAA,IACxB,MAAM,kBAAkB;AACpB,aAAO,KAAK,KAAK,gBAAgB;AAAA,IACrC;AAAA,IACA,MAAM,KAAK,YAAY,SAAS;AAC5B,aAAO,KAAK,KAAK,KAAK,YAAY,OAAO;AAAA,IAC7C;AAAA,IACA,MAAM,OAAO,WAAW,SAAS,WAAW;AACxC,aAAO,KAAK,KAAK,OAAO,WAAW,SAAS,SAAS;AAAA,IACzD;AAAA,IACA,gBAAgB,KAAK;AACjB,aAAO,KAAK,KAAK,gBAAgB,GAAG;AAAA,IACxC;AAAA,IACA,gBAAgB,SAAS;AACrB,aAAO,KAAK,KAAK,gBAAgB,OAAO;AAAA,IAC5C;AAAA,IACA,iBAAiB,MAAM;AACnB,aAAO,KAAK,KAAK,iBAAiB,IAAI;AAAA,IAC1C;AAAA,IACA,iBAAiB,SAAS;AACtB,aAAO,KAAK,KAAK,iBAAiB,OAAO;AAAA,IAC7C;AAAA,EACJ;;;A3CxEO,MAAM,gBAAN,MAAsC;AAAA;AAAA,IAK3C,YAAY,QAAsB;AAFlC,WAAQ,aAAa,oBAAI,IAAoB;AAG3C,WAAK,cAAc,OAAO;AAC1B,WAAK,gBAAgB,OAAO;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,UACJ,SACA,SACA,UAA4B,CAAC,GACT;AAEpB,YAAM,QAAQ,KAAK,cAAc,SAAS,QAAQ,qBAAqB;AAGvE,UAAI;AAEJ,UAAI,QAAQ,mBAAmB;AAE7B,YAAI,CAAC,MAAM,cAAc,YAAY;AACnC,gBAAM,YAAY,KAAK,wBAAwB,YAAY;AAC3D,gBAAM,IAAI;AAAA,YACR,UAAU,MAAM,OAAO;AAAA,KACtB,UAAU,SAAS,IAChB,sCAAsC,UAAU,KAAK,IAAI,CAAC;AAAA,8EAE1D;AAAA,UACN;AAAA,QACF;AAGA,kBAAU,MAAM,MAAM,aAAa,WAAW,cAAc,QAAQ,iBAAiB;AAAA,MACvF,OAAO;AAEL,kBAAU,MAAM,MAAM,gBAAgB;AAAA,MACxC;AAGA,YAAM,UAAU,KAAK,eAAe,OAAO;AAC3C,YAAM,YAAY,QAAQ,sBAAsB,MAAM,GAAG,EAAE,CAAC;AAC5D,YAAM,QAAQ,GAAG,OAAO,OAAO,SAAS,IAAI,OAAO;AAGnD,YAAM,OAAO,MAAM,KAAK,YAAY;AAAA,QAClC;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,UACE,WAAW,QAAQ;AAAA,UACnB,OAAO,QAAQ,SAAS,CAAC,SAAS;AAAA,UAClC,sBAAsB,QAAQ,wBAAwB;AAAA,QACxD;AAAA,MACF;AAEA,aAAO;AAAA,QACL;AAAA,QACA,WAAW,QAAQ;AAAA,MACrB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,OAAO,OAA0C;AACrD,YAAM,SAAS,MAAM,KAAK,YAAY,aAAa,KAAK;AAExD,UAAI,CAAC,QAAQ;AACX,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,QACL,MAAM,OAAO;AAAA,QACb,WAAW,OAAO;AAAA,MACpB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,YACJ,OACA,SACqB;AAErB,YAAM,SAAS,MAAM,KAAK,YAAY,OAAO,KAAK;AAElD,UAAI,CAAC,QAAQ;AACX,cAAM,IAAI,MAAM,kBAAkB,KAAK,EAAE;AAAA,MAC3C;AAEA,UAAI,OAAO,KAAK,WAAW,UAAU;AACnC,cAAM,IAAI,MAAM,sBAAsB,KAAK,aAAa,OAAO,KAAK,MAAM,GAAG;AAAA,MAC/E;AAGA,YAAM,QAAQ,KAAK,cAAc,SAAS,OAAO,KAAK,OAAO;AAG7D,YAAM,UAAU,KAAK,iBAAiB,OAAO,KAAK,OAAO;AACzD,YAAM,cAAc,MAAM,UAAU,SAAS,OAAO;AAEpD,aAAO,MAAM,MAAM,KAAK,OAAO,QAAQ,YAAY,WAAW;AAAA,IAChE;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,gBACJ,OACA,SACA,WACkB;AAClB,YAAM,SAAS,MAAM,KAAK,YAAY,aAAa,KAAK;AAExD,UAAI,CAAC,QAAQ;AACX,eAAO;AAAA,MACT;AAEA,YAAM,QAAQ,KAAK,cAAc,SAAS,OAAO,KAAK,OAAO;AAG7D,YAAM,UAAU,KAAK,iBAAiB,OAAO,KAAK,OAAO;AACzD,YAAM,cAAc,MAAM,UAAU,SAAS,OAAO;AAEpD,UAAI;AACF,eAAO,MAAM,MAAM,OAAO,OAAO,WAAW,aAAa,SAAS;AAAA,MACpE,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,iBACJ,SACA,aAAsB,MACA;AACtB,YAAM,OAAO,aACT,MAAM,KAAK,YAAY,eAAe,IACtC,MAAM,KAAK,YAAY,SAAS;AAGpC,YAAM,YAAY,KAAK,OAAO,UAAQ,KAAK,MAAM,WAAW,GAAG,OAAO,GAAG,CAAC;AAG1E,YAAM,UAAuB,CAAC;AAE9B,iBAAW,QAAQ,WAAW;AAC5B,cAAM,SAAS,MAAM,KAAK,YAAY,aAAa,KAAK,KAAK;AAC7D,YAAI,QAAQ;AACV,kBAAQ,KAAK;AAAA,YACX,MAAM,OAAO;AAAA,YACb,WAAW,OAAO;AAAA,UACpB,CAAC;AAAA,QACH;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,uBAAuB,SAAgD;AAC3E,YAAM,OAAO,MAAM,KAAK,iBAAiB,SAAS,IAAI;AAEtD,UAAI,KAAK,WAAW,GAAG;AACrB,eAAO;AAAA,MACT;AAGA,YAAM,SAAS,IAAI,IAAI,KAAK,IAAI,CAAAC,OAAKA,GAAE,KAAK,OAAO,CAAC;AACpD,YAAM,aAAa,MAAM,KAAK,MAAM;AAGpC,aAAO;AAAA,QACL,uBAAuB,WAAW,CAAC;AAAA,QACnC,yBAAyB,WAAW,CAAC;AAAA,MACvC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,gBAAgB,SAAuC;AAC3D,YAAM,aAAa,MAAM,KAAK,iBAAiB,SAAS,IAAI;AAC5D,YAAM,UAAuB,CAAC;AAE9B,iBAAW,aAAa,YAAY;AAElC,cAAM,QAAQ,KAAK,cAAc,SAAS,UAAU,KAAK,OAAO;AAChE,cAAM,aAAa,MAAM,MAAM,gBAAgB;AAG/C,cAAM,UAAU,KAAK,eAAe,OAAO;AAC3C,cAAM,YAAY,UAAU,KAAK,QAAQ,MAAM,GAAG,EAAE,CAAC;AACrD,cAAM,WAAW,GAAG,OAAO,OAAO,SAAS,IAAI,OAAO;AAGtD,cAAM,UAAU,MAAM,KAAK,YAAY;AAAA,UACrC,UAAU,KAAK;AAAA,UACf;AAAA,UACA;AAAA,QACF;AAEA,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN,WAAW,WAAW;AAAA,QACxB,CAAC;AAAA,MACH;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,eACJ,SACA,SACA,UAA4B,CAAC,GACT;AAEpB,YAAM,eAAe,MAAM,KAAK,iBAAiB,SAAS,IAAI;AAE9D,YAAM,aAAa,aAAa;AAAA,QAC9B,CAAAA,OAAKA,GAAE,KAAK,YAAY,QAAQ;AAAA,MAClC;AAEA,UAAI,YAAY;AACd,eAAO;AAAA,MACT;AAGA,aAAO,MAAM,KAAK,UAAU,SAAS,SAAS,OAAO;AAAA,IACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,iBAAiB,WAAsB,KAAa;AAClD,YAAM,QAAQ,IAAI,gBAAgB;AAClC,aAAO,MAAM,iBAAiB,QAAQ;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAeA,MAAM,sBACJ,SACA,SACA,UACA,OAAe,gBAAgB,YAAY,GAAG,GAAG,CAAC,GAClD,YACA,UAA4B,CAAC,GACT;AACpB,YAAM,QAAQ,IAAI,gBAAgB;AAClC,YAAM,OAAO,MAAM,eAAe,UAAU,UAAU;AAEtD,aAAO,MAAM,KAAK,UAAU,SAAS,SAAS;AAAA,QAC5C,GAAG;AAAA,QACH,mBAAmB;AAAA,UACjB;AAAA,UACA;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,gBAAgB,SAA2B;AACzC,YAAM,QAAQ,KAAK,cAAc,SAAS,OAAO;AACjD,YAAM,OAAiB,CAAC;AAExB,UAAI,MAAM,cAAc,WAAY,MAAK,KAAK,YAAY;AAC1D,UAAK,MAAM,cAAsB,WAAY,MAAK,KAAK,YAAY;AACnE,UAAK,MAAM,cAAsB,UAAW,MAAK,KAAK,WAAW;AAEjE,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,wBAAwB,YAAiE;AACvF,YAAM,YAAY,KAAK,cAAc,aAAa;AAClD,aAAO,UACJ,OAAO,WAAS,CAAC,CAAE,MAAM,eAAuB,UAAU,CAAC,EAC3D,IAAI,WAAS,MAAM,OAAO;AAAA,IAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAeA,MAAM,uBACJ,SACA,UACA,eAAe,GACf,eAAe,GACf,WAAW,OACX,UAA4B,CAAC,GACT;AACpB,YAAM,OAAO,gBAAgB,YAAY,cAAc,WAAW,IAAI,GAAG,YAAY;AAErF,aAAO,KAAK;AAAA,QACV;AAAA,QACA,EAAE,uBAAuB,sBAAsB;AAAA,QAC/C;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKQ,iBAAiB,SAAmD;AAC1E,UAAI,QAAQ,WAAW,QAAQ,GAAG;AAChC,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKQ,eAAe,SAAyB;AAC9C,YAAM,UAAU,KAAK,WAAW,IAAI,OAAO,KAAK;AAChD,YAAM,OAAO,UAAU;AACvB,WAAK,WAAW,IAAI,SAAS,IAAI;AACjC,aAAO;AAAA,IACT;AAAA,EACF;;;A4C5ZA;;;A7CuBA,iBAAsB,eAAgC;AACpD,UAAM,UAAU,IAAI,mBAAmB;AACvC,UAAM,cAAc,IAAI,YAAY,OAAO;AAG3C,UAAM,gBAAgB,IAAI,uBAAuB;AACjD,kBAAc,SAAS,IAAI,cAAc,CAAC;AAC1C,kBAAc,SAAS,IAAI,WAAW,CAAC;AAEvC,UAAM,MAAM,IAAI,cAAc;AAAA,MAC5B;AAAA,MACA;AAAA,IACF,CAAC;AAKD,WAAO;AAAA,EACT;AAKA,MAAO,kBAAQ;AAAA,IACb;AAAA,EACF;AAGA,MAAI,OAAO,WAAW,aAAa;AACjC,IAAC,OAAe,YAAY;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;",
6
- "names": ["i", "a", "n", "i", "u", "a", "b", "c", "isLE", "i", "n", "i", "h", "l", "s", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "n", "s", "B", "x", "y", "t", "R", "j", "h", "l", "i", "A", "I", "g", "C", "B", "Q", "i", "E", "o", "n", "r", "t", "a", "e", "f", "D", "c", "G", "h", "y", "W", "u", "s", "F", "Y", "N", "w", "S", "k", "H", "R", "d", "M", "J", "q", "l", "m", "L", "p", "K", "b", "v", "j", "O", "T", "x", "P", "V", "X", "Z", "_", "z", "$", "AA", "IA", "gA", "CA", "BA", "QA", "iA", "EA", "oA", "nA", "rA", "tA", "aA", "eA", "fA", "DA", "cA", "GA", "hA", "U", "b", "i", "k", "u", "P", "N", "L", "L2", "m", "n", "s", "isBytes", "a", "abytes", "l", "bytesToHex", "b", "e", "C", "hexToBytes", "r", "c", "M", "x", "y", "u", "v", "q", "p", "I", "G", "f", "d", "k", "R", "i", "h", "L2", "h", "P", "r", "s", "N", "R", "v", "L", "L", "M", "N", "hexToBytes", "bytesToHex", "s", "k", "e", "w", "p", "G", "W", "b", "i", "n", "I", "f", "isEven", "isBytes", "a", "anumber", "n", "abytes", "b", "h", "aexists", "aoutput", "clean", "i", "createView", "rotr", "abytes", "createHasher", "i", "clean", "aexists", "abytes", "isLE", "_32n", "h", "l", "Chi", "a", "b", "c", "Maj", "HashMD", "createView", "aexists", "abytes", "aoutput", "clean", "i", "SHA256_IV", "SHA256_K", "SHA256_W", "HashMD", "SHA256_IV", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "rotr", "Chi", "Maj", "clean", "sha256", "createHasher", "sha256", "isBytes", "a", "anumber", "n", "abytes", "ahash", "h", "aexists", "aoutput", "clean", "i", "createView", "rotr", "i", "bytesToHex", "abytes", "hexToBytes", "concatBytes", "i", "a", "abytes", "createHasher", "randomBytes", "cr", "oidNist", "Chi", "a", "b", "c", "Maj", "HashMD", "isLE", "createView", "aexists", "abytes", "aoutput", "clean", "i", "SHA256_IV", "SHA256_K", "SHA256_W", "SHA2_32B", "HashMD", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "rotr", "Chi", "Maj", "clean", "_SHA256", "SHA256_IV", "sha256", "createHasher", "_SHA256", "oidNist", "_0n", "_1n", "n", "anumber", "_0n", "bytesToHex", "abytes", "n", "anumber", "hexToBytes", "n", "_0n", "_1n", "n", "_1n", "anumber", "u8n", "v", "k", "i", "h", "concatBytes", "f", "_0n", "_1n", "_2n", "_7n", "a", "b", "x", "_0n", "invert", "a", "b", "y", "_1n", "u", "v", "q", "r", "m", "n", "gcd", "n2", "_2n", "i", "P", "_7n", "Q", "S", "M", "c", "t", "R", "_0n", "_1n", "p", "d", "i", "n", "_1n", "_2n", "n", "anumber", "_0n", "_1n", "invert", "abytes", "isLE", "a", "b", "isLE", "abytes", "_1n", "_0n", "_1n", "c", "p", "i", "W", "scalarBits", "n", "window", "P", "n", "_0n", "wNAF", "Point", "p", "d", "_1n", "W", "window", "i", "f", "isLE", "p", "_0n", "Fn", "_b", "getPublicKey", "ahash", "abytes", "i", "clean", "aexists", "hmac", "_2n", "k", "n", "k2", "_0n", "_1n", "m", "E", "t", "b", "v", "abytes", "_3n", "_4n", "Fn", "x", "y", "concatBytes", "err", "L", "x2", "Point", "p", "Y", "_Point", "P", "hexToBytes", "a", "endo", "f", "p2", "bytesToHex", "wNAF", "Fn", "Point", "randomBytes", "l", "abytes", "getPublicKey", "isBytes", "s", "b", "utils", "ahash", "hmac", "_2n", "_1n", "Signature", "r", "L", "hexToBytes", "x", "R", "concatBytes", "h", "bits2int_modN", "Q", "bytesToHex", "bits2int", "_0n", "prepSig", "d", "e", "m", "k", "q", "sign", "verify", "P", "v", "recoverPublicKey", "secp256k1_CURVE", "_2n", "y", "P", "secp256k1_CURVE", "_3n", "sha256", "isBytes", "a", "anumber", "n", "abytes", "ahash", "h", "aexists", "aoutput", "clean", "i", "createView", "rotr", "concatBytes", "i", "a", "abytes", "createHasher", "oidNist", "_HMAC", "ahash", "abytes", "i", "clean", "aexists", "hmac", "Chi", "a", "b", "c", "Maj", "HashMD", "isLE", "createView", "aexists", "abytes", "aoutput", "clean", "i", "SHA256_IV", "SHA512_IV", "i", "L", "R", "j", "k", "x", "y", "HashMD", "cr", "clean", "createHasher", "U32_MASK64", "_32n", "fromBig", "n", "split", "i", "h", "l", "shrSH", "h", "s", "shrSL", "l", "rotrSH", "rotrSL", "rotrBH", "rotrBL", "add", "l", "add3L", "add3H", "add4L", "add4H", "add5L", "add5H", "SHA256_K", "SHA256_W", "SHA2_32B", "HashMD", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "rotr", "Chi", "Maj", "clean", "_SHA256", "SHA256_IV", "K512", "split", "n", "SHA512_Kh", "SHA512_Kl", "SHA512_W_H", "SHA512_W_L", "SHA2_64B", "HashMD", "i", "rotrSH", "shrSH", "rotrSL", "shrSL", "rotrBH", "rotrBL", "add4L", "add4H", "add5L", "add5H", "add", "add3L", "add3H", "clean", "_SHA512", "SHA512_IV", "sha256", "createHasher", "_SHA256", "oidNist", "sha512", "createHasher", "_SHA512", "oidNist", "isBytes", "a", "anumber", "n", "a", "b", "c", "x", "l", "i", "d", "anumber", "i", "a", "b", "padding", "n", "isBytes", "anumber", "isBytes", "i", "utils", "sha256", "Point", "sha256", "createView", "n", "concatBytes", "abytes", "I", "hmac", "sha512", "c", "m", "err", "isBytes", "a", "anumber", "n", "abytes", "ahash", "h", "aexists", "aoutput", "clean", "i", "createView", "rotr", "utf8ToBytes", "abytes", "createHasher", "randomBytes", "cr", "oidNist", "_HMAC", "ahash", "abytes", "i", "clean", "aexists", "hmac", "ahash", "c", "anumber", "hmac", "u", "clean", "createView", "i", "Chi", "a", "b", "c", "Maj", "HashMD", "isLE", "createView", "aexists", "abytes", "aoutput", "clean", "i", "SHA256_IV", "SHA512_IV", "U32_MASK64", "_32n", "fromBig", "n", "split", "i", "h", "l", "shrSH", "h", "s", "shrSL", "l", "rotrSH", "rotrSL", "rotrBH", "rotrBL", "add", "l", "add3L", "add3H", "add4L", "add4H", "add5L", "add5H", "SHA256_K", "SHA256_W", "SHA2_32B", "HashMD", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "rotr", "Chi", "Maj", "clean", "_SHA256", "SHA256_IV", "K512", "split", "n", "SHA512_Kh", "SHA512_Kl", "SHA512_W_H", "SHA512_W_L", "SHA2_64B", "HashMD", "i", "rotrSH", "shrSH", "rotrSL", "shrSL", "rotrBH", "rotrBL", "add4L", "add4H", "add5L", "add5H", "add", "add3L", "add3H", "clean", "_SHA512", "SHA512_IV", "sha256", "createHasher", "_SHA256", "oidNist", "sha512", "createHasher", "_SHA512", "oidNist", "wordlist", "abytes", "anumber", "randomBytes", "sha256", "i", "utils", "wordlist", "sha512", "sha256", "checksum", "i", "sha256", "module", "dilithium", "k"]
4
+ "sourcesContent": ["/**\r\n * Polyfills for browser environment\r\n * Provides Node.js compatibility shims\r\n */\r\n\r\n// Buffer polyfill for browser\r\nexport const Buffer = {\r\n from: function(data, encoding) {\r\n if (typeof data === 'string') {\r\n if (encoding === 'base64') {\r\n const binaryString = atob(data);\r\n const bytes = new Uint8Array(binaryString.length);\r\n for (let i = 0; i < binaryString.length; i++) {\r\n bytes[i] = binaryString.charCodeAt(i);\r\n }\r\n return bytes;\r\n }\r\n // Default to UTF-8\r\n const encoder = new TextEncoder();\r\n return encoder.encode(data);\r\n }\r\n // Assume Uint8Array or ArrayBuffer\r\n return new Uint8Array(data);\r\n }\r\n};\r\n\r\n// Add toString method to Uint8Array prototype for base64 encoding\r\nif (typeof Uint8Array.prototype.toString !== 'function' || \r\n !Uint8Array.prototype.toString.toString().includes('[native code]')) {\r\n const originalToString = Uint8Array.prototype.toString;\r\n Uint8Array.prototype.toString = function(encoding) {\r\n if (encoding === 'base64') {\r\n let binary = '';\r\n const bytes = new Uint8Array(this);\r\n for (let i = 0; i < bytes.byteLength; i++) {\r\n binary += String.fromCharCode(bytes[i]);\r\n }\r\n return btoa(binary);\r\n }\r\n return originalToString.call(this);\r\n };\r\n}\r\n\r\n// Process shim\r\nexport const process = {\r\n env: {\r\n NODE_ENV: 'production'\r\n }\r\n};\r\n\r\n// Global shim\r\nif (typeof global === 'undefined') {\r\n window.global = window;\r\n}\r\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\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\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\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: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\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: Uint8Array): this {\n aexists(this);\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) 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: Uint8Array): void {\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++) 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 view.setBigUint64(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 must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\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);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) 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}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\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}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\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(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\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: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\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", "/**\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://www.rfc-editor.org/rfc/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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal 32-byte base SHA2 hash class. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n constructor() {\n super(32);\n }\n}\n\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal 64-byte base SHA2 hash class. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\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 protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor() {\n super(64);\n }\n}\n\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n */\nexport const sha256: CHash<_SHA256> = /* @__PURE__ */ createHasher(\n () => new _SHA256(),\n /* @__PURE__ */ oidNist(0x01)\n);\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash<_SHA224> = /* @__PURE__ */ createHasher(\n () => new _SHA224(),\n /* @__PURE__ */ oidNist(0x04)\n);\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash<_SHA512> = /* @__PURE__ */ createHasher(\n () => new _SHA512(),\n /* @__PURE__ */ oidNist(0x03)\n);\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash<_SHA384> = /* @__PURE__ */ createHasher(\n () => new _SHA384(),\n /* @__PURE__ */ oidNist(0x02)\n);\n\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: CHash<_SHA512_256> = /* @__PURE__ */ createHasher(\n () => new _SHA512_256(),\n /* @__PURE__ */ oidNist(0x06)\n);\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: CHash<_SHA512_224> = /* @__PURE__ */ createHasher(\n () => new _SHA512_224(),\n /* @__PURE__ */ oidNist(0x05)\n);\n", "/**\n * SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n *\n * Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),\n * [Website](https://keccak.team/keccak.html),\n * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).\n *\n * Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n */\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.ts';\n// prettier-ignore\nimport {\n abytes, aexists, anumber, aoutput,\n clean, createHasher,\n oidNist,\n swap32IfBE,\n u32,\n type CHash, type CHashXOF,\n type Hash,\n type HashInfo,\n type HashXOF\n} from './utils.ts';\n\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI: number[] = [];\nconst SHA3_ROTL: number[] = [];\nconst _SHA3_IOTA: bigint[] = []; // no pure annotation: var is always used\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 * x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n) t ^= _1n << ((_1n << BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h: number, l: number, s: number) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h: number, l: number, s: number) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n\n/** `keccakf1600` internal function, additionally allows to adjust round count. */\nexport function keccakP(s: Uint32Array, rounds: number = 24): void {\n const B = new Uint32Array(5 * 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta \u03B8\n for (let x = 0; x < 10; x++) B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (\u03C1) and Pi (\u03C0)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (\u03C7)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++) B[x] = s[y + x];\n for (let x = 0; x < 10; x++) s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (\u03B9)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n clean(B);\n}\n\n/** Keccak sponge function. */\nexport class Keccak implements Hash<Keccak>, HashXOF<Keccak> {\n protected state: Uint8Array;\n protected pos = 0;\n protected posOut = 0;\n protected finished = false;\n protected state32: Uint32Array;\n protected destroyed = false;\n\n public blockLen: number;\n public suffix: number;\n public outputLen: number;\n protected enableXOF = false;\n protected rounds: number;\n\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(\n blockLen: number,\n suffix: number,\n outputLen: number,\n enableXOF = false,\n rounds: number = 24\n ) {\n this.blockLen = blockLen;\n this.suffix = suffix;\n this.outputLen = outputLen;\n this.enableXOF = enableXOF;\n this.rounds = rounds;\n // Can be passed from user as dkLen\n anumber(outputLen, 'outputLen');\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n // 0 < blockLen < 200\n if (!(0 < blockLen && blockLen < 200))\n throw new Error('only keccak-f1600 function is supported');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n clone(): Keccak {\n return this._cloneInto();\n }\n protected keccak(): void {\n swap32IfBE(this.state32);\n keccakP(this.state32, this.rounds);\n swap32IfBE(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data: Uint8Array): this {\n aexists(this);\n abytes(data);\n const { blockLen, state } = this;\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++) state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen) this.keccak();\n }\n return this;\n }\n protected finish(): void {\n if (this.finished) return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1) this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n protected writeInto(out: Uint8Array): Uint8Array {\n aexists(this, false);\n abytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len; ) {\n if (this.posOut >= blockLen) this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out: Uint8Array): Uint8Array {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF) throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes: number): Uint8Array {\n anumber(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out: Uint8Array): Uint8Array {\n aoutput(out, this);\n if (this.finished) throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest(): Uint8Array {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy(): void {\n this.destroyed = true;\n clean(this.state);\n }\n _cloneInto(to?: Keccak): Keccak {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to ||= new Keccak(blockLen, suffix, outputLen, enableXOF, rounds);\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\n\nconst genKeccak = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher(() => new Keccak(blockLen, suffix, outputLen), info);\n\n/** SHA3-224 hash function. */\nexport const sha3_224: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 144,\n 28,\n /* @__PURE__ */ oidNist(0x07)\n);\n/** SHA3-256 hash function. Different from keccak-256. */\nexport const sha3_256: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 136,\n 32,\n /* @__PURE__ */ oidNist(0x08)\n);\n/** SHA3-384 hash function. */\nexport const sha3_384: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 104,\n 48,\n /* @__PURE__ */ oidNist(0x09)\n);\n/** SHA3-512 hash function. */\nexport const sha3_512: CHash = /* @__PURE__ */ genKeccak(\n 0x06,\n 72,\n 64,\n /* @__PURE__ */ oidNist(0x0a)\n);\n\n/** keccak-224 hash function. */\nexport const keccak_224: CHash = /* @__PURE__ */ genKeccak(0x01, 144, 28);\n/** keccak-256 hash function. Different from SHA3-256. */\nexport const keccak_256: CHash = /* @__PURE__ */ genKeccak(0x01, 136, 32);\n/** keccak-384 hash function. */\nexport const keccak_384: CHash = /* @__PURE__ */ genKeccak(0x01, 104, 48);\n/** keccak-512 hash function. */\nexport const keccak_512: CHash = /* @__PURE__ */ genKeccak(0x01, 72, 64);\n\n/** Options for SHAKE XOF. */\nexport type ShakeOpts = { dkLen?: number };\n\nconst genShake = (suffix: number, blockLen: number, outputLen: number, info: HashInfo = {}) =>\n createHasher<Keccak, ShakeOpts>(\n (opts: ShakeOpts = {}) =>\n new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true),\n info\n );\n\n/** SHAKE128 XOF with 128-bit security. */\nexport const shake128: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 168, 16, /* @__PURE__ */ oidNist(0x0b));\n/** SHAKE256 XOF with 256-bit security. */\nexport const shake256: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 136, 32, /* @__PURE__ */ oidNist(0x0c));\n\n/** SHAKE128 XOF with 256-bit output (NIST version). */\nexport const shake128_32: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 168, 32, /* @__PURE__ */ oidNist(0x0b));\n/** SHAKE256 XOF with 512-bit output (NIST version). */\nexport const shake256_64: CHashXOF<Keccak, ShakeOpts> =\n /* @__PURE__ */\n genShake(0x1f, 136, 64, /* @__PURE__ */ oidNist(0x0c));\n", "/**\r\n * Browser shim for Node.js crypto module\r\n * Uses @noble/hashes for browser-compatible cryptography\r\n */\r\n\r\nimport { sha256, sha512 } from '@noble/hashes/sha2.js';\r\nimport { sha3_256 } from '@noble/hashes/sha3.js';\r\n\r\n/**\r\n * Browser-compatible createHash function\r\n */\r\nfunction createHash(algorithm) {\r\n let data = new Uint8Array(0);\r\n let hashFn;\r\n\r\n // Select the appropriate hash function\r\n switch (algorithm.toLowerCase()) {\r\n case 'sha256':\r\n case 'sha-256':\r\n hashFn = sha256;\r\n break;\r\n case 'sha512':\r\n case 'sha-512':\r\n hashFn = sha512;\r\n break;\r\n case 'sha3-256':\r\n hashFn = sha3_256;\r\n break;\r\n default:\r\n throw new Error(`Unsupported hash algorithm: ${algorithm}`);\r\n }\r\n\r\n return {\r\n update(chunk) {\r\n // Concatenate data\r\n const chunkArray = chunk instanceof Uint8Array ? chunk : new Uint8Array(chunk);\r\n const newData = new Uint8Array(data.length + chunkArray.length);\r\n newData.set(data);\r\n newData.set(chunkArray, data.length);\r\n data = newData;\r\n return this;\r\n },\r\n \r\n digest() {\r\n return hashFn(data);\r\n }\r\n };\r\n}\r\n\r\n// Export for both ESM and CommonJS compatibility\r\nexport { createHash };\r\nexport default { createHash };\r\n", "var dilithium=function(){var A,I,g,C={};function B(A,I){if(0===A)return I;throw new Error(\"Dilithium error: \"+A)}function Q(A,I){return new Uint8Array(new Uint8Array(C.HEAPU8.buffer,A,I))}function i(A){try{C._free(A)}catch(A){setTimeout((function(){throw A}),0)}}C.ready=new Promise((function(A,I){function g(A){return g=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(A){return typeof A}:function(A){return A&&\"function\"==typeof Symbol&&A.constructor===Symbol&&A!==Symbol.prototype?\"symbol\":typeof A},g(A)}(Q={}).onAbort=I,Q.onRuntimeInitialized=function(){try{Q._dilithiumjs_public_key_bytes(),A(Q)}catch(A){I(A)}};var C,B,Q=void 0!==Q?Q:{},i=Object.assign({},Q),E=function(A,I){throw I},o=\"object\"==(\"undefined\"==typeof window?\"undefined\":g(window)),n=\"function\"==typeof importScripts,r=\"object\"==(\"undefined\"==typeof process?\"undefined\":g(process))&&\"object\"==g(process.versions)&&\"string\"==typeof process.versions.node,t=\"\";if(r){var a=eval(\"require\")(\"fs\"),e=eval(\"require\")(\"path\");t=n?e.dirname(t)+\"/\":__dirname+\"/\",C=function(A,I){var g=x(A);return g?I?g:g.toString():(A=q(A)?new URL(A):e.normalize(A),a.readFileSync(A,I?void 0:\"utf8\"))},B=function(A){var I=C(A,!0);return I.buffer||(I=new Uint8Array(I)),I},function(A,I,g){var C=!(arguments.length>3&&void 0!==arguments[3])||arguments[3],B=x(A);B&&I(B),A=q(A)?new URL(A):e.normalize(A),a.readFile(A,C?void 0:\"utf8\",(function(A,B){A?g(A):I(C?B.buffer:B)}))},!Q.thisProgram&&process.argv.length>1&&process.argv[1].replace(/\\\\/g,\"/\"),process.argv.slice(2),\"undefined\"!=typeof module&&(module.exports=Q),process.on(\"uncaughtException\",(function(A){if(!(\"unwind\"===A||A instanceof p||A.context instanceof p))throw A})),E=function(A,I){throw process.exitCode=A,I},Q.inspect=function(){return\"[Emscripten Module object]\"}}else(o||n)&&(n?t=self.location.href:\"undefined\"!=typeof document&&document.currentScript&&(t=document.currentScript.src),t=0!==t.indexOf(\"blob:\")?t.substr(0,t.replace(/[?#].*/,\"\").lastIndexOf(\"/\")+1):\"\",C=function(A){try{var I=new XMLHttpRequest;return I.open(\"GET\",A,!1),I.send(null),I.responseText}catch(I){var g=x(A);if(g)return function(A){for(var I=[],g=0;g<A.length;g++){var C=A[g];C>255&&(C&=255),I.push(String.fromCharCode(C))}return I.join(\"\")}(g);throw I}},n&&(B=function(A){try{var I=new XMLHttpRequest;return I.open(\"GET\",A,!1),I.responseType=\"arraybuffer\",I.send(null),new Uint8Array(I.response)}catch(I){var g=x(A);if(g)return g;throw I}}),function(A,I,g){var C=new XMLHttpRequest;C.open(\"GET\",A,!0),C.responseType=\"arraybuffer\",C.onload=function(){if(200==C.status||0==C.status&&C.response)I(C.response);else{var B=x(A);B?I(B.buffer):g()}},C.onerror=g,C.send(null)},function(A){return document.title=A});Q.print||console.log.bind(console);var f,D=Q.printErr||console.error.bind(console);Object.assign(Q,i),i=null,Q.arguments&&Q.arguments,Q.thisProgram&&Q.thisProgram,Q.quit&&(E=Q.quit),Q.wasmBinary&&(f=Q.wasmBinary);var c,G=Q.noExitRuntime||!0;\"object\"!=(\"undefined\"==typeof WebAssembly?\"undefined\":g(WebAssembly))&&U(\"no native wasm support detected\");var h,y,u,s,F=!1;var Y=[],N=[],w=[];var S=0,k=null,H=null;function U(A){throw Q.onAbort&&Q.onAbort(A),D(A=\"Aborted(\"+A+\")\"),F=!0,1,A+=\". Build with -sASSERTIONS for more info.\",new WebAssembly.RuntimeError(A)}var R,d,M=\"data:application/octet-stream;base64,\";function J(A){return A.startsWith(M)}function q(A){return A.startsWith(\"file://\")}function l(A){return Promise.resolve().then((function(){return function(A){if(A==R&&f)return new Uint8Array(f);var I=x(A);if(I)return I;if(B)return B(A);throw\"both async and sync fetching of the wasm failed\"}(A)}))}function m(A,I,g,C){return function(A,I,g){return l(A).then((function(A){return WebAssembly.instantiate(A,I)})).then((function(A){return A})).then(g,(function(A){D(\"failed to asynchronously prepare wasm: \"+A),U(A)}))}(I,g,C)}J(R=\"data:application/octet-stream;base64,AGFzbQEAAAABOApgA39/fwBgAX8AYAJ/fwBgAX8Bf2ACf38Bf2AAAX9gA39/fwF/YAR/f39/AGAAAGAEf39/fwF/AhkEAWEBYQABAWEBYgAGAWEBYwADAWEBZAAAA0FAAAAAAQICAAQBAQAAAQACAgICAgAGAAABAAECAgABAQMEAQEBAQcBAwAAAQEAAggAAgAEAAADBwIACQkEBQUFCAQFAXABAQEFBgEBgAKAAgYJAX8BQZCcgAQLBzEMAWUCAAFmADIBZwEAAWgAKwFpACoBagBDAWsAQgFsAEEBbQBAAW4APwFvAD4BcAA9CuuEAkD5BAIHfwF+IwBB4AZrIgUkACMAQRBrIgQkACAEIAI7AA4gBUEMaiICECEgAiABQSAQPCACIARBDmpBAhA8IAIoAgAiASABKQPIASIKp0F4cWoiAyADKQMAQh8gCkIDhoaFNwMAIAFCADcDyAEgASABKQOgAUKAgICAgICAgIB/hTcDoAEgBEEQaiQAIAVBEGpByAYgAhA1QQAhAUEDIQQDQCAFQRBqIAFqIgEvAAAgAS0AAkEQdEGAgPwDcXIiAUGAwP8DTQRAIAAgBkECdGogATYCACAGQQFqIQYLIAQiAUHFBk0EQCABQQNqIQQgBkGAAkkNAQsLIAZB/wFNBEBByAYhAwNAIANBA3AiCARAIAMgCGshB0EAIQRBACECQQAhCSADQQNwQQFrQQNPBEADQCAFQRBqIgEgAmogAiAHaiABai0AADoAACABIAJBAXIiA2ogAyAHaiABai0AADoAACABIAJBAnIiA2ogAyAHaiABai0AADoAACABIAJBA3IiA2ogAyAHaiABai0AADoAACACQQRqIQIgCUEEaiIJDQALCwNAIAVBEGoiASACaiACIAdqIAFqLQAAOgAAIAJBAWohAiAEQQFqIgQgCEcNAAsLIAVBEGogCHJBqAEgBUEMahA1QYACIAZrIQcgCEGoAXIhAyAAIAZBAnRqIQhBACECQQMhBEEAIQEDQCAFQRBqIAJqIgIvAAAgAi0AAkEQdEGAgPwDcXIiAkGAwP8DTQRAIAggAUECdGogAjYCACABQQFqIQELIAEgB0kgAyAEIgJBA2oiBE9xDQALIAEgBmoiBkGAAkkNAAsLIAVBDGoQECAFQeAGaiQAC1ACAn8BfgNAIAAgA0ECdCIEaiACIARqNAIAIAEgBGo0AgB+IgUgBUKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACADQQFqIgNBgAJHDQALC1ABAn8DQCAAIARBAnQiA2ogAiADaigCACABIANqKAIAajYCACAAIANBBHIiA2ogAiADaigCACABIANqKAIAajYCACAEQQJqIgRBgAJHDQALC8UaAgZ/An4DQCAAIAZBAnRqIgU0AoAEQvfJAX4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAUgBSgCACIBIAJrNgKABCAFIAEgAmo2AgAgBkEBaiIGQYABRw0ACwNAIAAgA0ECdGoiBjQCgAJCguLgfn4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyEFIAYgBigCACICIAVrNgKAAiAGIAIgBWo2AgAgA0EBaiIDQcAARw0AC0GAASEDA0AgACADQQJ0aiIGNAKAAkKDqmB+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchBSAGIAYoAgAiAiAFazYCgAIgBiACIAVqNgIAIANBAWoiA0HAAUcNAAtBACEDA0AgACADQQJ0aiIGNAKAAULEvA5+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchBSAGIAYoAgAiAiAFazYCgAEgBiACIAVqNgIAIANBAWoiA0EgRw0AC0HAACEGA0BBgAEhAyAAIAZBAnRqIgU0AoABQpjCUH4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAUgBSgCACIBIAJrNgKAASAFIAEgAmo2AgAgBkEBaiIGQeAARw0ACwNAIAAgA0ECdGoiBjQCgAFCqMJKfiIHIAdCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQUgBiAGKAIAIgIgBWs2AoABIAYgAiAFajYCACADQQFqIgNBoAFHDQALQcABIQMDQCAAIANBAnRqIgY0AoABQqS8HH4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyEFIAYgBigCACICIAVrNgKAASAGIAIgBWo2AgAgA0EBaiIDQeABRw0AC0EHIQZBACEFA0AgBkEBaiIGQQJ0QaAKajQCACIHIAAgBUECdCIDQcAAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQcQAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQcgAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQhyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQcwAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQxyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQdAAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRByaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQdQAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQdgAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRhyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQdwAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRxyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQeAAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQSByaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQeQAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQSRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQegAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQShyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQewAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQSxyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQfAAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQTByaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQfQAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQTRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQfgAcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQThyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQfwAcmoiATQCAH4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQTxyaiIDKAIAIgEgAms2AgAgAyABIAJqNgIAIAVB4AFJIQMgBUEgaiEFIAMNAAtBACEFA0AgBkEBaiIGQQJ0QaAKajQCACIHIAAgBUECdCIDQSByaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIANqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIANBJHJqIgE0AgB+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgA0EEcmoiASgCACIEIAJrNgIAIAEgAiAEajYCACAHIAAgA0EocmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQhyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQSxyaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIANBDHJqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIANBMHJqIgE0AgB+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgA0EQcmoiASgCACIEIAJrNgIAIAEgAiAEajYCACAHIAAgA0E0cmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQRRyaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQThyaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIANBGHJqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIANBPHJqIgE0AgB+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgA0EccmoiAygCACIBIAJrNgIAIAMgASACajYCACAFQfABSSEDIAVBEGohBSADDQALQQAhBQNAIAZBAWoiBkECdEGgCmo0AgAiByAAIAVBAnQiA0EQcmoiATQCAH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADaiIBKAIAIgQgAms2AgAgASACIARqNgIAIAcgACADQRRyaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIANBBHJqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIANBGHJqIgE0AgB+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgA0EIcmoiASgCACIEIAJrNgIAIAEgAiAEajYCACAHIAAgA0EccmoiATQCAH4iByAHQoCAgICQgIjAA35CIIdC/7+AfH58QiCIpyECIAEgACADQQxyaiIDKAIAIgEgAms2AgAgAyABIAJqNgIAIAVB+AFJIQMgBUEIaiEFIAMNAAtBACEDA0AgBkEBaiIGQQJ0QaAKajQCACIHIAAgA0ECdCIFQQhyaiIBNAIAfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIinIQIgASAAIAVqIgEoAgAiBCACazYCACABIAIgBGo2AgAgByAAIAVBDHJqIgE0AgB+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchAiABIAAgBUEEcmoiBSgCACIBIAJrNgIAIAUgASACajYCACADQfwBSSEFIANBBGohAyAFDQALQQAhAwNAIAAgA0ECdCICQQRyaiIBNAIAIAZBAWoiBkECdEGgCmo0AgB+IgcgB0KAgICAkICIwAN+QiCHQv+/gHx+fEIgiKchBSABIAAgAmoiAigCACIBIAVrNgIAIAIgASAFajYCACADQf4BSSEFIANBAmohAyAFDQALC4oCAQp/A0AgACAEQQV0aiICIAEgBEEDbGoiAy0AAEEHcSIFNgIAIAIgAy0AAEEDdkEHcSIGNgIEIAIgAy0AAUECdEEEcSADLQAAQQZ2ciIHNgIIIAIgAy0AAUEBdkEHcSIINgIMIAIgAy0AAUEEdkEHcSIJNgIQIAIgAy0AAkEBdEEGcSADLQABQQd2ciIKNgIUIAIgAy0AAkECdkEHcSILNgIYIAMtAAIhAyACQQIgBms2AgQgAkECIAVrNgIAIAJBAiAHazYCCCACQQIgCGs2AgwgAkECIAlrNgIQIAJBAiAKazYCFCACQQIgC2s2AhggAkECIANBBXZrNgIcIARBAWoiBEEgRw0ACwu5AQEIfwNAIAEgA0EFdGoiAigCECEGIAIoAgwhByACKAIcIQQgAigCFCEIIAIoAhghCSAAIANBA2xqIgVBECACKAIEQQN0a0ECIAIoAgBrckECIAIoAghrIgJBBnRyOgAAIAVBwAAgBEEFdGtBCCAJQQJ0a0ECIAhrIgRB/gFxQQF2cnI6AAIgBUEgIAZBBHRrQQQgB0EBdGsgAkH8AXFBAnZyciAEQQd0cjoAASADQQFqIgNBIEcNAAsLpgMBBn8jAEGgAWsiBCQAIARBDGoiAyABIAIQMyAEQRBqQYgBIAMQD0EAIQJBACEDA0AgBEEQaiACai0AACIFQQR2IQEgBUEPcSIFQQ9HBEAgACADQQJ0aiAFQc0BbEEKdkEFbCAFa0ECajYCACADQQFqIQMLAkAgAUEPRg0AIANB/wFLDQAgACADQQJ0aiABQc0BbEEKdkEFbCABa0ECajYCACADQQFqIQMLIAJBhgFNBEAgAkEBaiECIANBgAJJDQELCyADQf8BTQRAA0AgBEEQakGIASAEQQxqEA9BgAIgA2shByAAIANBAnRqIQhBACEBQQAhAgNAIARBEGogAWotAAAiBkEEdiEFIAZBD3EiBkEPRwRAIAggAkECdGogBkHNAWxBCnZBBWwgBmtBAmo2AgAgAkEBaiECCwJAIAVBD0YNACACIAdPDQAgCCACQQJ0aiAFQc0BbEEKdkEFbCAFa0ECajYCACACQQFqIQILIAFBhgFNBEAgAUEBaiEBIAIgB0kNAQsLIAIgA2oiA0GAAkkNAAsLIARBDGoQECAEQaABaiQAC2kBA38Cf0EBIAFBgPg/Sg0AGgNAQQEgACADQQJ0IgRqKAIAIgIgAkEBdCACQR91cWsgAU4NARpBASAAIARBBHJqKAIAIgIgAkEBdCACQR91cWsgAU4NARogA0ECaiIDQYACRw0AC0EACws6AQJ/A0AgACACQQJ0aiIBIAEoAgAiASABQYCAgAJqQRd1Qf+/gHxsajYCACACQQFqIgJBgAJHDQALC6MeAgd/An5BgAIhBgNAIAAgBUECdCIEaiICIAAgBEEEcmoiBCgCACIBIAIoAgAiAmo2AgAgBCACIAFrIgI2AgAgBCACrEEAIAZBAWsiBkECdEGgCmooAgBrrH4iCSAJQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAVB/gFJIQQgBUECaiEFIAQNAAsDQCAAIANBAnQiBGoiBSAAIARBCHJqIgIoAgAiASAFKAIAIgVqNgIAIAIgBSABayIBNgIAQQAhBSACQQAgBkEBayIGQQJ0QaAKaigCAGusIgkgAax+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIARBBHJqIgIgACAEQQxyaiIEKAIAIgEgAigCACICajYCACAEIAIgAWsiAjYCACAEIAKsIAl+IgkgCUKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACADQfwBSSEEIANBBGohAyAEDQALA0AgACAFQQJ0IgRqIgMgACAEQRByaiICKAIAIgEgAygCACIDajYCACACIAMgAWsiATYCAEEAIQMgAkEAIAZBAWsiBkECdEGgCmooAgBrrCIJIAGsfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACAEQQRyaiIBIAAgBEEUcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACAEQQhyaiIBIAAgBEEYcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACAEQQxyaiICIAAgBEEccmoiBCgCACIBIAIoAgAiAmo2AgAgBCACIAFrIgI2AgAgBCACrCAJfiIJIAlCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgBUH4AUkhBCAFQQhqIQUgBA0ACwNAIAAgA0ECdCIEaiIFIAAgBEEgcmoiAigCACIBIAUoAgAiBWo2AgAgAiAFIAFrIgE2AgBBACEFIAJBACAGQQFrIgZBAnRBoApqKAIAa6wiCSABrH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEEcmoiASAAIARBJHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEIcmoiASAAIARBKHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEMcmoiASAAIARBLHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEQcmoiASAAIARBMHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEUcmoiASAAIARBNHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEYcmoiASAAIARBOHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgBEEccmoiAiAAIARBPHJqIgQoAgAiASACKAIAIgJqNgIAIAQgAiABayICNgIAIAQgAqwgCX4iCSAJQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIANB8AFJIQQgA0EQaiEDIAQNAAsDQCAAIAVBAnQiA2oiAiAAIANBwAByaiIEKAIAIgEgAigCACICajYCACAEIAIgAWsiAjYCACAEQQAgBiIEQQFrIgZBAnRBoApqKAIAa6wiCSACrH4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0EEcmoiASAAIANBxAByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBCHJqIgEgACADQcgAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQQxyaiIBIAAgA0HMAHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0EQcmoiASAAIANB0AByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBFHJqIgEgACADQdQAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQRhyaiIBIAAgA0HYAHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0EccmoiASAAIANB3AByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBIHJqIgEgACADQeAAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQSRyaiIBIAAgA0HkAHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0EocmoiASAAIANB6AByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBLHJqIgEgACADQewAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQTByaiIBIAAgA0HwAHJqIgIoAgAiByABKAIAIgFqNgIAIAIgASAHayIBNgIAIAIgAawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAAgA0E0cmoiASAAIANB9AByaiICKAIAIgcgASgCACIBajYCACACIAEgB2siATYCACACIAGsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CACAAIANBOHJqIgEgACADQfgAcmoiAigCACIHIAEoAgAiAWo2AgAgAiABIAdrIgE2AgAgAiABrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgACADQTxyaiICIAAgA0H8AHJqIgMoAgAiASACKAIAIgJqNgIAIAMgAiABayICNgIAIAMgAqwgCX4iCSAJQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgIAIAVB4AFJIQMgBUEgaiEFIAMNAAtBACEDQQAgBEECdEGYCmooAgBrrCEJA0AgACADQQJ0aiIGIAYoAoABIgUgBigCACICajYCACAGIAIgBWsiBTYCgAEgBiAFrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AoABIANBAWoiA0EgRw0AC0EAIARBAnRBlApqKAIAa6whCUHAACEDA0AgACADQQJ0aiIGIAYoAoABIgUgBigCACICajYCACAGIAIgBWsiBTYCgAEgBiAFrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AoABIANBAWoiA0HgAEcNAAtBACAEQQJ0QZAKaigCAGusIQlBgAEhAwNAIAAgA0ECdGoiBiAGKAKAASIFIAYoAgAiAmo2AgAgBiACIAVrIgU2AoABIAYgBawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgKAASADQQFqIgNBoAFHDQALQQAgBEECdEGMCmooAgBrrCEJQcABIQMDQCAAIANBAnRqIgYgBigCgAEiBSAGKAIAIgJqNgIAIAYgAiAFayIFNgKAASAGIAWsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CgAEgA0EBaiIDQeABRw0AC0EAIQNBACAEQQJ0QYgKaigCAGusIQkDQCAAIANBAnRqIgYgBigCgAIiBSAGKAIAIgJqNgIAIAYgAiAFayIFNgKAAiAGIAWsIAl+IgggCEKAgICAkICIwAN+QiCHQv+/gHx+fEIgiD4CgAIgA0EBaiIDQcAARw0AC0EAIARBAnRBhApqKAIAa6whCUGAASEDA0AgACADQQJ0aiIGIAYoAoACIgUgBigCACICajYCACAGIAIgBWsiBTYCgAIgBiAFrCAJfiIIIAhCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AoACIANBAWoiA0HAAUcNAAtBACEDQQAgBEECdEGACmooAgBrrCEJQQAhBgNAIAAgBkECdGoiBCAEKAKABCIFIAQoAgAiAmo2AgAgBCACIAVrIgU2AoAEIAQgBawgCX4iCCAIQoCAgICQgIjAA35CIIdC/7+AfH58QiCIPgKABCAGQQFqIgZBgAFHDQALA0AgACADQQJ0aiIGIAY0AgBC+scCfiIJIAlCgICAgJCAiMADfkIgh0L/v4B8fnxCIIg+AgAgA0EBaiIDQYACRw0ACwsQACAAKAIAQYgBIAEgAhA6C8kCAgd/A34gAigCACEDAn9BACABRQ0AGiABrSEMA0AgCqciAiAKIAMpA8gBIgtaDQEaIAAgAmogAyAKIAt9IgunQYgBakF4cWopAwAgC0IDhog8AAAgCkIBfCIKIAxSDQALIAELIQIgAyADKQPIASACrX03A8gBIAEgAmsiBQRAIAAgAmohAANAIAMQJUGIASAFIAVBiAFPGyIEQQFxIQZBACECIARBAUcEQCAEQf4BcSEHQQAhAQNAIAAgAmogAyACQXhxaiIIKQMAIAJBA3RBMHGtiDwAACAAIAJBAXIiCWogCCkDACAJQQN0QThxrYg8AAAgAkECaiECIAFBAmoiASAHRw0ACwsgBgRAIAAgAmogAyACQXhxaikDACACQQN0QThxrYg8AAALIANBiAEgBGutNwPIASAAIARqIQAgBSAEayIFDQALCwsJACAAKAIAECoLrgEBAX8jAEGACGsiAyQAIAAgASACEAUgAyABQYAIaiACQYAIahAFIAAgACADEAYgAyABQYAQaiACQYAQahAFIAAgACADEAYgAyABQYAYaiACQYAYahAFIAAgACADEAYgAyABQYAgaiACQYAgahAFIAAgACADEAYgAyABQYAoaiACQYAoahAFIAAgACADEAYgAyABQYAwaiACQYAwahAFIAAgACADEAYgA0GACGokAAtVAQJ/A0AgACACaiABIAJBA3RqIgMoAgRBBHQgAygCAHI6AAAgACACQQFyIgNqIAEgA0EDdGoiAygCBEEEdCADKAIAcjoAACACQQJqIgJBgAFHDQALC98DAQt/A0AgACAIQQV0aiICIAEgCEENbGoiAy0AACIJNgIAIAIgCSADLQABQQh0QYA+cXIiCTYCACACIAMtAAFBBXYiBDYCBCACIAMtAAJBA3QgBHIiBDYCBCACIAMtAANBC3RBgDBxIARyIgQ2AgQgAiADLQADQQJ2Igo2AgggAiADLQAEQQZ0QcA/cSAKciIKNgIIIAIgAy0ABEEHdiIFNgIMIAIgAy0ABUEBdCAFciIFNgIMIAIgAy0ABkEJdEGAPHEgBXIiBTYCDCACIAMtAAZBBHYiBjYCECACIAMtAAdBBHQgBnIiBjYCECACIAMtAAhBDHRBgCBxIAZyIgY2AhAgAiADLQAIQQF2Igs2AhQgAiADLQAJQQd0QYA/cSALciILNgIUIAIgAy0ACUEGdiIHNgIYIAIgAy0ACkECdCAHciIHNgIYIAIgAy0AC0EKdEGAOHEgB3IiBzYCGCACIAMtAAtBA3YiDDYCHCADLQAMIQMgAkGAICAEazYCBCACQYAgIAlrNgIAIAJBgCAgCms2AgggAkGAICAFazYCDCACQYAgIAZrNgIQIAJBgCAgC2s2AhQgAkGAICAHazYCGCACQYAgIANBBXQgDHJrNgIcIAhBAWoiCEEgRw0ACwuwAgELfwNAIAEgBEEFdGoiAigCFCEKIAIoAgghCCACKAIcIQkgAigCGCEFIAIoAhAhBiACKAIMIQcgAigCBCELIAAgBEENbGoiA0GAICACKAIAayIMOgAAIANBgCAgC2siAkEDdjoAAiADQYAgIAdrIgdBAXY6AAUgA0GAICAGayIGQQR2OgAHIANBgCAgBWsiBUECdjoACiADQYAgIAlrIglBBXY6AAwgAyACQQV0IAxBCHZyOgABIANBgCAgCGsiCEECdCACQQt2cjoAAyADIAdBB3QgCEEGdnI6AAQgAyAGQQR0IAdBCXZyOgAGIANBgCAgCmsiAkEBdCAGQQx2cjoACCADIAVBBnQgAkEHdnI6AAkgAyAJQQN0IAVBCnZyOgALIARBAWoiBEEgRw0ACwuIAQEDfwNAIAAgA0EEdGoiBCABIANBBWxqIgJBAWotAABBCHRBgAZxIAItAAByNgIAIAQgAi0AAkEGdEHAB3EgAi0AAUECdnI2AgQgBCACLQADQQR0QfAHcSACLQACQQR2cjYCCCAEIAItAARBAnQgAi0AA0EGdnI2AgwgA0EBaiIDQcAARw0ACwt9AQN/A0AgACADQQVsaiIEIAEgA0EEdGoiAigCADoAACAEIAIoAgRBAnQgAigCAEEIdnI6AAEgBCACKAIIQQR0IAIoAgRBBnZyOgACIAQgAigCDEEGdCACKAIIQQR2cjoAAyAEIAIoAgxBAnY6AAQgA0EBaiIDQcAARw0ACwuKAQEFfwNAIAAgBEECdCIDagJ/IAEgA2ooAgAiB0H/AGpBB3VBgQhsQYCAgAFqQRZ2IgVBD3EhBiACIANqKAIABH8gBUEBakEPcUH/v4B8QQAgBkGAhGBsIAdqIgNBgOD/AUobIANqQQBKDQEaIAVBAWtBD3EFIAYLCzYCACAEQQFqIgRBgAJHDQALC1QBBH8DQCAAIARBAnQiA2ogASADaigCACIGQYCCcEYgAiADaigCAEEAR3EgBkGB/g9rQf+DYElyIgM2AgAgAyAFaiEFIARBAWoiBEGAAkcNAAsgBQttAQR/A0AgACAEQQJ0IgNqIQYgASADakH/v4B8QQAgAiADaigCACIDIANB/wBqQQd1QYEIbEGAgIABakEWdkEPcSIDQYCEYGxqIgVBgOD/AUobIAVqNgIAIAYgAzYCACAEQQFqIgRBgAJHDQALC0kBA38DQCAAIARBAnQiA2ohBSABIANqIAIgA2ooAgAiAyADQf8faiIDQYBAcWs2AgAgBSADQQ11NgIAIARBAWoiBEGAAkcNAAsLagEDfwNAIAAgA0ECdCIBaiICIAIoAgBBDXQ2AgAgACABQQRyaiICIAIoAgBBDXQ2AgAgACABQQhyaiICIAIoAgBBDXQ2AgAgACABQQxyaiIBIAEoAgBBDXQ2AgAgA0EEaiIDQYACRw0ACwtQAQJ/A0AgACAEQQJ0IgNqIAEgA2ooAgAgAiADaigCAGs2AgAgACADQQRyIgNqIAEgA2ooAgAgAiADaigCAGs2AgAgBEECaiIEQYACRw0ACws0AQJ/A0AgACACQQJ0aiIBIAEoAgAiASABQR91QYHA/wNxajYCACACQQFqIgJBgAJHDQALC3EBBH8DQCABIAJBA3RqIgMoAgQhBCAAIAJBBWxqIgVBgIAgIAMoAgBrIgM6AAAgBSADQQh2OgABIAVBgIAgIARrIgRBBHY6AAMgBSAEQQx2OgAEIAUgBEEEdCADQRB2cjoAAiACQQFqIgJBgAFHDQALC58BAQV/A0AgACAFQQN0aiIDIAEgBUEFbGoiAi0AACIENgIAIAMgBCACLQABQQh0ciIENgIAIAMgAi0AAkEQdEGAgDxxIARyIgQ2AgAgAyACLQACQQR2IgY2AgQgAyACLQADQQR0IAZyIgY2AgQgAi0ABCECIANBgIAgIARrNgIAIANBgIAgIAJBDHQgBnJrNgIEIAVBAWoiBUGAAUcNAAsLngEBBH8jAEHABWsiAyQAIANBDGoiBCABIAIQMyADQRBqQagFIAQQDyAEEBBBACECA0AgA0EQaiACQQVsaiIBLwAAIQQgACACQQN0aiIFQYCAICABLQADQQR0IAEtAAIiBkEEdnIgAS0ABEEMdHJrNgIEIAVBgIAgIAQgBkEQdEGAgDxxcms2AgAgAkEBaiICQYABRw0ACyADQcAFaiQACyIAIABB0AEQKyIANgIAIABFBEBB7wAQAAALIABB0AEQJBoLTQIBfgF/IAAoAgAiACAAKQPIASIBp0F4cWoiAiACKQMAQh8gAUIDhoaFNwMAIABCADcDyAEgACAAKQOAAUKAgICAgICAgIB/hTcDgAELTwECf0GgEigCACIBIABBB2pBeHEiAmohAAJAIAJBACAAIAFNGw0AIAA/AEEQdEsEQCAAEAJFDQELQaASIAA2AgAgAQ8LQZwYQTA2AgBBfwvYAgECfwJAIAFFDQAgAEEAOgAAIAAgAWoiAkEBa0EAOgAAIAFBA0kNACAAQQA6AAIgAEEAOgABIAJBA2tBADoAACACQQJrQQA6AAAgAUEHSQ0AIABBADoAAyACQQRrQQA6AAAgAUEJSQ0AIABBACAAa0EDcSIDaiICQQA2AgAgAiABIANrQXxxIgNqIgFBBGtBADYCACADQQlJDQAgAkEANgIIIAJBADYCBCABQQhrQQA2AgAgAUEMa0EANgIAIANBGUkNACACQQA2AhggAkEANgIUIAJBADYCECACQQA2AgwgAUEQa0EANgIAIAFBFGtBADYCACABQRhrQQA2AgAgAUEca0EANgIAIAMgAkEEcUEYciIDayIBQSBJDQAgAiADaiECA0AgAkIANwMYIAJCADcDECACQgA3AwggAkIANwMAIAJBIGohAiABQSBrIgFBH0sNAAsLIAAL5QwCLn4CfyAAKQPAASEXIAApA7gBIRggACkDsAEhDiAAKQOoASEIIAApA6ABIQ8gACkDmAEhCSAAKQOQASEQIAApA4gBIREgACkDgAEhCiAAKQN4IRIgACkDcCETIAApA2ghBCAAKQNgIRQgACkDWCEFIAApA1AhCyAAKQNIIRkgACkDQCENIAApAzghASAAKQMwIQIgACkDKCEHIAApAyAhGyAAKQMYIQwgACkDECEGIAApAwghAyAAKQMAIRUDQCAQIBiFIASFIA2FIAyFIh8gDyAShSALhSAHhSAVhSIaQgGJhSIcIBuFQhuJIhYgGiAOIBGFIBSFIAGFIAaFIh5CAYmFIhogBYVCCokiHSAJIBeFIBOFIBmFIBuFIiAgCCAKhSAFhSAChSADhSIhQgGJhSIFIAeFQiSJIgdCf4WDhSIiIAMgGoVCAYkiGyAEIB4gIEIBiYUiBIVCGYkiAyABICEgH0IBiYUiAYVCBokiH0J/hYOFIiGFIAQgDIVCHIkiDCAFIAuFQgOJIgsgGSAchUIUiSIeQn+Fg4UiI4UgASAGhUI+iSIGIBMgHIVCJ4kiEyAEIA2FQjeJIiBCf4WDhSIkhSAFIBWFIhUgL0EDdCIwQeAIaikDACABIBSFQiuJIhQgAiAahUIsiSICQn+Fg4WFIiWFIg1CAYkgASARhUIPiSIRIBYgBCAYhUI4iSIYQn+Fg4UiJiAEIBCFQhWJIhAgFSAXIByFQg6JIhdCf4WDhSInIAUgEoVCKYkiEiAGIAggGoVCAokiCEJ/hYOFIgQgCSAchUIIiSIJIBsgBSAPhUISiSIPQn+Fg4UiKCAKIBqFQi2JIgogDCABIA6FQj2JIg5Cf4WDhSIFhYWFhSIphSIZIAggICAGQn+Fg4UiAYVCDokiHCANIA8gCUJ/hYMgA4UiKiAXIBBCf4WDIBSFIgYgEyAIIBJCf4WDhSIrIA4gCkJ/hYMgC4UiLCAdIBggEUJ/hYOFIi2FhYWFIghCAYmFIg0gHiAKIAtCf4WDhSIKhUIsiSIaICUgByAWQn+FgyAYhSIWIB4gDEJ/hYMgDoUiHiAfIBtCf4WDIA+FIgsgFyACIBVCf4WDhSIuIAGFhYWFIhcgEiATQn+FgyAghSIYIAkgA0J/hYMgH4UiAyARIB1Cf4WDIAeFIh0gCiACIBAgFEJ/hYOFIgKFhYWFIglCAYmFIgGFIhVCf4WDhSEbIA0gGIVCAokiDiAXQgGJIAiFIgwgBYVCN4kiDyAGIClCAYkgCYUiBoVCPokiCUJ/hYOFIRcgASAihUIpiSIIIAkgDkJ/hYOFIRggCyAZhUIniSIQIA4gCEJ/hYOFIQ4gCCAQQn+FgyAPhSEIIBAgD0J/hYMgCYUhDyAEIAyFQjiJIhEgASAjhUIkiSISIBkgLoVCG4kiE0J/hYOFIQkgBiAthUIPiSIKIBMgEUJ/hYOFIRAgAyANhUIKiSIEIBEgCkJ/hYOFIREgCiAEQn+FgyAShSEKIBMgBCASQn+Fg4UhEiABICSFQhKJIhQgBiAshUIGiSILIAIgDYVCAYkiAkJ/hYOFIRMgFiAZhUIIiSIFIAIgFEJ/hYOFIQQgDCAohUIZiSIHIBQgBUJ/hYOFIRQgBSAHQn+FgyALhSEFIAIgByALQn+Fg4UhCyAGICuFQj2JIgIgGSAehUIUiSIHIAwgJ4VCHIkiA0J/hYOFIRkgDSAdhUItiSIWIAMgAkJ/hYOFIQ0gASAhhUIDiSIdIAIgFkJ/hYOFIQEgByAWIB1Cf4WDhSECIB0gB0J/hYMgA4UhByAMICaFQhWJIgMgFSAcQn+Fg4UhDCAGICqFQiuJIhYgHCADQn+Fg4UhBiAaIAMgFkJ/hYOFIQMgMEEIckHgCGopAwAgFiAaQn+Fg4UgFYUhFSAvQRZJITAgL0ECaiEvIDANAAsgACAXNwPAASAAIBg3A7gBIAAgDjcDsAEgACAINwOoASAAIA83A6ABIAAgCTcDmAEgACAQNwOQASAAIBE3A4gBIAAgCjcDgAEgACASNwN4IAAgEzcDcCAAIAQ3A2ggACAUNwNgIAAgBTcDWCAAIAs3A1AgACAZNwNIIAAgDTcDQCAAIAE3AzggACACNwMwIAAgBzcDKCAAIBs3AyAgACAMNwMYIAAgBjcDECAAIAM3AwggACAVNwMACz4AIAAQDSAAQYAIahANIABBgBBqEA0gAEGAGGoQDSAAQYAgahANIABBgChqEA0gAEGAMGoQDSAAQYA4ahANCz4AIAAQDCAAQYAIahAMIABBgBBqEAwgAEGAGGoQDCAAQYAgahAMIABBgChqEAwgAEGAMGoQDCAAQYA4ahAMCzYAIAAQByAAQYAIahAHIABBgBBqEAcgAEGAGGoQByAAQYAgahAHIABBgChqEAcgAEGAMGoQBwvHCAEHfyMAQaABayIIJAAgAiEFIwBB0AFrIgQkAAJAQcgBECsiAkUNACACQQRrLQAAQQNxRQ0AIAJByAEQJBoLIAggAjYCDAJAIAIEQCADQYgBTwRAA0AgAiACKQMAIAUpAACFNwMAIAIgAikDCCAFKQAIhTcDCCACIAIpAxAgBSkAEIU3AxAgAiACKQMYIAUpABiFNwMYIAIgAikDICAFKQAghTcDICACIAIpAyggBSkAKIU3AyggAiACKQMwIAUpADCFNwMwIAIgAikDOCAFKQA4hTcDOCACIAIpA0AgBSkAQIU3A0AgAiACKQNIIAUpAEiFNwNIIAIgAikDUCAFKQBQhTcDUCACIAIpA1ggBSkAWIU3A1ggAiACKQNgIAUpAGCFNwNgIAIgAikDaCAFKQBohTcDaCACIAIpA3AgBSkAcIU3A3AgAiACKQN4IAUpAHiFNwN4IAIgAikDgAEgBSkAgAGFNwOAASACECUgBUGIAWohBSADQYgBayIDQYcBSw0ACwsgBEGIARAkIQQCQCADRQ0AIANBBE8EQCADQXxxIQoDQCAEIAZqIAUgBmotAAA6AAAgBCAGQQFyIglqIAUgCWotAAA6AAAgBCAGQQJyIglqIAUgCWotAAA6AAAgBCAGQQNyIglqIAUgCWotAAA6AAAgBkEEaiEGIAdBBGoiByAKRw0ACwsgA0EDcSIKRQ0AQQAhBwNAIAQgBmogBSAGai0AADoAACAGQQFqIQYgB0EBaiIHIApHDQALCyADIARqQR86AAAgBCAELQCHAUGAAXI6AIcBIAIgAikDACAEKQMAhTcDACACIAIpAwggBCkDCIU3AwggAiACKQMQIAQpAxCFNwMQIAIgAikDGCAEKQMYhTcDGCACIAIpAyAgBCkDIIU3AyAgAiACKQMoIAQpAyiFNwMoIAIgAikDMCAEKQMwhTcDMCACIAIpAzggBCkDOIU3AzggAiACKQNAIAQpA0CFNwNAIAIgAikDSCAEKQNIhTcDSCACIAIpA1AgBCkDUIU3A1AgAiACKQNYIAQpA1iFNwNYIAIgAikDYCAEKQNghTcDYCACIAIpA2ggBCkDaIU3A2ggAiACKQNwIAQpA3CFNwNwIAIgAikDeCAEKQN4hTcDeCACIAIpA4ABIAQpA4ABhTcDgAEgBEHQAWokAAwBC0HvABAAAAsgAUGIAW4hBSAIKAIMIQYgAUGIAU8EQCAAIQIgBSEEA0AgBhAlQQAhAwNAIAIgA0EDdCIHaiAGIAdqKQMANwAAIANBAWoiA0ERRw0ACyACQYgBaiECIARBAWsiBA0ACwsgBUGIAWwiAiABRwRAIAEgAmshASAAIAJqIQAgBhAlQQAhAwNAIANBA3QiAiAIQRBqaiACIAZqKQMANwMAIANBAWoiA0ERRw0ACyAAIAhBEGpBASABIAFBAU0bECwLIAYQKiAIQaABaiQAC9ILAQd/AkAgAEUNACAAQQhrIgIgAEEEaygCACIBQXhxIgBqIQUCQCABQQFxDQAgAUEDcUUNASACIAIoAgAiAWsiAkGwGCgCAEkNASAAIAFqIQACQAJAQbQYKAIAIAJHBEAgAUH/AU0EQCABQQN2IQQgAigCDCIBIAIoAggiA0YEQEGgGEGgGCgCAEF+IAR3cTYCAAwFCyADIAE2AgwgASADNgIIDAQLIAIoAhghBiACIAIoAgwiAUcEQCACKAIIIgMgATYCDCABIAM2AggMAwsgAkEUaiIEKAIAIgNFBEAgAigCECIDRQ0CIAJBEGohBAsDQCAEIQcgAyIBQRRqIgQoAgAiAw0AIAFBEGohBCABKAIQIgMNAAsgB0EANgIADAILIAUoAgQiAUEDcUEDRw0CQagYIAA2AgAgBSABQX5xNgIEIAIgAEEBcjYCBCAFIAA2AgAPC0EAIQELIAZFDQACQCACKAIcIgNBAnRB0BpqIgQoAgAgAkYEQCAEIAE2AgAgAQ0BQaQYQaQYKAIAQX4gA3dxNgIADAILIAZBEEEUIAYoAhAgAkYbaiABNgIAIAFFDQELIAEgBjYCGCACKAIQIgMEQCABIAM2AhAgAyABNgIYCyACKAIUIgNFDQAgASADNgIUIAMgATYCGAsgAiAFTw0AIAUoAgQiAUEBcUUNAAJAAkACQAJAIAFBAnFFBEBBuBgoAgAgBUYEQEG4GCACNgIAQawYQawYKAIAIABqIgA2AgAgAiAAQQFyNgIEIAJBtBgoAgBHDQZBqBhBADYCAEG0GEEANgIADwtBtBgoAgAgBUYEQEG0GCACNgIAQagYQagYKAIAIABqIgA2AgAgAiAAQQFyNgIEIAAgAmogADYCAA8LIAFBeHEgAGohACABQf8BTQRAIAFBA3YhBCAFKAIMIgEgBSgCCCIDRgRAQaAYQaAYKAIAQX4gBHdxNgIADAULIAMgATYCDCABIAM2AggMBAsgBSgCGCEGIAUgBSgCDCIBRwRAQbAYKAIAGiAFKAIIIgMgATYCDCABIAM2AggMAwsgBUEUaiIEKAIAIgNFBEAgBSgCECIDRQ0CIAVBEGohBAsDQCAEIQcgAyIBQRRqIgQoAgAiAw0AIAFBEGohBCABKAIQIgMNAAsgB0EANgIADAILIAUgAUF+cTYCBCACIABBAXI2AgQgACACaiAANgIADAMLQQAhAQsgBkUNAAJAIAUoAhwiA0ECdEHQGmoiBCgCACAFRgRAIAQgATYCACABDQFBpBhBpBgoAgBBfiADd3E2AgAMAgsgBkEQQRQgBigCECAFRhtqIAE2AgAgAUUNAQsgASAGNgIYIAUoAhAiAwRAIAEgAzYCECADIAE2AhgLIAUoAhQiA0UNACABIAM2AhQgAyABNgIYCyACIABBAXI2AgQgACACaiAANgIAIAJBtBgoAgBHDQBBqBggADYCAA8LIABB/wFNBEAgAEF4cUHIGGohAQJ/QaAYKAIAIgNBASAAQQN2dCIAcUUEQEGgGCAAIANyNgIAIAEMAQsgASgCCAshACABIAI2AgggACACNgIMIAIgATYCDCACIAA2AggPC0EfIQMgAEH///8HTQRAIABBJiAAQQh2ZyIBa3ZBAXEgAUEBdGtBPmohAwsgAiADNgIcIAJCADcCECADQQJ0QdAaaiEBAkACQAJAQaQYKAIAIgRBASADdCIHcUUEQEGkGCAEIAdyNgIAIAEgAjYCACACIAE2AhgMAQsgAEEZIANBAXZrQQAgA0EfRxt0IQMgASgCACEBA0AgASIEKAIEQXhxIABGDQIgA0EddiEBIANBAXQhAyAEIAFBBHFqIgdBEGooAgAiAQ0ACyAHIAI2AhAgAiAENgIYCyACIAI2AgwgAiACNgIIDAELIAQoAggiACACNgIMIAQgAjYCCCACQQA2AhggAiAENgIMIAIgADYCCAtBwBhBwBgoAgBBAWsiAEF/IAAbNgIACwucKAELfyMAQRBrIgskAAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkAgAEH0AU0EQEGgGCgCACIGQRAgAEELakF4cSAAQQtJGyIFQQN2IgB2IgFBA3EEQAJAIAFBf3NBAXEgAGoiAkEDdCIBQcgYaiIAIAFB0BhqKAIAIgEoAggiBEYEQEGgGCAGQX4gAndxNgIADAELIAQgADYCDCAAIAQ2AggLIAFBCGohACABIAJBA3QiAkEDcjYCBCABIAJqIgEgASgCBEEBcjYCBAwPCyAFQagYKAIAIgdNDQEgAQRAAkBBAiAAdCICQQAgAmtyIAEgAHRxIgBBACAAa3FoIgFBA3QiAEHIGGoiAiAAQdAYaigCACIAKAIIIgRGBEBBoBggBkF+IAF3cSIGNgIADAELIAQgAjYCDCACIAQ2AggLIAAgBUEDcjYCBCAAIAVqIgggAUEDdCIBIAVrIgRBAXI2AgQgACABaiAENgIAIAcEQCAHQXhxQcgYaiEBQbQYKAIAIQICfyAGQQEgB0EDdnQiA3FFBEBBoBggAyAGcjYCACABDAELIAEoAggLIQMgASACNgIIIAMgAjYCDCACIAE2AgwgAiADNgIICyAAQQhqIQBBtBggCDYCAEGoGCAENgIADA8LQaQYKAIAIgpFDQEgCkEAIAprcWhBAnRB0BpqKAIAIgIoAgRBeHEgBWshAyACIQEDQAJAIAEoAhAiAEUEQCABKAIUIgBFDQELIAAoAgRBeHEgBWsiASADIAEgA0kiARshAyAAIAIgARshAiAAIQEMAQsLIAIoAhghCSACIAIoAgwiBEcEQEGwGCgCABogAigCCCIAIAQ2AgwgBCAANgIIDA4LIAJBFGoiASgCACIARQRAIAIoAhAiAEUNAyACQRBqIQELA0AgASEIIAAiBEEUaiIBKAIAIgANACAEQRBqIQEgBCgCECIADQALIAhBADYCAAwNC0F/IQUgAEG/f0sNACAAQQtqIgBBeHEhBUGkGCgCACIIRQ0AQQAgBWshAwJAAkACQAJ/QQAgBUGAAkkNABpBHyAFQf///wdLDQAaIAVBJiAAQQh2ZyIAa3ZBAXEgAEEBdGtBPmoLIgdBAnRB0BpqKAIAIgFFBEBBACEADAELQQAhACAFQRkgB0EBdmtBACAHQR9HG3QhAgNAAkAgASgCBEF4cSAFayIGIANPDQAgASEEIAYiAw0AQQAhAyABIQAMAwsgACABKAIUIgYgBiABIAJBHXZBBHFqKAIQIgFGGyAAIAYbIQAgAkEBdCECIAENAAsLIAAgBHJFBEBBACEEQQIgB3QiAEEAIABrciAIcSIARQ0DIABBACAAa3FoQQJ0QdAaaigCACEACyAARQ0BCwNAIAAoAgRBeHEgBWsiAiADSSEBIAIgAyABGyEDIAAgBCABGyEEIAAoAhAiAQR/IAEFIAAoAhQLIgANAAsLIARFDQAgA0GoGCgCACAFa08NACAEKAIYIQcgBCAEKAIMIgJHBEBBsBgoAgAaIAQoAggiACACNgIMIAIgADYCCAwMCyAEQRRqIgEoAgAiAEUEQCAEKAIQIgBFDQMgBEEQaiEBCwNAIAEhBiAAIgJBFGoiASgCACIADQAgAkEQaiEBIAIoAhAiAA0ACyAGQQA2AgAMCwsgBUGoGCgCACIETQRAQbQYKAIAIQACQCAEIAVrIgFBEE8EQCAAIAVqIgIgAUEBcjYCBCAAIARqIAE2AgAgACAFQQNyNgIEDAELIAAgBEEDcjYCBCAAIARqIgEgASgCBEEBcjYCBEEAIQJBACEBC0GoGCABNgIAQbQYIAI2AgAgAEEIaiEADA0LIAVBrBgoAgAiAkkEQEGsGCACIAVrIgE2AgBBuBhBuBgoAgAiACAFaiICNgIAIAIgAUEBcjYCBCAAIAVBA3I2AgQgAEEIaiEADA0LQQAhACAFQS9qIgMCf0H4GygCAARAQYAcKAIADAELQYQcQn83AgBB/BtCgKCAgICABDcCAEH4GyALQQxqQXBxQdiq1aoFczYCAEGMHEEANgIAQdwbQQA2AgBBgCALIgFqIgZBACABayIIcSIBIAVNDQxB2BsoAgAiBARAQdAbKAIAIgcgAWoiCSAHTQ0NIAQgCUkNDQsCQEHcGy0AAEEEcUUEQAJAAkACQAJAQbgYKAIAIgQEQEHgGyEAA0AgBCAAKAIAIgdPBEAgByAAKAIEaiAESw0DCyAAKAIIIgANAAsLQQAQIyICQX9GDQMgASEGQfwbKAIAIgBBAWsiBCACcQRAIAEgAmsgAiAEakEAIABrcWohBgsgBSAGTw0DQdgbKAIAIgAEQEHQGygCACIEIAZqIgggBE0NBCAAIAhJDQQLIAYQIyIAIAJHDQEMBQsgBiACayAIcSIGECMiAiAAKAIAIAAoAgRqRg0BIAIhAAsgAEF/Rg0BIAVBMGogBk0EQCAAIQIMBAtBgBwoAgAiAiADIAZrakEAIAJrcSICECNBf0YNASACIAZqIQYgACECDAMLIAJBf0cNAgtB3BtB3BsoAgBBBHI2AgALIAEQIyECQQAQIyEAIAJBf0YNBSAAQX9GDQUgACACTQ0FIAAgAmsiBiAFQShqTQ0FC0HQG0HQGygCACAGaiIANgIAQdQbKAIAIABJBEBB1BsgADYCAAsCQEG4GCgCACIDBEBB4BshAANAIAIgACgCACIBIAAoAgQiBGpGDQIgACgCCCIADQALDAQLQbAYKAIAIgBBACAAIAJNG0UEQEGwGCACNgIAC0EAIQBB5BsgBjYCAEHgGyACNgIAQcAYQX82AgBBxBhB+BsoAgA2AgBB7BtBADYCAANAIABBA3QiAUHQGGogAUHIGGoiBDYCACABQdQYaiAENgIAIABBAWoiAEEgRw0AC0GsGCAGQShrIgBBeCACa0EHcUEAIAJBCGpBB3EbIgFrIgQ2AgBBuBggASACaiIBNgIAIAEgBEEBcjYCBCAAIAJqQSg2AgRBvBhBiBwoAgA2AgAMBAsgAiADTQ0CIAEgA0sNAiAAKAIMQQhxDQIgACAEIAZqNgIEQbgYIANBeCADa0EHcUEAIANBCGpBB3EbIgBqIgE2AgBBrBhBrBgoAgAgBmoiAiAAayIANgIAIAEgAEEBcjYCBCACIANqQSg2AgRBvBhBiBwoAgA2AgAMAwtBACEEDAoLQQAhAgwIC0GwGCgCACACSwRAQbAYIAI2AgALIAIgBmohAUHgGyEAAkACQAJAA0AgASAAKAIARwRAIAAoAggiAA0BDAILCyAALQAMQQhxRQ0BC0HgGyEAA0AgAyAAKAIAIgFPBEAgASAAKAIEaiIEIANLDQMLIAAoAgghAAwACwALIAAgAjYCACAAIAAoAgQgBmo2AgQgAkF4IAJrQQdxQQAgAkEIakEHcRtqIgcgBUEDcjYCBCABQXggAWtBB3FBACABQQhqQQdxG2oiBiAFIAdqIgVrIQAgAyAGRgRAQbgYIAU2AgBBrBhBrBgoAgAgAGoiADYCACAFIABBAXI2AgQMCAtBtBgoAgAgBkYEQEG0GCAFNgIAQagYQagYKAIAIABqIgA2AgAgBSAAQQFyNgIEIAAgBWogADYCAAwICyAGKAIEIgNBA3FBAUcNBiADQXhxIQkgA0H/AU0EQCAGKAIMIgEgBigCCCICRgRAQaAYQaAYKAIAQX4gA0EDdndxNgIADAcLIAIgATYCDCABIAI2AggMBgsgBigCGCEIIAYgBigCDCICRwRAIAYoAggiASACNgIMIAIgATYCCAwFCyAGQRRqIgEoAgAiA0UEQCAGKAIQIgNFDQQgBkEQaiEBCwNAIAEhBCADIgJBFGoiASgCACIDDQAgAkEQaiEBIAIoAhAiAw0ACyAEQQA2AgAMBAtBrBggBkEoayIAQXggAmtBB3FBACACQQhqQQdxGyIBayIINgIAQbgYIAEgAmoiATYCACABIAhBAXI2AgQgACACakEoNgIEQbwYQYgcKAIANgIAIAMgBEEnIARrQQdxQQAgBEEna0EHcRtqQS9rIgAgACADQRBqSRsiAUEbNgIEIAFB6BspAgA3AhAgAUHgGykCADcCCEHoGyABQQhqNgIAQeQbIAY2AgBB4BsgAjYCAEHsG0EANgIAIAFBGGohAANAIABBBzYCBCAAQQhqIQIgAEEEaiEAIAIgBEkNAAsgASADRg0AIAEgASgCBEF+cTYCBCADIAEgA2siAkEBcjYCBCABIAI2AgAgAkH/AU0EQCACQXhxQcgYaiEAAn9BoBgoAgAiAUEBIAJBA3Z0IgJxRQRAQaAYIAEgAnI2AgAgAAwBCyAAKAIICyEBIAAgAzYCCCABIAM2AgwgAyAANgIMIAMgATYCCAwBC0EfIQAgAkH///8HTQRAIAJBJiACQQh2ZyIAa3ZBAXEgAEEBdGtBPmohAAsgAyAANgIcIANCADcCECAAQQJ0QdAaaiEBAkACQEGkGCgCACIEQQEgAHQiBnFFBEBBpBggBCAGcjYCACABIAM2AgAMAQsgAkEZIABBAXZrQQAgAEEfRxt0IQAgASgCACEEA0AgBCIBKAIEQXhxIAJGDQIgAEEddiEEIABBAXQhACABIARBBHFqIgYoAhAiBA0ACyAGIAM2AhALIAMgATYCGCADIAM2AgwgAyADNgIIDAELIAEoAggiACADNgIMIAEgAzYCCCADQQA2AhggAyABNgIMIAMgADYCCAtBrBgoAgAiACAFTQ0AQawYIAAgBWsiATYCAEG4GEG4GCgCACIAIAVqIgI2AgAgAiABQQFyNgIEIAAgBUEDcjYCBCAAQQhqIQAMCAtBnBhBMDYCAEEAIQAMBwtBACECCyAIRQ0AAkAgBigCHCIBQQJ0QdAaaiIEKAIAIAZGBEAgBCACNgIAIAINAUGkGEGkGCgCAEF+IAF3cTYCAAwCCyAIQRBBFCAIKAIQIAZGG2ogAjYCACACRQ0BCyACIAg2AhggBigCECIBBEAgAiABNgIQIAEgAjYCGAsgBigCFCIBRQ0AIAIgATYCFCABIAI2AhgLIAAgCWohACAGIAlqIgYoAgQhAwsgBiADQX5xNgIEIAUgAEEBcjYCBCAAIAVqIAA2AgAgAEH/AU0EQCAAQXhxQcgYaiEBAn9BoBgoAgAiAkEBIABBA3Z0IgBxRQRAQaAYIAAgAnI2AgAgAQwBCyABKAIICyEAIAEgBTYCCCAAIAU2AgwgBSABNgIMIAUgADYCCAwBC0EfIQMgAEH///8HTQRAIABBJiAAQQh2ZyIBa3ZBAXEgAUEBdGtBPmohAwsgBSADNgIcIAVCADcCECADQQJ0QdAaaiEBAkACQEGkGCgCACICQQEgA3QiBHFFBEBBpBggAiAEcjYCACABIAU2AgAMAQsgAEEZIANBAXZrQQAgA0EfRxt0IQMgASgCACECA0AgAiIBKAIEQXhxIABGDQIgA0EddiECIANBAXQhAyABIAJBBHFqIgQoAhAiAg0ACyAEIAU2AhALIAUgATYCGCAFIAU2AgwgBSAFNgIIDAELIAEoAggiACAFNgIMIAEgBTYCCCAFQQA2AhggBSABNgIMIAUgADYCCAsgB0EIaiEADAILAkAgB0UNAAJAIAQoAhwiAEECdEHQGmoiASgCACAERgRAIAEgAjYCACACDQFBpBggCEF+IAB3cSIINgIADAILIAdBEEEUIAcoAhAgBEYbaiACNgIAIAJFDQELIAIgBzYCGCAEKAIQIgAEQCACIAA2AhAgACACNgIYCyAEKAIUIgBFDQAgAiAANgIUIAAgAjYCGAsCQCADQQ9NBEAgBCADIAVqIgBBA3I2AgQgACAEaiIAIAAoAgRBAXI2AgQMAQsgBCAFQQNyNgIEIAQgBWoiAiADQQFyNgIEIAIgA2ogAzYCACADQf8BTQRAIANBeHFByBhqIQACf0GgGCgCACIBQQEgA0EDdnQiA3FFBEBBoBggASADcjYCACAADAELIAAoAggLIQEgACACNgIIIAEgAjYCDCACIAA2AgwgAiABNgIIDAELQR8hACADQf///wdNBEAgA0EmIANBCHZnIgBrdkEBcSAAQQF0a0E+aiEACyACIAA2AhwgAkIANwIQIABBAnRB0BpqIQECQAJAIAhBASAAdCIGcUUEQEGkGCAGIAhyNgIAIAEgAjYCAAwBCyADQRkgAEEBdmtBACAAQR9HG3QhACABKAIAIQUDQCAFIgEoAgRBeHEgA0YNAiAAQR12IQYgAEEBdCEAIAEgBkEEcWoiBigCECIFDQALIAYgAjYCEAsgAiABNgIYIAIgAjYCDCACIAI2AggMAQsgASgCCCIAIAI2AgwgASACNgIIIAJBADYCGCACIAE2AgwgAiAANgIICyAEQQhqIQAMAQsCQCAJRQ0AAkAgAigCHCIAQQJ0QdAaaiIBKAIAIAJGBEAgASAENgIAIAQNAUGkGCAKQX4gAHdxNgIADAILIAlBEEEUIAkoAhAgAkYbaiAENgIAIARFDQELIAQgCTYCGCACKAIQIgAEQCAEIAA2AhAgACAENgIYCyACKAIUIgBFDQAgBCAANgIUIAAgBDYCGAsCQCADQQ9NBEAgAiADIAVqIgBBA3I2AgQgACACaiIAIAAoAgRBAXI2AgQMAQsgAiAFQQNyNgIEIAIgBWoiBCADQQFyNgIEIAMgBGogAzYCACAHBEAgB0F4cUHIGGohAEG0GCgCACEBAn9BASAHQQN2dCIFIAZxRQRAQaAYIAUgBnI2AgAgAAwBCyAAKAIICyEGIAAgATYCCCAGIAE2AgwgASAANgIMIAEgBjYCCAtBtBggBDYCAEGoGCADNgIACyACQQhqIQALIAtBEGokACAAC/wDAQJ/IAJBgARPBEAgACABIAIQAw8LIAAgAmohAwJAIAAgAXNBA3FFBEACQCAAQQNxRQRAIAAhAgwBCyACRQRAIAAhAgwBCyAAIQIDQCACIAEtAAA6AAAgAUEBaiEBIAJBAWoiAkEDcUUNASACIANJDQALCwJAIANBfHEiAEHAAEkNACACIABBQGoiBEsNAANAIAIgASgCADYCACACIAEoAgQ2AgQgAiABKAIINgIIIAIgASgCDDYCDCACIAEoAhA2AhAgAiABKAIUNgIUIAIgASgCGDYCGCACIAEoAhw2AhwgAiABKAIgNgIgIAIgASgCJDYCJCACIAEoAig2AiggAiABKAIsNgIsIAIgASgCMDYCMCACIAEoAjQ2AjQgAiABKAI4NgI4IAIgASgCPDYCPCABQUBrIQEgAkFAayICIARNDQALCyAAIAJNDQEDQCACIAEoAgA2AgAgAUEEaiEBIAJBBGoiAiAASQ0ACwwBCyADQQRJBEAgACECDAELIAAgA0EEayIESwRAIAAhAgwBCyAAIQIDQCACIAEtAAA6AAAgAiABLQABOgABIAIgAS0AAjoAAiACIAEtAAM6AAMgAUEEaiEBIAJBBGoiAiAETQ0ACwsgAiADSQRAA0AgAiABLQAAOgAAIAFBAWohASACQQFqIgIgA0cNAAsLC3oAIAAgASACEAUgAEGACGogASACQYAIahAFIABBgBBqIAEgAkGAEGoQBSAAQYAYaiABIAJBgBhqEAUgAEGAIGogASACQYAgahAFIABBgChqIAEgAkGAKGoQBSAAQYAwaiABIAJBgDBqEAUgAEGAOGogASACQYA4ahAFCz4AIAAQByAAQYAIahAHIABBgBBqEAcgAEGAGGoQByAAQYAgahAHIABBgChqEAcgAEGAMGoQByAAQYA4ahAHCz4AIAAQHSAAQYAIahAdIABBgBBqEB0gAEGAGGoQHSAAQYAgahAdIABBgChqEB0gAEGAMGoQHSAAQYA4ahAdC4ABACAAIAEgAhARIABBgAhqIAFBgDhqIAIQESAAQYAQaiABQYDwAGogAhARIABBgBhqIAFBgKgBaiACEBEgAEGAIGogAUGA4AFqIAIQESAAQYAoaiABQYCYAmogAhARIABBgDBqIAFBgNACaiACEBEgAEGAOGogAUGAiANqIAIQEQv+BQAgACABQQAQBCAAQYAIaiABQQEQBCAAQYAQaiABQQIQBCAAQYAYaiABQQMQBCAAQYAgaiABQQQQBCAAQYAoaiABQQUQBCAAQYAwaiABQQYQBCAAQYA4aiABQYACEAQgAEGAQGsgAUGBAhAEIABBgMgAaiABQYICEAQgAEGA0ABqIAFBgwIQBCAAQYDYAGogAUGEAhAEIABBgOAAaiABQYUCEAQgAEGA6ABqIAFBhgIQBCAAQYDwAGogAUGABBAEIABBgPgAaiABQYEEEAQgAEGAgAFqIAFBggQQBCAAQYCIAWogAUGDBBAEIABBgJABaiABQYQEEAQgAEGAmAFqIAFBhQQQBCAAQYCgAWogAUGGBBAEIABBgKgBaiABQYAGEAQgAEGAsAFqIAFBgQYQBCAAQYC4AWogAUGCBhAEIABBgMABaiABQYMGEAQgAEGAyAFqIAFBhAYQBCAAQYDQAWogAUGFBhAEIABBgNgBaiABQYYGEAQgAEGA4AFqIAFBgAgQBCAAQYDoAWogAUGBCBAEIABBgPABaiABQYIIEAQgAEGA+AFqIAFBgwgQBCAAQYCAAmogAUGECBAEIABBgIgCaiABQYUIEAQgAEGAkAJqIAFBhggQBCAAQYCYAmogAUGAChAEIABBgKACaiABQYEKEAQgAEGAqAJqIAFBggoQBCAAQYCwAmogAUGDChAEIABBgLgCaiABQYQKEAQgAEGAwAJqIAFBhQoQBCAAQYDIAmogAUGGChAEIABBgNACaiABQYAMEAQgAEGA2AJqIAFBgQwQBCAAQYDgAmogAUGCDBAEIABBgOgCaiABQYMMEAQgAEGA8AJqIAFBhAwQBCAAQYD4AmogAUGFDBAEIABBgIADaiABQYYMEAQgAEGAiANqIAFBgA4QBCAAQYCQA2ogAUGBDhAEIABBgJgDaiABQYIOEAQgAEGAoANqIAFBgw4QBCAAQYCoA2ogAUGEDhAEIABBgLADaiABQYUOEAQgAEGAuANqIAFBhg4QBAsDAAELNwEBfyMAQRBrIgMkACADIAI7AA4gABAhIAAgAUHAABAOIAAgA0EOakECEA4gABAiIANBEGokAAtqACAAIAEQEiAAQYABaiABQYAIahASIABBgAJqIAFBgBBqEBIgAEGAA2ogAUGAGGoQEiAAQYAEaiABQYAgahASIABBgAVqIAFBgChqEBIgAEGABmogAUGAMGoQEiAAQYAHaiABQYA4ahASC8kCAgd/A34gAigCACEDAn9BACABRQ0AGiABrSEMA0AgCqciAiAKIAMpA8gBIgtaDQEaIAAgAmogAyAKIAt9IgunQagBakF4cWopAwAgC0IDhog8AAAgCkIBfCIKIAxSDQALIAELIQIgAyADKQPIASACrX03A8gBIAEgAmsiBQRAIAAgAmohAANAIAMQJUGoASAFIAVBqAFPGyIEQQFxIQZBACECIARBAUcEQCAEQf4BcSEHQQAhAQNAIAAgAmogAyACQXhxaiIIKQMAIAJBA3RBMHGtiDwAACAAIAJBAXIiCWogCCkDACAJQQN0QThxrYg8AAAgAkECaiECIAFBAmoiASAHRw0ACwsgBgRAIAAgAmogAyACQXhxaikDACACQQN0QThxrYg8AAALIANBqAEgBGutNwPIASAAIARqIQAgBSAEayIFDQALCwtsAQF/QQEhAgJAIAAgARALDQAgAEGACGogARALDQAgAEGAEGogARALDQAgAEGAGGogARALDQAgAEGAIGogARALDQAgAEGAKGogARALDQAgAEGAMGogARALDQAgAEGAOGogARALQQBHIQILIAILlgEAIAAgASACEBwgAEGACGogAUGACGogAkGACGoQHCAAQYAQaiABQYAQaiACQYAQahAcIABBgBhqIAFBgBhqIAJBgBhqEBwgAEGAIGogAUGAIGogAkGAIGoQHCAAQYAoaiABQYAoaiACQYAoahAcIABBgDBqIAFBgDBqIAJBgDBqEBwgAEGAOGogAUGAOGogAkGAOGoQHAuWAQAgACABIAIQBiAAQYAIaiABQYAIaiACQYAIahAGIABBgBBqIAFBgBBqIAJBgBBqEAYgAEGAGGogAUGAGGogAkGAGGoQBiAAQYAgaiABQYAgaiACQYAgahAGIABBgChqIAFBgChqIAJBgChqEAYgAEGAMGogAUGAMGogAkGAMGoQBiAAQYA4aiABQYA4aiACQYA4ahAGC24BAX9BASEBAkAgAEGI/x8QCw0AIABBgAhqQYj/HxALDQAgAEGAEGpBiP8fEAsNACAAQYAYakGI/x8QCw0AIABBgCBqQYj/HxALDQAgAEGAKGpBiP8fEAsNACAAQYAwakGI/x8QC0EARyEBCyABC4EDAgd+AX8gAa0iBiAAKQPIASIEIAOtIgh8WARAA0BBACELQgAhBSABIASnRwRAA0AgACAEIAV8IgSnQXhxaiILIAspAwAgAiAFp2oxAAAgBEIDhoaFNwMAIAVCAXwiBSABIAApA8gBIgSnayILrVQNAAsLIABCADcDyAEgABAlIAIgC2ohAiAAKQPIASIEIAMgC2siA60iCHwgBloNAAsLIAAgAwR+IAOtIgRCAYMhBkIAIQUgA0EBRwRAIARC/v///w+DIQlCACEEA0AgACAAKQPIASAFfCIHp0F4cWoiASABKQMAIAIgBadqMQAAIAdCA4aGhTcDACAAIAVCAYQiByAAKQPIAXwiCqdBeHFqIgEgASkDACACIAenajEAACAKQgOGhoU3AwAgBUICfCEFIARCAnwiBCAJUg0ACwsgBqcEQCAAIAApA8gBIAV8IgSnQXhxaiIBIAEpAwAgAiAFp2oxAAAgBEIDhoaFNwMACyAAKQPIAQUgBAsgCHw3A8gBC9IBAgN/AX4jAEGgAWsiAyQAIANBDGoiAhAhIAIgAUEgEA4gAhAiIANBEGpBiAEgAhAPIAMpAxAhBSAAQYAIECQhBEHEASEAQQghAQNAIAFBiAFPBEAgA0EQakGIASADQQxqEA9BACEBCyADQRBqIAFqIQIgAUEBaiEBIAAgAi0AACICSQ0AIAQgAEECdGogBCACQQJ0aiICKAIANgIAIAJBASAFp0EBdEECcWs2AgAgBUIBiCEFIABBAWoiAEGAAkcNAAsgA0EMahAQIANBoAFqJAALEAAgACgCAEGoASABIAIQOgvqEAELfyACQQJqIQYgAi8BACECIAMhBSMAQbDJBWsiBCQAQX8hDAJAIAJB8yNHDQAgBEGQwQVqIgIgBS0AADoAACACIAUtAAE6AAEgAiAFLQACOgACIAIgBS0AAzoAAyACIAUtAAQ6AAQgAiAFLQAFOgAFIAIgBS0ABjoABiACIAUtAAc6AAcgAiAFLQAIOgAIIAIgBS0ACToACSACIAUtAAo6AAogAiAFLQALOgALIAIgBS0ADDoADCACIAUtAA06AA0gAiAFLQAOOgAOIAIgBS0ADzoADyACIAUtABA6ABAgAiAFLQAROgARIAIgBS0AEjoAEiACIAUtABM6ABMgAiAFLQAUOgAUIAIgBS0AFToAFSACIAUtABY6ABYgAiAFLQAXOgAXIAIgBS0AGDoAGCACIAUtABk6ABkgAiAFLQAaOgAaIAIgBS0AGzoAGyACIAUtABw6ABwgAiAFLQAdOgAdIAIgBS0AHjoAHiACIAUtAB86AB8gBEGQgAFqIgIgBUEgahAVIAJBgAhqIAVB4AJqEBUgAkGAEGogBUGgBWoQFSACQYAYaiAFQeAHahAVIAJBgCBqIAVBoApqEBUgAkGAKGogBUHgDGoQFSACQYAwaiAFQaAPahAVIAJBgDhqIAVB4BFqEBUgBEEQaiEHIARBsMAFaiICIAYtAAA6AAAgAiAGLQABOgABIAIgBi0AAjoAAiACIAYtAAM6AAMgAiAGLQAEOgAEIAIgBi0ABToABSACIAYtAAY6AAYgAiAGLQAHOgAHIAIgBi0ACDoACCACIAYtAAk6AAkgAiAGLQAKOgAKIAIgBi0ACzoACyACIAYtAAw6AAwgAiAGLQANOgANIAIgBi0ADjoADiACIAYtAA86AA8gAiAGLQAQOgAQIAIgBi0AEToAESACIAYtABI6ABIgAiAGLQATOgATIAIgBi0AFDoAFCACIAYtABU6ABUgAiAGLQAWOgAWIAIgBi0AFzoAFyACIAYtABg6ABggAiAGLQAZOgAZIAIgBi0AGjoAGiACIAYtABs6ABsgAiAGLQAcOgAcIAIgBi0AHToAHSACIAYtAB46AB4gAiAGLQAfOgAfIARBkMABaiICIAZBIGoQHyACQYAIaiAGQaAFahAfIAJBgBBqIAZBoApqEB8gAkGAGGogBkGgD2oQHyACQYAgaiAGQaAUahAfIAJBgChqIAZBoBlqEB8gAkGAMGogBkGgHmoQHyAGQaAjaiEJQQEhC0EAIQMCQANAIAMhAiAHIAhBCnRqQYAIECQhDSAIIAlqIg4tAEsiA0HLAEsNASACIANLDQECQCACIANPDQAgDSACIAlqLQAAQQJ0akEBNgIAIAJBAWoiCiAOLQBLIgNPDQADQCAJIApqIgMtAAAhBiACIApJBEAgBiADQQFrLQAATQ0ECyANIAZBAnRqQQE2AgAgCkEBaiIKIA4tAEsiA0kNAAsLIAhBAWoiCEEIRw0AC0EAIQsgA0HLAE8NAANAIAMgCWotAABFBEAgA0EBaiIDQcsARw0BDAILC0EBIQsLIAsNACAEQZDAAWoQOQ0AIARB0MAFaiIDQSAgBUGgFBApIARBDGoiBRAhIAUgA0EgEA4gBSAAIAEQDiAFECIgA0HAACAFEA8gBRAQIARBkLgFaiICIARBsMAFahA7IARBkPgBaiIBIARBkMEFahAxIARBkMABaiIAECggBEGQwABqIgcgASAAEDAgAhAHIARBkIABaiIAEBsgAEGACGoQGyAAQYAQahAbIABBgBhqEBsgAEGAIGoQGyAAQYAoahAbIABBgDBqEBsgAEGAOGoQGyAAEC4gACACIAAQLSAHIAcgABA3IAcQJyAHECYgBxAvIAcgByAEQRBqIgEQFyAHQYAIaiIAIAAgAUGACGoQFyAHQYAQaiIAIAAgAUGAEGoQFyAHQYAYaiIAIAAgAUGAGGoQFyAHQYAgaiIAIAAgAUGAIGoQFyAHQYAoaiIAIAAgAUGAKGoQFyAHQYAwaiIAIAAgAUGAMGoQFyAHQYA4aiIAIAAgAUGAOGoQFyAEQbDBBWoiACAHEDQgBRAhIAUgA0HAABAOIAUgAEGACBAOIAUQIiAEQZDABWpBICAFEA8gBRAQIAQtALDABSAELQCQwAVHDQAgBC0AscAFIAQtAJHABUcNACAELQCywAUgBC0AksAFRw0AIAQtALPABSAELQCTwAVHDQAgBC0AtMAFIAQtAJTABUcNACAELQC1wAUgBC0AlcAFRw0AIAQtALbABSAELQCWwAVHDQAgBC0At8AFIAQtAJfABUcNACAELQC4wAUgBC0AmMAFRw0AIAQtALnABSAELQCZwAVHDQAgBC0AusAFIAQtAJrABUcNACAELQC7wAUgBC0Am8AFRw0AIAQtALzABSAELQCcwAVHDQAgBC0AvcAFIAQtAJ3ABUcNACAELQC+wAUgBC0AnsAFRw0AIAQtAL/ABSAELQCfwAVHDQAgBC0AwMAFIAQtAKDABUcNACAELQDBwAUgBC0AocAFRw0AIAQtAMLABSAELQCiwAVHDQAgBC0Aw8AFIAQtAKPABUcNACAELQDEwAUgBC0ApMAFRw0AIAQtAMXABSAELQClwAVHDQAgBC0AxsAFIAQtAKbABUcNACAELQDHwAUgBC0Ap8AFRw0AIAQtAMjABSAELQCowAVHDQAgBC0AycAFIAQtAKnABUcNACAELQDKwAUgBC0AqsAFRw0AIAQtAMvABSAELQCrwAVHDQAgBC0AzMAFIAQtAKzABUcNACAELQDNwAUgBC0ArcAFRw0AIAQtAM7ABSAELQCuwAVHDQBBf0EAIAQtAM/ABSAELQCvwAVHGyEMCyAEQbDJBWokACAMC4sdARN/IwBBEGsiDiQAIABBAmohBSMAQfCxB2siByQAIAdBkLAHaiIGIgQgAy0AADoAACAEIAMtAAE6AAEgBCADLQACOgACIAQgAy0AAzoAAyAEIAMtAAQ6AAQgBCADLQAFOgAFIAQgAy0ABjoABiAEIAMtAAc6AAcgBCADLQAIOgAIIAQgAy0ACToACSAEIAMtAAo6AAogBCADLQALOgALIAQgAy0ADDoADCAEIAMtAA06AA0gBCADLQAOOgAOIAQgAy0ADzoADyAEIAMtABA6ABAgBCADLQAROgARIAQgAy0AEjoAEiAEIAMtABM6ABMgBCADLQAUOgAUIAQgAy0AFToAFSAEIAMtABY6ABYgBCADLQAXOgAXIAQgAy0AGDoAGCAEIAMtABk6ABkgBCADLQAaOgAaIAQgAy0AGzoAGyAEIAMtABw6ABwgBCADLQAdOgAdIAQgAy0AHjoAHiAEIAMtAB86AB8gB0HQsAdqIgkiBCADLQAgOgAAIAQgAy0AIToAASAEIAMtACI6AAIgBCADLQAjOgADIAQgAy0AJDoABCAEIAMtACU6AAUgBCADLQAmOgAGIAQgAy0AJzoAByAEIAMtACg6AAggBCADLQApOgAJIAQgAy0AKjoACiAEIAMtACs6AAsgBCADLQAsOgAMIAQgAy0ALToADSAEIAMtAC46AA4gBCADLQAvOgAPIAQgAy0AMDoAECAEIAMtADE6ABEgBCADLQAyOgASIAQgAy0AMzoAEyAEIAMtADQ6ABQgBCADLQA1OgAVIAQgAy0ANjoAFiAEIAMtADc6ABcgBCADLQA4OgAYIAQgAy0AOToAGSAEIAMtADo6ABogBCADLQA7OgAbIAQgAy0APDoAHCAEIAMtAD06AB0gBCADLQA+OgAeIAQgAy0APzoAHyAHQbCwB2oiCCIEIAMtAEA6AAAgBCADLQBBOgABIAQgAy0AQjoAAiAEIAMtAEM6AAMgBCADLQBEOgAEIAQgAy0ARToABSAEIAMtAEY6AAYgBCADLQBHOgAHIAQgAy0ASDoACCAEIAMtAEk6AAkgBCADLQBKOgAKIAQgAy0ASzoACyAEIAMtAEw6AAwgBCADLQBNOgANIAQgAy0ATjoADiAEIAMtAE86AA8gBCADLQBQOgAQIAQgAy0AUToAESAEIAMtAFI6ABIgBCADLQBTOgATIAQgAy0AVDoAFCAEIAMtAFU6ABUgBCADLQBWOgAWIAQgAy0AVzoAFyAEIAMtAFg6ABggBCADLQBZOgAZIAQgAy0AWjoAGiAEIAMtAFs6ABsgBCADLQBcOgAcIAQgAy0AXToAHSAEIAMtAF46AB4gBCADLQBfOgAfIAdBkLgDaiIKIgQgA0HgAGoQCCAEQYAIaiADQcABahAIIARBgBBqIANBoAJqEAggBEGAGGogA0GAA2oQCCAEQYAgaiADQeADahAIIARBgChqIANBwARqEAggBEGAMGogA0GgBWoQCCAHQZDIAWoiCyIEIANBgAZqEAggBEGACGogA0HgBmoQCCAEQYAQaiADQcAHahAIIARBgBhqIANBoAhqEAggBEGAIGogA0GACWoQCCAEQYAoaiADQeAJahAIIARBgDBqIANBwApqEAggBEGAOGogA0GgC2oQCCAHQZCIAmoiBCADQYAMahATIARBgAhqIANBoA9qEBMgBEGAEGogA0HAEmoQEyAEQYAYaiADQeAVahATIARBgCBqIANBgBlqEBMgBEGAKGogA0GgHGoQEyAEQYAwaiADQcAfahATIARBgDhqIANB4CJqEBMgB0EMaiIDECEgAyAIQSAQDiADIAEgAhAOIAMQIiAHQfCwB2oiEEHAACADEA8gAxAQIAdBsLEHaiIIQcAAIAlB4AAQKSAHQZDwA2ogBhAxIAoQKCALEC4gBBAuA0AgB0GQgANqIgMgCCAPQf//A3FBB2wiAUH//wNxECAgA0GACGoiESAIIAFBAWpB//8DcRAgIANBgBBqIhIgCCABQQJqQf//A3EQICADQYAYaiITIAggAUEDakH//wNxECAgA0GAIGoiFCAIIAFBBGpB//8DcRAgIANBgChqIhUgCCABQQVqQf//A3EQICADQYAwaiIWIAggAUEGakH//wNxECAgB0GQyAJqIgEgA0GAOBAsIAEQKCAHQZCIAWoiAiAHQZDwA2ogARAwIAIQJyACECYgAhAvIAIgB0GQyABqIgQgAhAZIAJBgAhqIgYgBEGACGogBhAZIAJBgBBqIgYgBEGAEGogBhAZIAJBgBhqIgYgBEGAGGogBhAZIAJBgCBqIgYgBEGAIGogBhAZIAJBgChqIgYgBEGAKGogBhAZIAJBgDBqIgYgBEGAMGogBhAZIAJBgDhqIgYgBEGAOGogBhAZIAUgAhA0IAdBDGoiAhAhIAIgEEHAABAOIAIgBUGACBAOIAIQIiAFQSAgAhAPIAIQECAHQRBqIgIgBRA7IA9BAWohDyACEAcgASACIAdBkLgDaiIEEAUgAUGACGoiBiACIARBgAhqEAUgAUGAEGoiCSACIARBgBBqEAUgAUGAGGoiCiACIARBgBhqEAUgAUGAIGoiCyACIARBgCBqEAUgAUGAKGoiDCACIARBgChqEAUgAUGAMGoiDSACIARBgDBqEAUgARANIAYQDSAJEA0gChANIAsQDSAMEA0gDRANIAEgASADEAYgBiAGIBEQBiAJIAkgEhAGIAogCiATEAYgCyALIBQQBiAMIAwgFRAGIA0gDSAWEAYgARAMIAYQDCAJEAwgChAMIAsQDCAMEAwgDRAMIAEQOQ0AIAdBkAhqIgIgB0EQaiAHQZDIAWoQLSACECYgB0GQyABqIgEgASACEDcgARAnIAFBiP0PEDYNACAHQZAIaiIBIAdBEGogB0GQiAJqEC0gARAmIAEQJyABQYD+DxA2DQAgB0GQyABqIgEgASAHQZAIaiICEDggAiABIAdBkIgBaiIDEBghBCACQYAIaiABQYAIaiADQYAIahAYIQYgAkGAEGogAUGAEGogA0GAEGoQGCEJIAJBgBhqIAFBgBhqIANBgBhqEBghCiACQYAgaiABQYAgaiADQYAgahAYIQsgAkGAKGogAUGAKGogA0GAKGoQGCEMIAJBgDBqIAFBgDBqIANBgDBqEBghDSACQYA4aiABQYA4aiADQYA4ahAYIA0gDCALIAogCSAEIAZqampqampqQcsASw0ACyAHQZAIaiEEIAUgBS0AADoAACAFIAUtAAE6AAEgBSAFLQACOgACIAUgBS0AAzoAAyAFIAUtAAQ6AAQgBSAFLQAFOgAFIAUgBS0ABjoABiAFIAUtAAc6AAcgBSAFLQAIOgAIIAUgBS0ACToACSAFIAUtAAo6AAogBSAFLQALOgALIAUgBS0ADDoADCAFIAUtAA06AA0gBSAFLQAOOgAOIAUgBS0ADzoADyAFIAUtABA6ABAgBSAFLQAROgARIAUgBS0AEjoAEiAFIAUtABM6ABMgBSAFLQAUOgAUIAUgBS0AFToAFSAFIAUtABY6ABYgBSAFLQAXOgAXIAUgBS0AGDoAGCAFIAUtABk6ABkgBSAFLQAaOgAaIAUgBS0AGzoAGyAFIAUtABw6ABwgBSAFLQAdOgAdIAUgBS0AHjoAHiAFIAUtAB86AB8gBUEgaiAHQZDIAmoiARAeIAVBoAVqIAFBgAhqEB4gBUGgCmogAUGAEGoQHiAFQaAPaiABQYAYahAeIAVBoBRqIAFBgCBqEB4gBUGgGWogAUGAKGoQHiAFQaAeaiABQYAwahAeQQAhASAFQaAjakHTABAkIQNBACECA0AgBCACQQJ0aigCAARAIAEgA2ogAjoAACABQQFqIQELIAQgAkEBciIIQQJ0aigCAARAIAEgA2ogCDoAACABQQFqIQELIAJBAmoiAkGAAkcNAAsgBSABOgDrIyAEQYAIaiEIQQAhAgNAIAggAkECdGooAgAEQCABIANqIAI6AAAgAUEBaiEBCyAIIAJBAXIiBkECdGooAgAEQCABIANqIAY6AAAgAUEBaiEBCyACQQJqIgJBgAJHDQALIAUgAToA7CMgBEGAEGohCEEAIQIDQCAIIAJBAnRqKAIABEAgASADaiACOgAAIAFBAWohAQsgCCACQQFyIgZBAnRqKAIABEAgASADaiAGOgAAIAFBAWohAQsgAkECaiICQYACRw0ACyAFIAE6AO0jIARBgBhqIQhBACECA0AgCCACQQJ0aigCAARAIAEgA2ogAjoAACABQQFqIQELIAggAkEBciIGQQJ0aigCAARAIAEgA2ogBjoAACABQQFqIQELIAJBAmoiAkGAAkcNAAsgBSABOgDuIyAEQYAgaiEIQQAhAgNAIAggAkECdGooAgAEQCABIANqIAI6AAAgAUEBaiEBCyAIIAJBAXIiBkECdGooAgAEQCABIANqIAY6AAAgAUEBaiEBCyACQQJqIgJBgAJHDQALIAUgAToA7yMgBEGAKGohCEEAIQIDQCAIIAJBAnRqKAIABEAgASADaiACOgAAIAFBAWohAQsgCCACQQFyIgZBAnRqKAIABEAgASADaiAGOgAAIAFBAWohAQsgAkECaiICQYACRw0ACyAFIAE6APAjIARBgDBqIQhBACECA0AgCCACQQJ0aigCAARAIAEgA2ogAjoAACABQQFqIQELIAggAkEBciIGQQJ0aigCAARAIAEgA2ogBjoAACABQQFqIQELIAJBAmoiAkGAAkcNAAsgBSABOgDxIyAEQYA4aiEEQQAhAgNAIAQgAkECdGooAgAEQCABIANqIAI6AAAgAUEBaiEBCyAEIAJBAXIiCEECdGooAgAEQCABIANqIAg6AAAgAUEBaiEBCyACQQJqIgJBgAJHDQALIAUgAToA8iMgDkHzIzYCDCAHQfCxB2okACAAIA4oAgw7AQAgDkEQaiQAQQALghEBFH8jAEGg8QVrIgUkACAFQaDwBWohAiMAQRBrIgQkAANAIARBADoADyACIANqQaQSIARBD2pBABABOgAAIANBAWoiA0EgRw0ACyAEQRBqJAAgAkGAASACQSAQKSAFQYCwAmoiCCACEDEgBUGA+AFqIgYiBCAFQcDwBWoiA0EAEAogBEGACGogA0EBEAogBEGAEGogA0ECEAogBEGAGGogA0EDEAogBEGAIGogA0EEEAogBEGAKGogA0EFEAogBEGAMGogA0EGEAogBUGAgAFqIgQgA0EHEAogBEGACGogA0EIEAogBEGAEGogA0EJEAogBEGAGGogA0EKEAogBEGAIGogA0ELEAogBEGAKGogA0EMEAogBEGAMGogA0ENEAogBEGAOGoiDiADQQ4QCiAFQYDAAWoiByAGQYA4ECwgBxAoIAVBgEBrIgMgCCAHEDAgAxAnIAMQJiADIAMgBBA4IAMQLyADIAUgAxAaIANBgAhqIgcgBUGACGoiDyAHEBogA0GAEGoiCCAFQYAQaiIQIAgQGiADQYAYaiIJIAVBgBhqIhEgCRAaIANBgCBqIgogBUGAIGoiEiAKEBogA0GAKGoiCyAFQYAoaiITIAsQGiADQYAwaiIMIAVBgDBqIhQgDBAaIANBgDhqIg0gBUGAOGoiFSANEBogACACLQAAOgAAIAAgAi0AAToAASAAIAItAAI6AAIgACACLQADOgADIAAgAi0ABDoABCAAIAItAAU6AAUgACACLQAGOgAGIAAgAi0ABzoAByAAIAItAAg6AAggACACLQAJOgAJIAAgAi0ACjoACiAAIAItAAs6AAsgACACLQAMOgAMIAAgAi0ADToADSAAIAItAA46AA4gACACLQAPOgAPIAAgAi0AEDoAECAAIAItABE6ABEgACACLQASOgASIAAgAi0AEzoAEyAAIAItABQ6ABQgACACLQAVOgAVIAAgAi0AFjoAFiAAIAItABc6ABcgACACLQAYOgAYIAAgAi0AGToAGSAAIAItABo6ABogACACLQAbOgAbIAAgAi0AHDoAHCAAIAItAB06AB0gACACLQAeOgAeIAAgAi0AHzoAHyAAQSBqIAMQFiAAQeACaiAHEBYgAEGgBWogCBAWIABB4AdqIAkQFiAAQaAKaiAKEBYgAEHgDGogCxAWIABBoA9qIAwQFiAAQeARaiANEBYgBUGA8AVqIgNBICAAQaAUECkgASACLQAAOgAAIAEgAi0AAToAASABIAItAAI6AAIgASACLQADOgADIAEgAi0ABDoABCABIAItAAU6AAUgASACLQAGOgAGIAEgAi0ABzoAByABIAItAAg6AAggASACLQAJOgAJIAEgAi0ACjoACiABIAItAAs6AAsgASACLQAMOgAMIAEgAi0ADToADSABIAItAA46AA4gASACLQAPOgAPIAEgAi0AEDoAECABIAItABE6ABEgASACLQASOgASIAEgAi0AEzoAEyABIAItABQ6ABQgASACLQAVOgAVIAEgAi0AFjoAFiABIAItABc6ABcgASACLQAYOgAYIAEgAi0AGToAGSABIAItABo6ABogASACLQAbOgAbIAEgAi0AHDoAHCABIAItAB06AB0gASACLQAeOgAeIAEgAi0AHzoAHyABIAVBgPEFaiIALQAAOgAgIAEgAC0AAToAISABIAAtAAI6ACIgASAALQADOgAjIAEgAC0ABDoAJCABIAAtAAU6ACUgASAALQAGOgAmIAEgAC0ABzoAJyABIAAtAAg6ACggASAALQAJOgApIAEgAC0ACjoAKiABIAAtAAs6ACsgASAALQAMOgAsIAEgAC0ADToALSABIAAtAA46AC4gASAALQAPOgAvIAEgAC0AEDoAMCABIAAtABE6ADEgASAALQASOgAyIAEgAC0AEzoAMyABIAAtABQ6ADQgASAALQAVOgA1IAEgAC0AFjoANiABIAAtABc6ADcgASAALQAYOgA4IAEgAC0AGToAOSABIAAtABo6ADogASAALQAbOgA7IAEgAC0AHDoAPCABIAAtAB06AD0gASAALQAeOgA+IAEgAC0AHzoAPyABIAMtAAA6AEAgASADLQABOgBBIAEgAy0AAjoAQiABIAMtAAM6AEMgASADLQAEOgBEIAEgAy0ABToARSABIAMtAAY6AEYgASADLQAHOgBHIAEgAy0ACDoASCABIAMtAAk6AEkgASADLQAKOgBKIAEgAy0ACzoASyABIAMtAAw6AEwgASADLQANOgBNIAEgAy0ADjoATiABIAMtAA86AE8gASADLQAQOgBQIAEgAy0AEToAUSABIAMtABI6AFIgASADLQATOgBTIAEgAy0AFDoAVCABIAMtABU6AFUgASADLQAWOgBWIAEgAy0AFzoAVyABIAMtABg6AFggASADLQAZOgBZIAEgAy0AGjoAWiABIAMtABs6AFsgASADLQAcOgBcIAEgAy0AHToAXSABIAMtAB46AF4gASADLQAfOgBfIAFB4ABqIAYQCSABQcABaiAGQYAIahAJIAFBoAJqIAZBgBBqEAkgAUGAA2ogBkGAGGoQCSABQeADaiAGQYAgahAJIAFBwARqIAZBgChqEAkgAUGgBWogBkGAMGoQCSABQYAGaiAEEAkgAUHgBmogBEGACGoQCSABQcAHaiAEQYAQahAJIAFBoAhqIARBgBhqEAkgAUGACWogBEGAIGoQCSABQeAJaiAEQYAoahAJIAFBwApqIARBgDBqEAkgAUGgC2ogDhAJIAFBgAxqIAUQFCABQaAPaiAPEBQgAUHAEmogEBAUIAFB4BVqIBEQFCABQYAZaiASEBQgAUGgHGogExAUIAFBwB9qIBQQFCABQeAiaiAVEBQgBUGg8QVqJABBAAsFAEH1IwsFAEGAJgsFAEGgFAsoAQF/IwBBEGsiACQAIABBADoAD0HIEiAAQQ9qQQAQARogAEEQaiQACwunCgMAQYAIC1FyYW5kb21ieXRlcwBsaWJzb2RpdW0vc3JjL2xpYnNvZGl1bS9yYW5kb21ieXRlcy9yYW5kb21ieXRlcy5jAGJ1Zl9sZW4gPD0gU0laRV9NQVgAQeAIC78JAQAAAAAAAACCgAAAAAAAAIqAAAAAAACAAIAAgAAAAICLgAAAAAAAAAEAAIAAAAAAgYAAgAAAAIAJgAAAAAAAgIoAAAAAAAAAiAAAAAAAAAAJgACAAAAAAAoAAIAAAAAAi4AAgAAAAACLAAAAAAAAgImAAAAAAACAA4AAAAAAAIACgAAAAAAAgIAAAAAAAACACoAAAAAAAAAKAACAAAAAgIGAAIAAAACAgIAAAAAAAIABAACAAAAAAAiAAIAAAACAAAAAAPdkAAACMdj/AxX4/0SeAwAYIfT/KKHy/yQeBwAr3hsAK+kjAK2E+v9/FOD/dZovAAn70/9Jei8AJ+UoAFiWKQBwoA8ApIXv/4i3NgCQnff/oOru/2j5JwB709//1q3f/+caxf/3pOr/mPzN/zXQGgAitP//ATI9AMVFBABnSikAIHYBAM30LgDF3jUAA6Xm/ywwyf/UR9n/r747AIUVxf98jtH/loo2AEE+1P8ABDYATWr7/5zWIwBdxff/PRLm/9bq5v8efjUAWa/F/z+ENQAXVt//XJTn/4xzOACoYwwAmhsIAHaPDgBTODsANIU7ADD82P9UnR8ALU/V/+UGxP+BrOj/z+HH/xmY0f9d1un/7gk1AMc1IQC7z+f/dc/s/3KXHQBysMH/9rzw/4BSz/+u0s//4JDI/8rvAQDyEDQAhf7w/zjGIACfbikAo7fS/0ukx/9tuvn/CTTa/4LC9f8TQe3/O6b///cJ7P/dK/r/1JUUAGNFHABiLOr/6fvM//AKBAAXxAcAiEUvAACtAAC+Nu//RM0NAFpnPADKK8f/ft7//0g5GQDAac7/bHUkAN/H/P+hmAsACOjr/2zkAgAIyMn/wjYwAPa/4/+TPNv/4Er9/wUTFACSdxQAJZ4TAODQ5/9EmfP/Agjq/6Lu0f+cx8T/V6DI/9mXOgCT6h8AWv8zANRYIwD4QToAcv/M//s9IgCfq9r/IqTJ//USBACHJSUA8CTt/12bNQCgSMr//KLG/1a77f/eRc//Xr4NABpeHADm4A0AWn8MAIOPBwCKYuf/BFf///wG+P8hAPb/9lrQ/4QAHwCG7zAAfbnJ/9b89/+SRfT/wiHJ/xk5BQAMYQQAQc3a/xuwPgDncjQAOwDN/8d8GgAkGQMA5V4rAJkRKQA6etj/cU0TABzhPQCECRMAUfAlAEZaGAAYhcb/vhQTAJE4KACQ28n/iVDS/z+FHABLCx0Apvbv/76o6/8b4RIAPl7N/y8t6v/kHfn/xwYUAINyMgBuDeL/U3ns/5lAHQB4Jdn/rQXr/wXkFgDn2wsA6B0iAM/4MwA0uff/DMrU//h/5v9X0eP/G5HY/xIsx//YEAkAH17G/1hG4f+LHSUAt3MlAI98/f+Y3R0AmGgzALvUAgCnk+3/vmzP/xx8AgAIqhgAcf0tAKVcDACaNxkAZ6HH/z2M5P88odH/OcU1ABUBOwDAHQQA98QhAPQb8f/nNRoADjQHAEV9+f/QTBoArnzk/2gmHQCYjub/Mybv/9oF/P/bf8X/ZCfT/6/h3f/dk/n/CR3d/5PMAgAFGPH/KpwYAKnlyf9Qivf/LM87AE5D///fNuv/yhU8AGheFQC2FvP/zikeAEGgEgsDEA6A\")||(d=R,R=Q.locateFile?Q.locateFile(d,t):t+d);var L={2340:function(){return Q.getRandomValue()},2376:function(){if(void 0===Q.getRandomValue)try{var A=\"object\"===(\"undefined\"==typeof window?\"undefined\":g(window))?window:self,I=void 0!==A.crypto?A.crypto:A.msCrypto,C=function(){var A=new Uint32Array(1);return I.getRandomValues(A),A[0]>>>0};C(),Q.getRandomValue=C}catch(A){try{var B=eval(\"require\")(\"crypto\"),i=function(){var A=B.randomBytes(4);return(A[0]<<24|A[1]<<16|A[2]<<8|A[3])>>>0};i(),Q.getRandomValue=i}catch(A){throw\"No secure random number generator found\"}}}};function p(A){this.name=\"ExitStatus\",this.message=\"Program terminated with exit(\".concat(A,\")\"),this.status=A}var K=function(A){for(;A.length>0;)A.shift()(Q)};\"undefined\"!=typeof TextDecoder&&new TextDecoder(\"utf8\");var b,v=[],j=function(A,I,g){var C=function(A,I){var g;for(v.length=0,I>>=2;g=y[A++];)I+=105!=g&I,v.push(105==g?u[I]:s[I++>>1]),++I;return v}(I,g);return L[A].apply(null,C)},O=function(A){A,G||(Q.onExit&&Q.onExit(A),F=!0),E(A,new p(A))},T={b:function(A,I,g){return j(A,I,g)},d:function(A,I,g){return y.copyWithin(A,I,I+g)},c:function(A){y.length;U(\"OOM\")},a:function(A,I){A,O(A)}};(function(){var A={a:T};function I(A,I){var g,C,B=A.exports;return Q.asm=B,c=Q.asm.e,g=c.buffer,Q.HEAP8=h=new Int8Array(g),Q.HEAP16=new Int16Array(g),Q.HEAP32=u=new Int32Array(g),Q.HEAPU8=y=new Uint8Array(g),Q.HEAPU16=new Uint16Array(g),Q.HEAPU32=new Uint32Array(g),Q.HEAPF32=new Float32Array(g),Q.HEAPF64=s=new Float64Array(g),Q.asm.g,C=Q.asm.f,N.unshift(C),function(A){if(S--,Q.monitorRunDependencies&&Q.monitorRunDependencies(S),0==S&&(null!==k&&(clearInterval(k),k=null),H)){var I=H;H=null,I()}}(),B}if(S++,Q.monitorRunDependencies&&Q.monitorRunDependencies(S),Q.instantiateWasm)try{return Q.instantiateWasm(A,I)}catch(A){return D(\"Module.instantiateWasm callback failed with error: \"+A),!1}m(0,R,A,(function(A){I(A.instance)}))})(),Q._malloc=function(){return(Q._malloc=Q.asm.h).apply(null,arguments)},Q._free=function(){return(Q._free=Q.asm.i).apply(null,arguments)},Q._dilithiumjs_init=function(){return(Q._dilithiumjs_init=Q.asm.j).apply(null,arguments)},Q._dilithiumjs_public_key_bytes=function(){return(Q._dilithiumjs_public_key_bytes=Q.asm.k).apply(null,arguments)},Q._dilithiumjs_secret_key_bytes=function(){return(Q._dilithiumjs_secret_key_bytes=Q.asm.l).apply(null,arguments)},Q._dilithiumjs_signature_bytes=function(){return(Q._dilithiumjs_signature_bytes=Q.asm.m).apply(null,arguments)},Q._dilithiumjs_keypair=function(){return(Q._dilithiumjs_keypair=Q.asm.n).apply(null,arguments)},Q._dilithiumjs_sign=function(){return(Q._dilithiumjs_sign=Q.asm.o).apply(null,arguments)},Q._dilithiumjs_verify=function(){return(Q._dilithiumjs_verify=Q.asm.p).apply(null,arguments)};function x(A){if(J(A))return function(A){if(void 0!==r&&r){var I=Buffer.from(A,\"base64\");return new Uint8Array(I.buffer,I.byteOffset,I.byteLength)}try{for(var g=atob(A),C=new Uint8Array(g.length),B=0;B<g.length;++B)C[B]=g.charCodeAt(B);return C}catch(A){throw new Error(\"Converting base64 string to bytes failed.\")}}(A.slice(M.length))}function W(){function A(){b||(b=!0,Q.calledRun=!0,F||(!0,K(N),Q.onRuntimeInitialized&&Q.onRuntimeInitialized(),function(){if(Q.postRun)for(\"function\"==typeof Q.postRun&&(Q.postRun=[Q.postRun]);Q.postRun.length;)A=Q.postRun.shift(),w.unshift(A);var A;K(w)}()))}S>0||(!function(){if(Q.preRun)for(\"function\"==typeof Q.preRun&&(Q.preRun=[Q.preRun]);Q.preRun.length;)A=Q.preRun.shift(),Y.unshift(A);var A;K(Y)}(),S>0||(Q.setStatus?(Q.setStatus(\"Running...\"),setTimeout((function(){setTimeout((function(){Q.setStatus(\"\")}),1),A()}),1)):A()))}if(Q.writeArrayToMemory=function(A,I){h.set(A,I)},H=function A(){b||W(),b||(H=A)},Q.preInit)for(\"function\"==typeof Q.preInit&&(Q.preInit=[Q.preInit]);Q.preInit.length>0;)Q.preInit.pop()();W()})).catch((function(){function A(I){return A=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(A){return typeof A}:function(A){return A&&\"function\"==typeof Symbol&&A.constructor===Symbol&&A!==Symbol.prototype?\"symbol\":typeof A},A(I)}var I,g,C=void 0!==(C={})?C:{},B=Object.assign({},C),Q=function(A,I){throw I},i=\"object\"==(\"undefined\"==typeof window?\"undefined\":A(window)),E=\"function\"==typeof importScripts,o=\"object\"==(\"undefined\"==typeof process?\"undefined\":A(process))&&\"object\"==A(process.versions)&&\"string\"==typeof process.versions.node,n=\"\";if(o){var r=eval(\"require\")(\"fs\"),t=eval(\"require\")(\"path\");n=E?t.dirname(n)+\"/\":__dirname+\"/\",I=function(A,I){var g=P(A);return g?I?g:g.toString():(A=m(A)?new URL(A):t.normalize(A),r.readFileSync(A,I?void 0:\"utf8\"))},g=function(A){var g=I(A,!0);return g.buffer||(g=new Uint8Array(g)),g},function(A,I,g){var C=!(arguments.length>3&&void 0!==arguments[3])||arguments[3],B=P(A);B&&I(B),A=m(A)?new URL(A):t.normalize(A),r.readFile(A,C?void 0:\"utf8\",(function(A,B){A?g(A):I(C?B.buffer:B)}))},!C.thisProgram&&process.argv.length>1&&process.argv[1].replace(/\\\\/g,\"/\"),process.argv.slice(2),\"undefined\"!=typeof module&&(module.exports=C),process.on(\"uncaughtException\",(function(A){if(!(\"unwind\"===A||A instanceof b||A.context instanceof b))throw A})),Q=function(A,I){throw process.exitCode=A,I},C.inspect=function(){return\"[Emscripten Module object]\"}}else(i||E)&&(E?n=self.location.href:\"undefined\"!=typeof document&&document.currentScript&&(n=document.currentScript.src),n=0!==n.indexOf(\"blob:\")?n.substr(0,n.replace(/[?#].*/,\"\").lastIndexOf(\"/\")+1):\"\",I=function(A){try{var I=new XMLHttpRequest;return I.open(\"GET\",A,!1),I.send(null),I.responseText}catch(I){var g=P(A);if(g)return function(A){for(var I=[],g=0;g<A.length;g++){var C=A[g];C>255&&(C&=255),I.push(String.fromCharCode(C))}return I.join(\"\")}(g);throw I}},E&&(g=function(A){try{var I=new XMLHttpRequest;return I.open(\"GET\",A,!1),I.responseType=\"arraybuffer\",I.send(null),new Uint8Array(I.response)}catch(I){var g=P(A);if(g)return g;throw I}}),function(A,I,g){var C=new XMLHttpRequest;C.open(\"GET\",A,!0),C.responseType=\"arraybuffer\",C.onload=function(){if(200==C.status||0==C.status&&C.response)I(C.response);else{var B=P(A);B?I(B.buffer):g()}},C.onerror=g,C.send(null)},function(A){return document.title=A});C.print||console.log.bind(console);var a,e=C.printErr||console.error.bind(console);Object.assign(C,B),B=null,C.arguments&&C.arguments,C.thisProgram&&C.thisProgram,C.quit&&(Q=C.quit),C.wasmBinary&&(a=C.wasmBinary);var f,D=C.noExitRuntime||!0,c={Memory:function(A){this.buffer=new ArrayBuffer(65536*A.initial)},Module:function(A){},Instance:function(A,I){this.exports=function(A){for(var I,g=new Uint8Array(123),C=25;C>=0;--C)g[48+C]=52+C,g[65+C]=C,g[97+C]=26+C;function B(A,I,C){for(var B,Q,i=0,E=I,o=C.length,n=I+(3*o>>2)-(\"=\"==C[o-2])-(\"=\"==C[o-1]);i<o;i+=4)B=g[C.charCodeAt(i+1)],Q=g[C.charCodeAt(i+2)],A[E++]=g[C.charCodeAt(i)]<<2|B>>4,E<n&&(A[E++]=B<<4|Q>>2),E<n&&(A[E++]=Q<<6|g[C.charCodeAt(i+3)])}function Q(){throw new Error(\"abort\")}return g[43]=62,g[47]=63,function(A){var g=A.a,C=g.a.buffer,i=new Int8Array(C),E=new Int16Array(C),o=new Int32Array(C),n=new Uint8Array(C),r=new Uint16Array(C),t=new Uint32Array(C),a=(new Float32Array(C),new Float64Array(C),Math.imul),e=(Math.fround,Math.abs,Math.clz32),f=(Math.min,Math.max,Math.floor,Math.ceil,Math.trunc,Math.sqrt,g.b),D=g.c,c=g.d,G=8392208,h=0;function y(A){var I,g=0,C=0,B=0,Q=0,i=0,E=0,r=0,a=0,f=0,D=0;G=I=G-16|0;A:{I:{g:{C:{B:{Q:{i:{E:{o:{n:{r:{t:{a:{e:{if((A|=0)>>>0<=244){if(3&(g=(E=o[776])>>>(C=(r=A>>>0<11?16:A+11&-8)>>>3|0)|0)){g=(A=(C=C+(1&(-1^g))|0)<<3)+3144|0,B=o[A+3152>>2],(0|g)!=(0|(A=o[B+8>>2]))?(o[A+12>>2]=g,o[g+8>>2]=A):o[776]=EA(C)&E,A=B+8|0,g=C<<3,o[B+4>>2]=3|g,o[(g=g+B|0)+4>>2]=1|o[g+4>>2];break A}if((D=o[778])>>>0>=r>>>0)break e;if(g){g=(A=(B=oA(0-(A=(0-(A=2<<C)|A)&g<<C)&A))<<3)+3144|0,Q=o[A+3152>>2],(0|g)!=(0|(A=o[Q+8>>2]))?(o[A+12>>2]=g,o[g+8>>2]=A):(E=EA(B)&E,o[776]=E),o[Q+4>>2]=3|r,B=(A=B<<3)-r|0,o[(C=Q+r|0)+4>>2]=1|B,o[A+Q>>2]=B,D&&(g=3144+(-8&D)|0,i=o[781],(A=1<<(D>>>3))&E?A=o[g+8>>2]:(o[776]=A|E,A=g),o[g+8>>2]=i,o[A+12>>2]=i,o[i+12>>2]=g,o[i+8>>2]=A),A=Q+8|0,o[781]=C,o[778]=B;break A}if(!(f=o[777]))break e;for(C=o[3408+(oA(0-f&f)<<2)>>2],i=(-8&o[C+4>>2])-r|0,g=C;(A=o[g+16>>2])||(A=o[g+20>>2]);)i=(B=(g=(-8&o[A+4>>2])-r|0)>>>0<i>>>0)?g:i,C=B?A:C,g=A;if(a=o[C+24>>2],(0|(B=o[C+12>>2]))!=(0|C)){A=o[C+8>>2],o[A+12>>2]=B,o[B+8>>2]=A;break I}if(!(A=o[(g=C+20|0)>>2])){if(!(A=o[C+16>>2]))break a;g=C+16|0}for(;Q=g,B=A,(A=o[(g=A+20|0)>>2])||(g=B+16|0,A=o[B+16>>2]););o[Q>>2]=0;break I}if(r=-1,!(A>>>0>4294967231)&&(r=-8&(A=A+11|0),f=o[777])){i=0-r|0,E=0,r>>>0<256||(E=31,r>>>0>16777215||(E=62+((r>>>38-(A=e(A>>>8|0))&1)-(A<<1)|0)|0));f:{D:{if(g=o[3408+(E<<2)>>2])for(A=0,C=r<<(31!=(0|E)?25-(E>>>1|0)|0:0);;){if(!((Q=(-8&o[g+4>>2])-r|0)>>>0>=i>>>0||(B=g,i=Q,Q))){i=0,A=g;break D}if(Q=o[g+20>>2],g=o[16+((C>>>29&4)+g|0)>>2],A=Q?(0|Q)==(0|g)?A:Q:A,C<<=1,!g)break}else A=0;if(!(A|B)){if(B=0,!(A=(0-(A=2<<E)|A)&f))break e;A=o[3408+(oA(A&0-A)<<2)>>2]}if(!A)break f}for(;i=(C=(g=(-8&o[A+4>>2])-r|0)>>>0<i>>>0)?g:i,B=C?A:B,A=(g=o[A+16>>2])||o[A+20>>2];);}if(!(!B|o[778]-r>>>0<=i>>>0)){if(E=o[B+24>>2],(0|B)!=(0|(C=o[B+12>>2]))){A=o[B+8>>2],o[A+12>>2]=C,o[C+8>>2]=A;break g}if(!(A=o[(g=B+20|0)>>2])){if(!(A=o[B+16>>2]))break t;g=B+16|0}for(;Q=g,C=A,(A=o[(g=A+20|0)>>2])||(g=C+16|0,A=o[C+16>>2]););o[Q>>2]=0;break g}}}if((A=o[778])>>>0>=r>>>0){B=o[781],(g=A-r|0)>>>0>=16?(o[(C=B+r|0)+4>>2]=1|g,o[A+B>>2]=g,o[B+4>>2]=3|r):(o[B+4>>2]=3|A,o[(A=A+B|0)+4>>2]=1|o[A+4>>2],C=0,g=0),o[778]=g,o[781]=C,A=B+8|0;break A}if((a=o[779])>>>0>r>>>0){g=a-r|0,o[779]=g,A=(C=o[782])+r|0,o[782]=A,o[A+4>>2]=1|g,o[C+4>>2]=3|r,A=C+8|0;break A}if(A=0,f=r+47|0,o[894]?C=o[896]:(o[897]=-1,o[898]=-1,o[895]=4096,o[896]=4096,o[894]=I+12&-16^1431655768,o[899]=0,o[887]=0,C=4096),(g=(Q=f+C|0)&(i=0-C|0))>>>0<=r>>>0)break A;if((B=o[886])&&B>>>0<(E=(C=o[884])+g|0)>>>0|C>>>0>=E>>>0)break A;e:{if(!(4&n[3548])){f:{D:{c:{G:{if(B=o[782])for(A=3552;;){if((C=o[A>>2])>>>0<=B>>>0&B>>>0<C+o[A+4>>2]>>>0)break G;if(!(A=o[A+8>>2]))break}if(-1==(0|(C=W(0))))break f;if(E=g,(A=(B=o[895])-1|0)&C&&(E=(g-C|0)+(A+C&0-B)|0),E>>>0<=r>>>0)break f;if((B=o[886])&&B>>>0<(i=(A=o[884])+E|0)>>>0|A>>>0>=i>>>0)break f;if((0|C)!=(0|(A=W(E))))break c;break e}if((0|(C=W(E=i&Q-a)))==(o[A>>2]+o[A+4>>2]|0))break D;A=C}if(-1==(0|A))break f;if(r+48>>>0<=E>>>0){C=A;break e}if(-1==(0|W(C=(C=o[896])+(f-E|0)&0-C)))break f;E=C+E|0,C=A;break e}if(-1!=(0|C))break e}o[887]=4|o[887]}if(-1==(0|(C=W(g)))|-1==(0|(A=W(0)))|A>>>0<=C>>>0)break o;if((E=A-C|0)>>>0<=r+40>>>0)break o}A=o[884]+E|0,o[884]=A,A>>>0>t[885]&&(o[885]=A);e:{if(Q=o[782]){for(A=3552;;){if(((B=o[A>>2])+(g=o[A+4>>2])|0)==(0|C))break e;if(!(A=o[A+8>>2]))break}break r}for((A=o[780])>>>0<=C>>>0&&A||(o[780]=C),A=0,o[889]=E,o[888]=C,o[784]=-1,o[785]=o[894],o[891]=0;g=(B=A<<3)+3144|0,o[B+3152>>2]=g,o[B+3156>>2]=g,32!=(0|(A=A+1|0)););g=(B=E-40|0)-(A=C+8&7?-8-C&7:0)|0,o[779]=g,A=A+C|0,o[782]=A,o[A+4>>2]=1|g,o[4+(C+B|0)>>2]=40,o[783]=o[898];break n}if(8&o[A+12>>2]|C>>>0<=Q>>>0|B>>>0>Q>>>0)break r;o[A+4>>2]=g+E,C=(A=Q+8&7?-8-Q&7:0)+Q|0,o[782]=C,A=(g=o[779]+E|0)-A|0,o[779]=A,o[C+4>>2]=1|A,o[4+(g+Q|0)>>2]=40,o[783]=o[898];break n}B=0;break I}C=0;break g}t[780]>C>>>0&&(o[780]=C),g=C+E|0,A=3552;r:{t:{a:{for(;;){if((0|g)!=o[A>>2]){if(A=o[A+8>>2])continue;break a}break}if(!(8&n[A+12|0]))break t}for(A=3552;;){if((g=o[A>>2])>>>0<=Q>>>0&&(i=g+o[A+4>>2]|0)>>>0>Q>>>0)break r;A=o[A+8>>2]}}if(o[A>>2]=C,o[A+4>>2]=o[A+4>>2]+E,o[(f=(C+8&7?-8-C&7:0)+C|0)+4>>2]=3|r,A=(E=g+(g+8&7?-8-g&7:0)|0)-(a=r+f|0)|0,(0|Q)==(0|E)){o[782]=a,A=o[779]+A|0,o[779]=A,o[a+4>>2]=1|A;break C}if(o[781]==(0|E)){o[781]=a,A=o[778]+A|0,o[778]=A,o[a+4>>2]=1|A,o[A+a>>2]=A;break C}if(1!=(3&(i=o[E+4>>2])))break B;if(Q=-8&i,i>>>0<=255){if((0|(C=o[E+12>>2]))==(0|(g=o[E+8>>2]))){o[776]=o[776]&EA(i>>>3|0);break Q}o[g+12>>2]=C,o[C+8>>2]=g;break Q}if(r=o[E+24>>2],(0|E)!=(0|(C=o[E+12>>2]))){g=o[E+8>>2],o[g+12>>2]=C,o[C+8>>2]=g;break i}if(!(i=o[(g=E+20|0)>>2])){if(!(i=o[E+16>>2]))break E;g=E+16|0}for(;B=g,(i=o[(g=(C=i)+20|0)>>2])||(g=C+16|0,i=o[C+16>>2]););o[B>>2]=0;break i}for(g=(B=E-40|0)-(A=C+8&7?-8-C&7:0)|0,o[779]=g,A=A+C|0,o[782]=A,o[A+4>>2]=1|g,o[4+(C+B|0)>>2]=40,o[783]=o[898],o[(B=(A=(i+(i-39&7?39-i&7:0)|0)-47|0)>>>0<Q+16>>>0?Q:A)+4>>2]=27,A=o[891],o[B+16>>2]=o[890],o[B+20>>2]=A,A=o[889],o[B+8>>2]=o[888],o[B+12>>2]=A,o[890]=B+8,o[889]=E,o[888]=C,o[891]=0,A=B+24|0;o[A+4>>2]=7,g=A+8|0,A=A+4|0,g>>>0<i>>>0;);if((0|B)!=(0|Q))if(o[B+4>>2]=-2&o[B+4>>2],i=B-Q|0,o[Q+4>>2]=1|i,o[B>>2]=i,i>>>0<=255)g=3144+(-8&i)|0,(C=o[776])&(A=1<<(i>>>3))?A=o[g+8>>2]:(o[776]=A|C,A=g),o[g+8>>2]=Q,o[A+12>>2]=Q,o[Q+12>>2]=g,o[Q+8>>2]=A;else{A=31,i>>>0<=16777215&&(A=62+((i>>>38-(A=e(i>>>8|0))&1)-(A<<1)|0)|0),o[Q+28>>2]=A,o[Q+16>>2]=0,o[Q+20>>2]=0,g=3408+(A<<2)|0;r:{if((B=o[777])&(C=1<<A)){for(A=i<<(31!=(0|A)?25-(A>>>1|0)|0:0),B=o[g>>2];;){if((0|i)==(-8&o[(g=B)+4>>2]))break r;if(C=A>>>29|0,A<<=1,!(B=o[(C=(4&C)+g|0)+16>>2]))break}o[C+16>>2]=Q}else o[777]=C|B,o[g>>2]=Q;o[Q+24>>2]=g,o[Q+12>>2]=Q,o[Q+8>>2]=Q;break n}A=o[g+8>>2],o[A+12>>2]=Q,o[g+8>>2]=Q,o[Q+24>>2]=0,o[Q+12>>2]=g,o[Q+8>>2]=A}}if(!((A=o[779])>>>0<=r>>>0)){g=A-r|0,o[779]=g,A=(C=o[782])+r|0,o[782]=A,o[A+4>>2]=1|g,o[C+4>>2]=3|r,A=C+8|0;break A}}o[775]=48,A=0;break A}C=0}if(r){B=o[E+28>>2];i:{if(o[(g=3408+(B<<2)|0)>>2]==(0|E)){if(o[g>>2]=C,C)break i;o[777]=o[777]&EA(B);break Q}if(o[r+(o[r+16>>2]==(0|E)?16:20)>>2]=C,!C)break Q}o[C+24>>2]=r,(g=o[E+16>>2])&&(o[C+16>>2]=g,o[g+24>>2]=C),(g=o[E+20>>2])&&(o[C+20>>2]=g,o[g+24>>2]=C)}}A=A+Q|0,i=o[(E=Q+E|0)+4>>2]}if(o[E+4>>2]=-2&i,o[a+4>>2]=1|A,o[A+a>>2]=A,A>>>0<=255)g=3144+(-8&A)|0,(C=o[776])&(A=1<<(A>>>3))?A=o[g+8>>2]:(o[776]=A|C,A=g),o[g+8>>2]=a,o[A+12>>2]=a,o[a+12>>2]=g,o[a+8>>2]=A;else{i=31,A>>>0<=16777215&&(i=62+((A>>>38-(g=e(A>>>8|0))&1)-(g<<1)|0)|0),o[a+28>>2]=i,o[a+16>>2]=0,o[a+20>>2]=0,g=3408+(i<<2)|0;B:{if((B=o[777])&(C=1<<i)){for(i=A<<(31!=(0|i)?25-(i>>>1|0)|0:0),C=o[g>>2];;){if(g=C,(-8&o[C+4>>2])==(0|A))break B;if(C=i>>>29|0,i<<=1,!(C=o[(B=(4&C)+g|0)+16>>2]))break}o[B+16>>2]=a}else o[777]=C|B,o[g>>2]=a;o[a+24>>2]=g,o[a+12>>2]=a,o[a+8>>2]=a;break C}A=o[g+8>>2],o[A+12>>2]=a,o[g+8>>2]=a,o[a+24>>2]=0,o[a+12>>2]=g,o[a+8>>2]=A}}A=f+8|0;break A}g:if(E){g=o[B+28>>2];C:{if(o[(A=3408+(g<<2)|0)>>2]==(0|B)){if(o[A>>2]=C,C)break C;f=EA(g)&f,o[777]=f;break g}if(o[E+(o[E+16>>2]==(0|B)?16:20)>>2]=C,!C)break g}o[C+24>>2]=E,(A=o[B+16>>2])&&(o[C+16>>2]=A,o[A+24>>2]=C),(A=o[B+20>>2])&&(o[C+20>>2]=A,o[A+24>>2]=C)}g:if(i>>>0<=15)A=i+r|0,o[B+4>>2]=3|A,o[(A=A+B|0)+4>>2]=1|o[A+4>>2];else if(o[B+4>>2]=3|r,o[(Q=B+r|0)+4>>2]=1|i,o[Q+i>>2]=i,i>>>0<=255)g=3144+(-8&i)|0,(C=o[776])&(A=1<<(i>>>3))?A=o[g+8>>2]:(o[776]=A|C,A=g),o[g+8>>2]=Q,o[A+12>>2]=Q,o[Q+12>>2]=g,o[Q+8>>2]=A;else{A=31,i>>>0<=16777215&&(A=62+((i>>>38-(A=e(i>>>8|0))&1)-(A<<1)|0)|0),o[Q+28>>2]=A,o[Q+16>>2]=0,o[Q+20>>2]=0,g=3408+(A<<2)|0;C:{if((C=1<<A)&f){for(A=i<<(31!=(0|A)?25-(A>>>1|0)|0:0),r=o[g>>2];;){if((-8&o[(g=r)+4>>2])==(0|i))break C;if(C=A>>>29|0,A<<=1,!(r=o[(C=(4&C)+g|0)+16>>2]))break}o[C+16>>2]=Q}else o[777]=C|f,o[g>>2]=Q;o[Q+24>>2]=g,o[Q+12>>2]=Q,o[Q+8>>2]=Q;break g}A=o[g+8>>2],o[A+12>>2]=Q,o[g+8>>2]=Q,o[Q+24>>2]=0,o[Q+12>>2]=g,o[Q+8>>2]=A}A=B+8|0;break A}I:if(a){g=o[C+28>>2];g:{if(o[(A=3408+(g<<2)|0)>>2]==(0|C)){if(o[A>>2]=B,B)break g;o[777]=EA(g)&f;break I}if(o[a+(o[a+16>>2]==(0|C)?16:20)>>2]=B,!B)break I}o[B+24>>2]=a,(A=o[C+16>>2])&&(o[B+16>>2]=A,o[A+24>>2]=B),(A=o[C+20>>2])&&(o[B+20>>2]=A,o[A+24>>2]=B)}i>>>0<=15?(A=i+r|0,o[C+4>>2]=3|A,o[(A=A+C|0)+4>>2]=1|o[A+4>>2]):(o[C+4>>2]=3|r,o[(B=C+r|0)+4>>2]=1|i,o[B+i>>2]=i,D&&(g=3144+(-8&D)|0,Q=o[781],(A=1<<(D>>>3))&E?A=o[g+8>>2]:(o[776]=A|E,A=g),o[g+8>>2]=Q,o[A+12>>2]=Q,o[Q+12>>2]=g,o[Q+8>>2]=A),o[781]=B,o[778]=i),A=C+8|0}return G=I+16|0,0|A}function u(A){var I=0,g=0,C=0,B=0,Q=0,i=0,E=0,n=0,r=0,t=0,a=0,e=0,f=0,D=0,c=0,G=0,y=0,u=0,s=0,F=0,Y=0,N=0,w=0,S=0,k=0,H=0,R=0,d=0,M=0,J=0,q=0,l=0,m=0,L=0,p=0,K=0,b=0,v=0,j=0,O=0,T=0,x=0,W=0,P=0,V=0,X=0,Z=0,_=0,z=0,$=0,AA=0,IA=0,gA=0,CA=0,BA=0,QA=0,iA=0,EA=0,oA=0,nA=0,rA=0,tA=0,aA=0,eA=0,fA=0,DA=0,cA=0,GA=0,hA=0,yA=0,uA=0,sA=0,FA=0,YA=0,NA=0,wA=0,SA=0,kA=0,HA=0,UA=0,RA=0,dA=0,MA=0,JA=0,qA=0,lA=0,mA=0,LA=0,pA=0,KA=0,bA=0,vA=0,jA=0,OA=0,TA=0,xA=0;for(P=o[A+192>>2],V=o[A+196>>2],M=o[A+184>>2],X=o[A+188>>2],Z=o[A+176>>2],_=o[A+180>>2],J=o[A+168>>2],z=o[A+172>>2],u=o[A+160>>2],EA=o[A+164>>2],$=o[A+152>>2],oA=o[A+156>>2],AA=o[A+144>>2],IA=o[A+148>>2],q=o[A+136>>2],l=o[A+140>>2],m=o[A+128>>2],nA=o[A+132>>2],gA=o[A+120>>2],rA=o[A+124>>2],L=o[A+112>>2],p=o[A+116>>2],D=o[A+104>>2],k=o[A+108>>2],K=o[A+96>>2],b=o[A+100>>2],r=o[A+88>>2],H=o[A+92>>2],E=o[A+80>>2],v=o[A+84>>2],i=o[A+72>>2],j=o[A+76>>2],e=o[A+64>>2],y=o[A+68>>2],s=o[A+56>>2],f=o[A+60>>2],g=o[A+48>>2],CA=o[A+52>>2],B=o[A+40>>2],c=o[A+44>>2],F=o[A+32>>2],O=o[A+36>>2],a=o[A+24>>2],Y=o[A+28>>2],t=o[A+16>>2],R=o[A+20>>2],C=o[A+8>>2],N=o[A+12>>2],n=o[A>>2],w=o[A+4>>2];hA>>>0<=23;)I=a^e^D^M^AA,T=U(G=n^B^E^u^gA,S=w^c^v^EA^rA,1)^I,Q=U(F^T,O^(x=(tA=Y^y^k^X^IA)^h),27),aA=h,BA=d=R^f^b^l^_,d=U(W=t^s^K^q^Z,d,1)^G,G=U(r^d,H^(QA=h^S),10),eA=h,iA=S=N^CA^H^z^nA,fA=F^i^L^P^$,F=U(cA=C^g^r^J^m,S,1)^fA,S=U(S=B^F,c^(H=(B=O^j^p^V^oA)^h),36),DA=h,r=U(C^d,N^QA,1),N=h,c=U(fA,B,1)^W,D=U(c^D,(W=k)^(k=h^BA),25),BA=h,O=U(I,tA,1)^cA,C=U(O^s,(W=f)^(f=h^iA),6),tA=h,s=U(a^c,Y^k,28),Y=h,E=U(E^F,H^v,3),v=h,I=U(i^T,j^x,20),W=a=h,i=U(t^O,f^R,62),j=h,L=U(L^T,p^x,39),p=h,B=U(e^c,y^k,55),R=t=h,y=o[(e=(cA=hA<<3)+1120|0)>>2],e=o[e+4>>2],K=U(K^O,f^b,43),b=h,g=U(g^d,CA^QA,44),GA=t=(yA=(w^=H)^(-1^(CA=h))&b^e)^(uA=(-1^t)&p^j)^(sA=(-1^a)&v^Y)^(FA=(-1^DA)&eA^aA)^(YA=(-1^tA)&BA^N),e=U(y=(NA=(iA=n^F)^(-1^g)&K^y)^(wA=(-1^B)&L^i)^(SA=(-1^I)&E^s)^(kA=(-1^S)&G^Q)^(HA=(-1^C)&D^r),t,1),a=h,q=U(q^O,f^l,15),l=h,M=U(c^M,k^X,56),fA=h,AA=U(c^AA,k^IA,21),X=h,P=U(P^T,V^x,14),IA=h,gA=U(F^gA,H^rA,41),V=h,t=U(J^d,z^QA,2),n=h,$=U($^T,x^oA,8),z=h,J=U(u^F,H^EA,18),F=h,u=U(m^d,QA^nA,45),m=h,UA=(-1^M)&Q^q,c=(-1^P)&iA^AA,oA=(-1^t)&i^gA,H=(-1^J)&r^$,Z=U(O^Z,f^_,61),i=U((e^=nA=UA^c^oA^H^(EA=(-1^Z)&s^u))^(rA=(-1^i)&B^t),(a^=JA=(RA=(-1^fA)&aA^l)^(dA=(-1^IA)&w^X)^(k=(-1^n)&j^V)^(f=(-1^F)&N^z)^(MA=(-1^(_=h))&Y^m))^(j=(-1^j)&R^n),14),T=h,xA=n=(qA=BA^(-1^z)&F)^(lA=b^(-1^X)&IA)^(mA=(-1^V)&n^p)^(LA=v^(-1^m)&_)^(pA=(-1^l)&fA^eA),n=U(TA=(KA=D^(-1^$)&J)^(bA=K^(-1^AA)&P)^(vA=(-1^gA)&t^L)^(jA=E^(-1^u)&Z)^(OA=(-1^q)&M^G),n,1)^y,E=U(n^(t=(-1^E)&u^I),(y=h^GA)^(u=(-1^v)&m^W),44),x=h,m=R^(-1^p)&V,p=tA^(-1^BA)&z,eA=DA^(-1^eA)&l,G=(M=(BA=M^(-1^Q)&S)^(GA=Z^(-1^s)&I)^(Q=J^(-1^r)&C)^rA^(l=(-1^iA)&g^P))^U(C=(I=B^(-1^L)&gA)^(L=C^(-1^D)&$)^(iA=S^(-1^G)&q)^(K=(-1^K)&AA^g)^t,u^=m^p^eA^(b=(-1^b)&X^CA),1),QA=g=(s=(B=(aA=fA^(-1^aA)&DA)^(DA=_^(-1^Y)&W)^(J=F^(-1^N)&tA)^j^(q=(-1^w)&CA^IA))^h)^yA,t=i,S=E,F=i^E&(-1^(d=G^NA)),O=(-1^g)&x^T,I=U(I^n,y^m,2),r=h,Y=U(M,B,1)^TA,B=U(EA^Y,MA^(R=xA^h),55),D=h,N=U(nA,JA,1)^C,C=U(N^bA,(w=u^h)^lA,62),E=g=h,P=(-1^C)&B^I,V=(-1^g)&D^r,M=(g=U(G^kA,s^FA,41))^(-1^I)&C,X=(i=h)^(-1^r)&E,Z=(Q=U(Q^e,a^J,39))^(-1^g)&I,_=(I=h)^(-1^i)&r,J=B^(-1^Q)&g,z=D^(-1^I)&i,u=C^(-1^B)&Q,EA=E^(-1^D)&I,I=U(Y^oA,R^k,56),r=h,B=U(G^SA,s^sA,36),D=h,C=U(e^l,a^q,27),E=g=h,$=(-1^C)&B^I,oA=(-1^g)&D^r,AA=(g=U(N^OA,w^pA,15))^(-1^I)&C,IA=(i=h)^(-1^r)&E,q=(Q=U(n^L,y^p,10))^(-1^g)&I,l=(I=h)^(-1^i)&r,m=B^(-1^Q)&g,nA=D^(-1^I)&i,gA=(-1^B)&Q^C,rA=(-1^D)&I^E,I=U(G^wA,s^uA,18),r=h,B=U(N^jA,w^LA,6),i=h,C=U(n^K,y^b,1),v=g=h,L=(-1^C)&B^I,p=(-1^g)&i^r,D=(g=U(e^BA,a^aA,8))^(-1^I)&C,k=(E=h)^(-1^r)&v,K=(Q=U(Y^H,f^R,25))^(-1^g)&I,b=(I=h)^(-1^E)&r,r=B^(-1^Q)&g,H=i^(-1^I)&E,E=(-1^B)&Q^C,v^=(-1^i)&I,I=U(N^vA,w^mA,61),f=h,B=U(e^GA,a^DA,20),a=h,C=U(c^Y,R^dA,28),c=g=h,i=(-1^C)&B^I,j=(-1^g)&a^f,e=(g=U(n^iA,y^eA,45))^(-1^I)&C,y=(n=h)^(-1^f)&c,s=(Q=U(G^HA,s^YA,3))^(-1^g)&I,f=(I=h)^(-1^n)&f,g=(-1^Q)&g^B,CA=(-1^I)&n^a,B=C^(-1^B)&Q,c^=(-1^a)&I,a=(C=U(Y^UA,R^RA,21))^(-1^t)&d,Y=(Q=h)^(-1^T)&QA,t=(I=U(N^KA,w^qA,43))^(-1^C)&t,R=(G=h)^(-1^Q)&T,C=(-1^I)&C^S,N=(-1^G)&Q^x,n=d^o[(Q=1120+(8|cA)|0)>>2]^(-1^S)&I,w=QA^o[Q+4>>2]^(-1^x)&G,hA=hA+2|0;o[A+192>>2]=P,o[A+196>>2]=V,o[A+184>>2]=M,o[A+188>>2]=X,o[A+176>>2]=Z,o[A+180>>2]=_,o[A+168>>2]=J,o[A+172>>2]=z,o[A+160>>2]=u,o[A+164>>2]=EA,o[A+152>>2]=$,o[A+156>>2]=oA,o[A+144>>2]=AA,o[A+148>>2]=IA,o[A+136>>2]=q,o[A+140>>2]=l,o[A+128>>2]=m,o[A+132>>2]=nA,o[A+120>>2]=gA,o[A+124>>2]=rA,o[A+112>>2]=L,o[A+116>>2]=p,o[A+104>>2]=D,o[A+108>>2]=k,o[A+96>>2]=K,o[A+100>>2]=b,o[A+88>>2]=r,o[A+92>>2]=H,o[A+80>>2]=E,o[A+84>>2]=v,o[A+72>>2]=i,o[A+76>>2]=j,o[A+64>>2]=e,o[A+68>>2]=y,o[A+56>>2]=s,o[A+60>>2]=f,o[A+48>>2]=g,o[A+52>>2]=CA,o[A+40>>2]=B,o[A+44>>2]=c,o[A+32>>2]=F,o[A+36>>2]=O,o[A+24>>2]=a,o[A+28>>2]=Y,o[A+16>>2]=t,o[A+20>>2]=R,o[A+8>>2]=C,o[A+12>>2]=N,o[A>>2]=n,o[A+4>>2]=w}function s(A){var I=0,g=0,C=0,B=0,Q=0,i=0,E=0;A:if(A|=0){Q=(C=A-8|0)+(A=-8&(I=o[A-4>>2]))|0;I:if(!(1&I)){if(!(3&I))break A;if((C=C-(I=o[C>>2])|0)>>>0<t[780])break A;A=A+I|0;g:{C:{if(o[781]!=(0|C)){if(I>>>0<=255){if(B=I>>>3|0,(0|(I=o[C+12>>2]))==(0|(g=o[C+8>>2]))){o[776]=o[776]&EA(B);break I}o[g+12>>2]=I,o[I+8>>2]=g;break I}if(i=o[C+24>>2],(0|C)!=(0|(I=o[C+12>>2]))){g=o[C+8>>2],o[g+12>>2]=I,o[I+8>>2]=g;break g}if(!(g=o[(B=C+20|0)>>2])){if(!(g=o[C+16>>2]))break C;B=C+16|0}for(;E=B,(g=o[(B=(I=g)+20|0)>>2])||(B=I+16|0,g=o[I+16>>2]););o[E>>2]=0;break g}if(3!=(3&(I=o[Q+4>>2])))break I;return o[778]=A,o[Q+4>>2]=-2&I,o[C+4>>2]=1|A,void(o[Q>>2]=A)}I=0}if(i){g=o[C+28>>2];g:{if(o[(B=3408+(g<<2)|0)>>2]==(0|C)){if(o[B>>2]=I,I)break g;o[777]=o[777]&EA(g);break I}if(o[i+(o[i+16>>2]==(0|C)?16:20)>>2]=I,!I)break I}o[I+24>>2]=i,(g=o[C+16>>2])&&(o[I+16>>2]=g,o[g+24>>2]=I),(g=o[C+20>>2])&&(o[I+20>>2]=g,o[g+24>>2]=I)}}if(!(C>>>0>=Q>>>0)&&1&(I=o[Q+4>>2])){I:{g:{C:{B:{if(!(2&I)){if(o[782]==(0|Q)){if(o[782]=C,A=o[779]+A|0,o[779]=A,o[C+4>>2]=1|A,o[781]!=(0|C))break A;return o[778]=0,void(o[781]=0)}if(o[781]==(0|Q))return o[781]=C,A=o[778]+A|0,o[778]=A,o[C+4>>2]=1|A,void(o[A+C>>2]=A);if(A=(-8&I)+A|0,I>>>0<=255){if(B=I>>>3|0,(0|(I=o[Q+12>>2]))==(0|(g=o[Q+8>>2]))){o[776]=o[776]&EA(B);break g}o[g+12>>2]=I,o[I+8>>2]=g;break g}if(i=o[Q+24>>2],(0|Q)!=(0|(I=o[Q+12>>2]))){g=o[Q+8>>2],o[g+12>>2]=I,o[I+8>>2]=g;break C}if(!(g=o[(B=Q+20|0)>>2])){if(!(g=o[Q+16>>2]))break B;B=Q+16|0}for(;E=B,(g=o[(B=(I=g)+20|0)>>2])||(B=I+16|0,g=o[I+16>>2]););o[E>>2]=0;break C}o[Q+4>>2]=-2&I,o[C+4>>2]=1|A,o[A+C>>2]=A;break I}I=0}if(i){g=o[Q+28>>2];C:{if(o[(B=3408+(g<<2)|0)>>2]==(0|Q)){if(o[B>>2]=I,I)break C;o[777]=o[777]&EA(g);break g}if(o[i+(o[i+16>>2]==(0|Q)?16:20)>>2]=I,!I)break g}o[I+24>>2]=i,(g=o[Q+16>>2])&&(o[I+16>>2]=g,o[g+24>>2]=I),(g=o[Q+20>>2])&&(o[I+20>>2]=g,o[g+24>>2]=I)}}if(o[C+4>>2]=1|A,o[A+C>>2]=A,o[781]==(0|C))return void(o[778]=A)}if(A>>>0<=255)return I=3144+(-8&A)|0,(g=o[776])&(A=1<<(A>>>3))?A=o[I+8>>2]:(o[776]=A|g,A=I),o[I+8>>2]=C,o[A+12>>2]=C,o[C+12>>2]=I,void(o[C+8>>2]=A);g=31,A>>>0<=16777215&&(g=62+((A>>>38-(I=e(A>>>8|0))&1)-(I<<1)|0)|0),o[C+28>>2]=g,o[C+16>>2]=0,o[C+20>>2]=0,I=3408+(g<<2)|0;I:{g:{if((B=o[777])&(E=1<<g)){for(g=A<<(31!=(0|g)?25-(g>>>1|0)|0:0),I=o[I>>2];;){if(B=I,(-8&o[I+4>>2])==(0|A))break g;if(I=g>>>29|0,g<<=1,!(I=o[(E=B+(4&I)|0)+16>>2]))break}o[E+16>>2]=C,o[C+24>>2]=B}else o[777]=B|E,o[I>>2]=C,o[C+24>>2]=I;o[C+12>>2]=C,o[C+8>>2]=C;break I}A=o[B+8>>2],o[A+12>>2]=C,o[B+8>>2]=C,o[C+24>>2]=0,o[C+12>>2]=B,o[C+8>>2]=A}A=o[784]-1|0,o[784]=A||-1}}}function F(A,I,g,C){var B,E,r,t,e=0,D=0,c=0,F=0,Y=0;for(G=E=G-160|0,t=E+12|0,r=y(200),o[t>>2]=r,r||(f(111),Q()),G=B=G-208|0;;){if(25==(0|e)){for(;;){if(e=0,C>>>0<136){for(D=0;;){if(136==(0|e)){for(;(0|C)!=(0|D);)i[D+B|0]=n[g+D|0],D=D+1|0;break}i[e+B|0]=0,e=e+1|0}for(i[C+B|0]=31,i[B+135|0]=128|n[B+135|0],e=0;17!=(0|e);)D=o[(g=(C=e<<3)+r|0)>>2],c=o[g+4>>2],o[g>>2]=p(C+B|0)^D,o[g+4>>2]=h^c,e=e+1|0;G=B+208|0;break}for(;17!=(0|e);)F=o[(D=(c=e<<3)+r|0)>>2],Y=o[D+4>>2],o[D>>2]=p(g+c|0)^F,o[D+4>>2]=h^Y,e=e+1|0;u(r),g=g+136|0,C=C-136|0}break}o[(D=(e<<3)+r|0)>>2]=0,o[D+4>>2]=0,e=e+1|0}J(A,g=(I>>>0)/136|0,t);A:if((0|(g=a(g,136)))!=(0|I))for(C=I-g|0,A=A+g|0,J(E+16|0,1,E+12|0),I=0;;){if((0|I)==(0|C))break A;i[A+I|0]=n[(E+16|0)+I|0],I=I+1|0}s(o[E+12>>2]),G=E+160|0}function Y(A,I,g,C){for(var B=0,Q=0,i=0,E=0,r=0,t=0,a=0,e=0,f=0;;){A:{if(E=0,i=0,r=a=o[A+204>>2],!(!((t=C+(B=o[A+200>>2])|0)>>>0<C>>>0?r+1|0:r)&I>>>0>t>>>0)){for(;!(!i&(Q=I-B|0)>>>0<=E>>>0|0!=(0|i));)a=o[(r=(-8&(B=B+E|0))+A|0)+4>>2],t=n[g+E|0],Q=31&(B<<=3),(63&B)>>>0>=32?(B=t<<Q,Q=0):(B=(1<<Q)-1&t>>>32-Q,Q=t<<Q),o[r>>2]=Q^o[r>>2],o[r+4>>2]=B^a,i=(E=E+1|0)?i:i+1|0,B=o[A+200>>2],a=o[A+204>>2];o[A+200>>2]=0,o[A+204>>2]=0,u(A),g=g+Q|0,C=C-Q|0;continue}for(;;){if(!f&(0|C)==(0|e))break A;I=e+o[A+200>>2]|0,Q=o[(i=(-8&I)+A|0)+4>>2],E=n[g+e|0],I=31&(B=I<<3),(63&B)>>>0>=32?(B=E<<I,I=0):(B=(1<<I)-1&E>>>32-I,I=E<<I),o[i>>2]=I^o[i>>2],o[i+4>>2]=B^Q,I=f,f=(e=e+1|0)?I:I+1|0}}break}I=o[A+204>>2],I=(g=C+o[A+200>>2]|0)>>>0<C>>>0?I+1|0:I,o[A+200>>2]=g,o[A+204>>2]=I}function N(A,I,g,C){var B=0,Q=0,E=0,n=0,r=0,t=0,a=0,e=0;for(t=I;;){E=o[g+200>>2],n=o[g+204>>2];A:{if(!r&(0|B)==(0|t))Q=I;else{if(Q=B,(0|r)==(0|n)&E>>>0>B>>>0|r>>>0<n>>>0)break A;t=B}for(B=E-t|0,r=n-((E>>>0<t>>>0)+0|0)|0,t=I-Q|0,I=A+Q|0;o[g+200>>2]=B,o[g+204>>2]=r,t;){for(u(g),A=C>>>0>t>>>0?t:C,Q=0;(0|A)!=(0|Q);)n=o[(B=(-8&Q)+g|0)>>2],E=o[B+4>>2],B=31&(r=Q<<3&56),i[I+Q|0]=(63&r)>>>0>=32?E>>>B|0:((1<<B)-1&E)<<32-B|n>>>B,Q=Q+1|0;t=t-A|0,I=A+I|0,B=C-A|0,r=0}return}e=a=A+Q|0,a=o[(n=(-8&(E=B+(C-E|0)|0))+g|0)>>2],n=o[n+4>>2],Q=31&(E<<=3),i[0|e]=(63&E)>>>0>=32?n>>>Q|0:((1<<Q)-1&n)<<32-Q|a>>>Q,r=(B=B+1|0)?r:r+1|0}}function w(A,I){var g,C=0,B=0,Q=0,i=0,E=0,r=0;for(G=g=G-160|0,T(Q=g+12|0),aA(Q,I,32),eA(Q),tA(g+16|0,136,Q);;){if(!C&8==(0|B)){for(I=0;;){if(256==(0|I)){for(I=8,B=196;256!=(0|B);){for(;I>>>0>=136&&(tA(g+16|0,136,g+12|0),I=0),C=(g+16|0)+I|0,I=I+1|0,(C=n[0|C])>>>0>B>>>0;);C=(C<<2)+A|0,o[(B<<2)+A>>2]=o[C>>2],o[C>>2]=1-(E<<1&2),B=B+1|0,E=(1&r)<<31|E>>>1,r=r>>>1|0}fA(g+12|0),G=g+160|0;break}o[(I<<2)+A>>2]=0,I=I+1|0}break}Q=n[(g+16|0)+B|0],I=31&(i=B<<3),(63&i)>>>0>=32?(i=Q<<I,I=0):(i=(1<<I)-1&Q>>>32-I,I=Q<<I),E|=I,r|=i,C=(B=B+1|0)?C:C+1|0}}function S(A,I){for(var g=0,C=0,B=0,Q=0,E=0,r=0,t=0,e=0,f=0,D=0,c=0;8!=(0|r);){for(D=r<<8,c=a(r,7168)+A|0,E=0;7!=(0|E);){for(G=g=(G=B=G-864|0)-16|0,C=E+D|0,i[g+14|0]=C,i[g+15|0]=C>>>8,T(C=B+12|0),rA(C,I,32),rA(C,g+14|0,2),d(o[C>>2],168),G=g+16|0,g=840,nA(Q=B+16|0,840,C),C=L(e=(E<<10)+c|0,256,Q,840);C>>>0<=255;){for(t=g-(Q=(g>>>0)%3|0)|0,g=0;(0|g)!=(0|Q);)i[(f=B+16|0)+g|0]=n[(g+t|0)+f|0],g=g+1|0;nA((g=B+16|0)|Q,168,B+12|0),C=L((C<<2)+e|0,256-C|0,t=g,g=168|Q)+C|0}fA(B+12|0),G=B+864|0,E=E+1|0}r=r+1|0}}function k(A){var I=0,g=0,C=0,B=0,Q=0,i=0,E=0,n=0,r=0,t=0,a=0;Q=256,C=1;A:for(;;){I:{if(g=0,C>>>0>255)for(;;){if(256==(0|i))break I;I=K(I=o[(B=(i<<2)+A|0)>>2],I>>31,41978,0),o[B>>2]=AA(I,h),i=i+1|0}for(;;){g:{if(g>>>0<=255)for(n=g+C|0,t=(B=0-o[1312+((Q=Q-1|0)<<2)>>2]|0)>>31;;){if((0|g)==(0|n))break g;r=o[(I=(g<<2)+A|0)>>2],a=I,I=o[(E=(g+C<<2)+A|0)>>2],o[a>>2]=r+I,I=r-I|0,o[E>>2]=I,o[E>>2]=AA(K(I,I>>31,B,t),h),g=g+1|0}C<<=1;continue A}g=C+n|0}}break}}function H(A,I){for(var g=0,C=0,B=0,Q=0,i=0,E=0,r=0,t=0,e=0,f=0;32!=(0|B);)g=(B<<5)+A|0,C=a(B,3)+I|0,Q=7&n[0|C],o[g>>2]=Q,i=n[0|C]>>>3&7,o[g+4>>2]=i,E=n[C+1|0]<<2&4|n[0|C]>>>6,o[g+8>>2]=E,r=n[C+1|0]>>>1&7,o[g+12>>2]=r,t=n[C+1|0]>>>4&7,o[g+16>>2]=t,e=n[C+2|0]<<1&6|n[C+1|0]>>>7,o[g+20>>2]=e,f=n[C+2|0]>>>2&7,o[g+24>>2]=f,C=n[C+2|0],o[g+4>>2]=2-i,o[g>>2]=2-Q,o[g+8>>2]=2-E,o[g+12>>2]=2-r,o[g+16>>2]=2-t,o[g+20>>2]=2-e,o[g+24>>2]=2-f,o[g+28>>2]=2-(C>>>5|0),B=B+1|0}function U(A,I,g){var C=0,B=0,Q=0,i=0;return B=31&(Q=i=63&g),Q=Q>>>0>=32?-1>>>B|0:(C=-1>>>B|0)|(1<<B)-1<<32-B,Q&=A,C&=I,B=31&i,i>>>0>=32?(C=Q<<B,i=0):(C=(1<<B)-1&Q>>>32-B|C<<B,i=Q<<B),Q=C,C=31&(B=0-g&63),B>>>0>=32?(C=-1<<C,g=0):C=(g=-1<<C)|(1<<C)-1&-1>>>32-C,A&=g,I&=C,C=31&B,B>>>0>=32?(g=0,A=I>>>C|0):(g=I>>>C|0,A=((1<<C)-1&I)<<32-C|A>>>C),h=g|Q,A|=i}function R(A){var I=0,g=0,C=0,B=0,Q=0,i=0,E=0,n=0,r=0,t=0;for(g=128;I=0,g;){for(;I>>>0<=255;){for(i=I>>>0>(C=I+g|0)>>>0?I:C,r=(C=o[1312+((E=E+1|0)<<2)>>2])>>31;(0|I)!=(0|i);)Q=AA(K(Q=o[(B=(I+g<<2)+A|0)>>2],Q>>31,C,r),h),t=B,n=o[(B=(I<<2)+A|0)>>2],o[t>>2]=n-Q,o[B>>2]=Q+n,I=I+1|0;I=g+i|0}g=g>>>1|0}}function d(A,I){var g,C=0,B=0,Q=0;C=o[A+200>>2],g=o[(B=A+(-8&C)|0)+4>>2],C=31&(Q=C<<3),(63&Q)>>>0>=32?(Q=31<<C,C=0):(Q=(1<<C)-1&31>>>32-C,C=31<<C),o[B>>2]=C^o[B>>2],o[B+4>>2]=Q^g,Q=o[(I=(-8&(C=I-1|0))+A|0)+4>>2],C=31&(B=C<<3&56),(63&B)>>>0>=32?(B=128<<C,C=0):(B=(1<<C)-1&128>>>32-C,C=128<<C),o[I>>2]=C^o[I>>2],o[I+4>>2]=B^Q,o[A+200>>2]=0,o[A+204>>2]=0}function M(A,I){for(var g=0,C=0,B=0,Q=0,E=0,n=0,r=0,t=0,e=0;32!=(0|C);)n=o[(g=(C<<5)+I|0)+16>>2],r=o[g+12>>2],B=o[g+28>>2],t=o[g+20>>2],e=o[g+24>>2],Q=a(C,3)+A|0,E=16-(o[g+4>>2]<<3)|2-o[g>>2],g=2-o[g+8>>2]|0,i[0|Q]=E|g<<6,E=64-(B<<5)|0,B=2-t|0,i[Q+2|0]=E|8-(e<<2)|(254&B)>>>1,i[Q+1|0]=32-(n<<4)|4-(r<<1)|(252&g)>>>2|B<<7,C=C+1|0}function J(A,I,g){var C,B=0,Q=0,E=0,n=0,r=0,t=0,a=0;C=o[g>>2];A:for(;;){if(I)for(u(C),g=0;;){if(17==(0|g)){I=I-1|0,A=A+136|0;continue A}for(t=(B=g<<3)+A|0,a=o[(B=B+C|0)>>2],n=o[B+4>>2],Q=0,B=0;8!=(0|Q)|B;)E=31&(r=Q<<3),i[Q+t|0]=(63&r)>>>0>=32?n>>>E|0:((1<<E)-1&n)<<32-E|a>>>E,B=(Q=Q+1|0)?B:B+1|0;g=g+1|0;continue}break}}function q(A,I){for(var g=0,C=0,B=0,Q=0,i=0;128!=(0|i);)B=(i<<3)+A|0,g=a(i,5)+I|0,C=n[0|g],o[B>>2]=C,C|=n[g+1|0]<<8,o[B>>2]=C,C|=n[g+2|0]<<16&983040,o[B>>2]=C,Q=n[g+2|0]>>>4|0,o[B+4>>2]=Q,Q|=n[g+3|0]<<4,o[B+4>>2]=Q,g=n[g+4|0],o[B>>2]=524288-C,o[B+4>>2]=524288-(Q|g<<12),i=i+1|0}function l(A,I,g){for(var C=0,B=0,Q=0,i=0;!(I>>>0<=C>>>0|Q>>>0>135);)i=(B=n[g+Q|0])>>>4|0,Q=Q+1|0,15!=(0|(B&=15))&&(o[(C<<2)+A>>2]=2+(a(a(B,205)>>>10|0,5)-B|0),C=C+1|0),15==(0|i)|I>>>0<=C>>>0||(o[(C<<2)+A>>2]=2+(a(a(i,205)>>>10|0,5)-i|0),C=C+1|0);return C}function m(A,I,g){for(var C=0,B=0,Q=0,i=0,E=0,o=0;8!=(0|C);){for(G=B=G-1024|0,x(i=(C<<10)+A|0,E=a(C,7168)+I|0,g),Q=1;7!=(0|Q);)x(B,(o=Q<<10)+E|0,g+o|0),z(i,i,B),Q=Q+1|0;G=B+1024|0,C=C+1|0}}function L(A,I,g,C){for(var B=0,Q=0,i=0,E=0;!(I>>>0<=Q>>>0||(B=E+3|0)>>>0>C>>>0);)i=g+E|0,E=B,(B=n[i+2|0]<<16&8323072|n[0|i]|n[i+1|0]<<8)>>>0>8380416||(o[(Q<<2)+A>>2]=B,Q=Q+1|0);return Q}function p(A){for(var I=0,g=0,C=0,B=0,Q=0,i=0,E=0;!(!B&8==(0|g));)Q=n[A+g|0],I=31&(C=g<<3),(63&C)>>>0>=32?(C=Q<<I,I=0):(C=(1<<I)-1&Q>>>32-I,I=Q<<I),i|=I,E|=C,B=(g=g+1|0)?B:B+1|0;return h=E,i}function K(A,I,g,C){var B,Q,i,E,o=0,n=0;return E=a(o=g>>>16|0,n=A>>>16|0),o=(65535&(n=((i=a(B=65535&g,Q=65535&A))>>>16|0)+a(n,B)|0))+a(o,Q)|0,h=(a(I,g)+E|0)+a(A,C)+(n>>>16)+(o>>>16)|0,65535&i|o<<16}function b(A,I,g){for(var C=0,B=0,Q=0,i=0,E=0,n=0;8!=(0|B);){for(i=(C=B<<10)+A|0,E=I+C|0,n=g+C|0,C=0;256!=(0|C);)o[i+(Q=C<<2)>>2]=o[Q+E>>2]-o[Q+n>>2],C=C+1|0;B=B+1|0}}function v(A,I,g){var C,B;for(G=C=G-160|0,$(B=C+12|0,I,g),tA(I=C+16|0,136,B),g=l(A,256,I);g>>>0<=255;)tA(I=C+16|0,136,C+12|0),g=l((g<<2)+A|0,256-g|0,I)+g|0;fA(C+12|0),G=C+160|0}function j(A,I){for(var g=0,C=0,B=0,Q=0,E=0;8!=(0|C);){for(Q=(C<<7)+A|0,E=(C<<10)+I|0,g=0;128!=(0|g);)B=(g<<3)+E|0,i[g+Q|0]=o[B+4>>2]<<4|o[B>>2],g=g+1|0;C=C+1|0}}function O(A){for(var I=0,g=0,C=0,B=0,Q=0;8!=(0|g);){for(Q=(g<<10)+A|0,I=0;256!=(0|I);)B=o[(C=(I<<2)+Q|0)>>2],o[C>>2]=B+(B>>31&8380417),I=I+1|0;g=g+1|0}}function T(A){var I=0,g=0;for(I=A,A=y(208),o[I>>2]=A,A||(f(111),Q());25!=(0|g);)o[(I=A+(g<<3)|0)>>2]=0,o[I+4>>2]=0,g=g+1|0;o[A+200>>2]=0,o[A+204>>2]=0}function x(A,I,g){for(var C=0,B=0,Q=0;256!=(0|B);)C=K(C=o[(Q=B<<2)+g>>2],C>>31,C=o[I+Q>>2],C>>31),o[A+Q>>2]=AA(C,h),B=B+1|0}function W(A){var I,g;return(A=(I=o[584])+(g=A+7&-8)|0)>>>0<=I>>>0&&g||A>>>0>(C.byteLength/65536|0)<<16>>>0&&!(0|c(0|A))?(o[775]=48,-1):(o[584]=A,I)}function P(A,I){var g=0,C=0;if((0|I)<=1047552)for(;;){if(256==(0|C))return 0;if(g=C<<2,C=C+1|0,!(((g=o[A+g>>2])-(g<<1&g>>31)|0)<(0|I)))break}return 1}function V(A){for(var I=0,g=0,C=0;256!=(0|I);)C=o[(g=(I<<2)+A|0)>>2],o[g>>2]=C+a(C+4194304>>23,-8380417),I=I+1|0}function X(A,I){var g;return g=A,A=a(I+127>>7,1025)+2097152>>>22&15,I=a(A,-523776)+I|0,o[g>>2]=((0|I)>4190208?-8380417:0)+I,A}function Z(A){for(var I=0,g=0;;){if(7==(0|I))return 0;if(g=I<<10,I=I+1|0,P(A+g|0,524168))break}return 1}function _(A,I){for(var g=0,C=0;;){if(8==(0|g))return 0;if(C=g<<10,g=g+1|0,P(A+C|0,I))break}return 1}function z(A,I,g){for(var C=0,B=0;256!=(0|C);)o[(B=C<<2)+A>>2]=o[g+B>>2]+o[I+B>>2],C=C+1|0}function $(A,I,g){var C;G=C=G-16|0,i[C+14|0]=g,i[C+15|0]=g>>>8,T(A),aA(A,I,64),aA(A,C+14|0,2),eA(A),G=C+16|0}function AA(A,I){var g=0;return K(A,I,0,58728449),g=K(g=h,g>>31,-8380417,-1),I=I+h|0,A+g>>>0<A>>>0?I+1|0:I}function IA(A,I,g){for(var C=0,B=0;8!=(0|C);)z((B=C<<10)+A|0,I+B|0,g+B|0),C=C+1|0}function gA(A,I,g){for(var C=0,B=0;8!=(0|C);)x((B=C<<10)+A|0,I,g+B|0),C=C+1|0}function CA(A,I){var g=0;for(g=7168;i[0|A]=n[0|I],A=A+1|0,I=I+1|0,g=g-1|0;);}function BA(A,I){for(var g=0;(0|I)!=(0|g);)R((g<<10)+A|0),g=g+1|0}function QA(A){for(var I=0;8!=(0|I);)V((I<<10)+A|0),I=I+1|0}function iA(A){for(var I=0;8!=(0|I);)k((I<<10)+A|0),I=I+1|0}function EA(A){var I;return(-1>>>(I=31&A)&-2)<<I|(-1<<(A=0-A&31)&-2)>>>A}function oA(A){return A?31-e(A-1^A)|0:32}function nA(A,I,g){N(A,I,o[g>>2],168)}function rA(A,I,g){Y(o[A>>2],168,I,g)}function tA(A,I,g){N(A,I,o[g>>2],136)}function aA(A,I,g){Y(o[A>>2],136,I,g)}function eA(A){d(o[A>>2],136)}function fA(A){s(o[A>>2])}function DA(A){BA(A,8)}function cA(A){BA(A,7)}B(I=n,1024,\"cmFuZG9tYnl0ZXMAbGlic29kaXVtL3NyYy9saWJzb2RpdW0vcmFuZG9tYnl0ZXMvcmFuZG9tYnl0ZXMuYwBidWZfbGVuIDw9IFNJWkVfTUFY\"),B(I,1120,\"AQAAAAAAAACCgAAAAAAAAIqAAAAAAACAAIAAgAAAAICLgAAAAAAAAAEAAIAAAAAAgYAAgAAAAIAJgAAAAAAAgIoAAAAAAAAAiAAAAAAAAAAJgACAAAAAAAoAAIAAAAAAi4AAgAAAAACLAAAAAAAAgImAAAAAAACAA4AAAAAAAIACgAAAAAAAgIAAAAAAAACACoAAAAAAAAAKAACAAAAAgIGAAIAAAACAgIAAAAAAAIABAACAAAAAAAiAAIAAAACAAAAAAPdkAAACMdj/AxX4/0SeAwAYIfT/KKHy/yQeBwAr3hsAK+kjAK2E+v9/FOD/dZovAAn70/9Jei8AJ+UoAFiWKQBwoA8ApIXv/4i3NgCQnff/oOru/2j5JwB709//1q3f/+caxf/3pOr/mPzN/zXQGgAitP//ATI9AMVFBABnSikAIHYBAM30LgDF3jUAA6Xm/ywwyf/UR9n/r747AIUVxf98jtH/loo2AEE+1P8ABDYATWr7/5zWIwBdxff/PRLm/9bq5v8efjUAWa/F/z+ENQAXVt//XJTn/4xzOACoYwwAmhsIAHaPDgBTODsANIU7ADD82P9UnR8ALU/V/+UGxP+BrOj/z+HH/xmY0f9d1un/7gk1AMc1IQC7z+f/dc/s/3KXHQBysMH/9rzw/4BSz/+u0s//4JDI/8rvAQDyEDQAhf7w/zjGIACfbikAo7fS/0ukx/9tuvn/CTTa/4LC9f8TQe3/O6b///cJ7P/dK/r/1JUUAGNFHABiLOr/6fvM//AKBAAXxAcAiEUvAACtAAC+Nu//RM0NAFpnPADKK8f/ft7//0g5GQDAac7/bHUkAN/H/P+hmAsACOjr/2zkAgAIyMn/wjYwAPa/4/+TPNv/4Er9/wUTFACSdxQAJZ4TAODQ5/9EmfP/Agjq/6Lu0f+cx8T/V6DI/9mXOgCT6h8AWv8zANRYIwD4QToAcv/M//s9IgCfq9r/IqTJ//USBACHJSUA8CTt/12bNQCgSMr//KLG/1a77f/eRc//Xr4NABpeHADm4A0AWn8MAIOPBwCKYuf/BFf///wG+P8hAPb/9lrQ/4QAHwCG7zAAfbnJ/9b89/+SRfT/wiHJ/xk5BQAMYQQAQc3a/xuwPgDncjQAOwDN/8d8GgAkGQMA5V4rAJkRKQA6etj/cU0TABzhPQCECRMAUfAlAEZaGAAYhcb/vhQTAJE4KACQ28n/iVDS/z+FHABLCx0Apvbv/76o6/8b4RIAPl7N/y8t6v/kHfn/xwYUAINyMgBuDeL/U3ns/5lAHQB4Jdn/rQXr/wXkFgDn2wsA6B0iAM/4MwA0uff/DMrU//h/5v9X0eP/G5HY/xIsx//YEAkAH17G/1hG4f+LHSUAt3MlAI98/f+Y3R0AmGgzALvUAgCnk+3/vmzP/xx8AgAIqhgAcf0tAKVcDACaNxkAZ6HH/z2M5P88odH/OcU1ABUBOwDAHQQA98QhAPQb8f/nNRoADjQHAEV9+f/QTBoArnzk/2gmHQCYjub/Mybv/9oF/P/bf8X/ZCfT/6/h3f/dk/n/CR3d/5PMAgAFGPH/KpwYAKnlyf9Qivf/LM87AE5D///fNuv/yhU8AGheFQC2FvP/zike\"),B(I,2336,\"EA6A\");var GA,hA=((GA=[]).set=function(A,I){this[A]=I},GA.get=function(A){return this[A]},GA);return{e:function(){},f:hA,g:y,h:s,i:function(){var A;G=A=G-16|0,i[A+15|0]=0,D(2376,A+15|0,0),G=A+16|0},j:function(){return 2592},k:function(){return 4864},l:function(){return 4597},m:function(A,I){A|=0,I|=0;var g,C=0,B=0,Q=0,E=0,r=0,t=0,e=0,f=0,c=0,h=0,y=0,u=0,s=0;for(G=g=G-96416|0,r=g+96288|0;32!=(0|B);)G=E=G-16|0,i[E+15|0]=0,t=0|D(2340,E+15|0,0),G=E+16|0,i[B+r|0]=t,B=B+1|0;for(F(r,128,r,32),S(E=g+38912|0,r),c=g+31744|0,B=g+96320|0;7!=(0|C);)v(c+(C<<10)|0,B,65535&Q),C=C+1|0,Q=Q+1|0;for(h=g+16384|0,C=0,Q=7;8!=(0|C);)v(h+(C<<10)|0,B,65535&Q),C=C+1|0,Q=Q+1|0;for(CA(C=g+24576|0,c),cA(C),m(Q=g- -8192|0,E,C),QA(Q),iA(Q),IA(Q,Q,h),O(Q),C=0;8!=(0|C);){for(y=(B=C<<10)+Q|0,e=B+g|0,f=B+Q|0,B=0;256!=(0|B);)t=(u=o[(E=B<<2)+f>>2])+4095|0,o[E+e>>2]=u-(-8192&t),o[E+y>>2]=t>>13,B=B+1|0;C=C+1|0}for(C=0;32!=(0|C);)i[A+C|0]=n[C+r|0],C=C+1|0;for(y=A+32|0,C=0;8!=(0|C);){for(e=y+a(C,320)|0,f=Q+(C<<10)|0,E=0;64!=(0|E);)t=e+a(E,5)|0,B=f+(E<<4)|0,i[0|t]=o[B>>2],i[t+1|0]=o[B+4>>2]<<2|o[B>>2]>>>8,i[t+2|0]=o[B+8>>2]<<4|o[B+4>>2]>>>6,i[t+3|0]=o[B+12>>2]<<6|o[B+8>>2]>>>4,i[t+4|0]=o[B+12>>2]>>>2,E=E+1|0;C=C+1|0}for(F(Q=g+96256|0,32,A,2592),A=g+96384|0,C=0;32!=(0|C);)i[I+C|0]=n[C+r|0],C=C+1|0;for(B=I+32|0,C=0;32!=(0|C);)i[C+B|0]=n[A+C|0],C=C+1|0;for(A=I- -64|0,C=0;32!=(0|C);)i[A+C|0]=n[C+Q|0],C=C+1|0;for(A=I+96|0,C=0;7!=(0|C);)M(A+a(C,96)|0,c+(C<<10)|0),C=C+1|0;for(A=I+768|0,C=0;8!=(0|C);)M(A+a(C,96)|0,h+(C<<10)|0),C=C+1|0;for(t=I+1536|0,C=0;8!=(0|C);){for(c=t+a(C,416)|0,h=(C<<10)+g|0,Q=0;32!=(0|Q);)y=o[(I=h+(Q<<5)|0)+20>>2],e=o[I+8>>2],f=o[I+28>>2],E=o[I+24>>2],r=o[I+16>>2],B=o[I+12>>2],u=o[I+4>>2],A=c+a(Q,13)|0,s=4096-o[I>>2]|0,i[0|A]=s,I=4096-u|0,i[A+2|0]=I>>>3,B=4096-B|0,i[A+5|0]=B>>>1,r=4096-r|0,i[A+7|0]=r>>>4,E=4096-E|0,i[A+10|0]=E>>>2,f=4096-f|0,i[A+12|0]=f>>>5,i[A+1|0]=I<<5|s>>>8,e=4096-e|0,i[A+3|0]=e<<2|I>>>11,i[A+4|0]=B<<7|e>>>6,i[A+6|0]=r<<4|B>>>9,I=4096-y|0,i[A+8|0]=I<<1|r>>>12,i[A+9|0]=E<<6|I>>>7,i[A+11|0]=f<<3|E>>>10,Q=Q+1|0;C=C+1|0}return G=g+96416|0,0},n:function(A,I,g,C){I|=0,g|=0,C|=0;var B,Q,r,t=0,e=0,f=0,D=0,c=0,h=0,y=0,u=0,s=0,Y=0,N=0,U=0,d=0,M=0,J=0,l=0,L=0,p=0,K=0,v=0;for(Q=(A|=0)+2|0,G=B=(G=r=G-16|0)-121072|0,e=U=B+120848|0,f=d=B+120880|0,D=B+120912|0,c=B+33808|0,h=B+56336|0,y=B+25616|0;32!=(0|t);)i[t+e|0]=n[C+t|0],t=t+1|0;for(e=C+32|0,t=0;32!=(0|t);)i[t+D|0]=n[t+e|0],t=t+1|0;for(e=C- -64|0,t=0;32!=(0|t);)i[t+f|0]=n[t+e|0],t=t+1|0;for(e=C+96|0,t=0;7!=(0|t);)H(h+(t<<10)|0,e+a(t,96)|0),t=t+1|0;for(e=C+768|0,t=0;8!=(0|t);)H(y+(t<<10)|0,e+a(t,96)|0),t=t+1|0;for(L=C+1536|0,t=0;8!=(0|t);){for(p=c+(t<<10)|0,K=L+a(t,416)|0,f=0;32!=(0|f);)C=p+(f<<5)|0,e=K+a(f,13)|0,M=n[0|e],o[C>>2]=M,M|=n[e+1|0]<<8&7936,o[C>>2]=M,u=n[e+1|0]>>>5|0,o[C+4>>2]=u,u|=n[e+2|0]<<3,o[C+4>>2]=u,u|=n[e+3|0]<<11&6144,o[C+4>>2]=u,J=n[e+3|0]>>>2|0,o[C+8>>2]=J,J|=n[e+4|0]<<6&8128,o[C+8>>2]=J,s=n[e+4|0]>>>7|0,o[C+12>>2]=s,s|=n[e+5|0]<<1,o[C+12>>2]=s,s|=n[e+6|0]<<9&7680,o[C+12>>2]=s,Y=n[e+6|0]>>>4|0,o[C+16>>2]=Y,Y|=n[e+7|0]<<4,o[C+16>>2]=Y,Y|=n[e+8|0]<<12&4096,o[C+16>>2]=Y,l=n[e+8|0]>>>1|0,o[C+20>>2]=l,l|=n[e+9|0]<<7&8064,o[C+20>>2]=l,N=n[e+9|0]>>>6|0,o[C+24>>2]=N,N|=n[e+10|0]<<2,o[C+24>>2]=N,N|=n[e+11|0]<<10&7168,o[C+24>>2]=N,v=n[e+11|0]>>>3|0,o[C+28>>2]=v,e=n[e+12|0],o[C+4>>2]=4096-u,o[C>>2]=4096-M,o[C+8>>2]=4096-J,o[C+12>>2]=4096-s,o[C+16>>2]=4096-Y,o[C+20>>2]=4096-l,o[C+24>>2]=4096-N,o[C+28>>2]=4096-(e<<5|v),f=f+1|0;t=t+1|0}for(T(C=B+12|0),aA(C,d,32),aA(C,I,g),eA(C),tA(d=B+120944|0,64,C),fA(C),F(L=B+121008|0,64,D,96),S(B+63504|0,U),cA(h),DA(y),DA(c),t=0;;){for(e=B+49168|0,f=a(65535&t,7),I=0;7!=(0|I);)G=g=G-704|0,$(C=g+12|0,L,I+f&65535),tA(D=g+16|0,680,C),fA(C),q(e+(I<<10)|0,D),G=g+704|0,I=I+1|0;for(CA(C=B+42e3|0,e),cA(C),m(I=B+17424|0,B+63504|0,C),QA(I),iA(I),O(I),c=B+9232|0,g=0;8!=(0|g);){for(h=(f=g<<10)+I|0,y=f+c|0,U=I+f|0,f=0;256!=(0|f);)o[(D=f<<2)+h>>2]=X(D+y|0,o[D+U>>2]),f=f+1|0;g=g+1|0}for(j(Q,I),T(I=B+12|0),aA(I,d,64),aA(I,Q,1024),eA(I),tA(Q,32,I),fA(I),w(I=B+16|0,Q),t=t+1|0,R(I),f=B+56336|0,g=0;7!=(0|g);)x((D=g<<10)+C|0,I,f+D|0),g=g+1|0;for(I=0;7!=(0|I);)k(C+(I<<10)|0),I=I+1|0;for(I=0;7!=(0|I);)z((g=I<<10)+C|0,g+C|0,g+e|0),I=I+1|0;for(g=0;7!=(0|g);)V(C+(g<<10)|0),g=g+1|0;if(!Z(C)&&(gA(g=B+1040|0,B+16|0,B+25616|0),iA(g),b(I=B+9232|0,I,g),QA(I),!_(I,261768)&&(gA(I=B+1040|0,B+16|0,B+33808|0),iA(I),QA(I),!_(I,261888)))){for(IA(e=B+9232|0,e,h=B+1040|0),y=B+17424|0,I=0,g=0;8!=(0|I);){for(U=(C=I<<10)+h|0,p=C+e|0,K=C+y|0,C=0,f=0;256!=(0|C);)c=-261888==(0|(c=o[(D=C<<2)+p>>2]))&0!=o[D+K>>2]|c-261889>>>0<4294443519,o[D+U>>2]=c,f=f+c|0,C=C+1|0;g=g+f|0,I=I+1|0}if(!(g>>>0>75))break}}for(f=B+42e3|0,D=B+1040|0,I=0;32!=(0|I);)i[0|(g=I+Q|0)]=n[0|g],I=I+1|0;for(c=Q+32|0,I=0;7!=(0|I);){for(h=c+a(I,640)|0,y=f+(I<<10)|0,g=0;128!=(0|g);)e=o[(t=y+(g<<3)|0)+4>>2],C=h+a(g,5)|0,t=524288-o[t>>2]|0,i[0|C]=t,i[C+1|0]=t>>>8,e=524288-e|0,i[C+3|0]=e>>>4,i[C+4|0]=e>>>12,i[C+2|0]=e<<4|t>>>16,g=g+1|0;I=I+1|0}for(t=Q+4512|0,g=0,I=0;;){if(83==(0|I)){for(C=0;8!=(0|g);){for(e=D+(g<<10)|0,I=0;256!=(0|I);)o[e+(I<<2)>>2]&&(i[C+t|0]=I,C=C+1|0),I=I+1|0;i[75+(g+t|0)|0]=C,g=g+1|0}break}i[I+t|0]=0,I=I+1|0}return o[r+12>>2]=4595,G=B+121072|0,E[A>>1]=o[r+12>>2],G=r+16|0,0},o:function(A,I,g,C){A|=0,I|=0,C|=0;var B,Q=0,E=0,t=0,e=0,f=0,D=0,c=0,h=0,y=0,u=0,s=0;t=(g|=0)+2|0,Q=r[g>>1],f=A,E=I,g=0,G=B=G-91312|0,u=-1;A:if(4595==(0|Q)){for(A=B+90256|0,h=B+16400|0,I=0;32!=(0|I);)i[A+I|0]=n[I+C|0],I=I+1|0;for(D=C+32|0,I=0;8!=(0|I);){for(c=h+(I<<10)|0,y=D+a(I,320)|0,Q=0;64!=(0|Q);)e=c+(Q<<4)|0,A=a(Q,5)+y|0,o[e>>2]=n[A+1|0]<<8&768|n[0|A],o[e+4>>2]=n[A+2|0]<<6&960|n[A+1|0]>>>2,o[e+8>>2]=n[A+3|0]<<4&1008|n[A+2|0]>>>4,o[e+12>>2]=n[A+4|0]<<2|n[A+3|0]>>>6,Q=Q+1|0;I=I+1|0}for(A=B+90160|0,I=B+24592|0,h=B+16|0;32!=(0|g);)i[A+g|0]=n[g+t|0],g=g+1|0;for(A=t+32|0,g=0;7!=(0|g);)q(I+(g<<10)|0,A+a(g,640)|0),g=g+1|0;t=t+4512|0,Q=0,A=0;I:{for(;;){g:if(8!=(0|Q)){for(e=h+(Q<<10)|0,g=0;256!=(0|g);)o[e+(g<<2)>>2]=0,g=g+1|0;if(!((I=n[(D=Q+t|0)+75|0])>>>0>75||(g=A,I>>>0<A>>>0))){for(;I>>>0>g>>>0;){if(A>>>0<g>>>0&(I=n[0|(c=g+t|0)])>>>0<=n[c-1|0])break g;o[e+(I<<2)>>2]=1,g=g+1|0,I=n[D+75|0]}Q=Q+1|0,A=I;continue}}else for(g=A>>>0<=75?75:A;;){if(I=0,(0|A)==(0|g))break I;if(I=A+t|0,A=A+1|0,n[0|I])break}break}I=1}if(!I&&!Z(B+24592|0)){for(F(Q=B+90192|0,32,C,2592),T(A=B+12|0),aA(A,Q,32),aA(A,f,E),eA(A),tA(Q,64,A),fA(A),w(E=B+89104|0,B+90160|0),S(I=B+31760|0,B+90256|0),cA(C=B+24592|0),m(g=B+8208|0,I,C),R(E),C=B+16400|0,I=0;8!=(0|I);){for(t=C+(I<<10)|0,f=0;256!=(0|f);)o[(e=t+(f<<2)|0)>>2]=o[e>>2]<<13,f=f+1|0;I=I+1|0}for(DA(C),gA(C,E,C),b(g,g,C),QA(g),iA(g),O(g),e=B+16|0,C=0;8!=(0|C);){for(h=(I=C<<10)+g|0,D=I+g|0,c=I+e|0,I=0;256!=(0|I);)y=(E=I<<2)+h|0,s=o[E+c>>2],G=f=G-16|0,E=t=X(f+12|0,o[E+D>>2]),s&&(E=t+1&15,o[f+12>>2]>0||(E=t-1&15)),G=f+16|0,o[y>>2]=E,I=I+1|0;C=C+1|0}for(j(I=B+90288|0,g),T(A),aA(A,Q,64),aA(A,I,1024),eA(A),tA(B+90128|0,32,A),fA(A),I=0;;){if(32==(0|I)){u=0;break A}if(A=(B+90128|0)+I|0,g=(B+90160|0)+I|0,I=I+1|0,n[0|g]!=n[0|A])break}}}return G=B+91312|0,0|u}}}(A)}(I)},instantiate:function(A,I){return{then:function(g){var C=new c.Module(A);g({instance:new c.Instance(C,I)})}}},RuntimeError:Error};a=[],\"object\"!=A(c)&&d(\"no native wasm support detected\");var G,h,y,u,s=!1;var F,Y,N=C.INITIAL_MEMORY||16777216;F=\"INITIAL_MEMORY should be larger than STACK_SIZE, was \"+N+\"! (STACK_SIZE=8388608)\",N>=8388608||d(F),f=C.wasmMemory?C.wasmMemory:new c.Memory({initial:N/65536,maximum:N/65536}),Y=f.buffer,C.HEAP8=G=new Int8Array(Y),C.HEAP16=new Int16Array(Y),C.HEAP32=y=new Int32Array(Y),C.HEAPU8=h=new Uint8Array(Y),C.HEAPU16=new Uint16Array(Y),C.HEAPU32=new Uint32Array(Y),C.HEAPF32=new Float32Array(Y),C.HEAPF64=u=new Float64Array(Y),N=f.buffer.byteLength;var w=[],S=[],k=[];var H=0,U=null,R=null;function d(A){throw C.onAbort&&C.onAbort(A),e(A=\"Aborted(\"+A+\")\"),s=!0,1,A+=\". Build with -sASSERTIONS for more info.\",new c.RuntimeError(A)}var M,J,q=\"data:application/octet-stream;base64,\";function l(A){return A.startsWith(q)}function m(A){return A.startsWith(\"file://\")}function L(A){return Promise.resolve().then((function(){return function(A){if(A==M&&a)return new Uint8Array(a);var I=P(A);if(I)return I;if(g)return g(A);throw\"both async and sync fetching of the wasm failed\"}(A)}))}function p(A,I,g,C){return function(A,I,g){return L(A).then((function(A){return c.instantiate(A,I)})).then((function(A){return A})).then(g,(function(A){e(\"failed to asynchronously prepare wasm: \"+A),d(A)}))}(I,g,C)}l(M=\"<<< WASM_BINARY_FILE >>>\")||(J=M,M=C.locateFile?C.locateFile(J,n):n+J);var K={2340:function(){return C.getRandomValue()},2376:function(){if(void 0===C.getRandomValue)try{var I=\"object\"===(\"undefined\"==typeof window?\"undefined\":A(window))?window:self,g=void 0!==I.crypto?I.crypto:I.msCrypto,B=function(){var A=new Uint32Array(1);return g.getRandomValues(A),A[0]>>>0};B(),C.getRandomValue=B}catch(A){try{var Q=eval(\"require\")(\"crypto\"),i=function(){var A=Q.randomBytes(4);return(A[0]<<24|A[1]<<16|A[2]<<8|A[3])>>>0};i(),C.getRandomValue=i}catch(A){throw\"No secure random number generator found\"}}}};function b(A){this.name=\"ExitStatus\",this.message=\"Program terminated with exit(\".concat(A,\")\"),this.status=A}var v=function(A){for(;A.length>0;)A.shift()(C)};\"undefined\"!=typeof TextDecoder&&new TextDecoder(\"utf8\");var j,O=[],T=function(A,I,g){var C=function(A,I){var g;for(O.length=0,I>>=2;g=h[A++];)I+=105!=g&I,O.push(105==g?y[I]:u[I++>>1]),++I;return O}(I,g);return K[A].apply(null,C)},x=function(A){A,D||(C.onExit&&C.onExit(A),s=!0),Q(A,new b(A))},W={c:function(A,I,g){return T(A,I,g)},d:function(A){h.length;d(\"OOM\")},b:function(A,I){A,x(A)},a:f};(function(){var A={a:W};function I(A,I){var g,B=A.exports;return C.asm=B,C.asm.f,g=C.asm.e,S.unshift(g),function(A){if(H--,C.monitorRunDependencies&&C.monitorRunDependencies(H),0==H&&(null!==U&&(clearInterval(U),U=null),R)){var I=R;R=null,I()}}(),B}if(H++,C.monitorRunDependencies&&C.monitorRunDependencies(H),C.instantiateWasm)try{return C.instantiateWasm(A,I)}catch(A){return e(\"Module.instantiateWasm callback failed with error: \"+A),!1}p(0,M,A,(function(A){I(A.instance)}))})(),C._malloc=function(){return(C._malloc=C.asm.g).apply(null,arguments)},C._free=function(){return(C._free=C.asm.h).apply(null,arguments)},C._dilithiumjs_init=function(){return(C._dilithiumjs_init=C.asm.i).apply(null,arguments)},C._dilithiumjs_public_key_bytes=function(){return(C._dilithiumjs_public_key_bytes=C.asm.j).apply(null,arguments)},C._dilithiumjs_secret_key_bytes=function(){return(C._dilithiumjs_secret_key_bytes=C.asm.k).apply(null,arguments)},C._dilithiumjs_signature_bytes=function(){return(C._dilithiumjs_signature_bytes=C.asm.l).apply(null,arguments)},C._dilithiumjs_keypair=function(){return(C._dilithiumjs_keypair=C.asm.m).apply(null,arguments)},C._dilithiumjs_sign=function(){return(C._dilithiumjs_sign=C.asm.n).apply(null,arguments)},C._dilithiumjs_verify=function(){return(C._dilithiumjs_verify=C.asm.o).apply(null,arguments)};function P(A){if(l(A))return function(A){if(void 0!==o&&o){var I=Buffer.from(A,\"base64\");return new Uint8Array(I.buffer,I.byteOffset,I.byteLength)}try{for(var g=atob(A),C=new Uint8Array(g.length),B=0;B<g.length;++B)C[B]=g.charCodeAt(B);return C}catch(A){throw new Error(\"Converting base64 string to bytes failed.\")}}(A.slice(q.length))}function V(){function A(){j||(j=!0,C.calledRun=!0,s||(!0,v(S),C.onRuntimeInitialized&&C.onRuntimeInitialized(),function(){if(C.postRun)for(\"function\"==typeof C.postRun&&(C.postRun=[C.postRun]);C.postRun.length;)A=C.postRun.shift(),k.unshift(A);var A;v(k)}()))}H>0||(!function(){if(C.preRun)for(\"function\"==typeof C.preRun&&(C.preRun=[C.preRun]);C.preRun.length;)A=C.preRun.shift(),w.unshift(A);var A;v(w)}(),H>0||(C.setStatus?(C.setStatus(\"Running...\"),setTimeout((function(){setTimeout((function(){C.setStatus(\"\")}),1),A()}),1)):A()))}if(C.writeArrayToMemory=function(A,I){G.set(A,I)},R=function A(){j||V(),j||(R=A)},C.preInit)for(\"function\"==typeof C.preInit&&(C.preInit=[C.preInit]);C.preInit.length>0;)C.preInit.pop()();return V(),new Promise((function(A,I){C.onAbort=I,C.onRuntimeInitialized=function(){A(C)}}))})).then((function(A){Object.keys(A).forEach((function(I){C[I]=A[I]}))}));var E=C.ready.then((function(){C._dilithiumjs_init(),A=C._dilithiumjs_public_key_bytes(),I=C._dilithiumjs_secret_key_bytes(),g=C._dilithiumjs_signature_bytes()})),o={publicKeyBytes:E.then((function(){return A})),privateKeyBytes:E.then((function(){return I})),bytes:E.then((function(){return g})),keyPair:function(){return E.then((function(){var g=C._malloc(A),E=C._malloc(I);try{return B(C._dilithiumjs_keypair(g,E),{publicKey:Q(g,A),privateKey:Q(E,I)})}finally{i(g),i(E)}}))},sign:function(A,I){return o.signDetached(A,I).then((function(I){var C=new Uint8Array(g+A.length);return C.set(I),C.set(A,g),C}))},signDetached:function(A,o){return E.then((function(){var E=C._malloc(g),n=C._malloc(A.length),r=C._malloc(I);C.writeArrayToMemory(new Uint8Array(g),E),C.writeArrayToMemory(A,n),C.writeArrayToMemory(o,r);try{return B(C._dilithiumjs_sign(E,n,A.length,r),Q(E,g))}finally{i(E),i(n),i(r)}}))},open:function(A,I){return E.then((function(){var C=new Uint8Array(A.buffer,A.byteOffset,g),B=new Uint8Array(A.buffer,A.byteOffset+g,A.length-g);return o.verifyDetached(C,B,I).then((function(A){if(A)return B;throw new Error(\"Failed to open Dilithium signed message.\")}))}))},verifyDetached:function(I,B,Q){return E.then((function(){var E=C._malloc(g),o=C._malloc(B.length),n=C._malloc(A);C.writeArrayToMemory(I,E),C.writeArrayToMemory(B,o),C.writeArrayToMemory(Q,n);try{return 0===C._dilithiumjs_verify(o,B.length,E,n)}finally{i(E),i(o),i(n)}}))}};return o}();\"undefined\"!=typeof module&&module.exports?(dilithium.dilithium=dilithium,module.exports=dilithium):self.dilithium=dilithium;", "/**\r\n * Browser entry point for @lumen/keys SDK\r\n * Includes WASM initialization and browser-compatible exports\r\n */\r\n\r\nimport { DefaultKeySDK } from './sdk.js';\r\nimport { \r\n InMemoryKeyStorage, \r\n KeyRegistry,\r\n SignatureSuiteRegistry,\r\n BsvEcdsaSuite,\r\n MlDsa44Suite,\r\n MlDsa65Suite,\r\n MlDsa87Suite,\r\n MlDsaSuite,\r\n} from '@smartledger/crypto';\r\nimport type { KeySDK } from './types.js';\r\n\r\n// Re-export all types for browser usage\r\nexport * from './types.js';\r\nexport { InMemoryKeyStorage } from '@smartledger/crypto';\r\n\r\n/**\r\n * Creates a new KeySDK instance for browser usage\r\n * Handles WASM initialization automatically\r\n */\r\nexport async function createKeySDK(): Promise<KeySDK> {\r\n const storage = new InMemoryKeyStorage();\r\n const keyRegistry = new KeyRegistry(storage);\r\n \r\n // Initialize suite registry with ECDSA and all ML-DSA variants\r\n const suiteRegistry = new SignatureSuiteRegistry();\r\n suiteRegistry.register(new BsvEcdsaSuite());\r\n suiteRegistry.register(new MlDsa44Suite()); // Level 2 (AES-128 equivalent)\r\n suiteRegistry.register(new MlDsa65Suite()); // Level 3 (AES-192 equivalent)\r\n suiteRegistry.register(new MlDsa87Suite()); // Level 5 (AES-256 equivalent)\r\n suiteRegistry.register(new MlDsaSuite()); // Alias for MlDsa65Suite\r\n \r\n const sdk = new DefaultKeySDK({\r\n keyRegistry,\r\n suiteRegistry,\r\n });\r\n \r\n // Pre-initialize WASM for ML-DSA if needed\r\n // The dilithium-crystals library will lazy-load WASM on first use\r\n \r\n return sdk;\r\n}\r\n\r\n/**\r\n * Browser-ready default export\r\n */\r\nexport default {\r\n createKeySDK,\r\n};\r\n\r\n// Global export for CDN usage\r\nif (typeof window !== 'undefined') {\r\n (window as any).LumenKeys = {\r\n createKeySDK,\r\n };\r\n}\r\n", "/**\r\n * Default implementation of KeySDK.\r\n * \r\n * Integrates KeyRegistry and SignatureSuiteRegistry to provide\r\n * a clean, high-level API for key operations.\r\n */\r\n\r\nimport {\r\n KeyRegistry,\r\n SignatureSuiteRegistry,\r\n KeyMeta,\r\n CryptoProfile,\r\n hashBytes,\r\n BIP32Derivation,\r\n InMemoryKeyStorage,\r\n BsvEcdsaSuite,\r\n MlDsa87Suite,\r\n} from '@smartledger/crypto';\r\nimport {\r\n KeySDK,\r\n KeyRecord,\r\n CreateKeyOptions,\r\n AgentKeyConfig,\r\n MultiSignatureResult,\r\n MultiVerificationResult,\r\n SuiteSignature,\r\n SuiteVerificationResult,\r\n} from './types.js';\r\n\r\n/**\r\n * Configuration for DefaultKeySDK.\r\n */\r\nexport interface KeySDKConfig {\r\n /** Key registry instance */\r\n keyRegistry: KeyRegistry;\r\n \r\n /** Signature suite registry instance */\r\n suiteRegistry: SignatureSuiteRegistry;\r\n}\r\n\r\n/**\r\n * Default KeySDK implementation.\r\n * \r\n * Provides a simple, safe API for key operations while hiding complexity.\r\n */\r\nexport class DefaultKeySDK implements KeySDK {\r\n private keyRegistry: KeyRegistry;\r\n private suiteRegistry: SignatureSuiteRegistry;\r\n private keyCounter = new Map<string, number>(); // agentId -> counter\r\n private counterInitialized = new Set<string>();\r\n private counterInitPromises = new Map<string, Promise<void>>();\r\n \r\n constructor(config: KeySDKConfig) {\r\n this.keyRegistry = config.keyRegistry;\r\n this.suiteRegistry = config.suiteRegistry;\r\n }\r\n \r\n /**\r\n * Create a new key for an agent.\r\n */\r\n async createKey(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n options: CreateKeyOptions = {}\r\n ): Promise<KeyRecord> {\r\n // Get suite\r\n const suite = this.suiteRegistry.getSuite(profile.primarySignatureSuite);\r\n \r\n // Generate keypair (with optional derivation)\r\n let keypair;\r\n \r\n if (options.derivationContext) {\r\n // Check if suite supports derivation\r\n if (!suite.capabilities?.derivation) {\r\n const available = this.getSuitesWithCapability('derivation');\r\n throw new Error(\r\n `Suite '${suite.suiteId}' does not support key derivation.\\n` +\r\n (available.length > 0\r\n ? `Suites with derivation capability: ${available.join(', ')}\\n` +\r\n `Consider using one of these suites or remove the derivationContext option.`\r\n : `No suites currently support derivation. Remove the derivationContext option.`)\r\n );\r\n }\r\n \r\n // Use derivation capability\r\n keypair = await suite.capabilities.derivation.deriveKeypair(options.derivationContext);\r\n } else {\r\n // Standard random key generation\r\n keypair = await suite.generateKeypair();\r\n }\r\n \r\n // Generate unique keyId\r\n const counter = await this.getNextCounter(agentId);\r\n const suiteName = profile.primarySignatureSuite.split('-')[0]; // 'ml-dsa' or 'bsv'\r\n const keyId = `${agentId}:pk-${suiteName}-${counter}`;\r\n \r\n // Register key\r\n const meta = await this.keyRegistry.registerKey(\r\n keyId,\r\n keypair,\r\n profile.primarySignatureSuite,\r\n {\r\n expiresAt: options.expiresAt,\r\n usage: options.usage || ['signing'],\r\n cryptoProfileVersion: options.cryptoProfileVersion || '1.0.0',\r\n }\r\n );\r\n \r\n return {\r\n meta,\r\n publicKey: keypair.publicKey,\r\n };\r\n }\r\n \r\n /**\r\n * Get an existing key.\r\n */\r\n async getKey(keyId: string): Promise<KeyRecord | null> {\r\n const result = await this.keyRegistry.getPublicKey(keyId);\r\n \r\n if (!result) {\r\n return null;\r\n }\r\n \r\n return {\r\n meta: result.meta,\r\n publicKey: result.publicKey,\r\n };\r\n }\r\n \r\n /**\r\n * Sign with a key (private key never exposed).\r\n */\r\n async signWithKey(\r\n keyId: string,\r\n message: Uint8Array\r\n ): Promise<Uint8Array> {\r\n // Get full keypair (private access)\r\n const result = await this.keyRegistry.getKey(keyId);\r\n \r\n if (!result) {\r\n throw new Error(`Key not found: ${keyId}`);\r\n }\r\n \r\n if (result.meta.status !== 'active') {\r\n throw new Error(`Key is not active: ${keyId} (status: ${result.meta.status})`);\r\n }\r\n \r\n // Get suite and sign\r\n const suite = this.suiteRegistry.getSuite(result.meta.suiteId);\r\n \r\n // Hash the message (consistent with signAgentResponse)\r\n const hashAlg = this.getHashAlgorithm(result.meta.suiteId);\r\n const messageHash = await hashBytes(message, hashAlg);\r\n \r\n return await suite.sign(result.keypair.privateKey, messageHash);\r\n }\r\n \r\n /**\r\n * Verify a signature.\r\n */\r\n async verifySignature(\r\n keyId: string,\r\n message: Uint8Array,\r\n signature: Uint8Array\r\n ): Promise<boolean> {\r\n const result = await this.keyRegistry.getPublicKey(keyId);\r\n \r\n if (!result) {\r\n return false;\r\n }\r\n \r\n const suite = this.suiteRegistry.getSuite(result.meta.suiteId);\r\n \r\n // Hash the message\r\n const hashAlg = this.getHashAlgorithm(result.meta.suiteId);\r\n const messageHash = await hashBytes(message, hashAlg);\r\n \r\n try {\r\n return await suite.verify(result.publicKey, messageHash, signature);\r\n } catch {\r\n return false;\r\n }\r\n }\r\n \r\n /**\r\n * List keys for an agent.\r\n */\r\n async listKeysForAgent(\r\n agentId: string,\r\n activeOnly: boolean = true\r\n ): Promise<KeyRecord[]> {\r\n const keys = activeOnly\r\n ? await this.keyRegistry.listActiveKeys()\r\n : await this.keyRegistry.listKeys();\r\n \r\n // Filter by agentId prefix\r\n const agentKeys = keys.filter(meta => meta.keyId.startsWith(`${agentId}:`));\r\n \r\n // Convert to KeyRecords\r\n const records: KeyRecord[] = [];\r\n \r\n for (const meta of agentKeys) {\r\n const result = await this.keyRegistry.getPublicKey(meta.keyId);\r\n if (result) {\r\n records.push({\r\n meta: result.meta,\r\n publicKey: result.publicKey,\r\n });\r\n }\r\n }\r\n \r\n return records;\r\n }\r\n \r\n /**\r\n * Get active crypto profile for an agent.\r\n */\r\n async getActiveCryptoProfile(agentId: string): Promise<CryptoProfile | null> {\r\n const keys = await this.listKeysForAgent(agentId, true);\r\n \r\n if (keys.length === 0) {\r\n return null;\r\n }\r\n \r\n // Group by suite\r\n const sorted = this.sortKeysByCreatedAt(keys);\r\n const suites = new Set(sorted.map(k => k.meta.suiteId));\r\n const suiteArray = Array.from(suites);\r\n \r\n // Assume first is primary, second is secondary\r\n return {\r\n primarySignatureSuite: suiteArray[0],\r\n secondarySignatureSuite: suiteArray[1],\r\n };\r\n }\r\n \r\n /**\r\n * Rotate all keys for an agent.\r\n */\r\n async rotateAgentKeys(agentId: string): Promise<KeyRecord[]> {\r\n const activeKeys = await this.listKeysForAgent(agentId, true);\r\n const newKeys: KeyRecord[] = [];\r\n \r\n for (const keyRecord of activeKeys) {\r\n // Generate new keypair\r\n const suite = this.suiteRegistry.getSuite(keyRecord.meta.suiteId);\r\n const newKeypair = await suite.generateKeypair();\r\n \r\n // Generate new keyId (increment counter)\r\n const counter = await this.getNextCounter(agentId);\r\n const suiteName = keyRecord.meta.suiteId.split('-')[0];\r\n const newKeyId = `${agentId}:pk-${suiteName}-${counter}`;\r\n \r\n // Rotate\r\n const newMeta = await this.keyRegistry.rotateKey(\r\n keyRecord.meta.keyId,\r\n newKeyId,\r\n newKeypair\r\n );\r\n \r\n newKeys.push({\r\n meta: newMeta,\r\n publicKey: newKeypair.publicKey,\r\n });\r\n }\r\n \r\n return newKeys;\r\n }\r\n \r\n /**\r\n * Get or create key (idempotent).\r\n */\r\n async getOrCreateKey(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n options: CreateKeyOptions = {}\r\n ): Promise<KeyRecord> {\r\n // Check if key exists\r\n const existingKeys = await this.listKeysForAgent(agentId, true);\r\n \r\n const primaryKey = existingKeys.find(\r\n k => k.meta.suiteId === profile.primarySignatureSuite\r\n );\r\n \r\n if (primaryKey) {\r\n return primaryKey;\r\n }\r\n \r\n // Create new key\r\n return await this.createKey(agentId, profile, options);\r\n }\r\n\r\n /**\r\n * Create both primary and secondary keys for an agent.\r\n */\r\n async createDualSignatureKeys(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n options: CreateKeyOptions = {}\r\n ): Promise<{ primaryKey: KeyRecord; secondaryKey: KeyRecord }> {\r\n if (!profile.secondarySignatureSuite) {\r\n throw new Error('secondarySignatureSuite is required to create dual signature keys');\r\n }\r\n\r\n const primaryKey = await this.createKey(agentId, {\r\n primarySignatureSuite: profile.primarySignatureSuite,\r\n }, options);\r\n\r\n const secondaryKey = await this.createKey(agentId, {\r\n primarySignatureSuite: profile.secondarySignatureSuite,\r\n }, options);\r\n\r\n return { primaryKey, secondaryKey };\r\n }\r\n\r\n /**\r\n * Idempotent creation of both primary and secondary keys.\r\n */\r\n async getOrCreateDualSignatureKeys(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n options: CreateKeyOptions = {}\r\n ): Promise<{ primaryKey: KeyRecord; secondaryKey: KeyRecord }> {\r\n if (!profile.secondarySignatureSuite) {\r\n throw new Error('secondarySignatureSuite is required to create dual signature keys');\r\n }\r\n\r\n const primaryKey = await this.getOrCreateKey(agentId, {\r\n primarySignatureSuite: profile.primarySignatureSuite,\r\n }, options);\r\n\r\n const secondaryKey = await this.getOrCreateKey(agentId, {\r\n primarySignatureSuite: profile.secondarySignatureSuite,\r\n }, options);\r\n\r\n return { primaryKey, secondaryKey };\r\n }\r\n\r\n /**\r\n * Sign with one or more suites for an agent.\r\n */\r\n async signWithSuites(\r\n agentId: string,\r\n message: Uint8Array,\r\n suites?: string[],\r\n ): Promise<MultiSignatureResult> {\r\n const activeKeys = this.sortKeysByCreatedAt(await this.listKeysForAgent(agentId, true));\r\n if (activeKeys.length === 0) {\r\n throw new Error(`No active keys found for agent: ${agentId}`);\r\n }\r\n\r\n const suitesToUse = suites?.length ? suites : Array.from(new Set(activeKeys.map(k => k.meta.suiteId)));\r\n const signatures: SuiteSignature[] = [];\r\n\r\n for (const suiteId of suitesToUse) {\r\n const key = activeKeys.find(k => k.meta.suiteId === suiteId);\r\n if (!key) {\r\n throw new Error(`No active key for suite '${suiteId}' and agent '${agentId}'`);\r\n }\r\n\r\n const signature = await this.signWithKey(key.meta.keyId, message);\r\n signatures.push({ suiteId, keyId: key.meta.keyId, signature });\r\n }\r\n\r\n return { signatures };\r\n }\r\n\r\n /**\r\n * Verify multiple signatures for an agent.\r\n */\r\n async verifyWithSuites(\r\n agentId: string,\r\n message: Uint8Array,\r\n signatures: SuiteSignature[],\r\n ): Promise<MultiVerificationResult> {\r\n const results: SuiteVerificationResult[] = [];\r\n\r\n for (const entry of signatures) {\r\n try {\r\n const valid = await this.verifySignature(entry.keyId, message, entry.signature);\r\n results.push({ suiteId: entry.suiteId, keyId: entry.keyId, valid });\r\n } catch (error) {\r\n results.push({\r\n suiteId: entry.suiteId,\r\n keyId: entry.keyId,\r\n valid: false,\r\n error: (error as Error).message,\r\n });\r\n }\r\n }\r\n\r\n return {\r\n results,\r\n allValid: results.every(r => r.valid),\r\n };\r\n }\r\n \r\n /**\r\n * Generate a new BIP39 mnemonic phrase.\r\n * \r\n * @param strength 128 (12 words) or 256 (24 words)\r\n * @returns Mnemonic phrase\r\n */\r\n generateMnemonic(strength: 128 | 256 = 256): string {\r\n const bip32 = new BIP32Derivation();\r\n return bip32.generateMnemonic(strength);\r\n }\r\n \r\n /**\r\n * Create a key from a BIP39 mnemonic using HD derivation.\r\n * \r\n * Only works with suites that support BIP32 derivation (e.g., bsv-ecdsa-secp256k1).\r\n * \r\n * @param agentId Agent identifier\r\n * @param profile Crypto profile (must use derivation-capable suite)\r\n * @param mnemonic BIP39 mnemonic phrase\r\n * @param path BIP32 derivation path (default: \"m/44'/0'/0'/0/0\")\r\n * @param passphrase Optional BIP39 passphrase\r\n * @param options Additional key creation options\r\n * @returns KeyRecord with derived key\r\n */\r\n async createKeyFromMnemonic(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n mnemonic: string,\r\n path: string = BIP32Derivation.bitcoinPath(0, 0, 0),\r\n passphrase?: string,\r\n options: CreateKeyOptions = {}\r\n ): Promise<KeyRecord> {\r\n const bip32 = new BIP32Derivation();\r\n const seed = bip32.mnemonicToSeed(mnemonic, passphrase);\r\n \r\n return await this.createKey(agentId, profile, {\r\n ...options,\r\n derivationContext: {\r\n seed,\r\n path,\r\n },\r\n });\r\n }\r\n \r\n /**\r\n * Get available capabilities for a specific suite.\r\n * \r\n * @param suiteId Suite identifier\r\n * @returns Array of capability names\r\n */\r\n getCapabilities(suiteId: string): string[] {\r\n const suite = this.suiteRegistry.getSuite(suiteId);\r\n const caps: string[] = [];\r\n \r\n if (suite.capabilities?.derivation) caps.push('derivation');\r\n if ((suite.capabilities as any)?.encryption) caps.push('encryption');\r\n if ((suite.capabilities as any)?.threshold) caps.push('threshold');\r\n \r\n return caps;\r\n }\r\n \r\n /**\r\n * Get all suite IDs that support a specific capability.\r\n * \r\n * @param capability Capability name\r\n * @returns Array of suite IDs\r\n */\r\n getSuitesWithCapability(capability: 'derivation' | 'encryption' | 'threshold'): string[] {\r\n const allSuites = this.suiteRegistry.getAllSuites();\r\n return allSuites\r\n .filter(suite => !!(suite.capabilities as any)?.[capability])\r\n .map(suite => suite.suiteId);\r\n }\r\n \r\n /**\r\n * Create a Bitcoin wallet key from mnemonic (convenience method).\r\n * \r\n * Uses standard BIP44 Bitcoin path: m/44'/0'/account'/change/addressIndex\r\n * \r\n * @param agentId Agent identifier\r\n * @param mnemonic BIP39 mnemonic phrase\r\n * @param accountIndex Account index (default: 0)\r\n * @param addressIndex Address index (default: 0)\r\n * @param isChange Use change address path (default: false)\r\n * @param options Additional key creation options\r\n * @returns KeyRecord with Bitcoin-compatible key\r\n */\r\n async createBitcoinWalletKey(\r\n agentId: string,\r\n mnemonic: string,\r\n accountIndex = 0,\r\n addressIndex = 0,\r\n isChange = false,\r\n options: CreateKeyOptions = {}\r\n ): Promise<KeyRecord> {\r\n const path = BIP32Derivation.bitcoinPath(accountIndex, isChange ? 1 : 0, addressIndex);\r\n \r\n return this.createKeyFromMnemonic(\r\n agentId,\r\n { primarySignatureSuite: 'bsv-ecdsa-secp256k1' },\r\n mnemonic,\r\n path,\r\n undefined,\r\n options\r\n );\r\n }\r\n \r\n /**\r\n * Helper: Get hash algorithm for a suite.\r\n */\r\n private getHashAlgorithm(suiteId: string): 'sha256' | 'sha3-256' | 'sha512' {\r\n if (suiteId.startsWith('ml-dsa')) {\r\n return 'sha3-256';\r\n }\r\n return 'sha256';\r\n }\r\n \r\n /**\r\n * Helper: Get next counter for an agent.\r\n */\r\n private async getNextCounter(agentId: string): Promise<number> {\r\n if (!this.counterInitialized.has(agentId)) {\r\n if (!this.counterInitPromises.has(agentId)) {\r\n const initPromise = (async () => {\r\n const existing = await this.keyRegistry.listKeys();\r\n const max = existing.reduce((acc, meta) => {\r\n if (!meta.keyId.startsWith(`${agentId}:pk-`)) return acc;\r\n const match = meta.keyId.match(/:pk-[^-]+-(\\d+)$/);\r\n if (!match) return acc;\r\n const num = parseInt(match[1], 10);\r\n return Number.isFinite(num) ? Math.max(acc, num) : acc;\r\n }, 0);\r\n\r\n this.keyCounter.set(agentId, max);\r\n this.counterInitialized.add(agentId);\r\n this.counterInitPromises.delete(agentId);\r\n })();\r\n\r\n this.counterInitPromises.set(agentId, initPromise);\r\n }\r\n\r\n const pendingInit = this.counterInitPromises.get(agentId);\r\n if (pendingInit) {\r\n await pendingInit;\r\n }\r\n }\r\n\r\n const current = this.keyCounter.get(agentId) || 0;\r\n const next = current + 1;\r\n this.keyCounter.set(agentId, next);\r\n return next;\r\n }\r\n\r\n /**\r\n * Helper: sort keys deterministically by createdAt then keyId.\r\n */\r\n private sortKeysByCreatedAt(keys: KeyRecord[]): KeyRecord[] {\r\n return [...keys].sort((a, b) => {\r\n const aTime = new Date(a.meta.createdAt).getTime();\r\n const bTime = new Date(b.meta.createdAt).getTime();\r\n if (aTime !== bTime) return aTime - bTime;\r\n\r\n const priorityDiff = this.getSuitePriority(a.meta.suiteId) - this.getSuitePriority(b.meta.suiteId);\r\n if (priorityDiff !== 0) return priorityDiff;\r\n\r\n return a.meta.keyId.localeCompare(b.meta.keyId);\r\n });\r\n }\r\n\r\n private getSuitePriority(suiteId: string): number {\r\n if (suiteId.startsWith('ml-dsa')) return 0;\r\n if (suiteId.includes('ecdsa')) return 1;\r\n return 2;\r\n }\r\n}\r\n\r\n/**\r\n * Create a KeySDK instance with default configuration\r\n * \r\n * Uses in-memory storage and registers both ECDSA and ML-DSA suites.\r\n * For custom storage or different suites, instantiate DefaultKeySDK directly.\r\n * \r\n * @example\r\n * ```typescript\r\n * import { createKeySDK } from '@smartledger/keys';\r\n * \r\n * const sdk = createKeySDK();\r\n * const key = await sdk.createKey('my-agent', { primarySignatureSuite: 'ml-dsa-87' });\r\n * ```\r\n */\r\nexport function createKeySDK(config?: Partial<KeySDKConfig>): KeySDK {\r\n const keyRegistry = config?.keyRegistry || new KeyRegistry(new InMemoryKeyStorage());\r\n const suiteRegistry = config?.suiteRegistry || new SignatureSuiteRegistry();\r\n \r\n // Register default suites if not provided\r\n if (!config?.suiteRegistry) {\r\n suiteRegistry.register(new BsvEcdsaSuite());\r\n suiteRegistry.register(new MlDsa87Suite());\r\n }\r\n \r\n return new DefaultKeySDK({\r\n keyRegistry,\r\n suiteRegistry,\r\n });\r\n}\r\n", "/**\n * @smartledger/crypto - Pluggable cryptographic signature suite system\n *\n * Provides crypto-agnostic signing and verification for agent black-box modules\n * with support for ECDSA, post-quantum signatures (ML-DSA), and hybrid modes.\n */\nexport * from './types.js';\nexport * from './registry.js';\nexport * from './utils.js';\nexport * from './signing.js';\nexport * from './key-registry.js';\nexport * from './errors.js';\nexport * from './stateless.js';\n// Suite implementations\nexport { BsvEcdsaSuite } from './suites/bsv-ecdsa.js';\nexport { MlDsa44Suite, MlDsa65Suite, MlDsa87Suite, MlDsaSuite } from './suites/ml-dsa.js';\n// Derivation utilities\nexport { BIP32Derivation } from './derivation/bip32.js';\nexport { encodeWIF, decodeWIF } from './derivation/wif.js';\n// Re-export global registry for convenience\nexport { globalRegistry } from './registry.js';\n", "/**\n * Core types for the pluggable cryptographic signature system\n */\nexport {};\n", "/**\n * Registry for managing signature suite implementations\n */\nexport class SignatureSuiteRegistry {\n suites = new Map();\n /**\n * Register a signature suite implementation\n */\n register(suite) {\n if (this.suites.has(suite.suiteId)) {\n throw new Error(`Signature suite already registered: ${suite.suiteId}`);\n }\n this.suites.set(suite.suiteId, suite);\n }\n /**\n * Get a signature suite by ID\n * @throws Error if suite is not registered\n */\n getSuite(suiteId) {\n const suite = this.suites.get(suiteId);\n if (!suite) {\n throw new Error(`Unknown signature suite: ${suiteId}. Available: ${this.listSuites().join(', ')}`);\n }\n return suite;\n }\n /**\n * Check if a suite is registered\n */\n hasSuite(suiteId) {\n return this.suites.has(suiteId);\n }\n /**\n * List all registered suite IDs\n */\n listSuites() {\n return [...this.suites.keys()];\n }\n /**\n * Get all registered suite objects\n */\n getAllSuites() {\n return [...this.suites.values()];\n }\n /**\n * Unregister a suite (primarily for testing)\n */\n unregister(suiteId) {\n return this.suites.delete(suiteId);\n }\n /**\n * Clear all registered suites (primarily for testing)\n */\n clear() {\n this.suites.clear();\n }\n}\n// Global singleton instance\nexport const globalRegistry = new SignatureSuiteRegistry();\n", "/**\n * Utility functions for cryptographic operations\n */\n/**\n * Canonicalize a JSON object to a stable string representation\n * Uses RFC 8785 (JSON Canonicalization Scheme) approach\n */\nexport function canonicalizeJson(obj) {\n if (obj === null)\n return 'null';\n if (typeof obj !== 'object')\n return JSON.stringify(obj);\n if (Array.isArray(obj)) {\n return '[' + obj.map(canonicalizeJson).join(',') + ']';\n }\n // Sort object keys and recursively canonicalize\n const keys = Object.keys(obj).sort();\n const pairs = keys.map(key => `\"${key}\":${canonicalizeJson(obj[key])}`);\n return '{' + pairs.join(',') + '}';\n}\n/**\n * Convert string to UTF-8 bytes\n */\nexport function stringToBytes(str) {\n return new TextEncoder().encode(str);\n}\n/**\n * Convert bytes to UTF-8 string\n */\nexport function bytesToString(bytes) {\n return new TextDecoder().decode(bytes);\n}\n/**\n * Convert bytes to hex string\n */\nexport function bytesToHex(bytes) {\n return Array.from(bytes)\n .map(b => b.toString(16).padStart(2, '0'))\n .join('');\n}\n/**\n * Convert hex string to bytes\n */\nexport function hexToBytes(hex) {\n if (hex.length % 2 !== 0) {\n throw new Error('Hex string must have even length');\n }\n const bytes = new Uint8Array(hex.length / 2);\n for (let i = 0; i < hex.length; i += 2) {\n bytes[i / 2] = parseInt(hex.slice(i, i + 2), 16);\n }\n return bytes;\n}\n/**\n * Convert bytes to base64url (URL-safe base64 without padding)\n */\nexport function bytesToBase64Url(bytes) {\n const base64 = Buffer.from(bytes).toString('base64');\n return base64\n .replace(/\\+/g, '-')\n .replace(/\\//g, '_')\n .replace(/=/g, '');\n}\n/**\n * Convert base64url to bytes\n */\nexport function base64UrlToBytes(base64url) {\n // Add padding if needed\n let base64 = base64url.replace(/-/g, '+').replace(/_/g, '/');\n const padding = base64.length % 4;\n if (padding) {\n base64 += '='.repeat(4 - padding);\n }\n return new Uint8Array(Buffer.from(base64, 'base64'));\n}\n/**\n * Secure constant-time comparison of two byte arrays\n */\nexport function constantTimeEqual(a, b) {\n if (a.length !== b.length)\n return false;\n let result = 0;\n for (let i = 0; i < a.length; i++) {\n result |= a[i] ^ b[i];\n }\n return result === 0;\n}\n/**\n * Zero out a byte array (for secure key cleanup)\n */\nexport function zeroBytes(bytes) {\n bytes.fill(0);\n}\n/**\n * Create a hash of the given bytes using the specified algorithm\n */\nexport async function hashBytes(bytes, algorithm) {\n if (algorithm === 'sha256') {\n const crypto = await import('crypto');\n return new Uint8Array(crypto.createHash('sha256').update(bytes).digest());\n }\n else if (algorithm === 'sha512') {\n const crypto = await import('crypto');\n return new Uint8Array(crypto.createHash('sha512').update(bytes).digest());\n }\n else if (algorithm === 'sha3-256') {\n const crypto = await import('crypto');\n return new Uint8Array(crypto.createHash('sha3-256').update(bytes).digest());\n }\n throw new Error(`Unsupported hash algorithm: ${algorithm}`);\n}\n", "import { canonicalizeJson, stringToBytes, bytesToBase64Url, base64UrlToBytes, hashBytes, } from './utils.js';\n/**\n * Sign an agent response with one or two signature suites\n */\nexport async function signAgentResponse(agentMeta, payload, primaryKey, primaryKeyBytes, registry, secondaryKey, secondaryKeyBytes) {\n // Canonicalize the payload\n const canonicalPayload = canonicalizeJson(payload);\n const payloadBytes = stringToBytes(canonicalPayload);\n const signatures = [];\n // Primary signature\n const primarySuite = registry.getSuite(primaryKey.suiteId);\n const primaryHashAlg = getHashAlgorithm(primaryKey.suiteId);\n const primaryHash = await hashBytes(payloadBytes, primaryHashAlg);\n const primarySig = await primarySuite.sign(primaryKeyBytes, primaryHash);\n signatures.push({\n suiteId: primaryKey.suiteId,\n keyId: primaryKey.keyId,\n hashAlgorithm: primaryHashAlg,\n payloadHash: bytesToBase64Url(primaryHash),\n signature: bytesToBase64Url(primarySig),\n });\n // Secondary signature (for hybrid mode)\n if (secondaryKey && secondaryKeyBytes) {\n const secondarySuite = registry.getSuite(secondaryKey.suiteId);\n const secondaryHashAlg = getHashAlgorithm(secondaryKey.suiteId);\n const secondaryHash = await hashBytes(payloadBytes, secondaryHashAlg);\n const secondarySig = await secondarySuite.sign(secondaryKeyBytes, secondaryHash);\n signatures.push({\n suiteId: secondaryKey.suiteId,\n keyId: secondaryKey.keyId,\n hashAlgorithm: secondaryHashAlg,\n payloadHash: bytesToBase64Url(secondaryHash),\n signature: bytesToBase64Url(secondarySig),\n });\n }\n const signatureMetadata = {\n format: 'lumen.signature.v1',\n mode: signatures.length > 1 ? 'hybrid' : 'single',\n signatures,\n };\n // Add policy for hybrid mode\n if (signatures.length > 1 && agentMeta.cryptoProfile.primarySignatureSuite) {\n signatureMetadata.policy = {\n threshold: 'all',\n requiredSuites: [agentMeta.cryptoProfile.primarySignatureSuite],\n };\n }\n return {\n agent: agentMeta.agentId,\n version: agentMeta.version,\n timestamp: new Date().toISOString(),\n payload,\n _signature: signatureMetadata,\n };\n}\n/**\n * Verify a signed envelope\n */\nexport async function verifySignedEnvelope(envelope, registry, publicKeys) {\n const results = [];\n // Canonicalize the payload\n const canonicalPayload = canonicalizeJson(envelope.payload);\n const payloadBytes = stringToBytes(canonicalPayload);\n // Verify each signature\n for (const sigEntry of envelope._signature.signatures) {\n try {\n const suite = registry.getSuite(sigEntry.suiteId);\n const publicKey = publicKeys.get(sigEntry.keyId);\n if (!publicKey) {\n results.push({\n suiteId: sigEntry.suiteId,\n keyId: sigEntry.keyId,\n valid: false,\n error: 'Public key not found',\n });\n continue;\n }\n // Verify hash matches\n const computedHash = await hashBytes(payloadBytes, sigEntry.hashAlgorithm);\n const expectedHash = base64UrlToBytes(sigEntry.payloadHash);\n if (!arraysEqual(computedHash, expectedHash)) {\n results.push({\n suiteId: sigEntry.suiteId,\n keyId: sigEntry.keyId,\n valid: false,\n error: 'Payload hash mismatch',\n });\n continue;\n }\n // Verify signature\n const signature = base64UrlToBytes(sigEntry.signature);\n const valid = await suite.verify(publicKey, computedHash, signature);\n results.push({\n suiteId: sigEntry.suiteId,\n keyId: sigEntry.keyId,\n valid,\n error: valid ? undefined : 'Signature verification failed',\n });\n }\n catch (error) {\n results.push({\n suiteId: sigEntry.suiteId,\n keyId: sigEntry.keyId,\n valid: false,\n error: error instanceof Error ? error.message : String(error),\n });\n }\n }\n // Apply policy\n const policyMet = checkPolicy(envelope._signature, results);\n return {\n valid: policyMet && results.every(r => r.valid),\n details: {\n signatureResults: results,\n policyMet,\n timestamp: new Date().toISOString(),\n },\n };\n}\n/**\n * Check if signature policy is satisfied\n */\nfunction checkPolicy(signature, results) {\n const policy = signature.policy;\n if (!policy) {\n // No policy - all signatures must be valid\n return results.every(r => r.valid);\n }\n const validResults = results.filter(r => r.valid);\n // Check required suites\n if (policy.requiredSuites) {\n const requiredValid = policy.requiredSuites.every(suiteId => validResults.some(r => r.suiteId === suiteId));\n if (!requiredValid)\n return false;\n }\n // Check threshold\n switch (policy.threshold) {\n case 'any':\n return validResults.length > 0;\n case 'all':\n return validResults.length === results.length;\n case 'quorum':\n return validResults.length >= (policy.quorumCount || 0);\n default:\n return validResults.length === results.length;\n }\n}\n/**\n * Get recommended hash algorithm for a suite\n */\nfunction getHashAlgorithm(suiteId) {\n if (suiteId.startsWith('bsv-ecdsa'))\n return 'sha256';\n if (suiteId.startsWith('ml-dsa'))\n return 'sha3-256';\n if (suiteId.startsWith('fn-dsa'))\n return 'sha3-256';\n if (suiteId.startsWith('slh-dsa'))\n return 'sha256';\n return 'sha256'; // default\n}\n/**\n * Helper to compare byte arrays\n */\nfunction arraysEqual(a, b) {\n if (a.length !== b.length)\n return false;\n for (let i = 0; i < a.length; i++) {\n if (a[i] !== b[i])\n return false;\n }\n return true;\n}\n", "/**\n * Key Registry for managing cryptographic keypairs across signature suites.\n *\n * Handles:\n * - Key lifecycle (creation, rotation, expiration, revocation)\n * - Storage abstraction (in-memory, file, KMS/HSM)\n * - Key metadata tracking (suiteId, usage, timestamps)\n * - Security best practices (key zeroing, access control)\n */\n/**\n * In-memory key storage (for testing/development only).\n */\nexport class InMemoryKeyStorage {\n keys = new Map();\n async store(keyId, keypair, meta) {\n this.keys.set(keyId, { keypair, meta });\n }\n async load(keyId) {\n return this.keys.get(keyId) || null;\n }\n async list(filter) {\n const allMeta = Array.from(this.keys.values()).map(k => k.meta);\n if (!filter) {\n return allMeta;\n }\n return allMeta.filter(meta => {\n return Object.entries(filter).every(([key, value]) => {\n if (key === 'usage' && Array.isArray(value)) {\n // Check if any usage matches\n return value.some(u => meta.usage.includes(u));\n }\n return meta[key] === value;\n });\n });\n }\n async delete(keyId) {\n this.keys.delete(keyId);\n }\n async updateMeta(keyId, updates) {\n const existing = this.keys.get(keyId);\n if (!existing) {\n throw new Error(`Key not found: ${keyId}`);\n }\n this.keys.set(keyId, {\n keypair: existing.keypair,\n meta: { ...existing.meta, ...updates },\n });\n }\n /**\n * Clear all keys (testing only).\n */\n clear() {\n this.keys.clear();\n }\n}\n/**\n * KeyRegistry manages the lifecycle of cryptographic keys.\n *\n * Features:\n * - Register new keypairs with metadata\n * - Retrieve keys by ID or filter\n * - Key rotation with audit trail\n * - Expiration and revocation\n * - Storage backend abstraction\n */\nexport class KeyRegistry {\n storage;\n constructor(storage = new InMemoryKeyStorage()) {\n this.storage = storage;\n }\n /**\n * Register a new keypair with metadata.\n */\n async registerKey(keyId, keypair, suiteId, options = {}) {\n const meta = {\n keyId,\n suiteId,\n createdAt: new Date().toISOString(),\n expiresAt: options.expiresAt,\n usage: options.usage || ['signing'],\n cryptoProfileVersion: options.cryptoProfileVersion || '1.0.0',\n status: options.status || 'active',\n };\n await this.storage.store(keyId, keypair, meta);\n return meta;\n }\n /**\n * Get a keypair and its metadata.\n */\n async getKey(keyId) {\n return await this.storage.load(keyId);\n }\n /**\n * Get only the public key (no private key).\n */\n async getPublicKey(keyId) {\n const result = await this.storage.load(keyId);\n if (!result)\n return null;\n return {\n publicKey: result.keypair.publicKey,\n meta: result.meta,\n };\n }\n /**\n * List all keys matching optional filter.\n */\n async listKeys(filter) {\n return await this.storage.list(filter);\n }\n /**\n * List only active, non-expired keys.\n */\n async listActiveKeys(filter) {\n const allKeys = await this.storage.list(filter);\n const now = new Date();\n return allKeys.filter(meta => {\n // Check status\n if (meta.status && meta.status !== 'active') {\n return false;\n }\n // Check expiration\n if (meta.expiresAt && new Date(meta.expiresAt) < now) {\n return false;\n }\n return true;\n });\n }\n /**\n * Rotate a key: generate new keypair, mark old as 'rotated'.\n *\n * Returns the new key's metadata.\n */\n async rotateKey(oldKeyId, newKeyId, newKeypair) {\n // Get old key to copy metadata\n const oldKey = await this.storage.load(oldKeyId);\n if (!oldKey) {\n throw new Error(`Cannot rotate: key not found: ${oldKeyId}`);\n }\n // Mark old key as rotated\n await this.storage.updateMeta(oldKeyId, {\n status: 'rotated',\n });\n // Register new key with same suite/usage\n await this.registerKey(newKeyId, newKeypair, oldKey.meta.suiteId, {\n usage: oldKey.meta.usage,\n cryptoProfileVersion: oldKey.meta.cryptoProfileVersion,\n expiresAt: oldKey.meta.expiresAt,\n status: 'active',\n });\n // Add rotation link\n await this.storage.updateMeta(newKeyId, {\n rotatedFrom: oldKeyId,\n });\n // Return updated metadata\n const result = await this.storage.load(newKeyId);\n return result.meta;\n }\n /**\n * Revoke a key (marks as unusable, but doesn't delete).\n */\n async revokeKey(keyId, reason) {\n await this.storage.updateMeta(keyId, {\n status: 'revoked',\n revokedAt: new Date().toISOString(),\n });\n }\n /**\n * Delete a key permanently (use with caution).\n */\n async deleteKey(keyId) {\n await this.storage.delete(keyId);\n }\n /**\n * Mark expired keys as 'expired' status.\n * Returns count of keys marked expired.\n */\n async markExpiredKeys() {\n const allKeys = await this.storage.list();\n const now = new Date();\n let count = 0;\n for (const meta of allKeys) {\n if (meta.expiresAt && new Date(meta.expiresAt) < now && meta.status === 'active') {\n await this.storage.updateMeta(meta.keyId, {\n status: 'expired',\n });\n count++;\n }\n }\n return count;\n }\n /**\n * Cleanup: delete keys that have been revoked/expired for longer than retention period.\n *\n * @param retentionDays How many days to keep revoked/expired keys (default: 90)\n */\n async pruneOldKeys(retentionDays = 90) {\n const allKeys = await this.storage.list();\n const cutoffDate = new Date();\n cutoffDate.setDate(cutoffDate.getDate() - retentionDays);\n let count = 0;\n for (const meta of allKeys) {\n const shouldPrune = (meta.status === 'revoked' && meta.revokedAt && new Date(meta.revokedAt) < cutoffDate) ||\n (meta.status === 'expired' && meta.expiresAt && new Date(meta.expiresAt) < cutoffDate);\n if (shouldPrune) {\n await this.storage.delete(meta.keyId);\n count++;\n }\n }\n return count;\n }\n}\n", "/**\n * Explicit error types for SmartLedger cryptographic operations.\n * These errors provide clear, actionable feedback for debugging and auditing.\n */\n/**\n * Base class for all SmartLedger crypto errors.\n */\nexport class SmartLedgerCryptoError extends Error {\n code;\n constructor(message, code) {\n super(message);\n this.code = code;\n this.name = this.constructor.name;\n Error.captureStackTrace(this, this.constructor);\n }\n}\n/**\n * Thrown when a requested key cannot be found.\n */\nexport class KeyNotFoundError extends SmartLedgerCryptoError {\n keyId;\n constructor(keyId) {\n super(`Key not found: ${keyId}`, 'KEY_NOT_FOUND');\n this.keyId = keyId;\n }\n}\n/**\n * Thrown when attempting to use an expired key.\n */\nexport class KeyExpiredError extends SmartLedgerCryptoError {\n keyId;\n expiresAt;\n constructor(keyId, expiresAt) {\n super(`Key expired: ${keyId} (expired at ${expiresAt})`, 'KEY_EXPIRED');\n this.keyId = keyId;\n this.expiresAt = expiresAt;\n }\n}\n/**\n * Thrown when a key is in an invalid state for the requested operation.\n */\nexport class KeyInvalidStateError extends SmartLedgerCryptoError {\n keyId;\n currentState;\n requiredState;\n constructor(keyId, currentState, requiredState) {\n super(`Key in invalid state: ${keyId} (current: ${currentState}, required: ${requiredState})`, 'KEY_INVALID_STATE');\n this.keyId = keyId;\n this.currentState = currentState;\n this.requiredState = requiredState;\n }\n}\n/**\n * Thrown when a suite is not allowed by the active compliance profile.\n */\nexport class SuiteNotAllowedError extends SmartLedgerCryptoError {\n suiteId;\n profileName;\n constructor(suiteId, profileName) {\n const profileMsg = profileName ? ` in profile ${profileName}` : '';\n super(`Suite not allowed: ${suiteId}${profileMsg}`, 'SUITE_NOT_ALLOWED');\n this.suiteId = suiteId;\n this.profileName = profileName;\n }\n}\n/**\n * Thrown when a requested suite cannot be found.\n */\nexport class SuiteNotFoundError extends SmartLedgerCryptoError {\n suiteId;\n constructor(suiteId) {\n super(`Suite not found: ${suiteId}`, 'SUITE_NOT_FOUND');\n this.suiteId = suiteId;\n }\n}\n/**\n * Thrown when signature verification fails.\n */\nexport class InvalidSignatureError extends SmartLedgerCryptoError {\n keyId;\n constructor(keyId, message = 'Signature verification failed') {\n super(message, 'INVALID_SIGNATURE');\n this.keyId = keyId;\n }\n}\n/**\n * Thrown when a cryptographic operation fails.\n */\nexport class CryptoOperationError extends SmartLedgerCryptoError {\n operation;\n cause;\n constructor(operation, message, cause) {\n super(`Cryptographic operation failed (${operation}): ${message}`, 'CRYPTO_OPERATION_FAILED');\n this.operation = operation;\n this.cause = cause;\n }\n}\n/**\n * Thrown when key parameters are invalid.\n */\nexport class InvalidKeyParametersError extends SmartLedgerCryptoError {\n constructor(message) {\n super(`Invalid key parameters: ${message}`, 'INVALID_KEY_PARAMETERS');\n }\n}\n/**\n * Thrown when a compliance profile violation is detected.\n */\nexport class ComplianceViolationError extends SmartLedgerCryptoError {\n profileName;\n violation;\n constructor(profileName, violation) {\n super(`Compliance violation in profile ${profileName}: ${violation}`, 'COMPLIANCE_VIOLATION');\n this.profileName = profileName;\n this.violation = violation;\n }\n}\n", "/**\n * Stateless cryptographic helpers for unmanaged keys.\n *\n * These functions allow external systems, auditors, and governments to use\n * SmartLedger algorithms with their own key material, without the managed\n * key infrastructure.\n *\n * @example\n * ```typescript\n * // External system with their own key management\n * import { signUsingSuite, verifyUsingSuite } from '@smartledger/crypto';\n *\n * const signature = await signUsingSuite(\n * 'ml-dsa-87',\n * privateKey, // Their own key material\n * message\n * );\n *\n * const valid = await verifyUsingSuite(\n * 'ml-dsa-87',\n * publicKey,\n * message,\n * signature\n * );\n * ```\n */\nimport { SignatureSuiteRegistry } from './registry.js';\nimport { SuiteNotFoundError, CryptoOperationError } from './errors.js';\n/**\n * Global registry instance for stateless operations.\n * Can be configured with custom suites before use.\n */\nlet globalRegistry = null;\n/**\n * Set the global registry for stateless operations.\n */\nexport function setGlobalRegistry(registry) {\n globalRegistry = registry;\n}\n/**\n * Get or create the global registry.\n */\nfunction getRegistry() {\n if (!globalRegistry) {\n globalRegistry = new SignatureSuiteRegistry();\n }\n return globalRegistry;\n}\n/**\n * Sign a message using a specific suite with provided private key.\n *\n * This is a stateless operation for external key management systems.\n *\n * @param suiteId - Signature suite identifier (e.g. 'ml-dsa-87')\n * @param privateKey - Private key bytes\n * @param message - Message to sign\n * @returns Signature bytes\n * @throws {SuiteNotFoundError} If suite is not registered\n * @throws {CryptoOperationError} If signing fails\n */\nexport async function signUsingSuite(suiteId, privateKey, message) {\n const registry = getRegistry();\n if (!registry.hasSuite(suiteId)) {\n throw new SuiteNotFoundError(suiteId);\n }\n try {\n const suite = registry.getSuite(suiteId);\n return await suite.sign(privateKey, message);\n }\n catch (error) {\n throw new CryptoOperationError('sign', error instanceof Error ? error.message : 'Unknown error', error instanceof Error ? error : undefined);\n }\n}\n/**\n * Verify a signature using a specific suite with provided public key.\n *\n * This is a stateless operation for external verification systems.\n *\n * @param suiteId - Signature suite identifier (e.g. 'ml-dsa-87')\n * @param publicKey - Public key bytes\n * @param message - Original message\n * @param signature - Signature to verify\n * @returns true if signature is valid\n * @throws {SuiteNotFoundError} If suite is not registered\n * @throws {CryptoOperationError} If verification fails unexpectedly\n */\nexport async function verifyUsingSuite(suiteId, publicKey, message, signature) {\n const registry = getRegistry();\n if (!registry.hasSuite(suiteId)) {\n throw new SuiteNotFoundError(suiteId);\n }\n try {\n const suite = registry.getSuite(suiteId);\n return await suite.verify(publicKey, message, signature);\n }\n catch (error) {\n throw new CryptoOperationError('verify', error instanceof Error ? error.message : 'Unknown error', error instanceof Error ? error : undefined);\n }\n}\n/**\n * Generate a keypair using a specific suite.\n *\n * This is a stateless operation for external key generation.\n *\n * @param suiteId - Signature suite identifier (e.g. 'ml-dsa-87')\n * @returns Keypair with public and private keys\n * @throws {SuiteNotFoundError} If suite is not registered\n * @throws {CryptoOperationError} If key generation fails\n */\nexport async function generateKeypairUsingSuite(suiteId) {\n const registry = getRegistry();\n if (!registry.hasSuite(suiteId)) {\n throw new SuiteNotFoundError(suiteId);\n }\n try {\n const suite = registry.getSuite(suiteId);\n return await suite.generateKeypair();\n }\n catch (error) {\n throw new CryptoOperationError('generateKeypair', error instanceof Error ? error.message : 'Unknown error', error instanceof Error ? error : undefined);\n }\n}\n/**\n * List all available suite IDs in the global registry.\n *\n * @returns Array of suite IDs\n */\nexport function listAvailableSuites() {\n const registry = getRegistry();\n return registry.listSuites();\n}\n", "import * as secp256k1 from '@noble/secp256k1';\nimport { hmac } from '@noble/hashes/hmac';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { bytesToHex, hexToBytes } from '../utils.js';\nimport { BIP32Derivation } from '../derivation/bip32.js';\nimport { encodeWIF, decodeWIF } from '../derivation/wif.js';\n// Set up HMAC for secp256k1\nsecp256k1.etc.hmacSha256Sync = (key, ...msgs) => hmac(sha256, key, secp256k1.etc.concatBytes(...msgs));\n/**\n * BSV ECDSA signature suite using secp256k1\n * Compatible with Bitcoin SV / smartledger-bsv\n *\n * Supports BIP32 HD wallet derivation for deterministic key generation.\n */\nexport class BsvEcdsaSuite {\n suiteId = 'bsv-ecdsa-secp256k1';\n version = '1.0.0';\n capabilities = {\n derivation: new BIP32Derivation(),\n };\n async generateKeypair() {\n const privateKey = secp256k1.utils.randomPrivateKey();\n const publicKey = secp256k1.getPublicKey(privateKey, true); // compressed\n return {\n privateKey,\n publicKey,\n };\n }\n async sign(privateKey, message) {\n try {\n // Create deterministic signature (RFC 6979)\n const signature = await secp256k1.sign(message, privateKey);\n return signature.toCompactRawBytes();\n }\n catch (error) {\n throw new Error(`BsvEcdsaSuite signing failed: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n async verify(publicKey, message, signature) {\n try {\n return secp256k1.verify(signature, message, publicKey);\n }\n catch (error) {\n // Invalid signature format or other errors count as verification failure\n return false;\n }\n }\n exportPublicKey(pub) {\n // Export as hex (standard format)\n return bytesToHex(pub);\n }\n importPublicKey(encoded) {\n return hexToBytes(encoded);\n }\n exportPrivateKey(priv) {\n // Export as Bitcoin WIF format for maximum compatibility\n return encodeWIF(priv, true, 'mainnet');\n }\n importPrivateKey(encoded) {\n // Support both hex and WIF formats\n if (encoded.length === 64) {\n // Hex format (64 hex chars = 32 bytes)\n const bytes = hexToBytes(encoded);\n if (bytes.length !== 32) {\n throw new Error('Private key must be 32 bytes');\n }\n return bytes;\n }\n else {\n // WIF format (starts with '5', 'K', or 'L' for mainnet compressed)\n try {\n const { privateKey } = decodeWIF(encoded);\n return privateKey;\n }\n catch (error) {\n throw new Error(`Invalid private key format: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n }\n}\n", "/*! noble-secp256k1 - MIT License (c) 2019 Paul Miller (paulmillr.com) */\n/**\n * 4KB JS implementation of secp256k1 ECDSA / Schnorr signatures & ECDH.\n * Compliant with RFC6979 & BIP340.\n * @module\n */\n/**\n * Curve params. secp256k1 is short weierstrass / koblitz curve. Equation is y\u00B2 == x\u00B3 + ax + b.\n * * P = `2n**256n-2n**32n-2n**977n` // field over which calculations are done\n * * N = `2n**256n - 0x14551231950b75fc4402da1732fc9bebfn` // group order, amount of curve points\n * * h = `1n` // cofactor\n * * a = `0n` // equation param\n * * b = `7n` // equation param\n * * Gx, Gy are coordinates of Generator / base point\n */\nconst secp256k1_CURVE = {\n p: 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2fn,\n n: 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141n,\n h: 1n,\n a: 0n,\n b: 7n,\n Gx: 0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798n,\n Gy: 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8n,\n};\nconst { p: P, n: N, Gx, Gy, b: _b } = secp256k1_CURVE;\nconst L = 32; // field / group byte length\nconst L2 = 64;\n// Helpers and Precomputes sections are reused between libraries\n// ## Helpers\n// ----------\n// error helper, messes-up stack trace\nconst err = (m = '') => {\n throw new Error(m);\n};\nconst isBig = (n) => typeof n === 'bigint'; // is big integer\nconst isStr = (s) => typeof s === 'string'; // is string\nconst isBytes = (a) => a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n/** assert is Uint8Array (of specific length) */\nconst abytes = (a, l) => !isBytes(a) || (typeof l === 'number' && l > 0 && a.length !== l)\n ? err('Uint8Array expected')\n : a;\n/** create Uint8Array */\nconst u8n = (len) => new Uint8Array(len);\nconst u8fr = (buf) => Uint8Array.from(buf);\nconst padh = (n, pad) => n.toString(16).padStart(pad, '0');\nconst bytesToHex = (b) => Array.from(abytes(b))\n .map((e) => padh(e, 2))\n .join('');\nconst C = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 }; // ASCII characters\nconst _ch = (ch) => {\n if (ch >= C._0 && ch <= C._9)\n return ch - C._0; // '2' => 50-48\n if (ch >= C.A && ch <= C.F)\n return ch - (C.A - 10); // 'B' => 66-(65-10)\n if (ch >= C.a && ch <= C.f)\n return ch - (C.a - 10); // 'b' => 98-(97-10)\n return;\n};\nconst hexToBytes = (hex) => {\n const e = 'hex invalid';\n if (!isStr(hex))\n return err(e);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n return err(e);\n const array = u8n(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n // treat each char as ASCII\n const n1 = _ch(hex.charCodeAt(hi)); // parse first char, multiply it by 16\n const n2 = _ch(hex.charCodeAt(hi + 1)); // parse second char\n if (n1 === undefined || n2 === undefined)\n return err(e);\n array[ai] = n1 * 16 + n2; // example: 'A9' => 10*16 + 9\n }\n return array;\n};\n/** normalize hex or ui8a to ui8a */\nconst toU8 = (a, len) => abytes(isStr(a) ? hexToBytes(a) : u8fr(abytes(a)), len);\nconst cr = () => globalThis?.crypto; // WebCrypto is available in all modern environments\nconst subtle = () => cr()?.subtle ?? err('crypto.subtle must be defined');\n// prettier-ignore\nconst concatBytes = (...arrs) => {\n const r = u8n(arrs.reduce((sum, a) => sum + abytes(a).length, 0)); // create u8a of summed length\n let pad = 0; // walk through each array,\n arrs.forEach(a => { r.set(a, pad); pad += a.length; }); // ensure they have proper type\n return r;\n};\n/** WebCrypto OS-level CSPRNG (random number generator). Will throw when not available. */\nconst randomBytes = (len = L) => {\n const c = cr();\n return c.getRandomValues(u8n(len));\n};\nconst big = BigInt;\nconst arange = (n, min, max, msg = 'bad number: out of range') => isBig(n) && min <= n && n < max ? n : err(msg);\n/** modular division */\nconst M = (a, b = P) => {\n const r = a % b;\n return r >= 0n ? r : b + r;\n};\nconst modN = (a) => M(a, N);\n/** Modular inversion using eucledian GCD (non-CT). No negative exponent for now. */\n// prettier-ignore\nconst invert = (num, md) => {\n if (num === 0n || md <= 0n)\n err('no inverse n=' + num + ' mod=' + md);\n let a = M(num, md), b = md, x = 0n, y = 1n, u = 1n, v = 0n;\n while (a !== 0n) {\n const q = b / a, r = b % a;\n const m = x - u * q, n = y - v * q;\n b = a, a = r, x = u, y = v, u = m, v = n;\n }\n return b === 1n ? M(x, md) : err('no inverse'); // b is gcd at this point\n};\nconst callHash = (name) => {\n // @ts-ignore\n const fn = etc[name];\n if (typeof fn !== 'function')\n err('hashes.' + name + ' not set');\n return fn;\n};\nconst apoint = (p) => (p instanceof Point ? p : err('Point expected'));\n// ## End of Helpers\n// -----------------\n/** secp256k1 formula. Koblitz curves are subclass of weierstrass curves with a=0, making it x\u00B3+b */\nconst koblitz = (x) => M(M(x * x) * x + _b);\n/** assert is field element or 0 */\nconst afield0 = (n) => arange(n, 0n, P);\n/** assert is field element */\nconst afield = (n) => arange(n, 1n, P);\n/** assert is group elem */\nconst agroup = (n) => arange(n, 1n, N);\nconst isEven = (y) => (y & 1n) === 0n;\n/** create Uint8Array of byte n */\nconst u8of = (n) => Uint8Array.of(n);\nconst getPrefix = (y) => u8of(isEven(y) ? 0x02 : 0x03);\n/** lift_x from BIP340 calculates square root. Validates x, then validates root*root. */\nconst lift_x = (x) => {\n // Let c = x\u00B3 + 7 mod p. Fail if x \u2265 p. (also fail if x < 1)\n const c = koblitz(afield(x));\n // c = \u221Ay\n // y = c^((p+1)/4) mod p\n // This formula works for fields p = 3 mod 4 -- a special, fast case.\n // Paper: \"Square Roots from 1;24,51,10 to Dan Shanks\".\n let r = 1n;\n for (let num = c, e = (P + 1n) / 4n; e > 0n; e >>= 1n) {\n // powMod: modular exponentiation.\n if (e & 1n)\n r = (r * num) % P; // Uses exponentiation by squaring.\n num = (num * num) % P; // Not constant-time.\n }\n return M(r * r) === c ? r : err('sqrt invalid'); // check if result is valid\n};\n/** Point in 3d xyz projective coordinates. 3d takes less inversions than 2d. */\nclass Point {\n static BASE;\n static ZERO;\n px;\n py;\n pz;\n constructor(px, py, pz) {\n this.px = afield0(px);\n this.py = afield(py); // y can't be 0 in Projective\n this.pz = afield0(pz);\n Object.freeze(this);\n }\n /** Convert Uint8Array or hex string to Point. */\n static fromBytes(bytes) {\n abytes(bytes);\n let p = undefined;\n // First byte is prefix, rest is data. There are 2 kinds: compressed & uncompressed:\n // * [0x02 or 0x03][32-byte x coordinate]\n // * [0x04] [32-byte x coordinate][32-byte y coordinate]\n const head = bytes[0];\n const tail = bytes.subarray(1);\n const x = sliceBytesNumBE(tail, 0, L);\n const len = bytes.length;\n // Compressed 33-byte point, 0x02 or 0x03 prefix\n if (len === L + 1 && [0x02, 0x03].includes(head)) {\n // Equation is y\u00B2 == x\u00B3 + ax + b. We calculate y from x.\n // y = \u221Ay\u00B2; there are two solutions: y, -y. Determine proper solution based on prefix\n let y = lift_x(x);\n const evenY = isEven(y);\n const evenH = isEven(big(head));\n if (evenH !== evenY)\n y = M(-y);\n p = new Point(x, y, 1n);\n }\n // Uncompressed 65-byte point, 0x04 prefix\n if (len === L2 + 1 && head === 0x04)\n p = new Point(x, sliceBytesNumBE(tail, L, L2), 1n);\n // Validate point\n return p ? p.assertValidity() : err('bad point: not on curve');\n }\n /** Equality check: compare points P&Q. */\n equals(other) {\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = apoint(other); // checks class equality\n const X1Z2 = M(X1 * Z2);\n const X2Z1 = M(X2 * Z1);\n const Y1Z2 = M(Y1 * Z2);\n const Y2Z1 = M(Y2 * Z1);\n return X1Z2 === X2Z1 && Y1Z2 === Y2Z1;\n }\n is0() {\n return this.equals(I);\n }\n /** Flip point over y coordinate. */\n negate() {\n return new Point(this.px, M(-this.py), this.pz);\n }\n /** Point doubling: P+P, complete formula. */\n double() {\n return this.add(this);\n }\n /**\n * Point addition: P+Q, complete, exception-free formula\n * (Renes-Costello-Batina, algo 1 of [2015/1060](https://eprint.iacr.org/2015/1060)).\n * Cost: `12M + 0S + 3*a + 3*b3 + 23add`.\n */\n // prettier-ignore\n add(other) {\n const { px: X1, py: Y1, pz: Z1 } = this;\n const { px: X2, py: Y2, pz: Z2 } = apoint(other);\n const a = 0n;\n const b = _b;\n let X3 = 0n, Y3 = 0n, Z3 = 0n;\n const b3 = M(b * 3n);\n let t0 = M(X1 * X2), t1 = M(Y1 * Y2), t2 = M(Z1 * Z2), t3 = M(X1 + Y1); // step 1\n let t4 = M(X2 + Y2); // step 5\n t3 = M(t3 * t4);\n t4 = M(t0 + t1);\n t3 = M(t3 - t4);\n t4 = M(X1 + Z1);\n let t5 = M(X2 + Z2); // step 10\n t4 = M(t4 * t5);\n t5 = M(t0 + t2);\n t4 = M(t4 - t5);\n t5 = M(Y1 + Z1);\n X3 = M(Y2 + Z2); // step 15\n t5 = M(t5 * X3);\n X3 = M(t1 + t2);\n t5 = M(t5 - X3);\n Z3 = M(a * t4);\n X3 = M(b3 * t2); // step 20\n Z3 = M(X3 + Z3);\n X3 = M(t1 - Z3);\n Z3 = M(t1 + Z3);\n Y3 = M(X3 * Z3);\n t1 = M(t0 + t0); // step 25\n t1 = M(t1 + t0);\n t2 = M(a * t2);\n t4 = M(b3 * t4);\n t1 = M(t1 + t2);\n t2 = M(t0 - t2); // step 30\n t2 = M(a * t2);\n t4 = M(t4 + t2);\n t0 = M(t1 * t4);\n Y3 = M(Y3 + t0);\n t0 = M(t5 * t4); // step 35\n X3 = M(t3 * X3);\n X3 = M(X3 - t0);\n t0 = M(t3 * t1);\n Z3 = M(t5 * Z3);\n Z3 = M(Z3 + t0); // step 40\n return new Point(X3, Y3, Z3);\n }\n /**\n * Point-by-scalar multiplication. Scalar must be in range 1 <= n < CURVE.n.\n * Uses {@link wNAF} for base point.\n * Uses fake point to mitigate side-channel leakage.\n * @param n scalar by which point is multiplied\n * @param safe safe mode guards against timing attacks; unsafe mode is faster\n */\n multiply(n, safe = true) {\n if (!safe && n === 0n)\n return I;\n agroup(n);\n if (n === 1n)\n return this;\n if (this.equals(G))\n return wNAF(n).p;\n // init result point & fake point\n let p = I;\n let f = G;\n for (let d = this; n > 0n; d = d.double(), n >>= 1n) {\n // if bit is present, add to point\n // if not present, add to fake, for timing safety\n if (n & 1n)\n p = p.add(d);\n else if (safe)\n f = f.add(d);\n }\n return p;\n }\n /** Convert point to 2d xy affine point. (X, Y, Z) \u220B (x=X/Z, y=Y/Z) */\n toAffine() {\n const { px: x, py: y, pz: z } = this;\n // fast-paths for ZERO point OR Z=1\n if (this.equals(I))\n return { x: 0n, y: 0n };\n if (z === 1n)\n return { x, y };\n const iz = invert(z, P);\n // (Z * Z^-1) must be 1, otherwise bad math\n if (M(z * iz) !== 1n)\n err('inverse invalid');\n // x = X*Z^-1; y = Y*Z^-1\n return { x: M(x * iz), y: M(y * iz) };\n }\n /** Checks if the point is valid and on-curve. */\n assertValidity() {\n const { x, y } = this.toAffine(); // convert to 2d xy affine point.\n afield(x); // must be in range 1 <= x,y < P\n afield(y);\n // y\u00B2 == x\u00B3 + ax + b, equation sides must be equal\n return M(y * y) === koblitz(x) ? this : err('bad point: not on curve');\n }\n /** Converts point to 33/65-byte Uint8Array. */\n toBytes(isCompressed = true) {\n const { x, y } = this.assertValidity().toAffine();\n const x32b = numTo32b(x);\n if (isCompressed)\n return concatBytes(getPrefix(y), x32b);\n return concatBytes(u8of(0x04), x32b, numTo32b(y));\n }\n /** Create 3d xyz point from 2d xy. (0, 0) => (0, 1, 0), not (0, 0, 1) */\n static fromAffine(ap) {\n const { x, y } = ap;\n return x === 0n && y === 0n ? I : new Point(x, y, 1n);\n }\n toHex(isCompressed) {\n return bytesToHex(this.toBytes(isCompressed));\n }\n static fromPrivateKey(k) {\n return G.multiply(toPrivScalar(k));\n }\n static fromHex(hex) {\n return Point.fromBytes(toU8(hex));\n }\n get x() {\n return this.toAffine().x;\n }\n get y() {\n return this.toAffine().y;\n }\n toRawBytes(isCompressed) {\n return this.toBytes(isCompressed);\n }\n}\n/** Generator / base point */\nconst G = new Point(Gx, Gy, 1n);\n/** Identity / zero point */\nconst I = new Point(0n, 1n, 0n);\n// Static aliases\nPoint.BASE = G;\nPoint.ZERO = I;\n/** `Q = u1\u22C5G + u2\u22C5R`. Verifies Q is not ZERO. Unsafe: non-CT. */\nconst doubleScalarMulUns = (R, u1, u2) => {\n return G.multiply(u1, false).add(R.multiply(u2, false)).assertValidity();\n};\nconst bytesToNumBE = (b) => big('0x' + (bytesToHex(b) || '0'));\nconst sliceBytesNumBE = (b, from, to) => bytesToNumBE(b.subarray(from, to));\nconst B256 = 2n ** 256n; // secp256k1 is weierstrass curve. Equation is x\u00B3 + ax + b.\n/** Number to 32b. Must be 0 <= num < B256. validate, pad, to bytes. */\nconst numTo32b = (num) => hexToBytes(padh(arange(num, 0n, B256), L2));\n/** Normalize private key to scalar (bigint). Verifies scalar is in range 1<s<N */\nconst toPrivScalar = (pr) => {\n const num = isBig(pr) ? pr : bytesToNumBE(toU8(pr, L));\n return arange(num, 1n, N, 'private key invalid 3');\n};\n/** For Signature malleability, validates sig.s is bigger than N/2. */\nconst highS = (n) => n > N >> 1n;\n/** Creates 33/65-byte public key from 32-byte private key. */\nconst getPublicKey = (privKey, isCompressed = true) => {\n return G.multiply(toPrivScalar(privKey)).toBytes(isCompressed);\n};\n/** ECDSA Signature class. Supports only compact 64-byte representation, not DER. */\nclass Signature {\n r;\n s;\n recovery;\n constructor(r, s, recovery) {\n this.r = agroup(r); // 1 <= r < N\n this.s = agroup(s); // 1 <= s < N\n if (recovery != null)\n this.recovery = recovery;\n Object.freeze(this);\n }\n /** Create signature from 64b compact (r || s) representation. */\n static fromBytes(b) {\n abytes(b, L2);\n const r = sliceBytesNumBE(b, 0, L);\n const s = sliceBytesNumBE(b, L, L2);\n return new Signature(r, s);\n }\n toBytes() {\n const { r, s } = this;\n return concatBytes(numTo32b(r), numTo32b(s));\n }\n /** Copy signature, with newly added recovery bit. */\n addRecoveryBit(bit) {\n return new Signature(this.r, this.s, bit);\n }\n hasHighS() {\n return highS(this.s);\n }\n toCompactRawBytes() {\n return this.toBytes();\n }\n toCompactHex() {\n return bytesToHex(this.toBytes());\n }\n recoverPublicKey(msg) {\n return recoverPublicKey(this, msg);\n }\n static fromCompact(hex) {\n return Signature.fromBytes(toU8(hex, L2));\n }\n assertValidity() {\n return this;\n }\n normalizeS() {\n const { r, s, recovery } = this;\n return highS(s) ? new Signature(r, modN(-s), recovery) : this;\n }\n}\n/**\n * RFC6979: ensure ECDSA msg is X bytes, convert to BigInt.\n * RFC suggests optional truncating via bits2octets.\n * FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits,\n * which matches bits2int. bits2int can produce res>N.\n */\nconst bits2int = (bytes) => {\n const delta = bytes.length * 8 - 256;\n if (delta > 1024)\n err('msg invalid'); // our CUSTOM check, \"just-in-case\": prohibit long inputs\n const num = bytesToNumBE(bytes);\n return delta > 0 ? num >> big(delta) : num;\n};\n/** int2octets can't be used; pads small msgs with 0: BAD for truncation as per RFC vectors */\nconst bits2int_modN = (bytes) => modN(bits2int(abytes(bytes)));\nconst signOpts = { lowS: true };\nconst veriOpts = { lowS: true };\n// RFC6979 signature generation, preparation step.\nconst prepSig = (msgh, priv, opts = signOpts) => {\n if (['der', 'recovered', 'canonical'].some((k) => k in opts))\n // legacy opts\n err('option not supported');\n let { lowS, extraEntropy } = opts; // generates low-s sigs by default\n if (lowS == null)\n lowS = true; // RFC6979 3.2: we skip step A\n const i2o = numTo32b; // int to octets\n const h1i = bits2int_modN(toU8(msgh)); // msg bigint\n const h1o = i2o(h1i); // msg octets\n const d = toPrivScalar(priv); // validate private key, convert to bigint\n const seed = [i2o(d), h1o]; // Step D of RFC6979 3.2\n /** RFC6979 3.6: additional k' (optional). See {@link ExtraEntropy}. */\n // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n if (extraEntropy)\n seed.push(extraEntropy === true ? randomBytes(L) : toU8(extraEntropy));\n const m = h1i; // convert msg to bigint\n // Converts signature params into point w r/s, checks result for validity.\n // To transform k => Signature:\n // q = k\u22C5G\n // r = q.x mod n\n // s = k^-1(m + rd) mod n\n const 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);\n if (!(1n <= k && k < N))\n return; // Check 0 < k < CURVE.n\n const q = G.multiply(k).toAffine(); // q = k\u22C5G\n const r = modN(q.x); // r = q.x mod n\n if (r === 0n)\n return;\n const ik = invert(k, N); // k^-1 mod n, NOT mod P\n const s = modN(ik * modN(m + modN(d * r))); // s = k^-1(m + rd) mod n\n if (s === 0n)\n return;\n let normS = s; // normalized S\n let recovery = (q.x === r ? 0 : 2) | Number(q.y & 1n); // recovery bit (2 or 3, when q.x > n)\n if (lowS && highS(s)) {\n // if lowS was passed, ensure s is always\n normS = modN(-s); // in the bottom half of CURVE.n\n recovery ^= 1;\n }\n return new Signature(r, normS, recovery); // use normS, not s\n };\n return { seed: concatBytes(...seed), k2sig };\n};\n// HMAC-DRBG from NIST 800-90. Minimal, non-full-spec - used for RFC6979 signatures.\nconst hmacDrbg = (asynchronous) => {\n let v = u8n(L); // Steps B, C of RFC6979 3.2: set hashLen\n let k = u8n(L); // In our case, it's always equal to L\n let i = 0; // Iterations counter, will throw when over max\n const NULL = u8n(0);\n const reset = () => {\n v.fill(1);\n k.fill(0);\n i = 0;\n };\n const max = 1000;\n const _e = 'drbg: tried 1000 values';\n if (asynchronous) {\n // asynchronous=true\n // h = hmac(K || V || ...)\n const h = (...b) => etc.hmacSha256Async(k, v, ...b);\n const reseed = async (seed = NULL) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = await h(u8of(0x00), seed); // k = hmac(K || V || 0x00 || seed)\n v = await h(); // v = hmac(K || V)\n if (seed.length === 0)\n return;\n k = await h(u8of(0x01), seed); // k = hmac(K || V || 0x01 || seed)\n v = await h(); // v = hmac(K || V)\n };\n // HMAC-DRBG generate() function\n const gen = async () => {\n if (i++ >= max)\n err(_e);\n v = await h(); // v = hmac(K || V)\n return v; // this diverges from noble-curves: we don't allow arbitrary output len!\n };\n // Do not reuse returned fn for more than 1 sig:\n // 1) it's slower (JIT screws up). 2. unsafe (async race conditions)\n return async (seed, pred) => {\n reset();\n await reseed(seed); // Steps D-G\n let res = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(await gen())))\n await reseed(); // test predicate until it returns ok\n reset();\n return res;\n };\n }\n else {\n // asynchronous=false; same as above, but synchronous\n // h = hmac(K || V || ...)\n const h = (...b) => callHash('hmacSha256Sync')(k, v, ...b);\n const reseed = (seed = NULL) => {\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 // HMAC-DRBG generate() function\n const gen = () => {\n if (i++ >= max)\n err(_e);\n v = h(); // v = hmac(k || v)\n return v; // this diverges from noble-curves: we don't allow arbitrary output len!\n };\n // Do not reuse returned fn for more than 1 sig:\n // 1) it's slower (JIT screws up). 2. unsafe (async race conditions)\n return (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(); // test predicate until it returns ok\n reset();\n return res;\n };\n }\n};\n/**\n * Sign a msg hash using secp256k1. Async.\n * Follows [SEC1](https://secg.org/sec1-v2.pdf) 4.1.2 & RFC6979.\n * It's suggested to enable hedging ({@link ExtraEntropy}) to prevent fault attacks.\n * @param msgh - message HASH, not message itself e.g. sha256(message)\n * @param priv - private key\n * @param opts - `lowS: true` prevents malleability, `extraEntropy: true` enables hedging\n */\nconst signAsync = async (msgh, priv, opts = signOpts) => {\n // Re-run drbg until k2sig returns ok\n const { seed, k2sig } = prepSig(msgh, priv, opts);\n const sig = await hmacDrbg(true)(seed, k2sig);\n return sig;\n};\n/**\n * Sign a msg hash using secp256k1.\n * Follows [SEC1](https://secg.org/sec1-v2.pdf) 4.1.2 & RFC6979.\n * It's suggested to enable hedging ({@link ExtraEntropy}) to prevent fault attacks.\n * @param msgh - message HASH, not message itself e.g. sha256(message)\n * @param priv - private key\n * @param opts - `lowS: true` prevents malleability, `extraEntropy: true` enables hedging\n * @example\n * const sig = sign(sha256('hello'), privKey, { extraEntropy: true }).toBytes();\n */\nconst sign = (msgh, priv, opts = signOpts) => {\n // Re-run drbg until k2sig returns ok\n const { seed, k2sig } = prepSig(msgh, priv, opts);\n const sig = hmacDrbg(false)(seed, k2sig);\n return sig;\n};\n/**\n * Verify a signature using secp256k1.\n * Follows [SEC1](https://secg.org/sec1-v2.pdf) 4.1.4.\n * Default lowS=true, prevents malleability.\n * @param sig - signature, 64-byte or Signature instance\n * @param msgh - message HASH, not message itself e.g. sha256(message)\n * @param pub - public key\n * @param opts - { lowS: true } is default, prohibits s >= CURVE.n/2 to prevent malleability\n */\nconst verify = (sig, msgh, pub, opts = veriOpts) => {\n let { lowS } = opts;\n if (lowS == null)\n lowS = true;\n if ('strict' in opts)\n err('option not supported');\n let sigg;\n // Previous ver supported DER sigs.\n // We throw error when DER is suspected now.\n const rs = sig && typeof sig === 'object' && 'r' in sig;\n if (!rs && toU8(sig).length !== L2)\n err('signature must be 64 bytes');\n try {\n sigg = rs ? new Signature(sig.r, sig.s) : Signature.fromCompact(sig);\n const h = bits2int_modN(toU8(msgh)); // Truncate hash\n const P = Point.fromBytes(toU8(pub)); // Validate public key\n const { r, s } = sigg;\n if (lowS && highS(s))\n return false; // lowS bans sig.s >= CURVE.n/2\n const is = invert(s, N); // s^-1\n const u1 = modN(h * is); // u1 = hs^-1 mod n\n const u2 = modN(r * is); // u2 = rs^-1 mod n\n const R = doubleScalarMulUns(P, u1, u2).toAffine(); // R = u1\u22C5G + u2\u22C5P\n // Stop if R is identity / zero point. Check is done inside `doubleScalarMulUns`\n const v = modN(R.x); // R.x must be in N's field, not P's\n return v === r; // mod(R.x, n) == r\n }\n catch (error) {\n return false;\n }\n};\n/**\n * ECDSA public key recovery. Requires msg hash and recovery id.\n * Follows [SEC1](https://secg.org/sec1-v2.pdf) 4.1.6.\n */\nconst recoverPublicKey = (sig, msgh) => {\n const { r, s, recovery } = sig;\n // 0 or 1 recovery id determines sign of \"y\" coordinate.\n // 2 or 3 means q.x was >N.\n if (![0, 1, 2, 3].includes(recovery))\n err('recovery id invalid');\n const h = bits2int_modN(toU8(msgh, L)); // Truncate hash\n const radj = recovery === 2 || recovery === 3 ? r + N : r;\n afield(radj); // ensure q.x is still a field element\n const head = getPrefix(big(recovery)); // head is 0x02 or 0x03\n const Rb = concatBytes(head, numTo32b(radj)); // concat head + r\n const R = Point.fromBytes(Rb);\n const ir = invert(radj, N); // r^-1\n const u1 = modN(-h * ir); // -hr^-1\n const u2 = modN(s * ir); // sr^-1\n return doubleScalarMulUns(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n};\n/**\n * Elliptic Curve Diffie-Hellman (ECDH) on secp256k1.\n * Result is **NOT hashed**. Use hash or KDF on it if you need.\n * @param privA private key A\n * @param pubB public key B\n * @param isCompressed 33-byte (true) or 65-byte (false) output\n * @returns public key C\n */\nconst getSharedSecret = (privA, pubB, isCompressed = true) => {\n return Point.fromBytes(toU8(pubB)).multiply(toPrivScalar(privA)).toBytes(isCompressed);\n};\n// FIPS 186 B.4.1 compliant key generation produces private keys with modulo bias being neglible.\n// takes >N+8 bytes, returns (hash mod n-1)+1\nconst hashToPrivateKey = (hash) => {\n hash = toU8(hash);\n if (hash.length < L + 8 || hash.length > 1024)\n err('expected 40-1024b');\n const num = M(bytesToNumBE(hash), N - 1n);\n return numTo32b(num + 1n);\n};\nconst randomPrivateKey = () => hashToPrivateKey(randomBytes(L + 16)); // FIPS 186 B.4.1.\nconst _sha = 'SHA-256';\n/** Math, hex, byte helpers. Not in `utils` because utils share API with noble-curves. */\nconst etc = {\n hexToBytes: hexToBytes,\n bytesToHex: bytesToHex,\n concatBytes: concatBytes,\n bytesToNumberBE: bytesToNumBE,\n numberToBytesBE: numTo32b,\n mod: M,\n invert: invert, // math utilities\n hmacSha256Async: async (key, ...msgs) => {\n const s = subtle();\n const name = 'HMAC';\n const k = await s.importKey('raw', key, { name, hash: { name: _sha } }, false, ['sign']);\n return u8n(await s.sign(name, k, concatBytes(...msgs)));\n },\n hmacSha256Sync: undefined, // For TypeScript. Actual logic is below\n hashToPrivateKey: hashToPrivateKey,\n randomBytes: randomBytes,\n};\n/** Curve-specific utilities for private keys. */\nconst utils = {\n normPrivateKeyToScalar: toPrivScalar,\n isValidPrivateKey: (key) => {\n try {\n return !!toPrivScalar(key);\n }\n catch (e) {\n return false;\n }\n },\n randomPrivateKey: randomPrivateKey,\n precompute: (w = 8, p = G) => {\n p.multiply(3n);\n w;\n return p;\n },\n};\n// ## Precomputes\n// --------------\nconst W = 8; // W is window size\nconst scalarBits = 256;\nconst pwindows = Math.ceil(scalarBits / W) + 1; // 33 for W=8\nconst pwindowSize = 2 ** (W - 1); // 128 for W=8\nconst precompute = () => {\n const points = [];\n let p = G;\n let b = p;\n for (let w = 0; w < pwindows; w++) {\n b = p;\n points.push(b);\n for (let i = 1; i < pwindowSize; i++) {\n b = b.add(p);\n points.push(b);\n } // i=1, bc we skip 0\n p = b.double();\n }\n return points;\n};\nlet Gpows = undefined; // precomputes for base point G\n// const-time negate\nconst ctneg = (cnd, p) => {\n const n = p.negate();\n return cnd ? n : p;\n};\n/**\n * Precomputes give 12x faster getPublicKey(), 10x sign(), 2x verify() by\n * caching multiples of G (base point). Cache is stored in 32MB of RAM.\n * Any time `G.multiply` is done, precomputes are used.\n * Not used for getSharedSecret, which instead multiplies random pubkey `P.multiply`.\n *\n * w-ary non-adjacent form (wNAF) precomputation method is 10% slower than windowed method,\n * but takes 2x less RAM. RAM reduction is possible by utilizing `.subtract`.\n *\n * !! Precomputes can be disabled by commenting-out call of the wNAF() inside Point#multiply().\n */\nconst wNAF = (n) => {\n const comp = Gpows || (Gpows = precompute());\n let p = I;\n let f = G; // f must be G, or could become I in the end\n const pow_2_w = 2 ** W; // 256 for W=8\n const maxNum = pow_2_w; // 256 for W=8\n const mask = big(pow_2_w - 1); // 255 for W=8 == mask 0b11111111\n const shiftBy = big(W); // 8 for W=8\n for (let w = 0; w < pwindows; w++) {\n let wbits = Number(n & mask); // extract W bits.\n n >>= shiftBy; // shift number by W bits.\n if (wbits > pwindowSize) {\n wbits -= maxNum;\n n += 1n;\n } // split if bits > max: +224 => 256-32\n const off = w * pwindowSize;\n const offF = off; // offsets, evaluate both\n const offP = off + Math.abs(wbits) - 1;\n const isEven = w % 2 !== 0; // conditions, evaluate both\n const isNeg = wbits < 0;\n if (wbits === 0) {\n // off == I: can't add it. Adding random offF instead.\n f = f.add(ctneg(isEven, comp[offF])); // bits are 0: add garbage to fake point\n }\n else {\n p = p.add(ctneg(isNeg, comp[offP])); // bits are 1: add to result point\n }\n }\n return { p, f }; // return both real and fake points for JIT\n};\n// !! Remove the export below to easily use in REPL / browser console\nexport { secp256k1_CURVE as CURVE, etc, getPublicKey, getSharedSecret, Point, Point as ProjectivePoint, sign, signAsync, Signature, utils, verify, };\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, Hash, toBytes, type CHash, type Input } from './utils.ts';\n\nexport class HMAC<T extends Hash<T>> extends Hash<HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, _key: Input) {\n super();\n ahash(hash);\n const key = toBytes(_key);\n this.iHash = hash.create() as T;\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++) 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() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n clean(pad);\n }\n update(buf: Input): this {\n aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array): void {\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(): Uint8Array {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: HMAC<T>): HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\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(): HMAC<T> {\n return this._cloneInto();\n }\n destroy(): void {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\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: {\n (hash: CHash, key: Input, message: Input): Uint8Array;\n create(hash: CHash, key: Input): HMAC<any>;\n} = (hash: CHash, key: Input, message: Input): Uint8Array =>\n new HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Input) => new HMAC<any>(hash, key);\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\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\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number): void {\n if (!Number.isSafeInteger(n) || n < 0) throw new Error('positive integer expected, got ' + n);\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(b: Uint8Array | undefined, ...lengths: number[]): void {\n if (!isBytes(b)) 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\n/** Asserts something is hash */\nexport function ahash(h: IHash): void {\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\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\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\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** @deprecated */\nexport const byteSwapIfBE: typeof swap8IfBE = swap8IfBE;\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\ndeclare const TextDecoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes: Uint8Array): string {\n return new TextDecoder().decode(bytes);\n}\n\n/** Accepted input of hash functions. Strings are converted to byte arrays. */\nexport type Input = string | Uint8Array;\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: Input): Uint8Array {\n if (typeof data === 'string') data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data: KDFInput): Uint8Array {\n if (typeof data === 'string') data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\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 as T1 & T2;\n}\n\n/** Hash interface. */\nexport type IHash = {\n (data: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create: any;\n};\n\n/** For runtime check if class implements interface */\nexport abstract class Hash<T extends Hash<T>> {\n abstract blockLen: number; // Bytes per block\n abstract outputLen: number; // Bytes in output\n abstract update(buf: Input): this;\n // Writes digest into buf\n abstract digestInto(buf: Uint8Array): void;\n abstract digest(): Uint8Array;\n /**\n * Resets internal state. Makes Hash instance unusable.\n * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n * by user, they will need to manually call `destroy()` when zeroing is necessary.\n */\n abstract destroy(): void;\n /**\n * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n * when no options are passed.\n * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n * There are no guarantees for clean-up because it's impossible in JS.\n */\n abstract _cloneInto(to?: T): T;\n // Safe version that clones internal state\n abstract clone(): T;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash function */\nexport type CHash = ReturnType<typeof createHasher>;\n/** Hash function with output */\nexport type CHashO = ReturnType<typeof createOptHasher>;\n/** XOF with output */\nexport type CHashXO = ReturnType<typeof createXOFer>;\n\n/** Wraps hash function, creating an interface on top of it */\nexport function createHasher<T extends Hash<T>>(\n hashCons: () => Hash<T>\n): {\n (msg: Input): Uint8Array;\n outputLen: number;\n blockLen: number;\n create(): Hash<T>;\n} {\n const hashC = (msg: Input): Uint8Array => 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}\n\nexport function createOptHasher<H extends Hash<H>, T extends Object>(\n hashCons: (opts?: T) => Hash<H>\n): {\n (msg: Input, opts?: T): Uint8Array;\n outputLen: number;\n blockLen: number;\n create(opts?: T): Hash<H>;\n} {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: T) => hashCons(opts);\n return hashC;\n}\n\nexport function createXOFer<H extends HashXOF<H>, T extends Object>(\n hashCons: (opts?: T) => HashXOF<H>\n): {\n (msg: Input, opts?: T): Uint8Array;\n outputLen: number;\n blockLen: number;\n create(opts?: T): HashXOF<H>;\n} {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: T) => hashCons(opts);\n return hashC;\n}\nexport const wrapConstructor: typeof createHasher = createHasher;\nexport const wrapConstructorWithOpts: typeof createOptHasher = createOptHasher;\nexport const wrapXOFConstructorWithOpts: typeof createXOFer = createXOFer;\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\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", "/**\n * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.\n *\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 *\n * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n * @deprecated\n */\nimport {\n SHA224 as SHA224n,\n sha224 as sha224n,\n SHA256 as SHA256n,\n sha256 as sha256n,\n} from './sha2.ts';\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const SHA256: typeof SHA256n = SHA256n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const sha256: typeof sha256n = sha256n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const SHA224: typeof SHA224n = SHA224n;\n/** @deprecated Use import from `noble/hashes/sha2` module */\nexport const sha224: typeof sha224n = sha224n;\n", "/**\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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nexport class SHA256 extends HashMD<SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n\n constructor(outputLen: number = 32) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\nexport class SHA224 extends SHA256 {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\nexport class SHA512 extends HashMD<SHA512> {\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 protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor(outputLen: number = 64) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\nexport class SHA384 extends SHA512 {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\nexport class SHA512_224 extends SHA512 {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\nexport class SHA512_256 extends SHA512 {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\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: CHash = /* @__PURE__ */ createHasher(() => new SHA256());\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash = /* @__PURE__ */ createHasher(() => new SHA224());\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash = /* @__PURE__ */ createHasher(() => new SHA512());\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash = /* @__PURE__ */ createHasher(() => new SHA384());\n\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: CHash = /* @__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: CHash = /* @__PURE__ */ createHasher(() => new SHA512_224());\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { type Input, Hash, abytes, aexists, aoutput, clean, createView, toBytes } from './utils.ts';\n\n/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */\nexport function setBigUint64(\n view: DataView,\n byteOffset: number,\n value: bigint,\n isLE: boolean\n): void {\n if (typeof view.setBigUint64 === 'function') 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\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> extends Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\n super();\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: Input): this {\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) 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: Uint8Array): void {\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++) 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) 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) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\n * BIP32 Hierarchical Deterministic (HD) wallet derivation\n *\n * Implements standard Bitcoin wallet derivation (BIP32/BIP44/BIP84)\n * for ECDSA secp256k1 keys.\n *\n * Supports:\n * - BIP39 mnemonic \u2192 seed conversion\n * - BIP32 path derivation (e.g., \"m/44'/0'/0'/0/0\")\n * - Standard Bitcoin wallet paths\n *\n * References:\n * - BIP32: https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki\n * - BIP39: https://github.com/bitcoin/bips/blob/master/bip-0039.mediawiki\n * - BIP44: https://github.com/bitcoin/bips/blob/master/bip-0044.mediawiki\n */\nimport { HDKey } from '@scure/bip32';\nimport { mnemonicToSeedSync, generateMnemonic as generateBIP39Mnemonic } from '@scure/bip39';\nimport { wordlist } from '@scure/bip39/wordlists/english.js';\n/**\n * BIP32 derivation implementation for HD wallets.\n *\n * Usage:\n * ```typescript\n * const derivation = new BIP32Derivation();\n *\n * // From mnemonic\n * const mnemonic = \"abandon abandon abandon...\";\n * const keypair = await derivation.deriveKeypair({\n * seed: derivation.mnemonicToSeed(mnemonic),\n * path: \"m/44'/0'/0'/0/0\"\n * });\n *\n * // From existing seed\n * const keypair = await derivation.deriveKeypair({\n * seed: myExistingSeed,\n * path: \"m/44'/0'/0'/0/1\"\n * });\n * ```\n */\nexport class BIP32Derivation {\n /**\n * Derive a keypair from BIP32 path.\n *\n * @param context Must include `seed` and `path`\n * @returns Secp256k1 keypair (compressed public key)\n * @throws If seed or path is missing, or path is invalid\n */\n async deriveKeypair(context) {\n if (!context.seed) {\n throw new Error('BIP32 derivation requires a seed');\n }\n if (!context.path) {\n throw new Error('BIP32 derivation requires a path (e.g., \"m/44\\'/0\\'/0\\'/0/0\")');\n }\n try {\n // Create HD key from seed\n const masterKey = HDKey.fromMasterSeed(context.seed);\n // Derive child key at path\n const childKey = masterKey.derive(context.path);\n if (!childKey.privateKey) {\n throw new Error(`Failed to derive private key at path ${context.path}`);\n }\n if (!childKey.publicKey) {\n throw new Error(`Failed to derive public key at path ${context.path}`);\n }\n return {\n privateKey: childKey.privateKey,\n publicKey: childKey.publicKey, // Already compressed (33 bytes)\n };\n }\n catch (error) {\n throw new Error(`BIP32 derivation failed at path ${context.path}: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n /**\n * Convert BIP39 mnemonic to BIP32 seed.\n *\n * @param mnemonic 12, 15, 18, 21, or 24 word mnemonic\n * @param passphrase Optional BIP39 passphrase\n * @returns 64-byte seed suitable for BIP32\n */\n mnemonicToSeed(mnemonic, passphrase) {\n return mnemonicToSeedSync(mnemonic, passphrase);\n }\n /**\n * Generate a new BIP39 mnemonic.\n *\n * @param strength Entropy bits: 128 (12 words), 256 (24 words), etc.\n * @returns Space-separated mnemonic phrase\n */\n generateMnemonic(strength = 256) {\n return generateBIP39Mnemonic(wordlist, strength);\n }\n /**\n * Standard BIP44 path for Bitcoin.\n *\n * @param account Account index (default: 0)\n * @param change 0 = external (receive), 1 = internal (change)\n * @param index Address index\n * @returns BIP44 path string\n */\n static bitcoinPath(account = 0, change = 0, index = 0) {\n return `m/44'/0'/${account}'/${change}/${index}`;\n }\n /**\n * Standard BIP84 path for Bitcoin SegWit (native).\n *\n * @param account Account index (default: 0)\n * @param change 0 = external (receive), 1 = internal (change)\n * @param index Address index\n * @returns BIP84 path string\n */\n static bitcoinSegWitPath(account = 0, change = 0, index = 0) {\n return `m/84'/0'/${account}'/${change}/${index}`;\n }\n}\n", "/**\n * BIP32 hierarchical deterministic (HD) wallets over secp256k1.\n * @module\n * @example\n * ```js\n * import { HDKey } from \"@scure/bip32\";\n * const hdkey1 = HDKey.fromMasterSeed(seed);\n * const hdkey2 = HDKey.fromExtendedKey(base58key);\n * const hdkey3 = HDKey.fromJSON({ xpriv: string });\n *\n * // props\n * [hdkey1.depth, hdkey1.index, hdkey1.chainCode];\n * console.log(hdkey2.privateKey, hdkey2.publicKey);\n * console.log(hdkey3.derive(\"m/0/2147483647'/1\"));\n * const sig = hdkey3.sign(hash);\n * hdkey3.verify(hash, sig);\n * ```\n */\n/*! scure-bip32 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */\nimport { secp256k1 as secp } from '@noble/curves/secp256k1.js';\nimport { hmac } from '@noble/hashes/hmac.js';\nimport { ripemd160 } from '@noble/hashes/legacy.js';\nimport { sha256, sha512 } from '@noble/hashes/sha2.js';\nimport { abytes, concatBytes, createView } from '@noble/hashes/utils.js';\nimport { createBase58check } from '@scure/base';\n\nconst Point = secp.Point;\nconst { Fn } = Point;\nconst base58check = createBase58check(sha256);\n\nconst MASTER_SECRET = Uint8Array.from('Bitcoin seed'.split(''), (char) => char.charCodeAt(0));\n\n/** Network-specific versioning. */\nexport interface Versions {\n private: number;\n public: number;\n}\n\nconst BITCOIN_VERSIONS: Versions = { private: 0x0488ade4, public: 0x0488b21e };\n/** Hardened offset from Bitcoin, default */\nexport const HARDENED_OFFSET: number = 0x80000000;\n\nconst hash160 = (data: Uint8Array) => ripemd160(sha256(data));\nconst fromU32 = (data: Uint8Array) => createView(data).getUint32(0, false);\nconst toU32 = (n: number): Uint8Array => {\n if (!Number.isSafeInteger(n) || n < 0 || n > 2 ** 32 - 1) {\n throw new Error('invalid number, should be from 0 to 2**32-1, got ' + n);\n }\n const buf = new Uint8Array(4);\n createView(buf).setUint32(0, n, false);\n return buf;\n};\n\ninterface HDKeyOpt {\n versions?: Versions;\n depth?: number;\n index?: number;\n parentFingerprint?: number;\n chainCode?: Uint8Array;\n publicKey?: Uint8Array;\n privateKey?: Uint8Array;\n}\n\n/**\n * HDKey from BIP32\n * @example\n```js\nconst hdkey1 = HDKey.fromMasterSeed(seed);\nconst hdkey2 = HDKey.fromExtendedKey(base58key);\nconst hdkey3 = HDKey.fromJSON({ xpriv: string });\n```\n */\nexport class HDKey {\n get fingerprint(): number {\n if (!this.pubHash) {\n throw new Error('No publicKey set!');\n }\n return fromU32(this.pubHash);\n }\n get identifier(): Uint8Array | undefined {\n return this.pubHash;\n }\n get pubKeyHash(): Uint8Array | undefined {\n return this.pubHash;\n }\n get privateKey(): Uint8Array | null {\n return this._privateKey || null;\n }\n get publicKey(): Uint8Array | null {\n return this._publicKey || null;\n }\n get privateExtendedKey(): string {\n const priv = this._privateKey;\n if (!priv) {\n throw new Error('No private key');\n }\n return base58check.encode(\n this.serialize(this.versions.private, concatBytes(Uint8Array.of(0), priv))\n );\n }\n get publicExtendedKey(): string {\n if (!this._publicKey) {\n throw new Error('No public key');\n }\n return base58check.encode(this.serialize(this.versions.public, this._publicKey));\n }\n\n static fromMasterSeed(seed: Uint8Array, versions: Versions = BITCOIN_VERSIONS): HDKey {\n abytes(seed);\n if (8 * seed.length < 128 || 8 * seed.length > 512) {\n throw new Error(\n 'HDKey: seed length must be between 128 and 512 bits; 256 bits is advised, got ' +\n seed.length\n );\n }\n const I = hmac(sha512, MASTER_SECRET, seed);\n const privateKey = I.slice(0, 32);\n const chainCode = I.slice(32);\n return new HDKey({ versions, chainCode, privateKey });\n }\n\n static fromExtendedKey(base58key: string, versions: Versions = BITCOIN_VERSIONS): HDKey {\n // => version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n const keyBuffer: Uint8Array = base58check.decode(base58key);\n const keyView = createView(keyBuffer);\n const version = keyView.getUint32(0, false);\n const opt = {\n versions,\n depth: keyBuffer[4],\n parentFingerprint: keyView.getUint32(5, false),\n index: keyView.getUint32(9, false),\n chainCode: keyBuffer.slice(13, 45),\n };\n const key = keyBuffer.slice(45);\n const isPriv = key[0] === 0;\n if (version !== versions[isPriv ? 'private' : 'public']) {\n throw new Error('Version mismatch');\n }\n if (isPriv) {\n return new HDKey({ ...opt, privateKey: key.slice(1) });\n } else {\n return new HDKey({ ...opt, publicKey: key });\n }\n }\n\n public static fromJSON(json: { xpriv: string }): HDKey {\n return HDKey.fromExtendedKey(json.xpriv);\n }\n readonly versions: Versions;\n readonly depth: number = 0;\n readonly index: number = 0;\n readonly chainCode: Uint8Array | null = null;\n readonly parentFingerprint: number = 0;\n private _privateKey?: Uint8Array;\n private _publicKey?: Uint8Array;\n private pubHash: Uint8Array | undefined;\n\n constructor(opt: HDKeyOpt) {\n if (!opt || typeof opt !== 'object') {\n throw new Error('HDKey.constructor must not be called directly');\n }\n this.versions = opt.versions || BITCOIN_VERSIONS;\n this.depth = opt.depth || 0;\n this.chainCode = opt.chainCode || null;\n this.index = opt.index || 0;\n this.parentFingerprint = opt.parentFingerprint || 0;\n if (!this.depth) {\n if (this.parentFingerprint || this.index) {\n throw new Error('HDKey: zero depth with non-zero index/parent fingerprint');\n }\n }\n if (this.depth > 255) {\n throw new Error('HDKey: depth exceeds the serializable value 255');\n }\n if (opt.publicKey && opt.privateKey) {\n throw new Error('HDKey: publicKey and privateKey at same time.');\n }\n if (opt.privateKey) {\n if (!secp.utils.isValidSecretKey(opt.privateKey)) throw new Error('Invalid private key');\n this._privateKey = opt.privateKey;\n this._publicKey = secp.getPublicKey(opt.privateKey, true);\n } else if (opt.publicKey) {\n this._publicKey = Point.fromBytes(opt.publicKey).toBytes(true); // force compressed point\n } else {\n throw new Error('HDKey: no public or private key provided');\n }\n this.pubHash = hash160(this._publicKey);\n }\n\n derive(path: string): HDKey {\n if (!/^[mM]'?/.test(path)) {\n throw new Error('Path must start with \"m\" or \"M\"');\n }\n if (/^[mM]'?$/.test(path)) {\n return this;\n }\n const parts = path.replace(/^[mM]'?\\//, '').split('/');\n // tslint:disable-next-line\n let child: HDKey = this;\n for (const c of parts) {\n const m = /^(\\d+)('?)$/.exec(c);\n const m1 = m && m[1];\n if (!m || m.length !== 3 || typeof m1 !== 'string')\n throw new Error('invalid child index: ' + c);\n let idx = +m1;\n if (!Number.isSafeInteger(idx) || idx >= HARDENED_OFFSET) {\n throw new Error('Invalid index');\n }\n // hardened key\n if (m[2] === \"'\") {\n idx += HARDENED_OFFSET;\n }\n child = child.deriveChild(idx);\n }\n return child;\n }\n\n deriveChild(index: number): HDKey {\n if (!this._publicKey || !this.chainCode) {\n throw new Error('No publicKey or chainCode set');\n }\n let data = toU32(index);\n if (index >= HARDENED_OFFSET) {\n // Hardened\n const priv = this._privateKey;\n if (!priv) {\n throw new Error('Could not derive hardened child key');\n }\n // Hardened child: 0x00 || ser256(kpar) || ser32(index)\n data = concatBytes(Uint8Array.of(0), priv, data);\n } else {\n // Normal child: serP(point(kpar)) || ser32(index)\n data = concatBytes(this._publicKey, data);\n }\n const I = hmac(sha512, this.chainCode, data);\n const childTweak = I.slice(0, 32);\n const chainCode = I.slice(32);\n if (!secp.utils.isValidSecretKey(childTweak)) {\n throw new Error('Tweak bigger than curve order');\n }\n const opt: HDKeyOpt = {\n versions: this.versions,\n chainCode,\n depth: this.depth + 1,\n parentFingerprint: this.fingerprint,\n index,\n };\n const ctweak = Fn.fromBytes(childTweak);\n try {\n // Private parent key -> private child key\n if (this._privateKey) {\n const added = Fn.create(Fn.fromBytes(this._privateKey) + ctweak);\n if (!Fn.isValidNot0(added)) {\n throw new Error('The tweak was out of range or the resulted private key is invalid');\n }\n opt.privateKey = Fn.toBytes(added);\n } else {\n const added = Point.fromBytes(this._publicKey).add(Point.BASE.multiply(ctweak));\n // Cryptographically impossible: hmac-sha512 preimage would need to be found\n if (added.equals(Point.ZERO)) {\n throw new Error('The tweak was equal to negative P, which made the result key invalid');\n }\n opt.publicKey = added.toBytes(true);\n }\n return new HDKey(opt);\n } catch (err) {\n return this.deriveChild(index + 1);\n }\n }\n\n sign(hash: Uint8Array): Uint8Array {\n if (!this._privateKey) {\n throw new Error('No privateKey set!');\n }\n abytes(hash, 32);\n return secp.sign(hash, this._privateKey, { prehash: false });\n }\n\n verify(hash: Uint8Array, signature: Uint8Array): boolean {\n abytes(hash, 32);\n abytes(signature, 64);\n if (!this._publicKey) {\n throw new Error('No publicKey set!');\n }\n return secp.verify(signature, hash, this._publicKey, { prehash: false });\n }\n\n wipePrivateData(): this {\n if (this._privateKey) {\n this._privateKey.fill(0);\n this._privateKey = undefined;\n }\n return this;\n }\n toJSON(): { xpriv: string; xpub: string } {\n return {\n xpriv: this.privateExtendedKey,\n xpub: this.publicExtendedKey,\n };\n }\n\n private serialize(version: number, key: Uint8Array) {\n if (!this.chainCode) {\n throw new Error('No chainCode set');\n }\n abytes(key, 33);\n // version(4) || depth(1) || fingerprint(4) || index(4) || chain(32) || key(33)\n return concatBytes(\n toU32(version),\n new Uint8Array([this.depth]),\n toU32(this.parentFingerprint),\n toU32(this.index),\n this.chainCode,\n key\n );\n }\n}\n", "/**\n * SECG secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).\n *\n * Belongs to Koblitz curves: it has efficiently-computable GLV endomorphism \u03C8,\n * check out {@link EndomorphismOpts}. Seems to be rigid (not backdoored).\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha2.js';\nimport { randomBytes } from '@noble/hashes/utils.js';\nimport { createKeygen, type CurveLengths } from './abstract/curve.ts';\nimport { createHasher, type H2CHasher, isogenyMap } from './abstract/hash-to-curve.ts';\nimport { Field, mapHashToField, pow2 } from './abstract/modular.ts';\nimport {\n type ECDSA,\n ecdsa,\n type EndomorphismOpts,\n mapToCurveSimpleSWU,\n type WeierstrassPoint as PointType,\n weierstrass,\n type WeierstrassOpts,\n type WeierstrassPointCons,\n} from './abstract/weierstrass.ts';\nimport { abytes, asciiToBytes, bytesToNumberBE, concatBytes } from './utils.ts';\n\n// Seems like generator was produced from some seed:\n// `Pointk1.BASE.multiply(Pointk1.Fn.inv(2n, N)).toAffine().x`\n// // gives short x 0x3b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63n\nconst secp256k1_CURVE: WeierstrassOpts<bigint> = {\n p: BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'),\n n: BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'),\n h: BigInt(1),\n a: BigInt(0),\n b: BigInt(7),\n Gx: BigInt('0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798'),\n Gy: BigInt('0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8'),\n};\n\nconst secp256k1_ENDO: EndomorphismOpts = {\n beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n basises: [\n [BigInt('0x3086d221a7d46bcde86c90e49284eb15'), -BigInt('0xe4437ed6010e88286f547fa90abfe4c3')],\n [BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8'), BigInt('0x3086d221a7d46bcde86c90e49284eb15')],\n ],\n};\n\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _2n = /* @__PURE__ */ BigInt(2);\n\n/**\n * \u221An = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y: bigint): bigint {\n const P = secp256k1_CURVE.p;\n // prettier-ignore\n const _3n = BigInt(3), _6n = BigInt(6), _11n = BigInt(11), _22n = BigInt(22);\n // prettier-ignore\n const _23n = BigInt(23), _44n = BigInt(44), _88n = BigInt(88);\n const b2 = (y * y * y) % P; // x^3, 11\n const b3 = (b2 * b2 * y) % P; // x^7\n const b6 = (pow2(b3, _3n, P) * b3) % P;\n const b9 = (pow2(b6, _3n, P) * b3) % P;\n const b11 = (pow2(b9, _2n, P) * b2) % P;\n const b22 = (pow2(b11, _11n, P) * b11) % P;\n const b44 = (pow2(b22, _22n, P) * b22) % P;\n const b88 = (pow2(b44, _44n, P) * b44) % P;\n const b176 = (pow2(b88, _88n, P) * b88) % P;\n const b220 = (pow2(b176, _44n, P) * b44) % P;\n const b223 = (pow2(b220, _3n, P) * b3) % P;\n const t1 = (pow2(b223, _23n, P) * b22) % P;\n const t2 = (pow2(t1, _6n, P) * b2) % P;\n const root = pow2(t2, _2n, P);\n if (!Fpk1.eql(Fpk1.sqr(root), y)) throw new Error('Cannot find square root');\n return root;\n}\n\nconst Fpk1 = Field(secp256k1_CURVE.p, { sqrt: sqrtMod });\nconst Pointk1 = /* @__PURE__ */ weierstrass(secp256k1_CURVE, {\n Fp: Fpk1,\n endo: secp256k1_ENDO,\n});\n\n/**\n * secp256k1 curve: ECDSA and ECDH methods.\n *\n * Uses sha256 to hash messages. To use a different hash,\n * pass `{ prehash: false }` to sign / verify.\n *\n * @example\n * ```js\n * import { secp256k1 } from '@noble/curves/secp256k1.js';\n * const { secretKey, publicKey } = secp256k1.keygen();\n * // const publicKey = secp256k1.getPublicKey(secretKey);\n * const msg = new TextEncoder().encode('hello noble');\n * const sig = secp256k1.sign(msg, secretKey);\n * const isValid = secp256k1.verify(sig, msg, publicKey);\n * // const sigKeccak = secp256k1.sign(keccak256(msg), secretKey, { prehash: false });\n * ```\n */\nexport const secp256k1: ECDSA = /* @__PURE__ */ ecdsa(Pointk1, sha256);\n\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES: { [tag: string]: Uint8Array } = {};\nfunction taggedHash(tag: string, ...messages: Uint8Array[]): Uint8Array {\n let tagP = TAGGED_HASH_PREFIXES[tag];\n if (tagP === undefined) {\n const tagH = sha256(asciiToBytes(tag));\n tagP = concatBytes(tagH, tagH);\n TAGGED_HASH_PREFIXES[tag] = tagP;\n }\n return sha256(concatBytes(tagP, ...messages));\n}\n\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point: PointType<bigint>) => point.toBytes(true).slice(1);\nconst hasEven = (y: bigint) => y % _2n === _0n;\n\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv: Uint8Array) {\n const { Fn, BASE } = Pointk1;\n const d_ = Fn.fromBytes(priv);\n const p = BASE.multiply(d_); // P = d'\u22C5G; 0 < d' < n check is done inside\n const scalar = hasEven(p.y) ? d_ : Fn.neg(d_);\n return { scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x: bigint): PointType<bigint> {\n const Fp = Fpk1;\n if (!Fp.isValidNot0(x)) throw new Error('invalid x: Fail if x \u2265 p');\n const xx = Fp.create(x * x);\n const c = Fp.create(xx * x + BigInt(7)); // Let c = x\u00B3 + 7 mod p.\n let y = Fp.sqrt(c); // Let y = c^(p+1)/4 mod p. Same as sqrt().\n // Return the unique point P such that x(P) = x and\n // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n if (!hasEven(y)) y = Fp.neg(y);\n const p = Pointk1.fromAffine({ x, y });\n p.assertValidity();\n return p;\n}\nconst num = bytesToNumberBE;\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args: Uint8Array[]): bigint {\n return Pointk1.Fn.create(num(taggedHash('BIP0340/challenge', ...args)));\n}\n\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(secretKey: Uint8Array): Uint8Array {\n return schnorrGetExtPubKey(secretKey).bytes; // d'=int(sk). Fail if d'=0 or d'\u2265n. Ret bytes(d'\u22C5G)\n}\n\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(\n message: Uint8Array,\n secretKey: Uint8Array,\n auxRand: Uint8Array = randomBytes(32)\n): Uint8Array {\n const { Fn } = Pointk1;\n const m = abytes(message, undefined, 'message');\n const { bytes: px, scalar: d } = schnorrGetExtPubKey(secretKey); // checks for isWithinCurveOrder\n const a = abytes(auxRand, 32, 'auxRand'); // Auxiliary random data a: a 32-byte array\n const t = Fn.toBytes(d ^ num(taggedHash('BIP0340/aux', a))); // Let t be the byte-wise xor of bytes(d) and hash/aux(a)\n const rand = taggedHash('BIP0340/nonce', t, px, m); // Let rand = hash/nonce(t || bytes(P) || m)\n // Let k' = int(rand) mod n. Fail if k' = 0. Let R = k'\u22C5G\n const { bytes: rx, scalar: k } = schnorrGetExtPubKey(rand);\n const e = challenge(rx, px, m); // Let e = int(hash/challenge(bytes(R) || bytes(P) || m)) mod n.\n const sig = new Uint8Array(64); // Let sig = bytes(R) || bytes((k + ed) mod n).\n sig.set(rx, 0);\n sig.set(Fn.toBytes(Fn.create(k + e * d)), 32);\n // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n if (!schnorrVerify(sig, m, px)) throw new Error('sign: Invalid signature produced');\n return sig;\n}\n\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature: Uint8Array, message: Uint8Array, publicKey: Uint8Array): boolean {\n const { Fp, Fn, BASE } = Pointk1;\n const sig = abytes(signature, 64, 'signature');\n const m = abytes(message, undefined, 'message');\n const pub = abytes(publicKey, 32, 'publicKey');\n try {\n const P = lift_x(num(pub)); // P = lift_x(int(pk)); fail if that fails\n const r = num(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r \u2265 p.\n if (!Fp.isValidNot0(r)) return false;\n const s = num(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s \u2265 n.\n if (!Fn.isValidNot0(s)) return false;\n\n const e = challenge(Fn.toBytes(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n // R = s\u22C5G - e\u22C5P, where -eP == (n-e)P\n const R = BASE.multiplyUnsafe(s).add(P.multiplyUnsafe(Fn.neg(e)));\n const { x, y } = R.toAffine();\n // Fail if is_infinite(R) / not has_even_y(R) / x(R) \u2260 r.\n if (R.is0() || !hasEven(y) || x !== r) return false;\n return true;\n } catch (error) {\n return false;\n }\n}\n\nexport type SecpSchnorr = {\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: typeof schnorrGetPublicKey;\n sign: typeof schnorrSign;\n verify: typeof schnorrVerify;\n Point: WeierstrassPointCons<bigint>;\n utils: {\n randomSecretKey: (seed?: Uint8Array) => Uint8Array;\n pointToBytes: (point: PointType<bigint>) => Uint8Array;\n lift_x: typeof lift_x;\n taggedHash: typeof taggedHash;\n };\n lengths: CurveLengths;\n};\n/**\n * Schnorr signatures over secp256k1.\n * https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n * @example\n * ```js\n * import { schnorr } from '@noble/curves/secp256k1.js';\n * const { secretKey, publicKey } = schnorr.keygen();\n * // const publicKey = schnorr.getPublicKey(secretKey);\n * const msg = new TextEncoder().encode('hello');\n * const sig = schnorr.sign(msg, secretKey);\n * const isValid = schnorr.verify(sig, msg, publicKey);\n * ```\n */\nexport const schnorr: SecpSchnorr = /* @__PURE__ */ (() => {\n const size = 32;\n const seedLength = 48;\n const randomSecretKey = (seed = randomBytes(seedLength)): Uint8Array => {\n return mapHashToField(seed, secp256k1_CURVE.n);\n };\n return {\n keygen: createKeygen(randomSecretKey, schnorrGetPublicKey),\n getPublicKey: schnorrGetPublicKey,\n sign: schnorrSign,\n verify: schnorrVerify,\n Point: Pointk1,\n utils: {\n randomSecretKey,\n taggedHash,\n lift_x,\n pointToBytes,\n },\n lengths: {\n secretKey: size,\n publicKey: size,\n publicKeyHasPrefix: false,\n signature: size * 2,\n seed: seedLength,\n },\n };\n})();\n\nconst isoMap = /* @__PURE__ */ (() =>\n isogenyMap(\n Fpk1,\n [\n // xNum\n [\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n ],\n // xDen\n [\n '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n // yNum\n [\n '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n ],\n // yDen\n [\n '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n ],\n ].map((i) => i.map((j) => BigInt(j))) as [bigint[], bigint[], bigint[], bigint[]]\n ))();\nconst mapSWU = /* @__PURE__ */ (() =>\n mapToCurveSimpleSWU(Fpk1, {\n A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n B: BigInt('1771'),\n Z: Fpk1.create(BigInt('-11')),\n }))();\n\n/** Hashing / encoding to secp256k1 points / field. RFC 9380 methods. */\nexport const secp256k1_hasher: H2CHasher<WeierstrassPointCons<bigint>> = /* @__PURE__ */ (() =>\n createHasher(\n Pointk1,\n (scalars: bigint[]) => {\n const { x, y } = mapSWU(Fpk1.create(scalars[0]));\n return isoMap(x, y);\n },\n {\n DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n p: Fpk1.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha256,\n }\n ))();\n", "/**\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://www.rfc-editor.org/rfc/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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal 32-byte base SHA2 hash class. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n constructor() {\n super(32);\n }\n}\n\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal 64-byte base SHA2 hash class. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\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 protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor() {\n super(64);\n }\n}\n\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n */\nexport const sha256: CHash<_SHA256> = /* @__PURE__ */ createHasher(\n () => new _SHA256(),\n /* @__PURE__ */ oidNist(0x01)\n);\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash<_SHA224> = /* @__PURE__ */ createHasher(\n () => new _SHA224(),\n /* @__PURE__ */ oidNist(0x04)\n);\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash<_SHA512> = /* @__PURE__ */ createHasher(\n () => new _SHA512(),\n /* @__PURE__ */ oidNist(0x03)\n);\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash<_SHA384> = /* @__PURE__ */ createHasher(\n () => new _SHA384(),\n /* @__PURE__ */ oidNist(0x02)\n);\n\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: CHash<_SHA512_256> = /* @__PURE__ */ createHasher(\n () => new _SHA512_256(),\n /* @__PURE__ */ oidNist(0x06)\n);\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: CHash<_SHA512_224> = /* @__PURE__ */ createHasher(\n () => new _SHA512_224(),\n /* @__PURE__ */ oidNist(0x05)\n);\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\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: Uint8Array): this {\n aexists(this);\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) 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: Uint8Array): void {\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++) 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 view.setBigUint64(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 must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\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\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\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: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\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, type Signer } from '../utils.ts';\nimport { Field, FpInvertBatch, validateField, type IField } from './modular.ts';\n\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\n\nexport type AffinePoint<T> = {\n x: T;\n y: T;\n} & { Z?: never };\n\n// We can't \"abstract out\" coordinates (X, Y, Z; and T in Edwards): argument names of constructor\n// are not accessible. See Typescript gh-56093, gh-41594.\n//\n// We have to use recursive types, so it will return actual point, not constained `CurvePoint`.\n// If, at any point, P is `any`, it will erase all types and replace it\n// with `any`, because of recursion, `any implements CurvePoint`,\n// but we lose all constrains on methods.\n\n/** Base interface for all elliptic curve Points. */\nexport interface CurvePoint<F, P extends CurvePoint<F, P>> {\n /** Affine x coordinate. Different from projective / extended X coordinate. */\n x: F;\n /** Affine y coordinate. Different from projective / extended Y coordinate. */\n y: F;\n Z?: F;\n double(): P;\n negate(): P;\n add(other: P): P;\n subtract(other: P): P;\n equals(other: P): boolean;\n multiply(scalar: bigint): P;\n assertValidity(): void;\n clearCofactor(): P;\n is0(): boolean;\n isTorsionFree(): boolean;\n isSmallOrder(): boolean;\n multiplyUnsafe(scalar: bigint): P;\n /**\n * Massively speeds up `p.multiply(n)` by using precompute tables (caching). See {@link wNAF}.\n * @param isLazy calculate cache now. Default (true) ensures it's deferred to first `multiply()`\n */\n precompute(windowSize?: number, isLazy?: boolean): P;\n /** Converts point to 2D xy affine coordinates */\n toAffine(invertedZ?: F): AffinePoint<F>;\n toBytes(): Uint8Array;\n toHex(): string;\n}\n\n/** Base interface for all elliptic curve Point constructors. */\nexport interface CurvePointCons<P extends CurvePoint<any, P>> {\n [Symbol.hasInstance]: (item: unknown) => boolean;\n BASE: P;\n ZERO: P;\n /** Field for basic curve math */\n Fp: IField<P_F<P>>;\n /** Scalar field, for scalars in multiply and others */\n Fn: IField<bigint>;\n /** Creates point from x, y. Does NOT validate if the point is valid. Use `.assertValidity()`. */\n fromAffine(p: AffinePoint<P_F<P>>): P;\n fromBytes(bytes: Uint8Array): P;\n fromHex(hex: string): P;\n}\n\n// Type inference helpers: PC - PointConstructor, P - Point, Fp - Field element\n// Short names, because we use them a lot in result types:\n// * we can't do 'P = GetCurvePoint<PC>': this is default value and doesn't constrain anything\n// * we can't do 'type X = GetCurvePoint<PC>': it won't be accesible for arguments/return types\n// * `CurvePointCons<P extends CurvePoint<any, P>>` constraints from interface definition\n// won't propagate, if `PC extends CurvePointCons<any>`: the P would be 'any', which is incorrect\n// * PC could be super specific with super specific P, which implements CurvePoint<any, P>.\n// this means we need to do stuff like\n// `function test<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(`\n// if we want type safety around P, otherwise PC_P<PC> will be any\n\n/** Returns Fp type from Point (P_F<P> == P.F) */\nexport type P_F<P extends CurvePoint<any, P>> = P extends CurvePoint<infer F, P> ? F : never;\n/** Returns Fp type from PointCons (PC_F<PC> == PC.P.F) */\nexport type PC_F<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['Fp']['ZERO'];\n/** Returns Point type from PointCons (PC_P<PC> == PC.P) */\nexport type PC_P<PC extends CurvePointCons<CurvePoint<any, any>>> = PC['ZERO'];\n\n// Ugly hack to get proper type inference, because in typescript fails to infer resursively.\n// The hack allows to do up to 10 chained operations without applying type erasure.\n//\n// Types which won't work:\n// * `CurvePointCons<CurvePoint<any, any>>`, will return `any` after 1 operation\n// * `CurvePointCons<any>: WeierstrassPointCons<bigint> extends CurvePointCons<any> = false`\n// * `P extends CurvePoint, PC extends CurvePointCons<P>`\n// * It can't infer P from PC alone\n// * Too many relations between F, P & PC\n// * It will infer P/F if `arg: CurvePointCons<F, P>`, but will fail if PC is generic\n// * It will work correctly if there is an additional argument of type P\n// * But generally, we don't want to parametrize `CurvePointCons` over `F`: it will complicate\n// types, making them un-inferable\n// prettier-ignore\nexport type PC_ANY = CurvePointCons<\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any,\n CurvePoint<any, any>\n >>>>>>>>>\n>;\n\nexport interface CurveLengths {\n secretKey?: number;\n publicKey?: number;\n publicKeyUncompressed?: number;\n publicKeyHasPrefix?: boolean;\n signature?: number;\n seed?: number;\n}\n\nexport type Mapper<T> = (i: T[]) => T[];\n\nexport function negateCt<T extends { negate: () => T }>(condition: boolean, item: T): T {\n const neg = item.negate();\n return condition ? neg : item;\n}\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<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[]\n): P[] {\n const invertedZs = FpInvertBatch(\n c.Fp,\n points.map((p) => p.Z!)\n );\n return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));\n}\n\nfunction validateW(W: number, bits: number) {\n if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\n\n/** Internal wNAF opts for specific W and scalarBits */\ntype WOpts = {\n windows: number;\n windowSize: number;\n mask: bigint;\n maxNumber: number;\n shiftBy: bigint;\n};\n\nfunction calcWOpts(W: number, scalarBits: number): WOpts {\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}\n\nfunction calcOffsets(n: bigint, window: number, wOpts: 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\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\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}\n\nfunction validateMSMPoints(points: any[], c: any) {\n if (!Array.isArray(points)) throw new Error('array expected');\n points.forEach((p, i) => {\n if (!(p instanceof c)) throw new Error('invalid point at index ' + i);\n });\n}\nfunction validateMSMScalars(scalars: any[], field: any) {\n if (!Array.isArray(scalars)) throw new Error('array of scalars expected');\n scalars.forEach((s, i) => {\n if (!field.isValid(s)) throw new Error('invalid scalar at index ' + i);\n });\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<any, any[]>();\nconst pointWindowSizes = new WeakMap<any, number>();\n\nfunction getW(P: any): number {\n // To disable precomputes:\n // return 1;\n return pointWindowSizes.get(P) || 1;\n}\n\nfunction assert0(n: bigint): void {\n if (n !== _0n) throw new Error('invalid wNAF');\n}\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 / \uD835\uDC4A) + 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<PC extends PC_ANY> {\n private readonly BASE: PC_P<PC>;\n private readonly ZERO: PC_P<PC>;\n private readonly Fn: PC['Fn'];\n readonly bits: number;\n\n // Parametrized with a given Point class (not individual point)\n constructor(Point: PC, bits: number) {\n this.BASE = Point.BASE;\n this.ZERO = Point.ZERO;\n this.Fn = Point.Fn;\n this.bits = bits;\n }\n\n // non-const time multiplication ladder\n _unsafeLadder(elm: PC_P<PC>, n: bigint, p: PC_P<PC> = this.ZERO): PC_P<PC> {\n let d: PC_P<PC> = elm;\n while (n > _0n) {\n if (n & _1n) p = p.add(d);\n d = d.double();\n n >>= _1n;\n }\n return p;\n }\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^(\uD835\uDC4A\u22121) * (Math.ceil(\uD835\uDC5B / \uD835\uDC4A) + 1), where:\n * - \uD835\uDC4A is the window size\n * - \uD835\uDC5B 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 private precomputeWindow(point: PC_P<PC>, W: number): PC_P<PC>[] {\n const { windows, windowSize } = calcWOpts(W, this.bits);\n const points: PC_P<PC>[] = [];\n let p: PC_P<PC> = 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 /**\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 private wNAF(W: number, precomputes: PC_P<PC>[], n: bigint): { p: PC_P<PC>; f: PC_P<PC> } {\n // Scalar should be smaller than field order\n if (!this.Fn.isValid(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 } 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 /**\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 private wNAFUnsafe(\n W: number,\n precomputes: PC_P<PC>[],\n n: bigint,\n acc: PC_P<PC> = this.ZERO\n ): PC_P<PC> {\n const wo = calcWOpts(W, this.bits);\n for (let window = 0; window < wo.windows; window++) {\n if (n === _0n) 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 } 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\n private getPrecomputes(W: number, point: PC_P<PC>, transform?: Mapper<PC_P<PC>>): PC_P<PC>[] {\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) as PC_P<PC>[];\n if (W !== 1) {\n // Doing transform outside of if brings 15% perf hit\n if (typeof transform === 'function') comp = transform(comp);\n pointPrecomputes.set(point, comp);\n }\n }\n return comp;\n }\n\n cached(\n point: PC_P<PC>,\n scalar: bigint,\n transform?: Mapper<PC_P<PC>>\n ): { p: PC_P<PC>; f: PC_P<PC> } {\n const W = getW(point);\n return this.wNAF(W, this.getPrecomputes(W, point, transform), scalar);\n }\n\n unsafe(point: PC_P<PC>, scalar: bigint, transform?: Mapper<PC_P<PC>>, prev?: PC_P<PC>): PC_P<PC> {\n const W = getW(point);\n if (W === 1) 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\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: PC_P<PC>, W: number): void {\n validateW(W, this.bits);\n pointWindowSizes.set(P, W);\n pointPrecomputes.delete(P);\n }\n\n hasCache(elm: PC_P<PC>): boolean {\n return getW(elm) !== 1;\n }\n}\n\n/**\n * Endomorphism-specific multiplication for Koblitz curves.\n * Cost: 128 dbl, 0-256 adds.\n */\nexport function mulEndoUnsafe<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n Point: PC,\n point: P,\n k1: bigint,\n k2: bigint\n): { p1: P; p2: P } {\n let acc = point;\n let p1 = Point.ZERO;\n let p2 = Point.ZERO;\n while (k1 > _0n || k2 > _0n) {\n if (k1 & _1n) p1 = p1.add(acc);\n if (k2 & _1n) p2 = p2.add(acc);\n acc = acc.double();\n k1 >>= _1n;\n k2 >>= _1n;\n }\n return { p1, p2 };\n}\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<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[],\n scalars: bigint[]\n): P {\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 const fieldN = c.Fn;\n validateMSMPoints(points, c);\n validateMSMScalars(scalars, fieldN);\n const plength = points.length;\n const slength = scalars.length;\n if (plength !== slength) 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) windowSize = wbits - 3;\n else if (wbits > 4) windowSize = wbits - 2;\n else if (wbits > 0) 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) for (let j = 0; j < windowSize; j++) sum = sum.double();\n }\n return sum as P;\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<P extends CurvePoint<any, P>, PC extends CurvePointCons<P>>(\n c: PC,\n points: P[],\n windowSize: number\n): (scalars: bigint[]) => P {\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 \u00D7 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 \u00D7 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 \u00D7 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 const fieldN = c.Fn;\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: 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: bigint[]): P => {\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) for (let j = 0; j < windowSize; j++) 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) continue; // skip zero scalars chunks\n res = res.add(tables[j][curr - 1]);\n }\n }\n return res;\n };\n}\n\nexport type ValidCurveParams<T> = {\n p: bigint;\n n: bigint;\n h: bigint;\n a: T;\n b?: T;\n d?: T;\n Gx: T;\n Gy: T;\n};\n\nfunction createField<T>(order: bigint, field?: IField<T>, isLE?: boolean): IField<T> {\n if (field) {\n if (field.ORDER !== order) throw new Error('Field.ORDER must match order: Fp == p, Fn == n');\n validateField(field);\n return field;\n } else {\n return Field(order, { isLE }) as unknown as IField<T>;\n }\n}\nexport type FpFn<T> = { Fp: IField<T>; Fn: IField<bigint> };\n\n/** Validates CURVE opts and creates fields */\nexport function createCurveFields<T>(\n type: 'weierstrass' | 'edwards',\n CURVE: ValidCurveParams<T>,\n curveOpts: Partial<FpFn<T>> = {},\n FpFnLE?: boolean\n): FpFn<T> & { CURVE: ValidCurveParams<T> } {\n if (FpFnLE === undefined) FpFnLE = type === 'edwards';\n if (!CURVE || typeof CURVE !== 'object') throw new Error(`expected valid ${type} CURVE object`);\n for (const p of ['p', 'n', 'h'] as const) {\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: 'b' | 'd' = type === 'weierstrass' ? 'b' : 'd';\n const params = ['Gx', 'Gy', 'a', _b] as const;\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\ntype KeygenFn = (\n seed?: Uint8Array,\n isCompressed?: boolean\n) => { secretKey: Uint8Array; publicKey: Uint8Array };\nexport function createKeygen(\n randomSecretKey: Function,\n getPublicKey: Signer['getPublicKey']\n): KeygenFn {\n return function keygen(seed?: Uint8Array) {\n const secretKey = randomSecretKey(seed);\n return { secretKey, publicKey: getPublicKey(secretKey) };\n };\n}\n", "/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport {\n abytes as abytes_,\n anumber,\n bytesToHex as bytesToHex_,\n concatBytes as concatBytes_,\n hexToBytes as hexToBytes_,\n} from '@noble/hashes/utils.js';\nexport {\n abytes,\n anumber,\n bytesToHex,\n concatBytes,\n hexToBytes,\n isBytes,\n randomBytes,\n} from '@noble/hashes/utils.js';\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\n\nexport type CHash = {\n (message: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array) => Uint8Array;\nexport function abool(value: boolean, title: string = ''): boolean {\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\n// Used in weierstrass, der\nfunction abignumber(n: number | bigint) {\n if (typeof n === 'bigint') {\n if (!isPosBig(n)) throw new Error('positive bigint expected, got ' + n);\n } else anumber(n);\n return n;\n}\n\nexport function asafenumber(value: number, title: string = ''): void {\n if (!Number.isSafeInteger(value)) {\n const prefix = title && `\"${title}\" `;\n throw new Error(prefix + 'expected safe integer, got type=' + typeof value);\n }\n}\n\nexport function numberToHexUnpadded(num: number | bigint): string {\n const hex = abignumber(num).toString(16);\n return hex.length & 1 ? '0' + hex : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex_(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n anumber(len);\n n = abignumber(n);\n const res = hexToBytes_(n.toString(16).padStart(len * 2, '0'));\n if (res.length !== len) throw new Error('number too large');\n return res;\n}\nexport function numberToBytesLE(n: number | bigint, len: number): Uint8Array {\n return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number | bigint): Uint8Array {\n return hexToBytes_(numberToHexUnpadded(abignumber(n)));\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array): boolean {\n if (a.length !== b.length) return false;\n let diff = 0;\n for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n return diff === 0;\n}\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: Uint8Array): Uint8Array {\n return Uint8Array.from(bytes);\n}\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 `TextEncoder` for ASCII or throws.\n */\nexport function asciiToBytes(ascii: string): Uint8Array {\n return Uint8Array.from(ascii, (c, i) => {\n const charCode = c.charCodeAt(0);\n if (c.length !== 1 || charCode > 127) {\n throw new Error(\n `string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`\n );\n }\n return charCode;\n });\n}\n\n// Is positive bigint\nconst isPosBig = (n: bigint) => typeof n === 'bigint' && _0n <= n;\n\nexport function inRange(n: bigint, min: bigint, max: bigint): boolean {\n return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\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: string, n: bigint, min: bigint, max: bigint): void {\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\n// Bit operations\n\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: bigint): number {\n let len;\n for (len = 0; n > _0n; n >>= _1n, len += 1);\n return len;\n}\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: bigint, pos: number): bigint {\n return (n >> BigInt(pos)) & _1n;\n}\n\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n: bigint, pos: number, value: boolean): bigint {\n return n | ((value ? _1n : _0n) << BigInt(pos));\n}\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: number): bigint => (_1n << BigInt(n)) - _1n;\n\n// DRBG\n\ntype Pred<T> = (v: Uint8Array) => T | undefined;\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<T>(\n hashLen: number,\n qByteLen: number,\n hmacFn: (key: Uint8Array, message: Uint8Array) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n anumber(hashLen, 'hashLen');\n anumber(qByteLen, 'qByteLen');\n if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\n const u8n = (len: number): Uint8Array => new Uint8Array(len); // creates Uint8Array\n const NULL = Uint8Array.of();\n const byte0 = Uint8Array.of(0x00);\n const byte1 = Uint8Array.of(0x01);\n const _maxDrbgIters = 1000;\n\n // Step B, Step C: set hashLen to 8*ceil(hlen/8)\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 = (...msgs: Uint8Array[]) => hmacFn(k, concatBytes_(v, ...msgs)); // hmac(k)(v, ...values)\n const reseed = (seed: Uint8Array = NULL) => {\n // HMAC-DRBG reseed() function. Steps D-G\n k = h(byte0, seed); // k = hmac(k || v || 0x00 || seed)\n v = h(); // v = hmac(k || v)\n if (seed.length === 0) return;\n k = h(byte1, 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++ >= _maxDrbgIters) throw new Error('drbg: tried max amount of iterations');\n let len = 0;\n const out: Uint8Array[] = [];\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: Uint8Array, pred: Pred<T>): T => {\n reset();\n reseed(seed); // Steps D-G\n let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]\n while (!(res = pred(gen()))) reseed();\n reset();\n return res;\n };\n return genUntil;\n}\n\nexport function validateObject(\n object: Record<string, any>,\n fields: Record<string, string> = {},\n optFields: Record<string, string> = {}\n): void {\n if (!object || typeof object !== 'object') throw new Error('expected valid options object');\n type Item = keyof typeof object;\n function checkField(fieldName: Item, expectedType: string, isOpt: boolean) {\n const val = object[fieldName];\n if (isOpt && val === undefined) 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 const iter = (f: typeof fields, isOpt: boolean) =>\n Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n iter(fields, false);\n iter(optFields, true);\n}\n\n/**\n * throws not implemented error\n */\nexport const notImplemented = (): never => {\n throw new Error('not implemented');\n};\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<T extends object, R, O extends any[]>(\n fn: (arg: T, ...args: O) => R\n): (arg: T, ...args: O) => R {\n const map = new WeakMap<T, R>();\n return (arg: T, ...args: O): R => {\n const val = map.get(arg);\n if (val !== undefined) return val;\n const computed = fn(arg, ...args);\n map.set(arg, computed);\n return computed;\n };\n}\n\nexport interface CryptoKeys {\n lengths: { seed?: number; public?: number; secret?: number };\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: (secretKey: Uint8Array) => Uint8Array;\n}\n\n/** Generic interface for signatures. Has keygen, sign and verify. */\nexport interface Signer extends CryptoKeys {\n // Interfaces are fun. We cannot just add new fields without copying old ones.\n lengths: {\n seed?: number;\n public?: number;\n secret?: number;\n signRand?: number;\n signature?: number;\n };\n sign: (msg: Uint8Array, secretKey: Uint8Array) => Uint8Array;\n verify: (sig: Uint8Array, msg: Uint8Array, publicKey: Uint8Array) => boolean;\n}\n", "/**\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 {\n abytes,\n anumber,\n bytesToNumberBE,\n bytesToNumberLE,\n numberToBytesBE,\n numberToBytesLE,\n validateObject,\n} from '../utils.ts';\n\n// Numbers aren't used in x25519 / x448 builds\n// prettier-ignore\nconst _0n = /* @__PURE__ */ BigInt(0), _1n = /* @__PURE__ */ BigInt(1), _2n = /* @__PURE__ */ BigInt(2);\n// prettier-ignore\nconst _3n = /* @__PURE__ */ BigInt(3), _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5);\n// prettier-ignore\nconst _7n = /* @__PURE__ */ BigInt(7), _8n = /* @__PURE__ */ BigInt(8), _9n = /* @__PURE__ */ BigInt(9);\nconst _16n = /* @__PURE__ */ BigInt(16);\n\n// Calculates a modulo b\nexport function mod(a: bigint, b: bigint): bigint {\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: bigint, power: bigint, modulo: bigint): bigint {\n return FpPow(Field(modulo), num, power);\n}\n\n/** Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` */\nexport function pow2(x: bigint, power: bigint, modulo: bigint): bigint {\n let res = x;\n while (power-- > _0n) {\n res *= res;\n res %= modulo;\n }\n return res;\n}\n\n/**\n * Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n */\nexport function invert(number: bigint, modulo: bigint): bigint {\n if (number === _0n) throw new Error('invert: expected non-zero number');\n if (modulo <= _0n) 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) throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\n\nfunction assertIsSquare<T>(Fp: IField<T>, root: T, n: T): void {\n if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n}\n\n// Not all roots are possible! Example which will throw:\n// const NUM =\n// n = 72057594037927816n;\n// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));\nfunction sqrt3mod4<T>(Fp: IField<T>, n: T) {\n const p1div4 = (Fp.ORDER + _1n) / _4n;\n const root = Fp.pow(n, p1div4);\n assertIsSquare(Fp, root, n);\n return root;\n}\n\nfunction sqrt5mod8<T>(Fp: IField<T>, n: T) {\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\n// Based on RFC9380, Kong algorithm\n// prettier-ignore\nfunction sqrt9mod16(P: bigint): <T>(Fp: IField<T>, n: T) => T {\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 <T>(Fp: IField<T>, n: T) => {\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/**\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: bigint): <T>(Fp: IField<T>, n: T) => T {\n // Initialization (precomputation).\n // Caching initialization could boost perf by 7%.\n if (P < _3n) 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\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) 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) return sqrt3mod4;\n\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<T>(Fp: IField<T>, n: T): T {\n if (Fp.is0(n)) return n;\n // Check if n is a quadratic residue using Legendre symbol\n if (FpLegendre(Fp, n) !== 1) throw new Error('Cannot find square root');\n\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\n // Main loop\n // while t != 1\n while (!Fp.eql(t, Fp.ONE)) {\n if (Fp.is0(t)) return Fp.ZERO; // if t=0 return R=0\n let i = 1;\n\n // Find the smallest i >= 1 such that t^(2^i) \u2261 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) throw new Error('Cannot find square root');\n }\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\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/**\n * Square root for a finite field. Will try optimized versions first:\n *\n * 1. P \u2261 3 (mod 4)\n * 2. P \u2261 5 (mod 8)\n * 3. P \u2261 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: bigint): <T>(Fp: IField<T>, n: T) => T {\n // P \u2261 3 (mod 4) => \u221An = n^((P+1)/4)\n if (P % _4n === _3n) return sqrt3mod4;\n // P \u2261 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf\n if (P % _8n === _5n) return sqrt5mod8;\n // P \u2261 9 (mod 16) => Kong algorithm, page 11 of https://eprint.iacr.org/2012/685.pdf (algorithm 4)\n if (P % _16n === _9n) return sqrt9mod16(P);\n // Tonelli-Shanks algorithm\n return tonelliShanks(P);\n}\n\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num: bigint, modulo: bigint): boolean =>\n (mod(num, modulo) & _1n) === _1n;\n\n/** Field is not always over prime: for example, Fp2 has ORDER(q)=p^m. */\nexport interface IField<T> {\n ORDER: bigint;\n BYTES: number;\n BITS: number;\n isLE: boolean;\n ZERO: T;\n ONE: T;\n // 1-arg\n create: (num: T) => T;\n isValid: (num: T) => boolean;\n is0: (num: T) => boolean;\n isValidNot0: (num: T) => boolean;\n neg(num: T): T;\n inv(num: T): T;\n sqrt(num: T): T;\n sqr(num: T): T;\n // 2-args\n eql(lhs: T, rhs: T): boolean;\n add(lhs: T, rhs: T): T;\n sub(lhs: T, rhs: T): T;\n mul(lhs: T, rhs: T | bigint): T;\n pow(lhs: T, power: bigint): T;\n div(lhs: T, rhs: T | bigint): T;\n // N for NonNormalized (for now)\n addN(lhs: T, rhs: T): T;\n subN(lhs: T, rhs: T): T;\n mulN(lhs: T, rhs: T | bigint): T;\n sqrN(num: T): T;\n\n // Optional\n // Should be same as sgn0 function in\n // [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#section-4.1).\n // NOTE: sgn0 is 'negative in LE', which is same as odd. And negative in LE is kinda strange definition anyway.\n isOdd?(num: T): boolean; // Odd instead of even since we have it for Fp2\n // legendre?(num: T): T;\n invertBatch: (lst: T[]) => T[];\n toBytes(num: T): Uint8Array;\n fromBytes(bytes: Uint8Array, skipValidation?: boolean): T;\n // If c is False, CMOV returns a, otherwise it returns b.\n cmov(a: T, b: T, c: boolean): T;\n}\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] as const;\nexport function validateField<T>(field: IField<T>): IField<T> {\n const initial = {\n ORDER: 'bigint',\n BYTES: 'number',\n BITS: 'number',\n } as Record<string, string>;\n const opts = FIELD_FIELDS.reduce((map, val: string) => {\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\n// Generic field functions\n\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<T>(Fp: IField<T>, num: T, power: bigint): T {\n if (power < _0n) throw new Error('invalid exponent, negatives unsupported');\n if (power === _0n) return Fp.ONE;\n if (power === _1n) return num;\n let p = Fp.ONE;\n let d = num;\n while (power > _0n) {\n if (power & _1n) p = Fp.mul(p, d);\n d = Fp.sqr(d);\n power >>= _1n;\n }\n return p;\n}\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<T>(Fp: IField<T>, nums: T[], passZero = false): T[] {\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)) 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)) return acc;\n inverted[i] = Fp.mul(acc, inverted[i]);\n return Fp.mul(acc, num);\n }, invertedAcc);\n return inverted;\n}\n\n// TODO: remove\nexport function FpDiv<T>(Fp: IField<T>, lhs: T, rhs: T | bigint): T {\n return Fp.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, Fp.ORDER) : Fp.inv(rhs));\n}\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) \u2261 1 if a is a square (mod p), quadratic residue\n * * (a | p) \u2261 -1 if a is not a square (mod p), quadratic non residue\n * * (a | p) \u2261 0 if a \u2261 0 (mod p)\n */\nexport function FpLegendre<T>(Fp: IField<T>, n: T): -1 | 0 | 1 {\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) throw new Error('invalid Legendre symbol result');\n return yes ? 1 : zero ? 0 : -1;\n}\n\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare<T>(Fp: IField<T>, n: T): boolean {\n const l = FpLegendre(Fp, n);\n return l === 1;\n}\n\nexport type NLength = { nByteLength: number; nBitLength: number };\n// CURVE.n lengths\nexport function nLength(n: bigint, nBitLength?: number): NLength {\n // Bit size, byte size of CURVE.n\n if (nBitLength !== undefined) 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\ntype FpField = IField<bigint> & Required<Pick<IField<bigint>, 'isOdd'>>;\ntype SqrtFn = (n: bigint) => bigint;\ntype FieldOpts = Partial<{\n isLE: boolean;\n BITS: number;\n sqrt: SqrtFn;\n allowedLengths?: readonly number[]; // for P521 (adds padding for smaller sizes)\n modFromBytes: boolean; // bls12-381 requires mod(n) instead of rejecting keys >= n\n}>;\nclass _Field implements IField<bigint> {\n readonly ORDER: bigint;\n readonly BITS: number;\n readonly BYTES: number;\n readonly isLE: boolean;\n readonly ZERO = _0n;\n readonly ONE = _1n;\n readonly _lengths?: number[];\n private _sqrt: ReturnType<typeof FpSqrt> | undefined; // cached sqrt\n private readonly _mod?: boolean;\n constructor(ORDER: bigint, opts: FieldOpts = {}) {\n if (ORDER <= _0n) throw new Error('invalid field: expected ORDER > 0, got ' + ORDER);\n let _nbitLength: number | undefined = undefined;\n this.isLE = false;\n if (opts != null && typeof opts === 'object') {\n if (typeof opts.BITS === 'number') _nbitLength = opts.BITS;\n if (typeof opts.sqrt === 'function') this.sqrt = opts.sqrt;\n if (typeof opts.isLE === 'boolean') this.isLE = opts.isLE;\n if (opts.allowedLengths) this._lengths = opts.allowedLengths?.slice();\n if (typeof opts.modFromBytes === 'boolean') this._mod = opts.modFromBytes;\n }\n const { nBitLength, nByteLength } = nLength(ORDER, _nbitLength);\n if (nByteLength > 2048) throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n this.ORDER = ORDER;\n this.BITS = nBitLength;\n this.BYTES = nByteLength;\n this._sqrt = undefined;\n Object.preventExtensions(this);\n }\n\n create(num: bigint) {\n return mod(num, this.ORDER);\n }\n isValid(num: bigint) {\n if (typeof num !== 'bigint')\n throw new Error('invalid field element: expected bigint, got ' + typeof num);\n return _0n <= num && num < this.ORDER; // 0 is valid element, but it's not invertible\n }\n is0(num: bigint) {\n return num === _0n;\n }\n // is valid and invertible\n isValidNot0(num: bigint) {\n return !this.is0(num) && this.isValid(num);\n }\n isOdd(num: bigint) {\n return (num & _1n) === _1n;\n }\n neg(num: bigint) {\n return mod(-num, this.ORDER);\n }\n eql(lhs: bigint, rhs: bigint) {\n return lhs === rhs;\n }\n\n sqr(num: bigint) {\n return mod(num * num, this.ORDER);\n }\n add(lhs: bigint, rhs: bigint) {\n return mod(lhs + rhs, this.ORDER);\n }\n sub(lhs: bigint, rhs: bigint) {\n return mod(lhs - rhs, this.ORDER);\n }\n mul(lhs: bigint, rhs: bigint) {\n return mod(lhs * rhs, this.ORDER);\n }\n pow(num: bigint, power: bigint): bigint {\n return FpPow(this, num, power);\n }\n div(lhs: bigint, rhs: bigint) {\n return mod(lhs * invert(rhs, this.ORDER), this.ORDER);\n }\n\n // Same as above, but doesn't normalize\n sqrN(num: bigint) {\n return num * num;\n }\n addN(lhs: bigint, rhs: bigint) {\n return lhs + rhs;\n }\n subN(lhs: bigint, rhs: bigint) {\n return lhs - rhs;\n }\n mulN(lhs: bigint, rhs: bigint) {\n return lhs * rhs;\n }\n\n inv(num: bigint) {\n return invert(num, this.ORDER);\n }\n sqrt(num: bigint): bigint {\n // Caching _sqrt speeds up sqrt9mod16 by 5x and tonneli-shanks by 10%\n if (!this._sqrt) this._sqrt = FpSqrt(this.ORDER);\n return this._sqrt(this, num);\n }\n toBytes(num: bigint) {\n return this.isLE ? numberToBytesLE(num, this.BYTES) : numberToBytesBE(num, this.BYTES);\n }\n fromBytes(bytes: Uint8Array, skipValidation = false) {\n abytes(bytes);\n const { _lengths: allowedLengths, BYTES, isLE, ORDER, _mod: modFromBytes } = this;\n if (allowedLengths) {\n if (!allowedLengths.includes(bytes.length) || bytes.length > BYTES) {\n throw new Error(\n 'Field.fromBytes: expected ' + allowedLengths + ' bytes, got ' + bytes.length\n );\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) scalar = mod(scalar, ORDER);\n if (!skipValidation)\n if (!this.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: bigint[]): bigint[] {\n return FpInvertBatch(this, lst);\n }\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: bigint, b: bigint, condition: boolean) {\n return condition ? b : a;\n }\n}\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: bigint, opts: FieldOpts = {}): Readonly<FpField> {\n return new _Field(ORDER, opts);\n}\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// },\n\nexport function FpSqrtOdd<T>(Fp: IField<T>, elm: T): T {\n if (!Fp.isOdd) throw new Error(\"Field doesn't have isOdd\");\n const root = Fp.sqrt(elm);\n return Fp.isOdd(root) ? root : Fp.neg(root);\n}\n\nexport function FpSqrtEven<T>(Fp: IField<T>, elm: T): T {\n if (!Fp.isOdd) 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/**\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: bigint): number {\n if (typeof fieldOrder !== 'bigint') throw new Error('field order must be bigint');\n const bitLength = fieldOrder.toString(2).length;\n return Math.ceil(bitLength / 8);\n}\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: bigint): number {\n const length = getFieldBytesLength(fieldOrder);\n return length + Math.ceil(length / 2);\n}\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.Point.Fn.ORDER)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key: Uint8Array, fieldOrder: bigint, isLE = false): Uint8Array {\n abytes(key);\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", "/**\n * Short Weierstrass curve methods. The formula is: y\u00B2 = x\u00B3 + 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.js';\nimport {\n abool,\n abytes,\n aInRange,\n bitLen,\n bitMask,\n bytesToHex,\n bytesToNumberBE,\n concatBytes,\n createHmacDrbg,\n hexToBytes,\n isBytes,\n memoized,\n numberToHexUnpadded,\n validateObject,\n randomBytes as wcRandomBytes,\n type CHash,\n type Signer,\n} from '../utils.ts';\nimport {\n createCurveFields,\n createKeygen,\n mulEndoUnsafe,\n negateCt,\n normalizeZ,\n wNAF,\n type AffinePoint,\n type CurveLengths,\n type CurvePoint,\n type CurvePointCons,\n} from './curve.ts';\nimport {\n FpInvertBatch,\n getMinHashLength,\n mapHashToField,\n validateField,\n type IField,\n} from './modular.ts';\n\nexport type { AffinePoint };\n\ntype EndoBasis = [[bigint, bigint], [bigint, bigint]];\n/**\n * When Weierstrass curve has `a=0`, it becomes Koblitz curve.\n * Koblitz curves allow using **efficiently-computable GLV endomorphism \u03C8**.\n * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n *\n * Endomorphism consists of beta, lambda and splitScalar:\n *\n * 1. GLV endomorphism \u03C8 transforms a point: `P = (x, y) \u21A6 \u03C8(P) = (\u03B2\u00B7x mod p, y)`\n * 2. GLV scalar decomposition transforms a scalar: `k \u2261 k\u2081 + k\u2082\u00B7\u03BB (mod n)`\n * 3. Then these are combined: `k\u00B7P = k\u2081\u00B7P + k\u2082\u00B7\u03C8(P)`\n * 4. Two 128-bit point-by-scalar multiplications + one point addition is faster than\n * one 256-bit multiplication.\n *\n * where\n * * beta: \u03B2 \u2208 F\u209A with \u03B2\u00B3 = 1, \u03B2 \u2260 1\n * * lambda: \u03BB \u2208 F\u2099 with \u03BB\u00B3 = 1, \u03BB \u2260 1\n * * splitScalar decomposes k \u21A6 k\u2081, k\u2082, by using reduced basis vectors.\n * Gauss lattice reduction calculates them from initial basis vectors `(n, 0), (-\u03BB, 0)`\n *\n * Check out `test/misc/endomorphism.js` and\n * [gist](https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066).\n */\nexport type EndomorphismOpts = {\n beta: bigint;\n basises?: EndoBasis;\n splitScalar?: (k: bigint) => { k1neg: boolean; k1: bigint; k2neg: boolean; k2: bigint };\n};\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: bigint, den: bigint) => (num + (num >= 0 ? den : -den) / _2n) / den;\n\nexport type ScalarEndoParts = { k1neg: boolean; k1: bigint; k2neg: boolean; k2: bigint };\n\n/**\n * Splits scalar for GLV endomorphism.\n */\nexport function _splitEndoScalar(k: bigint, basis: EndoBasis, n: bigint): ScalarEndoParts {\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) k1 = -k1;\n if (k2neg) 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}\n\n/**\n * Option to enable hedged signatures with improved security.\n *\n * * Randomly generated k is bad, because broken CSPRNG would leak private keys.\n * * Deterministic k (RFC6979) is better; but is suspectible to fault attacks.\n *\n * We allow using technique described in RFC6979 3.6: additional k', a.k.a. adding randomness\n * to deterministic sig. If CSPRNG is broken & randomness is weak, it would STILL be as secure\n * as ordinary sig without ExtraEntropy.\n *\n * * `true` means \"fetch data, from CSPRNG, incorporate it into k generation\"\n * * `false` means \"disable extra entropy, use purely deterministic k\"\n * * `Uint8Array` passed means \"incorporate following data into k generation\"\n *\n * https://paulmillr.com/posts/deterministic-signatures/\n */\nexport type ECDSAExtraEntropy = boolean | Uint8Array;\n/**\n * - `compact` is the default format\n * - `recovered` is the same as compact, but with an extra byte indicating recovery byte\n * - `der` is ASN.1 DER encoding\n */\nexport type ECDSASignatureFormat = 'compact' | 'recovered' | 'der';\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n * When a custom hash is used, it must be set to `false`.\n */\nexport type ECDSARecoverOpts = {\n prehash?: boolean;\n};\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n * When a custom hash is used, it must be set to `false`.\n * - `lowS`: (default: true) prohibits signatures which have (sig.s >= CURVE.n/2n).\n * Compatible with BTC/ETH. Setting `lowS: false` allows to create malleable signatures,\n * which is default openssl behavior.\n * Non-malleable signatures can still be successfully verified in openssl.\n * - `format`: (default: 'compact') 'compact' or 'recovered' with recovery byte\n */\nexport type ECDSAVerifyOpts = {\n prehash?: boolean;\n lowS?: boolean;\n format?: ECDSASignatureFormat;\n};\n/**\n * - `prehash`: (default: true) indicates whether to do sha256(message).\n * When a custom hash is used, it must be set to `false`.\n * - `lowS`: (default: true) prohibits signatures which have (sig.s >= CURVE.n/2n).\n * Compatible with BTC/ETH. Setting `lowS: false` allows to create malleable signatures,\n * which is default openssl behavior.\n * Non-malleable signatures can still be successfully verified in openssl.\n * - `format`: (default: 'compact') 'compact' or 'recovered' with recovery byte\n * - `extraEntropy`: (default: false) creates sigs with increased security, see {@link ECDSAExtraEntropy}\n */\nexport type ECDSASignOpts = {\n prehash?: boolean;\n lowS?: boolean;\n format?: ECDSASignatureFormat;\n extraEntropy?: ECDSAExtraEntropy;\n};\n\nfunction validateSigFormat(format: string): ECDSASignatureFormat {\n if (!['compact', 'recovered', 'der'].includes(format))\n throw new Error('Signature format must be \"compact\", \"recovered\", or \"der\"');\n return format as ECDSASignatureFormat;\n}\n\nfunction validateSigOpts<T extends ECDSASignOpts, D extends Required<ECDSASignOpts>>(\n opts: T,\n def: D\n): Required<ECDSASignOpts> {\n const optsn: ECDSASignOpts = {};\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) validateSigFormat(optsn.format);\n return optsn as Required<ECDSASignOpts>;\n}\n\n/** Instance methods for 3D XYZ projective points. */\nexport interface WeierstrassPoint<T> extends CurvePoint<T, WeierstrassPoint<T>> {\n /** projective X coordinate. Different from affine x. */\n readonly X: T;\n /** projective Y coordinate. Different from affine y. */\n readonly Y: T;\n /** projective z coordinate */\n readonly Z: T;\n /** affine x coordinate. Different from projective X. */\n get x(): T;\n /** affine y coordinate. Different from projective Y. */\n get y(): T;\n /** Encodes point using IEEE P1363 (DER) encoding. First byte is 2/3/4. Default = isCompressed. */\n toBytes(isCompressed?: boolean): Uint8Array;\n toHex(isCompressed?: boolean): string;\n}\n\n/** Static methods for 3D XYZ projective points. */\nexport interface WeierstrassPointCons<T> extends CurvePointCons<WeierstrassPoint<T>> {\n /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n new (X: T, Y: T, Z: T): WeierstrassPoint<T>;\n CURVE(): WeierstrassOpts<T>;\n}\n\n/**\n * Weierstrass curve options.\n *\n * * p: prime characteristic (order) of finite field, in which arithmetics is done\n * * n: order of prime subgroup a.k.a total amount of valid curve points\n * * h: cofactor, usually 1. h*n is group order; n is subgroup order\n * * a: formula param, must be in field of p\n * * b: formula param, must be in field of p\n * * Gx: x coordinate of generator point a.k.a. base point\n * * Gy: y coordinate of generator point\n */\nexport type WeierstrassOpts<T> = Readonly<{\n p: bigint;\n n: bigint;\n h: bigint;\n a: T;\n b: T;\n Gx: T;\n Gy: T;\n}>;\n\n// When a cofactor != 1, there can be an effective methods to:\n// 1. Determine whether a point is torsion-free\n// 2. Clear torsion component\nexport type WeierstrassExtraOpts<T> = Partial<{\n Fp: IField<T>;\n Fn: IField<bigint>;\n allowInfinityPoint: boolean;\n endo: EndomorphismOpts;\n isTorsionFree: (c: WeierstrassPointCons<T>, point: WeierstrassPoint<T>) => boolean;\n clearCofactor: (c: WeierstrassPointCons<T>, point: WeierstrassPoint<T>) => WeierstrassPoint<T>;\n fromBytes: (bytes: Uint8Array) => AffinePoint<T>;\n toBytes: (\n c: WeierstrassPointCons<T>,\n point: WeierstrassPoint<T>,\n isCompressed: boolean\n ) => Uint8Array;\n}>;\n\n/**\n * Options for ECDSA signatures over a Weierstrass curve.\n *\n * * lowS: (default: true) whether produced / verified signatures occupy low half of ecdsaOpts.p. Prevents malleability.\n * * hmac: (default: noble-hashes hmac) function, would be used to init hmac-drbg for k generation.\n * * randomBytes: (default: webcrypto os-level CSPRNG) custom method for fetching secure randomness.\n * * bits2int, bits2int_modN: used in sigs, sometimes overridden by curves\n */\nexport type ECDSAOpts = Partial<{\n lowS: boolean;\n hmac: (key: Uint8Array, message: Uint8Array) => Uint8Array;\n randomBytes: (bytesLength?: number) => Uint8Array;\n bits2int: (bytes: Uint8Array) => bigint;\n bits2int_modN: (bytes: Uint8Array) => bigint;\n}>;\n\n/**\n * Elliptic Curve Diffie-Hellman interface.\n * Provides keygen, secret-to-public conversion, calculating shared secrets.\n */\nexport interface ECDH {\n keygen: (seed?: Uint8Array) => { secretKey: Uint8Array; publicKey: Uint8Array };\n getPublicKey: (secretKey: Uint8Array, isCompressed?: boolean) => Uint8Array;\n getSharedSecret: (\n secretKeyA: Uint8Array,\n publicKeyB: Uint8Array,\n isCompressed?: boolean\n ) => Uint8Array;\n Point: WeierstrassPointCons<bigint>;\n utils: {\n isValidSecretKey: (secretKey: Uint8Array) => boolean;\n isValidPublicKey: (publicKey: Uint8Array, isCompressed?: boolean) => boolean;\n randomSecretKey: (seed?: Uint8Array) => Uint8Array;\n };\n lengths: CurveLengths;\n}\n\n/**\n * ECDSA interface.\n * Only supported for prime fields, not Fp2 (extension fields).\n */\nexport interface ECDSA extends ECDH {\n sign: (message: Uint8Array, secretKey: Uint8Array, opts?: ECDSASignOpts) => Uint8Array;\n verify: (\n signature: Uint8Array,\n message: Uint8Array,\n publicKey: Uint8Array,\n opts?: ECDSAVerifyOpts\n ) => boolean;\n recoverPublicKey(signature: Uint8Array, message: Uint8Array, opts?: ECDSARecoverOpts): Uint8Array;\n Signature: ECDSASignatureCons;\n}\nexport class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n}\nexport type IDER = {\n // asn.1 DER encoding utils\n Err: typeof DERErr;\n // Basic building block is TLV (Tag-Length-Value)\n _tlv: {\n encode: (tag: number, data: string) => string;\n // v - value, l - left bytes (unparsed)\n decode(tag: number, data: Uint8Array): { v: Uint8Array; l: Uint8Array };\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: bigint): string;\n decode(data: Uint8Array): bigint;\n };\n toSig(hex: string | Uint8Array): { r: bigint; s: bigint };\n hexFromSig(sig: { r: bigint; s: bigint }): string;\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: IDER = {\n // asn.1 DER encoding utils\n Err: DERErr,\n // Basic building block is TLV (Tag-Length-Value)\n _tlv: {\n encode: (tag: number, data: string): string => {\n const { Err: E } = DER;\n if (tag < 0 || tag > 256) throw new E('tlv.encode: wrong tag');\n if (data.length & 1) throw new E('tlv.encode: unpadded data');\n const dataLen = data.length / 2;\n const len = numberToHexUnpadded(dataLen);\n if ((len.length / 2) & 0b1000_0000) 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) | 0b1000_0000) : '';\n const t = numberToHexUnpadded(tag);\n return t + lenLen + len + data;\n },\n // v - value, l - left bytes (unparsed)\n decode(tag: number, data: Uint8Array): { v: Uint8Array; l: Uint8Array } {\n const { Err: E } = DER;\n let pos = 0;\n if (tag < 0 || tag > 256) throw new E('tlv.encode: wrong tag');\n if (data.length < 2 || data[pos++] !== tag) throw new E('tlv.decode: wrong tlv');\n const first = data[pos++];\n const isLong = !!(first & 0b1000_0000); // First bit of first length byte is flag for short/long form\n let length = 0;\n if (!isLong) length = first;\n else {\n // Long form: [longFlag(1bit), lengthLength(7bit), length (BE)]\n const lenLen = first & 0b0111_1111;\n if (!lenLen) throw new E('tlv.decode(long): indefinite length not supported');\n if (lenLen > 4) 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) throw new E('tlv.decode: length bytes not complete');\n if (lengthBytes[0] === 0) throw new E('tlv.decode(long): zero leftmost byte');\n for (const b of lengthBytes) length = (length << 8) | b;\n pos += lenLen;\n if (length < 128) throw new E('tlv.decode(long): not minimal encoding');\n }\n const v = data.subarray(pos, pos + length);\n if (v.length !== length) 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: bigint): string {\n const { Err: E } = DER;\n if (num < _0n) 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) hex = '00' + hex;\n if (hex.length & 1) throw new E('unexpected DER parsing assertion: unpadded hex');\n return hex;\n },\n decode(data: Uint8Array): bigint {\n const { Err: E } = DER;\n if (data[0] & 0b1000_0000) throw new E('invalid signature integer: negative');\n if (data[0] === 0x00 && !(data[1] & 0b1000_0000))\n throw new E('invalid signature integer: unnecessary leading zero');\n return bytesToNumberBE(data);\n },\n },\n toSig(bytes: Uint8Array): { r: bigint; s: bigint } {\n // parse DER signature\n const { Err: E, _int: int, _tlv: tlv } = DER;\n const data = abytes(bytes, undefined, 'signature');\n const { v: seqBytes, l: seqLeftBytes } = tlv.decode(0x30, data);\n if (seqLeftBytes.length) 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) throw new E('invalid signature: left bytes after parsing');\n return { r: int.decode(rBytes), s: int.decode(sBytes) };\n },\n hexFromSig(sig: { r: bigint; s: bigint }): string {\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\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);\n\n/**\n * Creates weierstrass Point constructor, based on specified curve options.\n *\n * See {@link WeierstrassOpts}.\n *\n * @example\n```js\nconst opts = {\n p: 0xfffffffffffffffffffffffffffffffeffffac73n,\n n: 0x100000000000000000001b8fa16dfab9aca16b6b3n,\n h: 1n,\n a: 0n,\n b: 7n,\n Gx: 0x3b4c382ce37aa192a4019e763036f4f5dd4d7ebbn,\n Gy: 0x938cf935318fdced6bc28286531733c3f03c4feen,\n};\nconst secp160k1_Point = weierstrass(opts);\n```\n */\nexport function weierstrass<T>(\n params: WeierstrassOpts<T>,\n extraOpts: WeierstrassExtraOpts<T> = {}\n): WeierstrassPointCons<T> {\n const validated = createCurveFields('weierstrass', params, extraOpts);\n const { Fp, Fn } = validated;\n let CURVE = validated.CURVE as WeierstrassOpts<T>;\n const { h: cofactor, n: CURVE_ORDER } = CURVE;\n validateObject(\n extraOpts,\n {},\n {\n allowInfinityPoint: 'boolean',\n clearCofactor: 'function',\n isTorsionFree: 'function',\n fromBytes: 'function',\n toBytes: 'function',\n endo: 'object',\n }\n );\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\n const lengths = getWLengths(Fp, Fn);\n\n function assertCompressionIsSupported() {\n if (!Fp.isOdd) throw new Error('compression is not supported: Field does not have .isOdd()');\n }\n\n // Implements IEEE P1363 point encoding\n function pointToBytes(\n _c: WeierstrassPointCons<T>,\n point: WeierstrassPoint<T>,\n isCompressed: boolean\n ): Uint8Array {\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 } else {\n return concatBytes(Uint8Array.of(0x04), bx, Fp.toBytes(y));\n }\n }\n function pointFromBytes(bytes: Uint8Array) {\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)) throw new Error('bad point: is not on curve, wrong x');\n const y2 = weierstrassEquation(x); // y\u00B2 = x\u00B3 + ax + b\n let y: T;\n try {\n y = Fp.sqrt(y2); // y = y\u00B2 ^ (p+1)/4\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 evenY = Fp.isOdd!(y);\n const evenH = (head & 1) === 1; // ECDSA-specific\n if (evenH !== evenY) y = Fp.neg(y);\n return { x, y };\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)) throw new Error('bad point: is not on curve');\n return { x, y };\n } else {\n throw new Error(\n `bad point: got length ${length}, expected compressed=${comp} or uncompressed=${uncomp}`\n );\n }\n }\n\n const encodePoint = extraOpts.toBytes || pointToBytes;\n const decodePoint = extraOpts.fromBytes || pointFromBytes;\n function weierstrassEquation(x: T): T {\n const x2 = Fp.sqr(x); // x * x\n const x3 = Fp.mul(x2, x); // x\u00B2 * x\n return Fp.add(Fp.add(x3, Fp.mul(x, CURVE.a)), CURVE.b); // x\u00B3 + a * x + b\n }\n\n // TODO: move top-level\n /** Checks whether equation holds for given x, y: y\u00B2 == x\u00B3 + ax + b */\n function isValidXY(x: T, y: T): boolean {\n const left = Fp.sqr(y); // y\u00B2\n const right = weierstrassEquation(x); // x\u00B3 + ax + b\n return Fp.eql(left, right);\n }\n\n // Validate whether the passed curve params are valid.\n // Test 1: equation y\u00B2 = x\u00B3 + ax + b should work for generator point.\n if (!isValidXY(CURVE.Gx, CURVE.Gy)) throw new Error('bad curve params: generator point');\n\n // Test 2: discriminant \u0394 part should be non-zero: 4a\u00B3 + 27b\u00B2 != 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))) throw new Error('bad curve params: a or b');\n\n /** Asserts coordinate is valid: 0 <= n < Fp.ORDER. */\n function acoord(title: string, n: T, banZero = false) {\n if (!Fp.isValid(n) || (banZero && Fp.is0(n))) throw new Error(`bad point coordinate ${title}`);\n return n;\n }\n\n function aprjpoint(other: unknown) {\n if (!(other instanceof Point)) throw new Error('Weierstrass Point expected');\n }\n\n function splitEndoScalarN(k: bigint) {\n if (!endo || !endo.basises) throw new Error('no endo');\n return _splitEndoScalar(k, endo.basises, Fn.ORDER);\n }\n\n // Memoized toAffine / validity check. They are heavy. Points are immutable.\n\n // Converts Projective point to affine (x, y) coordinates.\n // Can accept precomputed Z^-1 - for example, from invertBatch.\n // (X, Y, Z) \u220B (x=X/Z, y=Y/Z)\n const toAffineMemo = memoized((p: Point, iz?: T): AffinePoint<T> => {\n const { X, Y, Z } = p;\n // Fast-path for normalized points\n if (Fp.eql(Z, Fp.ONE)) 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) 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) return { x: Fp.ZERO, y: Fp.ZERO };\n if (!Fp.eql(zz, Fp.ONE)) 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: Point) => {\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)) 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)) throw new Error('bad point: x or y not field elements');\n if (!isValidXY(x, y)) throw new Error('bad point: equation left != right');\n if (!p.isTorsionFree()) throw new Error('bad point: not in prime-order subgroup');\n return true;\n });\n\n function finishEndo(\n endoBeta: EndomorphismOpts['beta'],\n k1p: Point,\n k2p: Point,\n k1neg: boolean,\n k2neg: boolean\n ) {\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 /**\n * Projective Point works in 3d / projective (homogeneous) coordinates:(X, Y, Z) \u220B (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 implements WeierstrassPoint<T> {\n // base / generator point\n static readonly BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n // zero / infinity / identity point\n static readonly ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO); // 0, 1, 0\n // math field\n static readonly Fp = Fp;\n // scalar field\n static readonly Fn = Fn;\n\n readonly X: T;\n readonly Y: T;\n readonly Z: T;\n\n /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n constructor(X: T, Y: T, Z: T) {\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\n static CURVE(): WeierstrassOpts<T> {\n return CURVE;\n }\n\n /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n static fromAffine(p: AffinePoint<T>): Point {\n const { x, y } = p || {};\n if (!p || !Fp.isValid(x) || !Fp.isValid(y)) throw new Error('invalid affine point');\n if (p instanceof Point) 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)) return Point.ZERO;\n return new Point(x, y, Fp.ONE);\n }\n\n static fromBytes(bytes: Uint8Array): Point {\n const P = Point.fromAffine(decodePoint(abytes(bytes, undefined, 'point')));\n P.assertValidity();\n return P;\n }\n\n static fromHex(hex: string): Point {\n return Point.fromBytes(hexToBytes(hex));\n }\n\n get x(): T {\n return this.toAffine().x;\n }\n get y(): T {\n return this.toAffine().y;\n }\n\n /**\n *\n * @param windowSize\n * @param isLazy true will defer table computation until the first multiplication\n * @returns\n */\n precompute(windowSize: number = 8, isLazy = true): Point {\n wnaf.createCache(this, windowSize);\n if (!isLazy) this.multiply(_3n); // random number\n return this;\n }\n\n // TODO: return `this`\n /** A point on curve is valid if it conforms to equation. */\n assertValidity(): void {\n assertValidMemo(this);\n }\n\n hasEvenY(): boolean {\n const { y } = this.toAffine();\n if (!Fp.isOdd) throw new Error(\"Field doesn't support isOdd\");\n return !Fp.isOdd(y);\n }\n\n /** Compare one point to another. */\n equals(other: Point): boolean {\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\n /** Flips point to one corresponding to (x, -y) in Affine coordinates. */\n negate(): Point {\n return new Point(this.X, Fp.neg(this.Y), this.Z);\n }\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\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: Point): Point {\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\n subtract(other: Point) {\n return this.add(other.negate());\n }\n\n is0(): boolean {\n return this.equals(Point.ZERO);\n }\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: bigint): Point {\n const { endo } = extraOpts;\n if (!Fn.isValidNot0(scalar)) throw new Error('invalid scalar: out of range'); // 0 is invalid\n let point: Point, fake: Point; // Fake point is used to const-time mult\n const mul = (n: bigint) => 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 } 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 /**\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: bigint): Point {\n const { endo } = extraOpts;\n const p = this as Point;\n if (!Fn.isValid(sc)) throw new Error('invalid scalar: out of range'); // 0 is valid\n if (sc === _0n || p.is0()) return Point.ZERO; // 0\n if (sc === _1n) return p; // 1\n if (wnaf.hasCache(this)) return this.multiply(sc); // precomputes\n // We don't have method for double scalar multiplication (aP + bQ):\n // Even with using Strauss-Shamir trick, it's 35% slower than na\u00EFve mul+add.\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 } else {\n return wnaf.unsafe(p, sc);\n }\n }\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?: T): AffinePoint<T> {\n return toAffineMemo(this, invertedZ);\n }\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(): boolean {\n const { isTorsionFree } = extraOpts;\n if (cofactor === _1n) return true;\n if (isTorsionFree) return isTorsionFree(Point, this);\n return wnaf.unsafe(this, CURVE_ORDER).is0();\n }\n\n clearCofactor(): Point {\n const { clearCofactor } = extraOpts;\n if (cofactor === _1n) return this; // Fast-path\n if (clearCofactor) return clearCofactor(Point, this) as Point;\n return this.multiplyUnsafe(cofactor);\n }\n\n isSmallOrder(): boolean {\n // can we use this.clearCofactor()?\n return this.multiplyUnsafe(cofactor).is0();\n }\n\n toBytes(isCompressed = true): Uint8Array {\n abool(isCompressed, 'isCompressed');\n this.assertValidity();\n return encodePoint(Point, this, isCompressed);\n }\n\n toHex(isCompressed = true): string {\n return bytesToHex(this.toBytes(isCompressed));\n }\n\n toString() {\n return `<Point ${this.is0() ? 'ZERO' : this.toHex()}>`;\n }\n }\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\n/** Methods of ECDSA signature instance. */\nexport interface ECDSASignature {\n readonly r: bigint;\n readonly s: bigint;\n readonly recovery?: number;\n addRecoveryBit(recovery: number): ECDSASignature & { readonly recovery: number };\n hasHighS(): boolean;\n recoverPublicKey(messageHash: Uint8Array): WeierstrassPoint<bigint>;\n toBytes(format?: string): Uint8Array;\n toHex(format?: string): string;\n}\n/** Methods of ECDSA signature constructor. */\nexport type ECDSASignatureCons = {\n new (r: bigint, s: bigint, recovery?: number): ECDSASignature;\n fromBytes(bytes: Uint8Array, format?: ECDSASignatureFormat): ECDSASignature;\n fromHex(hex: string, format?: ECDSASignatureFormat): ECDSASignature;\n};\n\n// Points start with byte 0x02 when y is even; otherwise 0x03\nfunction pprefix(hasEvenY: boolean): Uint8Array {\n return Uint8Array.of(hasEvenY ? 0x02 : 0x03);\n}\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<T>(\n Fp: IField<T>,\n Z: T\n): (u: T, v: T) => { isValid: boolean; value: T } {\n // Generic implementation\n const q = Fp.ORDER;\n let l = _0n;\n for (let o = q - _1n; o % _2n === _0n; o /= _2n) 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: T, v: T): { isValid: boolean; value: T } => {\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: T, v: T) => {\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<T>(\n Fp: IField<T>,\n opts: {\n A: T;\n B: T;\n Z: T;\n }\n): (u: T) => { x: T; y: T } {\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) 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: T): { x: T; y: T } => {\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}\n\nfunction getWLengths<T>(Fp: IField<T>, Fn: IField<bigint>) {\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/**\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(\n Point: WeierstrassPointCons<bigint>,\n ecdhOpts: { randomBytes?: (bytesLength?: number) => Uint8Array } = {}\n): ECDH {\n const { Fn } = Point;\n const randomBytes_ = ecdhOpts.randomBytes || wcRandomBytes;\n const lengths = Object.assign(getWLengths(Point.Fp, Fn), { seed: getMinHashLength(Fn.ORDER) });\n\n function isValidSecretKey(secretKey: Uint8Array) {\n try {\n const num = Fn.fromBytes(secretKey);\n return Fn.isValidNot0(num);\n } catch (error) {\n return false;\n }\n }\n\n function isValidPublicKey(publicKey: Uint8Array, isCompressed?: boolean): boolean {\n const { publicKey: comp, publicKeyUncompressed } = lengths;\n try {\n const l = publicKey.length;\n if (isCompressed === true && l !== comp) return false;\n if (isCompressed === false && l !== publicKeyUncompressed) return false;\n return !!Point.fromBytes(publicKey);\n } catch (error) {\n return false;\n }\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)): Uint8Array {\n return mapHashToField(abytes(seed, lengths.seed, 'seed'), Fn.ORDER);\n }\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: Uint8Array, isCompressed = true): Uint8Array {\n return Point.BASE.multiply(Fn.fromBytes(secretKey)).toBytes(isCompressed);\n }\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: Uint8Array): boolean | undefined {\n const { secretKey, publicKey, publicKeyUncompressed } = lengths;\n if (!isBytes(item)) return undefined;\n if (('_lengths' in Fn && Fn._lengths) || secretKey === publicKey) return undefined;\n const l = abytes(item, undefined, 'key').length;\n return l === publicKey || l === publicKeyUncompressed;\n }\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(\n secretKeyA: Uint8Array,\n publicKeyB: Uint8Array,\n isCompressed = true\n ): Uint8Array {\n if (isProbPub(secretKeyA) === true) throw new Error('first arg must be private key');\n if (isProbPub(publicKeyB) === false) throw new Error('second arg must be public key');\n const s = Fn.fromBytes(secretKeyA);\n const b = Point.fromBytes(publicKeyB); // checks for being on-curve\n return b.multiply(s).toBytes(isCompressed);\n }\n\n const utils = {\n isValidSecretKey,\n isValidPublicKey,\n randomSecretKey,\n };\n const keygen = createKeygen(randomSecretKey, getPublicKey);\n\n return Object.freeze({ getPublicKey, getSharedSecret, keygen, Point, utils, lengths });\n}\n\n/**\n * Creates ECDSA signing interface for given elliptic curve `Point` and `hash` function.\n *\n * @param Point created using {@link weierstrass} function\n * @param hash used for 1) message prehash-ing 2) k generation in `sign`, using hmac_drbg(hash)\n * @param ecdsaOpts rarely needed, see {@link ECDSAOpts}\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(\n Point: WeierstrassPointCons<bigint>,\n hash: CHash,\n ecdsaOpts: ECDSAOpts = {}\n): ECDSA {\n ahash(hash);\n validateObject(\n ecdsaOpts,\n {},\n {\n hmac: 'function',\n lowS: 'boolean',\n randomBytes: 'function',\n bits2int: 'function',\n bits2int_modN: 'function',\n }\n );\n ecdsaOpts = Object.assign({}, ecdsaOpts);\n const randomBytes = ecdsaOpts.randomBytes || wcRandomBytes;\n const hmac = ecdsaOpts.hmac || ((key, msg) => nobleHmac(hash, key, msg));\n\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: Required<ECDSASignOpts> = {\n prehash: true,\n lowS: typeof ecdsaOpts.lowS === 'boolean' ? ecdsaOpts.lowS : true,\n format: 'compact' as ECDSASignatureFormat,\n extraEntropy: false,\n };\n const hasLargeCofactor = CURVE_ORDER * _2n < Fp.ORDER; // Won't CURVE().h > 2n be more effective?\n\n function isBiggerThanHalfOrder(number: bigint) {\n const HALF = CURVE_ORDER >> _1n;\n return number > HALF;\n }\n function validateRS(title: string, num: bigint): bigint {\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 assertSmallCofactor(): void {\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 if (hasLargeCofactor)\n throw new Error('\"recovered\" sig type is not supported for cofactor >2 curves');\n }\n function validateSigLength(bytes: Uint8Array, format: ECDSASignatureFormat) {\n validateSigFormat(format);\n const size = lengths.signature!;\n const sizer = format === 'compact' ? size : format === 'recovered' ? size + 1 : undefined;\n return abytes(bytes, sizer);\n }\n\n /**\n * ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.\n */\n class Signature implements ECDSASignature {\n readonly r: bigint;\n readonly s: bigint;\n readonly recovery?: number;\n\n constructor(r: bigint, s: bigint, recovery?: number) {\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 assertSmallCofactor();\n if (![0, 1, 2, 3].includes(recovery)) throw new Error('invalid recovery id');\n this.recovery = recovery;\n }\n Object.freeze(this);\n }\n\n static fromBytes(\n bytes: Uint8Array,\n format: ECDSASignatureFormat = defaultSigOpts.format\n ): Signature {\n validateSigLength(bytes, format);\n let recid: number | undefined;\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 = lengths.signature! / 2;\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\n static fromHex(hex: string, format?: ECDSASignatureFormat) {\n return this.fromBytes(hexToBytes(hex), format);\n }\n\n private assertRecovery(): number {\n const { recovery } = this;\n if (recovery == null) throw new Error('invalid recovery id: must be present');\n return recovery;\n }\n\n addRecoveryBit(recovery: number): RecoveredSignature {\n return new Signature(this.r, this.s, recovery) as RecoveredSignature;\n }\n\n recoverPublicKey(messageHash: Uint8Array): WeierstrassPoint<bigint> {\n const { r, s } = this;\n const recovery = this.assertRecovery();\n const radj = recovery === 2 || recovery === 3 ? r + CURVE_ORDER : r;\n if (!Fp.isValid(radj)) throw new Error('invalid recovery id: sig.r+curve.n != R.x');\n const x = Fp.toBytes(radj);\n const R = Point.fromBytes(concatBytes(pprefix((recovery & 1) === 0), x));\n const ir = Fn.inv(radj); // r^-1\n const h = bits2int_modN(abytes(messageHash, undefined, 'msgHash')); // 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()) throw new Error('invalid recovery: point at infinify');\n Q.assertValidity();\n return Q;\n }\n\n // Signatures should be low-s, to prevent malleability.\n hasHighS(): boolean {\n return isBiggerThanHalfOrder(this.s);\n }\n\n toBytes(format: ECDSASignatureFormat = defaultSigOpts.format) {\n validateSigFormat(format);\n if (format === 'der') return hexToBytes(DER.hexFromSig(this));\n const { r, s } = this;\n const rb = Fn.toBytes(r);\n const sb = Fn.toBytes(s);\n if (format === 'recovered') {\n assertSmallCofactor();\n return concatBytes(Uint8Array.of(this.assertRecovery()), rb, sb);\n }\n return concatBytes(rb, sb);\n }\n\n toHex(format?: ECDSASignatureFormat) {\n return bytesToHex(this.toBytes(format));\n }\n }\n type RecoveredSignature = Signature & { recovery: number };\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 =\n ecdsaOpts.bits2int ||\n function bits2int_def(bytes: Uint8Array): bigint {\n // Our custom check \"just in case\", for protection against DoS\n if (bytes.length > 8192) 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 =\n ecdsaOpts.bits2int_modN ||\n function bits2int_modN_def(bytes: Uint8Array): bigint {\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: bigint): Uint8Array {\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\n function validateMsgAndHash(message: Uint8Array, prehash: boolean) {\n abytes(message, undefined, 'message');\n return prehash ? abytes(hash(message), undefined, 'prehashed message') : message;\n }\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: Uint8Array, secretKey: Uint8Array, opts: ECDSASignOpts) {\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 = Fn.fromBytes(secretKey); // validate secret key, convert to bigint\n if (!Fn.isValidNot0(d)) throw new Error('invalid private key');\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(abytes(e, undefined, 'extraEntropy')); // check for being bytes\n }\n const seed = concatBytes(...seedArgs); // Step D of RFC6979 3.2\n const m = h1int; // 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\u22C5G\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 \u2208 [1,q\u22121] 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: Uint8Array): Signature | undefined {\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); // Cannot use fields methods, since it is group element\n if (!Fn.isValidNot0(k)) 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\u22C5G\n const r = Fn.create(q.x); // r = q.x mod n\n if (r === _0n) return;\n const s = Fn.create(ik * Fn.create(m + r * d)); // s = k^-1(m + rd) mod n\n if (s === _0n) 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 in the bottom half of N\n recovery ^= 1;\n }\n return new Signature(r, normS, hasLargeCofactor ? undefined : recovery);\n }\n return { seed, k2sig };\n }\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 \u00D7 k\n * r = x mod n\n * s = (m + dr) / k mod n\n * ```\n */\n function sign(message: Uint8Array, secretKey: Uint8Array, opts: ECDSASignOpts = {}): Uint8Array {\n const { seed, k2sig } = prepSig(message, secretKey, opts); // Steps A, D of RFC6979 3.2.\n const drbg = createHmacDrbg<Signature>(hash.outputLen, Fn.BYTES, hmac);\n const sig = drbg(seed, k2sig); // Steps B, C, D, E, F, G\n return sig.toBytes(opts.format);\n }\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\u22C5G + u2\u22C5P\n * mod(R.x, n) == r\n * ```\n */\n function verify(\n signature: Uint8Array,\n message: Uint8Array,\n publicKey: Uint8Array,\n opts: ECDSAVerifyOpts = {}\n ): boolean {\n const { lowS, prehash, format } = validateSigOpts(opts, defaultSigOpts);\n publicKey = abytes(publicKey, undefined, 'publicKey');\n message = validateMsgAndHash(message, prehash);\n if (!isBytes(signature as any)) {\n const end = signature instanceof Signature ? ', use sig.toBytes()' : '';\n throw new Error('verify expects Uint8Array signature' + end);\n }\n validateSigLength(signature, format); // execute this twice because we want loud error\n try {\n const sig = Signature.fromBytes(signature, format);\n const P = Point.fromBytes(publicKey);\n if (lowS && sig.hasHighS()) 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\u22C5G + u2\u22C5P\n if (R.is0()) return false;\n const v = Fn.create(R.x); // v = r.x mod n\n return v === r;\n } catch (e) {\n return false;\n }\n }\n\n function recoverPublicKey(\n signature: Uint8Array,\n message: Uint8Array,\n opts: ECDSARecoverOpts = {}\n ): Uint8Array {\n const { prehash } = validateSigOpts(opts, defaultSigOpts);\n message = validateMsgAndHash(message, prehash);\n return Signature.fromBytes(signature, 'recovered').recoverPublicKey(message).toBytes();\n }\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 }) satisfies Signer;\n}\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, type CHash, type Hash } from './utils.ts';\n\n/** Internal class for HMAC. */\nexport class _HMAC<T extends Hash<T>> implements Hash<_HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, key: Uint8Array) {\n ahash(hash);\n abytes(key, undefined, 'key');\n this.iHash = hash.create() as T;\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++) 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() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n clean(pad);\n }\n update(buf: Uint8Array): this {\n aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array): void {\n aexists(this);\n abytes(out, this.outputLen, 'output');\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(): Uint8Array {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: _HMAC<T>): _HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\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(): _HMAC<T> {\n return this._cloneInto();\n }\n destroy(): void {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\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: {\n (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array;\n create(hash: CHash, key: Uint8Array): _HMAC<any>;\n} = (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array =>\n new _HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Uint8Array) => new _HMAC<any>(hash, key);\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, type CHash, type Hash } from './utils.ts';\n\n/** Internal class for HMAC. */\nexport class _HMAC<T extends Hash<T>> implements Hash<_HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, key: Uint8Array) {\n ahash(hash);\n abytes(key, undefined, 'key');\n this.iHash = hash.create() as T;\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++) 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() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n clean(pad);\n }\n update(buf: Uint8Array): this {\n aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array): void {\n aexists(this);\n abytes(out, this.outputLen, 'output');\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(): Uint8Array {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: _HMAC<T>): _HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\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(): _HMAC<T> {\n return this._cloneInto();\n }\n destroy(): void {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\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: {\n (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array;\n create(hash: CHash, key: Uint8Array): _HMAC<any>;\n} = (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array =>\n new _HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Uint8Array) => new _HMAC<any>(hash, key);\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\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\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\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: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\n\nSHA1 (RFC 3174), MD5 (RFC 1321) and RIPEMD160 (RFC 2286) legacy, weak hash functions.\nDon't use them in a new protocol. What \"weak\" means:\n\n- Collisions can be made with 2^18 effort in MD5, 2^60 in SHA1, 2^80 in RIPEMD160.\n- No practical pre-image attacks (only theoretical, 2^123.4)\n- HMAC seems kinda ok: https://www.rfc-editor.org/rfc/rfc6151\n * @module\n */\nimport { Chi, HashMD, Maj } from './_md.ts';\nimport { type CHash, clean, createHasher, rotl } from './utils.ts';\n\n/** Initial SHA1 state */\nconst SHA1_IV = /* @__PURE__ */ Uint32Array.from([\n 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n\n// Reusable temporary buffer\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal SHA1 legacy hash class. */\nexport class _SHA1 extends HashMD<_SHA1> {\n private A = SHA1_IV[0] | 0;\n private B = SHA1_IV[1] | 0;\n private C = SHA1_IV[2] | 0;\n private D = SHA1_IV[3] | 0;\n private E = SHA1_IV[4] | 0;\n\n constructor() {\n super(64, 20, 8, false);\n }\n protected get(): [number, number, number, number, number] {\n const { A, B, C, D, E } = this;\n return [A, B, C, D, E];\n }\n protected set(A: number, B: number, C: number, D: number, E: number): void {\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 }\n protected process(view: DataView, offset: number): void {\n for (let i = 0; i < 16; i++, offset += 4) SHA1_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 80; i++)\n SHA1_W[i] = rotl(SHA1_W[i - 3] ^ SHA1_W[i - 8] ^ SHA1_W[i - 14] ^ SHA1_W[i - 16], 1);\n // Compression function main loop, 80 rounds\n let { A, B, C, D, E } = this;\n for (let i = 0; i < 80; i++) {\n let F, K;\n if (i < 20) {\n F = Chi(B, C, D);\n K = 0x5a827999;\n } else if (i < 40) {\n F = B ^ C ^ D;\n K = 0x6ed9eba1;\n } else if (i < 60) {\n F = Maj(B, C, D);\n K = 0x8f1bbcdc;\n } else {\n F = B ^ C ^ D;\n K = 0xca62c1d6;\n }\n const T = (rotl(A, 5) + F + E + K + SHA1_W[i]) | 0;\n E = D;\n D = C;\n C = rotl(B, 30);\n B = A;\n A = T;\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 this.set(A, B, C, D, E);\n }\n protected roundClean(): void {\n clean(SHA1_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** SHA1 (RFC 3174) legacy hash function. It was cryptographically broken. */\nexport const sha1: CHash = /* @__PURE__ */ createHasher(() => new _SHA1());\n\n/** Per-round constants */\nconst p32 = /* @__PURE__ */ Math.pow(2, 32);\nconst K = /* @__PURE__ */ Array.from({ length: 64 }, (_, i) =>\n Math.floor(p32 * Math.abs(Math.sin(i + 1)))\n);\n\n/** md5 initial state: same as sha1, but 4 u32 instead of 5. */\nconst MD5_IV = /* @__PURE__ */ SHA1_IV.slice(0, 4);\n\n// Reusable temporary buffer\nconst MD5_W = /* @__PURE__ */ new Uint32Array(16);\n/** Internal MD5 legacy hash class. */\nexport class _MD5 extends HashMD<_MD5> {\n private A = MD5_IV[0] | 0;\n private B = MD5_IV[1] | 0;\n private C = MD5_IV[2] | 0;\n private D = MD5_IV[3] | 0;\n\n constructor() {\n super(64, 16, 8, true);\n }\n protected get(): [number, number, number, number] {\n const { A, B, C, D } = this;\n return [A, B, C, D];\n }\n protected set(A: number, B: number, C: number, D: number): void {\n this.A = A | 0;\n this.B = B | 0;\n this.C = C | 0;\n this.D = D | 0;\n }\n protected process(view: DataView, offset: number): void {\n for (let i = 0; i < 16; i++, offset += 4) MD5_W[i] = view.getUint32(offset, true);\n // Compression function main loop, 64 rounds\n let { A, B, C, D } = this;\n for (let i = 0; i < 64; i++) {\n let F, g, s;\n if (i < 16) {\n F = Chi(B, C, D);\n g = i;\n s = [7, 12, 17, 22];\n } else if (i < 32) {\n F = Chi(D, B, C);\n g = (5 * i + 1) % 16;\n s = [5, 9, 14, 20];\n } else if (i < 48) {\n F = B ^ C ^ D;\n g = (3 * i + 5) % 16;\n s = [4, 11, 16, 23];\n } else {\n F = C ^ (B | ~D);\n g = (7 * i) % 16;\n s = [6, 10, 15, 21];\n }\n F = F + A + K[i] + MD5_W[g];\n A = D;\n D = C;\n C = B;\n B = B + rotl(F, s[i % 4]);\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 this.set(A, B, C, D);\n }\n protected roundClean(): void {\n clean(MD5_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/**\n * MD5 (RFC 1321) legacy hash function. It was cryptographically broken.\n * MD5 architecture is similar to SHA1, with some differences:\n * - Reduced output length: 16 bytes (128 bit) instead of 20\n * - 64 rounds, instead of 80\n * - Little-endian: could be faster, but will require more code\n * - Non-linear index selection: huge speed-up for unroll\n * - Per round constants: more memory accesses, additional speed-up for unroll\n */\nexport const md5: CHash = /* @__PURE__ */ createHasher(() => new _MD5());\n\n// RIPEMD-160\n\nconst Rho160 = /* @__PURE__ */ Uint8Array.from([\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n]);\nconst Id160 = /* @__PURE__ */ (() => Uint8Array.from(new Array(16).fill(0).map((_, i) => i)))();\nconst Pi160 = /* @__PURE__ */ (() => Id160.map((i) => (9 * i + 5) % 16))();\nconst idxLR = /* @__PURE__ */ (() => {\n const L = [Id160];\n const R = [Pi160];\n const res = [L, R];\n for (let i = 0; i < 4; i++) for (let j of res) j.push(j[i].map((k) => Rho160[k]));\n return res;\n})();\nconst idxL = /* @__PURE__ */ (() => idxLR[0])();\nconst idxR = /* @__PURE__ */ (() => idxLR[1])();\n// const [idxL, idxR] = idxLR;\n\nconst shifts160 = /* @__PURE__ */ [\n [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => Uint8Array.from(i));\nconst shiftsL160 = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts160[i][j]));\nconst shiftsR160 = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts160[i][j]));\nconst Kl160 = /* @__PURE__ */ Uint32Array.from([\n 0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr160 = /* @__PURE__ */ Uint32Array.from([\n 0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// It's called f() in spec.\nfunction ripemd_f(group: number, x: number, y: number, z: number): number {\n if (group === 0) return x ^ y ^ z;\n if (group === 1) return (x & y) | (~x & z);\n if (group === 2) return (x | ~y) ^ z;\n if (group === 3) return (x & z) | (y & ~z);\n return x ^ (y | ~z);\n}\n// Reusable temporary buffer\nconst BUF_160 = /* @__PURE__ */ new Uint32Array(16);\nexport class _RIPEMD160 extends HashMD<_RIPEMD160> {\n private h0 = 0x67452301 | 0;\n private h1 = 0xefcdab89 | 0;\n private h2 = 0x98badcfe | 0;\n private h3 = 0x10325476 | 0;\n private h4 = 0xc3d2e1f0 | 0;\n\n constructor() {\n super(64, 20, 8, true);\n }\n protected get(): [number, number, number, number, number] {\n const { h0, h1, h2, h3, h4 } = this;\n return [h0, h1, h2, h3, h4];\n }\n protected set(h0: number, h1: number, h2: number, h3: number, h4: number): void {\n this.h0 = h0 | 0;\n this.h1 = h1 | 0;\n this.h2 = h2 | 0;\n this.h3 = h3 | 0;\n this.h4 = h4 | 0;\n }\n protected process(view: DataView, offset: number): void {\n for (let i = 0; i < 16; i++, offset += 4) BUF_160[i] = view.getUint32(offset, true);\n // prettier-ignore\n let al = this.h0 | 0, ar = al,\n bl = this.h1 | 0, br = bl,\n cl = this.h2 | 0, cr = cl,\n dl = this.h3 | 0, dr = dl,\n el = this.h4 | 0, er = el;\n\n // Instead of iterating 0 to 80, we split it into 5 groups\n // And use the groups in constants, functions, etc. Much simpler\n for (let group = 0; group < 5; group++) {\n const rGroup = 4 - group;\n const hbl = Kl160[group], hbr = Kr160[group]; // prettier-ignore\n const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n const sl = shiftsL160[group], sr = shiftsR160[group]; // prettier-ignore\n for (let i = 0; i < 16; i++) {\n const tl = (rotl(al + ripemd_f(group, bl, cl, dl) + BUF_160[rl[i]] + hbl, sl[i]) + el) | 0;\n al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n }\n // 2 loops are 10% faster\n for (let i = 0; i < 16; i++) {\n const tr = (rotl(ar + ripemd_f(rGroup, br, cr, dr) + BUF_160[rr[i]] + hbr, sr[i]) + er) | 0;\n ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n }\n }\n // Add the compressed chunk to the current hash value\n this.set(\n (this.h1 + cl + dr) | 0,\n (this.h2 + dl + er) | 0,\n (this.h3 + el + ar) | 0,\n (this.h4 + al + br) | 0,\n (this.h0 + bl + cr) | 0\n );\n }\n protected roundClean(): void {\n clean(BUF_160);\n }\n destroy(): void {\n this.destroyed = true;\n clean(this.buffer);\n this.set(0, 0, 0, 0, 0);\n }\n}\n\n/**\n * RIPEMD-160 - a legacy hash function from 1990s.\n * * https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n * * https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\n */\nexport const ripemd160: CHash = /* @__PURE__ */ createHasher(() => new _RIPEMD160());\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\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: Uint8Array): this {\n aexists(this);\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) 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: Uint8Array): void {\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++) 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 view.setBigUint64(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 must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\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://www.rfc-editor.org/rfc/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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal 32-byte base SHA2 hash class. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n constructor() {\n super(32);\n }\n}\n\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal 64-byte base SHA2 hash class. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\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 protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor() {\n super(64);\n }\n}\n\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n */\nexport const sha256: CHash<_SHA256> = /* @__PURE__ */ createHasher(\n () => new _SHA256(),\n /* @__PURE__ */ oidNist(0x01)\n);\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash<_SHA224> = /* @__PURE__ */ createHasher(\n () => new _SHA224(),\n /* @__PURE__ */ oidNist(0x04)\n);\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash<_SHA512> = /* @__PURE__ */ createHasher(\n () => new _SHA512(),\n /* @__PURE__ */ oidNist(0x03)\n);\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash<_SHA384> = /* @__PURE__ */ createHasher(\n () => new _SHA384(),\n /* @__PURE__ */ oidNist(0x02)\n);\n\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: CHash<_SHA512_256> = /* @__PURE__ */ createHasher(\n () => new _SHA512_256(),\n /* @__PURE__ */ oidNist(0x06)\n);\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: CHash<_SHA512_224> = /* @__PURE__ */ createHasher(\n () => new _SHA512_224(),\n /* @__PURE__ */ oidNist(0x05)\n);\n", "/**\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);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) 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}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\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}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\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(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\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: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\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", "/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\nexport interface Coder<F, T> {\n encode(from: F): T;\n decode(to: T): F;\n}\n\nexport interface BytesCoder extends Coder<Uint8Array, string> {\n encode: (data: Uint8Array) => string;\n decode: (str: string) => Uint8Array;\n}\n\nfunction isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is Uint8Array. */\nfunction abytes(b: Uint8Array | undefined): void {\n if (!isBytes(b)) throw new Error('Uint8Array expected');\n}\n\nfunction isArrayOf(isString: boolean, arr: any[]) {\n if (!Array.isArray(arr)) return false;\n if (arr.length === 0) return true;\n if (isString) {\n return arr.every((item) => typeof item === 'string');\n } else {\n return arr.every((item) => Number.isSafeInteger(item));\n }\n}\n\nfunction afn(input: Function): input is Function {\n if (typeof input !== 'function') throw new Error('function expected');\n return true;\n}\n\nfunction astr(label: string, input: unknown): input is string {\n if (typeof input !== 'string') throw new Error(`${label}: string expected`);\n return true;\n}\n\nfunction anumber(n: number): void {\n if (!Number.isSafeInteger(n)) throw new Error(`invalid integer: ${n}`);\n}\n\nfunction aArr(input: any[]) {\n if (!Array.isArray(input)) throw new Error('array expected');\n}\nfunction astrArr(label: string, input: string[]) {\n if (!isArrayOf(true, input)) throw new Error(`${label}: array of strings expected`);\n}\nfunction anumArr(label: string, input: number[]) {\n if (!isArrayOf(false, input)) throw new Error(`${label}: array of numbers expected`);\n}\n\n// TODO: some recusive type inference so it would check correct order of input/output inside rest?\n// like <string, number>, <number, bytes>, <bytes, float>\ntype Chain = [Coder<any, any>, ...Coder<any, any>[]];\n// Extract info from Coder type\ntype Input<F> = F extends Coder<infer T, any> ? T : never;\ntype Output<F> = F extends Coder<any, infer T> ? T : never;\n// Generic function for arrays\ntype First<T> = T extends [infer U, ...any[]] ? U : never;\ntype Last<T> = T extends [...any[], infer U] ? U : never;\ntype Tail<T> = T extends [any, ...infer U] ? U : never;\n\ntype AsChain<C extends Chain, Rest = Tail<C>> = {\n // C[K] = Coder<Input<C[K]>, Input<Rest[k]>>\n [K in keyof C]: Coder<Input<C[K]>, Input<K extends keyof Rest ? Rest[K] : any>>;\n};\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction chain<T extends Chain & AsChain<T>>(...args: T): Coder<Input<First<T>>, Output<Last<T>>> {\n const id = (a: any) => a;\n // Wrap call in closure so JIT can inline calls\n const wrap = (a: any, b: any) => (c: any) => a(b(c));\n // Construct chain of args[-1].encode(args[-2].encode([...]))\n const encode = args.map((x) => x.encode).reduceRight(wrap, id);\n // Construct chain of args[0].decode(args[1].decode(...))\n const decode = args.map((x) => x.decode).reduce(wrap, id);\n return { encode, decode };\n}\n\n/**\n * Encodes integer radix representation to array of strings using alphabet and back.\n * Could also be array of strings.\n * @__NO_SIDE_EFFECTS__\n */\nfunction alphabet(letters: string | string[]): Coder<number[], string[]> {\n // mapping 1 to \"b\"\n const lettersA = typeof letters === 'string' ? letters.split('') : letters;\n const len = lettersA.length;\n astrArr('alphabet', lettersA);\n\n // mapping \"b\" to 1\n const indexes = new Map(lettersA.map((l, i) => [l, i]));\n return {\n encode: (digits: number[]) => {\n aArr(digits);\n return digits.map((i) => {\n if (!Number.isSafeInteger(i) || i < 0 || i >= len)\n throw new Error(\n `alphabet.encode: digit index outside alphabet \"${i}\". Allowed: ${letters}`\n );\n return lettersA[i]!;\n });\n },\n decode: (input: string[]): number[] => {\n aArr(input);\n return input.map((letter) => {\n astr('alphabet.decode', letter);\n const i = indexes.get(letter);\n if (i === undefined) throw new Error(`Unknown letter: \"${letter}\". Allowed: ${letters}`);\n return i;\n });\n },\n };\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction join(separator = ''): Coder<string[], string> {\n astr('join', separator);\n return {\n encode: (from) => {\n astrArr('join.decode', from);\n return from.join(separator);\n },\n decode: (to) => {\n astr('join.decode', to);\n return to.split(separator);\n },\n };\n}\n\n/**\n * Pad strings array so it has integer number of bits\n * @__NO_SIDE_EFFECTS__\n */\nfunction padding(bits: number, chr = '='): Coder<string[], string[]> {\n anumber(bits);\n astr('padding', chr);\n return {\n encode(data: string[]): string[] {\n astrArr('padding.encode', data);\n while ((data.length * bits) % 8) data.push(chr);\n return data;\n },\n decode(input: string[]): string[] {\n astrArr('padding.decode', input);\n let end = input.length;\n if ((end * bits) % 8)\n throw new Error('padding: invalid, string should have whole number of bytes');\n for (; end > 0 && input[end - 1] === chr; end--) {\n const last = end - 1;\n const byte = last * bits;\n if (byte % 8 === 0) throw new Error('padding: invalid, string has too much padding');\n }\n return input.slice(0, end);\n },\n };\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction normalize<T>(fn: (val: T) => T): Coder<T, T> {\n afn(fn);\n return { encode: (from: T) => from, decode: (to: T) => fn(to) };\n}\n\n/**\n * Slow: O(n^2) time complexity\n */\nfunction convertRadix(data: number[], from: number, to: number): number[] {\n // base 1 is impossible\n if (from < 2) throw new Error(`convertRadix: invalid from=${from}, base cannot be less than 2`);\n if (to < 2) throw new Error(`convertRadix: invalid to=${to}, base cannot be less than 2`);\n aArr(data);\n if (!data.length) return [];\n let pos = 0;\n const res = [];\n const digits = Array.from(data, (d) => {\n anumber(d);\n if (d < 0 || d >= from) throw new Error(`invalid integer: ${d}`);\n return d;\n });\n const dlen = digits.length;\n while (true) {\n let carry = 0;\n let done = true;\n for (let i = pos; i < dlen; i++) {\n const digit = digits[i]!;\n const fromCarry = from * carry;\n const digitBase = fromCarry + digit;\n if (\n !Number.isSafeInteger(digitBase) ||\n fromCarry / from !== carry ||\n digitBase - digit !== fromCarry\n ) {\n throw new Error('convertRadix: carry overflow');\n }\n const div = digitBase / to;\n carry = digitBase % to;\n const rounded = Math.floor(div);\n digits[i] = rounded;\n if (!Number.isSafeInteger(rounded) || rounded * to + carry !== digitBase)\n throw new Error('convertRadix: carry overflow');\n if (!done) continue;\n else if (!rounded) pos = i;\n else done = false;\n }\n res.push(carry);\n if (done) break;\n }\n for (let i = 0; i < data.length - 1 && data[i] === 0; i++) res.push(0);\n return res.reverse();\n}\n\nconst gcd = (a: number, b: number): number => (b === 0 ? a : gcd(b, a % b));\nconst radix2carry = /* @__NO_SIDE_EFFECTS__ */ (from: number, to: number) =>\n from + (to - gcd(from, to));\nconst powers: number[] = /* @__PURE__ */ (() => {\n let res = [];\n for (let i = 0; i < 40; i++) res.push(2 ** i);\n return res;\n})();\n/**\n * Implemented with numbers, because BigInt is 5x slower\n */\nfunction convertRadix2(data: number[], from: number, to: number, padding: boolean): number[] {\n aArr(data);\n if (from <= 0 || from > 32) throw new Error(`convertRadix2: wrong from=${from}`);\n if (to <= 0 || to > 32) throw new Error(`convertRadix2: wrong to=${to}`);\n if (radix2carry(from, to) > 32) {\n throw new Error(\n `convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`\n );\n }\n let carry = 0;\n let pos = 0; // bitwise position in current element\n const max = powers[from]!;\n const mask = powers[to]! - 1;\n const res: number[] = [];\n for (const n of data) {\n anumber(n);\n if (n >= max) throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n carry = (carry << from) | n;\n if (pos + from > 32) throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n pos += from;\n for (; pos >= to; pos -= to) res.push(((carry >> (pos - to)) & mask) >>> 0);\n const pow = powers[pos];\n if (pow === undefined) throw new Error('invalid carry');\n carry &= pow - 1; // clean carry, otherwise it will cause overflow\n }\n carry = (carry << (to - pos)) & mask;\n if (!padding && pos >= from) throw new Error('Excess padding');\n if (!padding && carry > 0) throw new Error(`Non-zero padding: ${carry}`);\n if (padding && pos > 0) res.push(carry >>> 0);\n return res;\n}\n\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix(num: number): Coder<Uint8Array, number[]> {\n anumber(num);\n const _256 = 2 ** 8;\n return {\n encode: (bytes: Uint8Array) => {\n if (!isBytes(bytes)) throw new Error('radix.encode input should be Uint8Array');\n return convertRadix(Array.from(bytes), _256, num);\n },\n decode: (digits: number[]) => {\n anumArr('radix.decode', digits);\n return Uint8Array.from(convertRadix(digits, num, _256));\n },\n };\n}\n\n/**\n * If both bases are power of same number (like `2**8 <-> 2**64`),\n * there is a linear algorithm. For now we have implementation for power-of-two bases only.\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix2(bits: number, revPadding = false): Coder<Uint8Array, number[]> {\n anumber(bits);\n if (bits <= 0 || bits > 32) throw new Error('radix2: bits should be in (0..32]');\n if (radix2carry(8, bits) > 32 || radix2carry(bits, 8) > 32)\n throw new Error('radix2: carry overflow');\n return {\n encode: (bytes: Uint8Array) => {\n if (!isBytes(bytes)) throw new Error('radix2.encode input should be Uint8Array');\n return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n },\n decode: (digits: number[]) => {\n anumArr('radix2.decode', digits);\n return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n },\n };\n}\n\ntype ArgumentTypes<F extends Function> = F extends (...args: infer A) => any ? A : never;\nfunction unsafeWrapper<T extends (...args: any) => any>(fn: T) {\n afn(fn);\n return function (...args: ArgumentTypes<T>): ReturnType<T> | void {\n try {\n return fn.apply(null, args);\n } catch (e) {}\n };\n}\n\nfunction checksum(\n len: number,\n fn: (data: Uint8Array) => Uint8Array\n): Coder<Uint8Array, Uint8Array> {\n anumber(len);\n afn(fn);\n return {\n encode(data: Uint8Array) {\n if (!isBytes(data)) throw new Error('checksum.encode: input should be Uint8Array');\n const sum = fn(data).slice(0, len);\n const res = new Uint8Array(data.length + len);\n res.set(data);\n res.set(sum, data.length);\n return res;\n },\n decode(data: Uint8Array) {\n if (!isBytes(data)) throw new Error('checksum.decode: input should be Uint8Array');\n const payload = data.slice(0, -len);\n const oldChecksum = data.slice(-len);\n const newChecksum = fn(payload).slice(0, len);\n for (let i = 0; i < len; i++)\n if (newChecksum[i] !== oldChecksum[i]) throw new Error('Invalid checksum');\n return payload;\n },\n };\n}\n\n// prettier-ignore\nexport const utils: { alphabet: typeof alphabet; chain: typeof chain; checksum: typeof checksum; convertRadix: typeof convertRadix; convertRadix2: typeof convertRadix2; radix: typeof radix; radix2: typeof radix2; join: typeof join; padding: typeof padding; } = {\n alphabet, chain, checksum, convertRadix, convertRadix2, radix, radix2, join, padding,\n};\n\n// RFC 4648 aka RFC 3548\n// ---------------------\n\n/**\n * base16 encoding from RFC 4648.\n * @example\n * ```js\n * base16.encode(Uint8Array.from([0x12, 0xab]));\n * // => '12AB'\n * ```\n */\nexport const base16: BytesCoder = chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\n\n/**\n * base32 encoding from RFC 4648. Has padding.\n * Use `base32nopad` for unpadded version.\n * Also check out `base32hex`, `base32hexnopad`, `base32crockford`.\n * @example\n * ```js\n * base32.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'CKVQ===='\n * base32.decode('CKVQ====');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32: BytesCoder = chain(\n radix2(5),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'),\n padding(5),\n join('')\n);\n\n/**\n * base32 encoding from RFC 4648. No padding.\n * Use `base32` for padded version.\n * Also check out `base32hex`, `base32hexnopad`, `base32crockford`.\n * @example\n * ```js\n * base32nopad.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'CKVQ'\n * base32nopad.decode('CKVQ');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32nopad: BytesCoder = chain(\n radix2(5),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'),\n join('')\n);\n/**\n * base32 encoding from RFC 4648. Padded. Compared to ordinary `base32`, slightly different alphabet.\n * Use `base32hexnopad` for unpadded version.\n * @example\n * ```js\n * base32hex.encode(Uint8Array.from([0x12, 0xab]));\n * // => '2ALG===='\n * base32hex.decode('2ALG====');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32hex: BytesCoder = chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'),\n padding(5),\n join('')\n);\n\n/**\n * base32 encoding from RFC 4648. No padding. Compared to ordinary `base32`, slightly different alphabet.\n * Use `base32hex` for padded version.\n * @example\n * ```js\n * base32hexnopad.encode(Uint8Array.from([0x12, 0xab]));\n * // => '2ALG'\n * base32hexnopad.decode('2ALG');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32hexnopad: BytesCoder = chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'),\n join('')\n);\n/**\n * base32 encoding from RFC 4648. Doug Crockford's version.\n * https://www.crockford.com/base32.html\n * @example\n * ```js\n * base32crockford.encode(Uint8Array.from([0x12, 0xab]));\n * // => '2ANG'\n * base32crockford.decode('2ANG');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base32crockford: BytesCoder = chain(\n radix2(5),\n alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'),\n join(''),\n normalize((s: string) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1'))\n);\n\n// Built-in base64 conversion https://caniuse.com/mdn-javascript_builtins_uint8array_frombase64\n// prettier-ignore\nconst hasBase64Builtin: boolean = /* @__PURE__ */ (() =>\n typeof (Uint8Array as any).from([]).toBase64 === 'function' &&\n typeof (Uint8Array as any).fromBase64 === 'function')();\n\nconst decodeBase64Builtin = (s: string, isUrl: boolean) => {\n astr('base64', s);\n const re = isUrl ? /^[A-Za-z0-9=_-]+$/ : /^[A-Za-z0-9=+/]+$/;\n const alphabet = isUrl ? 'base64url' : 'base64';\n if (s.length > 0 && !re.test(s)) throw new Error('invalid base64');\n return (Uint8Array as any).fromBase64(s, { alphabet, lastChunkHandling: 'strict' });\n};\n\n/**\n * base64 from RFC 4648. Padded.\n * Use `base64nopad` for unpadded version.\n * Also check out `base64url`, `base64urlnopad`.\n * Falls back to built-in function, when available.\n * @example\n * ```js\n * base64.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'Eqs='\n * base64.decode('Eqs=');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\n// prettier-ignore\nexport const base64: BytesCoder = hasBase64Builtin ? {\n encode(b) { abytes(b); return (b as any).toBase64(); },\n decode(s) { return decodeBase64Builtin(s, false); },\n} : chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'),\n padding(6),\n join('')\n);\n/**\n * base64 from RFC 4648. No padding.\n * Use `base64` for padded version.\n * @example\n * ```js\n * base64nopad.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'Eqs'\n * base64nopad.decode('Eqs');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base64nopad: BytesCoder = chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'),\n join('')\n);\n\n/**\n * base64 from RFC 4648, using URL-safe alphabet. Padded.\n * Use `base64urlnopad` for unpadded version.\n * Falls back to built-in function, when available.\n * @example\n * ```js\n * base64url.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'Eqs='\n * base64url.decode('Eqs=');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\n// prettier-ignore\nexport const base64url: BytesCoder = hasBase64Builtin ? {\n encode(b) { abytes(b); return (b as any).toBase64({ alphabet: 'base64url' }); },\n decode(s) { return decodeBase64Builtin(s, true); },\n} : chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'),\n padding(6),\n join('')\n);\n\n/**\n * base64 from RFC 4648, using URL-safe alphabet. No padding.\n * Use `base64url` for padded version.\n * @example\n * ```js\n * base64urlnopad.encode(Uint8Array.from([0x12, 0xab]));\n * // => 'Eqs'\n * base64urlnopad.decode('Eqs');\n * // => Uint8Array.from([0x12, 0xab])\n * ```\n */\nexport const base64urlnopad: BytesCoder = chain(\n radix2(6),\n alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'),\n join('')\n);\n\n// base58 code\n// -----------\nconst genBase58 = /* @__NO_SIDE_EFFECTS__ */ (abc: string) =>\n chain(radix(58), alphabet(abc), join(''));\n\n/**\n * base58: base64 without ambigous characters +, /, 0, O, I, l.\n * Quadratic (O(n^2)) - so, can't be used on large inputs.\n * @example\n * ```js\n * base58.decode('01abcdef');\n * // => '3UhJW'\n * ```\n */\nexport const base58: BytesCoder = genBase58(\n '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n);\n/**\n * base58: flickr version. Check out `base58`.\n */\nexport const base58flickr: BytesCoder = genBase58(\n '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'\n);\n/**\n * base58: XRP version. Check out `base58`.\n */\nexport const base58xrp: BytesCoder = genBase58(\n 'rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz'\n);\n\n// Data len (index) -> encoded block len\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\n\n/**\n * base58: XMR version. Check out `base58`.\n * Done in 8-byte blocks (which equals 11 chars in decoding). Last (non-full) block padded with '1' to size in XMR_BLOCK_LEN.\n * Block encoding significantly reduces quadratic complexity of base58.\n */\nexport const base58xmr: BytesCoder = {\n encode(data: Uint8Array) {\n let res = '';\n for (let i = 0; i < data.length; i += 8) {\n const block = data.subarray(i, i + 8);\n res += base58.encode(block).padStart(XMR_BLOCK_LEN[block.length]!, '1');\n }\n return res;\n },\n decode(str: string) {\n let res: number[] = [];\n for (let i = 0; i < str.length; i += 11) {\n const slice = str.slice(i, i + 11);\n const blockLen = XMR_BLOCK_LEN.indexOf(slice.length);\n const block = base58.decode(slice);\n for (let j = 0; j < block.length - blockLen; j++) {\n if (block[j] !== 0) throw new Error('base58xmr: wrong padding');\n }\n res = res.concat(Array.from(block.slice(block.length - blockLen)));\n }\n return Uint8Array.from(res);\n },\n};\n\n/**\n * Method, which creates base58check encoder.\n * Requires function, calculating sha256.\n */\nexport const createBase58check = (sha256: (data: Uint8Array) => Uint8Array): BytesCoder =>\n chain(\n checksum(4, (data) => sha256(sha256(data))),\n base58\n );\n\n/**\n * Use `createBase58check` instead.\n * @deprecated\n */\nexport const base58check: (sha256: (data: Uint8Array) => Uint8Array) => BytesCoder =\n createBase58check;\n\n// Bech32 code\n// -----------\nexport interface Bech32Decoded<Prefix extends string = string> {\n prefix: Prefix;\n words: number[];\n}\nexport interface Bech32DecodedWithArray<Prefix extends string = string> {\n prefix: Prefix;\n words: number[];\n bytes: Uint8Array;\n}\n\nconst BECH_ALPHABET: Coder<number[], string> = chain(\n alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'),\n join('')\n);\n\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\nfunction bech32Polymod(pre: number): number {\n const b = pre >> 25;\n let chk = (pre & 0x1ffffff) << 5;\n for (let i = 0; i < POLYMOD_GENERATORS.length; i++) {\n if (((b >> i) & 1) === 1) chk ^= POLYMOD_GENERATORS[i]!;\n }\n return chk;\n}\n\nfunction bechChecksum(prefix: string, words: number[], encodingConst = 1): string {\n const len = prefix.length;\n let chk = 1;\n for (let i = 0; i < len; i++) {\n const c = prefix.charCodeAt(i);\n if (c < 33 || c > 126) throw new Error(`Invalid prefix (${prefix})`);\n chk = bech32Polymod(chk) ^ (c >> 5);\n }\n chk = bech32Polymod(chk);\n for (let i = 0; i < len; i++) chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n for (let v of words) chk = bech32Polymod(chk) ^ v;\n for (let i = 0; i < 6; i++) chk = bech32Polymod(chk);\n chk ^= encodingConst;\n return BECH_ALPHABET.encode(convertRadix2([chk % powers[30]!], 30, 5, false));\n}\n\nexport interface Bech32 {\n encode<Prefix extends string>(\n prefix: Prefix,\n words: number[] | Uint8Array,\n limit?: number | false\n ): `${Lowercase<Prefix>}1${string}`;\n decode<Prefix extends string>(\n str: `${Prefix}1${string}`,\n limit?: number | false\n ): Bech32Decoded<Prefix>;\n encodeFromBytes(prefix: string, bytes: Uint8Array): string;\n decodeToBytes(str: string): Bech32DecodedWithArray;\n decodeUnsafe(str: string, limit?: number | false): void | Bech32Decoded<string>;\n fromWords(to: number[]): Uint8Array;\n fromWordsUnsafe(to: number[]): void | Uint8Array;\n toWords(from: Uint8Array): number[];\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction genBech32(encoding: 'bech32' | 'bech32m'): Bech32 {\n const ENCODING_CONST = encoding === 'bech32' ? 1 : 0x2bc830a3;\n const _words = radix2(5);\n const fromWords = _words.decode;\n const toWords = _words.encode;\n const fromWordsUnsafe = unsafeWrapper(fromWords);\n\n function encode<Prefix extends string>(\n prefix: Prefix,\n words: number[] | Uint8Array,\n limit: number | false = 90\n ): `${Lowercase<Prefix>}1${string}` {\n astr('bech32.encode prefix', prefix);\n if (isBytes(words)) words = Array.from(words);\n anumArr('bech32.encode', words);\n const plen = prefix.length;\n if (plen === 0) throw new TypeError(`Invalid prefix length ${plen}`);\n const actualLength = plen + 7 + words.length;\n if (limit !== false && actualLength > limit)\n throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n const lowered = prefix.toLowerCase();\n const sum = bechChecksum(lowered, words, ENCODING_CONST);\n return `${lowered}1${BECH_ALPHABET.encode(words)}${sum}` as `${Lowercase<Prefix>}1${string}`;\n }\n\n function decode<Prefix extends string>(\n str: `${Prefix}1${string}`,\n limit?: number | false\n ): Bech32Decoded<Prefix>;\n function decode(str: string, limit?: number | false): Bech32Decoded;\n function decode(str: string, limit: number | false = 90): Bech32Decoded {\n astr('bech32.decode input', str);\n const slen = str.length;\n if (slen < 8 || (limit !== false && slen > limit))\n throw new TypeError(`invalid string length: ${slen} (${str}). Expected (8..${limit})`);\n // don't allow mixed case\n const lowered = str.toLowerCase();\n if (str !== lowered && str !== str.toUpperCase())\n throw new Error(`String must be lowercase or uppercase`);\n const sepIndex = lowered.lastIndexOf('1');\n if (sepIndex === 0 || sepIndex === -1)\n throw new Error(`Letter \"1\" must be present between prefix and data only`);\n const prefix = lowered.slice(0, sepIndex);\n const data = lowered.slice(sepIndex + 1);\n if (data.length < 6) throw new Error('Data must be at least 6 characters long');\n const words = BECH_ALPHABET.decode(data).slice(0, -6);\n const sum = bechChecksum(prefix, words, ENCODING_CONST);\n if (!data.endsWith(sum)) throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n return { prefix, words };\n }\n\n const decodeUnsafe = unsafeWrapper(decode);\n\n function decodeToBytes(str: string): Bech32DecodedWithArray {\n const { prefix, words } = decode(str, false);\n return { prefix, words, bytes: fromWords(words) };\n }\n\n function encodeFromBytes(prefix: string, bytes: Uint8Array) {\n return encode(prefix, toWords(bytes));\n }\n\n return {\n encode,\n decode,\n encodeFromBytes,\n decodeToBytes,\n decodeUnsafe,\n fromWords,\n fromWordsUnsafe,\n toWords,\n };\n}\n\n/**\n * bech32 from BIP 173. Operates on words.\n * For high-level, check out scure-btc-signer:\n * https://github.com/paulmillr/scure-btc-signer.\n */\nexport const bech32: Bech32 = genBech32('bech32');\n\n/**\n * bech32m from BIP 350. Operates on words.\n * It was to mitigate `bech32` weaknesses.\n * For high-level, check out scure-btc-signer:\n * https://github.com/paulmillr/scure-btc-signer.\n */\nexport const bech32m: Bech32 = genBech32('bech32m');\n\ndeclare const TextEncoder: any;\ndeclare const TextDecoder: any;\n\n/**\n * UTF-8-to-byte decoder. Uses built-in TextDecoder / TextEncoder.\n * @example\n * ```js\n * const b = utf8.decode(\"hey\"); // => new Uint8Array([ 104, 101, 121 ])\n * const str = utf8.encode(b); // \"hey\"\n * ```\n */\nexport const utf8: BytesCoder = {\n encode: (data) => new TextDecoder().decode(data),\n decode: (str) => new TextEncoder().encode(str),\n};\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\n// prettier-ignore\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n typeof (Uint8Array as any).from([]).toHex === 'function' &&\n typeof (Uint8Array as any).fromHex === 'function')();\n// prettier-ignore\nconst hexBuiltin: BytesCoder = {\n encode(data) { abytes(data); return (data as any).toHex(); },\n decode(s) { astr('hex', s); return (Uint8Array as any).fromHex(s); },\n};\n/**\n * hex string decoder. Uses built-in function, when available.\n * @example\n * ```js\n * const b = hex.decode(\"0102ff\"); // => new Uint8Array([ 1, 2, 255 ])\n * const str = hex.encode(b); // \"0102ff\"\n * ```\n */\nexport const hex: BytesCoder = hasHexBuiltin\n ? hexBuiltin\n : chain(\n radix2(4),\n alphabet('0123456789abcdef'),\n join(''),\n normalize((s: string) => {\n if (typeof s !== 'string' || s.length % 2 !== 0)\n throw new TypeError(\n `hex.decode: expected string, got ${typeof s} with length ${s.length}`\n );\n return s.toLowerCase();\n })\n );\n\nexport type SomeCoders = {\n utf8: BytesCoder;\n hex: BytesCoder;\n base16: BytesCoder;\n base32: BytesCoder;\n base64: BytesCoder;\n base64url: BytesCoder;\n base58: BytesCoder;\n base58xmr: BytesCoder;\n};\n// prettier-ignore\nconst CODERS: SomeCoders = {\n utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\ntype CoderType = keyof SomeCoders;\nconst coderTypeError =\n 'Invalid encoding type. Available types: utf8, hex, base16, base32, base64, base64url, base58, base58xmr';\n\n/** @deprecated */\nexport const bytesToString = (type: CoderType, bytes: Uint8Array): string => {\n if (typeof type !== 'string' || !CODERS.hasOwnProperty(type)) throw new TypeError(coderTypeError);\n if (!isBytes(bytes)) throw new TypeError('bytesToString() expects Uint8Array');\n return CODERS[type].encode(bytes);\n};\n\n/** @deprecated */\nexport const str: (type: CoderType, bytes: Uint8Array) => string = bytesToString; // as in python, but for bytes only\n\n/** @deprecated */\nexport const stringToBytes = (type: CoderType, str: string): Uint8Array => {\n if (!CODERS.hasOwnProperty(type)) throw new TypeError(coderTypeError);\n if (typeof str !== 'string') throw new TypeError('stringToBytes() expects string');\n return CODERS[type].decode(str);\n};\n/** @deprecated */\nexport const bytes: (type: CoderType, str: string) => Uint8Array = stringToBytes;\n", "/*! scure-bip39 - MIT License (c) 2022 Patricio Palladino, Paul Miller (paulmillr.com) */\nimport { pbkdf2, pbkdf2Async } from '@noble/hashes/pbkdf2.js';\nimport { sha256, sha512 } from '@noble/hashes/sha2.js';\nimport { abytes, anumber, randomBytes } from '@noble/hashes/utils.js';\nimport { pbkdf2 as pbkdf2web, sha512 as sha512web } from '@noble/hashes/webcrypto.js';\nimport { utils as baseUtils } from '@scure/base';\n// Japanese wordlist\nconst isJapanese = (wordlist) => wordlist[0] === '\\u3042\\u3044\\u3053\\u304f\\u3057\\u3093';\n// Normalization replaces equivalent sequences of characters\n// so that any two texts that are equivalent will be reduced\n// to the same sequence of code points, called the normal form of the original text.\n// https://tonsky.me/blog/unicode/#why-is-a----\nfunction nfkd(str) {\n if (typeof str !== 'string')\n throw new TypeError('invalid mnemonic type: ' + typeof str);\n return str.normalize('NFKD');\n}\nfunction normalize(str) {\n const norm = nfkd(str);\n const words = norm.split(' ');\n if (![12, 15, 18, 21, 24].includes(words.length))\n throw new Error('Invalid mnemonic');\n return { nfkd: norm, words };\n}\nfunction aentropy(ent) {\n abytes(ent);\n if (![16, 20, 24, 28, 32].includes(ent.length))\n throw new Error('invalid entropy length');\n}\n/**\n * Generate x random words. Uses Cryptographically-Secure Random Number Generator.\n * @param wordlist imported wordlist for specific language\n * @param strength mnemonic strength 128-256 bits\n * @example\n * generateMnemonic(wordlist, 128)\n * // 'legal winner thank year wave sausage worth useful legal winner thank yellow'\n */\nexport function generateMnemonic(wordlist, strength = 128) {\n anumber(strength);\n if (strength % 32 !== 0 || strength > 256)\n throw new TypeError('Invalid entropy');\n return entropyToMnemonic(randomBytes(strength / 8), wordlist);\n}\nconst calcChecksum = (entropy) => {\n // Checksum is ent.length/4 bits long\n const bitsLeft = 8 - entropy.length / 4;\n // Zero rightmost \"bitsLeft\" bits in byte\n // For example: bitsLeft=4 val=10111101 -> 10110000\n return new Uint8Array([(sha256(entropy)[0] >> bitsLeft) << bitsLeft]);\n};\nfunction getCoder(wordlist) {\n if (!Array.isArray(wordlist) || wordlist.length !== 2048 || typeof wordlist[0] !== 'string')\n throw new Error('Wordlist: expected array of 2048 strings');\n wordlist.forEach((i) => {\n if (typeof i !== 'string')\n throw new Error('wordlist: non-string element: ' + i);\n });\n return baseUtils.chain(baseUtils.checksum(1, calcChecksum), baseUtils.radix2(11, true), baseUtils.alphabet(wordlist));\n}\n/**\n * Reversible: Converts mnemonic string to raw entropy in form of byte array.\n * @param mnemonic 12-24 words\n * @param wordlist imported wordlist for specific language\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * mnemonicToEntropy(mnem, wordlist)\n * // Produces\n * new Uint8Array([\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f,\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f\n * ])\n */\nexport function mnemonicToEntropy(mnemonic, wordlist) {\n const { words } = normalize(mnemonic);\n const entropy = getCoder(wordlist).decode(words);\n aentropy(entropy);\n return entropy;\n}\n/**\n * Reversible: Converts raw entropy in form of byte array to mnemonic string.\n * @param entropy byte array\n * @param wordlist imported wordlist for specific language\n * @returns 12-24 words\n * @example\n * const ent = new Uint8Array([\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f,\n * 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f, 0x7f\n * ]);\n * entropyToMnemonic(ent, wordlist);\n * // 'legal winner thank year wave sausage worth useful legal winner thank yellow'\n */\nexport function entropyToMnemonic(entropy, wordlist) {\n aentropy(entropy);\n const words = getCoder(wordlist).encode(entropy);\n return words.join(isJapanese(wordlist) ? '\\u3000' : ' ');\n}\n/**\n * Validates mnemonic for being 12-24 words contained in `wordlist`.\n */\nexport function validateMnemonic(mnemonic, wordlist) {\n try {\n mnemonicToEntropy(mnemonic, wordlist);\n }\n catch (e) {\n return false;\n }\n return true;\n}\nconst psalt = (passphrase) => nfkd('mnemonic' + passphrase);\n/**\n * Irreversible: Uses KDF to derive 64 bytes of key data from mnemonic + optional password.\n * @param mnemonic 12-24 words\n * @param passphrase string that will additionally protect the key\n * @returns 64 bytes of key data\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * await mnemonicToSeed(mnem, 'password');\n * // new Uint8Array([...64 bytes])\n */\nexport function mnemonicToSeed(mnemonic, passphrase = '') {\n return pbkdf2Async(sha512, normalize(mnemonic).nfkd, psalt(passphrase), { c: 2048, dkLen: 64 });\n}\n/**\n * Irreversible: Uses KDF to derive 64 bytes of key data from mnemonic + optional password.\n * @param mnemonic 12-24 words\n * @param passphrase string that will additionally protect the key\n * @returns 64 bytes of key data\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * mnemonicToSeedSync(mnem, 'password');\n * // new Uint8Array([...64 bytes])\n */\nexport function mnemonicToSeedSync(mnemonic, passphrase = '') {\n return pbkdf2(sha512, normalize(mnemonic).nfkd, psalt(passphrase), { c: 2048, dkLen: 64 });\n}\n/**\n * Uses native, built-in functionality, provided by globalThis.crypto.\n * Irreversible: Uses KDF to derive 64 bytes of key data from mnemonic + optional password.\n * @param mnemonic 12-24 words\n * @param passphrase string that will additionally protect the key\n * @returns 64 bytes of key data\n * @example\n * const mnem = 'legal winner thank year wave sausage worth useful legal winner thank yellow';\n * mnemonicToSeedWebcrypto(mnem, 'password');\n * // new Uint8Array([...64 bytes])\n */\nexport function mnemonicToSeedWebcrypto(mnemonic, passphrase = '') {\n return pbkdf2web(sha512web, normalize(mnemonic).nfkd, psalt(passphrase), { c: 2048, dkLen: 64 });\n}\n", "/**\n * PBKDF (RFC 2898). Can be used to create a key from password and salt.\n * @module\n */\nimport { hmac } from './hmac.ts';\n// prettier-ignore\nimport {\n ahash, anumber,\n asyncLoop, checkOpts, clean, createView, kdfInputToBytes,\n type CHash,\n type Hash,\n type KDFInput\n} from './utils.ts';\n\n/**\n * PBKDF2 options:\n * * c: iterations, should probably be higher than 100_000\n * * dkLen: desired length of derived key in bytes\n * * asyncTick: max time in ms for which async function can block execution\n */\nexport type Pbkdf2Opt = {\n c: number;\n dkLen?: number;\n asyncTick?: number;\n};\n// Common start and end for sync/async functions\nfunction pbkdf2Init(hash: CHash, _password: KDFInput, _salt: KDFInput, _opts: Pbkdf2Opt) {\n ahash(hash);\n const opts = checkOpts({ dkLen: 32, asyncTick: 10 }, _opts);\n const { c, dkLen, asyncTick } = opts;\n anumber(c, 'c');\n anumber(dkLen, 'dkLen');\n anumber(asyncTick, 'asyncTick');\n if (c < 1) throw new Error('iterations (c) must be >= 1');\n const password = kdfInputToBytes(_password, 'password');\n const salt = kdfInputToBytes(_salt, 'salt');\n // DK = PBKDF2(PRF, Password, Salt, c, dkLen);\n const DK = new Uint8Array(dkLen);\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n const PRF = hmac.create(hash, password);\n const PRFSalt = PRF._cloneInto().update(salt);\n return { c, dkLen, asyncTick, DK, PRF, PRFSalt };\n}\n\nfunction pbkdf2Output<T extends Hash<T>>(\n PRF: Hash<T>,\n PRFSalt: Hash<T>,\n DK: Uint8Array,\n prfW: Hash<T>,\n u: Uint8Array\n) {\n PRF.destroy();\n PRFSalt.destroy();\n if (prfW) prfW.destroy();\n clean(u);\n return DK;\n}\n\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function\n * @param hash - hash function that would be used e.g. sha256\n * @param password - password from which a derived key is generated\n * @param salt - cryptographic salt\n * @param opts - {c, dkLen} where c is work factor and dkLen is output message size\n * @example\n * const key = pbkdf2(sha256, 'password', 'salt', { dkLen: 32, c: Math.pow(2, 18) });\n */\nexport function pbkdf2(\n hash: CHash,\n password: KDFInput,\n salt: KDFInput,\n opts: Pbkdf2Opt\n): Uint8Array {\n const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW: any; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + \u22EF + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ \u22EF ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n for (let ui = 1; ui < c; ui++) {\n // Uc = PRF(Password, Uc\u22121)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++) Ti[i] ^= u[i];\n }\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function. Async version.\n * @example\n * await pbkdf2Async(sha256, 'password', 'salt', { dkLen: 32, c: 500_000 });\n */\nexport async function pbkdf2Async(\n hash: CHash,\n password: KDFInput,\n salt: KDFInput,\n opts: Pbkdf2Opt\n): Promise<Uint8Array> {\n const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n let prfW: any; // Working copy\n const arr = new Uint8Array(4);\n const view = createView(arr);\n const u = new Uint8Array(PRF.outputLen);\n // DK = T1 + T2 + \u22EF + Tdklen/hlen\n for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n // Ti = F(Password, Salt, c, i)\n const Ti = DK.subarray(pos, pos + PRF.outputLen);\n view.setInt32(0, ti, false);\n // F(Password, Salt, c, i) = U1 ^ U2 ^ \u22EF ^ Uc\n // U1 = PRF(Password, Salt + INT_32_BE(i))\n (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n Ti.set(u.subarray(0, Ti.length));\n await asyncLoop(c - 1, asyncTick, () => {\n // Uc = PRF(Password, Uc\u22121)\n PRF._cloneInto(prfW).update(u).digestInto(u);\n for (let i = 0; i < Ti.length; i++) Ti[i] ^= u[i];\n });\n }\n return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n", "/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean, type CHash, type Hash } from './utils.ts';\n\n/** Internal class for HMAC. */\nexport class _HMAC<T extends Hash<T>> implements Hash<_HMAC<T>> {\n oHash: T;\n iHash: T;\n blockLen: number;\n outputLen: number;\n private finished = false;\n private destroyed = false;\n\n constructor(hash: CHash, key: Uint8Array) {\n ahash(hash);\n abytes(key, undefined, 'key');\n this.iHash = hash.create() as T;\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++) 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() as T;\n // Undo internal XOR && apply outer XOR\n for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n this.oHash.update(pad);\n clean(pad);\n }\n update(buf: Uint8Array): this {\n aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out: Uint8Array): void {\n aexists(this);\n abytes(out, this.outputLen, 'output');\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(): Uint8Array {\n const out = new Uint8Array(this.oHash.outputLen);\n this.digestInto(out);\n return out;\n }\n _cloneInto(to?: _HMAC<T>): _HMAC<T> {\n // Create new instance without calling constructor since key already in state and we don't know it.\n to ||= Object.create(Object.getPrototypeOf(this), {});\n const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n to = to as this;\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(): _HMAC<T> {\n return this._cloneInto();\n }\n destroy(): void {\n this.destroyed = true;\n this.oHash.destroy();\n this.iHash.destroy();\n }\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: {\n (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array;\n create(hash: CHash, key: Uint8Array): _HMAC<any>;\n} = (hash: CHash, key: Uint8Array, message: Uint8Array): Uint8Array =>\n new _HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Uint8Array) => new _HMAC<any>(hash, key);\n", "/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a: unknown): a is Uint8Array {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n\n/** Asserts something is positive integer. */\nexport function anumber(n: number, title: string = ''): void {\n if (!Number.isSafeInteger(n) || n < 0) {\n const prefix = title && `\"${title}\" `;\n throw new Error(`${prefix}expected integer >= 0, got ${n}`);\n }\n}\n\n/** Asserts something is Uint8Array. */\nexport function abytes(value: Uint8Array, length?: number, title: string = ''): Uint8Array {\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\n/** Asserts something is hash */\nexport function ahash(h: CHash): void {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash must wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance: any, checkFinished = true): void {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out: any, instance: any): void {\n abytes(out, undefined, 'digestInto() output');\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('\"digestInto() output\" expected to be of length >=' + min);\n }\n}\n\n/** Generic type encompassing 8/16/32-byte arrays - but not 64-byte. */\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr: TypedArray): Uint8Array {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr: TypedArray): Uint32Array {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays: TypedArray[]): void {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr: TypedArray): DataView {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word: number, shift: number): number {\n return (word << (32 - shift)) | (word >>> shift);\n}\n\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word: number, shift: number): number {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE: boolean = /* @__PURE__ */ (() =>\n new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n\n/** The byte swap operation for uint32 */\nexport function byteSwap(word: number): number {\n return (\n ((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff)\n );\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE: (n: number) => number = isLE\n ? (n: number) => n\n : (n: number) => byteSwap(n);\n\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr: Uint32Array): Uint32Array {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\n\nexport const swap32IfBE: (u: Uint32Array) => Uint32Array = isLE\n ? (u: Uint32Array) => u\n : byteSwap32;\n\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin: boolean = /* @__PURE__ */ (() =>\n // @ts-ignore\n typeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n\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: Uint8Array): string {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin) 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\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 } as const;\nfunction asciiToBase16(ch: number): number | undefined {\n if (ch >= asciis._0 && ch <= asciis._9) return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F) return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f) return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\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: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n // @ts-ignore\n if (hasHexBuiltin) return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) 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/**\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 (): Promise<void> => {};\n\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(\n iters: number,\n tick: number,\n cb: (i: number) => void\n): Promise<void> {\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) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols, but ts doesn't see them: https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * Converts string to bytes using UTF8 encoding.\n * Built-in doesn't validate input to be string: we do the check.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/** KDFs can accept string or Uint8Array for user convenience. */\nexport type KDFInput = string | Uint8Array;\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: KDFInput, errorTitle = ''): Uint8Array {\n if (typeof data === 'string') return utf8ToBytes(data);\n return abytes(data, undefined, errorTitle);\n}\n\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\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}\n\ntype EmptyObj = {};\n/** Merges default options and passed options. */\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && {}.toString.call(opts) !== '[object Object]')\n throw new Error('options must be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\n/** Common interface for all hashes. */\nexport interface Hash<T> {\n blockLen: number; // Bytes per block\n outputLen: number; // Bytes in output\n update(buf: Uint8Array): this;\n digestInto(buf: Uint8Array): void;\n digest(): Uint8Array;\n destroy(): void;\n _cloneInto(to?: T): T;\n clone(): T;\n}\n\n/** PseudoRandom (number) Generator */\nexport interface PRG {\n addEntropy(seed: Uint8Array): void;\n randomBytes(length: number): Uint8Array;\n clean(): void;\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n/** Hash constructor */\nexport type HasherCons<T, Opts = undefined> = Opts extends undefined ? () => T : (opts?: Opts) => T;\n/** Optional hash params. */\nexport type HashInfo = {\n oid?: Uint8Array; // DER encoded OID in bytes\n};\n/** Hash function */\nexport type CHash<T extends Hash<T> = Hash<any>, Opts = undefined> = {\n outputLen: number;\n blockLen: number;\n} & HashInfo &\n (Opts extends undefined\n ? {\n (msg: Uint8Array): Uint8Array;\n create(): T;\n }\n : {\n (msg: Uint8Array, opts?: Opts): Uint8Array;\n create(opts?: Opts): T;\n });\n/** XOF with output */\nexport type CHashXOF<T extends HashXOF<T> = HashXOF<any>, Opts = undefined> = CHash<T, Opts>;\n\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher<T extends Hash<T>, Opts = undefined>(\n hashCons: HasherCons<T, Opts>,\n info: HashInfo = {}\n): CHash<T, Opts> {\n const hashC: any = (msg: Uint8Array, opts?: Opts) => hashCons(opts).update(msg).digest();\n const tmp = hashCons(undefined);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts?: Opts) => hashCons(opts);\n Object.assign(hashC, info);\n return Object.freeze(hashC);\n}\n\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n const cr = typeof globalThis === 'object' ? (globalThis as any).crypto : null;\n if (typeof cr?.getRandomValues !== 'function')\n throw new Error('crypto.getRandomValues must be defined');\n return cr.getRandomValues(new Uint8Array(bytesLength));\n}\n\n/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix: number): Required<HashInfo> => ({\n oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n", "/**\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://www.rfc-editor.org/rfc/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.ts';\nimport * as u64 from './_u64.ts';\nimport { type CHash, clean, createHasher, oidNist, rotr } from './utils.ts';\n\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\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n\n/** Internal 32-byte base SHA2 hash class. */\nabstract class SHA2_32B<T extends SHA2_32B<T>> extends HashMD<T> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected abstract A: number;\n protected abstract B: number;\n protected abstract C: number;\n protected abstract D: number;\n protected abstract E: number;\n protected abstract F: number;\n protected abstract G: number;\n protected abstract H: number;\n\n constructor(outputLen: number) {\n super(64, outputLen, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\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 protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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) 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 protected roundClean(): void {\n clean(SHA256_W);\n }\n destroy(): void {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n clean(this.buffer);\n }\n}\n\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B<_SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n protected A: number = SHA256_IV[0] | 0;\n protected B: number = SHA256_IV[1] | 0;\n protected C: number = SHA256_IV[2] | 0;\n protected D: number = SHA256_IV[3] | 0;\n protected E: number = SHA256_IV[4] | 0;\n protected F: number = SHA256_IV[5] | 0;\n protected G: number = SHA256_IV[6] | 0;\n protected H: number = SHA256_IV[7] | 0;\n constructor() {\n super(32);\n }\n}\n\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B<_SHA224> {\n protected A: number = SHA224_IV[0] | 0;\n protected B: number = SHA224_IV[1] | 0;\n protected C: number = SHA224_IV[2] | 0;\n protected D: number = SHA224_IV[3] | 0;\n protected E: number = SHA224_IV[4] | 0;\n protected F: number = SHA224_IV[5] | 0;\n protected G: number = SHA224_IV[6] | 0;\n protected H: number = SHA224_IV[7] | 0;\n constructor() {\n super(28);\n }\n}\n\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n\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\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n\n/** Internal 64-byte base SHA2 hash class. */\nabstract class SHA2_64B<T extends SHA2_64B<T>> extends HashMD<T> {\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 protected abstract Ah: number;\n protected abstract Al: number;\n protected abstract Bh: number;\n protected abstract Bl: number;\n protected abstract Ch: number;\n protected abstract Cl: number;\n protected abstract Dh: number;\n protected abstract Dl: number;\n protected abstract Eh: number;\n protected abstract El: number;\n protected abstract Fh: number;\n protected abstract Fl: number;\n protected abstract Gh: number;\n protected abstract Gl: number;\n protected abstract Hh: number;\n protected abstract Hl: number;\n\n constructor(outputLen: number) {\n super(128, outputLen, 16, false);\n }\n // prettier-ignore\n protected get(): [\n number, number, number, number, number, number, number, number,\n number, number, number, number, number, number, number, number\n ] {\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 protected set(\n Ah: number, Al: number, Bh: number, Bl: number, Ch: number, Cl: number, Dh: number, Dl: number,\n Eh: number, El: number, Fh: number, Fl: number, Gh: number, Gl: number, Hh: number, Hl: number\n ): void {\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 protected process(view: DataView, offset: number): void {\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 protected roundClean(): void {\n clean(SHA512_W_H, SHA512_W_L);\n }\n destroy(): void {\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}\n\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B<_SHA512> {\n protected Ah: number = SHA512_IV[0] | 0;\n protected Al: number = SHA512_IV[1] | 0;\n protected Bh: number = SHA512_IV[2] | 0;\n protected Bl: number = SHA512_IV[3] | 0;\n protected Ch: number = SHA512_IV[4] | 0;\n protected Cl: number = SHA512_IV[5] | 0;\n protected Dh: number = SHA512_IV[6] | 0;\n protected Dl: number = SHA512_IV[7] | 0;\n protected Eh: number = SHA512_IV[8] | 0;\n protected El: number = SHA512_IV[9] | 0;\n protected Fh: number = SHA512_IV[10] | 0;\n protected Fl: number = SHA512_IV[11] | 0;\n protected Gh: number = SHA512_IV[12] | 0;\n protected Gl: number = SHA512_IV[13] | 0;\n protected Hh: number = SHA512_IV[14] | 0;\n protected Hl: number = SHA512_IV[15] | 0;\n\n constructor() {\n super(64);\n }\n}\n\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B<_SHA384> {\n protected Ah: number = SHA384_IV[0] | 0;\n protected Al: number = SHA384_IV[1] | 0;\n protected Bh: number = SHA384_IV[2] | 0;\n protected Bl: number = SHA384_IV[3] | 0;\n protected Ch: number = SHA384_IV[4] | 0;\n protected Cl: number = SHA384_IV[5] | 0;\n protected Dh: number = SHA384_IV[6] | 0;\n protected Dl: number = SHA384_IV[7] | 0;\n protected Eh: number = SHA384_IV[8] | 0;\n protected El: number = SHA384_IV[9] | 0;\n protected Fh: number = SHA384_IV[10] | 0;\n protected Fl: number = SHA384_IV[11] | 0;\n protected Gh: number = SHA384_IV[12] | 0;\n protected Gl: number = SHA384_IV[13] | 0;\n protected Hh: number = SHA384_IV[14] | 0;\n protected Hl: number = SHA384_IV[15] | 0;\n\n constructor() {\n super(48);\n }\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\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\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]);\n\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B<_SHA512_224> {\n protected Ah: number = T224_IV[0] | 0;\n protected Al: number = T224_IV[1] | 0;\n protected Bh: number = T224_IV[2] | 0;\n protected Bl: number = T224_IV[3] | 0;\n protected Ch: number = T224_IV[4] | 0;\n protected Cl: number = T224_IV[5] | 0;\n protected Dh: number = T224_IV[6] | 0;\n protected Dl: number = T224_IV[7] | 0;\n protected Eh: number = T224_IV[8] | 0;\n protected El: number = T224_IV[9] | 0;\n protected Fh: number = T224_IV[10] | 0;\n protected Fl: number = T224_IV[11] | 0;\n protected Gh: number = T224_IV[12] | 0;\n protected Gl: number = T224_IV[13] | 0;\n protected Hh: number = T224_IV[14] | 0;\n protected Hl: number = T224_IV[15] | 0;\n\n constructor() {\n super(28);\n }\n}\n\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B<_SHA512_256> {\n protected Ah: number = T256_IV[0] | 0;\n protected Al: number = T256_IV[1] | 0;\n protected Bh: number = T256_IV[2] | 0;\n protected Bl: number = T256_IV[3] | 0;\n protected Ch: number = T256_IV[4] | 0;\n protected Cl: number = T256_IV[5] | 0;\n protected Dh: number = T256_IV[6] | 0;\n protected Dl: number = T256_IV[7] | 0;\n protected Eh: number = T256_IV[8] | 0;\n protected El: number = T256_IV[9] | 0;\n protected Fh: number = T256_IV[10] | 0;\n protected Fl: number = T256_IV[11] | 0;\n protected Gh: number = T256_IV[12] | 0;\n protected Gl: number = T256_IV[13] | 0;\n protected Hh: number = T256_IV[14] | 0;\n protected Hl: number = T256_IV[15] | 0;\n\n constructor() {\n super(32);\n }\n}\n\n/**\n * SHA2-256 hash function from RFC 4634. In JS it's the fastest: even faster than Blake3. Some info:\n *\n * - Trying 2^128 hashes would get 50% chance of collision, using birthday attack.\n * - BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n * - Each sha256 hash is executing 2^18 bit operations.\n * - Good 2024 ASICs can do 200Th/sec with 3500 watts of power, corresponding to 2^36 hashes/joule.\n */\nexport const sha256: CHash<_SHA256> = /* @__PURE__ */ createHasher(\n () => new _SHA256(),\n /* @__PURE__ */ oidNist(0x01)\n);\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224: CHash<_SHA224> = /* @__PURE__ */ createHasher(\n () => new _SHA224(),\n /* @__PURE__ */ oidNist(0x04)\n);\n\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512: CHash<_SHA512> = /* @__PURE__ */ createHasher(\n () => new _SHA512(),\n /* @__PURE__ */ oidNist(0x03)\n);\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384: CHash<_SHA384> = /* @__PURE__ */ createHasher(\n () => new _SHA384(),\n /* @__PURE__ */ oidNist(0x02)\n);\n\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: CHash<_SHA512_256> = /* @__PURE__ */ createHasher(\n () => new _SHA512_256(),\n /* @__PURE__ */ oidNist(0x06)\n);\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: CHash<_SHA512_224> = /* @__PURE__ */ createHasher(\n () => new _SHA512_224(),\n /* @__PURE__ */ oidNist(0x05)\n);\n", "/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView, type Hash } from './utils.ts';\n\n/** Choice: a ? b : c */\nexport function Chi(a: number, b: number, c: number): number {\n return (a & b) ^ (~a & c);\n}\n\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a: number, b: number, c: number): number {\n return (a & b) ^ (a & c) ^ (b & c);\n}\n\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport abstract class HashMD<T extends HashMD<T>> implements Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n\n readonly blockLen: number;\n readonly outputLen: number;\n readonly padOffset: number;\n readonly isLE: boolean;\n\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(blockLen: number, outputLen: number, padOffset: number, isLE: boolean) {\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: Uint8Array): this {\n aexists(this);\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) 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: Uint8Array): void {\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++) 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 view.setBigUint64(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 must be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen must be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest(): Uint8Array {\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?: T): T {\n to ||= new (this.constructor as any)() as T;\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) to.buffer.set(buffer);\n return to as unknown as any;\n }\n clone(): T {\n return this._cloneInto();\n }\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\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV: Uint32Array = /* @__PURE__ */ Uint32Array.from([\n 0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n", "/**\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);\n\nfunction fromBig(\n n: bigint,\n le = false\n): {\n h: number;\n l: number;\n} {\n if (le) 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}\n\nfunction split(lst: bigint[], le = false): Uint32Array[] {\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}\n\nconst toBig = (h: number, l: number): bigint => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h: number, _l: number, s: number): number => h >>> s;\nconst shrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h: number, l: number, s: number): number => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h: number, l: number, s: number): number => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h: number, l: number, s: number): number => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h: number, l: number, s: number): number => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h: number, l: number): number => l;\nconst rotr32L = (h: number, _l: number): number => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h: number, l: number, s: number): number => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h: number, l: number, s: number): number => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h: number, l: number, s: number): number => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h: number, l: number, s: number): number => (h << (s - 32)) | (l >>> (64 - s));\n\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(\n Ah: number,\n Al: number,\n Bh: number,\n Bl: number\n): {\n h: number;\n l: number;\n} {\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: number, Bl: number, Cl: number): number => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low: number, Ah: number, Bh: number, Ch: number): number =>\n (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al: number, Bl: number, Cl: number, Dl: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number): number =>\n (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al: number, Bl: number, Cl: number, Dl: number, El: number): number =>\n (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number): number =>\n (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n\n// prettier-ignore\nexport {\n add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig\n};\n// prettier-ignore\nconst u64: { fromBig: typeof fromBig; split: typeof split; toBig: (h: number, l: number) => bigint; shrSH: (h: number, _l: number, s: number) => number; shrSL: (h: number, l: number, s: number) => number; rotrSH: (h: number, l: number, s: number) => number; rotrSL: (h: number, l: number, s: number) => number; rotrBH: (h: number, l: number, s: number) => number; rotrBL: (h: number, l: number, s: number) => number; rotr32H: (_h: number, l: number) => number; rotr32L: (h: number, _l: number) => number; rotlSH: (h: number, l: number, s: number) => number; rotlSL: (h: number, l: number, s: number) => number; rotlBH: (h: number, l: number, s: number) => number; rotlBL: (h: number, l: number, s: number) => number; add: typeof add; add3L: (Al: number, Bl: number, Cl: number) => number; add3H: (low: number, Ah: number, Bh: number, Ch: number) => number; add4L: (Al: number, Bl: number, Cl: number, Dl: number) => number; add4H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number) => number; add5H: (low: number, Ah: number, Bh: number, Ch: number, Dh: number, Eh: number) => number; add5L: (Al: number, Bl: number, Cl: number, Dl: number, El: number) => number; } = {\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", "export const wordlist = `abandon\nability\nable\nabout\nabove\nabsent\nabsorb\nabstract\nabsurd\nabuse\naccess\naccident\naccount\naccuse\nachieve\nacid\nacoustic\nacquire\nacross\nact\naction\nactor\nactress\nactual\nadapt\nadd\naddict\naddress\nadjust\nadmit\nadult\nadvance\nadvice\naerobic\naffair\nafford\nafraid\nagain\nage\nagent\nagree\nahead\naim\nair\nairport\naisle\nalarm\nalbum\nalcohol\nalert\nalien\nall\nalley\nallow\nalmost\nalone\nalpha\nalready\nalso\nalter\nalways\namateur\namazing\namong\namount\namused\nanalyst\nanchor\nancient\nanger\nangle\nangry\nanimal\nankle\nannounce\nannual\nanother\nanswer\nantenna\nantique\nanxiety\nany\napart\napology\nappear\napple\napprove\napril\narch\narctic\narea\narena\nargue\narm\narmed\narmor\narmy\naround\narrange\narrest\narrive\narrow\nart\nartefact\nartist\nartwork\nask\naspect\nassault\nasset\nassist\nassume\nasthma\nathlete\natom\nattack\nattend\nattitude\nattract\nauction\naudit\naugust\naunt\nauthor\nauto\nautumn\naverage\navocado\navoid\nawake\naware\naway\nawesome\nawful\nawkward\naxis\nbaby\nbachelor\nbacon\nbadge\nbag\nbalance\nbalcony\nball\nbamboo\nbanana\nbanner\nbar\nbarely\nbargain\nbarrel\nbase\nbasic\nbasket\nbattle\nbeach\nbean\nbeauty\nbecause\nbecome\nbeef\nbefore\nbegin\nbehave\nbehind\nbelieve\nbelow\nbelt\nbench\nbenefit\nbest\nbetray\nbetter\nbetween\nbeyond\nbicycle\nbid\nbike\nbind\nbiology\nbird\nbirth\nbitter\nblack\nblade\nblame\nblanket\nblast\nbleak\nbless\nblind\nblood\nblossom\nblouse\nblue\nblur\nblush\nboard\nboat\nbody\nboil\nbomb\nbone\nbonus\nbook\nboost\nborder\nboring\nborrow\nboss\nbottom\nbounce\nbox\nboy\nbracket\nbrain\nbrand\nbrass\nbrave\nbread\nbreeze\nbrick\nbridge\nbrief\nbright\nbring\nbrisk\nbroccoli\nbroken\nbronze\nbroom\nbrother\nbrown\nbrush\nbubble\nbuddy\nbudget\nbuffalo\nbuild\nbulb\nbulk\nbullet\nbundle\nbunker\nburden\nburger\nburst\nbus\nbusiness\nbusy\nbutter\nbuyer\nbuzz\ncabbage\ncabin\ncable\ncactus\ncage\ncake\ncall\ncalm\ncamera\ncamp\ncan\ncanal\ncancel\ncandy\ncannon\ncanoe\ncanvas\ncanyon\ncapable\ncapital\ncaptain\ncar\ncarbon\ncard\ncargo\ncarpet\ncarry\ncart\ncase\ncash\ncasino\ncastle\ncasual\ncat\ncatalog\ncatch\ncategory\ncattle\ncaught\ncause\ncaution\ncave\nceiling\ncelery\ncement\ncensus\ncentury\ncereal\ncertain\nchair\nchalk\nchampion\nchange\nchaos\nchapter\ncharge\nchase\nchat\ncheap\ncheck\ncheese\nchef\ncherry\nchest\nchicken\nchief\nchild\nchimney\nchoice\nchoose\nchronic\nchuckle\nchunk\nchurn\ncigar\ncinnamon\ncircle\ncitizen\ncity\ncivil\nclaim\nclap\nclarify\nclaw\nclay\nclean\nclerk\nclever\nclick\nclient\ncliff\nclimb\nclinic\nclip\nclock\nclog\nclose\ncloth\ncloud\nclown\nclub\nclump\ncluster\nclutch\ncoach\ncoast\ncoconut\ncode\ncoffee\ncoil\ncoin\ncollect\ncolor\ncolumn\ncombine\ncome\ncomfort\ncomic\ncommon\ncompany\nconcert\nconduct\nconfirm\ncongress\nconnect\nconsider\ncontrol\nconvince\ncook\ncool\ncopper\ncopy\ncoral\ncore\ncorn\ncorrect\ncost\ncotton\ncouch\ncountry\ncouple\ncourse\ncousin\ncover\ncoyote\ncrack\ncradle\ncraft\ncram\ncrane\ncrash\ncrater\ncrawl\ncrazy\ncream\ncredit\ncreek\ncrew\ncricket\ncrime\ncrisp\ncritic\ncrop\ncross\ncrouch\ncrowd\ncrucial\ncruel\ncruise\ncrumble\ncrunch\ncrush\ncry\ncrystal\ncube\nculture\ncup\ncupboard\ncurious\ncurrent\ncurtain\ncurve\ncushion\ncustom\ncute\ncycle\ndad\ndamage\ndamp\ndance\ndanger\ndaring\ndash\ndaughter\ndawn\nday\ndeal\ndebate\ndebris\ndecade\ndecember\ndecide\ndecline\ndecorate\ndecrease\ndeer\ndefense\ndefine\ndefy\ndegree\ndelay\ndeliver\ndemand\ndemise\ndenial\ndentist\ndeny\ndepart\ndepend\ndeposit\ndepth\ndeputy\nderive\ndescribe\ndesert\ndesign\ndesk\ndespair\ndestroy\ndetail\ndetect\ndevelop\ndevice\ndevote\ndiagram\ndial\ndiamond\ndiary\ndice\ndiesel\ndiet\ndiffer\ndigital\ndignity\ndilemma\ndinner\ndinosaur\ndirect\ndirt\ndisagree\ndiscover\ndisease\ndish\ndismiss\ndisorder\ndisplay\ndistance\ndivert\ndivide\ndivorce\ndizzy\ndoctor\ndocument\ndog\ndoll\ndolphin\ndomain\ndonate\ndonkey\ndonor\ndoor\ndose\ndouble\ndove\ndraft\ndragon\ndrama\ndrastic\ndraw\ndream\ndress\ndrift\ndrill\ndrink\ndrip\ndrive\ndrop\ndrum\ndry\nduck\ndumb\ndune\nduring\ndust\ndutch\nduty\ndwarf\ndynamic\neager\neagle\nearly\nearn\nearth\neasily\neast\neasy\necho\necology\neconomy\nedge\nedit\neducate\neffort\negg\neight\neither\nelbow\nelder\nelectric\nelegant\nelement\nelephant\nelevator\nelite\nelse\nembark\nembody\nembrace\nemerge\nemotion\nemploy\nempower\nempty\nenable\nenact\nend\nendless\nendorse\nenemy\nenergy\nenforce\nengage\nengine\nenhance\nenjoy\nenlist\nenough\nenrich\nenroll\nensure\nenter\nentire\nentry\nenvelope\nepisode\nequal\nequip\nera\nerase\nerode\nerosion\nerror\nerupt\nescape\nessay\nessence\nestate\neternal\nethics\nevidence\nevil\nevoke\nevolve\nexact\nexample\nexcess\nexchange\nexcite\nexclude\nexcuse\nexecute\nexercise\nexhaust\nexhibit\nexile\nexist\nexit\nexotic\nexpand\nexpect\nexpire\nexplain\nexpose\nexpress\nextend\nextra\neye\neyebrow\nfabric\nface\nfaculty\nfade\nfaint\nfaith\nfall\nfalse\nfame\nfamily\nfamous\nfan\nfancy\nfantasy\nfarm\nfashion\nfat\nfatal\nfather\nfatigue\nfault\nfavorite\nfeature\nfebruary\nfederal\nfee\nfeed\nfeel\nfemale\nfence\nfestival\nfetch\nfever\nfew\nfiber\nfiction\nfield\nfigure\nfile\nfilm\nfilter\nfinal\nfind\nfine\nfinger\nfinish\nfire\nfirm\nfirst\nfiscal\nfish\nfit\nfitness\nfix\nflag\nflame\nflash\nflat\nflavor\nflee\nflight\nflip\nfloat\nflock\nfloor\nflower\nfluid\nflush\nfly\nfoam\nfocus\nfog\nfoil\nfold\nfollow\nfood\nfoot\nforce\nforest\nforget\nfork\nfortune\nforum\nforward\nfossil\nfoster\nfound\nfox\nfragile\nframe\nfrequent\nfresh\nfriend\nfringe\nfrog\nfront\nfrost\nfrown\nfrozen\nfruit\nfuel\nfun\nfunny\nfurnace\nfury\nfuture\ngadget\ngain\ngalaxy\ngallery\ngame\ngap\ngarage\ngarbage\ngarden\ngarlic\ngarment\ngas\ngasp\ngate\ngather\ngauge\ngaze\ngeneral\ngenius\ngenre\ngentle\ngenuine\ngesture\nghost\ngiant\ngift\ngiggle\nginger\ngiraffe\ngirl\ngive\nglad\nglance\nglare\nglass\nglide\nglimpse\nglobe\ngloom\nglory\nglove\nglow\nglue\ngoat\ngoddess\ngold\ngood\ngoose\ngorilla\ngospel\ngossip\ngovern\ngown\ngrab\ngrace\ngrain\ngrant\ngrape\ngrass\ngravity\ngreat\ngreen\ngrid\ngrief\ngrit\ngrocery\ngroup\ngrow\ngrunt\nguard\nguess\nguide\nguilt\nguitar\ngun\ngym\nhabit\nhair\nhalf\nhammer\nhamster\nhand\nhappy\nharbor\nhard\nharsh\nharvest\nhat\nhave\nhawk\nhazard\nhead\nhealth\nheart\nheavy\nhedgehog\nheight\nhello\nhelmet\nhelp\nhen\nhero\nhidden\nhigh\nhill\nhint\nhip\nhire\nhistory\nhobby\nhockey\nhold\nhole\nholiday\nhollow\nhome\nhoney\nhood\nhope\nhorn\nhorror\nhorse\nhospital\nhost\nhotel\nhour\nhover\nhub\nhuge\nhuman\nhumble\nhumor\nhundred\nhungry\nhunt\nhurdle\nhurry\nhurt\nhusband\nhybrid\nice\nicon\nidea\nidentify\nidle\nignore\nill\nillegal\nillness\nimage\nimitate\nimmense\nimmune\nimpact\nimpose\nimprove\nimpulse\ninch\ninclude\nincome\nincrease\nindex\nindicate\nindoor\nindustry\ninfant\ninflict\ninform\ninhale\ninherit\ninitial\ninject\ninjury\ninmate\ninner\ninnocent\ninput\ninquiry\ninsane\ninsect\ninside\ninspire\ninstall\nintact\ninterest\ninto\ninvest\ninvite\ninvolve\niron\nisland\nisolate\nissue\nitem\nivory\njacket\njaguar\njar\njazz\njealous\njeans\njelly\njewel\njob\njoin\njoke\njourney\njoy\njudge\njuice\njump\njungle\njunior\njunk\njust\nkangaroo\nkeen\nkeep\nketchup\nkey\nkick\nkid\nkidney\nkind\nkingdom\nkiss\nkit\nkitchen\nkite\nkitten\nkiwi\nknee\nknife\nknock\nknow\nlab\nlabel\nlabor\nladder\nlady\nlake\nlamp\nlanguage\nlaptop\nlarge\nlater\nlatin\nlaugh\nlaundry\nlava\nlaw\nlawn\nlawsuit\nlayer\nlazy\nleader\nleaf\nlearn\nleave\nlecture\nleft\nleg\nlegal\nlegend\nleisure\nlemon\nlend\nlength\nlens\nleopard\nlesson\nletter\nlevel\nliar\nliberty\nlibrary\nlicense\nlife\nlift\nlight\nlike\nlimb\nlimit\nlink\nlion\nliquid\nlist\nlittle\nlive\nlizard\nload\nloan\nlobster\nlocal\nlock\nlogic\nlonely\nlong\nloop\nlottery\nloud\nlounge\nlove\nloyal\nlucky\nluggage\nlumber\nlunar\nlunch\nluxury\nlyrics\nmachine\nmad\nmagic\nmagnet\nmaid\nmail\nmain\nmajor\nmake\nmammal\nman\nmanage\nmandate\nmango\nmansion\nmanual\nmaple\nmarble\nmarch\nmargin\nmarine\nmarket\nmarriage\nmask\nmass\nmaster\nmatch\nmaterial\nmath\nmatrix\nmatter\nmaximum\nmaze\nmeadow\nmean\nmeasure\nmeat\nmechanic\nmedal\nmedia\nmelody\nmelt\nmember\nmemory\nmention\nmenu\nmercy\nmerge\nmerit\nmerry\nmesh\nmessage\nmetal\nmethod\nmiddle\nmidnight\nmilk\nmillion\nmimic\nmind\nminimum\nminor\nminute\nmiracle\nmirror\nmisery\nmiss\nmistake\nmix\nmixed\nmixture\nmobile\nmodel\nmodify\nmom\nmoment\nmonitor\nmonkey\nmonster\nmonth\nmoon\nmoral\nmore\nmorning\nmosquito\nmother\nmotion\nmotor\nmountain\nmouse\nmove\nmovie\nmuch\nmuffin\nmule\nmultiply\nmuscle\nmuseum\nmushroom\nmusic\nmust\nmutual\nmyself\nmystery\nmyth\nnaive\nname\nnapkin\nnarrow\nnasty\nnation\nnature\nnear\nneck\nneed\nnegative\nneglect\nneither\nnephew\nnerve\nnest\nnet\nnetwork\nneutral\nnever\nnews\nnext\nnice\nnight\nnoble\nnoise\nnominee\nnoodle\nnormal\nnorth\nnose\nnotable\nnote\nnothing\nnotice\nnovel\nnow\nnuclear\nnumber\nnurse\nnut\noak\nobey\nobject\noblige\nobscure\nobserve\nobtain\nobvious\noccur\nocean\noctober\nodor\noff\noffer\noffice\noften\noil\nokay\nold\nolive\nolympic\nomit\nonce\none\nonion\nonline\nonly\nopen\nopera\nopinion\noppose\noption\norange\norbit\norchard\norder\nordinary\norgan\norient\noriginal\norphan\nostrich\nother\noutdoor\nouter\noutput\noutside\noval\noven\nover\nown\nowner\noxygen\noyster\nozone\npact\npaddle\npage\npair\npalace\npalm\npanda\npanel\npanic\npanther\npaper\nparade\nparent\npark\nparrot\nparty\npass\npatch\npath\npatient\npatrol\npattern\npause\npave\npayment\npeace\npeanut\npear\npeasant\npelican\npen\npenalty\npencil\npeople\npepper\nperfect\npermit\nperson\npet\nphone\nphoto\nphrase\nphysical\npiano\npicnic\npicture\npiece\npig\npigeon\npill\npilot\npink\npioneer\npipe\npistol\npitch\npizza\nplace\nplanet\nplastic\nplate\nplay\nplease\npledge\npluck\nplug\nplunge\npoem\npoet\npoint\npolar\npole\npolice\npond\npony\npool\npopular\nportion\nposition\npossible\npost\npotato\npottery\npoverty\npowder\npower\npractice\npraise\npredict\nprefer\nprepare\npresent\npretty\nprevent\nprice\npride\nprimary\nprint\npriority\nprison\nprivate\nprize\nproblem\nprocess\nproduce\nprofit\nprogram\nproject\npromote\nproof\nproperty\nprosper\nprotect\nproud\nprovide\npublic\npudding\npull\npulp\npulse\npumpkin\npunch\npupil\npuppy\npurchase\npurity\npurpose\npurse\npush\nput\npuzzle\npyramid\nquality\nquantum\nquarter\nquestion\nquick\nquit\nquiz\nquote\nrabbit\nraccoon\nrace\nrack\nradar\nradio\nrail\nrain\nraise\nrally\nramp\nranch\nrandom\nrange\nrapid\nrare\nrate\nrather\nraven\nraw\nrazor\nready\nreal\nreason\nrebel\nrebuild\nrecall\nreceive\nrecipe\nrecord\nrecycle\nreduce\nreflect\nreform\nrefuse\nregion\nregret\nregular\nreject\nrelax\nrelease\nrelief\nrely\nremain\nremember\nremind\nremove\nrender\nrenew\nrent\nreopen\nrepair\nrepeat\nreplace\nreport\nrequire\nrescue\nresemble\nresist\nresource\nresponse\nresult\nretire\nretreat\nreturn\nreunion\nreveal\nreview\nreward\nrhythm\nrib\nribbon\nrice\nrich\nride\nridge\nrifle\nright\nrigid\nring\nriot\nripple\nrisk\nritual\nrival\nriver\nroad\nroast\nrobot\nrobust\nrocket\nromance\nroof\nrookie\nroom\nrose\nrotate\nrough\nround\nroute\nroyal\nrubber\nrude\nrug\nrule\nrun\nrunway\nrural\nsad\nsaddle\nsadness\nsafe\nsail\nsalad\nsalmon\nsalon\nsalt\nsalute\nsame\nsample\nsand\nsatisfy\nsatoshi\nsauce\nsausage\nsave\nsay\nscale\nscan\nscare\nscatter\nscene\nscheme\nschool\nscience\nscissors\nscorpion\nscout\nscrap\nscreen\nscript\nscrub\nsea\nsearch\nseason\nseat\nsecond\nsecret\nsection\nsecurity\nseed\nseek\nsegment\nselect\nsell\nseminar\nsenior\nsense\nsentence\nseries\nservice\nsession\nsettle\nsetup\nseven\nshadow\nshaft\nshallow\nshare\nshed\nshell\nsheriff\nshield\nshift\nshine\nship\nshiver\nshock\nshoe\nshoot\nshop\nshort\nshoulder\nshove\nshrimp\nshrug\nshuffle\nshy\nsibling\nsick\nside\nsiege\nsight\nsign\nsilent\nsilk\nsilly\nsilver\nsimilar\nsimple\nsince\nsing\nsiren\nsister\nsituate\nsix\nsize\nskate\nsketch\nski\nskill\nskin\nskirt\nskull\nslab\nslam\nsleep\nslender\nslice\nslide\nslight\nslim\nslogan\nslot\nslow\nslush\nsmall\nsmart\nsmile\nsmoke\nsmooth\nsnack\nsnake\nsnap\nsniff\nsnow\nsoap\nsoccer\nsocial\nsock\nsoda\nsoft\nsolar\nsoldier\nsolid\nsolution\nsolve\nsomeone\nsong\nsoon\nsorry\nsort\nsoul\nsound\nsoup\nsource\nsouth\nspace\nspare\nspatial\nspawn\nspeak\nspecial\nspeed\nspell\nspend\nsphere\nspice\nspider\nspike\nspin\nspirit\nsplit\nspoil\nsponsor\nspoon\nsport\nspot\nspray\nspread\nspring\nspy\nsquare\nsqueeze\nsquirrel\nstable\nstadium\nstaff\nstage\nstairs\nstamp\nstand\nstart\nstate\nstay\nsteak\nsteel\nstem\nstep\nstereo\nstick\nstill\nsting\nstock\nstomach\nstone\nstool\nstory\nstove\nstrategy\nstreet\nstrike\nstrong\nstruggle\nstudent\nstuff\nstumble\nstyle\nsubject\nsubmit\nsubway\nsuccess\nsuch\nsudden\nsuffer\nsugar\nsuggest\nsuit\nsummer\nsun\nsunny\nsunset\nsuper\nsupply\nsupreme\nsure\nsurface\nsurge\nsurprise\nsurround\nsurvey\nsuspect\nsustain\nswallow\nswamp\nswap\nswarm\nswear\nsweet\nswift\nswim\nswing\nswitch\nsword\nsymbol\nsymptom\nsyrup\nsystem\ntable\ntackle\ntag\ntail\ntalent\ntalk\ntank\ntape\ntarget\ntask\ntaste\ntattoo\ntaxi\nteach\nteam\ntell\nten\ntenant\ntennis\ntent\nterm\ntest\ntext\nthank\nthat\ntheme\nthen\ntheory\nthere\nthey\nthing\nthis\nthought\nthree\nthrive\nthrow\nthumb\nthunder\nticket\ntide\ntiger\ntilt\ntimber\ntime\ntiny\ntip\ntired\ntissue\ntitle\ntoast\ntobacco\ntoday\ntoddler\ntoe\ntogether\ntoilet\ntoken\ntomato\ntomorrow\ntone\ntongue\ntonight\ntool\ntooth\ntop\ntopic\ntopple\ntorch\ntornado\ntortoise\ntoss\ntotal\ntourist\ntoward\ntower\ntown\ntoy\ntrack\ntrade\ntraffic\ntragic\ntrain\ntransfer\ntrap\ntrash\ntravel\ntray\ntreat\ntree\ntrend\ntrial\ntribe\ntrick\ntrigger\ntrim\ntrip\ntrophy\ntrouble\ntruck\ntrue\ntruly\ntrumpet\ntrust\ntruth\ntry\ntube\ntuition\ntumble\ntuna\ntunnel\nturkey\nturn\nturtle\ntwelve\ntwenty\ntwice\ntwin\ntwist\ntwo\ntype\ntypical\nugly\numbrella\nunable\nunaware\nuncle\nuncover\nunder\nundo\nunfair\nunfold\nunhappy\nuniform\nunique\nunit\nuniverse\nunknown\nunlock\nuntil\nunusual\nunveil\nupdate\nupgrade\nuphold\nupon\nupper\nupset\nurban\nurge\nusage\nuse\nused\nuseful\nuseless\nusual\nutility\nvacant\nvacuum\nvague\nvalid\nvalley\nvalve\nvan\nvanish\nvapor\nvarious\nvast\nvault\nvehicle\nvelvet\nvendor\nventure\nvenue\nverb\nverify\nversion\nvery\nvessel\nveteran\nviable\nvibrant\nvicious\nvictory\nvideo\nview\nvillage\nvintage\nviolin\nvirtual\nvirus\nvisa\nvisit\nvisual\nvital\nvivid\nvocal\nvoice\nvoid\nvolcano\nvolume\nvote\nvoyage\nwage\nwagon\nwait\nwalk\nwall\nwalnut\nwant\nwarfare\nwarm\nwarrior\nwash\nwasp\nwaste\nwater\nwave\nway\nwealth\nweapon\nwear\nweasel\nweather\nweb\nwedding\nweekend\nweird\nwelcome\nwest\nwet\nwhale\nwhat\nwheat\nwheel\nwhen\nwhere\nwhip\nwhisper\nwide\nwidth\nwife\nwild\nwill\nwin\nwindow\nwine\nwing\nwink\nwinner\nwinter\nwire\nwisdom\nwise\nwish\nwitness\nwolf\nwoman\nwonder\nwood\nwool\nword\nwork\nworld\nworry\nworth\nwrap\nwreck\nwrestle\nwrist\nwrite\nwrong\nyard\nyear\nyellow\nyou\nyoung\nyouth\nzebra\nzero\nzone\nzoo`.split('\\n');\n", "/**\n * Bitcoin WIF (Wallet Import Format) utilities\n *\n * Encodes/decodes private keys in Bitcoin's standard format.\n * Supports both compressed and uncompressed formats.\n *\n * Reference: https://en.bitcoin.it/wiki/Wallet_import_format\n */\nimport { sha256 } from '@noble/hashes/sha256';\n// Base58 alphabet (Bitcoin)\nconst BASE58_ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\n/**\n * Encode bytes to Base58.\n */\nfunction base58Encode(data) {\n let num = 0n;\n for (const byte of data) {\n num = num * 256n + BigInt(byte);\n }\n let encoded = '';\n while (num > 0n) {\n const remainder = Number(num % 58n);\n encoded = BASE58_ALPHABET[remainder] + encoded;\n num = num / 58n;\n }\n // Preserve leading zeros\n for (const byte of data) {\n if (byte !== 0)\n break;\n encoded = '1' + encoded;\n }\n return encoded;\n}\n/**\n * Decode Base58 string to bytes.\n */\nfunction base58Decode(str) {\n let num = 0n;\n for (const char of str) {\n const index = BASE58_ALPHABET.indexOf(char);\n if (index === -1) {\n throw new Error(`Invalid Base58 character: ${char}`);\n }\n num = num * 58n + BigInt(index);\n }\n // Convert to bytes\n const bytes = [];\n while (num > 0n) {\n bytes.unshift(Number(num % 256n));\n num = num / 256n;\n }\n // Preserve leading zeros\n for (const char of str) {\n if (char !== '1')\n break;\n bytes.unshift(0);\n }\n return new Uint8Array(bytes);\n}\n/**\n * Encode a private key to WIF format.\n *\n * @param privateKey 32-byte private key\n * @param compressed Whether to indicate compressed public key (default: true)\n * @param network 'mainnet' or 'testnet' (default: 'mainnet')\n * @returns WIF-encoded private key string\n */\nexport function encodeWIF(privateKey, compressed = true, network = 'mainnet') {\n if (privateKey.length !== 32) {\n throw new Error('Private key must be 32 bytes');\n }\n // Version byte: 0x80 for mainnet, 0xEF for testnet\n const version = network === 'mainnet' ? 0x80 : 0xEF;\n // Build payload: version + key + (optional compression flag)\n const payload = new Uint8Array(compressed ? 34 : 33);\n payload[0] = version;\n payload.set(privateKey, 1);\n if (compressed) {\n payload[33] = 0x01; // Compression flag\n }\n // Checksum: first 4 bytes of double SHA256\n const hash1 = sha256(payload);\n const hash2 = sha256(hash1);\n const checksum = hash2.slice(0, 4);\n // Combine payload + checksum\n const data = new Uint8Array(payload.length + 4);\n data.set(payload);\n data.set(checksum, payload.length);\n return base58Encode(data);\n}\n/**\n * Decode a WIF-encoded private key.\n *\n * @param wif WIF string\n * @returns Object with privateKey, compressed flag, and network\n * @throws If WIF is invalid or checksum fails\n */\nexport function decodeWIF(wif) {\n const data = base58Decode(wif);\n if (data.length !== 37 && data.length !== 38) {\n throw new Error('Invalid WIF length');\n }\n // Extract checksum\n const payload = data.slice(0, -4);\n const checksum = data.slice(-4);\n // Verify checksum\n const hash1 = sha256(payload);\n const hash2 = sha256(hash1);\n const expectedChecksum = hash2.slice(0, 4);\n if (!checksum.every((byte, i) => byte === expectedChecksum[i])) {\n throw new Error('Invalid WIF checksum');\n }\n // Extract version\n const version = payload[0];\n const network = version === 0x80 ? 'mainnet' : version === 0xEF ? 'testnet' : null;\n if (!network) {\n throw new Error(`Invalid WIF version byte: 0x${version.toString(16)}`);\n }\n // Extract private key and compression flag\n const compressed = payload.length === 34 && payload[33] === 0x01;\n const privateKey = payload.slice(1, 33);\n return {\n privateKey,\n compressed,\n network,\n };\n}\n", "import { bytesToHex, hexToBytes } from '../utils.js';\n// Lazy-load the Dilithium library\nlet dilithiumLib = null;\nasync function getDilithium() {\n if (!dilithiumLib) {\n const module = await import('dilithium-crystals');\n // dilithium-crystals exports a default object, not named exports\n dilithiumLib = module.default || module;\n }\n return dilithiumLib;\n}\nconst ML_DSA_SIZES = {\n 'ml-dsa-44': { publicKey: 1312, privateKey: 2560, signature: 2420 },\n 'ml-dsa-65': { publicKey: 1952, privateKey: 4032, signature: 3309 },\n 'ml-dsa-87': { publicKey: 2592, privateKey: 4864, signature: 4627 },\n};\n/**\n * Base ML-DSA implementation\n * Note: dilithium-crystals provides Dilithium5 (ML-DSA-87)\n * For production use with ML-DSA-44/65, consider using a library like pqc-kyber-ml-dsa\n * This implementation uses ML-DSA-87 for all variants as a placeholder.\n */\nclass BaseMlDsaSuite {\n version = '1.0.0';\n capabilities = {};\n async generateKeypair() {\n try {\n const dilithium = await getDilithium();\n const keypair = await dilithium.keyPair();\n return {\n publicKey: new Uint8Array(keypair.publicKey),\n privateKey: new Uint8Array(keypair.privateKey),\n };\n }\n catch (error) {\n throw new Error(`${this.suiteId} key generation failed: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n async sign(privateKey, message) {\n try {\n const dilithium = await getDilithium();\n const signature = await dilithium.signDetached(Buffer.from(message), Buffer.from(privateKey));\n return new Uint8Array(signature);\n }\n catch (error) {\n throw new Error(`${this.suiteId} signing failed: ${error instanceof Error ? error.message : String(error)}`);\n }\n }\n async verify(publicKey, message, signature) {\n try {\n const dilithium = await getDilithium();\n return await dilithium.verifyDetached(Buffer.from(signature), Buffer.from(message), Buffer.from(publicKey));\n }\n catch (error) {\n // Verification failures should return false, not throw\n return false;\n }\n }\n exportPublicKey(pub) {\n return bytesToHex(pub);\n }\n importPublicKey(encoded) {\n const bytes = hexToBytes(encoded);\n if (bytes.length !== this.sizes.publicKey) {\n throw new Error(`${this.suiteId} public key must be ${this.sizes.publicKey} bytes, got ${bytes.length}`);\n }\n return bytes;\n }\n exportPrivateKey(priv) {\n return bytesToHex(priv);\n }\n importPrivateKey(encoded) {\n const bytes = hexToBytes(encoded);\n if (bytes.length !== this.sizes.privateKey) {\n throw new Error(`${this.suiteId} private key must be ${this.sizes.privateKey} bytes, got ${bytes.length}`);\n }\n return bytes;\n }\n}\n/**\n * ML-DSA-44 Suite\n * NIST Security Level 2 (equivalent to AES-128)\n * Fastest, smallest signatures\n *\n * Public key: 1312 bytes\n * Private key: 2560 bytes\n * Signature: ~2420 bytes\n */\nexport class MlDsa44Suite extends BaseMlDsaSuite {\n suiteId = 'ml-dsa-44';\n get sizes() {\n return ML_DSA_SIZES['ml-dsa-44'];\n }\n}\n/**\n * ML-DSA-65 Suite (Recommended default)\n * NIST Security Level 3 (equivalent to AES-192)\n * Balanced security and performance\n *\n * Public key: 1952 bytes\n * Private key: 4032 bytes\n * Signature: ~3309 bytes\n *\n * Note: Currently uses ML-DSA-87 implementation from dilithium-crystals\n * as a compatible placeholder. For production, use a library with native ML-DSA-65.\n */\nexport class MlDsa65Suite extends BaseMlDsaSuite {\n suiteId = 'ml-dsa-65';\n get sizes() {\n return ML_DSA_SIZES['ml-dsa-65'];\n }\n}\n/**\n * ML-DSA-87 Suite (Maximum security)\n * NIST Security Level 5 (equivalent to AES-256)\n * Largest signatures, highest security\n *\n * Public key: 2592 bytes\n * Private key: 4864 bytes\n * Signature: ~4627 bytes\n */\nexport class MlDsa87Suite extends BaseMlDsaSuite {\n suiteId = 'ml-dsa-87';\n get sizes() {\n return ML_DSA_SIZES['ml-dsa-87'];\n }\n}\n/**\n * Default ML-DSA Suite (alias for ML-DSA-65)\n * Use this for the recommended security level\n */\nexport class MlDsaSuite extends MlDsa65Suite {\n}\n", "/**\r\n * @smartledger/keys - Key Management SDK\r\n * \r\n * Single source of truth for cryptographic key operations.\r\n * Provides a clean API that hides complexity and ensures consistency.\r\n */\r\n\r\nimport { KeyMeta, CryptoProfile, DerivationContext } from '@smartledger/crypto';\r\n\r\n/**\r\n * Public key record (safe to expose, no private key).\r\n */\r\nexport interface KeyRecord {\r\n meta: KeyMeta;\r\n publicKey: Uint8Array;\r\n}\r\n\r\n/**\r\n * Key creation options.\r\n */\r\nexport interface CreateKeyOptions {\r\n /** Optional expiration date (ISO 8601) */\r\n expiresAt?: string;\r\n \r\n /** Key usage (default: ['signing']) */\r\n usage?: Array<'signing' | 'encryption' | 'both'>;\r\n \r\n /** Crypto profile version (default: '1.0.0') */\r\n cryptoProfileVersion?: string;\r\n \r\n /** Optional derivation context for deterministic key generation */\r\n derivationContext?: DerivationContext;\r\n}\r\n\r\n/**\r\n * Signature generated by a specific suite/key combination.\r\n */\r\nexport interface SuiteSignature {\r\n suiteId: string;\r\n keyId: string;\r\n signature: Uint8Array;\r\n}\r\n\r\n/** Result of signing with one or more suites. */\r\nexport interface MultiSignatureResult {\r\n signatures: SuiteSignature[];\r\n}\r\n\r\n/** Per-suite verification outcome. */\r\nexport interface SuiteVerificationResult {\r\n suiteId: string;\r\n keyId: string;\r\n valid: boolean;\r\n error?: string;\r\n}\r\n\r\n/** Aggregate verification outcome across suites. */\r\nexport interface MultiVerificationResult {\r\n results: SuiteVerificationResult[];\r\n allValid: boolean;\r\n}\r\n\r\n/**\r\n * Key SDK - Single interface for all key operations.\r\n * \r\n * Design principles:\r\n * - Hide private keys from most callers\r\n * - Single source of truth for suite selection\r\n * - Crypto-agnostic API (suite is config, not code)\r\n * - Easy to audit (all key operations go through this)\r\n */\r\nexport interface KeySDK {\r\n /**\r\n * Create a new key for an agent/module.\r\n * \r\n * @param agentId Agent identifier (e.g. 'agent-resonance')\r\n * @param profile Crypto configuration (which suites to use)\r\n * @param options Optional expiration, usage, etc.\r\n * @returns KeyRecord with metadata and public key\r\n */\r\n createKey(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n options?: CreateKeyOptions\r\n ): Promise<KeyRecord>;\r\n \r\n /**\r\n * Get an existing key by ID.\r\n * \r\n * @param keyId Key identifier\r\n * @returns KeyRecord or null if not found\r\n */\r\n getKey(keyId: string): Promise<KeyRecord | null>;\r\n \r\n /**\r\n * Sign a message with a key.\r\n * \r\n * Private key never leaves the SDK.\r\n * \r\n * @param keyId Which key to sign with\r\n * @param message Message to sign (will be hashed internally)\r\n * @returns Signature bytes\r\n */\r\n signWithKey(\r\n keyId: string,\r\n message: Uint8Array\r\n ): Promise<Uint8Array>;\r\n \r\n /**\r\n * Verify a signature against a public key.\r\n * \r\n * @param keyId Which key to verify with\r\n * @param message Original message\r\n * @param signature Signature to verify\r\n * @returns true if valid\r\n */\r\n verifySignature(\r\n keyId: string,\r\n message: Uint8Array,\r\n signature: Uint8Array\r\n ): Promise<boolean>;\r\n \r\n /**\r\n * List all keys for an agent.\r\n * \r\n * @param agentId Agent identifier\r\n * @param activeOnly If true, only return active keys (default: true)\r\n * @returns Array of KeyRecords\r\n */\r\n listKeysForAgent(\r\n agentId: string,\r\n activeOnly?: boolean\r\n ): Promise<KeyRecord[]>;\r\n \r\n /**\r\n * Get the active crypto profile for an agent.\r\n * \r\n * Looks up the most recent active keys and infers the profile.\r\n * \r\n * @param agentId Agent identifier\r\n * @returns CryptoProfile or null if no keys found\r\n */\r\n getActiveCryptoProfile(agentId: string): Promise<CryptoProfile | null>;\r\n \r\n /**\r\n * Rotate an agent's keys.\r\n * \r\n * Generates new keypairs for all active keys, marks old ones as rotated.\r\n * \r\n * @param agentId Agent identifier\r\n * @returns Array of new KeyRecords\r\n */\r\n rotateAgentKeys(agentId: string): Promise<KeyRecord[]>;\r\n \r\n /**\r\n * Create key if it doesn't exist, otherwise return existing.\r\n * \r\n * Idempotent key creation for agent setup.\r\n * \r\n * @param agentId Agent identifier\r\n * @param profile Crypto configuration\r\n * @param options Creation options\r\n * @returns KeyRecord (new or existing)\r\n */\r\n getOrCreateKey(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n options?: CreateKeyOptions\r\n ): Promise<KeyRecord>;\r\n\r\n /**\r\n * Create both primary and secondary keys in a single call.\r\n * Requires profile.secondarySignatureSuite to be set.\r\n */\r\n createDualSignatureKeys(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n options?: CreateKeyOptions\r\n ): Promise<{ primaryKey: KeyRecord; secondaryKey: KeyRecord }>;\r\n\r\n /**\r\n * Idempotent dual-key creation; returns existing active keys when present.\r\n */\r\n getOrCreateDualSignatureKeys(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n options?: CreateKeyOptions\r\n ): Promise<{ primaryKey: KeyRecord; secondaryKey: KeyRecord }>;\r\n\r\n /**\r\n * Sign with one or more suites. If suites not provided, uses active profile.\r\n */\r\n signWithSuites(\r\n agentId: string,\r\n message: Uint8Array,\r\n suites?: string[]\r\n ): Promise<MultiSignatureResult>;\r\n\r\n /**\r\n * Verify multiple signatures for an agent.\r\n */\r\n verifyWithSuites(\r\n agentId: string,\r\n message: Uint8Array,\r\n signatures: SuiteSignature[]\r\n ): Promise<MultiVerificationResult>;\r\n \r\n /**\r\n * Generate a new BIP39 mnemonic phrase.\r\n * \r\n * @param strength 128 (12 words) or 256 (24 words)\r\n * @returns Mnemonic phrase\r\n */\r\n generateMnemonic(strength?: 128 | 256): string;\r\n \r\n /**\r\n * Create a key from a BIP39 mnemonic using HD derivation.\r\n * \r\n * @param agentId Agent identifier\r\n * @param profile Crypto profile (must use derivation-capable suite)\r\n * @param mnemonic BIP39 mnemonic phrase\r\n * @param path BIP32 derivation path\r\n * @param passphrase Optional BIP39 passphrase\r\n * @param options Additional key creation options\r\n * @returns KeyRecord with derived key\r\n */\r\n createKeyFromMnemonic(\r\n agentId: string,\r\n profile: CryptoProfile,\r\n mnemonic: string,\r\n path?: string,\r\n passphrase?: string,\r\n options?: CreateKeyOptions\r\n ): Promise<KeyRecord>;\r\n \r\n /**\r\n * Get available capabilities for a specific suite.\r\n * \r\n * @param suiteId Suite identifier\r\n * @returns Array of capability names\r\n */\r\n getCapabilities(suiteId: string): string[];\r\n \r\n /**\r\n * Find suites that support a specific capability.\r\n * \r\n * @param capability Capability name\r\n * @returns Array of suite IDs\r\n */\r\n getSuitesWithCapability(capability: 'derivation' | 'encryption' | 'threshold'): string[];\r\n}\r\n\r\n/**\r\n * Agent metadata with crypto configuration.\r\n */\r\nexport interface AgentKeyConfig {\r\n agentId: string;\r\n version: string;\r\n cryptoProfile: CryptoProfile;\r\n}\r\n"],
5
+ "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,MAMa,QAsCA;AA5Cb;AAAA;AAAA;AAMO,MAAM,SAAS;AAAA,QACpB,MAAM,SAAS,MAAM,UAAU;AAC7B,cAAI,OAAO,SAAS,UAAU;AAC5B,gBAAI,aAAa,UAAU;AACzB,oBAAM,eAAe,KAAK,IAAI;AAC9B,oBAAM,QAAQ,IAAI,WAAW,aAAa,MAAM;AAChD,uBAASA,KAAI,GAAGA,KAAI,aAAa,QAAQA,MAAK;AAC5C,sBAAMA,EAAC,IAAI,aAAa,WAAWA,EAAC;AAAA,cACtC;AACA,qBAAO;AAAA,YACT;AAEA,kBAAM,UAAU,IAAI,YAAY;AAChC,mBAAO,QAAQ,OAAO,IAAI;AAAA,UAC5B;AAEA,iBAAO,IAAI,WAAW,IAAI;AAAA,QAC5B;AAAA,MACF;AAGA,UAAI,OAAO,WAAW,UAAU,aAAa,cACzC,CAAC,WAAW,UAAU,SAAS,SAAS,EAAE,SAAS,eAAe,GAAG;AACvE,cAAM,mBAAmB,WAAW,UAAU;AAC9C,mBAAW,UAAU,WAAW,SAAS,UAAU;AACjD,cAAI,aAAa,UAAU;AACzB,gBAAI,SAAS;AACb,kBAAM,QAAQ,IAAI,WAAW,IAAI;AACjC,qBAASA,KAAI,GAAGA,KAAI,MAAM,YAAYA,MAAK;AACzC,wBAAU,OAAO,aAAa,MAAMA,EAAC,CAAC;AAAA,YACxC;AACA,mBAAO,KAAK,MAAM;AAAA,UACpB;AACA,iBAAO,iBAAiB,KAAK,IAAI;AAAA,QACnC;AAAA,MACF;AAGO,MAAM,UAAU;AAAA,QACrB,KAAK;AAAA,UACH,UAAU;AAAA,QACZ;AAAA,MACF;AAGA,UAAI,OAAO,WAAW,aAAa;AACjC,eAAO,SAAS;AAAA,MAClB;AAAA;AAAA;;;AC/CM,WAAU,QAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAU,QAAQC,IAAW,QAAgB,IAAE;AACnD,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,GAAG;AACrC,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,GAAG,MAAM,8BAA8BA,EAAC,EAAE;IAC5D;EACF;AAGM,WAAU,OAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,UAAM,QAAQ,QAAQ,KAAK;AAC3B,UAAM,MAAM,OAAO;AACnB,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,YAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,YAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;IACzE;AACA,WAAO;EACT;AAWM,WAAU,QAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAU,QAAQ,KAAU,UAAa;AAC7C,WAAO,KAAK,QAAW,qBAAqB;AAC5C,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,sDAAsD,GAAG;IAC3E;EACF;AAaM,WAAU,IAAI,KAAe;AACjC,WAAO,IAAI,YAAY,IAAI,QAAQ,IAAI,YAAY,KAAK,MAAM,IAAI,aAAa,CAAC,CAAC;EACnF;AAGM,WAAU,SAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAU,WAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAU,KAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAYM,WAAU,SAAS,MAAY;AACnC,WACI,QAAQ,KAAM,aACd,QAAQ,IAAK,WACb,SAAS,IAAK,QACd,SAAS,KAAM;EAErB;AAOM,WAAU,WAAW,KAAgB;AACzC,aAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AACnC,UAAIA,EAAC,IAAI,SAAS,IAAIA,EAAC,CAAC;IAC1B;AACA,WAAO;EACT;AAqMM,WAAU,aACd,UACA,OAAiB,CAAA,GAAE;AAEnB,UAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,UAAM,MAAM,SAAS,MAAS;AAC9B,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,WAAO,OAAO,OAAO,IAAI;AACzB,WAAO,OAAO,OAAO,KAAK;EAC5B;AApUA,MA6Fa,MAyBA,YAyNA;AA/Ub;;;AA6FO,MAAM,OAAiC,uBAC5C,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM,IAAK;AAwB5D,MAAM,aAA8C,OACvD,CAACC,OAAmBA,KACpB;AAuNG,MAAM,UAAU,CAAC,YAAwC;QAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;;;ACzUrF,WAAU,IAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAU,IAAIF,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAdA,MAoBsB,QAoHT,WAgBA;AAxJb;;;AAIA;AAgBM,MAAgB,SAAhB,MAAsB;QAoB1B,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,0CAAW;AACX,wCAAS;AACT,qCAAM;AACN,2CAAY;AAGpB,eAAK,WAAW;AAChB,eAAK,YAAY;AACjB,eAAK,YAAY;AACjB,eAAK,OAAOA;AACZ,eAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,eAAK,OAAO,WAAW,KAAK,MAAM;QACpC;QACA,OAAO,MAAgB;AACrB,kBAAQ,IAAI;AACZ,iBAAO,IAAI;AACX,gBAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,gBAAM,MAAM,KAAK;AACjB,mBAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,kBAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,gBAAI,SAAS,UAAU;AACrB,oBAAM,WAAW,WAAW,IAAI;AAChC,qBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,qBAAK,QAAQ,UAAU,GAAG;AACzE;YACF;AACA,mBAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,iBAAK,OAAO;AACZ,mBAAO;AACP,gBAAI,KAAK,QAAQ,UAAU;AACzB,mBAAK,QAAQ,MAAM,CAAC;AACpB,mBAAK,MAAM;YACb;UACF;AACA,eAAK,UAAU,KAAK;AACpB,eAAK,WAAU;AACf,iBAAO;QACT;QACA,WAAW,KAAe;AACxB,kBAAQ,IAAI;AACZ,kBAAQ,KAAK,IAAI;AACjB,eAAK,WAAW;AAIhB,gBAAM,EAAE,QAAQ,MAAM,UAAU,MAAAA,MAAI,IAAK;AACzC,cAAI,EAAE,IAAG,IAAK;AAEd,iBAAO,KAAK,IAAI;AAChB,gBAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,cAAI,KAAK,YAAY,WAAW,KAAK;AACnC,iBAAK,QAAQ,MAAM,CAAC;AACpB,kBAAM;UACR;AAEA,mBAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,mBAAOA,EAAC,IAAI;AAIjD,eAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGD,KAAI;AAC7D,eAAK,QAAQ,MAAM,CAAC;AACpB,gBAAM,QAAQ,WAAW,GAAG;AAC5B,gBAAM,MAAM,KAAK;AAEjB,cAAI,MAAM;AAAG,kBAAM,IAAI,MAAM,2CAA2C;AACxE,gBAAM,SAAS,MAAM;AACrB,gBAAM,QAAQ,KAAK,IAAG;AACtB,cAAI,SAAS,MAAM;AAAQ,kBAAM,IAAI,MAAM,oCAAoC;AAC/E,mBAASC,KAAI,GAAGA,KAAI,QAAQA;AAAK,kBAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGD,KAAI;QACxE;QACA,SAAM;AACJ,gBAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,eAAK,WAAW,MAAM;AACtB,gBAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,eAAK,QAAO;AACZ,iBAAO;QACT;QACA,WAAW,IAAM;AACf,sBAAO,IAAK,KAAK,YAAmB;AACpC,aAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,gBAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,aAAG,YAAY;AACf,aAAG,WAAW;AACd,aAAG,SAAS;AACZ,aAAG,MAAM;AACT,cAAI,SAAS;AAAU,eAAG,OAAO,IAAI,MAAM;AAC3C,iBAAO;QACT;QACA,QAAK;AACH,iBAAO,KAAK,WAAU;QACxB;;AASK,MAAM,YAAyC,4BAAY,KAAK;QACrE;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;OACrF;AAcM,MAAM,YAAyC,4BAAY,KAAK;QACrE;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;OACrF;;;;;ACnJD,WAAS,QACPE,IACA,KAAK,OAAK;AAKV,QAAI;AAAI,aAAO,EAAE,GAAG,OAAOA,KAAI,UAAU,GAAG,GAAG,OAAQA,MAAK,OAAQ,UAAU,EAAC;AAC/E,WAAO,EAAE,GAAG,OAAQA,MAAK,OAAQ,UAAU,IAAI,GAAG,GAAG,OAAOA,KAAI,UAAU,IAAI,EAAC;EACjF;AAEA,WAAS,MAAM,KAAe,KAAK,OAAK;AACtC,UAAM,MAAM,IAAI;AAChB,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,aAASC,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC5B,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAC,IAAK,QAAQ,IAAIF,EAAC,GAAG,EAAE;AACnC,OAAC,GAAGA,EAAC,GAAG,GAAGA,EAAC,CAAC,IAAI,CAACC,IAAGC,EAAC;IACxB;AACA,WAAO,CAAC,IAAI,EAAE;EAChB;AAwBA,WAAS,IACP,IACA,IACA,IACA,IAAU;AAKV,UAAMA,MAAK,OAAO,MAAM,OAAO;AAC/B,WAAO,EAAE,GAAI,KAAK,MAAOA,KAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,KAAI,EAAC;EAC3D;AA/DA,MAKM,YACA,MA0BA,OACA,OAEA,QACA,QAEA,QACA,QAKA,QACA,QAEA,QACA,QAiBA,OACA,OAEA,OAEA,OAEA,OAEA;AA1EN;;;AAKA,MAAM,aAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,MAAM,OAAuB,uBAAO,EAAE;AA0BtC,MAAM,QAAQ,CAACD,IAAW,IAAYE,OAAsBF,OAAME;AAClE,MAAM,QAAQ,CAACF,IAAWC,IAAWC,OAAuBF,MAAM,KAAKE,KAAOD,OAAMC;AAEpF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,OAAME,KAAMD,MAAM,KAAKC;AACpF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,MAAM,KAAKE,KAAOD,OAAMC;AAErF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,MAAM,KAAKE,KAAOD,OAAOC,KAAI;AAC1F,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,OAAOE,KAAI,KAAQD,MAAM,KAAKC;AAK3F,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,MAAKE,KAAMD,OAAO,KAAKC;AACpF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBD,MAAKC,KAAMF,OAAO,KAAKE;AAEpF,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBD,MAAMC,KAAI,KAAQF,OAAO,KAAKE;AAC3F,MAAM,SAAS,CAACF,IAAWC,IAAWC,OAAuBF,MAAME,KAAI,KAAQD,OAAO,KAAKC;AAiB3F,MAAM,QAAQ,CAAC,IAAY,IAAY,QAAwB,OAAO,MAAM,OAAO,MAAM,OAAO;AAChG,MAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,OACjD,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAC3C,MAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,QAChD,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AACjD,MAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,OAC7D,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAChD,MAAM,QAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,QAC5D,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC9D,MAAM,QAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,OACzE,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;;;AC3ErD,MAgBM,UAYA,UAGS,UA+EF,SAoCP,MAsBA,WACA,WAGA,YACA,YAGS,UAsIF,SA0HA,QAWA;AA3bb;;;AAOA;AACA;AACA;AAOA,MAAM,WAA2B,4BAAY,KAAK;QAChD;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QACpF;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;QAAY;OACrF;AAGD,MAAM,WAA2B,oBAAI,YAAY,EAAE;AAGnD,MAAe,WAAf,cAAuD,OAAS;QAY9D,YAAY,WAAiB;AAC3B,gBAAM,IAAI,WAAW,GAAG,KAAK;QAC/B;QACU,MAAG;AACX,gBAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,iBAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;QAChC;;QAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,eAAK,IAAIP,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;AACb,eAAK,IAAIC,KAAI;QACf;QACU,QAAQ,MAAgB,QAAc;AAE9C,mBAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,qBAASA,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,mBAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,kBAAM,MAAM,SAASA,KAAI,EAAE;AAC3B,kBAAMC,MAAK,SAASD,KAAI,CAAC;AACzB,kBAAM,KAAK,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,kBAAM,KAAK,KAAKC,KAAI,EAAE,IAAI,KAAKA,KAAI,EAAE,IAAKA,QAAO;AACjD,qBAASD,EAAC,IAAK,KAAK,SAASA,KAAI,CAAC,IAAI,KAAK,SAASA,KAAI,EAAE,IAAK;UACjE;AAEA,cAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,mBAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,kBAAM,SAAS,KAAKJ,IAAG,CAAC,IAAI,KAAKA,IAAG,EAAE,IAAI,KAAKA,IAAG,EAAE;AACpD,kBAAM,KAAMG,KAAI,SAAS,IAAIH,IAAGC,IAAGC,EAAC,IAAI,SAASE,EAAC,IAAI,SAASA,EAAC,IAAK;AACrE,kBAAM,SAAS,KAAKR,IAAG,CAAC,IAAI,KAAKA,IAAG,EAAE,IAAI,KAAKA,IAAG,EAAE;AACpD,kBAAM,KAAM,SAAS,IAAIA,IAAGC,IAAGC,EAAC,IAAK;AACrC,YAAAK,KAAID;AACJ,YAAAA,KAAID;AACJ,YAAAA,KAAID;AACJ,YAAAA,KAAKD,KAAI,KAAM;AACf,YAAAA,KAAID;AACJ,YAAAA,KAAID;AACJ,YAAAA,KAAID;AACJ,YAAAA,KAAK,KAAK,KAAM;UAClB;AAEA,UAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,UAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,eAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;QACjC;QACU,aAAU;AAClB,gBAAM,QAAQ;QAChB;QACA,UAAO;AACL,eAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,gBAAM,KAAK,MAAM;QACnB;;AAII,MAAO,UAAP,cAAuB,SAAiB;QAW5C,cAAA;AACE,gBAAM,EAAE;AATA;;mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;AAC3B,mCAAY,UAAU,CAAC,IAAI;QAGrC;;AAuBF,MAAM,OAAwB,uBAAU,MAAM;QAC5C;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE;QAAsB;QAAsB;QAAsB;QAClE,IAAI,CAAAG,OAAK,OAAOA,EAAC,CAAC,CAAC,GAAE;AACvB,MAAM,YAA6B,uBAAM,KAAK,CAAC,GAAE;AACjD,MAAM,YAA6B,uBAAM,KAAK,CAAC,GAAE;AAGjD,MAAM,aAA6B,oBAAI,YAAY,EAAE;AACrD,MAAM,aAA6B,oBAAI,YAAY,EAAE;AAGrD,MAAe,WAAf,cAAuD,OAAS;QAqB9D,YAAY,WAAiB;AAC3B,gBAAM,KAAK,WAAW,IAAI,KAAK;QACjC;;QAEU,MAAG;AAIX,gBAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC3E,iBAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;QACxE;;QAEU,IACR,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IACpF,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAU;AAE9F,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;AACf,eAAK,KAAK,KAAK;QACjB;QACU,QAAQ,MAAgB,QAAc;AAE9C,mBAASF,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU,GAAG;AACxC,uBAAWA,EAAC,IAAI,KAAK,UAAU,MAAM;AACrC,uBAAWA,EAAC,IAAI,KAAK,UAAW,UAAU,CAAE;UAC9C;AACA,mBAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAE5B,kBAAM,OAAO,WAAWA,KAAI,EAAE,IAAI;AAClC,kBAAM,OAAO,WAAWA,KAAI,EAAE,IAAI;AAClC,kBAAM,MAAU,OAAO,MAAM,MAAM,CAAC,IAAQ,OAAO,MAAM,MAAM,CAAC,IAAQ,MAAM,MAAM,MAAM,CAAC;AAC3F,kBAAM,MAAU,OAAO,MAAM,MAAM,CAAC,IAAQ,OAAO,MAAM,MAAM,CAAC,IAAQ,MAAM,MAAM,MAAM,CAAC;AAE3F,kBAAM,MAAM,WAAWA,KAAI,CAAC,IAAI;AAChC,kBAAM,MAAM,WAAWA,KAAI,CAAC,IAAI;AAChC,kBAAM,MAAU,OAAO,KAAK,KAAK,EAAE,IAAQ,OAAO,KAAK,KAAK,EAAE,IAAQ,MAAM,KAAK,KAAK,CAAC;AACvF,kBAAM,MAAU,OAAO,KAAK,KAAK,EAAE,IAAQ,OAAO,KAAK,KAAK,EAAE,IAAQ,MAAM,KAAK,KAAK,CAAC;AAEvF,kBAAM,OAAW,MAAM,KAAK,KAAK,WAAWA,KAAI,CAAC,GAAG,WAAWA,KAAI,EAAE,CAAC;AACtE,kBAAM,OAAW,MAAM,MAAM,KAAK,KAAK,WAAWA,KAAI,CAAC,GAAG,WAAWA,KAAI,EAAE,CAAC;AAC5E,uBAAWA,EAAC,IAAI,OAAO;AACvB,uBAAWA,EAAC,IAAI,OAAO;UACzB;AACA,cAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAEzE,mBAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAE3B,kBAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,kBAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AAEvF,kBAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,kBAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,kBAAM,OAAW,MAAM,IAAI,SAAS,MAAM,UAAUA,EAAC,GAAG,WAAWA,EAAC,CAAC;AACrE,kBAAM,MAAU,MAAM,MAAM,IAAI,SAAS,MAAM,UAAUA,EAAC,GAAG,WAAWA,EAAC,CAAC;AAC1E,kBAAM,MAAM,OAAO;AAEnB,kBAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,kBAAM,UAAc,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE,IAAQ,OAAO,IAAI,IAAI,EAAE;AACvF,kBAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,kBAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,aAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,kBAAM,MAAU,MAAM,KAAK,SAAS,IAAI;AACxC,iBAAS,MAAM,KAAK,KAAK,SAAS,IAAI;AACtC,iBAAK,MAAM;UACb;AAEA,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAAS,IAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,eAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;QACzE;QACU,aAAU;AAClB,gBAAM,YAAY,UAAU;QAC9B;QACA,UAAO;AACL,gBAAM,KAAK,MAAM;AACjB,eAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;QACzD;;AAII,MAAO,UAAP,cAAuB,SAAiB;QAkB5C,cAAA;AACE,gBAAM,EAAE;AAlBA,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,CAAC,IAAI;AAC5B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;AAC7B,oCAAa,UAAU,EAAE,IAAI;QAIvC;;AAsGK,MAAM,SAAyC;QACpD,MAAM,IAAI,QAAO;QACD,wBAAQ,CAAI;MAAC;AASxB,MAAM,SAAyC;QACpD,MAAM,IAAI,QAAO;QACD,wBAAQ,CAAI;MAAC;;;;;ACjYzB,WAAU,QAAQG,IAAgB,SAAiB,IAAE;AACzD,UAAMC,KAAI,IAAI,YAAY,IAAI,CAAC;AAE/B,aAAS,QAAQ,KAAK,QAAQ,QAAQ,IAAI,SAAS;AAEjD,eAASC,KAAI,GAAGA,KAAI,IAAIA;AAAK,QAAAD,GAAEC,EAAC,IAAIF,GAAEE,EAAC,IAAIF,GAAEE,KAAI,EAAE,IAAIF,GAAEE,KAAI,EAAE,IAAIF,GAAEE,KAAI,EAAE,IAAIF,GAAEE,KAAI,EAAE;AACvF,eAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK,GAAG;AAC9B,cAAM,QAAQA,KAAI,KAAK;AACvB,cAAM,QAAQA,KAAI,KAAK;AACvB,cAAM,KAAKD,GAAE,IAAI;AACjB,cAAM,KAAKA,GAAE,OAAO,CAAC;AACrB,cAAM,KAAK,MAAM,IAAI,IAAI,CAAC,IAAIA,GAAE,IAAI;AACpC,cAAM,KAAK,MAAM,IAAI,IAAI,CAAC,IAAIA,GAAE,OAAO,CAAC;AACxC,iBAASE,KAAI,GAAGA,KAAI,IAAIA,MAAK,IAAI;AAC/B,UAAAH,GAAEE,KAAIC,EAAC,KAAK;AACZ,UAAAH,GAAEE,KAAIC,KAAI,CAAC,KAAK;QAClB;MACF;AAEA,UAAI,OAAOH,GAAE,CAAC;AACd,UAAI,OAAOA,GAAE,CAAC;AACd,eAASI,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,QAAQ,UAAUA,EAAC;AACzB,cAAM,KAAK,MAAM,MAAM,MAAM,KAAK;AAClC,cAAM,KAAK,MAAM,MAAM,MAAM,KAAK;AAClC,cAAM,KAAK,QAAQA,EAAC;AACpB,eAAOJ,GAAE,EAAE;AACX,eAAOA,GAAE,KAAK,CAAC;AACf,QAAAA,GAAE,EAAE,IAAI;AACR,QAAAA,GAAE,KAAK,CAAC,IAAI;MACd;AAEA,eAASG,KAAI,GAAGA,KAAI,IAAIA,MAAK,IAAI;AAC/B,iBAASD,KAAI,GAAGA,KAAI,IAAIA;AAAK,UAAAD,GAAEC,EAAC,IAAIF,GAAEG,KAAID,EAAC;AAC3C,iBAASA,KAAI,GAAGA,KAAI,IAAIA;AAAK,UAAAF,GAAEG,KAAID,EAAC,KAAK,CAACD,IAAGC,KAAI,KAAK,EAAE,IAAID,IAAGC,KAAI,KAAK,EAAE;MAC5E;AAEA,MAAAF,GAAE,CAAC,KAAK,YAAY,KAAK;AACzB,MAAAA,GAAE,CAAC,KAAK,YAAY,KAAK;IAC3B;AACA,UAAMC,EAAC;EACT;AArGA,MA4BM,KACA,KACA,KACA,KACA,OACA,QACA,SACA,WACA,YAeA,OACA,aACA,aAGA,OACA,OA+CO,QA2HP,WAWO;AA9Ob;;;AAWA;AAEA;AAeA,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,MAAM,OAAO,CAAC;AACpB,MAAM,QAAQ,OAAO,GAAG;AACxB,MAAM,SAAS,OAAO,GAAI;AAC1B,MAAM,UAAoB,CAAA;AAC1B,MAAM,YAAsB,CAAA;AAC5B,MAAM,aAAuB,CAAA;AAC7B,eAAS,QAAQ,GAAGI,KAAI,KAAKH,KAAI,GAAGC,KAAI,GAAG,QAAQ,IAAI,SAAS;AAE9D,SAACD,IAAGC,EAAC,IAAI,CAACA,KAAI,IAAID,KAAI,IAAIC,MAAK,CAAC;AAChC,gBAAQ,KAAK,KAAK,IAAIA,KAAID,GAAE;AAE5B,kBAAU,MAAQ,QAAQ,MAAM,QAAQ,KAAM,IAAK,EAAE;AAErD,YAAIE,KAAI;AACR,iBAASE,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,UAAAD,MAAMA,MAAK,OAASA,MAAK,OAAO,UAAW;AAC3C,cAAIA,KAAI;AAAK,YAAAD,MAAK,QAAS,OAAO,OAAOE,EAAC,KAAK;QACjD;AACA,mBAAW,KAAKF,EAAC;MACnB;AACA,MAAM,QAAQ,MAAM,YAAY,IAAI;AACpC,MAAM,cAAc,MAAM,CAAC;AAC3B,MAAM,cAAc,MAAM,CAAC;AAG3B,MAAM,QAAQ,CAACG,IAAWC,IAAWR,OAAeA,KAAI,KAAK,OAAOO,IAAGC,IAAGR,EAAC,IAAI,OAAOO,IAAGC,IAAGR,EAAC;AAC7F,MAAM,QAAQ,CAACO,IAAWC,IAAWR,OAAeA,KAAI,KAAK,OAAOO,IAAGC,IAAGR,EAAC,IAAI,OAAOO,IAAGC,IAAGR,EAAC;AA+CvF,MAAO,SAAP,MAAO,QAAM;;QAejB,YACE,UACA,QACA,WACA,YAAY,OACZ,SAAiB,IAAE;AAnBX;AACA,qCAAM;AACN,wCAAS;AACT,0CAAW;AACX;AACA,2CAAY;AAEf;AACA;AACA;AACG,2CAAY;AACZ;AAUR,eAAK,WAAW;AAChB,eAAK,SAAS;AACd,eAAK,YAAY;AACjB,eAAK,YAAY;AACjB,eAAK,SAAS;AAEd,kBAAQ,WAAW,WAAW;AAG9B,cAAI,EAAE,IAAI,YAAY,WAAW;AAC/B,kBAAM,IAAI,MAAM,yCAAyC;AAC3D,eAAK,QAAQ,IAAI,WAAW,GAAG;AAC/B,eAAK,UAAU,IAAI,KAAK,KAAK;QAC/B;QACA,QAAK;AACH,iBAAO,KAAK,WAAU;QACxB;QACU,SAAM;AACd,qBAAW,KAAK,OAAO;AACvB,kBAAQ,KAAK,SAAS,KAAK,MAAM;AACjC,qBAAW,KAAK,OAAO;AACvB,eAAK,SAAS;AACd,eAAK,MAAM;QACb;QACA,OAAO,MAAgB;AACrB,kBAAQ,IAAI;AACZ,iBAAO,IAAI;AACX,gBAAM,EAAE,UAAU,MAAK,IAAK;AAC5B,gBAAM,MAAM,KAAK;AACjB,mBAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,kBAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AACpD,qBAASS,KAAI,GAAGA,KAAI,MAAMA;AAAK,oBAAM,KAAK,KAAK,KAAK,KAAK,KAAK;AAC9D,gBAAI,KAAK,QAAQ;AAAU,mBAAK,OAAM;UACxC;AACA,iBAAO;QACT;QACU,SAAM;AACd,cAAI,KAAK;AAAU;AACnB,eAAK,WAAW;AAChB,gBAAM,EAAE,OAAO,QAAQ,KAAK,SAAQ,IAAK;AAEzC,gBAAM,GAAG,KAAK;AACd,eAAK,SAAS,SAAU,KAAK,QAAQ,WAAW;AAAG,iBAAK,OAAM;AAC9D,gBAAM,WAAW,CAAC,KAAK;AACvB,eAAK,OAAM;QACb;QACU,UAAU,KAAe;AACjC,kBAAQ,MAAM,KAAK;AACnB,iBAAO,GAAG;AACV,eAAK,OAAM;AACX,gBAAM,YAAY,KAAK;AACvB,gBAAM,EAAE,SAAQ,IAAK;AACrB,mBAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,MAAM,OAAO;AAC/C,gBAAI,KAAK,UAAU;AAAU,mBAAK,OAAM;AACxC,kBAAM,OAAO,KAAK,IAAI,WAAW,KAAK,QAAQ,MAAM,GAAG;AACvD,gBAAI,IAAI,UAAU,SAAS,KAAK,QAAQ,KAAK,SAAS,IAAI,GAAG,GAAG;AAChE,iBAAK,UAAU;AACf,mBAAO;UACT;AACA,iBAAO;QACT;QACA,QAAQ,KAAe;AAErB,cAAI,CAAC,KAAK;AAAW,kBAAM,IAAI,MAAM,uCAAuC;AAC5E,iBAAO,KAAK,UAAU,GAAG;QAC3B;QACA,IAAI,OAAa;AACf,kBAAQ,KAAK;AACb,iBAAO,KAAK,QAAQ,IAAI,WAAW,KAAK,CAAC;QAC3C;QACA,WAAW,KAAe;AACxB,kBAAQ,KAAK,IAAI;AACjB,cAAI,KAAK;AAAU,kBAAM,IAAI,MAAM,6BAA6B;AAChE,eAAK,UAAU,GAAG;AAClB,eAAK,QAAO;AACZ,iBAAO;QACT;QACA,SAAM;AACJ,iBAAO,KAAK,WAAW,IAAI,WAAW,KAAK,SAAS,CAAC;QACvD;QACA,UAAO;AACL,eAAK,YAAY;AACjB,gBAAM,KAAK,KAAK;QAClB;QACA,WAAW,IAAW;AACpB,gBAAM,EAAE,UAAU,QAAQ,WAAW,QAAQ,UAAS,IAAK;AAC3D,sBAAO,IAAI,QAAO,UAAU,QAAQ,WAAW,WAAW,MAAM;AAChE,aAAG,QAAQ,IAAI,KAAK,OAAO;AAC3B,aAAG,MAAM,KAAK;AACd,aAAG,SAAS,KAAK;AACjB,aAAG,WAAW,KAAK;AACnB,aAAG,SAAS;AAEZ,aAAG,SAAS;AACZ,aAAG,YAAY;AACf,aAAG,YAAY;AACf,aAAG,YAAY,KAAK;AACpB,iBAAO;QACT;;AAGF,MAAM,YAAY,CAAC,QAAgB,UAAkB,WAAmB,OAAiB,CAAA,MACvF,aAAa,MAAM,IAAI,OAAO,UAAU,QAAQ,SAAS,GAAG,IAAI;AAU3D,MAAM,WAAkC;QAC7C;QACA;QACA;QACgB,wBAAQ,CAAI;MAAC;;;;;AClP/B;AAAA;AAAA;AAAA;AAAA;AAWA,WAAS,WAAW,WAAW;AAC7B,QAAI,OAAO,IAAI,WAAW,CAAC;AAC3B,QAAI;AAGJ,YAAQ,UAAU,YAAY,GAAG;AAAA,MAC/B,KAAK;AAAA,MACL,KAAK;AACH,iBAAS;AACT;AAAA,MACF,KAAK;AAAA,MACL,KAAK;AACH,iBAAS;AACT;AAAA,MACF,KAAK;AACH,iBAAS;AACT;AAAA,MACF;AACE,cAAM,IAAI,MAAM,+BAA+B,SAAS,EAAE;AAAA,IAC9D;AAEA,WAAO;AAAA,MACL,OAAO,OAAO;AAEZ,cAAM,aAAa,iBAAiB,aAAa,QAAQ,IAAI,WAAW,KAAK;AAC7E,cAAM,UAAU,IAAI,WAAW,KAAK,SAAS,WAAW,MAAM;AAC9D,gBAAQ,IAAI,IAAI;AAChB,gBAAQ,IAAI,YAAY,KAAK,MAAM;AACnC,eAAO;AACP,eAAO;AAAA,MACT;AAAA,MAEA,SAAS;AACP,eAAO,OAAO,IAAI;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AA/CA,MAmDO;AAnDP;AAAA;AAAA;AAAA;AAKA;AACA;AA6CA,MAAO,8BAAQ,EAAE,WAAW;AAAA;AAAA;;;ACnD5B;AAAA;AAAA;AAAA,UAAI,aAAU,WAAU;AAAC,YAAI,GAAE,GAAE,GAAE,IAAE,CAAC;AAAE,iBAAS,EAAEC,IAAEC,IAAE;AAAC,cAAG,MAAID,GAAE,QAAOC;AAAE,gBAAM,IAAI,MAAM,sBAAoBD,EAAC;AAAA,QAAC;AAAC,iBAAS,EAAEA,IAAEC,IAAE;AAAC,iBAAO,IAAI,WAAW,IAAI,WAAW,EAAE,OAAO,QAAOD,IAAEC,EAAC,CAAC;AAAA,QAAC;AAAC,iBAAS,EAAED,IAAE;AAAC,cAAG;AAAC,cAAE,MAAMA,EAAC;AAAA,UAAC,SAAOA,IAAE;AAAC,wBAAY,WAAU;AAAC,oBAAMA;AAAA,YAAC,IAAG,CAAC;AAAA,UAAC;AAAA,QAAC;AAAC,UAAE,QAAM,IAAI,SAAS,SAAS,GAAE,GAAE;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAO,IAAE,cAAY,OAAO,UAAQ,YAAU,OAAO,OAAO,WAAS,SAASA,IAAE;AAAC,qBAAO,OAAOA;AAAA,YAAC,IAAE,SAASA,IAAE;AAAC,qBAAOA,MAAG,cAAY,OAAO,UAAQA,GAAE,gBAAc,UAAQA,OAAI,OAAO,YAAU,WAAS,OAAOA;AAAA,YAAC,GAAE,EAAEA,EAAC;AAAA,UAAC;AAAC,WAAC,IAAE,CAAC,GAAG,UAAQ,GAAE,EAAE,uBAAqB,WAAU;AAAC,gBAAG;AAAC,gBAAE,8BAA8B,GAAE,EAAE,CAAC;AAAA,YAAC,SAAOA,IAAE;AAAC,gBAAEA,EAAC;AAAA,YAAC;AAAA,UAAC;AAAE,cAAI,GAAE,GAAE,IAAE,WAAS,IAAE,IAAE,CAAC,GAAE,IAAE,OAAO,OAAO,CAAC,GAAE,CAAC,GAAE,IAAE,SAASA,IAAEC,IAAE;AAAC,kBAAMA;AAAA,UAAC,GAAE,IAAE,aAAW,eAAa,OAAO,SAAO,cAAY,EAAE,MAAM,IAAG,IAAE,cAAY,OAAO,eAAc,IAAE,aAAW,eAAa,OAAO,UAAQ,cAAY,EAAE,OAAO,MAAI,YAAU,EAAE,QAAQ,QAAQ,KAAG,YAAU,OAAO,QAAQ,SAAS,MAAK,IAAE;AAAG,cAAG,GAAE;AAAC,gBAAI,IAAE,KAAK,SAAS,EAAE,IAAI,GAAE,IAAE,KAAK,SAAS,EAAE,MAAM;AAAE,gBAAE,IAAE,EAAE,QAAQ,CAAC,IAAE,MAAI,YAAU,KAAI,IAAE,SAASD,IAAEC,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,qBAAOE,KAAED,KAAEC,KAAEA,GAAE,SAAS,KAAGF,KAAE,EAAEA,EAAC,IAAE,IAAI,IAAIA,EAAC,IAAE,EAAE,UAAUA,EAAC,GAAE,EAAE,aAAaA,IAAEC,KAAE,SAAO,MAAM;AAAA,YAAE,GAAE,IAAE,SAASD,IAAE;AAAC,kBAAIC,KAAE,EAAED,IAAE,IAAE;AAAE,qBAAOC,GAAE,WAASA,KAAE,IAAI,WAAWA,EAAC,IAAGA;AAAA,YAAC,GAAE,SAASD,IAAEC,IAAEC,IAAE;AAAC,kBAAIC,KAAE,EAAE,UAAU,SAAO,KAAG,WAAS,UAAU,CAAC,MAAI,UAAU,CAAC,GAAEC,KAAE,EAAEJ,EAAC;AAAE,cAAAI,MAAGH,GAAEG,EAAC,GAAEJ,KAAE,EAAEA,EAAC,IAAE,IAAI,IAAIA,EAAC,IAAE,EAAE,UAAUA,EAAC,GAAE,EAAE,SAASA,IAAEG,KAAE,SAAO,SAAQ,SAASH,IAAEI,IAAE;AAAC,gBAAAJ,KAAEE,GAAEF,EAAC,IAAEC,GAAEE,KAAEC,GAAE,SAAOA,EAAC;AAAA,cAAC,EAAE;AAAA,YAAC,GAAE,CAAC,EAAE,eAAa,QAAQ,KAAK,SAAO,KAAG,QAAQ,KAAK,CAAC,EAAE,QAAQ,OAAM,GAAG,GAAE,QAAQ,KAAK,MAAM,CAAC,GAAE,eAAa,OAAO,WAAS,OAAO,UAAQ,IAAG,QAAQ,GAAG,sBAAqB,SAASJ,IAAE;AAAC,kBAAG,EAAE,aAAWA,MAAGA,cAAa,KAAGA,GAAE,mBAAmB,GAAG,OAAMA;AAAA,YAAC,EAAE,GAAE,IAAE,SAASA,IAAEC,IAAE;AAAC,oBAAM,QAAQ,WAASD,IAAEC;AAAA,YAAC,GAAE,EAAE,UAAQ,WAAU;AAAC,qBAAM;AAAA,YAA4B;AAAA,UAAC,MAAK,EAAC,KAAG,OAAK,IAAE,IAAE,KAAK,SAAS,OAAK,eAAa,OAAO,YAAU,SAAS,kBAAgB,IAAE,SAAS,cAAc,MAAK,IAAE,MAAI,EAAE,QAAQ,OAAO,IAAE,EAAE,OAAO,GAAE,EAAE,QAAQ,UAAS,EAAE,EAAE,YAAY,GAAG,IAAE,CAAC,IAAE,IAAG,IAAE,SAASD,IAAE;AAAC,gBAAG;AAAC,kBAAIC,KAAE,IAAI;AAAe,qBAAOA,GAAE,KAAK,OAAMD,IAAE,KAAE,GAAEC,GAAE,KAAK,IAAI,GAAEA,GAAE;AAAA,YAAY,SAAOA,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,kBAAGE,GAAE,SAAO,SAASF,IAAE;AAAC,yBAAQC,KAAE,CAAC,GAAEC,KAAE,GAAEA,KAAEF,GAAE,QAAOE,MAAI;AAAC,sBAAIC,KAAEH,GAAEE,EAAC;AAAE,kBAAAC,KAAE,QAAMA,MAAG,MAAKF,GAAE,KAAK,OAAO,aAAaE,EAAC,CAAC;AAAA,gBAAC;AAAC,uBAAOF,GAAE,KAAK,EAAE;AAAA,cAAC,GAAEC,EAAC;AAAE,oBAAMD;AAAA,YAAC;AAAA,UAAC,GAAE,MAAI,IAAE,SAASD,IAAE;AAAC,gBAAG;AAAC,kBAAIC,KAAE,IAAI;AAAe,qBAAOA,GAAE,KAAK,OAAMD,IAAE,KAAE,GAAEC,GAAE,eAAa,eAAcA,GAAE,KAAK,IAAI,GAAE,IAAI,WAAWA,GAAE,QAAQ;AAAA,YAAC,SAAOA,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,kBAAGE,GAAE,QAAOA;AAAE,oBAAMD;AAAA,YAAC;AAAA,UAAC,IAAG,SAASD,IAAEC,IAAEC,IAAE;AAAC,gBAAIC,KAAE,IAAI;AAAe,YAAAA,GAAE,KAAK,OAAMH,IAAE,IAAE,GAAEG,GAAE,eAAa,eAAcA,GAAE,SAAO,WAAU;AAAC,kBAAG,OAAKA,GAAE,UAAQ,KAAGA,GAAE,UAAQA,GAAE,SAAS,CAAAF,GAAEE,GAAE,QAAQ;AAAA,mBAAM;AAAC,oBAAIC,KAAE,EAAEJ,EAAC;AAAE,gBAAAI,KAAEH,GAAEG,GAAE,MAAM,IAAEF,GAAE;AAAA,cAAC;AAAA,YAAC,GAAEC,GAAE,UAAQD,IAAEC,GAAE,KAAK,IAAI;AAAA,UAAC,GAAE,SAASH,IAAE;AAAC,mBAAO,SAAS,QAAMA;AAAA,UAAC;AAAG,YAAE,SAAO,QAAQ,IAAI,KAAK,OAAO;AAAE,cAAI,GAAE,IAAE,EAAE,YAAU,QAAQ,MAAM,KAAK,OAAO;AAAE,iBAAO,OAAO,GAAE,CAAC,GAAE,IAAE,MAAK,EAAE,aAAW,EAAE,WAAU,EAAE,eAAa,EAAE,aAAY,EAAE,SAAO,IAAE,EAAE,OAAM,EAAE,eAAa,IAAE,EAAE;AAAY,cAAI,GAAE,IAAE,EAAE,iBAAe;AAAG,uBAAW,eAAa,OAAO,cAAY,cAAY,EAAE,WAAW,MAAI,EAAE,iCAAiC;AAAE,cAAI,GAAE,GAAE,GAAE,GAAE,IAAE;AAAG,cAAI,IAAE,CAAC,GAAE,IAAE,CAAC,GAAE,IAAE,CAAC;AAAE,cAAI,IAAE,GAAE,IAAE,MAAK,IAAE;AAAK,mBAAS,EAAEA,IAAE;AAAC,kBAAM,EAAE,WAAS,EAAE,QAAQA,EAAC,GAAE,EAAEA,KAAE,aAAWA,KAAE,GAAG,GAAE,IAAE,MAAG,GAAEA,MAAG,4CAA2C,IAAI,YAAY,aAAaA,EAAC;AAAA,UAAC;AAAC,cAAI,GAAE,GAAE,IAAE;AAAwC,mBAAS,EAAEA,IAAE;AAAC,mBAAOA,GAAE,WAAW,CAAC;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAOA,GAAE,WAAW,SAAS;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAO,QAAQ,QAAQ,EAAE,MAAM,WAAU;AAAC,sBAAO,SAASA,IAAE;AAAC,oBAAGA,MAAG,KAAG,EAAE,QAAO,IAAI,WAAW,CAAC;AAAE,oBAAIC,KAAE,EAAED,EAAC;AAAE,oBAAGC,GAAE,QAAOA;AAAE,oBAAG,EAAE,QAAO,EAAED,EAAC;AAAE,sBAAK;AAAA,cAAiD,GAAEA,EAAC;AAAA,YAAC,EAAE;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAEC,IAAEC,IAAEC,IAAE;AAAC,oBAAO,SAASH,IAAEC,IAAEC,IAAE;AAAC,qBAAO,EAAEF,EAAC,EAAE,MAAM,SAASA,IAAE;AAAC,uBAAO,YAAY,YAAYA,IAAEC,EAAC;AAAA,cAAC,EAAE,EAAE,MAAM,SAASD,IAAE;AAAC,uBAAOA;AAAA,cAAC,EAAE,EAAE,KAAKE,KAAG,SAASF,IAAE;AAAC,kBAAE,4CAA0CA,EAAC,GAAE,EAAEA,EAAC;AAAA,cAAC,EAAE;AAAA,YAAC,GAAEC,IAAEC,IAAEC,EAAC;AAAA,UAAC;AAAC,YAAE,IAAE,+i7CAA+i7C,MAAI,IAAE,GAAE,IAAE,EAAE,aAAW,EAAE,WAAW,GAAE,CAAC,IAAE,IAAE;AAAG,cAAI,IAAE,EAAC,MAAK,WAAU;AAAC,mBAAO,EAAE,eAAe;AAAA,UAAC,GAAE,MAAK,WAAU;AAAC,gBAAG,WAAS,EAAE,eAAe,KAAG;AAAC,kBAAI,IAAE,cAAY,eAAa,OAAO,SAAO,cAAY,EAAE,MAAM,KAAG,SAAO,MAAK,IAAE,WAAS,EAAE,SAAO,EAAE,SAAO,EAAE,UAAS,IAAE,WAAU;AAAC,oBAAIH,KAAE,IAAI,YAAY,CAAC;AAAE,uBAAO,EAAE,gBAAgBA,EAAC,GAAEA,GAAE,CAAC,MAAI;AAAA,cAAC;AAAE,gBAAE,GAAE,EAAE,iBAAe;AAAA,YAAC,SAAO,GAAE;AAAC,kBAAG;AAAC,oBAAI,IAAE,KAAK,SAAS,EAAE,QAAQ,GAAE,IAAE,WAAU;AAAC,sBAAIA,KAAE,EAAE,YAAY,CAAC;AAAE,0BAAOA,GAAE,CAAC,KAAG,KAAGA,GAAE,CAAC,KAAG,KAAGA,GAAE,CAAC,KAAG,IAAEA,GAAE,CAAC,OAAK;AAAA,gBAAC;AAAE,kBAAE,GAAE,EAAE,iBAAe;AAAA,cAAC,SAAOA,IAAE;AAAC,sBAAK;AAAA,cAAyC;AAAA,YAAC;AAAA,UAAC,EAAC;AAAE,mBAAS,EAAEA,IAAE;AAAC,iBAAK,OAAK,cAAa,KAAK,UAAQ,gCAAgC,OAAOA,IAAE,GAAG,GAAE,KAAK,SAAOA;AAAA,UAAC;AAAC,cAAI,IAAE,SAASA,IAAE;AAAC,mBAAKA,GAAE,SAAO,IAAG,CAAAA,GAAE,MAAM,EAAE,CAAC;AAAA,UAAC;AAAE,yBAAa,OAAO,eAAa,IAAI,YAAY,MAAM;AAAE,cAAI,GAAE,IAAE,CAAC,GAAE,IAAE,SAASA,IAAEC,IAAEC,IAAE;AAAC,gBAAIC,MAAE,SAASH,IAAEC,IAAE;AAAC,kBAAIC;AAAE,mBAAI,EAAE,SAAO,GAAED,OAAI,GAAEC,KAAE,EAAEF,IAAG,IAAG,CAAAC,MAAG,OAAKC,KAAED,IAAE,EAAE,KAAK,OAAKC,KAAE,EAAED,EAAC,IAAE,EAAEA,QAAK,CAAC,CAAC,GAAE,EAAEA;AAAE,qBAAO;AAAA,YAAC,GAAEA,IAAEC,EAAC;AAAE,mBAAO,EAAEF,EAAC,EAAE,MAAM,MAAKG,EAAC;AAAA,UAAC,GAAE,IAAE,SAASH,IAAE;AAAC,YAAAA,IAAE,MAAI,EAAE,UAAQ,EAAE,OAAOA,EAAC,GAAE,IAAE,OAAI,EAAEA,IAAE,IAAI,EAAEA,EAAC,CAAC;AAAA,UAAC,GAAE,IAAE,EAAC,GAAE,SAASA,IAAEC,IAAEC,IAAE;AAAC,mBAAO,EAAEF,IAAEC,IAAEC,EAAC;AAAA,UAAC,GAAE,GAAE,SAASF,IAAEC,IAAEC,IAAE;AAAC,mBAAO,EAAE,WAAWF,IAAEC,IAAEA,KAAEC,EAAC;AAAA,UAAC,GAAE,GAAE,SAASF,IAAE;AAAC,cAAE;AAAO,cAAE,KAAK;AAAA,UAAC,GAAE,GAAE,SAASA,IAAEC,IAAE;AAAC,YAAAD,IAAE,EAAEA,EAAC;AAAA,UAAC,EAAC;AAAE,WAAC,WAAU;AAAC,gBAAIA,KAAE,EAAC,GAAE,EAAC;AAAE,qBAASC,GAAED,IAAEC,IAAE;AAAC,kBAAIC,IAAEC,IAAEC,KAAEJ,GAAE;AAAQ,qBAAO,EAAE,MAAII,IAAE,IAAE,EAAE,IAAI,GAAEF,KAAE,EAAE,QAAO,EAAE,QAAM,IAAE,IAAI,UAAUA,EAAC,GAAE,EAAE,SAAO,IAAI,WAAWA,EAAC,GAAE,EAAE,SAAO,IAAE,IAAI,WAAWA,EAAC,GAAE,EAAE,SAAO,IAAE,IAAI,WAAWA,EAAC,GAAE,EAAE,UAAQ,IAAI,YAAYA,EAAC,GAAE,EAAE,UAAQ,IAAI,YAAYA,EAAC,GAAE,EAAE,UAAQ,IAAI,aAAaA,EAAC,GAAE,EAAE,UAAQ,IAAE,IAAI,aAAaA,EAAC,GAAE,EAAE,IAAI,GAAEC,KAAE,EAAE,IAAI,GAAE,EAAE,QAAQA,EAAC,IAAE,SAASH,IAAE;AAAC,oBAAG,KAAI,EAAE,0BAAwB,EAAE,uBAAuB,CAAC,GAAE,KAAG,MAAI,SAAO,MAAI,cAAc,CAAC,GAAE,IAAE,OAAM,IAAG;AAAC,sBAAIC,KAAE;AAAE,sBAAE,MAAKA,GAAE;AAAA,gBAAC;AAAA,cAAC,GAAE,GAAEG;AAAA,YAAC;AAAC,gBAAG,KAAI,EAAE,0BAAwB,EAAE,uBAAuB,CAAC,GAAE,EAAE,gBAAgB,KAAG;AAAC,qBAAO,EAAE,gBAAgBJ,IAAEC,EAAC;AAAA,YAAC,SAAOD,IAAE;AAAC,qBAAO,EAAE,wDAAsDA,EAAC,GAAE;AAAA,YAAE;AAAC,cAAE,GAAE,GAAEA,KAAG,SAASA,IAAE;AAAC,cAAAC,GAAED,GAAE,QAAQ;AAAA,YAAC,EAAE;AAAA,UAAC,GAAG,GAAE,EAAE,UAAQ,WAAU;AAAC,oBAAO,EAAE,UAAQ,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,QAAM,WAAU;AAAC,oBAAO,EAAE,QAAM,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,oBAAkB,WAAU;AAAC,oBAAO,EAAE,oBAAkB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,gCAA8B,WAAU;AAAC,oBAAO,EAAE,gCAA8B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,gCAA8B,WAAU;AAAC,oBAAO,EAAE,gCAA8B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,+BAA6B,WAAU;AAAC,oBAAO,EAAE,+BAA6B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,uBAAqB,WAAU;AAAC,oBAAO,EAAE,uBAAqB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,oBAAkB,WAAU;AAAC,oBAAO,EAAE,oBAAkB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,sBAAoB,WAAU;AAAC,oBAAO,EAAE,sBAAoB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC;AAAE,mBAAS,EAAEA,IAAE;AAAC,gBAAG,EAAEA,EAAC,EAAE,SAAO,SAASA,IAAE;AAAC,kBAAG,WAAS,KAAG,GAAE;AAAC,oBAAIC,KAAE,OAAO,KAAKD,IAAE,QAAQ;AAAE,uBAAO,IAAI,WAAWC,GAAE,QAAOA,GAAE,YAAWA,GAAE,UAAU;AAAA,cAAC;AAAC,kBAAG;AAAC,yBAAQC,KAAE,KAAKF,EAAC,GAAEG,KAAE,IAAI,WAAWD,GAAE,MAAM,GAAEE,KAAE,GAAEA,KAAEF,GAAE,QAAO,EAAEE,GAAE,CAAAD,GAAEC,EAAC,IAAEF,GAAE,WAAWE,EAAC;AAAE,uBAAOD;AAAA,cAAC,SAAOH,IAAE;AAAC,sBAAM,IAAI,MAAM,2CAA2C;AAAA,cAAC;AAAA,YAAC,GAAEA,GAAE,MAAM,EAAE,MAAM,CAAC;AAAA,UAAC;AAAC,mBAAS,IAAG;AAAC,qBAASA,KAAG;AAAC,oBAAI,IAAE,MAAG,EAAE,YAAU,MAAG,MAAI,MAAG,EAAE,CAAC,GAAE,EAAE,wBAAsB,EAAE,qBAAqB,IAAE,WAAU;AAAC,oBAAG,EAAE,QAAQ,MAAI,cAAY,OAAO,EAAE,YAAU,EAAE,UAAQ,CAAC,EAAE,OAAO,IAAG,EAAE,QAAQ,SAAQ,CAAAA,KAAE,EAAE,QAAQ,MAAM,GAAE,EAAE,QAAQA,EAAC;AAAE,oBAAIA;AAAE,kBAAE,CAAC;AAAA,cAAC,GAAE;AAAA,YAAG;AAAC,gBAAE,MAAI,EAAC,WAAU;AAAC,kBAAG,EAAE,OAAO,MAAI,cAAY,OAAO,EAAE,WAAS,EAAE,SAAO,CAAC,EAAE,MAAM,IAAG,EAAE,OAAO,SAAQ,CAAAA,KAAE,EAAE,OAAO,MAAM,GAAE,EAAE,QAAQA,EAAC;AAAE,kBAAIA;AAAE,gBAAE,CAAC;AAAA,YAAC,GAAE,GAAE,IAAE,MAAI,EAAE,aAAW,EAAE,UAAU,YAAY,GAAE,YAAY,WAAU;AAAC,0BAAY,WAAU;AAAC,kBAAE,UAAU,EAAE;AAAA,cAAC,IAAG,CAAC,GAAEA,GAAE;AAAA,YAAC,IAAG,CAAC,KAAGA,GAAE;AAAA,UAAG;AAAC,cAAG,EAAE,qBAAmB,SAASA,IAAEC,IAAE;AAAC,cAAE,IAAID,IAAEC,EAAC;AAAA,UAAC,GAAE,IAAE,SAASD,KAAG;AAAC,iBAAG,EAAE,GAAE,MAAI,IAAEA;AAAA,UAAE,GAAE,EAAE,QAAQ,MAAI,cAAY,OAAO,EAAE,YAAU,EAAE,UAAQ,CAAC,EAAE,OAAO,IAAG,EAAE,QAAQ,SAAO,IAAG,GAAE,QAAQ,IAAI,EAAE;AAAE,YAAE;AAAA,QAAC,EAAE,EAAE,OAAO,WAAU;AAAC,mBAAS,EAAEC,IAAE;AAAC,mBAAO,IAAE,cAAY,OAAO,UAAQ,YAAU,OAAO,OAAO,WAAS,SAASD,IAAE;AAAC,qBAAO,OAAOA;AAAA,YAAC,IAAE,SAASA,IAAE;AAAC,qBAAOA,MAAG,cAAY,OAAO,UAAQA,GAAE,gBAAc,UAAQA,OAAI,OAAO,YAAU,WAAS,OAAOA;AAAA,YAAC,GAAE,EAAEC,EAAC;AAAA,UAAC;AAAC,cAAI,GAAE,GAAE,IAAE,YAAU,IAAE,CAAC,KAAG,IAAE,CAAC,GAAE,IAAE,OAAO,OAAO,CAAC,GAAE,CAAC,GAAE,IAAE,SAASD,IAAEC,IAAE;AAAC,kBAAMA;AAAA,UAAC,GAAE,IAAE,aAAW,eAAa,OAAO,SAAO,cAAY,EAAE,MAAM,IAAG,IAAE,cAAY,OAAO,eAAc,IAAE,aAAW,eAAa,OAAO,UAAQ,cAAY,EAAE,OAAO,MAAI,YAAU,EAAE,QAAQ,QAAQ,KAAG,YAAU,OAAO,QAAQ,SAAS,MAAK,IAAE;AAAG,cAAG,GAAE;AAAC,gBAAI,IAAE,KAAK,SAAS,EAAE,IAAI,GAAE,IAAE,KAAK,SAAS,EAAE,MAAM;AAAE,gBAAE,IAAE,EAAE,QAAQ,CAAC,IAAE,MAAI,YAAU,KAAI,IAAE,SAASD,IAAEC,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,qBAAOE,KAAED,KAAEC,KAAEA,GAAE,SAAS,KAAGF,KAAE,EAAEA,EAAC,IAAE,IAAI,IAAIA,EAAC,IAAE,EAAE,UAAUA,EAAC,GAAE,EAAE,aAAaA,IAAEC,KAAE,SAAO,MAAM;AAAA,YAAE,GAAE,IAAE,SAASD,IAAE;AAAC,kBAAIE,KAAE,EAAEF,IAAE,IAAE;AAAE,qBAAOE,GAAE,WAASA,KAAE,IAAI,WAAWA,EAAC,IAAGA;AAAA,YAAC,GAAE,SAASF,IAAEC,IAAEC,IAAE;AAAC,kBAAIC,KAAE,EAAE,UAAU,SAAO,KAAG,WAAS,UAAU,CAAC,MAAI,UAAU,CAAC,GAAEC,KAAE,EAAEJ,EAAC;AAAE,cAAAI,MAAGH,GAAEG,EAAC,GAAEJ,KAAE,EAAEA,EAAC,IAAE,IAAI,IAAIA,EAAC,IAAE,EAAE,UAAUA,EAAC,GAAE,EAAE,SAASA,IAAEG,KAAE,SAAO,SAAQ,SAASH,IAAEI,IAAE;AAAC,gBAAAJ,KAAEE,GAAEF,EAAC,IAAEC,GAAEE,KAAEC,GAAE,SAAOA,EAAC;AAAA,cAAC,EAAE;AAAA,YAAC,GAAE,CAAC,EAAE,eAAa,QAAQ,KAAK,SAAO,KAAG,QAAQ,KAAK,CAAC,EAAE,QAAQ,OAAM,GAAG,GAAE,QAAQ,KAAK,MAAM,CAAC,GAAE,eAAa,OAAO,WAAS,OAAO,UAAQ,IAAG,QAAQ,GAAG,sBAAqB,SAASJ,IAAE;AAAC,kBAAG,EAAE,aAAWA,MAAGA,cAAa,KAAGA,GAAE,mBAAmB,GAAG,OAAMA;AAAA,YAAC,EAAE,GAAE,IAAE,SAASA,IAAEC,IAAE;AAAC,oBAAM,QAAQ,WAASD,IAAEC;AAAA,YAAC,GAAE,EAAE,UAAQ,WAAU;AAAC,qBAAM;AAAA,YAA4B;AAAA,UAAC,MAAK,EAAC,KAAG,OAAK,IAAE,IAAE,KAAK,SAAS,OAAK,eAAa,OAAO,YAAU,SAAS,kBAAgB,IAAE,SAAS,cAAc,MAAK,IAAE,MAAI,EAAE,QAAQ,OAAO,IAAE,EAAE,OAAO,GAAE,EAAE,QAAQ,UAAS,EAAE,EAAE,YAAY,GAAG,IAAE,CAAC,IAAE,IAAG,IAAE,SAASD,IAAE;AAAC,gBAAG;AAAC,kBAAIC,KAAE,IAAI;AAAe,qBAAOA,GAAE,KAAK,OAAMD,IAAE,KAAE,GAAEC,GAAE,KAAK,IAAI,GAAEA,GAAE;AAAA,YAAY,SAAOA,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,kBAAGE,GAAE,SAAO,SAASF,IAAE;AAAC,yBAAQC,KAAE,CAAC,GAAEC,KAAE,GAAEA,KAAEF,GAAE,QAAOE,MAAI;AAAC,sBAAIC,KAAEH,GAAEE,EAAC;AAAE,kBAAAC,KAAE,QAAMA,MAAG,MAAKF,GAAE,KAAK,OAAO,aAAaE,EAAC,CAAC;AAAA,gBAAC;AAAC,uBAAOF,GAAE,KAAK,EAAE;AAAA,cAAC,GAAEC,EAAC;AAAE,oBAAMD;AAAA,YAAC;AAAA,UAAC,GAAE,MAAI,IAAE,SAASD,IAAE;AAAC,gBAAG;AAAC,kBAAIC,KAAE,IAAI;AAAe,qBAAOA,GAAE,KAAK,OAAMD,IAAE,KAAE,GAAEC,GAAE,eAAa,eAAcA,GAAE,KAAK,IAAI,GAAE,IAAI,WAAWA,GAAE,QAAQ;AAAA,YAAC,SAAOA,IAAE;AAAC,kBAAIC,KAAE,EAAEF,EAAC;AAAE,kBAAGE,GAAE,QAAOA;AAAE,oBAAMD;AAAA,YAAC;AAAA,UAAC,IAAG,SAASD,IAAEC,IAAEC,IAAE;AAAC,gBAAIC,KAAE,IAAI;AAAe,YAAAA,GAAE,KAAK,OAAMH,IAAE,IAAE,GAAEG,GAAE,eAAa,eAAcA,GAAE,SAAO,WAAU;AAAC,kBAAG,OAAKA,GAAE,UAAQ,KAAGA,GAAE,UAAQA,GAAE,SAAS,CAAAF,GAAEE,GAAE,QAAQ;AAAA,mBAAM;AAAC,oBAAIC,KAAE,EAAEJ,EAAC;AAAE,gBAAAI,KAAEH,GAAEG,GAAE,MAAM,IAAEF,GAAE;AAAA,cAAC;AAAA,YAAC,GAAEC,GAAE,UAAQD,IAAEC,GAAE,KAAK,IAAI;AAAA,UAAC,GAAE,SAASH,IAAE;AAAC,mBAAO,SAAS,QAAMA;AAAA,UAAC;AAAG,YAAE,SAAO,QAAQ,IAAI,KAAK,OAAO;AAAE,cAAI,GAAE,IAAE,EAAE,YAAU,QAAQ,MAAM,KAAK,OAAO;AAAE,iBAAO,OAAO,GAAE,CAAC,GAAE,IAAE,MAAK,EAAE,aAAW,EAAE,WAAU,EAAE,eAAa,EAAE,aAAY,EAAE,SAAO,IAAE,EAAE,OAAM,EAAE,eAAa,IAAE,EAAE;AAAY,cAAI,GAAE,IAAE,EAAE,iBAAe,MAAG,IAAE,EAAC,QAAO,SAASA,IAAE;AAAC,iBAAK,SAAO,IAAI,YAAY,QAAMA,GAAE,OAAO;AAAA,UAAC,GAAE,QAAO,SAASA,IAAE;AAAA,UAAC,GAAE,UAAS,SAASA,IAAEC,IAAE;AAAC,iBAAK,WAAQ,SAASD,IAAE;AAAC,uBAAQC,IAAEC,KAAE,IAAI,WAAW,GAAG,GAAEC,KAAE,IAAGA,MAAG,GAAE,EAAEA,GAAE,CAAAD,GAAE,KAAGC,EAAC,IAAE,KAAGA,IAAED,GAAE,KAAGC,EAAC,IAAEA,IAAED,GAAE,KAAGC,EAAC,IAAE,KAAGA;AAAE,uBAASC,GAAEJ,IAAEC,IAAEE,IAAE;AAAC,yBAAQC,IAAEC,IAAEC,KAAE,GAAEC,KAAEN,IAAEO,KAAEL,GAAE,QAAOM,KAAER,MAAG,IAAEO,MAAG,MAAI,OAAKL,GAAEK,KAAE,CAAC,MAAI,OAAKL,GAAEK,KAAE,CAAC,IAAGF,KAAEE,IAAEF,MAAG,EAAE,CAAAF,KAAEF,GAAEC,GAAE,WAAWG,KAAE,CAAC,CAAC,GAAED,KAAEH,GAAEC,GAAE,WAAWG,KAAE,CAAC,CAAC,GAAEN,GAAEO,IAAG,IAAEL,GAAEC,GAAE,WAAWG,EAAC,CAAC,KAAG,IAAEF,MAAG,GAAEG,KAAEE,OAAIT,GAAEO,IAAG,IAAEH,MAAG,IAAEC,MAAG,IAAGE,KAAEE,OAAIT,GAAEO,IAAG,IAAEF,MAAG,IAAEH,GAAEC,GAAE,WAAWG,KAAE,CAAC,CAAC;AAAA,cAAE;AAAC,uBAASD,KAAG;AAAC,sBAAM,IAAI,MAAM,OAAO;AAAA,cAAC;AAAC,qBAAOH,GAAE,EAAE,IAAE,IAAGA,GAAE,EAAE,IAAE,KAAG,SAASF,IAAE;AAAC,oBAAIE,KAAEF,GAAE,GAAEG,KAAED,GAAE,EAAE,QAAOI,KAAE,IAAI,UAAUH,EAAC,GAAEI,KAAE,IAAI,WAAWJ,EAAC,GAAEK,KAAE,IAAI,WAAWL,EAAC,GAAEM,KAAE,IAAI,WAAWN,EAAC,GAAEO,KAAE,IAAI,YAAYP,EAAC,GAAEQ,KAAE,IAAI,YAAYR,EAAC,GAAES,MAAG,IAAI,aAAaT,EAAC,GAAE,IAAI,aAAaA,EAAC,GAAE,KAAK,OAAMU,MAAG,KAAK,QAAO,KAAK,KAAI,KAAK,QAAOC,MAAG,KAAK,KAAI,KAAK,KAAI,KAAK,OAAM,KAAK,MAAK,KAAK,OAAM,KAAK,MAAKZ,GAAE,IAAGa,KAAEb,GAAE,GAAEc,KAAEd,GAAE,GAAEe,KAAE,SAAQC,KAAE;AAAE,yBAASC,GAAEnB,IAAE;AAAC,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEG,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE;AAAE,kBAAAE,KAAEhB,KAAEgB,KAAE,KAAG;AAAE,qBAAE;AAAC,uBAAE;AAAC,yBAAE;AAAC,2BAAE;AAAC,6BAAE;AAAC,+BAAE;AAAC,iCAAE;AAAC,mCAAE;AAAC,qCAAE;AAAC,uCAAE;AAAC,yCAAE;AAAC,2CAAE;AAAC,6CAAE;AAAC,+CAAE;AAAC,mDAAIjB,MAAG,OAAK,KAAG,KAAI;AAAC,oDAAG,KAAGE,MAAGK,KAAEC,GAAE,GAAG,QAAML,MAAGO,KAAEV,OAAI,IAAE,KAAG,KAAGA,KAAE,KAAG,QAAM,IAAE,KAAG,IAAG;AAAC,kDAAAE,MAAGF,MAAGG,KAAEA,MAAG,KAAG,KAAGD,OAAI,MAAI,KAAG,OAAK,GAAEE,KAAEI,GAAER,KAAE,QAAM,CAAC,IAAG,IAAEE,QAAK,KAAGF,KAAEQ,GAAEJ,KAAE,KAAG,CAAC,OAAKI,GAAER,KAAE,MAAI,CAAC,IAAEE,IAAEM,GAAEN,KAAE,KAAG,CAAC,IAAEF,MAAGQ,GAAE,GAAG,IAAE,GAAGL,EAAC,IAAEI,IAAEP,KAAEI,KAAE,IAAE,GAAEF,KAAEC,MAAG,GAAEK,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEF,IAAEM,IAAGN,KAAEA,KAAEE,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEI,GAAEN,KAAE,KAAG,CAAC;AAAE,wDAAM;AAAA,gDAAC;AAAC,qDAAIa,KAAEP,GAAE,GAAG,OAAK,KAAGE,OAAI,EAAE,OAAM;AAAE,oDAAGR,IAAE;AAAC,kDAAAA,MAAGF,MAAGI,KAAE,GAAG,KAAGJ,MAAG,KAAGA,KAAE,KAAGG,MAAGH,MAAGE,MAAGC,MAAGH,EAAC,MAAI,KAAG,OAAK,GAAEK,KAAEG,GAAER,KAAE,QAAM,CAAC,IAAG,IAAEE,QAAK,KAAGF,KAAEQ,GAAEH,KAAE,KAAG,CAAC,OAAKG,GAAER,KAAE,MAAI,CAAC,IAAEE,IAAEM,GAAEN,KAAE,KAAG,CAAC,IAAEF,OAAIO,KAAE,GAAGH,EAAC,IAAEG,IAAEC,GAAE,GAAG,IAAED,KAAGC,GAAEH,KAAE,KAAG,CAAC,IAAE,IAAEK,IAAEN,MAAGJ,KAAEI,MAAG,KAAGM,KAAE,GAAEF,IAAGL,KAAEE,KAAEK,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEN,IAAEI,GAAER,KAAEK,MAAG,CAAC,IAAED,IAAEW,OAAIb,KAAE,QAAM,KAAGa,MAAG,GAAET,KAAEE,GAAE,GAAG,IAAGR,KAAE,MAAIe,OAAI,MAAIR,KAAEP,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEO,IAAEP,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEI,IAAEE,GAAER,KAAE,MAAI,CAAC,IAAEM,IAAEE,GAAEF,KAAE,MAAI,CAAC,IAAEJ,IAAEM,GAAEF,KAAE,KAAG,CAAC,IAAEN,KAAGA,KAAEK,KAAE,IAAE,GAAEG,GAAE,GAAG,IAAEL,IAAEK,GAAE,GAAG,IAAEJ;AAAE,wDAAM;AAAA,gDAAC;AAAC,oDAAG,EAAEU,KAAEN,GAAE,GAAG,GAAG,OAAM;AAAE,qDAAIL,KAAEK,GAAE,QAAM,GAAG,IAAEM,KAAEA,EAAC,KAAG,MAAI,CAAC,GAAER,MAAG,KAAGE,GAAEL,KAAE,KAAG,CAAC,KAAGO,KAAE,GAAER,KAAEC,KAAGH,KAAEQ,GAAEN,KAAE,MAAI,CAAC,OAAKF,KAAEQ,GAAEN,KAAE,MAAI,CAAC,KAAI,CAAAI,MAAGF,MAAGF,MAAG,KAAGM,GAAER,KAAE,KAAG,CAAC,KAAGU,KAAE,OAAK,IAAEJ,OAAI,KAAGJ,KAAEI,IAAEH,KAAEC,KAAEJ,KAAEG,IAAED,KAAEF;AAAE,oDAAGY,KAAEJ,GAAEL,KAAE,MAAI,CAAC,IAAG,KAAGC,KAAEI,GAAEL,KAAE,MAAI,CAAC,QAAM,IAAEA,KAAG;AAAC,kDAAAH,KAAEQ,GAAEL,KAAE,KAAG,CAAC,GAAEK,GAAER,KAAE,MAAI,CAAC,IAAEI,IAAEI,GAAEJ,KAAE,KAAG,CAAC,IAAEJ;AAAE,wDAAM;AAAA,gDAAC;AAAC,oDAAG,EAAEA,KAAEQ,IAAGN,KAAEC,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,sDAAG,EAAEH,KAAEQ,GAAEL,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,kDAAAD,KAAEC,KAAE,KAAG;AAAA,gDAAC;AAAC,uDAAKE,KAAEH,IAAEE,KAAEJ,KAAGA,KAAEQ,IAAGN,KAAEF,KAAE,KAAG,MAAI,CAAC,OAAKE,KAAEE,KAAE,KAAG,GAAEJ,KAAEQ,GAAEJ,KAAE,MAAI,CAAC,KAAI;AAAC,gDAAAI,GAAEH,MAAG,CAAC,IAAE;AAAE,sDAAM;AAAA,8CAAC;AAAC,kDAAGK,KAAE,IAAG,EAAEV,OAAI,IAAE,gBAAcU,KAAE,MAAIV,KAAEA,KAAE,KAAG,IAAGc,KAAEN,GAAE,GAAG,IAAG;AAAC,gDAAAF,KAAE,IAAEI,KAAE,GAAEH,KAAE,GAAEG,OAAI,IAAE,QAAMH,KAAE,IAAGG,OAAI,IAAE,aAAWH,KAAE,OAAKG,OAAI,MAAIV,KAAEa,GAAEb,OAAI,IAAE,CAAC,KAAG,MAAIA,MAAG,KAAG,KAAG;AAAI,mDAAE;AAAC,qDAAE;AAAC,wDAAGE,KAAEM,GAAE,QAAMD,MAAG,MAAI,CAAC,EAAE,MAAIP,KAAE,GAAEG,KAAEO,OAAI,OAAK,IAAEH,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,QAAK;AAAC,0DAAG,GAAGF,MAAG,KAAGG,GAAEN,KAAE,KAAG,CAAC,KAAGQ,KAAE,OAAK,KAAGJ,OAAI,MAAIF,KAAEF,IAAEI,KAAED,IAAEA,MAAI;AAAC,wDAAAC,KAAE,GAAEN,KAAEE;AAAE,8DAAM;AAAA,sDAAC;AAAC,0DAAGG,KAAEG,GAAEN,KAAE,MAAI,CAAC,GAAEA,KAAEM,GAAE,OAAKL,OAAI,KAAG,KAAGD,KAAE,MAAI,CAAC,GAAEF,KAAEK,MAAG,IAAEA,QAAK,IAAEH,MAAGF,KAAEK,KAAEL,IAAEG,OAAI,GAAE,CAACD,GAAE;AAAA,oDAAK;AAAA,wDAAM,CAAAF,KAAE;AAAE,wDAAG,EAAEA,KAAEI,KAAG;AAAC,0DAAGA,KAAE,GAAE,EAAEJ,MAAG,KAAGA,KAAE,KAAGO,MAAGP,MAAGc,IAAG,OAAM;AAAE,sDAAAd,KAAEQ,GAAE,QAAM,GAAGR,KAAE,IAAEA,EAAC,KAAG,MAAI,CAAC;AAAA,oDAAC;AAAC,wDAAG,CAACA,GAAE,OAAM;AAAA,kDAAC;AAAC,yDAAKM,MAAGH,MAAGD,MAAG,KAAGM,GAAER,KAAE,KAAG,CAAC,KAAGU,KAAE,OAAK,IAAEJ,OAAI,KAAGJ,KAAEI,IAAEF,KAAED,KAAEH,KAAEI,IAAEJ,MAAGE,KAAEM,GAAER,KAAE,MAAI,CAAC,MAAIQ,GAAER,KAAE,MAAI,CAAC,IAAG;AAAA,gDAAC;AAAC,oDAAG,EAAE,CAACI,KAAEI,GAAE,GAAG,IAAEE,OAAI,KAAGJ,OAAI,IAAG;AAAC,sDAAGC,KAAEC,GAAEJ,KAAE,MAAI,CAAC,IAAG,IAAEA,QAAK,KAAGD,KAAEK,GAAEJ,KAAE,MAAI,CAAC,KAAI;AAAC,oDAAAJ,KAAEQ,GAAEJ,KAAE,KAAG,CAAC,GAAEI,GAAER,KAAE,MAAI,CAAC,IAAEG,IAAEK,GAAEL,KAAE,KAAG,CAAC,IAAEH;AAAE,0DAAM;AAAA,kDAAC;AAAC,sDAAG,EAAEA,KAAEQ,IAAGN,KAAEE,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,wDAAG,EAAEJ,KAAEQ,GAAEJ,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,oDAAAF,KAAEE,KAAE,KAAG;AAAA,kDAAC;AAAC,yDAAKC,KAAEH,IAAEC,KAAEH,KAAGA,KAAEQ,IAAGN,KAAEF,KAAE,KAAG,MAAI,CAAC,OAAKE,KAAEC,KAAE,KAAG,GAAEH,KAAEQ,GAAEL,KAAE,MAAI,CAAC,KAAI;AAAC,kDAAAK,GAAEH,MAAG,CAAC,IAAE;AAAE,wDAAM;AAAA,gDAAC;AAAA,8CAAC;AAAA,4CAAC;AAAC,iDAAIL,KAAEQ,GAAE,GAAG,OAAK,KAAGE,OAAI,GAAE;AAAC,8CAAAN,KAAEI,GAAE,GAAG,IAAGN,KAAEF,KAAEU,KAAE,OAAK,KAAG,MAAIF,IAAGL,KAAEC,KAAEM,KAAE,KAAG,KAAG,CAAC,IAAE,IAAER,IAAEM,GAAER,KAAEI,MAAG,CAAC,IAAEF,IAAEM,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEM,OAAIF,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEJ,IAAEQ,IAAGR,KAAEA,KAAEI,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEI,GAAER,KAAE,KAAG,CAAC,GAAEG,KAAE,GAAED,KAAE,IAAGM,GAAE,GAAG,IAAEN,IAAEM,GAAE,GAAG,IAAEL,IAAEH,KAAEI,KAAE,IAAE;AAAE,oDAAM;AAAA,4CAAC;AAAC,iDAAIQ,KAAEJ,GAAE,GAAG,OAAK,IAAEE,OAAI,GAAE;AAAC,8CAAAR,KAAEU,KAAEF,KAAE,GAAEF,GAAE,GAAG,IAAEN,IAAEF,MAAGG,KAAEK,GAAE,GAAG,KAAGE,KAAE,GAAEF,GAAE,GAAG,IAAER,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,IAAEE,IAAEM,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEO,IAAEV,KAAEG,KAAE,IAAE;AAAE,oDAAM;AAAA,4CAAC;AAAC,gDAAGH,KAAE,GAAEc,KAAEJ,KAAE,KAAG,GAAEF,GAAE,GAAG,IAAEL,KAAEK,GAAE,GAAG,KAAGA,GAAE,GAAG,IAAE,IAAGA,GAAE,GAAG,IAAE,IAAGA,GAAE,GAAG,IAAE,MAAKA,GAAE,GAAG,IAAE,MAAKA,GAAE,GAAG,IAAEP,KAAE,KAAG,MAAI,YAAWO,GAAE,GAAG,IAAE,GAAEA,GAAE,GAAG,IAAE,GAAEL,KAAE,QAAOD,MAAGG,KAAES,KAAEX,KAAE,MAAIG,KAAE,IAAEH,KAAE,QAAM,KAAGO,OAAI,EAAE,OAAM;AAAE,iDAAIN,KAAEI,GAAE,GAAG,MAAIJ,OAAI,KAAGG,MAAGJ,KAAEK,GAAE,GAAG,KAAGN,KAAE,OAAK,IAAEC,OAAI,KAAGI,OAAI,EAAE,OAAM;AAAE,+CAAE;AAAC,kDAAG,EAAE,IAAEE,GAAE,IAAI,IAAG;AAAC,mDAAE;AAAC,qDAAE;AAAC,uDAAE;AAAC,yDAAE;AAAC,4DAAGL,KAAEI,GAAE,GAAG,EAAE,MAAIR,KAAE,UAAO;AAAC,+DAAIG,KAAEK,GAAER,MAAG,CAAC,OAAK,KAAGI,OAAI,IAAEA,OAAI,IAAED,KAAEK,GAAER,KAAE,KAAG,CAAC,MAAI,EAAE,OAAM;AAAE,8DAAG,EAAEA,KAAEQ,GAAER,KAAE,KAAG,CAAC,GAAG;AAAA,wDAAK;AAAC,4DAAG,OAAK,KAAGG,KAAEiB,GAAE,CAAC,IAAI,OAAM;AAAE,4DAAGb,KAAEL,KAAGF,MAAGI,KAAEI,GAAE,GAAG,KAAG,IAAE,KAAGL,OAAII,MAAGL,KAAEC,KAAE,MAAIH,KAAEG,KAAE,IAAEC,MAAG,IAAGG,OAAI,KAAGG,OAAI,EAAE,OAAM;AAAE,6DAAIN,KAAEI,GAAE,GAAG,MAAIJ,OAAI,KAAGE,MAAGN,KAAEQ,GAAE,GAAG,KAAGD,KAAE,OAAK,IAAEP,OAAI,KAAGM,OAAI,EAAE,OAAM;AAAE,6DAAI,IAAEH,QAAK,KAAGH,KAAEoB,GAAEb,EAAC,IAAI,OAAM;AAAE,8DAAM;AAAA,sDAAC;AAAC,2DAAI,KAAGJ,KAAEiB,GAAEb,KAAED,KAAED,KAAEO,EAAC,QAAMJ,GAAER,MAAG,CAAC,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,GAAG,OAAM;AAAE,sDAAAA,KAAEG;AAAA,oDAAC;AAAC,wDAAG,OAAK,IAAEH,IAAG,OAAM;AAAE,wDAAGU,KAAE,OAAK,KAAGH,OAAI,GAAE;AAAC,sDAAAJ,KAAEH;AAAE,4DAAM;AAAA,oDAAC;AAAC,wDAAG,OAAK,IAAEoB,GAAEjB,MAAGA,KAAEK,GAAE,GAAG,MAAIM,KAAEP,KAAE,KAAG,IAAEJ,EAAC,GAAG,OAAM;AAAE,oDAAAI,KAAEJ,KAAEI,KAAE,GAAEJ,KAAEH;AAAE,0DAAM;AAAA,kDAAC;AAAC,sDAAG,OAAK,IAAEG,IAAG,OAAM;AAAA,gDAAC;AAAC,gDAAAK,GAAE,GAAG,IAAE,IAAEA,GAAE,GAAG;AAAA,8CAAC;AAAC,kDAAG,OAAK,KAAGL,KAAEiB,GAAElB,EAAC,MAAI,OAAK,KAAGF,KAAEoB,GAAE,CAAC,MAAIpB,OAAI,KAAGG,OAAI,EAAE,OAAM;AAAE,mDAAII,KAAEP,KAAEG,KAAE,OAAK,KAAGO,KAAE,OAAK,EAAE,OAAM;AAAA,4CAAC;AAAC,4CAAAV,KAAEQ,GAAE,GAAG,IAAED,KAAE,GAAEC,GAAE,GAAG,IAAER,IAAEA,OAAI,IAAEW,GAAE,GAAG,MAAIH,GAAE,GAAG,IAAER;AAAG,+CAAE;AAAC,kDAAGK,KAAEG,GAAE,GAAG,GAAE;AAAC,qDAAIR,KAAE,UAAO;AAAC,wDAAKI,KAAEI,GAAER,MAAG,CAAC,MAAIE,KAAEM,GAAER,KAAE,KAAG,CAAC,KAAG,OAAK,IAAEG,IAAG,OAAM;AAAE,sDAAG,EAAEH,KAAEQ,GAAER,KAAE,KAAG,CAAC,GAAG;AAAA,gDAAK;AAAC,sDAAM;AAAA,8CAAC;AAAC,oDAAKA,KAAEQ,GAAE,GAAG,OAAK,KAAGL,OAAI,KAAGH,OAAIQ,GAAE,GAAG,IAAEL,KAAGH,KAAE,GAAEQ,GAAE,GAAG,IAAED,IAAEC,GAAE,GAAG,IAAEL,IAAEK,GAAE,GAAG,IAAE,IAAGA,GAAE,GAAG,IAAEA,GAAE,GAAG,GAAEA,GAAE,GAAG,IAAE,GAAEN,MAAGE,KAAEJ,MAAG,KAAG,OAAK,GAAEQ,GAAEJ,KAAE,QAAM,CAAC,IAAEF,IAAEM,GAAEJ,KAAE,QAAM,CAAC,IAAEF,IAAE,OAAK,KAAGF,KAAEA,KAAE,IAAE,MAAK;AAAC,8CAAAE,MAAGE,KAAEG,KAAE,KAAG,MAAIP,KAAEG,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAG,GAAEK,GAAE,GAAG,IAAEN,IAAEF,KAAEA,KAAEG,KAAE,GAAEK,GAAE,GAAG,IAAER,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,IAAEE,IAAEM,GAAE,KAAGL,KAAEC,KAAE,MAAI,CAAC,IAAE,IAAGI,GAAE,GAAG,IAAEA,GAAE,GAAG;AAAE,oDAAM;AAAA,4CAAC;AAAC,gDAAG,IAAEA,GAAER,KAAE,MAAI,CAAC,IAAEG,OAAI,KAAGE,OAAI,IAAED,OAAI,IAAEC,OAAI,EAAE,OAAM;AAAE,4CAAAG,GAAER,KAAE,KAAG,CAAC,IAAEE,KAAEK,IAAEJ,MAAGH,KAAEK,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAGA,KAAE,GAAEG,GAAE,GAAG,IAAEL,IAAEH,MAAGE,KAAEM,GAAE,GAAG,IAAED,KAAE,KAAGP,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,GAAE,KAAGN,KAAEG,KAAE,MAAI,CAAC,IAAE,IAAGG,GAAE,GAAG,IAAEA,GAAE,GAAG;AAAE,kDAAM;AAAA,0CAAC;AAAC,0CAAAJ,KAAE;AAAE,gDAAM;AAAA,wCAAC;AAAC,wCAAAD,KAAE;AAAE,8CAAM;AAAA,sCAAC;AAAC,sCAAAQ,GAAE,GAAG,IAAER,OAAI,MAAIK,GAAE,GAAG,IAAEL,KAAGD,KAAEC,KAAEI,KAAE,GAAEP,KAAE;AAAK,yCAAE;AAAC,2CAAE;AAAC,6CAAE;AAAC,uDAAO;AAAC,mDAAI,IAAEE,OAAIM,GAAER,MAAG,CAAC,GAAE;AAAC,oDAAGA,KAAEQ,GAAER,KAAE,KAAG,CAAC,EAAE;AAAS,sDAAM;AAAA,8CAAC;AAAC;AAAA,4CAAK;AAAC,gDAAG,EAAE,IAAES,GAAET,KAAE,KAAG,CAAC,GAAG,OAAM;AAAA,0CAAC;AAAC,+CAAIA,KAAE,UAAO;AAAC,iDAAIE,KAAEM,GAAER,MAAG,CAAC,OAAK,KAAGK,OAAI,MAAIC,KAAEJ,KAAEM,GAAER,KAAE,KAAG,CAAC,IAAE,OAAK,IAAEK,OAAI,EAAE,OAAM;AAAE,4CAAAL,KAAEQ,GAAER,KAAE,KAAG,CAAC;AAAA,0CAAC;AAAA,wCAAC;AAAC,4CAAGQ,GAAER,MAAG,CAAC,IAAEG,IAAEK,GAAER,KAAE,KAAG,CAAC,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAEO,IAAEC,IAAGM,MAAGX,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAGA,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEO,IAAEV,MAAGO,KAAEL,MAAGA,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAG,MAAIU,KAAEF,KAAEI,KAAE,KAAG,IAAG,IAAET,QAAK,IAAEE,KAAG;AAAC,0CAAAC,GAAE,GAAG,IAAEI,IAAEZ,KAAEQ,GAAE,GAAG,IAAER,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEI,KAAE,KAAG,CAAC,IAAE,IAAEZ;AAAE,gDAAM;AAAA,wCAAC;AAAC,4CAAGQ,GAAE,GAAG,MAAI,IAAED,KAAG;AAAC,0CAAAC,GAAE,GAAG,IAAEI,IAAEZ,KAAEQ,GAAE,GAAG,IAAER,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEI,KAAE,KAAG,CAAC,IAAE,IAAEZ,IAAEQ,GAAER,KAAEY,MAAG,CAAC,IAAEZ;AAAE,gDAAM;AAAA,wCAAC;AAAC,4CAAG,MAAI,KAAGM,KAAEE,GAAED,KAAE,KAAG,CAAC,IAAI,OAAM;AAAE,4CAAGF,KAAE,KAAGC,IAAEA,OAAI,KAAG,KAAI;AAAC,+CAAI,KAAGH,KAAEK,GAAED,KAAE,MAAI,CAAC,QAAM,KAAGL,KAAEM,GAAED,KAAE,KAAG,CAAC,KAAI;AAAC,4CAAAC,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGF,OAAI,IAAE,CAAC;AAAE,kDAAM;AAAA,0CAAC;AAAC,0CAAAE,GAAEN,KAAE,MAAI,CAAC,IAAEC,IAAEK,GAAEL,KAAE,KAAG,CAAC,IAAED;AAAE,gDAAM;AAAA,wCAAC;AAAC,4CAAGQ,KAAEF,GAAED,KAAE,MAAI,CAAC,IAAG,IAAEA,QAAK,KAAGJ,KAAEK,GAAED,KAAE,MAAI,CAAC,KAAI;AAAC,0CAAAL,KAAEM,GAAED,KAAE,KAAG,CAAC,GAAEC,GAAEN,KAAE,MAAI,CAAC,IAAEC,IAAEK,GAAEL,KAAE,KAAG,CAAC,IAAED;AAAE,gDAAM;AAAA,wCAAC;AAAC,4CAAG,EAAEI,KAAEE,IAAGN,KAAEK,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,8CAAG,EAAED,KAAEE,GAAED,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,0CAAAL,KAAEK,KAAE,KAAG;AAAA,wCAAC;AAAC,+CAAKH,KAAEF,KAAGI,KAAEE,IAAGN,MAAGC,KAAEG,MAAG,KAAG,MAAI,CAAC,OAAKJ,KAAEC,KAAE,KAAG,GAAEG,KAAEE,GAAEL,KAAE,MAAI,CAAC,KAAI;AAAC,wCAAAK,GAAEJ,MAAG,CAAC,IAAE;AAAE,8CAAM;AAAA,sCAAC;AAAC,2CAAIF,MAAGE,KAAEG,KAAE,KAAG,MAAIP,KAAEG,KAAE,IAAE,IAAE,KAAGA,KAAE,IAAE,KAAG,GAAEK,GAAE,GAAG,IAAEN,IAAEF,KAAEA,KAAEG,KAAE,GAAEK,GAAE,GAAG,IAAER,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,IAAEE,IAAEM,GAAE,KAAGL,KAAEC,KAAE,MAAI,CAAC,IAAE,IAAGI,GAAE,GAAG,IAAEA,GAAE,GAAG,GAAEA,IAAGJ,MAAGJ,MAAGM,MAAGA,KAAE,KAAG,IAAE,KAAGA,KAAE,IAAE,KAAG,KAAG,KAAG,OAAK,IAAED,KAAE,OAAK,IAAEA,KAAEL,MAAG,KAAG,CAAC,IAAE,IAAGA,KAAEQ,GAAE,GAAG,GAAEA,GAAEJ,KAAE,MAAI,CAAC,IAAEI,GAAE,GAAG,GAAEA,GAAEJ,KAAE,MAAI,CAAC,IAAEJ,IAAEA,KAAEQ,GAAE,GAAG,GAAEA,GAAEJ,KAAE,KAAG,CAAC,IAAEI,GAAE,GAAG,GAAEA,GAAEJ,KAAE,MAAI,CAAC,IAAEJ,IAAEQ,GAAE,GAAG,IAAEJ,KAAE,GAAEI,GAAE,GAAG,IAAED,IAAEC,GAAE,GAAG,IAAEL,IAAEK,GAAE,GAAG,IAAE,GAAER,KAAEI,KAAE,KAAG,GAAEI,GAAER,KAAE,KAAG,CAAC,IAAE,GAAEE,KAAEF,KAAE,IAAE,GAAEA,KAAEA,KAAE,IAAE,GAAEE,OAAI,IAAEI,OAAI,IAAG;AAAC,2CAAI,IAAEF,QAAK,IAAEC,IAAG,KAAGG,GAAEJ,KAAE,KAAG,CAAC,IAAE,KAAGI,GAAEJ,KAAE,KAAG,CAAC,GAAEE,KAAEF,KAAEC,KAAE,GAAEG,GAAEH,KAAE,KAAG,CAAC,IAAE,IAAEC,IAAEE,GAAEJ,MAAG,CAAC,IAAEE,IAAEA,OAAI,KAAG,IAAI,CAAAJ,KAAE,QAAM,KAAGI,MAAG,IAAGH,KAAEK,GAAE,GAAG,MAAIR,KAAE,MAAIM,OAAI,MAAIN,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEG,IAAEH,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL;AAAA,2CAAM;AAAC,wCAAAA,KAAE,IAAGM,OAAI,KAAG,aAAWN,KAAE,OAAKM,OAAI,MAAIN,KAAEa,GAAEP,OAAI,IAAE,CAAC,KAAG,MAAIN,MAAG,KAAG,KAAG,IAAGQ,GAAEH,KAAE,MAAI,CAAC,IAAEL,IAAEQ,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEG,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEH,KAAE,QAAMF,MAAG,KAAG;AAAE,2CAAE;AAAC,+CAAII,KAAEI,GAAE,GAAG,MAAIL,KAAE,KAAGH,KAAG;AAAC,iDAAIA,KAAEM,OAAI,OAAK,IAAEN,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,IAAGI,KAAEI,GAAEN,MAAG,CAAC,OAAI;AAAC,mDAAI,IAAEI,QAAK,KAAGE,IAAGN,KAAEE,MAAG,KAAG,CAAC,GAAG,OAAM;AAAE,kDAAGD,KAAEH,OAAI,KAAG,GAAEA,OAAI,GAAE,EAAEI,KAAEI,IAAGL,MAAG,IAAEA,MAAGD,KAAE,KAAG,MAAI,CAAC,GAAG;AAAA,4CAAK;AAAC,4CAAAM,GAAEL,KAAE,MAAI,CAAC,IAAEE;AAAA,0CAAC,MAAM,CAAAG,GAAE,GAAG,IAAEL,KAAEC,IAAEI,GAAEN,MAAG,CAAC,IAAEG;AAAE,0CAAAG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,MAAI,CAAC,IAAEA,IAAEG,GAAEH,KAAE,KAAG,CAAC,IAAEA;AAAE,gDAAM;AAAA,wCAAC;AAAC,wCAAAL,KAAEQ,GAAEN,KAAE,KAAG,CAAC,GAAEM,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL;AAAA,sCAAC;AAAA,oCAAC;AAAC,wCAAG,GAAGA,KAAEQ,GAAE,GAAG,OAAK,KAAGE,OAAI,IAAG;AAAC,sCAAAR,KAAEF,KAAEU,KAAE,GAAEF,GAAE,GAAG,IAAEN,IAAEF,MAAGG,KAAEK,GAAE,GAAG,KAAGE,KAAE,GAAEF,GAAE,GAAG,IAAER,IAAEQ,GAAER,KAAE,KAAG,CAAC,IAAE,IAAEE,IAAEM,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEO,IAAEV,KAAEG,KAAE,IAAE;AAAE,4CAAM;AAAA,oCAAC;AAAA,kCAAC;AAAC,kCAAAK,GAAE,GAAG,IAAE,IAAGR,KAAE;AAAE,wCAAM;AAAA,gCAAC;AAAC,gCAAAG,KAAE;AAAA,8BAAC;AAAC,kCAAGO,IAAE;AAAC,gCAAAN,KAAEI,GAAED,KAAE,MAAI,CAAC;AAAE,mCAAE;AAAC,sCAAGC,IAAGN,KAAE,QAAME,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEG,KAAG;AAAC,wCAAGC,GAAEN,MAAG,CAAC,IAAEC,IAAEA,GAAE,OAAM;AAAE,oCAAAK,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGJ,EAAC;AAAE,0CAAM;AAAA,kCAAC;AAAC,sCAAGI,GAAEE,MAAGF,GAAEE,KAAE,MAAI,CAAC,MAAI,IAAEH,MAAG,KAAG,OAAK,CAAC,IAAEJ,IAAE,CAACA,GAAE,OAAM;AAAA,gCAAC;AAAC,gCAAAK,GAAEL,KAAE,MAAI,CAAC,IAAEO,KAAGR,KAAEM,GAAED,KAAE,MAAI,CAAC,OAAKC,GAAEL,KAAE,MAAI,CAAC,IAAED,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAEC,MAAID,KAAEM,GAAED,KAAE,MAAI,CAAC,OAAKC,GAAEL,KAAE,MAAI,CAAC,IAAED,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAEC;AAAA,8BAAE;AAAA,4BAAC;AAAC,4BAAAH,KAAEA,KAAEK,KAAE,GAAEC,KAAEE,IAAGD,KAAEF,KAAEE,KAAE,KAAG,KAAG,CAAC;AAAA,0BAAC;AAAC,8BAAGC,GAAED,KAAE,KAAG,CAAC,IAAE,KAAGD,IAAEE,GAAEI,KAAE,KAAG,CAAC,IAAE,IAAEZ,IAAEQ,GAAER,KAAEY,MAAG,CAAC,IAAEZ,IAAEA,OAAI,KAAG,IAAI,CAAAE,KAAE,QAAM,KAAGF,MAAG,IAAGG,KAAEK,GAAE,GAAG,MAAIR,KAAE,MAAIA,OAAI,MAAIA,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEG,IAAEH,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEU,IAAEJ,GAAER,KAAE,MAAI,CAAC,IAAEY,IAAEJ,GAAEI,KAAE,MAAI,CAAC,IAAEV,IAAEM,GAAEI,KAAE,KAAG,CAAC,IAAEZ;AAAA,+BAAM;AAAC,4BAAAM,KAAE,IAAGN,OAAI,KAAG,aAAWM,KAAE,OAAKN,OAAI,MAAIE,KAAEW,GAAEb,OAAI,IAAE,CAAC,KAAG,MAAIE,MAAG,KAAG,KAAG,IAAGM,GAAEI,KAAE,MAAI,CAAC,IAAEN,IAAEE,GAAEI,KAAE,MAAI,CAAC,IAAE,GAAEJ,GAAEI,KAAE,MAAI,CAAC,IAAE,GAAEV,KAAE,QAAMI,MAAG,KAAG;AAAE,+BAAE;AAAC,mCAAIF,KAAEI,GAAE,GAAG,MAAIL,KAAE,KAAGG,KAAG;AAAC,qCAAIA,KAAEN,OAAI,OAAK,IAAEM,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,IAAGH,KAAEK,GAAEN,MAAG,CAAC,OAAI;AAAC,sCAAGA,KAAEC,KAAG,KAAGK,GAAEL,KAAE,KAAG,CAAC,OAAK,IAAEH,IAAG,OAAM;AAAE,sCAAGG,KAAEG,OAAI,KAAG,GAAEA,OAAI,GAAE,EAAEH,KAAEK,IAAGJ,MAAG,IAAED,MAAGD,KAAE,KAAG,MAAI,CAAC,GAAG;AAAA,gCAAK;AAAC,gCAAAM,GAAEJ,KAAE,MAAI,CAAC,IAAEQ;AAAA,8BAAC,MAAM,CAAAJ,GAAE,GAAG,IAAEL,KAAEC,IAAEI,GAAEN,MAAG,CAAC,IAAEU;AAAE,8BAAAJ,GAAEI,KAAE,MAAI,CAAC,IAAEV,IAAEM,GAAEI,KAAE,MAAI,CAAC,IAAEA,IAAEJ,GAAEI,KAAE,KAAG,CAAC,IAAEA;AAAE,oCAAM;AAAA,4BAAC;AAAC,4BAAAZ,KAAEQ,GAAEN,KAAE,KAAG,CAAC,GAAEM,GAAER,KAAE,MAAI,CAAC,IAAEY,IAAEJ,GAAEN,KAAE,KAAG,CAAC,IAAEU,IAAEJ,GAAEI,KAAE,MAAI,CAAC,IAAE,GAAEJ,GAAEI,KAAE,MAAI,CAAC,IAAEV,IAAEM,GAAEI,KAAE,KAAG,CAAC,IAAEZ;AAAA,0BAAC;AAAA,wBAAC;AAAC,wBAAAA,KAAEc,KAAE,IAAE;AAAE,8BAAM;AAAA,sBAAC;AAAC,wBAAE,KAAGP,IAAE;AAAC,wBAAAL,KAAEM,GAAEJ,KAAE,MAAI,CAAC;AAAE,2BAAE;AAAC,8BAAGI,IAAGR,KAAE,QAAME,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEE,KAAG;AAAC,gCAAGI,GAAER,MAAG,CAAC,IAAEG,IAAEA,GAAE,OAAM;AAAE,4BAAAW,KAAE,GAAGZ,EAAC,IAAEY,IAAEN,GAAE,GAAG,IAAEM;AAAE,kCAAM;AAAA,0BAAC;AAAC,8BAAGN,GAAED,MAAGC,GAAED,KAAE,MAAI,CAAC,MAAI,IAAEH,MAAG,KAAG,OAAK,CAAC,IAAED,IAAE,CAACA,GAAE,OAAM;AAAA,wBAAC;AAAC,wBAAAK,GAAEL,KAAE,MAAI,CAAC,IAAEI,KAAGP,KAAEQ,GAAEJ,KAAE,MAAI,CAAC,OAAKI,GAAEL,KAAE,MAAI,CAAC,IAAEH,IAAEQ,GAAER,KAAE,MAAI,CAAC,IAAEG,MAAIH,KAAEQ,GAAEJ,KAAE,MAAI,CAAC,OAAKI,GAAEL,KAAE,MAAI,CAAC,IAAEH,IAAEQ,GAAER,KAAE,MAAI,CAAC,IAAEG;AAAA,sBAAE;AAAC,wBAAE,KAAGG,OAAI,KAAG,GAAG,CAAAN,KAAEM,KAAEI,KAAE,GAAEF,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEJ,IAAEQ,IAAGR,KAAEA,KAAEI,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEI,GAAER,KAAE,KAAG,CAAC;AAAA,+BAAUQ,GAAEJ,KAAE,KAAG,CAAC,IAAE,IAAEM,IAAEF,IAAGH,KAAED,KAAEM,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEJ,IAAEE,GAAEH,KAAEC,MAAG,CAAC,IAAEA,IAAEA,OAAI,KAAG,IAAI,CAAAJ,KAAE,QAAM,KAAGI,MAAG,IAAGH,KAAEK,GAAE,GAAG,MAAIR,KAAE,MAAIM,OAAI,MAAIN,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEG,IAAEH,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL;AAAA,2BAAM;AAAC,wBAAAA,KAAE,IAAGM,OAAI,KAAG,aAAWN,KAAE,OAAKM,OAAI,MAAIN,KAAEa,GAAEP,OAAI,IAAE,CAAC,KAAG,MAAIN,MAAG,KAAG,KAAG,IAAGQ,GAAEH,KAAE,MAAI,CAAC,IAAEL,IAAEQ,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEG,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEH,KAAE,QAAMF,MAAG,KAAG;AAAE,2BAAE;AAAC,+BAAIG,KAAE,KAAGH,MAAGc,IAAE;AAAC,iCAAId,KAAEM,OAAI,OAAK,IAAEN,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,IAAGU,KAAEF,GAAEN,MAAG,CAAC,OAAI;AAAC,mCAAI,KAAGM,IAAGN,KAAEQ,MAAG,KAAG,CAAC,OAAK,IAAEJ,IAAG,OAAM;AAAE,kCAAGH,KAAEH,OAAI,KAAG,GAAEA,OAAI,GAAE,EAAEU,KAAEF,IAAGL,MAAG,IAAEA,MAAGD,KAAE,KAAG,MAAI,CAAC,GAAG;AAAA,4BAAK;AAAC,4BAAAM,GAAEL,KAAE,MAAI,CAAC,IAAEE;AAAA,0BAAC,MAAM,CAAAG,GAAE,GAAG,IAAEL,KAAEW,IAAEN,GAAEN,MAAG,CAAC,IAAEG;AAAE,0BAAAG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,MAAI,CAAC,IAAEA,IAAEG,GAAEH,KAAE,KAAG,CAAC,IAAEA;AAAE,gCAAM;AAAA,wBAAC;AAAC,wBAAAL,KAAEQ,GAAEN,KAAE,KAAG,CAAC,GAAEM,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAE,GAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL;AAAA,sBAAC;AAAC,sBAAAA,KAAEI,KAAE,IAAE;AAAE,4BAAM;AAAA,oBAAC;AAAC,sBAAE,KAAGQ,IAAE;AAAC,sBAAAV,KAAEM,GAAEL,KAAE,MAAI,CAAC;AAAE,yBAAE;AAAC,4BAAGK,IAAGR,KAAE,QAAME,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEC,KAAG;AAAC,8BAAGK,GAAER,MAAG,CAAC,IAAEI,IAAEA,GAAE,OAAM;AAAE,0BAAAI,GAAE,GAAG,IAAE,GAAGN,EAAC,IAAEY;AAAE,gCAAM;AAAA,wBAAC;AAAC,4BAAGN,GAAEI,MAAGJ,GAAEI,KAAE,MAAI,CAAC,MAAI,IAAET,MAAG,KAAG,OAAK,CAAC,IAAEC,IAAE,CAACA,GAAE,OAAM;AAAA,sBAAC;AAAC,sBAAAI,GAAEJ,KAAE,MAAI,CAAC,IAAEQ,KAAGZ,KAAEQ,GAAEL,KAAE,MAAI,CAAC,OAAKK,GAAEJ,KAAE,MAAI,CAAC,IAAEJ,IAAEQ,GAAER,KAAE,MAAI,CAAC,IAAEI,MAAIJ,KAAEQ,GAAEL,KAAE,MAAI,CAAC,OAAKK,GAAEJ,KAAE,MAAI,CAAC,IAAEJ,IAAEQ,GAAER,KAAE,MAAI,CAAC,IAAEI;AAAA,oBAAE;AAAC,oBAAAE,OAAI,KAAG,MAAIN,KAAEM,KAAEI,KAAE,GAAEF,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,IAAGR,KAAEA,KAAEG,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEK,GAAER,KAAE,KAAG,CAAC,MAAIQ,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEO,IAAEF,IAAGJ,KAAED,KAAEO,KAAE,KAAG,KAAG,CAAC,IAAE,IAAEJ,IAAEE,GAAEJ,KAAEE,MAAG,CAAC,IAAEA,IAAES,OAAIb,KAAE,QAAM,KAAGa,MAAG,GAAEV,KAAEG,GAAE,GAAG,IAAGR,KAAE,MAAIe,OAAI,MAAIR,KAAEP,KAAEQ,GAAEN,KAAE,KAAG,CAAC,KAAGM,GAAE,GAAG,IAAER,KAAEO,IAAEP,KAAEE,KAAGM,GAAEN,KAAE,KAAG,CAAC,IAAEG,IAAEG,GAAER,KAAE,MAAI,CAAC,IAAEK,IAAEG,GAAEH,KAAE,MAAI,CAAC,IAAEH,IAAEM,GAAEH,KAAE,KAAG,CAAC,IAAEL,KAAGQ,GAAE,GAAG,IAAEJ,IAAEI,GAAE,GAAG,IAAEF,KAAGN,KAAEG,KAAE,IAAE;AAAA,kBAAC;AAAC,yBAAOc,KAAEhB,KAAE,KAAG,GAAE,IAAED;AAAA,gBAAC;AAAC,yBAASqB,GAAErB,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEzB,KAAE,GAAE0B,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAEC,MAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG,GAAE,KAAG;AAAE,uBAAIzB,KAAEtC,GAAER,KAAE,OAAK,CAAC,GAAE+C,KAAEvC,GAAER,KAAE,OAAK,CAAC,GAAEgC,KAAExB,GAAER,KAAE,OAAK,CAAC,GAAEgD,KAAExC,GAAER,KAAE,OAAK,CAAC,GAAEiD,KAAEzC,GAAER,KAAE,OAAK,CAAC,GAAEkD,KAAE1C,GAAER,KAAE,OAAK,CAAC,GAAEiC,KAAEzB,GAAER,KAAE,OAAK,CAAC,GAAEmD,KAAE3C,GAAER,KAAE,OAAK,CAAC,GAAEqB,KAAEb,GAAER,KAAE,OAAK,CAAC,GAAE4D,MAAGpD,GAAER,KAAE,OAAK,CAAC,GAAEoD,KAAE5C,GAAER,KAAE,OAAK,CAAC,GAAE6D,MAAGrD,GAAER,KAAE,OAAK,CAAC,GAAEqD,MAAG7C,GAAER,KAAE,OAAK,CAAC,GAAEsD,MAAG9C,GAAER,KAAE,OAAK,CAAC,GAAEkC,KAAE1B,GAAER,KAAE,OAAK,CAAC,GAAEmC,KAAE3B,GAAER,KAAE,OAAK,CAAC,GAAEoC,KAAE5B,GAAER,KAAE,OAAK,CAAC,GAAE8D,MAAGtD,GAAER,KAAE,OAAK,CAAC,GAAEuD,MAAG/C,GAAER,KAAE,OAAK,CAAC,GAAE+D,MAAGvD,GAAER,KAAE,OAAK,CAAC,GAAEqC,KAAE7B,GAAER,KAAE,OAAK,CAAC,GAAEsC,KAAE9B,GAAER,KAAE,OAAK,CAAC,GAAEe,KAAEP,GAAER,KAAE,OAAK,CAAC,GAAE4B,KAAEpB,GAAER,KAAE,OAAK,CAAC,GAAEuC,KAAE/B,GAAER,KAAE,MAAI,CAAC,GAAEwC,KAAEhC,GAAER,KAAE,OAAK,CAAC,GAAEU,KAAEF,GAAER,KAAE,MAAI,CAAC,GAAE6B,KAAErB,GAAER,KAAE,MAAI,CAAC,GAAEO,KAAEC,GAAER,KAAE,MAAI,CAAC,GAAEyC,KAAEjC,GAAER,KAAE,MAAI,CAAC,GAAEM,KAAEE,GAAER,KAAE,MAAI,CAAC,GAAE0C,KAAElC,GAAER,KAAE,MAAI,CAAC,GAAEa,KAAEL,GAAER,KAAE,MAAI,CAAC,GAAEmB,KAAEX,GAAER,KAAE,MAAI,CAAC,GAAEsB,KAAEd,GAAER,KAAE,MAAI,CAAC,GAAEc,KAAEN,GAAER,KAAE,MAAI,CAAC,GAAEE,KAAEM,GAAER,KAAE,MAAI,CAAC,GAAEwD,MAAGhD,GAAER,KAAE,MAAI,CAAC,GAAEI,KAAEI,GAAER,KAAE,MAAI,CAAC,GAAEgB,KAAER,GAAER,KAAE,MAAI,CAAC,GAAEuB,KAAEf,GAAER,KAAE,MAAI,CAAC,GAAE2C,KAAEnC,GAAER,KAAE,MAAI,CAAC,GAAEY,KAAEJ,GAAER,KAAE,MAAI,CAAC,GAAEwB,KAAEhB,GAAER,KAAE,MAAI,CAAC,GAAEW,KAAEH,GAAER,KAAE,MAAI,CAAC,GAAE8B,KAAEtB,GAAER,KAAE,MAAI,CAAC,GAAEG,KAAEK,GAAER,KAAE,KAAG,CAAC,GAAEyB,KAAEjB,GAAER,KAAE,MAAI,CAAC,GAAES,KAAED,GAAER,MAAG,CAAC,GAAE0B,KAAElB,GAAER,KAAE,KAAG,CAAC,GAAEuE,QAAK,KAAG,KAAI,CAAAtE,KAAEW,KAAEC,KAAEE,KAAEiB,KAAEqB,KAAGT,KAAE4B,GAAEvD,KAAER,KAAEL,KAAEG,KAAEc,KAAEkC,KAAG5B,KAAED,KAAEV,KAAEyB,KAAEmB,MAAGG,KAAG,CAAC,IAAE9D,IAAEI,KAAEmE,GAAEjD,KAAEqB,IAAED,MAAGE,MAAGmB,MAAGxC,KAAEL,KAAES,KAAEoB,KAAEM,OAAIpC,KAAG,EAAE,GAAE+C,MAAG/C,IAAEuC,MAAG1B,KAAED,KAAEhB,KAAE0B,KAAEL,KAAEe,IAAEnB,KAAEyC,GAAEpD,KAAET,KAAEW,KAAEiB,KAAEL,KAAEe,IAAElB,IAAE,CAAC,IAAEd,IAAEA,KAAEuD,GAAE9D,KAAEqB,IAAEF,MAAG6B,MAAGxC,KAAES,KAAG,EAAE,GAAEuC,MAAGhD,IAAEyC,MAAGhC,KAAEF,KAAE+B,MAAG3B,KAAEsB,KAAEW,KAAGK,MAAG5C,KAAEjB,KAAE+B,KAAES,KAAEM,IAAE7B,KAAEiD,GAAEH,MAAGlE,KAAED,KAAEQ,KAAEuB,KAAEG,IAAET,IAAE,CAAC,IAAEwC,KAAGxC,KAAE6C,GAAE7C,KAAEvB,KAAEmB,IAAEP,MAAGa,MAAGzB,KAAEuC,KAAED,KAAEJ,KAAES,KAAEc,OAAI3C,KAAG,EAAE,GAAEkD,MAAGlD,IAAER,KAAE8D,GAAErE,KAAE4B,IAAEN,KAAEiC,KAAG,CAAC,GAAEjC,KAAEP,IAAEF,KAAEwD,GAAEL,KAAG/D,IAAE,CAAC,IAAEgB,IAAEL,KAAEyD,GAAExD,KAAED,KAAGK,KAAEQ,OAAIA,KAAEV,KAAEuC,MAAI,EAAE,GAAEA,MAAGvC,IAAEyB,KAAE6B,GAAEvE,IAAE+D,KAAG,CAAC,IAAEK,KAAGlE,KAAEqE,GAAE7B,KAAErB,KAAGF,KAAEN,OAAIA,KAAEI,KAAEyC,MAAI,CAAC,GAAEK,MAAG9C,IAAEI,KAAEkD,GAAE5D,KAAEI,IAAEQ,KAAEI,IAAE,EAAE,GAAEJ,KAAEN,IAAEX,KAAEiE,GAAEjE,KAAEgB,IAAEM,KAAEY,IAAE,CAAC,GAAEA,KAAEvB,IAAEjB,KAAEuE,GAAElE,KAAEsC,IAAEF,KAAEG,IAAE,EAAE,GAAEzB,KAAER,KAAEM,IAAEZ,KAAEkE,GAAE7D,KAAEgC,IAAE7B,KAAEgB,IAAE,EAAE,GAAEY,KAAExB,IAAEmB,KAAEmC,GAAEnC,KAAEO,IAAEN,KAAEO,IAAE,EAAE,GAAEP,KAAEpB,IAAEd,KAAEoE,GAAE3D,KAAEG,IAAEG,KAAES,IAAE,EAAE,GAAEE,KAAEnB,KAAEO,IAAEC,KAAEX,IAAGK,MAAGwD,MAAGE,OAAI,KAAG,OAAK,MAAI,CAAC,GAAE1D,KAAEL,GAAEK,KAAE,KAAG,CAAC,GAAE0B,KAAEiC,GAAEjC,KAAEI,IAAE7B,KAAE0B,IAAE,EAAE,GAAEA,KAAEtB,IAAEhB,KAAEsE,GAAEtE,KAAE6B,IAAEyB,MAAGE,KAAG,EAAE,GAAEY,MAAG3D,MAAG,MAAIe,MAAGG,OAAI,MAAI2B,MAAGtC,OAAIsB,KAAE3B,OAAI,MAAI,KAAGF,MAAG2B,KAAEI,OAAI,MAAI,KAAG9B,MAAG6B,KAAEjB,OAAI,MAAI,KAAG4C,OAAIF,MAAGD,QAAK,MAAI,KAAGD,OAAIP,MAAGhC,KAAGZ,KAAE2D,GAAErD,MAAG,MAAIwC,MAAGlD,KAAEc,OAAI,KAAGrB,MAAGqC,KAAEpB,OAAI,MAAI,KAAGf,MAAGiC,KAAE/B,OAAI,MAAI,KAAGL,MAAGM,KAAEe,OAAI,MAAI,KAAGK,MAAGV,KAAEZ,OAAI,MAAI,KAAGF,MAAGY,KAAEL,KAAGC,IAAE,CAAC,GAAEC,KAAEM,IAAEgB,KAAEsC,GAAEtC,KAAES,IAAE7B,KAAEqB,IAAE,EAAE,GAAEA,KAAEjB,IAAEc,KAAEwC,GAAExD,KAAEgB,IAAEJ,KAAEoB,IAAE,EAAE,GAAEmB,MAAGjD,IAAEmC,MAAGmB,GAAExD,KAAEqC,KAAGzB,KAAE0B,KAAG,EAAE,GAAEN,KAAE9B,IAAE4B,KAAE0B,GAAE1B,KAAEF,IAAEG,KAAEF,IAAE,EAAE,GAAES,MAAGpC,IAAEqC,MAAGiB,GAAEjD,KAAEgC,KAAG1B,KAAEkC,KAAG,EAAE,GAAEhB,KAAE7B,IAAEP,KAAE6D,GAAEvC,KAAEF,IAAEoB,KAAEO,KAAG,CAAC,GAAEjD,KAAES,IAAEkC,KAAEoB,GAAEpB,KAAER,IAAEC,KAAEgB,KAAG,CAAC,GAAEV,KAAEjC,IAAEe,KAAEuC,GAAEnD,KAAEE,IAAEM,KAAE+B,KAAG,EAAE,GAAErC,KAAEL,IAAEG,KAAEmD,GAAEpC,KAAEL,IAAE2B,MAAGI,KAAG,EAAE,GAAE1B,KAAElB,IAAE,MAAI,KAAGc,MAAG3B,KAAE6B,IAAElB,MAAG,KAAG8B,MAAGa,MAAGN,KAAGQ,OAAI,KAAGlD,MAAGL,KAAEiD,KAAG1B,MAAG,KAAGI,MAAGvB,KAAE0C,IAAEH,KAAEuB,GAAE7B,KAAEM,IAAEnC,KAAEoC,IAAE,EAAE,GAAE5C,KAAEkE,IAAG3D,MAAGiD,MAAG,KAAG9C,KAAE6C,MAAGhC,MAAG+B,OAAI,KAAGX,MAAG3B,KAAED,QAAK0C,OAAI,KAAGzD,MAAGF,KAAEO,MAAIC,MAAG,MAAI,MAAI,KAAGuD,OAAIF,MAAG9B,OAAI,MAAI,KAAGmB,OAAI5B,KAAEsB,OAAIpB,MAAG,KAAGnB,MAAGiC,KAAEK,OAAIjC,MAAG,KAAGS,MAAGE,KAAE0B,OAAI,MAAI,MAAID,KAAEhC,OAAIM,KAAEY,QAAKM,MAAG,KAAGA,MAAGZ,KAAErB,KAAG,EAAE,GAAEmC,KAAE1B,IAAE,KAAGT,MAAG,KAAGgD,OAAI,KAAGN,MAAG5B,OAAI,KAAGiB,MAAG,KAAGQ,MAAGM,QAAK,MAAI,KAAGP,MAAGtC,KAAE6B,OAAI,KAAGG,MAAG,KAAGL,MAAGc,OAAI,MAAI,KAAGf,MAAGgC,MAAGD,MAAIzD,KAAE+D,GAAE,MAAI,KAAGzD,MAAG,KAAGqC,MAAGnB,OAAI,KAAGM,MAAG,KAAGc,OAAIP,OAAI,MAAI,KAAGS,OAAI5C,KAAE0B,OAAI,KAAG9B,MAAG,KAAGc,MAAG4B,OAAI,MAAI,KAAGf,MAAGF,KAAEf,KAAGR,IAAE,CAAC,IAAEU,IAAEZ,KAAEiE,GAAE/D,MAAGE,MAAG,KAAGJ,MAAGc,KAAEpB,MAAIkB,KAAED,KAAEoD,QAAKjD,MAAG,KAAGoB,MAAGL,KAAEhB,KAAG,EAAE,GAAEyB,KAAE3B,IAAEkB,KAAEN,MAAG,KAAGQ,MAAGS,IAAET,KAAE0B,OAAI,KAAGP,OAAIN,IAAEe,MAAGE,OAAI,KAAGF,OAAI/B,IAAElB,MAAGe,MAAGyB,MAAGzB,MAAG,KAAG3B,MAAGsB,OAAI2C,MAAGrB,MAAG,KAAG3B,MAAGrB,OAAII,KAAE4B,MAAG,KAAGvB,MAAGP,MAAG4D,OAAI5B,MAAG,KAAGwB,OAAIzD,KAAE4C,OAAI0B,GAAErE,MAAGF,KAAEG,MAAG,KAAGiC,MAAGkB,QAAKlB,KAAElC,MAAG,KAAGY,MAAGqC,OAAIO,MAAGhC,MAAG,KAAGV,MAAGiB,OAAIK,MAAG,KAAGA,MAAGc,MAAGnD,MAAGS,IAAEU,MAAGe,KAAEE,KAAE4B,OAAI1B,MAAG,KAAGA,MAAGQ,KAAEQ,MAAI,CAAC,GAAEE,MAAGxD,MAAGoB,MAAGlB,MAAG6D,MAAGE,OAAI,KAAGF,OAAIG,QAAKA,MAAGlB,MAAG,KAAG1B,MAAGJ,OAAIa,KAAEV,MAAG,KAAGE,MAAGuC,OAAItB,MAAGR,MAAG,KAAGR,MAAG8B,MAAGF,QAAKpC,MAAG,IAAGP,KAAEL,IAAEqB,KAAEpB,IAAEgB,KAAEjB,KAAEC,MAAG,MAAIwB,KAAEd,KAAE,MAAK0B,MAAG,KAAGzC,MAAG2C,KAAED,IAAE3C,KAAEuE,GAAEvE,KAAEQ,IAAEU,KAAEiB,IAAE,CAAC,GAAE1B,KAAEQ,IAAEM,KAAEgD,GAAExC,IAAE5B,IAAE,CAAC,IAAE,IAAGA,KAAEoE,GAAEZ,MAAGpC,IAAE,MAAIM,KAAE,KAAGZ,KAAG,EAAE,GAAEH,KAAEG,IAAEO,KAAE+C,GAAEV,KAAG,IAAG,CAAC,IAAE3D,IAAEA,KAAEqE,GAAE/C,KAAE,KAAIC,KAAEL,KAAEH,MAAG,IAAG,EAAE,GAAEX,KAAEL,KAAEgB,IAAE4B,MAAG,KAAG3C,MAAGC,KAAEH,IAAE8C,MAAG,KAAG7C,MAAGa,KAAEL,IAAEsB,MAAG9B,KAAEsE,GAAEvD,KAAE,IAAGK,KAAE,IAAG,EAAE,MAAI,KAAGrB,MAAGE,IAAE6C,MAAG1C,KAAEY,OAAI,KAAGR,MAAGH,IAAE0C,MAAG5C,KAAEmE,GAAEnE,KAAEQ,IAAED,KAAEqB,IAAE,EAAE,MAAI,KAAG/B,MAAGD,IAAEiD,MAAGjD,KAAEiB,OAAI,KAAGZ,MAAGI,IAAEuB,KAAE7B,MAAG,KAAGC,MAAGH,IAAEiD,KAAEpC,MAAG,KAAGd,MAAGK,IAAEe,KAAElB,MAAG,KAAGC,MAAGC,IAAEuD,MAAGrD,MAAG,KAAGQ,MAAGd,IAAEA,KAAEuE,GAAEhD,KAAEqC,KAAG/B,KAAEF,IAAE,EAAE,GAAElB,KAAEQ,IAAEd,KAAEoE,GAAEvD,KAAE,IAAGK,KAAE,IAAG,EAAE,GAAEP,KAAEG,IAAEf,KAAEqE,GAAE3D,KAAEsB,IAAEvB,KAAEsB,IAAE,EAAE,GAAE3B,KAAEL,KAAEgB,IAAEkC,MAAG,KAAGjD,MAAGC,KAAEH,IAAE4D,OAAI,KAAG3D,MAAGa,KAAEL,IAAE2C,OAAInD,KAAEsE,GAAE/C,KAAE,IAAGC,KAAE,IAAG,EAAE,MAAI,KAAGzB,MAAGE,IAAEmD,OAAIhD,KAAEY,OAAI,KAAGR,MAAGH,IAAE2B,MAAG7B,KAAEmE,GAAE/D,KAAE4B,IAAElB,KAAEmB,IAAE,EAAE,MAAI,KAAGpC,MAAGD,IAAEkC,MAAGlC,KAAEiB,OAAI,KAAGZ,MAAGI,IAAE0B,KAAEhC,MAAG,KAAGC,MAAGH,IAAE4D,MAAG/C,MAAG,KAAGd,MAAGK,IAAEiD,OAAI,KAAGnD,MAAGC,KAAEF,IAAE4D,OAAI,KAAGhD,MAAGd,KAAEM,IAAEN,KAAEuE,GAAEvD,KAAE,IAAGK,KAAE,IAAG,EAAE,GAAEZ,KAAEQ,IAAEd,KAAEoE,GAAE/C,KAAE,IAAGC,KAAE,IAAG,CAAC,GAAEpB,KAAEY,IAAEf,KAAEqE,GAAE/D,KAAE8B,IAAEpB,KAAEqB,IAAE,CAAC,GAAEC,KAAEvC,KAAEgB,IAAEmB,MAAG,KAAGlC,MAAGC,KAAEH,IAAEqC,MAAG,KAAGpC,MAAGI,KAAEI,IAAEK,MAAGb,KAAEsE,GAAE3D,KAAE4C,KAAG7C,KAAEqD,KAAG,CAAC,MAAI,KAAGhE,MAAGE,IAAEyB,MAAGrB,KAAEW,OAAI,KAAGR,MAAG+B,IAAEF,MAAGlC,KAAEmE,GAAEhD,KAAEK,IAAEf,KAAEgB,IAAE,EAAE,MAAI,KAAG5B,MAAGD,IAAEuC,MAAGvC,KAAEiB,OAAI,KAAGX,MAAGG,IAAEA,KAAEN,MAAG,KAAGC,MAAGH,IAAE2B,KAAEvB,MAAG,KAAGL,MAAGM,IAAEA,MAAG,KAAGH,MAAGC,KAAEF,IAAEsC,OAAI,KAAGnC,MAAGL,IAAEA,KAAEuE,GAAE/C,KAAE,IAAGC,KAAE,IAAG,EAAE,GAAEZ,KAAEI,IAAEd,KAAEoE,GAAE3D,KAAEyD,KAAG1D,KAAEwD,KAAG,EAAE,GAAExD,KAAEM,IAAEf,KAAEqE,GAAExD,KAAEQ,IAAEM,KAAE,IAAG,EAAE,GAAEd,KAAEd,KAAEgB,IAAEZ,MAAG,KAAGH,MAAGC,KAAEH,IAAEyC,MAAG,KAAGxC,MAAGU,KAAEE,IAAED,MAAGX,KAAEsE,GAAE/D,KAAEkD,KAAGxC,KAAE+C,KAAG,EAAE,MAAI,KAAGjE,MAAGE,IAAEgB,MAAGV,KAAES,OAAI,KAAGJ,MAAGE,IAAEM,MAAGjB,KAAEmE,GAAEvD,KAAE,IAAGK,KAAE,IAAG,CAAC,MAAI,KAAGpB,MAAGD,IAAEa,MAAGb,KAAEiB,OAAI,KAAGT,MAAGK,IAAEZ,MAAG,KAAGG,MAAGH,KAAEE,IAAEoD,OAAI,KAAGvD,MAAGQ,KAAEG,IAAER,KAAED,MAAG,KAAGC,MAAGC,IAAEW,OAAI,KAAGJ,MAAGX,IAAEW,MAAGT,KAAEqE,GAAEhD,KAAE,IAAGM,KAAE,IAAG,EAAE,MAAI,KAAGnB,MAAGoB,IAAEP,MAAGnB,KAAEa,OAAI,KAAG0B,MAAGc,KAAG/C,MAAGV,KAAEuE,GAAE/C,KAAE,IAAGC,KAAE,IAAG,EAAE,MAAI,KAAGvB,MAAGQ,IAAEmB,MAAGb,KAAEC,OAAI,KAAGb,MAAGuC,IAAEzC,MAAG,KAAGF,MAAGE,KAAEwB,IAAEF,MAAG,KAAGR,MAAGZ,KAAEwC,IAAEpC,KAAEsB,KAAEvB,IAAGH,KAAE,QAAM,IAAEgE,OAAI,MAAI,CAAC,KAAG,KAAG1C,MAAG1B,IAAEyB,KAAEgC,MAAGlD,GAAEH,KAAE,KAAG,CAAC,KAAG,KAAGwC,MAAG5B,IAAEsD,MAAGA,MAAG,IAAE;AAAE,kBAAA/D,GAAER,KAAE,OAAK,CAAC,IAAE8C,IAAEtC,GAAER,KAAE,OAAK,CAAC,IAAE+C,IAAEvC,GAAER,KAAE,OAAK,CAAC,IAAEgC,IAAExB,GAAER,KAAE,OAAK,CAAC,IAAEgD,IAAExC,GAAER,KAAE,OAAK,CAAC,IAAEiD,IAAEzC,GAAER,KAAE,OAAK,CAAC,IAAEkD,IAAE1C,GAAER,KAAE,OAAK,CAAC,IAAEiC,IAAEzB,GAAER,KAAE,OAAK,CAAC,IAAEmD,IAAE3C,GAAER,KAAE,OAAK,CAAC,IAAEqB,IAAEb,GAAER,KAAE,OAAK,CAAC,IAAE4D,KAAGpD,GAAER,KAAE,OAAK,CAAC,IAAEoD,IAAE5C,GAAER,KAAE,OAAK,CAAC,IAAE6D,KAAGrD,GAAER,KAAE,OAAK,CAAC,IAAEqD,KAAG7C,GAAER,KAAE,OAAK,CAAC,IAAEsD,KAAG9C,GAAER,KAAE,OAAK,CAAC,IAAEkC,IAAE1B,GAAER,KAAE,OAAK,CAAC,IAAEmC,IAAE3B,GAAER,KAAE,OAAK,CAAC,IAAEoC,IAAE5B,GAAER,KAAE,OAAK,CAAC,IAAE8D,KAAGtD,GAAER,KAAE,OAAK,CAAC,IAAEuD,KAAG/C,GAAER,KAAE,OAAK,CAAC,IAAE+D,KAAGvD,GAAER,KAAE,OAAK,CAAC,IAAEqC,IAAE7B,GAAER,KAAE,OAAK,CAAC,IAAEsC,IAAE9B,GAAER,KAAE,OAAK,CAAC,IAAEe,IAAEP,GAAER,KAAE,OAAK,CAAC,IAAE4B,IAAEpB,GAAER,KAAE,MAAI,CAAC,IAAEuC,IAAE/B,GAAER,KAAE,OAAK,CAAC,IAAEwC,IAAEhC,GAAER,KAAE,MAAI,CAAC,IAAEU,IAAEF,GAAER,KAAE,MAAI,CAAC,IAAE6B,IAAErB,GAAER,KAAE,MAAI,CAAC,IAAEO,IAAEC,GAAER,KAAE,MAAI,CAAC,IAAEyC,IAAEjC,GAAER,KAAE,MAAI,CAAC,IAAEM,IAAEE,GAAER,KAAE,MAAI,CAAC,IAAE0C,IAAElC,GAAER,KAAE,MAAI,CAAC,IAAEa,IAAEL,GAAER,KAAE,MAAI,CAAC,IAAEmB,IAAEX,GAAER,KAAE,MAAI,CAAC,IAAEsB,IAAEd,GAAER,KAAE,MAAI,CAAC,IAAEc,IAAEN,GAAER,KAAE,MAAI,CAAC,IAAEE,IAAEM,GAAER,KAAE,MAAI,CAAC,IAAEwD,KAAGhD,GAAER,KAAE,MAAI,CAAC,IAAEI,IAAEI,GAAER,KAAE,MAAI,CAAC,IAAEgB,IAAER,GAAER,KAAE,MAAI,CAAC,IAAEuB,IAAEf,GAAER,KAAE,MAAI,CAAC,IAAE2C,IAAEnC,GAAER,KAAE,MAAI,CAAC,IAAEY,IAAEJ,GAAER,KAAE,MAAI,CAAC,IAAEwB,IAAEhB,GAAER,KAAE,MAAI,CAAC,IAAEW,IAAEH,GAAER,KAAE,MAAI,CAAC,IAAE8B,IAAEtB,GAAER,KAAE,KAAG,CAAC,IAAEG,IAAEK,GAAER,KAAE,MAAI,CAAC,IAAEyB,IAAEjB,GAAER,MAAG,CAAC,IAAES,IAAED,GAAER,KAAE,KAAG,CAAC,IAAE0B;AAAA,gBAAC;AAAC,yBAASJ,GAAEtB,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,oBAAE,KAAGP,MAAG,GAAE;AAAC,oBAAAK,MAAGF,KAAEH,KAAE,IAAE,MAAIA,KAAE,MAAIC,KAAEO,GAAER,KAAE,KAAG,CAAC,MAAI;AAAE,sBAAE,KAAG,EAAE,IAAEC,KAAG;AAAC,0BAAG,EAAE,IAAEA,IAAG,OAAM;AAAE,2BAAIE,KAAEA,MAAGF,KAAEO,GAAEL,MAAG,CAAC,KAAG,OAAK,IAAEQ,GAAE,GAAG,EAAE,OAAM;AAAE,sBAAAX,KAAEA,KAAEC,KAAE;AAAE,yBAAE;AAAC,2BAAE;AAAC,8BAAGO,GAAE,GAAG,MAAI,IAAEL,KAAG;AAAC,gCAAGF,OAAI,KAAG,KAAI;AAAC,kCAAGG,KAAEH,OAAI,IAAE,IAAG,KAAGA,KAAEO,GAAEL,KAAE,MAAI,CAAC,QAAM,KAAGD,KAAEM,GAAEL,KAAE,KAAG,CAAC,KAAI;AAAC,gCAAAK,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGJ,EAAC;AAAE,sCAAM;AAAA,8BAAC;AAAC,8BAAAI,GAAEN,KAAE,MAAI,CAAC,IAAED,IAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEC;AAAE,oCAAM;AAAA,4BAAC;AAAC,gCAAGI,KAAEE,GAAEL,KAAE,MAAI,CAAC,IAAG,IAAEA,QAAK,KAAGF,KAAEO,GAAEL,KAAE,MAAI,CAAC,KAAI;AAAC,8BAAAD,KAAEM,GAAEL,KAAE,KAAG,CAAC,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAED,IAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEC;AAAE,oCAAM;AAAA,4BAAC;AAAC,gCAAG,EAAEA,KAAEM,IAAGJ,KAAED,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,kCAAG,EAAED,KAAEM,GAAEL,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,8BAAAC,KAAED,KAAE,KAAG;AAAA,4BAAC;AAAC,mCAAKI,KAAEH,KAAGF,KAAEM,IAAGJ,MAAGH,KAAEC,MAAG,KAAG,MAAI,CAAC,OAAKE,KAAEH,KAAE,KAAG,GAAEC,KAAEM,GAAEP,KAAE,MAAI,CAAC,KAAI;AAAC,4BAAAO,GAAED,MAAG,CAAC,IAAE;AAAE,kCAAM;AAAA,0BAAC;AAAC,8BAAG,MAAI,KAAGN,KAAEO,GAAEH,KAAE,KAAG,CAAC,IAAI,OAAM;AAAE,iCAAOG,GAAE,GAAG,IAAER,IAAEQ,GAAEH,KAAE,KAAG,CAAC,IAAE,KAAGJ,IAAEO,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAE,MAAKQ,GAAEH,MAAG,CAAC,IAAEL;AAAA,wBAAE;AAAC,wBAAAC,KAAE;AAAA,sBAAC;AAAC,0BAAGK,IAAE;AAAC,wBAAAJ,KAAEM,GAAEL,KAAE,MAAI,CAAC;AAAE,2BAAE;AAAC,8BAAGK,IAAGJ,KAAE,QAAMF,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEC,KAAG;AAAC,gCAAGK,GAAEJ,MAAG,CAAC,IAAEH,IAAEA,GAAE,OAAM;AAAE,4BAAAO,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGN,EAAC;AAAE,kCAAM;AAAA,0BAAC;AAAC,8BAAGM,GAAEF,MAAGE,GAAEF,KAAE,MAAI,CAAC,MAAI,IAAEH,MAAG,KAAG,OAAK,CAAC,IAAEF,IAAE,CAACA,GAAE,OAAM;AAAA,wBAAC;AAAC,wBAAAO,GAAEP,KAAE,MAAI,CAAC,IAAEK,KAAGJ,KAAEM,GAAEL,KAAE,MAAI,CAAC,OAAKK,GAAEP,KAAE,MAAI,CAAC,IAAEC,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAED,MAAIC,KAAEM,GAAEL,KAAE,MAAI,CAAC,OAAKK,GAAEP,KAAE,MAAI,CAAC,IAAEC,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAED;AAAA,sBAAE;AAAA,oBAAC;AAAC,wBAAG,EAAEE,OAAI,KAAGE,OAAI,MAAI,KAAGJ,KAAEO,GAAEH,KAAE,KAAG,CAAC,IAAG;AAAC,yBAAE;AAAC,2BAAE;AAAC,6BAAE;AAAC,+BAAE;AAAC,kCAAG,EAAE,IAAEJ,KAAG;AAAC,oCAAGO,GAAE,GAAG,MAAI,IAAEH,KAAG;AAAC,sCAAGG,GAAE,GAAG,IAAEL,IAAEH,KAAEQ,GAAE,GAAG,IAAER,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,GAAE,GAAG,MAAI,IAAEL,IAAG,OAAM;AAAE,yCAAOK,GAAE,GAAG,IAAE,GAAE,MAAKA,GAAE,GAAG,IAAE;AAAA,gCAAE;AAAC,oCAAGA,GAAE,GAAG,MAAI,IAAEH,IAAG,QAAOG,GAAE,GAAG,IAAEL,IAAEH,KAAEQ,GAAE,GAAG,IAAER,KAAE,GAAEQ,GAAE,GAAG,IAAER,IAAEQ,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAE,MAAKQ,GAAER,KAAEG,MAAG,CAAC,IAAEH;AAAG,oCAAGA,MAAG,KAAGC,MAAGD,KAAE,GAAEC,OAAI,KAAG,KAAI;AAAC,sCAAGG,KAAEH,OAAI,IAAE,IAAG,KAAGA,KAAEO,GAAEH,KAAE,MAAI,CAAC,QAAM,KAAGH,KAAEM,GAAEH,KAAE,KAAG,CAAC,KAAI;AAAC,oCAAAG,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGJ,EAAC;AAAE,0CAAM;AAAA,kCAAC;AAAC,kCAAAI,GAAEN,KAAE,MAAI,CAAC,IAAED,IAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEC;AAAE,wCAAM;AAAA,gCAAC;AAAC,oCAAGI,KAAEE,GAAEH,KAAE,MAAI,CAAC,IAAG,IAAEA,QAAK,KAAGJ,KAAEO,GAAEH,KAAE,MAAI,CAAC,KAAI;AAAC,kCAAAH,KAAEM,GAAEH,KAAE,KAAG,CAAC,GAAEG,GAAEN,KAAE,MAAI,CAAC,IAAED,IAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEC;AAAE,wCAAM;AAAA,gCAAC;AAAC,oCAAG,EAAEA,KAAEM,IAAGJ,KAAEC,KAAE,KAAG,MAAI,CAAC,IAAG;AAAC,sCAAG,EAAEH,KAAEM,GAAEH,KAAE,MAAI,CAAC,GAAG,OAAM;AAAE,kCAAAD,KAAEC,KAAE,KAAG;AAAA,gCAAC;AAAC,uCAAKE,KAAEH,KAAGF,KAAEM,IAAGJ,MAAGH,KAAEC,MAAG,KAAG,MAAI,CAAC,OAAKE,KAAEH,KAAE,KAAG,GAAEC,KAAEM,GAAEP,KAAE,MAAI,CAAC,KAAI;AAAC,gCAAAO,GAAED,MAAG,CAAC,IAAE;AAAE,sCAAM;AAAA,8BAAC;AAAC,8BAAAC,GAAEH,KAAE,KAAG,CAAC,IAAE,KAAGJ,IAAEO,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,GAAER,KAAEG,MAAG,CAAC,IAAEH;AAAE,oCAAM;AAAA,4BAAC;AAAC,4BAAAC,KAAE;AAAA,0BAAC;AAAC,8BAAGK,IAAE;AAAC,4BAAAJ,KAAEM,GAAEH,KAAE,MAAI,CAAC;AAAE,+BAAE;AAAC,kCAAGG,IAAGJ,KAAE,QAAMF,MAAG,KAAG,MAAI,CAAC,MAAI,IAAEG,KAAG;AAAC,oCAAGG,GAAEJ,MAAG,CAAC,IAAEH,IAAEA,GAAE,OAAM;AAAE,gCAAAO,GAAE,GAAG,IAAEA,GAAE,GAAG,IAAE,GAAGN,EAAC;AAAE,sCAAM;AAAA,8BAAC;AAAC,kCAAGM,GAAEF,MAAGE,GAAEF,KAAE,MAAI,CAAC,MAAI,IAAED,MAAG,KAAG,OAAK,CAAC,IAAEJ,IAAE,CAACA,GAAE,OAAM;AAAA,4BAAC;AAAC,4BAAAO,GAAEP,KAAE,MAAI,CAAC,IAAEK,KAAGJ,KAAEM,GAAEH,KAAE,MAAI,CAAC,OAAKG,GAAEP,KAAE,MAAI,CAAC,IAAEC,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAED,MAAIC,KAAEM,GAAEH,KAAE,MAAI,CAAC,OAAKG,GAAEP,KAAE,MAAI,CAAC,IAAEC,IAAEM,GAAEN,KAAE,MAAI,CAAC,IAAED;AAAA,0BAAE;AAAA,wBAAC;AAAC,4BAAGO,GAAEL,KAAE,KAAG,CAAC,IAAE,IAAEH,IAAEQ,GAAER,KAAEG,MAAG,CAAC,IAAEH,IAAEQ,GAAE,GAAG,MAAI,IAAEL,IAAG,QAAO,MAAKK,GAAE,GAAG,IAAER;AAAA,sBAAE;AAAC,0BAAGA,OAAI,KAAG,IAAI,QAAOC,KAAE,QAAM,KAAGD,MAAG,IAAGE,KAAEM,GAAE,GAAG,MAAIR,KAAE,MAAIA,OAAI,MAAIA,KAAEQ,GAAEP,KAAE,KAAG,CAAC,KAAGO,GAAE,GAAG,IAAER,KAAEE,IAAEF,KAAEC,KAAGO,GAAEP,KAAE,KAAG,CAAC,IAAEE,IAAEK,GAAER,KAAE,MAAI,CAAC,IAAEG,IAAEK,GAAEL,KAAE,MAAI,CAAC,IAAEF,IAAE,MAAKO,GAAEL,KAAE,KAAG,CAAC,IAAEH;AAAG,sBAAAE,KAAE,IAAGF,OAAI,KAAG,aAAWE,KAAE,OAAKF,OAAI,MAAIC,KAAEY,GAAEb,OAAI,IAAE,CAAC,KAAG,MAAIC,MAAG,KAAG,KAAG,IAAGO,GAAEL,KAAE,MAAI,CAAC,IAAED,IAAEM,GAAEL,KAAE,MAAI,CAAC,IAAE,GAAEK,GAAEL,KAAE,MAAI,CAAC,IAAE,GAAEF,KAAE,QAAMC,MAAG,KAAG;AAAE,yBAAE;AAAC,2BAAE;AAAC,+BAAIE,KAAEI,GAAE,GAAG,MAAID,KAAE,KAAGL,KAAG;AAAC,iCAAIA,KAAEF,OAAI,OAAK,IAAEE,MAAG,MAAIA,OAAI,IAAE,KAAG,IAAE,IAAGD,KAAEO,GAAEP,MAAG,CAAC,OAAI;AAAC,kCAAGG,KAAEH,KAAG,KAAGO,GAAEP,KAAE,KAAG,CAAC,OAAK,IAAED,IAAG,OAAM;AAAE,kCAAGC,KAAEC,OAAI,KAAG,GAAEA,OAAI,GAAE,EAAED,KAAEO,IAAGD,KAAEH,MAAG,IAAEH,MAAG,KAAG,MAAI,CAAC,GAAG;AAAA,4BAAK;AAAC,4BAAAO,GAAED,KAAE,MAAI,CAAC,IAAEJ,IAAEK,GAAEL,KAAE,MAAI,CAAC,IAAEC;AAAA,0BAAC,MAAM,CAAAI,GAAE,GAAG,IAAEJ,KAAEG,IAAEC,GAAEP,MAAG,CAAC,IAAEE,IAAEK,GAAEL,KAAE,MAAI,CAAC,IAAEF;AAAE,0BAAAO,GAAEL,KAAE,MAAI,CAAC,IAAEA,IAAEK,GAAEL,KAAE,KAAG,CAAC,IAAEA;AAAE,gCAAM;AAAA,wBAAC;AAAC,wBAAAH,KAAEQ,GAAEJ,KAAE,KAAG,CAAC,GAAEI,GAAER,KAAE,MAAI,CAAC,IAAEG,IAAEK,GAAEJ,KAAE,KAAG,CAAC,IAAED,IAAEK,GAAEL,KAAE,MAAI,CAAC,IAAE,GAAEK,GAAEL,KAAE,MAAI,CAAC,IAAEC,IAAEI,GAAEL,KAAE,KAAG,CAAC,IAAEH;AAAA,sBAAC;AAAC,sBAAAA,KAAEQ,GAAE,GAAG,IAAE,IAAE,GAAEA,GAAE,GAAG,IAAER,MAAG;AAAA,oBAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASuB,GAAEvB,IAAEC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,IAAEG,IAAEG,IAAEC,IAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEO,KAAE,GAAEC,KAAE;AAAE,uBAAIP,KAAEV,KAAEU,KAAE,MAAI,GAAEN,KAAEJ,KAAE,KAAG,GAAEG,KAAES,GAAE,GAAG,GAAEX,GAAEG,MAAG,CAAC,IAAED,IAAEA,OAAII,GAAE,GAAG,GAAET,GAAE,IAAGY,KAAEb,KAAEa,KAAE,MAAI,OAAI;AAAC,wBAAG,OAAK,IAAEJ,KAAG;AAAC,iCAAO;AAAC,4BAAGA,KAAE,GAAEV,OAAI,IAAE,KAAI;AAAC,+BAAIY,KAAE,OAAI;AAAC,gCAAG,QAAM,IAAEF,KAAG;AAAC,sCAAM,IAAEV,QAAK,IAAEY,MAAI,CAAAT,GAAES,KAAEX,KAAE,CAAC,IAAEK,GAAEP,KAAEa,KAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE;AAAA,4BAAK;AAAC,4BAAAT,GAAEO,KAAET,KAAE,CAAC,IAAE,GAAES,KAAEA,KAAE,IAAE;AAAA,0BAAC;AAAC,+BAAIP,GAAEH,KAAEC,KAAE,CAAC,IAAE,IAAGE,GAAEF,KAAE,MAAI,CAAC,IAAE,MAAIK,GAAEL,KAAE,MAAI,CAAC,GAAES,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAE,KAAEP,IAAGN,MAAGC,KAAEU,MAAG,KAAGH,KAAE,MAAI,CAAC,GAAEM,KAAER,GAAEN,KAAE,KAAG,CAAC,GAAEM,GAAEN,MAAG,CAAC,IAAEoC,GAAEnC,KAAEC,KAAE,CAAC,IAAEW,IAAEP,GAAEN,KAAE,KAAG,CAAC,IAAEgB,KAAEF,IAAEH,KAAEA,KAAE,IAAE;AAAE,0BAAAI,KAAEb,KAAE,MAAI;AAAE;AAAA,wBAAK;AAAC,+BAAK,OAAK,IAAES,MAAI,CAAAU,KAAEf,IAAGO,MAAGC,KAAEH,MAAG,KAAGH,KAAE,MAAI,CAAC,GAAEc,KAAEhB,GAAEO,KAAE,KAAG,CAAC,GAAEP,GAAEO,MAAG,CAAC,IAAEuB,GAAEpC,KAAEc,KAAE,CAAC,IAAEO,IAAEf,GAAEO,KAAE,KAAG,CAAC,IAAEG,KAAEM,IAAEX,KAAEA,KAAE,IAAE;AAAE,wBAAAQ,GAAEX,EAAC,GAAER,KAAEA,KAAE,MAAI,GAAEC,KAAEA,KAAE,MAAI;AAAA,sBAAC;AAAC;AAAA,oBAAK;AAAC,oBAAAK,IAAGO,MAAGF,MAAG,KAAGH,KAAE,MAAI,CAAC,IAAE,GAAEF,GAAEO,KAAE,KAAG,CAAC,IAAE,GAAEF,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,kBAAAoB,GAAEjC,IAAEE,MAAGD,OAAI,KAAG,MAAI,GAAEU,EAAC;AAAE,oBAAE,MAAI,KAAGT,KAAEU,GAAEV,IAAE,GAAG,QAAM,IAAED,IAAG,MAAIE,KAAEF,KAAEC,KAAE,GAAEF,KAAEA,KAAEE,KAAE,GAAE+B,GAAE1B,KAAE,KAAG,GAAE,GAAEA,KAAE,KAAG,CAAC,GAAEN,KAAE,OAAI;AAAC,yBAAI,IAAEA,QAAK,IAAEE,IAAG,OAAM;AAAE,oBAAAG,GAAEN,KAAEC,KAAE,CAAC,IAAEQ,IAAGF,KAAE,KAAG,KAAGN,KAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,kBAAAqB,GAAEd,GAAED,KAAE,MAAI,CAAC,CAAC,GAAEU,KAAEV,KAAE,MAAI;AAAA,gBAAC;AAAC,yBAASiB,GAAExB,IAAEC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEG,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,OAAI;AAAC,uBAAE;AAAC,0BAAGP,KAAE,GAAED,KAAE,GAAEI,KAAEE,KAAEJ,GAAER,KAAE,OAAK,CAAC,GAAE,EAAE,GAAGW,KAAER,MAAGC,KAAEI,GAAER,KAAE,OAAK,CAAC,KAAG,OAAK,IAAEG,OAAI,IAAEO,KAAE,IAAE,IAAEA,MAAGT,OAAI,IAAEU,OAAI,IAAG;AAAC,+BAAK,EAAE,CAACL,MAAGD,KAAEJ,KAAEG,KAAE,OAAK,KAAGG,OAAI,IAAE,MAAI,IAAED,OAAK,CAAAM,KAAEJ,IAAGE,MAAG,MAAIN,KAAEA,KAAEG,KAAE,MAAIP,KAAE,KAAG,KAAG,CAAC,GAAEW,KAAEF,GAAEP,KAAEK,KAAE,CAAC,GAAEF,KAAE,MAAID,OAAI,KAAI,KAAGA,QAAK,KAAG,MAAIA,KAAEO,MAAGN,IAAEA,KAAE,MAAID,MAAG,KAAGC,MAAG,IAAEM,OAAI,KAAGN,IAAEA,KAAEM,MAAGN,KAAGG,GAAEE,MAAG,CAAC,IAAEL,KAAEG,GAAEE,MAAG,CAAC,GAAEF,GAAEE,KAAE,KAAG,CAAC,IAAEN,KAAEQ,IAAEN,MAAGC,KAAEA,KAAE,IAAE,KAAGD,KAAEA,KAAE,IAAE,GAAEF,KAAEI,GAAER,KAAE,OAAK,CAAC,GAAEY,KAAEJ,GAAER,KAAE,OAAK,CAAC;AAAE,wBAAAQ,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEQ,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEqB,GAAErB,EAAC,GAAEE,KAAEA,KAAEG,KAAE,GAAEF,KAAEA,KAAEE,KAAE;AAAE;AAAA,sBAAQ;AAAC,iCAAO;AAAC,4BAAG,CAACS,MAAG,IAAEX,QAAK,IAAEU,IAAG,OAAM;AAAE,wBAAAZ,KAAEY,KAAEL,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEK,KAAEG,IAAGF,MAAG,KAAGL,MAAGD,KAAE,KAAG,KAAG,CAAC,GAAEO,KAAEE,GAAEP,KAAEW,KAAE,CAAC,GAAEZ,KAAE,MAAIG,KAAEH,MAAG,KAAI,KAAGG,QAAK,KAAG,MAAIA,KAAEG,MAAGN,IAAEA,KAAE,MAAIG,MAAG,KAAGH,MAAG,IAAEM,OAAI,KAAGN,IAAEA,KAAEM,MAAGN,KAAGO,GAAEF,MAAG,CAAC,IAAEL,KAAEO,GAAEF,MAAG,CAAC,GAAEE,GAAEF,KAAE,KAAG,CAAC,IAAEF,KAAEC,IAAEJ,KAAEa,IAAEA,MAAGD,KAAEA,KAAE,IAAE,KAAGZ,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAA,oBAAC;AAAC;AAAA,kBAAK;AAAC,kBAAAA,KAAEO,GAAER,KAAE,OAAK,CAAC,GAAEC,MAAGC,KAAEC,KAAEK,GAAER,KAAE,OAAK,CAAC,IAAE,OAAK,IAAEG,OAAI,IAAEF,KAAE,IAAE,IAAEA,IAAEO,GAAER,KAAE,OAAK,CAAC,IAAEE,IAAEM,GAAER,KAAE,OAAK,CAAC,IAAEC;AAAA,gBAAC;AAAC,yBAASwB,GAAEzB,IAAEC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,uBAAIF,KAAEV,QAAI;AAAC,oBAAAM,KAAEC,GAAEN,KAAE,OAAK,CAAC,GAAEO,KAAED,GAAEN,KAAE,OAAK,CAAC;AAAE,uBAAE;AAAC,0BAAG,CAACQ,MAAG,IAAEN,QAAK,IAAEO,IAAG,CAAAN,KAAEJ;AAAA,2BAAM;AAAC,4BAAGI,KAAED,KAAG,IAAEM,QAAK,IAAED,MAAGF,OAAI,IAAEH,OAAI,IAAEM,OAAI,IAAED,OAAI,EAAE,OAAM;AAAE,wBAAAE,KAAEP;AAAA,sBAAC;AAAC,2BAAIA,KAAEG,KAAEI,KAAE,GAAED,KAAED,OAAIF,OAAI,IAAEI,OAAI,KAAG,IAAE,KAAG,GAAEA,KAAEV,KAAEI,KAAE,GAAEJ,KAAED,KAAEK,KAAE,GAAEG,GAAEN,KAAE,OAAK,CAAC,IAAEE,IAAEI,GAAEN,KAAE,OAAK,CAAC,IAAEQ,IAAEC,MAAG;AAAC,6BAAIU,GAAEnB,EAAC,GAAEF,KAAEG,OAAI,IAAEQ,OAAI,IAAEA,KAAER,IAAEE,KAAE,IAAG,IAAEL,QAAK,IAAEK,MAAI,CAAAI,KAAED,IAAGJ,MAAG,KAAGC,MAAGH,KAAE,MAAI,CAAC,GAAEK,KAAEC,GAAEJ,KAAE,KAAG,CAAC,GAAEA,KAAE,MAAIM,KAAEL,MAAG,IAAE,KAAIC,GAAEL,KAAEI,KAAE,CAAC,KAAG,KAAGK,QAAK,KAAG,KAAGH,OAAIH,KAAE,MAAI,KAAGA,MAAG,IAAEG,OAAI,KAAGH,KAAEK,OAAIL,IAAEC,KAAEA,KAAE,IAAE;AAAE,wBAAAM,KAAEA,KAAEX,KAAE,GAAEC,KAAED,KAAEC,KAAE,GAAEG,KAAED,KAAEH,KAAE,GAAEU,KAAE;AAAA,sBAAC;AAAC;AAAA,oBAAM;AAAC,oBAAAG,KAAED,KAAEZ,KAAEK,KAAE,GAAEO,KAAEJ,IAAGC,MAAG,MAAIF,KAAEH,MAAGD,KAAEI,KAAE,KAAG,MAAIL,KAAE,MAAI,CAAC,GAAEO,KAAED,GAAEC,KAAE,KAAG,CAAC,GAAEJ,KAAE,MAAIE,OAAI,IAAGD,GAAE,IAAEO,EAAC,KAAG,KAAGN,QAAK,KAAG,KAAGE,OAAIJ,KAAE,MAAI,KAAGA,MAAG,IAAEI,OAAI,KAAGJ,KAAEO,OAAIP,IAAEK,MAAGN,KAAEA,KAAE,IAAE,KAAGM,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASgB,GAAE1B,IAAEC,IAAE;AAAC,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEG,KAAE;AAAE,uBAAIO,KAAEf,KAAEe,KAAE,MAAI,GAAE2B,GAAEvC,KAAEH,KAAE,KAAG,CAAC,GAAE,GAAGG,IAAEJ,IAAE,EAAE,GAAE,GAAGI,EAAC,GAAE,GAAGH,KAAE,KAAG,GAAE,KAAIG,EAAC,OAAI;AAAC,wBAAG,CAACF,KAAE,MAAI,IAAEC,KAAG;AAAC,2BAAIH,KAAE,OAAI;AAAC,4BAAG,QAAM,IAAEA,KAAG;AAAC,+BAAIA,KAAE,GAAEG,KAAE,KAAI,QAAM,IAAEA,OAAI;AAAC,mCAAKH,OAAI,KAAG,QAAM,GAAGC,KAAE,KAAG,GAAE,KAAIA,KAAE,KAAG,CAAC,GAAED,KAAE,IAAGE,MAAGD,KAAE,KAAG,KAAGD,KAAE,GAAEA,KAAEA,KAAE,IAAE,IAAGE,KAAEM,GAAE,IAAEN,EAAC,OAAK,IAAEC,OAAI,IAAG;AAAC,4BAAAD,MAAGA,MAAG,KAAGH,KAAE,GAAEQ,IAAGJ,MAAG,KAAGJ,MAAG,CAAC,IAAEQ,GAAEL,MAAG,CAAC,GAAEK,GAAEL,MAAG,CAAC,IAAE,KAAGI,MAAG,IAAE,IAAGH,KAAEA,KAAE,IAAE,GAAEG,MAAG,IAAEG,OAAI,KAAGH,OAAI,GAAEG,KAAEA,OAAI,IAAE;AAAA,0BAAC;AAAC,6BAAGR,KAAE,KAAG,CAAC,GAAEe,KAAEf,KAAE,MAAI;AAAE;AAAA,wBAAK;AAAC,wBAAAM,IAAGP,MAAG,KAAGD,MAAG,CAAC,IAAE,GAAEC,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC;AAAA,oBAAK;AAAC,oBAAAI,KAAEI,IAAGP,KAAE,KAAG,KAAGE,KAAE,CAAC,GAAEH,KAAE,MAAIK,KAAEF,MAAG,KAAI,KAAGE,QAAK,KAAG,MAAIA,KAAED,MAAGJ,IAAEA,KAAE,MAAIK,MAAG,KAAGL,MAAG,IAAEI,OAAI,KAAGJ,IAAEA,KAAEI,MAAGJ,KAAGM,MAAGN,IAAES,MAAGJ,IAAEH,MAAGC,KAAEA,KAAE,IAAE,KAAGD,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASwB,GAAE3B,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEG,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAEN,OAAI;AAAC,yBAAIK,KAAEL,MAAG,GAAEM,KAAEJ,GAAEF,IAAE,IAAI,IAAEV,KAAE,GAAEO,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,2BAAIU,KAAEf,MAAGe,KAAEb,KAAEa,KAAE,MAAI,KAAG,KAAG,GAAEd,KAAEI,KAAEQ,KAAE,GAAET,GAAEJ,KAAE,KAAG,CAAC,IAAEC,IAAEG,GAAEJ,KAAE,KAAG,CAAC,IAAEC,OAAI,GAAEyC,GAAEzC,KAAEC,KAAE,KAAG,CAAC,GAAE,GAAGD,IAAEF,IAAE,EAAE,GAAE,GAAGE,IAAED,KAAE,KAAG,GAAE,CAAC,GAAE6B,GAAEvB,GAAEL,MAAG,CAAC,GAAE,GAAG,GAAEc,KAAEf,KAAE,KAAG,GAAEA,KAAE,KAAI,GAAGG,KAAED,KAAE,KAAG,GAAE,KAAID,EAAC,GAAEA,KAAEkC,GAAExB,MAAGN,MAAG,MAAIS,KAAE,GAAE,KAAIX,IAAE,GAAG,GAAEF,OAAI,KAAG,OAAK;AAAC,6BAAIQ,KAAET,MAAGG,MAAGH,OAAI,KAAG,IAAE,KAAG,GAAEA,KAAE,IAAG,IAAEA,QAAK,IAAEG,MAAI,CAAAC,IAAGQ,KAAEV,KAAE,KAAG,KAAGF,KAAE,CAAC,IAAEO,IAAGP,KAAES,KAAE,KAAGG,KAAE,CAAC,GAAEZ,KAAEA,KAAE,IAAE;AAAE,4BAAIA,KAAEE,KAAE,KAAG,KAAGC,IAAE,KAAID,KAAE,KAAG,CAAC,GAAED,KAAEkC,IAAGlC,MAAG,KAAGU,KAAE,GAAE,MAAIV,KAAE,GAAEQ,KAAET,IAAEA,KAAE,MAAIG,EAAC,IAAEF,KAAE;AAAA,sBAAC;AAAC,yBAAGC,KAAE,KAAG,CAAC,GAAEa,KAAEb,KAAE,MAAI,GAAEG,KAAEA,KAAE,IAAE;AAAA,oBAAC;AAAC,oBAAAG,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASkB,GAAE5B,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,kBAAAP,KAAE,KAAIF,KAAE;AAAE,oBAAE,YAAO;AAAC,uBAAE;AAAC,0BAAGD,KAAE,GAAEC,OAAI,IAAE,IAAI,YAAO;AAAC,4BAAG,QAAM,IAAEG,IAAG,OAAM;AAAE,wBAAAL,KAAEsC,GAAEtC,KAAEO,IAAGJ,MAAGE,MAAG,KAAGN,KAAE,MAAI,CAAC,GAAEC,MAAG,IAAG,OAAM,CAAC,GAAEO,GAAEJ,MAAG,CAAC,IAAE,GAAGH,IAAEiB,EAAC,GAAEZ,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC,iCAAO;AAAC,2BAAE;AAAC,8BAAGJ,OAAI,KAAG,IAAI,MAAIO,KAAEP,KAAEC,KAAE,GAAEQ,MAAGP,KAAE,IAAEI,GAAE,SAAOH,KAAEA,KAAE,IAAE,MAAI,MAAI,CAAC,IAAE,MAAI,QAAK;AAAC,iCAAI,IAAEH,QAAK,IAAEO,IAAG,OAAM;AAAE,4BAAAC,KAAEF,IAAGP,MAAGC,MAAG,KAAGF,KAAE,MAAI,CAAC,GAAEY,KAAEX,IAAEA,KAAEO,IAAGD,MAAGL,KAAEC,MAAG,KAAGH,KAAE,MAAI,CAAC,GAAEQ,GAAEI,MAAG,CAAC,IAAEF,KAAET,IAAEA,KAAES,KAAET,KAAE,GAAEO,GAAED,MAAG,CAAC,IAAEN,IAAEO,GAAED,MAAG,CAAC,IAAE,GAAGgC,GAAEtC,IAAEA,MAAG,IAAGG,IAAEO,EAAC,GAAEO,EAAC,GAAEhB,KAAEA,KAAE,IAAE;AAAA,0BAAC;AAAC,0BAAAC,OAAI;AAAE,mCAAS;AAAA,wBAAC;AAAC,wBAAAD,KAAEC,KAAEM,KAAE;AAAA,sBAAC;AAAA,oBAAC;AAAC;AAAA,kBAAK;AAAA,gBAAC;AAAC,yBAASoB,GAAE7B,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEG,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAE,OAAK,IAAEV,MAAI,CAAAF,MAAGE,MAAG,KAAGJ,KAAE,GAAEG,KAAES,GAAER,IAAE,CAAC,IAAEH,KAAE,GAAEI,KAAE,IAAEI,GAAE,IAAEN,EAAC,GAAEK,GAAEN,MAAG,CAAC,IAAEG,IAAEC,KAAEG,GAAE,IAAEN,EAAC,MAAI,IAAE,GAAEK,GAAEN,KAAE,KAAG,CAAC,IAAEI,IAAEC,KAAEE,GAAEN,KAAE,IAAE,CAAC,KAAG,IAAE,IAAEM,GAAE,IAAEN,EAAC,MAAI,GAAEK,GAAEN,KAAE,KAAG,CAAC,IAAEK,IAAEG,KAAED,GAAEN,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAEQ,IAAEC,KAAEF,GAAEN,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAES,IAAEE,KAAEJ,GAAEN,KAAE,IAAE,CAAC,KAAG,IAAE,IAAEM,GAAEN,KAAE,IAAE,CAAC,MAAI,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAEW,IAAEC,KAAEL,GAAEN,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEK,GAAEN,KAAE,MAAI,CAAC,IAAEY,IAAEX,KAAEM,GAAEN,KAAE,IAAE,CAAC,GAAEK,GAAEN,KAAE,KAAG,CAAC,IAAE,IAAEI,IAAEE,GAAEN,MAAG,CAAC,IAAE,IAAEG,IAAEG,GAAEN,KAAE,KAAG,CAAC,IAAE,IAAEK,IAAEC,GAAEN,KAAE,MAAI,CAAC,IAAE,IAAEQ,IAAEF,GAAEN,KAAE,MAAI,CAAC,IAAE,IAAES,IAAEH,GAAEN,KAAE,MAAI,CAAC,IAAE,IAAEW,IAAEL,GAAEN,KAAE,MAAI,CAAC,IAAE,IAAEY,IAAEN,GAAEN,KAAE,MAAI,CAAC,IAAE,KAAGC,OAAI,IAAE,IAAGC,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAASoE,GAAExE,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,yBAAOF,KAAE,MAAIC,KAAEC,KAAE,KAAGJ,KAAGG,KAAEA,OAAI,KAAG,KAAG,OAAKD,KAAE,KAAGD,KAAE,OAAKC,KAAE,MAAI,KAAGA,MAAG,KAAG,KAAGA,IAAEC,MAAGL,IAAEG,MAAGF,IAAEG,KAAE,KAAGE,IAAEA,OAAI,KAAG,MAAIH,KAAEE,MAAGD,IAAEE,KAAE,MAAIH,MAAG,KAAGC,MAAG,IAAEC,OAAI,KAAGD,KAAED,MAAGC,IAAEE,KAAED,MAAGD,KAAGC,KAAEF,IAAEA,KAAE,MAAIC,KAAE,IAAEF,KAAE,KAAIE,OAAI,KAAG,MAAID,KAAE,MAAIA,IAAED,KAAE,KAAGC,MAAGD,KAAE,MAAIC,OAAI,KAAGA,MAAG,IAAE,OAAK,KAAGA,IAAEH,MAAGE,IAAED,MAAGE,IAAEA,KAAE,KAAGC,IAAEA,OAAI,KAAG,MAAIF,KAAE,GAAEF,KAAEC,OAAIE,KAAE,MAAID,KAAED,OAAIE,KAAE,GAAEH,OAAI,KAAGG,MAAG,IAAEF,OAAI,KAAGE,KAAEH,OAAIG,KAAGe,KAAEhB,KAAEG,IAAEL,MAAGM;AAAA,gBAAC;AAAC,yBAASwB,GAAE9B,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,uBAAIT,KAAE,KAAID,KAAE,GAAEC,MAAG;AAAC,2BAAKD,OAAI,KAAG,OAAK;AAAC,2BAAIK,KAAEL,OAAI,KAAGE,KAAEF,KAAEC,KAAE,OAAK,IAAED,KAAEE,IAAEO,MAAGP,KAAEK,GAAE,SAAOD,KAAEA,KAAE,IAAE,MAAI,MAAI,CAAC,MAAI,KAAI,IAAEN,QAAK,IAAEK,MAAI,CAAAD,KAAE,GAAGkC,GAAElC,KAAEG,IAAGJ,MAAGH,KAAEC,MAAG,KAAGF,KAAE,MAAI,CAAC,GAAEK,MAAG,IAAGF,IAAEO,EAAC,GAAEQ,EAAC,GAAEP,KAAEP,IAAEK,KAAED,IAAGJ,MAAGH,MAAG,KAAGD,KAAE,MAAI,CAAC,GAAEQ,GAAEG,MAAG,CAAC,IAAEF,KAAEJ,IAAEG,GAAEJ,MAAG,CAAC,IAAEC,KAAEI,IAAER,KAAEA,KAAE,IAAE;AAAE,sBAAAA,KAAEC,KAAEI,KAAE;AAAA,oBAAC;AAAC,oBAAAJ,KAAEA,OAAI,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAAS6B,GAAE/B,IAAEC,IAAE;AAAC,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,kBAAAF,KAAEK,GAAER,KAAE,OAAK,CAAC,GAAEE,KAAEM,IAAGJ,KAAEJ,MAAG,KAAGG,MAAG,KAAG,KAAG,CAAC,GAAEA,KAAE,MAAIE,KAAEF,MAAG,KAAI,KAAGE,QAAK,KAAG,MAAIA,KAAE,MAAIF,IAAEA,KAAE,MAAIE,MAAG,KAAGF,MAAG,IAAE,OAAK,KAAGA,IAAEA,KAAE,MAAIA,KAAGK,GAAEJ,MAAG,CAAC,IAAED,KAAEK,GAAEJ,MAAG,CAAC,GAAEI,GAAEJ,KAAE,KAAG,CAAC,IAAEC,KAAEH,IAAEG,KAAEG,IAAGP,MAAG,MAAIE,KAAEF,KAAE,IAAE,MAAID,KAAE,KAAG,KAAG,CAAC,GAAEG,KAAE,MAAIC,KAAED,MAAG,IAAE,MAAK,KAAGC,QAAK,KAAG,MAAIA,KAAE,OAAKD,IAAEA,KAAE,MAAIC,MAAG,KAAGD,MAAG,IAAE,QAAM,KAAGA,IAAEA,KAAE,OAAKA,KAAGK,GAAEP,MAAG,CAAC,IAAEE,KAAEK,GAAEP,MAAG,CAAC,GAAEO,GAAEP,KAAE,KAAG,CAAC,IAAEG,KAAEC,IAAEG,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEQ,GAAER,KAAE,OAAK,CAAC,IAAE;AAAA,gBAAC;AAAC,yBAASgC,GAAEhC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAE,OAAK,IAAEV,MAAI,CAAAM,KAAED,IAAGN,MAAGC,MAAG,KAAGF,KAAE,KAAG,MAAI,CAAC,GAAES,KAAEF,GAAEN,KAAE,MAAI,CAAC,GAAEE,KAAEI,GAAEN,KAAE,MAAI,CAAC,GAAES,KAAEH,GAAEN,KAAE,MAAI,CAAC,GAAEW,KAAEL,GAAEN,KAAE,MAAI,CAAC,GAAEG,KAAEO,GAAET,IAAE,CAAC,IAAEH,KAAE,GAAEO,KAAE,MAAIC,GAAEN,KAAE,KAAG,CAAC,KAAG,KAAG,IAAEM,GAAEN,MAAG,CAAC,GAAEA,KAAE,IAAEM,GAAEN,KAAE,KAAG,CAAC,IAAE,GAAEI,GAAE,IAAED,EAAC,IAAEE,KAAEL,MAAG,GAAEK,KAAE,MAAIH,MAAG,KAAG,GAAEA,KAAE,IAAEO,KAAE,GAAEL,GAAED,KAAE,IAAE,CAAC,IAAEE,KAAE,KAAGM,MAAG,MAAI,MAAIT,QAAK,GAAEE,GAAED,KAAE,IAAE,CAAC,IAAE,MAAII,MAAG,KAAG,KAAGC,MAAG,MAAI,MAAIR,QAAK,IAAEE,MAAG,GAAED,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS8B,GAAEjC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE;AAAE,kBAAAT,KAAEK,GAAEN,MAAG,CAAC;AAAE,oBAAE,YAAO;AAAC,wBAAGD,GAAE,MAAIoB,GAAElB,EAAC,GAAED,KAAE,OAAI;AAAC,0BAAG,OAAK,IAAEA,KAAG;AAAC,wBAAAD,KAAEA,KAAE,IAAE,GAAED,KAAEA,KAAE,MAAI;AAAE,iCAAS;AAAA,sBAAC;AAAC,2BAAIW,MAAGP,KAAEF,MAAG,KAAGF,KAAE,GAAEY,KAAEJ,IAAGJ,KAAEA,KAAED,KAAE,MAAI,CAAC,GAAEM,KAAED,GAAEJ,KAAE,KAAG,CAAC,GAAEC,KAAE,GAAED,KAAE,GAAE,MAAI,IAAEC,MAAGD,KAAG,CAAAG,KAAE,MAAIG,KAAEL,MAAG,IAAGC,GAAED,KAAEM,KAAE,CAAC,KAAG,KAAGD,QAAK,KAAG,KAAGD,OAAIF,KAAE,MAAI,KAAGA,MAAG,IAAEE,OAAI,KAAGF,KAAEK,OAAIL,IAAEH,MAAGC,KAAEA,KAAE,IAAE,KAAGD,KAAEA,KAAE,IAAE;AAAE,sBAAAF,KAAEA,KAAE,IAAE;AAAE;AAAA,oBAAQ;AAAC;AAAA,kBAAK;AAAA,gBAAC;AAAC,yBAASgC,GAAElC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAF,MAAGE,MAAG,KAAGN,KAAE,GAAEE,KAAEU,GAAEN,IAAE,CAAC,IAAEL,KAAE,GAAEE,KAAEM,GAAE,IAAEP,EAAC,GAAEM,GAAEJ,MAAG,CAAC,IAAED,IAAEA,MAAGM,GAAEP,KAAE,IAAE,CAAC,KAAG,GAAEM,GAAEJ,MAAG,CAAC,IAAED,IAAEA,MAAGM,GAAEP,KAAE,IAAE,CAAC,KAAG,KAAG,QAAOM,GAAEJ,MAAG,CAAC,IAAED,IAAEE,KAAEI,GAAEP,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEM,GAAEJ,KAAE,KAAG,CAAC,IAAEC,IAAEA,MAAGI,GAAEP,KAAE,IAAE,CAAC,KAAG,GAAEM,GAAEJ,KAAE,KAAG,CAAC,IAAEC,IAAEH,KAAEO,GAAEP,KAAE,IAAE,CAAC,GAAEM,GAAEJ,MAAG,CAAC,IAAE,SAAOD,IAAEK,GAAEJ,KAAE,KAAG,CAAC,IAAE,UAAQC,KAAEH,MAAG,KAAII,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS6B,GAAEnC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,EAAEL,OAAI,KAAGE,OAAI,IAAEE,OAAI,IAAE,OAAM,CAAAC,MAAGF,KAAEK,GAAEP,KAAEG,KAAE,CAAC,OAAK,IAAE,GAAEA,KAAEA,KAAE,IAAE,GAAE,OAAK,KAAGD,MAAG,SAAOI,IAAGL,MAAG,KAAGH,MAAG,CAAC,IAAE,KAAGY,GAAEA,GAAER,IAAE,GAAG,MAAI,KAAG,GAAE,CAAC,IAAEA,KAAE,IAAGD,KAAEA,KAAE,IAAE,IAAG,OAAK,IAAEG,MAAGL,OAAI,KAAGE,OAAI,MAAIK,IAAGL,MAAG,KAAGH,MAAG,CAAC,IAAE,KAAGY,GAAEA,GAAEN,IAAE,GAAG,MAAI,KAAG,GAAE,CAAC,IAAEA,KAAE,IAAGH,KAAEA,KAAE,IAAE;AAAG,yBAAOA;AAAA,gBAAC;AAAC,yBAASiC,GAAEpC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAEL,OAAI;AAAC,yBAAIc,KAAEb,KAAEa,KAAE,OAAK,GAAE4B,GAAEvC,MAAGH,MAAG,MAAIH,KAAE,GAAEO,KAAEK,GAAET,IAAE,IAAI,IAAEF,KAAE,GAAEC,EAAC,GAAEG,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAwC,GAAEzC,KAAGI,KAAEH,MAAG,MAAIE,KAAE,GAAEL,KAAEM,KAAE,CAAC,GAAE,EAAEF,IAAEA,IAAEF,EAAC,GAAEC,KAAEA,KAAE,IAAE;AAAE,oBAAAY,KAAEb,KAAE,OAAK,GAAED,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASkC,GAAErC,IAAEC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,EAAEN,OAAI,KAAGI,OAAI,MAAID,KAAEG,KAAE,IAAE,OAAK,IAAEJ,OAAI,KAAI,CAAAG,KAAEJ,KAAEK,KAAE,GAAEA,KAAEH,KAAGA,KAAEK,GAAEH,KAAE,IAAE,CAAC,KAAG,KAAG,UAAQG,GAAE,IAAEH,EAAC,IAAEG,GAAEH,KAAE,IAAE,CAAC,KAAG,OAAK,IAAE,YAAUE,IAAGH,MAAG,KAAGL,MAAG,CAAC,IAAEI,IAAEC,KAAEA,KAAE,IAAE;AAAG,yBAAOA;AAAA,gBAAC;AAAC,yBAASiC,GAAEtC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,EAAE,CAACH,KAAE,MAAI,IAAEF,OAAK,CAAAG,KAAEI,GAAET,KAAEE,KAAE,CAAC,GAAED,KAAE,MAAIE,KAAED,MAAG,KAAI,KAAGC,QAAK,KAAG,MAAIA,KAAEE,MAAGJ,IAAEA,KAAE,MAAIE,MAAG,KAAGF,MAAG,IAAEI,OAAI,KAAGJ,IAAEA,KAAEI,MAAGJ,KAAGK,MAAGL,IAAEM,MAAGJ,IAAEC,MAAGF,KAAEA,KAAE,IAAE,KAAGE,KAAEA,KAAE,IAAE;AAAE,yBAAOc,KAAEX,IAAED;AAAA,gBAAC;AAAC,yBAASiC,GAAEvC,IAAEC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,IAAEC,IAAEC,IAAEC,IAAEC,KAAE,GAAEC,KAAE;AAAE,yBAAOF,KAAEK,GAAEJ,KAAEN,OAAI,KAAG,GAAEO,KAAET,OAAI,KAAG,CAAC,GAAEQ,MAAG,SAAOC,OAAIH,KAAEM,GAAER,KAAE,QAAMF,IAAEG,KAAE,QAAML,EAAC,OAAK,KAAG,KAAGY,GAAEH,IAAEL,EAAC,IAAE,MAAIQ,GAAEJ,IAAEH,EAAC,IAAE,GAAEa,MAAGN,GAAEX,IAAEC,EAAC,IAAEK,KAAE,KAAGK,GAAEZ,IAAEG,EAAC,KAAGM,OAAI,OAAKD,OAAI,MAAI,GAAE,QAAMF,KAAEE,MAAG;AAAA,gBAAE;AAAC,yBAASgC,GAAExC,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAE,MAAI,IAAEL,OAAI;AAAC,yBAAIE,MAAGH,KAAEC,MAAG,MAAIJ,KAAE,GAAEO,KAAEN,KAAEE,KAAE,GAAEM,KAAEP,KAAEC,KAAE,GAAEA,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAK,GAAEF,MAAGD,KAAEF,MAAG,MAAI,CAAC,IAAEK,GAAEH,KAAEE,MAAG,CAAC,IAAEC,GAAEH,KAAEI,MAAG,CAAC,GAAEN,KAAEA,KAAE,IAAE;AAAE,oBAAAC,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASqC,GAAEzC,IAAEC,IAAEC,IAAE;AAAC,sBAAIC,IAAEC;AAAE,uBAAIa,KAAEd,KAAEc,KAAE,MAAI,GAAE,EAAEb,KAAED,KAAE,KAAG,GAAEF,IAAEC,EAAC,GAAE,GAAGD,KAAEE,KAAE,KAAG,GAAE,KAAIC,EAAC,GAAEF,KAAEiC,GAAEnC,IAAE,KAAIC,EAAC,GAAEC,OAAI,KAAG,MAAK,IAAGD,KAAEE,KAAE,KAAG,GAAE,KAAIA,KAAE,KAAG,CAAC,GAAED,KAAEiC,IAAGjC,MAAG,KAAGF,KAAE,GAAE,MAAIE,KAAE,GAAED,EAAC,IAAEC,KAAE;AAAE,qBAAGC,KAAE,KAAG,CAAC,GAAEc,KAAEd,KAAE,MAAI;AAAA,gBAAC;AAAC,yBAASuC,GAAE1C,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAE,MAAI,IAAEJ,OAAI;AAAC,yBAAIE,MAAGF,MAAG,KAAGH,KAAE,GAAEO,MAAGJ,MAAG,MAAIF,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAE,MAAGF,MAAG,KAAGK,KAAE,GAAED,GAAEJ,KAAEG,KAAE,CAAC,IAAEG,GAAEJ,KAAE,KAAG,CAAC,KAAG,IAAEI,GAAEJ,MAAG,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,oBAAAC,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAASwC,GAAE3C,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAEH,OAAI;AAAC,yBAAIG,MAAGH,MAAG,MAAIF,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAG,KAAEI,IAAGL,MAAGF,MAAG,KAAGI,KAAE,MAAI,CAAC,GAAEG,GAAEL,MAAG,CAAC,IAAEC,MAAGA,MAAG,KAAG,UAASH,KAAEA,KAAE,IAAE;AAAE,oBAAAC,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAA,gBAAC;AAAC,yBAAS0C,GAAE5C,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE;AAAE,uBAAID,KAAED,IAAEA,KAAEmB,GAAE,GAAG,GAAEX,GAAEP,MAAG,CAAC,IAAED,IAAEA,OAAIc,GAAE,GAAG,GAAET,GAAE,IAAG,OAAK,IAAEH,MAAI,CAAAM,IAAGP,KAAED,MAAGE,MAAG,KAAG,MAAI,CAAC,IAAE,GAAEM,GAAEP,KAAE,KAAG,CAAC,IAAE,GAAEC,KAAEA,KAAE,IAAE;AAAE,kBAAAM,GAAER,KAAE,OAAK,CAAC,IAAE,GAAEQ,GAAER,KAAE,OAAK,CAAC,IAAE;AAAA,gBAAC;AAAC,yBAAS6C,GAAE7C,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAED,MAAI,CAAAD,KAAEoC,GAAEpC,KAAEK,IAAGH,KAAED,MAAG,KAAGF,MAAG,CAAC,GAAEC,MAAG,IAAGA,KAAEK,GAAEP,KAAEI,MAAG,CAAC,GAAEF,MAAG,EAAE,GAAEK,GAAER,KAAEK,MAAG,CAAC,IAAE,GAAGF,IAAEe,EAAC,GAAEd,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAASgB,GAAEpB,IAAE;AAAC,sBAAIC,IAAEC;AAAE,0BAAOF,MAAGC,KAAEO,GAAE,GAAG,MAAIN,KAAEF,KAAE,IAAE,MAAI,OAAK,KAAGC,OAAI,KAAGC,MAAGF,OAAI,KAAGG,GAAE,aAAW,QAAM,MAAI,OAAK,KAAG,EAAE,IAAEa,GAAE,IAAEhB,EAAC,MAAIQ,GAAE,GAAG,IAAE,IAAG,OAAKA,GAAE,GAAG,IAAER,IAAEC;AAAA,gBAAE;AAAC,yBAAS6C,GAAE9C,IAAEC,IAAE;AAAC,sBAAIC,KAAE,GAAEC,KAAE;AAAE,uBAAI,IAAEF,OAAI,QAAQ,YAAO;AAAC,wBAAG,QAAM,IAAEE,IAAG,QAAO;AAAE,wBAAGD,KAAEC,MAAG,GAAEA,KAAEA,KAAE,IAAE,GAAE,IAAID,KAAEM,GAAER,KAAEE,MAAG,CAAC,MAAIA,MAAG,IAAEA,MAAG,MAAI,MAAI,IAAED,KAAI;AAAA,kBAAK;AAAC,yBAAO;AAAA,gBAAC;AAAC,yBAAS8C,GAAE/C,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAEF,MAAI,CAAAE,KAAEK,IAAGN,MAAGD,MAAG,KAAGD,KAAE,MAAI,CAAC,GAAEQ,GAAEN,MAAG,CAAC,IAAEC,KAAES,GAAET,KAAE,WAAS,IAAG,QAAQ,GAAEF,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,EAAED,IAAEC,IAAE;AAAC,sBAAIC;AAAE,yBAAOA,KAAEF,IAAEA,KAAEY,GAAEX,KAAE,OAAK,GAAE,IAAI,IAAE,YAAU,KAAG,IAAGA,KAAEW,GAAEZ,IAAE,OAAO,IAAEC,KAAE,GAAEO,GAAEN,MAAG,CAAC,MAAI,IAAED,MAAG,UAAQ,WAAS,KAAGA,IAAED;AAAA,gBAAC;AAAC,yBAAS,EAAEA,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,OAAI;AAAC,wBAAG,MAAI,IAAED,IAAG,QAAO;AAAE,wBAAGC,KAAED,MAAG,IAAGA,KAAEA,KAAE,IAAE,GAAE6C,GAAE9C,KAAEE,KAAE,GAAE,MAAM,EAAE;AAAA,kBAAK;AAAC,yBAAO;AAAA,gBAAC;AAAC,yBAAS,EAAEF,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,OAAI;AAAC,wBAAG,MAAI,IAAED,IAAG,QAAO;AAAE,wBAAGC,KAAED,MAAG,IAAGA,KAAEA,KAAE,IAAE,GAAE4C,GAAE9C,KAAEG,KAAE,GAAEF,EAAC,EAAE;AAAA,kBAAK;AAAC,yBAAO;AAAA,gBAAC;AAAC,yBAAS,EAAED,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAE,QAAM,IAAED,MAAI,CAAAK,IAAGJ,KAAED,MAAG,KAAGH,MAAG,CAAC,IAAEQ,GAAEN,KAAEE,MAAG,CAAC,IAAEI,GAAEP,KAAEG,MAAG,CAAC,GAAED,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,EAAEH,IAAEC,IAAEC,IAAE;AAAC,sBAAIC;AAAE,kBAAAc,KAAEd,KAAEc,KAAE,KAAG,GAAEX,GAAEH,KAAE,KAAG,CAAC,IAAED,IAAEI,GAAEH,KAAE,KAAG,CAAC,IAAED,OAAI,GAAE0C,GAAE5C,EAAC,GAAE,GAAGA,IAAEC,IAAE,EAAE,GAAE,GAAGD,IAAEG,KAAE,KAAG,GAAE,CAAC,GAAE,GAAGH,EAAC,GAAEiB,KAAEd,KAAE,KAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGH,IAAEC,IAAE;AAAC,sBAAIC,KAAE;AAAE,yBAAOqC,GAAEvC,IAAEC,IAAE,GAAE,QAAQ,GAAEC,KAAEqC,GAAErC,KAAEgB,IAAEhB,MAAG,IAAG,UAAS,EAAE,GAAED,KAAEA,KAAEiB,KAAE,GAAElB,KAAEE,OAAI,IAAEF,OAAI,IAAEC,KAAE,IAAE,IAAEA;AAAA,gBAAC;AAAC,yBAAS,GAAGD,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAED,MAAI,IAAGC,KAAED,MAAG,MAAIH,KAAE,GAAEC,KAAEG,KAAE,GAAEF,KAAEE,KAAE,CAAC,GAAED,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGH,IAAEC,IAAEC,IAAE;AAAC,2BAAQC,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAED,MAAI,CAAA0C,IAAGzC,KAAED,MAAG,MAAIH,KAAE,GAAEC,IAAEC,KAAEE,KAAE,CAAC,GAAED,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGH,IAAEC,IAAE;AAAC,sBAAIC,KAAE;AAAE,uBAAIA,KAAE,MAAKI,GAAE,IAAEN,EAAC,IAAES,GAAE,IAAER,EAAC,GAAED,KAAEA,KAAE,IAAE,GAAEC,KAAEA,KAAE,IAAE,GAAEC,KAAEA,KAAE,IAAE,IAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAEC,IAAE;AAAC,2BAAQC,KAAE,IAAG,IAAED,QAAK,IAAEC,MAAI,CAAA4B,IAAG5B,MAAG,MAAIF,KAAE,CAAC,GAAEE,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAE;AAAC,2BAAQC,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA8C,IAAG9C,MAAG,MAAID,KAAE,CAAC,GAAEC,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGD,IAAE;AAAC,2BAAQC,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA2B,IAAG3B,MAAG,MAAID,KAAE,CAAC,GAAEC,KAAEA,KAAE,IAAE;AAAA,gBAAC;AAAC,yBAAS,GAAGD,IAAE;AAAC,sBAAIC;AAAE,0BAAO,QAAMA,KAAE,KAAGD,MAAG,OAAKC,MAAG,OAAKD,KAAE,IAAEA,KAAE,MAAI,QAAMA;AAAA,gBAAC;AAAC,yBAAS,GAAGA,IAAE;AAAC,yBAAOA,KAAE,KAAGa,GAAEb,KAAE,IAAEA,EAAC,IAAE,IAAE;AAAA,gBAAE;AAAC,yBAAS,GAAGA,IAAEC,IAAEC,IAAE;AAAC,kBAAAuB,GAAEzB,IAAEC,IAAEO,GAAEN,MAAG,CAAC,GAAE,GAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAEC,IAAEC,IAAE;AAAC,kBAAAsB,GAAEhB,GAAER,MAAG,CAAC,GAAE,KAAIC,IAAEC,EAAC;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAEC,IAAEC,IAAE;AAAC,kBAAAuB,GAAEzB,IAAEC,IAAEO,GAAEN,MAAG,CAAC,GAAE,GAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAEC,IAAEC,IAAE;AAAC,kBAAAsB,GAAEhB,GAAER,MAAG,CAAC,GAAE,KAAIC,IAAEC,EAAC;AAAA,gBAAC;AAAC,yBAAS,GAAGF,IAAE;AAAC,kBAAA+B,GAAEvB,GAAER,MAAG,CAAC,GAAE,GAAG;AAAA,gBAAC;AAAC,yBAAS,GAAGA,IAAE;AAAC,kBAAAsB,GAAEd,GAAER,MAAG,CAAC,CAAC;AAAA,gBAAC;AAAC,yBAAS,GAAGA,IAAE;AAAC,qBAAGA,IAAE,CAAC;AAAA,gBAAC;AAAC,yBAAS,GAAGA,IAAE;AAAC,qBAAGA,IAAE,CAAC;AAAA,gBAAC;AAAC,gBAAAI,GAAEH,KAAEQ,IAAE,MAAK,8GAA8G,GAAEL,GAAEH,IAAE,MAAK,slDAAslD,GAAEG,GAAEH,IAAE,MAAK,MAAM;AAAE,oBAAI,IAAG,OAAK,KAAG,CAAC,GAAG,MAAI,SAASD,IAAEC,IAAE;AAAC,uBAAKD,EAAC,IAAEC;AAAA,gBAAC,GAAE,GAAG,MAAI,SAASD,IAAE;AAAC,yBAAO,KAAKA,EAAC;AAAA,gBAAC,GAAE;AAAI,uBAAM,EAAC,GAAE,WAAU;AAAA,gBAAC,GAAE,GAAE,IAAG,GAAEmB,IAAE,GAAEG,IAAE,GAAE,WAAU;AAAC,sBAAItB;AAAE,kBAAAiB,KAAEjB,KAAEiB,KAAE,KAAG,GAAEX,GAAEN,KAAE,KAAG,CAAC,IAAE,GAAEe,GAAE,MAAKf,KAAE,KAAG,GAAE,CAAC,GAAEiB,KAAEjB,KAAE,KAAG;AAAA,gBAAC,GAAE,GAAE,WAAU;AAAC,yBAAO;AAAA,gBAAI,GAAE,GAAE,WAAU;AAAC,yBAAO;AAAA,gBAAI,GAAE,GAAE,WAAU;AAAC,yBAAO;AAAA,gBAAI,GAAE,GAAE,SAASA,IAAEC,IAAE;AAAC,kBAAAD,MAAG,GAAEC,MAAG;AAAE,sBAAIC,IAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEG,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE;AAAE,uBAAIL,KAAEf,KAAEe,KAAE,QAAM,GAAEP,KAAER,KAAE,QAAM,GAAE,OAAK,IAAEE,MAAI,CAAAa,KAAEV,KAAEU,KAAE,KAAG,GAAEX,GAAEC,KAAE,KAAG,CAAC,IAAE,GAAEI,KAAE,IAAEI,GAAE,MAAKR,KAAE,KAAG,GAAE,CAAC,GAAEU,KAAEV,KAAE,KAAG,GAAED,GAAEF,KAAEM,KAAE,CAAC,IAAEC,IAAEP,KAAEA,KAAE,IAAE;AAAE,uBAAImB,GAAEb,IAAE,KAAIA,IAAE,EAAE,GAAEiB,GAAEpB,KAAEL,KAAE,QAAM,GAAEQ,EAAC,GAAEM,KAAEd,KAAE,QAAM,GAAEE,KAAEF,KAAE,QAAM,GAAE,MAAI,IAAEC,MAAI,CAAAsC,GAAEzB,MAAGb,MAAG,MAAI,GAAEC,IAAE,QAAMC,EAAC,GAAEF,KAAEA,KAAE,IAAE,GAAEE,KAAEA,KAAE,IAAE;AAAE,uBAAIa,KAAEhB,KAAE,QAAM,GAAEC,KAAE,GAAEE,KAAE,GAAE,MAAI,IAAEF,MAAI,CAAAsC,GAAEvB,MAAGf,MAAG,MAAI,GAAEC,IAAE,QAAMC,EAAC,GAAEF,KAAEA,KAAE,IAAE,GAAEE,KAAEA,KAAE,IAAE;AAAE,uBAAI,GAAGF,KAAED,KAAE,QAAM,GAAEc,EAAC,GAAE,GAAGb,EAAC,GAAEiC,GAAE/B,KAAEH,KAAG,QAAM,GAAEK,IAAEJ,EAAC,GAAE,GAAGE,EAAC,GAAE,GAAGA,EAAC,GAAE,GAAGA,IAAEA,IAAEa,EAAC,GAAEyB,GAAEtC,EAAC,GAAEF,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAIgB,MAAGf,KAAED,MAAG,MAAIE,KAAE,GAAEQ,KAAET,KAAEF,KAAE,GAAEY,KAAEV,KAAEC,KAAE,GAAED,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAO,MAAGU,KAAEb,IAAGD,KAAEH,MAAG,KAAGU,MAAG,CAAC,KAAG,OAAK,GAAEN,GAAED,KAAEM,MAAG,CAAC,IAAEQ,MAAG,QAAMV,KAAGH,GAAED,KAAEY,MAAG,CAAC,IAAER,MAAG,IAAGP,KAAEA,KAAE,IAAE;AAAE,oBAAAD,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,uBAAIA,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAG,GAAEN,KAAEG,KAAE,CAAC,IAAEM,GAAEN,KAAEO,KAAE,CAAC,GAAEP,KAAEA,KAAE,IAAE;AAAE,uBAAIgB,KAAEnB,KAAE,KAAG,GAAEG,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAIU,KAAEM,KAAEP,GAAET,IAAE,GAAG,IAAE,GAAEW,KAAET,MAAGF,MAAG,MAAI,GAAEI,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAI,KAAEE,KAAED,GAAEL,IAAE,CAAC,IAAE,GAAEH,KAAEU,MAAGP,MAAG,KAAG,GAAED,GAAE,IAAEK,EAAC,IAAEH,GAAEJ,MAAG,CAAC,GAAEE,GAAEK,KAAE,IAAE,CAAC,IAAEH,GAAEJ,KAAE,KAAG,CAAC,KAAG,IAAEI,GAAEJ,MAAG,CAAC,MAAI,GAAEE,GAAEK,KAAE,IAAE,CAAC,IAAEH,GAAEJ,KAAE,KAAG,CAAC,KAAG,IAAEI,GAAEJ,KAAE,KAAG,CAAC,MAAI,GAAEE,GAAEK,KAAE,IAAE,CAAC,IAAEH,GAAEJ,KAAE,MAAI,CAAC,KAAG,IAAEI,GAAEJ,KAAE,KAAG,CAAC,MAAI,GAAEE,GAAEK,KAAE,IAAE,CAAC,IAAEH,GAAEJ,KAAE,MAAI,CAAC,MAAI,GAAEG,KAAEA,KAAE,IAAE;AAAE,oBAAAJ,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,uBAAIoB,GAAElB,KAAEH,KAAE,QAAM,GAAE,IAAGF,IAAE,IAAI,GAAEA,KAAEE,KAAE,QAAM,GAAEC,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAG,GAAEL,KAAEE,KAAE,CAAC,IAAEM,GAAEN,KAAEO,KAAE,CAAC,GAAEP,KAAEA,KAAE,IAAE;AAAE,uBAAIC,KAAEH,KAAE,KAAG,GAAEE,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAG,GAAEH,KAAEC,KAAE,CAAC,IAAEK,GAAET,KAAEG,KAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIH,KAAEC,KAAG,MAAI,GAAEE,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAG,GAAEN,KAAEG,KAAE,CAAC,IAAEM,GAAEN,KAAEE,KAAE,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,uBAAIH,KAAEC,KAAE,KAAG,GAAEE,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA6B,GAAEhC,KAAEY,GAAET,IAAE,EAAE,IAAE,GAAEa,MAAGb,MAAG,MAAI,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIH,KAAEC,KAAE,MAAI,GAAEE,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA6B,GAAEhC,KAAEY,GAAET,IAAE,EAAE,IAAE,GAAEe,MAAGf,MAAG,MAAI,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIQ,KAAEV,KAAE,OAAK,GAAEE,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAIa,KAAEL,KAAEC,GAAET,IAAE,GAAG,IAAE,GAAEe,MAAGf,MAAG,MAAID,KAAE,GAAEG,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAc,KAAEX,IAAGP,KAAEiB,MAAGb,MAAG,KAAG,KAAG,MAAI,CAAC,GAAEQ,KAAEL,GAAEP,KAAE,KAAG,CAAC,GAAEa,KAAEN,GAAEP,KAAE,MAAI,CAAC,GAAEM,KAAEC,GAAEP,KAAE,MAAI,CAAC,GAAES,KAAEF,GAAEP,KAAE,MAAI,CAAC,GAAEG,KAAEI,GAAEP,KAAE,MAAI,CAAC,GAAEoB,KAAEb,GAAEP,KAAE,KAAG,CAAC,GAAED,KAAEgB,KAAEJ,GAAEP,IAAE,EAAE,IAAE,GAAEiB,KAAE,OAAKd,GAAEP,MAAG,CAAC,IAAE,GAAEK,GAAE,IAAEN,EAAC,IAAEsB,IAAErB,KAAE,OAAKoB,KAAE,GAAEf,GAAEN,KAAE,IAAE,CAAC,IAAEC,OAAI,GAAEG,KAAE,OAAKA,KAAE,GAAEE,GAAEN,KAAE,IAAE,CAAC,IAAEI,OAAI,GAAEM,KAAE,OAAKA,KAAE,GAAEJ,GAAEN,KAAE,IAAE,CAAC,IAAEU,OAAI,GAAEH,KAAE,OAAKA,KAAE,GAAED,GAAEN,KAAE,KAAG,CAAC,IAAEO,OAAI,GAAEO,KAAE,OAAKA,KAAE,GAAER,GAAEN,KAAE,KAAG,CAAC,IAAEc,OAAI,GAAER,GAAEN,KAAE,IAAE,CAAC,IAAEC,MAAG,IAAEqB,OAAI,GAAET,KAAE,OAAKA,KAAE,GAAEP,GAAEN,KAAE,IAAE,CAAC,IAAEa,MAAG,IAAEZ,OAAI,IAAGK,GAAEN,KAAE,IAAE,CAAC,IAAEI,MAAG,IAAES,OAAI,GAAEP,GAAEN,KAAE,IAAE,CAAC,IAAEU,MAAG,IAAEN,OAAI,GAAEH,KAAE,OAAKkB,KAAE,GAAEb,GAAEN,KAAE,IAAE,CAAC,IAAEC,MAAG,IAAES,OAAI,IAAGJ,GAAEN,KAAE,IAAE,CAAC,IAAEO,MAAG,IAAEN,OAAI,GAAEK,GAAEN,KAAE,KAAG,CAAC,IAAEc,MAAG,IAAEP,OAAI,IAAGF,KAAEA,KAAE,IAAE;AAAE,oBAAAF,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,yBAAOc,KAAEf,KAAE,QAAM,GAAE;AAAA,gBAAC,GAAE,GAAE,SAASF,IAAEC,IAAEC,IAAEC,IAAE;AAAC,kBAAAF,MAAG,GAAEC,MAAG,GAAEC,MAAG;AAAE,sBAAIC,IAAEC,IAAEK,IAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAE+C,KAAE,GAAEzC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE;AAAE,uBAAIpC,MAAGL,MAAG,KAAG,IAAE,GAAEiB,KAAEb,MAAGa,KAAEP,KAAEO,KAAE,KAAG,KAAG,SAAO,GAAEJ,KAAE2D,KAAEpE,KAAE,SAAO,GAAEU,KAAEiB,KAAE3B,KAAE,SAAO,GAAEW,KAAEX,KAAE,SAAO,GAAEY,KAAEZ,KAAE,QAAM,GAAEc,KAAEd,KAAE,QAAM,GAAEe,KAAEf,KAAE,QAAM,GAAE,OAAK,IAAEO,MAAI,CAAAL,GAAEK,KAAEE,KAAE,CAAC,IAAEJ,GAAEN,KAAEQ,KAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIE,KAAEV,KAAE,KAAG,GAAEQ,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAL,GAAEK,KAAEI,KAAE,CAAC,IAAEN,GAAEE,KAAEE,KAAE,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,uBAAIE,KAAEV,KAAG,MAAI,GAAEQ,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAL,GAAEK,KAAEG,KAAE,CAAC,IAAEL,GAAEE,KAAEE,KAAE,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,uBAAIE,KAAEV,KAAE,KAAG,GAAEQ,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAkB,GAAEX,MAAGP,MAAG,MAAI,GAAEE,KAAED,GAAED,IAAE,EAAE,IAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAIE,KAAEV,KAAE,MAAI,GAAEQ,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAkB,GAAEV,MAAGR,MAAG,MAAI,GAAEE,KAAED,GAAED,IAAE,EAAE,IAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,uBAAI0B,KAAElC,KAAE,OAAK,GAAEQ,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAI2B,KAAEtB,MAAGL,MAAG,MAAI,GAAE4B,KAAEF,KAAEzB,GAAED,IAAE,GAAG,IAAE,GAAEG,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAX,KAAEmC,MAAGxB,MAAG,KAAG,GAAED,KAAE0B,KAAE3B,GAAEE,IAAE,EAAE,IAAE,GAAEkB,KAAEvB,GAAE,IAAEI,EAAC,GAAEL,GAAEL,MAAG,CAAC,IAAE6B,IAAEA,MAAGvB,GAAEI,KAAE,IAAE,CAAC,KAAG,IAAE,MAAKL,GAAEL,MAAG,CAAC,IAAE6B,IAAEX,KAAEZ,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,KAAG,CAAC,IAAEkB,IAAEA,MAAGZ,GAAEI,KAAE,IAAE,CAAC,KAAG,GAAEL,GAAEL,KAAE,KAAG,CAAC,IAAEkB,IAAEA,MAAGZ,GAAEI,KAAE,IAAE,CAAC,KAAG,KAAG,MAAKL,GAAEL,KAAE,KAAG,CAAC,IAAEkB,IAAEY,KAAExB,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,KAAG,CAAC,IAAE8B,IAAEA,MAAGxB,GAAEI,KAAE,IAAE,CAAC,KAAG,IAAE,MAAKL,GAAEL,KAAE,KAAG,CAAC,IAAE8B,IAAEX,KAAEb,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEmB,IAAEA,MAAGb,GAAEI,KAAE,IAAE,CAAC,KAAG,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEmB,IAAEA,MAAGb,GAAEI,KAAE,IAAE,CAAC,KAAG,IAAE,MAAKL,GAAEL,KAAE,MAAI,CAAC,IAAEmB,IAAEE,KAAEf,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEqB,IAAEA,MAAGf,GAAEI,KAAE,IAAE,CAAC,KAAG,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEqB,IAAEA,MAAGf,GAAEI,KAAE,IAAE,CAAC,KAAG,KAAG,MAAKL,GAAEL,KAAE,MAAI,CAAC,IAAEqB,IAAEW,KAAE1B,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEgC,IAAEA,MAAG1B,GAAEI,KAAE,IAAE,CAAC,KAAG,IAAE,MAAKL,GAAEL,KAAE,MAAI,CAAC,IAAEgC,IAAEV,KAAEhB,GAAEI,KAAE,IAAE,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEsB,IAAEA,MAAGhB,GAAEI,KAAE,KAAG,CAAC,KAAG,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEsB,IAAEA,MAAGhB,GAAEI,KAAE,KAAG,CAAC,KAAG,KAAG,MAAKL,GAAEL,KAAE,MAAI,CAAC,IAAEsB,IAAEgB,KAAEhC,GAAEI,KAAE,KAAG,CAAC,MAAI,IAAE,GAAEL,GAAEL,KAAE,MAAI,CAAC,IAAEsC,IAAE5B,KAAEJ,GAAEI,KAAE,KAAG,CAAC,GAAEL,GAAEL,KAAE,KAAG,CAAC,IAAE,OAAKkB,IAAEb,GAAEL,MAAG,CAAC,IAAE,OAAK6B,IAAExB,GAAEL,KAAE,KAAG,CAAC,IAAE,OAAK8B,IAAEzB,GAAEL,KAAE,MAAI,CAAC,IAAE,OAAKmB,IAAEd,GAAEL,KAAE,MAAI,CAAC,IAAE,OAAKqB,IAAEhB,GAAEL,KAAE,MAAI,CAAC,IAAE,OAAKgC,IAAE3B,GAAEL,KAAE,MAAI,CAAC,IAAE,OAAKsB,IAAEjB,GAAEL,KAAE,MAAI,CAAC,IAAE,QAAMU,MAAG,IAAE4B,KAAG3B,KAAEA,KAAE,IAAE;AAAE,oBAAAH,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,uBAAIiC,GAAEzC,KAAEC,KAAE,KAAG,CAAC,GAAE,GAAGD,IAAE4B,IAAE,EAAE,GAAE,GAAG5B,IAAEF,IAAEC,EAAC,GAAE,GAAGC,EAAC,GAAE,GAAG4B,KAAE3B,KAAE,SAAO,GAAE,IAAGD,EAAC,GAAE,GAAGA,EAAC,GAAEoB,GAAEc,KAAEjC,KAAE,SAAO,GAAE,IAAGW,IAAE,EAAE,GAAEY,GAAEvB,KAAE,QAAM,GAAEoE,EAAC,GAAE,GAAGtD,EAAC,GAAE,GAAGC,EAAC,GAAE,GAAGH,EAAC,GAAEL,KAAE,OAAI;AAAC,yBAAIE,KAAET,KAAE,QAAM,GAAEU,KAAEF,GAAE,QAAMD,IAAE,CAAC,GAAEV,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAgB,KAAEf,KAAEe,KAAE,MAAI,GAAE,EAAEd,KAAED,KAAE,KAAG,GAAEmC,IAAEpC,KAAEa,KAAE,KAAK,GAAE,GAAGC,KAAEb,KAAE,KAAG,GAAE,KAAIC,EAAC,GAAE,GAAGA,EAAC,GAAE+B,GAAErB,MAAGZ,MAAG,MAAI,GAAEc,EAAC,GAAEE,KAAEf,KAAE,MAAI,GAAED,KAAEA,KAAE,IAAE;AAAE,yBAAI,GAAGE,KAAEC,KAAE,OAAK,GAAES,EAAC,GAAE,GAAGV,EAAC,GAAEiC,GAAEnC,KAAEG,KAAE,QAAM,GAAEA,KAAE,QAAM,GAAED,EAAC,GAAE,GAAGF,EAAC,GAAE,GAAGA,EAAC,GAAE0C,GAAE1C,EAAC,GAAEe,KAAEZ,KAAE,OAAK,GAAEF,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,2BAAIgB,MAAGJ,KAAEZ,MAAG,MAAID,KAAE,GAAEkB,KAAEL,KAAEE,KAAE,GAAEwD,KAAEvE,KAAEa,KAAE,GAAEA,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAN,IAAGO,KAAED,MAAG,KAAGI,MAAG,CAAC,IAAE,EAAEH,KAAEI,KAAE,GAAEX,GAAEO,KAAEyD,MAAG,CAAC,CAAC,GAAE1D,KAAEA,KAAE,IAAE;AAAE,sBAAAZ,KAAEA,KAAE,IAAE;AAAA,oBAAC;AAAC,yBAAIwC,GAAErC,IAAEJ,EAAC,GAAE2C,GAAE3C,KAAEG,KAAE,KAAG,CAAC,GAAE,GAAGH,IAAE8B,IAAE,EAAE,GAAE,GAAG9B,IAAEI,IAAE,IAAI,GAAE,GAAGJ,EAAC,GAAE,GAAGI,IAAE,IAAGJ,EAAC,GAAE,GAAGA,EAAC,GAAEyB,GAAEzB,KAAEG,KAAE,KAAG,GAAEC,EAAC,GAAEM,KAAEA,KAAE,IAAE,GAAEmB,GAAE7B,EAAC,GAAEa,KAAEV,KAAE,QAAM,GAAEF,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA2C,IAAG9B,KAAEb,MAAG,MAAIC,KAAE,GAAEF,IAAEa,KAAEC,KAAE,CAAC,GAAEb,KAAEA,KAAE,IAAE;AAAE,yBAAID,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA2B,GAAEzB,MAAGF,MAAG,MAAI,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,yBAAIA,KAAE,GAAE,MAAI,IAAEA,MAAI,IAAGC,KAAED,MAAG,MAAIE,KAAE,GAAED,KAAEC,KAAE,GAAED,KAAEW,KAAE,CAAC,GAAEZ,KAAEA,KAAE,IAAE;AAAE,yBAAIC,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAA6C,GAAE5C,MAAGD,MAAG,MAAI,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,wBAAG,CAAC,EAAEC,EAAC,MAAI,GAAGD,KAAEE,KAAE,OAAK,GAAEA,KAAE,KAAG,GAAEA,KAAE,QAAM,CAAC,GAAE,GAAGF,EAAC,GAAEsC,GAAEvC,KAAEG,KAAE,OAAK,GAAEH,IAAEC,EAAC,GAAE,GAAGD,EAAC,GAAE,CAAC,EAAEA,IAAE,MAAM,MAAI,GAAGA,KAAEG,KAAE,OAAK,GAAEA,KAAE,KAAG,GAAEA,KAAE,QAAM,CAAC,GAAE,GAAGH,EAAC,GAAE,GAAGA,EAAC,GAAE,CAAC,EAAEA,IAAE,MAAM,KAAI;AAAC,2BAAI,GAAGY,KAAET,KAAE,OAAK,GAAES,IAAEK,KAAEd,KAAE,OAAK,CAAC,GAAEe,KAAEf,KAAE,QAAM,GAAEH,KAAE,GAAEC,KAAE,GAAE,MAAI,IAAED,OAAI;AAAC,6BAAIuE,MAAGrE,KAAEF,MAAG,MAAIiB,KAAE,GAAEoB,KAAEnC,KAAEU,KAAE,GAAE0B,KAAEpC,KAAEgB,KAAE,GAAEhB,KAAE,GAAEW,KAAE,GAAE,QAAM,IAAEX,MAAI,CAAAa,KAAE,YAAU,KAAGA,KAAER,IAAGO,KAAEZ,MAAG,KAAGmC,MAAG,CAAC,MAAI,KAAG9B,GAAEO,KAAEwB,MAAG,CAAC,IAAEvB,KAAE,WAAS,IAAE,YAAWR,GAAEO,KAAEyD,MAAG,CAAC,IAAExD,IAAEF,KAAEA,KAAEE,KAAE,GAAEb,KAAEA,KAAE,IAAE;AAAE,wBAAAD,KAAEA,KAAEY,KAAE,GAAEb,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC,0BAAG,EAAEC,OAAI,IAAE,IAAI;AAAA,oBAAK;AAAA,kBAAC;AAAC,uBAAIY,KAAEV,KAAE,OAAK,GAAEW,KAAEX,KAAE,OAAK,GAAEH,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAK,GAAE,KAAGJ,KAAED,KAAEI,KAAE,EAAE,IAAEI,GAAE,IAAEP,EAAC,GAAED,KAAEA,KAAE,IAAE;AAAE,uBAAIe,KAAEX,KAAE,KAAG,GAAEJ,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,yBAAIiB,KAAEF,KAAEJ,GAAEX,IAAE,GAAG,IAAE,GAAEkB,KAAEL,MAAGb,MAAG,MAAI,GAAEC,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAW,KAAEL,IAAGG,KAAEQ,MAAGjB,MAAG,KAAG,KAAG,KAAG,CAAC,GAAEC,KAAEe,KAAEN,GAAEV,IAAE,CAAC,IAAE,GAAES,KAAE,SAAOH,GAAEG,MAAG,CAAC,IAAE,GAAEL,GAAE,IAAEH,EAAC,IAAEQ,IAAEL,GAAEH,KAAE,IAAE,CAAC,IAAEQ,OAAI,GAAEE,KAAE,SAAOA,KAAE,GAAEP,GAAEH,KAAE,IAAE,CAAC,IAAEU,OAAI,GAAEP,GAAEH,KAAE,IAAE,CAAC,IAAEU,OAAI,IAAGP,GAAEH,KAAE,IAAE,CAAC,IAAEU,MAAG,IAAEF,OAAI,IAAGT,KAAEA,KAAE,IAAE;AAAE,oBAAAD,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,uBAAIU,KAAEN,KAAE,OAAK,GAAEH,KAAE,GAAED,KAAE,OAAI;AAAC,wBAAG,OAAK,IAAEA,KAAG;AAAC,2BAAIE,KAAE,GAAE,MAAI,IAAED,OAAI;AAAC,6BAAIW,KAAEE,MAAGb,MAAG,MAAI,GAAED,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAO,GAAEK,MAAGZ,MAAG,MAAI,CAAC,MAAIK,GAAEH,KAAEQ,KAAE,CAAC,IAAEV,IAAEE,KAAEA,KAAE,IAAE,IAAGF,KAAEA,KAAE,IAAE;AAAE,wBAAAK,GAAE,MAAIJ,KAAES,KAAE,KAAG,CAAC,IAAER,IAAED,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC;AAAA,oBAAK;AAAC,oBAAAI,GAAEL,KAAEU,KAAE,CAAC,IAAE,GAAEV,KAAEA,KAAE,IAAE;AAAA,kBAAC;AAAC,yBAAOO,GAAEE,KAAE,MAAI,CAAC,IAAE,MAAKO,KAAEb,KAAE,SAAO,GAAEG,GAAEP,MAAG,CAAC,IAAEQ,GAAEE,KAAE,MAAI,CAAC,GAAEO,KAAEP,KAAE,KAAG,GAAE;AAAA,gBAAC,GAAE,GAAE,SAASV,IAAEC,IAAEC,IAAEC,IAAE;AAAC,kBAAAH,MAAG,GAAEC,MAAG,GAAEE,MAAG;AAAE,sBAAIC,IAAEC,KAAE,GAAEE,KAAE,GAAEI,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE,GAAEE,KAAE,GAAEC,KAAE;AAAE,kBAAAX,MAAGT,MAAG,KAAG,IAAE,GAAEG,KAAEK,GAAER,MAAG,CAAC,GAAEY,KAAEd,IAAEO,KAAEN,IAAEC,KAAE,GAAEe,KAAEb,KAAEa,KAAE,QAAM,GAAEI,KAAE;AAAG,oBAAE,KAAG,SAAO,IAAEhB,KAAG;AAAC,yBAAIL,KAAEI,KAAE,QAAM,GAAEc,KAAEd,KAAE,QAAM,GAAEH,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAK,GAAEN,KAAEC,KAAE,CAAC,IAAEQ,GAAER,KAAEE,KAAE,CAAC,GAAEF,KAAEA,KAAE,IAAE;AAAE,yBAAIc,KAAEZ,KAAE,KAAG,GAAEF,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,2BAAIe,KAAEE,MAAGjB,MAAG,MAAI,GAAEkB,KAAEJ,KAAEH,GAAEX,IAAE,GAAG,IAAE,GAAEI,KAAE,GAAE,OAAK,IAAEA,MAAI,CAAAQ,KAAEG,MAAGX,MAAG,KAAG,GAAEL,KAAEY,GAAEP,IAAE,CAAC,IAAEc,KAAE,GAAEX,GAAEK,MAAG,CAAC,IAAEJ,GAAET,KAAE,IAAE,CAAC,KAAG,IAAE,MAAIS,GAAE,IAAET,EAAC,GAAEQ,GAAEK,KAAE,KAAG,CAAC,IAAEJ,GAAET,KAAE,IAAE,CAAC,KAAG,IAAE,MAAIS,GAAET,KAAE,IAAE,CAAC,MAAI,GAAEQ,GAAEK,KAAE,KAAG,CAAC,IAAEJ,GAAET,KAAE,IAAE,CAAC,KAAG,IAAE,OAAKS,GAAET,KAAE,IAAE,CAAC,MAAI,GAAEQ,GAAEK,KAAE,MAAI,CAAC,IAAEJ,GAAET,KAAE,IAAE,CAAC,KAAG,IAAES,GAAET,KAAE,IAAE,CAAC,MAAI,GAAEK,KAAEA,KAAE,IAAE;AAAE,sBAAAJ,KAAEA,KAAE,IAAE;AAAA,oBAAC;AAAC,yBAAID,KAAEI,KAAE,QAAM,GAAEH,KAAEG,KAAE,QAAM,GAAEc,KAAEd,KAAE,KAAG,GAAE,OAAK,IAAEF,MAAI,CAAAI,GAAEN,KAAEE,KAAE,CAAC,IAAEO,GAAEP,KAAES,KAAE,CAAC,GAAET,KAAEA,KAAE,IAAE;AAAE,yBAAIF,KAAEW,KAAE,KAAG,GAAET,KAAE,GAAE,MAAI,IAAEA,MAAI,CAAAgC,GAAEjC,MAAGC,MAAG,MAAI,GAAEF,KAAEY,GAAEV,IAAE,GAAG,IAAE,CAAC,GAAEA,KAAEA,KAAE,IAAE;AAAE,oBAAAS,KAAEA,KAAE,OAAK,GAAEN,KAAE,GAAEL,KAAE;AAAE,uBAAE;AAAC,iCAAO;AAAC,0BAAE,KAAG,MAAI,IAAEK,KAAG;AAAC,+BAAIQ,KAAEK,MAAGb,MAAG,MAAI,GAAEH,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAM,GAAEK,MAAGX,MAAG,MAAI,CAAC,IAAE,GAAEA,KAAEA,KAAE,IAAE;AAAE,8BAAG,GAAGD,KAAEQ,IAAGM,KAAEV,KAAEM,KAAE,KAAG,KAAG,CAAC,OAAK,IAAE,OAAKT,KAAEF,IAAEC,OAAI,IAAED,OAAI,KAAI;AAAC,mCAAKC,OAAI,IAAEC,OAAI,KAAG;AAAC,kCAAGF,OAAI,IAAEE,OAAI,KAAGD,KAAEQ,GAAE,KAAGO,KAAEd,KAAES,KAAE,EAAE,OAAK,KAAGF,GAAEO,KAAE,IAAE,CAAC,EAAE,OAAM;AAAE,8BAAAR,GAAEK,MAAGZ,MAAG,MAAI,CAAC,IAAE,GAAEC,KAAEA,KAAE,IAAE,GAAED,KAAEQ,GAAEM,KAAE,KAAG,CAAC;AAAA,4BAAC;AAAC,4BAAAV,KAAEA,KAAE,IAAE,GAAEL,KAAEC;AAAE;AAAA,0BAAQ;AAAA,wBAAC,MAAM,MAAIC,KAAEF,OAAI,KAAG,KAAG,KAAGA,QAAI;AAAC,8BAAGC,KAAE,IAAG,IAAED,QAAK,IAAEE,IAAG,OAAM;AAAE,8BAAGD,KAAED,KAAEW,KAAE,GAAEX,KAAEA,KAAE,IAAE,GAAES,GAAE,IAAER,EAAC,EAAE;AAAA,wBAAK;AAAC;AAAA,sBAAK;AAAC,sBAAAA,KAAE;AAAA,oBAAC;AAAC,wBAAG,CAACA,MAAG,CAAC,EAAEG,KAAE,QAAM,CAAC,GAAE;AAAC,2BAAImB,GAAElB,KAAED,KAAE,QAAM,GAAE,IAAGD,IAAE,IAAI,GAAEyC,GAAE5C,KAAEI,KAAE,KAAG,CAAC,GAAE,GAAGJ,IAAEK,IAAE,EAAE,GAAE,GAAGL,IAAEc,IAAEP,EAAC,GAAE,GAAGP,EAAC,GAAE,GAAGK,IAAE,IAAGL,EAAC,GAAE,GAAGA,EAAC,GAAE0B,GAAEnB,KAAEH,KAAE,QAAM,GAAEA,KAAE,QAAM,CAAC,GAAEuB,GAAE1B,KAAEG,KAAE,QAAM,GAAEA,KAAE,QAAM,CAAC,GAAE,GAAGD,KAAEC,KAAE,QAAM,CAAC,GAAEgC,GAAElC,KAAEE,KAAE,OAAK,GAAEH,IAAEE,EAAC,GAAE2B,GAAEvB,EAAC,GAAEJ,KAAEC,KAAE,QAAM,GAAEH,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,6BAAIU,KAAER,MAAGF,MAAG,MAAI,GAAEa,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAN,IAAGK,KAAEF,MAAGG,MAAG,KAAG,MAAI,CAAC,IAAEN,GAAEK,MAAG,CAAC,KAAG,IAAGC,KAAEA,KAAE,IAAE;AAAE,wBAAAb,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC,2BAAI,GAAGE,EAAC,GAAE,GAAGA,IAAEI,IAAEJ,EAAC,GAAEqC,GAAEtC,IAAEA,IAAEC,EAAC,GAAE,GAAGD,EAAC,GAAE,GAAGA,EAAC,GAAEyC,GAAEzC,EAAC,GAAEW,KAAET,KAAE,KAAG,GAAED,KAAE,GAAE,MAAI,IAAEA,OAAI;AAAC,6BAAIe,MAAGjB,KAAEE,MAAG,MAAID,KAAE,GAAEa,KAAEd,KAAEC,KAAE,GAAEc,KAAEf,KAAEY,KAAE,GAAEZ,KAAE,GAAE,QAAM,IAAEA,MAAI,CAAAkB,MAAGZ,KAAEN,MAAG,KAAGiB,KAAE,GAAEI,KAAEd,GAAED,KAAES,MAAG,CAAC,GAAEC,KAAEH,KAAEG,KAAE,KAAG,GAAEV,KAAEI,KAAE,EAAEG,KAAE,KAAG,GAAEN,GAAED,KAAEQ,MAAG,CAAC,CAAC,GAAEO,OAAIf,KAAEI,KAAE,IAAE,IAAGH,GAAEM,KAAE,MAAI,CAAC,IAAE,MAAIP,KAAEI,KAAE,IAAE,MAAKM,KAAEH,KAAE,KAAG,GAAEN,GAAEW,MAAG,CAAC,IAAEZ,IAAEN,KAAEA,KAAE,IAAE;AAAE,wBAAAE,KAAEA,KAAE,IAAE;AAAA,sBAAC;AAAC,2BAAIuC,GAAEzC,KAAEG,KAAE,QAAM,GAAEF,EAAC,GAAE0C,GAAE5C,EAAC,GAAE,GAAGA,IAAEK,IAAE,EAAE,GAAE,GAAGL,IAAEC,IAAE,IAAI,GAAE,GAAGD,EAAC,GAAE,GAAGI,KAAE,QAAM,GAAE,IAAGJ,EAAC,GAAE,GAAGA,EAAC,GAAEC,KAAE,OAAI;AAAC,4BAAG,OAAK,IAAEA,KAAG;AAAC,0BAAAoB,KAAE;AAAE,gCAAM;AAAA,wBAAC;AAAC,4BAAGrB,MAAGI,KAAE,QAAM,KAAGH,KAAE,GAAEC,MAAGE,KAAE,QAAM,KAAGH,KAAE,GAAEA,KAAEA,KAAE,IAAE,GAAEQ,GAAE,IAAEP,EAAC,KAAGO,GAAE,IAAET,EAAC,EAAE;AAAA,sBAAK;AAAA,oBAAC;AAAA,kBAAC;AAAC,yBAAOiB,KAAEb,KAAE,QAAM,GAAE,IAAEiB;AAAA,gBAAC,EAAC;AAAA,cAAC,GAAErB,EAAC;AAAA,YAAC,GAAEC,EAAC;AAAA,UAAC,GAAE,aAAY,SAASD,IAAEC,IAAE;AAAC,mBAAM,EAAC,MAAK,SAASC,IAAE;AAAC,kBAAIC,KAAE,IAAI,EAAE,OAAOH,EAAC;AAAE,cAAAE,GAAE,EAAC,UAAS,IAAI,EAAE,SAASC,IAAEF,EAAC,EAAC,CAAC;AAAA,YAAC,EAAC;AAAA,UAAC,GAAE,cAAa,MAAK;AAAE,cAAE,CAAC,GAAE,YAAU,EAAE,CAAC,KAAG,EAAE,iCAAiC;AAAE,cAAI,GAAE,GAAE,GAAE,GAAE,IAAE;AAAG,cAAI,GAAE,GAAE,IAAE,EAAE,kBAAgB;AAAS,cAAE,0DAAwD,IAAE,0BAAyB,KAAG,WAAS,EAAE,CAAC,GAAE,IAAE,EAAE,aAAW,EAAE,aAAW,IAAI,EAAE,OAAO,EAAC,SAAQ,IAAE,OAAM,SAAQ,IAAE,MAAK,CAAC,GAAE,IAAE,EAAE,QAAO,EAAE,QAAM,IAAE,IAAI,UAAU,CAAC,GAAE,EAAE,SAAO,IAAI,WAAW,CAAC,GAAE,EAAE,SAAO,IAAE,IAAI,WAAW,CAAC,GAAE,EAAE,SAAO,IAAE,IAAI,WAAW,CAAC,GAAE,EAAE,UAAQ,IAAI,YAAY,CAAC,GAAE,EAAE,UAAQ,IAAI,YAAY,CAAC,GAAE,EAAE,UAAQ,IAAI,aAAa,CAAC,GAAE,EAAE,UAAQ,IAAE,IAAI,aAAa,CAAC,GAAE,IAAE,EAAE,OAAO;AAAW,cAAI,IAAE,CAAC,GAAE,IAAE,CAAC,GAAE,IAAE,CAAC;AAAE,cAAI,IAAE,GAAE,IAAE,MAAK,IAAE;AAAK,mBAAS,EAAED,IAAE;AAAC,kBAAM,EAAE,WAAS,EAAE,QAAQA,EAAC,GAAE,EAAEA,KAAE,aAAWA,KAAE,GAAG,GAAE,IAAE,MAAG,GAAEA,MAAG,4CAA2C,IAAI,EAAE,aAAaA,EAAC;AAAA,UAAC;AAAC,cAAI,GAAE,GAAE,IAAE;AAAwC,mBAAS,EAAEA,IAAE;AAAC,mBAAOA,GAAE,WAAW,CAAC;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAOA,GAAE,WAAW,SAAS;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAE;AAAC,mBAAO,QAAQ,QAAQ,EAAE,MAAM,WAAU;AAAC,sBAAO,SAASA,IAAE;AAAC,oBAAGA,MAAG,KAAG,EAAE,QAAO,IAAI,WAAW,CAAC;AAAE,oBAAIC,KAAE,EAAED,EAAC;AAAE,oBAAGC,GAAE,QAAOA;AAAE,oBAAG,EAAE,QAAO,EAAED,EAAC;AAAE,sBAAK;AAAA,cAAiD,GAAEA,EAAC;AAAA,YAAC,EAAE;AAAA,UAAC;AAAC,mBAAS,EAAEA,IAAEC,IAAEC,IAAEC,IAAE;AAAC,oBAAO,SAASH,IAAEC,IAAEC,IAAE;AAAC,qBAAO,EAAEF,EAAC,EAAE,MAAM,SAASA,IAAE;AAAC,uBAAO,EAAE,YAAYA,IAAEC,EAAC;AAAA,cAAC,EAAE,EAAE,MAAM,SAASD,IAAE;AAAC,uBAAOA;AAAA,cAAC,EAAE,EAAE,KAAKE,KAAG,SAASF,IAAE;AAAC,kBAAE,4CAA0CA,EAAC,GAAE,EAAEA,EAAC;AAAA,cAAC,EAAE;AAAA,YAAC,GAAEC,IAAEC,IAAEC,EAAC;AAAA,UAAC;AAAC,YAAE,IAAE,0BAA0B,MAAI,IAAE,GAAE,IAAE,EAAE,aAAW,EAAE,WAAW,GAAE,CAAC,IAAE,IAAE;AAAG,cAAI,IAAE,EAAC,MAAK,WAAU;AAAC,mBAAO,EAAE,eAAe;AAAA,UAAC,GAAE,MAAK,WAAU;AAAC,gBAAG,WAAS,EAAE,eAAe,KAAG;AAAC,kBAAI,IAAE,cAAY,eAAa,OAAO,SAAO,cAAY,EAAE,MAAM,KAAG,SAAO,MAAK,IAAE,WAAS,EAAE,SAAO,EAAE,SAAO,EAAE,UAAS,IAAE,WAAU;AAAC,oBAAIH,KAAE,IAAI,YAAY,CAAC;AAAE,uBAAO,EAAE,gBAAgBA,EAAC,GAAEA,GAAE,CAAC,MAAI;AAAA,cAAC;AAAE,gBAAE,GAAE,EAAE,iBAAe;AAAA,YAAC,SAAO,GAAE;AAAC,kBAAG;AAAC,oBAAI,IAAE,KAAK,SAAS,EAAE,QAAQ,GAAE,IAAE,WAAU;AAAC,sBAAIA,KAAE,EAAE,YAAY,CAAC;AAAE,0BAAOA,GAAE,CAAC,KAAG,KAAGA,GAAE,CAAC,KAAG,KAAGA,GAAE,CAAC,KAAG,IAAEA,GAAE,CAAC,OAAK;AAAA,gBAAC;AAAE,kBAAE,GAAE,EAAE,iBAAe;AAAA,cAAC,SAAOA,IAAE;AAAC,sBAAK;AAAA,cAAyC;AAAA,YAAC;AAAA,UAAC,EAAC;AAAE,mBAAS,EAAEA,IAAE;AAAC,iBAAK,OAAK,cAAa,KAAK,UAAQ,gCAAgC,OAAOA,IAAE,GAAG,GAAE,KAAK,SAAOA;AAAA,UAAC;AAAC,cAAI,IAAE,SAASA,IAAE;AAAC,mBAAKA,GAAE,SAAO,IAAG,CAAAA,GAAE,MAAM,EAAE,CAAC;AAAA,UAAC;AAAE,yBAAa,OAAO,eAAa,IAAI,YAAY,MAAM;AAAE,cAAI,GAAE,IAAE,CAAC,GAAE,IAAE,SAASA,IAAEC,IAAEC,IAAE;AAAC,gBAAIC,MAAE,SAASH,IAAEC,IAAE;AAAC,kBAAIC;AAAE,mBAAI,EAAE,SAAO,GAAED,OAAI,GAAEC,KAAE,EAAEF,IAAG,IAAG,CAAAC,MAAG,OAAKC,KAAED,IAAE,EAAE,KAAK,OAAKC,KAAE,EAAED,EAAC,IAAE,EAAEA,QAAK,CAAC,CAAC,GAAE,EAAEA;AAAE,qBAAO;AAAA,YAAC,GAAEA,IAAEC,EAAC;AAAE,mBAAO,EAAEF,EAAC,EAAE,MAAM,MAAKG,EAAC;AAAA,UAAC,GAAE,IAAE,SAASH,IAAE;AAAC,YAAAA,IAAE,MAAI,EAAE,UAAQ,EAAE,OAAOA,EAAC,GAAE,IAAE,OAAI,EAAEA,IAAE,IAAI,EAAEA,EAAC,CAAC;AAAA,UAAC,GAAE,IAAE,EAAC,GAAE,SAASA,IAAEC,IAAEC,IAAE;AAAC,mBAAO,EAAEF,IAAEC,IAAEC,EAAC;AAAA,UAAC,GAAE,GAAE,SAASF,IAAE;AAAC,cAAE;AAAO,cAAE,KAAK;AAAA,UAAC,GAAE,GAAE,SAASA,IAAEC,IAAE;AAAC,YAAAD,IAAE,EAAEA,EAAC;AAAA,UAAC,GAAE,GAAE,EAAC;AAAE,WAAC,WAAU;AAAC,gBAAIA,KAAE,EAAC,GAAE,EAAC;AAAE,qBAASC,GAAED,IAAEC,IAAE;AAAC,kBAAIC,IAAEE,KAAEJ,GAAE;AAAQ,qBAAO,EAAE,MAAII,IAAE,EAAE,IAAI,GAAEF,KAAE,EAAE,IAAI,GAAE,EAAE,QAAQA,EAAC,IAAE,SAASF,IAAE;AAAC,oBAAG,KAAI,EAAE,0BAAwB,EAAE,uBAAuB,CAAC,GAAE,KAAG,MAAI,SAAO,MAAI,cAAc,CAAC,GAAE,IAAE,OAAM,IAAG;AAAC,sBAAIC,KAAE;AAAE,sBAAE,MAAKA,GAAE;AAAA,gBAAC;AAAA,cAAC,GAAE,GAAEG;AAAA,YAAC;AAAC,gBAAG,KAAI,EAAE,0BAAwB,EAAE,uBAAuB,CAAC,GAAE,EAAE,gBAAgB,KAAG;AAAC,qBAAO,EAAE,gBAAgBJ,IAAEC,EAAC;AAAA,YAAC,SAAOD,IAAE;AAAC,qBAAO,EAAE,wDAAsDA,EAAC,GAAE;AAAA,YAAE;AAAC,cAAE,GAAE,GAAEA,KAAG,SAASA,IAAE;AAAC,cAAAC,GAAED,GAAE,QAAQ;AAAA,YAAC,EAAE;AAAA,UAAC,GAAG,GAAE,EAAE,UAAQ,WAAU;AAAC,oBAAO,EAAE,UAAQ,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,QAAM,WAAU;AAAC,oBAAO,EAAE,QAAM,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,oBAAkB,WAAU;AAAC,oBAAO,EAAE,oBAAkB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,gCAA8B,WAAU;AAAC,oBAAO,EAAE,gCAA8B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,gCAA8B,WAAU;AAAC,oBAAO,EAAE,gCAA8B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,+BAA6B,WAAU;AAAC,oBAAO,EAAE,+BAA6B,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,uBAAqB,WAAU;AAAC,oBAAO,EAAE,uBAAqB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,oBAAkB,WAAU;AAAC,oBAAO,EAAE,oBAAkB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC,GAAE,EAAE,sBAAoB,WAAU;AAAC,oBAAO,EAAE,sBAAoB,EAAE,IAAI,GAAG,MAAM,MAAK,SAAS;AAAA,UAAC;AAAE,mBAAS,EAAEA,IAAE;AAAC,gBAAG,EAAEA,EAAC,EAAE,SAAO,SAASA,IAAE;AAAC,kBAAG,WAAS,KAAG,GAAE;AAAC,oBAAIC,KAAE,OAAO,KAAKD,IAAE,QAAQ;AAAE,uBAAO,IAAI,WAAWC,GAAE,QAAOA,GAAE,YAAWA,GAAE,UAAU;AAAA,cAAC;AAAC,kBAAG;AAAC,yBAAQC,KAAE,KAAKF,EAAC,GAAEG,KAAE,IAAI,WAAWD,GAAE,MAAM,GAAEE,KAAE,GAAEA,KAAEF,GAAE,QAAO,EAAEE,GAAE,CAAAD,GAAEC,EAAC,IAAEF,GAAE,WAAWE,EAAC;AAAE,uBAAOD;AAAA,cAAC,SAAOH,IAAE;AAAC,sBAAM,IAAI,MAAM,2CAA2C;AAAA,cAAC;AAAA,YAAC,GAAEA,GAAE,MAAM,EAAE,MAAM,CAAC;AAAA,UAAC;AAAC,mBAAS,IAAG;AAAC,qBAASA,KAAG;AAAC,oBAAI,IAAE,MAAG,EAAE,YAAU,MAAG,MAAI,MAAG,EAAE,CAAC,GAAE,EAAE,wBAAsB,EAAE,qBAAqB,IAAE,WAAU;AAAC,oBAAG,EAAE,QAAQ,MAAI,cAAY,OAAO,EAAE,YAAU,EAAE,UAAQ,CAAC,EAAE,OAAO,IAAG,EAAE,QAAQ,SAAQ,CAAAA,KAAE,EAAE,QAAQ,MAAM,GAAE,EAAE,QAAQA,EAAC;AAAE,oBAAIA;AAAE,kBAAE,CAAC;AAAA,cAAC,GAAE;AAAA,YAAG;AAAC,gBAAE,MAAI,EAAC,WAAU;AAAC,kBAAG,EAAE,OAAO,MAAI,cAAY,OAAO,EAAE,WAAS,EAAE,SAAO,CAAC,EAAE,MAAM,IAAG,EAAE,OAAO,SAAQ,CAAAA,KAAE,EAAE,OAAO,MAAM,GAAE,EAAE,QAAQA,EAAC;AAAE,kBAAIA;AAAE,gBAAE,CAAC;AAAA,YAAC,GAAE,GAAE,IAAE,MAAI,EAAE,aAAW,EAAE,UAAU,YAAY,GAAE,YAAY,WAAU;AAAC,0BAAY,WAAU;AAAC,kBAAE,UAAU,EAAE;AAAA,cAAC,IAAG,CAAC,GAAEA,GAAE;AAAA,YAAC,IAAG,CAAC,KAAGA,GAAE;AAAA,UAAG;AAAC,cAAG,EAAE,qBAAmB,SAASA,IAAEC,IAAE;AAAC,cAAE,IAAID,IAAEC,EAAC;AAAA,UAAC,GAAE,IAAE,SAASD,KAAG;AAAC,iBAAG,EAAE,GAAE,MAAI,IAAEA;AAAA,UAAE,GAAE,EAAE,QAAQ,MAAI,cAAY,OAAO,EAAE,YAAU,EAAE,UAAQ,CAAC,EAAE,OAAO,IAAG,EAAE,QAAQ,SAAO,IAAG,GAAE,QAAQ,IAAI,EAAE;AAAE,iBAAO,EAAE,GAAE,IAAI,SAAS,SAASA,IAAEC,IAAE;AAAC,cAAE,UAAQA,IAAE,EAAE,uBAAqB,WAAU;AAAC,cAAAD,GAAE,CAAC;AAAA,YAAC;AAAA,UAAC,EAAE;AAAA,QAAC,EAAE,EAAE,MAAM,SAASA,IAAE;AAAC,iBAAO,KAAKA,EAAC,EAAE,SAAS,SAASC,IAAE;AAAC,cAAEA,EAAC,IAAED,GAAEC,EAAC;AAAA,UAAC,EAAE;AAAA,QAAC,EAAE;AAAE,YAAI,IAAE,EAAE,MAAM,MAAM,WAAU;AAAC,YAAE,kBAAkB,GAAE,IAAE,EAAE,8BAA8B,GAAE,IAAE,EAAE,8BAA8B,GAAE,IAAE,EAAE,6BAA6B;AAAA,QAAC,EAAE,GAAE,IAAE,EAAC,gBAAe,EAAE,MAAM,WAAU;AAAC,iBAAO;AAAA,QAAC,EAAE,GAAE,iBAAgB,EAAE,MAAM,WAAU;AAAC,iBAAO;AAAA,QAAC,EAAE,GAAE,OAAM,EAAE,MAAM,WAAU;AAAC,iBAAO;AAAA,QAAC,EAAE,GAAE,SAAQ,WAAU;AAAC,iBAAO,EAAE,MAAM,WAAU;AAAC,gBAAIC,KAAE,EAAE,QAAQ,CAAC,GAAEK,KAAE,EAAE,QAAQ,CAAC;AAAE,gBAAG;AAAC,qBAAO,EAAE,EAAE,qBAAqBL,IAAEK,EAAC,GAAE,EAAC,WAAU,EAAEL,IAAE,CAAC,GAAE,YAAW,EAAEK,IAAE,CAAC,EAAC,CAAC;AAAA,YAAC,UAAC;AAAQ,gBAAEL,EAAC,GAAE,EAAEK,EAAC;AAAA,YAAC;AAAA,UAAC,EAAE;AAAA,QAAC,GAAE,MAAK,SAASP,IAAEC,IAAE;AAAC,iBAAO,EAAE,aAAaD,IAAEC,EAAC,EAAE,MAAM,SAASA,IAAE;AAAC,gBAAIE,KAAE,IAAI,WAAW,IAAEH,GAAE,MAAM;AAAE,mBAAOG,GAAE,IAAIF,EAAC,GAAEE,GAAE,IAAIH,IAAE,CAAC,GAAEG;AAAA,UAAC,EAAE;AAAA,QAAC,GAAE,cAAa,SAASH,IAAEQ,IAAE;AAAC,iBAAO,EAAE,MAAM,WAAU;AAAC,gBAAID,KAAE,EAAE,QAAQ,CAAC,GAAEE,KAAE,EAAE,QAAQT,GAAE,MAAM,GAAEU,KAAE,EAAE,QAAQ,CAAC;AAAE,cAAE,mBAAmB,IAAI,WAAW,CAAC,GAAEH,EAAC,GAAE,EAAE,mBAAmBP,IAAES,EAAC,GAAE,EAAE,mBAAmBD,IAAEE,EAAC;AAAE,gBAAG;AAAC,qBAAO,EAAE,EAAE,kBAAkBH,IAAEE,IAAET,GAAE,QAAOU,EAAC,GAAE,EAAEH,IAAE,CAAC,CAAC;AAAA,YAAC,UAAC;AAAQ,gBAAEA,EAAC,GAAE,EAAEE,EAAC,GAAE,EAAEC,EAAC;AAAA,YAAC;AAAA,UAAC,EAAE;AAAA,QAAC,GAAE,MAAK,SAASV,IAAEC,IAAE;AAAC,iBAAO,EAAE,MAAM,WAAU;AAAC,gBAAIE,KAAE,IAAI,WAAWH,GAAE,QAAOA,GAAE,YAAW,CAAC,GAAEI,KAAE,IAAI,WAAWJ,GAAE,QAAOA,GAAE,aAAW,GAAEA,GAAE,SAAO,CAAC;AAAE,mBAAO,EAAE,eAAeG,IAAEC,IAAEH,EAAC,EAAE,MAAM,SAASD,IAAE;AAAC,kBAAGA,GAAE,QAAOI;AAAE,oBAAM,IAAI,MAAM,0CAA0C;AAAA,YAAC,EAAE;AAAA,UAAC,EAAE;AAAA,QAAC,GAAE,gBAAe,SAASH,IAAEG,IAAEC,IAAE;AAAC,iBAAO,EAAE,MAAM,WAAU;AAAC,gBAAIE,KAAE,EAAE,QAAQ,CAAC,GAAEC,KAAE,EAAE,QAAQJ,GAAE,MAAM,GAAEK,KAAE,EAAE,QAAQ,CAAC;AAAE,cAAE,mBAAmBR,IAAEM,EAAC,GAAE,EAAE,mBAAmBH,IAAEI,EAAC,GAAE,EAAE,mBAAmBH,IAAEI,EAAC;AAAE,gBAAG;AAAC,qBAAO,MAAI,EAAE,oBAAoBD,IAAEJ,GAAE,QAAOG,IAAEE,EAAC;AAAA,YAAC,UAAC;AAAQ,gBAAEF,EAAC,GAAE,EAAEC,EAAC,GAAE,EAAEC,EAAC;AAAA,YAAC;AAAA,UAAC,EAAE;AAAA,QAAC,EAAC;AAAE,eAAO;AAAA,MAAC,GAAE;AAAE,qBAAa,OAAO,UAAQ,OAAO,WAAS,UAAU,YAAU,WAAU,OAAO,UAAQ,aAAW,KAAK,YAAU;AAAA;AAAA;;;ACA94gG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA;;;ACAA;;;ACAA;;;ACAA;AAGO,MAAM,yBAAN,MAA6B;AAAA,IAA7B;AACH,oCAAS,oBAAI,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA,IAIjB,SAAS,OAAO;AACZ,UAAI,KAAK,OAAO,IAAI,MAAM,OAAO,GAAG;AAChC,cAAM,IAAI,MAAM,uCAAuC,MAAM,OAAO,EAAE;AAAA,MAC1E;AACA,WAAK,OAAO,IAAI,MAAM,SAAS,KAAK;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,SAAS,SAAS;AACd,YAAM,QAAQ,KAAK,OAAO,IAAI,OAAO;AACrC,UAAI,CAAC,OAAO;AACR,cAAM,IAAI,MAAM,4BAA4B,OAAO,gBAAgB,KAAK,WAAW,EAAE,KAAK,IAAI,CAAC,EAAE;AAAA,MACrG;AACA,aAAO;AAAA,IACX;AAAA;AAAA;AAAA;AAAA,IAIA,SAAS,SAAS;AACd,aAAO,KAAK,OAAO,IAAI,OAAO;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAIA,aAAa;AACT,aAAO,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA,IAIA,eAAe;AACX,aAAO,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA,IAIA,WAAW,SAAS;AAChB,aAAO,KAAK,OAAO,OAAO,OAAO;AAAA,IACrC;AAAA;AAAA;AAAA;AAAA,IAIA,QAAQ;AACJ,WAAK,OAAO,MAAM;AAAA,IACtB;AAAA,EACJ;AAEO,MAAM,iBAAiB,IAAI,uBAAuB;;;ACzDzD;AAmCO,WAAS,WAAW,OAAO;AAC9B,WAAO,MAAM,KAAK,KAAK,EAClB,IAAI,CAAAgE,OAAKA,GAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EACxC,KAAK,EAAE;AAAA,EAChB;AAIO,WAAS,WAAW,KAAK;AAC5B,QAAI,IAAI,SAAS,MAAM,GAAG;AACtB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACtD;AACA,UAAM,QAAQ,IAAI,WAAW,IAAI,SAAS,CAAC;AAC3C,aAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK,GAAG;AACpC,YAAMA,KAAI,CAAC,IAAI,SAAS,IAAI,MAAMA,IAAGA,KAAI,CAAC,GAAG,EAAE;AAAA,IACnD;AACA,WAAO;AAAA,EACX;AA4CA,iBAAsB,UAAU,OAAO,WAAW;AAC9C,QAAI,cAAc,UAAU;AACxB,YAAM,SAAS,MAAM;AACrB,aAAO,IAAI,WAAW,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,CAAC;AAAA,IAC5E,WACS,cAAc,UAAU;AAC7B,YAAM,SAAS,MAAM;AACrB,aAAO,IAAI,WAAW,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,CAAC;AAAA,IAC5E,WACS,cAAc,YAAY;AAC/B,YAAM,SAAS,MAAM;AACrB,aAAO,IAAI,WAAW,OAAO,WAAW,UAAU,EAAE,OAAO,KAAK,EAAE,OAAO,CAAC;AAAA,IAC9E;AACA,UAAM,IAAI,MAAM,+BAA+B,SAAS,EAAE;AAAA,EAC9D;;;AC9GA;;;ACAA;AAYO,MAAM,qBAAN,MAAyB;AAAA,IAAzB;AACH,kCAAO,oBAAI,IAAI;AAAA;AAAA,IACf,MAAM,MAAM,OAAO,SAAS,MAAM;AAC9B,WAAK,KAAK,IAAI,OAAO,EAAE,SAAS,KAAK,CAAC;AAAA,IAC1C;AAAA,IACA,MAAM,KAAK,OAAO;AACd,aAAO,KAAK,KAAK,IAAI,KAAK,KAAK;AAAA,IACnC;AAAA,IACA,MAAM,KAAK,QAAQ;AACf,YAAM,UAAU,MAAM,KAAK,KAAK,KAAK,OAAO,CAAC,EAAE,IAAI,CAAAC,OAAKA,GAAE,IAAI;AAC9D,UAAI,CAAC,QAAQ;AACT,eAAO;AAAA,MACX;AACA,aAAO,QAAQ,OAAO,UAAQ;AAC1B,eAAO,OAAO,QAAQ,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,KAAK,MAAM;AAClD,cAAI,QAAQ,WAAW,MAAM,QAAQ,KAAK,GAAG;AAEzC,mBAAO,MAAM,KAAK,CAAAC,OAAK,KAAK,MAAM,SAASA,EAAC,CAAC;AAAA,UACjD;AACA,iBAAO,KAAK,GAAG,MAAM;AAAA,QACzB,CAAC;AAAA,MACL,CAAC;AAAA,IACL;AAAA,IACA,MAAM,OAAO,OAAO;AAChB,WAAK,KAAK,OAAO,KAAK;AAAA,IAC1B;AAAA,IACA,MAAM,WAAW,OAAO,SAAS;AAC7B,YAAM,WAAW,KAAK,KAAK,IAAI,KAAK;AACpC,UAAI,CAAC,UAAU;AACX,cAAM,IAAI,MAAM,kBAAkB,KAAK,EAAE;AAAA,MAC7C;AACA,WAAK,KAAK,IAAI,OAAO;AAAA,QACjB,SAAS,SAAS;AAAA,QAClB,MAAM,EAAE,GAAG,SAAS,MAAM,GAAG,QAAQ;AAAA,MACzC,CAAC;AAAA,IACL;AAAA;AAAA;AAAA;AAAA,IAIA,QAAQ;AACJ,WAAK,KAAK,MAAM;AAAA,IACpB;AAAA,EACJ;AAWO,MAAM,cAAN,MAAkB;AAAA,IAErB,YAAY,UAAU,IAAI,mBAAmB,GAAG;AADhD;AAEI,WAAK,UAAU;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,YAAY,OAAO,SAAS,SAAS,UAAU,CAAC,GAAG;AACrD,YAAM,OAAO;AAAA,QACT;AAAA,QACA;AAAA,QACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,QAClC,WAAW,QAAQ;AAAA,QACnB,OAAO,QAAQ,SAAS,CAAC,SAAS;AAAA,QAClC,sBAAsB,QAAQ,wBAAwB;AAAA,QACtD,QAAQ,QAAQ,UAAU;AAAA,MAC9B;AACA,YAAM,KAAK,QAAQ,MAAM,OAAO,SAAS,IAAI;AAC7C,aAAO;AAAA,IACX;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,OAAO,OAAO;AAChB,aAAO,MAAM,KAAK,QAAQ,KAAK,KAAK;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,aAAa,OAAO;AACtB,YAAM,SAAS,MAAM,KAAK,QAAQ,KAAK,KAAK;AAC5C,UAAI,CAAC;AACD,eAAO;AACX,aAAO;AAAA,QACH,WAAW,OAAO,QAAQ;AAAA,QAC1B,MAAM,OAAO;AAAA,MACjB;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,SAAS,QAAQ;AACnB,aAAO,MAAM,KAAK,QAAQ,KAAK,MAAM;AAAA,IACzC;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,eAAe,QAAQ;AACzB,YAAM,UAAU,MAAM,KAAK,QAAQ,KAAK,MAAM;AAC9C,YAAM,MAAM,oBAAI,KAAK;AACrB,aAAO,QAAQ,OAAO,UAAQ;AAE1B,YAAI,KAAK,UAAU,KAAK,WAAW,UAAU;AACzC,iBAAO;AAAA,QACX;AAEA,YAAI,KAAK,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK;AAClD,iBAAO;AAAA,QACX;AACA,eAAO;AAAA,MACX,CAAC;AAAA,IACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,MAAM,UAAU,UAAU,UAAU,YAAY;AAE5C,YAAM,SAAS,MAAM,KAAK,QAAQ,KAAK,QAAQ;AAC/C,UAAI,CAAC,QAAQ;AACT,cAAM,IAAI,MAAM,iCAAiC,QAAQ,EAAE;AAAA,MAC/D;AAEA,YAAM,KAAK,QAAQ,WAAW,UAAU;AAAA,QACpC,QAAQ;AAAA,MACZ,CAAC;AAED,YAAM,KAAK,YAAY,UAAU,YAAY,OAAO,KAAK,SAAS;AAAA,QAC9D,OAAO,OAAO,KAAK;AAAA,QACnB,sBAAsB,OAAO,KAAK;AAAA,QAClC,WAAW,OAAO,KAAK;AAAA,QACvB,QAAQ;AAAA,MACZ,CAAC;AAED,YAAM,KAAK,QAAQ,WAAW,UAAU;AAAA,QACpC,aAAa;AAAA,MACjB,CAAC;AAED,YAAM,SAAS,MAAM,KAAK,QAAQ,KAAK,QAAQ;AAC/C,aAAO,OAAO;AAAA,IAClB;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,UAAU,OAAO,QAAQ;AAC3B,YAAM,KAAK,QAAQ,WAAW,OAAO;AAAA,QACjC,QAAQ;AAAA,QACR,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MACtC,CAAC;AAAA,IACL;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,UAAU,OAAO;AACnB,YAAM,KAAK,QAAQ,OAAO,KAAK;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,kBAAkB;AACpB,YAAM,UAAU,MAAM,KAAK,QAAQ,KAAK;AACxC,YAAM,MAAM,oBAAI,KAAK;AACrB,UAAI,QAAQ;AACZ,iBAAW,QAAQ,SAAS;AACxB,YAAI,KAAK,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,WAAW,UAAU;AAC9E,gBAAM,KAAK,QAAQ,WAAW,KAAK,OAAO;AAAA,YACtC,QAAQ;AAAA,UACZ,CAAC;AACD;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,MAAM,aAAa,gBAAgB,IAAI;AACnC,YAAM,UAAU,MAAM,KAAK,QAAQ,KAAK;AACxC,YAAM,aAAa,oBAAI,KAAK;AAC5B,iBAAW,QAAQ,WAAW,QAAQ,IAAI,aAAa;AACvD,UAAI,QAAQ;AACZ,iBAAW,QAAQ,SAAS;AACxB,cAAM,cAAe,KAAK,WAAW,aAAa,KAAK,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI,cAC1F,KAAK,WAAW,aAAa,KAAK,aAAa,IAAI,KAAK,KAAK,SAAS,IAAI;AAC/E,YAAI,aAAa;AACb,gBAAM,KAAK,QAAQ,OAAO,KAAK,KAAK;AACpC;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAAA,EACJ;;;ACnNA;;;ACAA;;;ACAA;;;ACAA;AAeA,MAAM,kBAAkB;AAAA,IACpB,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,IACH,IAAI;AAAA,IACJ,IAAI;AAAA,EACR;AACA,MAAM,EAAE,GAAGC,IAAG,GAAGC,IAAG,IAAI,IAAI,GAAG,GAAG,IAAI;AACtC,MAAMC,KAAI;AACV,MAAMC,MAAK;AAKX,MAAM,MAAM,CAACC,KAAI,OAAO;AACpB,UAAM,IAAI,MAAMA,EAAC;AAAA,EACrB;AACA,MAAM,QAAQ,CAACC,OAAM,OAAOA,OAAM;AAClC,MAAM,QAAQ,CAACC,OAAM,OAAOA,OAAM;AAClC,MAAMC,WAAU,CAACC,OAAMA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;AAEnG,MAAMC,UAAS,CAACD,IAAGE,OAAM,CAACH,SAAQC,EAAC,KAAM,OAAOE,OAAM,YAAYA,KAAI,KAAKF,GAAE,WAAWE,KAClF,IAAI,qBAAqB,IACzBF;AAEN,MAAM,MAAM,CAAC,QAAQ,IAAI,WAAW,GAAG;AACvC,MAAM,OAAO,CAAC,QAAQ,WAAW,KAAK,GAAG;AACzC,MAAM,OAAO,CAACH,IAAG,QAAQA,GAAE,SAAS,EAAE,EAAE,SAAS,KAAK,GAAG;AACzD,MAAMM,cAAa,CAACC,OAAM,MAAM,KAAKH,QAAOG,EAAC,CAAC,EACzC,IAAI,CAACC,OAAM,KAAKA,IAAG,CAAC,CAAC,EACrB,KAAK,EAAE;AACZ,MAAMC,KAAI,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI;AACxD,MAAM,MAAM,CAAC,OAAO;AAChB,QAAI,MAAMA,GAAE,MAAM,MAAMA,GAAE;AACtB,aAAO,KAAKA,GAAE;AAClB,QAAI,MAAMA,GAAE,KAAK,MAAMA,GAAE;AACrB,aAAO,MAAMA,GAAE,IAAI;AACvB,QAAI,MAAMA,GAAE,KAAK,MAAMA,GAAE;AACrB,aAAO,MAAMA,GAAE,IAAI;AACvB;AAAA,EACJ;AACA,MAAMC,cAAa,CAAC,QAAQ;AACxB,UAAMF,KAAI;AACV,QAAI,CAAC,MAAM,GAAG;AACV,aAAO,IAAIA,EAAC;AAChB,UAAM,KAAK,IAAI;AACf,UAAM,KAAK,KAAK;AAChB,QAAI,KAAK;AACL,aAAO,IAAIA,EAAC;AAChB,UAAM,QAAQ,IAAI,EAAE;AACpB,aAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAE7C,YAAM,KAAK,IAAI,IAAI,WAAW,EAAE,CAAC;AACjC,YAAM,KAAK,IAAI,IAAI,WAAW,KAAK,CAAC,CAAC;AACrC,UAAI,OAAO,UAAa,OAAO;AAC3B,eAAO,IAAIA,EAAC;AAChB,YAAM,EAAE,IAAI,KAAK,KAAK;AAAA,IAC1B;AACA,WAAO;AAAA,EACX;AAEA,MAAM,OAAO,CAACL,IAAG,QAAQC,QAAO,MAAMD,EAAC,IAAIO,YAAWP,EAAC,IAAI,KAAKC,QAAOD,EAAC,CAAC,GAAG,GAAG;AAC/E,MAAM,KAAK,MAAM,YAAY;AAC7B,MAAM,SAAS,MAAM,GAAG,GAAG,UAAU,IAAI,+BAA+B;AAExE,MAAM,cAAc,IAAI,SAAS;AAC7B,UAAMQ,KAAI,IAAI,KAAK,OAAO,CAAC,KAAKR,OAAM,MAAMC,QAAOD,EAAC,EAAE,QAAQ,CAAC,CAAC;AAChE,QAAI,MAAM;AACV,SAAK,QAAQ,CAAAA,OAAK;AAAE,MAAAQ,GAAE,IAAIR,IAAG,GAAG;AAAG,aAAOA,GAAE;AAAA,IAAQ,CAAC;AACrD,WAAOQ;AAAA,EACX;AAEA,MAAM,cAAc,CAAC,MAAMd,OAAM;AAC7B,UAAMe,KAAI,GAAG;AACb,WAAOA,GAAE,gBAAgB,IAAI,GAAG,CAAC;AAAA,EACrC;AACA,MAAM,MAAM;AACZ,MAAM,SAAS,CAACZ,IAAG,KAAK,KAAK,MAAM,+BAA+B,MAAMA,EAAC,KAAK,OAAOA,MAAKA,KAAI,MAAMA,KAAI,IAAI,GAAG;AAE/G,MAAMa,KAAI,CAACV,IAAGI,KAAIZ,OAAM;AACpB,UAAMgB,KAAIR,KAAII;AACd,WAAOI,MAAK,KAAKA,KAAIJ,KAAII;AAAA,EAC7B;AACA,MAAM,OAAO,CAACR,OAAMU,GAAEV,IAAGP,EAAC;AAG1B,MAAM,SAAS,CAAC,KAAK,OAAO;AACxB,QAAI,QAAQ,MAAM,MAAM;AACpB,UAAI,kBAAkB,MAAM,UAAU,EAAE;AAC5C,QAAIO,KAAIU,GAAE,KAAK,EAAE,GAAGN,KAAI,IAAIO,KAAI,IAAIC,KAAI,IAAIC,KAAI,IAAIC,KAAI;AACxD,WAAOd,OAAM,IAAI;AACb,YAAMe,KAAIX,KAAIJ,IAAGQ,KAAIJ,KAAIJ;AACzB,YAAMJ,KAAIe,KAAIE,KAAIE,IAAGlB,KAAIe,KAAIE,KAAIC;AACjC,MAAAX,KAAIJ,IAAGA,KAAIQ,IAAGG,KAAIE,IAAGD,KAAIE,IAAGD,KAAIjB,IAAGkB,KAAIjB;AAAA,IAC3C;AACA,WAAOO,OAAM,KAAKM,GAAEC,IAAG,EAAE,IAAI,IAAI,YAAY;AAAA,EACjD;AACA,MAAM,WAAW,CAAC,SAAS;AAEvB,UAAM,KAAK,IAAI,IAAI;AACnB,QAAI,OAAO,OAAO;AACd,UAAI,YAAY,OAAO,UAAU;AACrC,WAAO;AAAA,EACX;AACA,MAAM,SAAS,CAACK,OAAOA,cAAa,QAAQA,KAAI,IAAI,gBAAgB;AAIpE,MAAM,UAAU,CAACL,OAAMD,GAAEA,GAAEC,KAAIA,EAAC,IAAIA,KAAI,EAAE;AAE1C,MAAM,UAAU,CAACd,OAAM,OAAOA,IAAG,IAAIL,EAAC;AAEtC,MAAM,SAAS,CAACK,OAAM,OAAOA,IAAG,IAAIL,EAAC;AAErC,MAAM,SAAS,CAACK,OAAM,OAAOA,IAAG,IAAIJ,EAAC;AACrC,MAAM,SAAS,CAACmB,QAAOA,KAAI,QAAQ;AAEnC,MAAM,OAAO,CAACf,OAAM,WAAW,GAAGA,EAAC;AACnC,MAAM,YAAY,CAACe,OAAM,KAAK,OAAOA,EAAC,IAAI,IAAO,CAAI;AAErD,MAAM,SAAS,CAACD,OAAM;AAElB,UAAMF,KAAI,QAAQ,OAAOE,EAAC,CAAC;AAK3B,QAAIH,KAAI;AACR,aAAS,MAAMC,IAAGJ,MAAKb,KAAI,MAAM,IAAIa,KAAI,IAAIA,OAAM,IAAI;AAEnD,UAAIA,KAAI;AACJ,QAAAG,KAAKA,KAAI,MAAOhB;AACpB,YAAO,MAAM,MAAOA;AAAA,IACxB;AACA,WAAOkB,GAAEF,KAAIA,EAAC,MAAMC,KAAID,KAAI,IAAI,cAAc;AAAA,EAClD;AAEA,MAAM,SAAN,MAAM,OAAM;AAAA,IAMR,YAAY,IAAI,IAAI,IAAI;AAHxB;AACA;AACA;AAEI,WAAK,KAAK,QAAQ,EAAE;AACpB,WAAK,KAAK,OAAO,EAAE;AACnB,WAAK,KAAK,QAAQ,EAAE;AACpB,aAAO,OAAO,IAAI;AAAA,IACtB;AAAA;AAAA,IAEA,OAAO,UAAU,OAAO;AACpB,MAAAP,QAAO,KAAK;AACZ,UAAIe,KAAI;AAIR,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,OAAO,MAAM,SAAS,CAAC;AAC7B,YAAML,KAAI,gBAAgB,MAAM,GAAGjB,EAAC;AACpC,YAAM,MAAM,MAAM;AAElB,UAAI,QAAQA,KAAI,KAAK,CAAC,GAAM,CAAI,EAAE,SAAS,IAAI,GAAG;AAG9C,YAAIkB,KAAI,OAAOD,EAAC;AAChB,cAAM,QAAQ,OAAOC,EAAC;AACtB,cAAM,QAAQ,OAAO,IAAI,IAAI,CAAC;AAC9B,YAAI,UAAU;AACV,UAAAA,KAAIF,GAAE,CAACE,EAAC;AACZ,QAAAI,KAAI,IAAI,OAAML,IAAGC,IAAG,EAAE;AAAA,MAC1B;AAEA,UAAI,QAAQjB,MAAK,KAAK,SAAS;AAC3B,QAAAqB,KAAI,IAAI,OAAML,IAAG,gBAAgB,MAAMjB,IAAGC,GAAE,GAAG,EAAE;AAErD,aAAOqB,KAAIA,GAAE,eAAe,IAAI,IAAI,yBAAyB;AAAA,IACjE;AAAA;AAAA,IAEA,OAAO,OAAO;AACV,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI;AACnC,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;AAC/C,YAAM,OAAON,GAAE,KAAK,EAAE;AACtB,YAAM,OAAOA,GAAE,KAAK,EAAE;AACtB,YAAM,OAAOA,GAAE,KAAK,EAAE;AACtB,YAAM,OAAOA,GAAE,KAAK,EAAE;AACtB,aAAO,SAAS,QAAQ,SAAS;AAAA,IACrC;AAAA,IACA,MAAM;AACF,aAAO,KAAK,OAAOO,EAAC;AAAA,IACxB;AAAA;AAAA,IAEA,SAAS;AACL,aAAO,IAAI,OAAM,KAAK,IAAIP,GAAE,CAAC,KAAK,EAAE,GAAG,KAAK,EAAE;AAAA,IAClD;AAAA;AAAA,IAEA,SAAS;AACL,aAAO,KAAK,IAAI,IAAI;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,IAAI,OAAO;AACP,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI;AACnC,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;AAC/C,YAAMV,KAAI;AACV,YAAMI,KAAI;AACV,UAAI,KAAK,IAAI,KAAK,IAAI,KAAK;AAC3B,YAAM,KAAKM,GAAEN,KAAI,EAAE;AACnB,UAAI,KAAKM,GAAE,KAAK,EAAE,GAAG,KAAKA,GAAE,KAAK,EAAE,GAAG,KAAKA,GAAE,KAAK,EAAE,GAAG,KAAKA,GAAE,KAAK,EAAE;AACrE,UAAI,KAAKA,GAAE,KAAK,EAAE;AAClB,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,UAAI,KAAKA,GAAE,KAAK,EAAE;AAClB,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAEV,KAAI,EAAE;AACb,WAAKU,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAEV,KAAI,EAAE;AACb,WAAKU,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAEV,KAAI,EAAE;AACb,WAAKU,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,WAAKA,GAAE,KAAK,EAAE;AACd,aAAO,IAAI,OAAM,IAAI,IAAI,EAAE;AAAA,IAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,SAASb,IAAG,OAAO,MAAM;AACrB,UAAI,CAAC,QAAQA,OAAM;AACf,eAAOoB;AACX,aAAOpB,EAAC;AACR,UAAIA,OAAM;AACN,eAAO;AACX,UAAI,KAAK,OAAOqB,EAAC;AACb,eAAO,KAAKrB,EAAC,EAAE;AAEnB,UAAImB,KAAIC;AACR,UAAIE,KAAID;AACR,eAASE,KAAI,MAAMvB,KAAI,IAAIuB,KAAIA,GAAE,OAAO,GAAGvB,OAAM,IAAI;AAGjD,YAAIA,KAAI;AACJ,UAAAmB,KAAIA,GAAE,IAAII,EAAC;AAAA,iBACN;AACL,UAAAD,KAAIA,GAAE,IAAIC,EAAC;AAAA,MACnB;AACA,aAAOJ;AAAA,IACX;AAAA;AAAA,IAEA,WAAW;AACP,YAAM,EAAE,IAAIL,IAAG,IAAIC,IAAG,IAAI,EAAE,IAAI;AAEhC,UAAI,KAAK,OAAOK,EAAC;AACb,eAAO,EAAE,GAAG,IAAI,GAAG,GAAG;AAC1B,UAAI,MAAM;AACN,eAAO,EAAE,GAAAN,IAAG,GAAAC,GAAE;AAClB,YAAM,KAAK,OAAO,GAAGpB,EAAC;AAEtB,UAAIkB,GAAE,IAAI,EAAE,MAAM;AACd,YAAI,iBAAiB;AAEzB,aAAO,EAAE,GAAGA,GAAEC,KAAI,EAAE,GAAG,GAAGD,GAAEE,KAAI,EAAE,EAAE;AAAA,IACxC;AAAA;AAAA,IAEA,iBAAiB;AACb,YAAM,EAAE,GAAAD,IAAG,GAAAC,GAAE,IAAI,KAAK,SAAS;AAC/B,aAAOD,EAAC;AACR,aAAOC,EAAC;AAER,aAAOF,GAAEE,KAAIA,EAAC,MAAM,QAAQD,EAAC,IAAI,OAAO,IAAI,yBAAyB;AAAA,IACzE;AAAA;AAAA,IAEA,QAAQ,eAAe,MAAM;AACzB,YAAM,EAAE,GAAAA,IAAG,GAAAC,GAAE,IAAI,KAAK,eAAe,EAAE,SAAS;AAChD,YAAM,OAAO,SAASD,EAAC;AACvB,UAAI;AACA,eAAO,YAAY,UAAUC,EAAC,GAAG,IAAI;AACzC,aAAO,YAAY,KAAK,CAAI,GAAG,MAAM,SAASA,EAAC,CAAC;AAAA,IACpD;AAAA;AAAA,IAEA,OAAO,WAAW,IAAI;AAClB,YAAM,EAAE,GAAAD,IAAG,GAAAC,GAAE,IAAI;AACjB,aAAOD,OAAM,MAAMC,OAAM,KAAKK,KAAI,IAAI,OAAMN,IAAGC,IAAG,EAAE;AAAA,IACxD;AAAA,IACA,MAAM,cAAc;AAChB,aAAOT,YAAW,KAAK,QAAQ,YAAY,CAAC;AAAA,IAChD;AAAA,IACA,OAAO,eAAekB,IAAG;AACrB,aAAOH,GAAE,SAAS,aAAaG,EAAC,CAAC;AAAA,IACrC;AAAA,IACA,OAAO,QAAQ,KAAK;AAChB,aAAO,OAAM,UAAU,KAAK,GAAG,CAAC;AAAA,IACpC;AAAA,IACA,IAAI,IAAI;AACJ,aAAO,KAAK,SAAS,EAAE;AAAA,IAC3B;AAAA,IACA,IAAI,IAAI;AACJ,aAAO,KAAK,SAAS,EAAE;AAAA,IAC3B;AAAA,IACA,WAAW,cAAc;AACrB,aAAO,KAAK,QAAQ,YAAY;AAAA,IACpC;AAAA,EACJ;AAlMI,gBADE,QACK;AACP,gBAFE,QAEK;AAFX,MAAM,QAAN;AAqMA,MAAMH,KAAI,IAAI,MAAM,IAAI,IAAI,EAAE;AAE9B,MAAMD,KAAI,IAAI,MAAM,IAAI,IAAI,EAAE;AAE9B,QAAM,OAAOC;AACb,QAAM,OAAOD;AAEb,MAAM,qBAAqB,CAACK,IAAG,IAAI,OAAO;AACtC,WAAOJ,GAAE,SAAS,IAAI,KAAK,EAAE,IAAII,GAAE,SAAS,IAAI,KAAK,CAAC,EAAE,eAAe;AAAA,EAC3E;AACA,MAAM,eAAe,CAAClB,OAAM,IAAI,QAAQD,YAAWC,EAAC,KAAK,IAAI;AAC7D,MAAM,kBAAkB,CAACA,IAAG,MAAM,OAAO,aAAaA,GAAE,SAAS,MAAM,EAAE,CAAC;AAC1E,MAAM,OAAO,MAAM;AAEnB,MAAM,WAAW,CAAC,QAAQG,YAAW,KAAK,OAAO,KAAK,IAAI,IAAI,GAAGZ,GAAE,CAAC;AAEpE,MAAM,eAAe,CAAC,OAAO;AACzB,UAAM,MAAM,MAAM,EAAE,IAAI,KAAK,aAAa,KAAK,IAAID,EAAC,CAAC;AACrD,WAAO,OAAO,KAAK,IAAID,IAAG,uBAAuB;AAAA,EACrD;AAEA,MAAM,QAAQ,CAACI,OAAMA,KAAIJ,MAAK;AAE9B,MAAM,eAAe,CAAC,SAAS,eAAe,SAAS;AACnD,WAAOyB,GAAE,SAAS,aAAa,OAAO,CAAC,EAAE,QAAQ,YAAY;AAAA,EACjE;AAEA,MAAM,YAAN,MAAM,WAAU;AAAA,IAIZ,YAAYV,IAAGV,IAAG,UAAU;AAH5B;AACA;AACA;AAEI,WAAK,IAAI,OAAOU,EAAC;AACjB,WAAK,IAAI,OAAOV,EAAC;AACjB,UAAI,YAAY;AACZ,aAAK,WAAW;AACpB,aAAO,OAAO,IAAI;AAAA,IACtB;AAAA;AAAA,IAEA,OAAO,UAAUM,IAAG;AAChB,MAAAH,QAAOG,IAAGT,GAAE;AACZ,YAAMa,KAAI,gBAAgBJ,IAAG,GAAGV,EAAC;AACjC,YAAMI,KAAI,gBAAgBM,IAAGV,IAAGC,GAAE;AAClC,aAAO,IAAI,WAAUa,IAAGV,EAAC;AAAA,IAC7B;AAAA,IACA,UAAU;AACN,YAAM,EAAE,GAAAU,IAAG,GAAAV,GAAE,IAAI;AACjB,aAAO,YAAY,SAASU,EAAC,GAAG,SAASV,EAAC,CAAC;AAAA,IAC/C;AAAA;AAAA,IAEA,eAAe,KAAK;AAChB,aAAO,IAAI,WAAU,KAAK,GAAG,KAAK,GAAG,GAAG;AAAA,IAC5C;AAAA,IACA,WAAW;AACP,aAAO,MAAM,KAAK,CAAC;AAAA,IACvB;AAAA,IACA,oBAAoB;AAChB,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,eAAe;AACX,aAAOK,YAAW,KAAK,QAAQ,CAAC;AAAA,IACpC;AAAA,IACA,iBAAiB,KAAK;AAClB,aAAO,iBAAiB,MAAM,GAAG;AAAA,IACrC;AAAA,IACA,OAAO,YAAY,KAAK;AACpB,aAAO,WAAU,UAAU,KAAK,KAAKR,GAAE,CAAC;AAAA,IAC5C;AAAA,IACA,iBAAiB;AACb,aAAO;AAAA,IACX;AAAA,IACA,aAAa;AACT,YAAM,EAAE,GAAAa,IAAG,GAAAV,IAAG,SAAS,IAAI;AAC3B,aAAO,MAAMA,EAAC,IAAI,IAAI,WAAUU,IAAG,KAAK,CAACV,EAAC,GAAG,QAAQ,IAAI;AAAA,IAC7D;AAAA,EACJ;AAOA,MAAM,WAAW,CAAC,UAAU;AACxB,UAAM,QAAQ,MAAM,SAAS,IAAI;AACjC,QAAI,QAAQ;AACR,UAAI,aAAa;AACrB,UAAM,MAAM,aAAa,KAAK;AAC9B,WAAO,QAAQ,IAAI,OAAO,IAAI,KAAK,IAAI;AAAA,EAC3C;AAEA,MAAM,gBAAgB,CAAC,UAAU,KAAK,SAASG,QAAO,KAAK,CAAC,CAAC;AAC7D,MAAM,WAAW,EAAE,MAAM,KAAK;AAC9B,MAAM,WAAW,EAAE,MAAM,KAAK;AAE9B,MAAM,UAAU,CAAC,MAAM,MAAM,OAAO,aAAa;AAC7C,QAAI,CAAC,OAAO,aAAa,WAAW,EAAE,KAAK,CAACoB,OAAMA,MAAK,IAAI;AAEvD,UAAI,sBAAsB;AAC9B,QAAI,EAAE,MAAM,aAAa,IAAI;AAC7B,QAAI,QAAQ;AACR,aAAO;AACX,UAAM,MAAM;AACZ,UAAM,MAAM,cAAc,KAAK,IAAI,CAAC;AACpC,UAAM,MAAM,IAAI,GAAG;AACnB,UAAMD,KAAI,aAAa,IAAI;AAC3B,UAAM,OAAO,CAAC,IAAIA,EAAC,GAAG,GAAG;AAGzB,QAAI;AACA,WAAK,KAAK,iBAAiB,OAAO,YAAY1B,EAAC,IAAI,KAAK,YAAY,CAAC;AACzE,UAAME,KAAI;AAMV,UAAM,QAAQ,CAAC,WAAW;AAGtB,YAAMyB,KAAI,SAAS,MAAM;AACzB,UAAI,EAAE,MAAMA,MAAKA,KAAI5B;AACjB;AACJ,YAAMsB,KAAIG,GAAE,SAASG,EAAC,EAAE,SAAS;AACjC,YAAMb,KAAI,KAAKO,GAAE,CAAC;AAClB,UAAIP,OAAM;AACN;AACJ,YAAM,KAAK,OAAOa,IAAG5B,EAAC;AACtB,YAAMK,KAAI,KAAK,KAAK,KAAKF,KAAI,KAAKwB,KAAIZ,EAAC,CAAC,CAAC;AACzC,UAAIV,OAAM;AACN;AACJ,UAAI,QAAQA;AACZ,UAAI,YAAYiB,GAAE,MAAMP,KAAI,IAAI,KAAK,OAAOO,GAAE,IAAI,EAAE;AACpD,UAAI,QAAQ,MAAMjB,EAAC,GAAG;AAElB,gBAAQ,KAAK,CAACA,EAAC;AACf,oBAAY;AAAA,MAChB;AACA,aAAO,IAAI,UAAUU,IAAG,OAAO,QAAQ;AAAA,IAC3C;AACA,WAAO,EAAE,MAAM,YAAY,GAAG,IAAI,GAAG,MAAM;AAAA,EAC/C;AAEA,MAAM,WAAW,CAAC,iBAAiB;AAC/B,QAAIM,KAAI,IAAIpB,EAAC;AACb,QAAI2B,KAAI,IAAI3B,EAAC;AACb,QAAI6B,KAAI;AACR,UAAM,OAAO,IAAI,CAAC;AAClB,UAAM,QAAQ,MAAM;AAChB,MAAAT,GAAE,KAAK,CAAC;AACR,MAAAO,GAAE,KAAK,CAAC;AACR,MAAAE,KAAI;AAAA,IACR;AACA,UAAM,MAAM;AACZ,UAAM,KAAK;AACX,QAAI,cAAc;AAGd,YAAMC,KAAI,IAAIpB,OAAM,IAAI,gBAAgBiB,IAAGP,IAAG,GAAGV,EAAC;AAClD,YAAM,SAAS,OAAO,OAAO,SAAS;AAElC,QAAAiB,KAAI,MAAMG,GAAE,KAAK,CAAI,GAAG,IAAI;AAC5B,QAAAV,KAAI,MAAMU,GAAE;AACZ,YAAI,KAAK,WAAW;AAChB;AACJ,QAAAH,KAAI,MAAMG,GAAE,KAAK,CAAI,GAAG,IAAI;AAC5B,QAAAV,KAAI,MAAMU,GAAE;AAAA,MAChB;AAEA,YAAM,MAAM,YAAY;AACpB,YAAID,QAAO;AACP,cAAI,EAAE;AACV,QAAAT,KAAI,MAAMU,GAAE;AACZ,eAAOV;AAAA,MACX;AAGA,aAAO,OAAO,MAAM,SAAS;AACzB,cAAM;AACN,cAAM,OAAO,IAAI;AACjB,YAAI,MAAM;AACV,eAAO,EAAE,MAAM,KAAK,MAAM,IAAI,CAAC;AAC3B,gBAAM,OAAO;AACjB,cAAM;AACN,eAAO;AAAA,MACX;AAAA,IACJ,OACK;AAGD,YAAMU,KAAI,IAAIpB,OAAM,SAAS,gBAAgB,EAAEiB,IAAGP,IAAG,GAAGV,EAAC;AACzD,YAAM,SAAS,CAAC,OAAO,SAAS;AAE5B,QAAAiB,KAAIG,GAAE,KAAK,CAAI,GAAG,IAAI;AACtB,QAAAV,KAAIU,GAAE;AACN,YAAI,KAAK,WAAW;AAChB;AACJ,QAAAH,KAAIG,GAAE,KAAK,CAAI,GAAG,IAAI;AACtB,QAAAV,KAAIU,GAAE;AAAA,MACV;AAEA,YAAM,MAAM,MAAM;AACd,YAAID,QAAO;AACP,cAAI,EAAE;AACV,QAAAT,KAAIU,GAAE;AACN,eAAOV;AAAA,MACX;AAGA,aAAO,CAAC,MAAM,SAAS;AACnB,cAAM;AACN,eAAO,IAAI;AACX,YAAI,MAAM;AACV,eAAO,EAAE,MAAM,KAAK,IAAI,CAAC;AACrB,iBAAO;AACX,cAAM;AACN,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,EACJ;AAyBA,MAAM,OAAO,CAAC,MAAM,MAAM,OAAO,aAAa;AAE1C,UAAM,EAAE,MAAM,MAAM,IAAI,QAAQ,MAAM,MAAM,IAAI;AAChD,UAAM,MAAM,SAAS,KAAK,EAAE,MAAM,KAAK;AACvC,WAAO;AAAA,EACX;AAUA,MAAM,SAAS,CAAC,KAAK,MAAM,KAAK,OAAO,aAAa;AAChD,QAAI,EAAE,KAAK,IAAI;AACf,QAAI,QAAQ;AACR,aAAO;AACX,QAAI,YAAY;AACZ,UAAI,sBAAsB;AAC9B,QAAI;AAGJ,UAAM,KAAK,OAAO,OAAO,QAAQ,YAAY,OAAO;AACpD,QAAI,CAAC,MAAM,KAAK,GAAG,EAAE,WAAWW;AAC5B,UAAI,4BAA4B;AACpC,QAAI;AACA,aAAO,KAAK,IAAI,UAAU,IAAI,GAAG,IAAI,CAAC,IAAI,UAAU,YAAY,GAAG;AACnE,YAAMC,KAAI,cAAc,KAAK,IAAI,CAAC;AAClC,YAAMC,KAAI,MAAM,UAAU,KAAK,GAAG,CAAC;AACnC,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAE,IAAI;AACjB,UAAI,QAAQ,MAAMA,EAAC;AACf,eAAO;AACX,YAAM,KAAK,OAAOA,IAAGC,EAAC;AACtB,YAAM,KAAK,KAAKJ,KAAI,EAAE;AACtB,YAAM,KAAK,KAAKE,KAAI,EAAE;AACtB,YAAMG,KAAI,mBAAmBJ,IAAG,IAAI,EAAE,EAAE,SAAS;AAEjD,YAAMK,KAAI,KAAKD,GAAE,CAAC;AAClB,aAAOC,OAAMJ;AAAA,IACjB,SACO,OAAO;AACV,aAAO;AAAA,IACX;AAAA,EACJ;AAKA,MAAM,mBAAmB,CAAC,KAAK,SAAS;AACpC,UAAM,EAAE,GAAAA,IAAG,GAAAC,IAAG,SAAS,IAAI;AAG3B,QAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAAS,QAAQ;AAC/B,UAAI,qBAAqB;AAC7B,UAAMH,KAAI,cAAc,KAAK,MAAMO,EAAC,CAAC;AACrC,UAAM,OAAO,aAAa,KAAK,aAAa,IAAIL,KAAIE,KAAIF;AACxD,WAAO,IAAI;AACX,UAAM,OAAO,UAAU,IAAI,QAAQ,CAAC;AACpC,UAAM,KAAK,YAAY,MAAM,SAAS,IAAI,CAAC;AAC3C,UAAMG,KAAI,MAAM,UAAU,EAAE;AAC5B,UAAM,KAAK,OAAO,MAAMD,EAAC;AACzB,UAAM,KAAK,KAAK,CAACJ,KAAI,EAAE;AACvB,UAAM,KAAK,KAAKG,KAAI,EAAE;AACtB,WAAO,mBAAmBE,IAAG,IAAI,EAAE;AAAA,EACvC;AAcA,MAAM,mBAAmB,CAAC,SAAS;AAC/B,WAAO,KAAK,IAAI;AAChB,QAAI,KAAK,SAASG,KAAI,KAAK,KAAK,SAAS;AACrC,UAAI,mBAAmB;AAC3B,UAAM,MAAMC,GAAE,aAAa,IAAI,GAAGC,KAAI,EAAE;AACxC,WAAO,SAAS,MAAM,EAAE;AAAA,EAC5B;AACA,MAAM,mBAAmB,MAAM,iBAAiB,YAAYF,KAAI,EAAE,CAAC;AACnE,MAAM,OAAO;AAEb,MAAM,MAAM;AAAA,IACR,YAAYG;AAAA,IACZ,YAAYC;AAAA,IACZ;AAAA,IACA,iBAAiB;AAAA,IACjB,iBAAiB;AAAA,IACjB,KAAKH;AAAA,IACL;AAAA;AAAA,IACA,iBAAiB,OAAO,QAAQ,SAAS;AACrC,YAAMI,KAAI,OAAO;AACjB,YAAM,OAAO;AACb,YAAMC,KAAI,MAAMD,GAAE,UAAU,OAAO,KAAK,EAAE,MAAM,MAAM,EAAE,MAAM,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC;AACvF,aAAO,IAAI,MAAMA,GAAE,KAAK,MAAMC,IAAG,YAAY,GAAG,IAAI,CAAC,CAAC;AAAA,IAC1D;AAAA,IACA,gBAAgB;AAAA;AAAA,IAChB;AAAA,IACA;AAAA,EACJ;AAEA,MAAM,QAAQ;AAAA,IACV,wBAAwB;AAAA,IACxB,mBAAmB,CAAC,QAAQ;AACxB,UAAI;AACA,eAAO,CAAC,CAAC,aAAa,GAAG;AAAA,MAC7B,SACOC,IAAG;AACN,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA;AAAA,IACA,YAAY,CAACC,KAAI,GAAGC,KAAIC,OAAM;AAC1B,MAAAD,GAAE,SAAS,EAAE;AACb,MAAAD;AACA,aAAOC;AAAA,IACX;AAAA,EACJ;AAGA,MAAME,KAAI;AACV,MAAM,aAAa;AACnB,MAAM,WAAW,KAAK,KAAK,aAAaA,EAAC,IAAI;AAC7C,MAAM,cAAc,MAAMA,KAAI;AAC9B,MAAM,aAAa,MAAM;AACrB,UAAM,SAAS,CAAC;AAChB,QAAIF,KAAIC;AACR,QAAIE,KAAIH;AACR,aAASD,KAAI,GAAGA,KAAI,UAAUA,MAAK;AAC/B,MAAAI,KAAIH;AACJ,aAAO,KAAKG,EAAC;AACb,eAASC,KAAI,GAAGA,KAAI,aAAaA,MAAK;AAClC,QAAAD,KAAIA,GAAE,IAAIH,EAAC;AACX,eAAO,KAAKG,EAAC;AAAA,MACjB;AACA,MAAAH,KAAIG,GAAE,OAAO;AAAA,IACjB;AACA,WAAO;AAAA,EACX;AACA,MAAI,QAAQ;AAEZ,MAAM,QAAQ,CAAC,KAAKH,OAAM;AACtB,UAAMK,KAAIL,GAAE,OAAO;AACnB,WAAO,MAAMK,KAAIL;AAAA,EACrB;AAYA,MAAM,OAAO,CAACK,OAAM;AAChB,UAAM,OAAO,UAAU,QAAQ,WAAW;AAC1C,QAAIL,KAAIM;AACR,QAAIC,KAAIN;AACR,UAAM,UAAU,KAAKC;AACrB,UAAM,SAAS;AACf,UAAM,OAAO,IAAI,UAAU,CAAC;AAC5B,UAAM,UAAU,IAAIA,EAAC;AACrB,aAASH,KAAI,GAAGA,KAAI,UAAUA,MAAK;AAC/B,UAAI,QAAQ,OAAOM,KAAI,IAAI;AAC3B,MAAAA,OAAM;AACN,UAAI,QAAQ,aAAa;AACrB,iBAAS;AACT,QAAAA,MAAK;AAAA,MACT;AACA,YAAM,MAAMN,KAAI;AAChB,YAAM,OAAO;AACb,YAAM,OAAO,MAAM,KAAK,IAAI,KAAK,IAAI;AACrC,YAAMS,UAAST,KAAI,MAAM;AACzB,YAAM,QAAQ,QAAQ;AACtB,UAAI,UAAU,GAAG;AAEb,QAAAQ,KAAIA,GAAE,IAAI,MAAMC,SAAQ,KAAK,IAAI,CAAC,CAAC;AAAA,MACvC,OACK;AACD,QAAAR,KAAIA,GAAE,IAAI,MAAM,OAAO,KAAK,IAAI,CAAC,CAAC;AAAA,MACtC;AAAA,IACJ;AACA,WAAO,EAAE,GAAAA,IAAG,GAAAO,GAAE;AAAA,EAClB;;;ACnxBA;;;ACAA;AAeM,WAAUE,SAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAUC,SAAQC,IAAS;AAC/B,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI;AAAG,YAAM,IAAI,MAAM,oCAAoCA,EAAC;EAC9F;AAGM,WAAUC,QAAOC,OAA8B,SAAiB;AACpE,QAAI,CAACL,SAAQK,EAAC;AAAG,YAAM,IAAI,MAAM,qBAAqB;AACtD,QAAI,QAAQ,SAAS,KAAK,CAAC,QAAQ,SAASA,GAAE,MAAM;AAClD,YAAM,IAAI,MAAM,mCAAmC,UAAU,kBAAkBA,GAAE,MAAM;EAC3F;AAGM,WAAU,MAAMC,IAAQ;AAC5B,QAAI,OAAOA,OAAM,cAAc,OAAOA,GAAE,WAAW;AACjD,YAAM,IAAI,MAAM,8CAA8C;AAChE,IAAAJ,SAAQI,GAAE,SAAS;AACnB,IAAAJ,SAAQI,GAAE,QAAQ;EACpB;AAGM,WAAUC,SAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAUC,SAAQ,KAAU,UAAa;AAC7C,IAAAJ,QAAO,GAAG;AACV,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,2DAA2D,GAAG;IAChF;EACF;AAkBM,WAAUK,UAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAUC,YAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAUC,MAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAkIM,WAAU,YAAY,KAAW;AACrC,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,iBAAiB;AAC9D,WAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;EACrD;AAiBM,WAAU,QAAQ,MAAW;AACjC,QAAI,OAAO,SAAS;AAAU,aAAO,YAAY,IAAI;AACrD,IAAAC,QAAO,IAAI;AACX,WAAO;EACT;AAmDM,MAAgB,OAAhB,MAAoB;;AA4CpB,WAAUC,cACd,UAAuB;AAOvB,UAAM,QAAQ,CAAC,QAA2B,SAAQ,EAAG,OAAO,QAAQ,GAAG,CAAC,EAAE,OAAM;AAChF,UAAM,MAAM,SAAQ;AACpB,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,MAAM,SAAQ;AAC7B,WAAO;EACT;;;ADrVM,MAAO,OAAP,cAAuC,KAAa;IAQxD,YAAY,MAAa,MAAW;AAClC,YAAK;AAJC,WAAA,WAAW;AACX,WAAA,YAAY;AAIlB,YAAM,IAAI;AACV,YAAM,MAAM,QAAQ,IAAI;AACxB,WAAK,QAAQ,KAAK,OAAM;AACxB,UAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,cAAM,IAAI,MAAM,qDAAqD;AACvE,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,YAAY,KAAK,MAAM;AAC5B,YAAM,WAAW,KAAK;AACtB,YAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,UAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,eAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK;AAC/C,WAAK,MAAM,OAAO,GAAG;AAErB,WAAK,QAAQ,KAAK,OAAM;AAExB,eAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK,KAAO;AACtD,WAAK,MAAM,OAAO,GAAG;AACrB,MAAAC,OAAM,GAAG;IACX;IACA,OAAO,KAAU;AACf,MAAAC,SAAQ,IAAI;AACZ,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAA,SAAQ,IAAI;AACZ,MAAAC,QAAO,KAAK,KAAK,SAAS;AAC1B,WAAK,WAAW;AAChB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,QAAO;IACd;IACA,SAAM;AACJ,YAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,WAAK,WAAW,GAAG;AACnB,aAAO;IACT;IACA,WAAW,IAAY;AAErB,aAAA,KAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,YAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,WAAK;AACL,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;IACA,UAAO;AACL,WAAK,YAAY;AACjB,WAAK,MAAM,QAAO;AAClB,WAAK,MAAM,QAAO;IACpB;;AAaK,MAAM,OAGT,CAAC,MAAa,KAAY,YAC5B,IAAI,KAAU,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AACjD,OAAK,SAAS,CAAC,MAAa,QAAe,IAAI,KAAU,MAAM,GAAG;;;AE7FlE;;;ACAA;;;ACAA;AAOM,WAAU,aACd,MACA,YACA,OACAC,OAAa;AAEb,QAAI,OAAO,KAAK,iBAAiB;AAAY,aAAO,KAAK,aAAa,YAAY,OAAOA,KAAI;AAC7F,UAAMC,QAAO,OAAO,EAAE;AACtB,UAAM,WAAW,OAAO,UAAU;AAClC,UAAM,KAAK,OAAQ,SAASA,QAAQ,QAAQ;AAC5C,UAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,UAAMC,KAAIF,QAAO,IAAI;AACrB,UAAMG,KAAIH,QAAO,IAAI;AACrB,SAAK,UAAU,aAAaE,IAAG,IAAIF,KAAI;AACvC,SAAK,UAAU,aAAaG,IAAG,IAAIH,KAAI;EACzC;AAGM,WAAUI,KAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAUC,KAAIH,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAMM,MAAgBE,UAAhB,cAAoD,KAAO;IAoB/D,YAAY,UAAkB,WAAmB,WAAmBT,OAAa;AAC/E,YAAK;AANG,WAAA,WAAW;AACX,WAAA,SAAS;AACT,WAAA,MAAM;AACN,WAAA,YAAY;AAIpB,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,OAAOA;AACZ,WAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,WAAK,OAAOU,YAAW,KAAK,MAAM;IACpC;IACA,OAAO,MAAW;AAChB,MAAAC,SAAQ,IAAI;AACZ,aAAO,QAAQ,IAAI;AACnB,MAAAC,QAAO,IAAI;AACX,YAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,YAAM,MAAM,KAAK;AACjB,eAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,cAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,YAAI,SAAS,UAAU;AACrB,gBAAM,WAAWF,YAAW,IAAI;AAChC,iBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,iBAAK,QAAQ,UAAU,GAAG;AACzE;QACF;AACA,eAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,aAAK,OAAO;AACZ,eAAO;AACP,YAAI,KAAK,QAAQ,UAAU;AACzB,eAAK,QAAQ,MAAM,CAAC;AACpB,eAAK,MAAM;QACb;MACF;AACA,WAAK,UAAU,KAAK;AACpB,WAAK,WAAU;AACf,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAC,SAAQ,IAAI;AACZ,MAAAE,SAAQ,KAAK,IAAI;AACjB,WAAK,WAAW;AAIhB,YAAM,EAAE,QAAQ,MAAM,UAAU,MAAAb,MAAI,IAAK;AACzC,UAAI,EAAE,IAAG,IAAK;AAEd,aAAO,KAAK,IAAI;AAChB,MAAAc,OAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,UAAI,KAAK,YAAY,WAAW,KAAK;AACnC,aAAK,QAAQ,MAAM,CAAC;AACpB,cAAM;MACR;AAEA,eAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,eAAOA,EAAC,IAAI;AAIjD,mBAAa,MAAM,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGf,KAAI;AAC9D,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM,QAAQU,YAAW,GAAG;AAC5B,YAAM,MAAM,KAAK;AAEjB,UAAI,MAAM;AAAG,cAAM,IAAI,MAAM,6CAA6C;AAC1E,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,IAAG;AACtB,UAAI,SAAS,MAAM;AAAQ,cAAM,IAAI,MAAM,oCAAoC;AAC/E,eAASK,KAAI,GAAGA,KAAI,QAAQA;AAAK,cAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGf,KAAI;IACxE;IACA,SAAM;AACJ,YAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,WAAK,WAAW,MAAM;AACtB,YAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,WAAK,QAAO;AACZ,aAAO;IACT;IACA,WAAW,IAAM;AACf,aAAA,KAAO,IAAK,KAAK,YAAmB;AACpC,SAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,YAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,SAAS;AACZ,SAAG,MAAM;AACT,UAAI,SAAS;AAAU,WAAG,OAAO,IAAI,MAAM;AAC3C,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;;AASK,MAAMgB,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;;;AD9ID,MAAMC,YAA2B,4BAAY,KAAK;IAChD;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAGD,MAAMC,YAA2B,oBAAI,YAAY,EAAE;AAC7C,MAAO,SAAP,cAAsBC,QAAc;IAYxC,YAAY,YAAoB,IAAE;AAChC,YAAM,IAAI,WAAW,GAAG,KAAK;AAVrB,WAAA,IAAYC,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;AAC3B,WAAA,IAAYA,WAAU,CAAC,IAAI;IAIrC;IACU,MAAG;AACX,YAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,aAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IAChC;;IAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,WAAK,IAAIP,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;IACf;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,QAAAX,UAASW,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,cAAM,MAAMX,UAASW,KAAI,EAAE;AAC3B,cAAMC,MAAKZ,UAASW,KAAI,CAAC;AACzB,cAAM,KAAKE,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,cAAM,KAAKA,MAAKD,KAAI,EAAE,IAAIC,MAAKD,KAAI,EAAE,IAAKA,QAAO;AACjD,QAAAZ,UAASW,EAAC,IAAK,KAAKX,UAASW,KAAI,CAAC,IAAI,KAAKX,UAASW,KAAI,EAAE,IAAK;MACjE;AAEA,UAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,SAASE,MAAKN,IAAG,CAAC,IAAIM,MAAKN,IAAG,EAAE,IAAIM,MAAKN,IAAG,EAAE;AACpD,cAAM,KAAMG,KAAI,SAASI,KAAIP,IAAGC,IAAGC,EAAC,IAAIV,UAASY,EAAC,IAAIX,UAASW,EAAC,IAAK;AACrE,cAAM,SAASE,MAAKV,IAAG,CAAC,IAAIU,MAAKV,IAAG,EAAE,IAAIU,MAAKV,IAAG,EAAE;AACpD,cAAM,KAAM,SAASY,KAAIZ,IAAGC,IAAGC,EAAC,IAAK;AACrC,QAAAK,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAKD,KAAI,KAAM;AACf,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAK,KAAK,KAAM;MAClB;AAEA,MAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,WAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IACjC;IACU,aAAU;AAClB,MAAAM,OAAMhB,SAAQ;IAChB;IACA,UAAO;AACL,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,MAAAgB,OAAM,KAAK,MAAM;IACnB;;AAuRK,MAAMC,UAAgC,gBAAAC,cAAa,MAAM,IAAI,OAAM,CAAE;;;AD5WrE,MAAMC,UAAyBA;;;AGnBtC;;;ACAA;;;ACAA;;;ACAA;;;ACAA;;;ACAA;AAMM,WAAUC,SAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAUC,SAAQC,IAAW,QAAgB,IAAE;AACnD,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,GAAG;AACrC,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,GAAG,MAAM,8BAA8BA,EAAC,EAAE;IAC5D;EACF;AAGM,WAAUC,QAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,UAAM,QAAQJ,SAAQ,KAAK;AAC3B,UAAM,MAAM,OAAO;AACnB,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,YAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,YAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;IACzE;AACA,WAAO;EACT;AAGM,WAAUK,OAAMC,IAAQ;AAC5B,QAAI,OAAOA,OAAM,cAAc,OAAOA,GAAE,WAAW;AACjD,YAAM,IAAI,MAAM,yCAAyC;AAC3D,IAAAJ,SAAQI,GAAE,SAAS;AACnB,IAAAJ,SAAQI,GAAE,QAAQ;EACpB;AAGM,WAAUC,SAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAUC,SAAQ,KAAU,UAAa;AAC7C,IAAAJ,QAAO,KAAK,QAAW,qBAAqB;AAC5C,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,sDAAsD,GAAG;IAC3E;EACF;AAkBM,WAAUK,UAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAUC,YAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAUC,MAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAsCA,MAAM,gBAA0C;;IAE9C,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,UAAU,cAAc,OAAO,WAAW,YAAY;KAAW;AAG9F,MAAM,QAAwB,sBAAM,KAAK,EAAE,QAAQ,IAAG,GAAI,CAAC,GAAGC,OAC5DA,GAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AAO3B,WAAUC,YAAW,OAAiB;AAC1C,IAAAC,QAAO,KAAK;AAEZ,QAAI;AAAe,aAAO,MAAM,MAAK;AAErC,QAAI,MAAM;AACV,aAASF,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,aAAO,MAAM,MAAMA,EAAC,CAAC;IACvB;AACA,WAAO;EACT;AAGA,MAAM,SAAS,EAAE,IAAI,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAG;AAC5D,WAAS,cAAc,IAAU;AAC/B,QAAI,MAAM,OAAO,MAAM,MAAM,OAAO;AAAI,aAAO,KAAK,OAAO;AAC3D,QAAI,MAAM,OAAO,KAAK,MAAM,OAAO;AAAG,aAAO,MAAM,OAAO,IAAI;AAC9D,QAAI,MAAM,OAAO,KAAK,MAAM,OAAO;AAAG,aAAO,MAAM,OAAO,IAAI;AAC9D;EACF;AAMM,WAAUG,YAAW,KAAW;AACpC,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AAErF,QAAI;AAAe,aAAO,WAAW,QAAQ,GAAG;AAChD,UAAM,KAAK,IAAI;AACf,UAAM,KAAK,KAAK;AAChB,QAAI,KAAK;AAAG,YAAM,IAAI,MAAM,qDAAqD,EAAE;AACnF,UAAM,QAAQ,IAAI,WAAW,EAAE;AAC/B,aAAS,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AAC/C,YAAM,KAAK,cAAc,IAAI,WAAW,EAAE,CAAC;AAC3C,YAAM,KAAK,cAAc,IAAI,WAAW,KAAK,CAAC,CAAC;AAC/C,UAAI,OAAO,UAAa,OAAO,QAAW;AACxC,cAAM,OAAO,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AACjC,cAAM,IAAI,MAAM,iDAAiD,OAAO,gBAAgB,EAAE;MAC5F;AACA,YAAM,EAAE,IAAI,KAAK,KAAK;IACxB;AACA,WAAO;EACT;AAoDM,WAAUC,gBAAe,QAAoB;AACjD,QAAI,MAAM;AACV,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,YAAMC,KAAI,OAAOD,EAAC;AAClB,MAAAE,QAAOD,EAAC;AACR,aAAOA,GAAE;IACX;AACA,UAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,aAASD,KAAI,GAAG,MAAM,GAAGA,KAAI,OAAO,QAAQA,MAAK;AAC/C,YAAMC,KAAI,OAAOD,EAAC;AAClB,UAAI,IAAIC,IAAG,GAAG;AACd,aAAOA,GAAE;IACX;AACA,WAAO;EACT;AAoEM,WAAUE,cACd,UACA,OAAiB,CAAA,GAAE;AAEnB,UAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,UAAM,MAAM,SAAS,MAAS;AAC9B,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,WAAO,OAAO,OAAO,IAAI;AACzB,WAAO,OAAO,OAAO,KAAK;EAC5B;AAGM,WAAUC,aAAY,cAAc,IAAE;AAC1C,UAAMC,MAAK,OAAO,eAAe,WAAY,WAAmB,SAAS;AACzE,QAAI,OAAOA,KAAI,oBAAoB;AACjC,YAAM,IAAI,MAAM,wCAAwC;AAC1D,WAAOA,IAAG,gBAAgB,IAAI,WAAW,WAAW,CAAC;EACvD;AAGO,MAAMC,WAAU,CAAC,YAAwC;IAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;ADzUrF,WAAUC,KAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAUC,KAAIH,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAMM,MAAgBE,UAAhB,MAAsB;IAoB1B,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,sCAAW;AACX,oCAAS;AACT,iCAAM;AACN,uCAAY;AAGpB,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,OAAOA;AACZ,WAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,WAAK,OAAOC,YAAW,KAAK,MAAM;IACpC;IACA,OAAO,MAAgB;AACrB,MAAAC,SAAQ,IAAI;AACZ,MAAAC,QAAO,IAAI;AACX,YAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,YAAM,MAAM,KAAK;AACjB,eAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,cAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,YAAI,SAAS,UAAU;AACrB,gBAAM,WAAWF,YAAW,IAAI;AAChC,iBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,iBAAK,QAAQ,UAAU,GAAG;AACzE;QACF;AACA,eAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,aAAK,OAAO;AACZ,eAAO;AACP,YAAI,KAAK,QAAQ,UAAU;AACzB,eAAK,QAAQ,MAAM,CAAC;AACpB,eAAK,MAAM;QACb;MACF;AACA,WAAK,UAAU,KAAK;AACpB,WAAK,WAAU;AACf,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAC,SAAQ,IAAI;AACZ,MAAAE,SAAQ,KAAK,IAAI;AACjB,WAAK,WAAW;AAIhB,YAAM,EAAE,QAAQ,MAAM,UAAU,MAAAJ,MAAI,IAAK;AACzC,UAAI,EAAE,IAAG,IAAK;AAEd,aAAO,KAAK,IAAI;AAChB,MAAAK,OAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,UAAI,KAAK,YAAY,WAAW,KAAK;AACnC,aAAK,QAAQ,MAAM,CAAC;AACpB,cAAM;MACR;AAEA,eAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,eAAOA,EAAC,IAAI;AAIjD,WAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGN,KAAI;AAC7D,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM,QAAQC,YAAW,GAAG;AAC5B,YAAM,MAAM,KAAK;AAEjB,UAAI,MAAM;AAAG,cAAM,IAAI,MAAM,2CAA2C;AACxE,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,IAAG;AACtB,UAAI,SAAS,MAAM;AAAQ,cAAM,IAAI,MAAM,oCAAoC;AAC/E,eAASK,KAAI,GAAGA,KAAI,QAAQA;AAAK,cAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGN,KAAI;IACxE;IACA,SAAM;AACJ,YAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,WAAK,WAAW,MAAM;AACtB,YAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,WAAK,QAAO;AACZ,aAAO;IACT;IACA,WAAW,IAAM;AACf,kBAAO,IAAK,KAAK,YAAmB;AACpC,SAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,YAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,SAAS;AACZ,SAAG,MAAM;AACT,UAAI,SAAS;AAAU,WAAG,OAAO,IAAI,MAAM;AAC3C,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;;AASK,MAAMO,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;;;AD1HD,MAAMC,YAA2B,4BAAY,KAAK;IAChD;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAGD,MAAMC,YAA2B,oBAAI,YAAY,EAAE;AAGnD,MAAeC,YAAf,cAAuDC,QAAS;IAY9D,YAAY,WAAiB;AAC3B,YAAM,IAAI,WAAW,GAAG,KAAK;IAC/B;IACU,MAAG;AACX,YAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,aAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IAChC;;IAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,WAAK,IAAIP,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;IACf;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,QAAAX,UAASW,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,cAAM,MAAMX,UAASW,KAAI,EAAE;AAC3B,cAAMC,MAAKZ,UAASW,KAAI,CAAC;AACzB,cAAM,KAAKE,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,cAAM,KAAKA,MAAKD,KAAI,EAAE,IAAIC,MAAKD,KAAI,EAAE,IAAKA,QAAO;AACjD,QAAAZ,UAASW,EAAC,IAAK,KAAKX,UAASW,KAAI,CAAC,IAAI,KAAKX,UAASW,KAAI,EAAE,IAAK;MACjE;AAEA,UAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,SAASE,MAAKN,IAAG,CAAC,IAAIM,MAAKN,IAAG,EAAE,IAAIM,MAAKN,IAAG,EAAE;AACpD,cAAM,KAAMG,KAAI,SAASI,KAAIP,IAAGC,IAAGC,EAAC,IAAIV,UAASY,EAAC,IAAIX,UAASW,EAAC,IAAK;AACrE,cAAM,SAASE,MAAKV,IAAG,CAAC,IAAIU,MAAKV,IAAG,EAAE,IAAIU,MAAKV,IAAG,EAAE;AACpD,cAAM,KAAM,SAASY,KAAIZ,IAAGC,IAAGC,EAAC,IAAK;AACrC,QAAAK,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAKD,KAAI,KAAM;AACf,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAK,KAAK,KAAM;MAClB;AAEA,MAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,WAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IACjC;IACU,aAAU;AAClB,MAAAM,OAAMhB,SAAQ;IAChB;IACA,UAAO;AACL,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,MAAAgB,OAAM,KAAK,MAAM;IACnB;;AAII,MAAOC,WAAP,cAAuBhB,UAAiB;IAW5C,cAAA;AACE,YAAM,EAAE;AATA;;+BAAYiB,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;IAGrC;;AAqTK,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;;;AGlb/B;;;ACAA;AAqBA,MAAMC,OAAsB,uBAAO,CAAC;AACpC,MAAMC,OAAsB,uBAAO,CAAC;AAS9B,WAAU,MAAM,OAAgB,QAAgB,IAAE;AACtD,QAAI,OAAO,UAAU,WAAW;AAC9B,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,SAAS,gCAAgC,OAAO,KAAK;IACvE;AACA,WAAO;EACT;AAGA,WAAS,WAAWC,IAAkB;AACpC,QAAI,OAAOA,OAAM,UAAU;AACzB,UAAI,CAAC,SAASA,EAAC;AAAG,cAAM,IAAI,MAAM,mCAAmCA,EAAC;IACxE;AAAO,MAAAC,SAAQD,EAAC;AAChB,WAAOA;EACT;AASM,WAAU,oBAAoB,KAAoB;AACtD,UAAM,MAAM,WAAW,GAAG,EAAE,SAAS,EAAE;AACvC,WAAO,IAAI,SAAS,IAAI,MAAM,MAAM;EACtC;AAEM,WAAU,YAAY,KAAW;AACrC,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,8BAA8B,OAAO,GAAG;AACrF,WAAO,QAAQ,KAAKE,OAAM,OAAO,OAAO,GAAG;EAC7C;AAGM,WAAU,gBAAgB,OAAiB;AAC/C,WAAO,YAAYC,YAAY,KAAK,CAAC;EACvC;AACM,WAAU,gBAAgB,OAAiB;AAC/C,WAAO,YAAYA,YAAY,UAAUC,QAAQ,KAAK,CAAC,EAAE,QAAO,CAAE,CAAC;EACrE;AAEM,WAAU,gBAAgBC,IAAoB,KAAW;AAC7D,IAAAC,SAAQ,GAAG;AACX,IAAAD,KAAI,WAAWA,EAAC;AAChB,UAAM,MAAME,YAAYF,GAAE,SAAS,EAAE,EAAE,SAAS,MAAM,GAAG,GAAG,CAAC;AAC7D,QAAI,IAAI,WAAW;AAAK,YAAM,IAAI,MAAM,kBAAkB;AAC1D,WAAO;EACT;AACM,WAAU,gBAAgBA,IAAoB,KAAW;AAC7D,WAAO,gBAAgBA,IAAG,GAAG,EAAE,QAAO;EACxC;AAkBM,WAAU,UAAU,OAAiB;AACzC,WAAO,WAAW,KAAK,KAAK;EAC9B;AAoBA,MAAM,WAAW,CAACG,OAAc,OAAOA,OAAM,YAAYC,QAAOD;AAE1D,WAAU,QAAQA,IAAW,KAAa,KAAW;AACzD,WAAO,SAASA,EAAC,KAAK,SAAS,GAAG,KAAK,SAAS,GAAG,KAAK,OAAOA,MAAKA,KAAI;EAC1E;AAOM,WAAU,SAAS,OAAeA,IAAW,KAAa,KAAW;AAMzE,QAAI,CAAC,QAAQA,IAAG,KAAK,GAAG;AACtB,YAAM,IAAI,MAAM,oBAAoB,QAAQ,OAAO,MAAM,aAAa,MAAM,WAAWA,EAAC;EAC5F;AASM,WAAU,OAAOA,IAAS;AAC9B,QAAI;AACJ,SAAK,MAAM,GAAGA,KAAIC,MAAKD,OAAME,MAAK,OAAO;AAAE;AAC3C,WAAO;EACT;AAsBO,MAAM,UAAU,CAACC,QAAuBC,QAAO,OAAOD,EAAC,KAAKC;AAY7D,WAAU,eACd,SACA,UACA,QAA4D;AAE5D,IAAAC,SAAQ,SAAS,SAAS;AAC1B,IAAAA,SAAQ,UAAU,UAAU;AAC5B,QAAI,OAAO,WAAW;AAAY,YAAM,IAAI,MAAM,2BAA2B;AAC7E,UAAMC,OAAM,CAAC,QAA4B,IAAI,WAAW,GAAG;AAC3D,UAAM,OAAO,WAAW,GAAE;AAC1B,UAAM,QAAQ,WAAW,GAAG,CAAI;AAChC,UAAM,QAAQ,WAAW,GAAG,CAAI;AAChC,UAAM,gBAAgB;AAGtB,QAAIC,KAAID,KAAI,OAAO;AACnB,QAAIE,KAAIF,KAAI,OAAO;AACnB,QAAIG,KAAI;AACR,UAAM,QAAQ,MAAK;AACjB,MAAAF,GAAE,KAAK,CAAC;AACR,MAAAC,GAAE,KAAK,CAAC;AACR,MAAAC,KAAI;IACN;AACA,UAAMC,KAAI,IAAI,SAAuB,OAAOF,IAAGG,aAAaJ,IAAG,GAAG,IAAI,CAAC;AACvE,UAAM,SAAS,CAAC,OAAmB,SAAQ;AAEzC,MAAAC,KAAIE,GAAE,OAAO,IAAI;AACjB,MAAAH,KAAIG,GAAC;AACL,UAAI,KAAK,WAAW;AAAG;AACvB,MAAAF,KAAIE,GAAE,OAAO,IAAI;AACjB,MAAAH,KAAIG,GAAC;IACP;AACA,UAAM,MAAM,MAAK;AAEf,UAAID,QAAO;AAAe,cAAM,IAAI,MAAM,sCAAsC;AAChF,UAAI,MAAM;AACV,YAAM,MAAoB,CAAA;AAC1B,aAAO,MAAM,UAAU;AACrB,QAAAF,KAAIG,GAAC;AACL,cAAM,KAAKH,GAAE,MAAK;AAClB,YAAI,KAAK,EAAE;AACX,eAAOA,GAAE;MACX;AACA,aAAOI,aAAa,GAAG,GAAG;IAC5B;AACA,UAAM,WAAW,CAAC,MAAkB,SAAoB;AACtD,YAAK;AACL,aAAO,IAAI;AACX,UAAI,MAAqB;AACzB,aAAO,EAAE,MAAM,KAAK,IAAG,CAAE;AAAI,eAAM;AACnC,YAAK;AACL,aAAO;IACT;AACA,WAAO;EACT;AAEM,WAAU,eACd,QACA,SAAiC,CAAA,GACjC,YAAoC,CAAA,GAAE;AAEtC,QAAI,CAAC,UAAU,OAAO,WAAW;AAAU,YAAM,IAAI,MAAM,+BAA+B;AAE1F,aAAS,WAAW,WAAiB,cAAsB,OAAc;AACvE,YAAM,MAAM,OAAO,SAAS;AAC5B,UAAI,SAAS,QAAQ;AAAW;AAChC,YAAM,UAAU,OAAO;AACvB,UAAI,YAAY,gBAAgB,QAAQ;AACtC,cAAM,IAAI,MAAM,UAAU,SAAS,0BAA0B,YAAY,SAAS,OAAO,EAAE;IAC/F;AACA,UAAM,OAAO,CAACC,IAAkB,UAC9B,OAAO,QAAQA,EAAC,EAAE,QAAQ,CAAC,CAACJ,IAAGD,EAAC,MAAM,WAAWC,IAAGD,IAAG,KAAK,CAAC;AAC/D,SAAK,QAAQ,KAAK;AAClB,SAAK,WAAW,IAAI;EACtB;AAaM,WAAU,SACd,IAA6B;AAE7B,UAAM,MAAM,oBAAI,QAAO;AACvB,WAAO,CAAC,QAAW,SAAc;AAC/B,YAAM,MAAM,IAAI,IAAI,GAAG;AACvB,UAAI,QAAQ;AAAW,eAAO;AAC9B,YAAM,WAAW,GAAG,KAAK,GAAG,IAAI;AAChC,UAAI,IAAI,KAAK,QAAQ;AACrB,aAAO;IACT;EACF;;;AC7RA;AAmBA,MAAMM,OAAsB,uBAAO,CAAC;AAApC,MAAuCC,OAAsB,uBAAO,CAAC;AAArE,MAAwEC,OAAsB,uBAAO,CAAC;AAEtG,MAAM,MAAsB,uBAAO,CAAC;AAApC,MAAuC,MAAsB,uBAAO,CAAC;AAArE,MAAwE,MAAsB,uBAAO,CAAC;AAEtG,MAAMC,OAAsB,uBAAO,CAAC;AAApC,MAAuC,MAAsB,uBAAO,CAAC;AAArE,MAAwE,MAAsB,uBAAO,CAAC;AACtG,MAAM,OAAuB,uBAAO,EAAE;AAGhC,WAAU,IAAIC,IAAWC,IAAS;AACtC,UAAM,SAASD,KAAIC;AACnB,WAAO,UAAUL,OAAM,SAASK,KAAI;EACtC;AAYM,WAAU,KAAKC,IAAW,OAAe,QAAc;AAC3D,QAAI,MAAMA;AACV,WAAO,UAAUC,MAAK;AACpB,aAAO;AACP,aAAO;IACT;AACA,WAAO;EACT;AAMM,WAAUC,QAAO,QAAgB,QAAc;AACnD,QAAI,WAAWD;AAAK,YAAM,IAAI,MAAM,kCAAkC;AACtE,QAAI,UAAUA;AAAK,YAAM,IAAI,MAAM,4CAA4C,MAAM;AAErF,QAAIE,KAAI,IAAI,QAAQ,MAAM;AAC1B,QAAIC,KAAI;AAER,QAAIJ,KAAIC,MAAKI,KAAIC,MAAKC,KAAID,MAAKE,KAAIP;AACnC,WAAOE,OAAMF,MAAK;AAEhB,YAAMQ,KAAIL,KAAID;AACd,YAAMO,KAAIN,KAAID;AACd,YAAMQ,KAAIX,KAAIO,KAAIE;AAClB,YAAMG,KAAIP,KAAIG,KAAIC;AAElB,MAAAL,KAAID,IAAGA,KAAIO,IAAGV,KAAIO,IAAGF,KAAIG,IAAGD,KAAII,IAAGH,KAAII;IACzC;AACA,UAAMC,OAAMT;AACZ,QAAIS,SAAQP;AAAK,YAAM,IAAI,MAAM,wBAAwB;AACzD,WAAO,IAAIN,IAAG,MAAM;EACtB;AAEA,WAAS,eAAkB,IAAe,MAASY,IAAI;AACrD,QAAI,CAAC,GAAG,IAAI,GAAG,IAAI,IAAI,GAAGA,EAAC;AAAG,YAAM,IAAI,MAAM,yBAAyB;EACzE;AAMA,WAAS,UAAa,IAAeA,IAAI;AACvC,UAAM,UAAU,GAAG,QAAQN,QAAO;AAClC,UAAM,OAAO,GAAG,IAAIM,IAAG,MAAM;AAC7B,mBAAe,IAAI,MAAMA,EAAC;AAC1B,WAAO;EACT;AAEA,WAAS,UAAa,IAAeA,IAAI;AACvC,UAAM,UAAU,GAAG,QAAQ,OAAO;AAClC,UAAME,MAAK,GAAG,IAAIF,IAAGG,IAAG;AACxB,UAAMP,KAAI,GAAG,IAAIM,KAAI,MAAM;AAC3B,UAAM,KAAK,GAAG,IAAIF,IAAGJ,EAAC;AACtB,UAAMQ,KAAI,GAAG,IAAI,GAAG,IAAI,IAAID,IAAG,GAAGP,EAAC;AACnC,UAAM,OAAO,GAAG,IAAI,IAAI,GAAG,IAAIQ,IAAG,GAAG,GAAG,CAAC;AACzC,mBAAe,IAAI,MAAMJ,EAAC;AAC1B,WAAO;EACT;AAIA,WAAS,WAAWK,IAAS;AAC3B,UAAM,MAAM,MAAMA,EAAC;AACnB,UAAM,KAAK,cAAcA,EAAC;AAC1B,UAAM,KAAK,GAAG,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC;AACnC,UAAM,KAAK,GAAG,KAAK,EAAE;AACrB,UAAM,KAAK,GAAG,KAAK,IAAI,IAAI,EAAE,CAAC;AAC9B,UAAM,MAAMA,KAAIC,QAAO;AACvB,WAAO,CAAI,IAAeN,OAAQ;AAChC,UAAI,MAAM,GAAG,IAAIA,IAAG,EAAE;AACtB,UAAI,MAAM,GAAG,IAAI,KAAK,EAAE;AACxB,YAAM,MAAM,GAAG,IAAI,KAAK,EAAE;AAC1B,YAAM,MAAM,GAAG,IAAI,KAAK,EAAE;AAC1B,YAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAGA,EAAC;AAChC,YAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAGA,EAAC;AAChC,YAAM,GAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,YAAM,GAAG,KAAK,KAAK,KAAK,EAAE;AAC1B,YAAM,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,GAAGA,EAAC;AAChC,YAAM,OAAO,GAAG,KAAK,KAAK,KAAK,EAAE;AACjC,qBAAe,IAAI,MAAMA,EAAC;AAC1B,aAAO;IACT;EACF;AASM,WAAU,cAAcK,IAAS;AAGrC,QAAIA,KAAI;AAAK,YAAM,IAAI,MAAM,qCAAqC;AAElE,QAAIE,KAAIF,KAAIX;AACZ,QAAIc,KAAI;AACR,WAAOD,KAAIJ,SAAQd,MAAK;AACtB,MAAAkB,MAAKJ;AACL,MAAAK;IACF;AAGA,QAAI,IAAIL;AACR,UAAM,MAAM,MAAME,EAAC;AACnB,WAAO,WAAW,KAAK,CAAC,MAAM,GAAG;AAG/B,UAAI,MAAM;AAAM,cAAM,IAAI,MAAM,+CAA+C;IACjF;AAEA,QAAIG,OAAM;AAAG,aAAO;AAIpB,QAAI,KAAK,IAAI,IAAI,GAAGD,EAAC;AACrB,UAAM,UAAUA,KAAIb,QAAOS;AAC3B,WAAO,SAAS,YAAe,IAAeH,IAAI;AAChD,UAAI,GAAG,IAAIA,EAAC;AAAG,eAAOA;AAEtB,UAAI,WAAW,IAAIA,EAAC,MAAM;AAAG,cAAM,IAAI,MAAM,yBAAyB;AAGtE,UAAIS,KAAID;AACR,UAAIE,KAAI,GAAG,IAAI,GAAG,KAAK,EAAE;AACzB,UAAIC,KAAI,GAAG,IAAIX,IAAGO,EAAC;AACnB,UAAIK,KAAI,GAAG,IAAIZ,IAAG,MAAM;AAIxB,aAAO,CAAC,GAAG,IAAIW,IAAG,GAAG,GAAG,GAAG;AACzB,YAAI,GAAG,IAAIA,EAAC;AAAG,iBAAO,GAAG;AACzB,YAAIP,KAAI;AAGR,YAAI,QAAQ,GAAG,IAAIO,EAAC;AACpB,eAAO,CAAC,GAAG,IAAI,OAAO,GAAG,GAAG,GAAG;AAC7B,UAAAP;AACA,kBAAQ,GAAG,IAAI,KAAK;AACpB,cAAIA,OAAMK;AAAG,kBAAM,IAAI,MAAM,yBAAyB;QACxD;AAGA,cAAM,WAAWf,QAAO,OAAOe,KAAIL,KAAI,CAAC;AACxC,cAAMZ,KAAI,GAAG,IAAIkB,IAAG,QAAQ;AAG5B,QAAAD,KAAIL;AACJ,QAAAM,KAAI,GAAG,IAAIlB,EAAC;AACZ,QAAAmB,KAAI,GAAG,IAAIA,IAAGD,EAAC;AACf,QAAAE,KAAI,GAAG,IAAIA,IAAGpB,EAAC;MACjB;AACA,aAAOoB;IACT;EACF;AAaM,WAAU,OAAOP,IAAS;AAE9B,QAAIA,KAAI,QAAQ;AAAK,aAAO;AAE5B,QAAIA,KAAI,QAAQ;AAAK,aAAO;AAE5B,QAAIA,KAAI,SAAS;AAAK,aAAO,WAAWA,EAAC;AAEzC,WAAO,cAAcA,EAAC;EACxB;AAiDA,MAAM,eAAe;IACnB;IAAU;IAAW;IAAO;IAAO;IAAO;IAAQ;IAClD;IAAO;IAAO;IAAO;IAAO;IAAO;IACnC;IAAQ;IAAQ;IAAQ;;AAEpB,WAAU,cAAiB,OAAgB;AAC/C,UAAM,UAAU;MACd,OAAO;MACP,OAAO;MACP,MAAM;;AAER,UAAM,OAAO,aAAa,OAAO,CAAC,KAAK,QAAe;AACpD,UAAI,GAAG,IAAI;AACX,aAAO;IACT,GAAG,OAAO;AACV,mBAAe,OAAO,IAAI;AAI1B,WAAO;EACT;AAQM,WAAU,MAAS,IAAe,KAAQ,OAAa;AAC3D,QAAI,QAAQQ;AAAK,YAAM,IAAI,MAAM,yCAAyC;AAC1E,QAAI,UAAUA;AAAK,aAAO,GAAG;AAC7B,QAAI,UAAUC;AAAK,aAAO;AAC1B,QAAIC,KAAI,GAAG;AACX,QAAIC,KAAI;AACR,WAAO,QAAQH,MAAK;AAClB,UAAI,QAAQC;AAAK,QAAAC,KAAI,GAAG,IAAIA,IAAGC,EAAC;AAChC,MAAAA,KAAI,GAAG,IAAIA,EAAC;AACZ,gBAAUF;IACZ;AACA,WAAOC;EACT;AAOM,WAAU,cAAiB,IAAe,MAAW,WAAW,OAAK;AACzE,UAAM,WAAW,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,WAAW,GAAG,OAAO,MAAS;AAE3E,UAAM,gBAAgB,KAAK,OAAO,CAAC,KAAK,KAAKE,OAAK;AAChD,UAAI,GAAG,IAAI,GAAG;AAAG,eAAO;AACxB,eAASA,EAAC,IAAI;AACd,aAAO,GAAG,IAAI,KAAK,GAAG;IACxB,GAAG,GAAG,GAAG;AAET,UAAM,cAAc,GAAG,IAAI,aAAa;AAExC,SAAK,YAAY,CAAC,KAAK,KAAKA,OAAK;AAC/B,UAAI,GAAG,IAAI,GAAG;AAAG,eAAO;AACxB,eAASA,EAAC,IAAI,GAAG,IAAI,KAAK,SAASA,EAAC,CAAC;AACrC,aAAO,GAAG,IAAI,KAAK,GAAG;IACxB,GAAG,WAAW;AACd,WAAO;EACT;AAgBM,WAAU,WAAc,IAAeC,IAAI;AAG/C,UAAM,UAAU,GAAG,QAAQC,QAAOC;AAClC,UAAM,UAAU,GAAG,IAAIF,IAAG,MAAM;AAChC,UAAM,MAAM,GAAG,IAAI,SAAS,GAAG,GAAG;AAClC,UAAM,OAAO,GAAG,IAAI,SAAS,GAAG,IAAI;AACpC,UAAM,KAAK,GAAG,IAAI,SAAS,GAAG,IAAI,GAAG,GAAG,CAAC;AACzC,QAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;AAAI,YAAM,IAAI,MAAM,gCAAgC;AAC1E,WAAO,MAAM,IAAI,OAAO,IAAI;EAC9B;AAUM,WAAU,QAAQG,IAAW,YAAmB;AAEpD,QAAI,eAAe;AAAW,MAAAC,SAAQ,UAAU;AAChD,UAAM,cAAc,eAAe,SAAY,aAAaD,GAAE,SAAS,CAAC,EAAE;AAC1E,UAAM,cAAc,KAAK,KAAK,cAAc,CAAC;AAC7C,WAAO,EAAE,YAAY,aAAa,YAAW;EAC/C;AAWA,MAAM,SAAN,MAAY;IAUV,YAAY,OAAe,OAAkB,CAAA,GAAE;AATtC;AACA;AACA;AACA;AACA,kCAAOE;AACP,iCAAMC;AACN;AACD;AACS;;AAEf,UAAI,SAASD;AAAK,cAAM,IAAI,MAAM,4CAA4C,KAAK;AACnF,UAAI,cAAkC;AACtC,WAAK,OAAO;AACZ,UAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC5C,YAAI,OAAO,KAAK,SAAS;AAAU,wBAAc,KAAK;AACtD,YAAI,OAAO,KAAK,SAAS;AAAY,eAAK,OAAO,KAAK;AACtD,YAAI,OAAO,KAAK,SAAS;AAAW,eAAK,OAAO,KAAK;AACrD,YAAI,KAAK;AAAgB,eAAK,WAAW,KAAK,gBAAgB,MAAK;AACnE,YAAI,OAAO,KAAK,iBAAiB;AAAW,eAAK,OAAO,KAAK;MAC/D;AACA,YAAM,EAAE,YAAY,YAAW,IAAK,QAAQ,OAAO,WAAW;AAC9D,UAAI,cAAc;AAAM,cAAM,IAAI,MAAM,gDAAgD;AACxF,WAAK,QAAQ;AACb,WAAK,OAAO;AACZ,WAAK,QAAQ;AACb,WAAK,QAAQ;AACb,aAAO,kBAAkB,IAAI;IAC/B;IAEA,OAAO,KAAW;AAChB,aAAO,IAAI,KAAK,KAAK,KAAK;IAC5B;IACA,QAAQ,KAAW;AACjB,UAAI,OAAO,QAAQ;AACjB,cAAM,IAAI,MAAM,iDAAiD,OAAO,GAAG;AAC7E,aAAOA,QAAO,OAAO,MAAM,KAAK;IAClC;IACA,IAAI,KAAW;AACb,aAAO,QAAQA;IACjB;;IAEA,YAAY,KAAW;AACrB,aAAO,CAAC,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,GAAG;IAC3C;IACA,MAAM,KAAW;AACf,cAAQ,MAAMC,UAASA;IACzB;IACA,IAAI,KAAW;AACb,aAAO,IAAI,CAAC,KAAK,KAAK,KAAK;IAC7B;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,QAAQ;IACjB;IAEA,IAAI,KAAW;AACb,aAAO,IAAI,MAAM,KAAK,KAAK,KAAK;IAClC;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,IAAI,MAAM,KAAK,KAAK,KAAK;IAClC;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,IAAI,MAAM,KAAK,KAAK,KAAK;IAClC;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,IAAI,MAAM,KAAK,KAAK,KAAK;IAClC;IACA,IAAI,KAAa,OAAa;AAC5B,aAAO,MAAM,MAAM,KAAK,KAAK;IAC/B;IACA,IAAI,KAAa,KAAW;AAC1B,aAAO,IAAI,MAAMC,QAAO,KAAK,KAAK,KAAK,GAAG,KAAK,KAAK;IACtD;;IAGA,KAAK,KAAW;AACd,aAAO,MAAM;IACf;IACA,KAAK,KAAa,KAAW;AAC3B,aAAO,MAAM;IACf;IACA,KAAK,KAAa,KAAW;AAC3B,aAAO,MAAM;IACf;IACA,KAAK,KAAa,KAAW;AAC3B,aAAO,MAAM;IACf;IAEA,IAAI,KAAW;AACb,aAAOA,QAAO,KAAK,KAAK,KAAK;IAC/B;IACA,KAAK,KAAW;AAEd,UAAI,CAAC,KAAK;AAAO,aAAK,QAAQ,OAAO,KAAK,KAAK;AAC/C,aAAO,KAAK,MAAM,MAAM,GAAG;IAC7B;IACA,QAAQ,KAAW;AACjB,aAAO,KAAK,OAAO,gBAAgB,KAAK,KAAK,KAAK,IAAI,gBAAgB,KAAK,KAAK,KAAK;IACvF;IACA,UAAU,OAAmB,iBAAiB,OAAK;AACjD,MAAAC,QAAO,KAAK;AACZ,YAAM,EAAE,UAAU,gBAAgB,OAAO,MAAAC,OAAM,OAAO,MAAM,aAAY,IAAK;AAC7E,UAAI,gBAAgB;AAClB,YAAI,CAAC,eAAe,SAAS,MAAM,MAAM,KAAK,MAAM,SAAS,OAAO;AAClE,gBAAM,IAAI,MACR,+BAA+B,iBAAiB,iBAAiB,MAAM,MAAM;QAEjF;AACA,cAAM,SAAS,IAAI,WAAW,KAAK;AAEnC,eAAO,IAAI,OAAOA,QAAO,IAAI,OAAO,SAAS,MAAM,MAAM;AACzD,gBAAQ;MACV;AACA,UAAI,MAAM,WAAW;AACnB,cAAM,IAAI,MAAM,+BAA+B,QAAQ,iBAAiB,MAAM,MAAM;AACtF,UAAI,SAASA,QAAO,gBAAgB,KAAK,IAAI,gBAAgB,KAAK;AAClE,UAAI;AAAc,iBAAS,IAAI,QAAQ,KAAK;AAC5C,UAAI,CAAC;AACH,YAAI,CAAC,KAAK,QAAQ,MAAM;AACtB,gBAAM,IAAI,MAAM,kDAAkD;;AAGtE,aAAO;IACT;;IAEA,YAAY,KAAa;AACvB,aAAO,cAAc,MAAM,GAAG;IAChC;;;IAGA,KAAKC,IAAWC,IAAW,WAAkB;AAC3C,aAAO,YAAYA,KAAID;IACzB;;AAsBI,WAAU,MAAM,OAAe,OAAkB,CAAA,GAAE;AACvD,WAAO,IAAI,OAAO,OAAO,IAAI;EAC/B;AAkCM,WAAU,oBAAoB,YAAkB;AACpD,QAAI,OAAO,eAAe;AAAU,YAAM,IAAI,MAAM,4BAA4B;AAChF,UAAM,YAAY,WAAW,SAAS,CAAC,EAAE;AACzC,WAAO,KAAK,KAAK,YAAY,CAAC;EAChC;AASM,WAAU,iBAAiB,YAAkB;AACjD,UAAM,SAAS,oBAAoB,UAAU;AAC7C,WAAO,SAAS,KAAK,KAAK,SAAS,CAAC;EACtC;AAeM,WAAU,eAAe,KAAiB,YAAoBE,QAAO,OAAK;AAC9E,IAAAC,QAAO,GAAG;AACV,UAAM,MAAM,IAAI;AAChB,UAAM,WAAW,oBAAoB,UAAU;AAC/C,UAAM,SAAS,iBAAiB,UAAU;AAE1C,QAAI,MAAM,MAAM,MAAM,UAAU,MAAM;AACpC,YAAM,IAAI,MAAM,cAAc,SAAS,+BAA+B,GAAG;AAC3E,UAAM,MAAMD,QAAO,gBAAgB,GAAG,IAAI,gBAAgB,GAAG;AAE7D,UAAM,UAAU,IAAI,KAAK,aAAaE,IAAG,IAAIA;AAC7C,WAAOF,QAAO,gBAAgB,SAAS,QAAQ,IAAI,gBAAgB,SAAS,QAAQ;EACtF;;;AFnmBA,MAAMG,OAAsB,uBAAO,CAAC;AACpC,MAAMC,OAAsB,uBAAO,CAAC;AAqH9B,WAAU,SAAwC,WAAoB,MAAO;AACjF,UAAM,MAAM,KAAK,OAAM;AACvB,WAAO,YAAY,MAAM;EAC3B;AAQM,WAAU,WACdC,IACA,QAAW;AAEX,UAAM,aAAa,cACjBA,GAAE,IACF,OAAO,IAAI,CAACC,OAAMA,GAAE,CAAE,CAAC;AAEzB,WAAO,OAAO,IAAI,CAACA,IAAGC,OAAMF,GAAE,WAAWC,GAAE,SAAS,WAAWC,EAAC,CAAC,CAAC,CAAC;EACrE;AAEA,WAAS,UAAUC,IAAW,MAAY;AACxC,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,MAAK,KAAKA,KAAI;AAC5C,YAAM,IAAI,MAAM,uCAAuC,OAAO,cAAcA,EAAC;EACjF;AAWA,WAAS,UAAUA,IAAWC,aAAkB;AAC9C,cAAUD,IAAGC,WAAU;AACvB,UAAM,UAAU,KAAK,KAAKA,cAAaD,EAAC,IAAI;AAC5C,UAAM,aAAa,MAAMA,KAAI;AAC7B,UAAM,YAAY,KAAKA;AACvB,UAAM,OAAO,QAAQA,EAAC;AACtB,UAAM,UAAU,OAAOA,EAAC;AACxB,WAAO,EAAE,SAAS,YAAY,MAAM,WAAW,QAAO;EACxD;AAEA,WAAS,YAAYE,IAAWC,SAAgB,OAAY;AAC1D,UAAM,EAAE,YAAY,MAAM,WAAW,QAAO,IAAK;AACjD,QAAI,QAAQ,OAAOD,KAAI,IAAI;AAC3B,QAAI,QAAQA,MAAK;AAQjB,QAAI,QAAQ,YAAY;AAEtB,eAAS;AACT,eAASN;IACX;AACA,UAAM,cAAcO,UAAS;AAC7B,UAAM,SAAS,cAAc,KAAK,IAAI,KAAK,IAAI;AAC/C,UAAM,SAAS,UAAU;AACzB,UAAM,QAAQ,QAAQ;AACtB,UAAM,SAASA,UAAS,MAAM;AAC9B,UAAM,UAAU;AAChB,WAAO,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO;EACxD;AAkBA,MAAM,mBAAmB,oBAAI,QAAO;AACpC,MAAM,mBAAmB,oBAAI,QAAO;AAEpC,WAAS,KAAKC,IAAM;AAGlB,WAAO,iBAAiB,IAAIA,EAAC,KAAK;EACpC;AAEA,WAAS,QAAQC,IAAS;AACxB,QAAIA,OAAMC;AAAK,YAAM,IAAI,MAAM,cAAc;EAC/C;AAoBM,MAAOC,QAAP,MAAW;;IAOf,YAAYC,QAAW,MAAY;AANlB;AACA;AACA;AACR;AAIP,WAAK,OAAOA,OAAM;AAClB,WAAK,OAAOA,OAAM;AAClB,WAAK,KAAKA,OAAM;AAChB,WAAK,OAAO;IACd;;IAGA,cAAc,KAAeH,IAAWI,KAAc,KAAK,MAAI;AAC7D,UAAIC,KAAc;AAClB,aAAOL,KAAIC,MAAK;AACd,YAAID,KAAIM;AAAK,UAAAF,KAAIA,GAAE,IAAIC,EAAC;AACxB,QAAAA,KAAIA,GAAE,OAAM;AACZ,QAAAL,OAAMM;MACR;AACA,aAAOF;IACT;;;;;;;;;;;;;IAcQ,iBAAiB,OAAiBG,IAAS;AACjD,YAAM,EAAE,SAAS,WAAU,IAAK,UAAUA,IAAG,KAAK,IAAI;AACtD,YAAM,SAAqB,CAAA;AAC3B,UAAIH,KAAc;AAClB,UAAI,OAAOA;AACX,eAASI,UAAS,GAAGA,UAAS,SAASA,WAAU;AAC/C,eAAOJ;AACP,eAAO,KAAK,IAAI;AAEhB,iBAASK,KAAI,GAAGA,KAAI,YAAYA,MAAK;AACnC,iBAAO,KAAK,IAAIL,EAAC;AACjB,iBAAO,KAAK,IAAI;QAClB;AACA,QAAAA,KAAI,KAAK,OAAM;MACjB;AACA,aAAO;IACT;;;;;;;IAQQ,KAAKG,IAAW,aAAyBP,IAAS;AAExD,UAAI,CAAC,KAAK,GAAG,QAAQA,EAAC;AAAG,cAAM,IAAI,MAAM,gBAAgB;AAEzD,UAAII,KAAI,KAAK;AACb,UAAIM,KAAI,KAAK;AAMb,YAAM,KAAK,UAAUH,IAAG,KAAK,IAAI;AACjC,eAASC,UAAS,GAAGA,UAAS,GAAG,SAASA,WAAU;AAElD,cAAM,EAAE,OAAO,QAAQ,QAAQ,OAAO,QAAQ,QAAO,IAAK,YAAYR,IAAGQ,SAAQ,EAAE;AACnF,QAAAR,KAAI;AACJ,YAAI,QAAQ;AAGV,UAAAU,KAAIA,GAAE,IAAI,SAAS,QAAQ,YAAY,OAAO,CAAC,CAAC;QAClD,OAAO;AAEL,UAAAN,KAAIA,GAAE,IAAI,SAAS,OAAO,YAAY,MAAM,CAAC,CAAC;QAChD;MACF;AACA,cAAQJ,EAAC;AAIT,aAAO,EAAE,GAAAI,IAAG,GAAAM,GAAC;IACf;;;;;;IAOQ,WACNH,IACA,aACAP,IACA,MAAgB,KAAK,MAAI;AAEzB,YAAM,KAAK,UAAUO,IAAG,KAAK,IAAI;AACjC,eAASC,UAAS,GAAGA,UAAS,GAAG,SAASA,WAAU;AAClD,YAAIR,OAAMC;AAAK;AACf,cAAM,EAAE,OAAO,QAAQ,QAAQ,MAAK,IAAK,YAAYD,IAAGQ,SAAQ,EAAE;AAClE,QAAAR,KAAI;AACJ,YAAI,QAAQ;AAGV;QACF,OAAO;AACL,gBAAM,OAAO,YAAY,MAAM;AAC/B,gBAAM,IAAI,IAAI,QAAQ,KAAK,OAAM,IAAK,IAAI;QAC5C;MACF;AACA,cAAQA,EAAC;AACT,aAAO;IACT;IAEQ,eAAeO,IAAW,OAAiB,WAA4B;AAE7E,UAAI,OAAO,iBAAiB,IAAI,KAAK;AACrC,UAAI,CAAC,MAAM;AACT,eAAO,KAAK,iBAAiB,OAAOA,EAAC;AACrC,YAAIA,OAAM,GAAG;AAEX,cAAI,OAAO,cAAc;AAAY,mBAAO,UAAU,IAAI;AAC1D,2BAAiB,IAAI,OAAO,IAAI;QAClC;MACF;AACA,aAAO;IACT;IAEA,OACE,OACA,QACA,WAA4B;AAE5B,YAAMA,KAAI,KAAK,KAAK;AACpB,aAAO,KAAK,KAAKA,IAAG,KAAK,eAAeA,IAAG,OAAO,SAAS,GAAG,MAAM;IACtE;IAEA,OAAO,OAAiB,QAAgB,WAA8B,MAAe;AACnF,YAAMA,KAAI,KAAK,KAAK;AACpB,UAAIA,OAAM;AAAG,eAAO,KAAK,cAAc,OAAO,QAAQ,IAAI;AAC1D,aAAO,KAAK,WAAWA,IAAG,KAAK,eAAeA,IAAG,OAAO,SAAS,GAAG,QAAQ,IAAI;IAClF;;;;IAKA,YAAYR,IAAaQ,IAAS;AAChC,gBAAUA,IAAG,KAAK,IAAI;AACtB,uBAAiB,IAAIR,IAAGQ,EAAC;AACzB,uBAAiB,OAAOR,EAAC;IAC3B;IAEA,SAAS,KAAa;AACpB,aAAO,KAAK,GAAG,MAAM;IACvB;;AAOI,WAAU,cACdI,QACA,OACA,IACA,IAAU;AAEV,QAAI,MAAM;AACV,QAAI,KAAKA,OAAM;AACf,QAAI,KAAKA,OAAM;AACf,WAAO,KAAKF,QAAO,KAAKA,MAAK;AAC3B,UAAI,KAAKK;AAAK,aAAK,GAAG,IAAI,GAAG;AAC7B,UAAI,KAAKA;AAAK,aAAK,GAAG,IAAI,GAAG;AAC7B,YAAM,IAAI,OAAM;AAChB,aAAOA;AACP,aAAOA;IACT;AACA,WAAO,EAAE,IAAI,GAAE;EACjB;AAuJA,WAAS,YAAe,OAAe,OAAmBK,OAAc;AACtE,QAAI,OAAO;AACT,UAAI,MAAM,UAAU;AAAO,cAAM,IAAI,MAAM,gDAAgD;AAC3F,oBAAc,KAAK;AACnB,aAAO;IACT,OAAO;AACL,aAAO,MAAM,OAAO,EAAE,MAAAA,MAAI,CAAE;IAC9B;EACF;AAIM,WAAU,kBACd,MACA,OACA,YAA8B,CAAA,GAC9B,QAAgB;AAEhB,QAAI,WAAW;AAAW,eAAS,SAAS;AAC5C,QAAI,CAAC,SAAS,OAAO,UAAU;AAAU,YAAM,IAAI,MAAM,kBAAkB,IAAI,eAAe;AAC9F,eAAWC,MAAK,CAAC,KAAK,KAAK,GAAG,GAAY;AACxC,YAAM,MAAM,MAAMA,EAAC;AACnB,UAAI,EAAE,OAAO,QAAQ,YAAY,MAAMC;AACrC,cAAM,IAAI,MAAM,SAASD,EAAC,0BAA0B;IACxD;AACA,UAAM,KAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,UAAME,MAAK,YAAY,MAAM,GAAG,UAAU,IAAI,MAAM;AACpD,UAAMC,MAAgB,SAAS,gBAAgB,MAAM;AACrD,UAAM,SAAS,CAAC,MAAM,MAAM,KAAKA,GAAE;AACnC,eAAWH,MAAK,QAAQ;AAEtB,UAAI,CAAC,GAAG,QAAQ,MAAMA,EAAC,CAAC;AACtB,cAAM,IAAI,MAAM,SAASA,EAAC,0CAA0C;IACxE;AACA,YAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,GAAI,KAAK,CAAC;AAC9C,WAAO,EAAE,OAAO,IAAI,IAAAE,IAAE;EACxB;AAMM,WAAU,aACd,iBACAE,eAAoC;AAEpC,WAAO,SAAS,OAAO,MAAiB;AACtC,YAAM,YAAY,gBAAgB,IAAI;AACtC,aAAO,EAAE,WAAW,WAAWA,cAAa,SAAS,EAAC;IACxD;EACF;;;AGxnBA;;;ACAA;AAOM,MAAO,QAAP,MAAY;IAQhB,YAAY,MAAa,KAAe;AAPxC;AACA;AACA;AACA;AACQ,sCAAW;AACX,uCAAY;AAGlB,MAAAC,OAAM,IAAI;AACV,MAAAC,QAAO,KAAK,QAAW,KAAK;AAC5B,WAAK,QAAQ,KAAK,OAAM;AACxB,UAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,cAAM,IAAI,MAAM,qDAAqD;AACvE,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,YAAY,KAAK,MAAM;AAC5B,YAAM,WAAW,KAAK;AACtB,YAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,UAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,eAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK;AAC/C,WAAK,MAAM,OAAO,GAAG;AAErB,WAAK,QAAQ,KAAK,OAAM;AAExB,eAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK,KAAO;AACtD,WAAK,MAAM,OAAO,GAAG;AACrB,MAAAC,OAAM,GAAG;IACX;IACA,OAAO,KAAe;AACpB,MAAAC,SAAQ,IAAI;AACZ,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAA,SAAQ,IAAI;AACZ,MAAAH,QAAO,KAAK,KAAK,WAAW,QAAQ;AACpC,WAAK,WAAW;AAChB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,QAAO;IACd;IACA,SAAM;AACJ,YAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,WAAK,WAAW,GAAG;AACnB,aAAO;IACT;IACA,WAAW,IAAa;AAEtB,kBAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,YAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,WAAK;AACL,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;IACA,UAAO;AACL,WAAK,YAAY;AACjB,WAAK,MAAM,QAAO;AAClB,WAAK,MAAM,QAAO;IACpB;;AAaK,MAAMI,QAGT,CAAC,MAAa,KAAiB,YACjC,IAAI,MAAW,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AAClD,EAAAA,MAAK,SAAS,CAAC,MAAa,QAAoB,IAAI,MAAW,MAAM,GAAG;;;ADOxE,MAAM,aAAa,CAAC,KAAa,SAAiB,OAAO,OAAO,IAAI,MAAM,CAAC,OAAOC,QAAO;AAOnF,WAAU,iBAAiBC,IAAW,OAAkBC,IAAS;AAIrE,UAAM,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI;AAC7B,UAAM,KAAK,WAAW,KAAKD,IAAGC,EAAC;AAC/B,UAAM,KAAK,WAAW,CAAC,KAAKD,IAAGC,EAAC;AAGhC,QAAI,KAAKD,KAAI,KAAK,KAAK,KAAK;AAC5B,QAAIE,MAAK,CAAC,KAAK,KAAK,KAAK;AACzB,UAAM,QAAQ,KAAKC;AACnB,UAAM,QAAQD,MAAKC;AACnB,QAAI;AAAO,WAAK,CAAC;AACjB,QAAI;AAAO,MAAAD,MAAK,CAACA;AAGjB,UAAM,UAAU,QAAQ,KAAK,KAAK,OAAOD,EAAC,IAAI,CAAC,CAAC,IAAIG;AACpD,QAAI,KAAKD,QAAO,MAAM,WAAWD,MAAKC,QAAOD,OAAM,SAAS;AAC1D,YAAM,IAAI,MAAM,2CAA2CF,EAAC;IAC9D;AACA,WAAO,EAAE,OAAO,IAAI,OAAO,IAAAE,IAAE;EAC/B;AA+DA,WAAS,kBAAkB,QAAc;AACvC,QAAI,CAAC,CAAC,WAAW,aAAa,KAAK,EAAE,SAAS,MAAM;AAClD,YAAM,IAAI,MAAM,2DAA2D;AAC7E,WAAO;EACT;AAEA,WAAS,gBACP,MACA,KAAM;AAEN,UAAM,QAAuB,CAAA;AAC7B,aAAS,WAAW,OAAO,KAAK,GAAG,GAAG;AAEpC,YAAM,OAAO,IAAI,KAAK,OAAO,MAAM,SAAY,IAAI,OAAO,IAAI,KAAK,OAAO;IAC5E;AACA,UAAM,MAAM,MAAO,MAAM;AACzB,UAAM,MAAM,SAAU,SAAS;AAC/B,QAAI,MAAM,WAAW;AAAW,wBAAkB,MAAM,MAAM;AAC9D,WAAO;EACT;AAqHM,MAAO,SAAP,cAAsB,MAAK;IAC/B,YAAYG,KAAI,IAAE;AAChB,YAAMA,EAAC;IACT;;AA6BK,MAAM,MAAY;;IAEvB,KAAK;;IAEL,MAAM;MACJ,QAAQ,CAAC,KAAa,SAAwB;AAC5C,cAAM,EAAE,KAAKC,GAAC,IAAK;AACnB,YAAI,MAAM,KAAK,MAAM;AAAK,gBAAM,IAAIA,GAAE,uBAAuB;AAC7D,YAAI,KAAK,SAAS;AAAG,gBAAM,IAAIA,GAAE,2BAA2B;AAC5D,cAAM,UAAU,KAAK,SAAS;AAC9B,cAAM,MAAM,oBAAoB,OAAO;AACvC,YAAK,IAAI,SAAS,IAAK;AAAa,gBAAM,IAAIA,GAAE,sCAAsC;AAEtF,cAAM,SAAS,UAAU,MAAM,oBAAqB,IAAI,SAAS,IAAK,GAAW,IAAI;AACrF,cAAMC,KAAI,oBAAoB,GAAG;AACjC,eAAOA,KAAI,SAAS,MAAM;MAC5B;;MAEA,OAAO,KAAa,MAAgB;AAClC,cAAM,EAAE,KAAKD,GAAC,IAAK;AACnB,YAAI,MAAM;AACV,YAAI,MAAM,KAAK,MAAM;AAAK,gBAAM,IAAIA,GAAE,uBAAuB;AAC7D,YAAI,KAAK,SAAS,KAAK,KAAK,KAAK,MAAM;AAAK,gBAAM,IAAIA,GAAE,uBAAuB;AAC/E,cAAM,QAAQ,KAAK,KAAK;AACxB,cAAM,SAAS,CAAC,EAAE,QAAQ;AAC1B,YAAI,SAAS;AACb,YAAI,CAAC;AAAQ,mBAAS;aACjB;AAEH,gBAAM,SAAS,QAAQ;AACvB,cAAI,CAAC;AAAQ,kBAAM,IAAIA,GAAE,mDAAmD;AAC5E,cAAI,SAAS;AAAG,kBAAM,IAAIA,GAAE,0CAA0C;AACtE,gBAAM,cAAc,KAAK,SAAS,KAAK,MAAM,MAAM;AACnD,cAAI,YAAY,WAAW;AAAQ,kBAAM,IAAIA,GAAE,uCAAuC;AACtF,cAAI,YAAY,CAAC,MAAM;AAAG,kBAAM,IAAIA,GAAE,sCAAsC;AAC5E,qBAAWE,MAAK;AAAa,qBAAU,UAAU,IAAKA;AACtD,iBAAO;AACP,cAAI,SAAS;AAAK,kBAAM,IAAIF,GAAE,wCAAwC;QACxE;AACA,cAAMG,KAAI,KAAK,SAAS,KAAK,MAAM,MAAM;AACzC,YAAIA,GAAE,WAAW;AAAQ,gBAAM,IAAIH,GAAE,gCAAgC;AACrE,eAAO,EAAE,GAAAG,IAAG,GAAG,KAAK,SAAS,MAAM,MAAM,EAAC;MAC5C;;;;;;IAMF,MAAM;MACJ,OAAO,KAAW;AAChB,cAAM,EAAE,KAAKH,GAAC,IAAK;AACnB,YAAI,MAAMH;AAAK,gBAAM,IAAIG,GAAE,4CAA4C;AACvE,YAAI,MAAM,oBAAoB,GAAG;AAEjC,YAAI,OAAO,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI;AAAQ,gBAAM,OAAO;AACvD,YAAI,IAAI,SAAS;AAAG,gBAAM,IAAIA,GAAE,gDAAgD;AAChF,eAAO;MACT;MACA,OAAO,MAAgB;AACrB,cAAM,EAAE,KAAKA,GAAC,IAAK;AACnB,YAAI,KAAK,CAAC,IAAI;AAAa,gBAAM,IAAIA,GAAE,qCAAqC;AAC5E,YAAI,KAAK,CAAC,MAAM,KAAQ,EAAE,KAAK,CAAC,IAAI;AAClC,gBAAM,IAAIA,GAAE,qDAAqD;AACnE,eAAO,gBAAgB,IAAI;MAC7B;;IAEF,MAAM,OAAiB;AAErB,YAAM,EAAE,KAAKA,IAAG,MAAM,KAAK,MAAM,IAAG,IAAK;AACzC,YAAM,OAAOI,QAAO,OAAO,QAAW,WAAW;AACjD,YAAM,EAAE,GAAG,UAAU,GAAG,aAAY,IAAK,IAAI,OAAO,IAAM,IAAI;AAC9D,UAAI,aAAa;AAAQ,cAAM,IAAIJ,GAAE,6CAA6C;AAClF,YAAM,EAAE,GAAG,QAAQ,GAAG,WAAU,IAAK,IAAI,OAAO,GAAM,QAAQ;AAC9D,YAAM,EAAE,GAAG,QAAQ,GAAG,WAAU,IAAK,IAAI,OAAO,GAAM,UAAU;AAChE,UAAI,WAAW;AAAQ,cAAM,IAAIA,GAAE,6CAA6C;AAChF,aAAO,EAAE,GAAG,IAAI,OAAO,MAAM,GAAG,GAAG,IAAI,OAAO,MAAM,EAAC;IACvD;IACA,WAAW,KAA6B;AACtC,YAAM,EAAE,MAAM,KAAK,MAAM,IAAG,IAAK;AACjC,YAAM,KAAK,IAAI,OAAO,GAAM,IAAI,OAAO,IAAI,CAAC,CAAC;AAC7C,YAAM,KAAK,IAAI,OAAO,GAAM,IAAI,OAAO,IAAI,CAAC,CAAC;AAC7C,YAAM,MAAM,KAAK;AACjB,aAAO,IAAI,OAAO,IAAM,GAAG;IAC7B;;AAKF,MAAMH,OAAM,OAAO,CAAC;AAApB,MAAuBC,OAAM,OAAO,CAAC;AAArC,MAAwCL,OAAM,OAAO,CAAC;AAAtD,MAAyDY,OAAM,OAAO,CAAC;AAAvE,MAA0EC,OAAM,OAAO,CAAC;AAqBlF,WAAU,YACd,QACA,YAAqC,CAAA,GAAE;AAEvC,UAAM,YAAY,kBAAkB,eAAe,QAAQ,SAAS;AACpE,UAAM,EAAE,IAAI,IAAAC,IAAE,IAAK;AACnB,QAAI,QAAQ,UAAU;AACtB,UAAM,EAAE,GAAG,UAAU,GAAG,YAAW,IAAK;AACxC,mBACE,WACA,CAAA,GACA;MACE,oBAAoB;MACpB,eAAe;MACf,eAAe;MACf,WAAW;MACX,SAAS;MACT,MAAM;KACP;AAGH,UAAM,EAAE,KAAI,IAAK;AACjB,QAAI,MAAM;AAER,UAAI,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK,OAAO,KAAK,SAAS,YAAY,CAAC,MAAM,QAAQ,KAAK,OAAO,GAAG;AACrF,cAAM,IAAI,MAAM,4DAA4D;MAC9E;IACF;AAEA,UAAM,UAAU,YAAY,IAAIA,GAAE;AAElC,aAAS,+BAA4B;AACnC,UAAI,CAAC,GAAG;AAAO,cAAM,IAAI,MAAM,4DAA4D;IAC7F;AAGA,aAAS,aACP,IACA,OACA,cAAqB;AAErB,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAC,IAAK,MAAM,SAAQ;AAC/B,YAAM,KAAK,GAAG,QAAQD,EAAC;AACvB,YAAM,cAAc,cAAc;AAClC,UAAI,cAAc;AAChB,qCAA4B;AAC5B,cAAM,WAAW,CAAC,GAAG,MAAOC,EAAC;AAC7B,eAAOC,aAAY,QAAQ,QAAQ,GAAG,EAAE;MAC1C,OAAO;AACL,eAAOA,aAAY,WAAW,GAAG,CAAI,GAAG,IAAI,GAAG,QAAQD,EAAC,CAAC;MAC3D;IACF;AACA,aAAS,eAAe,OAAiB;AACvC,MAAAL,QAAO,OAAO,QAAW,OAAO;AAChC,YAAM,EAAE,WAAW,MAAM,uBAAuB,OAAM,IAAK;AAC3D,YAAM,SAAS,MAAM;AACrB,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,OAAO,MAAM,SAAS,CAAC;AAE7B,UAAI,WAAW,SAAS,SAAS,KAAQ,SAAS,IAAO;AACvD,cAAMI,KAAI,GAAG,UAAU,IAAI;AAC3B,YAAI,CAAC,GAAG,QAAQA,EAAC;AAAG,gBAAM,IAAI,MAAM,qCAAqC;AACzE,cAAM,KAAK,oBAAoBA,EAAC;AAChC,YAAIC;AACJ,YAAI;AACF,UAAAA,KAAI,GAAG,KAAK,EAAE;QAChB,SAAS,WAAW;AAClB,gBAAME,OAAM,qBAAqB,QAAQ,OAAO,UAAU,UAAU;AACpE,gBAAM,IAAI,MAAM,2CAA2CA,IAAG;QAChE;AACA,qCAA4B;AAC5B,cAAM,QAAQ,GAAG,MAAOF,EAAC;AACzB,cAAM,SAAS,OAAO,OAAO;AAC7B,YAAI,UAAU;AAAO,UAAAA,KAAI,GAAG,IAAIA,EAAC;AACjC,eAAO,EAAE,GAAAD,IAAG,GAAAC,GAAC;MACf,WAAW,WAAW,UAAU,SAAS,GAAM;AAE7C,cAAMG,KAAI,GAAG;AACb,cAAMJ,KAAI,GAAG,UAAU,KAAK,SAAS,GAAGI,EAAC,CAAC;AAC1C,cAAMH,KAAI,GAAG,UAAU,KAAK,SAASG,IAAGA,KAAI,CAAC,CAAC;AAC9C,YAAI,CAAC,UAAUJ,IAAGC,EAAC;AAAG,gBAAM,IAAI,MAAM,4BAA4B;AAClE,eAAO,EAAE,GAAAD,IAAG,GAAAC,GAAC;MACf,OAAO;AACL,cAAM,IAAI,MACR,yBAAyB,MAAM,yBAAyB,IAAI,oBAAoB,MAAM,EAAE;MAE5F;IACF;AAEA,UAAM,cAAc,UAAU,WAAW;AACzC,UAAM,cAAc,UAAU,aAAa;AAC3C,aAAS,oBAAoBD,IAAI;AAC/B,YAAMK,MAAK,GAAG,IAAIL,EAAC;AACnB,YAAM,KAAK,GAAG,IAAIK,KAAIL,EAAC;AACvB,aAAO,GAAG,IAAI,GAAG,IAAI,IAAI,GAAG,IAAIA,IAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;IACvD;AAIA,aAAS,UAAUA,IAAMC,IAAI;AAC3B,YAAM,OAAO,GAAG,IAAIA,EAAC;AACrB,YAAM,QAAQ,oBAAoBD,EAAC;AACnC,aAAO,GAAG,IAAI,MAAM,KAAK;IAC3B;AAIA,QAAI,CAAC,UAAU,MAAM,IAAI,MAAM,EAAE;AAAG,YAAM,IAAI,MAAM,mCAAmC;AAIvF,UAAM,OAAO,GAAG,IAAI,GAAG,IAAI,MAAM,GAAGH,IAAG,GAAGC,IAAG;AAC7C,UAAM,QAAQ,GAAG,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC;AAChD,QAAI,GAAG,IAAI,GAAG,IAAI,MAAM,KAAK,CAAC;AAAG,YAAM,IAAI,MAAM,0BAA0B;AAG3E,aAAS,OAAO,OAAeX,IAAM,UAAU,OAAK;AAClD,UAAI,CAAC,GAAG,QAAQA,EAAC,KAAM,WAAW,GAAG,IAAIA,EAAC;AAAI,cAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE;AAC7F,aAAOA;IACT;AAEA,aAAS,UAAU,OAAc;AAC/B,UAAI,EAAE,iBAAiBmB;AAAQ,cAAM,IAAI,MAAM,4BAA4B;IAC7E;AAEA,aAAS,iBAAiBpB,IAAS;AACjC,UAAI,CAAC,QAAQ,CAAC,KAAK;AAAS,cAAM,IAAI,MAAM,SAAS;AACrD,aAAO,iBAAiBA,IAAG,KAAK,SAASa,IAAG,KAAK;IACnD;AAOA,UAAM,eAAe,SAAS,CAACQ,IAAU,OAA0B;AACjE,YAAM,EAAE,GAAG,GAAAC,IAAG,EAAC,IAAKD;AAEpB,UAAI,GAAG,IAAI,GAAG,GAAG,GAAG;AAAG,eAAO,EAAE,GAAG,GAAG,GAAGC,GAAC;AAC1C,YAAM,MAAMD,GAAE,IAAG;AAGjB,UAAI,MAAM;AAAM,aAAK,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;AAC5C,YAAMP,KAAI,GAAG,IAAI,GAAG,EAAE;AACtB,YAAMC,KAAI,GAAG,IAAIO,IAAG,EAAE;AACtB,YAAM,KAAK,GAAG,IAAI,GAAG,EAAE;AACvB,UAAI;AAAK,eAAO,EAAE,GAAG,GAAG,MAAM,GAAG,GAAG,KAAI;AACxC,UAAI,CAAC,GAAG,IAAI,IAAI,GAAG,GAAG;AAAG,cAAM,IAAI,MAAM,kBAAkB;AAC3D,aAAO,EAAE,GAAAR,IAAG,GAAAC,GAAC;IACf,CAAC;AAGD,UAAM,kBAAkB,SAAS,CAACM,OAAY;AAC5C,UAAIA,GAAE,IAAG,GAAI;AAIX,YAAI,UAAU,sBAAsB,CAAC,GAAG,IAAIA,GAAE,CAAC;AAAG;AAClD,cAAM,IAAI,MAAM,iBAAiB;MACnC;AAEA,YAAM,EAAE,GAAAP,IAAG,GAAAC,GAAC,IAAKM,GAAE,SAAQ;AAC3B,UAAI,CAAC,GAAG,QAAQP,EAAC,KAAK,CAAC,GAAG,QAAQC,EAAC;AAAG,cAAM,IAAI,MAAM,sCAAsC;AAC5F,UAAI,CAAC,UAAUD,IAAGC,EAAC;AAAG,cAAM,IAAI,MAAM,mCAAmC;AACzE,UAAI,CAACM,GAAE,cAAa;AAAI,cAAM,IAAI,MAAM,wCAAwC;AAChF,aAAO;IACT,CAAC;AAED,aAAS,WACP,UACA,KACA,KACA,OACA,OAAc;AAEd,YAAM,IAAID,OAAM,GAAG,IAAI,IAAI,GAAG,QAAQ,GAAG,IAAI,GAAG,IAAI,CAAC;AACrD,YAAM,SAAS,OAAO,GAAG;AACzB,YAAM,SAAS,OAAO,GAAG;AACzB,aAAO,IAAI,IAAI,GAAG;IACpB;AAOA,UAAMG,UAAN,MAAMA,QAAK;;MAeT,YAAY,GAAMD,IAAM,GAAI;AALnB;AACA;AACA;AAIP,aAAK,IAAI,OAAO,KAAK,CAAC;AACtB,aAAK,IAAI,OAAO,KAAKA,IAAG,IAAI;AAC5B,aAAK,IAAI,OAAO,KAAK,CAAC;AACtB,eAAO,OAAO,IAAI;MACpB;MAEA,OAAO,QAAK;AACV,eAAO;MACT;;MAGA,OAAO,WAAWD,IAAiB;AACjC,cAAM,EAAE,GAAAP,IAAG,GAAAC,GAAC,IAAKM,MAAK,CAAA;AACtB,YAAI,CAACA,MAAK,CAAC,GAAG,QAAQP,EAAC,KAAK,CAAC,GAAG,QAAQC,EAAC;AAAG,gBAAM,IAAI,MAAM,sBAAsB;AAClF,YAAIM,cAAaE;AAAO,gBAAM,IAAI,MAAM,8BAA8B;AAEtE,YAAI,GAAG,IAAIT,EAAC,KAAK,GAAG,IAAIC,EAAC;AAAG,iBAAOQ,QAAM;AACzC,eAAO,IAAIA,QAAMT,IAAGC,IAAG,GAAG,GAAG;MAC/B;MAEA,OAAO,UAAU,OAAiB;AAChC,cAAMS,KAAID,QAAM,WAAW,YAAYb,QAAO,OAAO,QAAW,OAAO,CAAC,CAAC;AACzE,QAAAc,GAAE,eAAc;AAChB,eAAOA;MACT;MAEA,OAAO,QAAQ,KAAW;AACxB,eAAOD,QAAM,UAAUE,YAAW,GAAG,CAAC;MACxC;MAEA,IAAI,IAAC;AACH,eAAO,KAAK,SAAQ,EAAG;MACzB;MACA,IAAI,IAAC;AACH,eAAO,KAAK,SAAQ,EAAG;MACzB;;;;;;;MAQA,WAAW,aAAqB,GAAG,SAAS,MAAI;AAC9C,aAAK,YAAY,MAAM,UAAU;AACjC,YAAI,CAAC;AAAQ,eAAK,SAASd,IAAG;AAC9B,eAAO;MACT;;;MAIA,iBAAc;AACZ,wBAAgB,IAAI;MACtB;MAEA,WAAQ;AACN,cAAM,EAAE,GAAAI,GAAC,IAAK,KAAK,SAAQ;AAC3B,YAAI,CAAC,GAAG;AAAO,gBAAM,IAAI,MAAM,6BAA6B;AAC5D,eAAO,CAAC,GAAG,MAAMA,EAAC;MACpB;;MAGA,OAAO,OAAY;AACjB,kBAAU,KAAK;AACf,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,cAAM,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AAChD,cAAM,KAAK,GAAG,IAAI,GAAG,IAAI,IAAI,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AAChD,eAAO,MAAM;MACf;;MAGA,SAAM;AACJ,eAAO,IAAIQ,QAAM,KAAK,GAAG,GAAG,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;MACjD;;;;;MAMA,SAAM;AACJ,cAAM,EAAE,GAAAG,IAAG,GAAAlB,GAAC,IAAK;AACjB,cAAM,KAAK,GAAG,IAAIA,IAAGG,IAAG;AACxB,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAI,KAAK,GAAG,MAAM,KAAK,GAAG,MAAM,KAAK,GAAG;AACxC,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIe,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIA,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIA,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,eAAO,IAAIH,QAAM,IAAI,IAAI,EAAE;MAC7B;;;;;MAMA,IAAI,OAAY;AACd,kBAAU,KAAK;AACf,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,cAAM,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,GAAE,IAAK;AAChC,YAAI,KAAK,GAAG,MAAM,KAAK,GAAG,MAAM,KAAK,GAAG;AACxC,cAAMG,KAAI,MAAM;AAChB,cAAM,KAAK,GAAG,IAAI,MAAM,GAAGf,IAAG;AAC9B,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,YAAI,KAAK,GAAG,IAAI,IAAI,EAAE;AACtB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIe,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIA,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAIA,IAAG,EAAE;AACjB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,aAAK,GAAG,IAAI,IAAI,EAAE;AAClB,eAAO,IAAIH,QAAM,IAAI,IAAI,EAAE;MAC7B;MAEA,SAAS,OAAY;AACnB,eAAO,KAAK,IAAI,MAAM,OAAM,CAAE;MAChC;MAEA,MAAG;AACD,eAAO,KAAK,OAAOA,QAAM,IAAI;MAC/B;;;;;;;;;;MAWA,SAAS,QAAc;AACrB,cAAM,EAAE,MAAAI,MAAI,IAAK;AACjB,YAAI,CAACd,IAAG,YAAY,MAAM;AAAG,gBAAM,IAAI,MAAM,8BAA8B;AAC3E,YAAI,OAAc;AAClB,cAAM,MAAM,CAACZ,OAAc,KAAK,OAAO,MAAMA,IAAG,CAACoB,OAAM,WAAWE,SAAOF,EAAC,CAAC;AAE3E,YAAIM,OAAM;AACR,gBAAM,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,iBAAiB,MAAM;AACxD,gBAAM,EAAE,GAAG,KAAK,GAAG,IAAG,IAAK,IAAI,EAAE;AACjC,gBAAM,EAAE,GAAG,KAAK,GAAG,IAAG,IAAK,IAAI,EAAE;AACjC,iBAAO,IAAI,IAAI,GAAG;AAClB,kBAAQ,WAAWA,MAAK,MAAM,KAAK,KAAK,OAAO,KAAK;QACtD,OAAO;AACL,gBAAM,EAAE,GAAAN,IAAG,GAAAO,GAAC,IAAK,IAAI,MAAM;AAC3B,kBAAQP;AACR,iBAAOO;QACT;AAEA,eAAO,WAAWL,SAAO,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC;MAC3C;;;;;;MAOA,eAAe,IAAU;AACvB,cAAM,EAAE,MAAAI,MAAI,IAAK;AACjB,cAAMN,KAAI;AACV,YAAI,CAACR,IAAG,QAAQ,EAAE;AAAG,gBAAM,IAAI,MAAM,8BAA8B;AACnE,YAAI,OAAOV,QAAOkB,GAAE,IAAG;AAAI,iBAAOE,QAAM;AACxC,YAAI,OAAOnB;AAAK,iBAAOiB;AACvB,YAAI,KAAK,SAAS,IAAI;AAAG,iBAAO,KAAK,SAAS,EAAE;AAGhD,YAAIM,OAAM;AACR,gBAAM,EAAE,OAAO,IAAI,OAAO,GAAE,IAAK,iBAAiB,EAAE;AACpD,gBAAM,EAAE,IAAI,IAAAE,IAAE,IAAK,cAAcN,SAAOF,IAAG,IAAI,EAAE;AACjD,iBAAO,WAAWM,MAAK,MAAM,IAAIE,KAAI,OAAO,KAAK;QACnD,OAAO;AACL,iBAAO,KAAK,OAAOR,IAAG,EAAE;QAC1B;MACF;;;;;MAMA,SAAS,WAAa;AACpB,eAAO,aAAa,MAAM,SAAS;MACrC;;;;;MAMA,gBAAa;AACX,cAAM,EAAE,cAAa,IAAK;AAC1B,YAAI,aAAajB;AAAK,iBAAO;AAC7B,YAAI;AAAe,iBAAO,cAAcmB,SAAO,IAAI;AACnD,eAAO,KAAK,OAAO,MAAM,WAAW,EAAE,IAAG;MAC3C;MAEA,gBAAa;AACX,cAAM,EAAE,cAAa,IAAK;AAC1B,YAAI,aAAanB;AAAK,iBAAO;AAC7B,YAAI;AAAe,iBAAO,cAAcmB,SAAO,IAAI;AACnD,eAAO,KAAK,eAAe,QAAQ;MACrC;MAEA,eAAY;AAEV,eAAO,KAAK,eAAe,QAAQ,EAAE,IAAG;MAC1C;MAEA,QAAQ,eAAe,MAAI;AACzB,cAAM,cAAc,cAAc;AAClC,aAAK,eAAc;AACnB,eAAO,YAAYA,SAAO,MAAM,YAAY;MAC9C;MAEA,MAAM,eAAe,MAAI;AACvB,eAAOO,YAAW,KAAK,QAAQ,YAAY,CAAC;MAC9C;MAEA,WAAQ;AACN,eAAO,UAAU,KAAK,IAAG,IAAK,SAAS,KAAK,MAAK,CAAE;MACrD;;AAnSA;kBAFIP,SAEY,QAAO,IAAIA,QAAM,MAAM,IAAI,MAAM,IAAI,GAAG,GAAG;AAE3D;kBAJIA,SAIY,QAAO,IAAIA,QAAM,GAAG,MAAM,GAAG,KAAK,GAAG,IAAI;AAEzD;;kBANIA,SAMY,MAAK;AAErB;kBARIA,SAQY,MAAKV;AARvB,QAAMO,SAANG;AAuSA,UAAM,OAAOV,IAAG;AAChB,UAAM,OAAO,IAAIkB,MAAKX,QAAO,UAAU,OAAO,KAAK,KAAK,OAAO,CAAC,IAAI,IAAI;AACxE,IAAAA,OAAM,KAAK,WAAW,CAAC;AACvB,WAAOA;EACT;AAqBA,WAAS,QAAQ,UAAiB;AAChC,WAAO,WAAW,GAAG,WAAW,IAAO,CAAI;EAC7C;AAuIA,WAAS,YAAe,IAAeY,KAAkB;AACvD,WAAO;MACL,WAAWA,IAAG;MACd,WAAW,IAAI,GAAG;MAClB,uBAAuB,IAAI,IAAI,GAAG;MAClC,oBAAoB;MACpB,WAAW,IAAIA,IAAG;;EAEtB;AAMM,WAAU,KACdC,QACA,WAAmE,CAAA,GAAE;AAErE,UAAM,EAAE,IAAAD,IAAE,IAAKC;AACf,UAAM,eAAe,SAAS,eAAeC;AAC7C,UAAM,UAAU,OAAO,OAAO,YAAYD,OAAM,IAAID,GAAE,GAAG,EAAE,MAAM,iBAAiBA,IAAG,KAAK,EAAC,CAAE;AAE7F,aAAS,iBAAiB,WAAqB;AAC7C,UAAI;AACF,cAAM,MAAMA,IAAG,UAAU,SAAS;AAClC,eAAOA,IAAG,YAAY,GAAG;MAC3B,SAAS,OAAO;AACd,eAAO;MACT;IACF;AAEA,aAAS,iBAAiB,WAAuB,cAAsB;AACrE,YAAM,EAAE,WAAW,MAAM,sBAAqB,IAAK;AACnD,UAAI;AACF,cAAMG,KAAI,UAAU;AACpB,YAAI,iBAAiB,QAAQA,OAAM;AAAM,iBAAO;AAChD,YAAI,iBAAiB,SAASA,OAAM;AAAuB,iBAAO;AAClE,eAAO,CAAC,CAACF,OAAM,UAAU,SAAS;MACpC,SAAS,OAAO;AACd,eAAO;MACT;IACF;AAMA,aAAS,gBAAgB,OAAO,aAAa,QAAQ,IAAI,GAAC;AACxD,aAAO,eAAeG,QAAO,MAAM,QAAQ,MAAM,MAAM,GAAGJ,IAAG,KAAK;IACpE;AAOA,aAASK,cAAa,WAAuB,eAAe,MAAI;AAC9D,aAAOJ,OAAM,KAAK,SAASD,IAAG,UAAU,SAAS,CAAC,EAAE,QAAQ,YAAY;IAC1E;AAKA,aAAS,UAAU,MAAgB;AACjC,YAAM,EAAE,WAAW,WAAW,sBAAqB,IAAK;AACxD,UAAI,CAACM,SAAQ,IAAI;AAAG,eAAO;AAC3B,UAAK,cAAcN,OAAMA,IAAG,YAAa,cAAc;AAAW,eAAO;AACzE,YAAMG,KAAIC,QAAO,MAAM,QAAW,KAAK,EAAE;AACzC,aAAOD,OAAM,aAAaA,OAAM;IAClC;AAUA,aAAS,gBACP,YACA,YACA,eAAe,MAAI;AAEnB,UAAI,UAAU,UAAU,MAAM;AAAM,cAAM,IAAI,MAAM,+BAA+B;AACnF,UAAI,UAAU,UAAU,MAAM;AAAO,cAAM,IAAI,MAAM,+BAA+B;AACpF,YAAMI,KAAIP,IAAG,UAAU,UAAU;AACjC,YAAMQ,KAAIP,OAAM,UAAU,UAAU;AACpC,aAAOO,GAAE,SAASD,EAAC,EAAE,QAAQ,YAAY;IAC3C;AAEA,UAAME,SAAQ;MACZ;MACA;MACA;;AAEF,UAAM,SAAS,aAAa,iBAAiBJ,aAAY;AAEzD,WAAO,OAAO,OAAO,EAAE,cAAAA,eAAc,iBAAiB,QAAQ,OAAAJ,QAAO,OAAAQ,QAAO,QAAO,CAAE;EACvF;AAiBM,WAAU,MACdR,QACA,MACA,YAAuB,CAAA,GAAE;AAEzB,IAAAS,OAAM,IAAI;AACV,mBACE,WACA,CAAA,GACA;MACE,MAAM;MACN,MAAM;MACN,aAAa;MACb,UAAU;MACV,eAAe;KAChB;AAEH,gBAAY,OAAO,OAAO,CAAA,GAAI,SAAS;AACvC,UAAMR,eAAc,UAAU,eAAeA;AAC7C,UAAMS,QAAO,UAAU,SAAS,CAAC,KAAK,QAAQA,MAAU,MAAM,KAAK,GAAG;AAEtE,UAAM,EAAE,IAAI,IAAAX,IAAE,IAAKC;AACnB,UAAM,EAAE,OAAO,aAAa,MAAM,OAAM,IAAKD;AAC7C,UAAM,EAAE,QAAQ,cAAAK,eAAc,iBAAiB,OAAAI,QAAO,QAAO,IAAK,KAAKR,QAAO,SAAS;AACvF,UAAM,iBAA0C;MAC9C,SAAS;MACT,MAAM,OAAO,UAAU,SAAS,YAAY,UAAU,OAAO;MAC7D,QAAQ;MACR,cAAc;;AAEhB,UAAM,mBAAmB,cAAcW,OAAM,GAAG;AAEhD,aAAS,sBAAsB,QAAc;AAC3C,YAAM,OAAO,eAAeC;AAC5B,aAAO,SAAS;IAClB;AACA,aAAS,WAAW,OAAe,KAAW;AAC5C,UAAI,CAACb,IAAG,YAAY,GAAG;AACrB,cAAM,IAAI,MAAM,qBAAqB,KAAK,kCAAkC;AAC9E,aAAO;IACT;AACA,aAAS,sBAAmB;AAS1B,UAAI;AACF,cAAM,IAAI,MAAM,8DAA8D;IAClF;AACA,aAAS,kBAAkB,OAAmB,QAA4B;AACxE,wBAAkB,MAAM;AACxB,YAAM,OAAO,QAAQ;AACrB,YAAM,QAAQ,WAAW,YAAY,OAAO,WAAW,cAAc,OAAO,IAAI;AAChF,aAAOI,QAAO,OAAO,KAAK;IAC5B;IAKA,MAAMU,WAAS;MAKb,YAAYC,IAAWR,IAAW,UAAiB;AAJ1C;AACA;AACA;AAGP,aAAK,IAAI,WAAW,KAAKQ,EAAC;AAC1B,aAAK,IAAI,WAAW,KAAKR,EAAC;AAC1B,YAAI,YAAY,MAAM;AACpB,8BAAmB;AACnB,cAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,SAAS,QAAQ;AAAG,kBAAM,IAAI,MAAM,qBAAqB;AAC3E,eAAK,WAAW;QAClB;AACA,eAAO,OAAO,IAAI;MACpB;MAEA,OAAO,UACL,OACA,SAA+B,eAAe,QAAM;AAEpD,0BAAkB,OAAO,MAAM;AAC/B,YAAI;AACJ,YAAI,WAAW,OAAO;AACpB,gBAAM,EAAE,GAAAQ,IAAG,GAAAR,GAAC,IAAK,IAAI,MAAMH,QAAO,KAAK,CAAC;AACxC,iBAAO,IAAIU,WAAUC,IAAGR,EAAC;QAC3B;AACA,YAAI,WAAW,aAAa;AAC1B,kBAAQ,MAAM,CAAC;AACf,mBAAS;AACT,kBAAQ,MAAM,SAAS,CAAC;QAC1B;AACA,cAAMS,KAAI,QAAQ,YAAa;AAC/B,cAAMD,KAAI,MAAM,SAAS,GAAGC,EAAC;AAC7B,cAAMT,KAAI,MAAM,SAASS,IAAGA,KAAI,CAAC;AACjC,eAAO,IAAIF,WAAUd,IAAG,UAAUe,EAAC,GAAGf,IAAG,UAAUO,EAAC,GAAG,KAAK;MAC9D;MAEA,OAAO,QAAQ,KAAa,QAA6B;AACvD,eAAO,KAAK,UAAUU,YAAW,GAAG,GAAG,MAAM;MAC/C;MAEQ,iBAAc;AACpB,cAAM,EAAE,SAAQ,IAAK;AACrB,YAAI,YAAY;AAAM,gBAAM,IAAI,MAAM,sCAAsC;AAC5E,eAAO;MACT;MAEA,eAAe,UAAgB;AAC7B,eAAO,IAAIH,WAAU,KAAK,GAAG,KAAK,GAAG,QAAQ;MAC/C;MAEA,iBAAiB,aAAuB;AACtC,cAAM,EAAE,GAAAC,IAAG,GAAAR,GAAC,IAAK;AACjB,cAAM,WAAW,KAAK,eAAc;AACpC,cAAM,OAAO,aAAa,KAAK,aAAa,IAAIQ,KAAI,cAAcA;AAClE,YAAI,CAAC,GAAG,QAAQ,IAAI;AAAG,gBAAM,IAAI,MAAM,2CAA2C;AAClF,cAAMG,KAAI,GAAG,QAAQ,IAAI;AACzB,cAAMC,KAAIlB,OAAM,UAAUmB,aAAY,SAAS,WAAW,OAAO,CAAC,GAAGF,EAAC,CAAC;AACvE,cAAM,KAAKlB,IAAG,IAAI,IAAI;AACtB,cAAMqB,KAAIC,eAAclB,QAAO,aAAa,QAAW,SAAS,CAAC;AACjE,cAAM,KAAKJ,IAAG,OAAO,CAACqB,KAAI,EAAE;AAC5B,cAAM,KAAKrB,IAAG,OAAOO,KAAI,EAAE;AAE3B,cAAMgB,KAAItB,OAAM,KAAK,eAAe,EAAE,EAAE,IAAIkB,GAAE,eAAe,EAAE,CAAC;AAChE,YAAII,GAAE,IAAG;AAAI,gBAAM,IAAI,MAAM,qCAAqC;AAClE,QAAAA,GAAE,eAAc;AAChB,eAAOA;MACT;;MAGA,WAAQ;AACN,eAAO,sBAAsB,KAAK,CAAC;MACrC;MAEA,QAAQ,SAA+B,eAAe,QAAM;AAC1D,0BAAkB,MAAM;AACxB,YAAI,WAAW;AAAO,iBAAON,YAAW,IAAI,WAAW,IAAI,CAAC;AAC5D,cAAM,EAAE,GAAAF,IAAG,GAAAR,GAAC,IAAK;AACjB,cAAM,KAAKP,IAAG,QAAQe,EAAC;AACvB,cAAM,KAAKf,IAAG,QAAQO,EAAC;AACvB,YAAI,WAAW,aAAa;AAC1B,8BAAmB;AACnB,iBAAOa,aAAY,WAAW,GAAG,KAAK,eAAc,CAAE,GAAG,IAAI,EAAE;QACjE;AACA,eAAOA,aAAY,IAAI,EAAE;MAC3B;MAEA,MAAM,QAA6B;AACjC,eAAOI,YAAW,KAAK,QAAQ,MAAM,CAAC;MACxC;;AAQF,UAAMC,YACJ,UAAU,YACV,SAAS,aAAa,OAAiB;AAErC,UAAI,MAAM,SAAS;AAAM,cAAM,IAAI,MAAM,oBAAoB;AAG7D,YAAM,MAAM,gBAAgB,KAAK;AACjC,YAAM,QAAQ,MAAM,SAAS,IAAI;AACjC,aAAO,QAAQ,IAAI,OAAO,OAAO,KAAK,IAAI;IAC5C;AACF,UAAMH,iBACJ,UAAU,iBACV,SAAS,kBAAkB,OAAiB;AAC1C,aAAOtB,IAAG,OAAOyB,UAAS,KAAK,CAAC;IAClC;AAEF,UAAM,aAAa,QAAQ,MAAM;AAEjC,aAAS,WAAW,KAAW;AAE7B,eAAS,aAAa,QAAQ,KAAKC,MAAK,UAAU;AAClD,aAAO1B,IAAG,QAAQ,GAAG;IACvB;AAEA,aAAS,mBAAmB,SAAqB,SAAgB;AAC/D,MAAAI,QAAO,SAAS,QAAW,SAAS;AACpC,aAAO,UAAUA,QAAO,KAAK,OAAO,GAAG,QAAW,mBAAmB,IAAI;IAC3E;AAUA,aAASuB,SAAQ,SAAqB,WAAuB,MAAmB;AAC9E,YAAM,EAAE,MAAM,SAAS,aAAY,IAAK,gBAAgB,MAAM,cAAc;AAC5E,gBAAU,mBAAmB,SAAS,OAAO;AAI7C,YAAM,QAAQL,eAAc,OAAO;AACnC,YAAMM,KAAI5B,IAAG,UAAU,SAAS;AAChC,UAAI,CAACA,IAAG,YAAY4B,EAAC;AAAG,cAAM,IAAI,MAAM,qBAAqB;AAC7D,YAAM,WAAW,CAAC,WAAWA,EAAC,GAAG,WAAW,KAAK,CAAC;AAElD,UAAI,gBAAgB,QAAQ,iBAAiB,OAAO;AAGlD,cAAMC,KAAI,iBAAiB,OAAO3B,aAAY,QAAQ,SAAS,IAAI;AACnE,iBAAS,KAAKE,QAAOyB,IAAG,QAAW,cAAc,CAAC;MACpD;AACA,YAAM,OAAOT,aAAY,GAAG,QAAQ;AACpC,YAAMU,KAAI;AASV,eAAS,MAAM,QAAkB;AAG/B,cAAMC,KAAIN,UAAS,MAAM;AACzB,YAAI,CAACzB,IAAG,YAAY+B,EAAC;AAAG;AACxB,cAAM,KAAK/B,IAAG,IAAI+B,EAAC;AACnB,cAAMC,KAAI/B,OAAM,KAAK,SAAS8B,EAAC,EAAE,SAAQ;AACzC,cAAMhB,KAAIf,IAAG,OAAOgC,GAAE,CAAC;AACvB,YAAIjB,OAAMW;AAAK;AACf,cAAMnB,KAAIP,IAAG,OAAO,KAAKA,IAAG,OAAO8B,KAAIf,KAAIa,EAAC,CAAC;AAC7C,YAAIrB,OAAMmB;AAAK;AACf,YAAI,YAAYM,GAAE,MAAMjB,KAAI,IAAI,KAAK,OAAOiB,GAAE,IAAInB,IAAG;AACrD,YAAI,QAAQN;AACZ,YAAI,QAAQ,sBAAsBA,EAAC,GAAG;AACpC,kBAAQP,IAAG,IAAIO,EAAC;AAChB,sBAAY;QACd;AACA,eAAO,IAAIO,WAAUC,IAAG,OAAO,mBAAmB,SAAY,QAAQ;MACxE;AACA,aAAO,EAAE,MAAM,MAAK;IACtB;AAaA,aAASkB,MAAK,SAAqB,WAAuB,OAAsB,CAAA,GAAE;AAChF,YAAM,EAAE,MAAM,MAAK,IAAKN,SAAQ,SAAS,WAAW,IAAI;AACxD,YAAM,OAAO,eAA0B,KAAK,WAAW3B,IAAG,OAAOW,KAAI;AACrE,YAAM,MAAM,KAAK,MAAM,KAAK;AAC5B,aAAO,IAAI,QAAQ,KAAK,MAAM;IAChC;AAeA,aAASuB,QACP,WACA,SACA,WACA,OAAwB,CAAA,GAAE;AAE1B,YAAM,EAAE,MAAM,SAAS,OAAM,IAAK,gBAAgB,MAAM,cAAc;AACtE,kBAAY9B,QAAO,WAAW,QAAW,WAAW;AACpD,gBAAU,mBAAmB,SAAS,OAAO;AAC7C,UAAI,CAACE,SAAQ,SAAgB,GAAG;AAC9B,cAAM,MAAM,qBAAqBQ,aAAY,wBAAwB;AACrE,cAAM,IAAI,MAAM,wCAAwC,GAAG;MAC7D;AACA,wBAAkB,WAAW,MAAM;AACnC,UAAI;AACF,cAAM,MAAMA,WAAU,UAAU,WAAW,MAAM;AACjD,cAAMqB,KAAIlC,OAAM,UAAU,SAAS;AACnC,YAAI,QAAQ,IAAI,SAAQ;AAAI,iBAAO;AACnC,cAAM,EAAE,GAAAc,IAAG,GAAAR,GAAC,IAAK;AACjB,cAAMc,KAAIC,eAAc,OAAO;AAC/B,cAAM,KAAKtB,IAAG,IAAIO,EAAC;AACnB,cAAM,KAAKP,IAAG,OAAOqB,KAAI,EAAE;AAC3B,cAAM,KAAKrB,IAAG,OAAOe,KAAI,EAAE;AAC3B,cAAMI,KAAIlB,OAAM,KAAK,eAAe,EAAE,EAAE,IAAIkC,GAAE,eAAe,EAAE,CAAC;AAChE,YAAIhB,GAAE,IAAG;AAAI,iBAAO;AACpB,cAAMiB,KAAIpC,IAAG,OAAOmB,GAAE,CAAC;AACvB,eAAOiB,OAAMrB;MACf,SAASc,IAAG;AACV,eAAO;MACT;IACF;AAEA,aAASQ,kBACP,WACA,SACA,OAAyB,CAAA,GAAE;AAE3B,YAAM,EAAE,QAAO,IAAK,gBAAgB,MAAM,cAAc;AACxD,gBAAU,mBAAmB,SAAS,OAAO;AAC7C,aAAOvB,WAAU,UAAU,WAAW,WAAW,EAAE,iBAAiB,OAAO,EAAE,QAAO;IACtF;AAEA,WAAO,OAAO,OAAO;MACnB;MACA,cAAAT;MACA;MACA,OAAAI;MACA;MACA,OAAAR;MACA,MAAAgC;MACA,QAAAC;MACA,kBAAAG;MACA,WAAAvB;MACA;KACD;EACH;;;AP7/CA,MAAMwB,mBAA2C;IAC/C,GAAG,OAAO,oEAAoE;IAC9E,GAAG,OAAO,oEAAoE;IAC9E,GAAG,OAAO,CAAC;IACX,GAAG,OAAO,CAAC;IACX,GAAG,OAAO,CAAC;IACX,IAAI,OAAO,oEAAoE;IAC/E,IAAI,OAAO,oEAAoE;;AAGjF,MAAM,iBAAmC;IACvC,MAAM,OAAO,oEAAoE;IACjF,SAAS;MACP,CAAC,OAAO,oCAAoC,GAAG,CAAC,OAAO,oCAAoC,CAAC;MAC5F,CAAC,OAAO,qCAAqC,GAAG,OAAO,oCAAoC,CAAC;;;AAKhG,MAAMC,OAAsB,uBAAO,CAAC;AAMpC,WAAS,QAAQC,IAAS;AACxB,UAAMC,KAAIC,iBAAgB;AAE1B,UAAMC,OAAM,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAE3E,UAAM,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE,GAAG,OAAO,OAAO,EAAE;AAC5D,UAAM,KAAMH,KAAIA,KAAIA,KAAKC;AACzB,UAAM,KAAM,KAAK,KAAKD,KAAKC;AAC3B,UAAM,KAAM,KAAK,IAAIE,MAAKF,EAAC,IAAI,KAAMA;AACrC,UAAM,KAAM,KAAK,IAAIE,MAAKF,EAAC,IAAI,KAAMA;AACrC,UAAM,MAAO,KAAK,IAAIF,MAAKE,EAAC,IAAI,KAAMA;AACtC,UAAM,MAAO,KAAK,KAAK,MAAMA,EAAC,IAAI,MAAOA;AACzC,UAAM,MAAO,KAAK,KAAK,MAAMA,EAAC,IAAI,MAAOA;AACzC,UAAM,MAAO,KAAK,KAAK,MAAMA,EAAC,IAAI,MAAOA;AACzC,UAAM,OAAQ,KAAK,KAAK,MAAMA,EAAC,IAAI,MAAOA;AAC1C,UAAM,OAAQ,KAAK,MAAM,MAAMA,EAAC,IAAI,MAAOA;AAC3C,UAAM,OAAQ,KAAK,MAAME,MAAKF,EAAC,IAAI,KAAMA;AACzC,UAAM,KAAM,KAAK,MAAM,MAAMA,EAAC,IAAI,MAAOA;AACzC,UAAM,KAAM,KAAK,IAAI,KAAKA,EAAC,IAAI,KAAMA;AACrC,UAAM,OAAO,KAAK,IAAIF,MAAKE,EAAC;AAC5B,QAAI,CAAC,KAAK,IAAI,KAAK,IAAI,IAAI,GAAGD,EAAC;AAAG,YAAM,IAAI,MAAM,yBAAyB;AAC3E,WAAO;EACT;AAEA,MAAM,OAAO,MAAME,iBAAgB,GAAG,EAAE,MAAM,QAAO,CAAE;AACvD,MAAM,UAA0B,4BAAYA,kBAAiB;IAC3D,IAAI;IACJ,MAAM;GACP;AAmBM,MAAM,YAAmC,sBAAM,SAASE,OAAM;;;ASpGrE;;;ACAA;AAMM,WAAUC,SAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAUC,SAAQC,IAAW,QAAgB,IAAE;AACnD,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,GAAG;AACrC,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,GAAG,MAAM,8BAA8BA,EAAC,EAAE;IAC5D;EACF;AAGM,WAAUC,QAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,UAAM,QAAQJ,SAAQ,KAAK;AAC3B,UAAM,MAAM,OAAO;AACnB,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,YAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,YAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;IACzE;AACA,WAAO;EACT;AAGM,WAAUK,OAAMC,IAAQ;AAC5B,QAAI,OAAOA,OAAM,cAAc,OAAOA,GAAE,WAAW;AACjD,YAAM,IAAI,MAAM,yCAAyC;AAC3D,IAAAJ,SAAQI,GAAE,SAAS;AACnB,IAAAJ,SAAQI,GAAE,QAAQ;EACpB;AAGM,WAAUC,SAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAUC,SAAQ,KAAU,UAAa;AAC7C,IAAAJ,QAAO,KAAK,QAAW,qBAAqB;AAC5C,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,sDAAsD,GAAG;IAC3E;EACF;AAkBM,WAAUK,UAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAUC,YAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAUC,MAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAGM,WAAU,KAAK,MAAc,OAAa;AAC9C,WAAQ,QAAQ,QAAW,SAAU,KAAK,UAAY;EACxD;AA6IM,WAAUC,gBAAe,QAAoB;AACjD,QAAI,MAAM;AACV,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,YAAMC,KAAI,OAAOD,EAAC;AAClB,MAAAE,QAAOD,EAAC;AACR,aAAOA,GAAE;IACX;AACA,UAAM,MAAM,IAAI,WAAW,GAAG;AAC9B,aAASD,KAAI,GAAG,MAAM,GAAGA,KAAI,OAAO,QAAQA,MAAK;AAC/C,YAAMC,KAAI,OAAOD,EAAC;AAClB,UAAI,IAAIC,IAAG,GAAG;AACd,aAAOA,GAAE;IACX;AACA,WAAO;EACT;AAoEM,WAAUE,cACd,UACA,OAAiB,CAAA,GAAE;AAEnB,UAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,UAAM,MAAM,SAAS,MAAS;AAC9B,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,WAAO,OAAO,OAAO,IAAI;AACzB,WAAO,OAAO,OAAO,KAAK;EAC5B;AAWO,MAAMC,WAAU,CAAC,YAAwC;IAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;ADzUrF,MAAOC,SAAP,MAAY;IAQhB,YAAY,MAAa,KAAe;AAPxC;AACA;AACA;AACA;AACQ,sCAAW;AACX,uCAAY;AAGlB,MAAAC,OAAM,IAAI;AACV,MAAAC,QAAO,KAAK,QAAW,KAAK;AAC5B,WAAK,QAAQ,KAAK,OAAM;AACxB,UAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,cAAM,IAAI,MAAM,qDAAqD;AACvE,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,YAAY,KAAK,MAAM;AAC5B,YAAM,WAAW,KAAK;AACtB,YAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,UAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,eAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK;AAC/C,WAAK,MAAM,OAAO,GAAG;AAErB,WAAK,QAAQ,KAAK,OAAM;AAExB,eAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK,KAAO;AACtD,WAAK,MAAM,OAAO,GAAG;AACrB,MAAAC,OAAM,GAAG;IACX;IACA,OAAO,KAAe;AACpB,MAAAC,SAAQ,IAAI;AACZ,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAA,SAAQ,IAAI;AACZ,MAAAH,QAAO,KAAK,KAAK,WAAW,QAAQ;AACpC,WAAK,WAAW;AAChB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,QAAO;IACd;IACA,SAAM;AACJ,YAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,WAAK,WAAW,GAAG;AACnB,aAAO;IACT;IACA,WAAW,IAAa;AAEtB,kBAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,YAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,WAAK;AACL,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;IACA,UAAO;AACL,WAAK,YAAY;AACjB,WAAK,MAAM,QAAO;AAClB,WAAK,MAAM,QAAO;IACpB;;AAaK,MAAMI,QAGT,CAAC,MAAa,KAAiB,YACjC,IAAIN,OAAW,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AAClD,EAAAM,MAAK,SAAS,CAAC,MAAa,QAAoB,IAAIN,OAAW,MAAM,GAAG;;;AE7FxE;;;ACAA;AAOM,WAAUO,KAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAUC,KAAIH,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAMM,MAAgBE,UAAhB,MAAsB;IAoB1B,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,sCAAW;AACX,oCAAS;AACT,iCAAM;AACN,uCAAY;AAGpB,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,OAAOA;AACZ,WAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,WAAK,OAAOC,YAAW,KAAK,MAAM;IACpC;IACA,OAAO,MAAgB;AACrB,MAAAC,SAAQ,IAAI;AACZ,MAAAC,QAAO,IAAI;AACX,YAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,YAAM,MAAM,KAAK;AACjB,eAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,cAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,YAAI,SAAS,UAAU;AACrB,gBAAM,WAAWF,YAAW,IAAI;AAChC,iBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,iBAAK,QAAQ,UAAU,GAAG;AACzE;QACF;AACA,eAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,aAAK,OAAO;AACZ,eAAO;AACP,YAAI,KAAK,QAAQ,UAAU;AACzB,eAAK,QAAQ,MAAM,CAAC;AACpB,eAAK,MAAM;QACb;MACF;AACA,WAAK,UAAU,KAAK;AACpB,WAAK,WAAU;AACf,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAC,SAAQ,IAAI;AACZ,MAAAE,SAAQ,KAAK,IAAI;AACjB,WAAK,WAAW;AAIhB,YAAM,EAAE,QAAQ,MAAM,UAAU,MAAAJ,MAAI,IAAK;AACzC,UAAI,EAAE,IAAG,IAAK;AAEd,aAAO,KAAK,IAAI;AAChB,MAAAK,OAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,UAAI,KAAK,YAAY,WAAW,KAAK;AACnC,aAAK,QAAQ,MAAM,CAAC;AACpB,cAAM;MACR;AAEA,eAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,eAAOA,EAAC,IAAI;AAIjD,WAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGN,KAAI;AAC7D,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM,QAAQC,YAAW,GAAG;AAC5B,YAAM,MAAM,KAAK;AAEjB,UAAI,MAAM;AAAG,cAAM,IAAI,MAAM,2CAA2C;AACxE,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,IAAG;AACtB,UAAI,SAAS,MAAM;AAAQ,cAAM,IAAI,MAAM,oCAAoC;AAC/E,eAASK,KAAI,GAAGA,KAAI,QAAQA;AAAK,cAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGN,KAAI;IACxE;IACA,SAAM;AACJ,YAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,WAAK,WAAW,MAAM;AACtB,YAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,WAAK,QAAO;AACZ,aAAO;IACT;IACA,WAAW,IAAM;AACf,kBAAO,IAAK,KAAK,YAAmB;AACpC,SAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,YAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,SAAS;AACZ,SAAG,MAAM;AACT,UAAI,SAAS;AAAU,WAAG,OAAO,IAAI,MAAM;AAC3C,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;;AASK,MAAMO,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAcM,MAAMC,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;;;ADyBD,MAAM,SAAyB,2BAAW,KAAK;IAC7C;IAAG;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAI;IAAG;IAAG;IAAG;IAAG;IAAI;IAAI;GACpD;AACD,MAAM,QAAyB,uBAAM,WAAW,KAAK,IAAI,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAGC,OAAMA,EAAC,CAAC,GAAE;AAC7F,MAAM,QAAyB,uBAAM,MAAM,IAAI,CAACA,QAAO,IAAIA,KAAI,KAAK,EAAE,GAAE;AACxE,MAAM,QAAyB,uBAAK;AAClC,UAAMC,KAAI,CAAC,KAAK;AAChB,UAAMC,KAAI,CAAC,KAAK;AAChB,UAAM,MAAM,CAACD,IAAGC,EAAC;AACjB,aAASF,KAAI,GAAGA,KAAI,GAAGA;AAAK,eAASG,MAAK;AAAK,QAAAA,GAAE,KAAKA,GAAEH,EAAC,EAAE,IAAI,CAACI,OAAM,OAAOA,EAAC,CAAC,CAAC;AAChF,WAAO;EACT,GAAE;AACF,MAAM,OAAwB,uBAAM,MAAM,CAAC,GAAE;AAC7C,MAAM,OAAwB,uBAAM,MAAM,CAAC,GAAE;AAG7C,MAAM,YAA4B;IAChC,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;IACvD,IAAI,CAACJ,OAAM,WAAW,KAAKA,EAAC,CAAC;AAC/B,MAAM,aAA6B,qBAAK,IAAI,CAAC,KAAKA,OAAM,IAAI,IAAI,CAACG,OAAM,UAAUH,EAAC,EAAEG,EAAC,CAAC,CAAC;AACvF,MAAM,aAA6B,qBAAK,IAAI,CAAC,KAAKH,OAAM,IAAI,IAAI,CAACG,OAAM,UAAUH,EAAC,EAAEG,EAAC,CAAC,CAAC;AACvF,MAAM,QAAwB,4BAAY,KAAK;IAC7C;IAAY;IAAY;IAAY;IAAY;GACjD;AACD,MAAM,QAAwB,4BAAY,KAAK;IAC7C;IAAY;IAAY;IAAY;IAAY;GACjD;AAED,WAAS,SAAS,OAAeE,IAAWC,IAAW,GAAS;AAC9D,QAAI,UAAU;AAAG,aAAOD,KAAIC,KAAI;AAChC,QAAI,UAAU;AAAG,aAAQD,KAAIC,KAAM,CAACD,KAAI;AACxC,QAAI,UAAU;AAAG,cAAQA,KAAI,CAACC,MAAK;AACnC,QAAI,UAAU;AAAG,aAAQD,KAAI,IAAMC,KAAI,CAAC;AACxC,WAAOD,MAAKC,KAAI,CAAC;EACnB;AAEA,MAAM,UAA0B,oBAAI,YAAY,EAAE;AAC5C,MAAO,aAAP,cAA0BC,QAAkB;IAOhD,cAAA;AACE,YAAM,IAAI,IAAI,GAAG,IAAI;AAPf,gCAAK,aAAa;AAClB,gCAAK,aAAa;AAClB,gCAAK,aAAa;AAClB,gCAAK,YAAa;AAClB,gCAAK,aAAa;IAI1B;IACU,MAAG;AACX,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC/B,aAAO,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE;IAC5B;IACU,IAAI,IAAY,IAAY,IAAY,IAAY,IAAU;AACtE,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;IACjB;IACU,QAAQ,MAAgB,QAAc;AAC9C,eAASP,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,gBAAQA,EAAC,IAAI,KAAK,UAAU,QAAQ,IAAI;AAElF,UAAI,KAAK,KAAK,KAAK,GAAG,KAAK,IACvB,KAAK,KAAK,KAAK,GAAG,KAAK,IACvB,KAAK,KAAK,KAAK,GAAGQ,MAAK,IACvB,KAAK,KAAK,KAAK,GAAG,KAAK,IACvB,KAAK,KAAK,KAAK,GAAG,KAAK;AAI3B,eAAS,QAAQ,GAAG,QAAQ,GAAG,SAAS;AACtC,cAAM,SAAS,IAAI;AACnB,cAAM,MAAM,MAAM,KAAK,GAAG,MAAM,MAAM,KAAK;AAC3C,cAAM,KAAK,KAAK,KAAK,GAAG,KAAK,KAAK,KAAK;AACvC,cAAM,KAAK,WAAW,KAAK,GAAG,KAAK,WAAW,KAAK;AACnD,iBAASR,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,gBAAM,KAAM,KAAK,KAAK,SAAS,OAAO,IAAI,IAAI,EAAE,IAAI,QAAQ,GAAGA,EAAC,CAAC,IAAI,KAAK,GAAGA,EAAC,CAAC,IAAI,KAAM;AACzF,eAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,EAAE,IAAI,GAAG,KAAK,IAAI,KAAK;QACzD;AAEA,iBAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,gBAAM,KAAM,KAAK,KAAK,SAAS,QAAQ,IAAIQ,KAAI,EAAE,IAAI,QAAQ,GAAGR,EAAC,CAAC,IAAI,KAAK,GAAGA,EAAC,CAAC,IAAI,KAAM;AAC1F,eAAK,IAAI,KAAK,IAAI,KAAK,KAAKQ,KAAI,EAAE,IAAI,GAAGA,MAAK,IAAI,KAAK;QACzD;MACF;AAEA,WAAK,IACF,KAAK,KAAK,KAAK,KAAM,GACrB,KAAK,KAAK,KAAK,KAAM,GACrB,KAAK,KAAK,KAAK,KAAM,GACrB,KAAK,KAAK,KAAK,KAAM,GACrB,KAAK,KAAK,KAAKA,MAAM,CAAC;IAE3B;IACU,aAAU;AAClB,MAAAC,OAAM,OAAO;IACf;IACA,UAAO;AACL,WAAK,YAAY;AACjB,MAAAA,OAAM,KAAK,MAAM;AACjB,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;IACxB;;AAQK,MAAM,YAAmC,gBAAAC,cAAa,MAAM,IAAI,WAAU,CAAE;;;AEpSnF;;;ACAA;AAKA,MAAMC,cAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,MAAMC,QAAuB,uBAAO,EAAE;AAEtC,WAASC,SACPC,IACA,KAAK,OAAK;AAKV,QAAI;AAAI,aAAO,EAAE,GAAG,OAAOA,KAAIH,WAAU,GAAG,GAAG,OAAQG,MAAKF,QAAQD,WAAU,EAAC;AAC/E,WAAO,EAAE,GAAG,OAAQG,MAAKF,QAAQD,WAAU,IAAI,GAAG,GAAG,OAAOG,KAAIH,WAAU,IAAI,EAAC;EACjF;AAEA,WAASI,OAAM,KAAe,KAAK,OAAK;AACtC,UAAM,MAAM,IAAI;AAChB,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,aAASC,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC5B,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAC,IAAKL,SAAQ,IAAIG,EAAC,GAAG,EAAE;AACnC,OAAC,GAAGA,EAAC,GAAG,GAAGA,EAAC,CAAC,IAAI,CAACC,IAAGC,EAAC;IACxB;AACA,WAAO,CAAC,IAAI,EAAE;EAChB;AAIA,MAAMC,SAAQ,CAACC,IAAW,IAAYC,OAAsBD,OAAMC;AAClE,MAAMC,SAAQ,CAACF,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAMF;AAEpF,MAAMG,UAAS,CAACJ,IAAWG,IAAWF,OAAuBD,OAAMC,KAAME,MAAM,KAAKF;AACpF,MAAMI,UAAS,CAACL,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAMF;AAErF,MAAMK,UAAS,CAACN,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAOF,KAAI;AAC1F,MAAMM,UAAS,CAACP,IAAWG,IAAWF,OAAuBD,OAAOC,KAAI,KAAQE,MAAM,KAAKF;AAa3F,WAASO,KACP,IACA,IACA,IACA,IAAU;AAKV,UAAMC,MAAK,OAAO,MAAM,OAAO;AAC/B,WAAO,EAAE,GAAI,KAAK,MAAOA,KAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,KAAI,EAAC;EAC3D;AAEA,MAAMC,SAAQ,CAAC,IAAY,IAAY,QAAwB,OAAO,MAAM,OAAO,MAAM,OAAO;AAChG,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,OACjD,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAC3C,MAAMC,SAAQ,CAAC,IAAY,IAAY,IAAY,QAChD,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AACjD,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,OAC7D,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAChD,MAAMC,SAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,QAC5D,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC9D,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,OACzE,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;AD3DrD,MAAMC,YAA2B,4BAAY,KAAK;IAChD;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAGD,MAAMC,YAA2B,oBAAI,YAAY,EAAE;AAGnD,MAAeC,YAAf,cAAuDC,QAAS;IAY9D,YAAY,WAAiB;AAC3B,YAAM,IAAI,WAAW,GAAG,KAAK;IAC/B;IACU,MAAG;AACX,YAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,aAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IAChC;;IAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,WAAK,IAAIP,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;IACf;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,QAAAX,UAASW,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,cAAM,MAAMX,UAASW,KAAI,EAAE;AAC3B,cAAMC,MAAKZ,UAASW,KAAI,CAAC;AACzB,cAAM,KAAKE,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,cAAM,KAAKA,MAAKD,KAAI,EAAE,IAAIC,MAAKD,KAAI,EAAE,IAAKA,QAAO;AACjD,QAAAZ,UAASW,EAAC,IAAK,KAAKX,UAASW,KAAI,CAAC,IAAI,KAAKX,UAASW,KAAI,EAAE,IAAK;MACjE;AAEA,UAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,SAASE,MAAKN,IAAG,CAAC,IAAIM,MAAKN,IAAG,EAAE,IAAIM,MAAKN,IAAG,EAAE;AACpD,cAAM,KAAMG,KAAI,SAASI,KAAIP,IAAGC,IAAGC,EAAC,IAAIV,UAASY,EAAC,IAAIX,UAASW,EAAC,IAAK;AACrE,cAAM,SAASE,MAAKV,IAAG,CAAC,IAAIU,MAAKV,IAAG,EAAE,IAAIU,MAAKV,IAAG,EAAE;AACpD,cAAM,KAAM,SAASY,KAAIZ,IAAGC,IAAGC,EAAC,IAAK;AACrC,QAAAK,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAKD,KAAI,KAAM;AACf,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAK,KAAK,KAAM;MAClB;AAEA,MAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,WAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IACjC;IACU,aAAU;AAClB,MAAAM,OAAMhB,SAAQ;IAChB;IACA,UAAO;AACL,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,MAAAgB,OAAM,KAAK,MAAM;IACnB;;AAII,MAAOC,WAAP,cAAuBhB,UAAiB;IAW5C,cAAA;AACE,YAAM,EAAE;AATA;;+BAAYiB,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;IAGrC;;AAuBF,MAAMC,QAAwB,uBAAUC,OAAM;IAC5C;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE,IAAI,CAAAC,OAAK,OAAOA,EAAC,CAAC,CAAC,GAAE;AACvB,MAAMC,aAA6B,uBAAMH,MAAK,CAAC,GAAE;AACjD,MAAMI,aAA6B,uBAAMJ,MAAK,CAAC,GAAE;AAGjD,MAAMK,cAA6B,oBAAI,YAAY,EAAE;AACrD,MAAMC,cAA6B,oBAAI,YAAY,EAAE;AAGrD,MAAeC,YAAf,cAAuDC,QAAS;IAqB9D,YAAY,WAAiB;AAC3B,YAAM,KAAK,WAAW,IAAI,KAAK;IACjC;;IAEU,MAAG;AAIX,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC3E,aAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;IACxE;;IAEU,IACR,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IACpF,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAU;AAE9F,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;IACjB;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU,GAAG;AACxC,QAAAJ,YAAWI,EAAC,IAAI,KAAK,UAAU,MAAM;AACrC,QAAAH,YAAWG,EAAC,IAAI,KAAK,UAAW,UAAU,CAAE;MAC9C;AACA,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAE5B,cAAM,OAAOJ,YAAWI,KAAI,EAAE,IAAI;AAClC,cAAM,OAAOH,YAAWG,KAAI,EAAE,IAAI;AAClC,cAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAC3F,cAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAE3F,cAAM,MAAMR,YAAWI,KAAI,CAAC,IAAI;AAChC,cAAM,MAAMH,YAAWG,KAAI,CAAC,IAAI;AAChC,cAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQI,QAAO,KAAK,KAAK,EAAE,IAAQH,OAAM,KAAK,KAAK,CAAC;AACvF,cAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQG,QAAO,KAAK,KAAK,EAAE,IAAQF,OAAM,KAAK,KAAK,CAAC;AAEvF,cAAM,OAAWG,OAAM,KAAK,KAAKV,YAAWG,KAAI,CAAC,GAAGH,YAAWG,KAAI,EAAE,CAAC;AACtE,cAAM,OAAWQ,OAAM,MAAM,KAAK,KAAKZ,YAAWI,KAAI,CAAC,GAAGJ,YAAWI,KAAI,EAAE,CAAC;AAC5E,QAAAJ,YAAWI,EAAC,IAAI,OAAO;AACvB,QAAAH,YAAWG,EAAC,IAAI,OAAO;MACzB;AACA,UAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAEzE,eAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAE3B,cAAM,UAAcC,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE;AAEvF,cAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,cAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,cAAM,OAAWG,OAAM,IAAI,SAAS,MAAMd,WAAUK,EAAC,GAAGH,YAAWG,EAAC,CAAC;AACrE,cAAM,MAAUU,OAAM,MAAM,IAAI,SAAS,MAAMhB,WAAUM,EAAC,GAAGJ,YAAWI,EAAC,CAAC;AAC1E,cAAM,MAAM,OAAO;AAEnB,cAAM,UAAcC,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,cAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,SAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASK,KAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,cAAM,MAAUC,OAAM,KAAK,SAAS,IAAI;AACxC,aAASC,OAAM,KAAK,KAAK,SAAS,IAAI;AACtC,aAAK,MAAM;MACb;AAEA,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASF,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;IACzE;IACU,aAAU;AAClB,MAAAG,OAAMlB,aAAYC,WAAU;IAC9B;IACA,UAAO;AACL,MAAAiB,OAAM,KAAK,MAAM;AACjB,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACzD;;AAII,MAAOC,WAAP,cAAuBjB,UAAiB;IAkB5C,cAAA;AACE,YAAM,EAAE;AAlBA,gCAAakB,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;IAIvC;;AAsGK,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;AASxB,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;;;AE7b/B;AAYA,WAASC,SAAQC,IAAU;AACzB,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAMA,WAAS,UAAU,UAAmB,KAAU;AAC9C,QAAI,CAAC,MAAM,QAAQ,GAAG;AAAG,aAAO;AAChC,QAAI,IAAI,WAAW;AAAG,aAAO;AAC7B,QAAI,UAAU;AACZ,aAAO,IAAI,MAAM,CAAC,SAAS,OAAO,SAAS,QAAQ;IACrD,OAAO;AACL,aAAO,IAAI,MAAM,CAAC,SAAS,OAAO,cAAc,IAAI,CAAC;IACvD;EACF;AAEA,WAAS,IAAI,OAAe;AAC1B,QAAI,OAAO,UAAU;AAAY,YAAM,IAAI,MAAM,mBAAmB;AACpE,WAAO;EACT;AAEA,WAAS,KAAK,OAAe,OAAc;AACzC,QAAI,OAAO,UAAU;AAAU,YAAM,IAAI,MAAM,GAAG,KAAK,mBAAmB;AAC1E,WAAO;EACT;AAEA,WAASC,SAAQC,IAAS;AACxB,QAAI,CAAC,OAAO,cAAcA,EAAC;AAAG,YAAM,IAAI,MAAM,oBAAoBA,EAAC,EAAE;EACvE;AAEA,WAAS,KAAK,OAAY;AACxB,QAAI,CAAC,MAAM,QAAQ,KAAK;AAAG,YAAM,IAAI,MAAM,gBAAgB;EAC7D;AACA,WAAS,QAAQ,OAAe,OAAe;AAC7C,QAAI,CAAC,UAAU,MAAM,KAAK;AAAG,YAAM,IAAI,MAAM,GAAG,KAAK,6BAA6B;EACpF;AACA,WAAS,QAAQ,OAAe,OAAe;AAC7C,QAAI,CAAC,UAAU,OAAO,KAAK;AAAG,YAAM,IAAI,MAAM,GAAG,KAAK,6BAA6B;EACrF;;AAqBA,WAAS,SAAuC,MAAO;AACrD,UAAM,KAAK,CAACC,OAAWA;AAEvB,UAAM,OAAO,CAACA,IAAQC,OAAW,CAACC,OAAWF,GAAEC,GAAEC,EAAC,CAAC;AAEnD,UAAM,SAAS,KAAK,IAAI,CAACC,OAAMA,GAAE,MAAM,EAAE,YAAY,MAAM,EAAE;AAE7D,UAAM,SAAS,KAAK,IAAI,CAACA,OAAMA,GAAE,MAAM,EAAE,OAAO,MAAM,EAAE;AACxD,WAAO,EAAE,QAAQ,OAAM;EACzB;;AAOA,WAAS,SAAS,SAA0B;AAE1C,UAAM,WAAW,OAAO,YAAY,WAAW,QAAQ,MAAM,EAAE,IAAI;AACnE,UAAM,MAAM,SAAS;AACrB,YAAQ,YAAY,QAAQ;AAG5B,UAAM,UAAU,IAAI,IAAI,SAAS,IAAI,CAACC,IAAGC,OAAM,CAACD,IAAGC,EAAC,CAAC,CAAC;AACtD,WAAO;MACL,QAAQ,CAAC,WAAoB;AAC3B,aAAK,MAAM;AACX,eAAO,OAAO,IAAI,CAACA,OAAK;AACtB,cAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,KAAKA,MAAK;AAC5C,kBAAM,IAAI,MACR,kDAAkDA,EAAC,eAAe,OAAO,EAAE;AAE/E,iBAAO,SAASA,EAAC;QACnB,CAAC;MACH;MACA,QAAQ,CAAC,UAA6B;AACpC,aAAK,KAAK;AACV,eAAO,MAAM,IAAI,CAAC,WAAU;AAC1B,eAAK,mBAAmB,MAAM;AAC9B,gBAAMA,KAAI,QAAQ,IAAI,MAAM;AAC5B,cAAIA,OAAM;AAAW,kBAAM,IAAI,MAAM,oBAAoB,MAAM,eAAe,OAAO,EAAE;AACvF,iBAAOA;QACT,CAAC;MACH;;EAEJ;;AAKA,WAAS,KAAK,YAAY,IAAE;AAC1B,SAAK,QAAQ,SAAS;AACtB,WAAO;MACL,QAAQ,CAAC,SAAQ;AACf,gBAAQ,eAAe,IAAI;AAC3B,eAAO,KAAK,KAAK,SAAS;MAC5B;MACA,QAAQ,CAAC,OAAM;AACb,aAAK,eAAe,EAAE;AACtB,eAAO,GAAG,MAAM,SAAS;MAC3B;;EAEJ;;AAMA,WAAS,QAAQ,MAAc,MAAM,KAAG;AACtC,IAAAP,SAAQ,IAAI;AACZ,SAAK,WAAW,GAAG;AACnB,WAAO;MACL,OAAO,MAAc;AACnB,gBAAQ,kBAAkB,IAAI;AAC9B,eAAQ,KAAK,SAAS,OAAQ;AAAG,eAAK,KAAK,GAAG;AAC9C,eAAO;MACT;MACA,OAAO,OAAe;AACpB,gBAAQ,kBAAkB,KAAK;AAC/B,YAAI,MAAM,MAAM;AAChB,YAAK,MAAM,OAAQ;AACjB,gBAAM,IAAI,MAAM,4DAA4D;AAC9E,eAAO,MAAM,KAAK,MAAM,MAAM,CAAC,MAAM,KAAK,OAAO;AAC/C,gBAAM,OAAO,MAAM;AACnB,gBAAM,OAAO,OAAO;AACpB,cAAI,OAAO,MAAM;AAAG,kBAAM,IAAI,MAAM,+CAA+C;QACrF;AACA,eAAO,MAAM,MAAM,GAAG,GAAG;MAC3B;;EAEJ;AAaA,WAAS,aAAa,MAAgB,MAAc,IAAU;AAE5D,QAAI,OAAO;AAAG,YAAM,IAAI,MAAM,8BAA8B,IAAI,8BAA8B;AAC9F,QAAI,KAAK;AAAG,YAAM,IAAI,MAAM,4BAA4B,EAAE,8BAA8B;AACxF,SAAK,IAAI;AACT,QAAI,CAAC,KAAK;AAAQ,aAAO,CAAA;AACzB,QAAI,MAAM;AACV,UAAM,MAAM,CAAA;AACZ,UAAM,SAAS,MAAM,KAAK,MAAM,CAACQ,OAAK;AACpC,MAAAC,SAAQD,EAAC;AACT,UAAIA,KAAI,KAAKA,MAAK;AAAM,cAAM,IAAI,MAAM,oBAAoBA,EAAC,EAAE;AAC/D,aAAOA;IACT,CAAC;AACD,UAAM,OAAO,OAAO;AACpB,WAAO,MAAM;AACX,UAAI,QAAQ;AACZ,UAAI,OAAO;AACX,eAASE,KAAI,KAAKA,KAAI,MAAMA,MAAK;AAC/B,cAAM,QAAQ,OAAOA,EAAC;AACtB,cAAM,YAAY,OAAO;AACzB,cAAM,YAAY,YAAY;AAC9B,YACE,CAAC,OAAO,cAAc,SAAS,KAC/B,YAAY,SAAS,SACrB,YAAY,UAAU,WACtB;AACA,gBAAM,IAAI,MAAM,8BAA8B;QAChD;AACA,cAAM,MAAM,YAAY;AACxB,gBAAQ,YAAY;AACpB,cAAM,UAAU,KAAK,MAAM,GAAG;AAC9B,eAAOA,EAAC,IAAI;AACZ,YAAI,CAAC,OAAO,cAAc,OAAO,KAAK,UAAU,KAAK,UAAU;AAC7D,gBAAM,IAAI,MAAM,8BAA8B;AAChD,YAAI,CAAC;AAAM;iBACF,CAAC;AAAS,gBAAMA;;AACpB,iBAAO;MACd;AACA,UAAI,KAAK,KAAK;AACd,UAAI;AAAM;IACZ;AACA,aAASA,KAAI,GAAGA,KAAI,KAAK,SAAS,KAAK,KAAKA,EAAC,MAAM,GAAGA;AAAK,UAAI,KAAK,CAAC;AACrE,WAAO,IAAI,QAAO;EACpB;AAEA,MAAM,MAAM,CAACC,IAAWC,OAAuBA,OAAM,IAAID,KAAI,IAAIC,IAAGD,KAAIC,EAAC;AACzE,MAAM,yCAAyC,CAAC,MAAc,OAC5D,QAAQ,KAAK,IAAI,MAAM,EAAE;AAC3B,MAAM,SAAoC,uBAAK;AAC7C,QAAI,MAAM,CAAA;AACV,aAASF,KAAI,GAAGA,KAAI,IAAIA;AAAK,UAAI,KAAK,KAAKA,EAAC;AAC5C,WAAO;EACT,GAAE;AAIF,WAAS,cAAc,MAAgB,MAAc,IAAYG,UAAgB;AAC/E,SAAK,IAAI;AACT,QAAI,QAAQ,KAAK,OAAO;AAAI,YAAM,IAAI,MAAM,6BAA6B,IAAI,EAAE;AAC/E,QAAI,MAAM,KAAK,KAAK;AAAI,YAAM,IAAI,MAAM,2BAA2B,EAAE,EAAE;AACvE,QAAI,4BAAY,MAAM,EAAE,IAAI,IAAI;AAC9B,YAAM,IAAI,MACR,sCAAsC,IAAI,OAAO,EAAE,cAAc,4BAAY,MAAM,EAAE,CAAC,EAAE;IAE5F;AACA,QAAI,QAAQ;AACZ,QAAI,MAAM;AACV,UAAM,MAAM,OAAO,IAAI;AACvB,UAAM,OAAO,OAAO,EAAE,IAAK;AAC3B,UAAM,MAAgB,CAAA;AACtB,eAAWC,MAAK,MAAM;AACpB,MAAAL,SAAQK,EAAC;AACT,UAAIA,MAAK;AAAK,cAAM,IAAI,MAAM,oCAAoCA,EAAC,SAAS,IAAI,EAAE;AAClF,cAAS,SAAS,OAAQA;AAC1B,UAAI,MAAM,OAAO;AAAI,cAAM,IAAI,MAAM,qCAAqC,GAAG,SAAS,IAAI,EAAE;AAC5F,aAAO;AACP,aAAO,OAAO,IAAI,OAAO;AAAI,YAAI,MAAO,SAAU,MAAM,KAAO,UAAU,CAAC;AAC1E,YAAM,MAAM,OAAO,GAAG;AACtB,UAAI,QAAQ;AAAW,cAAM,IAAI,MAAM,eAAe;AACtD,eAAS,MAAM;IACjB;AACA,YAAS,SAAU,KAAK,MAAQ;AAChC,QAAI,CAACD,YAAW,OAAO;AAAM,YAAM,IAAI,MAAM,gBAAgB;AAC7D,QAAI,CAACA,YAAW,QAAQ;AAAG,YAAM,IAAI,MAAM,qBAAqB,KAAK,EAAE;AACvE,QAAIA,YAAW,MAAM;AAAG,UAAI,KAAK,UAAU,CAAC;AAC5C,WAAO;EACT;;AAKA,WAAS,MAAM,KAAW;AACxB,IAAAJ,SAAQ,GAAG;AACX,UAAM,OAAO,KAAK;AAClB,WAAO;MACL,QAAQ,CAAC,UAAqB;AAC5B,YAAI,CAACM,SAAQ,KAAK;AAAG,gBAAM,IAAI,MAAM,yCAAyC;AAC9E,eAAO,aAAa,MAAM,KAAK,KAAK,GAAG,MAAM,GAAG;MAClD;MACA,QAAQ,CAAC,WAAoB;AAC3B,gBAAQ,gBAAgB,MAAM;AAC9B,eAAO,WAAW,KAAK,aAAa,QAAQ,KAAK,IAAI,CAAC;MACxD;;EAEJ;;AAOA,WAAS,OAAO,MAAc,aAAa,OAAK;AAC9C,IAAAN,SAAQ,IAAI;AACZ,QAAI,QAAQ,KAAK,OAAO;AAAI,YAAM,IAAI,MAAM,mCAAmC;AAC/E,QAAI,4BAAY,GAAG,IAAI,IAAI,MAAM,4BAAY,MAAM,CAAC,IAAI;AACtD,YAAM,IAAI,MAAM,wBAAwB;AAC1C,WAAO;MACL,QAAQ,CAAC,UAAqB;AAC5B,YAAI,CAACM,SAAQ,KAAK;AAAG,gBAAM,IAAI,MAAM,0CAA0C;AAC/E,eAAO,cAAc,MAAM,KAAK,KAAK,GAAG,GAAG,MAAM,CAAC,UAAU;MAC9D;MACA,QAAQ,CAAC,WAAoB;AAC3B,gBAAQ,iBAAiB,MAAM;AAC/B,eAAO,WAAW,KAAK,cAAc,QAAQ,MAAM,GAAG,UAAU,CAAC;MACnE;;EAEJ;AAYA,WAAS,SACP,KACA,IAAoC;AAEpC,IAAAC,SAAQ,GAAG;AACX,QAAI,EAAE;AACN,WAAO;MACL,OAAO,MAAgB;AACrB,YAAI,CAACC,SAAQ,IAAI;AAAG,gBAAM,IAAI,MAAM,6CAA6C;AACjF,cAAM,MAAM,GAAG,IAAI,EAAE,MAAM,GAAG,GAAG;AACjC,cAAM,MAAM,IAAI,WAAW,KAAK,SAAS,GAAG;AAC5C,YAAI,IAAI,IAAI;AACZ,YAAI,IAAI,KAAK,KAAK,MAAM;AACxB,eAAO;MACT;MACA,OAAO,MAAgB;AACrB,YAAI,CAACA,SAAQ,IAAI;AAAG,gBAAM,IAAI,MAAM,6CAA6C;AACjF,cAAM,UAAU,KAAK,MAAM,GAAG,CAAC,GAAG;AAClC,cAAM,cAAc,KAAK,MAAM,CAAC,GAAG;AACnC,cAAM,cAAc,GAAG,OAAO,EAAE,MAAM,GAAG,GAAG;AAC5C,iBAASC,KAAI,GAAGA,KAAI,KAAKA;AACvB,cAAI,YAAYA,EAAC,MAAM,YAAYA,EAAC;AAAG,kBAAM,IAAI,MAAM,kBAAkB;AAC3E,eAAO;MACT;;EAEJ;AAGO,MAAMC,SAAwP;IACnQ;IAAU;IAAO;IAAU;IAAc;IAAe;IAAO;IAAQ;IAAM;;AAwM/E,MAAM,uCAAuC,CAAC,QAC5C,sBAAM,sBAAM,EAAE,GAAG,yBAAS,GAAG,GAAG,qBAAK,EAAE,CAAC;AAWnC,MAAM,SAAqB,0BAChC,4DAA4D;AAmDvD,MAAM,oBAAoB,CAACC,YAChC,sBACE,SAAS,GAAG,CAAC,SAASA,QAAOA,QAAO,IAAI,CAAC,CAAC,GAC1C,MAAM;;;AhBxkBV,MAAMC,SAAQ,UAAK;AACnB,MAAM,EAAE,GAAE,IAAKA;AACf,MAAM,cAAc,kBAAkBC,OAAM;AAE5C,MAAM,gBAAgB,WAAW,KAAK,eAAe,MAAM,EAAE,GAAG,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC;AAQ5F,MAAM,mBAA6B,EAAE,SAAS,UAAY,QAAQ,SAAU;AAErE,MAAM,kBAA0B;AAEvC,MAAM,UAAU,CAAC,SAAqB,UAAUA,QAAO,IAAI,CAAC;AAC5D,MAAM,UAAU,CAAC,SAAqBC,YAAW,IAAI,EAAE,UAAU,GAAG,KAAK;AACzE,MAAM,QAAQ,CAACC,OAAyB;AACtC,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,KAAKA,KAAI,KAAK,KAAK,GAAG;AACxD,YAAM,IAAI,MAAM,sDAAsDA,EAAC;IACzE;AACA,UAAM,MAAM,IAAI,WAAW,CAAC;AAC5B,IAAAD,YAAW,GAAG,EAAE,UAAU,GAAGC,IAAG,KAAK;AACrC,WAAO;EACT;AAqBM,MAAO,QAAP,MAAO,OAAK;IAqFhB,YAAY,KAAa;AAThB;AACA,mCAAgB;AAChB,mCAAgB;AAChB,uCAA+B;AAC/B,+CAA4B;AAC7B;AACA;AACA;AAGN,UAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;AACnC,cAAM,IAAI,MAAM,+CAA+C;MACjE;AACA,WAAK,WAAW,IAAI,YAAY;AAChC,WAAK,QAAQ,IAAI,SAAS;AAC1B,WAAK,YAAY,IAAI,aAAa;AAClC,WAAK,QAAQ,IAAI,SAAS;AAC1B,WAAK,oBAAoB,IAAI,qBAAqB;AAClD,UAAI,CAAC,KAAK,OAAO;AACf,YAAI,KAAK,qBAAqB,KAAK,OAAO;AACxC,gBAAM,IAAI,MAAM,0DAA0D;QAC5E;MACF;AACA,UAAI,KAAK,QAAQ,KAAK;AACpB,cAAM,IAAI,MAAM,iDAAiD;MACnE;AACA,UAAI,IAAI,aAAa,IAAI,YAAY;AACnC,cAAM,IAAI,MAAM,+CAA+C;MACjE;AACA,UAAI,IAAI,YAAY;AAClB,YAAI,CAAC,UAAK,MAAM,iBAAiB,IAAI,UAAU;AAAG,gBAAM,IAAI,MAAM,qBAAqB;AACvF,aAAK,cAAc,IAAI;AACvB,aAAK,aAAa,UAAK,aAAa,IAAI,YAAY,IAAI;MAC1D,WAAW,IAAI,WAAW;AACxB,aAAK,aAAaH,OAAM,UAAU,IAAI,SAAS,EAAE,QAAQ,IAAI;MAC/D,OAAO;AACL,cAAM,IAAI,MAAM,0CAA0C;MAC5D;AACA,WAAK,UAAU,QAAQ,KAAK,UAAU;IACxC;IAlHA,IAAI,cAAW;AACb,UAAI,CAAC,KAAK,SAAS;AACjB,cAAM,IAAI,MAAM,mBAAmB;MACrC;AACA,aAAO,QAAQ,KAAK,OAAO;IAC7B;IACA,IAAI,aAAU;AACZ,aAAO,KAAK;IACd;IACA,IAAI,aAAU;AACZ,aAAO,KAAK;IACd;IACA,IAAI,aAAU;AACZ,aAAO,KAAK,eAAe;IAC7B;IACA,IAAI,YAAS;AACX,aAAO,KAAK,cAAc;IAC5B;IACA,IAAI,qBAAkB;AACpB,YAAM,OAAO,KAAK;AAClB,UAAI,CAAC,MAAM;AACT,cAAM,IAAI,MAAM,gBAAgB;MAClC;AACA,aAAO,YAAY,OACjB,KAAK,UAAU,KAAK,SAAS,SAASI,aAAY,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAE9E;IACA,IAAI,oBAAiB;AACnB,UAAI,CAAC,KAAK,YAAY;AACpB,cAAM,IAAI,MAAM,eAAe;MACjC;AACA,aAAO,YAAY,OAAO,KAAK,UAAU,KAAK,SAAS,QAAQ,KAAK,UAAU,CAAC;IACjF;IAEA,OAAO,eAAe,MAAkB,WAAqB,kBAAgB;AAC3E,MAAAC,QAAO,IAAI;AACX,UAAI,IAAI,KAAK,SAAS,OAAO,IAAI,KAAK,SAAS,KAAK;AAClD,cAAM,IAAI,MACR,mFACE,KAAK,MAAM;MAEjB;AACA,YAAMC,KAAIC,MAAKC,SAAQ,eAAe,IAAI;AAC1C,YAAM,aAAaF,GAAE,MAAM,GAAG,EAAE;AAChC,YAAM,YAAYA,GAAE,MAAM,EAAE;AAC5B,aAAO,IAAI,OAAM,EAAE,UAAU,WAAW,WAAU,CAAE;IACtD;IAEA,OAAO,gBAAgB,WAAmB,WAAqB,kBAAgB;AAE7E,YAAM,YAAwB,YAAY,OAAO,SAAS;AAC1D,YAAM,UAAUJ,YAAW,SAAS;AACpC,YAAM,UAAU,QAAQ,UAAU,GAAG,KAAK;AAC1C,YAAM,MAAM;QACV;QACA,OAAO,UAAU,CAAC;QAClB,mBAAmB,QAAQ,UAAU,GAAG,KAAK;QAC7C,OAAO,QAAQ,UAAU,GAAG,KAAK;QACjC,WAAW,UAAU,MAAM,IAAI,EAAE;;AAEnC,YAAM,MAAM,UAAU,MAAM,EAAE;AAC9B,YAAM,SAAS,IAAI,CAAC,MAAM;AAC1B,UAAI,YAAY,SAAS,SAAS,YAAY,QAAQ,GAAG;AACvD,cAAM,IAAI,MAAM,kBAAkB;MACpC;AACA,UAAI,QAAQ;AACV,eAAO,IAAI,OAAM,EAAE,GAAG,KAAK,YAAY,IAAI,MAAM,CAAC,EAAC,CAAE;MACvD,OAAO;AACL,eAAO,IAAI,OAAM,EAAE,GAAG,KAAK,WAAW,IAAG,CAAE;MAC7C;IACF;IAEO,OAAO,SAAS,MAAuB;AAC5C,aAAO,OAAM,gBAAgB,KAAK,KAAK;IACzC;IA0CA,OAAO,MAAY;AACjB,UAAI,CAAC,UAAU,KAAK,IAAI,GAAG;AACzB,cAAM,IAAI,MAAM,iCAAiC;MACnD;AACA,UAAI,WAAW,KAAK,IAAI,GAAG;AACzB,eAAO;MACT;AACA,YAAM,QAAQ,KAAK,QAAQ,aAAa,EAAE,EAAE,MAAM,GAAG;AAErD,UAAI,QAAe;AACnB,iBAAWO,MAAK,OAAO;AACrB,cAAMC,KAAI,cAAc,KAAKD,EAAC;AAC9B,cAAM,KAAKC,MAAKA,GAAE,CAAC;AACnB,YAAI,CAACA,MAAKA,GAAE,WAAW,KAAK,OAAO,OAAO;AACxC,gBAAM,IAAI,MAAM,0BAA0BD,EAAC;AAC7C,YAAI,MAAM,CAAC;AACX,YAAI,CAAC,OAAO,cAAc,GAAG,KAAK,OAAO,iBAAiB;AACxD,gBAAM,IAAI,MAAM,eAAe;QACjC;AAEA,YAAIC,GAAE,CAAC,MAAM,KAAK;AAChB,iBAAO;QACT;AACA,gBAAQ,MAAM,YAAY,GAAG;MAC/B;AACA,aAAO;IACT;IAEA,YAAY,OAAa;AACvB,UAAI,CAAC,KAAK,cAAc,CAAC,KAAK,WAAW;AACvC,cAAM,IAAI,MAAM,+BAA+B;MACjD;AACA,UAAI,OAAO,MAAM,KAAK;AACtB,UAAI,SAAS,iBAAiB;AAE5B,cAAM,OAAO,KAAK;AAClB,YAAI,CAAC,MAAM;AACT,gBAAM,IAAI,MAAM,qCAAqC;QACvD;AAEA,eAAON,aAAY,WAAW,GAAG,CAAC,GAAG,MAAM,IAAI;MACjD,OAAO;AAEL,eAAOA,aAAY,KAAK,YAAY,IAAI;MAC1C;AACA,YAAME,KAAIC,MAAKC,SAAQ,KAAK,WAAW,IAAI;AAC3C,YAAM,aAAaF,GAAE,MAAM,GAAG,EAAE;AAChC,YAAM,YAAYA,GAAE,MAAM,EAAE;AAC5B,UAAI,CAAC,UAAK,MAAM,iBAAiB,UAAU,GAAG;AAC5C,cAAM,IAAI,MAAM,+BAA+B;MACjD;AACA,YAAM,MAAgB;QACpB,UAAU,KAAK;QACf;QACA,OAAO,KAAK,QAAQ;QACpB,mBAAmB,KAAK;QACxB;;AAEF,YAAM,SAAS,GAAG,UAAU,UAAU;AACtC,UAAI;AAEF,YAAI,KAAK,aAAa;AACpB,gBAAM,QAAQ,GAAG,OAAO,GAAG,UAAU,KAAK,WAAW,IAAI,MAAM;AAC/D,cAAI,CAAC,GAAG,YAAY,KAAK,GAAG;AAC1B,kBAAM,IAAI,MAAM,mEAAmE;UACrF;AACA,cAAI,aAAa,GAAG,QAAQ,KAAK;QACnC,OAAO;AACL,gBAAM,QAAQN,OAAM,UAAU,KAAK,UAAU,EAAE,IAAIA,OAAM,KAAK,SAAS,MAAM,CAAC;AAE9E,cAAI,MAAM,OAAOA,OAAM,IAAI,GAAG;AAC5B,kBAAM,IAAI,MAAM,sEAAsE;UACxF;AACA,cAAI,YAAY,MAAM,QAAQ,IAAI;QACpC;AACA,eAAO,IAAI,OAAM,GAAG;MACtB,SAASW,MAAK;AACZ,eAAO,KAAK,YAAY,QAAQ,CAAC;MACnC;IACF;IAEA,KAAK,MAAgB;AACnB,UAAI,CAAC,KAAK,aAAa;AACrB,cAAM,IAAI,MAAM,oBAAoB;MACtC;AACA,MAAAN,QAAO,MAAM,EAAE;AACf,aAAO,UAAK,KAAK,MAAM,KAAK,aAAa,EAAE,SAAS,MAAK,CAAE;IAC7D;IAEA,OAAO,MAAkB,WAAqB;AAC5C,MAAAA,QAAO,MAAM,EAAE;AACf,MAAAA,QAAO,WAAW,EAAE;AACpB,UAAI,CAAC,KAAK,YAAY;AACpB,cAAM,IAAI,MAAM,mBAAmB;MACrC;AACA,aAAO,UAAK,OAAO,WAAW,MAAM,KAAK,YAAY,EAAE,SAAS,MAAK,CAAE;IACzE;IAEA,kBAAe;AACb,UAAI,KAAK,aAAa;AACpB,aAAK,YAAY,KAAK,CAAC;AACvB,aAAK,cAAc;MACrB;AACA,aAAO;IACT;IACA,SAAM;AACJ,aAAO;QACL,OAAO,KAAK;QACZ,MAAM,KAAK;;IAEf;IAEQ,UAAU,SAAiB,KAAe;AAChD,UAAI,CAAC,KAAK,WAAW;AACnB,cAAM,IAAI,MAAM,kBAAkB;MACpC;AACA,MAAAA,QAAO,KAAK,EAAE;AAEd,aAAOD,aACL,MAAM,OAAO,GACb,IAAI,WAAW,CAAC,KAAK,KAAK,CAAC,GAC3B,MAAM,KAAK,iBAAiB,GAC5B,MAAM,KAAK,KAAK,GAChB,KAAK,WACL,GAAG;IAEP;;;;AiB3TF;;;ACAA;;;ACAA;;;ACAA;AAMM,WAAUQ,SAAQC,IAAU;AAChC,WAAOA,cAAa,cAAe,YAAY,OAAOA,EAAC,KAAKA,GAAE,YAAY,SAAS;EACrF;AAGM,WAAUC,SAAQC,IAAW,QAAgB,IAAE;AACnD,QAAI,CAAC,OAAO,cAAcA,EAAC,KAAKA,KAAI,GAAG;AACrC,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,IAAI,MAAM,GAAG,MAAM,8BAA8BA,EAAC,EAAE;IAC5D;EACF;AAGM,WAAUC,QAAO,OAAmB,QAAiB,QAAgB,IAAE;AAC3E,UAAM,QAAQJ,SAAQ,KAAK;AAC3B,UAAM,MAAM,OAAO;AACnB,UAAM,WAAW,WAAW;AAC5B,QAAI,CAAC,SAAU,YAAY,QAAQ,QAAS;AAC1C,YAAM,SAAS,SAAS,IAAI,KAAK;AACjC,YAAM,QAAQ,WAAW,cAAc,MAAM,KAAK;AAClD,YAAM,MAAM,QAAQ,UAAU,GAAG,KAAK,QAAQ,OAAO,KAAK;AAC1D,YAAM,IAAI,MAAM,SAAS,wBAAwB,QAAQ,WAAW,GAAG;IACzE;AACA,WAAO;EACT;AAGM,WAAUK,OAAMC,IAAQ;AAC5B,QAAI,OAAOA,OAAM,cAAc,OAAOA,GAAE,WAAW;AACjD,YAAM,IAAI,MAAM,yCAAyC;AAC3D,IAAAJ,SAAQI,GAAE,SAAS;AACnB,IAAAJ,SAAQI,GAAE,QAAQ;EACpB;AAGM,WAAUC,SAAQ,UAAe,gBAAgB,MAAI;AACzD,QAAI,SAAS;AAAW,YAAM,IAAI,MAAM,kCAAkC;AAC1E,QAAI,iBAAiB,SAAS;AAAU,YAAM,IAAI,MAAM,uCAAuC;EACjG;AAGM,WAAUC,SAAQ,KAAU,UAAa;AAC7C,IAAAJ,QAAO,KAAK,QAAW,qBAAqB;AAC5C,UAAM,MAAM,SAAS;AACrB,QAAI,IAAI,SAAS,KAAK;AACpB,YAAM,IAAI,MAAM,sDAAsD,GAAG;IAC3E;EACF;AAkBM,WAAUK,UAAS,QAAoB;AAC3C,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,aAAOA,EAAC,EAAE,KAAK,CAAC;IAClB;EACF;AAGM,WAAUC,YAAW,KAAe;AACxC,WAAO,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;EAChE;AAGM,WAAUC,MAAK,MAAc,OAAa;AAC9C,WAAQ,QAAS,KAAK,QAAW,SAAS;EAC5C;AAgIM,WAAUC,aAAY,KAAW;AACrC,QAAI,OAAO,QAAQ;AAAU,YAAM,IAAI,MAAM,iBAAiB;AAC9D,WAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;EACrD;AASM,WAAU,gBAAgB,MAAgB,aAAa,IAAE;AAC7D,QAAI,OAAO,SAAS;AAAU,aAAOA,aAAY,IAAI;AACrD,WAAOC,QAAO,MAAM,QAAW,UAAU;EAC3C;AAqBM,WAAU,UACd,UACA,MAAS;AAET,QAAI,SAAS,UAAa,CAAA,EAAG,SAAS,KAAK,IAAI,MAAM;AACnD,YAAM,IAAI,MAAM,qCAAqC;AACvD,UAAM,SAAS,OAAO,OAAO,UAAU,IAAI;AAC3C,WAAO;EACT;AAwDM,WAAUC,cACd,UACA,OAAiB,CAAA,GAAE;AAEnB,UAAM,QAAa,CAAC,KAAiB,SAAgB,SAAS,IAAI,EAAE,OAAO,GAAG,EAAE,OAAM;AACtF,UAAM,MAAM,SAAS,MAAS;AAC9B,UAAM,YAAY,IAAI;AACtB,UAAM,WAAW,IAAI;AACrB,UAAM,SAAS,CAAC,SAAgB,SAAS,IAAI;AAC7C,WAAO,OAAO,OAAO,IAAI;AACzB,WAAO,OAAO,OAAO,KAAK;EAC5B;AAGM,WAAUC,aAAY,cAAc,IAAE;AAC1C,UAAMC,MAAK,OAAO,eAAe,WAAY,WAAmB,SAAS;AACzE,QAAI,OAAOA,KAAI,oBAAoB;AACjC,YAAM,IAAI,MAAM,wCAAwC;AAC1D,WAAOA,IAAG,gBAAgB,IAAI,WAAW,WAAW,CAAC;EACvD;AAGO,MAAMC,WAAU,CAAC,YAAwC;IAC9D,KAAK,WAAW,KAAK,CAAC,GAAM,GAAM,IAAM,KAAM,IAAM,GAAM,KAAM,GAAM,GAAM,GAAM,MAAM,CAAC;;;;ADzUrF,MAAOC,SAAP,MAAY;IAQhB,YAAY,MAAa,KAAe;AAPxC;AACA;AACA;AACA;AACQ,sCAAW;AACX,uCAAY;AAGlB,MAAAC,OAAM,IAAI;AACV,MAAAC,QAAO,KAAK,QAAW,KAAK;AAC5B,WAAK,QAAQ,KAAK,OAAM;AACxB,UAAI,OAAO,KAAK,MAAM,WAAW;AAC/B,cAAM,IAAI,MAAM,qDAAqD;AACvE,WAAK,WAAW,KAAK,MAAM;AAC3B,WAAK,YAAY,KAAK,MAAM;AAC5B,YAAM,WAAW,KAAK;AACtB,YAAM,MAAM,IAAI,WAAW,QAAQ;AAEnC,UAAI,IAAI,IAAI,SAAS,WAAW,KAAK,OAAM,EAAG,OAAO,GAAG,EAAE,OAAM,IAAK,GAAG;AACxE,eAASC,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK;AAC/C,WAAK,MAAM,OAAO,GAAG;AAErB,WAAK,QAAQ,KAAK,OAAM;AAExB,eAASA,KAAI,GAAGA,KAAI,IAAI,QAAQA;AAAK,YAAIA,EAAC,KAAK,KAAO;AACtD,WAAK,MAAM,OAAO,GAAG;AACrB,MAAAC,OAAM,GAAG;IACX;IACA,OAAO,KAAe;AACpB,MAAAC,SAAQ,IAAI;AACZ,WAAK,MAAM,OAAO,GAAG;AACrB,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAA,SAAQ,IAAI;AACZ,MAAAH,QAAO,KAAK,KAAK,WAAW,QAAQ;AACpC,WAAK,WAAW;AAChB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,MAAM,OAAO,GAAG;AACrB,WAAK,MAAM,WAAW,GAAG;AACzB,WAAK,QAAO;IACd;IACA,SAAM;AACJ,YAAM,MAAM,IAAI,WAAW,KAAK,MAAM,SAAS;AAC/C,WAAK,WAAW,GAAG;AACnB,aAAO;IACT;IACA,WAAW,IAAa;AAEtB,kBAAO,OAAO,OAAO,OAAO,eAAe,IAAI,GAAG,CAAA,CAAE;AACpD,YAAM,EAAE,OAAO,OAAO,UAAU,WAAW,UAAU,UAAS,IAAK;AACnE,WAAK;AACL,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,YAAY;AACf,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,SAAG,QAAQ,MAAM,WAAW,GAAG,KAAK;AACpC,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;IACA,UAAO;AACL,WAAK,YAAY;AACjB,WAAK,MAAM,QAAO;AAClB,WAAK,MAAM,QAAO;IACpB;;AAaK,MAAMI,QAGT,CAAC,MAAa,KAAiB,YACjC,IAAIN,OAAW,MAAM,GAAG,EAAE,OAAO,OAAO,EAAE,OAAM;AAClD,EAAAM,MAAK,SAAS,CAAC,MAAa,QAAoB,IAAIN,OAAW,MAAM,GAAG;;;ADnExE,WAAS,WAAW,MAAa,WAAqB,OAAiB,OAAgB;AACrF,IAAAO,OAAM,IAAI;AACV,UAAM,OAAO,UAAU,EAAE,OAAO,IAAI,WAAW,GAAE,GAAI,KAAK;AAC1D,UAAM,EAAE,GAAAC,IAAG,OAAO,UAAS,IAAK;AAChC,IAAAC,SAAQD,IAAG,GAAG;AACd,IAAAC,SAAQ,OAAO,OAAO;AACtB,IAAAA,SAAQ,WAAW,WAAW;AAC9B,QAAID,KAAI;AAAG,YAAM,IAAI,MAAM,6BAA6B;AACxD,UAAM,WAAW,gBAAgB,WAAW,UAAU;AACtD,UAAM,OAAO,gBAAgB,OAAO,MAAM;AAE1C,UAAM,KAAK,IAAI,WAAW,KAAK;AAE/B,UAAM,MAAME,MAAK,OAAO,MAAM,QAAQ;AACtC,UAAM,UAAU,IAAI,WAAU,EAAG,OAAO,IAAI;AAC5C,WAAO,EAAE,GAAAF,IAAG,OAAO,WAAW,IAAI,KAAK,QAAO;EAChD;AAEA,WAAS,aACP,KACA,SACA,IACA,MACAG,IAAa;AAEb,QAAI,QAAO;AACX,YAAQ,QAAO;AACf,QAAI;AAAM,WAAK,QAAO;AACtB,IAAAC,OAAMD,EAAC;AACP,WAAO;EACT;AAWM,WAAU,OACd,MACA,UACA,MACA,MAAe;AAEf,UAAM,EAAE,GAAAH,IAAG,OAAO,IAAI,KAAK,QAAO,IAAK,WAAW,MAAM,UAAU,MAAM,IAAI;AAC5E,QAAI;AACJ,UAAM,MAAM,IAAI,WAAW,CAAC;AAC5B,UAAM,OAAOK,YAAW,GAAG;AAC3B,UAAMF,KAAI,IAAI,WAAW,IAAI,SAAS;AAEtC,aAAS,KAAK,GAAG,MAAM,GAAG,MAAM,OAAO,MAAM,OAAO,IAAI,WAAW;AAEjE,YAAM,KAAK,GAAG,SAAS,KAAK,MAAM,IAAI,SAAS;AAC/C,WAAK,SAAS,GAAG,IAAI,KAAK;AAG1B,OAAC,OAAO,QAAQ,WAAW,IAAI,GAAG,OAAO,GAAG,EAAE,WAAWA,EAAC;AAC1D,SAAG,IAAIA,GAAE,SAAS,GAAG,GAAG,MAAM,CAAC;AAC/B,eAAS,KAAK,GAAG,KAAKH,IAAG,MAAM;AAE7B,YAAI,WAAW,IAAI,EAAE,OAAOG,EAAC,EAAE,WAAWA,EAAC;AAC3C,iBAASG,KAAI,GAAGA,KAAI,GAAG,QAAQA;AAAK,aAAGA,EAAC,KAAKH,GAAEG,EAAC;MAClD;IACF;AACA,WAAO,aAAa,KAAK,SAAS,IAAI,MAAMH,EAAC;EAC/C;;;AG9FA;;;ACAA;AAOM,WAAUI,KAAIC,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAM,CAACD,KAAIE;EACzB;AAGM,WAAUC,KAAIH,IAAWC,IAAWC,IAAS;AACjD,WAAQF,KAAIC,KAAMD,KAAIE,KAAMD,KAAIC;EAClC;AAMM,MAAgBE,UAAhB,MAAsB;IAoB1B,YAAY,UAAkB,WAAmB,WAAmBC,OAAa;AAbxE;AACA;AACA;AACA;AAGC;;AACA;AACA,sCAAW;AACX,oCAAS;AACT,iCAAM;AACN,uCAAY;AAGpB,WAAK,WAAW;AAChB,WAAK,YAAY;AACjB,WAAK,YAAY;AACjB,WAAK,OAAOA;AACZ,WAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,WAAK,OAAOC,YAAW,KAAK,MAAM;IACpC;IACA,OAAO,MAAgB;AACrB,MAAAC,SAAQ,IAAI;AACZ,MAAAC,QAAO,IAAI;AACX,YAAM,EAAE,MAAM,QAAQ,SAAQ,IAAK;AACnC,YAAM,MAAM,KAAK;AACjB,eAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,cAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,YAAI,SAAS,UAAU;AACrB,gBAAM,WAAWF,YAAW,IAAI;AAChC,iBAAO,YAAY,MAAM,KAAK,OAAO;AAAU,iBAAK,QAAQ,UAAU,GAAG;AACzE;QACF;AACA,eAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,aAAK,OAAO;AACZ,eAAO;AACP,YAAI,KAAK,QAAQ,UAAU;AACzB,eAAK,QAAQ,MAAM,CAAC;AACpB,eAAK,MAAM;QACb;MACF;AACA,WAAK,UAAU,KAAK;AACpB,WAAK,WAAU;AACf,aAAO;IACT;IACA,WAAW,KAAe;AACxB,MAAAC,SAAQ,IAAI;AACZ,MAAAE,SAAQ,KAAK,IAAI;AACjB,WAAK,WAAW;AAIhB,YAAM,EAAE,QAAQ,MAAM,UAAU,MAAAJ,MAAI,IAAK;AACzC,UAAI,EAAE,IAAG,IAAK;AAEd,aAAO,KAAK,IAAI;AAChB,MAAAK,OAAM,KAAK,OAAO,SAAS,GAAG,CAAC;AAG/B,UAAI,KAAK,YAAY,WAAW,KAAK;AACnC,aAAK,QAAQ,MAAM,CAAC;AACpB,cAAM;MACR;AAEA,eAASC,KAAI,KAAKA,KAAI,UAAUA;AAAK,eAAOA,EAAC,IAAI;AAIjD,WAAK,aAAa,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGN,KAAI;AAC7D,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM,QAAQC,YAAW,GAAG;AAC5B,YAAM,MAAM,KAAK;AAEjB,UAAI,MAAM;AAAG,cAAM,IAAI,MAAM,2CAA2C;AACxE,YAAM,SAAS,MAAM;AACrB,YAAM,QAAQ,KAAK,IAAG;AACtB,UAAI,SAAS,MAAM;AAAQ,cAAM,IAAI,MAAM,oCAAoC;AAC/E,eAASK,KAAI,GAAGA,KAAI,QAAQA;AAAK,cAAM,UAAU,IAAIA,IAAG,MAAMA,EAAC,GAAGN,KAAI;IACxE;IACA,SAAM;AACJ,YAAM,EAAE,QAAQ,UAAS,IAAK;AAC9B,WAAK,WAAW,MAAM;AACtB,YAAM,MAAM,OAAO,MAAM,GAAG,SAAS;AACrC,WAAK,QAAO;AACZ,aAAO;IACT;IACA,WAAW,IAAM;AACf,kBAAO,IAAK,KAAK,YAAmB;AACpC,SAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,YAAM,EAAE,UAAU,QAAQ,QAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,SAAG,YAAY;AACf,SAAG,WAAW;AACd,SAAG,SAAS;AACZ,SAAG,MAAM;AACT,UAAI,SAAS;AAAU,WAAG,OAAO,IAAI,MAAM;AAC3C,aAAO;IACT;IACA,QAAK;AACH,aAAO,KAAK,WAAU;IACxB;;AASK,MAAMO,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAcM,MAAMC,aAAyC,4BAAY,KAAK;IACrE;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;;;AC3JD;AAKA,MAAMC,cAA6B,uBAAO,KAAK,KAAK,CAAC;AACrD,MAAMC,QAAuB,uBAAO,EAAE;AAEtC,WAASC,SACPC,IACA,KAAK,OAAK;AAKV,QAAI;AAAI,aAAO,EAAE,GAAG,OAAOA,KAAIH,WAAU,GAAG,GAAG,OAAQG,MAAKF,QAAQD,WAAU,EAAC;AAC/E,WAAO,EAAE,GAAG,OAAQG,MAAKF,QAAQD,WAAU,IAAI,GAAG,GAAG,OAAOG,KAAIH,WAAU,IAAI,EAAC;EACjF;AAEA,WAASI,OAAM,KAAe,KAAK,OAAK;AACtC,UAAM,MAAM,IAAI;AAChB,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,QAAI,KAAK,IAAI,YAAY,GAAG;AAC5B,aAASC,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC5B,YAAM,EAAE,GAAAC,IAAG,GAAAC,GAAC,IAAKL,SAAQ,IAAIG,EAAC,GAAG,EAAE;AACnC,OAAC,GAAGA,EAAC,GAAG,GAAGA,EAAC,CAAC,IAAI,CAACC,IAAGC,EAAC;IACxB;AACA,WAAO,CAAC,IAAI,EAAE;EAChB;AAIA,MAAMC,SAAQ,CAACC,IAAW,IAAYC,OAAsBD,OAAMC;AAClE,MAAMC,SAAQ,CAACF,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAMF;AAEpF,MAAMG,UAAS,CAACJ,IAAWG,IAAWF,OAAuBD,OAAMC,KAAME,MAAM,KAAKF;AACpF,MAAMI,UAAS,CAACL,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAMF;AAErF,MAAMK,UAAS,CAACN,IAAWG,IAAWF,OAAuBD,MAAM,KAAKC,KAAOE,OAAOF,KAAI;AAC1F,MAAMM,UAAS,CAACP,IAAWG,IAAWF,OAAuBD,OAAOC,KAAI,KAAQE,MAAM,KAAKF;AAa3F,WAASO,KACP,IACA,IACA,IACA,IAAU;AAKV,UAAMC,MAAK,OAAO,MAAM,OAAO;AAC/B,WAAO,EAAE,GAAI,KAAK,MAAOA,KAAI,KAAK,KAAM,KAAM,GAAG,GAAGA,KAAI,EAAC;EAC3D;AAEA,MAAMC,SAAQ,CAAC,IAAY,IAAY,QAAwB,OAAO,MAAM,OAAO,MAAM,OAAO;AAChG,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,OACjD,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAC3C,MAAMC,SAAQ,CAAC,IAAY,IAAY,IAAY,QAChD,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AACjD,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,OAC7D,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;AAChD,MAAMC,SAAQ,CAAC,IAAY,IAAY,IAAY,IAAY,QAC5D,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC9D,MAAMC,SAAQ,CAAC,KAAa,IAAY,IAAY,IAAY,IAAY,OACzE,KAAK,KAAK,KAAK,KAAK,MAAO,MAAM,KAAK,KAAM,KAAM;;;AF3DrD,MAAMC,YAA2B,4BAAY,KAAK;IAChD;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IACpF;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;IAAY;GACrF;AAGD,MAAMC,YAA2B,oBAAI,YAAY,EAAE;AAGnD,MAAeC,YAAf,cAAuDC,QAAS;IAY9D,YAAY,WAAiB;AAC3B,YAAM,IAAI,WAAW,GAAG,KAAK;IAC/B;IACU,MAAG;AACX,YAAM,EAAE,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACnC,aAAO,CAACP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IAChC;;IAEU,IACRP,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAWC,IAAS;AAEtF,WAAK,IAAIP,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;AACb,WAAK,IAAIC,KAAI;IACf;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU;AAAG,QAAAX,UAASW,EAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAC5B,cAAM,MAAMX,UAASW,KAAI,EAAE;AAC3B,cAAMC,MAAKZ,UAASW,KAAI,CAAC;AACzB,cAAM,KAAKE,MAAK,KAAK,CAAC,IAAIA,MAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,cAAM,KAAKA,MAAKD,KAAI,EAAE,IAAIC,MAAKD,KAAI,EAAE,IAAKA,QAAO;AACjD,QAAAZ,UAASW,EAAC,IAAK,KAAKX,UAASW,KAAI,CAAC,IAAI,KAAKX,UAASW,KAAI,EAAE,IAAK;MACjE;AAEA,UAAI,EAAE,GAAAR,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,IAAG,GAAAC,GAAC,IAAK;AACjC,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAM,SAASE,MAAKN,IAAG,CAAC,IAAIM,MAAKN,IAAG,EAAE,IAAIM,MAAKN,IAAG,EAAE;AACpD,cAAM,KAAMG,KAAI,SAASI,KAAIP,IAAGC,IAAGC,EAAC,IAAIV,UAASY,EAAC,IAAIX,UAASW,EAAC,IAAK;AACrE,cAAM,SAASE,MAAKV,IAAG,CAAC,IAAIU,MAAKV,IAAG,EAAE,IAAIU,MAAKV,IAAG,EAAE;AACpD,cAAM,KAAM,SAASY,KAAIZ,IAAGC,IAAGC,EAAC,IAAK;AACrC,QAAAK,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAKD,KAAI,KAAM;AACf,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAID;AACJ,QAAAA,KAAK,KAAK,KAAM;MAClB;AAEA,MAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,MAAAC,KAAKA,KAAI,KAAK,IAAK;AACnB,WAAK,IAAIP,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,IAAGC,EAAC;IACjC;IACU,aAAU;AAClB,MAAAM,OAAMhB,SAAQ;IAChB;IACA,UAAO;AACL,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,MAAAgB,OAAM,KAAK,MAAM;IACnB;;AAII,MAAOC,WAAP,cAAuBhB,UAAiB;IAW5C,cAAA;AACE,YAAM,EAAE;AATA;;+BAAYiB,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;AAC3B,+BAAYA,WAAU,CAAC,IAAI;IAGrC;;AAuBF,MAAMC,QAAwB,uBAAUC,OAAM;IAC5C;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE;IAAsB;IAAsB;IAAsB;IAClE,IAAI,CAAAC,OAAK,OAAOA,EAAC,CAAC,CAAC,GAAE;AACvB,MAAMC,aAA6B,uBAAMH,MAAK,CAAC,GAAE;AACjD,MAAMI,aAA6B,uBAAMJ,MAAK,CAAC,GAAE;AAGjD,MAAMK,cAA6B,oBAAI,YAAY,EAAE;AACrD,MAAMC,cAA6B,oBAAI,YAAY,EAAE;AAGrD,MAAeC,YAAf,cAAuDC,QAAS;IAqB9D,YAAY,WAAiB;AAC3B,YAAM,KAAK,WAAW,IAAI,KAAK;IACjC;;IAEU,MAAG;AAIX,YAAM,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAC3E,aAAO,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;IACxE;;IAEU,IACR,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IACpF,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAY,IAAU;AAE9F,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;AACf,WAAK,KAAK,KAAK;IACjB;IACU,QAAQ,MAAgB,QAAc;AAE9C,eAASC,KAAI,GAAGA,KAAI,IAAIA,MAAK,UAAU,GAAG;AACxC,QAAAJ,YAAWI,EAAC,IAAI,KAAK,UAAU,MAAM;AACrC,QAAAH,YAAWG,EAAC,IAAI,KAAK,UAAW,UAAU,CAAE;MAC9C;AACA,eAASA,KAAI,IAAIA,KAAI,IAAIA,MAAK;AAE5B,cAAM,OAAOJ,YAAWI,KAAI,EAAE,IAAI;AAClC,cAAM,OAAOH,YAAWG,KAAI,EAAE,IAAI;AAClC,cAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAC3F,cAAM,MAAUC,QAAO,MAAM,MAAM,CAAC,IAAQA,QAAO,MAAM,MAAM,CAAC,IAAQC,OAAM,MAAM,MAAM,CAAC;AAE3F,cAAM,MAAMR,YAAWI,KAAI,CAAC,IAAI;AAChC,cAAM,MAAMH,YAAWG,KAAI,CAAC,IAAI;AAChC,cAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQI,QAAO,KAAK,KAAK,EAAE,IAAQH,OAAM,KAAK,KAAK,CAAC;AACvF,cAAM,MAAUC,QAAO,KAAK,KAAK,EAAE,IAAQG,QAAO,KAAK,KAAK,EAAE,IAAQF,OAAM,KAAK,KAAK,CAAC;AAEvF,cAAM,OAAWG,OAAM,KAAK,KAAKV,YAAWG,KAAI,CAAC,GAAGH,YAAWG,KAAI,EAAE,CAAC;AACtE,cAAM,OAAWQ,OAAM,MAAM,KAAK,KAAKZ,YAAWI,KAAI,CAAC,GAAGJ,YAAWI,KAAI,EAAE,CAAC;AAC5E,QAAAJ,YAAWI,EAAC,IAAI,OAAO;AACvB,QAAAH,YAAWG,EAAC,IAAI,OAAO;MACzB;AACA,UAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAE,IAAK;AAEzE,eAASA,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAE3B,cAAM,UAAcC,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE;AAEvF,cAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAChC,cAAM,OAAQ,KAAK,KAAO,CAAC,KAAK;AAGhC,cAAM,OAAWG,OAAM,IAAI,SAAS,MAAMd,WAAUK,EAAC,GAAGH,YAAWG,EAAC,CAAC;AACrE,cAAM,MAAUU,OAAM,MAAM,IAAI,SAAS,MAAMhB,WAAUM,EAAC,GAAGJ,YAAWI,EAAC,CAAC;AAC1E,cAAM,MAAM,OAAO;AAEnB,cAAM,UAAcC,QAAO,IAAI,IAAI,EAAE,IAAQI,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,UAAcF,QAAO,IAAI,IAAI,EAAE,IAAQG,QAAO,IAAI,IAAI,EAAE,IAAQA,QAAO,IAAI,IAAI,EAAE;AACvF,cAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,cAAM,OAAQ,KAAK,KAAO,KAAK,KAAO,KAAK;AAC3C,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,SAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASK,KAAI,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;AAC5D,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV,cAAM,MAAUC,OAAM,KAAK,SAAS,IAAI;AACxC,aAASC,OAAM,KAAK,KAAK,SAAS,IAAI;AACtC,aAAK,MAAM;MACb;AAEA,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASF,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,OAAC,EAAE,GAAG,IAAI,GAAG,GAAE,IAASA,KAAI,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;AACpE,WAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;IACzE;IACU,aAAU;AAClB,MAAAG,OAAMlB,aAAYC,WAAU;IAC9B;IACA,UAAO;AACL,MAAAiB,OAAM,KAAK,MAAM;AACjB,WAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACzD;;AAII,MAAOC,WAAP,cAAuBjB,UAAiB;IAkB5C,cAAA;AACE,YAAM,EAAE;AAlBA,gCAAakB,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,CAAC,IAAI;AAC5B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;AAC7B,gCAAaA,WAAU,EAAE,IAAI;IAIvC;;AAsGK,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;AASxB,MAAMC,UAAyC,gBAAAC;IACpD,MAAM,IAAIC,SAAO;IACD,gBAAAC,SAAQ,CAAI;EAAC;;;AJtb/B,MAAM,aAAa,CAACC,cAAaA,UAAS,CAAC,MAAM;AAKjD,WAAS,KAAK,KAAK;AACf,QAAI,OAAO,QAAQ;AACf,YAAM,IAAI,UAAU,4BAA4B,OAAO,GAAG;AAC9D,WAAO,IAAI,UAAU,MAAM;AAAA,EAC/B;AACA,WAAS,UAAU,KAAK;AACpB,UAAM,OAAO,KAAK,GAAG;AACrB,UAAM,QAAQ,KAAK,MAAM,GAAG;AAC5B,QAAI,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,SAAS,MAAM,MAAM;AAC3C,YAAM,IAAI,MAAM,kBAAkB;AACtC,WAAO,EAAE,MAAM,MAAM,MAAM;AAAA,EAC/B;AACA,WAAS,SAAS,KAAK;AACnB,IAAAC,QAAO,GAAG;AACV,QAAI,CAAC,CAAC,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,SAAS,IAAI,MAAM;AACzC,YAAM,IAAI,MAAM,wBAAwB;AAAA,EAChD;AASO,WAAS,iBAAiBD,WAAU,WAAW,KAAK;AACvD,IAAAE,SAAQ,QAAQ;AAChB,QAAI,WAAW,OAAO,KAAK,WAAW;AAClC,YAAM,IAAI,UAAU,iBAAiB;AACzC,WAAO,kBAAkBC,aAAY,WAAW,CAAC,GAAGH,SAAQ;AAAA,EAChE;AACA,MAAM,eAAe,CAAC,YAAY;AAE9B,UAAM,WAAW,IAAI,QAAQ,SAAS;AAGtC,WAAO,IAAI,WAAW,CAAEI,QAAO,OAAO,EAAE,CAAC,KAAK,YAAa,QAAQ,CAAC;AAAA,EACxE;AACA,WAAS,SAASJ,WAAU;AACxB,QAAI,CAAC,MAAM,QAAQA,SAAQ,KAAKA,UAAS,WAAW,QAAQ,OAAOA,UAAS,CAAC,MAAM;AAC/E,YAAM,IAAI,MAAM,0CAA0C;AAC9D,IAAAA,UAAS,QAAQ,CAACK,OAAM;AACpB,UAAI,OAAOA,OAAM;AACb,cAAM,IAAI,MAAM,mCAAmCA,EAAC;AAAA,IAC5D,CAAC;AACD,WAAOC,OAAU,MAAMA,OAAU,SAAS,GAAG,YAAY,GAAGA,OAAU,OAAO,IAAI,IAAI,GAAGA,OAAU,SAASN,SAAQ,CAAC;AAAA,EACxH;AAiCO,WAAS,kBAAkB,SAASO,WAAU;AACjD,aAAS,OAAO;AAChB,UAAM,QAAQ,SAASA,SAAQ,EAAE,OAAO,OAAO;AAC/C,WAAO,MAAM,KAAK,WAAWA,SAAQ,IAAI,WAAW,GAAG;AAAA,EAC3D;AAaA,MAAM,QAAQ,CAAC,eAAe,KAAK,aAAa,UAAU;AAwBnD,WAAS,mBAAmB,UAAU,aAAa,IAAI;AAC1D,WAAO,OAAOC,SAAQ,UAAU,QAAQ,EAAE,MAAM,MAAM,UAAU,GAAG,EAAE,GAAG,MAAM,OAAO,GAAG,CAAC;AAAA,EAC7F;;;AOtIA;AAAO,MAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KA+/DnB,MAAM,IAAI;;;AzBv9DR,MAAM,kBAAN,MAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQzB,MAAM,cAAc,SAAS;AACzB,UAAI,CAAC,QAAQ,MAAM;AACf,cAAM,IAAI,MAAM,kCAAkC;AAAA,MACtD;AACA,UAAI,CAAC,QAAQ,MAAM;AACf,cAAM,IAAI,MAAM,4DAA+D;AAAA,MACnF;AACA,UAAI;AAEA,cAAM,YAAY,MAAM,eAAe,QAAQ,IAAI;AAEnD,cAAM,WAAW,UAAU,OAAO,QAAQ,IAAI;AAC9C,YAAI,CAAC,SAAS,YAAY;AACtB,gBAAM,IAAI,MAAM,wCAAwC,QAAQ,IAAI,EAAE;AAAA,QAC1E;AACA,YAAI,CAAC,SAAS,WAAW;AACrB,gBAAM,IAAI,MAAM,uCAAuC,QAAQ,IAAI,EAAE;AAAA,QACzE;AACA,eAAO;AAAA,UACH,YAAY,SAAS;AAAA,UACrB,WAAW,SAAS;AAAA;AAAA,QACxB;AAAA,MACJ,SACO,OAAO;AACV,cAAM,IAAI,MAAM,mCAAmC,QAAQ,IAAI,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MAChI;AAAA,IACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,eAAe,UAAU,YAAY;AACjC,aAAO,mBAAmB,UAAU,UAAU;AAAA,IAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,iBAAiB,WAAW,KAAK;AAC7B,aAAO,iBAAsB,UAAU,QAAQ;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASA,OAAO,YAAY,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG;AACnD,aAAO,YAAY,OAAO,KAAK,MAAM,IAAI,KAAK;AAAA,IAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASA,OAAO,kBAAkB,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG;AACzD,aAAO,YAAY,OAAO,KAAK,MAAM,IAAI,KAAK;AAAA,IAClD;AAAA,EACJ;;;A0BpHA;AAUA,MAAM,kBAAkB;AAIxB,WAAS,aAAa,MAAM;AACxB,QAAI,MAAM;AACV,eAAW,QAAQ,MAAM;AACrB,YAAM,MAAM,OAAO,OAAO,IAAI;AAAA,IAClC;AACA,QAAI,UAAU;AACd,WAAO,MAAM,IAAI;AACb,YAAM,YAAY,OAAO,MAAM,GAAG;AAClC,gBAAU,gBAAgB,SAAS,IAAI;AACvC,YAAM,MAAM;AAAA,IAChB;AAEA,eAAW,QAAQ,MAAM;AACrB,UAAI,SAAS;AACT;AACJ,gBAAU,MAAM;AAAA,IACpB;AACA,WAAO;AAAA,EACX;AAIA,WAAS,aAAa,KAAK;AACvB,QAAI,MAAM;AACV,eAAW,QAAQ,KAAK;AACpB,YAAM,QAAQ,gBAAgB,QAAQ,IAAI;AAC1C,UAAI,UAAU,IAAI;AACd,cAAM,IAAI,MAAM,6BAA6B,IAAI,EAAE;AAAA,MACvD;AACA,YAAM,MAAM,MAAM,OAAO,KAAK;AAAA,IAClC;AAEA,UAAM,QAAQ,CAAC;AACf,WAAO,MAAM,IAAI;AACb,YAAM,QAAQ,OAAO,MAAM,IAAI,CAAC;AAChC,YAAM,MAAM;AAAA,IAChB;AAEA,eAAW,QAAQ,KAAK;AACpB,UAAI,SAAS;AACT;AACJ,YAAM,QAAQ,CAAC;AAAA,IACnB;AACA,WAAO,IAAI,WAAW,KAAK;AAAA,EAC/B;AASO,WAAS,UAAU,YAAY,aAAa,MAAM,UAAU,WAAW;AAC1E,QAAI,WAAW,WAAW,IAAI;AAC1B,YAAM,IAAI,MAAM,8BAA8B;AAAA,IAClD;AAEA,UAAM,UAAU,YAAY,YAAY,MAAO;AAE/C,UAAM,UAAU,IAAI,WAAW,aAAa,KAAK,EAAE;AACnD,YAAQ,CAAC,IAAI;AACb,YAAQ,IAAI,YAAY,CAAC;AACzB,QAAI,YAAY;AACZ,cAAQ,EAAE,IAAI;AAAA,IAClB;AAEA,UAAM,QAAQC,QAAO,OAAO;AAC5B,UAAM,QAAQA,QAAO,KAAK;AAC1B,UAAMC,YAAW,MAAM,MAAM,GAAG,CAAC;AAEjC,UAAM,OAAO,IAAI,WAAW,QAAQ,SAAS,CAAC;AAC9C,SAAK,IAAI,OAAO;AAChB,SAAK,IAAIA,WAAU,QAAQ,MAAM;AACjC,WAAO,aAAa,IAAI;AAAA,EAC5B;AAQO,WAAS,UAAU,KAAK;AAC3B,UAAM,OAAO,aAAa,GAAG;AAC7B,QAAI,KAAK,WAAW,MAAM,KAAK,WAAW,IAAI;AAC1C,YAAM,IAAI,MAAM,oBAAoB;AAAA,IACxC;AAEA,UAAM,UAAU,KAAK,MAAM,GAAG,EAAE;AAChC,UAAMA,YAAW,KAAK,MAAM,EAAE;AAE9B,UAAM,QAAQD,QAAO,OAAO;AAC5B,UAAM,QAAQA,QAAO,KAAK;AAC1B,UAAM,mBAAmB,MAAM,MAAM,GAAG,CAAC;AACzC,QAAI,CAACC,UAAS,MAAM,CAAC,MAAMC,OAAM,SAAS,iBAAiBA,EAAC,CAAC,GAAG;AAC5D,YAAM,IAAI,MAAM,sBAAsB;AAAA,IAC1C;AAEA,UAAM,UAAU,QAAQ,CAAC;AACzB,UAAM,UAAU,YAAY,MAAO,YAAY,YAAY,MAAO,YAAY;AAC9E,QAAI,CAAC,SAAS;AACV,YAAM,IAAI,MAAM,+BAA+B,QAAQ,SAAS,EAAE,CAAC,EAAE;AAAA,IACzE;AAEA,UAAM,aAAa,QAAQ,WAAW,MAAM,QAAQ,EAAE,MAAM;AAC5D,UAAM,aAAa,QAAQ,MAAM,GAAG,EAAE;AACtC,WAAO;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,IACJ;AAAA,EACJ;;;AjCvHA,EAAU,IAAI,iBAAiB,CAAC,QAAQ,SAAS,KAAKC,SAAQ,KAAe,IAAI,YAAY,GAAG,IAAI,CAAC;AAO9F,MAAM,gBAAN,MAAoB;AAAA,IAApB;AACH,qCAAU;AACV,qCAAU;AACV,0CAAe;AAAA,QACX,YAAY,IAAI,gBAAgB;AAAA,MACpC;AAAA;AAAA,IACA,MAAM,kBAAkB;AACpB,YAAM,aAAuB,MAAM,iBAAiB;AACpD,YAAM,YAAsB,aAAa,YAAY,IAAI;AACzD,aAAO;AAAA,QACH;AAAA,QACA;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,MAAM,KAAK,YAAY,SAAS;AAC5B,UAAI;AAEA,cAAM,YAAY,MAAgB,KAAK,SAAS,UAAU;AAC1D,eAAO,UAAU,kBAAkB;AAAA,MACvC,SACO,OAAO;AACV,cAAM,IAAI,MAAM,iCAAiC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MAC7G;AAAA,IACJ;AAAA,IACA,MAAM,OAAO,WAAW,SAAS,WAAW;AACxC,UAAI;AACA,eAAiB,OAAO,WAAW,SAAS,SAAS;AAAA,MACzD,SACO,OAAO;AAEV,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,gBAAgB,KAAK;AAEjB,aAAO,WAAW,GAAG;AAAA,IACzB;AAAA,IACA,gBAAgB,SAAS;AACrB,aAAO,WAAW,OAAO;AAAA,IAC7B;AAAA,IACA,iBAAiB,MAAM;AAEnB,aAAO,UAAU,MAAM,MAAM,SAAS;AAAA,IAC1C;AAAA,IACA,iBAAiB,SAAS;AAEtB,UAAI,QAAQ,WAAW,IAAI;AAEvB,cAAM,QAAQ,WAAW,OAAO;AAChC,YAAI,MAAM,WAAW,IAAI;AACrB,gBAAM,IAAI,MAAM,8BAA8B;AAAA,QAClD;AACA,eAAO;AAAA,MACX,OACK;AAED,YAAI;AACA,gBAAM,EAAE,WAAW,IAAI,UAAU,OAAO;AACxC,iBAAO;AAAA,QACX,SACO,OAAO;AACV,gBAAM,IAAI,MAAM,+BAA+B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,QAC3G;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;;;AkC/EA;AAEA,MAAI,eAAe;AACnB,iBAAe,eAAe;AAC1B,QAAI,CAAC,cAAc;AACf,YAAMC,UAAS,MAAM;AAErB,qBAAeA,QAAO,WAAWA;AAAA,IACrC;AACA,WAAO;AAAA,EACX;AACA,MAAM,eAAe;AAAA,IACjB,aAAa,EAAE,WAAW,MAAM,YAAY,MAAM,WAAW,KAAK;AAAA,IAClE,aAAa,EAAE,WAAW,MAAM,YAAY,MAAM,WAAW,KAAK;AAAA,IAClE,aAAa,EAAE,WAAW,MAAM,YAAY,MAAM,WAAW,KAAK;AAAA,EACtE;AAOA,MAAM,iBAAN,MAAqB;AAAA,IAArB;AACI,qCAAU;AACV,0CAAe,CAAC;AAAA;AAAA,IAChB,MAAM,kBAAkB;AACpB,UAAI;AACA,cAAMC,aAAY,MAAM,aAAa;AACrC,cAAM,UAAU,MAAMA,WAAU,QAAQ;AACxC,eAAO;AAAA,UACH,WAAW,IAAI,WAAW,QAAQ,SAAS;AAAA,UAC3C,YAAY,IAAI,WAAW,QAAQ,UAAU;AAAA,QACjD;AAAA,MACJ,SACO,OAAO;AACV,cAAM,IAAI,MAAM,GAAG,KAAK,OAAO,2BAA2B,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MACtH;AAAA,IACJ;AAAA,IACA,MAAM,KAAK,YAAY,SAAS;AAC5B,UAAI;AACA,cAAMA,aAAY,MAAM,aAAa;AACrC,cAAM,YAAY,MAAMA,WAAU,aAAa,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,UAAU,CAAC;AAC5F,eAAO,IAAI,WAAW,SAAS;AAAA,MACnC,SACO,OAAO;AACV,cAAM,IAAI,MAAM,GAAG,KAAK,OAAO,oBAAoB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC,EAAE;AAAA,MAC/G;AAAA,IACJ;AAAA,IACA,MAAM,OAAO,WAAW,SAAS,WAAW;AACxC,UAAI;AACA,cAAMA,aAAY,MAAM,aAAa;AACrC,eAAO,MAAMA,WAAU,eAAe,OAAO,KAAK,SAAS,GAAG,OAAO,KAAK,OAAO,GAAG,OAAO,KAAK,SAAS,CAAC;AAAA,MAC9G,SACO,OAAO;AAEV,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,gBAAgB,KAAK;AACjB,aAAO,WAAW,GAAG;AAAA,IACzB;AAAA,IACA,gBAAgB,SAAS;AACrB,YAAM,QAAQ,WAAW,OAAO;AAChC,UAAI,MAAM,WAAW,KAAK,MAAM,WAAW;AACvC,cAAM,IAAI,MAAM,GAAG,KAAK,OAAO,uBAAuB,KAAK,MAAM,SAAS,eAAe,MAAM,MAAM,EAAE;AAAA,MAC3G;AACA,aAAO;AAAA,IACX;AAAA,IACA,iBAAiB,MAAM;AACnB,aAAO,WAAW,IAAI;AAAA,IAC1B;AAAA,IACA,iBAAiB,SAAS;AACtB,YAAM,QAAQ,WAAW,OAAO;AAChC,UAAI,MAAM,WAAW,KAAK,MAAM,YAAY;AACxC,cAAM,IAAI,MAAM,GAAG,KAAK,OAAO,wBAAwB,KAAK,MAAM,UAAU,eAAe,MAAM,MAAM,EAAE;AAAA,MAC7G;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AAUO,MAAM,eAAN,cAA2B,eAAe;AAAA,IAA1C;AAAA;AACH,qCAAU;AAAA;AAAA,IACV,IAAI,QAAQ;AACR,aAAO,aAAa,WAAW;AAAA,IACnC;AAAA,EACJ;AAaO,MAAM,eAAN,cAA2B,eAAe;AAAA,IAA1C;AAAA;AACH,qCAAU;AAAA;AAAA,IACV,IAAI,QAAQ;AACR,aAAO,aAAa,WAAW;AAAA,IACnC;AAAA,EACJ;AAUO,MAAM,eAAN,cAA2B,eAAe;AAAA,IAA1C;AAAA;AACH,qCAAU;AAAA;AAAA,IACV,IAAI,QAAQ;AACR,aAAO,aAAa,WAAW;AAAA,IACnC;AAAA,EACJ;AAKO,MAAM,aAAN,cAAyB,aAAa;AAAA,EAC7C;;;A3CvFO,MAAM,gBAAN,MAAsC;AAAA,IAO3C,YAAY,QAAsB;AAJlC,WAAQ,aAAa,oBAAI,IAAoB;AAC7C;AAAA,WAAQ,qBAAqB,oBAAI,IAAY;AAC7C,WAAQ,sBAAsB,oBAAI,IAA2B;AAG3D,WAAK,cAAc,OAAO;AAC1B,WAAK,gBAAgB,OAAO;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,UACJ,SACA,SACA,UAA4B,CAAC,GACT;AAEpB,YAAM,QAAQ,KAAK,cAAc,SAAS,QAAQ,qBAAqB;AAGvE,UAAI;AAEJ,UAAI,QAAQ,mBAAmB;AAE7B,YAAI,CAAC,MAAM,cAAc,YAAY;AACnC,gBAAM,YAAY,KAAK,wBAAwB,YAAY;AAC3D,gBAAM,IAAI;AAAA,YACR,UAAU,MAAM,OAAO;AAAA,KACtB,UAAU,SAAS,IAChB,sCAAsC,UAAU,KAAK,IAAI,CAAC;AAAA,8EAE1D;AAAA,UACN;AAAA,QACF;AAGA,kBAAU,MAAM,MAAM,aAAa,WAAW,cAAc,QAAQ,iBAAiB;AAAA,MACvF,OAAO;AAEL,kBAAU,MAAM,MAAM,gBAAgB;AAAA,MACxC;AAGA,YAAM,UAAU,MAAM,KAAK,eAAe,OAAO;AACjD,YAAM,YAAY,QAAQ,sBAAsB,MAAM,GAAG,EAAE,CAAC;AAC5D,YAAM,QAAQ,GAAG,OAAO,OAAO,SAAS,IAAI,OAAO;AAGnD,YAAM,OAAO,MAAM,KAAK,YAAY;AAAA,QAClC;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,UACE,WAAW,QAAQ;AAAA,UACnB,OAAO,QAAQ,SAAS,CAAC,SAAS;AAAA,UAClC,sBAAsB,QAAQ,wBAAwB;AAAA,QACxD;AAAA,MACF;AAEA,aAAO;AAAA,QACL;AAAA,QACA,WAAW,QAAQ;AAAA,MACrB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,OAAO,OAA0C;AACrD,YAAM,SAAS,MAAM,KAAK,YAAY,aAAa,KAAK;AAExD,UAAI,CAAC,QAAQ;AACX,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,QACL,MAAM,OAAO;AAAA,QACb,WAAW,OAAO;AAAA,MACpB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,YACJ,OACA,SACqB;AAErB,YAAM,SAAS,MAAM,KAAK,YAAY,OAAO,KAAK;AAElD,UAAI,CAAC,QAAQ;AACX,cAAM,IAAI,MAAM,kBAAkB,KAAK,EAAE;AAAA,MAC3C;AAEA,UAAI,OAAO,KAAK,WAAW,UAAU;AACnC,cAAM,IAAI,MAAM,sBAAsB,KAAK,aAAa,OAAO,KAAK,MAAM,GAAG;AAAA,MAC/E;AAGA,YAAM,QAAQ,KAAK,cAAc,SAAS,OAAO,KAAK,OAAO;AAG7D,YAAM,UAAU,KAAK,iBAAiB,OAAO,KAAK,OAAO;AACzD,YAAM,cAAc,MAAM,UAAU,SAAS,OAAO;AAEpD,aAAO,MAAM,MAAM,KAAK,OAAO,QAAQ,YAAY,WAAW;AAAA,IAChE;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,gBACJ,OACA,SACA,WACkB;AAClB,YAAM,SAAS,MAAM,KAAK,YAAY,aAAa,KAAK;AAExD,UAAI,CAAC,QAAQ;AACX,eAAO;AAAA,MACT;AAEA,YAAM,QAAQ,KAAK,cAAc,SAAS,OAAO,KAAK,OAAO;AAG7D,YAAM,UAAU,KAAK,iBAAiB,OAAO,KAAK,OAAO;AACzD,YAAM,cAAc,MAAM,UAAU,SAAS,OAAO;AAEpD,UAAI;AACF,eAAO,MAAM,MAAM,OAAO,OAAO,WAAW,aAAa,SAAS;AAAA,MACpE,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,iBACJ,SACA,aAAsB,MACA;AACtB,YAAM,OAAO,aACT,MAAM,KAAK,YAAY,eAAe,IACtC,MAAM,KAAK,YAAY,SAAS;AAGpC,YAAM,YAAY,KAAK,OAAO,UAAQ,KAAK,MAAM,WAAW,GAAG,OAAO,GAAG,CAAC;AAG1E,YAAM,UAAuB,CAAC;AAE9B,iBAAW,QAAQ,WAAW;AAC5B,cAAM,SAAS,MAAM,KAAK,YAAY,aAAa,KAAK,KAAK;AAC7D,YAAI,QAAQ;AACV,kBAAQ,KAAK;AAAA,YACX,MAAM,OAAO;AAAA,YACb,WAAW,OAAO;AAAA,UACpB,CAAC;AAAA,QACH;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,uBAAuB,SAAgD;AAC3E,YAAM,OAAO,MAAM,KAAK,iBAAiB,SAAS,IAAI;AAEtD,UAAI,KAAK,WAAW,GAAG;AACrB,eAAO;AAAA,MACT;AAGA,YAAM,SAAS,KAAK,oBAAoB,IAAI;AAC5C,YAAM,SAAS,IAAI,IAAI,OAAO,IAAI,CAAAC,OAAKA,GAAE,KAAK,OAAO,CAAC;AACtD,YAAM,aAAa,MAAM,KAAK,MAAM;AAGpC,aAAO;AAAA,QACL,uBAAuB,WAAW,CAAC;AAAA,QACnC,yBAAyB,WAAW,CAAC;AAAA,MACvC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,gBAAgB,SAAuC;AAC3D,YAAM,aAAa,MAAM,KAAK,iBAAiB,SAAS,IAAI;AAC5D,YAAM,UAAuB,CAAC;AAE9B,iBAAW,aAAa,YAAY;AAElC,cAAM,QAAQ,KAAK,cAAc,SAAS,UAAU,KAAK,OAAO;AAChE,cAAM,aAAa,MAAM,MAAM,gBAAgB;AAG/C,cAAM,UAAU,MAAM,KAAK,eAAe,OAAO;AACjD,cAAM,YAAY,UAAU,KAAK,QAAQ,MAAM,GAAG,EAAE,CAAC;AACrD,cAAM,WAAW,GAAG,OAAO,OAAO,SAAS,IAAI,OAAO;AAGtD,cAAM,UAAU,MAAM,KAAK,YAAY;AAAA,UACrC,UAAU,KAAK;AAAA,UACf;AAAA,UACA;AAAA,QACF;AAEA,gBAAQ,KAAK;AAAA,UACX,MAAM;AAAA,UACN,WAAW,WAAW;AAAA,QACxB,CAAC;AAAA,MACH;AAEA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,eACJ,SACA,SACA,UAA4B,CAAC,GACT;AAEpB,YAAM,eAAe,MAAM,KAAK,iBAAiB,SAAS,IAAI;AAE9D,YAAM,aAAa,aAAa;AAAA,QAC9B,CAAAA,OAAKA,GAAE,KAAK,YAAY,QAAQ;AAAA,MAClC;AAEA,UAAI,YAAY;AACd,eAAO;AAAA,MACT;AAGA,aAAO,MAAM,KAAK,UAAU,SAAS,SAAS,OAAO;AAAA,IACvD;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,wBACJ,SACA,SACA,UAA4B,CAAC,GACgC;AAC7D,UAAI,CAAC,QAAQ,yBAAyB;AACpC,cAAM,IAAI,MAAM,mEAAmE;AAAA,MACrF;AAEA,YAAM,aAAa,MAAM,KAAK,UAAU,SAAS;AAAA,QAC/C,uBAAuB,QAAQ;AAAA,MACjC,GAAG,OAAO;AAEV,YAAM,eAAe,MAAM,KAAK,UAAU,SAAS;AAAA,QACjD,uBAAuB,QAAQ;AAAA,MACjC,GAAG,OAAO;AAEV,aAAO,EAAE,YAAY,aAAa;AAAA,IACpC;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,6BACJ,SACA,SACA,UAA4B,CAAC,GACgC;AAC7D,UAAI,CAAC,QAAQ,yBAAyB;AACpC,cAAM,IAAI,MAAM,mEAAmE;AAAA,MACrF;AAEA,YAAM,aAAa,MAAM,KAAK,eAAe,SAAS;AAAA,QACpD,uBAAuB,QAAQ;AAAA,MACjC,GAAG,OAAO;AAEV,YAAM,eAAe,MAAM,KAAK,eAAe,SAAS;AAAA,QACtD,uBAAuB,QAAQ;AAAA,MACjC,GAAG,OAAO;AAEV,aAAO,EAAE,YAAY,aAAa;AAAA,IACpC;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,eACJ,SACA,SACA,QAC+B;AAC/B,YAAM,aAAa,KAAK,oBAAoB,MAAM,KAAK,iBAAiB,SAAS,IAAI,CAAC;AACtF,UAAI,WAAW,WAAW,GAAG;AAC3B,cAAM,IAAI,MAAM,mCAAmC,OAAO,EAAE;AAAA,MAC9D;AAEA,YAAM,cAAc,QAAQ,SAAS,SAAS,MAAM,KAAK,IAAI,IAAI,WAAW,IAAI,CAAAA,OAAKA,GAAE,KAAK,OAAO,CAAC,CAAC;AACrG,YAAM,aAA+B,CAAC;AAEtC,iBAAW,WAAW,aAAa;AACjC,cAAM,MAAM,WAAW,KAAK,CAAAA,OAAKA,GAAE,KAAK,YAAY,OAAO;AAC3D,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,4BAA4B,OAAO,gBAAgB,OAAO,GAAG;AAAA,QAC/E;AAEA,cAAM,YAAY,MAAM,KAAK,YAAY,IAAI,KAAK,OAAO,OAAO;AAChE,mBAAW,KAAK,EAAE,SAAS,OAAO,IAAI,KAAK,OAAO,UAAU,CAAC;AAAA,MAC/D;AAEA,aAAO,EAAE,WAAW;AAAA,IACtB;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,iBACJ,SACA,SACA,YACkC;AAClC,YAAM,UAAqC,CAAC;AAE5C,iBAAW,SAAS,YAAY;AAC9B,YAAI;AACF,gBAAM,QAAQ,MAAM,KAAK,gBAAgB,MAAM,OAAO,SAAS,MAAM,SAAS;AAC9E,kBAAQ,KAAK,EAAE,SAAS,MAAM,SAAS,OAAO,MAAM,OAAO,MAAM,CAAC;AAAA,QACpE,SAAS,OAAO;AACd,kBAAQ,KAAK;AAAA,YACX,SAAS,MAAM;AAAA,YACf,OAAO,MAAM;AAAA,YACb,OAAO;AAAA,YACP,OAAQ,MAAgB;AAAA,UAC1B,CAAC;AAAA,QACH;AAAA,MACF;AAEA,aAAO;AAAA,QACL;AAAA,QACA,UAAU,QAAQ,MAAM,CAAAC,OAAKA,GAAE,KAAK;AAAA,MACtC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,iBAAiB,WAAsB,KAAa;AAClD,YAAM,QAAQ,IAAI,gBAAgB;AAClC,aAAO,MAAM,iBAAiB,QAAQ;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAeA,MAAM,sBACJ,SACA,SACA,UACA,OAAe,gBAAgB,YAAY,GAAG,GAAG,CAAC,GAClD,YACA,UAA4B,CAAC,GACT;AACpB,YAAM,QAAQ,IAAI,gBAAgB;AAClC,YAAM,OAAO,MAAM,eAAe,UAAU,UAAU;AAEtD,aAAO,MAAM,KAAK,UAAU,SAAS,SAAS;AAAA,QAC5C,GAAG;AAAA,QACH,mBAAmB;AAAA,UACjB;AAAA,UACA;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,gBAAgB,SAA2B;AACzC,YAAM,QAAQ,KAAK,cAAc,SAAS,OAAO;AACjD,YAAM,OAAiB,CAAC;AAExB,UAAI,MAAM,cAAc,WAAY,MAAK,KAAK,YAAY;AAC1D,UAAK,MAAM,cAAsB,WAAY,MAAK,KAAK,YAAY;AACnE,UAAK,MAAM,cAAsB,UAAW,MAAK,KAAK,WAAW;AAEjE,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,wBAAwB,YAAiE;AACvF,YAAM,YAAY,KAAK,cAAc,aAAa;AAClD,aAAO,UACJ,OAAO,WAAS,CAAC,CAAE,MAAM,eAAuB,UAAU,CAAC,EAC3D,IAAI,WAAS,MAAM,OAAO;AAAA,IAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAeA,MAAM,uBACJ,SACA,UACA,eAAe,GACf,eAAe,GACf,WAAW,OACX,UAA4B,CAAC,GACT;AACpB,YAAM,OAAO,gBAAgB,YAAY,cAAc,WAAW,IAAI,GAAG,YAAY;AAErF,aAAO,KAAK;AAAA,QACV;AAAA,QACA,EAAE,uBAAuB,sBAAsB;AAAA,QAC/C;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKQ,iBAAiB,SAAmD;AAC1E,UAAI,QAAQ,WAAW,QAAQ,GAAG;AAChC,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKA,MAAc,eAAe,SAAkC;AAC7D,UAAI,CAAC,KAAK,mBAAmB,IAAI,OAAO,GAAG;AACzC,YAAI,CAAC,KAAK,oBAAoB,IAAI,OAAO,GAAG;AAC1C,gBAAM,eAAe,YAAY;AAC/B,kBAAM,WAAW,MAAM,KAAK,YAAY,SAAS;AACjD,kBAAM,MAAM,SAAS,OAAO,CAAC,KAAK,SAAS;AACzC,kBAAI,CAAC,KAAK,MAAM,WAAW,GAAG,OAAO,MAAM,EAAG,QAAO;AACrD,oBAAM,QAAQ,KAAK,MAAM,MAAM,kBAAkB;AACjD,kBAAI,CAAC,MAAO,QAAO;AACnB,oBAAM,MAAM,SAAS,MAAM,CAAC,GAAG,EAAE;AACjC,qBAAO,OAAO,SAAS,GAAG,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI;AAAA,YACrD,GAAG,CAAC;AAEJ,iBAAK,WAAW,IAAI,SAAS,GAAG;AAChC,iBAAK,mBAAmB,IAAI,OAAO;AACnC,iBAAK,oBAAoB,OAAO,OAAO;AAAA,UACzC,GAAG;AAEH,eAAK,oBAAoB,IAAI,SAAS,WAAW;AAAA,QACnD;AAEA,cAAM,cAAc,KAAK,oBAAoB,IAAI,OAAO;AACxD,YAAI,aAAa;AACf,gBAAM;AAAA,QACR;AAAA,MACF;AAEA,YAAM,UAAU,KAAK,WAAW,IAAI,OAAO,KAAK;AAChD,YAAM,OAAO,UAAU;AACvB,WAAK,WAAW,IAAI,SAAS,IAAI;AACjC,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA,IAKQ,oBAAoB,MAAgC;AAC1D,aAAO,CAAC,GAAG,IAAI,EAAE,KAAK,CAACC,IAAGC,OAAM;AAC9B,cAAM,QAAQ,IAAI,KAAKD,GAAE,KAAK,SAAS,EAAE,QAAQ;AACjD,cAAM,QAAQ,IAAI,KAAKC,GAAE,KAAK,SAAS,EAAE,QAAQ;AACjD,YAAI,UAAU,MAAO,QAAO,QAAQ;AAEpC,cAAM,eAAe,KAAK,iBAAiBD,GAAE,KAAK,OAAO,IAAI,KAAK,iBAAiBC,GAAE,KAAK,OAAO;AACjG,YAAI,iBAAiB,EAAG,QAAO;AAE/B,eAAOD,GAAE,KAAK,MAAM,cAAcC,GAAE,KAAK,KAAK;AAAA,MAChD,CAAC;AAAA,IACH;AAAA,IAEQ,iBAAiB,SAAyB;AAChD,UAAI,QAAQ,WAAW,QAAQ,EAAG,QAAO;AACzC,UAAI,QAAQ,SAAS,OAAO,EAAG,QAAO;AACtC,aAAO;AAAA,IACT;AAAA,EACF;;;A4C5jBA;;;A7C0BA,iBAAsB,eAAgC;AACpD,UAAM,UAAU,IAAI,mBAAmB;AACvC,UAAM,cAAc,IAAI,YAAY,OAAO;AAG3C,UAAM,gBAAgB,IAAI,uBAAuB;AACjD,kBAAc,SAAS,IAAI,cAAc,CAAC;AAC1C,kBAAc,SAAS,IAAI,aAAa,CAAC;AACzC,kBAAc,SAAS,IAAI,aAAa,CAAC;AACzC,kBAAc,SAAS,IAAI,aAAa,CAAC;AACzC,kBAAc,SAAS,IAAI,WAAW,CAAC;AAEvC,UAAM,MAAM,IAAI,cAAc;AAAA,MAC5B;AAAA,MACA;AAAA,IACF,CAAC;AAKD,WAAO;AAAA,EACT;AAKA,MAAO,kBAAQ;AAAA,IACb;AAAA,EACF;AAGA,MAAI,OAAO,WAAW,aAAa;AACjC,IAAC,OAAe,YAAY;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;",
6
+ "names": ["i", "a", "n", "i", "u", "a", "b", "c", "isLE", "i", "n", "i", "h", "l", "s", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "n", "s", "B", "x", "y", "t", "R", "j", "h", "l", "i", "A", "I", "g", "C", "B", "Q", "i", "E", "o", "n", "r", "t", "a", "e", "f", "D", "c", "G", "h", "y", "W", "u", "s", "F", "Y", "N", "w", "S", "k", "H", "R", "d", "M", "J", "q", "l", "m", "L", "p", "K", "b", "v", "j", "O", "T", "x", "P", "V", "X", "Z", "_", "z", "$", "AA", "IA", "gA", "CA", "BA", "QA", "iA", "EA", "oA", "nA", "rA", "tA", "aA", "eA", "fA", "DA", "cA", "GA", "hA", "U", "b", "i", "k", "u", "P", "N", "L", "L2", "m", "n", "s", "isBytes", "a", "abytes", "l", "bytesToHex", "b", "e", "C", "hexToBytes", "r", "c", "M", "x", "y", "u", "v", "q", "p", "I", "G", "f", "d", "k", "R", "i", "h", "L2", "h", "P", "r", "s", "N", "R", "v", "L", "L", "M", "N", "hexToBytes", "bytesToHex", "s", "k", "e", "w", "p", "G", "W", "b", "i", "n", "I", "f", "isEven", "isBytes", "a", "anumber", "n", "abytes", "b", "h", "aexists", "aoutput", "clean", "i", "createView", "rotr", "abytes", "createHasher", "i", "clean", "aexists", "abytes", "isLE", "_32n", "h", "l", "Chi", "a", "b", "c", "Maj", "HashMD", "createView", "aexists", "abytes", "aoutput", "clean", "i", "SHA256_IV", "SHA256_K", "SHA256_W", "HashMD", "SHA256_IV", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "rotr", "Chi", "Maj", "clean", "sha256", "createHasher", "sha256", "isBytes", "a", "anumber", "n", "abytes", "ahash", "h", "aexists", "aoutput", "clean", "i", "createView", "rotr", "i", "bytesToHex", "abytes", "hexToBytes", "concatBytes", "i", "a", "abytes", "createHasher", "randomBytes", "cr", "oidNist", "Chi", "a", "b", "c", "Maj", "HashMD", "isLE", "createView", "aexists", "abytes", "aoutput", "clean", "i", "SHA256_IV", "SHA256_K", "SHA256_W", "SHA2_32B", "HashMD", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "rotr", "Chi", "Maj", "clean", "_SHA256", "SHA256_IV", "sha256", "createHasher", "_SHA256", "oidNist", "_0n", "_1n", "n", "anumber", "_0n", "bytesToHex", "abytes", "n", "anumber", "hexToBytes", "n", "_0n", "_1n", "n", "_1n", "anumber", "u8n", "v", "k", "i", "h", "concatBytes", "f", "_0n", "_1n", "_2n", "_7n", "a", "b", "x", "_0n", "invert", "a", "b", "y", "_1n", "u", "v", "q", "r", "m", "n", "gcd", "n2", "_2n", "i", "P", "_7n", "Q", "S", "M", "c", "t", "R", "_0n", "_1n", "p", "d", "i", "n", "_1n", "_2n", "n", "anumber", "_0n", "_1n", "invert", "abytes", "isLE", "a", "b", "isLE", "abytes", "_1n", "_0n", "_1n", "c", "p", "i", "W", "scalarBits", "n", "window", "P", "n", "_0n", "wNAF", "Point", "p", "d", "_1n", "W", "window", "i", "f", "isLE", "p", "_0n", "Fn", "_b", "getPublicKey", "ahash", "abytes", "i", "clean", "aexists", "hmac", "_2n", "k", "n", "k2", "_0n", "_1n", "m", "E", "t", "b", "v", "abytes", "_3n", "_4n", "Fn", "x", "y", "concatBytes", "err", "L", "x2", "Point", "p", "Y", "_Point", "P", "hexToBytes", "a", "endo", "f", "p2", "bytesToHex", "wNAF", "Fn", "Point", "randomBytes", "l", "abytes", "getPublicKey", "isBytes", "s", "b", "utils", "ahash", "hmac", "_2n", "_1n", "Signature", "r", "L", "hexToBytes", "x", "R", "concatBytes", "h", "bits2int_modN", "Q", "bytesToHex", "bits2int", "_0n", "prepSig", "d", "e", "m", "k", "q", "sign", "verify", "P", "v", "recoverPublicKey", "secp256k1_CURVE", "_2n", "y", "P", "secp256k1_CURVE", "_3n", "sha256", "isBytes", "a", "anumber", "n", "abytes", "ahash", "h", "aexists", "aoutput", "clean", "i", "createView", "rotr", "concatBytes", "i", "a", "abytes", "createHasher", "oidNist", "_HMAC", "ahash", "abytes", "i", "clean", "aexists", "hmac", "Chi", "a", "b", "c", "Maj", "HashMD", "isLE", "createView", "aexists", "abytes", "aoutput", "clean", "i", "SHA256_IV", "SHA512_IV", "i", "L", "R", "j", "k", "x", "y", "HashMD", "cr", "clean", "createHasher", "U32_MASK64", "_32n", "fromBig", "n", "split", "i", "h", "l", "shrSH", "h", "s", "shrSL", "l", "rotrSH", "rotrSL", "rotrBH", "rotrBL", "add", "l", "add3L", "add3H", "add4L", "add4H", "add5L", "add5H", "SHA256_K", "SHA256_W", "SHA2_32B", "HashMD", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "rotr", "Chi", "Maj", "clean", "_SHA256", "SHA256_IV", "K512", "split", "n", "SHA512_Kh", "SHA512_Kl", "SHA512_W_H", "SHA512_W_L", "SHA2_64B", "HashMD", "i", "rotrSH", "shrSH", "rotrSL", "shrSL", "rotrBH", "rotrBL", "add4L", "add4H", "add5L", "add5H", "add", "add3L", "add3H", "clean", "_SHA512", "SHA512_IV", "sha256", "createHasher", "_SHA256", "oidNist", "sha512", "createHasher", "_SHA512", "oidNist", "isBytes", "a", "anumber", "n", "a", "b", "c", "x", "l", "i", "d", "anumber", "i", "a", "b", "padding", "n", "isBytes", "anumber", "isBytes", "i", "utils", "sha256", "Point", "sha256", "createView", "n", "concatBytes", "abytes", "I", "hmac", "sha512", "c", "m", "err", "isBytes", "a", "anumber", "n", "abytes", "ahash", "h", "aexists", "aoutput", "clean", "i", "createView", "rotr", "utf8ToBytes", "abytes", "createHasher", "randomBytes", "cr", "oidNist", "_HMAC", "ahash", "abytes", "i", "clean", "aexists", "hmac", "ahash", "c", "anumber", "hmac", "u", "clean", "createView", "i", "Chi", "a", "b", "c", "Maj", "HashMD", "isLE", "createView", "aexists", "abytes", "aoutput", "clean", "i", "SHA256_IV", "SHA512_IV", "U32_MASK64", "_32n", "fromBig", "n", "split", "i", "h", "l", "shrSH", "h", "s", "shrSL", "l", "rotrSH", "rotrSL", "rotrBH", "rotrBL", "add", "l", "add3L", "add3H", "add4L", "add4H", "add5L", "add5H", "SHA256_K", "SHA256_W", "SHA2_32B", "HashMD", "A", "B", "C", "D", "E", "F", "G", "H", "i", "W2", "rotr", "Chi", "Maj", "clean", "_SHA256", "SHA256_IV", "K512", "split", "n", "SHA512_Kh", "SHA512_Kl", "SHA512_W_H", "SHA512_W_L", "SHA2_64B", "HashMD", "i", "rotrSH", "shrSH", "rotrSL", "shrSL", "rotrBH", "rotrBL", "add4L", "add4H", "add5L", "add5H", "add", "add3L", "add3H", "clean", "_SHA512", "SHA512_IV", "sha256", "createHasher", "_SHA256", "oidNist", "sha512", "createHasher", "_SHA512", "oidNist", "wordlist", "abytes", "anumber", "randomBytes", "sha256", "i", "utils", "wordlist", "sha512", "sha256", "checksum", "i", "sha256", "module", "dilithium", "k", "r", "a", "b"]
7
7
  }