bitcoin-wallet-connector 0.1.0

package/lib/index-Zx0KcpYx.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-Zx0KcpYx.js","sources":["../src/utils/createAdapterAvailability.ts","../src/adapters/BitgetWalletAdapter.ts","../src/adapters/LeatherWalletAdapter.ts","../src/adapters/MagicEdenWalletAdapter.ts","../src/adapters/OkxWalletAdapter.ts","../src/adapters/UnisatWalletAdapter.ts","../src/adapters/XverseWalletAdapter.ts","../node_modules/.pnpm/@scure+base@2.0.0/node_modules/@scure/base/index.js","../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/utils.js","../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/_md.js","../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/sha2.js","../node_modules/.pnpm/@noble+curves@2.0.1/node_modules/@noble/curves/utils.js","../node_modules/.pnpm/@noble+curves@2.0.1/node_modules/@noble/curves/abstract/modular.js","../node_modules/.pnpm/@noble+curves@2.0.1/node_modules/@noble/curves/abstract/curve.js","../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/hmac.js","../node_modules/.pnpm/@noble+curves@2.0.1/node_modules/@noble/curves/abstract/weierstrass.js","../node_modules/.pnpm/@noble+curves@2.0.1/node_modules/@noble/curves/secp256k1.js","../node_modules/.pnpm/@noble+hashes@2.0.1/node_modules/@noble/hashes/legacy.js","../node_modules/.pnpm/micro-packed@0.8.0/node_modules/micro-packed/index.js","../node_modules/.pnpm/@scure+btc-signer@2.0.1/node_modules/@scure/btc-signer/utils.js","../node_modules/.pnpm/@scure+btc-signer@2.0.1/node_modules/@scure/btc-signer/script.js","../node_modules/.pnpm/@scure+btc-signer@2.0.1/node_modules/@scure/btc-signer/payment.js","../src/utils/bitcoinNetworkHelpers.ts","../src/utils/bitcoinAddressHelpers.ts","../src/adapters/MockAddressWalletAdapter.ts"],"sourcesContent":["export type GetPreconditionFn<T> = () => null | { value: T }\n\nexport type InitializerFn<I, T> = (precondition: I) => T | Promise<T>\n\nexport interface AvailabilitySubscription {\n  unsubscribe: () => void\n}\n\nexport interface Availability<T> {\n  subscribe: (listener: (adapter: T) => void) => AvailabilitySubscription\n}\n\nexport function createAvailability<I, T>({\n  getPrecondition,\n  initializer,\n  pollIntervalMs = 300,\n}: {\n  getPrecondition: GetPreconditionFn<I>\n  initializer: InitializerFn<I, T>\n  pollIntervalMs?: number\n}): Availability<T> {\n  let cachedAdapter: T | null = null\n  let polling: ReturnType<typeof setInterval> | null = null\n  let creating = false\n\n  const listeners = new Set<(adapter: T) => void>()\n\n  const stopPolling = (): void => {\n    if (polling != null) {\n      clearInterval(polling)\n      polling = null\n    }\n  }\n\n  const emit = (adapter: T): void => {\n    cachedAdapter = adapter\n    for (const listener of listeners) {\n      listener(adapter)\n    }\n  }\n\n  const attemptCreate = async (): Promise<void> => {\n    if (cachedAdapter != null || creating) return\n    const precondition = getPrecondition()\n    if (precondition == null) return\n\n    creating = true\n    try {\n      const adapter = await initializer(precondition.value)\n      emit(adapter)\n      stopPolling()\n    } catch (error) {\n      console.warn(\"[WalletAdapter] Failed to initialize adapter\", error)\n    } finally {\n      creating = false\n    }\n  }\n\n  const ensurePolling = (): void => {\n    if (cachedAdapter != null) return\n\n    void attemptCreate()\n    if (cachedAdapter != null || polling != null) return\n\n    polling = setInterval(() => {\n      void attemptCreate()\n    }, pollIntervalMs)\n  }\n\n  return {\n    subscribe: listener => {\n      if (cachedAdapter != null) {\n        listener(cachedAdapter)\n        return { unsubscribe: () => {} }\n      }\n\n      listeners.add(listener)\n      ensurePolling()\n\n      const subscription: AvailabilitySubscription = {\n        unsubscribe: () => {\n          listeners.delete(listener)\n          if (listeners.size === 0) {\n            stopPolling()\n          }\n        },\n      }\n\n      return subscription\n    },\n  }\n}\n","import { createAvailability } from \"../utils/createAdapterAvailability\"\nimport type { UnisatCompatibleProviderAPI } from \"../utils/UnisatCompatibleWalletAdapterImpl\"\nimport type {\n  WalletAdapter,\n  WalletAdapterMetadata,\n  WalletAdapterStatic,\n} from \"../WalletAdapters.types\"\n\n/**\n * Derivation path (BIP-44): m/44'/0'/0'/0/ address_index\n */\n\nconst adapterId = \"bitget.bitcoin\"\n\n/**\n * https://web3.bitget.com/en/docs/wallet/brand-assets.html\n */\nconst metadata: WalletAdapterMetadata = {\n  name: \"Bitget\",\n  iconUrl: import(\"../_/bitget.png\").then(m => m.default),\n  websiteUrl: \"https://web3.bitget.com/\",\n  downloadUrl: \"https://web3.bitget.com/en/wallet-download\",\n}\n\nconst availability = createAvailability<\n  UnisatCompatibleProviderAPI,\n  WalletAdapter\n>({\n  getPrecondition: () =>\n    (window as any).bitkeep?.unisat == null\n      ? null\n      : { value: (window as any).bitkeep.unisat },\n  initializer: async provider => {\n    const { BitgetWalletAdapterImpl } =\n      await import(\"./BitgetWalletAdapter.impl\")\n    return new BitgetWalletAdapterImpl(provider)\n  },\n})\n\nexport const BitgetWalletAdapter: WalletAdapterStatic<WalletAdapter> = {\n  adapterId,\n  metadata,\n  getAdapter: () => availability,\n}\n","import type { RequestFn } from \"@leather.io/rpc\"\nimport { createAvailability } from \"../utils/createAdapterAvailability\"\nimport type {\n  WalletAdapter,\n  WalletAdapterStatic,\n} from \"../WalletAdapters.types\"\n\nconst adapterId = \"LeatherProvider.BitcoinProvider\"\n\nconst metadata = {\n  name: \"Leather\",\n  iconUrl: import(\"../_/leather.svg\").then(m => m.default),\n  websiteUrl: \"https://leather.io/\",\n  downloadUrl: \"https://leather.io/wallet\",\n}\n\nconst availability = createAvailability<RequestFn, WalletAdapter>({\n  getPrecondition: () => {\n    const request = (window as any).LeatherProvider?.request as\n      | RequestFn\n      | undefined\n    return request == null ? null : { value: request }\n  },\n  initializer: async request => {\n    const { LeatherWalletAdapterImpl } =\n      await import(\"./LeatherWalletAdapter.impl\")\n    return new LeatherWalletAdapterImpl(request)\n  },\n})\n\nexport const LeatherWalletAdapter: WalletAdapterStatic<WalletAdapter> = {\n  adapterId,\n  metadata,\n  getAdapter: () => availability,\n}\n","import type {\n  WalletAdapter,\n  WalletAdapterBitcoinNetwork,\n  WalletAdapterStatic,\n} from \"../WalletAdapters.types\"\nimport { createAvailability } from \"../utils/createAdapterAvailability\"\nimport type { MagicEdenBitcoinProvider } from \"./MagicEdenWalletAdapter.impl\"\n\ndeclare global {\n  interface Window {\n    magicEden?: {\n      bitcoin?: MagicEdenBitcoinProvider\n    }\n  }\n}\n\nexport const MAGICEDEN_PROVIDER_ID = \"magiceden.bitcoin\"\n\n// eslint-disable-next-line @typescript-eslint/explicit-function-return-type\nconst buildAvailability = (network: WalletAdapterBitcoinNetwork) =>\n  createAvailability<MagicEdenBitcoinProvider, WalletAdapter>({\n    getPrecondition: () => {\n      const provider = window.magicEden?.bitcoin\n      return provider?.isMagicEden ? { value: provider } : null\n    },\n    initializer: async provider => {\n      const { MagicEdenWalletAdapterImpl } =\n        await import(\"./MagicEdenWalletAdapter.impl\")\n      return new MagicEdenWalletAdapterImpl(network, provider)\n    },\n  })\n\nexport const MagicEdenWalletAdapterFactory = (\n  network: WalletAdapterBitcoinNetwork,\n): WalletAdapterStatic<WalletAdapter> => {\n  const availability = buildAvailability(network)\n\n  return {\n    adapterId: MAGICEDEN_PROVIDER_ID,\n    /**\n     * https://docs-wallet.magiceden.io/resources/logos-and-brand-assets\n     */\n    metadata: {\n      name: \"Magic Eden\",\n      iconUrl: import(\"../_/magiceden.png\").then(m => m.default),\n      websiteUrl: \"https://wallet.magiceden.io/\",\n      downloadUrl: \"https://wallet.magiceden.io/download\",\n    },\n    getAdapter: () => availability,\n  }\n}\n","import type {\n  WalletAdapter,\n  WalletAdapterStatic,\n} from \"../WalletAdapters.types\"\nimport type { UnisatCompatibleProviderAPI } from \"../utils/UnisatCompatibleWalletAdapterImpl\"\nimport { createAvailability } from \"../utils/createAdapterAvailability\"\n\nconst adapterId = \"okxwallet.bitcoin\"\n\nconst metadata = {\n  name: \"OKX Wallet\",\n  iconUrl: import(\"../_/okx.png\").then(m => m.default),\n  websiteUrl: \"https://web3.okx.com/\",\n  downloadUrl: \"https://web3.okx.com/download\",\n}\n\nconst availability = createAvailability<\n  UnisatCompatibleProviderAPI,\n  WalletAdapter\n>({\n  getPrecondition: () => {\n    const provider = (window as any).okxwallet?.bitcoin as\n      | UnisatCompatibleProviderAPI\n      | undefined\n    return provider == null ? null : { value: provider }\n  },\n  initializer: async provider => {\n    const { OkxWalletAdapterImpl } = await import(\"./OkxWalletAdapter.impl\")\n    return new OkxWalletAdapterImpl(provider as any)\n  },\n})\n\nexport const OkxWalletAdapter: WalletAdapterStatic<WalletAdapter> = {\n  adapterId,\n  metadata,\n  getAdapter: () => availability,\n}\n","import { createAvailability } from \"../utils/createAdapterAvailability\"\nimport type { UnisatCompatibleProviderAPI } from \"../utils/UnisatCompatibleWalletAdapterImpl\"\nimport type {\n  WalletAdapter,\n  WalletAdapterMetadata,\n  WalletAdapterStatic,\n} from \"../WalletAdapters.types\"\n\n/**\n * Derivation path (Native SegWit) (BIP-84): m/84'/0'/0'/0/address_index\n * Derivation path (Nested SegWit) (BIP-49): m/49'/0'/0'/0/address_index\n * Derivation path (Taproot) (BIP-86): m/86'/0'/0'/0/address_index\n * Derivation path (Taproot) (BIP-44): m/44'/0'/0'/0/address_index\n * Derivation path (Legacy) (BIP-44): m/44'/0'/0'/0/address_index\n */\n\nconst adapterId = \"unisat\"\n\nconst metadata: WalletAdapterMetadata = {\n  name: \"UniSat\",\n  /**\n   * https://next-cdn.unisat.io/_/2025-v965/UniSat%20Logo.zip\n   */\n  iconUrl: import(\"../_/unisat.svg\").then(m => m.default),\n  websiteUrl: \"https://unisat.io/\",\n  downloadUrl: \"https://unisat.io/download\",\n}\n\nconst availability = createAvailability<\n  UnisatCompatibleProviderAPI,\n  WalletAdapter\n>({\n  getPrecondition: () => {\n    const provider = (window as any).unisat as\n      | UnisatCompatibleProviderAPI\n      | undefined\n    return provider == null ? null : { value: provider }\n  },\n  initializer: async provider => {\n    const { UnisatWalletAdapterImpl } =\n      await import(\"./UnisatWalletAdapter.impl\")\n    return new UnisatWalletAdapterImpl(provider)\n  },\n})\n\nexport const UnisatWalletAdapter: WalletAdapterStatic<WalletAdapter> = {\n  adapterId,\n  metadata,\n  getAdapter: () => availability,\n}\n","import type {\n  WalletAdapter,\n  WalletAdapterStatic,\n} from \"../WalletAdapters.types\"\nimport { createAvailability } from \"../utils/createAdapterAvailability\"\n\nexport const XVERSE_PROVIDER_ID = \"XverseProviders.BitcoinProvider\"\n\nconst metadata = {\n  name: \"Xverse\",\n  iconUrl: import(\"../_/xverse.png\").then(m => m.default),\n  websiteUrl: \"https://xverse.app/\",\n  downloadUrl: \"https://www.xverse.app/download\",\n}\n\nconst availability = createAvailability<\n  import(\"sats-connect\").Provider,\n  WalletAdapter\n>({\n  getPrecondition: () => {\n    const provider = (window.btc_providers ?? []).find(\n      p => p.id === XVERSE_PROVIDER_ID,\n    )\n    return provider == null ? null : { value: provider }\n  },\n  initializer: async () => {\n    const { XverseWalletAdapterImpl } =\n      await import(\"./XverseWalletAdapter.impl\")\n    return new XverseWalletAdapterImpl()\n  },\n})\n\nexport const XverseWalletAdapter: WalletAdapterStatic<WalletAdapter> = {\n  adapterId: XVERSE_PROVIDER_ID,\n  metadata,\n  getAdapter: () => availability,\n}\n","/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nfunction isBytes(a) {\n    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is Uint8Array. */\nfunction abytes(b) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n}\nfunction isArrayOf(isString, arr) {\n    if (!Array.isArray(arr))\n        return false;\n    if (arr.length === 0)\n        return true;\n    if (isString) {\n        return arr.every((item) => typeof item === 'string');\n    }\n    else {\n        return arr.every((item) => Number.isSafeInteger(item));\n    }\n}\nfunction afn(input) {\n    if (typeof input !== 'function')\n        throw new Error('function expected');\n    return true;\n}\nfunction astr(label, input) {\n    if (typeof input !== 'string')\n        throw new Error(`${label}: string expected`);\n    return true;\n}\nfunction anumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`invalid integer: ${n}`);\n}\nfunction aArr(input) {\n    if (!Array.isArray(input))\n        throw new Error('array expected');\n}\nfunction astrArr(label, input) {\n    if (!isArrayOf(true, input))\n        throw new Error(`${label}: array of strings expected`);\n}\nfunction anumArr(label, input) {\n    if (!isArrayOf(false, input))\n        throw new Error(`${label}: array of numbers expected`);\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction chain(...args) {\n    const id = (a) => a;\n    // Wrap call in closure so JIT can inline calls\n    const wrap = (a, b) => (c) => 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 * 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) {\n    // mapping 1 to \"b\"\n    const lettersA = typeof letters === 'string' ? letters.split('') : letters;\n    const len = lettersA.length;\n    astrArr('alphabet', lettersA);\n    // mapping \"b\" to 1\n    const indexes = new Map(lettersA.map((l, i) => [l, i]));\n    return {\n        encode: (digits) => {\n            aArr(digits);\n            return digits.map((i) => {\n                if (!Number.isSafeInteger(i) || i < 0 || i >= len)\n                    throw new Error(`alphabet.encode: digit index outside alphabet \"${i}\". Allowed: ${letters}`);\n                return lettersA[i];\n            });\n        },\n        decode: (input) => {\n            aArr(input);\n            return input.map((letter) => {\n                astr('alphabet.decode', letter);\n                const i = indexes.get(letter);\n                if (i === undefined)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${letters}`);\n                return i;\n            });\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction join(separator = '') {\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 * Pad strings array so it has integer number of bits\n * @__NO_SIDE_EFFECTS__\n */\nfunction padding(bits, chr = '=') {\n    anumber(bits);\n    astr('padding', chr);\n    return {\n        encode(data) {\n            astrArr('padding.encode', data);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\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)\n                    throw new Error('padding: invalid, string has too much padding');\n            }\n            return input.slice(0, end);\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction normalize(fn) {\n    afn(fn);\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\n/**\n * Slow: O(n^2) time complexity\n */\nfunction convertRadix(data, from, to) {\n    // base 1 is impossible\n    if (from < 2)\n        throw new Error(`convertRadix: invalid from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: invalid to=${to}, base cannot be less than 2`);\n    aArr(data);\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data, (d) => {\n        anumber(d);\n        if (d < 0 || d >= from)\n            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 (!Number.isSafeInteger(digitBase) ||\n                fromCarry / from !== carry ||\n                digitBase - digit !== fromCarry) {\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)\n                continue;\n            else if (!rounded)\n                pos = i;\n            else\n                done = false;\n        }\n        res.push(carry);\n        if (done)\n            break;\n    }\n    for (let i = 0; i < data.length - 1 && data[i] === 0; i++)\n        res.push(0);\n    return res.reverse();\n}\nconst gcd = (a, b) => (b === 0 ? a : gcd(b, a % b));\nconst radix2carry = /* @__NO_SIDE_EFFECTS__ */ (from, to) => from + (to - gcd(from, to));\nconst powers = /* @__PURE__ */ (() => {\n    let res = [];\n    for (let i = 0; i < 40; i++)\n        res.push(2 ** i);\n    return res;\n})();\n/**\n * Implemented with numbers, because BigInt is 5x slower\n */\nfunction convertRadix2(data, from, to, padding) {\n    aArr(data);\n    if (from <= 0 || from > 32)\n        throw new Error(`convertRadix2: wrong from=${from}`);\n    if (to <= 0 || to > 32)\n        throw new Error(`convertRadix2: wrong to=${to}`);\n    if (radix2carry(from, to) > 32) {\n        throw new Error(`convertRadix2: carry overflow from=${from} to=${to} carryBits=${radix2carry(from, to)}`);\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 = [];\n    for (const n of data) {\n        anumber(n);\n        if (n >= max)\n            throw new Error(`convertRadix2: invalid data word=${n} from=${from}`);\n        carry = (carry << from) | n;\n        if (pos + from > 32)\n            throw new Error(`convertRadix2: carry overflow pos=${pos} from=${from}`);\n        pos += from;\n        for (; pos >= to; pos -= to)\n            res.push(((carry >> (pos - to)) & mask) >>> 0);\n        const pow = powers[pos];\n        if (pow === undefined)\n            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)\n        throw new Error('Excess padding');\n    if (!padding && carry > 0)\n        throw new Error(`Non-zero padding: ${carry}`);\n    if (padding && pos > 0)\n        res.push(carry >>> 0);\n    return res;\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction radix(num) {\n    anumber(num);\n    const _256 = 2 ** 8;\n    return {\n        encode: (bytes) => {\n            if (!isBytes(bytes))\n                throw new Error('radix.encode input should be Uint8Array');\n            return convertRadix(Array.from(bytes), _256, num);\n        },\n        decode: (digits) => {\n            anumArr('radix.decode', digits);\n            return Uint8Array.from(convertRadix(digits, num, _256));\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, revPadding = false) {\n    anumber(bits);\n    if (bits <= 0 || bits > 32)\n        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) => {\n            if (!isBytes(bytes))\n                throw new Error('radix2.encode input should be Uint8Array');\n            return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n        },\n        decode: (digits) => {\n            anumArr('radix2.decode', digits);\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\nfunction unsafeWrapper(fn) {\n    afn(fn);\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\nfunction checksum(len, fn) {\n    anumber(len);\n    afn(fn);\n    return {\n        encode(data) {\n            if (!isBytes(data))\n                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) {\n            if (!isBytes(data))\n                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])\n                    throw new Error('Invalid checksum');\n            return payload;\n        },\n    };\n}\n// prettier-ignore\nexport const utils = {\n    alphabet, chain, checksum, convertRadix, convertRadix2, radix, radix2, join, padding,\n};\n// RFC 4648 aka RFC 3548\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 = chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\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 = chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\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 = chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), join(''));\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 = chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\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 = chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), join(''));\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 = chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\n// Built-in base64 conversion https://caniuse.com/mdn-javascript_builtins_uint8array_frombase64\n// prettier-ignore\nconst hasBase64Builtin = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toBase64 === 'function' &&\n    typeof Uint8Array.fromBase64 === 'function')();\nconst decodeBase64Builtin = (s, isUrl) => {\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))\n        throw new Error('invalid base64');\n    return Uint8Array.fromBase64(s, { alphabet, lastChunkHandling: 'strict' });\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 = hasBase64Builtin ? {\n    encode(b) { abytes(b); return b.toBase64(); },\n    decode(s) { return decodeBase64Builtin(s, false); },\n} : chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\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 = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), join(''));\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 = hasBase64Builtin ? {\n    encode(b) { abytes(b); return b.toBase64({ alphabet: 'base64url' }); },\n    decode(s) { return decodeBase64Builtin(s, true); },\n} : chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\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 = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), join(''));\n// base58 code\n// -----------\nconst genBase58 = /* @__NO_SIDE_EFFECTS__ */ (abc) => chain(radix(58), alphabet(abc), join(''));\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 = genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\n/**\n * base58: flickr version. Check out `base58`.\n */\nexport const base58flickr = genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\n/**\n * base58: XRP version. Check out `base58`.\n */\nexport const base58xrp = genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\n// Data len (index) -> encoded block len\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\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 = {\n    encode(data) {\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) {\n        let res = [];\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)\n                    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 * Method, which creates base58check encoder.\n * Requires function, calculating sha256.\n */\nexport const createBase58check = (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\n/**\n * Use `createBase58check` instead.\n * @deprecated\n */\nexport const base58check = createBase58check;\nconst BECH_ALPHABET = chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\nfunction bech32Polymod(pre) {\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)\n            chk ^= POLYMOD_GENERATORS[i];\n    }\n    return chk;\n}\nfunction bechChecksum(prefix, words, encodingConst = 1) {\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)\n            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++)\n        chk = bech32Polymod(chk) ^ (prefix.charCodeAt(i) & 0x1f);\n    for (let v of words)\n        chk = bech32Polymod(chk) ^ v;\n    for (let i = 0; i < 6; i++)\n        chk = bech32Polymod(chk);\n    chk ^= encodingConst;\n    return BECH_ALPHABET.encode(convertRadix2([chk % powers[30]], 30, 5, false));\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction genBech32(encoding) {\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    function encode(prefix, words, limit = 90) {\n        astr('bech32.encode prefix', prefix);\n        if (isBytes(words))\n            words = Array.from(words);\n        anumArr('bech32.encode', words);\n        const plen = prefix.length;\n        if (plen === 0)\n            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}`;\n    }\n    function decode(str, limit = 90) {\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)\n            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))\n            throw new Error(`Invalid checksum in ${str}: expected \"${sum}\"`);\n        return { prefix, words };\n    }\n    const decodeUnsafe = unsafeWrapper(decode);\n    function decodeToBytes(str) {\n        const { prefix, words } = decode(str, false);\n        return { prefix, words, bytes: fromWords(words) };\n    }\n    function encodeFromBytes(prefix, bytes) {\n        return encode(prefix, toWords(bytes));\n    }\n    return {\n        encode,\n        decode,\n        encodeFromBytes,\n        decodeToBytes,\n        decodeUnsafe,\n        fromWords,\n        fromWordsUnsafe,\n        toWords,\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 = genBech32('bech32');\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 = genBech32('bech32m');\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 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\n// prettier-ignore\nconst hasHexBuiltin = /* @__PURE__ */ (() => typeof Uint8Array.from([]).toHex === 'function' &&\n    typeof Uint8Array.fromHex === 'function')();\n// prettier-ignore\nconst hexBuiltin = {\n    encode(data) { abytes(data); return data.toHex(); },\n    decode(s) { astr('hex', s); return Uint8Array.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 = hasHexBuiltin\n    ? hexBuiltin\n    : chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n        if (typeof s !== 'string' || s.length % 2 !== 0)\n            throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);\n        return s.toLowerCase();\n    }));\n// prettier-ignore\nconst CODERS = {\n    utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\nconst coderTypeError = 'Invalid encoding type. Available types: utf8, hex, base16, base32, base64, base64url, base58, base58xmr';\n/** @deprecated */\nexport const bytesToString = (type, bytes) => {\n    if (typeof type !== 'string' || !CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (!isBytes(bytes))\n        throw new TypeError('bytesToString() expects Uint8Array');\n    return CODERS[type].encode(bytes);\n};\n/** @deprecated */\nexport const str = bytesToString; // as in python, but for bytes only\n/** @deprecated */\nexport const stringToBytes = (type, str) => {\n    if (!CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (typeof str !== 'string')\n        throw new TypeError('stringToBytes() expects string');\n    return CODERS[type].decode(str);\n};\n/** @deprecated */\nexport const bytes = stringToBytes;\n//# sourceMappingURL=index.js.map","/**\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) {\n    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is positive integer. */\nexport function anumber(n, title = '') {\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/** Asserts something is Uint8Array. */\nexport function abytes(value, length, title = '') {\n    const bytes = isBytes(value);\n    const len = value?.length;\n    const needsLen = length !== undefined;\n    if (!bytes || (needsLen && len !== length)) {\n        const prefix = title && `\"${title}\" `;\n        const ofLen = needsLen ? ` of length ${length}` : '';\n        const got = bytes ? `length=${len}` : `type=${typeof value}`;\n        throw new Error(prefix + 'expected Uint8Array' + ofLen + ', got ' + got);\n    }\n    return value;\n}\n/** Asserts something is hash */\nexport function ahash(h) {\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/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out, instance) {\n    abytes(out, 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/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr) {\n    return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr) {\n    return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays) {\n    for (let i = 0; i < arrays.length; i++) {\n        arrays[i].fill(0);\n    }\n}\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr) {\n    return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word, shift) {\n    return (word << (32 - shift)) | (word >>> shift);\n}\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word, shift) {\n    return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/** The byte swap operation for uint32 */\nexport function byteSwap(word) {\n    return (((word << 24) & 0xff000000) |\n        ((word << 8) & 0xff0000) |\n        ((word >>> 8) & 0xff00) |\n        ((word >>> 24) & 0xff));\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE = isLE\n    ? (n) => n\n    : (n) => byteSwap(n);\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr) {\n    for (let i = 0; i < arr.length; i++) {\n        arr[i] = byteSwap(arr[i]);\n    }\n    return arr;\n}\nexport const swap32IfBE = isLE\n    ? (u) => u\n    : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = /* @__PURE__ */ (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\n    // @ts-ignore\n    if (hasHexBuiltin)\n        return bytes.toHex();\n    // pre-caching improves the speed 6x\n    let hex = '';\n    for (let i = 0; i < bytes.length; i++) {\n        hex += hexes[bytes[i]];\n    }\n    return hex;\n}\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n    if (ch >= asciis._0 && ch <= asciis._9)\n        return ch - asciis._0; // '2' => 50-48\n    if (ch >= asciis.A && ch <= asciis.F)\n        return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n    if (ch >= asciis.a && ch <= asciis.f)\n        return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n    return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // @ts-ignore\n    if (hasHexBuiltin)\n        return Uint8Array.fromHex(hex);\n    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('hex string expected, got unpadded hex of length ' + hl);\n    const array = new Uint8Array(al);\n    for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n        const n1 = asciiToBase16(hex.charCodeAt(hi));\n        const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n        if (n1 === undefined || n2 === undefined) {\n            const char = hex[hi] + hex[hi + 1];\n            throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n        }\n        array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n    }\n    return array;\n}\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\nexport const nextTick = async () => { };\n/** Returns control to thread each 'tick' ms to avoid blocking. */\nexport async function asyncLoop(iters, tick, cb) {\n    let ts = Date.now();\n    for (let i = 0; i < iters; i++) {\n        cb(i);\n        // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n        const diff = Date.now() - ts;\n        if (diff >= 0 && diff < tick)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * Converts string to bytes using UTF8 encoding.\n * 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) {\n    if (typeof str !== 'string')\n        throw new Error('string expected');\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data, errorTitle = '') {\n    if (typeof data === 'string')\n        return utf8ToBytes(data);\n    return abytes(data, undefined, errorTitle);\n}\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        abytes(a);\n        sum += a.length;\n    }\n    const res = new Uint8Array(sum);\n    for (let i = 0, pad = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        res.set(a, pad);\n        pad += a.length;\n    }\n    return res;\n}\n/** Merges default options and passed options. */\nexport function checkOpts(defaults, opts) {\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;\n}\n/** Creates function with outputLen, blockLen, create properties from a class constructor. */\nexport function createHasher(hashCons, info = {}) {\n    const hashC = (msg, 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) => hashCons(opts);\n    Object.assign(hashC, info);\n    return Object.freeze(hashC);\n}\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32) {\n    const cr = typeof globalThis === 'object' ? globalThis.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/** Creates OID opts for NIST hashes, with prefix 06 09 60 86 48 01 65 03 04 02. */\nexport const oidNist = (suffix) => ({\n    oid: Uint8Array.from([0x06, 0x09, 0x60, 0x86, 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, suffix]),\n});\n//# sourceMappingURL=utils.js.map","/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { abytes, aexists, aoutput, clean, createView } from \"./utils.js\";\n/** Choice: a ? b : c */\nexport function Chi(a, b, c) {\n    return (a & b) ^ (~a & c);\n}\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a, b, c) {\n    return (a & b) ^ (a & c) ^ (b & c);\n}\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport class HashMD {\n    blockLen;\n    outputLen;\n    padOffset;\n    isLE;\n    // For partial updates less than block size\n    buffer;\n    view;\n    finished = false;\n    length = 0;\n    pos = 0;\n    destroyed = false;\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        aexists(this);\n        abytes(data);\n        const { view, buffer, blockLen } = this;\n        const len = data.length;\n        for (let pos = 0; pos < len;) {\n            const take = Math.min(blockLen - this.pos, len - pos);\n            // Fast path: we have at least one block in input, cast it to view and process\n            if (take === blockLen) {\n                const dataView = createView(data);\n                for (; blockLen <= len - pos; pos += blockLen)\n                    this.process(dataView, pos);\n                continue;\n            }\n            buffer.set(data.subarray(pos, pos + take), this.pos);\n            this.pos += take;\n            pos += take;\n            if (this.pos === blockLen) {\n                this.process(view, 0);\n                this.pos = 0;\n            }\n        }\n        this.length += data.length;\n        this.roundClean();\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        aoutput(out, this);\n        this.finished = true;\n        // Padding\n        // We can avoid allocation of buffer for padding completely if it\n        // was previously not allocated here. But it won't change performance.\n        const { buffer, view, blockLen, isLE } = this;\n        let { pos } = this;\n        // append the bit '1' to the message\n        buffer[pos++] = 0b10000000;\n        clean(this.buffer.subarray(pos));\n        // we have less than padOffset left in buffer, so we cannot put length in\n        // current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        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)\n            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)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to ||= new this.constructor();\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.destroyed = destroyed;\n        to.finished = finished;\n        to.length = length;\n        to.pos = pos;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n    clone() {\n        return this._cloneInto();\n    }\n}\n/**\n * Initial SHA-2 state: fractional parts of square roots of first 16 primes 2..53.\n * Check out `test/misc/sha2-gen-iv.js` for recomputation guide.\n */\n/** Initial SHA256 state. Bits 0..32 of frac part of sqrt of primes 2..19 */\nexport const SHA256_IV = /* @__PURE__ */ Uint32Array.from([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,\n]);\n/** Initial SHA224 state. Bits 32..64 of frac part of sqrt of primes 23..53 */\nexport const SHA224_IV = /* @__PURE__ */ Uint32Array.from([\n    0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4,\n]);\n/** Initial SHA384 state. Bits 0..64 of frac part of sqrt of primes 23..53 */\nexport const SHA384_IV = /* @__PURE__ */ Uint32Array.from([\n    0xcbbb9d5d, 0xc1059ed8, 0x629a292a, 0x367cd507, 0x9159015a, 0x3070dd17, 0x152fecd8, 0xf70e5939,\n    0x67332667, 0xffc00b31, 0x8eb44a87, 0x68581511, 0xdb0c2e0d, 0x64f98fa7, 0x47b5481d, 0xbefa4fa4,\n]);\n/** Initial SHA512 state. Bits 0..64 of frac part of sqrt of primes 2..19 */\nexport const SHA512_IV = /* @__PURE__ */ Uint32Array.from([\n    0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,\n    0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179,\n]);\n//# sourceMappingURL=_md.js.map","/**\n * 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.js\";\nimport * as u64 from \"./_u64.js\";\nimport { clean, createHasher, oidNist, rotr } from \"./utils.js\";\n/**\n * Round constants:\n * First 32 bits of fractional parts of the cube roots of the first 64 primes 2..311)\n */\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ Uint32Array.from([\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n/** Reusable temporary buffer. \"W\" comes straight from spec. */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\n/** Internal 32-byte base SHA2 hash class. */\nclass SHA2_32B extends HashMD {\n    constructor(outputLen) {\n        super(64, outputLen, 8, false);\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        clean(SHA256_W);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        clean(this.buffer);\n    }\n}\n/** Internal SHA2-256 hash class. */\nexport class _SHA256 extends SHA2_32B {\n    // We cannot use array here since array allows indexing by variable\n    // which means optimizer/compiler cannot use registers.\n    A = SHA256_IV[0] | 0;\n    B = SHA256_IV[1] | 0;\n    C = SHA256_IV[2] | 0;\n    D = SHA256_IV[3] | 0;\n    E = SHA256_IV[4] | 0;\n    F = SHA256_IV[5] | 0;\n    G = SHA256_IV[6] | 0;\n    H = SHA256_IV[7] | 0;\n    constructor() {\n        super(32);\n    }\n}\n/** Internal SHA2-224 hash class. */\nexport class _SHA224 extends SHA2_32B {\n    A = SHA224_IV[0] | 0;\n    B = SHA224_IV[1] | 0;\n    C = SHA224_IV[2] | 0;\n    D = SHA224_IV[3] | 0;\n    E = SHA224_IV[4] | 0;\n    F = SHA224_IV[5] | 0;\n    G = SHA224_IV[6] | 0;\n    H = SHA224_IV[7] | 0;\n    constructor() {\n        super(28);\n    }\n}\n// SHA2-512 is slower than sha256 in js because u64 operations are slow.\n// Round contants\n// First 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409\n// prettier-ignore\nconst K512 = /* @__PURE__ */ (() => u64.split([\n    '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n    '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n    '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n    '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n    '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n    '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n    '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n    '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n    '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n    '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n    '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n    '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n    '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n    '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n    '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n    '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n    '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n    '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n    '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n    '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\nconst SHA512_Kh = /* @__PURE__ */ (() => K512[0])();\nconst SHA512_Kl = /* @__PURE__ */ (() => K512[1])();\n// Reusable temporary buffers\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\n/** Internal 64-byte base SHA2 hash class. */\nclass SHA2_64B extends HashMD {\n    constructor(outputLen) {\n        super(128, outputLen, 16, false);\n    }\n    // prettier-ignore\n    get() {\n        const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n    }\n    // prettier-ignore\n    set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n        this.Ah = Ah | 0;\n        this.Al = Al | 0;\n        this.Bh = Bh | 0;\n        this.Bl = Bl | 0;\n        this.Ch = Ch | 0;\n        this.Cl = Cl | 0;\n        this.Dh = Dh | 0;\n        this.Dl = Dl | 0;\n        this.Eh = Eh | 0;\n        this.El = El | 0;\n        this.Fh = Fh | 0;\n        this.Fl = Fl | 0;\n        this.Gh = Gh | 0;\n        this.Gl = Gl | 0;\n        this.Hh = Hh | 0;\n        this.Hl = Hl | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4) {\n            SHA512_W_H[i] = view.getUint32(offset);\n            SHA512_W_L[i] = view.getUint32((offset += 4));\n        }\n        for (let i = 16; i < 80; i++) {\n            // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n            const W15h = SHA512_W_H[i - 15] | 0;\n            const W15l = SHA512_W_L[i - 15] | 0;\n            const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n            const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n            // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n            const W2h = SHA512_W_H[i - 2] | 0;\n            const W2l = SHA512_W_L[i - 2] | 0;\n            const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n            const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n            const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n            const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n            SHA512_W_H[i] = SUMh | 0;\n            SHA512_W_L[i] = SUMl | 0;\n        }\n        let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        // Compression function main loop, 80 rounds\n        for (let i = 0; i < 80; i++) {\n            // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n            const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n            const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n            //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n            const CHIl = (El & Fl) ^ (~El & Gl);\n            // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n            // prettier-ignore\n            const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n            const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n            const T1l = T1ll | 0;\n            // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n            const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n            const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n            const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n            const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n            Hh = Gh | 0;\n            Hl = Gl | 0;\n            Gh = Fh | 0;\n            Gl = Fl | 0;\n            Fh = Eh | 0;\n            Fl = El | 0;\n            ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n            Dh = Ch | 0;\n            Dl = Cl | 0;\n            Ch = Bh | 0;\n            Cl = Bl | 0;\n            Bh = Ah | 0;\n            Bl = Al | 0;\n            const All = u64.add3L(T1l, sigma0l, MAJl);\n            Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n            Al = All | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n        ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n        ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n        ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n        ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n        ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n        ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n        ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n        this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n    }\n    roundClean() {\n        clean(SHA512_W_H, SHA512_W_L);\n    }\n    destroy() {\n        clean(this.buffer);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\n/** Internal SHA2-512 hash class. */\nexport class _SHA512 extends SHA2_64B {\n    Ah = SHA512_IV[0] | 0;\n    Al = SHA512_IV[1] | 0;\n    Bh = SHA512_IV[2] | 0;\n    Bl = SHA512_IV[3] | 0;\n    Ch = SHA512_IV[4] | 0;\n    Cl = SHA512_IV[5] | 0;\n    Dh = SHA512_IV[6] | 0;\n    Dl = SHA512_IV[7] | 0;\n    Eh = SHA512_IV[8] | 0;\n    El = SHA512_IV[9] | 0;\n    Fh = SHA512_IV[10] | 0;\n    Fl = SHA512_IV[11] | 0;\n    Gh = SHA512_IV[12] | 0;\n    Gl = SHA512_IV[13] | 0;\n    Hh = SHA512_IV[14] | 0;\n    Hl = SHA512_IV[15] | 0;\n    constructor() {\n        super(64);\n    }\n}\n/** Internal SHA2-384 hash class. */\nexport class _SHA384 extends SHA2_64B {\n    Ah = SHA384_IV[0] | 0;\n    Al = SHA384_IV[1] | 0;\n    Bh = SHA384_IV[2] | 0;\n    Bl = SHA384_IV[3] | 0;\n    Ch = SHA384_IV[4] | 0;\n    Cl = SHA384_IV[5] | 0;\n    Dh = SHA384_IV[6] | 0;\n    Dl = SHA384_IV[7] | 0;\n    Eh = SHA384_IV[8] | 0;\n    El = SHA384_IV[9] | 0;\n    Fh = SHA384_IV[10] | 0;\n    Fl = SHA384_IV[11] | 0;\n    Gh = SHA384_IV[12] | 0;\n    Gl = SHA384_IV[13] | 0;\n    Hh = SHA384_IV[14] | 0;\n    Hl = SHA384_IV[15] | 0;\n    constructor() {\n        super(48);\n    }\n}\n/**\n * Truncated SHA512/256 and SHA512/224.\n * SHA512_IV is XORed with 0xa5a5a5a5a5a5a5a5, then used as \"intermediary\" IV of SHA512/t.\n * Then t hashes string to produce result IV.\n * See `test/misc/sha2-gen-iv.js`.\n */\n/** SHA512/224 IV */\nconst T224_IV = /* @__PURE__ */ Uint32Array.from([\n    0x8c3d37c8, 0x19544da2, 0x73e19966, 0x89dcd4d6, 0x1dfab7ae, 0x32ff9c82, 0x679dd514, 0x582f9fcf,\n    0x0f6d2b69, 0x7bd44da8, 0x77e36f73, 0x04c48942, 0x3f9d85a8, 0x6a1d36c8, 0x1112e6ad, 0x91d692a1,\n]);\n/** SHA512/256 IV */\nconst T256_IV = /* @__PURE__ */ Uint32Array.from([\n    0x22312194, 0xfc2bf72c, 0x9f555fa3, 0xc84c64c2, 0x2393b86b, 0x6f53b151, 0x96387719, 0x5940eabd,\n    0x96283ee2, 0xa88effe3, 0xbe5e1e25, 0x53863992, 0x2b0199fc, 0x2c85b8aa, 0x0eb72ddc, 0x81c52ca2,\n]);\n/** Internal SHA2-512/224 hash class. */\nexport class _SHA512_224 extends SHA2_64B {\n    Ah = T224_IV[0] | 0;\n    Al = T224_IV[1] | 0;\n    Bh = T224_IV[2] | 0;\n    Bl = T224_IV[3] | 0;\n    Ch = T224_IV[4] | 0;\n    Cl = T224_IV[5] | 0;\n    Dh = T224_IV[6] | 0;\n    Dl = T224_IV[7] | 0;\n    Eh = T224_IV[8] | 0;\n    El = T224_IV[9] | 0;\n    Fh = T224_IV[10] | 0;\n    Fl = T224_IV[11] | 0;\n    Gh = T224_IV[12] | 0;\n    Gl = T224_IV[13] | 0;\n    Hh = T224_IV[14] | 0;\n    Hl = T224_IV[15] | 0;\n    constructor() {\n        super(28);\n    }\n}\n/** Internal SHA2-512/256 hash class. */\nexport class _SHA512_256 extends SHA2_64B {\n    Ah = T256_IV[0] | 0;\n    Al = T256_IV[1] | 0;\n    Bh = T256_IV[2] | 0;\n    Bl = T256_IV[3] | 0;\n    Ch = T256_IV[4] | 0;\n    Cl = T256_IV[5] | 0;\n    Dh = T256_IV[6] | 0;\n    Dl = T256_IV[7] | 0;\n    Eh = T256_IV[8] | 0;\n    El = T256_IV[9] | 0;\n    Fh = T256_IV[10] | 0;\n    Fl = T256_IV[11] | 0;\n    Gh = T256_IV[12] | 0;\n    Gl = T256_IV[13] | 0;\n    Hh = T256_IV[14] | 0;\n    Hl = T256_IV[15] | 0;\n    constructor() {\n        super(32);\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 = /* @__PURE__ */ createHasher(() => new _SHA256(), \n/* @__PURE__ */ oidNist(0x01));\n/** SHA2-224 hash function from RFC 4634 */\nexport const sha224 = /* @__PURE__ */ createHasher(() => new _SHA224(), \n/* @__PURE__ */ oidNist(0x04));\n/** SHA2-512 hash function from RFC 4634. */\nexport const sha512 = /* @__PURE__ */ createHasher(() => new _SHA512(), \n/* @__PURE__ */ oidNist(0x03));\n/** SHA2-384 hash function from RFC 4634. */\nexport const sha384 = /* @__PURE__ */ createHasher(() => new _SHA384(), \n/* @__PURE__ */ oidNist(0x02));\n/**\n * SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n */\nexport const sha512_256 = /* @__PURE__ */ createHasher(() => new _SHA512_256(), \n/* @__PURE__ */ oidNist(0x06));\n/**\n * SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks.\n * See the paper on [truncated SHA512](https://eprint.iacr.org/2010/548.pdf).\n */\nexport const sha512_224 = /* @__PURE__ */ createHasher(() => new _SHA512_224(), \n/* @__PURE__ */ oidNist(0x05));\n//# sourceMappingURL=sha2.js.map","/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { abytes as abytes_, anumber, bytesToHex as bytesToHex_, concatBytes as concatBytes_, hexToBytes as hexToBytes_, } from '@noble/hashes/utils.js';\nexport { abytes, anumber, bytesToHex, concatBytes, hexToBytes, isBytes, randomBytes, } from '@noble/hashes/utils.js';\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nexport function abool(value, title = '') {\n    if (typeof value !== 'boolean') {\n        const prefix = title && `\"${title}\" `;\n        throw new Error(prefix + 'expected boolean, got type=' + typeof value);\n    }\n    return value;\n}\n// Used in weierstrass, der\nfunction abignumber(n) {\n    if (typeof n === 'bigint') {\n        if (!isPosBig(n))\n            throw new Error('positive bigint expected, got ' + n);\n    }\n    else\n        anumber(n);\n    return n;\n}\nexport function asafenumber(value, title = '') {\n    if (!Number.isSafeInteger(value)) {\n        const prefix = title && `\"${title}\" `;\n        throw new Error(prefix + 'expected safe integer, got type=' + typeof value);\n    }\n}\nexport function numberToHexUnpadded(num) {\n    const hex = abignumber(num).toString(16);\n    return hex.length & 1 ? '0' + hex : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex_(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    return hexToNumber(bytesToHex_(copyBytes(abytes_(bytes)).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    anumber(len);\n    n = abignumber(n);\n    const res = hexToBytes_(n.toString(16).padStart(len * 2, '0'));\n    if (res.length !== len)\n        throw new Error('number too large');\n    return res;\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes_(numberToHexUnpadded(abignumber(n)));\n}\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a, b) {\n    if (a.length !== b.length)\n        return false;\n    let diff = 0;\n    for (let i = 0; i < a.length; i++)\n        diff |= a[i] ^ b[i];\n    return diff === 0;\n}\n/**\n * Copies Uint8Array. We can't use u8a.slice(), because u8a can be Buffer,\n * and Buffer#slice creates mutable copy. Never use Buffers!\n */\nexport function copyBytes(bytes) {\n    return Uint8Array.from(bytes);\n}\n/**\n * Decodes 7-bit ASCII string to Uint8Array, throws on non-ascii symbols\n * Should be safe to use for things expected to be ASCII.\n * Returns exact same result as `TextEncoder` for ASCII or throws.\n */\nexport function asciiToBytes(ascii) {\n    return Uint8Array.from(ascii, (c, i) => {\n        const charCode = c.charCodeAt(0);\n        if (c.length !== 1 || charCode > 127) {\n            throw new Error(`string contains non-ASCII character \"${ascii[i]}\" with code ${charCode} at position ${i}`);\n        }\n        return charCode;\n    });\n}\n// Is positive bigint\nconst isPosBig = (n) => typeof n === 'bigint' && _0n <= n;\nexport function inRange(n, min, max) {\n    return isPosBig(n) && isPosBig(min) && isPosBig(max) && min <= n && n < max;\n}\n/**\n * Asserts min <= n < max. NOTE: It's < max and not <= max.\n * @example\n * aInRange('x', x, 1n, 256n); // would assume x is in (1n..255n)\n */\nexport function aInRange(title, n, min, max) {\n    // Why min <= n < max and not a (min < n < max) OR b (min <= n <= max)?\n    // consider P=256n, min=0n, max=P\n    // - a for min=0 would require -1:          `inRange('x', x, -1n, P)`\n    // - b would commonly require subtraction:  `inRange('x', x, 0n, P - 1n)`\n    // - our way is the cleanest:               `inRange('x', x, 0n, P)\n    if (!inRange(n, min, max))\n        throw new Error('expected valid ' + title + ': ' + min + ' <= n < ' + max + ', got ' + n);\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n * TODO: merge with nLength in modular\n */\nexport function bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\n}\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport function bitSet(n, pos, value) {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\n}\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n) => (_1n << BigInt(n)) - _1n;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    anumber(hashLen, 'hashLen');\n    anumber(qByteLen, 'qByteLen');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    const u8n = (len) => 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    // 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) => hmacFn(k, concatBytes_(v, ...msgs)); // hmac(k)(v, ...values)\n    const reseed = (seed = 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)\n            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)\n            throw new Error('drbg: tried max amount of iterations');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return concatBytes_(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\nexport function validateObject(object, fields = {}, optFields = {}) {\n    if (!object || typeof object !== 'object')\n        throw new Error('expected valid options object');\n    function checkField(fieldName, expectedType, isOpt) {\n        const val = object[fieldName];\n        if (isOpt && val === undefined)\n            return;\n        const current = typeof val;\n        if (current !== expectedType || val === null)\n            throw new Error(`param \"${fieldName}\" is invalid: expected ${expectedType}, got ${current}`);\n    }\n    const iter = (f, isOpt) => Object.entries(f).forEach(([k, v]) => checkField(k, v, isOpt));\n    iter(fields, false);\n    iter(optFields, true);\n}\n/**\n * throws not implemented error\n */\nexport const notImplemented = () => {\n    throw new Error('not implemented');\n};\n/**\n * Memoizes (caches) computation result.\n * Uses WeakMap: the value is going auto-cleaned by GC after last reference is removed.\n */\nexport function memoized(fn) {\n    const map = new WeakMap();\n    return (arg, ...args) => {\n        const val = map.get(arg);\n        if (val !== undefined)\n            return val;\n        const computed = fn(arg, ...args);\n        map.set(arg, computed);\n        return computed;\n    };\n}\n//# sourceMappingURL=utils.js.map","/**\n * Utils for modular division and fields.\n * Field over 11 is a finite (Galois) field is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { abytes, anumber, bytesToNumberBE, bytesToNumberLE, numberToBytesBE, numberToBytesLE, validateObject, } from \"../utils.js\";\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// Calculates a modulo b\nexport function mod(a, b) {\n    const result = a % b;\n    return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\nexport function pow(num, power, modulo) {\n    return FpPow(Field(modulo), num, power);\n}\n/** Does `x^(2^power)` mod p. `pow2(30, 4)` == `30^(2^4)` */\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n/**\n * Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n */\nexport function invert(number, modulo) {\n    if (number === _0n)\n        throw new Error('invert: expected non-zero number');\n    if (modulo <= _0n)\n        throw new Error('invert: expected positive modulus, got ' + modulo);\n    // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n    let a = mod(number, modulo);\n    let b = modulo;\n    // prettier-ignore\n    let x = _0n, y = _1n, u = _1n, v = _0n;\n    while (a !== _0n) {\n        // JIT applies optimization if those two lines follow each other\n        const q = b / a;\n        const r = b % a;\n        const m = x - u * q;\n        const n = y - v * q;\n        // prettier-ignore\n        b = a, a = r, x = u, y = v, u = m, v = n;\n    }\n    const gcd = b;\n    if (gcd !== _1n)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\n}\nfunction assertIsSquare(Fp, root, n) {\n    if (!Fp.eql(Fp.sqr(root), n))\n        throw new Error('Cannot find square root');\n}\n// Not all roots are possible! Example which will throw:\n// const NUM =\n// n = 72057594037927816n;\n// Fp = Field(BigInt('0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaab'));\nfunction sqrt3mod4(Fp, n) {\n    const p1div4 = (Fp.ORDER + _1n) / _4n;\n    const root = Fp.pow(n, p1div4);\n    assertIsSquare(Fp, root, n);\n    return root;\n}\nfunction sqrt5mod8(Fp, n) {\n    const p5div8 = (Fp.ORDER - _5n) / _8n;\n    const n2 = Fp.mul(n, _2n);\n    const v = Fp.pow(n2, p5div8);\n    const nv = Fp.mul(n, v);\n    const i = Fp.mul(Fp.mul(nv, _2n), v);\n    const root = Fp.mul(nv, Fp.sub(i, Fp.ONE));\n    assertIsSquare(Fp, root, n);\n    return root;\n}\n// Based on RFC9380, Kong algorithm\n// prettier-ignore\nfunction sqrt9mod16(P) {\n    const Fp_ = Field(P);\n    const tn = tonelliShanks(P);\n    const c1 = tn(Fp_, Fp_.neg(Fp_.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n    const c2 = tn(Fp_, c1); //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n    const c3 = tn(Fp_, Fp_.neg(c1)); //  3. c3 = sqrt(-c1) in F, i.e., (c3^2) == -c1 in F\n    const c4 = (P + _7n) / _16n; //  4. c4 = (q + 7) / 16        # Integer arithmetic\n    return (Fp, n) => {\n        let tv1 = Fp.pow(n, c4); //  1. tv1 = x^c4\n        let tv2 = Fp.mul(tv1, c1); //  2. tv2 = c1 * tv1\n        const tv3 = Fp.mul(tv1, c2); //  3. tv3 = c2 * tv1\n        const tv4 = Fp.mul(tv1, c3); //  4. tv4 = c3 * tv1\n        const e1 = Fp.eql(Fp.sqr(tv2), n); //  5.  e1 = (tv2^2) == x\n        const e2 = Fp.eql(Fp.sqr(tv3), n); //  6.  e2 = (tv3^2) == x\n        tv1 = Fp.cmov(tv1, tv2, e1); //  7. tv1 = CMOV(tv1, tv2, e1)  # Select tv2 if (tv2^2) == x\n        tv2 = Fp.cmov(tv4, tv3, e2); //  8. tv2 = CMOV(tv4, tv3, e2)  # Select tv3 if (tv3^2) == x\n        const e3 = Fp.eql(Fp.sqr(tv2), n); //  9.  e3 = (tv2^2) == x\n        const root = Fp.cmov(tv1, tv2, e3); // 10.  z = CMOV(tv1, tv2, e3)   # Select sqrt from tv1 & tv2\n        assertIsSquare(Fp, root, n);\n        return root;\n    };\n}\n/**\n * Tonelli-Shanks square root search algorithm.\n * 1. https://eprint.iacr.org/2012/685.pdf (page 12)\n * 2. Square Roots from 1; 24, 51, 10 to Dan Shanks\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n    // Initialization (precomputation).\n    // Caching initialization could boost perf by 7%.\n    if (P < _3n)\n        throw new Error('sqrt is not defined for small field');\n    // Factor P - 1 = Q * 2^S, where Q is odd\n    let Q = P - _1n;\n    let S = 0;\n    while (Q % _2n === _0n) {\n        Q /= _2n;\n        S++;\n    }\n    // Find the first quadratic non-residue Z >= 2\n    let Z = _2n;\n    const _Fp = Field(P);\n    while (FpLegendre(_Fp, Z) === 1) {\n        // Basic primality test for P. After x iterations, chance of\n        // not finding quadratic non-residue is 2^x, so 2^1000.\n        if (Z++ > 1000)\n            throw new Error('Cannot find square root: probably non-prime P');\n    }\n    // Fast-path; usually done before Z, but we do \"primality test\".\n    if (S === 1)\n        return sqrt3mod4;\n    // Slow-path\n    // TODO: test on Fp2 and others\n    let cc = _Fp.pow(Z, Q); // c = z^Q\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        if (Fp.is0(n))\n            return n;\n        // Check if n is a quadratic residue using Legendre symbol\n        if (FpLegendre(Fp, n) !== 1)\n            throw new Error('Cannot find square root');\n        // Initialize variables for the main loop\n        let M = S;\n        let c = Fp.mul(Fp.ONE, cc); // c = z^Q, move cc from field _Fp into field Fp\n        let t = Fp.pow(n, Q); // t = n^Q, first guess at the fudge factor\n        let R = Fp.pow(n, Q1div2); // R = n^((Q+1)/2), first guess at the square root\n        // Main loop\n        // while t != 1\n        while (!Fp.eql(t, Fp.ONE)) {\n            if (Fp.is0(t))\n                return Fp.ZERO; // if t=0 return R=0\n            let i = 1;\n            // Find the smallest i >= 1 such that t^(2^i) ≡ 1 (mod P)\n            let t_tmp = Fp.sqr(t); // t^(2^1)\n            while (!Fp.eql(t_tmp, Fp.ONE)) {\n                i++;\n                t_tmp = Fp.sqr(t_tmp); // t^(2^2)...\n                if (i === M)\n                    throw new Error('Cannot find square root');\n            }\n            // Calculate the exponent for b: 2^(M - i - 1)\n            const exponent = _1n << BigInt(M - i - 1); // bigint is important\n            const b = Fp.pow(c, exponent); // b = 2^(M - i - 1)\n            // Update variables\n            M = i;\n            c = Fp.sqr(b); // c = b^2\n            t = Fp.mul(t, c); // t = (t * b^2)\n            R = Fp.mul(R, b); // R = R*b\n        }\n        return R;\n    };\n}\n/**\n * Square root for a finite field. Will try optimized versions first:\n *\n * 1. P ≡ 3 (mod 4)\n * 2. P ≡ 5 (mod 8)\n * 3. P ≡ 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n *\n * Different algorithms can give different roots, it is up to user to decide which one they want.\n * For example there is FpSqrtOdd/FpSqrtEven to choice root based on oddness (used for hash-to-curve).\n */\nexport function FpSqrt(P) {\n    // P ≡ 3 (mod 4) => √n = n^((P+1)/4)\n    if (P % _4n === _3n)\n        return sqrt3mod4;\n    // P ≡ 5 (mod 8) => Atkin algorithm, page 10 of https://eprint.iacr.org/2012/685.pdf\n    if (P % _8n === _5n)\n        return sqrt5mod8;\n    // P ≡ 9 (mod 16) => Kong algorithm, page 11 of https://eprint.iacr.org/2012/685.pdf (algorithm 4)\n    if (P % _16n === _9n)\n        return sqrt9mod16(P);\n    // Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        BYTES: 'number',\n        BITS: 'number',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    validateObject(field, opts);\n    // const max = 16384;\n    // if (field.BYTES < 1 || field.BYTES > max) throw new Error('invalid field');\n    // if (field.BITS < 1 || field.BITS > 8 * max) throw new Error('invalid field');\n    return field;\n}\n// Generic field functions\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow(Fp, num, power) {\n    if (power < _0n)\n        throw new Error('invalid exponent, negatives unsupported');\n    if (power === _0n)\n        return Fp.ONE;\n    if (power === _1n)\n        return num;\n    let p = Fp.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = Fp.mul(p, d);\n        d = Fp.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * Exception-free. Will return `undefined` for 0 elements.\n * @param passZero map 0 to 0 (instead of undefined)\n */\nexport function FpInvertBatch(Fp, nums, passZero = false) {\n    const inverted = new Array(nums.length).fill(passZero ? Fp.ZERO : undefined);\n    // Walk from first to last, multiply them by each other MOD p\n    const multipliedAcc = nums.reduce((acc, num, i) => {\n        if (Fp.is0(num))\n            return acc;\n        inverted[i] = acc;\n        return Fp.mul(acc, num);\n    }, Fp.ONE);\n    // Invert last element\n    const invertedAcc = Fp.inv(multipliedAcc);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (Fp.is0(num))\n            return acc;\n        inverted[i] = Fp.mul(acc, inverted[i]);\n        return Fp.mul(acc, num);\n    }, invertedAcc);\n    return inverted;\n}\n// TODO: remove\nexport function FpDiv(Fp, lhs, rhs) {\n    return Fp.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, Fp.ORDER) : Fp.inv(rhs));\n}\n/**\n * Legendre symbol.\n * Legendre constant is used to calculate Legendre symbol (a | p)\n * which denotes the value of a^((p-1)/2) (mod p).\n *\n * * (a | p) ≡ 1    if a is a square (mod p), quadratic residue\n * * (a | p) ≡ -1   if a is not a square (mod p), quadratic non residue\n * * (a | p) ≡ 0    if a ≡ 0 (mod p)\n */\nexport function FpLegendre(Fp, n) {\n    // We can use 3rd argument as optional cache of this value\n    // but seems unneeded for now. The operation is very fast.\n    const p1mod2 = (Fp.ORDER - _1n) / _2n;\n    const powered = Fp.pow(n, p1mod2);\n    const yes = Fp.eql(powered, Fp.ONE);\n    const zero = Fp.eql(powered, Fp.ZERO);\n    const no = Fp.eql(powered, Fp.neg(Fp.ONE));\n    if (!yes && !zero && !no)\n        throw new Error('invalid Legendre symbol result');\n    return yes ? 1 : zero ? 0 : -1;\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(Fp, n) {\n    const l = FpLegendre(Fp, n);\n    return l === 1;\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    if (nBitLength !== undefined)\n        anumber(nBitLength);\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\nclass _Field {\n    ORDER;\n    BITS;\n    BYTES;\n    isLE;\n    ZERO = _0n;\n    ONE = _1n;\n    _lengths;\n    _sqrt; // cached sqrt\n    _mod;\n    constructor(ORDER, opts = {}) {\n        if (ORDER <= _0n)\n            throw new Error('invalid field: expected ORDER > 0, got ' + ORDER);\n        let _nbitLength = undefined;\n        this.isLE = false;\n        if (opts != null && typeof opts === 'object') {\n            if (typeof opts.BITS === 'number')\n                _nbitLength = opts.BITS;\n            if (typeof opts.sqrt === 'function')\n                this.sqrt = opts.sqrt;\n            if (typeof opts.isLE === 'boolean')\n                this.isLE = opts.isLE;\n            if (opts.allowedLengths)\n                this._lengths = opts.allowedLengths?.slice();\n            if (typeof opts.modFromBytes === 'boolean')\n                this._mod = opts.modFromBytes;\n        }\n        const { nBitLength, nByteLength } = nLength(ORDER, _nbitLength);\n        if (nByteLength > 2048)\n            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    create(num) {\n        return mod(num, this.ORDER);\n    }\n    isValid(num) {\n        if (typeof num !== 'bigint')\n            throw new Error('invalid field element: expected bigint, got ' + typeof num);\n        return _0n <= num && num < this.ORDER; // 0 is valid element, but it's not invertible\n    }\n    is0(num) {\n        return num === _0n;\n    }\n    // is valid and invertible\n    isValidNot0(num) {\n        return !this.is0(num) && this.isValid(num);\n    }\n    isOdd(num) {\n        return (num & _1n) === _1n;\n    }\n    neg(num) {\n        return mod(-num, this.ORDER);\n    }\n    eql(lhs, rhs) {\n        return lhs === rhs;\n    }\n    sqr(num) {\n        return mod(num * num, this.ORDER);\n    }\n    add(lhs, rhs) {\n        return mod(lhs + rhs, this.ORDER);\n    }\n    sub(lhs, rhs) {\n        return mod(lhs - rhs, this.ORDER);\n    }\n    mul(lhs, rhs) {\n        return mod(lhs * rhs, this.ORDER);\n    }\n    pow(num, power) {\n        return FpPow(this, num, power);\n    }\n    div(lhs, rhs) {\n        return mod(lhs * invert(rhs, this.ORDER), this.ORDER);\n    }\n    // Same as above, but doesn't normalize\n    sqrN(num) {\n        return num * num;\n    }\n    addN(lhs, rhs) {\n        return lhs + rhs;\n    }\n    subN(lhs, rhs) {\n        return lhs - rhs;\n    }\n    mulN(lhs, rhs) {\n        return lhs * rhs;\n    }\n    inv(num) {\n        return invert(num, this.ORDER);\n    }\n    sqrt(num) {\n        // Caching _sqrt speeds up sqrt9mod16 by 5x and tonneli-shanks by 10%\n        if (!this._sqrt)\n            this._sqrt = FpSqrt(this.ORDER);\n        return this._sqrt(this, num);\n    }\n    toBytes(num) {\n        return this.isLE ? numberToBytesLE(num, this.BYTES) : numberToBytesBE(num, this.BYTES);\n    }\n    fromBytes(bytes, 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('Field.fromBytes: expected ' + allowedLengths + ' bytes, got ' + bytes.length);\n            }\n            const padded = new Uint8Array(BYTES);\n            // isLE add 0 to right, !isLE to the left.\n            padded.set(bytes, isLE ? 0 : padded.length - bytes.length);\n            bytes = padded;\n        }\n        if (bytes.length !== BYTES)\n            throw new Error('Field.fromBytes: expected ' + BYTES + ' bytes, got ' + bytes.length);\n        let scalar = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        if (modFromBytes)\n            scalar = mod(scalar, ORDER);\n        if (!skipValidation)\n            if (!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) {\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, b, condition) {\n        return condition ? b : a;\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, opts = {}) {\n    return new _Field(ORDER, opts);\n}\n// Generic random scalar, we can do same for other fields if via Fp2.mul(Fp2.ONE, Fp2.random)?\n// This allows unsafe methods like ignore bias or zero. These unsafe, but often used in different protocols (if deterministic RNG).\n// which mean we cannot force this via opts.\n// Not sure what to do with randomBytes, we can accept it inside opts if wanted.\n// Probably need to export getMinHashLength somewhere?\n// random(bytes?: Uint8Array, unsafeAllowZero = false, unsafeAllowBias = false) {\n//   const LEN = !unsafeAllowBias ? getMinHashLength(ORDER) : BYTES;\n//   if (bytes === undefined) bytes = randomBytes(LEN); // _opts.randomBytes?\n//   const num = isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n//   // `mod(x, 11)` can sometimes produce 0. `mod(x, 10) + 1` is the same, but no 0\n//   const reduced = unsafeAllowZero ? mod(num, ORDER) : mod(num, ORDER - _1n) + _1n;\n//   return reduced;\n// },\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(\"Field doesn't have isOdd\");\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(\"Field doesn't have isOdd\");\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.Point.Fn.ORDER)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\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//# sourceMappingURL=modular.js.map","/**\n * Methods for elliptic curve multiplication by scalars.\n * Contains wNAF, pippenger.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { bitLen, bitMask } from \"../utils.js\";\nimport { Field, FpInvertBatch, validateField } from \"./modular.js\";\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _1n = /* @__PURE__ */ BigInt(1);\nexport function negateCt(condition, item) {\n    const neg = item.negate();\n    return condition ? neg : item;\n}\n/**\n * Takes a bunch of Projective Points but executes only one\n * inversion on all of them. Inversion is very slow operation,\n * so this improves performance massively.\n * Optimization: converts a list of projective points to a list of identical points with Z=1.\n */\nexport function normalizeZ(c, points) {\n    const invertedZs = FpInvertBatch(c.Fp, points.map((p) => p.Z));\n    return points.map((p, i) => c.fromAffine(p.toAffine(invertedZs[i])));\n}\nfunction validateW(W, bits) {\n    if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n        throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\nfunction calcWOpts(W, scalarBits) {\n    validateW(W, scalarBits);\n    const windows = Math.ceil(scalarBits / W) + 1; // W=8 33. Not 32, because we skip zero\n    const windowSize = 2 ** (W - 1); // W=8 128. Not 256, because we skip zero\n    const maxNumber = 2 ** W; // W=8 256\n    const mask = bitMask(W); // W=8 255 == mask 0b11111111\n    const shiftBy = BigInt(W); // W=8 8\n    return { windows, windowSize, mask, maxNumber, shiftBy };\n}\nfunction calcOffsets(n, window, wOpts) {\n    const { windowSize, mask, maxNumber, shiftBy } = wOpts;\n    let wbits = Number(n & mask); // extract W bits.\n    let nextN = n >> shiftBy; // shift number by W bits.\n    // What actually happens here:\n    // const highestBit = Number(mask ^ (mask >> 1n));\n    // let wbits2 = wbits - 1; // skip zero\n    // if (wbits2 & highestBit) { wbits2 ^= Number(mask); // (~);\n    // split if bits > max: +224 => 256-32\n    if (wbits > windowSize) {\n        // we skip zero, which means instead of `>= size-1`, we do `> size`\n        wbits -= maxNumber; // -32, can be maxNumber - wbits, but then we need to set isNeg here.\n        nextN += _1n; // +256 (carry)\n    }\n    const offsetStart = window * windowSize;\n    const offset = offsetStart + Math.abs(wbits) - 1; // -1 because we skip zero\n    const isZero = wbits === 0; // is current window slice a 0?\n    const isNeg = wbits < 0; // is current window slice negative?\n    const isNegF = window % 2 !== 0; // fake random statement for noise\n    const offsetF = offsetStart; // fake offset for noise\n    return { nextN, offset, isZero, isNeg, isNegF, offsetF };\n}\nfunction validateMSMPoints(points, c) {\n    if (!Array.isArray(points))\n        throw new Error('array expected');\n    points.forEach((p, i) => {\n        if (!(p instanceof c))\n            throw new Error('invalid point at index ' + i);\n    });\n}\nfunction validateMSMScalars(scalars, field) {\n    if (!Array.isArray(scalars))\n        throw new Error('array of scalars expected');\n    scalars.forEach((s, i) => {\n        if (!field.isValid(s))\n            throw new Error('invalid scalar at index ' + i);\n    });\n}\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes.\n// Allows to make points frozen / immutable.\nconst pointPrecomputes = new WeakMap();\nconst pointWindowSizes = new WeakMap();\nfunction getW(P) {\n    // To disable precomputes:\n    // return 1;\n    return pointWindowSizes.get(P) || 1;\n}\nfunction assert0(n) {\n    if (n !== _0n)\n        throw new Error('invalid wNAF');\n}\n/**\n * Elliptic curve multiplication of Point by scalar. Fragile.\n * Table generation takes **30MB of ram and 10ms on high-end CPU**,\n * but may take much longer on slow devices. Actual generation will happen on\n * first call of `multiply()`. By default, `BASE` point is precomputed.\n *\n * Scalars should always be less than curve order: this should be checked inside of a curve itself.\n * Creates precomputation tables for fast multiplication:\n * - private scalar is split by fixed size windows of W bits\n * - every window point is collected from window's table & added to accumulator\n * - since windows are different, same point inside tables won't be accessed more than once per calc\n * - each multiplication is 'Math.ceil(CURVE_ORDER / 𝑊) + 1' point additions (fixed for any scalar)\n * - +1 window is neccessary for wNAF\n * - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n *\n * @todo Research returning 2d JS array of windows, instead of a single window.\n * This would allow windows to be in different memory locations\n */\nexport class wNAF {\n    BASE;\n    ZERO;\n    Fn;\n    bits;\n    // Parametrized with a given Point class (not individual point)\n    constructor(Point, bits) {\n        this.BASE = Point.BASE;\n        this.ZERO = Point.ZERO;\n        this.Fn = Point.Fn;\n        this.bits = bits;\n    }\n    // non-const time multiplication ladder\n    _unsafeLadder(elm, n, p = this.ZERO) {\n        let d = elm;\n        while (n > _0n) {\n            if (n & _1n)\n                p = p.add(d);\n            d = d.double();\n            n >>= _1n;\n        }\n        return p;\n    }\n    /**\n     * Creates a wNAF precomputation window. Used for caching.\n     * Default window size is set by `utils.precompute()` and is equal to 8.\n     * Number of precomputed points depends on the curve size:\n     * 2^(𝑊−1) * (Math.ceil(𝑛 / 𝑊) + 1), where:\n     * - 𝑊 is the window size\n     * - 𝑛 is the bitlength of the curve order.\n     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n     * @param point Point instance\n     * @param W window size\n     * @returns precomputed point tables flattened to a single array\n     */\n    precomputeWindow(point, W) {\n        const { windows, windowSize } = calcWOpts(W, this.bits);\n        const points = [];\n        let p = point;\n        let base = p;\n        for (let window = 0; window < windows; window++) {\n            base = p;\n            points.push(base);\n            // i=1, bc we skip 0\n            for (let i = 1; i < windowSize; i++) {\n                base = base.add(p);\n                points.push(base);\n            }\n            p = base.double();\n        }\n        return points;\n    }\n    /**\n     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n     * More compact implementation:\n     * https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541\n     * @returns real and fake (for const-time) points\n     */\n    wNAF(W, precomputes, n) {\n        // Scalar should be smaller than field order\n        if (!this.Fn.isValid(n))\n            throw new Error('invalid scalar');\n        // Accumulators\n        let p = this.ZERO;\n        let f = this.BASE;\n        // This code was first written with assumption that 'f' and 'p' will never be infinity point:\n        // since each addition is multiplied by 2 ** W, it cannot cancel each other. However,\n        // there is negate now: it is possible that negated element from low value\n        // would be the same as high element, which will create carry into next window.\n        // It's not obvious how this can fail, but still worth investigating later.\n        const wo = calcWOpts(W, this.bits);\n        for (let window = 0; window < wo.windows; window++) {\n            // (n === _0n) is handled and not early-exited. isEven and offsetF are used for noise\n            const { nextN, offset, isZero, isNeg, isNegF, offsetF } = calcOffsets(n, window, wo);\n            n = nextN;\n            if (isZero) {\n                // bits are 0: add garbage to fake point\n                // Important part for const-time getPublicKey: add random \"noise\" point to f.\n                f = f.add(negateCt(isNegF, precomputes[offsetF]));\n            }\n            else {\n                // bits are 1: add to result point\n                p = p.add(negateCt(isNeg, precomputes[offset]));\n            }\n        }\n        assert0(n);\n        // Return both real and fake points: JIT won't eliminate f.\n        // At this point there is a way to F be infinity-point even if p is not,\n        // which makes it less const-time: around 1 bigint multiply.\n        return { p, f };\n    }\n    /**\n     * Implements ec unsafe (non const-time) multiplication using precomputed tables and w-ary non-adjacent form.\n     * @param acc accumulator point to add result of multiplication\n     * @returns point\n     */\n    wNAFUnsafe(W, precomputes, n, acc = this.ZERO) {\n        const wo = calcWOpts(W, this.bits);\n        for (let window = 0; window < wo.windows; window++) {\n            if (n === _0n)\n                break; // Early-exit, skip 0 value\n            const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);\n            n = nextN;\n            if (isZero) {\n                // Window bits are 0: skip processing.\n                // Move to next window.\n                continue;\n            }\n            else {\n                const item = precomputes[offset];\n                acc = acc.add(isNeg ? item.negate() : item); // Re-using acc allows to save adds in MSM\n            }\n        }\n        assert0(n);\n        return acc;\n    }\n    getPrecomputes(W, point, transform) {\n        // Calculate precomputes on a first run, reuse them after\n        let comp = pointPrecomputes.get(point);\n        if (!comp) {\n            comp = this.precomputeWindow(point, W);\n            if (W !== 1) {\n                // Doing transform outside of if brings 15% perf hit\n                if (typeof transform === 'function')\n                    comp = transform(comp);\n                pointPrecomputes.set(point, comp);\n            }\n        }\n        return comp;\n    }\n    cached(point, scalar, transform) {\n        const W = getW(point);\n        return this.wNAF(W, this.getPrecomputes(W, point, transform), scalar);\n    }\n    unsafe(point, scalar, transform, prev) {\n        const W = getW(point);\n        if (W === 1)\n            return this._unsafeLadder(point, scalar, prev); // For W=1 ladder is ~x2 faster\n        return this.wNAFUnsafe(W, this.getPrecomputes(W, point, transform), scalar, prev);\n    }\n    // We calculate precomputes for elliptic curve point multiplication\n    // using windowed method. This specifies window size and\n    // stores precomputed values. Usually only base point would be precomputed.\n    createCache(P, W) {\n        validateW(W, this.bits);\n        pointWindowSizes.set(P, W);\n        pointPrecomputes.delete(P);\n    }\n    hasCache(elm) {\n        return getW(elm) !== 1;\n    }\n}\n/**\n * Endomorphism-specific multiplication for Koblitz curves.\n * Cost: 128 dbl, 0-256 adds.\n */\nexport function mulEndoUnsafe(Point, point, k1, k2) {\n    let acc = point;\n    let p1 = Point.ZERO;\n    let p2 = Point.ZERO;\n    while (k1 > _0n || k2 > _0n) {\n        if (k1 & _1n)\n            p1 = p1.add(acc);\n        if (k2 & _1n)\n            p2 = p2.add(acc);\n        acc = acc.double();\n        k1 >>= _1n;\n        k2 >>= _1n;\n    }\n    return { p1, p2 };\n}\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster than precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @param scalars array of L scalars (aka secret keys / bigints)\n */\nexport function pippenger(c, points, scalars) {\n    // If we split scalars by some window (let's say 8 bits), every chunk will only\n    // take 256 buckets even if there are 4096 scalars, also re-uses double.\n    // TODO:\n    // - https://eprint.iacr.org/2024/750.pdf\n    // - https://tches.iacr.org/index.php/TCHES/article/view/10287\n    // 0 is accepted in scalars\n    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)\n        throw new Error('arrays of points and scalars must have equal length');\n    // if (plength === 0) throw new Error('array must be of length >= 2');\n    const zero = c.ZERO;\n    const wbits = bitLen(BigInt(plength));\n    let windowSize = 1; // bits\n    if (wbits > 12)\n        windowSize = wbits - 3;\n    else if (wbits > 4)\n        windowSize = wbits - 2;\n    else if (wbits > 0)\n        windowSize = 2;\n    const MASK = bitMask(windowSize);\n    const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array\n    const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;\n    let sum = zero;\n    for (let i = lastBits; i >= 0; i -= windowSize) {\n        buckets.fill(zero);\n        for (let j = 0; j < slength; j++) {\n            const scalar = scalars[j];\n            const wbits = Number((scalar >> BigInt(i)) & MASK);\n            buckets[wbits] = buckets[wbits].add(points[j]);\n        }\n        let resI = zero; // not using this will do small speed-up, but will lose ct\n        // Skip first bucket, because it is zero\n        for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n            sumI = sumI.add(buckets[j]);\n            resI = resI.add(sumI);\n        }\n        sum = sum.add(resI);\n        if (i !== 0)\n            for (let j = 0; j < windowSize; j++)\n                sum = sum.double();\n    }\n    return sum;\n}\n/**\n * Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @returns function which multiplies points with scaars\n */\nexport function precomputeMSMUnsafe(c, points, windowSize) {\n    /**\n     * Performance Analysis of Window-based Precomputation\n     *\n     * Base Case (256-bit scalar, 8-bit window):\n     * - Standard precomputation requires:\n     *   - 31 additions per scalar × 256 scalars = 7,936 ops\n     *   - Plus 255 summary additions = 8,191 total ops\n     *   Note: Summary additions can be optimized via accumulator\n     *\n     * Chunked Precomputation Analysis:\n     * - Using 32 chunks requires:\n     *   - 255 additions per chunk\n     *   - 256 doublings\n     *   - Total: (255 × 32) + 256 = 8,416 ops\n     *\n     * Memory Usage Comparison:\n     * Window Size | Standard Points | Chunked Points\n     * ------------|-----------------|---------------\n     *     4-bit   |     520         |      15\n     *     8-bit   |    4,224        |     255\n     *    10-bit   |   13,824        |   1,023\n     *    16-bit   |  557,056        |  65,535\n     *\n     * Key Advantages:\n     * 1. Enables larger window sizes due to reduced memory overhead\n     * 2. More efficient for smaller scalar counts:\n     *    - 16 chunks: (16 × 255) + 256 = 4,336 ops\n     *    - ~2x faster than standard 8,191 ops\n     *\n     * Limitations:\n     * - Not suitable for plain precomputes (requires 256 constant doublings)\n     * - Performance degrades with larger scalar counts:\n     *   - Optimal for ~256 scalars\n     *   - Less efficient for 4096+ scalars (Pippenger preferred)\n     */\n    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) => {\n        const res = [];\n        for (let i = 0, acc = p; i < tableSize; i++) {\n            res.push(acc);\n            acc = acc.add(p);\n        }\n        return res;\n    });\n    return (scalars) => {\n        validateMSMScalars(scalars, fieldN);\n        if (scalars.length > points.length)\n            throw new Error('array of scalars must be smaller than array of points');\n        let res = zero;\n        for (let i = 0; i < chunks; i++) {\n            // No need to double if accumulator is still zero.\n            if (res !== zero)\n                for (let j = 0; j < windowSize; j++)\n                    res = res.double();\n            const shiftBy = BigInt(chunks * windowSize - (i + 1) * windowSize);\n            for (let j = 0; j < scalars.length; j++) {\n                const n = scalars[j];\n                const curr = Number((n >> shiftBy) & MASK);\n                if (!curr)\n                    continue; // skip zero scalars chunks\n                res = res.add(tables[j][curr - 1]);\n            }\n        }\n        return res;\n    };\n}\nfunction createField(order, field, isLE) {\n    if (field) {\n        if (field.ORDER !== order)\n            throw new Error('Field.ORDER must match order: Fp == p, Fn == n');\n        validateField(field);\n        return field;\n    }\n    else {\n        return Field(order, { isLE });\n    }\n}\n/** Validates CURVE opts and creates fields */\nexport function createCurveFields(type, CURVE, curveOpts = {}, FpFnLE) {\n    if (FpFnLE === undefined)\n        FpFnLE = type === 'edwards';\n    if (!CURVE || typeof CURVE !== 'object')\n        throw new Error(`expected valid ${type} CURVE object`);\n    for (const p of ['p', 'n', 'h']) {\n        const val = CURVE[p];\n        if (!(typeof val === 'bigint' && val > _0n))\n            throw new Error(`CURVE.${p} must be positive bigint`);\n    }\n    const Fp = createField(CURVE.p, curveOpts.Fp, FpFnLE);\n    const Fn = createField(CURVE.n, curveOpts.Fn, FpFnLE);\n    const _b = type === 'weierstrass' ? 'b' : 'd';\n    const params = ['Gx', 'Gy', 'a', _b];\n    for (const p of params) {\n        // @ts-ignore\n        if (!Fp.isValid(CURVE[p]))\n            throw new Error(`CURVE.${p} must be valid field element of CURVE.Fp`);\n    }\n    CURVE = Object.freeze(Object.assign({}, CURVE));\n    return { CURVE, Fp, Fn };\n}\nexport function createKeygen(randomSecretKey, getPublicKey) {\n    return function keygen(seed) {\n        const secretKey = randomSecretKey(seed);\n        return { secretKey, publicKey: getPublicKey(secretKey) };\n    };\n}\n//# sourceMappingURL=curve.js.map","/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash, clean } from \"./utils.js\";\n/** Internal class for HMAC. */\nexport class _HMAC {\n    oHash;\n    iHash;\n    blockLen;\n    outputLen;\n    finished = false;\n    destroyed = false;\n    constructor(hash, key) {\n        ahash(hash);\n        abytes(key, undefined, 'key');\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('Expected instance of class which extends utils.Hash');\n        this.blockLen = this.iHash.blockLen;\n        this.outputLen = this.iHash.outputLen;\n        const blockLen = this.blockLen;\n        const pad = new Uint8Array(blockLen);\n        // blockLen can be bigger than outputLen\n        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36;\n        this.iHash.update(pad);\n        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n        this.oHash = hash.create();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        clean(pad);\n    }\n    update(buf) {\n        aexists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        aexists(this);\n        abytes(out, this.outputLen, '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() {\n        const out = new Uint8Array(this.oHash.outputLen);\n        this.digestInto(out);\n        return out;\n    }\n    _cloneInto(to) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to ||= Object.create(Object.getPrototypeOf(this), {});\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    clone() {\n        return this._cloneInto();\n    }\n    destroy() {\n        this.destroyed = true;\n        this.oHash.destroy();\n        this.iHash.destroy();\n    }\n}\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n * @example\n * import { hmac } from '@noble/hashes/hmac';\n * import { sha256 } from '@noble/hashes/sha2';\n * const mac1 = hmac(sha256, 'key', 'message');\n */\nexport const hmac = (hash, key, message) => new _HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new _HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","/**\n * Short Weierstrass curve methods. The formula is: y² = x³ + ax + b.\n *\n * ### Design rationale for types\n *\n * * Interaction between classes from different curves should fail:\n *   `k256.Point.BASE.add(p256.Point.BASE)`\n * * For this purpose we want to use `instanceof` operator, which is fast and works during runtime\n * * Different calls of `curve()` would return different classes -\n *   `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,\n *   it won't affect others\n *\n * TypeScript can't infer types for classes created inside a function. Classes is one instance\n * of nominative types in TypeScript and interfaces only check for shape, so it's hard to create\n * unique type for every function call.\n *\n * We can use generic types via some param, like curve opts, but that would:\n *     1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)\n *     which is hard to debug.\n *     2. Params can be generic and we can't enforce them to be constant value:\n *     if somebody creates curve from non-constant params,\n *     it would be allowed to interact with other curves with non-constant params\n *\n * @todo https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac as nobleHmac } from '@noble/hashes/hmac.js';\nimport { ahash } from '@noble/hashes/utils.js';\nimport { abool, abytes, aInRange, bitLen, bitMask, bytesToHex, bytesToNumberBE, concatBytes, createHmacDrbg, hexToBytes, isBytes, memoized, numberToHexUnpadded, validateObject, randomBytes as wcRandomBytes, } from \"../utils.js\";\nimport { createCurveFields, createKeygen, mulEndoUnsafe, negateCt, normalizeZ, wNAF, } from \"./curve.js\";\nimport { FpInvertBatch, getMinHashLength, mapHashToField, validateField, } from \"./modular.js\";\n// We construct basis in such way that den is always positive and equals n, but num sign depends on basis (not on secret value)\nconst divNearest = (num, den) => (num + (num >= 0 ? den : -den) / _2n) / den;\n/**\n * Splits scalar for GLV endomorphism.\n */\nexport function _splitEndoScalar(k, basis, n) {\n    // Split scalar into two such that part is ~half bits: `abs(part) < sqrt(N)`\n    // Since part can be negative, we need to do this on point.\n    // TODO: verifyScalar function which consumes lambda\n    const [[a1, b1], [a2, b2]] = basis;\n    const c1 = divNearest(b2 * k, n);\n    const c2 = divNearest(-b1 * k, n);\n    // |k1|/|k2| is < sqrt(N), but can be negative.\n    // If we do `k1 mod N`, we'll get big scalar (`> sqrt(N)`): so, we do cheaper negation instead.\n    let k1 = k - c1 * a1 - c2 * a2;\n    let k2 = -c1 * b1 - c2 * b2;\n    const k1neg = k1 < _0n;\n    const k2neg = k2 < _0n;\n    if (k1neg)\n        k1 = -k1;\n    if (k2neg)\n        k2 = -k2;\n    // Double check that resulting scalar less than half bits of N: otherwise wNAF will fail.\n    // This should only happen on wrong basises. Also, math inside is too complex and I don't trust it.\n    const MAX_NUM = bitMask(Math.ceil(bitLen(n) / 2)) + _1n; // Half bits of N\n    if (k1 < _0n || k1 >= MAX_NUM || k2 < _0n || k2 >= MAX_NUM) {\n        throw new Error('splitScalar (endomorphism): failed, k=' + k);\n    }\n    return { k1neg, k1, k2neg, k2 };\n}\nfunction validateSigFormat(format) {\n    if (!['compact', 'recovered', 'der'].includes(format))\n        throw new Error('Signature format must be \"compact\", \"recovered\", or \"der\"');\n    return format;\n}\nfunction validateSigOpts(opts, def) {\n    const optsn = {};\n    for (let optName of Object.keys(def)) {\n        // @ts-ignore\n        optsn[optName] = opts[optName] === undefined ? def[optName] : opts[optName];\n    }\n    abool(optsn.lowS, 'lowS');\n    abool(optsn.prehash, 'prehash');\n    if (optsn.format !== undefined)\n        validateSigFormat(optsn.format);\n    return optsn;\n}\nexport class DERErr extends Error {\n    constructor(m = '') {\n        super(m);\n    }\n}\n/**\n * ASN.1 DER encoding utilities. ASN is very complex & fragile. Format:\n *\n *     [0x30 (SEQUENCE), bytelength, 0x02 (INTEGER), intLength, R, 0x02 (INTEGER), intLength, S]\n *\n * Docs: https://letsencrypt.org/docs/a-warm-welcome-to-asn1-and-der/, https://luca.ntop.org/Teaching/Appunti/asn1.html\n */\nexport const DER = {\n    // asn.1 DER encoding utils\n    Err: DERErr,\n    // Basic building block is TLV (Tag-Length-Value)\n    _tlv: {\n        encode: (tag, data) => {\n            const { Err: E } = DER;\n            if (tag < 0 || tag > 256)\n                throw new E('tlv.encode: wrong tag');\n            if (data.length & 1)\n                throw new E('tlv.encode: unpadded data');\n            const dataLen = data.length / 2;\n            const len = numberToHexUnpadded(dataLen);\n            if ((len.length / 2) & 0b1000_0000)\n                throw new E('tlv.encode: long form length too big');\n            // length of length with long form flag\n            const lenLen = dataLen > 127 ? numberToHexUnpadded((len.length / 2) | 0b1000_0000) : '';\n            const t = numberToHexUnpadded(tag);\n            return t + lenLen + len + data;\n        },\n        // v - value, l - left bytes (unparsed)\n        decode(tag, data) {\n            const { Err: E } = DER;\n            let pos = 0;\n            if (tag < 0 || tag > 256)\n                throw new E('tlv.encode: wrong tag');\n            if (data.length < 2 || data[pos++] !== tag)\n                throw new E('tlv.decode: wrong tlv');\n            const first = data[pos++];\n            const isLong = !!(first & 0b1000_0000); // First bit of first length byte is flag for short/long form\n            let length = 0;\n            if (!isLong)\n                length = first;\n            else {\n                // Long form: [longFlag(1bit), lengthLength(7bit), length (BE)]\n                const lenLen = first & 0b0111_1111;\n                if (!lenLen)\n                    throw new E('tlv.decode(long): indefinite length not supported');\n                if (lenLen > 4)\n                    throw new E('tlv.decode(long): byte length is too big'); // this will overflow u32 in js\n                const lengthBytes = data.subarray(pos, pos + lenLen);\n                if (lengthBytes.length !== lenLen)\n                    throw new E('tlv.decode: length bytes not complete');\n                if (lengthBytes[0] === 0)\n                    throw new E('tlv.decode(long): zero leftmost byte');\n                for (const b of lengthBytes)\n                    length = (length << 8) | b;\n                pos += lenLen;\n                if (length < 128)\n                    throw new E('tlv.decode(long): not minimal encoding');\n            }\n            const v = data.subarray(pos, pos + length);\n            if (v.length !== length)\n                throw new E('tlv.decode: wrong value length');\n            return { v, l: data.subarray(pos + length) };\n        },\n    },\n    // https://crypto.stackexchange.com/a/57734 Leftmost bit of first byte is 'negative' flag,\n    // since we always use positive integers here. It must always be empty:\n    // - add zero byte if exists\n    // - if next byte doesn't have a flag, leading zero is not allowed (minimal encoding)\n    _int: {\n        encode(num) {\n            const { Err: E } = DER;\n            if (num < _0n)\n                throw new E('integer: negative integers are not allowed');\n            let hex = numberToHexUnpadded(num);\n            // Pad with zero byte if negative flag is present\n            if (Number.parseInt(hex[0], 16) & 0b1000)\n                hex = '00' + hex;\n            if (hex.length & 1)\n                throw new E('unexpected DER parsing assertion: unpadded hex');\n            return hex;\n        },\n        decode(data) {\n            const { Err: E } = DER;\n            if (data[0] & 0b1000_0000)\n                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) {\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)\n            throw new E('invalid signature: left bytes after parsing');\n        const { v: rBytes, l: rLeftBytes } = tlv.decode(0x02, seqBytes);\n        const { v: sBytes, l: sLeftBytes } = tlv.decode(0x02, rLeftBytes);\n        if (sLeftBytes.length)\n            throw new E('invalid signature: left bytes after parsing');\n        return { r: int.decode(rBytes), s: int.decode(sBytes) };\n    },\n    hexFromSig(sig) {\n        const { _tlv: tlv, _int: int } = DER;\n        const rs = tlv.encode(0x02, int.encode(sig.r));\n        const ss = tlv.encode(0x02, int.encode(sig.s));\n        const seq = rs + ss;\n        return tlv.encode(0x30, seq);\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\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(params, extraOpts = {}) {\n    const validated = createCurveFields('weierstrass', params, extraOpts);\n    const { Fp, Fn } = validated;\n    let CURVE = validated.CURVE;\n    const { h: cofactor, n: CURVE_ORDER } = CURVE;\n    validateObject(extraOpts, {}, {\n        allowInfinityPoint: 'boolean',\n        clearCofactor: 'function',\n        isTorsionFree: 'function',\n        fromBytes: 'function',\n        toBytes: 'function',\n        endo: 'object',\n    });\n    const { endo } = extraOpts;\n    if (endo) {\n        // validateObject(endo, { beta: 'bigint', splitScalar: 'function' });\n        if (!Fp.is0(CURVE.a) || typeof endo.beta !== 'bigint' || !Array.isArray(endo.basises)) {\n            throw new Error('invalid endo: expected \"beta\": bigint and \"basises\": array');\n        }\n    }\n    const lengths = getWLengths(Fp, Fn);\n    function assertCompressionIsSupported() {\n        if (!Fp.isOdd)\n            throw new Error('compression is not supported: Field does not have .isOdd()');\n    }\n    // Implements IEEE P1363 point encoding\n    function pointToBytes(_c, point, isCompressed) {\n        const { x, y } = point.toAffine();\n        const bx = Fp.toBytes(x);\n        abool(isCompressed, 'isCompressed');\n        if (isCompressed) {\n            assertCompressionIsSupported();\n            const hasEvenY = !Fp.isOdd(y);\n            return concatBytes(pprefix(hasEvenY), bx);\n        }\n        else {\n            return concatBytes(Uint8Array.of(0x04), bx, Fp.toBytes(y));\n        }\n    }\n    function pointFromBytes(bytes) {\n        abytes(bytes, undefined, 'Point');\n        const { publicKey: comp, publicKeyUncompressed: uncomp } = lengths; // e.g. for 32-byte: 33, 65\n        const length = bytes.length;\n        const head = bytes[0];\n        const tail = bytes.subarray(1);\n        // No actual validation is done here: use .assertValidity()\n        if (length === comp && (head === 0x02 || head === 0x03)) {\n            const x = Fp.fromBytes(tail);\n            if (!Fp.isValid(x))\n                throw new Error('bad point: is not on curve, wrong x');\n            const y2 = weierstrassEquation(x); // y² = x³ + ax + b\n            let y;\n            try {\n                y = Fp.sqrt(y2); // y = y² ^ (p+1)/4\n            }\n            catch (sqrtError) {\n                const err = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n                throw new Error('bad point: is not on curve, sqrt error' + err);\n            }\n            assertCompressionIsSupported();\n            const evenY = Fp.isOdd(y);\n            const evenH = (head & 1) === 1; // ECDSA-specific\n            if (evenH !== evenY)\n                y = Fp.neg(y);\n            return { x, y };\n        }\n        else if (length === uncomp && head === 0x04) {\n            // TODO: more checks\n            const L = Fp.BYTES;\n            const x = Fp.fromBytes(tail.subarray(0, L));\n            const y = Fp.fromBytes(tail.subarray(L, L * 2));\n            if (!isValidXY(x, y))\n                throw new Error('bad point: is not on curve');\n            return { x, y };\n        }\n        else {\n            throw new Error(`bad point: got length ${length}, expected compressed=${comp} or uncompressed=${uncomp}`);\n        }\n    }\n    const encodePoint = extraOpts.toBytes || pointToBytes;\n    const decodePoint = extraOpts.fromBytes || pointFromBytes;\n    function weierstrassEquation(x) {\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x² * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, CURVE.a)), CURVE.b); // x³ + a * x + b\n    }\n    // TODO: move top-level\n    /** Checks whether equation holds for given x, y: y² == x³ + ax + b */\n    function isValidXY(x, y) {\n        const left = Fp.sqr(y); // y²\n        const right = weierstrassEquation(x); // x³ + ax + b\n        return Fp.eql(left, right);\n    }\n    // Validate whether the passed curve params are valid.\n    // Test 1: equation y² = x³ + ax + b should work for generator point.\n    if (!isValidXY(CURVE.Gx, CURVE.Gy))\n        throw new Error('bad curve params: generator point');\n    // Test 2: discriminant Δ part should be non-zero: 4a³ + 27b² != 0.\n    // Guarantees curve is genus-1, smooth (non-singular).\n    const _4a3 = Fp.mul(Fp.pow(CURVE.a, _3n), _4n);\n    const _27b2 = Fp.mul(Fp.sqr(CURVE.b), BigInt(27));\n    if (Fp.is0(Fp.add(_4a3, _27b2)))\n        throw new Error('bad curve params: a or b');\n    /** Asserts coordinate is valid: 0 <= n < Fp.ORDER. */\n    function acoord(title, n, banZero = false) {\n        if (!Fp.isValid(n) || (banZero && Fp.is0(n)))\n            throw new Error(`bad point coordinate ${title}`);\n        return n;\n    }\n    function aprjpoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('Weierstrass Point expected');\n    }\n    function splitEndoScalarN(k) {\n        if (!endo || !endo.basises)\n            throw new Error('no endo');\n        return _splitEndoScalar(k, endo.basises, Fn.ORDER);\n    }\n    // Memoized toAffine / validity check. They are heavy. Points are immutable.\n    // Converts Projective point to affine (x, y) coordinates.\n    // Can accept precomputed Z^-1 - for example, from invertBatch.\n    // (X, Y, Z) ∋ (x=X/Z, y=Y/Z)\n    const toAffineMemo = memoized((p, iz) => {\n        const { X, Y, Z } = p;\n        // Fast-path for normalized points\n        if (Fp.eql(Z, Fp.ONE))\n            return { x: X, y: Y };\n        const is0 = p.is0();\n        // If invZ was 0, we return zero point. However we still want to execute\n        // all operations, so we replace invZ with a random number, 1.\n        if (iz == null)\n            iz = is0 ? Fp.ONE : Fp.inv(Z);\n        const x = Fp.mul(X, iz);\n        const y = Fp.mul(Y, iz);\n        const zz = Fp.mul(Z, iz);\n        if (is0)\n            return { x: Fp.ZERO, y: Fp.ZERO };\n        if (!Fp.eql(zz, Fp.ONE))\n            throw new Error('invZ was invalid');\n        return { x, y };\n    });\n    // NOTE: on exception this will crash 'cached' and no value will be set.\n    // Otherwise true will be return\n    const assertValidMemo = memoized((p) => {\n        if (p.is0()) {\n            // (0, 1, 0) aka ZERO is invalid in most contexts.\n            // In BLS, ZERO can be serialized, so we allow it.\n            // (0, 0, 0) is invalid representation of ZERO.\n            if (extraOpts.allowInfinityPoint && !Fp.is0(p.Y))\n                return;\n            throw new Error('bad point: ZERO');\n        }\n        // Some 3rd-party test vectors require different wording between here & `fromCompressedHex`\n        const { x, y } = p.toAffine();\n        if (!Fp.isValid(x) || !Fp.isValid(y))\n            throw new Error('bad point: x or y not field elements');\n        if (!isValidXY(x, y))\n            throw new Error('bad point: equation left != right');\n        if (!p.isTorsionFree())\n            throw new Error('bad point: not in prime-order subgroup');\n        return true;\n    });\n    function finishEndo(endoBeta, k1p, k2p, k1neg, k2neg) {\n        k2p = new Point(Fp.mul(k2p.X, endoBeta), k2p.Y, k2p.Z);\n        k1p = negateCt(k1neg, k1p);\n        k2p = negateCt(k2neg, k2p);\n        return k1p.add(k2p);\n    }\n    /**\n     * Projective Point works in 3d / projective (homogeneous) coordinates:(X, Y, Z) ∋ (x=X/Z, y=Y/Z).\n     * Default Point works in 2d / affine coordinates: (x, y).\n     * We're doing calculations in projective, because its operations don't require costly inversion.\n     */\n    class Point {\n        // base / generator point\n        static BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n        // zero / infinity / identity point\n        static ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO); // 0, 1, 0\n        // math field\n        static Fp = Fp;\n        // scalar field\n        static Fn = Fn;\n        X;\n        Y;\n        Z;\n        /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n        constructor(X, Y, Z) {\n            this.X = acoord('x', X);\n            this.Y = acoord('y', Y, true);\n            this.Z = acoord('z', Z);\n            Object.freeze(this);\n        }\n        static CURVE() {\n            return CURVE;\n        }\n        /** Does NOT validate if the point is valid. Use `.assertValidity()`. */\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            // (0, 0) would've produced (0, 0, 1) - instead, we need (0, 1, 0)\n            if (Fp.is0(x) && Fp.is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        static fromBytes(bytes) {\n            const P = Point.fromAffine(decodePoint(abytes(bytes, undefined, 'point')));\n            P.assertValidity();\n            return P;\n        }\n        static fromHex(hex) {\n            return Point.fromBytes(hexToBytes(hex));\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\n        }\n        /**\n         *\n         * @param windowSize\n         * @param isLazy true will defer table computation until the first multiplication\n         * @returns\n         */\n        precompute(windowSize = 8, isLazy = true) {\n            wnaf.createCache(this, windowSize);\n            if (!isLazy)\n                this.multiply(_3n); // random number\n            return this;\n        }\n        // TODO: return `this`\n        /** A point on curve is valid if it conforms to equation. */\n        assertValidity() {\n            assertValidMemo(this);\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (!Fp.isOdd)\n                throw new Error(\"Field doesn't support isOdd\");\n            return !Fp.isOdd(y);\n        }\n        /** Compare one point to another. */\n        equals(other) {\n            aprjpoint(other);\n            const { X: X1, Y: Y1, Z: Z1 } = this;\n            const { X: X2, Y: Y2, Z: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /** Flips point to one corresponding to (x, -y) in Affine coordinates. */\n        negate() {\n            return new Point(this.X, Fp.neg(this.Y), this.Z);\n        }\n        // Renes-Costello-Batina exception-free doubling formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 3\n        // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n        double() {\n            const { a, b } = CURVE;\n            const b3 = Fp.mul(b, _3n);\n            const { X: X1, Y: Y1, Z: Z1 } = this;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            let t0 = Fp.mul(X1, X1); // step 1\n            let t1 = Fp.mul(Y1, Y1);\n            let t2 = Fp.mul(Z1, Z1);\n            let t3 = Fp.mul(X1, Y1);\n            t3 = Fp.add(t3, t3); // step 5\n            Z3 = Fp.mul(X1, Z1);\n            Z3 = Fp.add(Z3, Z3);\n            X3 = Fp.mul(a, Z3);\n            Y3 = Fp.mul(b3, t2);\n            Y3 = Fp.add(X3, Y3); // step 10\n            X3 = Fp.sub(t1, Y3);\n            Y3 = Fp.add(t1, Y3);\n            Y3 = Fp.mul(X3, Y3);\n            X3 = Fp.mul(t3, X3);\n            Z3 = Fp.mul(b3, Z3); // step 15\n            t2 = Fp.mul(a, t2);\n            t3 = Fp.sub(t0, t2);\n            t3 = Fp.mul(a, t3);\n            t3 = Fp.add(t3, Z3);\n            Z3 = Fp.add(t0, t0); // step 20\n            t0 = Fp.add(Z3, t0);\n            t0 = Fp.add(t0, t2);\n            t0 = Fp.mul(t0, t3);\n            Y3 = Fp.add(Y3, t0);\n            t2 = Fp.mul(Y1, Z1); // step 25\n            t2 = Fp.add(t2, t2);\n            t0 = Fp.mul(t2, t3);\n            X3 = Fp.sub(X3, t0);\n            Z3 = Fp.mul(t2, t1);\n            Z3 = Fp.add(Z3, Z3); // step 30\n            Z3 = Fp.add(Z3, Z3);\n            return new Point(X3, Y3, Z3);\n        }\n        // Renes-Costello-Batina exception-free addition formula.\n        // There is 30% faster Jacobian formula, but it is not complete.\n        // https://eprint.iacr.org/2015/1060, algorithm 1\n        // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n        add(other) {\n            aprjpoint(other);\n            const { X: X1, Y: Y1, Z: Z1 } = this;\n            const { X: X2, Y: Y2, Z: Z2 } = other;\n            let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n            const a = CURVE.a;\n            const b3 = Fp.mul(CURVE.b, _3n);\n            let t0 = Fp.mul(X1, X2); // step 1\n            let t1 = Fp.mul(Y1, Y2);\n            let t2 = Fp.mul(Z1, Z2);\n            let t3 = Fp.add(X1, Y1);\n            let t4 = Fp.add(X2, Y2); // step 5\n            t3 = Fp.mul(t3, t4);\n            t4 = Fp.add(t0, t1);\n            t3 = Fp.sub(t3, t4);\n            t4 = Fp.add(X1, Z1);\n            let t5 = Fp.add(X2, Z2); // step 10\n            t4 = Fp.mul(t4, t5);\n            t5 = Fp.add(t0, t2);\n            t4 = Fp.sub(t4, t5);\n            t5 = Fp.add(Y1, Z1);\n            X3 = Fp.add(Y2, Z2); // step 15\n            t5 = Fp.mul(t5, X3);\n            X3 = Fp.add(t1, t2);\n            t5 = Fp.sub(t5, X3);\n            Z3 = Fp.mul(a, t4);\n            X3 = Fp.mul(b3, t2); // step 20\n            Z3 = Fp.add(X3, Z3);\n            X3 = Fp.sub(t1, Z3);\n            Z3 = Fp.add(t1, Z3);\n            Y3 = Fp.mul(X3, Z3);\n            t1 = Fp.add(t0, t0); // step 25\n            t1 = Fp.add(t1, t0);\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.mul(b3, t4);\n            t1 = Fp.add(t1, t2);\n            t2 = Fp.sub(t0, t2); // step 30\n            t2 = Fp.mul(a, t2);\n            t4 = Fp.add(t4, t2);\n            t0 = Fp.mul(t1, t4);\n            Y3 = Fp.add(Y3, t0);\n            t0 = Fp.mul(t5, t4); // step 35\n            X3 = Fp.mul(t3, X3);\n            X3 = Fp.sub(X3, t0);\n            t0 = Fp.mul(t3, t1);\n            Z3 = Fp.mul(t5, Z3);\n            Z3 = Fp.add(Z3, t0); // step 40\n            return new Point(X3, Y3, Z3);\n        }\n        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        /**\n         * Constant time multiplication.\n         * Uses wNAF method. Windowed method may be 10% faster,\n         * but takes 2x longer to generate and consumes 2x memory.\n         * Uses precomputes when available.\n         * Uses endomorphism for Koblitz curves.\n         * @param scalar by which the point would be multiplied\n         * @returns New point\n         */\n        multiply(scalar) {\n            const { endo } = extraOpts;\n            if (!Fn.isValidNot0(scalar))\n                throw new Error('invalid scalar: out of range'); // 0 is invalid\n            let point, fake; // Fake point is used to const-time mult\n            const mul = (n) => wnaf.cached(this, n, (p) => normalizeZ(Point, p));\n            /** See docs for {@link EndomorphismOpts} */\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = splitEndoScalarN(scalar);\n                const { p: k1p, f: k1f } = mul(k1);\n                const { p: k2p, f: k2f } = mul(k2);\n                fake = k1f.add(k2f);\n                point = finishEndo(endo.beta, k1p, k2p, k1neg, k2neg);\n            }\n            else {\n                const { p, f } = mul(scalar);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return normalizeZ(Point, [point, fake])[0];\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed secret key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(sc) {\n            const { endo } = extraOpts;\n            const p = this;\n            if (!Fn.isValid(sc))\n                throw new Error('invalid scalar: out of range'); // 0 is valid\n            if (sc === _0n || p.is0())\n                return Point.ZERO; // 0\n            if (sc === _1n)\n                return p; // 1\n            if (wnaf.hasCache(this))\n                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ïve 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            }\n            else {\n                return wnaf.unsafe(p, sc);\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) {\n            return toAffineMemo(this, invertedZ);\n        }\n        /**\n         * Checks whether Point is free of torsion elements (is in prime subgroup).\n         * Always torsion-free for cofactor=1 curves.\n         */\n        isTorsionFree() {\n            const { isTorsionFree } = extraOpts;\n            if (cofactor === _1n)\n                return true;\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            return wnaf.unsafe(this, CURVE_ORDER).is0();\n        }\n        clearCofactor() {\n            const { clearCofactor } = extraOpts;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(cofactor);\n        }\n        isSmallOrder() {\n            // can we use this.clearCofactor()?\n            return this.multiplyUnsafe(cofactor).is0();\n        }\n        toBytes(isCompressed = true) {\n            abool(isCompressed, 'isCompressed');\n            this.assertValidity();\n            return encodePoint(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return bytesToHex(this.toBytes(isCompressed));\n        }\n        toString() {\n            return `<Point ${this.is0() ? 'ZERO' : this.toHex()}>`;\n        }\n    }\n    const bits = Fn.BITS;\n    const wnaf = new wNAF(Point, extraOpts.endo ? Math.ceil(bits / 2) : bits);\n    Point.BASE.precompute(8); // Enable precomputes. Slows down first publicKey computation by 20ms.\n    return Point;\n}\n// Points start with byte 0x02 when y is even; otherwise 0x03\nfunction pprefix(hasEvenY) {\n    return Uint8Array.of(hasEvenY ? 0x02 : 0x03);\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = _0n;\n    for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n        l += _1n;\n    const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n    // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n    // 2n ** c1 == 2n << (c1-1)\n    const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n    const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n    const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n    const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n    const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n    const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n    const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n    const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n    let sqrtRatio = (u, v) => {\n        let tv1 = c6; // 1. tv1 = c6\n        let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n        let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n        tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n        let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n        tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n        tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n        tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n        tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n        let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n        tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n        let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n        tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n        tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n        tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n        tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n        // 17. for i in (c1, c1 - 1, ..., 2):\n        for (let i = c1; i > _1n; i--) {\n            let tv5 = i - _2n; // 18.    tv5 = i - 2\n            tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n            let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n            const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n            tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n            tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n            tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n            tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n            tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n        }\n        return { isValid: isQR, value: tv3 };\n    };\n    if (Fp.ORDER % _4n === _3n) {\n        // sqrt_ratio_3mod4(u, v)\n        const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n        const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n        sqrtRatio = (u, v) => {\n            let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n            const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n            tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n            let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n            y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n            const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n            const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n            const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n            let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n            return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n        };\n    }\n    // No curves uses that\n    // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n    return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU(Fp, opts) {\n    validateField(Fp);\n    const { A, B, Z } = opts;\n    if (!Fp.isValid(A) || !Fp.isValid(B) || !Fp.isValid(Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, Z);\n    if (!Fp.isOdd)\n        throw new Error('Field does not have .isOdd()');\n    // Input: u, an element of F.\n    // Output: (x, y), a point on E.\n    return (u) => {\n        // prettier-ignore\n        let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n        tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n        tv1 = Fp.mul(tv1, Z); // 2.  tv1 = Z * tv1\n        tv2 = Fp.sqr(tv1); // 3.  tv2 = tv1^2\n        tv2 = Fp.add(tv2, tv1); // 4.  tv2 = tv2 + tv1\n        tv3 = Fp.add(tv2, Fp.ONE); // 5.  tv3 = tv2 + 1\n        tv3 = Fp.mul(tv3, B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, A); // 8.  tv4 = A * tv4\n        tv2 = Fp.sqr(tv3); // 9.  tv2 = tv3^2\n        tv6 = Fp.sqr(tv4); // 10. tv6 = tv4^2\n        tv5 = Fp.mul(tv6, A); // 11. tv5 = A * tv6\n        tv2 = Fp.add(tv2, tv5); // 12. tv2 = tv2 + tv5\n        tv2 = Fp.mul(tv2, tv3); // 13. tv2 = tv2 * tv3\n        tv6 = Fp.mul(tv6, tv4); // 14. tv6 = tv6 * tv4\n        tv5 = Fp.mul(tv6, B); // 15. tv5 = B * tv6\n        tv2 = Fp.add(tv2, tv5); // 16. tv2 = tv2 + tv5\n        x = Fp.mul(tv1, tv3); // 17.   x = tv1 * tv3\n        const { isValid, value } = sqrtRatio(tv2, tv6); // 18. (is_gx1_square, y1) = sqrt_ratio(tv2, tv6)\n        y = Fp.mul(tv1, u); // 19.   y = tv1 * u  -> Z * u^3 * y1\n        y = Fp.mul(y, value); // 20.   y = y * y1\n        x = Fp.cmov(x, tv3, isValid); // 21.   x = CMOV(x, tv3, is_gx1_square)\n        y = Fp.cmov(y, value, isValid); // 22.   y = CMOV(y, y1, is_gx1_square)\n        const e1 = Fp.isOdd(u) === Fp.isOdd(y); // 23.  e1 = sgn0(u) == sgn0(y)\n        y = Fp.cmov(Fp.neg(y), y, e1); // 24.   y = CMOV(-y, y, e1)\n        const tv4_inv = FpInvertBatch(Fp, [tv4], true)[0];\n        x = Fp.mul(x, tv4_inv); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\nfunction getWLengths(Fp, Fn) {\n    return {\n        secretKey: Fn.BYTES,\n        publicKey: 1 + Fp.BYTES,\n        publicKeyUncompressed: 1 + 2 * Fp.BYTES,\n        publicKeyHasPrefix: true,\n        signature: 2 * Fn.BYTES,\n    };\n}\n/**\n * Sometimes users only need getPublicKey, getSharedSecret, and secret key handling.\n * This helper ensures no signature functionality is present. Less code, smaller bundle size.\n */\nexport function ecdh(Point, ecdhOpts = {}) {\n    const { Fn } = Point;\n    const randomBytes_ = ecdhOpts.randomBytes || wcRandomBytes;\n    const lengths = Object.assign(getWLengths(Point.Fp, Fn), { seed: getMinHashLength(Fn.ORDER) });\n    function isValidSecretKey(secretKey) {\n        try {\n            const num = Fn.fromBytes(secretKey);\n            return Fn.isValidNot0(num);\n        }\n        catch (error) {\n            return false;\n        }\n    }\n    function isValidPublicKey(publicKey, isCompressed) {\n        const { publicKey: comp, publicKeyUncompressed } = lengths;\n        try {\n            const l = publicKey.length;\n            if (isCompressed === true && l !== comp)\n                return false;\n            if (isCompressed === false && l !== publicKeyUncompressed)\n                return false;\n            return !!Point.fromBytes(publicKey);\n        }\n        catch (error) {\n            return false;\n        }\n    }\n    /**\n     * Produces cryptographically secure secret key from random of size\n     * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n     */\n    function randomSecretKey(seed = randomBytes_(lengths.seed)) {\n        return mapHashToField(abytes(seed, lengths.seed, 'seed'), Fn.ORDER);\n    }\n    /**\n     * Computes public key for a secret key. Checks for validity of the secret key.\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns Public key, full when isCompressed=false; short when isCompressed=true\n     */\n    function getPublicKey(secretKey, isCompressed = true) {\n        return Point.BASE.multiply(Fn.fromBytes(secretKey)).toBytes(isCompressed);\n    }\n    /**\n     * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n     */\n    function isProbPub(item) {\n        const { secretKey, publicKey, publicKeyUncompressed } = lengths;\n        if (!isBytes(item))\n            return undefined;\n        if (('_lengths' in Fn && Fn._lengths) || secretKey === publicKey)\n            return undefined;\n        const l = abytes(item, undefined, 'key').length;\n        return l === publicKey || l === publicKeyUncompressed;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from secret key A and public key B.\n     * Checks: 1) secret key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(secretKeyA, publicKeyB, isCompressed = true) {\n        if (isProbPub(secretKeyA) === true)\n            throw new Error('first arg must be private key');\n        if (isProbPub(publicKeyB) === false)\n            throw new Error('second arg must be public key');\n        const s = Fn.fromBytes(secretKeyA);\n        const b = Point.fromBytes(publicKeyB); // checks for being on-curve\n        return b.multiply(s).toBytes(isCompressed);\n    }\n    const utils = {\n        isValidSecretKey,\n        isValidPublicKey,\n        randomSecretKey,\n    };\n    const keygen = createKeygen(randomSecretKey, getPublicKey);\n    return Object.freeze({ getPublicKey, getSharedSecret, keygen, Point, utils, lengths });\n}\n/**\n * Creates ECDSA signing interface for given elliptic curve `Point` and `hash` function.\n *\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(Point, hash, ecdsaOpts = {}) {\n    ahash(hash);\n    validateObject(ecdsaOpts, {}, {\n        hmac: 'function',\n        lowS: 'boolean',\n        randomBytes: 'function',\n        bits2int: 'function',\n        bits2int_modN: 'function',\n    });\n    ecdsaOpts = Object.assign({}, ecdsaOpts);\n    const randomBytes = ecdsaOpts.randomBytes || wcRandomBytes;\n    const hmac = ecdsaOpts.hmac || ((key, msg) => nobleHmac(hash, key, msg));\n    const { Fp, Fn } = Point;\n    const { ORDER: CURVE_ORDER, BITS: fnBits } = Fn;\n    const { keygen, getPublicKey, getSharedSecret, utils, lengths } = ecdh(Point, ecdsaOpts);\n    const defaultSigOpts = {\n        prehash: true,\n        lowS: typeof ecdsaOpts.lowS === 'boolean' ? ecdsaOpts.lowS : true,\n        format: 'compact',\n        extraEntropy: false,\n    };\n    const hasLargeCofactor = CURVE_ORDER * _2n < Fp.ORDER; // Won't CURVE().h > 2n be more effective?\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function validateRS(title, num) {\n        if (!Fn.isValidNot0(num))\n            throw new Error(`invalid signature ${title}: out of range 1..Point.Fn.ORDER`);\n        return num;\n    }\n    function assertSmallCofactor() {\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, format) {\n        validateSigFormat(format);\n        const size = lengths.signature;\n        const sizer = format === 'compact' ? size : format === 'recovered' ? size + 1 : undefined;\n        return abytes(bytes, sizer);\n    }\n    /**\n     * ECDSA signature with its (r, s) properties. Supports compact, recovered & DER representations.\n     */\n    class Signature {\n        r;\n        s;\n        recovery;\n        constructor(r, s, recovery) {\n            this.r = validateRS('r', r); // r in [1..N-1];\n            this.s = validateRS('s', s); // s in [1..N-1];\n            if (recovery != null) {\n                assertSmallCofactor();\n                if (![0, 1, 2, 3].includes(recovery))\n                    throw new Error('invalid recovery id');\n                this.recovery = recovery;\n            }\n            Object.freeze(this);\n        }\n        static fromBytes(bytes, format = defaultSigOpts.format) {\n            validateSigLength(bytes, format);\n            let recid;\n            if (format === 'der') {\n                const { r, s } = DER.toSig(abytes(bytes));\n                return new Signature(r, s);\n            }\n            if (format === 'recovered') {\n                recid = bytes[0];\n                format = 'compact';\n                bytes = bytes.subarray(1);\n            }\n            const L = 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        static fromHex(hex, format) {\n            return this.fromBytes(hexToBytes(hex), format);\n        }\n        assertRecovery() {\n            const { recovery } = this;\n            if (recovery == null)\n                throw new Error('invalid recovery id: must be present');\n            return recovery;\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(messageHash) {\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))\n                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())\n                throw new Error('invalid recovery: point at infinify');\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        toBytes(format = defaultSigOpts.format) {\n            validateSigFormat(format);\n            if (format === 'der')\n                return hexToBytes(DER.hexFromSig(this));\n            const { r, 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        toHex(format) {\n            return bytesToHex(this.toBytes(format));\n        }\n    }\n    // RFC6979: ensure ECDSA msg is X bytes and < N. RFC suggests optional truncating via bits2octets.\n    // FIPS 186-4 4.6 suggests the leftmost min(nBitLen, outLen) bits, which matches bits2int.\n    // bits2int can produce res>N, we can do mod(res, N) since the bitLen is the same.\n    // int2octets can't be used; pads small msgs with 0: unacceptatble for trunc as per RFC vectors\n    const bits2int = ecdsaOpts.bits2int ||\n        function bits2int_def(bytes) {\n            // Our custom check \"just in case\", for protection against DoS\n            if (bytes.length > 8192)\n                throw new Error('input is too large');\n            // For curves with nBitLength % 8 !== 0: bits2octets(bits2octets(m)) !== bits2octets(m)\n            // for some cases, since bytes.length * 8 is not actual bitLength.\n            const num = bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - fnBits; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = ecdsaOpts.bits2int_modN ||\n        function bits2int_modN_def(bytes) {\n            return Fn.create(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // Pads output with zero as per spec\n    const ORDER_MASK = bitMask(fnBits);\n    /** Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`. */\n    function int2octets(num) {\n        // IMPORTANT: the check ensures working for case `Fn.BYTES != Fn.BITS * 8`\n        aInRange('num < 2^' + fnBits, num, _0n, ORDER_MASK);\n        return Fn.toBytes(num);\n    }\n    function validateMsgAndHash(message, prehash) {\n        abytes(message, undefined, 'message');\n        return prehash ? abytes(hash(message), undefined, 'prehashed message') : message;\n    }\n    /**\n     * Steps A, D of RFC6979 3.2.\n     * Creates RFC6979 seed; converts msg/privKey to numbers.\n     * Used only in sign, not in verify.\n     *\n     * Warning: we cannot assume here that message has same amount of bytes as curve order,\n     * this will be invalid at least for P521. Also it can be bigger for P224 + SHA256.\n     */\n    function prepSig(message, secretKey, opts) {\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))\n            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⋅G\n        // r = q.x mod n\n        // s = k^-1(m + rd) mod n\n        // Can use scalar blinding b^-1(bm + bdr) where b ∈ [1,q−1] according to\n        // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n        // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            // Important: all mod() calls here must be done over N\n            const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n            if (!Fn.isValidNot0(k))\n                return; // Valid scalars (including k) must be in 1..N-1\n            const ik = Fn.inv(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = k⋅G\n            const r = Fn.create(q.x); // r = q.x mod n\n            if (r === _0n)\n                return;\n            const s = Fn.create(ik * Fn.create(m + r * d)); // s = k^-1(m + rd) mod n\n            if (s === _0n)\n                return;\n            let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3 when q.x>n)\n            let normS = s;\n            if (lowS && isBiggerThanHalfOrder(s)) {\n                normS = Fn.neg(s); // if lowS was passed, ensure s is always 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     * Signs message hash with a secret key.\n     *\n     * ```\n     * sign(m, d) where\n     *   k = rfc6979_hmac_drbg(m, d)\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr) / k mod n\n     * ```\n     */\n    function sign(message, secretKey, opts = {}) {\n        const { seed, k2sig } = prepSig(message, secretKey, opts); // Steps A, D of RFC6979 3.2.\n        const drbg = createHmacDrbg(hash.outputLen, Fn.BYTES, hmac);\n        const sig = drbg(seed, k2sig); // Steps B, C, D, E, F, G\n        return sig.toBytes(opts.format);\n    }\n    /**\n     * Verifies a signature against message and public key.\n     * Rejects lowS signatures by default: see {@link ECDSAVerifyOpts}.\n     * Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n     *\n     * ```\n     * verify(r, s, h, P) where\n     *   u1 = hs^-1 mod n\n     *   u2 = rs^-1 mod n\n     *   R = u1⋅G + u2⋅P\n     *   mod(R.x, n) == r\n     * ```\n     */\n    function verify(signature, message, publicKey, opts = {}) {\n        const { lowS, prehash, format } = validateSigOpts(opts, defaultSigOpts);\n        publicKey = abytes(publicKey, undefined, 'publicKey');\n        message = validateMsgAndHash(message, prehash);\n        if (!isBytes(signature)) {\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())\n                return false;\n            const { r, s } = sig;\n            const h = bits2int_modN(message); // mod n, not mod p\n            const is = Fn.inv(s); // s^-1 mod n\n            const u1 = Fn.create(h * is); // u1 = hs^-1 mod n\n            const u2 = Fn.create(r * is); // u2 = rs^-1 mod n\n            const R = Point.BASE.multiplyUnsafe(u1).add(P.multiplyUnsafe(u2)); // u1⋅G + u2⋅P\n            if (R.is0())\n                return false;\n            const v = Fn.create(R.x); // v = r.x mod n\n            return v === r;\n        }\n        catch (e) {\n            return false;\n        }\n    }\n    function recoverPublicKey(signature, message, opts = {}) {\n        const { prehash } = validateSigOpts(opts, defaultSigOpts);\n        message = validateMsgAndHash(message, prehash);\n        return Signature.fromBytes(signature, 'recovered').recoverPublicKey(message).toBytes();\n    }\n    return Object.freeze({\n        keygen,\n        getPublicKey,\n        getSharedSecret,\n        utils,\n        lengths,\n        Point,\n        sign,\n        verify,\n        recoverPublicKey,\n        Signature,\n        hash,\n    });\n}\n//# sourceMappingURL=weierstrass.js.map","/**\n * SECG secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).\n *\n * Belongs to Koblitz curves: it has efficiently-computable GLV endomorphism ψ,\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 } from \"./abstract/curve.js\";\nimport { createHasher, isogenyMap } from \"./abstract/hash-to-curve.js\";\nimport { Field, mapHashToField, pow2 } from \"./abstract/modular.js\";\nimport { ecdsa, mapToCurveSimpleSWU, weierstrass, } from \"./abstract/weierstrass.js\";\nimport { abytes, asciiToBytes, bytesToNumberBE, concatBytes } from \"./utils.js\";\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 = {\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};\nconst secp256k1_ENDO = {\n    beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n    basises: [\n        [BigInt('0x3086d221a7d46bcde86c90e49284eb15'), -BigInt('0xe4437ed6010e88286f547fa90abfe4c3')],\n        [BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8'), BigInt('0x3086d221a7d46bcde86c90e49284eb15')],\n    ],\n};\nconst _0n = /* @__PURE__ */ BigInt(0);\nconst _2n = /* @__PURE__ */ BigInt(2);\n/**\n * √n = 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) {\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))\n        throw new Error('Cannot find square root');\n    return root;\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 * 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 = /* @__PURE__ */ ecdsa(Pointk1, sha256);\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 = {};\nfunction taggedHash(tag, ...messages) {\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// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point) => point.toBytes(true).slice(1);\nconst hasEven = (y) => y % _2n === _0n;\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\n    const { Fn, BASE } = Pointk1;\n    const d_ = Fn.fromBytes(priv);\n    const p = BASE.multiply(d_); // P = d'⋅G; 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) {\n    const Fp = Fpk1;\n    if (!Fp.isValidNot0(x))\n        throw new Error('invalid x: Fail if x ≥ p');\n    const xx = Fp.create(x * x);\n    const c = Fp.create(xx * x + BigInt(7)); // Let c = x³ + 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))\n        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) {\n    return Pointk1.Fn.create(num(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(secretKey) {\n    return schnorrGetExtPubKey(secretKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\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(message, secretKey, auxRand = randomBytes(32)) {\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'⋅G\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))\n        throw new Error('sign: Invalid signature produced');\n    return sig;\n}\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature, message, publicKey) {\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 ≥ p.\n        if (!Fp.isValidNot0(r))\n            return false;\n        const s = num(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n        if (!Fn.isValidNot0(s))\n            return false;\n        const e = challenge(Fn.toBytes(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n        // R = s⋅G - e⋅P, 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) ≠ r.\n        if (R.is0() || !hasEven(y) || x !== r)\n            return false;\n        return true;\n    }\n    catch (error) {\n        return false;\n    }\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 = /* @__PURE__ */ (() => {\n    const size = 32;\n    const seedLength = 48;\n    const randomSecretKey = (seed = randomBytes(seedLength)) => {\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})();\nconst isoMap = /* @__PURE__ */ (() => isogenyMap(Fpk1, [\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)))))();\nconst mapSWU = /* @__PURE__ */ (() => mapToCurveSimpleSWU(Fpk1, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fpk1.create(BigInt('-11')),\n}))();\n/** Hashing / encoding to secp256k1 points / field. RFC 9380 methods. */\nexport const secp256k1_hasher = /* @__PURE__ */ (() => createHasher(Pointk1, (scalars) => {\n    const { x, y } = mapSWU(Fpk1.create(scalars[0]));\n    return isoMap(x, y);\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//# sourceMappingURL=secp256k1.js.map","/**\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.js\";\nimport { clean, createHasher, rotl } from \"./utils.js\";\n/** Initial SHA1 state */\nconst SHA1_IV = /* @__PURE__ */ Uint32Array.from([\n    0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0,\n]);\n// Reusable temporary buffer\nconst SHA1_W = /* @__PURE__ */ new Uint32Array(80);\n/** Internal SHA1 legacy hash class. */\nexport class _SHA1 extends HashMD {\n    A = SHA1_IV[0] | 0;\n    B = SHA1_IV[1] | 0;\n    C = SHA1_IV[2] | 0;\n    D = SHA1_IV[3] | 0;\n    E = SHA1_IV[4] | 0;\n    constructor() {\n        super(64, 20, 8, false);\n    }\n    get() {\n        const { A, B, C, D, E } = this;\n        return [A, B, C, D, E];\n    }\n    set(A, B, C, D, E) {\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    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            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            }\n            else if (i < 40) {\n                F = B ^ C ^ D;\n                K = 0x6ed9eba1;\n            }\n            else if (i < 60) {\n                F = Maj(B, C, D);\n                K = 0x8f1bbcdc;\n            }\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    roundClean() {\n        clean(SHA1_W);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0);\n        clean(this.buffer);\n    }\n}\n/** SHA1 (RFC 3174) legacy hash function. It was cryptographically broken. */\nexport const sha1 = /* @__PURE__ */ createHasher(() => new _SHA1());\n/** Per-round constants */\nconst p32 = /* @__PURE__ */ Math.pow(2, 32);\nconst K = /* @__PURE__ */ Array.from({ length: 64 }, (_, i) => Math.floor(p32 * Math.abs(Math.sin(i + 1))));\n/** md5 initial state: same as sha1, but 4 u32 instead of 5. */\nconst MD5_IV = /* @__PURE__ */ SHA1_IV.slice(0, 4);\n// Reusable temporary buffer\nconst MD5_W = /* @__PURE__ */ new Uint32Array(16);\n/** Internal MD5 legacy hash class. */\nexport class _MD5 extends HashMD {\n    A = MD5_IV[0] | 0;\n    B = MD5_IV[1] | 0;\n    C = MD5_IV[2] | 0;\n    D = MD5_IV[3] | 0;\n    constructor() {\n        super(64, 16, 8, true);\n    }\n    get() {\n        const { A, B, C, D } = this;\n        return [A, B, C, D];\n    }\n    set(A, B, C, D) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            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            }\n            else if (i < 32) {\n                F = Chi(D, B, C);\n                g = (5 * i + 1) % 16;\n                s = [5, 9, 14, 20];\n            }\n            else if (i < 48) {\n                F = B ^ C ^ D;\n                g = (3 * i + 5) % 16;\n                s = [4, 11, 16, 23];\n            }\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    roundClean() {\n        clean(MD5_W);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0);\n        clean(this.buffer);\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 = /* @__PURE__ */ createHasher(() => new _MD5());\n// RIPEMD-160\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++)\n        for (let j of res)\n            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;\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, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    if (group === 1)\n        return (x & y) | (~x & z);\n    if (group === 2)\n        return (x | ~y) ^ z;\n    if (group === 3)\n        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 {\n    h0 = 0x67452301 | 0;\n    h1 = 0xefcdab89 | 0;\n    h2 = 0x98badcfe | 0;\n    h3 = 0x10325476 | 0;\n    h4 = 0xc3d2e1f0 | 0;\n    constructor() {\n        super(64, 20, 8, true);\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\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    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            BUF_160[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\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((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        clean(BUF_160);\n    }\n    destroy() {\n        this.destroyed = true;\n        clean(this.buffer);\n        this.set(0, 0, 0, 0, 0);\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 = /* @__PURE__ */ createHasher(() => new _RIPEMD160());\n//# sourceMappingURL=legacy.js.map","import { hex as baseHex, utf8 } from '@scure/base';\n/**\n * Define complex binary structures using composable primitives.\n * Main ideas:\n * - Encode / decode can be chained, same as in `scure-base`\n * - A complex structure can be created from an array and struct of primitive types\n * - Strings / bytes are arrays with specific optimizations: we can just read bytes directly\n *   without creating plain array first and reading each byte separately.\n * - Types are inferred from definition\n * @module\n * @example\n * import * as P from 'micro-packed';\n * const s = P.struct({\n *   field1: P.U32BE, // 32-bit unsigned big-endian integer\n *   field2: P.string(P.U8), // String with U8 length prefix\n *   field3: P.bytes(32), // 32 bytes\n *   field4: P.array(P.U16BE, P.struct({ // Array of structs with U16BE length\n *     subField1: P.U64BE, // 64-bit unsigned big-endian integer\n *     subField2: P.string(10) // 10-byte string\n *   }))\n * });\n */\n// TODO: remove dependency on scure-base & inline?\n/*\nExports can be groupped like this:\n\n- Primitive types: P.bytes, P.string, P.hex, P.constant, P.pointer\n- Complex types: P.array, P.struct, P.tuple, P.map, P.tag, P.mappedTag\n- Padding, prefix, magic: P.padLeft, P.padRight, P.prefix, P.magic, P.magicBytes\n- Flags: P.flag, P.flagged, P.optional\n- Wrappers: P.apply, P.wrap, P.lazy\n- Bit fiddling: P.bits, P.bitset\n- utils: P.validate, coders.decimal\n- Debugger\n*/\n/** Shortcut to zero-length (empty) byte array */\nexport const EMPTY = /* @__PURE__ */ Uint8Array.of();\n/** Shortcut to one-element (element is 0) byte array */\nexport const NULL = /* @__PURE__ */ Uint8Array.of(0);\n/** Checks if two Uint8Arrays are equal. Not constant-time. */\nfunction equalBytes(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    return true;\n}\n/** Checks if the given value is a Uint8Array. */\nfunction isBytes(a) {\n    return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/**\n * Concatenates multiple Uint8Arrays.\n * Engines limit functions to 65K+ arguments.\n * @param arrays Array of Uint8Array elements\n * @returns Concatenated Uint8Array\n */\nfunction concatBytes(...arrays) {\n    let sum = 0;\n    for (let i = 0; i < arrays.length; i++) {\n        const a = arrays[i];\n        if (!isBytes(a))\n            throw new Error('Uint8Array expected');\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/**\n * Creates DataView from Uint8Array\n * @param arr - bytes\n * @returns DataView\n */\nconst createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n/**\n * Checks if the provided value is a plain object, not created from any class or special constructor.\n * Array, Uint8Array and others are not plain objects.\n * @param obj - The value to be checked.\n */\nfunction isPlainObject(obj) {\n    return Object.prototype.toString.call(obj) === '[object Object]';\n}\nfunction isNum(num) {\n    return Number.isSafeInteger(num);\n}\nexport const utils = {\n    equalBytes,\n    isBytes,\n    isCoder,\n    checkBounds,\n    concatBytes,\n    createView,\n    isPlainObject,\n};\n// NOTE: we can't have terminator separate function, since it won't know about boundaries\n// E.g. array of U16LE ([1,2,3]) would be [1, 0, 2, 0, 3, 0]\n// But terminator will find array at index '1', which happens to be inside of an element itself\n/**\n * Can be:\n * - Dynamic (CoderType)\n * - Fixed (number)\n * - Terminated (usually zero): Uint8Array with terminator\n * - Field path to field with length (string)\n * - Infinity (null) - decodes until end of buffer\n * Used in:\n * - bytes (string, prefix is implementation of bytes)\n * - array\n */\nconst lengthCoder = (len) => {\n    if (len !== null && typeof len !== 'string' && !isCoder(len) && !isBytes(len) && !isNum(len)) {\n        throw new Error(`lengthCoder: expected null | number | Uint8Array | CoderType, got ${len} (${typeof len})`);\n    }\n    return {\n        encodeStream(w, value) {\n            if (len === null)\n                return;\n            if (isCoder(len))\n                return len.encodeStream(w, value);\n            let byteLen;\n            if (typeof len === 'number')\n                byteLen = len;\n            else if (typeof len === 'string')\n                byteLen = Path.resolve(w.stack, len);\n            if (typeof byteLen === 'bigint')\n                byteLen = Number(byteLen);\n            if (byteLen === undefined || byteLen !== value)\n                throw w.err(`Wrong length: ${byteLen} len=${len} exp=${value} (${typeof value})`);\n        },\n        decodeStream(r) {\n            let byteLen;\n            if (isCoder(len))\n                byteLen = Number(len.decodeStream(r));\n            else if (typeof len === 'number')\n                byteLen = len;\n            else if (typeof len === 'string')\n                byteLen = Path.resolve(r.stack, len);\n            if (typeof byteLen === 'bigint')\n                byteLen = Number(byteLen);\n            if (typeof byteLen !== 'number')\n                throw r.err(`Wrong length: ${byteLen}`);\n            return byteLen;\n        },\n    };\n};\n/**\n * Small bitset structure to store position of ranges that have been read.\n * Can be more efficient when internal trees are utilized at the cost of complexity.\n * Needs `O(N/8)` memory for parsing.\n * Purpose: if there are pointers in parsed structure,\n * they can cause read of two distinct ranges:\n * [0-32, 64-128], which means 'pos' is not enough to handle them\n */\nconst Bitset = {\n    BITS: 32,\n    FULL_MASK: -1 >>> 0, // 1<<32 will overflow\n    len: (len) => Math.ceil(len / 32),\n    create: (len) => new Uint32Array(Bitset.len(len)),\n    clean: (bs) => bs.fill(0),\n    debug: (bs) => Array.from(bs).map((i) => (i >>> 0).toString(2).padStart(32, '0')),\n    checkLen: (bs, len) => {\n        if (Bitset.len(len) === bs.length)\n            return;\n        throw new Error(`wrong length=${bs.length}. Expected: ${Bitset.len(len)}`);\n    },\n    chunkLen: (bsLen, pos, len) => {\n        if (pos < 0)\n            throw new Error(`wrong pos=${pos}`);\n        if (pos + len > bsLen)\n            throw new Error(`wrong range=${pos}/${len} of ${bsLen}`);\n    },\n    set: (bs, chunk, value, allowRewrite = true) => {\n        if (!allowRewrite && (bs[chunk] & value) !== 0)\n            return false;\n        bs[chunk] |= value;\n        return true;\n    },\n    pos: (pos, i) => ({\n        chunk: Math.floor((pos + i) / 32),\n        mask: 1 << (32 - ((pos + i) % 32) - 1),\n    }),\n    indices: (bs, len, invert = false) => {\n        Bitset.checkLen(bs, len);\n        const { FULL_MASK, BITS } = Bitset;\n        const left = BITS - (len % BITS);\n        const lastMask = left ? (FULL_MASK >>> left) << left : FULL_MASK;\n        const res = [];\n        for (let i = 0; i < bs.length; i++) {\n            let c = bs[i];\n            if (invert)\n                c = ~c; // allows to gen unset elements\n            // apply mask to last element, so we won't iterate non-existent items\n            if (i === bs.length - 1)\n                c &= lastMask;\n            if (c === 0)\n                continue; // fast-path\n            for (let j = 0; j < BITS; j++) {\n                const m = 1 << (BITS - j - 1);\n                if (c & m)\n                    res.push(i * BITS + j);\n            }\n        }\n        return res;\n    },\n    range: (arr) => {\n        const res = [];\n        let cur;\n        for (const i of arr) {\n            if (cur === undefined || i !== cur.pos + cur.length)\n                res.push((cur = { pos: i, length: 1 }));\n            else\n                cur.length += 1;\n        }\n        return res;\n    },\n    rangeDebug: (bs, len, invert = false) => `[${Bitset.range(Bitset.indices(bs, len, invert))\n        .map((i) => `(${i.pos}/${i.length})`)\n        .join(', ')}]`,\n    setRange: (bs, bsLen, pos, len, allowRewrite = true) => {\n        Bitset.chunkLen(bsLen, pos, len);\n        const { FULL_MASK, BITS } = Bitset;\n        // Try to set range with maximum efficiency:\n        // - first chunk is always    '0000[1111]' (only right ones)\n        // - middle chunks are set to '[1111 1111]' (all ones)\n        // - last chunk is always     '[1111]0000' (only left ones)\n        // - max operations:          (N/32) + 2 (first and last)\n        const first = pos % BITS ? Math.floor(pos / BITS) : undefined;\n        const lastPos = pos + len;\n        const last = lastPos % BITS ? Math.floor(lastPos / BITS) : undefined;\n        // special case, whole range inside single chunk\n        if (first !== undefined && first === last)\n            return Bitset.set(bs, first, (FULL_MASK >>> (BITS - len)) << (BITS - len - pos), allowRewrite);\n        if (first !== undefined) {\n            if (!Bitset.set(bs, first, FULL_MASK >>> pos % BITS, allowRewrite))\n                return false; // first chunk\n        }\n        // middle chunks\n        const start = first !== undefined ? first + 1 : pos / BITS;\n        const end = last !== undefined ? last : lastPos / BITS;\n        for (let i = start; i < end; i++)\n            if (!Bitset.set(bs, i, FULL_MASK, allowRewrite))\n                return false;\n        if (last !== undefined && first !== last)\n            if (!Bitset.set(bs, last, FULL_MASK << (BITS - (lastPos % BITS)), allowRewrite))\n                return false; // last chunk\n        return true;\n    },\n};\nconst Path = {\n    /**\n     * Internal method for handling stack of paths (debug, errors, dynamic fields via path)\n     * This is looks ugly (callback), but allows us to force stack cleaning by construction (.pop always after function).\n     * Also, this makes impossible:\n     * - pushing field when stack is empty\n     * - pushing field inside of field (real bug)\n     * NOTE: we don't want to do '.pop' on error!\n     */\n    pushObj: (stack, obj, objFn) => {\n        const last = { obj };\n        stack.push(last);\n        objFn((field, fieldFn) => {\n            last.field = field;\n            fieldFn();\n            last.field = undefined;\n        });\n        stack.pop();\n    },\n    path: (stack) => {\n        const res = [];\n        for (const i of stack)\n            if (i.field !== undefined)\n                res.push(i.field);\n        return res.join('/');\n    },\n    err: (name, stack, msg) => {\n        const err = new Error(`${name}(${Path.path(stack)}): ${typeof msg === 'string' ? msg : msg.message}`);\n        if (msg instanceof Error && msg.stack)\n            err.stack = msg.stack;\n        return err;\n    },\n    resolve: (stack, path) => {\n        const parts = path.split('/');\n        const objPath = stack.map((i) => i.obj);\n        let i = 0;\n        for (; i < parts.length; i++) {\n            if (parts[i] === '..')\n                objPath.pop();\n            else\n                break;\n        }\n        let cur = objPath.pop();\n        for (; i < parts.length; i++) {\n            if (!cur || cur[parts[i]] === undefined)\n                return undefined;\n            cur = cur[parts[i]];\n        }\n        return cur;\n    },\n};\n/**\n * Internal structure. Reader class for reading from a byte array.\n * `stack` is internal: for debugger and logging\n * @class Reader\n */\nclass _Reader {\n    pos = 0;\n    data;\n    opts;\n    stack;\n    parent;\n    parentOffset;\n    bitBuf = 0;\n    bitPos = 0;\n    bs; // bitset\n    view;\n    constructor(data, opts = {}, stack = [], parent = undefined, parentOffset = 0) {\n        this.data = data;\n        this.opts = opts;\n        this.stack = stack;\n        this.parent = parent;\n        this.parentOffset = parentOffset;\n        this.view = createView(data);\n    }\n    /** Internal method for pointers. */\n    _enablePointers() {\n        if (this.parent)\n            return this.parent._enablePointers();\n        if (this.bs)\n            return;\n        this.bs = Bitset.create(this.data.length);\n        Bitset.setRange(this.bs, this.data.length, 0, this.pos, this.opts.allowMultipleReads);\n    }\n    markBytesBS(pos, len) {\n        if (this.parent)\n            return this.parent.markBytesBS(this.parentOffset + pos, len);\n        if (!len)\n            return true;\n        if (!this.bs)\n            return true;\n        return Bitset.setRange(this.bs, this.data.length, pos, len, false);\n    }\n    markBytes(len) {\n        const pos = this.pos;\n        this.pos += len;\n        const res = this.markBytesBS(pos, len);\n        if (!this.opts.allowMultipleReads && !res)\n            throw this.err(`multiple read pos=${this.pos} len=${len}`);\n        return res;\n    }\n    pushObj(obj, objFn) {\n        return Path.pushObj(this.stack, obj, objFn);\n    }\n    readView(n, fn) {\n        if (!Number.isFinite(n))\n            throw this.err(`readView: wrong length=${n}`);\n        if (this.pos + n > this.data.length)\n            throw this.err('readView: Unexpected end of buffer');\n        const res = fn(this.view, this.pos);\n        this.markBytes(n);\n        return res;\n    }\n    // read bytes by absolute offset\n    absBytes(n) {\n        if (n > this.data.length)\n            throw new Error('Unexpected end of buffer');\n        return this.data.subarray(n);\n    }\n    finish() {\n        if (this.opts.allowUnreadBytes)\n            return;\n        if (this.bitPos) {\n            throw this.err(`${this.bitPos} bits left after unpack: ${baseHex.encode(this.data.slice(this.pos))}`);\n        }\n        if (this.bs && !this.parent) {\n            const notRead = Bitset.indices(this.bs, this.data.length, true);\n            if (notRead.length) {\n                const formatted = Bitset.range(notRead)\n                    .map(({ pos, length }) => `(${pos}/${length})[${baseHex.encode(this.data.subarray(pos, pos + length))}]`)\n                    .join(', ');\n                throw this.err(`unread byte ranges: ${formatted} (total=${this.data.length})`);\n            }\n            else\n                return; // all bytes read, everything is ok\n        }\n        // Default: no pointers enabled\n        if (!this.isEnd()) {\n            throw this.err(`${this.leftBytes} bytes ${this.bitPos} bits left after unpack: ${baseHex.encode(this.data.slice(this.pos))}`);\n        }\n    }\n    // User methods\n    err(msg) {\n        return Path.err('Reader', this.stack, msg);\n    }\n    offsetReader(n) {\n        if (n > this.data.length)\n            throw this.err('offsetReader: Unexpected end of buffer');\n        return new _Reader(this.absBytes(n), this.opts, this.stack, this, n);\n    }\n    bytes(n, peek = false) {\n        if (this.bitPos)\n            throw this.err('readBytes: bitPos not empty');\n        if (!Number.isFinite(n))\n            throw this.err(`readBytes: wrong length=${n}`);\n        if (this.pos + n > this.data.length)\n            throw this.err('readBytes: Unexpected end of buffer');\n        const slice = this.data.subarray(this.pos, this.pos + n);\n        if (!peek)\n            this.markBytes(n);\n        return slice;\n    }\n    byte(peek = false) {\n        if (this.bitPos)\n            throw this.err('readByte: bitPos not empty');\n        if (this.pos + 1 > this.data.length)\n            throw this.err('readBytes: Unexpected end of buffer');\n        const data = this.data[this.pos];\n        if (!peek)\n            this.markBytes(1);\n        return data;\n    }\n    get leftBytes() {\n        return this.data.length - this.pos;\n    }\n    get totalBytes() {\n        return this.data.length;\n    }\n    isEnd() {\n        return this.pos >= this.data.length && !this.bitPos;\n    }\n    // bits are read in BE mode (left to right): (0b1000_0000).readBits(1) == 1\n    bits(bits) {\n        if (bits > 32)\n            throw this.err('BitReader: cannot read more than 32 bits in single call');\n        let out = 0;\n        while (bits) {\n            if (!this.bitPos) {\n                this.bitBuf = this.byte();\n                this.bitPos = 8;\n            }\n            const take = Math.min(bits, this.bitPos);\n            this.bitPos -= take;\n            out = (out << take) | ((this.bitBuf >> this.bitPos) & (2 ** take - 1));\n            this.bitBuf &= 2 ** this.bitPos - 1;\n            bits -= take;\n        }\n        // Fix signed integers\n        return out >>> 0;\n    }\n    find(needle, pos = this.pos) {\n        if (!isBytes(needle))\n            throw this.err(`find: needle is not bytes! ${needle}`);\n        if (this.bitPos)\n            throw this.err('findByte: bitPos not empty');\n        if (!needle.length)\n            throw this.err(`find: needle is empty`);\n        // indexOf should be faster than full equalBytes check\n        for (let idx = pos; (idx = this.data.indexOf(needle[0], idx)) !== -1; idx++) {\n            if (idx === -1)\n                return;\n            const leftBytes = this.data.length - idx;\n            if (leftBytes < needle.length)\n                return;\n            if (equalBytes(needle, this.data.subarray(idx, idx + needle.length)))\n                return idx;\n        }\n        return;\n    }\n}\n/**\n * Internal structure. Writer class for writing to a byte array.\n * The `stack` argument of constructor is internal, for debugging and logs.\n * @class Writer\n */\nclass _Writer {\n    pos = 0;\n    stack;\n    // We could have a single buffer here and re-alloc it with\n    // x1.5-2 size each time it full, but it will be slower:\n    // basic/encode bench: 395ns -> 560ns\n    buffers = [];\n    ptrs = [];\n    bitBuf = 0;\n    bitPos = 0;\n    viewBuf = new Uint8Array(8);\n    view;\n    finished = false;\n    constructor(stack = []) {\n        this.stack = stack;\n        this.view = createView(this.viewBuf);\n    }\n    pushObj(obj, objFn) {\n        return Path.pushObj(this.stack, obj, objFn);\n    }\n    writeView(len, fn) {\n        if (this.finished)\n            throw this.err('buffer: finished');\n        if (!isNum(len) || len > 8)\n            throw new Error(`wrong writeView length=${len}`);\n        fn(this.view);\n        this.bytes(this.viewBuf.slice(0, len));\n        this.viewBuf.fill(0);\n    }\n    // User methods\n    err(msg) {\n        if (this.finished)\n            throw this.err('buffer: finished');\n        return Path.err('Reader', this.stack, msg);\n    }\n    bytes(b) {\n        if (this.finished)\n            throw this.err('buffer: finished');\n        if (this.bitPos)\n            throw this.err('writeBytes: ends with non-empty bit buffer');\n        this.buffers.push(b);\n        this.pos += b.length;\n    }\n    byte(b) {\n        if (this.finished)\n            throw this.err('buffer: finished');\n        if (this.bitPos)\n            throw this.err('writeByte: ends with non-empty bit buffer');\n        this.buffers.push(new Uint8Array([b]));\n        this.pos++;\n    }\n    finish(clean = true) {\n        if (this.finished)\n            throw this.err('buffer: finished');\n        if (this.bitPos)\n            throw this.err('buffer: ends with non-empty bit buffer');\n        // Can't use concatBytes, because it limits amount of arguments (65K).\n        const buffers = this.buffers.concat(this.ptrs.map((i) => i.buffer));\n        const sum = buffers.map((b) => b.length).reduce((a, b) => a + b, 0);\n        const buf = new Uint8Array(sum);\n        for (let i = 0, pad = 0; i < buffers.length; i++) {\n            const a = buffers[i];\n            buf.set(a, pad);\n            pad += a.length;\n        }\n        for (let pos = this.pos, i = 0; i < this.ptrs.length; i++) {\n            const ptr = this.ptrs[i];\n            buf.set(ptr.ptr.encode(pos), ptr.pos);\n            pos += ptr.buffer.length;\n        }\n        // Cleanup\n        if (clean) {\n            // We cannot cleanup buffers here, since it can be static user provided buffer.\n            // Only '.byte' and '.bits' create buffer which we can safely clean.\n            // for (const b of this.buffers) b.fill(0);\n            this.buffers = [];\n            for (const p of this.ptrs)\n                p.buffer.fill(0);\n            this.ptrs = [];\n            this.finished = true;\n            this.bitBuf = 0;\n        }\n        return buf;\n    }\n    bits(value, bits) {\n        if (bits > 32)\n            throw this.err('writeBits: cannot write more than 32 bits in single call');\n        if (value >= 2 ** bits)\n            throw this.err(`writeBits: value (${value}) >= 2**bits (${bits})`);\n        while (bits) {\n            const take = Math.min(bits, 8 - this.bitPos);\n            this.bitBuf = (this.bitBuf << take) | (value >> (bits - take));\n            this.bitPos += take;\n            bits -= take;\n            value &= 2 ** bits - 1;\n            if (this.bitPos === 8) {\n                this.bitPos = 0;\n                this.buffers.push(new Uint8Array([this.bitBuf]));\n                this.pos++;\n            }\n        }\n    }\n}\n// Immutable LE<->BE\nconst swapEndianness = (b) => Uint8Array.from(b).reverse();\n/** Internal function for checking bit bounds of bigint in signed/unsinged form */\nfunction checkBounds(value, bits, signed) {\n    if (signed) {\n        // [-(2**(32-1)), 2**(32-1)-1]\n        const signBit = 2n ** (bits - 1n);\n        if (value < -signBit || value >= signBit)\n            throw new Error(`value out of signed bounds. Expected ${-signBit} <= ${value} < ${signBit}`);\n    }\n    else {\n        // [0, 2**32-1]\n        if (0n > value || value >= 2n ** bits)\n            throw new Error(`value out of unsigned bounds. Expected 0 <= ${value} < ${2n ** bits}`);\n    }\n}\nfunction _wrap(inner) {\n    return {\n        // NOTE: we cannot export validate here, since it is likely mistake.\n        encodeStream: inner.encodeStream,\n        decodeStream: inner.decodeStream,\n        size: inner.size,\n        encode: (value) => {\n            const w = new _Writer();\n            inner.encodeStream(w, value);\n            return w.finish();\n        },\n        decode: (data, opts = {}) => {\n            const r = new _Reader(data, opts);\n            const res = inner.decodeStream(r);\n            r.finish();\n            return res;\n        },\n    };\n}\n/**\n * Validates a value before encoding and after decoding using a provided function.\n * @param inner - The inner CoderType.\n * @param fn - The validation function.\n * @returns CoderType which check value with validation function.\n * @example\n * const val = (n: number) => {\n *   if (n > 10) throw new Error(`${n} > 10`);\n *   return n;\n * };\n *\n * const RangedInt = P.validate(P.U32LE, val); // Will check if value is <= 10 during encoding and decoding\n */\nexport function validate(inner, fn) {\n    if (!isCoder(inner))\n        throw new Error(`validate: invalid inner value ${inner}`);\n    if (typeof fn !== 'function')\n        throw new Error('validate: fn should be function');\n    return _wrap({\n        size: inner.size,\n        encodeStream: (w, value) => {\n            let res;\n            try {\n                res = fn(value);\n            }\n            catch (e) {\n                throw w.err(e);\n            }\n            inner.encodeStream(w, res);\n        },\n        decodeStream: (r) => {\n            const res = inner.decodeStream(r);\n            try {\n                return fn(res);\n            }\n            catch (e) {\n                throw r.err(e);\n            }\n        },\n    });\n}\n/**\n * Wraps a stream encoder into a generic encoder and optionally validation function\n * @param {inner} inner BytesCoderStream & { validate?: Validate<T> }.\n * @returns The wrapped CoderType.\n * @example\n * const U8 = P.wrap({\n *   encodeStream: (w: Writer, value: number) => w.byte(value),\n *   decodeStream: (r: Reader): number => r.byte()\n * });\n * const checkedU8 = P.wrap({\n *   encodeStream: (w: Writer, value: number) => w.byte(value),\n *   decodeStream: (r: Reader): number => r.byte()\n *   validate: (n: number) => {\n *    if (n > 10) throw new Error(`${n} > 10`);\n *    return n;\n *   }\n * });\n */\nexport const wrap = (inner) => {\n    const res = _wrap(inner);\n    return inner.validate ? validate(res, inner.validate) : res;\n};\nconst isBaseCoder = (elm) => isPlainObject(elm) && typeof elm.decode === 'function' && typeof elm.encode === 'function';\n/**\n * Checks if the given value is a CoderType.\n * @param elm - The value to check.\n * @returns True if the value is a CoderType, false otherwise.\n */\nexport function isCoder(elm) {\n    return (isPlainObject(elm) &&\n        isBaseCoder(elm) &&\n        typeof elm.encodeStream === 'function' &&\n        typeof elm.decodeStream === 'function' &&\n        (elm.size === undefined || isNum(elm.size)));\n}\n// Coders (like in @scure/base) for common operations\n/**\n * Base coder for working with dictionaries (records, objects, key-value map)\n * Dictionary is dynamic type like: `[key: string, value: any][]`\n * @returns base coder that encodes/decodes between arrays of key-value tuples and dictionaries.\n * @example\n * const dict: P.CoderType<Record<string, number>> = P.apply(\n *  P.array(P.U16BE, P.tuple([P.cstring, P.U32LE] as const)),\n *  P.coders.dict()\n * );\n */\nfunction dict() {\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from))\n                throw new Error('array expected');\n            const to = {};\n            for (const item of from) {\n                if (!Array.isArray(item) || item.length !== 2)\n                    throw new Error(`array of two elements expected`);\n                const name = item[0];\n                const value = item[1];\n                if (to[name] !== undefined)\n                    throw new Error(`key(${name}) appears twice in struct`);\n                to[name] = value;\n            }\n            return to;\n        },\n        decode: (to) => {\n            if (!isPlainObject(to))\n                throw new Error(`expected plain object, got ${to}`);\n            return Object.entries(to);\n        },\n    };\n}\n/**\n * Safely converts bigint to number.\n * Sometimes pointers / tags use u64 or other big numbers which cannot be represented by number,\n * but we still can use them since real value will be smaller than u32\n */\nconst numberBigint = {\n    encode: (from) => {\n        if (typeof from !== 'bigint')\n            throw new Error(`expected bigint, got ${typeof from}`);\n        if (from > BigInt(Number.MAX_SAFE_INTEGER))\n            throw new Error(`element bigger than MAX_SAFE_INTEGER=${from}`);\n        return Number(from);\n    },\n    decode: (to) => {\n        if (!isNum(to))\n            throw new Error('element is not a safe integer');\n        return BigInt(to);\n    },\n};\n/**\n * Base coder for working with TypeScript enums.\n * @param e - TypeScript enum.\n * @returns base coder that encodes/decodes between numbers and enum keys.\n * @example\n * enum Color { Red, Green, Blue }\n * const colorCoder = P.coders.tsEnum(Color);\n * colorCoder.encode(Color.Red); // 'Red'\n * colorCoder.decode('Green'); // 1\n */\nfunction tsEnum(e) {\n    if (!isPlainObject(e))\n        throw new Error('plain object expected');\n    return {\n        encode: (from) => {\n            if (!isNum(from) || !(from in e))\n                throw new Error(`wrong value ${from}`);\n            return e[from];\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error(`wrong value ${typeof to}`);\n            return e[to];\n        },\n    };\n}\n/**\n * Base coder for working with decimal numbers.\n * @param precision - Number of decimal places.\n * @param round - Round fraction part if bigger than precision (throws error by default)\n * @returns base coder that encodes/decodes between bigints and decimal strings.\n * @example\n * const decimal8 = P.coders.decimal(8);\n * decimal8.encode(630880845n); // '6.30880845'\n * decimal8.decode('6.30880845'); // 630880845n\n */\nfunction decimal(precision, round = false) {\n    if (!isNum(precision))\n        throw new Error(`decimal/precision: wrong value ${precision}`);\n    if (typeof round !== 'boolean')\n        throw new Error(`decimal/round: expected boolean, got ${typeof round}`);\n    const decimalMask = 10n ** BigInt(precision);\n    return {\n        encode: (from) => {\n            if (typeof from !== 'bigint')\n                throw new Error(`expected bigint, got ${typeof from}`);\n            let s = (from < 0n ? -from : from).toString(10);\n            let sep = s.length - precision;\n            if (sep < 0) {\n                s = s.padStart(s.length - sep, '0');\n                sep = 0;\n            }\n            let i = s.length - 1;\n            for (; i >= sep && s[i] === '0'; i--)\n                ;\n            let int = s.slice(0, sep);\n            let frac = s.slice(sep, i + 1);\n            if (!int)\n                int = '0';\n            if (from < 0n)\n                int = '-' + int;\n            if (!frac)\n                return int;\n            return `${int}.${frac}`;\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error(`expected string, got ${typeof to}`);\n            if (to === '-0')\n                throw new Error(`negative zero is not allowed`);\n            let neg = false;\n            if (to.startsWith('-')) {\n                neg = true;\n                to = to.slice(1);\n            }\n            if (!/^(0|[1-9]\\d*)(\\.\\d+)?$/.test(to))\n                throw new Error(`wrong string value=${to}`);\n            let sep = to.indexOf('.');\n            sep = sep === -1 ? to.length : sep;\n            // split by separator and strip trailing zeros from fraction. always returns [string, string] (.split doesn't).\n            const intS = to.slice(0, sep);\n            const fracS = to.slice(sep + 1).replace(/0+$/, '');\n            const int = BigInt(intS) * decimalMask;\n            if (!round && fracS.length > precision) {\n                throw new Error(`fractional part cannot be represented with this precision (num=${to}, prec=${precision})`);\n            }\n            const fracLen = Math.min(fracS.length, precision);\n            const frac = BigInt(fracS.slice(0, fracLen)) * 10n ** BigInt(precision - fracLen);\n            const value = int + frac;\n            return neg ? -value : value;\n        },\n    };\n}\n/**\n * Combines multiple coders into a single coder, allowing conditional encoding/decoding based on input.\n * Acts as a parser combinator, splitting complex conditional coders into smaller parts.\n *\n *   `encode = [Ae, Be]; decode = [Ad, Bd]`\n *   ->\n *   `match([{encode: Ae, decode: Ad}, {encode: Be; decode: Bd}])`\n *\n * @param lst - Array of coders to match.\n * @returns Combined coder for conditional encoding/decoding.\n */\nfunction match(lst) {\n    if (!Array.isArray(lst))\n        throw new Error(`expected array, got ${typeof lst}`);\n    for (const i of lst)\n        if (!isBaseCoder(i))\n            throw new Error(`wrong base coder ${i}`);\n    return {\n        encode: (from) => {\n            for (const c of lst) {\n                const elm = c.encode(from);\n                if (elm !== undefined)\n                    return elm;\n            }\n            throw new Error(`match/encode: cannot find match in ${from}`);\n        },\n        decode: (to) => {\n            for (const c of lst) {\n                const elm = c.decode(to);\n                if (elm !== undefined)\n                    return elm;\n            }\n            throw new Error(`match/decode: cannot find match in ${to}`);\n        },\n    };\n}\n/** Reverses direction of coder */\nconst reverse = (coder) => {\n    if (!isBaseCoder(coder))\n        throw new Error('BaseCoder expected');\n    return { encode: coder.decode, decode: coder.encode };\n};\nexport const coders = { dict, numberBigint, tsEnum, decimal, match, reverse };\n/**\n * CoderType for parsing individual bits.\n * NOTE: Structure should parse whole amount of bytes before it can start parsing byte-level elements.\n * @param len - Number of bits to parse.\n * @returns CoderType representing the parsed bits.\n * @example\n * const s = P.struct({ magic: P.bits(1), version: P.bits(1), tag: P.bits(4), len: P.bits(2) });\n */\nexport const bits = (len) => {\n    if (!isNum(len))\n        throw new Error(`bits: wrong length ${len} (${typeof len})`);\n    return wrap({\n        encodeStream: (w, value) => w.bits(value, len),\n        decodeStream: (r) => r.bits(len),\n        validate: (value) => {\n            if (!isNum(value))\n                throw new Error(`bits: wrong value ${value}`);\n            return value;\n        },\n    });\n};\n/**\n * CoderType for working with bigint values.\n * Unsized bigint values should be wrapped in a container (e.g., bytes or string).\n *\n * `0n = Uint8Array.of()`\n *\n * `1n = new Uint8Array([1n])`\n *\n * Please open issue, if you need different behavior for zero.\n *\n * @param size - Size of the bigint in bytes.\n * @param le - Whether to use little-endian byte order.\n * @param signed - Whether the bigint is signed.\n * @param sized - Whether the bigint should have a fixed size.\n * @returns CoderType representing the bigint value.\n * @example\n * const U512BE = P.bigint(64, false, true, true); // Define a CoderType for a 512-bit unsigned big-endian integer\n */\nexport const bigint = (size, le = false, signed = false, sized = true) => {\n    if (!isNum(size))\n        throw new Error(`bigint/size: wrong value ${size}`);\n    if (typeof le !== 'boolean')\n        throw new Error(`bigint/le: expected boolean, got ${typeof le}`);\n    if (typeof signed !== 'boolean')\n        throw new Error(`bigint/signed: expected boolean, got ${typeof signed}`);\n    if (typeof sized !== 'boolean')\n        throw new Error(`bigint/sized: expected boolean, got ${typeof sized}`);\n    const bLen = BigInt(size);\n    const signBit = 2n ** (8n * bLen - 1n);\n    return wrap({\n        size: sized ? size : undefined,\n        encodeStream: (w, value) => {\n            if (signed && value < 0)\n                value = value | signBit;\n            const b = [];\n            for (let i = 0; i < size; i++) {\n                b.push(Number(value & 255n));\n                value >>= 8n;\n            }\n            let res = new Uint8Array(b).reverse();\n            if (!sized) {\n                let pos = 0;\n                for (pos = 0; pos < res.length; pos++)\n                    if (res[pos] !== 0)\n                        break;\n                res = res.subarray(pos); // remove leading zeros\n            }\n            w.bytes(le ? res.reverse() : res);\n        },\n        decodeStream: (r) => {\n            // TODO: for le we can read until first zero?\n            const value = r.bytes(sized ? size : Math.min(size, r.leftBytes));\n            const b = le ? value : swapEndianness(value);\n            let res = 0n;\n            for (let i = 0; i < b.length; i++)\n                res |= BigInt(b[i]) << (8n * BigInt(i));\n            if (signed && res & signBit)\n                res = (res ^ signBit) - signBit;\n            return res;\n        },\n        validate: (value) => {\n            if (typeof value !== 'bigint')\n                throw new Error(`bigint: invalid value: ${value}`);\n            checkBounds(value, 8n * bLen, !!signed);\n            return value;\n        },\n    });\n};\n/** Unsigned 256-bit little-endian integer CoderType. */\nexport const U256LE = /* @__PURE__ */ bigint(32, true);\n/** Unsigned 256-bit big-endian integer CoderType. */\nexport const U256BE = /* @__PURE__ */ bigint(32, false);\n/** Signed 256-bit little-endian integer CoderType. */\nexport const I256LE = /* @__PURE__ */ bigint(32, true, true);\n/** Signed 256-bit big-endian integer CoderType. */\nexport const I256BE = /* @__PURE__ */ bigint(32, false, true);\n/** Unsigned 128-bit little-endian integer CoderType. */\nexport const U128LE = /* @__PURE__ */ bigint(16, true);\n/** Unsigned 128-bit big-endian integer CoderType. */\nexport const U128BE = /* @__PURE__ */ bigint(16, false);\n/** Signed 128-bit little-endian integer CoderType. */\nexport const I128LE = /* @__PURE__ */ bigint(16, true, true);\n/** Signed 128-bit big-endian integer CoderType. */\nexport const I128BE = /* @__PURE__ */ bigint(16, false, true);\n/** Unsigned 64-bit little-endian integer CoderType. */\nexport const U64LE = /* @__PURE__ */ bigint(8, true);\n/** Unsigned 64-bit big-endian integer CoderType. */\nexport const U64BE = /* @__PURE__ */ bigint(8, false);\n/** Signed 64-bit little-endian integer CoderType. */\nexport const I64LE = /* @__PURE__ */ bigint(8, true, true);\n/** Signed 64-bit big-endian integer CoderType. */\nexport const I64BE = /* @__PURE__ */ bigint(8, false, true);\n/**\n * CoderType for working with numbber values (up to 6 bytes/48 bits).\n * Unsized int values should be wrapped in a container (e.g., bytes or string).\n *\n * `0 = Uint8Array.of()`\n *\n * `1 = new Uint8Array([1n])`\n *\n * Please open issue, if you need different behavior for zero.\n *\n * @param size - Size of the number in bytes.\n * @param le - Whether to use little-endian byte order.\n * @param signed - Whether the number is signed.\n * @param sized - Whether the number should have a fixed size.\n * @returns CoderType representing the number value.\n * @example\n * const uint64BE = P.bigint(8, false, true); // Define a CoderType for a 64-bit unsigned big-endian integer\n */\nexport const int = (size, le = false, signed = false, sized = true) => {\n    if (!isNum(size))\n        throw new Error(`int/size: wrong value ${size}`);\n    if (typeof le !== 'boolean')\n        throw new Error(`int/le: expected boolean, got ${typeof le}`);\n    if (typeof signed !== 'boolean')\n        throw new Error(`int/signed: expected boolean, got ${typeof signed}`);\n    if (typeof sized !== 'boolean')\n        throw new Error(`int/sized: expected boolean, got ${typeof sized}`);\n    if (size > 6)\n        throw new Error('int supports size up to 6 bytes (48 bits): use bigints instead');\n    return apply(bigint(size, le, signed, sized), coders.numberBigint);\n};\nconst view = (len, opts) => wrap({\n    size: len,\n    encodeStream: (w, value) => w.writeView(len, (view) => opts.write(view, value)),\n    decodeStream: (r) => r.readView(len, opts.read),\n    validate: (value) => {\n        if (typeof value !== 'number')\n            throw new Error(`viewCoder: expected number, got ${typeof value}`);\n        if (opts.validate)\n            opts.validate(value);\n        return value;\n    },\n});\nconst intView = (len, signed, opts) => {\n    const bits = len * 8;\n    const signBit = 2 ** (bits - 1);\n    // Inlined checkBounds for integer\n    const validateSigned = (value) => {\n        if (!isNum(value))\n            throw new Error(`sintView: value is not safe integer: ${value}`);\n        if (value < -signBit || value >= signBit) {\n            throw new Error(`sintView: value out of bounds. Expected ${-signBit} <= ${value} < ${signBit}`);\n        }\n    };\n    const maxVal = 2 ** bits;\n    const validateUnsigned = (value) => {\n        if (!isNum(value))\n            throw new Error(`uintView: value is not safe integer: ${value}`);\n        if (0 > value || value >= maxVal) {\n            throw new Error(`uintView: value out of bounds. Expected 0 <= ${value} < ${maxVal}`);\n        }\n    };\n    return view(len, {\n        write: opts.write,\n        read: opts.read,\n        validate: signed ? validateSigned : validateUnsigned,\n    });\n};\n/** Unsigned 32-bit little-endian integer CoderType. */\nexport const U32LE = /* @__PURE__ */ intView(4, false, {\n    read: (view, pos) => view.getUint32(pos, true),\n    write: (view, value) => view.setUint32(0, value, true),\n});\n/** Unsigned 32-bit big-endian integer CoderType. */\nexport const U32BE = /* @__PURE__ */ intView(4, false, {\n    read: (view, pos) => view.getUint32(pos, false),\n    write: (view, value) => view.setUint32(0, value, false),\n});\n/** Signed 32-bit little-endian integer CoderType. */\nexport const I32LE = /* @__PURE__ */ intView(4, true, {\n    read: (view, pos) => view.getInt32(pos, true),\n    write: (view, value) => view.setInt32(0, value, true),\n});\n/** Signed 32-bit big-endian integer CoderType. */\nexport const I32BE = /* @__PURE__ */ intView(4, true, {\n    read: (view, pos) => view.getInt32(pos, false),\n    write: (view, value) => view.setInt32(0, value, false),\n});\n/** Unsigned 16-bit little-endian integer CoderType. */\nexport const U16LE = /* @__PURE__ */ intView(2, false, {\n    read: (view, pos) => view.getUint16(pos, true),\n    write: (view, value) => view.setUint16(0, value, true),\n});\n/** Unsigned 16-bit big-endian integer CoderType. */\nexport const U16BE = /* @__PURE__ */ intView(2, false, {\n    read: (view, pos) => view.getUint16(pos, false),\n    write: (view, value) => view.setUint16(0, value, false),\n});\n/** Signed 16-bit little-endian integer CoderType. */\nexport const I16LE = /* @__PURE__ */ intView(2, true, {\n    read: (view, pos) => view.getInt16(pos, true),\n    write: (view, value) => view.setInt16(0, value, true),\n});\n/** Signed 16-bit big-endian integer CoderType. */\nexport const I16BE = /* @__PURE__ */ intView(2, true, {\n    read: (view, pos) => view.getInt16(pos, false),\n    write: (view, value) => view.setInt16(0, value, false),\n});\n/** Unsigned 8-bit integer CoderType. */\nexport const U8 = /* @__PURE__ */ intView(1, false, {\n    read: (view, pos) => view.getUint8(pos),\n    write: (view, value) => view.setUint8(0, value),\n});\n/** Signed 8-bit integer CoderType. */\nexport const I8 = /* @__PURE__ */ intView(1, true, {\n    read: (view, pos) => view.getInt8(pos),\n    write: (view, value) => view.setInt8(0, value),\n});\n// Floats\nconst f32 = (le) => view(4, {\n    read: (view, pos) => view.getFloat32(pos, le),\n    write: (view, value) => view.setFloat32(0, value, le),\n    validate: (value) => {\n        if (Math.fround(value) !== value && !Number.isNaN(value))\n            throw new Error(`f32: wrong value=${value}`);\n    },\n});\nconst f64 = (le) => view(8, {\n    read: (view, pos) => view.getFloat64(pos, le),\n    write: (view, value) => view.setFloat64(0, value, le),\n});\n/** 32-bit big-endian floating point CoderType (\"binary32\", IEEE 754-2008). */\nexport const F32BE = /* @__PURE__ */ f32(false);\n/** 32-bit little-endian floating point  CoderType (\"binary32\", IEEE 754-2008). */\nexport const F32LE = /* @__PURE__ */ f32(true);\n/** A 64-bit big-endian floating point type (\"binary64\", IEEE 754-2008). Any JS number can be encoded. */\nexport const F64BE = /* @__PURE__ */ f64(false);\n/** A 64-bit little-endian floating point type (\"binary64\", IEEE 754-2008). Any JS number can be encoded. */\nexport const F64LE = /* @__PURE__ */ f64(true);\n/** Boolean CoderType. */\nexport const bool = /* @__PURE__ */ wrap({\n    size: 1,\n    encodeStream: (w, value) => w.byte(value ? 1 : 0),\n    decodeStream: (r) => {\n        const value = r.byte();\n        if (value !== 0 && value !== 1)\n            throw r.err(`bool: invalid value ${value}`);\n        return value === 1;\n    },\n    validate: (value) => {\n        if (typeof value !== 'boolean')\n            throw new Error(`bool: invalid value ${value}`);\n        return value;\n    },\n});\n/**\n * Bytes CoderType with a specified length and endianness.\n * The bytes can have:\n * - Dynamic size (prefixed with a length CoderType like U16BE)\n * - Fixed size (specified by a number)\n * - Unknown size (null, will parse until end of buffer)\n * - Zero-terminated (terminator can be any Uint8Array)\n * @param len - CoderType, number, Uint8Array (terminator) or null\n * @param le - Whether to use little-endian byte order.\n * @returns CoderType representing the bytes.\n * @example\n * // Dynamic size bytes (prefixed with P.U16BE number of bytes length)\n * const dynamicBytes = P.bytes(P.U16BE, false);\n * const fixedBytes = P.bytes(32, false); // Fixed size bytes\n * const unknownBytes = P.bytes(null, false); // Unknown size bytes, will parse until end of buffer\n * const zeroTerminatedBytes = P.bytes(Uint8Array.of(0), false); // Zero-terminated bytes\n */\nconst createBytes = (len, le = false) => {\n    if (typeof le !== 'boolean')\n        throw new Error(`bytes/le: expected boolean, got ${typeof le}`);\n    const _length = lengthCoder(len);\n    const _isb = isBytes(len);\n    return wrap({\n        size: typeof len === 'number' ? len : undefined,\n        encodeStream: (w, value) => {\n            if (!_isb)\n                _length.encodeStream(w, value.length);\n            w.bytes(le ? swapEndianness(value) : value);\n            if (_isb)\n                w.bytes(len);\n        },\n        decodeStream: (r) => {\n            let bytes;\n            if (_isb) {\n                const tPos = r.find(len);\n                if (!tPos)\n                    throw r.err(`bytes: cannot find terminator`);\n                bytes = r.bytes(tPos - r.pos);\n                r.bytes(len.length);\n            }\n            else {\n                bytes = r.bytes(len === null ? r.leftBytes : _length.decodeStream(r));\n            }\n            return le ? swapEndianness(bytes) : bytes;\n        },\n        validate: (value) => {\n            if (!isBytes(value))\n                throw new Error(`bytes: invalid value ${value}`);\n            return value;\n        },\n    });\n};\nexport { createBytes as bytes, createHex as hex };\n/**\n * Prefix-encoded value using a length prefix and an inner CoderType.\n * The prefix can have:\n * - Dynamic size (prefixed with a length CoderType like U16BE)\n * - Fixed size (specified by a number)\n * - Unknown size (null, will parse until end of buffer)\n * - Zero-terminated (terminator can be any Uint8Array)\n * @param len - Length CoderType (dynamic size), number (fixed size), Uint8Array (for terminator), or null (will parse until end of buffer)\n * @param inner - CoderType for the actual value to be prefix-encoded.\n * @returns CoderType representing the prefix-encoded value.\n * @example\n * const dynamicPrefix = P.prefix(P.U16BE, P.bytes(null)); // Dynamic size prefix (prefixed with P.U16BE number of bytes length)\n * const fixedPrefix = P.prefix(10, P.bytes(null)); // Fixed size prefix (always 10 bytes)\n */\nexport function prefix(len, inner) {\n    if (!isCoder(inner))\n        throw new Error(`prefix: invalid inner value ${inner}`);\n    return apply(createBytes(len), reverse(inner));\n}\n/**\n * String CoderType with a specified length and endianness.\n * The string can be:\n * - Dynamic size (prefixed with a length CoderType like U16BE)\n * - Fixed size (specified by a number)\n * - Unknown size (null, will parse until end of buffer)\n * - Zero-terminated (terminator can be any Uint8Array)\n * @param len - Length CoderType (dynamic size), number (fixed size), Uint8Array (for terminator), or null (will parse until end of buffer)\n * @param le - Whether to use little-endian byte order.\n * @returns CoderType representing the string.\n * @example\n * const dynamicString = P.string(P.U16BE, false); // Dynamic size string (prefixed with P.U16BE number of string length)\n * const fixedString = P.string(10, false); // Fixed size string\n * const unknownString = P.string(null, false); // Unknown size string, will parse until end of buffer\n * const nullTerminatedString = P.cstring; // NUL-terminated string\n * const _cstring = P.string(Uint8Array.of(0)); // Same thing\n */\nexport const string = (len, le = false) => validate(apply(createBytes(len, le), utf8), (value) => {\n    // TextEncoder/TextDecoder will fail on non-string, but we create more readable errors earlier\n    if (typeof value !== 'string')\n        throw new Error(`expected string, got ${typeof value}`);\n    return value;\n});\n/** NUL-terminated string CoderType. */\nexport const cstring = /* @__PURE__ */ string(NULL);\n/**\n * Hexadecimal string CoderType with a specified length, endianness, and optional 0x prefix.\n * @param len - Length CoderType (dynamic size), number (fixed size), Uint8Array (for terminator), or null (will parse until end of buffer)\n * @param le - Whether to use little-endian byte order.\n * @param withZero - Whether to include the 0x prefix.\n * @returns CoderType representing the hexadecimal string.\n * @example\n * const dynamicHex = P.hex(P.U16BE, {isLE: false, with0x: true}); // Hex string with 0x prefix and U16BE length\n * const fixedHex = P.hex(32, {isLE: false, with0x: false}); // Fixed-length 32-byte hex string without 0x prefix\n */\nconst createHex = (len, options = { isLE: false, with0x: false }) => {\n    let inner = apply(createBytes(len, options.isLE), baseHex);\n    const prefix = options.with0x;\n    if (typeof prefix !== 'boolean')\n        throw new Error(`hex/with0x: expected boolean, got ${typeof prefix}`);\n    if (prefix) {\n        inner = apply(inner, {\n            encode: (value) => `0x${value}`,\n            decode: (value) => {\n                if (!value.startsWith('0x'))\n                    throw new Error('hex(with0x=true).encode input should start with 0x');\n                return value.slice(2);\n            },\n        });\n    }\n    return inner;\n};\n/**\n * Applies a base coder to a CoderType.\n * @param inner - The inner CoderType.\n * @param b - The base coder to apply.\n * @returns CoderType representing the transformed value.\n * @example\n * import { hex } from '@scure/base';\n * const hex = P.apply(P.bytes(32), hex); // will decode bytes into a hex string\n */\nexport function apply(inner, base) {\n    if (!isCoder(inner))\n        throw new Error(`apply: invalid inner value ${inner}`);\n    if (!isBaseCoder(base))\n        throw new Error(`apply: invalid base value ${inner}`);\n    return wrap({\n        size: inner.size,\n        encodeStream: (w, value) => {\n            let innerValue;\n            try {\n                innerValue = base.decode(value);\n            }\n            catch (e) {\n                throw w.err('' + e);\n            }\n            return inner.encodeStream(w, innerValue);\n        },\n        decodeStream: (r) => {\n            const innerValue = inner.decodeStream(r);\n            try {\n                return base.encode(innerValue);\n            }\n            catch (e) {\n                throw r.err('' + e);\n            }\n        },\n    });\n}\n/**\n * Lazy CoderType that is evaluated at runtime.\n * @param fn - A function that returns the CoderType.\n * @returns CoderType representing the lazy value.\n * @example\n * type Tree = { name: string; children: Tree[] };\n * const tree = P.struct({\n *   name: P.cstring,\n *   children: P.array(\n *     P.U16BE,\n *     P.lazy((): P.CoderType<Tree> => tree)\n *   ),\n * });\n */\nexport function lazy(fn) {\n    if (typeof fn !== 'function')\n        throw new Error(`lazy: expected function, got ${typeof fn}`);\n    return wrap({\n        encodeStream: (w, value) => fn().encodeStream(w, value),\n        decodeStream: (r) => fn().decodeStream(r),\n    });\n}\n/**\n * Flag CoderType that encodes/decodes a boolean value based on the presence of a marker.\n * @param flagValue - Marker value.\n * @param xor - Whether to invert the flag behavior.\n * @returns CoderType representing the flag value.\n * @example\n * const flag = P.flag(new Uint8Array([0x01, 0x02])); // Encodes true as u8a([0x01, 0x02]), false as u8a([])\n * const flagXor = P.flag(new Uint8Array([0x01, 0x02]), true); // Encodes true as u8a([]), false as u8a([0x01, 0x02])\n * // Conditional encoding with flagged\n * const s = P.struct({ f: P.flag(new Uint8Array([0x0, 0x1])), f2: P.flagged('f', P.U32BE) });\n */\nexport const flag = (flagValue, xor = false) => {\n    if (!isBytes(flagValue))\n        throw new Error(`flag/flagValue: expected Uint8Array, got ${typeof flagValue}`);\n    if (typeof xor !== 'boolean')\n        throw new Error(`flag/xor: expected boolean, got ${typeof xor}`);\n    return wrap({\n        size: flagValue.length,\n        encodeStream: (w, value) => {\n            if (!!value !== xor)\n                w.bytes(flagValue);\n        },\n        decodeStream: (r) => {\n            let hasFlag = r.leftBytes >= flagValue.length;\n            if (hasFlag) {\n                hasFlag = equalBytes(r.bytes(flagValue.length, true), flagValue);\n                // Found flag, advance cursor position\n                if (hasFlag)\n                    r.bytes(flagValue.length);\n            }\n            return hasFlag !== xor; // hasFlag ^ xor\n        },\n        validate: (value) => {\n            if (value !== undefined && typeof value !== 'boolean')\n                throw new Error(`flag: expected boolean value or undefined, got ${typeof value}`);\n            return value;\n        },\n    });\n};\n/**\n * Conditional CoderType that encodes/decodes a value only if a flag is present.\n * @param path - Path to the flag value or a CoderType for the flag.\n * @param inner - Inner CoderType for the value.\n * @param def - Optional default value to use if the flag is not present.\n * @returns CoderType representing the conditional value.\n * @example\n * const s = P.struct({\n *   f: P.flag(new Uint8Array([0x0, 0x1])),\n *   f2: P.flagged('f', P.U32BE)\n * });\n *\n * @example\n * const s2 = P.struct({\n *   f: P.flag(new Uint8Array([0x0, 0x1])),\n *   f2: P.flagged('f', P.U32BE, 123)\n * });\n */\nexport function flagged(path, inner, def) {\n    if (!isCoder(inner))\n        throw new Error(`flagged: invalid inner value ${inner}`);\n    if (typeof path !== 'string' && !isCoder(inner))\n        throw new Error(`flagged: wrong path=${path}`);\n    return wrap({\n        encodeStream: (w, value) => {\n            if (typeof path === 'string') {\n                if (Path.resolve(w.stack, path))\n                    inner.encodeStream(w, value);\n                else if (def)\n                    inner.encodeStream(w, def);\n            }\n            else {\n                path.encodeStream(w, !!value);\n                if (!!value)\n                    inner.encodeStream(w, value);\n                else if (def)\n                    inner.encodeStream(w, def);\n            }\n        },\n        decodeStream: (r) => {\n            let hasFlag = false;\n            if (typeof path === 'string')\n                hasFlag = !!Path.resolve(r.stack, path);\n            else\n                hasFlag = path.decodeStream(r);\n            // If there is a flag -- decode and return value\n            if (hasFlag)\n                return inner.decodeStream(r);\n            else if (def)\n                inner.decodeStream(r);\n            return;\n        },\n    });\n}\n/**\n * Optional CoderType that encodes/decodes a value based on a flag.\n * @param flag - CoderType for the flag value.\n * @param inner - Inner CoderType for the value.\n * @param def - Optional default value to use if the flag is not present.\n * @returns CoderType representing the optional value.\n * @example\n * // Will decode into P.U32BE only if flag present\n * const optional = P.optional(P.flag(new Uint8Array([0x0, 0x1])), P.U32BE);\n *\n * @example\n * // If no flag present, will decode into default value\n * const optionalWithDefault = P.optional(P.flag(new Uint8Array([0x0, 0x1])), P.U32BE, 123);\n */\nexport function optional(flag, inner, def) {\n    if (!isCoder(flag) || !isCoder(inner))\n        throw new Error(`optional: invalid flag or inner value flag=${flag} inner=${inner}`);\n    return wrap({\n        size: def !== undefined && flag.size && inner.size ? flag.size + inner.size : undefined,\n        encodeStream: (w, value) => {\n            flag.encodeStream(w, !!value);\n            if (value)\n                inner.encodeStream(w, value);\n            else if (def !== undefined)\n                inner.encodeStream(w, def);\n        },\n        decodeStream: (r) => {\n            if (flag.decodeStream(r))\n                return inner.decodeStream(r);\n            else if (def !== undefined)\n                inner.decodeStream(r);\n            return;\n        },\n    });\n}\n/**\n * Magic value CoderType that encodes/decodes a constant value.\n * This can be used to check for a specific magic value or sequence of bytes at the beginning of a data structure.\n * @param inner - Inner CoderType for the value.\n * @param constant - Constant value.\n * @param check - Whether to check the decoded value against the constant.\n * @returns CoderType representing the magic value.\n * @example\n * // Always encodes constant as bytes using inner CoderType, throws if encoded value is not present\n * const magicU8 = P.magic(P.U8, 0x42);\n */\nexport function magic(inner, constant, check = true) {\n    if (!isCoder(inner))\n        throw new Error(`magic: invalid inner value ${inner}`);\n    if (typeof check !== 'boolean')\n        throw new Error(`magic: expected boolean, got ${typeof check}`);\n    return wrap({\n        size: inner.size,\n        encodeStream: (w, _value) => inner.encodeStream(w, constant),\n        decodeStream: (r) => {\n            const value = inner.decodeStream(r);\n            if ((check && typeof value !== 'object' && value !== constant) ||\n                (isBytes(constant) && !equalBytes(constant, value))) {\n                throw r.err(`magic: invalid value: ${value} !== ${constant}`);\n            }\n            return;\n        },\n        validate: (value) => {\n            if (value !== undefined)\n                throw new Error(`magic: wrong value=${typeof value}`);\n            return value;\n        },\n    });\n}\n/**\n * Magic bytes CoderType that encodes/decodes a constant byte array or string.\n * @param constant - Constant byte array or string.\n * @returns CoderType representing the magic bytes.\n * @example\n * // Always encodes undefined into byte representation of string 'MAGIC'\n * const magicBytes = P.magicBytes('MAGIC');\n */\nexport const magicBytes = (constant) => {\n    const c = typeof constant === 'string' ? utf8.decode(constant) : constant;\n    return magic(createBytes(c.length), c);\n};\n/**\n * Creates a CoderType for a constant value. The function enforces this value during encoding,\n * ensuring it matches the provided constant. During decoding, it always returns the constant value.\n * The actual value is not written to or read from any byte stream; it's used only for validation.\n *\n * @param c - Constant value.\n * @returns CoderType representing the constant value.\n * @example\n * // Always return 123 on decode, throws on encoding anything other than 123\n * const constantU8 = P.constant(123);\n */\nexport function constant(c) {\n    return wrap({\n        encodeStream: (_w, value) => {\n            if (value !== c)\n                throw new Error(`constant: invalid value ${value} (exp: ${c})`);\n        },\n        decodeStream: (_r) => c,\n    });\n}\nfunction sizeof(fields) {\n    let size = 0;\n    for (const f of fields) {\n        if (f.size === undefined)\n            return;\n        if (!isNum(f.size))\n            throw new Error(`sizeof: wrong element size=${size}`);\n        size += f.size;\n    }\n    return size;\n}\n/**\n * Structure of composable primitives (C/Rust struct)\n * @param fields - Object mapping field names to CoderTypes.\n * @returns CoderType representing the structure.\n * @example\n * // Define a structure with a 32-bit big-endian unsigned integer, a string, and a nested structure\n * const myStruct = P.struct({\n *   id: P.U32BE,\n *   name: P.string(P.U8),\n *   nested: P.struct({\n *     flag: P.bool,\n *     value: P.I16LE\n *   })\n * });\n */\nexport function struct(fields) {\n    if (!isPlainObject(fields))\n        throw new Error(`struct: expected plain object, got ${fields}`);\n    for (const name in fields) {\n        if (!isCoder(fields[name]))\n            throw new Error(`struct: field ${name} is not CoderType`);\n    }\n    return wrap({\n        size: sizeof(Object.values(fields)),\n        encodeStream: (w, value) => {\n            w.pushObj(value, (fieldFn) => {\n                for (const name in fields)\n                    fieldFn(name, () => fields[name].encodeStream(w, value[name]));\n            });\n        },\n        decodeStream: (r) => {\n            const res = {};\n            r.pushObj(res, (fieldFn) => {\n                for (const name in fields)\n                    fieldFn(name, () => (res[name] = fields[name].decodeStream(r)));\n            });\n            return res;\n        },\n        validate: (value) => {\n            if (typeof value !== 'object' || value === null)\n                throw new Error(`struct: invalid value ${value}`);\n            return value;\n        },\n    });\n}\n/**\n * Tuple (unnamed structure) of CoderTypes. Same as struct but with unnamed fields.\n * @param fields - Array of CoderTypes.\n * @returns CoderType representing the tuple.\n * @example\n * const myTuple = P.tuple([P.U8, P.U16LE, P.string(P.U8)]);\n */\nexport function tuple(fields) {\n    if (!Array.isArray(fields))\n        throw new Error(`Packed.Tuple: got ${typeof fields} instead of array`);\n    for (let i = 0; i < fields.length; i++) {\n        if (!isCoder(fields[i]))\n            throw new Error(`tuple: field ${i} is not CoderType`);\n    }\n    return wrap({\n        size: sizeof(fields),\n        encodeStream: (w, value) => {\n            // TODO: fix types\n            if (!Array.isArray(value))\n                throw w.err(`tuple: invalid value ${value}`);\n            w.pushObj(value, (fieldFn) => {\n                for (let i = 0; i < fields.length; i++)\n                    fieldFn(`${i}`, () => fields[i].encodeStream(w, value[i]));\n            });\n        },\n        decodeStream: (r) => {\n            const res = [];\n            r.pushObj(res, (fieldFn) => {\n                for (let i = 0; i < fields.length; i++)\n                    fieldFn(`${i}`, () => res.push(fields[i].decodeStream(r)));\n            });\n            return res;\n        },\n        validate: (value) => {\n            if (!Array.isArray(value))\n                throw new Error(`tuple: invalid value ${value}`);\n            if (value.length !== fields.length)\n                throw new Error(`tuple: wrong length=${value.length}, expected ${fields.length}`);\n            return value;\n        },\n    });\n}\n/**\n * Array of items (inner type) with a specified length.\n * @param len - Length CoderType (dynamic size), number (fixed size), Uint8Array (for terminator), or null (will parse until end of buffer)\n * @param inner - CoderType for encoding/decoding each array item.\n * @returns CoderType representing the array.\n * @example\n * const a1 = P.array(P.U16BE, child); // Dynamic size array (prefixed with P.U16BE number of array length)\n * const a2 = P.array(4, child); // Fixed size array\n * const a3 = P.array(null, child); // Unknown size array, will parse until end of buffer\n * const a4 = P.array(Uint8Array.of(0), child); // zero-terminated array (NOTE: terminator can be any buffer)\n */\nexport function array(len, inner) {\n    if (!isCoder(inner))\n        throw new Error(`array: invalid inner value ${inner}`);\n    // By construction length is inside array (otherwise there will be various incorrect stack states)\n    // But forcing users always write '..' seems like bad idea. Also, breaking change.\n    const _length = lengthCoder(typeof len === 'string' ? `../${len}` : len);\n    return wrap({\n        size: typeof len === 'number' && inner.size ? len * inner.size : undefined,\n        encodeStream: (w, value) => {\n            const _w = w;\n            _w.pushObj(value, (fieldFn) => {\n                if (!isBytes(len))\n                    _length.encodeStream(w, value.length);\n                for (let i = 0; i < value.length; i++) {\n                    fieldFn(`${i}`, () => {\n                        const elm = value[i];\n                        const startPos = w.pos;\n                        inner.encodeStream(w, elm);\n                        if (isBytes(len)) {\n                            // Terminator is bigger than elm size, so skip\n                            if (len.length > _w.pos - startPos)\n                                return;\n                            const data = _w.finish(false).subarray(startPos, _w.pos);\n                            // There is still possible case when multiple elements create terminator,\n                            // but it is hard to catch here, will be very slow\n                            if (equalBytes(data.subarray(0, len.length), len))\n                                throw _w.err(`array: inner element encoding same as separator. elm=${elm} data=${data}`);\n                        }\n                    });\n                }\n            });\n            if (isBytes(len))\n                w.bytes(len);\n        },\n        decodeStream: (r) => {\n            const res = [];\n            r.pushObj(res, (fieldFn) => {\n                if (len === null) {\n                    for (let i = 0; !r.isEnd(); i++) {\n                        fieldFn(`${i}`, () => res.push(inner.decodeStream(r)));\n                        if (inner.size && r.leftBytes < inner.size)\n                            break;\n                    }\n                }\n                else if (isBytes(len)) {\n                    for (let i = 0;; i++) {\n                        if (equalBytes(r.bytes(len.length, true), len)) {\n                            // Advance cursor position if terminator found\n                            r.bytes(len.length);\n                            break;\n                        }\n                        fieldFn(`${i}`, () => res.push(inner.decodeStream(r)));\n                    }\n                }\n                else {\n                    let length;\n                    fieldFn('arrayLen', () => (length = _length.decodeStream(r)));\n                    for (let i = 0; i < length; i++)\n                        fieldFn(`${i}`, () => res.push(inner.decodeStream(r)));\n                }\n            });\n            return res;\n        },\n        validate: (value) => {\n            if (!Array.isArray(value))\n                throw new Error(`array: invalid value ${value}`);\n            return value;\n        },\n    });\n}\n/**\n * Mapping between encoded values and string representations.\n * @param inner - CoderType for encoded values.\n * @param variants - Object mapping string representations to encoded values.\n * @returns CoderType representing the mapping.\n * @example\n * // Map between numbers and strings\n * const numberMap = P.map(P.U8, {\n *   'one': 1,\n *   'two': 2,\n *   'three': 3\n * });\n *\n * // Map between byte arrays and strings\n * const byteMap = P.map(P.bytes(2, false), {\n *   'ab': Uint8Array.from([0x61, 0x62]),\n *   'cd': Uint8Array.from([0x63, 0x64])\n * });\n */\nexport function map(inner, variants) {\n    if (!isCoder(inner))\n        throw new Error(`map: invalid inner value ${inner}`);\n    if (!isPlainObject(variants))\n        throw new Error(`map: variants should be plain object`);\n    const variantNames = new Map();\n    for (const k in variants)\n        variantNames.set(variants[k], k);\n    return wrap({\n        size: inner.size,\n        encodeStream: (w, value) => inner.encodeStream(w, variants[value]),\n        decodeStream: (r) => {\n            const variant = inner.decodeStream(r);\n            const name = variantNames.get(variant);\n            if (name === undefined)\n                throw r.err(`Enum: unknown value: ${variant} ${Array.from(variantNames.keys())}`);\n            return name;\n        },\n        validate: (value) => {\n            if (typeof value !== 'string')\n                throw new Error(`map: invalid value ${value}`);\n            if (!(value in variants))\n                throw new Error(`Map: unknown variant: ${value}`);\n            return value;\n        },\n    });\n}\n/**\n * Tagged union of CoderTypes, where the tag value determines which CoderType to use.\n * The decoded value will have the structure `{ TAG: number, data: ... }`.\n * @param tag - CoderType for the tag value.\n * @param variants - Object mapping tag values to CoderTypes.\n * @returns CoderType representing the tagged union.\n * @example\n * // Tagged union of array, string, and number\n * // Depending on the value of the first byte, it will be decoded as an array, string, or number.\n * const taggedUnion = P.tag(P.U8, {\n *   0x01: P.array(P.U16LE, P.U8),\n *   0x02: P.string(P.U8),\n *   0x03: P.U32BE\n * });\n *\n * const encoded = taggedUnion.encode({ TAG: 0x01, data: 'hello' }); // Encodes the string 'hello' with tag 0x01\n * const decoded = taggedUnion.decode(encoded); // Decodes the encoded value back to { TAG: 0x01, data: 'hello' }\n */\nexport function tag(tag, variants) {\n    if (!isCoder(tag))\n        throw new Error(`tag: invalid tag value ${tag}`);\n    if (!isPlainObject(variants))\n        throw new Error(`tag: variants should be plain object`);\n    for (const name in variants) {\n        if (!isCoder(variants[name]))\n            throw new Error(`tag: variant ${name} is not CoderType`);\n    }\n    return wrap({\n        size: tag.size,\n        encodeStream: (w, value) => {\n            const { TAG, data } = value;\n            const dataType = variants[TAG];\n            tag.encodeStream(w, TAG);\n            dataType.encodeStream(w, data);\n        },\n        decodeStream: (r) => {\n            const TAG = tag.decodeStream(r);\n            const dataType = variants[TAG];\n            if (!dataType)\n                throw r.err(`Tag: invalid tag ${TAG}`);\n            return { TAG, data: dataType.decodeStream(r) };\n        },\n        validate: (value) => {\n            const { TAG } = value;\n            const dataType = variants[TAG];\n            if (!dataType)\n                throw new Error(`Tag: invalid tag ${TAG.toString()}`);\n            return value;\n        },\n    });\n}\n/**\n * Mapping between encoded values, string representations, and CoderTypes using a tag CoderType.\n * @param tagCoder - CoderType for the tag value.\n * @param variants - Object mapping string representations to [tag value, CoderType] pairs.\n *  * @returns CoderType representing the mapping.\n * @example\n * const cborValue: P.CoderType<CborValue> = P.mappedTag(P.bits(3), {\n *   uint: [0, cborUint], // An unsigned integer in the range 0..264-1 inclusive.\n *   negint: [1, cborNegint], // A negative integer in the range -264..-1 inclusive\n *   bytes: [2, P.lazy(() => cborLength(P.bytes, cborValue))], // A byte string.\n *   string: [3, P.lazy(() => cborLength(P.string, cborValue))], // A text string (utf8)\n *   array: [4, cborArrLength(P.lazy(() => cborValue))], // An array of data items\n *   map: [5, P.lazy(() => cborArrLength(P.tuple([cborValue, cborValue])))], // A map of pairs of data items\n *   tag: [6, P.tuple([cborUint, P.lazy(() => cborValue)] as const)], // A tagged data item (\"tag\") whose tag number\n *   simple: [7, cborSimple], // Floating-point numbers and simple values, as well as the \"break\" stop code\n * });\n */\nexport function mappedTag(tagCoder, variants) {\n    if (!isCoder(tagCoder))\n        throw new Error(`mappedTag: invalid tag value ${tag}`);\n    if (!isPlainObject(variants))\n        throw new Error(`mappedTag: variants should be plain object`);\n    const mapValue = {};\n    const tagValue = {};\n    for (const key in variants) {\n        const v = variants[key];\n        mapValue[key] = v[0];\n        tagValue[key] = v[1];\n    }\n    return tag(map(tagCoder, mapValue), tagValue);\n}\n/**\n * Bitset of boolean values with optional padding.\n * @param names - An array of string names for the bitset values.\n * @param pad - Whether to pad the bitset to a multiple of 8 bits.\n * @returns CoderType representing the bitset.\n * @template Names\n * @example\n * const myBitset = P.bitset(['flag1', 'flag2', 'flag3', 'flag4'], true);\n */\nexport function bitset(names, pad = false) {\n    if (typeof pad !== 'boolean')\n        throw new Error(`bitset/pad: expected boolean, got ${typeof pad}`);\n    if (!Array.isArray(names))\n        throw new Error('bitset/names: expected array');\n    for (const name of names) {\n        if (typeof name !== 'string')\n            throw new Error('bitset/names: expected array of strings');\n    }\n    return wrap({\n        encodeStream: (w, value) => {\n            for (let i = 0; i < names.length; i++)\n                w.bits(+value[names[i]], 1);\n            if (pad && names.length % 8)\n                w.bits(0, 8 - (names.length % 8));\n        },\n        decodeStream: (r) => {\n            const out = {};\n            for (let i = 0; i < names.length; i++)\n                out[names[i]] = !!r.bits(1);\n            if (pad && names.length % 8)\n                r.bits(8 - (names.length % 8));\n            return out;\n        },\n        validate: (value) => {\n            if (!isPlainObject(value))\n                throw new Error(`bitset: invalid value ${value}`);\n            for (const v of Object.values(value)) {\n                if (typeof v !== 'boolean')\n                    throw new Error('expected boolean');\n            }\n            return value;\n        },\n    });\n}\n/** Padding function which always returns zero */\nexport const ZeroPad = (_) => 0;\nfunction padLength(blockSize, len) {\n    if (len % blockSize === 0)\n        return 0;\n    return blockSize - (len % blockSize);\n}\n/**\n * Pads a CoderType with a specified block size and padding function on the left side.\n * @param blockSize - Block size for padding (positive safe integer).\n * @param inner - Inner CoderType to pad.\n * @param padFn - Padding function to use. If not provided, zero padding is used.\n * @returns CoderType representing the padded value.\n * @example\n * // Pad a U32BE with a block size of 4 and zero padding\n * const paddedU32BE = P.padLeft(4, P.U32BE);\n *\n * // Pad a string with a block size of 16 and custom padding\n * const paddedString = P.padLeft(16, P.string(P.U8), (i) => i + 1);\n */\nexport function padLeft(blockSize, inner, padFn) {\n    if (!isNum(blockSize) || blockSize <= 0)\n        throw new Error(`padLeft: wrong blockSize=${blockSize}`);\n    if (!isCoder(inner))\n        throw new Error(`padLeft: invalid inner value ${inner}`);\n    if (padFn !== undefined && typeof padFn !== 'function')\n        throw new Error(`padLeft: wrong padFn=${typeof padFn}`);\n    const _padFn = padFn || ZeroPad;\n    if (!inner.size)\n        throw new Error('padLeft cannot have dynamic size');\n    return wrap({\n        size: inner.size + padLength(blockSize, inner.size),\n        encodeStream: (w, value) => {\n            const padBytes = padLength(blockSize, inner.size);\n            for (let i = 0; i < padBytes; i++)\n                w.byte(_padFn(i));\n            inner.encodeStream(w, value);\n        },\n        decodeStream: (r) => {\n            r.bytes(padLength(blockSize, inner.size));\n            return inner.decodeStream(r);\n        },\n    });\n}\n/**\n * Pads a CoderType with a specified block size and padding function on the right side.\n * @param blockSize - Block size for padding (positive safe integer).\n * @param inner - Inner CoderType to pad.\n * @param padFn - Padding function to use. If not provided, zero padding is used.\n * @returns CoderType representing the padded value.\n * @example\n * // Pad a U16BE with a block size of 2 and zero padding\n * const paddedU16BE = P.padRight(2, P.U16BE);\n *\n * // Pad a bytes with a block size of 8 and custom padding\n * const paddedBytes = P.padRight(8, P.bytes(null), (i) => i + 1);\n */\nexport function padRight(blockSize, inner, padFn) {\n    if (!isCoder(inner))\n        throw new Error(`padRight: invalid inner value ${inner}`);\n    if (!isNum(blockSize) || blockSize <= 0)\n        throw new Error(`padLeft: wrong blockSize=${blockSize}`);\n    if (padFn !== undefined && typeof padFn !== 'function')\n        throw new Error(`padRight: wrong padFn=${typeof padFn}`);\n    const _padFn = padFn || ZeroPad;\n    return wrap({\n        size: inner.size ? inner.size + padLength(blockSize, inner.size) : undefined,\n        encodeStream: (w, value) => {\n            const _w = w;\n            const pos = _w.pos;\n            inner.encodeStream(w, value);\n            const padBytes = padLength(blockSize, _w.pos - pos);\n            for (let i = 0; i < padBytes; i++)\n                w.byte(_padFn(i));\n        },\n        decodeStream: (r) => {\n            const start = r.pos;\n            const res = inner.decodeStream(r);\n            r.bytes(padLength(blockSize, r.pos - start));\n            return res;\n        },\n    });\n}\n1;\n/**\n * Pointer to a value using a pointer CoderType and an inner CoderType.\n * Pointers are scoped, and the next pointer in the dereference chain is offset by the previous one.\n * By default (if no 'allowMultipleReads' in ReaderOpts is set) is safe, since\n * same region of memory cannot be read multiple times.\n * @param ptr - CoderType for the pointer value.\n * @param inner - CoderType for encoding/decoding the pointed value.\n * @param sized - Whether the pointer should have a fixed size.\n * @returns CoderType representing the pointer to the value.\n * @example\n * const pointerToU8 = P.pointer(P.U16BE, P.U8); // Pointer to a single U8 value\n */\nexport function pointer(ptr, inner, sized = false) {\n    if (!isCoder(ptr))\n        throw new Error(`pointer: invalid ptr value ${ptr}`);\n    if (!isCoder(inner))\n        throw new Error(`pointer: invalid inner value ${inner}`);\n    if (typeof sized !== 'boolean')\n        throw new Error(`pointer/sized: expected boolean, got ${typeof sized}`);\n    if (!ptr.size)\n        throw new Error('unsized pointer');\n    return wrap({\n        size: sized ? ptr.size : undefined,\n        encodeStream: (w, value) => {\n            const _w = w;\n            const start = _w.pos;\n            ptr.encodeStream(w, 0);\n            _w.ptrs.push({ pos: start, ptr, buffer: inner.encode(value) });\n        },\n        decodeStream: (r) => {\n            const ptrVal = ptr.decodeStream(r);\n            r._enablePointers();\n            return inner.decodeStream(r.offsetReader(ptrVal));\n        },\n    });\n}\n// Internal methods for test purposes only\nexport const _TEST = { _bitset: Bitset, _Reader, _Writer, Path };\n//# sourceMappingURL=index.js.map","import { schnorr, secp256k1 as secp } from '@noble/curves/secp256k1.js';\nimport { bytesToNumberBE, numberToBytesBE } from '@noble/curves/utils.js';\nimport { ripemd160 } from '@noble/hashes/legacy.js';\nimport { sha256 } from '@noble/hashes/sha2.js';\nimport { utils as packedUtils, U32LE } from 'micro-packed';\nconst Point = secp.Point;\nconst Fn = Point.Fn;\nconst CURVE_ORDER = Point.Fn.ORDER;\nexport const hasEven = (y) => y % 2n === 0n;\nconst isBytes = packedUtils.isBytes;\nconst concatBytes = packedUtils.concatBytes;\nconst equalBytes = packedUtils.equalBytes;\nexport { concatBytes, equalBytes, isBytes, sha256 };\nexport const hash160 = (msg) => ripemd160(sha256(msg));\nexport const sha256x2 = (...msgs) => sha256(sha256(concatBytes(...msgs)));\nexport const randomPrivateKeyBytes = schnorr.utils.randomSecretKey;\nexport const pubSchnorr = schnorr.getPublicKey;\nexport const pubECDSA = secp.getPublicKey;\n// low-r signature grinding. Used to reduce tx size by 1 byte.\n// noble/secp256k1 does not support the feature: it is not used outside of BTC.\n// We implement it manually, because in BTC it's common.\n// Not best way, but closest to bitcoin implementation (easier to check)\nconst hasLowR = (sig) => sig.r < CURVE_ORDER / 2n;\nexport function signECDSA(hash, privateKey, lowR = false) {\n    let sig = secp.Signature.fromBytes(secp.sign(hash, privateKey, { prehash: false }));\n    if (lowR && !hasLowR(sig)) {\n        const extraEntropy = new Uint8Array(32);\n        let counter = 0;\n        while (!hasLowR(sig)) {\n            extraEntropy.set(U32LE.encode(counter++));\n            sig = secp.Signature.fromBytes(secp.sign(hash, privateKey, { prehash: false, extraEntropy }));\n            if (counter > 4294967295)\n                throw new Error('lowR counter overflow: report the error');\n        }\n    }\n    return sig.toBytes('der');\n}\nexport const signSchnorr = schnorr.sign;\nexport const tagSchnorr = schnorr.utils.taggedHash;\nexport const PubT = {\n    ecdsa: 0,\n    schnorr: 1,\n};\nexport function validatePubkey(pub, type) {\n    const len = pub.length;\n    if (type === PubT.ecdsa) {\n        if (len === 32)\n            throw new Error('Expected non-Schnorr key');\n        Point.fromBytes(pub); // does assertValidity\n        return pub;\n    }\n    else if (type === PubT.schnorr) {\n        if (len !== 32)\n            throw new Error('Expected 32-byte Schnorr key');\n        schnorr.utils.lift_x(bytesToNumberBE(pub));\n        return pub;\n    }\n    else {\n        throw new Error('Unknown key type');\n    }\n}\nexport function tapTweak(a, b) {\n    const u = schnorr.utils;\n    const t = u.taggedHash('TapTweak', a, b);\n    const tn = bytesToNumberBE(t);\n    if (tn >= CURVE_ORDER)\n        throw new Error('tweak higher than curve order');\n    return tn;\n}\nexport function taprootTweakPrivKey(privKey, merkleRoot = Uint8Array.of()) {\n    const u = schnorr.utils;\n    const seckey0 = bytesToNumberBE(privKey); // seckey0 = int_from_bytes(seckey0)\n    const P = Point.BASE.multiply(seckey0); // P = point_mul(G, seckey0)\n    // seckey = seckey0 if has_even_y(P) else SECP256K1_ORDER - seckey0\n    const seckey = hasEven(P.y) ? seckey0 : Fn.neg(seckey0);\n    const xP = u.pointToBytes(P);\n    // t = int_from_bytes(tagged_hash(\"TapTweak\", bytes_from_int(x(P)) + h)); >= SECP256K1_ORDER check\n    const t = tapTweak(xP, merkleRoot);\n    // bytes_from_int((seckey + t) % SECP256K1_ORDER)\n    return numberToBytesBE(Fn.add(seckey, t), 32);\n}\nexport function taprootTweakPubkey(pubKey, h) {\n    const u = schnorr.utils;\n    const t = tapTweak(pubKey, h); // t = int_from_bytes(tagged_hash(\"TapTweak\", pubkey + h))\n    const P = u.lift_x(bytesToNumberBE(pubKey)); // P = lift_x(int_from_bytes(pubkey))\n    const Q = P.add(Point.BASE.multiply(t)); // Q = point_add(P, point_mul(G, t))\n    const parity = hasEven(Q.y) ? 0 : 1; // 0 if has_even_y(Q) else 1\n    return [u.pointToBytes(Q), parity]; // bytes_from_int(x(Q))\n}\n// Another stupid decision, where lack of standard affects security.\n// Multisig needs to be generated with some key.\n// We are using approach from BIP 341/bitcoinjs-lib: SHA256(uncompressedDER(SECP256K1_GENERATOR_POINT))\n// It is possible to switch SECP256K1_GENERATOR_POINT with some random point;\n// but it's too complex to prove.\n// Also used by bitcoin-core and bitcoinjs-lib\nexport const TAPROOT_UNSPENDABLE_KEY = sha256(Point.BASE.toBytes(false));\nexport const NETWORK = {\n    bech32: 'bc',\n    pubKeyHash: 0x00,\n    scriptHash: 0x05,\n    wif: 0x80,\n};\nexport const TEST_NETWORK = {\n    bech32: 'tb',\n    pubKeyHash: 0x6f,\n    scriptHash: 0xc4,\n    wif: 0xef,\n};\n// Exported for tests, internal method\nexport function compareBytes(a, b) {\n    if (!isBytes(a) || !isBytes(b))\n        throw new Error(`cmp: wrong type a=${typeof a} b=${typeof b}`);\n    // -1 -> a<b, 0 -> a==b, 1 -> a>b\n    const len = Math.min(a.length, b.length);\n    for (let i = 0; i < len; i++)\n        if (a[i] != b[i])\n            return Math.sign(a[i] - b[i]);\n    return Math.sign(a.length - b.length);\n}\n// Reverses key<->values\nexport function reverseObject(obj) {\n    const res = {};\n    for (const k in obj) {\n        if (res[obj[k]] !== undefined)\n            throw new Error('duplicate key');\n        res[obj[k]] = k;\n    }\n    return res;\n}\n//# sourceMappingURL=utils.js.map","import * as P from 'micro-packed';\nimport { isBytes, reverseObject } from \"./utils.js\";\nexport const MAX_SCRIPT_BYTE_LENGTH = 520;\n// prettier-ignore\nexport const OP = {\n    OP_0: 0, PUSHDATA1: 76, PUSHDATA2: 77, PUSHDATA4: 78, '1NEGATE': 79,\n    RESERVED: 80,\n    OP_1: 81, OP_2: 82, OP_3: 83, OP_4: 84, OP_5: 85, OP_6: 86, OP_7: 87, OP_8: 88, OP_9: 89,\n    OP_10: 90, OP_11: 91, OP_12: 92, OP_13: 93, OP_14: 94, OP_15: 95, OP_16: 96,\n    // Control\n    NOP: 97, VER: 98, IF: 99, NOTIF: 100, VERIF: 101, VERNOTIF: 102, ELSE: 103, ENDIF: 104, VERIFY: 105, RETURN: 106,\n    // Stack\n    TOALTSTACK: 107, FROMALTSTACK: 108, '2DROP': 109, '2DUP': 110, '3DUP': 111, '2OVER': 112, '2ROT': 113, '2SWAP': 114,\n    IFDUP: 115, DEPTH: 116, DROP: 117, DUP: 118, NIP: 119, OVER: 120, PICK: 121, ROLL: 122, ROT: 123, SWAP: 124, TUCK: 125,\n    // Splice\n    CAT: 126, SUBSTR: 127, LEFT: 128, RIGHT: 129, SIZE: 130,\n    // Boolean logic\n    INVERT: 131, AND: 132, OR: 133, XOR: 134, EQUAL: 135, EQUALVERIFY: 136, RESERVED1: 137, RESERVED2: 138,\n    // Numbers\n    '1ADD': 139, '1SUB': 140, '2MUL': 141, '2DIV': 142,\n    NEGATE: 143, ABS: 144, NOT: 145, '0NOTEQUAL': 146,\n    ADD: 147, SUB: 148, MUL: 149, DIV: 150, MOD: 151, LSHIFT: 152, RSHIFT: 153, BOOLAND: 154, BOOLOR: 155,\n    NUMEQUAL: 156, NUMEQUALVERIFY: 157, NUMNOTEQUAL: 158, LESSTHAN: 159, GREATERTHAN: 160,\n    LESSTHANOREQUAL: 161, GREATERTHANOREQUAL: 162, MIN: 163, MAX: 164, WITHIN: 165,\n    // Crypto\n    RIPEMD160: 166, SHA1: 167, SHA256: 168, HASH160: 169, HASH256: 170, CODESEPARATOR: 171,\n    CHECKSIG: 172, CHECKSIGVERIFY: 173, CHECKMULTISIG: 174, CHECKMULTISIGVERIFY: 175,\n    // Expansion\n    NOP1: 176, CHECKLOCKTIMEVERIFY: 177, CHECKSEQUENCEVERIFY: 178, NOP4: 179, NOP5: 180, NOP6: 181, NOP7: 182, NOP8: 183, NOP9: 184, NOP10: 185,\n    // BIP 342\n    CHECKSIGADD: 186,\n    // Invalid\n    INVALID: 255,\n};\nexport const OPNames = reverseObject(OP);\n// We can encode almost any number as ScriptNum, however, parsing will be a problem\n// since we can't know if buffer is a number or something else.\nexport function ScriptNum(bytesLimit = 6, forceMinimal = false) {\n    return P.wrap({\n        encodeStream: (w, value) => {\n            if (value === 0n)\n                return;\n            const neg = value < 0;\n            const val = BigInt(value);\n            const nums = [];\n            for (let abs = neg ? -val : val; abs; abs >>= 8n)\n                nums.push(Number(abs & 0xffn));\n            if (nums[nums.length - 1] >= 0x80)\n                nums.push(neg ? 0x80 : 0);\n            else if (neg)\n                nums[nums.length - 1] |= 0x80;\n            w.bytes(new Uint8Array(nums));\n        },\n        decodeStream: (r) => {\n            const len = r.leftBytes;\n            if (len > bytesLimit)\n                throw new Error(`ScriptNum: number (${len}) bigger than limit=${bytesLimit}`);\n            if (len === 0)\n                return 0n;\n            if (forceMinimal) {\n                const data = r.bytes(len, true);\n                // MSB is zero (without sign bit) -> not minimally encoded\n                if ((data[data.length - 1] & 0x7f) === 0) {\n                    // exception\n                    if (len <= 1 || (data[data.length - 2] & 0x80) === 0)\n                        throw new Error('Non-minimally encoded ScriptNum');\n                }\n            }\n            let last = 0;\n            let res = 0n;\n            for (let i = 0; i < len; ++i) {\n                last = r.byte();\n                res |= BigInt(last) << (8n * BigInt(i));\n            }\n            if (last >= 0x80) {\n                res &= (2n ** BigInt(len * 8) - 1n) >> 1n;\n                res = -res;\n            }\n            return res;\n        },\n    });\n}\nexport function OpToNum(op, bytesLimit = 4, forceMinimal = true) {\n    if (typeof op === 'number')\n        return op;\n    if (isBytes(op)) {\n        try {\n            const val = ScriptNum(bytesLimit, forceMinimal).decode(op);\n            if (val > Number.MAX_SAFE_INTEGER)\n                return;\n            return Number(val);\n        }\n        catch (e) {\n            return;\n        }\n    }\n    return;\n}\n// Converts script bytes to parsed script\n// 5221030000000000000000000000000000000000000000000000000000000000000001210300000000000000000000000000000000000000000000000000000000000000022103000000000000000000000000000000000000000000000000000000000000000353ae\n// =>\n// OP_2\n//   030000000000000000000000000000000000000000000000000000000000000001\n//   030000000000000000000000000000000000000000000000000000000000000002\n//   030000000000000000000000000000000000000000000000000000000000000003\n//   OP_3\n//   CHECKMULTISIG\nexport const Script = P.wrap({\n    encodeStream: (w, value) => {\n        for (let o of value) {\n            if (typeof o === 'string') {\n                if (OP[o] === undefined)\n                    throw new Error(`Unknown opcode=${o}`);\n                w.byte(OP[o]);\n                continue;\n            }\n            else if (typeof o === 'number') {\n                if (o === 0x00) {\n                    w.byte(0x00);\n                    continue;\n                }\n                else if (1 <= o && o <= 16) {\n                    w.byte(OP.OP_1 - 1 + o);\n                    continue;\n                }\n            }\n            // Encode big numbers\n            if (typeof o === 'number')\n                o = ScriptNum().encode(BigInt(o));\n            if (!isBytes(o))\n                throw new Error(`Wrong Script OP=${o} (${typeof o})`);\n            // Bytes\n            const len = o.length;\n            if (len < OP.PUSHDATA1)\n                w.byte(len);\n            else if (len <= 0xff) {\n                w.byte(OP.PUSHDATA1);\n                w.byte(len);\n            }\n            else if (len <= 0xffff) {\n                w.byte(OP.PUSHDATA2);\n                w.bytes(P.U16LE.encode(len));\n            }\n            else {\n                w.byte(OP.PUSHDATA4);\n                w.bytes(P.U32LE.encode(len));\n            }\n            w.bytes(o);\n        }\n    },\n    decodeStream: (r) => {\n        const out = [];\n        while (!r.isEnd()) {\n            const cur = r.byte();\n            // if 0 < cur < 78\n            if (OP.OP_0 < cur && cur <= OP.PUSHDATA4) {\n                let len;\n                if (cur < OP.PUSHDATA1)\n                    len = cur;\n                else if (cur === OP.PUSHDATA1)\n                    len = P.U8.decodeStream(r);\n                else if (cur === OP.PUSHDATA2)\n                    len = P.U16LE.decodeStream(r);\n                else if (cur === OP.PUSHDATA4)\n                    len = P.U32LE.decodeStream(r);\n                else\n                    throw new Error('Should be not possible');\n                out.push(r.bytes(len));\n            }\n            else if (cur === 0x00) {\n                out.push(0);\n            }\n            else if (OP.OP_1 <= cur && cur <= OP.OP_16) {\n                out.push(cur - (OP.OP_1 - 1));\n            }\n            else {\n                const op = OPNames[cur];\n                if (op === undefined)\n                    throw new Error(`Unknown opcode=${cur.toString(16)}`);\n                out.push(op);\n            }\n        }\n        return out;\n    },\n});\n// BTC specific variable length integer encoding\n// https://en.bitcoin.it/wiki/Protocol_documentation#Variable_length_integer\nconst CSLimits = {\n    0xfd: [0xfd, 2, 253n, 65535n],\n    0xfe: [0xfe, 4, 65536n, 4294967295n],\n    0xff: [0xff, 8, 4294967296n, 18446744073709551615n],\n};\nexport const CompactSize = P.wrap({\n    encodeStream: (w, value) => {\n        if (typeof value === 'number')\n            value = BigInt(value);\n        if (0n <= value && value <= 252n)\n            return w.byte(Number(value));\n        for (const [flag, bytes, start, stop] of Object.values(CSLimits)) {\n            if (start > value || value > stop)\n                continue;\n            w.byte(flag);\n            for (let i = 0; i < bytes; i++)\n                w.byte(Number((value >> (8n * BigInt(i))) & 0xffn));\n            return;\n        }\n        throw w.err(`VarInt too big: ${value}`);\n    },\n    decodeStream: (r) => {\n        const b0 = r.byte();\n        if (b0 <= 0xfc)\n            return BigInt(b0);\n        const [_, bytes, start] = CSLimits[b0];\n        let num = 0n;\n        for (let i = 0; i < bytes; i++)\n            num |= BigInt(r.byte()) << (8n * BigInt(i));\n        if (num < start)\n            throw r.err(`Wrong CompactSize(${8 * bytes})`);\n        return num;\n    },\n});\n// Same thing, but in number instead of bigint. Checks for safe integer inside\nexport const CompactSizeLen = P.apply(CompactSize, P.coders.numberBigint);\n// ui8a of size <CompactSize>\nexport const VarBytes = P.bytes(CompactSize);\n// SegWit v0 stack of witness buffers\nexport const RawWitness = P.array(CompactSizeLen, VarBytes);\n// Array of size <CompactSize>\nexport const BTCArray = (t) => P.array(CompactSize, t);\nexport const RawInput = P.struct({\n    txid: P.bytes(32, true), // hash(prev_tx),\n    index: P.U32LE, // output number of previous tx\n    finalScriptSig: VarBytes, // btc merges input and output script, executes it. If ok = tx passes\n    sequence: P.U32LE, // ?\n});\nexport const RawOutput = P.struct({ amount: P.U64LE, script: VarBytes });\n// https://en.bitcoin.it/wiki/Protocol_documentation#tx\nconst _RawTx = P.struct({\n    version: P.I32LE,\n    segwitFlag: P.flag(new Uint8Array([0x00, 0x01])),\n    inputs: BTCArray(RawInput),\n    outputs: BTCArray(RawOutput),\n    witnesses: P.flagged('segwitFlag', P.array('inputs/length', RawWitness)),\n    // < 500000000\tBlock number at which this transaction is unlocked\n    // >= 500000000\tUNIX timestamp at which this transaction is unlocked\n    // Handled as part of PSBTv2\n    lockTime: P.U32LE,\n});\nfunction validateRawTx(tx) {\n    if (tx.segwitFlag && tx.witnesses && !tx.witnesses.length)\n        throw new Error('Segwit flag with empty witnesses array');\n    return tx;\n}\nexport const RawTx = P.validate(_RawTx, validateRawTx);\n// Pre-SegWit serialization format (for PSBTv0)\nexport const RawOldTx = P.struct({\n    version: P.I32LE,\n    inputs: BTCArray(RawInput),\n    outputs: BTCArray(RawOutput),\n    lockTime: P.U32LE,\n});\n//# sourceMappingURL=script.js.map","import { bech32, bech32m, createBase58check, hex } from '@scure/base';\nimport * as P from 'micro-packed';\nimport { TaprootControlBlock } from \"./psbt.js\";\nimport { OpToNum, Script, VarBytes } from \"./script.js\";\nimport * as u from \"./utils.js\";\nimport { NETWORK } from \"./utils.js\";\nconst OutP2A = {\n    encode(from) {\n        if (from.length !== 2 || from[0] !== 1 || !u.isBytes(from[1]) || hex.encode(from[1]) !== '4e73')\n            return;\n        return { type: 'p2a', script: Script.encode(from) };\n    },\n    decode: (to) => {\n        if (to.type !== 'p2a')\n            return;\n        return [1, hex.decode('4e73')];\n    },\n};\nfunction isValidPubkey(pub, type) {\n    try {\n        u.validatePubkey(pub, type);\n        return true;\n    }\n    catch (e) {\n        return false;\n    }\n}\nconst OutPK = {\n    encode(from) {\n        if (from.length !== 2 ||\n            !u.isBytes(from[0]) ||\n            !isValidPubkey(from[0], u.PubT.ecdsa) ||\n            from[1] !== 'CHECKSIG')\n            return;\n        return { type: 'pk', pubkey: from[0] };\n    },\n    decode: (to) => (to.type === 'pk' ? [to.pubkey, 'CHECKSIG'] : undefined),\n};\nconst OutPKH = {\n    encode(from) {\n        if (from.length !== 5 || from[0] !== 'DUP' || from[1] !== 'HASH160' || !u.isBytes(from[2]))\n            return;\n        if (from[3] !== 'EQUALVERIFY' || from[4] !== 'CHECKSIG')\n            return;\n        return { type: 'pkh', hash: from[2] };\n    },\n    decode: (to) => to.type === 'pkh' ? ['DUP', 'HASH160', to.hash, 'EQUALVERIFY', 'CHECKSIG'] : undefined,\n};\nconst OutSH = {\n    encode(from) {\n        if (from.length !== 3 || from[0] !== 'HASH160' || !u.isBytes(from[1]) || from[2] !== 'EQUAL')\n            return;\n        return { type: 'sh', hash: from[1] };\n    },\n    decode: (to) => to.type === 'sh' ? ['HASH160', to.hash, 'EQUAL'] : undefined,\n};\nconst OutWSH = {\n    encode(from) {\n        if (from.length !== 2 || from[0] !== 0 || !u.isBytes(from[1]))\n            return;\n        if (from[1].length !== 32)\n            return;\n        return { type: 'wsh', hash: from[1] };\n    },\n    decode: (to) => (to.type === 'wsh' ? [0, to.hash] : undefined),\n};\nconst OutWPKH = {\n    encode(from) {\n        if (from.length !== 2 || from[0] !== 0 || !u.isBytes(from[1]))\n            return;\n        if (from[1].length !== 20)\n            return;\n        return { type: 'wpkh', hash: from[1] };\n    },\n    decode: (to) => (to.type === 'wpkh' ? [0, to.hash] : undefined),\n};\nconst OutMS = {\n    encode(from) {\n        const last = from.length - 1;\n        if (from[last] !== 'CHECKMULTISIG')\n            return;\n        const m = from[0];\n        const n = from[last - 1];\n        if (typeof m !== 'number' || typeof n !== 'number')\n            return;\n        const pubkeys = from.slice(1, -2);\n        if (n !== pubkeys.length)\n            return;\n        for (const pub of pubkeys)\n            if (!u.isBytes(pub))\n                return;\n        return { type: 'ms', m, pubkeys: pubkeys }; // we don't need n, since it is the same as pubkeys\n    },\n    // checkmultisig(n, ..pubkeys, m)\n    decode: (to) => to.type === 'ms' ? [to.m, ...to.pubkeys, to.pubkeys.length, 'CHECKMULTISIG'] : undefined,\n};\nconst OutTR = {\n    encode(from) {\n        if (from.length !== 2 || from[0] !== 1 || !u.isBytes(from[1]))\n            return;\n        return { type: 'tr', pubkey: from[1] };\n    },\n    decode: (to) => (to.type === 'tr' ? [1, to.pubkey] : undefined),\n};\nconst OutTRNS = {\n    encode(from) {\n        const last = from.length - 1;\n        if (from[last] !== 'CHECKSIG')\n            return;\n        const pubkeys = [];\n        // On error return, since it can be different script\n        for (let i = 0; i < last; i++) {\n            const elm = from[i];\n            if (i & 1) {\n                if (elm !== 'CHECKSIGVERIFY' || i === last - 1)\n                    return;\n                continue;\n            }\n            if (!u.isBytes(elm))\n                return;\n            pubkeys.push(elm);\n        }\n        return { type: 'tr_ns', pubkeys };\n    },\n    decode: (to) => {\n        if (to.type !== 'tr_ns')\n            return;\n        const out = [];\n        for (let i = 0; i < to.pubkeys.length - 1; i++)\n            out.push(to.pubkeys[i], 'CHECKSIGVERIFY');\n        out.push(to.pubkeys[to.pubkeys.length - 1], 'CHECKSIG');\n        return out;\n    },\n};\nconst OutTRMS = {\n    encode(from) {\n        const last = from.length - 1;\n        if (from[last] !== 'NUMEQUAL' || from[1] !== 'CHECKSIG')\n            return;\n        const pubkeys = [];\n        const m = OpToNum(from[last - 1]);\n        if (typeof m !== 'number')\n            return;\n        for (let i = 0; i < last - 1; i++) {\n            const elm = from[i];\n            if (i & 1) {\n                if (elm !== (i === 1 ? 'CHECKSIG' : 'CHECKSIGADD'))\n                    throw new Error('OutScript.encode/tr_ms: wrong element');\n                continue;\n            }\n            if (!u.isBytes(elm))\n                throw new Error('OutScript.encode/tr_ms: wrong key element');\n            pubkeys.push(elm);\n        }\n        return { type: 'tr_ms', pubkeys, m };\n    },\n    decode: (to) => {\n        if (to.type !== 'tr_ms')\n            return;\n        const out = [to.pubkeys[0], 'CHECKSIG'];\n        for (let i = 1; i < to.pubkeys.length; i++)\n            out.push(to.pubkeys[i], 'CHECKSIGADD');\n        out.push(to.m, 'NUMEQUAL');\n        return out;\n    },\n};\nconst OutUnknown = {\n    encode(from) {\n        return { type: 'unknown', script: Script.encode(from) };\n    },\n    decode: (to) => to.type === 'unknown' ? Script.decode(to.script) : undefined,\n};\n// /Payments\nconst OutScripts = [\n    OutP2A,\n    OutPK,\n    OutPKH,\n    OutSH,\n    OutWSH,\n    OutWPKH,\n    OutMS,\n    OutTR,\n    OutTRNS,\n    OutTRMS,\n    OutUnknown,\n];\n// TODO: we can support user supplied output scripts now\n// - addOutScript\n// - removeOutScript\n// - We can do that as log we modify array in-place\n// - Actually is very hard, since there is sign/finalize logic\nconst _OutScript = P.apply(Script, P.coders.match(OutScripts));\n// We can validate this once, because of packed & coders\nexport const OutScript = P.validate(_OutScript, (i) => {\n    if (i.type === 'pk' && !isValidPubkey(i.pubkey, u.PubT.ecdsa))\n        throw new Error('OutScript/pk: wrong key');\n    if ((i.type === 'pkh' || i.type === 'sh' || i.type === 'wpkh') &&\n        (!u.isBytes(i.hash) || i.hash.length !== 20))\n        throw new Error(`OutScript/${i.type}: wrong hash`);\n    if (i.type === 'wsh' && (!u.isBytes(i.hash) || i.hash.length !== 32))\n        throw new Error(`OutScript/wsh: wrong hash`);\n    if (i.type === 'tr' && (!u.isBytes(i.pubkey) || !isValidPubkey(i.pubkey, u.PubT.schnorr)))\n        throw new Error('OutScript/tr: wrong taproot public key');\n    if (i.type === 'ms' || i.type === 'tr_ns' || i.type === 'tr_ms')\n        if (!Array.isArray(i.pubkeys))\n            throw new Error('OutScript/multisig: wrong pubkeys array');\n    if (i.type === 'ms') {\n        const n = i.pubkeys.length;\n        for (const p of i.pubkeys)\n            if (!isValidPubkey(p, u.PubT.ecdsa))\n                throw new Error('OutScript/multisig: wrong pubkey');\n        if (i.m <= 0 || n > 16 || i.m > n)\n            throw new Error('OutScript/multisig: invalid params');\n    }\n    if (i.type === 'tr_ns' || i.type === 'tr_ms') {\n        for (const p of i.pubkeys)\n            if (!isValidPubkey(p, u.PubT.schnorr))\n                throw new Error(`OutScript/${i.type}: wrong pubkey`);\n    }\n    if (i.type === 'tr_ms') {\n        const n = i.pubkeys.length;\n        if (i.m <= 0 || n > 999 || i.m > n)\n            throw new Error('OutScript/tr_ms: invalid params');\n    }\n    return i;\n});\n// Basic sanity check for scripts\nfunction checkWSH(s, witnessScript) {\n    if (!u.equalBytes(s.hash, u.sha256(witnessScript)))\n        throw new Error('checkScript: wsh wrong witnessScript hash');\n    const w = OutScript.decode(witnessScript);\n    if (w.type === 'tr' || w.type === 'tr_ns' || w.type === 'tr_ms')\n        throw new Error(`checkScript: P2${w.type} cannot be wrapped in P2SH`);\n    if (w.type === 'wpkh' || w.type === 'sh')\n        throw new Error(`checkScript: P2${w.type} cannot be wrapped in P2WSH`);\n}\nexport function checkScript(script, redeemScript, witnessScript) {\n    if (script) {\n        const s = OutScript.decode(script);\n        // ms||pk maybe work, but there will be no address, hard to spend\n        if (s.type === 'tr_ns' || s.type === 'tr_ms' || s.type === 'ms' || s.type == 'pk')\n            throw new Error(`checkScript: non-wrapped ${s.type}`);\n        if (s.type === 'sh' && redeemScript) {\n            if (!u.equalBytes(s.hash, u.hash160(redeemScript)))\n                throw new Error('checkScript: sh wrong redeemScript hash');\n            const r = OutScript.decode(redeemScript);\n            if (r.type === 'tr' || r.type === 'tr_ns' || r.type === 'tr_ms')\n                throw new Error(`checkScript: P2${r.type} cannot be wrapped in P2SH`);\n            // Not sure if this unspendable, but we cannot represent this via PSBT\n            if (r.type === 'sh')\n                throw new Error('checkScript: P2SH cannot be wrapped in P2SH');\n        }\n        if (s.type === 'wsh' && witnessScript)\n            checkWSH(s, witnessScript);\n    }\n    if (redeemScript) {\n        const r = OutScript.decode(redeemScript);\n        if (r.type === 'wsh' && witnessScript)\n            checkWSH(r, witnessScript);\n    }\n}\nfunction uniqPubkey(pubkeys) {\n    const map = {};\n    for (const pub of pubkeys) {\n        const key = hex.encode(pub);\n        if (map[key])\n            throw new Error(`Multisig: non-uniq pubkey: ${pubkeys.map(hex.encode)}`);\n        map[key] = true;\n    }\n}\nexport const p2pk = (pubkey, _network = NETWORK) => {\n    // network is unused\n    if (!isValidPubkey(pubkey, u.PubT.ecdsa))\n        throw new Error('P2PK: invalid publicKey');\n    return { type: 'pk', script: OutScript.encode({ type: 'pk', pubkey }) };\n};\nexport const p2pkh = (publicKey, network = NETWORK) => {\n    if (!isValidPubkey(publicKey, u.PubT.ecdsa))\n        throw new Error('P2PKH: invalid publicKey');\n    const hash = u.hash160(publicKey);\n    return {\n        type: 'pkh',\n        script: OutScript.encode({ type: 'pkh', hash }),\n        address: Address(network).encode({ type: 'pkh', hash }),\n        hash,\n    };\n};\nexport const p2sh = (child, network = NETWORK) => {\n    // It is already tested inside noble-hashes and checkScript\n    const cs = child.script;\n    if (!u.isBytes(cs))\n        throw new Error(`Wrong script: ${typeof child.script}, expected Uint8Array`);\n    const hash = u.hash160(cs);\n    const script = OutScript.encode({ type: 'sh', hash });\n    checkScript(script, cs, child.witnessScript);\n    if (child.witnessScript) {\n        return {\n            type: 'sh',\n            redeemScript: cs,\n            script: OutScript.encode({ type: 'sh', hash }),\n            address: Address(network).encode({ type: 'sh', hash }),\n            hash,\n            witnessScript: child.witnessScript,\n        };\n    }\n    else {\n        return {\n            type: 'sh',\n            redeemScript: cs,\n            script: OutScript.encode({ type: 'sh', hash }),\n            address: Address(network).encode({ type: 'sh', hash }),\n            hash,\n        };\n    }\n};\nexport const p2wsh = (child, network = NETWORK) => {\n    const cs = child.script;\n    if (!u.isBytes(cs))\n        throw new Error(`Wrong script: ${typeof cs}, expected Uint8Array`);\n    const hash = u.sha256(cs);\n    const script = OutScript.encode({ type: 'wsh', hash });\n    checkScript(script, undefined, cs);\n    return {\n        type: 'wsh',\n        witnessScript: cs,\n        script: OutScript.encode({ type: 'wsh', hash }),\n        address: Address(network).encode({ type: 'wsh', hash }),\n        hash,\n    };\n};\nexport const p2wpkh = (publicKey, network = NETWORK) => {\n    if (!isValidPubkey(publicKey, u.PubT.ecdsa))\n        throw new Error('P2WPKH: invalid publicKey');\n    if (publicKey.length === 65)\n        throw new Error('P2WPKH: uncompressed public key');\n    const hash = u.hash160(publicKey);\n    return {\n        type: 'wpkh',\n        script: OutScript.encode({ type: 'wpkh', hash }),\n        address: Address(network).encode({ type: 'wpkh', hash }),\n        hash,\n    };\n};\nexport const p2ms = (m, pubkeys, allowSamePubkeys = false) => {\n    if (!allowSamePubkeys)\n        uniqPubkey(pubkeys);\n    return {\n        type: 'ms',\n        script: OutScript.encode({ type: 'ms', pubkeys, m }),\n    };\n};\nfunction checkTaprootScript(script, internalPubKey, allowUnknownOutputs = false, customScripts) {\n    const out = OutScript.decode(script);\n    if (out.type === 'unknown') {\n        // NOTE: this check should be before allowUnknownOutputs, otherwise it will\n        // disable custom. All custom scripts for taproot should have prefix 'tr_'\n        if (customScripts) {\n            const cs = P.apply(Script, P.coders.match(customScripts));\n            const c = cs.decode(script);\n            if (c !== undefined) {\n                if (typeof c.type !== 'string' || !c.type.startsWith('tr_'))\n                    throw new Error(`P2TR: invalid custom type=${c.type}`);\n                return;\n            }\n        }\n        if (allowUnknownOutputs)\n            return;\n    }\n    if (!['tr_ns', 'tr_ms'].includes(out.type))\n        throw new Error(`P2TR: invalid leaf script=${out.type}`);\n    const outms = out;\n    if (!allowUnknownOutputs && outms.pubkeys) {\n        for (const p of outms.pubkeys) {\n            if (u.equalBytes(p, u.TAPROOT_UNSPENDABLE_KEY))\n                throw new Error('Unspendable taproot key in leaf script');\n            // It's likely a mistake at this point:\n            // 1. p2tr(A, p2tr_ns(2, [A, B])) == p2tr(A, p2tr_pk(B)) (A or B key)\n            // but will take more space and fees.\n            // 2. For multi-sig p2tr(A, p2tr_ns(2, [A, B, C])) it's probably a security issue:\n            // User creates 2 of 3 multisig of keys [A, B, C],\n            // but key A always can spend whole output without signatures from other keys.\n            // p2tr(A, p2tr_ns(2, [B, C, D])) is ok: A or (B and C) or (B and D) or (C and D)\n            if (u.equalBytes(p, internalPubKey)) {\n                throw new Error('Using P2TR with leaf script with same key as internal key is not supported');\n            }\n        }\n    }\n}\n// Helper for generating binary tree from list, with weights\nexport function taprootListToTree(taprootList) {\n    // Clone input in order to not corrupt it\n    const lst = Array.from(taprootList);\n    // We have at least 2 elements => can create branch\n    while (lst.length >= 2) {\n        // Sort: elements with smallest weight are in the end of queue\n        lst.sort((a, b) => (b.weight || 1) - (a.weight || 1));\n        const b = lst.pop();\n        const a = lst.pop();\n        const weight = (a?.weight || 1) + (b?.weight || 1);\n        lst.push({\n            weight,\n            // Unwrap children array\n            // TODO: Very hard to remove any here\n            childs: [a?.childs || a, b?.childs || b],\n        });\n    }\n    // At this point there is always 1 element in lst\n    const last = lst[0];\n    return (last?.childs || last);\n}\nfunction taprootAddPath(tree, path = []) {\n    if (!tree)\n        throw new Error(`taprootAddPath: empty tree`);\n    if (tree.type === 'leaf')\n        return { ...tree, path };\n    if (tree.type !== 'branch')\n        throw new Error(`taprootAddPath: wrong type=${tree}`);\n    return {\n        ...tree,\n        path,\n        // Left element has right hash in path and otherwise\n        left: taprootAddPath(tree.left, [tree.right.hash, ...path]),\n        right: taprootAddPath(tree.right, [tree.left.hash, ...path]),\n    };\n}\nfunction taprootWalkTree(tree) {\n    if (!tree)\n        throw new Error(`taprootAddPath: empty tree`);\n    if (tree.type === 'leaf')\n        return [tree];\n    if (tree.type !== 'branch')\n        throw new Error(`taprootWalkTree: wrong type=${tree}`);\n    return [...taprootWalkTree(tree.left), ...taprootWalkTree(tree.right)];\n}\nfunction taprootHashTree(tree, internalPubKey, allowUnknownOutputs = false, customScripts) {\n    if (!tree)\n        throw new Error('taprootHashTree: empty tree');\n    if (Array.isArray(tree) && tree.length === 1)\n        tree = tree[0];\n    // Terminal node (leaf)\n    if (!Array.isArray(tree)) {\n        const { leafVersion: version, script: leafScript } = tree;\n        // Earliest tree walk where we can validate tapScripts\n        if (tree.tapLeafScript || (tree.tapMerkleRoot && !u.equalBytes(tree.tapMerkleRoot, P.EMPTY)))\n            throw new Error('P2TR: tapRoot leafScript cannot have tree');\n        const script = typeof leafScript === 'string' ? hex.decode(leafScript) : leafScript;\n        if (!u.isBytes(script))\n            throw new Error(`checkScript: wrong script type=${script}`);\n        checkTaprootScript(script, internalPubKey, allowUnknownOutputs, customScripts);\n        return {\n            type: 'leaf',\n            version,\n            script,\n            hash: tapLeafHash(script, version),\n        };\n    }\n    // If tree / branch is not binary tree, convert it\n    if (tree.length !== 2)\n        tree = taprootListToTree(tree);\n    if (tree.length !== 2)\n        throw new Error('hashTree: non binary tree!');\n    // branch\n    // Both nodes should exist\n    const left = taprootHashTree(tree[0], internalPubKey, allowUnknownOutputs, customScripts);\n    const right = taprootHashTree(tree[1], internalPubKey, allowUnknownOutputs, customScripts);\n    // We cannot swap left/right here, since it will change structure of tree\n    let [lH, rH] = [left.hash, right.hash];\n    if (u.compareBytes(rH, lH) === -1)\n        [lH, rH] = [rH, lH];\n    return { type: 'branch', left, right, hash: u.tagSchnorr('TapBranch', lH, rH) };\n}\nexport const TAP_LEAF_VERSION = 0xc0;\nexport const tapLeafHash = (script, version = TAP_LEAF_VERSION) => u.tagSchnorr('TapLeaf', new Uint8Array([version]), VarBytes.encode(script));\nexport function p2tr(internalPubKey, tree, network = NETWORK, allowUnknownOutputs = false, customScripts) {\n    // Unspendable\n    if (!internalPubKey && !tree)\n        throw new Error('p2tr: should have pubKey or scriptTree (or both)');\n    const pubKey = typeof internalPubKey === 'string'\n        ? hex.decode(internalPubKey)\n        : internalPubKey || u.TAPROOT_UNSPENDABLE_KEY;\n    if (!isValidPubkey(pubKey, u.PubT.schnorr))\n        throw new Error('p2tr: non-schnorr pubkey');\n    if (tree) {\n        let hashedTree = taprootAddPath(taprootHashTree(tree, pubKey, allowUnknownOutputs, customScripts));\n        const tapMerkleRoot = hashedTree.hash;\n        const [tweakedPubkey, parity] = u.taprootTweakPubkey(pubKey, tapMerkleRoot);\n        const leaves = taprootWalkTree(hashedTree).map((l) => ({\n            ...l,\n            controlBlock: TaprootControlBlock.encode({\n                version: (l.version || TAP_LEAF_VERSION) + parity,\n                internalKey: pubKey,\n                merklePath: l.path,\n            }),\n        }));\n        return {\n            type: 'tr',\n            script: OutScript.encode({ type: 'tr', pubkey: tweakedPubkey }),\n            address: Address(network).encode({ type: 'tr', pubkey: tweakedPubkey }),\n            // For tests\n            tweakedPubkey,\n            // PSBT stuff\n            tapInternalKey: pubKey,\n            leaves,\n            tapLeafScript: leaves.map((l) => [\n                TaprootControlBlock.decode(l.controlBlock),\n                u.concatBytes(l.script, new Uint8Array([l.version || TAP_LEAF_VERSION])),\n            ]),\n            tapMerkleRoot,\n        };\n    }\n    else {\n        const tweakedPubkey = u.taprootTweakPubkey(pubKey, P.EMPTY)[0];\n        return {\n            type: 'tr',\n            script: OutScript.encode({ type: 'tr', pubkey: tweakedPubkey }),\n            address: Address(network).encode({ type: 'tr', pubkey: tweakedPubkey }),\n            // For tests\n            tweakedPubkey,\n            // PSBT stuff\n            tapInternalKey: pubKey,\n        };\n    }\n}\n// Returns all combinations of size M from lst\nexport function combinations(m, list) {\n    const res = [];\n    if (!Array.isArray(list))\n        throw new Error('combinations: lst arg should be array');\n    const n = list.length;\n    if (m > n)\n        throw new Error('combinations: m > lst.length, no combinations possible');\n    /*\n    Basically works as M nested loops like:\n    for (;idx[0]<lst.length;idx[0]++) for (idx[1]=idx[0]+1;idx[1]<lst.length;idx[1]++)\n    but since we cannot create nested loops dynamically, we unroll it to a single loop\n    */\n    const idx = Array.from({ length: m }, (_, i) => i);\n    const last = idx.length - 1;\n    main: for (;;) {\n        res.push(idx.map((i) => list[i]));\n        idx[last] += 1;\n        let i = last;\n        // Propagate increment\n        // idx[i] cannot be bigger than n-m+i, otherwise last elements in right part will overflow\n        for (; i >= 0 && idx[i] > n - m + i; i--) {\n            idx[i] = 0;\n            // Overflow in idx[0], break\n            if (i === 0)\n                break main;\n            idx[i - 1] += 1;\n        }\n        // Propagate: idx[i+1] = idx[idx]+1\n        for (i += 1; i < idx.length; i++)\n            idx[i] = idx[i - 1] + 1;\n    }\n    return res;\n}\nexport const p2tr_ns = (m, pubkeys, allowSamePubkeys = false) => {\n    if (!allowSamePubkeys)\n        uniqPubkey(pubkeys);\n    return combinations(m, pubkeys).map((i) => ({\n        type: 'tr_ns',\n        script: OutScript.encode({ type: 'tr_ns', pubkeys: i }),\n    }));\n};\nexport const p2tr_pk = (pubkey) => p2tr_ns(1, [pubkey], undefined)[0];\nexport function p2tr_ms(m, pubkeys, allowSamePubkeys = false) {\n    if (!allowSamePubkeys)\n        uniqPubkey(pubkeys);\n    return {\n        type: 'tr_ms',\n        script: OutScript.encode({ type: 'tr_ms', pubkeys, m }),\n    };\n}\n// Simple pubkey address, without complex scripts\nexport function getAddress(type, privKey, network = NETWORK) {\n    if (type === 'tr') {\n        return p2tr(u.pubSchnorr(privKey), undefined, network).address;\n    }\n    const pubKey = u.pubECDSA(privKey);\n    if (type === 'pkh')\n        return p2pkh(pubKey, network).address;\n    if (type === 'wpkh')\n        return p2wpkh(pubKey, network).address;\n    throw new Error(`getAddress: unknown type=${type}`);\n}\nexport const _sortPubkeys = (pubkeys) => Array.from(pubkeys).sort(u.compareBytes);\nexport function multisig(m, pubkeys, sorted = false, witness = false, network = NETWORK) {\n    const ms = p2ms(m, sorted ? _sortPubkeys(pubkeys) : pubkeys);\n    return witness ? p2wsh(ms, network) : p2sh(ms, network);\n}\nexport function sortedMultisig(m, pubkeys, witness = false, network = NETWORK) {\n    return multisig(m, pubkeys, true, witness, network);\n}\nconst base58check = createBase58check(u.sha256);\nfunction validateWitness(version, data) {\n    if (data.length < 2 || data.length > 40)\n        throw new Error('Witness: invalid length');\n    if (version > 16)\n        throw new Error('Witness: invalid version');\n    if (version === 0 && !(data.length === 20 || data.length === 32))\n        throw new Error('Witness: invalid length for version');\n}\nfunction programToWitness(version, data, network = NETWORK) {\n    validateWitness(version, data);\n    const coder = version === 0 ? bech32 : bech32m;\n    return coder.encode(network.bech32, [version].concat(coder.toWords(data)));\n}\nfunction formatKey(hashed, prefix) {\n    return base58check.encode(u.concatBytes(Uint8Array.from(prefix), hashed));\n}\nexport function WIF(network = NETWORK) {\n    return {\n        encode(privKey) {\n            const compressed = u.concatBytes(privKey, new Uint8Array([0x01]));\n            return formatKey(compressed.subarray(0, 33), [network.wif]);\n        },\n        decode(wif) {\n            let parsed = base58check.decode(wif);\n            if (parsed[0] !== network.wif)\n                throw new Error('Wrong WIF prefix');\n            parsed = parsed.subarray(1);\n            // Check what it is. Compressed flag?\n            if (parsed.length !== 33)\n                throw new Error('Wrong WIF length');\n            if (parsed[32] !== 0x01)\n                throw new Error('Wrong WIF postfix');\n            return parsed.subarray(0, -1);\n        },\n    };\n}\n// Returns OutType, which can be used to create outscript\nexport function Address(network = NETWORK) {\n    return {\n        encode(from) {\n            const { type } = from;\n            if (type === 'wpkh')\n                return programToWitness(0, from.hash, network);\n            else if (type === 'wsh')\n                return programToWitness(0, from.hash, network);\n            else if (type === 'tr')\n                return programToWitness(1, from.pubkey, network);\n            else if (type === 'pkh')\n                return formatKey(from.hash, [network.pubKeyHash]);\n            else if (type === 'sh')\n                return formatKey(from.hash, [network.scriptHash]);\n            throw new Error(`Unknown address type=${type}`);\n        },\n        decode(address) {\n            if (address.length < 14 || address.length > 74)\n                throw new Error('Invalid address length');\n            // Bech32\n            if (network.bech32 && address.toLowerCase().startsWith(`${network.bech32}1`)) {\n                let res;\n                try {\n                    res = bech32.decode(address);\n                    if (res.words[0] !== 0)\n                        throw new Error(`bech32: wrong version=${res.words[0]}`);\n                }\n                catch (_) {\n                    // Starting from version 1 it is decoded as bech32m\n                    res = bech32m.decode(address);\n                    if (res.words[0] === 0)\n                        throw new Error(`bech32m: wrong version=${res.words[0]}`);\n                }\n                if (res.prefix !== network.bech32)\n                    throw new Error(`wrong bech32 prefix=${res.prefix}`);\n                const [version, ...program] = res.words;\n                const data = bech32.fromWords(program);\n                validateWitness(version, data);\n                if (version === 0 && data.length === 32)\n                    return { type: 'wsh', hash: data };\n                else if (version === 0 && data.length === 20)\n                    return { type: 'wpkh', hash: data };\n                else if (version === 1 && data.length === 32)\n                    return { type: 'tr', pubkey: data };\n                else\n                    throw new Error('Unknown witness program');\n            }\n            const data = base58check.decode(address);\n            if (data.length !== 21)\n                throw new Error('Invalid base58 address');\n            // Pay To Public Key Hash\n            if (data[0] === network.pubKeyHash) {\n                return { type: 'pkh', hash: data.slice(1) };\n            }\n            else if (data[0] === network.scriptHash) {\n                return {\n                    type: 'sh',\n                    hash: data.slice(1),\n                };\n            }\n            throw new Error(`Invalid address prefix=${data[0]}`);\n        },\n    };\n}\n//# sourceMappingURL=payment.js.map","import * as btc from \"@scure/btc-signer\"\nimport { checkNever } from \"./misc\"\n\nexport type BitcoinNetwork = typeof btc.NETWORK\n\nexport function getBitcoinNetwork(\n  network: \"mainnet\" | \"testnet\",\n): BitcoinNetwork {\n  if (network === \"mainnet\") return btc.NETWORK\n  if (network === \"testnet\") return btc.TEST_NETWORK\n  checkNever(network as never)\n  return btc.NETWORK\n}\n\nexport function isMainnet(network: BitcoinNetwork): boolean {\n  return network.bech32 === \"bc\"\n}\n","import { hex } from \"@scure/base\"\nimport * as btc from \"@scure/btc-signer\"\nimport { Address, OutScript } from \"@scure/btc-signer\"\nimport { BitcoinNetwork, isMainnet } from \"./bitcoinNetworkHelpers\"\n\nexport type AddressTypeKnown = \"p2pkh\" | \"p2sh\" | \"p2wpkh\" | \"p2wsh\" | \"p2tr\"\nexport type AddressType = AddressTypeKnown | \"unknown\"\n\nexport function getAddressType(\n  network: BitcoinNetwork,\n  address: string,\n): AddressType {\n  if (isP2PKHAddress(network, address)) {\n    return \"p2pkh\"\n  } else if (isP2SHAddress(network, address)) {\n    return \"p2sh\"\n  } else if (isP2WPKHAddress(network, address)) {\n    return \"p2wpkh\"\n  } else if (isP2WSHAddress(network, address)) {\n    return \"p2wsh\"\n  } else if (isP2TRAddress(network, address)) {\n    return \"p2tr\"\n  } else {\n    return \"unknown\"\n  }\n}\n\nexport function isP2PKHAddress(\n  network: BitcoinNetwork,\n  address: string,\n): boolean {\n  if (isMainnet(network)) {\n    return address.startsWith(\"1\")\n  } else {\n    return address.startsWith(\"m\") || address.startsWith(\"n\")\n  }\n}\n\nexport function isP2SHAddress(\n  network: BitcoinNetwork,\n  address: string,\n): boolean {\n  if (isMainnet(network)) {\n    return address.startsWith(\"3\")\n  } else {\n    return address.startsWith(\"2\")\n  }\n}\n\nexport function isP2WPKHAddress(\n  network: BitcoinNetwork,\n  address: string,\n): boolean {\n  if (isMainnet(network)) {\n    return address.startsWith(\"bc1q\")\n  } else {\n    return address.startsWith(\"tb1q\")\n  }\n}\n\nexport function isP2TRAddress(\n  network: BitcoinNetwork,\n  address: string,\n): boolean {\n  if (isMainnet(network)) {\n    return address.startsWith(\"bc1p\")\n  } else {\n    return address.startsWith(\"tb1p\")\n  }\n}\n\nexport function isP2WSHAddress(\n  network: BitcoinNetwork,\n  address: string,\n): boolean {\n  if (isP2TRAddress(network, address)) {\n    return false\n  }\n  if (isP2WPKHAddress(network, address)) {\n    return false\n  }\n\n  if (isMainnet(network)) {\n    return address.startsWith(\"bc1\")\n  } else {\n    return address.startsWith(\"tb1\")\n  }\n}\n\nexport function getP2TRInternalPublicKey(\n  network: BitcoinNetwork,\n  publicKey: Uint8Array,\n): Uint8Array {\n  const ecdsaPublicKeyLength = 33\n  if (publicKey.byteLength !== ecdsaPublicKeyLength) {\n    throw new Error(\"Invalid public key length\")\n  }\n  return publicKey.slice(1)\n}\n\nexport function getTapInternalKeyOf_P2TR_publicKey(\n  network: BitcoinNetwork,\n  publicKey: Uint8Array,\n): Uint8Array {\n  return btc.p2tr(\n    getP2TRInternalPublicKey(network, publicKey),\n    undefined,\n    network,\n  ).tapInternalKey\n}\n\nexport function getRedeemScriptOf_P2SH_P2WPKH_publicKey(\n  network: BitcoinNetwork,\n  publicKey: Uint8Array,\n): Uint8Array {\n  return btc.p2sh(btc.p2wpkh(publicKey, network), network).redeemScript!\n}\n\nexport function addressToScriptPubKey(\n  network: BitcoinNetwork,\n  address: string,\n): Uint8Array {\n  const addr = Address(network).decode(address)\n  return OutScript.encode(addr)\n}\n\nexport function addressToScriptPubKeyHex(\n  network: BitcoinNetwork,\n  address: string,\n): string {\n  return hex.encode(addressToScriptPubKey(network, address))\n}\n","import { hex } from \"@scure/base\"\nimport { Script } from \"@scure/btc-signer\"\nimport {\n  addressToScriptPubKeyHex,\n  getAddressType,\n} from \"../utils/bitcoinAddressHelpers\"\nimport { BitcoinNetwork, isMainnet } from \"../utils/bitcoinNetworkHelpers\"\nimport { BitcoinWalletAdapterError } from \"../utils/error\"\nimport { checkNever } from \"../utils/misc\"\nimport {\n  SignMessageResult,\n  WalletAdapter,\n  WalletAdapter_onAddressesChanged_callback,\n  WalletAdapterAddress,\n  WalletAdapterAddressPurpose,\n  WalletAdapterAddressType,\n  WalletAdapterBitcoinNetwork,\n} from \"../WalletAdapters.types\"\n\nconst randomTapInternalKey =\n  \"0000000000000000000000000000000000000000000000000000000000000000\"\n\nconst randomPublicKey =\n  \"0000000000000000000000000000000000000000000000000000000000000000\"\n\nconst randomRedeemScript = hex.encode(\n  Script.encode([\"OP_1\", hex.decode(randomPublicKey), \"OP_1\", \"CHECKMULTISIG\"]),\n)\n\nexport class MockAddressWalletAdapter implements WalletAdapter {\n  constructor(\n    private network: BitcoinNetwork,\n    private inner: WalletAdapter,\n    private addresses: Partial<{\n      bitcoin: Partial<WalletAdapterAddress> & { address: string }\n      ordinals: Partial<WalletAdapterAddress> & { address: string }\n    }>,\n  ) {}\n\n  async connect(): Promise<void> {\n    await this.inner.connect()\n  }\n\n  async disconnect(): Promise<void> {\n    await this.inner.disconnect()\n  }\n\n  async getAddresses(): Promise<WalletAdapterAddress[]> {\n    const addresses = await this.inner.getAddresses()\n\n    const getWalletAdapterAddress = (\n      addressName: string,\n      info: {\n        address: string\n        purposes: WalletAdapterAddressPurpose[]\n      },\n    ): WalletAdapterAddress => {\n      const addrType = getAddressType(this.network, info.address)\n\n      // prettier-ignore\n      const addressType =\n        addrType === \"p2tr\" ? WalletAdapterAddressType.P2TR :\n        addrType === \"p2sh\" ? WalletAdapterAddressType.P2SH_P2WPKH :\n        addrType === \"p2wpkh\" ? WalletAdapterAddressType.P2WPKH :\n        addrType === 'p2pkh' ? WalletAdapterAddressType.P2PKH :\n        addrType === 'p2wsh' ? undefined /* unsupported */ :\n        addrType === 'unknown' ? undefined :\n        (checkNever(addrType), undefined)\n\n      if (addressType == null) {\n        throw new BitcoinWalletAdapterError(\n          `[MockAddressWalletAdapter] Please provide a supported ${addressName} address`,\n        )\n      }\n\n      return {\n        network: isMainnet(this.network)\n          ? WalletAdapterBitcoinNetwork.MAINNET\n          : WalletAdapterBitcoinNetwork.TESTNET,\n        purposes: info.purposes,\n        addressType,\n        address: info.address,\n        scriptPubKey: addressToScriptPubKeyHex(this.network, info.address),\n        publicKey: randomPublicKey,\n        redeemScript: randomRedeemScript,\n        tapInternalKey: randomTapInternalKey,\n      }\n    }\n\n    let bitcoinAddress: undefined | WalletAdapterAddress\n    let ordinalsAddress: undefined | WalletAdapterAddress\n\n    if (this.addresses.bitcoin != null) {\n      bitcoinAddress = getWalletAdapterAddress(\"bitcoin\", {\n        ...this.addresses.bitcoin,\n        purposes: [WalletAdapterAddressPurpose.Bitcoin],\n      })\n    }\n\n    if (this.addresses.ordinals != null) {\n      ordinalsAddress = getWalletAdapterAddress(\"ordinals\", {\n        ...this.addresses.ordinals,\n        purposes: [\n          WalletAdapterAddressPurpose.Ordinals,\n          WalletAdapterAddressPurpose.BRC20,\n          WalletAdapterAddressPurpose.Runes,\n        ],\n      })\n    }\n\n    return addresses.flatMap(a => {\n      const result: WalletAdapterAddress[] = []\n      let restPurposes = a.purposes\n\n      if (\n        bitcoinAddress != null &&\n        restPurposes.includes(WalletAdapterAddressPurpose.Bitcoin)\n      ) {\n        result.push(bitcoinAddress)\n        restPurposes = restPurposes.filter(\n          p => p !== WalletAdapterAddressPurpose.Bitcoin,\n        )\n      }\n\n      if (\n        ordinalsAddress != null &&\n        restPurposes.includes(WalletAdapterAddressPurpose.Ordinals)\n      ) {\n        result.push(ordinalsAddress)\n        restPurposes = restPurposes.filter(\n          p => p !== WalletAdapterAddressPurpose.Ordinals,\n        )\n      }\n\n      if (restPurposes.length > 0) {\n        result.push({ ...a, purposes: restPurposes })\n      }\n\n      return result\n    })\n  }\n\n  async signMessage(\n    address: string,\n    message: string,\n  ): Promise<SignMessageResult> {\n    throw new BitcoinWalletAdapterError(\n      `[MockAddressWalletAdapter] it's a mock adapter, can't send inscription`,\n    )\n  }\n\n  get sendBitcoinFeeRateCapability(): \"unavailable\" | \"available\" | \"required\" {\n    return this.inner.sendBitcoinFeeRateCapability\n  }\n\n  get sendInscriptionFeeRateCapability():\n    | \"unavailable\"\n    | \"available\"\n    | \"required\" {\n    return this.inner.sendInscriptionFeeRateCapability\n  }\n\n  sendBitcoin(\n    fromAddress: string,\n    receiverAddress: string,\n    satoshiAmount: bigint,\n  ): Promise<{ txid: string }> {\n    throw new BitcoinWalletAdapterError(\n      `[MockAddressWalletAdapter] it's a mock adapter, can't send bitcoin`,\n    )\n  }\n\n  sendInscription(\n    fromAddress: string,\n    receiverAddress: string,\n    inscriptionId: string,\n  ): Promise<{ txid: string }> {\n    throw new BitcoinWalletAdapterError(\n      `[MockAddressWalletAdapter] it's a mock adapter, can't send inscription`,\n    )\n  }\n\n  signAndFinalizePsbt(psbtHex: string): Promise<{ signedPsbtHex: string }> {\n    throw new BitcoinWalletAdapterError(\n      `[MockAddressWalletAdapter] it's a mock adapter, can't sign transaction`,\n    )\n  }\n\n  onAddressesChanged(_callback: WalletAdapter_onAddressesChanged_callback): {\n    unsubscribe: () => void\n  } {\n    // Mock adapter doesn't support address change events\n    return {\n      unsubscribe: () => {\n        // No-op\n      },\n    }\n  }\n}\n"],"names":["createAvailability","getPrecondition","initializer","pollIntervalMs","cachedAdapter","polling","creating","listeners","stopPolling","emit","adapter","listener","attemptCreate","precondition","error","ensurePolling","adapterId","metadata","m","availability","provider","BitgetWalletAdapterImpl","BitgetWalletAdapter","request","LeatherWalletAdapterImpl","LeatherWalletAdapter","MAGICEDEN_PROVIDER_ID","buildAvailability","network","MagicEdenWalletAdapterImpl","MagicEdenWalletAdapterFactory","OkxWalletAdapterImpl","OkxWalletAdapter","UnisatWalletAdapterImpl","UnisatWalletAdapter","XVERSE_PROVIDER_ID","p","XverseWalletAdapterImpl","XverseWalletAdapter","isBytes","a","abytes","b","isArrayOf","isString","arr","item","afn","input","astr","label","anumber","n","aArr","astrArr","anumArr","chain","args","id","wrap","encode","x","decode","alphabet","letters","lettersA","len","indexes","l","i","digits","letter","join","separator","from","to","padding","bits","chr","data","end","normalize","fn","convertRadix","pos","res","d","dlen","carry","done","digit","fromCarry","digitBase","div","rounded","gcd","radix2carry","powers","convertRadix2","max","mask","pow","radix","num","_256","bytes","radix2","revPadding","unsafeWrapper","checksum","sum","payload","oldChecksum","newChecksum","hasBase64Builtin","decodeBase64Builtin","s","isUrl","re","base64","genBase58","abc","base58","createBase58check","sha256","BECH_ALPHABET","POLYMOD_GENERATORS","bech32Polymod","pre","chk","bechChecksum","prefix","words","encodingConst","c","v","genBech32","encoding","ENCODING_CONST","_words","fromWords","toWords","fromWordsUnsafe","limit","plen","actualLength","lowered","str","slen","sepIndex","decodeUnsafe","decodeToBytes","encodeFromBytes","bech32","bech32m","utf8","hasHexBuiltin","hexBuiltin","hex","title","value","length","needsLen","ofLen","got","ahash","h","aexists","instance","checkFinished","aoutput","out","min","clean","arrays","createView","rotr","word","shift","rotl","hexes","_","bytesToHex","asciis","asciiToBase16","ch","hexToBytes","hl","al","array","ai","hi","n1","n2","char","concatBytes","pad","createHasher","hashCons","info","hashC","msg","opts","tmp","randomBytes","bytesLength","cr","oidNist","suffix","Chi","Maj","HashMD","blockLen","outputLen","padOffset","isLE","view","buffer","take","dataView","oview","outLen","state","finished","destroyed","SHA256_IV","SHA256_K","SHA256_W","SHA2_32B","A","B","C","D","E","F","G","H","offset","W15","W2","s0","s1","sigma1","T1","T2","_SHA256","_0n","_1n","abool","abignumber","isPosBig","numberToHexUnpadded","hexToNumber","bytesToNumberBE","bytesToHex_","bytesToNumberLE","copyBytes","abytes_","numberToBytesBE","hexToBytes_","numberToBytesLE","asciiToBytes","ascii","charCode","inRange","aInRange","bitLen","bitMask","createHmacDrbg","hashLen","qByteLen","hmacFn","u8n","NULL","byte0","byte1","_maxDrbgIters","k","reset","msgs","concatBytes_","reseed","seed","gen","sl","pred","validateObject","object","fields","optFields","checkField","fieldName","expectedType","isOpt","val","current","iter","f","memoized","map","arg","computed","_2n","_3n","_4n","_5n","_7n","_8n","_9n","_16n","mod","result","pow2","power","modulo","invert","number","u","q","r","assertIsSquare","Fp","root","sqrt3mod4","p1div4","sqrt5mod8","p5div8","nv","sqrt9mod16","P","Fp_","Field","tn","tonelliShanks","c1","c2","c3","c4","tv1","tv2","tv3","tv4","e1","e2","e3","Q","S","Z","_Fp","FpLegendre","cc","Q1div2","M","t","R","t_tmp","exponent","FpSqrt","FIELD_FIELDS","validateField","field","initial","FpPow","FpInvertBatch","nums","passZero","inverted","multipliedAcc","acc","invertedAcc","p1mod2","powered","yes","zero","no","nLength","nBitLength","_nBitLength","nByteLength","_Field","ORDER","_nbitLength","lhs","rhs","skipValidation","allowedLengths","BYTES","modFromBytes","padded","scalar","lst","condition","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","mapHashToField","key","fieldLen","minLen","reduced","negateCt","neg","normalizeZ","points","invertedZs","validateW","W","calcWOpts","scalarBits","windows","windowSize","maxNumber","shiftBy","calcOffsets","window","wOpts","wbits","nextN","offsetStart","isZero","isNeg","isNegF","pointPrecomputes","pointWindowSizes","getW","assert0","wNAF","Point","elm","point","base","precomputes","wo","offsetF","transform","comp","prev","mulEndoUnsafe","k1","k2","p1","p2","createField","order","createCurveFields","type","CURVE","curveOpts","FpFnLE","Fn","params","createKeygen","randomSecretKey","getPublicKey","secretKey","_HMAC","hash","buf","oHash","iHash","hmac","message","divNearest","den","_splitEndoScalar","basis","a1","b1","a2","b2","k1neg","k2neg","MAX_NUM","validateSigFormat","format","validateSigOpts","def","optsn","optName","DERErr","DER","tag","dataLen","lenLen","first","isLong","lengthBytes","int","tlv","seqBytes","seqLeftBytes","rBytes","rLeftBytes","sBytes","sLeftBytes","sig","rs","ss","seq","weierstrass","extraOpts","validated","cofactor","CURVE_ORDER","endo","lengths","getWLengths","assertCompressionIsSupported","pointToBytes","_c","isCompressed","y","bx","hasEvenY","pprefix","pointFromBytes","uncomp","head","tail","y2","weierstrassEquation","sqrtError","err","evenY","L","isValidXY","encodePoint","decodePoint","x2","x3","left","right","_4a3","_27b2","acoord","banZero","aprjpoint","other","splitEndoScalarN","toAffineMemo","iz","X","Y","is0","zz","assertValidMemo","finishEndo","endoBeta","k1p","k2p","isLazy","wnaf","X1","Y1","Z1","X2","Y2","Z2","U1","U2","b3","X3","Y3","Z3","t0","t1","t2","t3","t4","t5","fake","mul","k1f","k2f","sc","invertedZ","isTorsionFree","clearCofactor","ecdh","ecdhOpts","randomBytes_","wcRandomBytes","isValidSecretKey","isValidPublicKey","publicKey","publicKeyUncompressed","isProbPub","getSharedSecret","secretKeyA","publicKeyB","utils","keygen","ecdsa","ecdsaOpts","nobleHmac","fnBits","defaultSigOpts","hasLargeCofactor","isBiggerThanHalfOrder","HALF","validateRS","assertSmallCofactor","validateSigLength","size","sizer","Signature","recovery","recid","messageHash","radj","ir","bits2int_modN","u1","u2","rb","sb","bits2int","delta","ORDER_MASK","int2octets","validateMsgAndHash","prehash","prepSig","lowS","extraEntropy","h1int","seedArgs","e","k2sig","kBytes","ik","normS","sign","verify","signature","is","recoverPublicKey","secp256k1_CURVE","secp256k1_ENDO","sqrtMod","_6n","_11n","_22n","_23n","_44n","_88n","b6","b9","b11","b22","b44","b88","b176","b220","b223","Fpk1","Pointk1","secp256k1","TAGGED_HASH_PREFIXES","taggedHash","messages","tagP","tagH","hasEven","schnorrGetExtPubKey","priv","BASE","d_","lift_x","xx","challenge","schnorrGetPublicKey","schnorrSign","auxRand","px","rand","rx","schnorrVerify","pub","schnorr","Rho160","Id160","Pi160","idxLR","j","idxL","idxR","shifts160","shiftsL160","idx","shiftsR160","Kl160","Kr160","ripemd_f","group","z","BUF_160","_RIPEMD160","h0","h1","h2","h3","h4","ar","bl","br","cl","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sr","tl","tr","ripemd160","EMPTY","equalBytes","isPlainObject","obj","isNum","lengthCoder","isCoder","w","byteLen","Path","Bitset","bs","bsLen","chunk","allowRewrite","FULL_MASK","BITS","lastMask","cur","lastPos","last","start","stack","objFn","fieldFn","name","path","parts","objPath","_Reader","parent","parentOffset","baseHex","notRead","formatted","peek","slice","needle","_Writer","buffers","ptr","swapEndianness","checkBounds","signed","signBit","_wrap","inner","validate","isBaseCoder","dict","numberBigint","tsEnum","decimal","precision","round","decimalMask","sep","frac","intS","fracS","fracLen","match","reverse","coder","coders","bigint","le","sized","bLen","U256BE","U64LE","I64LE","intView","validateSigned","maxVal","validateUnsigned","U32LE","U32BE","I32LE","U16LE","U8","createBytes","_length","_isb","tPos","apply","string","createHex","options","innerValue","flag","flagValue","xor","hasFlag","flagged","magic","constant","check","_value","sizeof","struct","tuple","_w","startPos","secp","packedUtils","hash160","sha256x2","pubSchnorr","pubECDSA","hasLowR","signECDSA","privateKey","lowR","counter","signSchnorr","tagSchnorr","PubT","validatePubkey","tapTweak","taprootTweakPrivKey","privKey","merkleRoot","seckey0","seckey","xP","taprootTweakPubkey","pubKey","parity","TAPROOT_UNSPENDABLE_KEY","NETWORK","TEST_NETWORK","compareBytes","reverseObject","OP","OPNames","ScriptNum","bytesLimit","forceMinimal","P.wrap","abs","OpToNum","op","Script","o","P.U16LE","P.U32LE","P.U8","CSLimits","CompactSize","stop","b0","CompactSizeLen","P.apply","P.coders","VarBytes","P.bytes","RawWitness","P.array","BTCArray","RawInput","P.struct","RawOutput","P.U64LE","_RawTx","P.I32LE","P.flag","P.flagged","validateRawTx","tx","RawTx","P.validate","RawOldTx","OutP2A","u.isBytes","isValidPubkey","u.validatePubkey","OutPK","u.PubT","OutPKH","OutSH","OutWSH","OutWPKH","OutMS","pubkeys","OutTR","OutTRNS","OutTRMS","OutUnknown","OutScripts","_OutScript","OutScript","checkWSH","witnessScript","u.equalBytes","u.sha256","checkScript","script","redeemScript","u.hash160","p2sh","child","cs","Address","p2wpkh","TAP_LEAF_VERSION","tapLeafHash","version","u.tagSchnorr","p2tr","internalPubKey","tree","allowUnknownOutputs","customScripts","u.TAPROOT_UNSPENDABLE_KEY","tweakedPubkey","u.taprootTweakPubkey","P.EMPTY","base58check","validateWitness","programToWitness","formatKey","hashed","u.concatBytes","address","program","getBitcoinNetwork","btc.NETWORK","btc.TEST_NETWORK","isMainnet","getAddressType","isP2PKHAddress","isP2SHAddress","isP2WPKHAddress","isP2WSHAddress","isP2TRAddress","getP2TRInternalPublicKey","getTapInternalKeyOf_P2TR_publicKey","btc.p2tr","getRedeemScriptOf_P2SH_P2WPKH_publicKey","btc.p2sh","btc.p2wpkh","addressToScriptPubKey","addr","addressToScriptPubKeyHex","randomTapInternalKey","randomPublicKey","randomRedeemScript","MockAddressWalletAdapter","addresses","getWalletAdapterAddress","addressName","addrType","addressType","WalletAdapterAddressType","BitcoinWalletAdapterError","WalletAdapterBitcoinNetwork","bitcoinAddress","ordinalsAddress","WalletAdapterAddressPurpose","restPurposes","fromAddress","receiverAddress","satoshiAmount","inscriptionId","psbtHex","_callback"],"mappings":"mEAYO,SAASA,GAAyB,CACvC,gBAAAC,EACA,YAAAC,EACA,eAAAC,EAAiB,GACnB,EAIoB,CAClB,IAAIC,EAA0B,KAC1BC,EAAiD,KACjDC,EAAW,GAEf,MAAMC,MAAgB,IAEhBC,EAAc,IAAY,CAC1BH,GAAW,OACb,cAAcA,CAAO,EACrBA,EAAU,KAEd,EAEMI,EAAQC,GAAqB,CACjCN,EAAgBM,EAChB,UAAWC,KAAYJ,EACrBI,EAASD,CAAO,CAEpB,EAEME,EAAgB,SAA2B,CAC/C,GAAIR,GAAiB,MAAQE,EAAU,OACvC,MAAMO,EAAeZ,EAAA,EACrB,GAAIY,GAAgB,KAEpB,CAAAP,EAAW,GACX,GAAI,CACF,MAAMI,EAAU,MAAMR,EAAYW,EAAa,KAAK,EACpDJ,EAAKC,CAAO,EACZF,EAAA,CACF,OAASM,EAAO,CACd,QAAQ,KAAK,+CAAgDA,CAAK,CACpE,QAAA,CACER,EAAW,EACb,EACF,EAEMS,EAAgB,IAAY,CAC5BX,GAAiB,OAEhBQ,EAAA,EACD,EAAAR,GAAiB,MAAQC,GAAW,QAExCA,EAAU,YAAY,IAAM,CACrBO,EAAA,CACP,EAAGT,CAAc,GACnB,EAEA,MAAO,CACL,UAAWQ,GACLP,GAAiB,MACnBO,EAASP,CAAa,EACf,CAAE,YAAa,IAAM,CAAC,CAAA,IAG/BG,EAAU,IAAII,CAAQ,EACtBI,EAAA,EAE+C,CAC7C,YAAa,IAAM,CACjBR,EAAU,OAAOI,CAAQ,EACrBJ,EAAU,OAAS,GACrBC,EAAA,CAEJ,CAAA,EAIJ,CAEJ,CC/EA,MAAMQ,GAAY,iBAKZC,GAAkC,CACtC,KAAM,SACN,QAAS,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,sBAAiB,GAAE,KAAKC,GAAKA,EAAE,OAAO,EACtD,WAAY,2BACZ,YAAa,4CACf,EAEMC,GAAenB,GAGnB,CACA,gBAAiB,IACd,OAAe,SAAS,QAAU,KAC/B,KACA,CAAE,MAAQ,OAAe,QAAQ,MAAA,EACvC,YAAa,MAAMoB,GAAY,CAC7B,KAAM,CAAE,wBAAAC,CAAA,EACN,MAAM,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,wCAA4B,CAAA,EAC3C,OAAO,IAAIA,EAAwBD,CAAQ,CAC7C,CACF,CAAC,EAEYE,GAA0D,CAAA,UACrEN,GAAA,SACAC,GACA,WAAY,IAAME,EACpB,ECpCMH,GAAY,kCAEZC,GAAW,CACf,KAAM,UACN,QAAS,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,uBAAkB,GAAE,KAAKC,GAAKA,EAAE,OAAO,EACvD,WAAY,sBACZ,YAAa,2BACf,EAEMC,GAAenB,GAA6C,CAChE,gBAAiB,IAAM,CACrB,MAAMuB,EAAW,OAAe,iBAAiB,QAGjD,OAAOA,GAAW,KAAO,KAAO,CAAE,MAAOA,CAAA,CAC3C,EACA,YAAa,MAAMA,GAAW,CAC5B,KAAM,CAAE,yBAAAC,CAAA,EACN,MAAM,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,yCAA6B,CAAA,EAC5C,OAAO,IAAIA,EAAyBD,CAAO,CAC7C,CACF,CAAC,EAEYE,GAA2D,CAAA,UACtET,GAAA,SACAC,GACA,WAAY,IAAME,EACpB,EClBaO,GAAwB,oBAG/BC,GAAqBC,GACzB5B,GAA4D,CAC1D,gBAAiB,IAAM,CACrB,MAAMoB,EAAW,OAAO,WAAW,QACnC,OAAOA,GAAU,YAAc,CAAE,MAAOA,GAAa,IACvD,EACA,YAAa,MAAMA,GAAY,CAC7B,KAAM,CAAE,2BAAAS,CAAA,EACN,MAAM,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,2CAA+B,CAAA,EAC9C,OAAO,IAAIA,EAA2BD,EAASR,CAAQ,CACzD,CACF,CAAC,EAEUU,GACXF,GACuC,CACvC,MAAMT,EAAeQ,GAAkBC,CAAO,EAE9C,MAAO,CACL,UAAWF,GAIX,SAAU,CACR,KAAM,aACN,QAAS,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,yBAAoB,GAAE,KAAKR,GAAKA,EAAE,OAAO,EACzD,WAAY,+BACZ,YAAa,sCAAA,EAEf,WAAY,IAAMC,CAAA,CAEtB,EC3CMH,GAAY,oBAEZC,GAAW,CACf,KAAM,aACN,QAAS,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,mBAAc,GAAE,KAAKC,GAAKA,EAAE,OAAO,EACnD,WAAY,wBACZ,YAAa,+BACf,EAEMC,GAAenB,GAGnB,CACA,gBAAiB,IAAM,CACrB,MAAMoB,EAAY,OAAe,WAAW,QAG5C,OAAOA,GAAY,KAAO,KAAO,CAAE,MAAOA,CAAA,CAC5C,EACA,YAAa,MAAMA,GAAY,CAC7B,KAAM,CAAE,qBAAAW,CAAA,EAAyB,MAAM,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,qCAAyB,CAAA,EACvE,OAAO,IAAIA,EAAqBX,CAAe,CACjD,CACF,CAAC,EAEYY,GAAuD,CAAA,UAClEhB,GAAA,SACAC,GACA,WAAY,IAAME,EACpB,ECpBMH,GAAY,SAEZC,GAAkC,CACtC,KAAM,SAIN,QAAS,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,sBAAiB,GAAE,KAAKC,GAAKA,EAAE,OAAO,EACtD,WAAY,qBACZ,YAAa,4BACf,EAEMC,GAAenB,GAGnB,CACA,gBAAiB,IAAM,CACrB,MAAMoB,EAAY,OAAe,OAGjC,OAAOA,GAAY,KAAO,KAAO,CAAE,MAAOA,CAAA,CAC5C,EACA,YAAa,MAAMA,GAAY,CAC7B,KAAM,CAAE,wBAAAa,CAAA,EACN,MAAM,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,wCAA4B,CAAA,EAC3C,OAAO,IAAIA,EAAwBb,CAAQ,CAC7C,CACF,CAAC,EAEYc,GAA0D,CACrE,UAAAlB,GAAA,SACAC,GACA,WAAY,IAAME,EACpB,EC3CagB,GAAqB,kCAE5BlB,GAAW,CACf,KAAM,SACN,QAAS,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,sBAAiB,GAAE,KAAKC,GAAKA,EAAE,OAAO,EACtD,WAAY,sBACZ,YAAa,iCACf,EAEMC,GAAenB,GAGnB,CACA,gBAAiB,IAAM,CACrB,MAAMoB,GAAY,OAAO,eAAiB,CAAA,GAAI,KAC5CgB,GAAKA,EAAE,KAAOD,EAAA,EAEhB,OAAOf,GAAY,KAAO,KAAO,CAAE,MAAOA,CAAA,CAC5C,EACA,YAAa,SAAY,CACvB,KAAM,CAAE,wBAAAiB,CAAA,EACN,MAAM,QAAA,QAAA,EAAA,KAAA,IAAA,QAAO,wCAA4B,CAAA,EAC3C,OAAO,IAAIA,CACb,CACF,CAAC,EAEYC,GAA0D,CACrE,UAAWH,GACX,SAAAlB,GACA,WAAY,IAAME,EACpB,ECnCA,SAASoB,GAAQC,EAAG,CAChB,OAAOA,aAAa,YAAe,YAAY,OAAOA,CAAC,GAAKA,EAAE,YAAY,OAAS,YACvF,CAEA,SAASC,GAAOC,EAAG,CACf,GAAI,CAACH,GAAQG,CAAC,EACV,MAAM,IAAI,MAAM,qBAAqB,CAC7C,CACA,SAASC,GAAUC,EAAUC,EAAK,CAC9B,OAAK,MAAM,QAAQA,CAAG,EAElBA,EAAI,SAAW,EACR,GACPD,EACOC,EAAI,MAAOC,GAAS,OAAOA,GAAS,QAAQ,EAG5CD,EAAI,MAAOC,GAAS,OAAO,cAAcA,CAAI,CAAC,EAP9C,EASf,CACA,SAASC,GAAIC,EAAO,CAChB,GAAI,OAAOA,GAAU,WACjB,MAAM,IAAI,MAAM,mBAAmB,EACvC,MAAO,EACX,CACA,SAASC,GAAKC,EAAOF,EAAO,CACxB,GAAI,OAAOA,GAAU,SACjB,MAAM,IAAI,MAAM,GAAGE,CAAK,mBAAmB,EAC/C,MAAO,EACX,CACA,SAASC,GAAQC,EAAG,CAChB,GAAI,CAAC,OAAO,cAAcA,CAAC,EACvB,MAAM,IAAI,MAAM,oBAAoBA,CAAC,EAAE,CAC/C,CACA,SAASC,GAAKL,EAAO,CACjB,GAAI,CAAC,MAAM,QAAQA,CAAK,EACpB,MAAM,IAAI,MAAM,gBAAgB,CACxC,CACA,SAASM,GAAQJ,EAAOF,EAAO,CAC3B,GAAI,CAACL,GAAU,GAAMK,CAAK,EACtB,MAAM,IAAI,MAAM,GAAGE,CAAK,6BAA6B,CAC7D,CACA,SAASK,GAAQL,EAAOF,EAAO,CAC3B,GAAI,CAACL,GAAU,GAAOK,CAAK,EACvB,MAAM,IAAI,MAAM,GAAGE,CAAK,6BAA6B,CAC7D,CAIA,SAASM,MAASC,EAAM,CACpB,MAAMC,EAAMlB,GAAMA,EAEZmB,EAAO,CAACnB,EAAGE,IAAO,GAAMF,EAAEE,EAAE,CAAC,CAAC,EAE9BkB,EAASH,EAAK,IAAKI,GAAMA,EAAE,MAAM,EAAE,YAAYF,EAAMD,CAAE,EAEvDI,EAASL,EAAK,IAAKI,GAAMA,EAAE,MAAM,EAAE,OAAOF,EAAMD,CAAE,EACxD,MAAO,CAAE,OAAAE,EAAQ,OAAAE,CAAM,CAC3B,CAMA,SAASC,GAASC,EAAS,CAEvB,MAAMC,EAAW,OAAOD,GAAY,SAAWA,EAAQ,MAAM,EAAE,EAAIA,EAC7DE,EAAMD,EAAS,OACrBX,GAAQ,WAAYW,CAAQ,EAE5B,MAAME,EAAU,IAAI,IAAIF,EAAS,IAAI,CAACG,EAAGC,IAAM,CAACD,EAAGC,CAAC,CAAC,CAAC,EACtD,MAAO,CACH,OAASC,IACLjB,GAAKiB,CAAM,EACJA,EAAO,IAAKD,GAAM,CACrB,GAAI,CAAC,OAAO,cAAcA,CAAC,GAAKA,EAAI,GAAKA,GAAKH,EAC1C,MAAM,IAAI,MAAM,kDAAkDG,CAAC,eAAeL,CAAO,EAAE,EAC/F,OAAOC,EAASI,CAAC,CACrB,CAAC,GAEL,OAASrB,IACLK,GAAKL,CAAK,EACHA,EAAM,IAAKuB,GAAW,CACzBtB,GAAK,kBAAmBsB,CAAM,EAC9B,MAAM,EAAIJ,EAAQ,IAAII,CAAM,EAC5B,GAAI,IAAM,OACN,MAAM,IAAI,MAAM,oBAAoBA,CAAM,eAAeP,CAAO,EAAE,EACtE,OAAO,CACX,CAAC,EAEb,CACA,CAIA,SAASQ,GAAKC,EAAY,GAAI,CAC1B,OAAAxB,GAAK,OAAQwB,CAAS,EACf,CACH,OAASC,IACLpB,GAAQ,cAAeoB,CAAI,EACpBA,EAAK,KAAKD,CAAS,GAE9B,OAASE,IACL1B,GAAK,cAAe0B,CAAE,EACfA,EAAG,MAAMF,CAAS,EAErC,CACA,CAKA,SAASG,GAAQC,EAAMC,EAAM,IAAK,CAC9B3B,OAAAA,GAAQ0B,CAAI,EACZ5B,GAAK,UAAW6B,CAAG,EACZ,CACH,OAAOC,EAAM,CAET,IADAzB,GAAQ,iBAAkByB,CAAI,EACtBA,EAAK,OAASF,EAAQ,GAC1BE,EAAK,KAAKD,CAAG,EACjB,OAAOC,CACX,EACA,OAAO/B,EAAO,CACVM,GAAQ,iBAAkBN,CAAK,EAC/B,IAAIgC,EAAMhC,EAAM,OAChB,GAAKgC,EAAMH,EAAQ,EACf,MAAM,IAAI,MAAM,4DAA4D,EAChF,KAAOG,EAAM,GAAKhC,EAAMgC,EAAM,CAAC,IAAMF,EAAKE,IAGtC,IAFaA,EAAM,GACCH,EACT,IAAM,EACb,MAAM,IAAI,MAAM,+CAA+C,EAEvE,OAAO7B,EAAM,MAAM,EAAGgC,CAAG,CAC7B,CACR,CACA,CAIA,SAASC,GAAUC,EAAI,CACnB,OAAAnC,GAAImC,CAAE,EACC,CAAE,OAASR,GAASA,EAAM,OAASC,GAAOO,EAAGP,CAAE,CAAC,CAC3D,CAIA,SAASQ,GAAaJ,EAAML,EAAMC,EAAI,CAElC,GAAID,EAAO,EACP,MAAM,IAAI,MAAM,8BAA8BA,CAAI,8BAA8B,EACpF,GAAIC,EAAK,EACL,MAAM,IAAI,MAAM,4BAA4BA,CAAE,8BAA8B,EAEhF,GADAtB,GAAK0B,CAAI,EACL,CAACA,EAAK,OACN,MAAO,CAAA,EACX,IAAIK,EAAM,EACV,MAAMC,EAAM,CAAA,EACNf,EAAS,MAAM,KAAKS,EAAOO,GAAM,CAEnC,GADAnC,GAAQmC,CAAC,EACLA,EAAI,GAAKA,GAAKZ,EACd,MAAM,IAAI,MAAM,oBAAoBY,CAAC,EAAE,EAC3C,OAAOA,CACX,CAAC,EACKC,EAAOjB,EAAO,OACpB,OAAa,CACT,IAAIkB,EAAQ,EACRC,EAAO,GACX,QAASpB,EAAIe,EAAKf,EAAIkB,EAAMlB,IAAK,CAC7B,MAAMqB,EAAQpB,EAAOD,CAAC,EAChBsB,EAAYjB,EAAOc,EACnBI,EAAYD,EAAYD,EAC9B,GAAI,CAAC,OAAO,cAAcE,CAAS,GAC/BD,EAAYjB,IAASc,GACrBI,EAAYF,IAAUC,EACtB,MAAM,IAAI,MAAM,8BAA8B,EAElD,MAAME,EAAMD,EAAYjB,EACxBa,EAAQI,EAAYjB,EACpB,MAAMmB,EAAU,KAAK,MAAMD,CAAG,EAE9B,GADAvB,EAAOD,CAAC,EAAIyB,EACR,CAAC,OAAO,cAAcA,CAAO,GAAKA,EAAUnB,EAAKa,IAAUI,EAC3D,MAAM,IAAI,MAAM,8BAA8B,EAClD,GAAKH,EAEKK,EAGNL,EAAO,GAFPL,EAAMf,MAFN,SAKR,CAEA,GADAgB,EAAI,KAAKG,CAAK,EACVC,EACA,KACR,CACA,QAASpB,EAAI,EAAGA,EAAIU,EAAK,OAAS,GAAKA,EAAKV,CAAC,IAAM,EAAGA,IAClDgB,EAAI,KAAK,CAAC,EACd,OAAOA,EAAI,QAAO,CACtB,CACA,MAAMU,GAAM,CAACvD,EAAGE,IAAOA,IAAM,EAAIF,EAAIuD,GAAIrD,EAAGF,EAAIE,CAAC,EAC3CsD,GAAyC,CAACtB,EAAMC,IAAOD,GAAQC,EAAKoB,GAAIrB,EAAMC,CAAE,GAChFsB,IAA0B,IAAM,CAClC,IAAIZ,EAAM,CAAA,EACV,QAAShB,EAAI,EAAGA,EAAI,GAAIA,IACpBgB,EAAI,KAAK,GAAKhB,CAAC,EACnB,OAAOgB,CACX,GAAC,EAID,SAASa,GAAcnB,EAAML,EAAMC,EAAIC,EAAS,CAE5C,GADAvB,GAAK0B,CAAI,EACLL,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI,MAAM,6BAA6BA,CAAI,EAAE,EACvD,GAAIC,GAAM,GAAKA,EAAK,GAChB,MAAM,IAAI,MAAM,2BAA2BA,CAAE,EAAE,EACnD,GAAIqB,GAAYtB,EAAMC,CAAE,EAAI,GACxB,MAAM,IAAI,MAAM,sCAAsCD,CAAI,OAAOC,CAAE,cAAcqB,GAAYtB,EAAMC,CAAE,CAAC,EAAE,EAE5G,IAAIa,EAAQ,EACRJ,EAAM,EACV,MAAMe,EAAMF,GAAOvB,CAAI,EACjB0B,EAAOH,GAAOtB,CAAE,EAAI,EACpBU,EAAM,CAAA,EACZ,UAAWjC,KAAK2B,EAAM,CAElB,GADA5B,GAAQC,CAAC,EACLA,GAAK+C,EACL,MAAM,IAAI,MAAM,oCAAoC/C,CAAC,SAASsB,CAAI,EAAE,EAExE,GADAc,EAASA,GAASd,EAAQtB,EACtBgC,EAAMV,EAAO,GACb,MAAM,IAAI,MAAM,qCAAqCU,CAAG,SAASV,CAAI,EAAE,EAE3E,IADAU,GAAOV,EACAU,GAAOT,EAAIS,GAAOT,EACrBU,EAAI,MAAOG,GAAUJ,EAAMT,EAAOyB,KAAU,CAAC,EACjD,MAAMC,EAAMJ,GAAOb,CAAG,EACtB,GAAIiB,IAAQ,OACR,MAAM,IAAI,MAAM,eAAe,EACnCb,GAASa,EAAM,CACnB,CAEA,GADAb,EAASA,GAAUb,EAAKS,EAAQgB,EAC5B,CAACxB,GAAWQ,GAAOV,EACnB,MAAM,IAAI,MAAM,gBAAgB,EACpC,GAAI,CAACE,GAAWY,EAAQ,EACpB,MAAM,IAAI,MAAM,qBAAqBA,CAAK,EAAE,EAChD,OAAIZ,GAAWQ,EAAM,GACjBC,EAAI,KAAKG,IAAU,CAAC,EACjBH,CACX,CAIA,SAASiB,GAAMC,EAAK,CAChBpD,GAAQoD,CAAG,EACX,MAAMC,EAAO,GAAK,EAClB,MAAO,CACH,OAASC,GAAU,CACf,GAAI,CAAClE,GAAQkE,CAAK,EACd,MAAM,IAAI,MAAM,yCAAyC,EAC7D,OAAOtB,GAAa,MAAM,KAAKsB,CAAK,EAAGD,EAAMD,CAAG,CACpD,EACA,OAASjC,IACLf,GAAQ,eAAgBe,CAAM,EACvB,WAAW,KAAKa,GAAab,EAAQiC,EAAKC,CAAI,CAAC,EAElE,CACA,CAMA,SAASE,GAAO7B,EAAM8B,EAAa,GAAO,CAEtC,GADAxD,GAAQ0B,CAAI,EACRA,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI,MAAM,mCAAmC,EACvD,GAAImB,GAAY,EAAGnB,CAAI,EAAI,IAAMmB,GAAYnB,EAAM,CAAC,EAAI,GACpD,MAAM,IAAI,MAAM,wBAAwB,EAC5C,MAAO,CACH,OAAS4B,GAAU,CACf,GAAI,CAAClE,GAAQkE,CAAK,EACd,MAAM,IAAI,MAAM,0CAA0C,EAC9D,OAAOP,GAAc,MAAM,KAAKO,CAAK,EAAG,EAAG5B,EAAM,CAAC8B,CAAU,CAChE,EACA,OAASrC,IACLf,GAAQ,gBAAiBe,CAAM,EACxB,WAAW,KAAK4B,GAAc5B,EAAQO,EAAM,EAAG8B,CAAU,CAAC,EAE7E,CACA,CACA,SAASC,GAAc1B,EAAI,CACvB,OAAAnC,GAAImC,CAAE,EACC,YAAazB,EAAM,CACtB,GAAI,CACA,OAAOyB,EAAG,MAAM,KAAMzB,CAAI,CAC9B,MACU,CAAE,CAChB,CACJ,CACA,SAASoD,GAAS3C,EAAKgB,EAAI,CACvB/B,OAAAA,GAAQe,CAAG,EACXnB,GAAImC,CAAE,EACC,CACH,OAAOH,EAAM,CACT,GAAI,CAACxC,GAAQwC,CAAI,EACb,MAAM,IAAI,MAAM,6CAA6C,EACjE,MAAM+B,EAAM5B,EAAGH,CAAI,EAAE,MAAM,EAAGb,CAAG,EAC3BmB,EAAM,IAAI,WAAWN,EAAK,OAASb,CAAG,EAC5C,OAAAmB,EAAI,IAAIN,CAAI,EACZM,EAAI,IAAIyB,EAAK/B,EAAK,MAAM,EACjBM,CACX,EACA,OAAON,EAAM,CACT,GAAI,CAACxC,GAAQwC,CAAI,EACb,MAAM,IAAI,MAAM,6CAA6C,EACjE,MAAMgC,EAAUhC,EAAK,MAAM,EAAG,CAACb,CAAG,EAC5B8C,EAAcjC,EAAK,MAAM,CAACb,CAAG,EAC7B+C,EAAc/B,EAAG6B,CAAO,EAAE,MAAM,EAAG7C,CAAG,EAC5C,QAAS,EAAI,EAAG,EAAIA,EAAK,IACrB,GAAI+C,EAAY,CAAC,IAAMD,EAAY,CAAC,EAChC,MAAM,IAAI,MAAM,kBAAkB,EAC1C,OAAOD,CACX,CACR,CACA,CAgFA,MAAMG,GAA0C,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,UAAa,YACpF,OAAO,WAAW,YAAe,WAC/BC,GAAsB,CAACC,EAAGC,IAAU,CACtCpE,GAAK,SAAUmE,CAAC,EAChB,MAAME,EAAmC,oBACnCvD,EAAiC,SACvC,GAAIqD,EAAE,OAAS,GAAK,CAACE,EAAG,KAAKF,CAAC,EAC1B,MAAM,IAAI,MAAM,gBAAgB,EACpC,OAAO,WAAW,WAAWA,EAAG,CAAE,SAAArD,EAAU,kBAAmB,SAAU,CAC7E,EAeawD,GAASL,GAAmB,CACrC,OAAOxE,EAAG,CAAED,OAAAA,GAAOC,CAAC,EAAUA,EAAE,SAAQ,CAAI,EAC5C,OAAO0E,EAAG,CAAE,OAAOD,GAAoBC,CAAQ,CAAG,CACtD,EAAI5D,GAAMkD,GAAO,CAAC,EAAG3C,GAAS,kEAAkE,EAAGa,GAAQ,CAAC,EAAGJ,GAAK,EAAE,CAAC,EA4CjHgD,GAAwCC,GAAQjE,GAAM8C,GAAM,EAAE,EAAGvC,GAAS0D,CAAG,EAAGjD,GAAK,EAAE,CAAC,EAUjFkD,GAASF,GAAU,4DAA4D,EA4C/EG,GAAqBC,GAAWpE,GAAMqD,GAAS,EAAI9B,GAAS6C,EAAOA,EAAO7C,CAAI,CAAC,CAAC,EAAG2C,EAAM,EAMhGG,GAAgBrE,GAAMO,GAAS,kCAAkC,EAAGS,GAAK,EAAE,CAAC,EAC5EsD,GAAqB,CAAC,UAAY,UAAY,UAAY,WAAY,SAAU,EACtF,SAASC,GAAcC,EAAK,CACxB,MAAMtF,EAAIsF,GAAO,GACjB,IAAIC,GAAOD,EAAM,WAAc,EAC/B,QAAS3D,EAAI,EAAGA,EAAIyD,GAAmB,OAAQzD,KACrC3B,GAAK2B,EAAK,KAAO,IACnB4D,GAAOH,GAAmBzD,CAAC,GAEnC,OAAO4D,CACX,CACA,SAASC,GAAaC,EAAQC,EAAOC,EAAgB,EAAG,CACpD,MAAMnE,EAAMiE,EAAO,OACnB,IAAIF,EAAM,EACV,QAAS5D,EAAI,EAAGA,EAAIH,EAAKG,IAAK,CAC1B,MAAMiE,EAAIH,EAAO,WAAW9D,CAAC,EAC7B,GAAIiE,EAAI,IAAMA,EAAI,IACd,MAAM,IAAI,MAAM,mBAAmBH,CAAM,GAAG,EAChDF,EAAMF,GAAcE,CAAG,EAAKK,GAAK,CACrC,CACAL,EAAMF,GAAcE,CAAG,EACvB,QAAS5D,EAAI,EAAGA,EAAIH,EAAKG,IACrB4D,EAAMF,GAAcE,CAAG,EAAKE,EAAO,WAAW9D,CAAC,EAAI,GACvD,QAASkE,KAAKH,EACVH,EAAMF,GAAcE,CAAG,EAAIM,EAC/B,QAASlE,EAAI,EAAGA,EAAI,EAAGA,IACnB4D,EAAMF,GAAcE,CAAG,EAC3B,OAAAA,GAAOI,EACAR,GAAc,OAAO3B,GAAc,CAAC+B,EAAMhC,GAAO,EAAE,CAAC,EAAG,GAAI,EAAG,EAAK,CAAC,CAC/E,CAIA,SAASuC,GAAUC,EAAU,CACzB,MAAMC,EAAiBD,IAAa,SAAW,EAAI,UAC7CE,EAASjC,GAAO,CAAC,EACjBkC,EAAYD,EAAO,OACnBE,EAAUF,EAAO,OACjBG,EAAkBlC,GAAcgC,CAAS,EAC/C,SAAShF,EAAOuE,EAAQC,EAAOW,EAAQ,GAAI,CACvC9F,GAAK,uBAAwBkF,CAAM,EAC/B5F,GAAQ6F,CAAK,IACbA,EAAQ,MAAM,KAAKA,CAAK,GAC5B7E,GAAQ,gBAAiB6E,CAAK,EAC9B,MAAMY,EAAOb,EAAO,OACpB,GAAIa,IAAS,EACT,MAAM,IAAI,UAAU,yBAAyBA,CAAI,EAAE,EACvD,MAAMC,EAAeD,EAAO,EAAIZ,EAAM,OACtC,GAAIW,IAAU,IAASE,EAAeF,EAClC,MAAM,IAAI,UAAU,UAAUE,CAAY,kBAAkBF,CAAK,EAAE,EACvE,MAAMG,EAAUf,EAAO,YAAW,EAC5BrB,EAAMoB,GAAagB,EAASd,EAAOM,CAAc,EACvD,MAAO,GAAGQ,CAAO,IAAIrB,GAAc,OAAOO,CAAK,CAAC,GAAGtB,CAAG,EAC1D,CACA,SAAShD,EAAOqF,EAAKJ,EAAQ,GAAI,CAC7B9F,GAAK,sBAAuBkG,CAAG,EAC/B,MAAMC,EAAOD,EAAI,OACjB,GAAIC,EAAO,GAAML,IAAU,IAASK,EAAOL,EACvC,MAAM,IAAI,UAAU,0BAA0BK,CAAI,KAAKD,CAAG,mBAAmBJ,CAAK,GAAG,EAEzF,MAAMG,EAAUC,EAAI,YAAW,EAC/B,GAAIA,IAAQD,GAAWC,IAAQA,EAAI,YAAW,EAC1C,MAAM,IAAI,MAAM,uCAAuC,EAC3D,MAAME,EAAWH,EAAQ,YAAY,GAAG,EACxC,GAAIG,IAAa,GAAKA,IAAa,GAC/B,MAAM,IAAI,MAAM,yDAAyD,EAC7E,MAAMlB,EAASe,EAAQ,MAAM,EAAGG,CAAQ,EAClCtE,EAAOmE,EAAQ,MAAMG,EAAW,CAAC,EACvC,GAAItE,EAAK,OAAS,EACd,MAAM,IAAI,MAAM,yCAAyC,EAC7D,MAAMqD,EAAQP,GAAc,OAAO9C,CAAI,EAAE,MAAM,EAAG,EAAE,EAC9C+B,EAAMoB,GAAaC,EAAQC,EAAOM,CAAc,EACtD,GAAI,CAAC3D,EAAK,SAAS+B,CAAG,EAClB,MAAM,IAAI,MAAM,uBAAuBqC,CAAG,eAAerC,CAAG,GAAG,EACnE,MAAO,CAAE,OAAAqB,EAAQ,MAAAC,CAAK,CAC1B,CACA,MAAMkB,EAAe1C,GAAc9C,CAAM,EACzC,SAASyF,EAAcJ,EAAK,CACxB,KAAM,CAAE,OAAAhB,EAAQ,MAAAC,CAAK,EAAKtE,EAAOqF,EAAK,EAAK,EAC3C,MAAO,CAAE,OAAAhB,EAAQ,MAAAC,EAAO,MAAOQ,EAAUR,CAAK,CAAC,CACnD,CACA,SAASoB,EAAgBrB,EAAQ1B,EAAO,CACpC,OAAO7C,EAAOuE,EAAQU,EAAQpC,CAAK,CAAC,CACxC,CACA,MAAO,CACH,OAAA7C,EACA,OAAAE,EACA,gBAAA0F,EACA,cAAAD,EACA,aAAAD,EACA,UAAAV,EACA,gBAAAE,EACA,QAAAD,CACR,CACA,CAMO,MAAMY,GAASjB,GAAU,QAAQ,EAO3BkB,GAAUlB,GAAU,SAAS,EAS7BmB,GAAO,CAChB,OAAS5E,GAAS,IAAI,YAAW,EAAG,OAAOA,CAAI,EAC/C,OAASoE,GAAQ,IAAI,YAAW,EAAG,OAAOA,CAAG,CACjD,EAGMS,GAAuC,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,OAAU,YAC9E,OAAO,WAAW,SAAY,WAE5BC,GAAa,CACf,OAAO9E,EAAM,CAAEtC,OAAAA,GAAOsC,CAAI,EAAUA,EAAK,MAAK,CAAI,EAClD,OAAOqC,EAAG,CAAE,OAAAnE,GAAK,MAAOmE,CAAC,EAAU,WAAW,QAAQA,CAAC,CAAG,CAC9D,EASa0C,EAAMF,GACbC,GACArG,GAAMkD,GAAO,CAAC,EAAG3C,GAAS,kBAAkB,EAAGS,GAAK,EAAE,EAAGS,GAAWmC,GAAM,CACxE,GAAI,OAAOA,GAAM,UAAYA,EAAE,OAAS,IAAM,EAC1C,MAAM,IAAI,UAAU,oCAAoC,OAAOA,CAAC,gBAAgBA,EAAE,MAAM,EAAE,EAC9F,OAAOA,EAAE,YAAW,CACxB,CAAC,CAAC,EC/pBC,SAAS7E,GAAQC,EAAG,CACvB,OAAOA,aAAa,YAAe,YAAY,OAAOA,CAAC,GAAKA,EAAE,YAAY,OAAS,YACvF,CAEO,SAASW,GAAQC,EAAG2G,EAAQ,GAAI,CACnC,GAAI,CAAC,OAAO,cAAc3G,CAAC,GAAKA,EAAI,EAAG,CACnC,MAAM+E,EAAS4B,GAAS,IAAIA,CAAK,KACjC,MAAM,IAAI,MAAM,GAAG5B,CAAM,8BAA8B/E,CAAC,EAAE,CAC9D,CACJ,CAEO,SAASX,EAAOuH,EAAOC,EAAQF,EAAQ,GAAI,CAC9C,MAAMtD,EAAQlE,GAAQyH,CAAK,EACrB9F,EAAM8F,GAAO,OACbE,EAAWD,IAAW,OAC5B,GAAI,CAACxD,GAAUyD,GAAYhG,IAAQ+F,EAAS,CACxC,MAAM9B,EAAS4B,GAAS,IAAIA,CAAK,KAC3BI,EAAQD,EAAW,cAAcD,CAAM,GAAK,GAC5CG,EAAM3D,EAAQ,UAAUvC,CAAG,GAAK,QAAQ,OAAO8F,CAAK,GAC1D,MAAM,IAAI,MAAM7B,EAAS,sBAAwBgC,EAAQ,SAAWC,CAAG,CAC3E,CACA,OAAOJ,CACX,CAEO,SAASK,GAAMC,EAAG,CACrB,GAAI,OAAOA,GAAM,YAAc,OAAOA,EAAE,QAAW,WAC/C,MAAM,IAAI,MAAM,yCAAyC,EAC7DnH,GAAQmH,EAAE,SAAS,EACnBnH,GAAQmH,EAAE,QAAQ,CACtB,CAEO,SAASC,GAAQC,EAAUC,EAAgB,GAAM,CACpD,GAAID,EAAS,UACT,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAIC,GAAiBD,EAAS,SAC1B,MAAM,IAAI,MAAM,uCAAuC,CAC/D,CAEO,SAASE,GAAQC,EAAKH,EAAU,CACnC/H,EAAOkI,EAAK,OAAW,qBAAqB,EAC5C,MAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACb,MAAM,IAAI,MAAM,oDAAsDA,CAAG,CAEjF,CAUO,SAASC,MAASC,EAAQ,CAC7B,QAASzG,EAAI,EAAGA,EAAIyG,EAAO,OAAQzG,IAC/ByG,EAAOzG,CAAC,EAAE,KAAK,CAAC,CAExB,CAEO,SAAS0G,GAAWlI,EAAK,CAC5B,OAAO,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,CAClE,CAEO,SAASmI,GAAKC,EAAMC,EAAO,CAC9B,OAAQD,GAAS,GAAKC,EAAWD,IAASC,CAC9C,CAEO,SAASC,GAAKF,EAAMC,EAAO,CAC9B,OAAQD,GAAQC,EAAWD,IAAU,GAAKC,IAAY,CAC1D,CAyBA,MAAMtB,GAEN,OAAO,WAAW,KAAK,CAAA,CAAE,EAAE,OAAU,YAAc,OAAO,WAAW,SAAY,WAE3EwB,GAAwB,MAAM,KAAK,CAAE,OAAQ,GAAG,EAAI,CAACC,EAAGhH,IAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAK5F,SAASiH,GAAW7E,EAAO,CAG9B,GAFAhE,EAAOgE,CAAK,EAERmD,GACA,OAAOnD,EAAM,MAAK,EAEtB,IAAIqD,EAAM,GACV,QAASzF,EAAI,EAAGA,EAAIoC,EAAM,OAAQpC,IAC9ByF,GAAOsB,GAAM3E,EAAMpC,CAAC,CAAC,EAEzB,OAAOyF,CACX,CAEA,MAAMyB,GAAS,CAAE,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAG,EAC5D,SAASC,GAAcC,EAAI,CACvB,GAAIA,GAAMF,GAAO,IAAME,GAAMF,GAAO,GAChC,OAAOE,EAAKF,GAAO,GACvB,GAAIE,GAAMF,GAAO,GAAKE,GAAMF,GAAO,EAC/B,OAAOE,GAAMF,GAAO,EAAI,IAC5B,GAAIE,GAAMF,GAAO,GAAKE,GAAMF,GAAO,EAC/B,OAAOE,GAAMF,GAAO,EAAI,GAEhC,CAKO,SAASG,GAAW5B,EAAK,CAC5B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAE5D,GAAIF,GACA,OAAO,WAAW,QAAQE,CAAG,EACjC,MAAM6B,EAAK7B,EAAI,OACT8B,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAI,MAAM,mDAAqDA,CAAE,EAC3E,MAAME,EAAQ,IAAI,WAAWD,CAAE,EAC/B,QAASE,EAAK,EAAGC,EAAK,EAAGD,EAAKF,EAAIE,IAAMC,GAAM,EAAG,CAC7C,MAAMC,EAAKR,GAAc1B,EAAI,WAAWiC,CAAE,CAAC,EACrCE,EAAKT,GAAc1B,EAAI,WAAWiC,EAAK,CAAC,CAAC,EAC/C,GAAIC,IAAO,QAAaC,IAAO,OAAW,CACtC,MAAMC,EAAOpC,EAAIiC,CAAE,EAAIjC,EAAIiC,EAAK,CAAC,EACjC,MAAM,IAAI,MAAM,+CAAiDG,EAAO,cAAgBH,CAAE,CAC9F,CACAF,EAAMC,CAAE,EAAIE,EAAK,GAAKC,CAC1B,CACA,OAAOJ,CACX,CAwCO,SAASM,MAAerB,EAAQ,CACnC,IAAIhE,EAAM,EACV,QAASzC,EAAI,EAAGA,EAAIyG,EAAO,OAAQzG,IAAK,CACpC,MAAM7B,EAAIsI,EAAOzG,CAAC,EAClB5B,EAAOD,CAAC,EACRsE,GAAOtE,EAAE,MACb,CACA,MAAM6C,EAAM,IAAI,WAAWyB,CAAG,EAC9B,QAASzC,EAAI,EAAG+H,EAAM,EAAG/H,EAAIyG,EAAO,OAAQzG,IAAK,CAC7C,MAAM7B,EAAIsI,EAAOzG,CAAC,EAClBgB,EAAI,IAAI7C,EAAG4J,CAAG,EACdA,GAAO5J,EAAE,MACb,CACA,OAAO6C,CACX,CASO,SAASgH,GAAaC,EAAUC,EAAO,GAAI,CAC9C,MAAMC,EAAQ,CAACC,EAAKC,IAASJ,EAASI,CAAI,EAAE,OAAOD,CAAG,EAAE,OAAM,EACxDE,EAAML,EAAS,MAAS,EAC9B,OAAAE,EAAM,UAAYG,EAAI,UACtBH,EAAM,SAAWG,EAAI,SACrBH,EAAM,OAAUE,GAASJ,EAASI,CAAI,EACtC,OAAO,OAAOF,EAAOD,CAAI,EAClB,OAAO,OAAOC,CAAK,CAC9B,CAEO,SAASI,GAAYC,EAAc,GAAI,CAC1C,MAAMC,EAAK,OAAO,YAAe,SAAW,WAAW,OAAS,KAChE,GAAI,OAAOA,GAAI,iBAAoB,WAC/B,MAAM,IAAI,MAAM,wCAAwC,EAC5D,OAAOA,EAAG,gBAAgB,IAAI,WAAWD,CAAW,CAAC,CACzD,CAEO,MAAME,GAAWC,IAAY,CAChC,IAAK,WAAW,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,GAAM,EAAM,IAAM,EAAM,EAAM,EAAMA,CAAM,CAAC,CAC7F,GC1OO,SAASC,GAAIzK,EAAGE,EAAG4F,EAAG,CACzB,OAAQ9F,EAAIE,EAAM,CAACF,EAAI8F,CAC3B,CAEO,SAAS4E,GAAI1K,EAAGE,EAAG4F,EAAG,CACzB,OAAQ9F,EAAIE,EAAMF,EAAI8F,EAAM5F,EAAI4F,CACpC,CAKO,MAAM6E,EAAO,CAChB,SACA,UACA,UACA,KAEA,OACA,KACA,SAAW,GACX,OAAS,EACT,IAAM,EACN,UAAY,GACZ,YAAYC,EAAUC,EAAWC,EAAWC,EAAM,CAC9C,KAAK,SAAWH,EAChB,KAAK,UAAYC,EACjB,KAAK,UAAYC,EACjB,KAAK,KAAOC,EACZ,KAAK,OAAS,IAAI,WAAWH,CAAQ,EACrC,KAAK,KAAOrC,GAAW,KAAK,MAAM,CACtC,CACA,OAAOhG,EAAM,CACTwF,GAAQ,IAAI,EACZ9H,EAAOsC,CAAI,EACX,KAAM,CAAE,KAAAyI,EAAM,OAAAC,EAAQ,SAAAL,CAAQ,EAAK,KAC7BlJ,EAAMa,EAAK,OACjB,QAASK,EAAM,EAAGA,EAAMlB,GAAM,CAC1B,MAAMwJ,EAAO,KAAK,IAAIN,EAAW,KAAK,IAAKlJ,EAAMkB,CAAG,EAEpD,GAAIsI,IAASN,EAAU,CACnB,MAAMO,EAAW5C,GAAWhG,CAAI,EAChC,KAAOqI,GAAYlJ,EAAMkB,EAAKA,GAAOgI,EACjC,KAAK,QAAQO,EAAUvI,CAAG,EAC9B,QACJ,CACAqI,EAAO,IAAI1I,EAAK,SAASK,EAAKA,EAAMsI,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZtI,GAAOsI,EACH,KAAK,MAAQN,IACb,KAAK,QAAQI,EAAM,CAAC,EACpB,KAAK,IAAM,EAEnB,CACA,YAAK,QAAUzI,EAAK,OACpB,KAAK,WAAU,EACR,IACX,CACA,WAAW4F,EAAK,CACZJ,GAAQ,IAAI,EACZG,GAAQC,EAAK,IAAI,EACjB,KAAK,SAAW,GAIhB,KAAM,CAAE,OAAA8C,EAAQ,KAAAD,EAAM,SAAAJ,EAAU,KAAAG,CAAI,EAAK,KACzC,GAAI,CAAE,IAAAnI,CAAG,EAAK,KAEdqI,EAAOrI,GAAK,EAAI,IAChByF,GAAM,KAAK,OAAO,SAASzF,CAAG,CAAC,EAG3B,KAAK,UAAYgI,EAAWhI,IAC5B,KAAK,QAAQoI,EAAM,CAAC,EACpBpI,EAAM,GAGV,QAASf,EAAIe,EAAKf,EAAI+I,EAAU/I,IAC5BoJ,EAAOpJ,CAAC,EAAI,EAIhBmJ,EAAK,aAAaJ,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGG,CAAI,EAC7D,KAAK,QAAQC,EAAM,CAAC,EACpB,MAAMI,EAAQ7C,GAAWJ,CAAG,EACtBzG,EAAM,KAAK,UAEjB,GAAIA,EAAM,EACN,MAAM,IAAI,MAAM,2CAA2C,EAC/D,MAAM2J,EAAS3J,EAAM,EACf4J,EAAQ,KAAK,IAAG,EACtB,GAAID,EAASC,EAAM,OACf,MAAM,IAAI,MAAM,oCAAoC,EACxD,QAASzJ,EAAI,EAAGA,EAAIwJ,EAAQxJ,IACxBuJ,EAAM,UAAU,EAAIvJ,EAAGyJ,EAAMzJ,CAAC,EAAGkJ,CAAI,CAC7C,CACA,QAAS,CACL,KAAM,CAAE,OAAAE,EAAQ,UAAAJ,CAAS,EAAK,KAC9B,KAAK,WAAWI,CAAM,EACtB,MAAMpI,EAAMoI,EAAO,MAAM,EAAGJ,CAAS,EACrC,YAAK,QAAO,EACLhI,CACX,CACA,WAAWV,EAAI,CACXA,IAAO,IAAI,KAAK,YAChBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,KAAM,CAAE,SAAAyI,EAAU,OAAAK,EAAQ,OAAAxD,EAAQ,SAAA8D,EAAU,UAAAC,EAAW,IAAA5I,CAAG,EAAK,KAC/D,OAAAT,EAAG,UAAYqJ,EACfrJ,EAAG,SAAWoJ,EACdpJ,EAAG,OAASsF,EACZtF,EAAG,IAAMS,EACL6E,EAASmD,GACTzI,EAAG,OAAO,IAAI8I,CAAM,EACjB9I,CACX,CACA,OAAQ,CACJ,OAAO,KAAK,WAAU,CAC1B,CACJ,CAMO,MAAMsJ,GAA4B,YAAY,KAAK,CACtD,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACxF,CAAC,ECpHKC,GAA2B,YAAY,KAAK,CAC9C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACxF,CAAC,EAEKC,GAA2B,IAAI,YAAY,EAAE,EAEnD,MAAMC,WAAiBjB,EAAO,CAC1B,YAAYE,EAAW,CACnB,MAAM,GAAIA,EAAW,EAAG,EAAK,CACjC,CACA,KAAM,CACF,KAAM,CAAE,EAAAgB,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACnC,MAAO,CAACP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CAClC,CAEA,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG,CACxB,KAAK,EAAIP,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,CACjB,CACA,QAAQpB,EAAMqB,EAAQ,CAElB,QAASxK,EAAI,EAAGA,EAAI,GAAIA,IAAKwK,GAAU,EACnCV,GAAS9J,CAAC,EAAImJ,EAAK,UAAUqB,EAAQ,EAAK,EAC9C,QAASxK,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMyK,EAAMX,GAAS9J,EAAI,EAAE,EACrB0K,EAAKZ,GAAS9J,EAAI,CAAC,EACnB2K,EAAKhE,GAAK8D,EAAK,CAAC,EAAI9D,GAAK8D,EAAK,EAAE,EAAKA,IAAQ,EAC7CG,EAAKjE,GAAK+D,EAAI,EAAE,EAAI/D,GAAK+D,EAAI,EAAE,EAAKA,IAAO,GACjDZ,GAAS9J,CAAC,EAAK4K,EAAKd,GAAS9J,EAAI,CAAC,EAAI2K,EAAKb,GAAS9J,EAAI,EAAE,EAAK,CACnE,CAEA,GAAI,CAAE,EAAAgK,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAASvK,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM6K,EAASlE,GAAKyD,EAAG,CAAC,EAAIzD,GAAKyD,EAAG,EAAE,EAAIzD,GAAKyD,EAAG,EAAE,EAC9CU,EAAMP,EAAIM,EAASjC,GAAIwB,EAAGC,EAAGC,CAAC,EAAIT,GAAS7J,CAAC,EAAI8J,GAAS9J,CAAC,EAAK,EAE/D+K,GADSpE,GAAKqD,EAAG,CAAC,EAAIrD,GAAKqD,EAAG,EAAE,EAAIrD,GAAKqD,EAAG,EAAE,GAC/BnB,GAAImB,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CACpB,CAEAf,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnB,KAAK,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACnC,CACA,YAAa,CACT/D,GAAMsD,EAAQ,CAClB,CACA,SAAU,CACN,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/BtD,GAAM,KAAK,MAAM,CACrB,CACJ,CAEO,MAAMwE,WAAgBjB,EAAS,CAGlC,EAAIH,GAAU,CAAC,EAAI,EACnB,EAAIA,GAAU,CAAC,EAAI,EACnB,EAAIA,GAAU,CAAC,EAAI,EACnB,EAAIA,GAAU,CAAC,EAAI,EACnB,EAAIA,GAAU,CAAC,EAAI,EACnB,EAAIA,GAAU,CAAC,EAAI,EACnB,EAAIA,GAAU,CAAC,EAAI,EACnB,EAAIA,GAAU,CAAC,EAAI,EACnB,aAAc,CACV,MAAM,EAAE,CACZ,CACJ,CAyQY,MAACrG,GAAyByE,GAAa,IAAM,IAAIgD,GAC7CtC,GAAQ,CAAI,CAAC,EC/W7B,MAAMuC,GAAsB,OAAO,CAAC,EAC9BC,GAAsB,OAAO,CAAC,EAC7B,SAASC,GAAMxF,EAAOD,EAAQ,GAAI,CACrC,GAAI,OAAOC,GAAU,UAAW,CAC5B,MAAM7B,EAAS4B,GAAS,IAAIA,CAAK,KACjC,MAAM,IAAI,MAAM5B,EAAS,8BAAgC,OAAO6B,CAAK,CACzE,CACA,OAAOA,CACX,CAEA,SAASyF,GAAWrM,EAAG,CACnB,GAAI,OAAOA,GAAM,UACb,GAAI,CAACsM,GAAStM,CAAC,EACX,MAAM,IAAI,MAAM,iCAAmCA,CAAC,OAGxDD,GAAQC,CAAC,EACb,OAAOA,CACX,CAOO,SAASuM,GAAoBpJ,EAAK,CACrC,MAAMuD,EAAM2F,GAAWlJ,CAAG,EAAE,SAAS,EAAE,EACvC,OAAOuD,EAAI,OAAS,EAAI,IAAMA,EAAMA,CACxC,CACO,SAAS8F,GAAY9F,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAC5D,OAAOA,IAAQ,GAAKwF,GAAM,OAAO,KAAOxF,CAAG,CAC/C,CAEO,SAAS+F,GAAgBpJ,EAAO,CACnC,OAAOmJ,GAAYE,GAAYrJ,CAAK,CAAC,CACzC,CACO,SAASsJ,GAAgBtJ,EAAO,CACnC,OAAOmJ,GAAYE,GAAYE,GAAUC,EAAQxJ,CAAK,CAAC,EAAE,QAAO,CAAE,CAAC,CACvE,CACO,SAASyJ,GAAgB9M,EAAGc,EAAK,CACpCf,GAAQe,CAAG,EACXd,EAAIqM,GAAWrM,CAAC,EAChB,MAAMiC,EAAM8K,GAAY/M,EAAE,SAAS,EAAE,EAAE,SAASc,EAAM,EAAG,GAAG,CAAC,EAC7D,GAAImB,EAAI,SAAWnB,EACf,MAAM,IAAI,MAAM,kBAAkB,EACtC,OAAOmB,CACX,CACO,SAAS+K,GAAgBhN,EAAGc,EAAK,CACpC,OAAOgM,GAAgB9M,EAAGc,CAAG,EAAE,QAAO,CAC1C,CAkBO,SAAS8L,GAAUvJ,EAAO,CAC7B,OAAO,WAAW,KAAKA,CAAK,CAChC,CAMO,SAAS4J,GAAaC,EAAO,CAChC,OAAO,WAAW,KAAKA,EAAO,CAAChI,EAAGjE,IAAM,CACpC,MAAMkM,EAAWjI,EAAE,WAAW,CAAC,EAC/B,GAAIA,EAAE,SAAW,GAAKiI,EAAW,IAC7B,MAAM,IAAI,MAAM,wCAAwCD,EAAMjM,CAAC,CAAC,eAAekM,CAAQ,gBAAgBlM,CAAC,EAAE,EAE9G,OAAOkM,CACX,CAAC,CACL,CAEA,MAAMb,GAAYtM,GAAM,OAAOA,GAAM,UAAYkM,IAAOlM,EACjD,SAASoN,GAAQpN,EAAGwH,EAAKzE,EAAK,CACjC,OAAOuJ,GAAStM,CAAC,GAAKsM,GAAS9E,CAAG,GAAK8E,GAASvJ,CAAG,GAAKyE,GAAOxH,GAAKA,EAAI+C,CAC5E,CAMO,SAASsK,GAAS1G,EAAO3G,EAAGwH,EAAKzE,EAAK,CAMzC,GAAI,CAACqK,GAAQpN,EAAGwH,EAAKzE,CAAG,EACpB,MAAM,IAAI,MAAM,kBAAoB4D,EAAQ,KAAOa,EAAM,WAAazE,EAAM,SAAW/C,CAAC,CAChG,CAOO,SAASsN,GAAOtN,EAAG,CACtB,IAAIc,EACJ,IAAKA,EAAM,EAAGd,EAAIkM,GAAKlM,IAAMmM,GAAKrL,GAAO,EACrC,CACJ,OAAOA,CACX,CAmBO,MAAMyM,GAAWvN,IAAOmM,IAAO,OAAOnM,CAAC,GAAKmM,GAQ5C,SAASqB,GAAeC,EAASC,EAAUC,EAAQ,CAGtD,GAFA5N,GAAQ0N,EAAS,SAAS,EAC1B1N,GAAQ2N,EAAU,UAAU,EACxB,OAAOC,GAAW,WAClB,MAAM,IAAI,MAAM,2BAA2B,EAC/C,MAAMC,EAAO9M,GAAQ,IAAI,WAAWA,CAAG,EACjC+M,EAAO,WAAW,GAAE,EACpBC,EAAQ,WAAW,GAAG,CAAI,EAC1BC,EAAQ,WAAW,GAAG,CAAI,EAC1BC,EAAgB,IAEtB,IAAI7I,EAAIyI,EAAIH,CAAO,EACfQ,EAAIL,EAAIH,CAAO,EACfxM,EAAI,EACR,MAAMiN,EAAQ,IAAM,CAChB/I,EAAE,KAAK,CAAC,EACR8I,EAAE,KAAK,CAAC,EACRhN,EAAI,CACR,EACMiG,EAAI,IAAIiH,IAASR,EAAOM,EAAGG,GAAajJ,EAAG,GAAGgJ,CAAI,CAAC,EACnDE,EAAS,CAACC,EAAOT,IAAS,CAE5BI,EAAI/G,EAAE4G,EAAOQ,CAAI,EACjBnJ,EAAI+B,EAAC,EACDoH,EAAK,SAAW,IAEpBL,EAAI/G,EAAE6G,EAAOO,CAAI,EACjBnJ,EAAI+B,EAAC,EACT,EACMqH,EAAM,IAAM,CAEd,GAAItN,KAAO+M,EACP,MAAM,IAAI,MAAM,sCAAsC,EAC1D,IAAIlN,EAAM,EACV,MAAMyG,EAAM,CAAA,EACZ,KAAOzG,EAAM4M,GAAU,CACnBvI,EAAI+B,EAAC,EACL,MAAMsH,EAAKrJ,EAAE,MAAK,EAClBoC,EAAI,KAAKiH,CAAE,EACX1N,GAAOqE,EAAE,MACb,CACA,OAAOiJ,GAAa,GAAG7G,CAAG,CAC9B,EAUA,MATiB,CAAC+G,EAAMG,IAAS,CAC7BP,EAAK,EACLG,EAAOC,CAAI,EACX,IAAIrM,EACJ,KAAO,EAAEA,EAAMwM,EAAKF,EAAG,CAAE,IACrBF,EAAM,EACV,OAAAH,EAAK,EACEjM,CACX,CAEJ,CACO,SAASyM,GAAeC,EAAQC,EAAS,CAAA,EAAIC,EAAY,CAAA,EAAI,CAChE,GAAI,CAACF,GAAU,OAAOA,GAAW,SAC7B,MAAM,IAAI,MAAM,+BAA+B,EACnD,SAASG,EAAWC,EAAWC,EAAcC,EAAO,CAChD,MAAMC,EAAMP,EAAOI,CAAS,EAC5B,GAAIE,GAASC,IAAQ,OACjB,OACJ,MAAMC,EAAU,OAAOD,EACvB,GAAIC,IAAYH,GAAgBE,IAAQ,KACpC,MAAM,IAAI,MAAM,UAAUH,CAAS,0BAA0BC,CAAY,SAASG,CAAO,EAAE,CACnG,CACA,MAAMC,EAAO,CAACC,EAAGJ,IAAU,OAAO,QAAQI,CAAC,EAAE,QAAQ,CAAC,CAACpB,EAAG9I,CAAC,IAAM2J,EAAWb,EAAG9I,EAAG8J,CAAK,CAAC,EACxFG,EAAKR,EAAQ,EAAK,EAClBQ,EAAKP,EAAW,EAAI,CACxB,CAWO,SAASS,GAASxN,EAAI,CACzB,MAAMyN,EAAM,IAAI,QAChB,MAAO,CAACC,KAAQnP,IAAS,CACrB,MAAM6O,EAAMK,EAAI,IAAIC,CAAG,EACvB,GAAIN,IAAQ,OACR,OAAOA,EACX,MAAMO,EAAW3N,EAAG0N,EAAK,GAAGnP,CAAI,EAChC,OAAAkP,EAAI,IAAIC,EAAKC,CAAQ,EACdA,CACX,CACJ,CCrOA,MAAMvD,EAAsB,OAAO,CAAC,EAAGC,EAAsB,OAAO,CAAC,EAAGuD,GAAsB,OAAO,CAAC,EAEhGC,GAAsB,OAAO,CAAC,EAAGC,GAAsB,OAAO,CAAC,EAAGC,GAAsB,OAAO,CAAC,EAEhGC,GAAsB,OAAO,CAAC,EAAGC,GAAsB,OAAO,CAAC,EAAGC,GAAsB,OAAO,CAAC,EAChGC,GAAuB,OAAO,EAAE,EAE/B,SAASC,EAAI9Q,EAAGE,EAAG,CACtB,MAAM6Q,EAAS/Q,EAAIE,EACnB,OAAO6Q,GAAUjE,EAAMiE,EAAS7Q,EAAI6Q,CACxC,CAWO,SAASC,EAAK3P,EAAG4P,EAAOC,EAAQ,CACnC,IAAIrO,EAAMxB,EACV,KAAO4P,KAAUnE,GACbjK,GAAOA,EACPA,GAAOqO,EAEX,OAAOrO,CACX,CAKO,SAASsO,GAAOC,EAAQF,EAAQ,CACnC,GAAIE,IAAWtE,EACX,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAIoE,GAAUpE,EACV,MAAM,IAAI,MAAM,0CAA4CoE,CAAM,EAEtE,IAAIlR,EAAI8Q,EAAIM,EAAQF,CAAM,EACtBhR,EAAIgR,EAEJ7P,EAAIyL,EAAcuE,EAAItE,EAC1B,KAAO/M,IAAM8M,GAAK,CAEd,MAAMwE,EAAIpR,EAAIF,EACRuR,EAAIrR,EAAIF,EACRtB,EAAI2C,EAAIgQ,EAAIC,EAGlBpR,EAAIF,EAAGA,EAAIuR,EAAGlQ,EAAIgQ,EAAUA,EAAI3S,CACpC,CAEA,GADYwB,IACA6M,EACR,MAAM,IAAI,MAAM,wBAAwB,EAC5C,OAAO+D,EAAIzP,EAAG6P,CAAM,CACxB,CACA,SAASM,GAAeC,EAAIC,EAAM,EAAG,CACjC,GAAI,CAACD,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,CACjD,CAKA,SAASC,GAAUF,EAAI7Q,EAAG,CACtB,MAAMgR,GAAUH,EAAG,MAAQ1E,GAAOyD,GAC5BkB,EAAOD,EAAG,IAAI7Q,EAAGgR,CAAM,EAC7B,OAAAJ,GAAeC,EAAIC,EAAM9Q,CAAC,EACnB8Q,CACX,CACA,SAASG,GAAUJ,EAAI7Q,EAAG,CACtB,MAAMkR,GAAUL,EAAG,MAAQhB,IAAOE,GAC5BlH,EAAKgI,EAAG,IAAI7Q,EAAG0P,EAAG,EAClBvK,EAAI0L,EAAG,IAAIhI,EAAIqI,CAAM,EACrBC,EAAKN,EAAG,IAAI7Q,EAAGmF,CAAC,EAChB,EAAI0L,EAAG,IAAIA,EAAG,IAAIM,EAAIzB,EAAG,EAAGvK,CAAC,EAC7B2L,EAAOD,EAAG,IAAIM,EAAIN,EAAG,IAAI,EAAGA,EAAG,GAAG,CAAC,EACzC,OAAAD,GAAeC,EAAIC,EAAM9Q,CAAC,EACnB8Q,CACX,CAGA,SAASM,GAAWC,EAAG,CACnB,MAAMC,EAAMC,GAAMF,CAAC,EACbG,EAAKC,GAAcJ,CAAC,EACpBK,EAAKF,EAAGF,EAAKA,EAAI,IAAIA,EAAI,GAAG,CAAC,EAC7BK,EAAKH,EAAGF,EAAKI,CAAE,EACfE,EAAKJ,EAAGF,EAAKA,EAAI,IAAII,CAAE,CAAC,EACxBG,GAAMR,EAAIvB,IAAOG,GACvB,MAAO,CAACY,EAAI7Q,IAAM,CACd,IAAI8R,EAAMjB,EAAG,IAAI7Q,EAAG6R,CAAE,EAClBE,EAAMlB,EAAG,IAAIiB,EAAKJ,CAAE,EACxB,MAAMM,EAAMnB,EAAG,IAAIiB,EAAKH,CAAE,EACpBM,EAAMpB,EAAG,IAAIiB,EAAKF,CAAE,EACpBM,EAAKrB,EAAG,IAAIA,EAAG,IAAIkB,CAAG,EAAG/R,CAAC,EAC1BmS,EAAKtB,EAAG,IAAIA,EAAG,IAAImB,CAAG,EAAGhS,CAAC,EAChC8R,EAAMjB,EAAG,KAAKiB,EAAKC,EAAKG,CAAE,EAC1BH,EAAMlB,EAAG,KAAKoB,EAAKD,EAAKG,CAAE,EAC1B,MAAMC,EAAKvB,EAAG,IAAIA,EAAG,IAAIkB,CAAG,EAAG/R,CAAC,EAC1B8Q,EAAOD,EAAG,KAAKiB,EAAKC,EAAKK,CAAE,EACjC,OAAAxB,GAAeC,EAAIC,EAAM9Q,CAAC,EACnB8Q,CACX,CACJ,CAQO,SAASW,GAAcJ,EAAG,CAG7B,GAAIA,EAAI1B,GACJ,MAAM,IAAI,MAAM,qCAAqC,EAEzD,IAAI0C,EAAIhB,EAAIlF,EACRmG,EAAI,EACR,KAAOD,EAAI3C,KAAQxD,GACfmG,GAAK3C,GACL4C,IAGJ,IAAIC,EAAI7C,GACR,MAAM8C,EAAMjB,GAAMF,CAAC,EACnB,KAAOoB,GAAWD,EAAKD,CAAC,IAAM,GAG1B,GAAIA,IAAM,IACN,MAAM,IAAI,MAAM,+CAA+C,EAGvE,GAAID,IAAM,EACN,OAAOvB,GAGX,IAAI2B,EAAKF,EAAI,IAAID,EAAGF,CAAC,EACrB,MAAMM,GAAUN,EAAIlG,GAAOuD,GAC3B,OAAO,SAAqBmB,EAAI7Q,EAAG,CAC/B,GAAI6Q,EAAG,IAAI7Q,CAAC,EACR,OAAOA,EAEX,GAAIyS,GAAW5B,EAAI7Q,CAAC,IAAM,EACtB,MAAM,IAAI,MAAM,yBAAyB,EAE7C,IAAI4S,EAAIN,EACJpN,EAAI2L,EAAG,IAAIA,EAAG,IAAK6B,CAAE,EACrBG,EAAIhC,EAAG,IAAI7Q,EAAGqS,CAAC,EACfS,EAAIjC,EAAG,IAAI7Q,EAAG2S,CAAM,EAGxB,KAAO,CAAC9B,EAAG,IAAIgC,EAAGhC,EAAG,GAAG,GAAG,CACvB,GAAIA,EAAG,IAAIgC,CAAC,EACR,OAAOhC,EAAG,KACd,IAAI5P,EAAI,EAEJ8R,EAAQlC,EAAG,IAAIgC,CAAC,EACpB,KAAO,CAAChC,EAAG,IAAIkC,EAAOlC,EAAG,GAAG,GAGxB,GAFA5P,IACA8R,EAAQlC,EAAG,IAAIkC,CAAK,EAChB9R,IAAM2R,EACN,MAAM,IAAI,MAAM,yBAAyB,EAGjD,MAAMI,EAAW7G,GAAO,OAAOyG,EAAI3R,EAAI,CAAC,EAClC3B,EAAIuR,EAAG,IAAI3L,EAAG8N,CAAQ,EAE5BJ,EAAI3R,EACJiE,EAAI2L,EAAG,IAAIvR,CAAC,EACZuT,EAAIhC,EAAG,IAAIgC,EAAG3N,CAAC,EACf4N,EAAIjC,EAAG,IAAIiC,EAAGxT,CAAC,CACnB,CACA,OAAOwT,CACX,CACJ,CAYO,SAASG,GAAO5B,EAAG,CAEtB,OAAIA,EAAIzB,KAAQD,GACLoB,GAEPM,EAAItB,KAAQF,GACLoB,GAEPI,EAAIpB,KAASD,GACNoB,GAAWC,CAAC,EAEhBI,GAAcJ,CAAC,CAC1B,CAIA,MAAM6B,GAAe,CACjB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,MAC5B,EACO,SAASC,GAAcC,EAAO,CACjC,MAAMC,EAAU,CACZ,MAAO,SACP,MAAO,SACP,KAAM,QACd,EACU/J,EAAO4J,GAAa,OAAO,CAAC3D,EAAKL,KACnCK,EAAIL,CAAG,EAAI,WACJK,GACR8D,CAAO,EACV,OAAA3E,GAAe0E,EAAO9J,CAAI,EAInB8J,CACX,CAMO,SAASE,GAAMzC,EAAI1N,EAAKkN,EAAO,CAClC,GAAIA,EAAQnE,EACR,MAAM,IAAI,MAAM,yCAAyC,EAC7D,GAAImE,IAAUnE,EACV,OAAO2E,EAAG,IACd,GAAIR,IAAUlE,EACV,OAAOhJ,EACX,IAAInE,EAAI6R,EAAG,IACP3O,EAAIiB,EACR,KAAOkN,EAAQnE,GACPmE,EAAQlE,IACRnN,EAAI6R,EAAG,IAAI7R,EAAGkD,CAAC,GACnBA,EAAI2O,EAAG,IAAI3O,CAAC,EACZmO,IAAUlE,EAEd,OAAOnN,CACX,CAMO,SAASuU,GAAc1C,EAAI2C,EAAMC,EAAW,GAAO,CACtD,MAAMC,EAAW,IAAI,MAAMF,EAAK,MAAM,EAAE,KAAKC,EAAW5C,EAAG,KAAO,MAAS,EAErE8C,EAAgBH,EAAK,OAAO,CAACI,EAAKzQ,EAAKlC,IACrC4P,EAAG,IAAI1N,CAAG,EACHyQ,GACXF,EAASzS,CAAC,EAAI2S,EACP/C,EAAG,IAAI+C,EAAKzQ,CAAG,GACvB0N,EAAG,GAAG,EAEHgD,EAAchD,EAAG,IAAI8C,CAAa,EAExC,OAAAH,EAAK,YAAY,CAACI,EAAKzQ,EAAKlC,IACpB4P,EAAG,IAAI1N,CAAG,EACHyQ,GACXF,EAASzS,CAAC,EAAI4P,EAAG,IAAI+C,EAAKF,EAASzS,CAAC,CAAC,EAC9B4P,EAAG,IAAI+C,EAAKzQ,CAAG,GACvB0Q,CAAW,EACPH,CACX,CAcO,SAASjB,GAAW5B,EAAI7Q,EAAG,CAG9B,MAAM8T,GAAUjD,EAAG,MAAQ1E,GAAOuD,GAC5BqE,EAAUlD,EAAG,IAAI7Q,EAAG8T,CAAM,EAC1BE,EAAMnD,EAAG,IAAIkD,EAASlD,EAAG,GAAG,EAC5BoD,EAAOpD,EAAG,IAAIkD,EAASlD,EAAG,IAAI,EAC9BqD,EAAKrD,EAAG,IAAIkD,EAASlD,EAAG,IAAIA,EAAG,GAAG,CAAC,EACzC,GAAI,CAACmD,GAAO,CAACC,GAAQ,CAACC,EAClB,MAAM,IAAI,MAAM,gCAAgC,EACpD,OAAOF,EAAM,EAAIC,EAAO,EAAI,EAChC,CAOO,SAASE,GAAQnU,EAAGoU,EAAY,CAE/BA,IAAe,QACfrU,GAAQqU,CAAU,EACtB,MAAMC,EAAcD,IAAe,OAAYA,EAAapU,EAAE,SAAS,CAAC,EAAE,OACpEsU,EAAc,KAAK,KAAKD,EAAc,CAAC,EAC7C,MAAO,CAAE,WAAYA,EAAa,YAAAC,CAAW,CACjD,CACA,MAAMC,EAAO,CACT,MACA,KACA,MACA,KACA,KAAOrI,EACP,IAAMC,EACN,SACA,MACA,KACA,YAAYqI,EAAOlL,EAAO,GAAI,CAC1B,GAAIkL,GAAStI,EACT,MAAM,IAAI,MAAM,0CAA4CsI,CAAK,EACrE,IAAIC,EACJ,KAAK,KAAO,GACRnL,GAAQ,MAAQ,OAAOA,GAAS,WAC5B,OAAOA,EAAK,MAAS,WACrBmL,EAAcnL,EAAK,MACnB,OAAOA,EAAK,MAAS,aACrB,KAAK,KAAOA,EAAK,MACjB,OAAOA,EAAK,MAAS,YACrB,KAAK,KAAOA,EAAK,MACjBA,EAAK,iBACL,KAAK,SAAWA,EAAK,gBAAgB,MAAK,GAC1C,OAAOA,EAAK,cAAiB,YAC7B,KAAK,KAAOA,EAAK,eAEzB,KAAM,CAAE,WAAA8K,EAAY,YAAAE,CAAW,EAAKH,GAAQK,EAAOC,CAAW,EAC9D,GAAIH,EAAc,KACd,MAAM,IAAI,MAAM,gDAAgD,EACpE,KAAK,MAAQE,EACb,KAAK,KAAOJ,EACZ,KAAK,MAAQE,EACb,KAAK,MAAQ,OACb,OAAO,kBAAkB,IAAI,CACjC,CACA,OAAOnR,EAAK,CACR,OAAO+M,EAAI/M,EAAK,KAAK,KAAK,CAC9B,CACA,QAAQA,EAAK,CACT,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,+CAAiD,OAAOA,CAAG,EAC/E,OAAO+I,GAAO/I,GAAOA,EAAM,KAAK,KACpC,CACA,IAAIA,EAAK,CACL,OAAOA,IAAQ+I,CACnB,CAEA,YAAY/I,EAAK,CACb,MAAO,CAAC,KAAK,IAAIA,CAAG,GAAK,KAAK,QAAQA,CAAG,CAC7C,CACA,MAAMA,EAAK,CACP,OAAQA,EAAMgJ,KAASA,CAC3B,CACA,IAAIhJ,EAAK,CACL,OAAO+M,EAAI,CAAC/M,EAAK,KAAK,KAAK,CAC/B,CACA,IAAIuR,EAAKC,EAAK,CACV,OAAOD,IAAQC,CACnB,CACA,IAAIxR,EAAK,CACL,OAAO+M,EAAI/M,EAAMA,EAAK,KAAK,KAAK,CACpC,CACA,IAAIuR,EAAKC,EAAK,CACV,OAAOzE,EAAIwE,EAAMC,EAAK,KAAK,KAAK,CACpC,CACA,IAAID,EAAKC,EAAK,CACV,OAAOzE,EAAIwE,EAAMC,EAAK,KAAK,KAAK,CACpC,CACA,IAAID,EAAKC,EAAK,CACV,OAAOzE,EAAIwE,EAAMC,EAAK,KAAK,KAAK,CACpC,CACA,IAAIxR,EAAKkN,EAAO,CACZ,OAAOiD,GAAM,KAAMnQ,EAAKkN,CAAK,CACjC,CACA,IAAIqE,EAAKC,EAAK,CACV,OAAOzE,EAAIwE,EAAMnE,GAAOoE,EAAK,KAAK,KAAK,EAAG,KAAK,KAAK,CACxD,CAEA,KAAKxR,EAAK,CACN,OAAOA,EAAMA,CACjB,CACA,KAAKuR,EAAKC,EAAK,CACX,OAAOD,EAAMC,CACjB,CACA,KAAKD,EAAKC,EAAK,CACX,OAAOD,EAAMC,CACjB,CACA,KAAKD,EAAKC,EAAK,CACX,OAAOD,EAAMC,CACjB,CACA,IAAIxR,EAAK,CACL,OAAOoN,GAAOpN,EAAK,KAAK,KAAK,CACjC,CACA,KAAKA,EAAK,CAEN,OAAK,KAAK,QACN,KAAK,MAAQ8P,GAAO,KAAK,KAAK,GAC3B,KAAK,MAAM,KAAM9P,CAAG,CAC/B,CACA,QAAQA,EAAK,CACT,OAAO,KAAK,KAAO6J,GAAgB7J,EAAK,KAAK,KAAK,EAAI2J,GAAgB3J,EAAK,KAAK,KAAK,CACzF,CACA,UAAUE,EAAOuR,EAAiB,GAAO,CACrCvV,EAAOgE,CAAK,EACZ,KAAM,CAAE,SAAUwR,EAAgB,MAAAC,EAAO,KAAA3K,EAAM,MAAAqK,EAAO,KAAMO,CAAY,EAAK,KAC7E,GAAIF,EAAgB,CAChB,GAAI,CAACA,EAAe,SAASxR,EAAM,MAAM,GAAKA,EAAM,OAASyR,EACzD,MAAM,IAAI,MAAM,6BAA+BD,EAAiB,eAAiBxR,EAAM,MAAM,EAEjG,MAAM2R,EAAS,IAAI,WAAWF,CAAK,EAEnCE,EAAO,IAAI3R,EAAO8G,EAAO,EAAI6K,EAAO,OAAS3R,EAAM,MAAM,EACzDA,EAAQ2R,CACZ,CACA,GAAI3R,EAAM,SAAWyR,EACjB,MAAM,IAAI,MAAM,6BAA+BA,EAAQ,eAAiBzR,EAAM,MAAM,EACxF,IAAI4R,EAAS9K,EAAOwC,GAAgBtJ,CAAK,EAAIoJ,GAAgBpJ,CAAK,EAGlE,GAFI0R,IACAE,EAAS/E,EAAI+E,EAAQT,CAAK,GAC1B,CAACI,GACG,CAAC,KAAK,QAAQK,CAAM,EACpB,MAAM,IAAI,MAAM,kDAAkD,EAG1E,OAAOA,CACX,CAEA,YAAYC,EAAK,CACb,OAAO3B,GAAc,KAAM2B,CAAG,CAClC,CAGA,KAAK9V,EAAGE,EAAG6V,EAAW,CAClB,OAAOA,EAAY7V,EAAIF,CAC3B,CACJ,CAoBO,SAASmS,GAAMiD,EAAOlL,EAAO,GAAI,CACpC,OAAO,IAAIiL,GAAOC,EAAOlL,CAAI,CACjC,CAgCO,SAAS8L,GAAoBC,EAAY,CAC5C,GAAI,OAAOA,GAAe,SACtB,MAAM,IAAI,MAAM,4BAA4B,EAChD,MAAMC,EAAYD,EAAW,SAAS,CAAC,EAAE,OACzC,OAAO,KAAK,KAAKC,EAAY,CAAC,CAClC,CAQO,SAASC,GAAiBF,EAAY,CACzC,MAAMxO,EAASuO,GAAoBC,CAAU,EAC7C,OAAOxO,EAAS,KAAK,KAAKA,EAAS,CAAC,CACxC,CAcO,SAAS2O,GAAeC,EAAKJ,EAAYlL,EAAO,GAAO,CAC1D9K,EAAOoW,CAAG,EACV,MAAM3U,EAAM2U,EAAI,OACVC,EAAWN,GAAoBC,CAAU,EACzCM,EAASJ,GAAiBF,CAAU,EAE1C,GAAIvU,EAAM,IAAMA,EAAM6U,GAAU7U,EAAM,KAClC,MAAM,IAAI,MAAM,YAAc6U,EAAS,6BAA+B7U,CAAG,EAC7E,MAAMqC,EAAMgH,EAAOwC,GAAgB8I,CAAG,EAAIhJ,GAAgBgJ,CAAG,EAEvDG,EAAU1F,EAAI/M,EAAKkS,EAAalJ,CAAG,EAAIA,EAC7C,OAAOhC,EAAO6C,GAAgB4I,EAASF,CAAQ,EAAI5I,GAAgB8I,EAASF,CAAQ,CACxF,CCjiBA,MAAMxJ,GAAsB,OAAO,CAAC,EAC9BC,GAAsB,OAAO,CAAC,EAC7B,SAAS0J,GAASV,EAAWzV,EAAM,CACtC,MAAMoW,EAAMpW,EAAK,OAAM,EACvB,OAAOyV,EAAYW,EAAMpW,CAC7B,CAOO,SAASqW,GAAW7Q,EAAG8Q,EAAQ,CAClC,MAAMC,EAAa1C,GAAcrO,EAAE,GAAI8Q,EAAO,IAAKhX,GAAMA,EAAE,CAAC,CAAC,EAC7D,OAAOgX,EAAO,IAAI,CAAChX,EAAGiC,IAAMiE,EAAE,WAAWlG,EAAE,SAASiX,EAAWhV,CAAC,CAAC,CAAC,CAAC,CACvE,CACA,SAASiV,GAAUC,EAAG1U,EAAM,CACxB,GAAI,CAAC,OAAO,cAAc0U,CAAC,GAAKA,GAAK,GAAKA,EAAI1U,EAC1C,MAAM,IAAI,MAAM,qCAAuCA,EAAO,YAAc0U,CAAC,CACrF,CACA,SAASC,GAAUD,EAAGE,EAAY,CAC9BH,GAAUC,EAAGE,CAAU,EACvB,MAAMC,EAAU,KAAK,KAAKD,EAAaF,CAAC,EAAI,EACtCI,EAAa,IAAMJ,EAAI,GACvBK,EAAY,GAAKL,EACjBnT,EAAOuK,GAAQ4I,CAAC,EAChBM,EAAU,OAAON,CAAC,EACxB,MAAO,CAAE,QAAAG,EAAS,WAAAC,EAAY,KAAAvT,EAAM,UAAAwT,EAAW,QAAAC,CAAO,CAC1D,CACA,SAASC,GAAY1W,EAAG2W,EAAQC,EAAO,CACnC,KAAM,CAAE,WAAAL,EAAY,KAAAvT,EAAM,UAAAwT,EAAW,QAAAC,CAAO,EAAKG,EACjD,IAAIC,EAAQ,OAAO7W,EAAIgD,CAAI,EACvB8T,EAAQ9W,GAAKyW,EAMbI,EAAQN,IAERM,GAASL,EACTM,GAAS3K,IAEb,MAAM4K,EAAcJ,EAASJ,EACvB9K,EAASsL,EAAc,KAAK,IAAIF,CAAK,EAAI,EACzCG,EAASH,IAAU,EACnBI,EAAQJ,EAAQ,EAChBK,EAASP,EAAS,IAAM,EAE9B,MAAO,CAAE,MAAAG,EAAO,OAAArL,EAAQ,OAAAuL,EAAQ,MAAAC,EAAO,OAAAC,EAAQ,QAD/BH,CACsC,CAC1D,CAoBA,MAAMI,GAAmB,IAAI,QACvBC,GAAmB,IAAI,QAC7B,SAASC,GAAKhG,EAAG,CAGb,OAAO+F,GAAiB,IAAI/F,CAAC,GAAK,CACtC,CACA,SAASiG,GAAQtX,EAAG,CAChB,GAAIA,IAAMkM,GACN,MAAM,IAAI,MAAM,cAAc,CACtC,CAmBO,MAAMqL,EAAK,CACd,KACA,KACA,GACA,KAEA,YAAYC,EAAO/V,EAAM,CACrB,KAAK,KAAO+V,EAAM,KAClB,KAAK,KAAOA,EAAM,KAClB,KAAK,GAAKA,EAAM,GAChB,KAAK,KAAO/V,CAChB,CAEA,cAAcgW,EAAK,EAAGzY,EAAI,KAAK,KAAM,CACjC,IAAIkD,EAAIuV,EACR,KAAO,EAAIvL,IACH,EAAIC,KACJnN,EAAIA,EAAE,IAAIkD,CAAC,GACfA,EAAIA,EAAE,OAAM,EACZ,IAAMiK,GAEV,OAAOnN,CACX,CAaA,iBAAiB0Y,EAAOvB,EAAG,CACvB,KAAM,CAAE,QAAAG,EAAS,WAAAC,CAAU,EAAKH,GAAUD,EAAG,KAAK,IAAI,EAChDH,EAAS,CAAA,EACf,IAAIhX,EAAI0Y,EACJC,EAAO3Y,EACX,QAAS2X,EAAS,EAAGA,EAASL,EAASK,IAAU,CAC7CgB,EAAO3Y,EACPgX,EAAO,KAAK2B,CAAI,EAEhB,QAAS1W,EAAI,EAAGA,EAAIsV,EAAYtV,IAC5B0W,EAAOA,EAAK,IAAI3Y,CAAC,EACjBgX,EAAO,KAAK2B,CAAI,EAEpB3Y,EAAI2Y,EAAK,OAAM,CACnB,CACA,OAAO3B,CACX,CAOA,KAAKG,EAAGyB,EAAa5X,EAAG,CAEpB,GAAI,CAAC,KAAK,GAAG,QAAQA,CAAC,EAClB,MAAM,IAAI,MAAM,gBAAgB,EAEpC,IAAIhB,EAAI,KAAK,KACTqQ,EAAI,KAAK,KAMb,MAAMwI,EAAKzB,GAAUD,EAAG,KAAK,IAAI,EACjC,QAASQ,EAAS,EAAGA,EAASkB,EAAG,QAASlB,IAAU,CAEhD,KAAM,CAAE,MAAAG,EAAO,OAAArL,EAAQ,OAAAuL,EAAQ,MAAAC,EAAO,OAAAC,EAAQ,QAAAY,CAAO,EAAKpB,GAAY1W,EAAG2W,EAAQkB,CAAE,EACnF7X,EAAI8W,EACAE,EAGA3H,EAAIA,EAAE,IAAIwG,GAASqB,EAAQU,EAAYE,CAAO,CAAC,CAAC,EAIhD9Y,EAAIA,EAAE,IAAI6W,GAASoB,EAAOW,EAAYnM,CAAM,CAAC,CAAC,CAEtD,CACA,OAAA6L,GAAQtX,CAAC,EAIF,CAAE,EAAAhB,EAAG,EAAAqQ,CAAC,CACjB,CAMA,WAAW8G,EAAGyB,EAAa5X,EAAG4T,EAAM,KAAK,KAAM,CAC3C,MAAMiE,EAAKzB,GAAUD,EAAG,KAAK,IAAI,EACjC,QAASQ,EAAS,EAAGA,EAASkB,EAAG,SACzB7X,IAAMkM,GAD4ByK,IAAU,CAGhD,KAAM,CAAE,MAAAG,EAAO,OAAArL,EAAQ,OAAAuL,EAAQ,MAAAC,CAAK,EAAKP,GAAY1W,EAAG2W,EAAQkB,CAAE,EAElE,GADA7X,EAAI8W,EACA,CAAAE,EAKC,CACD,MAAMtX,EAAOkY,EAAYnM,CAAM,EAC/BmI,EAAMA,EAAI,IAAIqD,EAAQvX,EAAK,OAAM,EAAKA,CAAI,CAC9C,CACJ,CACA,OAAA4X,GAAQtX,CAAC,EACF4T,CACX,CACA,eAAeuC,EAAGuB,EAAOK,EAAW,CAEhC,IAAIC,EAAOb,GAAiB,IAAIO,CAAK,EACrC,OAAKM,IACDA,EAAO,KAAK,iBAAiBN,EAAOvB,CAAC,EACjCA,IAAM,IAEF,OAAO4B,GAAc,aACrBC,EAAOD,EAAUC,CAAI,GACzBb,GAAiB,IAAIO,EAAOM,CAAI,IAGjCA,CACX,CACA,OAAON,EAAOzC,EAAQ8C,EAAW,CAC7B,MAAM5B,EAAIkB,GAAKK,CAAK,EACpB,OAAO,KAAK,KAAKvB,EAAG,KAAK,eAAeA,EAAGuB,EAAOK,CAAS,EAAG9C,CAAM,CACxE,CACA,OAAOyC,EAAOzC,EAAQ8C,EAAWE,EAAM,CACnC,MAAM9B,EAAIkB,GAAKK,CAAK,EACpB,OAAIvB,IAAM,EACC,KAAK,cAAcuB,EAAOzC,EAAQgD,CAAI,EAC1C,KAAK,WAAW9B,EAAG,KAAK,eAAeA,EAAGuB,EAAOK,CAAS,EAAG9C,EAAQgD,CAAI,CACpF,CAIA,YAAY5G,EAAG8E,EAAG,CACdD,GAAUC,EAAG,KAAK,IAAI,EACtBiB,GAAiB,IAAI/F,EAAG8E,CAAC,EACzBgB,GAAiB,OAAO9F,CAAC,CAC7B,CACA,SAASoG,EAAK,CACV,OAAOJ,GAAKI,CAAG,IAAM,CACzB,CACJ,CAKO,SAASS,GAAcV,EAAOE,EAAOS,EAAIC,EAAI,CAChD,IAAIxE,EAAM8D,EACNW,EAAKb,EAAM,KACXc,EAAKd,EAAM,KACf,KAAOW,EAAKjM,IAAOkM,EAAKlM,IAChBiM,EAAKhM,KACLkM,EAAKA,EAAG,IAAIzE,CAAG,GACfwE,EAAKjM,KACLmM,EAAKA,EAAG,IAAI1E,CAAG,GACnBA,EAAMA,EAAI,OAAM,EAChBuE,IAAOhM,GACPiM,IAAOjM,GAEX,MAAO,CAAE,GAAAkM,EAAI,GAAAC,CAAE,CACnB,CA2IA,SAASC,GAAYC,EAAOpF,EAAOjJ,EAAM,CACrC,GAAIiJ,EAAO,CACP,GAAIA,EAAM,QAAUoF,EAChB,MAAM,IAAI,MAAM,gDAAgD,EACpE,OAAArF,GAAcC,CAAK,EACZA,CACX,KAEI,QAAO7B,GAAMiH,EAAO,CAAE,KAAArO,EAAM,CAEpC,CAEO,SAASsO,GAAkBC,EAAMC,EAAOC,EAAY,CAAA,EAAIC,EAAQ,CAGnE,GAFIA,IAAW,SACXA,EAASH,IAAS,WAClB,CAACC,GAAS,OAAOA,GAAU,SAC3B,MAAM,IAAI,MAAM,kBAAkBD,CAAI,eAAe,EACzD,UAAW1Z,IAAK,CAAC,IAAK,IAAK,GAAG,EAAG,CAC7B,MAAMkQ,EAAMyJ,EAAM3Z,CAAC,EACnB,GAAI,EAAE,OAAOkQ,GAAQ,UAAYA,EAAMhD,IACnC,MAAM,IAAI,MAAM,SAASlN,CAAC,0BAA0B,CAC5D,CACA,MAAM6R,EAAK0H,GAAYI,EAAM,EAAGC,EAAU,GAAIC,CAAM,EAC9CC,EAAKP,GAAYI,EAAM,EAAGC,EAAU,GAAIC,CAAM,EAE9CE,EAAS,CAAC,KAAM,KAAM,IADQ,GACD,EACnC,UAAW/Z,KAAK+Z,EAEZ,GAAI,CAAClI,EAAG,QAAQ8H,EAAM3Z,CAAC,CAAC,EACpB,MAAM,IAAI,MAAM,SAASA,CAAC,0CAA0C,EAE5E,OAAA2Z,EAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,EAAIA,CAAK,CAAC,EACvC,CAAE,MAAAA,EAAO,GAAA9H,EAAI,GAAAiI,CAAE,CAC1B,CACO,SAASE,GAAaC,EAAiBC,EAAc,CACxD,OAAO,SAAgB5K,EAAM,CACzB,MAAM6K,EAAYF,EAAgB3K,CAAI,EACtC,MAAO,CAAE,UAAA6K,EAAW,UAAWD,EAAaC,CAAS,CAAC,CAC1D,CACJ,CCjcO,MAAMC,EAAM,CACf,MACA,MACA,SACA,UACA,SAAW,GACX,UAAY,GACZ,YAAYC,EAAM5D,EAAK,CAInB,GAHAxO,GAAMoS,CAAI,EACVha,EAAOoW,EAAK,OAAW,KAAK,EAC5B,KAAK,MAAQ4D,EAAK,OAAM,EACpB,OAAO,KAAK,MAAM,QAAW,WAC7B,MAAM,IAAI,MAAM,qDAAqD,EACzE,KAAK,SAAW,KAAK,MAAM,SAC3B,KAAK,UAAY,KAAK,MAAM,UAC5B,MAAMrP,EAAW,KAAK,SAChBhB,EAAM,IAAI,WAAWgB,CAAQ,EAEnChB,EAAI,IAAIyM,EAAI,OAASzL,EAAWqP,EAAK,OAAM,EAAG,OAAO5D,CAAG,EAAE,OAAM,EAAKA,CAAG,EACxE,QAASxU,EAAI,EAAGA,EAAI+H,EAAI,OAAQ/H,IAC5B+H,EAAI/H,CAAC,GAAK,GACd,KAAK,MAAM,OAAO+H,CAAG,EAErB,KAAK,MAAQqQ,EAAK,OAAM,EAExB,QAASpY,EAAI,EAAGA,EAAI+H,EAAI,OAAQ/H,IAC5B+H,EAAI/H,CAAC,GAAK,IACd,KAAK,MAAM,OAAO+H,CAAG,EACrBvB,GAAMuB,CAAG,CACb,CACA,OAAOsQ,EAAK,CACR,OAAAnS,GAAQ,IAAI,EACZ,KAAK,MAAM,OAAOmS,CAAG,EACd,IACX,CACA,WAAW/R,EAAK,CACZJ,GAAQ,IAAI,EACZ9H,EAAOkI,EAAK,KAAK,UAAW,QAAQ,EACpC,KAAK,SAAW,GAChB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,MAAM,OAAOA,CAAG,EACrB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,QAAO,CAChB,CACA,QAAS,CACL,MAAMA,EAAM,IAAI,WAAW,KAAK,MAAM,SAAS,EAC/C,YAAK,WAAWA,CAAG,EACZA,CACX,CACA,WAAWhG,EAAI,CAEXA,IAAO,OAAO,OAAO,OAAO,eAAe,IAAI,EAAG,EAAE,EACpD,KAAM,CAAE,MAAAgY,EAAO,MAAAC,EAAO,SAAA7O,EAAU,UAAAC,EAAW,SAAAZ,EAAU,UAAAC,CAAS,EAAK,KACnE,OAAA1I,EAAKA,EACLA,EAAG,SAAWoJ,EACdpJ,EAAG,UAAYqJ,EACfrJ,EAAG,SAAWyI,EACdzI,EAAG,UAAY0I,EACf1I,EAAG,MAAQgY,EAAM,WAAWhY,EAAG,KAAK,EACpCA,EAAG,MAAQiY,EAAM,WAAWjY,EAAG,KAAK,EAC7BA,CACX,CACA,OAAQ,CACJ,OAAO,KAAK,WAAU,CAC1B,CACA,SAAU,CACN,KAAK,UAAY,GACjB,KAAK,MAAM,QAAO,EAClB,KAAK,MAAM,QAAO,CACtB,CACJ,CAWO,MAAMkY,GAAO,CAACJ,EAAM5D,EAAKiE,IAAY,IAAIN,GAAMC,EAAM5D,CAAG,EAAE,OAAOiE,CAAO,EAAE,OAAM,EACvFD,GAAK,OAAS,CAACJ,EAAM5D,IAAQ,IAAI2D,GAAMC,EAAM5D,CAAG,ECvDhD,MAAMkE,GAAa,CAACxW,EAAKyW,KAASzW,GAAOA,GAAO,EAAIyW,EAAM,CAACA,GAAOlK,IAAOkK,EAIlE,SAASC,GAAiB5L,EAAG6L,EAAO,EAAG,CAI1C,KAAM,CAAC,CAACC,EAAIC,CAAE,EAAG,CAACC,EAAIC,CAAE,CAAC,EAAIJ,EACvBpI,EAAKiI,GAAWO,EAAKjM,EAAG,CAAC,EACzB0D,EAAKgI,GAAW,CAACK,EAAK/L,EAAG,CAAC,EAGhC,IAAIkK,EAAKlK,EAAIyD,EAAKqI,EAAKpI,EAAKsI,EACxB7B,EAAK,CAAC1G,EAAKsI,EAAKrI,EAAKuI,EACzB,MAAMC,EAAQhC,EAAKjM,GACbkO,EAAQhC,EAAKlM,GACfiO,IACAhC,EAAK,CAACA,GACNiC,IACAhC,EAAK,CAACA,GAGV,MAAMiC,EAAU9M,GAAQ,KAAK,KAAKD,GAAO,CAAC,EAAI,CAAC,CAAC,EAAInB,GACpD,GAAIgM,EAAKjM,IAAOiM,GAAMkC,GAAWjC,EAAKlM,IAAOkM,GAAMiC,EAC/C,MAAM,IAAI,MAAM,yCAA2CpM,CAAC,EAEhE,MAAO,CAAE,MAAAkM,EAAO,GAAAhC,EAAI,MAAAiC,EAAO,GAAAhC,CAAE,CACjC,CACA,SAASkC,GAAkBC,EAAQ,CAC/B,GAAI,CAAC,CAAC,UAAW,YAAa,KAAK,EAAE,SAASA,CAAM,EAChD,MAAM,IAAI,MAAM,2DAA2D,EAC/E,OAAOA,CACX,CACA,SAASC,GAAgBlR,EAAMmR,EAAK,CAChC,MAAMC,EAAQ,CAAA,EACd,QAASC,KAAW,OAAO,KAAKF,CAAG,EAE/BC,EAAMC,CAAO,EAAIrR,EAAKqR,CAAO,IAAM,OAAYF,EAAIE,CAAO,EAAIrR,EAAKqR,CAAO,EAE9E,OAAAvO,GAAMsO,EAAM,KAAM,MAAM,EACxBtO,GAAMsO,EAAM,QAAS,SAAS,EAC1BA,EAAM,SAAW,QACjBJ,GAAkBI,EAAM,MAAM,EAC3BA,CACX,CACO,MAAME,WAAe,KAAM,CAC9B,YAAY9c,EAAI,GAAI,CAChB,MAAMA,CAAC,CACX,CACJ,CAQO,MAAM+c,GAAM,CAEf,IAAKD,GAEL,KAAM,CACF,OAAQ,CAACE,EAAKnZ,IAAS,CACnB,KAAM,CAAE,IAAK0J,CAAC,EAAKwP,GACnB,GAAIC,EAAM,GAAKA,EAAM,IACjB,MAAM,IAAIzP,EAAE,uBAAuB,EACvC,GAAI1J,EAAK,OAAS,EACd,MAAM,IAAI0J,EAAE,2BAA2B,EAC3C,MAAM0P,EAAUpZ,EAAK,OAAS,EACxBb,EAAMyL,GAAoBwO,CAAO,EACvC,GAAKja,EAAI,OAAS,EAAK,IACnB,MAAM,IAAIuK,EAAE,sCAAsC,EAEtD,MAAM2P,EAASD,EAAU,IAAMxO,GAAqBzL,EAAI,OAAS,EAAK,GAAW,EAAI,GAErF,OADUyL,GAAoBuO,CAAG,EACtBE,EAASla,EAAMa,CAC9B,EAEA,OAAOmZ,EAAKnZ,EAAM,CACd,KAAM,CAAE,IAAK0J,CAAC,EAAKwP,GACnB,IAAI7Y,EAAM,EACV,GAAI8Y,EAAM,GAAKA,EAAM,IACjB,MAAM,IAAIzP,EAAE,uBAAuB,EACvC,GAAI1J,EAAK,OAAS,GAAKA,EAAKK,GAAK,IAAM8Y,EACnC,MAAM,IAAIzP,EAAE,uBAAuB,EACvC,MAAM4P,EAAQtZ,EAAKK,GAAK,EAClBkZ,EAAS,CAAC,EAAED,EAAQ,KAC1B,IAAIpU,EAAS,EACb,GAAI,CAACqU,EACDrU,EAASoU,MACR,CAED,MAAMD,EAASC,EAAQ,IACvB,GAAI,CAACD,EACD,MAAM,IAAI3P,EAAE,mDAAmD,EACnE,GAAI2P,EAAS,EACT,MAAM,IAAI3P,EAAE,0CAA0C,EAC1D,MAAM8P,EAAcxZ,EAAK,SAASK,EAAKA,EAAMgZ,CAAM,EACnD,GAAIG,EAAY,SAAWH,EACvB,MAAM,IAAI3P,EAAE,uCAAuC,EACvD,GAAI8P,EAAY,CAAC,IAAM,EACnB,MAAM,IAAI9P,EAAE,sCAAsC,EACtD,UAAW/L,KAAK6b,EACZtU,EAAUA,GAAU,EAAKvH,EAE7B,GADA0C,GAAOgZ,EACHnU,EAAS,IACT,MAAM,IAAIwE,EAAE,wCAAwC,CAC5D,CACA,MAAMlG,EAAIxD,EAAK,SAASK,EAAKA,EAAM6E,CAAM,EACzC,GAAI1B,EAAE,SAAW0B,EACb,MAAM,IAAIwE,EAAE,gCAAgC,EAChD,MAAO,CAAE,EAAAlG,EAAG,EAAGxD,EAAK,SAASK,EAAM6E,CAAM,CAAC,CAC9C,CACR,EAKI,KAAM,CACF,OAAO1D,EAAK,CACR,KAAM,CAAE,IAAKkI,CAAC,EAAKwP,GACnB,GAAI1X,EAAM+I,GACN,MAAM,IAAIb,EAAE,4CAA4C,EAC5D,IAAI3E,EAAM6F,GAAoBpJ,CAAG,EAIjC,GAFI,OAAO,SAASuD,EAAI,CAAC,EAAG,EAAE,EAAI,IAC9BA,EAAM,KAAOA,GACbA,EAAI,OAAS,EACb,MAAM,IAAI2E,EAAE,gDAAgD,EAChE,OAAO3E,CACX,EACA,OAAO/E,EAAM,CACT,KAAM,CAAE,IAAK0J,CAAC,EAAKwP,GACnB,GAAIlZ,EAAK,CAAC,EAAI,IACV,MAAM,IAAI0J,EAAE,qCAAqC,EACrD,GAAI1J,EAAK,CAAC,IAAM,GAAQ,EAAEA,EAAK,CAAC,EAAI,KAChC,MAAM,IAAI0J,EAAE,qDAAqD,EACrE,OAAOoB,GAAgB9K,CAAI,CAC/B,CACR,EACI,MAAM0B,EAAO,CAET,KAAM,CAAE,IAAKgI,EAAG,KAAM+P,EAAK,KAAMC,CAAG,EAAKR,GACnClZ,EAAOtC,EAAOgE,EAAO,OAAW,WAAW,EAC3C,CAAE,EAAGiY,EAAU,EAAGC,CAAY,EAAKF,EAAI,OAAO,GAAM1Z,CAAI,EAC9D,GAAI4Z,EAAa,OACb,MAAM,IAAIlQ,EAAE,6CAA6C,EAC7D,KAAM,CAAE,EAAGmQ,EAAQ,EAAGC,CAAU,EAAKJ,EAAI,OAAO,EAAMC,CAAQ,EACxD,CAAE,EAAGI,EAAQ,EAAGC,CAAU,EAAKN,EAAI,OAAO,EAAMI,CAAU,EAChE,GAAIE,EAAW,OACX,MAAM,IAAItQ,EAAE,6CAA6C,EAC7D,MAAO,CAAE,EAAG+P,EAAI,OAAOI,CAAM,EAAG,EAAGJ,EAAI,OAAOM,CAAM,CAAC,CACzD,EACA,WAAWE,EAAK,CACZ,KAAM,CAAE,KAAMP,EAAK,KAAMD,CAAG,EAAKP,GAC3BgB,EAAKR,EAAI,OAAO,EAAMD,EAAI,OAAOQ,EAAI,CAAC,CAAC,EACvCE,EAAKT,EAAI,OAAO,EAAMD,EAAI,OAAOQ,EAAI,CAAC,CAAC,EACvCG,EAAMF,EAAKC,EACjB,OAAOT,EAAI,OAAO,GAAMU,CAAG,CAC/B,CACJ,EAGM7P,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGuD,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAoBjF,SAASoM,GAAYjD,EAAQkD,EAAY,GAAI,CAChD,MAAMC,EAAYzD,GAAkB,cAAeM,EAAQkD,CAAS,EAC9D,CAAE,GAAApL,EAAI,GAAAiI,CAAE,EAAKoD,EACnB,IAAIvD,EAAQuD,EAAU,MACtB,KAAM,CAAE,EAAGC,EAAU,EAAGC,CAAW,EAAKzD,EACxCjK,GAAeuN,EAAW,GAAI,CAC1B,mBAAoB,UACpB,cAAe,WACf,cAAe,WACf,UAAW,WACX,QAAS,WACT,KAAM,QACd,CAAK,EACD,KAAM,CAAE,KAAAI,CAAI,EAAKJ,EACjB,GAAII,IAEI,CAACxL,EAAG,IAAI8H,EAAM,CAAC,GAAK,OAAO0D,EAAK,MAAS,UAAY,CAAC,MAAM,QAAQA,EAAK,OAAO,GAChF,MAAM,IAAI,MAAM,4DAA4D,EAGpF,MAAMC,EAAUC,GAAY1L,EAAIiI,CAAE,EAClC,SAAS0D,GAA+B,CACpC,GAAI,CAAC3L,EAAG,MACJ,MAAM,IAAI,MAAM,4DAA4D,CACpF,CAEA,SAAS4L,EAAaC,EAAIhF,EAAOiF,EAAc,CAC3C,KAAM,CAAE,EAAAlc,EAAG,EAAAmc,GAAMlF,EAAM,SAAQ,EACzBmF,EAAKhM,EAAG,QAAQpQ,CAAC,EAEvB,GADA2L,GAAMuQ,EAAc,cAAc,EAC9BA,EAAc,CACdH,EAA4B,EAC5B,MAAMM,EAAW,CAACjM,EAAG,MAAM+L,CAAC,EAC5B,OAAO7T,GAAYgU,GAAQD,CAAQ,EAAGD,CAAE,CAC5C,KAEI,QAAO9T,GAAY,WAAW,GAAG,CAAI,EAAG8T,EAAIhM,EAAG,QAAQ+L,CAAC,CAAC,CAEjE,CACA,SAASI,EAAe3Z,EAAO,CAC3BhE,EAAOgE,EAAO,OAAW,OAAO,EAChC,KAAM,CAAE,UAAW2U,EAAM,sBAAuBiF,CAAM,EAAKX,EACrDzV,EAASxD,EAAM,OACf6Z,EAAO7Z,EAAM,CAAC,EACd8Z,EAAO9Z,EAAM,SAAS,CAAC,EAE7B,GAAIwD,IAAWmR,IAASkF,IAAS,GAAQA,IAAS,GAAO,CACrD,MAAMzc,EAAIoQ,EAAG,UAAUsM,CAAI,EAC3B,GAAI,CAACtM,EAAG,QAAQpQ,CAAC,EACb,MAAM,IAAI,MAAM,qCAAqC,EACzD,MAAM2c,EAAKC,EAAoB5c,CAAC,EAChC,IAAImc,EACJ,GAAI,CACAA,EAAI/L,EAAG,KAAKuM,CAAE,CAClB,OACOE,EAAW,CACd,MAAMC,EAAMD,aAAqB,MAAQ,KAAOA,EAAU,QAAU,GACpE,MAAM,IAAI,MAAM,yCAA2CC,CAAG,CAClE,CACAf,EAA4B,EAC5B,MAAMgB,EAAQ3M,EAAG,MAAM+L,CAAC,EAExB,OADeM,EAAO,KAAO,IACfM,IACVZ,EAAI/L,EAAG,IAAI+L,CAAC,GACT,CAAE,EAAAnc,EAAG,EAAAmc,CAAC,CACjB,SACS/V,IAAWoW,GAAUC,IAAS,EAAM,CAEzC,MAAMO,EAAI5M,EAAG,MACP,EAAIA,EAAG,UAAUsM,EAAK,SAAS,EAAGM,CAAC,CAAC,EACpCb,EAAI/L,EAAG,UAAUsM,EAAK,SAASM,EAAGA,EAAI,CAAC,CAAC,EAC9C,GAAI,CAACC,EAAU,EAAGd,CAAC,EACf,MAAM,IAAI,MAAM,4BAA4B,EAChD,MAAO,CAAE,EAAG,EAAAA,CAAC,CACjB,KAEI,OAAM,IAAI,MAAM,yBAAyB/V,CAAM,yBAAyBmR,CAAI,oBAAoBiF,CAAM,EAAE,CAEhH,CACA,MAAMU,EAAc1B,EAAU,SAAWQ,EACnCmB,EAAc3B,EAAU,WAAae,EAC3C,SAASK,EAAoB5c,EAAG,CAC5B,MAAMod,EAAKhN,EAAG,IAAIpQ,CAAC,EACbqd,EAAKjN,EAAG,IAAIgN,EAAIpd,CAAC,EACvB,OAAOoQ,EAAG,IAAIA,EAAG,IAAIiN,EAAIjN,EAAG,IAAIpQ,EAAGkY,EAAM,CAAC,CAAC,EAAGA,EAAM,CAAC,CACzD,CAGA,SAAS+E,EAAUjd,EAAGmc,EAAG,CACrB,MAAMmB,EAAOlN,EAAG,IAAI+L,CAAC,EACfoB,EAAQX,EAAoB5c,CAAC,EACnC,OAAOoQ,EAAG,IAAIkN,EAAMC,CAAK,CAC7B,CAGA,GAAI,CAACN,EAAU/E,EAAM,GAAIA,EAAM,EAAE,EAC7B,MAAM,IAAI,MAAM,mCAAmC,EAGvD,MAAMsF,EAAOpN,EAAG,IAAIA,EAAG,IAAI8H,EAAM,EAAGhJ,EAAG,EAAGC,EAAG,EACvCsO,EAAQrN,EAAG,IAAIA,EAAG,IAAI8H,EAAM,CAAC,EAAG,OAAO,EAAE,CAAC,EAChD,GAAI9H,EAAG,IAAIA,EAAG,IAAIoN,EAAMC,CAAK,CAAC,EAC1B,MAAM,IAAI,MAAM,0BAA0B,EAE9C,SAASC,EAAOxX,EAAO3G,EAAGoe,EAAU,GAAO,CACvC,GAAI,CAACvN,EAAG,QAAQ7Q,CAAC,GAAMoe,GAAWvN,EAAG,IAAI7Q,CAAC,EACtC,MAAM,IAAI,MAAM,wBAAwB2G,CAAK,EAAE,EACnD,OAAO3G,CACX,CACA,SAASqe,EAAUC,EAAO,CACtB,GAAI,EAAEA,aAAiB9G,GACnB,MAAM,IAAI,MAAM,4BAA4B,CACpD,CACA,SAAS+G,EAAiBtQ,EAAG,CACzB,GAAI,CAACoO,GAAQ,CAACA,EAAK,QACf,MAAM,IAAI,MAAM,SAAS,EAC7B,OAAOxC,GAAiB5L,EAAGoO,EAAK,QAASvD,EAAG,KAAK,CACrD,CAKA,MAAM0F,EAAelP,GAAS,CAACtQ,EAAGyf,IAAO,CACrC,KAAM,CAAE,EAAAC,EAAG,EAAAC,EAAG,EAAApM,CAAC,EAAKvT,EAEpB,GAAI6R,EAAG,IAAI0B,EAAG1B,EAAG,GAAG,EAChB,MAAO,CAAE,EAAG6N,EAAG,EAAGC,CAAC,EACvB,MAAMC,EAAM5f,EAAE,IAAG,EAGbyf,GAAM,OACNA,EAAKG,EAAM/N,EAAG,IAAMA,EAAG,IAAI0B,CAAC,GAChC,MAAM9R,EAAIoQ,EAAG,IAAI6N,EAAGD,CAAE,EAChB7B,EAAI/L,EAAG,IAAI8N,EAAGF,CAAE,EAChBI,EAAKhO,EAAG,IAAI0B,EAAGkM,CAAE,EACvB,GAAIG,EACA,MAAO,CAAE,EAAG/N,EAAG,KAAM,EAAGA,EAAG,IAAI,EACnC,GAAI,CAACA,EAAG,IAAIgO,EAAIhO,EAAG,GAAG,EAClB,MAAM,IAAI,MAAM,kBAAkB,EACtC,MAAO,CAAE,EAAApQ,EAAG,EAAAmc,CAAC,CACjB,CAAC,EAGKkC,GAAkBxP,GAAUtQ,GAAM,CACpC,GAAIA,EAAE,MAAO,CAIT,GAAIid,EAAU,oBAAsB,CAACpL,EAAG,IAAI7R,EAAE,CAAC,EAC3C,OACJ,MAAM,IAAI,MAAM,iBAAiB,CACrC,CAEA,KAAM,CAAE,EAAAyB,EAAG,EAAAmc,GAAM5d,EAAE,SAAQ,EAC3B,GAAI,CAAC6R,EAAG,QAAQpQ,CAAC,GAAK,CAACoQ,EAAG,QAAQ+L,CAAC,EAC/B,MAAM,IAAI,MAAM,sCAAsC,EAC1D,GAAI,CAACc,EAAUjd,EAAGmc,CAAC,EACf,MAAM,IAAI,MAAM,mCAAmC,EACvD,GAAI,CAAC5d,EAAE,cAAa,EAChB,MAAM,IAAI,MAAM,wCAAwC,EAC5D,MAAO,EACX,CAAC,EACD,SAAS+f,GAAWC,EAAUC,EAAKC,EAAK/E,EAAOC,EAAO,CAClD,OAAA8E,EAAM,IAAI1H,EAAM3G,EAAG,IAAIqO,EAAI,EAAGF,CAAQ,EAAGE,EAAI,EAAGA,EAAI,CAAC,EACrDD,EAAMpJ,GAASsE,EAAO8E,CAAG,EACzBC,EAAMrJ,GAASuE,EAAO8E,CAAG,EAClBD,EAAI,IAAIC,CAAG,CACtB,CAMA,MAAM1H,CAAM,CAER,OAAO,KAAO,IAAIA,EAAMmB,EAAM,GAAIA,EAAM,GAAI9H,EAAG,GAAG,EAElD,OAAO,KAAO,IAAI2G,EAAM3G,EAAG,KAAMA,EAAG,IAAKA,EAAG,IAAI,EAEhD,OAAO,GAAKA,EAEZ,OAAO,GAAKiI,EACZ,EACA,EACA,EAEA,YAAY4F,EAAGC,EAAGpM,EAAG,CACjB,KAAK,EAAI4L,EAAO,IAAKO,CAAC,EACtB,KAAK,EAAIP,EAAO,IAAKQ,EAAG,EAAI,EAC5B,KAAK,EAAIR,EAAO,IAAK5L,CAAC,EACtB,OAAO,OAAO,IAAI,CACtB,CACA,OAAO,OAAQ,CACX,OAAOoG,CACX,CAEA,OAAO,WAAW3Z,EAAG,CACjB,KAAM,CAAE,EAAAyB,EAAG,EAAAmc,CAAC,EAAK5d,GAAK,CAAA,EACtB,GAAI,CAACA,GAAK,CAAC6R,EAAG,QAAQpQ,CAAC,GAAK,CAACoQ,EAAG,QAAQ+L,CAAC,EACrC,MAAM,IAAI,MAAM,sBAAsB,EAC1C,GAAI5d,aAAawY,EACb,MAAM,IAAI,MAAM,8BAA8B,EAElD,OAAI3G,EAAG,IAAIpQ,CAAC,GAAKoQ,EAAG,IAAI+L,CAAC,EACdpF,EAAM,KACV,IAAIA,EAAM/W,EAAGmc,EAAG/L,EAAG,GAAG,CACjC,CACA,OAAO,UAAUxN,EAAO,CACpB,MAAMgO,EAAImG,EAAM,WAAWoG,EAAYve,EAAOgE,EAAO,OAAW,OAAO,CAAC,CAAC,EACzE,OAAAgO,EAAE,eAAc,EACTA,CACX,CACA,OAAO,QAAQ3K,EAAK,CAChB,OAAO8Q,EAAM,UAAUlP,GAAW5B,CAAG,CAAC,CAC1C,CACA,IAAI,GAAI,CACJ,OAAO,KAAK,SAAQ,EAAG,CAC3B,CACA,IAAI,GAAI,CACJ,OAAO,KAAK,SAAQ,EAAG,CAC3B,CAOA,WAAW6P,EAAa,EAAG4I,EAAS,GAAM,CACtC,OAAAC,GAAK,YAAY,KAAM7I,CAAU,EAC5B4I,GACD,KAAK,SAASxP,EAAG,EACd,IACX,CAGA,gBAAiB,CACbmP,GAAgB,IAAI,CACxB,CACA,UAAW,CACP,KAAM,CAAE,EAAAlC,CAAC,EAAK,KAAK,SAAQ,EAC3B,GAAI,CAAC/L,EAAG,MACJ,MAAM,IAAI,MAAM,6BAA6B,EACjD,MAAO,CAACA,EAAG,MAAM+L,CAAC,CACtB,CAEA,OAAO0B,EAAO,CACVD,EAAUC,CAAK,EACf,KAAM,CAAE,EAAGe,EAAI,EAAGC,EAAI,EAAGC,CAAE,EAAK,KAC1B,CAAE,EAAGC,EAAI,EAAGC,EAAI,EAAGC,CAAE,EAAKpB,EAC1BqB,EAAK9O,EAAG,IAAIA,EAAG,IAAIwO,EAAIK,CAAE,EAAG7O,EAAG,IAAI2O,EAAID,CAAE,CAAC,EAC1CK,EAAK/O,EAAG,IAAIA,EAAG,IAAIyO,EAAII,CAAE,EAAG7O,EAAG,IAAI4O,EAAIF,CAAE,CAAC,EAChD,OAAOI,GAAMC,CACjB,CAEA,QAAS,CACL,OAAO,IAAIpI,EAAM,KAAK,EAAG3G,EAAG,IAAI,KAAK,CAAC,EAAG,KAAK,CAAC,CACnD,CAKA,QAAS,CACL,KAAM,CAAE,EAAAzR,EAAG,EAAAE,CAAC,EAAKqZ,EACXkH,EAAKhP,EAAG,IAAIvR,EAAGqQ,EAAG,EAClB,CAAE,EAAG0P,EAAI,EAAGC,EAAI,EAAGC,CAAE,EAAK,KAChC,IAAIO,EAAKjP,EAAG,KAAMkP,EAAKlP,EAAG,KAAMmP,EAAKnP,EAAG,KACpCoP,EAAKpP,EAAG,IAAIwO,EAAIA,CAAE,EAClBa,EAAKrP,EAAG,IAAIyO,EAAIA,CAAE,EAClBa,EAAKtP,EAAG,IAAI0O,EAAIA,CAAE,EAClBa,EAAKvP,EAAG,IAAIwO,EAAIC,CAAE,EACtB,OAAAc,EAAKvP,EAAG,IAAIuP,EAAIA,CAAE,EAClBJ,EAAKnP,EAAG,IAAIwO,EAAIE,CAAE,EAClBS,EAAKnP,EAAG,IAAImP,EAAIA,CAAE,EAClBF,EAAKjP,EAAG,IAAIzR,EAAG4gB,CAAE,EACjBD,EAAKlP,EAAG,IAAIgP,EAAIM,CAAE,EAClBJ,EAAKlP,EAAG,IAAIiP,EAAIC,CAAE,EAClBD,EAAKjP,EAAG,IAAIqP,EAAIH,CAAE,EAClBA,EAAKlP,EAAG,IAAIqP,EAAIH,CAAE,EAClBA,EAAKlP,EAAG,IAAIiP,EAAIC,CAAE,EAClBD,EAAKjP,EAAG,IAAIuP,EAAIN,CAAE,EAClBE,EAAKnP,EAAG,IAAIgP,EAAIG,CAAE,EAClBG,EAAKtP,EAAG,IAAIzR,EAAG+gB,CAAE,EACjBC,EAAKvP,EAAG,IAAIoP,EAAIE,CAAE,EAClBC,EAAKvP,EAAG,IAAIzR,EAAGghB,CAAE,EACjBA,EAAKvP,EAAG,IAAIuP,EAAIJ,CAAE,EAClBA,EAAKnP,EAAG,IAAIoP,EAAIA,CAAE,EAClBA,EAAKpP,EAAG,IAAImP,EAAIC,CAAE,EAClBA,EAAKpP,EAAG,IAAIoP,EAAIE,CAAE,EAClBF,EAAKpP,EAAG,IAAIoP,EAAIG,CAAE,EAClBL,EAAKlP,EAAG,IAAIkP,EAAIE,CAAE,EAClBE,EAAKtP,EAAG,IAAIyO,EAAIC,CAAE,EAClBY,EAAKtP,EAAG,IAAIsP,EAAIA,CAAE,EAClBF,EAAKpP,EAAG,IAAIsP,EAAIC,CAAE,EAClBN,EAAKjP,EAAG,IAAIiP,EAAIG,CAAE,EAClBD,EAAKnP,EAAG,IAAIsP,EAAID,CAAE,EAClBF,EAAKnP,EAAG,IAAImP,EAAIA,CAAE,EAClBA,EAAKnP,EAAG,IAAImP,EAAIA,CAAE,EACX,IAAIxI,EAAMsI,EAAIC,EAAIC,CAAE,CAC/B,CAKA,IAAI1B,EAAO,CACPD,EAAUC,CAAK,EACf,KAAM,CAAE,EAAGe,EAAI,EAAGC,EAAI,EAAGC,CAAE,EAAK,KAC1B,CAAE,EAAGC,EAAI,EAAGC,EAAI,EAAGC,CAAE,EAAKpB,EAChC,IAAIwB,EAAKjP,EAAG,KAAMkP,EAAKlP,EAAG,KAAMmP,EAAKnP,EAAG,KACxC,MAAMzR,EAAIuZ,EAAM,EACVkH,EAAKhP,EAAG,IAAI8H,EAAM,EAAGhJ,EAAG,EAC9B,IAAIsQ,EAAKpP,EAAG,IAAIwO,EAAIG,CAAE,EAClBU,EAAKrP,EAAG,IAAIyO,EAAIG,CAAE,EAClBU,EAAKtP,EAAG,IAAI0O,EAAIG,CAAE,EAClBU,GAAKvP,EAAG,IAAIwO,EAAIC,CAAE,EAClBe,EAAKxP,EAAG,IAAI2O,EAAIC,CAAE,EACtBW,GAAKvP,EAAG,IAAIuP,GAAIC,CAAE,EAClBA,EAAKxP,EAAG,IAAIoP,EAAIC,CAAE,EAClBE,GAAKvP,EAAG,IAAIuP,GAAIC,CAAE,EAClBA,EAAKxP,EAAG,IAAIwO,EAAIE,CAAE,EAClB,IAAIe,EAAKzP,EAAG,IAAI2O,EAAIE,CAAE,EACtB,OAAAW,EAAKxP,EAAG,IAAIwP,EAAIC,CAAE,EAClBA,EAAKzP,EAAG,IAAIoP,EAAIE,CAAE,EAClBE,EAAKxP,EAAG,IAAIwP,EAAIC,CAAE,EAClBA,EAAKzP,EAAG,IAAIyO,EAAIC,CAAE,EAClBO,EAAKjP,EAAG,IAAI4O,EAAIC,CAAE,EAClBY,EAAKzP,EAAG,IAAIyP,EAAIR,CAAE,EAClBA,EAAKjP,EAAG,IAAIqP,EAAIC,CAAE,EAClBG,EAAKzP,EAAG,IAAIyP,EAAIR,CAAE,EAClBE,EAAKnP,EAAG,IAAIzR,EAAGihB,CAAE,EACjBP,EAAKjP,EAAG,IAAIgP,EAAIM,CAAE,EAClBH,EAAKnP,EAAG,IAAIiP,EAAIE,CAAE,EAClBF,EAAKjP,EAAG,IAAIqP,EAAIF,CAAE,EAClBA,EAAKnP,EAAG,IAAIqP,EAAIF,CAAE,EAClBD,EAAKlP,EAAG,IAAIiP,EAAIE,CAAE,EAClBE,EAAKrP,EAAG,IAAIoP,EAAIA,CAAE,EAClBC,EAAKrP,EAAG,IAAIqP,EAAID,CAAE,EAClBE,EAAKtP,EAAG,IAAIzR,EAAG+gB,CAAE,EACjBE,EAAKxP,EAAG,IAAIgP,EAAIQ,CAAE,EAClBH,EAAKrP,EAAG,IAAIqP,EAAIC,CAAE,EAClBA,EAAKtP,EAAG,IAAIoP,EAAIE,CAAE,EAClBA,EAAKtP,EAAG,IAAIzR,EAAG+gB,CAAE,EACjBE,EAAKxP,EAAG,IAAIwP,EAAIF,CAAE,EAClBF,EAAKpP,EAAG,IAAIqP,EAAIG,CAAE,EAClBN,EAAKlP,EAAG,IAAIkP,EAAIE,CAAE,EAClBA,EAAKpP,EAAG,IAAIyP,EAAID,CAAE,EAClBP,EAAKjP,EAAG,IAAIuP,GAAIN,CAAE,EAClBA,EAAKjP,EAAG,IAAIiP,EAAIG,CAAE,EAClBA,EAAKpP,EAAG,IAAIuP,GAAIF,CAAE,EAClBF,EAAKnP,EAAG,IAAIyP,EAAIN,CAAE,EAClBA,EAAKnP,EAAG,IAAImP,EAAIC,CAAE,EACX,IAAIzI,EAAMsI,EAAIC,EAAIC,CAAE,CAC/B,CACA,SAAS1B,EAAO,CACZ,OAAO,KAAK,IAAIA,EAAM,OAAM,CAAE,CAClC,CACA,KAAM,CACF,OAAO,KAAK,OAAO9G,EAAM,IAAI,CACjC,CAUA,SAASvC,EAAQ,CACb,KAAM,CAAE,KAAAoH,CAAI,EAAKJ,EACjB,GAAI,CAACnD,EAAG,YAAY7D,CAAM,EACtB,MAAM,IAAI,MAAM,8BAA8B,EAClD,IAAIyC,EAAO6I,EACX,MAAMC,EAAOxgB,GAAMof,GAAK,OAAO,KAAMpf,EAAIhB,GAAM+W,GAAWyB,EAAOxY,CAAC,CAAC,EAEnE,GAAIqd,EAAM,CACN,KAAM,CAAE,MAAAlC,EAAO,GAAAhC,EAAI,MAAAiC,EAAO,GAAAhC,CAAE,EAAKmG,EAAiBtJ,CAAM,EAClD,CAAE,EAAGgK,EAAK,EAAGwB,CAAG,EAAKD,EAAIrI,CAAE,EAC3B,CAAE,EAAG+G,EAAK,EAAGwB,CAAG,EAAKF,EAAIpI,CAAE,EACjCmI,EAAOE,EAAI,IAAIC,CAAG,EAClBhJ,EAAQqH,GAAW1C,EAAK,KAAM4C,EAAKC,EAAK/E,EAAOC,CAAK,CACxD,KACK,CACD,KAAM,CAAE,EAAApb,EAAG,EAAAqQ,GAAMmR,EAAIvL,CAAM,EAC3ByC,EAAQ1Y,EACRuhB,EAAOlR,CACX,CAEA,OAAO0G,GAAWyB,EAAO,CAACE,EAAO6I,CAAI,CAAC,EAAE,CAAC,CAC7C,CAMA,eAAeI,EAAI,CACf,KAAM,CAAE,KAAAtE,CAAI,EAAKJ,EACXjd,EAAI,KACV,GAAI,CAAC8Z,EAAG,QAAQ6H,CAAE,EACd,MAAM,IAAI,MAAM,8BAA8B,EAClD,GAAIA,IAAOzU,IAAOlN,EAAE,IAAG,EACnB,OAAOwY,EAAM,KACjB,GAAImJ,IAAOxU,GACP,OAAOnN,EACX,GAAIogB,GAAK,SAAS,IAAI,EAClB,OAAO,KAAK,SAASuB,CAAE,EAG3B,GAAItE,EAAM,CACN,KAAM,CAAE,MAAAlC,EAAO,GAAAhC,EAAI,MAAAiC,EAAO,GAAAhC,CAAE,EAAKmG,EAAiBoC,CAAE,EAC9C,CAAE,GAAAtI,EAAI,GAAAC,GAAOJ,GAAcV,EAAOxY,EAAGmZ,EAAIC,CAAE,EACjD,OAAO2G,GAAW1C,EAAK,KAAMhE,EAAIC,EAAI6B,EAAOC,CAAK,CACrD,KAEI,QAAOgF,GAAK,OAAOpgB,EAAG2hB,CAAE,CAEhC,CAKA,SAASC,EAAW,CAChB,OAAOpC,EAAa,KAAMoC,CAAS,CACvC,CAKA,eAAgB,CACZ,KAAM,CAAE,cAAAC,CAAa,EAAK5E,EAC1B,OAAIE,IAAahQ,GACN,GACP0U,EACOA,EAAcrJ,EAAO,IAAI,EAC7B4H,GAAK,OAAO,KAAMhD,CAAW,EAAE,IAAG,CAC7C,CACA,eAAgB,CACZ,KAAM,CAAE,cAAA0E,CAAa,EAAK7E,EAC1B,OAAIE,IAAahQ,GACN,KACP2U,EACOA,EAActJ,EAAO,IAAI,EAC7B,KAAK,eAAe2E,CAAQ,CACvC,CACA,cAAe,CAEX,OAAO,KAAK,eAAeA,CAAQ,EAAE,IAAG,CAC5C,CACA,QAAQQ,EAAe,GAAM,CACzB,OAAAvQ,GAAMuQ,EAAc,cAAc,EAClC,KAAK,eAAc,EACZgB,EAAYnG,EAAO,KAAMmF,CAAY,CAChD,CACA,MAAMA,EAAe,GAAM,CACvB,OAAOzU,GAAW,KAAK,QAAQyU,CAAY,CAAC,CAChD,CACA,UAAW,CACP,MAAO,UAAU,KAAK,IAAG,EAAK,OAAS,KAAK,MAAK,CAAE,GACvD,CACR,CACI,MAAMlb,GAAOqX,EAAG,KACVsG,GAAO,IAAI7H,GAAKC,EAAOyE,EAAU,KAAO,KAAK,KAAKxa,GAAO,CAAC,EAAIA,EAAI,EACxE,OAAA+V,EAAM,KAAK,WAAW,CAAC,EAChBA,CACX,CAEA,SAASuF,GAAQD,EAAU,CACvB,OAAO,WAAW,GAAGA,EAAW,EAAO,CAAI,CAC/C,CA6HA,SAASP,GAAY1L,EAAIiI,EAAI,CACzB,MAAO,CACH,UAAWA,EAAG,MACd,UAAW,EAAIjI,EAAG,MAClB,sBAAuB,EAAI,EAAIA,EAAG,MAClC,mBAAoB,GACpB,UAAW,EAAIiI,EAAG,KAC1B,CACA,CAKO,SAASiI,GAAKvJ,EAAOwJ,EAAW,GAAI,CACvC,KAAM,CAAE,GAAAlI,CAAE,EAAKtB,EACTyJ,EAAeD,EAAS,aAAeE,GACvC5E,EAAU,OAAO,OAAOC,GAAY/E,EAAM,GAAIsB,CAAE,EAAG,CAAE,KAAMvD,GAAiBuD,EAAG,KAAK,CAAC,CAAE,EAC7F,SAASqI,EAAiBhI,EAAW,CACjC,GAAI,CACA,MAAMhW,EAAM2V,EAAG,UAAUK,CAAS,EAClC,OAAOL,EAAG,YAAY3V,CAAG,CAC7B,MACc,CACV,MAAO,EACX,CACJ,CACA,SAASie,EAAiBC,EAAW1E,EAAc,CAC/C,KAAM,CAAE,UAAW3E,EAAM,sBAAAsJ,CAAqB,EAAKhF,EACnD,GAAI,CACA,MAAMtb,EAAIqgB,EAAU,OAGpB,OAFI1E,IAAiB,IAAQ3b,IAAMgX,GAE/B2E,IAAiB,IAAS3b,IAAMsgB,EACzB,GACJ,CAAC,CAAC9J,EAAM,UAAU6J,CAAS,CACtC,MACc,CACV,MAAO,EACX,CACJ,CAKA,SAASpI,EAAgB3K,EAAO2S,EAAa3E,EAAQ,IAAI,EAAG,CACxD,OAAO9G,GAAenW,EAAOiP,EAAMgO,EAAQ,KAAM,MAAM,EAAGxD,EAAG,KAAK,CACtE,CAMA,SAASI,EAAaC,EAAWwD,EAAe,GAAM,CAClD,OAAOnF,EAAM,KAAK,SAASsB,EAAG,UAAUK,CAAS,CAAC,EAAE,QAAQwD,CAAY,CAC5E,CAIA,SAAS4E,EAAU7hB,EAAM,CACrB,KAAM,CAAE,UAAAyZ,EAAW,UAAAkI,EAAW,sBAAAC,CAAqB,EAAKhF,EAGxD,GAFI,CAACnd,GAAQO,CAAI,GAEZ,aAAcoZ,GAAMA,EAAG,UAAaK,IAAckI,EACnD,OACJ,MAAMrgB,EAAI3B,EAAOK,EAAM,OAAW,KAAK,EAAE,OACzC,OAAOsB,IAAMqgB,GAAargB,IAAMsgB,CACpC,CASA,SAASE,EAAgBC,EAAYC,EAAY/E,EAAe,GAAM,CAClE,GAAI4E,EAAUE,CAAU,IAAM,GAC1B,MAAM,IAAI,MAAM,+BAA+B,EACnD,GAAIF,EAAUG,CAAU,IAAM,GAC1B,MAAM,IAAI,MAAM,+BAA+B,EACnD,MAAM1d,EAAI8U,EAAG,UAAU2I,CAAU,EAEjC,OADUjK,EAAM,UAAUkK,CAAU,EAC3B,SAAS1d,CAAC,EAAE,QAAQ2Y,CAAY,CAC7C,CACA,MAAMgF,EAAQ,CACV,iBAAAR,EACA,iBAAAC,EACA,gBAAAnI,CACR,EACU2I,EAAS5I,GAAaC,EAAiBC,CAAY,EACzD,OAAO,OAAO,OAAO,CAAE,aAAAA,EAAc,gBAAAsI,EAAiB,OAAAI,EAAQ,MAAApK,EAAO,MAAAmK,EAAO,QAAArF,EAAS,CACzF,CAgBO,SAASuF,GAAMrK,EAAO6B,EAAMyI,EAAY,CAAA,EAAI,CAC/C7a,GAAMoS,CAAI,EACV3K,GAAeoT,EAAW,GAAI,CAC1B,KAAM,WACN,KAAM,UACN,YAAa,WACb,SAAU,WACV,cAAe,UACvB,CAAK,EACDA,EAAY,OAAO,OAAO,CAAA,EAAIA,CAAS,EACvC,MAAMtY,EAAcsY,EAAU,aAAeZ,GACvCzH,EAAOqI,EAAU,OAAS,CAACrM,EAAKpM,IAAQ0Y,GAAU1I,EAAM5D,EAAKpM,CAAG,GAChE,CAAE,GAAAwH,EAAI,GAAAiI,CAAE,EAAKtB,EACb,CAAE,MAAO4E,EAAa,KAAM4F,CAAM,EAAKlJ,EACvC,CAAE,OAAA8I,EAAQ,aAAA1I,EAAc,gBAAAsI,EAAiB,MAAAG,EAAO,QAAArF,GAAYyE,GAAKvJ,EAAOsK,CAAS,EACjFG,EAAiB,CACnB,QAAS,GACT,KAAM,OAAOH,EAAU,MAAS,UAAYA,EAAU,KAAO,GAC7D,OAAQ,UACR,aAAc,EACtB,EACUI,EAAmB9F,EAAc1M,GAAMmB,EAAG,MAChD,SAASsR,EAAsB3R,EAAQ,CACnC,MAAM4R,EAAOhG,GAAejQ,GAC5B,OAAOqE,EAAS4R,CACpB,CACA,SAASC,EAAW1b,EAAOxD,EAAK,CAC5B,GAAI,CAAC2V,EAAG,YAAY3V,CAAG,EACnB,MAAM,IAAI,MAAM,qBAAqBwD,CAAK,kCAAkC,EAChF,OAAOxD,CACX,CACA,SAASmf,GAAsB,CAS3B,GAAIJ,EACA,MAAM,IAAI,MAAM,8DAA8D,CACtF,CACA,SAASK,EAAkBlf,EAAOkX,EAAQ,CACtCD,GAAkBC,CAAM,EACxB,MAAMiI,EAAOlG,EAAQ,UACfmG,EAAQlI,IAAW,UAAYiI,EAAOjI,IAAW,YAAciI,EAAO,EAAI,OAChF,OAAOnjB,EAAOgE,EAAOof,CAAK,CAC9B,CAIA,MAAMC,CAAU,CACZ,EACA,EACA,SACA,YAAY/R,EAAG3M,EAAG2e,EAAU,CAGxB,GAFA,KAAK,EAAIN,EAAW,IAAK1R,CAAC,EAC1B,KAAK,EAAI0R,EAAW,IAAKre,CAAC,EACtB2e,GAAY,KAAM,CAElB,GADAL,EAAmB,EACf,CAAC,CAAC,EAAG,EAAG,EAAG,CAAC,EAAE,SAASK,CAAQ,EAC/B,MAAM,IAAI,MAAM,qBAAqB,EACzC,KAAK,SAAWA,CACpB,CACA,OAAO,OAAO,IAAI,CACtB,CACA,OAAO,UAAUtf,EAAOkX,EAAS0H,EAAe,OAAQ,CACpDM,EAAkBlf,EAAOkX,CAAM,EAC/B,IAAIqI,EACJ,GAAIrI,IAAW,MAAO,CAClB,KAAM,CAAE,EAAA5J,EAAG,EAAA3M,CAAC,EAAK6W,GAAI,MAAMxb,EAAOgE,CAAK,CAAC,EACxC,OAAO,IAAIqf,EAAU/R,EAAG3M,CAAC,CAC7B,CACIuW,IAAW,cACXqI,EAAQvf,EAAM,CAAC,EACfkX,EAAS,UACTlX,EAAQA,EAAM,SAAS,CAAC,GAE5B,MAAMoa,EAAInB,EAAQ,UAAY,EACxB3L,EAAItN,EAAM,SAAS,EAAGoa,CAAC,EACvBzZ,EAAIX,EAAM,SAASoa,EAAGA,EAAI,CAAC,EACjC,OAAO,IAAIiF,EAAU5J,EAAG,UAAUnI,CAAC,EAAGmI,EAAG,UAAU9U,CAAC,EAAG4e,CAAK,CAChE,CACA,OAAO,QAAQlc,EAAK6T,EAAQ,CACxB,OAAO,KAAK,UAAUjS,GAAW5B,CAAG,EAAG6T,CAAM,CACjD,CACA,gBAAiB,CACb,KAAM,CAAE,SAAAoI,CAAQ,EAAK,KACrB,GAAIA,GAAY,KACZ,MAAM,IAAI,MAAM,sCAAsC,EAC1D,OAAOA,CACX,CACA,eAAeA,EAAU,CACrB,OAAO,IAAID,EAAU,KAAK,EAAG,KAAK,EAAGC,CAAQ,CACjD,CACA,iBAAiBE,EAAa,CAC1B,KAAM,CAAE,EAAAlS,EAAG,EAAA3M,CAAC,EAAK,KACX2e,EAAW,KAAK,eAAc,EAC9BG,EAAOH,IAAa,GAAKA,IAAa,EAAIhS,EAAIyL,EAAczL,EAClE,GAAI,CAACE,EAAG,QAAQiS,CAAI,EAChB,MAAM,IAAI,MAAM,2CAA2C,EAC/D,MAAMriB,EAAIoQ,EAAG,QAAQiS,CAAI,EACnBhQ,EAAI0E,EAAM,UAAUzO,GAAYgU,IAAS4F,EAAW,KAAO,CAAC,EAAGliB,CAAC,CAAC,EACjEsiB,EAAKjK,EAAG,IAAIgK,CAAI,EAChB5b,EAAI8b,EAAc3jB,EAAOwjB,EAAa,OAAW,SAAS,CAAC,EAC3DI,EAAKnK,EAAG,OAAO,CAAC5R,EAAI6b,CAAE,EACtBG,EAAKpK,EAAG,OAAO9U,EAAI+e,CAAE,EAErB1Q,EAAImF,EAAM,KAAK,eAAeyL,CAAE,EAAE,IAAInQ,EAAE,eAAeoQ,CAAE,CAAC,EAChE,GAAI7Q,EAAE,IAAG,EACL,MAAM,IAAI,MAAM,qCAAqC,EACzD,OAAAA,EAAE,eAAc,EACTA,CACX,CAEA,UAAW,CACP,OAAO8P,EAAsB,KAAK,CAAC,CACvC,CACA,QAAQ5H,EAAS0H,EAAe,OAAQ,CAEpC,GADA3H,GAAkBC,CAAM,EACpBA,IAAW,MACX,OAAOjS,GAAWuS,GAAI,WAAW,IAAI,CAAC,EAC1C,KAAM,CAAE,EAAAlK,EAAG,EAAA3M,CAAC,EAAK,KACXmf,EAAKrK,EAAG,QAAQnI,CAAC,EACjByS,EAAKtK,EAAG,QAAQ9U,CAAC,EACvB,OAAIuW,IAAW,aACX+H,EAAmB,EACZvZ,GAAY,WAAW,GAAG,KAAK,gBAAgB,EAAGoa,EAAIC,CAAE,GAE5Dra,GAAYoa,EAAIC,CAAE,CAC7B,CACA,MAAM7I,EAAQ,CACV,OAAOrS,GAAW,KAAK,QAAQqS,CAAM,CAAC,CAC1C,CACR,CAKI,MAAM8I,EAAWvB,EAAU,UACvB,SAAsBze,EAAO,CAEzB,GAAIA,EAAM,OAAS,KACf,MAAM,IAAI,MAAM,oBAAoB,EAGxC,MAAMF,EAAMsJ,GAAgBpJ,CAAK,EAC3BigB,EAAQjgB,EAAM,OAAS,EAAI2e,EACjC,OAAOsB,EAAQ,EAAIngB,GAAO,OAAOmgB,CAAK,EAAIngB,CAC9C,EACE6f,EAAgBlB,EAAU,eAC5B,SAA2Bze,EAAO,CAC9B,OAAOyV,EAAG,OAAOuK,EAAShgB,CAAK,CAAC,CACpC,EAEEkgB,GAAahW,GAAQyU,CAAM,EAEjC,SAASwB,GAAWrgB,EAAK,CAErB,OAAAkK,GAAS,WAAa2U,EAAQ7e,EAAK+I,GAAKqX,EAAU,EAC3CzK,EAAG,QAAQ3V,CAAG,CACzB,CACA,SAASsgB,EAAmB/J,EAASgK,EAAS,CAC1C,OAAArkB,EAAOqa,EAAS,OAAW,SAAS,EAC7BgK,EAAUrkB,EAAOga,EAAKK,CAAO,EAAG,OAAW,mBAAmB,EAAIA,CAC7E,CASA,SAASiK,GAAQjK,EAASP,EAAW7P,EAAM,CACvC,KAAM,CAAE,KAAAsa,EAAM,QAAAF,EAAS,aAAAG,CAAY,EAAKrJ,GAAgBlR,EAAM2Y,CAAc,EAC5EvI,EAAU+J,EAAmB/J,EAASgK,CAAO,EAI7C,MAAMI,EAAQd,EAActJ,CAAO,EAC7BxX,EAAI4W,EAAG,UAAUK,CAAS,EAChC,GAAI,CAACL,EAAG,YAAY5W,CAAC,EACjB,MAAM,IAAI,MAAM,qBAAqB,EACzC,MAAM6hB,EAAW,CAACP,GAAWthB,CAAC,EAAGshB,GAAWM,CAAK,CAAC,EAElD,GAAID,GAAgB,MAAQA,IAAiB,GAAO,CAGhD,MAAMG,EAAIH,IAAiB,GAAOra,EAAY8S,EAAQ,SAAS,EAAIuH,EACnEE,EAAS,KAAK1kB,EAAO2kB,EAAG,OAAW,cAAc,CAAC,CACtD,CACA,MAAM1V,EAAOvF,GAAY,GAAGgb,CAAQ,EAC9BjmB,EAAIgmB,EASV,SAASG,EAAMC,EAAQ,CAGnB,MAAMjW,EAAIoV,EAASa,CAAM,EACzB,GAAI,CAACpL,EAAG,YAAY7K,CAAC,EACjB,OACJ,MAAMkW,GAAKrL,EAAG,IAAI7K,CAAC,EACbyC,EAAI8G,EAAM,KAAK,SAASvJ,CAAC,EAAE,WAC3B0C,EAAImI,EAAG,OAAOpI,EAAE,CAAC,EACvB,GAAIC,IAAMzE,GACN,OACJ,MAAMlI,GAAI8U,EAAG,OAAOqL,GAAKrL,EAAG,OAAOhb,EAAI6S,EAAIzO,CAAC,CAAC,EAC7C,GAAI8B,KAAMkI,GACN,OACJ,IAAIyW,IAAYjS,EAAE,IAAMC,EAAI,EAAI,GAAK,OAAOD,EAAE,EAAIvE,EAAG,EACjDiY,GAAQpgB,GACZ,OAAI4f,GAAQzB,EAAsBne,EAAC,IAC/BogB,GAAQtL,EAAG,IAAI9U,EAAC,EAChB2e,IAAY,GAET,IAAID,EAAU/R,EAAGyT,GAAOlC,EAAmB,OAAYS,EAAQ,CAC1E,CACA,MAAO,CAAE,KAAArU,EAAM,MAAA2V,CAAK,CACxB,CAYA,SAASI,GAAK3K,EAASP,EAAW7P,EAAO,CAAA,EAAI,CACzC,KAAM,CAAE,KAAAgF,EAAM,MAAA2V,CAAK,EAAKN,GAAQjK,EAASP,EAAW7P,CAAI,EAGxD,OAFakE,GAAe6L,EAAK,UAAWP,EAAG,MAAOW,CAAI,EACzCnL,EAAM2V,CAAK,EACjB,QAAQ3a,EAAK,MAAM,CAClC,CAcA,SAASgb,EAAOC,EAAW7K,EAAS2H,EAAW/X,EAAO,CAAA,EAAI,CACtD,KAAM,CAAE,KAAAsa,EAAM,QAAAF,EAAS,OAAAnJ,CAAM,EAAKC,GAAgBlR,EAAM2Y,CAAc,EAGtE,GAFAZ,EAAYhiB,EAAOgiB,EAAW,OAAW,WAAW,EACpD3H,EAAU+J,EAAmB/J,EAASgK,CAAO,EACzC,CAACvkB,GAAQolB,CAAS,EAAG,CACrB,MAAM3iB,EAAM2iB,aAAqB7B,EAAY,sBAAwB,GACrE,MAAM,IAAI,MAAM,sCAAwC9gB,CAAG,CAC/D,CACA2gB,EAAkBgC,EAAWhK,CAAM,EACnC,GAAI,CACA,MAAMqB,EAAM8G,EAAU,UAAU6B,EAAWhK,CAAM,EAC3ClJ,EAAImG,EAAM,UAAU6J,CAAS,EACnC,GAAIuC,GAAQhI,EAAI,SAAQ,EACpB,MAAO,GACX,KAAM,CAAE,EAAAjL,EAAG,EAAA3M,CAAC,EAAK4X,EACX1U,EAAI8b,EAActJ,CAAO,EACzB8K,EAAK1L,EAAG,IAAI9U,CAAC,EACbif,EAAKnK,EAAG,OAAO5R,EAAIsd,CAAE,EACrBtB,GAAKpK,EAAG,OAAOnI,EAAI6T,CAAE,EACrB1R,EAAI0E,EAAM,KAAK,eAAeyL,CAAE,EAAE,IAAI5R,EAAE,eAAe6R,EAAE,CAAC,EAChE,OAAIpQ,EAAE,IAAG,EACE,GACDgG,EAAG,OAAOhG,EAAE,CAAC,IACVnC,CACjB,MACU,CACN,MAAO,EACX,CACJ,CACA,SAAS8T,EAAiBF,EAAW7K,EAASpQ,EAAO,CAAA,EAAI,CACrD,KAAM,CAAE,QAAAoa,CAAO,EAAKlJ,GAAgBlR,EAAM2Y,CAAc,EACxD,OAAAvI,EAAU+J,EAAmB/J,EAASgK,CAAO,EACtChB,EAAU,UAAU6B,EAAW,WAAW,EAAE,iBAAiB7K,CAAO,EAAE,QAAO,CACxF,CACA,OAAO,OAAO,OAAO,CACjB,OAAAkI,EACA,aAAA1I,EACA,gBAAAsI,EACA,MAAAG,EACA,QAAArF,EACA,MAAA9E,EACA,KAAA6M,GACA,OAAAC,EACA,iBAAAG,EACA,UAAA/B,EACA,KAAArJ,CACR,CAAK,CACL,CClrCA,MAAMqL,GAAkB,CACpB,EAAG,OAAO,oEAAoE,EAC9E,EAAG,OAAO,oEAAoE,EAC9E,EAAG,OAAO,CAAC,EACX,EAAG,OAAO,CAAC,EACX,EAAG,OAAO,CAAC,EACX,GAAI,OAAO,oEAAoE,EAC/E,GAAI,OAAO,oEAAoE,CACnF,EACMC,GAAiB,CACnB,KAAM,OAAO,oEAAoE,EACjF,QAAS,CACL,CAAC,OAAO,oCAAoC,EAAG,CAAC,OAAO,oCAAoC,CAAC,EAC5F,CAAC,OAAO,qCAAqC,EAAG,OAAO,oCAAoC,CAAC,CACpG,CACA,EACMzY,GAAsB,OAAO,CAAC,EAC9BwD,GAAsB,OAAO,CAAC,EAKpC,SAASkV,GAAQhI,EAAG,CAChB,MAAMvL,EAAIqT,GAAgB,EAEpB/U,EAAM,OAAO,CAAC,EAAGkV,EAAM,OAAO,CAAC,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAErEC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EACtDhL,EAAM0C,EAAIA,EAAIA,EAAKvL,EACnBwO,EAAM3F,EAAKA,EAAK0C,EAAKvL,EACrB8T,EAAM/U,EAAKyP,EAAIlQ,EAAK0B,CAAC,EAAIwO,EAAMxO,EAC/B+T,EAAMhV,EAAK+U,EAAIxV,EAAK0B,CAAC,EAAIwO,EAAMxO,EAC/BgU,EAAOjV,EAAKgV,EAAI1V,GAAK2B,CAAC,EAAI6I,EAAM7I,EAChCiU,EAAOlV,EAAKiV,EAAKP,EAAMzT,CAAC,EAAIgU,EAAOhU,EACnCkU,EAAOnV,EAAKkV,EAAKP,EAAM1T,CAAC,EAAIiU,EAAOjU,EACnCmU,EAAOpV,EAAKmV,EAAKN,EAAM5T,CAAC,EAAIkU,EAAOlU,EACnCoU,EAAQrV,EAAKoV,EAAKN,EAAM7T,CAAC,EAAImU,EAAOnU,EACpCqU,EAAQtV,EAAKqV,EAAMR,EAAM5T,CAAC,EAAIkU,EAAOlU,EACrCsU,EAAQvV,EAAKsV,EAAM/V,EAAK0B,CAAC,EAAIwO,EAAMxO,EACnC6O,EAAM9P,EAAKuV,EAAMX,EAAM3T,CAAC,EAAIiU,EAAOjU,EACnC8O,EAAM/P,EAAK8P,EAAI2E,EAAKxT,CAAC,EAAI6I,EAAM7I,EAC/BP,EAAOV,EAAK+P,EAAIzQ,GAAK2B,CAAC,EAC5B,GAAI,CAACuU,GAAK,IAAIA,GAAK,IAAI9U,CAAI,EAAG8L,CAAC,EAC3B,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO9L,CACX,CACA,MAAM8U,GAAOrU,GAAMmT,GAAgB,EAAG,CAAE,KAAME,GAAS,EACjDiB,GAA0B7J,GAAY0I,GAAiB,CACzD,GAAIkB,GACJ,KAAMjB,EACV,CAAC,EAkBYmB,GAA4BjE,GAAMgE,GAASrhB,EAAM,EAIxDuhB,GAAuB,CAAA,EAC7B,SAASC,GAAWlL,KAAQmL,EAAU,CAClC,IAAIC,EAAOH,GAAqBjL,CAAG,EACnC,GAAIoL,IAAS,OAAW,CACpB,MAAMC,EAAO3hB,GAAOyI,GAAa6N,CAAG,CAAC,EACrCoL,EAAOnd,GAAYod,EAAMA,CAAI,EAC7BJ,GAAqBjL,CAAG,EAAIoL,CAChC,CACA,OAAO1hB,GAAOuE,GAAYmd,EAAM,GAAGD,CAAQ,CAAC,CAChD,CAEA,MAAMxJ,GAAgB/E,GAAUA,EAAM,QAAQ,EAAI,EAAE,MAAM,CAAC,EACrD0O,GAAWxJ,GAAMA,EAAIlN,KAAQxD,GAEnC,SAASma,GAAoBC,EAAM,CAC/B,KAAM,CAAE,GAAAxN,EAAI,KAAAyN,CAAI,EAAKV,GACfW,EAAK1N,EAAG,UAAUwN,CAAI,EACtBtnB,EAAIunB,EAAK,SAASC,CAAE,EAE1B,MAAO,CAAE,OADMJ,GAAQpnB,EAAE,CAAC,EAAIwnB,EAAK1N,EAAG,IAAI0N,CAAE,EAC3B,MAAO/J,GAAazd,CAAC,CAAC,CAC3C,CAKA,SAASynB,GAAOhmB,EAAG,CACf,MAAMoQ,EAAK+U,GACX,GAAI,CAAC/U,EAAG,YAAYpQ,CAAC,EACjB,MAAM,IAAI,MAAM,0BAA0B,EAC9C,MAAMimB,EAAK7V,EAAG,OAAOpQ,EAAIA,CAAC,EACpByE,EAAI2L,EAAG,OAAO6V,EAAKjmB,EAAI,OAAO,CAAC,CAAC,EACtC,IAAImc,EAAI/L,EAAG,KAAK3L,CAAC,EAGZkhB,GAAQxJ,CAAC,IACVA,EAAI/L,EAAG,IAAI+L,CAAC,GAChB,MAAM5d,EAAI6mB,GAAQ,WAAW,CAAE,EAAAplB,EAAG,EAAAmc,CAAC,CAAE,EACrC,OAAA5d,EAAE,eAAc,EACTA,CACX,CACA,MAAMmE,GAAMsJ,GAIZ,SAASka,MAAatmB,EAAM,CACxB,OAAOwlB,GAAQ,GAAG,OAAO1iB,GAAI6iB,GAAW,oBAAqB,GAAG3lB,CAAI,CAAC,CAAC,CAC1E,CAIA,SAASumB,GAAoBzN,EAAW,CACpC,OAAOkN,GAAoBlN,CAAS,EAAE,KAC1C,CAKA,SAAS0N,GAAYnN,EAASP,EAAW2N,EAAUtd,GAAY,EAAE,EAAG,CAChE,KAAM,CAAE,GAAAsP,CAAE,EAAK+M,GACT/nB,EAAIuB,EAAOqa,EAAS,OAAW,SAAS,EACxC,CAAE,MAAOqN,EAAI,OAAQ7kB,GAAMmkB,GAAoBlN,CAAS,EACxD/Z,EAAIC,EAAOynB,EAAS,GAAI,SAAS,EACjCjU,EAAIiG,EAAG,QAAQ5W,EAAIiB,GAAI6iB,GAAW,cAAe5mB,CAAC,CAAC,CAAC,EACpD4nB,EAAOhB,GAAW,gBAAiBnT,EAAGkU,EAAIjpB,CAAC,EAE3C,CAAE,MAAOmpB,EAAI,OAAQhZ,CAAC,EAAKoY,GAAoBW,CAAI,EACnDhD,EAAI2C,GAAUM,EAAIF,EAAIjpB,CAAC,EACvB8d,EAAM,IAAI,WAAW,EAAE,EAI7B,GAHAA,EAAI,IAAIqL,EAAI,CAAC,EACbrL,EAAI,IAAI9C,EAAG,QAAQA,EAAG,OAAO7K,EAAI+V,EAAI9hB,CAAC,CAAC,EAAG,EAAE,EAExC,CAACglB,GAActL,EAAK9d,EAAGipB,CAAE,EACzB,MAAM,IAAI,MAAM,kCAAkC,EACtD,OAAOnL,CACX,CAKA,SAASsL,GAAc3C,EAAW7K,EAAS2H,EAAW,CAClD,KAAM,CAAE,GAAAxQ,EAAI,GAAAiI,EAAI,KAAAyN,CAAI,EAAKV,GACnBjK,EAAMvc,EAAOklB,EAAW,GAAI,WAAW,EACvCzmB,EAAIuB,EAAOqa,EAAS,OAAW,SAAS,EACxCyN,EAAM9nB,EAAOgiB,EAAW,GAAI,WAAW,EAC7C,GAAI,CACA,MAAMhQ,EAAIoV,GAAOtjB,GAAIgkB,CAAG,CAAC,EACnBxW,EAAIxN,GAAIyY,EAAI,SAAS,EAAG,EAAE,CAAC,EACjC,GAAI,CAAC/K,EAAG,YAAYF,CAAC,EACjB,MAAO,GACX,MAAM3M,EAAIb,GAAIyY,EAAI,SAAS,GAAI,EAAE,CAAC,EAClC,GAAI,CAAC9C,EAAG,YAAY9U,CAAC,EACjB,MAAO,GACX,MAAMggB,EAAI2C,GAAU7N,EAAG,QAAQnI,CAAC,EAAG8L,GAAapL,CAAC,EAAGvT,CAAC,EAE/CgV,EAAIyT,EAAK,eAAeviB,CAAC,EAAE,IAAIqN,EAAE,eAAeyH,EAAG,IAAIkL,CAAC,CAAC,CAAC,EAC1D,CAAE,EAAAvjB,EAAG,EAAAmc,GAAM9J,EAAE,SAAQ,EAE3B,MAAI,EAAAA,EAAE,OAAS,CAACsT,GAAQxJ,CAAC,GAAKnc,IAAMkQ,EAGxC,MACc,CACV,MAAO,EACX,CACJ,CAcO,MAAMyW,IAA2B,IAAM,CAG1C,MAAMnO,EAAkB,CAAC3K,EAAO9E,GAAY,EAAU,IAC3CgM,GAAelH,EAAMoW,GAAgB,CAAC,EAEjD,MAAO,CACH,OAAQ1L,GAAaC,EAAiB2N,EAAmB,EACzD,aAAcA,GACd,KAAMC,GACN,OAAQK,GACR,MAAOrB,GACP,MAAO,CACH,gBAAA5M,EACA,WAAA+M,GACA,OAAAS,GACA,aAAAhK,EACZ,EACQ,QAAS,CACL,UAAW,GACX,UAAW,GACX,mBAAoB,GACpB,UAAW,GACX,KAAM,EAClB,CACA,CACA,GAAC,EC5DK4K,GAAyB,WAAW,KAAK,CAC3C,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,CACvD,CAAC,EACKC,GAA+B,WAAW,KAAK,IAAI,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAACrf,EAAGhH,IAAMA,CAAC,CAAC,EACrFsmB,GAA+BD,GAAM,IAAKrmB,IAAO,EAAIA,EAAI,GAAK,EAAE,EAChEumB,IAAyB,IAAM,CAGjC,MAAMvlB,EAAM,CAFF,CAACqlB,EAAK,EACN,CAACC,EAAK,CACC,EACjB,QAAStmB,EAAI,EAAGA,EAAI,EAAGA,IACnB,QAASwmB,KAAKxlB,EACVwlB,EAAE,KAAKA,EAAExmB,CAAC,EAAE,IAAKgN,GAAMoZ,GAAOpZ,CAAC,CAAC,CAAC,EACzC,OAAOhM,CACX,GAAC,EACKylB,GAA8BF,GAAM,CAAC,EACrCG,GAA8BH,GAAM,CAAC,EAErCI,GAA4B,CAC9B,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,CAAC,EACvD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,CAAC,EACvD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,CAAC,EACvD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,CAAC,EACvD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,CAAC,CAC3D,EAAE,IAAK3mB,GAAM,WAAW,KAAKA,CAAC,CAAC,EACzB4mB,GAA6BH,GAAK,IAAI,CAACI,EAAK7mB,IAAM6mB,EAAI,IAAKL,GAAMG,GAAU3mB,CAAC,EAAEwmB,CAAC,CAAC,CAAC,EACjFM,GAA6BJ,GAAK,IAAI,CAACG,EAAK7mB,IAAM6mB,EAAI,IAAKL,GAAMG,GAAU3mB,CAAC,EAAEwmB,CAAC,CAAC,CAAC,EACjFO,GAAwB,YAAY,KAAK,CAC3C,EAAY,WAAY,WAAY,WAAY,UACpD,CAAC,EACKC,GAAwB,YAAY,KAAK,CAC3C,WAAY,WAAY,WAAY,WAAY,CACpD,CAAC,EAED,SAASC,GAASC,EAAO1nB,EAAGmc,EAAGwL,EAAG,CAC9B,OAAID,IAAU,EACH1nB,EAAImc,EAAIwL,EACfD,IAAU,EACF1nB,EAAImc,EAAM,CAACnc,EAAI2nB,EACvBD,IAAU,GACF1nB,EAAI,CAACmc,GAAKwL,EAClBD,IAAU,EACF1nB,EAAI2nB,EAAMxL,EAAI,CAACwL,EACpB3nB,GAAKmc,EAAI,CAACwL,EACrB,CAEA,MAAMC,GAA0B,IAAI,YAAY,EAAE,EAC3C,MAAMC,WAAmBve,EAAO,CACnC,GAAK,WACL,GAAK,WACL,GAAK,YACL,GAAK,UACL,GAAK,YACL,aAAc,CACV,MAAM,GAAI,GAAI,EAAG,EAAI,CACzB,CACA,KAAM,CACF,KAAM,CAAE,GAAAwe,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAK,KAC/B,MAAO,CAACJ,EAAIC,EAAIC,EAAIC,EAAIC,CAAE,CAC9B,CACA,IAAIJ,EAAIC,EAAIC,EAAIC,EAAIC,EAAI,CACpB,KAAK,GAAKJ,EAAK,EACf,KAAK,GAAKC,EAAK,EACf,KAAK,GAAKC,EAAK,EACf,KAAK,GAAKC,EAAK,EACf,KAAK,GAAKC,EAAK,CACnB,CACA,QAAQve,EAAMqB,EAAQ,CAClB,QAASxK,EAAI,EAAGA,EAAI,GAAIA,IAAKwK,GAAU,EACnC4c,GAAQpnB,CAAC,EAAImJ,EAAK,UAAUqB,EAAQ,EAAI,EAE5C,IAAIjD,EAAK,KAAK,GAAK,EAAGogB,EAAKpgB,EAAIqgB,EAAK,KAAK,GAAK,EAAGC,EAAKD,EAAIE,EAAK,KAAK,GAAK,EAAGrf,EAAKqf,EAAIC,EAAK,KAAK,GAAK,EAAGC,EAAKD,EAAIE,EAAK,KAAK,GAAK,EAAGC,EAAKD,EAGvI,QAASf,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMiB,EAAS,EAAIjB,EACbkB,EAAMrB,GAAMG,CAAK,EAAGmB,EAAMrB,GAAME,CAAK,EACrCoB,EAAK7B,GAAKS,CAAK,EAAGqB,EAAK7B,GAAKQ,CAAK,EACjC3Z,EAAKqZ,GAAWM,CAAK,EAAGsB,EAAK1B,GAAWI,CAAK,EACnD,QAASlnB,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMyoB,EAAM3hB,GAAKS,EAAK0f,GAASC,EAAOU,EAAIE,EAAIC,CAAE,EAAIX,GAAQkB,EAAGtoB,CAAC,CAAC,EAAIooB,EAAK7a,EAAGvN,CAAC,CAAC,EAAIioB,EAAM,EACzF1gB,EAAK0gB,EAAIA,EAAKF,EAAIA,EAAKjhB,GAAKghB,EAAI,EAAE,EAAI,EAAGA,EAAKF,EAAIA,EAAKa,CAC3D,CAEA,QAASzoB,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM0oB,EAAM5hB,GAAK6gB,EAAKV,GAASkB,EAAQN,EAAIpf,EAAIuf,CAAE,EAAIZ,GAAQmB,EAAGvoB,CAAC,CAAC,EAAIqoB,EAAKG,EAAGxoB,CAAC,CAAC,EAAIkoB,EAAM,EAC1FP,EAAKO,EAAIA,EAAKF,EAAIA,EAAKlhB,GAAK2B,EAAI,EAAE,EAAI,EAAGA,EAAKof,EAAIA,EAAKa,CAC3D,CACJ,CAEA,KAAK,IAAK,KAAK,GAAKZ,EAAKE,EAAM,EAAI,KAAK,GAAKD,EAAKG,EAAM,EAAI,KAAK,GAAKD,EAAKN,EAAM,EAAI,KAAK,GAAKpgB,EAAKsgB,EAAM,EAAI,KAAK,GAAKD,EAAKnf,EAAM,CAAC,CACxI,CACA,YAAa,CACTjC,GAAM4gB,EAAO,CACjB,CACA,SAAU,CACN,KAAK,UAAY,GACjB5gB,GAAM,KAAK,MAAM,EACjB,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,CAAC,CAC1B,CACJ,CAMO,MAAMmiB,GAA4B3gB,GAAa,IAAM,IAAIqf,EAAY,ECnP/DuB,GAAwB,WAAW,GAAE,EAErChc,GAAuB,WAAW,GAAG,CAAC,EAEnD,SAASic,GAAW1qB,EAAGE,EAAG,CACtB,GAAIF,EAAE,SAAWE,EAAE,OACf,MAAO,GACX,QAAS2B,EAAI,EAAGA,EAAI7B,EAAE,OAAQ6B,IAC1B,GAAI7B,EAAE6B,CAAC,IAAM3B,EAAE2B,CAAC,EACZ,MAAO,GACf,MAAO,EACX,CAEA,SAAS9B,EAAQC,EAAG,CAChB,OAAOA,aAAa,YAAe,YAAY,OAAOA,CAAC,GAAKA,EAAE,YAAY,OAAS,YACvF,CAOA,SAAS2J,MAAerB,EAAQ,CAC5B,IAAIhE,EAAM,EACV,QAASzC,EAAI,EAAGA,EAAIyG,EAAO,OAAQzG,IAAK,CACpC,MAAM7B,EAAIsI,EAAOzG,CAAC,EAClB,GAAI,CAAC9B,EAAQC,CAAC,EACV,MAAM,IAAI,MAAM,qBAAqB,EACzCsE,GAAOtE,EAAE,MACb,CACA,MAAM6C,EAAM,IAAI,WAAWyB,CAAG,EAC9B,QAASzC,EAAI,EAAG+H,EAAM,EAAG/H,EAAIyG,EAAO,OAAQzG,IAAK,CAC7C,MAAM7B,EAAIsI,EAAOzG,CAAC,EAClBgB,EAAI,IAAI7C,EAAG4J,CAAG,EACdA,GAAO5J,EAAE,MACb,CACA,OAAO6C,CACX,CAMA,MAAM0F,GAAclI,GAAQ,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAMnF,SAASsqB,GAAcC,EAAK,CACxB,OAAO,OAAO,UAAU,SAAS,KAAKA,CAAG,IAAM,iBACnD,CACA,SAASC,GAAM9mB,EAAK,CAChB,OAAO,OAAO,cAAcA,CAAG,CACnC,CACO,MAAMwe,GAAQ,CACrB,WAAImI,GACJ,QAAI3qB,EACJ,YAEI4J,EAGJ,EAeMmhB,GAAeppB,GAAQ,CACzB,GAAIA,IAAQ,MAAQ,OAAOA,GAAQ,UAAY,CAACqpB,GAAQrpB,CAAG,GAAK,CAAC3B,EAAQ2B,CAAG,GAAK,CAACmpB,GAAMnpB,CAAG,EACvF,MAAM,IAAI,MAAM,qEAAqEA,CAAG,KAAK,OAAOA,CAAG,GAAG,EAE9G,MAAO,CACH,aAAaspB,EAAGxjB,EAAO,CACnB,GAAI9F,IAAQ,KACR,OACJ,GAAIqpB,GAAQrpB,CAAG,EACX,OAAOA,EAAI,aAAaspB,EAAGxjB,CAAK,EACpC,IAAIyjB,EAOJ,GANI,OAAOvpB,GAAQ,SACfupB,EAAUvpB,EACL,OAAOA,GAAQ,WACpBupB,EAAUC,GAAK,QAAQF,EAAE,MAAOtpB,CAAG,GACnC,OAAOupB,GAAY,WACnBA,EAAU,OAAOA,CAAO,GACxBA,IAAY,QAAaA,IAAYzjB,EACrC,MAAMwjB,EAAE,IAAI,iBAAiBC,CAAO,QAAQvpB,CAAG,QAAQ8F,CAAK,KAAK,OAAOA,CAAK,GAAG,CACxF,EACA,aAAa+J,EAAG,CACZ,IAAI0Z,EASJ,GARIF,GAAQrpB,CAAG,EACXupB,EAAU,OAAOvpB,EAAI,aAAa6P,CAAC,CAAC,EAC/B,OAAO7P,GAAQ,SACpBupB,EAAUvpB,EACL,OAAOA,GAAQ,WACpBupB,EAAUC,GAAK,QAAQ3Z,EAAE,MAAO7P,CAAG,GACnC,OAAOupB,GAAY,WACnBA,EAAU,OAAOA,CAAO,GACxB,OAAOA,GAAY,SACnB,MAAM1Z,EAAE,IAAI,iBAAiB0Z,CAAO,EAAE,EAC1C,OAAOA,CACX,CACR,CACA,EASME,EAAS,CACX,KAAM,GACN,UAAW,KAAO,EAClB,IAAMzpB,GAAQ,KAAK,KAAKA,EAAM,EAAE,EAChC,OAASA,GAAQ,IAAI,YAAYypB,EAAO,IAAIzpB,CAAG,CAAC,EAChD,MAAQ0pB,GAAOA,EAAG,KAAK,CAAC,EACxB,MAAQA,GAAO,MAAM,KAAKA,CAAE,EAAE,IAAKvpB,IAAOA,IAAM,GAAG,SAAS,CAAC,EAAE,SAAS,GAAI,GAAG,CAAC,EAChF,SAAU,CAACupB,EAAI1pB,IAAQ,CACnB,GAAIypB,EAAO,IAAIzpB,CAAG,IAAM0pB,EAAG,OAE3B,MAAM,IAAI,MAAM,gBAAgBA,EAAG,MAAM,eAAeD,EAAO,IAAIzpB,CAAG,CAAC,EAAE,CAC7E,EACA,SAAU,CAAC2pB,EAAOzoB,EAAKlB,IAAQ,CAC3B,GAAIkB,EAAM,EACN,MAAM,IAAI,MAAM,aAAaA,CAAG,EAAE,EACtC,GAAIA,EAAMlB,EAAM2pB,EACZ,MAAM,IAAI,MAAM,eAAezoB,CAAG,IAAIlB,CAAG,OAAO2pB,CAAK,EAAE,CAC/D,EACA,IAAK,CAACD,EAAIE,EAAO9jB,EAAO+jB,EAAe,KAC/B,CAACA,IAAiBH,EAAGE,CAAK,EAAI9jB,KAAW,EAClC,IACX4jB,EAAGE,CAAK,GAAK9jB,EACN,IAEX,IAAK,CAAC5E,EAAKf,KAAO,CACd,MAAO,KAAK,OAAOe,EAAMf,GAAK,EAAE,EAChC,KAAM,GAAM,IAAOe,EAAMf,GAAK,GAAM,CAC5C,GACI,QAAS,CAACupB,EAAI1pB,EAAKyP,EAAS,KAAU,CAClCga,EAAO,SAASC,EAAI1pB,CAAG,EACvB,KAAM,CAAE,UAAA8pB,EAAW,KAAAC,CAAI,EAAKN,EACtBxM,EAAO8M,EAAQ/pB,EAAM+pB,EACrBC,EAAW/M,EAAQ6M,IAAc7M,GAASA,EAAO6M,EACjD3oB,EAAM,CAAA,EACZ,QAAShB,EAAI,EAAGA,EAAIupB,EAAG,OAAQvpB,IAAK,CAChC,IAAIiE,EAAIslB,EAAGvpB,CAAC,EAMZ,GALIsP,IACArL,EAAI,CAACA,GAELjE,IAAMupB,EAAG,OAAS,IAClBtlB,GAAK4lB,GACL5lB,IAAM,EAEV,QAASuiB,EAAI,EAAGA,EAAIoD,EAAMpD,IAAK,CAC3B,MAAM3pB,EAAI,GAAM+sB,EAAOpD,EAAI,EACvBviB,EAAIpH,GACJmE,EAAI,KAAKhB,EAAI4pB,EAAOpD,CAAC,CAC7B,CACJ,CACA,OAAOxlB,CACX,EACA,MAAQxC,GAAQ,CACZ,MAAMwC,EAAM,CAAA,EACZ,IAAI8oB,EACJ,UAAW9pB,KAAKxB,EACRsrB,IAAQ,QAAa9pB,IAAM8pB,EAAI,IAAMA,EAAI,OACzC9oB,EAAI,KAAM8oB,EAAM,CAAE,IAAK9pB,EAAG,OAAQ,EAAG,EAErC8pB,EAAI,QAAU,EAEtB,OAAO9oB,CACX,EACA,WAAY,CAACuoB,EAAI1pB,EAAKyP,EAAS,KAAU,IAAIga,EAAO,MAAMA,EAAO,QAAQC,EAAI1pB,EAAKyP,CAAM,CAAC,EACpF,IAAKtP,GAAM,IAAIA,EAAE,GAAG,IAAIA,EAAE,MAAM,GAAG,EACnC,KAAK,IAAI,CAAC,IACf,SAAU,CAACupB,EAAIC,EAAOzoB,EAAKlB,EAAK6pB,EAAe,KAAS,CACpDJ,EAAO,SAASE,EAAOzoB,EAAKlB,CAAG,EAC/B,KAAM,CAAE,UAAA8pB,EAAW,KAAAC,CAAI,EAAKN,EAMtBtP,EAAQjZ,EAAM6oB,EAAO,KAAK,MAAM7oB,EAAM6oB,CAAI,EAAI,OAC9CG,EAAUhpB,EAAMlB,EAChBmqB,EAAOD,EAAUH,EAAO,KAAK,MAAMG,EAAUH,CAAI,EAAI,OAE3D,GAAI5P,IAAU,QAAaA,IAAUgQ,EACjC,OAAOV,EAAO,IAAIC,EAAIvP,EAAQ2P,IAAeC,EAAO/pB,GAAU+pB,EAAO/pB,EAAMkB,EAAM2oB,CAAY,EACjG,GAAI1P,IAAU,QACN,CAACsP,EAAO,IAAIC,EAAIvP,EAAO2P,IAAc5oB,EAAM6oB,EAAMF,CAAY,EAC7D,MAAO,GAGf,MAAMO,EAAQjQ,IAAU,OAAYA,EAAQ,EAAIjZ,EAAM6oB,EAChDjpB,EAAMqpB,IAAS,OAAYA,EAAOD,EAAUH,EAClD,QAAS5pB,EAAIiqB,EAAOjqB,EAAIW,EAAKX,IACzB,GAAI,CAACspB,EAAO,IAAIC,EAAIvpB,EAAG2pB,EAAWD,CAAY,EAC1C,MAAO,GACf,MAAI,EAAAM,IAAS,QAAahQ,IAAUgQ,GAC5B,CAACV,EAAO,IAAIC,EAAIS,EAAML,GAAcC,EAAQG,EAAUH,EAAQF,CAAY,EAGtF,CACJ,EACML,GAAO,CAST,QAAS,CAACa,EAAOnB,EAAKoB,IAAU,CAC5B,MAAMH,EAAO,CAAE,IAAAjB,CAAG,EAClBmB,EAAM,KAAKF,CAAI,EACfG,EAAM,CAAChY,EAAOiY,IAAY,CACtBJ,EAAK,MAAQ7X,EACbiY,EAAO,EACPJ,EAAK,MAAQ,MACjB,CAAC,EACDE,EAAM,IAAG,CACb,EACA,KAAOA,GAAU,CACb,MAAMlpB,EAAM,CAAA,EACZ,UAAWhB,KAAKkqB,EACRlqB,EAAE,QAAU,QACZgB,EAAI,KAAKhB,EAAE,KAAK,EACxB,OAAOgB,EAAI,KAAK,GAAG,CACvB,EACA,IAAK,CAACqpB,EAAMH,EAAO9hB,IAAQ,CACvB,MAAMkU,EAAM,IAAI,MAAM,GAAG+N,CAAI,IAAIhB,GAAK,KAAKa,CAAK,CAAC,MAAM,OAAO9hB,GAAQ,SAAWA,EAAMA,EAAI,OAAO,EAAE,EACpG,OAAIA,aAAe,OAASA,EAAI,QAC5BkU,EAAI,MAAQlU,EAAI,OACbkU,CACX,EACA,QAAS,CAAC4N,EAAOI,IAAS,CACtB,MAAMC,EAAQD,EAAK,MAAM,GAAG,EACtBE,EAAUN,EAAM,IAAK,GAAM,EAAE,GAAG,EACtC,IAAIlqB,EAAI,EACR,KAAOA,EAAIuqB,EAAM,QACTA,EAAMvqB,CAAC,IAAM,KADIA,IAEjBwqB,EAAQ,IAAG,EAInB,IAAIV,EAAMU,EAAQ,IAAG,EACrB,KAAOxqB,EAAIuqB,EAAM,OAAQvqB,IAAK,CAC1B,GAAI,CAAC8pB,GAAOA,EAAIS,EAAMvqB,CAAC,CAAC,IAAM,OAC1B,OACJ8pB,EAAMA,EAAIS,EAAMvqB,CAAC,CAAC,CACtB,CACA,OAAO8pB,CACX,CACJ,EAMA,MAAMW,EAAQ,CACV,IAAM,EACN,KACA,KACA,MACA,OACA,aACA,OAAS,EACT,OAAS,EACT,GACA,KACA,YAAY/pB,EAAM2H,EAAO,GAAI6hB,EAAQ,CAAA,EAAIQ,EAAS,OAAWC,EAAe,EAAG,CAC3E,KAAK,KAAOjqB,EACZ,KAAK,KAAO2H,EACZ,KAAK,MAAQ6hB,EACb,KAAK,OAASQ,EACd,KAAK,aAAeC,EACpB,KAAK,KAAOjkB,GAAWhG,CAAI,CAC/B,CAEA,iBAAkB,CACd,GAAI,KAAK,OACL,OAAO,KAAK,OAAO,gBAAe,EAClC,KAAK,KAET,KAAK,GAAK4oB,EAAO,OAAO,KAAK,KAAK,MAAM,EACxCA,EAAO,SAAS,KAAK,GAAI,KAAK,KAAK,OAAQ,EAAG,KAAK,IAAK,KAAK,KAAK,kBAAkB,EACxF,CACA,YAAYvoB,EAAKlB,EAAK,CAClB,OAAI,KAAK,OACE,KAAK,OAAO,YAAY,KAAK,aAAekB,EAAKlB,CAAG,EAC3D,CAACA,GAED,CAAC,KAAK,GACC,GACJypB,EAAO,SAAS,KAAK,GAAI,KAAK,KAAK,OAAQvoB,EAAKlB,EAAK,EAAK,CACrE,CACA,UAAUA,EAAK,CACX,MAAMkB,EAAM,KAAK,IACjB,KAAK,KAAOlB,EACZ,MAAMmB,EAAM,KAAK,YAAYD,EAAKlB,CAAG,EACrC,GAAI,CAAC,KAAK,KAAK,oBAAsB,CAACmB,EAClC,MAAM,KAAK,IAAI,qBAAqB,KAAK,GAAG,QAAQnB,CAAG,EAAE,EAC7D,OAAOmB,CACX,CACA,QAAQ+nB,EAAKoB,EAAO,CAChB,OAAOd,GAAK,QAAQ,KAAK,MAAON,EAAKoB,CAAK,CAC9C,CACA,SAASprB,EAAG8B,EAAI,CACZ,GAAI,CAAC,OAAO,SAAS9B,CAAC,EAClB,MAAM,KAAK,IAAI,0BAA0BA,CAAC,EAAE,EAChD,GAAI,KAAK,IAAMA,EAAI,KAAK,KAAK,OACzB,MAAM,KAAK,IAAI,oCAAoC,EACvD,MAAMiC,EAAMH,EAAG,KAAK,KAAM,KAAK,GAAG,EAClC,YAAK,UAAU9B,CAAC,EACTiC,CACX,CAEA,SAASjC,EAAG,CACR,GAAIA,EAAI,KAAK,KAAK,OACd,MAAM,IAAI,MAAM,0BAA0B,EAC9C,OAAO,KAAK,KAAK,SAASA,CAAC,CAC/B,CACA,QAAS,CACL,GAAI,MAAK,KAAK,iBAEd,IAAI,KAAK,OACL,MAAM,KAAK,IAAI,GAAG,KAAK,MAAM,4BAA4B6rB,EAAQ,OAAO,KAAK,KAAK,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,EAExG,GAAI,KAAK,IAAM,CAAC,KAAK,OAAQ,CACzB,MAAMC,EAAUvB,EAAO,QAAQ,KAAK,GAAI,KAAK,KAAK,OAAQ,EAAI,EAC9D,GAAIuB,EAAQ,OAAQ,CAChB,MAAMC,EAAYxB,EAAO,MAAMuB,CAAO,EACjC,IAAI,CAAC,CAAE,IAAA9pB,EAAK,OAAA6E,CAAM,IAAO,IAAI7E,CAAG,IAAI6E,CAAM,KAAKglB,EAAQ,OAAO,KAAK,KAAK,SAAS7pB,EAAKA,EAAM6E,CAAM,CAAC,CAAC,GAAG,EACvG,KAAK,IAAI,EACd,MAAM,KAAK,IAAI,uBAAuBklB,CAAS,WAAW,KAAK,KAAK,MAAM,GAAG,CACjF,KAEI,OACR,CAEA,GAAI,CAAC,KAAK,QACN,MAAM,KAAK,IAAI,GAAG,KAAK,SAAS,UAAU,KAAK,MAAM,4BAA4BF,EAAQ,OAAO,KAAK,KAAK,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,EAEpI,CAEA,IAAIxiB,EAAK,CACL,OAAOihB,GAAK,IAAI,SAAU,KAAK,MAAOjhB,CAAG,CAC7C,CACA,aAAarJ,EAAG,CACZ,GAAIA,EAAI,KAAK,KAAK,OACd,MAAM,KAAK,IAAI,wCAAwC,EAC3D,OAAO,IAAI0rB,GAAQ,KAAK,SAAS1rB,CAAC,EAAG,KAAK,KAAM,KAAK,MAAO,KAAMA,CAAC,CACvE,CACA,MAAMA,EAAGgsB,EAAO,GAAO,CACnB,GAAI,KAAK,OACL,MAAM,KAAK,IAAI,6BAA6B,EAChD,GAAI,CAAC,OAAO,SAAShsB,CAAC,EAClB,MAAM,KAAK,IAAI,2BAA2BA,CAAC,EAAE,EACjD,GAAI,KAAK,IAAMA,EAAI,KAAK,KAAK,OACzB,MAAM,KAAK,IAAI,qCAAqC,EACxD,MAAMisB,EAAQ,KAAK,KAAK,SAAS,KAAK,IAAK,KAAK,IAAMjsB,CAAC,EACvD,OAAKgsB,GACD,KAAK,UAAUhsB,CAAC,EACbisB,CACX,CACA,KAAKD,EAAO,GAAO,CACf,GAAI,KAAK,OACL,MAAM,KAAK,IAAI,4BAA4B,EAC/C,GAAI,KAAK,IAAM,EAAI,KAAK,KAAK,OACzB,MAAM,KAAK,IAAI,qCAAqC,EACxD,MAAMrqB,EAAO,KAAK,KAAK,KAAK,GAAG,EAC/B,OAAKqqB,GACD,KAAK,UAAU,CAAC,EACbrqB,CACX,CACA,IAAI,WAAY,CACZ,OAAO,KAAK,KAAK,OAAS,KAAK,GACnC,CACA,IAAI,YAAa,CACb,OAAO,KAAK,KAAK,MACrB,CACA,OAAQ,CACJ,OAAO,KAAK,KAAO,KAAK,KAAK,QAAU,CAAC,KAAK,MACjD,CAEA,KAAKF,EAAM,CACP,GAAIA,EAAO,GACP,MAAM,KAAK,IAAI,yDAAyD,EAC5E,IAAI8F,EAAM,EACV,KAAO9F,GAAM,CACJ,KAAK,SACN,KAAK,OAAS,KAAK,KAAI,EACvB,KAAK,OAAS,GAElB,MAAM6I,EAAO,KAAK,IAAI7I,EAAM,KAAK,MAAM,EACvC,KAAK,QAAU6I,EACf/C,EAAOA,GAAO+C,EAAU,KAAK,QAAU,KAAK,OAAW,GAAKA,EAAO,EACnE,KAAK,QAAU,GAAK,KAAK,OAAS,EAClC7I,GAAQ6I,CACZ,CAEA,OAAO/C,IAAQ,CACnB,CACA,KAAK2kB,EAAQlqB,EAAM,KAAK,IAAK,CACzB,GAAI,CAAC7C,EAAQ+sB,CAAM,EACf,MAAM,KAAK,IAAI,8BAA8BA,CAAM,EAAE,EACzD,GAAI,KAAK,OACL,MAAM,KAAK,IAAI,4BAA4B,EAC/C,GAAI,CAACA,EAAO,OACR,MAAM,KAAK,IAAI,uBAAuB,EAE1C,QAASpE,EAAM9lB,GAAM8lB,EAAM,KAAK,KAAK,QAAQoE,EAAO,CAAC,EAAGpE,CAAG,KAAO,GAAIA,IAAO,CAIzE,GAHIA,IAAQ,IAEM,KAAK,KAAK,OAASA,EACrBoE,EAAO,OACnB,OACJ,GAAIpC,GAAWoC,EAAQ,KAAK,KAAK,SAASpE,EAAKA,EAAMoE,EAAO,MAAM,CAAC,EAC/D,OAAOpE,CACf,CAEJ,CACJ,CAMA,MAAMqE,EAAQ,CACV,IAAM,EACN,MAIA,QAAU,CAAA,EACV,KAAO,CAAA,EACP,OAAS,EACT,OAAS,EACT,QAAU,IAAI,WAAW,CAAC,EAC1B,KACA,SAAW,GACX,YAAYhB,EAAQ,GAAI,CACpB,KAAK,MAAQA,EACb,KAAK,KAAOxjB,GAAW,KAAK,OAAO,CACvC,CACA,QAAQqiB,EAAKoB,EAAO,CAChB,OAAOd,GAAK,QAAQ,KAAK,MAAON,EAAKoB,CAAK,CAC9C,CACA,UAAUtqB,EAAKgB,EAAI,CACf,GAAI,KAAK,SACL,MAAM,KAAK,IAAI,kBAAkB,EACrC,GAAI,CAACmoB,GAAMnpB,CAAG,GAAKA,EAAM,EACrB,MAAM,IAAI,MAAM,0BAA0BA,CAAG,EAAE,EACnDgB,EAAG,KAAK,IAAI,EACZ,KAAK,MAAM,KAAK,QAAQ,MAAM,EAAGhB,CAAG,CAAC,EACrC,KAAK,QAAQ,KAAK,CAAC,CACvB,CAEA,IAAIuI,EAAK,CACL,GAAI,KAAK,SACL,MAAM,KAAK,IAAI,kBAAkB,EACrC,OAAOihB,GAAK,IAAI,SAAU,KAAK,MAAOjhB,CAAG,CAC7C,CACA,MAAM/J,EAAG,CACL,GAAI,KAAK,SACL,MAAM,KAAK,IAAI,kBAAkB,EACrC,GAAI,KAAK,OACL,MAAM,KAAK,IAAI,4CAA4C,EAC/D,KAAK,QAAQ,KAAKA,CAAC,EACnB,KAAK,KAAOA,EAAE,MAClB,CACA,KAAKA,EAAG,CACJ,GAAI,KAAK,SACL,MAAM,KAAK,IAAI,kBAAkB,EACrC,GAAI,KAAK,OACL,MAAM,KAAK,IAAI,2CAA2C,EAC9D,KAAK,QAAQ,KAAK,IAAI,WAAW,CAACA,CAAC,CAAC,CAAC,EACrC,KAAK,KACT,CACA,OAAOmI,EAAQ,GAAM,CACjB,GAAI,KAAK,SACL,MAAM,KAAK,IAAI,kBAAkB,EACrC,GAAI,KAAK,OACL,MAAM,KAAK,IAAI,wCAAwC,EAE3D,MAAM2kB,EAAU,KAAK,QAAQ,OAAO,KAAK,KAAK,IAAKnrB,GAAMA,EAAE,MAAM,CAAC,EAC5DyC,EAAM0oB,EAAQ,IAAK9sB,GAAMA,EAAE,MAAM,EAAE,OAAO,CAACF,EAAGE,IAAMF,EAAIE,EAAG,CAAC,EAC5Dga,EAAM,IAAI,WAAW5V,CAAG,EAC9B,QAASzC,EAAI,EAAG+H,EAAM,EAAG/H,EAAImrB,EAAQ,OAAQnrB,IAAK,CAC9C,MAAM7B,EAAIgtB,EAAQnrB,CAAC,EACnBqY,EAAI,IAAIla,EAAG4J,CAAG,EACdA,GAAO5J,EAAE,MACb,CACA,QAAS4C,EAAM,KAAK,IAAK,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IAAK,CACvD,MAAMqqB,EAAM,KAAK,KAAK,CAAC,EACvB/S,EAAI,IAAI+S,EAAI,IAAI,OAAOrqB,CAAG,EAAGqqB,EAAI,GAAG,EACpCrqB,GAAOqqB,EAAI,OAAO,MACtB,CAEA,GAAI5kB,EAAO,CAIP,KAAK,QAAU,CAAA,EACf,UAAWzI,KAAK,KAAK,KACjBA,EAAE,OAAO,KAAK,CAAC,EACnB,KAAK,KAAO,CAAA,EACZ,KAAK,SAAW,GAChB,KAAK,OAAS,CAClB,CACA,OAAOsa,CACX,CACA,KAAK1S,EAAOnF,EAAM,CACd,GAAIA,EAAO,GACP,MAAM,KAAK,IAAI,0DAA0D,EAC7E,GAAImF,GAAS,GAAKnF,EACd,MAAM,KAAK,IAAI,qBAAqBmF,CAAK,iBAAiBnF,CAAI,GAAG,EACrE,KAAOA,GAAM,CACT,MAAM6I,EAAO,KAAK,IAAI7I,EAAM,EAAI,KAAK,MAAM,EAC3C,KAAK,OAAU,KAAK,QAAU6I,EAAS1D,GAAUnF,EAAO6I,EACxD,KAAK,QAAUA,EACf7I,GAAQ6I,EACR1D,GAAS,GAAKnF,EAAO,EACjB,KAAK,SAAW,IAChB,KAAK,OAAS,EACd,KAAK,QAAQ,KAAK,IAAI,WAAW,CAAC,KAAK,MAAM,CAAC,CAAC,EAC/C,KAAK,MAEb,CACJ,CACJ,CAEA,MAAM6qB,GAAkBhtB,GAAM,WAAW,KAAKA,CAAC,EAAE,QAAO,EAExD,SAASitB,GAAY3lB,EAAOnF,EAAM+qB,EAAQ,CACtC,GAAIA,EAAQ,CAER,MAAMC,EAAU,KAAOhrB,EAAO,IAC9B,GAAImF,EAAQ,CAAC6lB,GAAW7lB,GAAS6lB,EAC7B,MAAM,IAAI,MAAM,wCAAwC,CAACA,CAAO,OAAO7lB,CAAK,MAAM6lB,CAAO,EAAE,CACnG,SAGQ,GAAK7lB,GAASA,GAAS,IAAMnF,EAC7B,MAAM,IAAI,MAAM,+CAA+CmF,CAAK,MAAM,IAAMnF,CAAI,EAAE,CAElG,CACA,SAASirB,GAAMC,EAAO,CAClB,MAAO,CAEH,aAAcA,EAAM,aACpB,aAAcA,EAAM,aACpB,KAAMA,EAAM,KACZ,OAAS/lB,GAAU,CACf,MAAMwjB,EAAI,IAAI+B,GACd,OAAAQ,EAAM,aAAavC,EAAGxjB,CAAK,EACpBwjB,EAAE,OAAM,CACnB,EACA,OAAQ,CAACzoB,EAAM2H,EAAO,KAAO,CACzB,MAAM,EAAI,IAAIoiB,GAAQ/pB,EAAM2H,CAAI,EAC1BrH,EAAM0qB,EAAM,aAAa,CAAC,EAChC,SAAE,OAAM,EACD1qB,CACX,CACR,CACA,CAcO,SAAS2qB,GAASD,EAAO7qB,EAAI,CAChC,GAAI,CAACqoB,GAAQwC,CAAK,EACd,MAAM,IAAI,MAAM,iCAAiCA,CAAK,EAAE,EAC5D,GAAI,OAAO7qB,GAAO,WACd,MAAM,IAAI,MAAM,iCAAiC,EACrD,OAAO4qB,GAAM,CACT,KAAMC,EAAM,KACZ,aAAc,CAACvC,EAAGxjB,IAAU,CACxB,IAAI3E,EACJ,GAAI,CACAA,EAAMH,EAAG8E,CAAK,CAClB,OACOod,EAAG,CACN,MAAMoG,EAAE,IAAIpG,CAAC,CACjB,CACA2I,EAAM,aAAavC,EAAGnoB,CAAG,CAC7B,EACA,aAAe0O,GAAM,CACjB,MAAM1O,EAAM0qB,EAAM,aAAahc,CAAC,EAChC,GAAI,CACA,OAAO7O,EAAGG,CAAG,CACjB,OACO+hB,EAAG,CACN,MAAMrT,EAAE,IAAIqT,CAAC,CACjB,CACJ,CACR,CAAK,CACL,CAmBY,MAACzjB,EAAQosB,GAAU,CAC3B,MAAM1qB,EAAMyqB,GAAMC,CAAK,EACvB,OAAOA,EAAM,SAAWC,GAAS3qB,EAAK0qB,EAAM,QAAQ,EAAI1qB,CAC5D,EACM4qB,GAAepV,GAAQsS,GAActS,CAAG,GAAK,OAAOA,EAAI,QAAW,YAAc,OAAOA,EAAI,QAAW,WAMtG,SAAS0S,GAAQ1S,EAAK,CACzB,OAAQsS,GAActS,CAAG,GACrBoV,GAAYpV,CAAG,GACf,OAAOA,EAAI,cAAiB,YAC5B,OAAOA,EAAI,cAAiB,aAC3BA,EAAI,OAAS,QAAawS,GAAMxS,EAAI,IAAI,EACjD,CAYA,SAASqV,IAAO,CACZ,MAAO,CACH,OAASxrB,GAAS,CACd,GAAI,CAAC,MAAM,QAAQA,CAAI,EACnB,MAAM,IAAI,MAAM,gBAAgB,EACpC,MAAMC,EAAK,CAAA,EACX,UAAW7B,KAAQ4B,EAAM,CACrB,GAAI,CAAC,MAAM,QAAQ5B,CAAI,GAAKA,EAAK,SAAW,EACxC,MAAM,IAAI,MAAM,gCAAgC,EACpD,MAAM4rB,EAAO5rB,EAAK,CAAC,EACbkH,EAAQlH,EAAK,CAAC,EACpB,GAAI6B,EAAG+pB,CAAI,IAAM,OACb,MAAM,IAAI,MAAM,OAAOA,CAAI,2BAA2B,EAC1D/pB,EAAG+pB,CAAI,EAAI1kB,CACf,CACA,OAAOrF,CACX,EACA,OAASA,GAAO,CACZ,GAAI,CAACwoB,GAAcxoB,CAAE,EACjB,MAAM,IAAI,MAAM,8BAA8BA,CAAE,EAAE,EACtD,OAAO,OAAO,QAAQA,CAAE,CAC5B,CACR,CACA,CAMA,MAAMwrB,GAAe,CACjB,OAASzrB,GAAS,CACd,GAAI,OAAOA,GAAS,SAChB,MAAM,IAAI,MAAM,wBAAwB,OAAOA,CAAI,EAAE,EACzD,GAAIA,EAAO,OAAO,OAAO,gBAAgB,EACrC,MAAM,IAAI,MAAM,wCAAwCA,CAAI,EAAE,EAClE,OAAO,OAAOA,CAAI,CACtB,EACA,OAASC,GAAO,CACZ,GAAI,CAAC0oB,GAAM1oB,CAAE,EACT,MAAM,IAAI,MAAM,+BAA+B,EACnD,OAAO,OAAOA,CAAE,CACpB,CACJ,EAWA,SAASyrB,GAAO,EAAG,CACf,GAAI,CAACjD,GAAc,CAAC,EAChB,MAAM,IAAI,MAAM,uBAAuB,EAC3C,MAAO,CACH,OAASzoB,GAAS,CACd,GAAI,CAAC2oB,GAAM3oB,CAAI,GAAK,EAAEA,KAAQ,GAC1B,MAAM,IAAI,MAAM,eAAeA,CAAI,EAAE,EACzC,OAAO,EAAEA,CAAI,CACjB,EACA,OAASC,GAAO,CACZ,GAAI,OAAOA,GAAO,SACd,MAAM,IAAI,MAAM,eAAe,OAAOA,CAAE,EAAE,EAC9C,OAAO,EAAEA,CAAE,CACf,CACR,CACA,CAWA,SAAS0rB,GAAQC,EAAWC,EAAQ,GAAO,CACvC,GAAI,CAAClD,GAAMiD,CAAS,EAChB,MAAM,IAAI,MAAM,kCAAkCA,CAAS,EAAE,EACjE,GAAI,OAAOC,GAAU,UACjB,MAAM,IAAI,MAAM,wCAAwC,OAAOA,CAAK,EAAE,EAC1E,MAAMC,EAAc,KAAO,OAAOF,CAAS,EAC3C,MAAO,CACH,OAAS5rB,GAAS,CACd,GAAI,OAAOA,GAAS,SAChB,MAAM,IAAI,MAAM,wBAAwB,OAAOA,CAAI,EAAE,EACzD,IAAI0C,GAAK1C,EAAO,GAAK,CAACA,EAAOA,GAAM,SAAS,EAAE,EAC1C+rB,EAAMrpB,EAAE,OAASkpB,EACjBG,EAAM,IACNrpB,EAAIA,EAAE,SAASA,EAAE,OAASqpB,EAAK,GAAG,EAClCA,EAAM,GAEV,IAAI,EAAIrpB,EAAE,OAAS,EACnB,KAAO,GAAKqpB,GAAOrpB,EAAE,CAAC,IAAM,IAAK,IAC7B,CACJ,IAAIoX,EAAMpX,EAAE,MAAM,EAAGqpB,CAAG,EACpBC,EAAOtpB,EAAE,MAAMqpB,EAAK,EAAI,CAAC,EAK7B,OAJKjS,IACDA,EAAM,KACN9Z,EAAO,KACP8Z,EAAM,IAAMA,GACXkS,EAEE,GAAGlS,CAAG,IAAIkS,CAAI,GADVlS,CAEf,EACA,OAAS7Z,GAAO,CACZ,GAAI,OAAOA,GAAO,SACd,MAAM,IAAI,MAAM,wBAAwB,OAAOA,CAAE,EAAE,EACvD,GAAIA,IAAO,KACP,MAAM,IAAI,MAAM,8BAA8B,EAClD,IAAIuU,EAAM,GAKV,GAJIvU,EAAG,WAAW,GAAG,IACjBuU,EAAM,GACNvU,EAAKA,EAAG,MAAM,CAAC,GAEf,CAAC,yBAAyB,KAAKA,CAAE,EACjC,MAAM,IAAI,MAAM,sBAAsBA,CAAE,EAAE,EAC9C,IAAI8rB,EAAM9rB,EAAG,QAAQ,GAAG,EACxB8rB,EAAMA,IAAQ,GAAK9rB,EAAG,OAAS8rB,EAE/B,MAAME,EAAOhsB,EAAG,MAAM,EAAG8rB,CAAG,EACtBG,EAAQjsB,EAAG,MAAM8rB,EAAM,CAAC,EAAE,QAAQ,MAAO,EAAE,EAC3CjS,EAAM,OAAOmS,CAAI,EAAIH,EAC3B,GAAI,CAACD,GAASK,EAAM,OAASN,EACzB,MAAM,IAAI,MAAM,kEAAkE3rB,CAAE,UAAU2rB,CAAS,GAAG,EAE9G,MAAMO,EAAU,KAAK,IAAID,EAAM,OAAQN,CAAS,EAC1CI,EAAO,OAAOE,EAAM,MAAM,EAAGC,CAAO,CAAC,EAAI,KAAO,OAAOP,EAAYO,CAAO,EAC1E7mB,EAAQwU,EAAMkS,EACpB,OAAOxX,EAAM,CAAClP,EAAQA,CAC1B,CACR,CACA,CAYA,SAAS8mB,GAAMxY,EAAK,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAG,EAClB,MAAM,IAAI,MAAM,uBAAuB,OAAOA,CAAG,EAAE,EACvD,UAAWjU,KAAKiU,EACZ,GAAI,CAAC2X,GAAY5rB,CAAC,EACd,MAAM,IAAI,MAAM,oBAAoBA,CAAC,EAAE,EAC/C,MAAO,CACH,OAASK,GAAS,CACd,UAAW4D,KAAKgQ,EAAK,CACjB,MAAMuC,EAAMvS,EAAE,OAAO5D,CAAI,EACzB,GAAImW,IAAQ,OACR,OAAOA,CACf,CACA,MAAM,IAAI,MAAM,sCAAsCnW,CAAI,EAAE,CAChE,EACA,OAASC,GAAO,CACZ,UAAW2D,KAAKgQ,EAAK,CACjB,MAAMuC,EAAMvS,EAAE,OAAO3D,CAAE,EACvB,GAAIkW,IAAQ,OACR,OAAOA,CACf,CACA,MAAM,IAAI,MAAM,sCAAsClW,CAAE,EAAE,CAC9D,CACR,CACA,CAEA,MAAMosB,GAAWC,GAAU,CACvB,GAAI,CAACf,GAAYe,CAAK,EAClB,MAAM,IAAI,MAAM,oBAAoB,EACxC,MAAO,CAAE,OAAQA,EAAM,OAAQ,OAAQA,EAAM,MAAM,CACvD,EACaC,GAAS,CAAE,KAAAf,GAAM,aAAAC,GAAc,OAAAC,GAAQ,QAAAC,GAAS,MAAAS,GAAO,QAAAC,EAAO,EAwC9DG,GAAS,CAACtL,EAAMuL,EAAK,GAAOvB,EAAS,GAAOwB,EAAQ,KAAS,CACtE,GAAI,CAAC/D,GAAMzH,CAAI,EACX,MAAM,IAAI,MAAM,4BAA4BA,CAAI,EAAE,EACtD,GAAI,OAAOuL,GAAO,UACd,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAE,EAAE,EACnE,GAAI,OAAOvB,GAAW,UAClB,MAAM,IAAI,MAAM,wCAAwC,OAAOA,CAAM,EAAE,EAC3E,GAAI,OAAOwB,GAAU,UACjB,MAAM,IAAI,MAAM,uCAAuC,OAAOA,CAAK,EAAE,EACzE,MAAMC,EAAO,OAAOzL,CAAI,EAClBiK,EAAU,KAAO,GAAKwB,EAAO,IACnC,OAAO1tB,EAAK,CACR,KAAMytB,EAAQxL,EAAO,OACrB,aAAc,CAAC4H,EAAGxjB,IAAU,CACpB4lB,GAAU5lB,EAAQ,IAClBA,EAAQA,EAAQ6lB,GACpB,MAAMntB,EAAI,CAAA,EACV,QAAS2B,EAAI,EAAGA,EAAIuhB,EAAMvhB,IACtB3B,EAAE,KAAK,OAAOsH,EAAQ,IAAI,CAAC,EAC3BA,IAAU,GAEd,IAAI3E,EAAM,IAAI,WAAW3C,CAAC,EAAE,QAAO,EACnC,GAAI,CAAC0uB,EAAO,CACR,IAAIhsB,EAAM,EACV,IAAKA,EAAM,EAAGA,EAAMC,EAAI,QAChBA,EAAID,CAAG,IAAM,EADWA,IAC5B,CAEJC,EAAMA,EAAI,SAASD,CAAG,CAC1B,CACAooB,EAAE,MAAM2D,EAAK9rB,EAAI,QAAO,EAAKA,CAAG,CACpC,EACA,aAAe0O,GAAM,CAEjB,MAAM/J,EAAQ+J,EAAE,MAAMqd,EAAQxL,EAAO,KAAK,IAAIA,EAAM7R,EAAE,SAAS,CAAC,EAC1DrR,EAAIyuB,EAAKnnB,EAAQ0lB,GAAe1lB,CAAK,EAC3C,IAAI3E,EAAM,GACV,QAAShB,EAAI,EAAGA,EAAI3B,EAAE,OAAQ2B,IAC1BgB,GAAO,OAAO3C,EAAE2B,CAAC,CAAC,GAAM,GAAK,OAAOA,CAAC,EACzC,OAAIurB,GAAUvqB,EAAMwqB,IAChBxqB,GAAOA,EAAMwqB,GAAWA,GACrBxqB,CACX,EACA,SAAW2E,GAAU,CACjB,GAAI,OAAOA,GAAU,SACjB,MAAM,IAAI,MAAM,0BAA0BA,CAAK,EAAE,EACrD,OAAA2lB,GAAY3lB,EAAO,GAAKqnB,EAAM,CAAC,CAACzB,CAAM,EAC/B5lB,CACX,CACR,CAAK,CACL,EAIasnB,GAAyBJ,GAAO,GAAI,EAAK,EAczCK,GAAwBL,GAAO,EAAG,EAAI,EAItCM,GAAwBN,GAAO,EAAG,GAAM,EAAI,EAkCnD1jB,GAAO,CAACtJ,EAAKwI,IAAS/I,EAAK,CAC7B,KAAMO,EACN,aAAc,CAACspB,EAAGxjB,IAAUwjB,EAAE,UAAUtpB,EAAMsJ,GAASd,EAAK,MAAMc,EAAMxD,CAAK,CAAC,EAC9E,aAAe+J,GAAMA,EAAE,SAAS7P,EAAKwI,EAAK,IAAI,EAC9C,SAAW1C,GAAU,CACjB,GAAI,OAAOA,GAAU,SACjB,MAAM,IAAI,MAAM,mCAAmC,OAAOA,CAAK,EAAE,EACrE,OAAI0C,EAAK,UACLA,EAAK,SAAS1C,CAAK,EAChBA,CACX,CACJ,CAAC,EACKynB,GAAU,CAACvtB,EAAK0rB,EAAQljB,IAAS,CACnC,MAAM7H,EAAOX,EAAM,EACb2rB,EAAU,IAAMhrB,EAAO,GAEvB6sB,EAAkB1nB,GAAU,CAC9B,GAAI,CAACqjB,GAAMrjB,CAAK,EACZ,MAAM,IAAI,MAAM,wCAAwCA,CAAK,EAAE,EACnE,GAAIA,EAAQ,CAAC6lB,GAAW7lB,GAAS6lB,EAC7B,MAAM,IAAI,MAAM,2CAA2C,CAACA,CAAO,OAAO7lB,CAAK,MAAM6lB,CAAO,EAAE,CAEtG,EACM8B,EAAS,GAAK9sB,EACd+sB,EAAoB5nB,GAAU,CAChC,GAAI,CAACqjB,GAAMrjB,CAAK,EACZ,MAAM,IAAI,MAAM,wCAAwCA,CAAK,EAAE,EACnE,GAAI,EAAIA,GAASA,GAAS2nB,EACtB,MAAM,IAAI,MAAM,gDAAgD3nB,CAAK,MAAM2nB,CAAM,EAAE,CAE3F,EACA,OAAOnkB,GAAKtJ,EAAK,CACb,MAAOwI,EAAK,MACZ,KAAMA,EAAK,KACX,SAAUkjB,EAAS8B,EAAiBE,CAC5C,CAAK,CACL,EAEaC,GAAwBJ,GAAQ,EAAG,GAAO,CACnD,KAAM,CAACjkB,EAAMpI,IAAQoI,EAAK,UAAUpI,EAAK,EAAI,EAC7C,MAAO,CAACoI,EAAMxD,IAAUwD,EAAK,UAAU,EAAGxD,EAAO,EAAI,CACzD,CAAC,EAEY8nB,GAAwBL,GAAQ,EAAG,GAAO,CACnD,KAAM,CAACjkB,EAAMpI,IAAQoI,EAAK,UAAUpI,EAAK,EAAK,EAC9C,MAAO,CAACoI,EAAMxD,IAAUwD,EAAK,UAAU,EAAGxD,EAAO,EAAK,CAC1D,CAAC,EAEY+nB,GAAwBN,GAAQ,EAAG,GAAM,CAClD,KAAM,CAACjkB,EAAMpI,IAAQoI,EAAK,SAASpI,EAAK,EAAI,EAC5C,MAAO,CAACoI,EAAMxD,IAAUwD,EAAK,SAAS,EAAGxD,EAAO,EAAI,CACxD,CAAC,EAOYgoB,GAAwBP,GAAQ,EAAG,GAAO,CACnD,KAAM,CAACjkB,EAAMpI,IAAQoI,EAAK,UAAUpI,EAAK,EAAI,EAC7C,MAAO,CAACoI,EAAMxD,IAAUwD,EAAK,UAAU,EAAGxD,EAAO,EAAI,CACzD,CAAC,EAiBYioB,GAAqBR,GAAQ,EAAG,GAAO,CAChD,KAAM,CAACjkB,EAAMpI,IAAQoI,EAAK,SAASpI,CAAG,EACtC,MAAO,CAACoI,EAAMxD,IAAUwD,EAAK,SAAS,EAAGxD,CAAK,CAClD,CAAC,EA4DKkoB,GAAc,CAAChuB,EAAKitB,EAAK,KAAU,CACrC,GAAI,OAAOA,GAAO,UACd,MAAM,IAAI,MAAM,mCAAmC,OAAOA,CAAE,EAAE,EAClE,MAAMgB,EAAU7E,GAAYppB,CAAG,EACzBkuB,EAAO7vB,EAAQ2B,CAAG,EACxB,OAAOP,EAAK,CACR,KAAM,OAAOO,GAAQ,SAAWA,EAAM,OACtC,aAAc,CAACspB,EAAGxjB,IAAU,CACnBooB,GACDD,EAAQ,aAAa3E,EAAGxjB,EAAM,MAAM,EACxCwjB,EAAE,MAAM2D,EAAKzB,GAAe1lB,CAAK,EAAIA,CAAK,EACtCooB,GACA5E,EAAE,MAAMtpB,CAAG,CACnB,EACA,aAAe6P,GAAM,CACjB,IAAItN,EACJ,GAAI2rB,EAAM,CACN,MAAMC,EAAOte,EAAE,KAAK7P,CAAG,EACvB,GAAI,CAACmuB,EACD,MAAMte,EAAE,IAAI,+BAA+B,EAC/CtN,EAAQsN,EAAE,MAAMse,EAAOte,EAAE,GAAG,EAC5BA,EAAE,MAAM7P,EAAI,MAAM,CACtB,MAEIuC,EAAQsN,EAAE,MAAM7P,IAAQ,KAAO6P,EAAE,UAAYoe,EAAQ,aAAape,CAAC,CAAC,EAExE,OAAOod,EAAKzB,GAAejpB,CAAK,EAAIA,CACxC,EACA,SAAWuD,GAAU,CACjB,GAAI,CAACzH,EAAQyH,CAAK,EACd,MAAM,IAAI,MAAM,wBAAwBA,CAAK,EAAE,EACnD,OAAOA,CACX,CACR,CAAK,CACL,EAgBO,SAAS7B,GAAOjE,EAAK6rB,EAAO,CAC/B,GAAI,CAACxC,GAAQwC,CAAK,EACd,MAAM,IAAI,MAAM,+BAA+BA,CAAK,EAAE,EAC1D,OAAOuC,GAAMJ,GAAYhuB,CAAG,EAAG6sB,GAAQhB,CAAK,CAAC,CACjD,CAkBY,MAACwC,GAAS,CAACruB,EAAKitB,EAAK,KAAUnB,GAASsC,GAAMJ,GAAYhuB,EAAKitB,CAAE,EAAGxnB,EAAI,EAAIK,GAAU,CAE9F,GAAI,OAAOA,GAAU,SACjB,MAAM,IAAI,MAAM,wBAAwB,OAAOA,CAAK,EAAE,EAC1D,OAAOA,CACX,CAAC,EAaKwoB,GAAY,CAACtuB,EAAKuuB,EAAU,CAAE,KAAM,GAAO,OAAQ,MAAY,CACjE,IAAI1C,EAAQuC,GAAMJ,GAAYhuB,EAAKuuB,EAAQ,IAAI,EAAGxD,CAAO,EACzD,MAAM9mB,EAASsqB,EAAQ,OACvB,GAAI,OAAOtqB,GAAW,UAClB,MAAM,IAAI,MAAM,qCAAqC,OAAOA,CAAM,EAAE,EACxE,OAAIA,IACA4nB,EAAQuC,GAAMvC,EAAO,CACjB,OAAS/lB,GAAU,KAAKA,CAAK,GAC7B,OAASA,GAAU,CACf,GAAI,CAACA,EAAM,WAAW,IAAI,EACtB,MAAM,IAAI,MAAM,oDAAoD,EACxE,OAAOA,EAAM,MAAM,CAAC,CACxB,CACZ,CAAS,GAEE+lB,CACX,EAUO,SAASuC,GAAMvC,EAAOhV,EAAM,CAC/B,GAAI,CAACwS,GAAQwC,CAAK,EACd,MAAM,IAAI,MAAM,8BAA8BA,CAAK,EAAE,EACzD,GAAI,CAACE,GAAYlV,CAAI,EACjB,MAAM,IAAI,MAAM,6BAA6BgV,CAAK,EAAE,EACxD,OAAOpsB,EAAK,CACR,KAAMosB,EAAM,KACZ,aAAc,CAACvC,EAAGxjB,IAAU,CACxB,IAAI0oB,EACJ,GAAI,CACAA,EAAa3X,EAAK,OAAO/Q,CAAK,CAClC,OACOod,EAAG,CACN,MAAMoG,EAAE,IAAI,GAAKpG,CAAC,CACtB,CACA,OAAO2I,EAAM,aAAavC,EAAGkF,CAAU,CAC3C,EACA,aAAe3e,GAAM,CACjB,MAAM2e,EAAa3C,EAAM,aAAahc,CAAC,EACvC,GAAI,CACA,OAAOgH,EAAK,OAAO2X,CAAU,CACjC,OACOtL,EAAG,CACN,MAAMrT,EAAE,IAAI,GAAKqT,CAAC,CACtB,CACJ,CACR,CAAK,CACL,CAkCO,MAAMuL,GAAO,CAACC,EAAWC,EAAM,KAAU,CAC5C,GAAI,CAACtwB,EAAQqwB,CAAS,EAClB,MAAM,IAAI,MAAM,4CAA4C,OAAOA,CAAS,EAAE,EAClF,GAAI,OAAOC,GAAQ,UACf,MAAM,IAAI,MAAM,mCAAmC,OAAOA,CAAG,EAAE,EACnE,OAAOlvB,EAAK,CACR,KAAMivB,EAAU,OAChB,aAAc,CAACpF,EAAGxjB,IAAU,CACpB,CAAC,CAACA,IAAU6oB,GACZrF,EAAE,MAAMoF,CAAS,CACzB,EACA,aAAe7e,GAAM,CACjB,IAAI+e,EAAU/e,EAAE,WAAa6e,EAAU,OACvC,OAAIE,IACAA,EAAU5F,GAAWnZ,EAAE,MAAM6e,EAAU,OAAQ,EAAI,EAAGA,CAAS,EAE3DE,GACA/e,EAAE,MAAM6e,EAAU,MAAM,GAEzBE,IAAYD,CACvB,EACA,SAAW7oB,GAAU,CACjB,GAAIA,IAAU,QAAa,OAAOA,GAAU,UACxC,MAAM,IAAI,MAAM,kDAAkD,OAAOA,CAAK,EAAE,EACpF,OAAOA,CACX,CACR,CAAK,CACL,EAmBO,SAAS+oB,GAAQpE,EAAMoB,EAAOlS,EAAK,CACtC,GAAI,CAAC0P,GAAQwC,CAAK,EACd,MAAM,IAAI,MAAM,gCAAgCA,CAAK,EAAE,EAG3D,OAAOpsB,EAAK,CACR,aAAc,CAAC6pB,EAAGxjB,IAAU,CAEhB0jB,GAAK,QAAQF,EAAE,MAAOmB,CAAI,GAC1BoB,EAAM,aAAavC,EAAGxjB,CAAK,CAWvC,EACA,aAAe,GAAM,CACjB,IAAI8oB,EAAU,GAMd,GAJIA,EAAU,CAAC,CAACpF,GAAK,QAAQ,EAAE,MAAOiB,CAAI,EAItCmE,EACA,OAAO/C,EAAM,aAAa,CAAC,CAInC,CACR,CAAK,CACL,CA+CO,SAASiD,GAAMjD,EAAOkD,EAAUC,EAAQ,GAAM,CACjD,GAAI,CAAC3F,GAAQwC,CAAK,EACd,MAAM,IAAI,MAAM,8BAA8BA,CAAK,EAAE,EACzD,GAAI,OAAOmD,GAAU,UACjB,MAAM,IAAI,MAAM,gCAAgC,OAAOA,CAAK,EAAE,EAClE,OAAOvvB,EAAK,CACR,KAAMosB,EAAM,KACZ,aAAc,CAACvC,EAAG2F,IAAWpD,EAAM,aAAavC,EAAGyF,CAAQ,EAC3D,aAAe,GAAM,CACjB,MAAMjpB,EAAQ+lB,EAAM,aAAa,CAAC,EAClC,GAAKmD,GAAS,OAAOlpB,GAAU,UAAYA,IAAUipB,GAChD1wB,EAAQ0wB,CAAQ,GAAK,CAAC/F,GAAW+F,EAAUjpB,CAAK,EACjD,MAAM,EAAE,IAAI,yBAAyBA,CAAK,QAAQipB,CAAQ,EAAE,CAGpE,EACA,SAAWjpB,GAAU,CACjB,GAAIA,IAAU,OACV,MAAM,IAAI,MAAM,sBAAsB,OAAOA,CAAK,EAAE,EACxD,OAAOA,CACX,CACR,CAAK,CACL,CAiCA,SAASopB,GAAOphB,EAAQ,CACpB,IAAI4T,EAAO,EACX,UAAWnT,KAAKT,EAAQ,CACpB,GAAIS,EAAE,OAAS,OACX,OACJ,GAAI,CAAC4a,GAAM5a,EAAE,IAAI,EACb,MAAM,IAAI,MAAM,8BAA8BmT,CAAI,EAAE,EACxDA,GAAQnT,EAAE,IACd,CACA,OAAOmT,CACX,CAgBO,SAASyN,GAAOrhB,EAAQ,CAC3B,GAAI,CAACmb,GAAcnb,CAAM,EACrB,MAAM,IAAI,MAAM,sCAAsCA,CAAM,EAAE,EAClE,UAAW0c,KAAQ1c,EACf,GAAI,CAACub,GAAQvb,EAAO0c,CAAI,CAAC,EACrB,MAAM,IAAI,MAAM,iBAAiBA,CAAI,mBAAmB,EAEhE,OAAO/qB,EAAK,CACR,KAAMyvB,GAAO,OAAO,OAAOphB,CAAM,CAAC,EAClC,aAAc,CAACwb,EAAGxjB,IAAU,CACxBwjB,EAAE,QAAQxjB,EAAQykB,GAAY,CAC1B,UAAWC,KAAQ1c,EACfyc,EAAQC,EAAM,IAAM1c,EAAO0c,CAAI,EAAE,aAAalB,EAAGxjB,EAAM0kB,CAAI,CAAC,CAAC,CACrE,CAAC,CACL,EACA,aAAe3a,GAAM,CACjB,MAAM1O,EAAM,CAAA,EACZ,OAAA0O,EAAE,QAAQ1O,EAAMopB,GAAY,CACxB,UAAWC,KAAQ1c,EACfyc,EAAQC,EAAM,IAAOrpB,EAAIqpB,CAAI,EAAI1c,EAAO0c,CAAI,EAAE,aAAa3a,CAAC,CAAE,CACtE,CAAC,EACM1O,CACX,EACA,SAAW2E,GAAU,CACjB,GAAI,OAAOA,GAAU,UAAYA,IAAU,KACvC,MAAM,IAAI,MAAM,yBAAyBA,CAAK,EAAE,EACpD,OAAOA,CACX,CACR,CAAK,CACL,CAQO,SAASspB,GAAMthB,EAAQ,CAC1B,GAAI,CAAC,MAAM,QAAQA,CAAM,EACrB,MAAM,IAAI,MAAM,qBAAqB,OAAOA,CAAM,mBAAmB,EACzE,QAAS3N,EAAI,EAAGA,EAAI2N,EAAO,OAAQ3N,IAC/B,GAAI,CAACkpB,GAAQvb,EAAO3N,CAAC,CAAC,EAClB,MAAM,IAAI,MAAM,gBAAgBA,CAAC,mBAAmB,EAE5D,OAAOV,EAAK,CACR,KAAMyvB,GAAOphB,CAAM,EACnB,aAAc,CAACwb,EAAGxjB,IAAU,CAExB,GAAI,CAAC,MAAM,QAAQA,CAAK,EACpB,MAAMwjB,EAAE,IAAI,wBAAwBxjB,CAAK,EAAE,EAC/CwjB,EAAE,QAAQxjB,EAAQykB,GAAY,CAC1B,QAASpqB,EAAI,EAAGA,EAAI2N,EAAO,OAAQ3N,IAC/BoqB,EAAQ,GAAGpqB,CAAC,GAAI,IAAM2N,EAAO3N,CAAC,EAAE,aAAampB,EAAGxjB,EAAM3F,CAAC,CAAC,CAAC,CACjE,CAAC,CACL,EACA,aAAe0P,GAAM,CACjB,MAAM1O,EAAM,CAAA,EACZ,OAAA0O,EAAE,QAAQ1O,EAAMopB,GAAY,CACxB,QAASpqB,EAAI,EAAGA,EAAI2N,EAAO,OAAQ3N,IAC/BoqB,EAAQ,GAAGpqB,CAAC,GAAI,IAAMgB,EAAI,KAAK2M,EAAO3N,CAAC,EAAE,aAAa0P,CAAC,CAAC,CAAC,CACjE,CAAC,EACM1O,CACX,EACA,SAAW2E,GAAU,CACjB,GAAI,CAAC,MAAM,QAAQA,CAAK,EACpB,MAAM,IAAI,MAAM,wBAAwBA,CAAK,EAAE,EACnD,GAAIA,EAAM,SAAWgI,EAAO,OACxB,MAAM,IAAI,MAAM,uBAAuBhI,EAAM,MAAM,cAAcgI,EAAO,MAAM,EAAE,EACpF,OAAOhI,CACX,CACR,CAAK,CACL,CAYO,SAAS6B,GAAM3H,EAAK6rB,EAAO,CAC9B,GAAI,CAACxC,GAAQwC,CAAK,EACd,MAAM,IAAI,MAAM,8BAA8BA,CAAK,EAAE,EAGzD,MAAMoC,EAAU7E,GAAY,OAAOppB,GAAQ,SAAW,MAAMA,CAAG,GAAKA,CAAG,EACvE,OAAOP,EAAK,CACR,KAAM,OAAOO,GAAQ,UAAY6rB,EAAM,KAAO7rB,EAAM6rB,EAAM,KAAO,OACjE,aAAc,CAACvC,EAAGxjB,IAAU,CACxB,MAAMupB,EAAK/F,EACX+F,EAAG,QAAQvpB,EAAQykB,GAAY,CACtBlsB,EAAQ2B,CAAG,GACZiuB,EAAQ,aAAa3E,EAAGxjB,EAAM,MAAM,EACxC,QAAS3F,EAAI,EAAGA,EAAI2F,EAAM,OAAQ3F,IAC9BoqB,EAAQ,GAAGpqB,CAAC,GAAI,IAAM,CAClB,MAAMwW,EAAM7Q,EAAM3F,CAAC,EACbmvB,EAAWhG,EAAE,IAEnB,GADAuC,EAAM,aAAavC,EAAG3S,CAAG,EACrBtY,EAAQ2B,CAAG,EAAG,CAEd,GAAIA,EAAI,OAASqvB,EAAG,IAAMC,EACtB,OACJ,MAAMzuB,EAAOwuB,EAAG,OAAO,EAAK,EAAE,SAASC,EAAUD,EAAG,GAAG,EAGvD,GAAIrG,GAAWnoB,EAAK,SAAS,EAAGb,EAAI,MAAM,EAAGA,CAAG,EAC5C,MAAMqvB,EAAG,IAAI,wDAAwD1Y,CAAG,SAAS9V,CAAI,EAAE,CAC/F,CACJ,CAAC,CAET,CAAC,EACGxC,EAAQ2B,CAAG,GACXspB,EAAE,MAAMtpB,CAAG,CACnB,EACA,aAAe,GAAM,CACjB,MAAMmB,EAAM,CAAA,EACZ,SAAE,QAAQA,EAAMopB,GAAY,CACxB,GAAIvqB,IAAQ,KACR,QAAS,EAAI,EAAG,CAAC,EAAE,MAAK,IACpBuqB,EAAQ,GAAG,CAAC,GAAI,IAAMppB,EAAI,KAAK0qB,EAAM,aAAa,CAAC,CAAC,CAAC,EACjD,EAAAA,EAAM,MAAQ,EAAE,UAAYA,EAAM,OAFd,IAExB,SAICxtB,EAAQ2B,CAAG,EAChB,QAAS,EAAI,GAAI,IAAK,CAClB,GAAIgpB,GAAW,EAAE,MAAMhpB,EAAI,OAAQ,EAAI,EAAGA,CAAG,EAAG,CAE5C,EAAE,MAAMA,EAAI,MAAM,EAClB,KACJ,CACAuqB,EAAQ,GAAG,CAAC,GAAI,IAAMppB,EAAI,KAAK0qB,EAAM,aAAa,CAAC,CAAC,CAAC,CACzD,KAEC,CACD,IAAI9lB,EACJwkB,EAAQ,WAAY,IAAOxkB,EAASkoB,EAAQ,aAAa,CAAC,CAAE,EAC5D,QAAS9tB,EAAI,EAAGA,EAAI4F,EAAQ5F,IACxBoqB,EAAQ,GAAGpqB,CAAC,GAAI,IAAMgB,EAAI,KAAK0qB,EAAM,aAAa,CAAC,CAAC,CAAC,CAC7D,CACJ,CAAC,EACM1qB,CACX,EACA,SAAW2E,GAAU,CACjB,GAAI,CAAC,MAAM,QAAQA,CAAK,EACpB,MAAM,IAAI,MAAM,wBAAwBA,CAAK,EAAE,EACnD,OAAOA,CACX,CACR,CAAK,CACL,CCpqDA,MAAM4Q,GAAQ6Y,GAAK,MACbvX,GAAKtB,GAAM,GACX4E,GAAc5E,GAAM,GAAG,MAChB4O,GAAWxJ,GAAMA,EAAI,KAAO,GACnCzd,EAAUmxB,GAAY,QACtBvnB,GAAcunB,GAAY,YAC1BxG,GAAawG,GAAY,WAElBC,GAAWlnB,GAAQugB,GAAUplB,GAAO6E,CAAG,CAAC,EACxCmnB,GAAW,IAAIriB,IAAS3J,GAAOA,GAAOuE,GAAY,GAAGoF,CAAI,CAAC,CAAC,EAE3DsiB,GAAarJ,GAAQ,aACrBsJ,GAAWL,GAAK,aAKvBM,GAAW/U,GAAQA,EAAI,EAAIQ,GAAc,GACxC,SAASwU,GAAUvX,EAAMwX,EAAYC,EAAO,GAAO,CACtD,IAAIlV,EAAMyU,GAAK,UAAU,UAAUA,GAAK,KAAKhX,EAAMwX,EAAY,CAAE,QAAS,EAAK,CAAE,CAAC,EAClF,GAAIC,GAAQ,CAACH,GAAQ/U,CAAG,EAAG,CACvB,MAAMiI,EAAe,IAAI,WAAW,EAAE,EACtC,IAAIkN,EAAU,EACd,KAAO,CAACJ,GAAQ/U,CAAG,GAGf,GAFAiI,EAAa,IAAI4K,GAAM,OAAOsC,GAAS,CAAC,EACxCnV,EAAMyU,GAAK,UAAU,UAAUA,GAAK,KAAKhX,EAAMwX,EAAY,CAAE,QAAS,GAAO,aAAAhN,CAAY,CAAE,CAAC,EACxFkN,EAAU,WACV,MAAM,IAAI,MAAM,yCAAyC,CAErE,CACA,OAAOnV,EAAI,QAAQ,KAAK,CAC5B,CACY,MAACoV,GAAc5J,GAAQ,KACtB6J,GAAa7J,GAAQ,MAAM,WAC3B8J,GAAO,CAChB,MAAO,EACP,QAAS,CACb,EACO,SAASC,GAAehK,EAAKzO,EAAM,CACtC,MAAM5X,EAAMqmB,EAAI,OAChB,GAAIzO,IAASwY,GAAK,MAAO,CACrB,GAAIpwB,IAAQ,GACR,MAAM,IAAI,MAAM,0BAA0B,EAC9C,OAAA0W,GAAM,UAAU2P,CAAG,EACZA,CACX,SACSzO,IAASwY,GAAK,QAAS,CAC5B,GAAIpwB,IAAQ,GACR,MAAM,IAAI,MAAM,8BAA8B,EAClD,OAAAsmB,GAAQ,MAAM,OAAO3a,GAAgB0a,CAAG,CAAC,EAClCA,CACX,KAEI,OAAM,IAAI,MAAM,kBAAkB,CAE1C,CACO,SAASiK,GAAShyB,EAAGE,EAAG,CAE3B,MAAMuT,EADIuU,GAAQ,MACN,WAAW,WAAYhoB,EAAGE,CAAC,EACjCkS,EAAK/E,GAAgBoG,CAAC,EAC5B,GAAIrB,GAAM4K,GACN,MAAM,IAAI,MAAM,+BAA+B,EACnD,OAAO5K,CACX,CACO,SAAS6f,GAAoBC,EAASC,EAAa,WAAW,GAAE,EAAI,CACvE,MAAM9gB,EAAI2W,GAAQ,MACZoK,EAAU/kB,GAAgB6kB,CAAO,EACjCjgB,EAAImG,GAAM,KAAK,SAASga,CAAO,EAE/BC,EAASrL,GAAQ/U,EAAE,CAAC,EAAImgB,EAAU1Y,GAAG,IAAI0Y,CAAO,EAChDE,EAAKjhB,EAAE,aAAaY,CAAC,EAErBwB,EAAIue,GAASM,EAAIH,CAAU,EAEjC,OAAOzkB,GAAgBgM,GAAG,IAAI2Y,EAAQ5e,CAAC,EAAG,EAAE,CAChD,CACO,SAAS8e,GAAmBC,EAAQ1qB,EAAG,CAC1C,MAAMuJ,EAAI2W,GAAQ,MACZvU,EAAIue,GAASQ,EAAQ1qB,CAAC,EAEtBmL,EADI5B,EAAE,OAAOhE,GAAgBmlB,CAAM,CAAC,EAC9B,IAAIpa,GAAM,KAAK,SAAS3E,CAAC,CAAC,EAChCgf,EAASzL,GAAQ/T,EAAE,CAAC,EAAI,EAAI,EAClC,MAAO,CAAC5B,EAAE,aAAa4B,CAAC,EAAGwf,CAAM,CACrC,CAOO,MAAMC,GAA0BttB,GAAOgT,GAAM,KAAK,QAAQ,EAAK,CAAC,EAC1Dua,GAAU,CACnB,OAAQ,KACR,WAAY,EACZ,WAAY,EACZ,IAAK,GACT,EACaC,GAAe,CACxB,OAAQ,KACR,WAAY,IACZ,WAAY,IACZ,IAAK,GACT,EAEO,SAASC,GAAa7yB,EAAGE,EAAG,CAC/B,GAAI,CAACH,EAAQC,CAAC,GAAK,CAACD,EAAQG,CAAC,EACzB,MAAM,IAAI,MAAM,qBAAqB,OAAOF,CAAC,MAAM,OAAOE,CAAC,EAAE,EAEjE,MAAMwB,EAAM,KAAK,IAAI1B,EAAE,OAAQE,EAAE,MAAM,EACvC,QAAS2B,EAAI,EAAGA,EAAIH,EAAKG,IACrB,GAAI7B,EAAE6B,CAAC,GAAK3B,EAAE2B,CAAC,EACX,OAAO,KAAK,KAAK7B,EAAE6B,CAAC,EAAI3B,EAAE2B,CAAC,CAAC,EACpC,OAAO,KAAK,KAAK7B,EAAE,OAASE,EAAE,MAAM,CACxC,CAEO,SAAS4yB,GAAclI,EAAK,CAC/B,MAAM/nB,EAAM,CAAA,EACZ,UAAWgM,KAAK+b,EAAK,CACjB,GAAI/nB,EAAI+nB,EAAI/b,CAAC,CAAC,IAAM,OAChB,MAAM,IAAI,MAAM,eAAe,EACnChM,EAAI+nB,EAAI/b,CAAC,CAAC,EAAIA,CAClB,CACA,OAAOhM,CACX,CC5HO,MAAMkwB,EAAK,CACd,KAAM,EAAG,UAAW,GAAI,UAAW,GAAI,UAAW,GAAI,UAAW,GACjE,SAAU,GACV,KAAM,GAAI,KAAM,GAAI,KAAM,GAAI,KAAM,GAAI,KAAM,GAAI,KAAM,GAAI,KAAM,GAAI,KAAM,GAAI,KAAM,GACtF,MAAO,GAAI,MAAO,GAAI,MAAO,GAAI,MAAO,GAAI,MAAO,GAAI,MAAO,GAAI,MAAO,GAEzE,IAAK,GAAI,IAAK,GAAI,GAAI,GAAI,MAAO,IAAK,MAAO,IAAK,SAAU,IAAK,KAAM,IAAK,MAAO,IAAK,OAAQ,IAAK,OAAQ,IAE7G,WAAY,IAAK,aAAc,IAAK,QAAS,IAAK,OAAQ,IAAK,OAAQ,IAAK,QAAS,IAAK,OAAQ,IAAK,QAAS,IAChH,MAAO,IAAK,MAAO,IAAK,KAAM,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,IAAK,KAAM,IAAK,KAAM,IAAK,IAAK,IAAK,KAAM,IAAK,KAAM,IAEnH,IAAK,IAAK,OAAQ,IAAK,KAAM,IAAK,MAAO,IAAK,KAAM,IAEpD,OAAQ,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,MAAO,IAAK,YAAa,IAAK,UAAW,IAAK,UAAW,IAEnG,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC/C,OAAQ,IAAK,IAAK,IAAK,IAAK,IAAK,YAAa,IAC9C,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,OAAQ,IAAK,OAAQ,IAAK,QAAS,IAAK,OAAQ,IAClG,SAAU,IAAK,eAAgB,IAAK,YAAa,IAAK,SAAU,IAAK,YAAa,IAClF,gBAAiB,IAAK,mBAAoB,IAAK,IAAK,IAAK,IAAK,IAAK,OAAQ,IAE3E,UAAW,IAAK,KAAM,IAAK,OAAQ,IAAK,QAAS,IAAK,QAAS,IAAK,cAAe,IACnF,SAAU,IAAK,eAAgB,IAAK,cAAe,IAAK,oBAAqB,IAE7E,KAAM,IAAK,oBAAqB,IAAK,oBAAqB,IAAK,KAAM,IAAK,KAAM,IAAK,KAAM,IAAK,KAAM,IAAK,KAAM,IAAK,KAAM,IAAK,MAAO,IAExI,YAAa,IAEb,QAAS,GACb,EACaC,GAAUF,GAAcC,CAAE,EAGhC,SAASE,GAAUC,EAAa,EAAGC,EAAe,GAAO,CAC5D,OAAOC,EAAO,CACV,aAAc,CAACpI,EAAGxjB,IAAU,CACxB,GAAIA,IAAU,GACV,OACJ,MAAMkP,EAAMlP,EAAQ,EACdsI,EAAM,OAAOtI,CAAK,EAClB4M,EAAO,CAAA,EACb,QAASif,EAAM3c,EAAM,CAAC5G,EAAMA,EAAKujB,EAAKA,IAAQ,GAC1Cjf,EAAK,KAAK,OAAOif,EAAM,KAAK,CAAC,EAC7Bjf,EAAKA,EAAK,OAAS,CAAC,GAAK,IACzBA,EAAK,KAAKsC,EAAM,IAAO,CAAC,EACnBA,IACLtC,EAAKA,EAAK,OAAS,CAAC,GAAK,KAC7B4W,EAAE,MAAM,IAAI,WAAW5W,CAAI,CAAC,CAChC,EACA,aAAe7C,GAAM,CACjB,MAAM7P,EAAM6P,EAAE,UACd,GAAI7P,EAAMwxB,EACN,MAAM,IAAI,MAAM,sBAAsBxxB,CAAG,uBAAuBwxB,CAAU,EAAE,EAChF,GAAIxxB,IAAQ,EACR,OAAO,GACX,GAAIyxB,EAAc,CACd,MAAM5wB,EAAOgP,EAAE,MAAM7P,EAAK,EAAI,EAE9B,IAAKa,EAAKA,EAAK,OAAS,CAAC,EAAI,OAAU,IAE/Bb,GAAO,IAAMa,EAAKA,EAAK,OAAS,CAAC,EAAI,OAAU,GAC/C,MAAM,IAAI,MAAM,iCAAiC,CAE7D,CACA,IAAIspB,EAAO,EACPhpB,EAAM,GACV,QAAS,EAAI,EAAG,EAAInB,EAAK,EAAE,EACvBmqB,EAAOta,EAAE,KAAI,EACb1O,GAAO,OAAOgpB,CAAI,GAAM,GAAK,OAAO,CAAC,EAEzC,OAAIA,GAAQ,MACRhpB,GAAQ,IAAM,OAAOnB,EAAM,CAAC,EAAI,IAAO,GACvCmB,EAAM,CAACA,GAEJA,CACX,CACR,CAAK,CACL,CACO,SAASywB,GAAQC,EAAIL,EAAa,EAAGC,EAAe,GAAM,CAC7D,GAAI,OAAOI,GAAO,SACd,OAAOA,EACX,GAAIxzB,EAAQwzB,CAAE,EACV,GAAI,CACA,MAAMzjB,EAAMmjB,GAAUC,EAAYC,CAAY,EAAE,OAAOI,CAAE,EACzD,OAAIzjB,EAAM,OAAO,iBACb,OACG,OAAOA,CAAG,CACrB,MACU,CACN,MACJ,CAGR,CAUY,MAAC0jB,GAASJ,EAAO,CACzB,aAAc,CAACpI,EAAGxjB,IAAU,CACxB,QAASisB,KAAKjsB,EAAO,CACjB,GAAI,OAAOisB,GAAM,SAAU,CACvB,GAAIV,EAAGU,CAAC,IAAM,OACV,MAAM,IAAI,MAAM,kBAAkBA,CAAC,EAAE,EACzCzI,EAAE,KAAK+H,EAAGU,CAAC,CAAC,EACZ,QACJ,SACS,OAAOA,GAAM,UAClB,GAAIA,IAAM,EAAM,CACZzI,EAAE,KAAK,CAAI,EACX,QACJ,SACS,GAAKyI,GAAKA,GAAK,GAAI,CACxBzI,EAAE,KAAK+H,EAAG,KAAO,EAAIU,CAAC,EACtB,QACJ,EAKJ,GAFI,OAAOA,GAAM,WACbA,EAAIR,GAAS,EAAG,OAAO,OAAOQ,CAAC,CAAC,GAChC,CAAC1zB,EAAQ0zB,CAAC,EACV,MAAM,IAAI,MAAM,mBAAmBA,CAAC,KAAK,OAAOA,CAAC,GAAG,EAExD,MAAM/xB,EAAM+xB,EAAE,OACV/xB,EAAMqxB,EAAG,UACT/H,EAAE,KAAKtpB,CAAG,EACLA,GAAO,KACZspB,EAAE,KAAK+H,EAAG,SAAS,EACnB/H,EAAE,KAAKtpB,CAAG,GAELA,GAAO,OACZspB,EAAE,KAAK+H,EAAG,SAAS,EACnB/H,EAAE,MAAM0I,GAAQ,OAAOhyB,CAAG,CAAC,IAG3BspB,EAAE,KAAK+H,EAAG,SAAS,EACnB/H,EAAE,MAAM2I,GAAQ,OAAOjyB,CAAG,CAAC,GAE/BspB,EAAE,MAAMyI,CAAC,CACb,CACJ,EACA,aAAeliB,GAAM,CACjB,MAAMpJ,EAAM,CAAA,EACZ,KAAO,CAACoJ,EAAE,SAAS,CACf,MAAMoa,EAAMpa,EAAE,KAAI,EAElB,GAAIwhB,EAAG,KAAOpH,GAAOA,GAAOoH,EAAG,UAAW,CACtC,IAAIrxB,EACJ,GAAIiqB,EAAMoH,EAAG,UACTrxB,EAAMiqB,UACDA,IAAQoH,EAAG,UAChBrxB,EAAMkyB,GAAK,aAAariB,CAAC,UACpBoa,IAAQoH,EAAG,UAChBrxB,EAAMgyB,GAAQ,aAAaniB,CAAC,UACvBoa,IAAQoH,EAAG,UAChBrxB,EAAMiyB,GAAQ,aAAapiB,CAAC,MAE5B,OAAM,IAAI,MAAM,wBAAwB,EAC5CpJ,EAAI,KAAKoJ,EAAE,MAAM7P,CAAG,CAAC,CACzB,SACSiqB,IAAQ,EACbxjB,EAAI,KAAK,CAAC,UAEL4qB,EAAG,MAAQpH,GAAOA,GAAOoH,EAAG,MACjC5qB,EAAI,KAAKwjB,GAAOoH,EAAG,KAAO,EAAE,MAE3B,CACD,MAAMQ,EAAKP,GAAQrH,CAAG,EACtB,GAAI4H,IAAO,OACP,MAAM,IAAI,MAAM,kBAAkB5H,EAAI,SAAS,EAAE,CAAC,EAAE,EACxDxjB,EAAI,KAAKorB,CAAE,CACf,CACJ,CACA,OAAOprB,CACX,CACJ,CAAC,EAGK0rB,GAAW,CACb,IAAM,CAAC,IAAM,EAAG,KAAM,MAAM,EAC5B,IAAM,CAAC,IAAM,EAAG,OAAQ,WAAW,EACnC,IAAM,CAAC,IAAM,EAAG,YAAa,qBAAqB,CACtD,EACaC,GAAcV,EAAO,CAC9B,aAAc,CAACpI,EAAGxjB,IAAU,CAGxB,GAFI,OAAOA,GAAU,WACjBA,EAAQ,OAAOA,CAAK,GACpB,IAAMA,GAASA,GAAS,KACxB,OAAOwjB,EAAE,KAAK,OAAOxjB,CAAK,CAAC,EAC/B,SAAW,CAAC2oB,EAAMlsB,EAAO6nB,EAAOiI,CAAI,IAAK,OAAO,OAAOF,EAAQ,EAC3D,GAAI,EAAA/H,EAAQtkB,GAASA,EAAQusB,GAE7B,CAAA/I,EAAE,KAAKmF,CAAI,EACX,QAAS,EAAI,EAAG,EAAIlsB,EAAO,IACvB+mB,EAAE,KAAK,OAAQxjB,GAAU,GAAK,OAAO,CAAC,EAAM,KAAK,CAAC,EACtD,OAEJ,MAAMwjB,EAAE,IAAI,mBAAmBxjB,CAAK,EAAE,CAC1C,EACA,aAAe+J,GAAM,CACjB,MAAMyiB,EAAKziB,EAAE,KAAI,EACjB,GAAIyiB,GAAM,IACN,OAAO,OAAOA,CAAE,EACpB,KAAM,CAACnrB,EAAG5E,EAAO6nB,CAAK,EAAI+H,GAASG,CAAE,EACrC,IAAIjwB,EAAM,GACV,QAAS,EAAI,EAAG,EAAIE,EAAO,IACvBF,GAAO,OAAOwN,EAAE,KAAI,CAAE,GAAM,GAAK,OAAO,CAAC,EAC7C,GAAIxN,EAAM+nB,EACN,MAAMva,EAAE,IAAI,qBAAqB,EAAItN,CAAK,GAAG,EACjD,OAAOF,CACX,CACJ,CAAC,EAEYkwB,GAAiBC,GAAQJ,GAAaK,GAAS,YAAY,EAE3DC,GAAWC,GAAQP,EAAW,EAE9BQ,GAAaC,GAAQN,GAAgBG,EAAQ,EAE7CI,GAAY/gB,GAAM8gB,GAAQT,GAAargB,CAAC,EACxCghB,GAAWC,GAAS,CAC7B,KAAML,GAAQ,GAAI,EAAI,EACtB,MAAOV,GACP,eAAgBS,GAChB,SAAUT,EACd,CAAC,EACYgB,GAAYD,GAAS,CAAE,OAAQE,GAAS,OAAQR,EAAQ,CAAE,EAEjES,GAASH,GAAS,CACpB,QAASI,GACT,WAAYC,GAAO,IAAI,WAAW,CAAC,EAAM,CAAI,CAAC,CAAC,EAC/C,OAAQP,GAASC,EAAQ,EACzB,QAASD,GAASG,EAAS,EAC3B,UAAWK,GAAU,aAAcT,GAAQ,gBAAiBD,EAAU,CAAC,EAIvE,SAAUX,EACd,CAAC,EACD,SAASsB,GAAcC,EAAI,CACvB,GAAIA,EAAG,YAAcA,EAAG,WAAa,CAACA,EAAG,UAAU,OAC/C,MAAM,IAAI,MAAM,wCAAwC,EAC5D,OAAOA,CACX,CACY,MAACC,GAAQC,GAAWP,GAAQI,EAAa,EAExCI,GAAWX,GAAS,CAC7B,QAASI,GACT,OAAQN,GAASC,EAAQ,EACzB,QAASD,GAASG,EAAS,EAC3B,SAAUhB,EACd,CAAC,EC9PK2B,GAAS,CACX,OAAOpzB,EAAM,CACT,GAAI,EAAAA,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAM,GAAK,CAACqzB,EAAUrzB,EAAK,CAAC,CAAC,GAAKoF,EAAI,OAAOpF,EAAK,CAAC,CAAC,IAAM,QAEzF,MAAO,CAAE,KAAM,MAAO,OAAQsxB,GAAO,OAAOtxB,CAAI,CAAC,CACrD,EACA,OAASC,GAAO,CACZ,GAAIA,EAAG,OAAS,MAEhB,MAAO,CAAC,EAAGmF,EAAI,OAAO,MAAM,CAAC,CACjC,CACJ,EACA,SAASkuB,GAAczN,EAAKzO,EAAM,CAC9B,GAAI,CACAmc,OAAAA,GAAiB1N,EAAKzO,CAAI,EACnB,EACX,MACU,CACN,MAAO,EACX,CACJ,CACA,MAAMoc,GAAQ,CACV,OAAOxzB,EAAM,CACT,GAAI,EAAAA,EAAK,SAAW,GAChB,CAACqzB,EAAUrzB,EAAK,CAAC,CAAC,GAClB,CAACszB,GAActzB,EAAK,CAAC,EAAGyzB,GAAO,KAAK,GACpCzzB,EAAK,CAAC,IAAM,YAEhB,MAAO,CAAE,KAAM,KAAM,OAAQA,EAAK,CAAC,CAAC,CACxC,EACA,OAASC,GAAQA,EAAG,OAAS,KAAO,CAACA,EAAG,OAAQ,UAAU,EAAI,MAClE,EACMyzB,GAAS,CACX,OAAO1zB,EAAM,CACT,GAAI,EAAAA,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAM,OAASA,EAAK,CAAC,IAAM,WAAa,CAACqzB,EAAUrzB,EAAK,CAAC,CAAC,IAErF,EAAAA,EAAK,CAAC,IAAM,eAAiBA,EAAK,CAAC,IAAM,YAE7C,MAAO,CAAE,KAAM,MAAO,KAAMA,EAAK,CAAC,CAAC,CACvC,EACA,OAASC,GAAOA,EAAG,OAAS,MAAQ,CAAC,MAAO,UAAWA,EAAG,KAAM,cAAe,UAAU,EAAI,MACjG,EACM0zB,GAAQ,CACV,OAAO3zB,EAAM,CACT,GAAI,EAAAA,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAM,WAAa,CAACqzB,EAAUrzB,EAAK,CAAC,CAAC,GAAKA,EAAK,CAAC,IAAM,SAErF,MAAO,CAAE,KAAM,KAAM,KAAMA,EAAK,CAAC,CAAC,CACtC,EACA,OAASC,GAAOA,EAAG,OAAS,KAAO,CAAC,UAAWA,EAAG,KAAM,OAAO,EAAI,MACvE,EACM2zB,GAAS,CACX,OAAO5zB,EAAM,CACT,GAAI,EAAAA,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAM,GAAK,CAACqzB,EAAUrzB,EAAK,CAAC,CAAC,IAExDA,EAAK,CAAC,EAAE,SAAW,GAEvB,MAAO,CAAE,KAAM,MAAO,KAAMA,EAAK,CAAC,CAAC,CACvC,EACA,OAASC,GAAQA,EAAG,OAAS,MAAQ,CAAC,EAAGA,EAAG,IAAI,EAAI,MACxD,EACM4zB,GAAU,CACZ,OAAO7zB,EAAM,CACT,GAAI,EAAAA,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAM,GAAK,CAACqzB,EAAUrzB,EAAK,CAAC,CAAC,IAExDA,EAAK,CAAC,EAAE,SAAW,GAEvB,MAAO,CAAE,KAAM,OAAQ,KAAMA,EAAK,CAAC,CAAC,CACxC,EACA,OAASC,GAAQA,EAAG,OAAS,OAAS,CAAC,EAAGA,EAAG,IAAI,EAAI,MACzD,EACM6zB,GAAQ,CACV,OAAO9zB,EAAM,CACT,MAAM2pB,EAAO3pB,EAAK,OAAS,EAC3B,GAAIA,EAAK2pB,CAAI,IAAM,gBACf,OACJ,MAAMntB,EAAIwD,EAAK,CAAC,EACVtB,EAAIsB,EAAK2pB,EAAO,CAAC,EACvB,GAAI,OAAOntB,GAAM,UAAY,OAAOkC,GAAM,SACtC,OACJ,MAAMq1B,EAAU/zB,EAAK,MAAM,EAAG,EAAE,EAChC,GAAItB,IAAMq1B,EAAQ,OAElB,WAAWlO,KAAOkO,EACd,GAAI,CAACV,EAAUxN,CAAG,EACd,OACR,MAAO,CAAE,KAAM,KAAM,EAAArpB,EAAG,QAASu3B,CAAO,EAC5C,EAEA,OAAS9zB,GAAOA,EAAG,OAAS,KAAO,CAACA,EAAG,EAAG,GAAGA,EAAG,QAASA,EAAG,QAAQ,OAAQ,eAAe,EAAI,MACnG,EACM+zB,GAAQ,CACV,OAAOh0B,EAAM,CACT,GAAI,EAAAA,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAM,GAAK,CAACqzB,EAAUrzB,EAAK,CAAC,CAAC,GAE5D,MAAO,CAAE,KAAM,KAAM,OAAQA,EAAK,CAAC,CAAC,CACxC,EACA,OAASC,GAAQA,EAAG,OAAS,KAAO,CAAC,EAAGA,EAAG,MAAM,EAAI,MACzD,EACMg0B,GAAU,CACZ,OAAOj0B,EAAM,CACT,MAAM2pB,EAAO3pB,EAAK,OAAS,EAC3B,GAAIA,EAAK2pB,CAAI,IAAM,WACf,OACJ,MAAMoK,EAAU,CAAA,EAEhB,QAASp0B,EAAI,EAAGA,EAAIgqB,EAAMhqB,IAAK,CAC3B,MAAMwW,EAAMnW,EAAKL,CAAC,EAClB,GAAIA,EAAI,EAAG,CACP,GAAIwW,IAAQ,kBAAoBxW,IAAMgqB,EAAO,EACzC,OACJ,QACJ,CACA,GAAI,CAAC0J,EAAUld,CAAG,EACd,OACJ4d,EAAQ,KAAK5d,CAAG,CACpB,CACA,MAAO,CAAE,KAAM,QAAS,QAAA4d,CAAO,CACnC,EACA,OAAS9zB,GAAO,CACZ,GAAIA,EAAG,OAAS,QACZ,OACJ,MAAMgG,EAAM,CAAA,EACZ,QAAStG,EAAI,EAAGA,EAAIM,EAAG,QAAQ,OAAS,EAAGN,IACvCsG,EAAI,KAAKhG,EAAG,QAAQN,CAAC,EAAG,gBAAgB,EAC5C,OAAAsG,EAAI,KAAKhG,EAAG,QAAQA,EAAG,QAAQ,OAAS,CAAC,EAAG,UAAU,EAC/CgG,CACX,CACJ,EACMiuB,GAAU,CACZ,OAAOl0B,EAAM,CACT,MAAM2pB,EAAO3pB,EAAK,OAAS,EAC3B,GAAIA,EAAK2pB,CAAI,IAAM,YAAc3pB,EAAK,CAAC,IAAM,WACzC,OACJ,MAAM+zB,EAAU,CAAA,EACVv3B,EAAI40B,GAAQpxB,EAAK2pB,EAAO,CAAC,CAAC,EAChC,GAAI,OAAOntB,GAAM,SAEjB,SAASmD,EAAI,EAAGA,EAAIgqB,EAAO,EAAGhqB,IAAK,CAC/B,MAAMwW,EAAMnW,EAAKL,CAAC,EAClB,GAAIA,EAAI,EAAG,CACP,GAAIwW,KAASxW,IAAM,EAAI,WAAa,eAChC,MAAM,IAAI,MAAM,uCAAuC,EAC3D,QACJ,CACA,GAAI,CAAC0zB,EAAUld,CAAG,EACd,MAAM,IAAI,MAAM,2CAA2C,EAC/D4d,EAAQ,KAAK5d,CAAG,CACpB,CACA,MAAO,CAAE,KAAM,QAAS,QAAA4d,EAAS,EAAAv3B,CAAC,EACtC,EACA,OAASyD,GAAO,CACZ,GAAIA,EAAG,OAAS,QACZ,OACJ,MAAMgG,EAAM,CAAChG,EAAG,QAAQ,CAAC,EAAG,UAAU,EACtC,QAASN,EAAI,EAAGA,EAAIM,EAAG,QAAQ,OAAQN,IACnCsG,EAAI,KAAKhG,EAAG,QAAQN,CAAC,EAAG,aAAa,EACzC,OAAAsG,EAAI,KAAKhG,EAAG,EAAG,UAAU,EAClBgG,CACX,CACJ,EACMkuB,GAAa,CACf,OAAOn0B,EAAM,CACT,MAAO,CAAE,KAAM,UAAW,OAAQsxB,GAAO,OAAOtxB,CAAI,CAAC,CACzD,EACA,OAASC,GAAOA,EAAG,OAAS,UAAYqxB,GAAO,OAAOrxB,EAAG,MAAM,EAAI,MACvE,EAEMm0B,GAAa,CACfhB,GACAI,GACAE,GACAC,GACAC,GACAC,GACAC,GACAE,GACAC,GACAC,GACAC,EACJ,EAMME,GAAarC,GAAQV,GAAQW,GAAS,MAAMmC,EAAU,CAAC,EAEhDE,GAAYpB,GAAWmB,GAAa10B,GAAM,CACnD,GAAIA,EAAE,OAAS,MAAQ,CAAC2zB,GAAc3zB,EAAE,OAAQ8zB,GAAO,KAAK,EACxD,MAAM,IAAI,MAAM,yBAAyB,EAC7C,IAAK9zB,EAAE,OAAS,OAASA,EAAE,OAAS,MAAQA,EAAE,OAAS,UAClD,CAAC0zB,EAAU1zB,EAAE,IAAI,GAAKA,EAAE,KAAK,SAAW,IACzC,MAAM,IAAI,MAAM,aAAaA,EAAE,IAAI,cAAc,EACrD,GAAIA,EAAE,OAAS,QAAU,CAAC0zB,EAAU1zB,EAAE,IAAI,GAAKA,EAAE,KAAK,SAAW,IAC7D,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAIA,EAAE,OAAS,OAAS,CAAC0zB,EAAU1zB,EAAE,MAAM,GAAK,CAAC2zB,GAAc3zB,EAAE,OAAQ8zB,GAAO,OAAO,GACnF,MAAM,IAAI,MAAM,wCAAwC,EAC5D,IAAI9zB,EAAE,OAAS,MAAQA,EAAE,OAAS,SAAWA,EAAE,OAAS,UAChD,CAAC,MAAM,QAAQA,EAAE,OAAO,EACxB,MAAM,IAAI,MAAM,yCAAyC,EACjE,GAAIA,EAAE,OAAS,KAAM,CACjB,MAAMjB,EAAIiB,EAAE,QAAQ,OACpB,UAAWjC,KAAKiC,EAAE,QACd,GAAI,CAAC2zB,GAAc51B,EAAG+1B,GAAO,KAAK,EAC9B,MAAM,IAAI,MAAM,kCAAkC,EAC1D,GAAI9zB,EAAE,GAAK,GAAKjB,EAAI,IAAMiB,EAAE,EAAIjB,EAC5B,MAAM,IAAI,MAAM,oCAAoC,CAC5D,CACA,GAAIiB,EAAE,OAAS,SAAWA,EAAE,OAAS,SACjC,UAAWjC,KAAKiC,EAAE,QACd,GAAI,CAAC2zB,GAAc51B,EAAG+1B,GAAO,OAAO,EAChC,MAAM,IAAI,MAAM,aAAa9zB,EAAE,IAAI,gBAAgB,EAE/D,GAAIA,EAAE,OAAS,QAAS,CACpB,MAAMjB,EAAIiB,EAAE,QAAQ,OACpB,GAAIA,EAAE,GAAK,GAAKjB,EAAI,KAAOiB,EAAE,EAAIjB,EAC7B,MAAM,IAAI,MAAM,iCAAiC,CACzD,CACA,OAAOiB,CACX,CAAC,EAED,SAAS40B,GAAS7xB,EAAG8xB,EAAe,CAChC,GAAI,CAACC,GAAa/xB,EAAE,KAAMgyB,GAASF,CAAa,CAAC,EAC7C,MAAM,IAAI,MAAM,2CAA2C,EAC/D,MAAM1L,EAAIwL,GAAU,OAAOE,CAAa,EACxC,GAAI1L,EAAE,OAAS,MAAQA,EAAE,OAAS,SAAWA,EAAE,OAAS,QACpD,MAAM,IAAI,MAAM,kBAAkBA,EAAE,IAAI,4BAA4B,EACxE,GAAIA,EAAE,OAAS,QAAUA,EAAE,OAAS,KAChC,MAAM,IAAI,MAAM,kBAAkBA,EAAE,IAAI,6BAA6B,CAC7E,CACO,SAAS6L,GAAYC,EAAQC,EAAcL,EAAe,CAC7D,GAAII,EAAQ,CACR,MAAMlyB,EAAI4xB,GAAU,OAAOM,CAAM,EAEjC,GAAIlyB,EAAE,OAAS,SAAWA,EAAE,OAAS,SAAWA,EAAE,OAAS,MAAQA,EAAE,MAAQ,KACzE,MAAM,IAAI,MAAM,4BAA4BA,EAAE,IAAI,EAAE,EACxD,GAAIA,EAAE,OAAS,MAAQmyB,EAAc,CACjC,GAAI,CAACJ,GAAa/xB,EAAE,KAAMoyB,GAAUD,CAAY,CAAC,EAC7C,MAAM,IAAI,MAAM,yCAAyC,EAC7D,MAAMxlB,EAAIilB,GAAU,OAAOO,CAAY,EACvC,GAAIxlB,EAAE,OAAS,MAAQA,EAAE,OAAS,SAAWA,EAAE,OAAS,QACpD,MAAM,IAAI,MAAM,kBAAkBA,EAAE,IAAI,4BAA4B,EAExE,GAAIA,EAAE,OAAS,KACX,MAAM,IAAI,MAAM,6CAA6C,CACrE,CACI3M,EAAE,OAAS,OAAS8xB,GACpBD,GAAS7xB,EAAG8xB,CAAa,CACjC,CACA,GAAIK,EAAc,CACd,MAAM,EAAIP,GAAU,OAAOO,CAAY,EACnC,EAAE,OAAS,OAASL,GACpBD,GAAS,EAAGC,CAAa,CACjC,CACJ,CA2BO,MAAMO,GAAO,CAACC,EAAO93B,EAAUuzB,KAAY,CAE9C,MAAMwE,EAAKD,EAAM,OACjB,GAAI,CAAC3B,EAAU4B,CAAE,EACb,MAAM,IAAI,MAAM,iBAAiB,OAAOD,EAAM,MAAM,uBAAuB,EAC/E,MAAMjd,EAAO+c,GAAUG,CAAE,EACnBL,EAASN,GAAU,OAAO,CAAE,KAAM,KAAM,KAAAvc,EAAM,EAEpD,OADA4c,GAAYC,EAAQK,EAAID,EAAM,aAAa,EACvCA,EAAM,cACC,CACH,KAAM,KACN,aAAcC,EACd,OAAQX,GAAU,OAAO,CAAE,KAAM,KAAM,KAAAvc,EAAM,EAC7C,QAASmd,GAAQh4B,CAAO,EAAE,OAAO,CAAE,KAAM,KAAM,KAAA6a,EAAM,EACrD,KAAAA,EACA,cAAeid,EAAM,aACjC,EAGe,CACH,KAAM,KACN,aAAcC,EACd,OAAQX,GAAU,OAAO,CAAE,KAAM,KAAM,KAAAvc,EAAM,EAC7C,QAASmd,GAAQh4B,CAAO,EAAE,OAAO,CAAE,KAAM,KAAM,KAAA6a,EAAM,EACrD,KAAAA,CACZ,CAEA,EAgBaod,GAAS,CAACpV,EAAW7iB,EAAUuzB,KAAY,CACpD,GAAI,CAAC6C,GAAcvT,EAAW0T,GAAO,KAAK,EACtC,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAI1T,EAAU,SAAW,GACrB,MAAM,IAAI,MAAM,iCAAiC,EACrD,MAAMhI,EAAO+c,GAAU/U,CAAS,EAChC,MAAO,CACH,KAAM,OACN,OAAQuU,GAAU,OAAO,CAAE,KAAM,OAAQ,KAAAvc,EAAM,EAC/C,QAASmd,GAAQh4B,CAAO,EAAE,OAAO,CAAE,KAAM,OAAQ,KAAA6a,EAAM,EACvD,KAAAA,CACR,CACA,EAiIaqd,GAAmB,IACnBC,GAAc,CAACT,EAAQU,EAAUF,KAAqBG,GAAa,UAAW,IAAI,WAAW,CAACD,CAAO,CAAC,EAAGpD,GAAS,OAAO0C,CAAM,CAAC,EACtI,SAASY,GAAKC,EAAgBC,EAAMx4B,EAAUuzB,GAASkF,EAAsB,GAAOC,EAAe,CAEtG,GAAI,CAACH,EACD,MAAM,IAAI,MAAM,kDAAkD,EACtE,MAAMnF,EAAS,OAAOmF,GAAmB,SACnCrwB,EAAI,OAAOqwB,CAAc,EACzBA,GAAkBI,GACxB,GAAI,CAACvC,GAAchD,EAAQmD,GAAO,OAAO,EACrC,MAAM,IAAI,MAAM,0BAA0B,EA6BzC,CACD,MAAMqC,EAAgBC,GAAqBzF,EAAQ0F,EAAO,EAAE,CAAC,EAC7D,MAAO,CACH,KAAM,KACN,OAAQ1B,GAAU,OAAO,CAAE,KAAM,KAAM,OAAQwB,EAAe,EAC9D,QAASZ,GAAQh4B,CAAO,EAAE,OAAO,CAAE,KAAM,KAAM,OAAQ44B,EAAe,EAEtE,cAAAA,EAEA,eAAgBxF,CAC5B,CACI,CACJ,CAwEA,MAAM2F,GAAchzB,GAAkByxB,EAAQ,EAC9C,SAASwB,GAAgBZ,EAASj1B,EAAM,CACpC,GAAIA,EAAK,OAAS,GAAKA,EAAK,OAAS,GACjC,MAAM,IAAI,MAAM,yBAAyB,EAC7C,GAAIi1B,EAAU,GACV,MAAM,IAAI,MAAM,0BAA0B,EAC9C,GAAIA,IAAY,GAAK,EAAEj1B,EAAK,SAAW,IAAMA,EAAK,SAAW,IACzD,MAAM,IAAI,MAAM,qCAAqC,CAC7D,CACA,SAAS81B,GAAiBb,EAASj1B,EAAMnD,EAAUuzB,GAAS,CACxDyF,GAAgBZ,EAASj1B,CAAI,EAC7B,MAAMisB,EAAQgJ,IAAY,EAAIvwB,GAASC,GACvC,OAAOsnB,EAAM,OAAOpvB,EAAQ,OAAQ,CAACo4B,CAAO,EAAE,OAAOhJ,EAAM,QAAQjsB,CAAI,CAAC,CAAC,CAC7E,CACA,SAAS+1B,GAAUC,EAAQ5yB,EAAQ,CAC/B,OAAOwyB,GAAY,OAAOK,GAAc,WAAW,KAAK7yB,CAAM,EAAG4yB,CAAM,CAAC,CAC5E,CAsBO,SAASnB,GAAQh4B,EAAUuzB,GAAS,CACvC,MAAO,CACH,OAAOzwB,EAAM,CACT,KAAM,CAAE,KAAAoX,CAAI,EAAKpX,EACjB,GAAIoX,IAAS,OACT,OAAO+e,GAAiB,EAAGn2B,EAAK,KAAM9C,CAAO,EAC5C,GAAIka,IAAS,MACd,OAAO+e,GAAiB,EAAGn2B,EAAK,KAAM9C,CAAO,EAC5C,GAAIka,IAAS,KACd,OAAO+e,GAAiB,EAAGn2B,EAAK,OAAQ9C,CAAO,EAC9C,GAAIka,IAAS,MACd,OAAOgf,GAAUp2B,EAAK,KAAM,CAAC9C,EAAQ,UAAU,CAAC,EAC/C,GAAIka,IAAS,KACd,OAAOgf,GAAUp2B,EAAK,KAAM,CAAC9C,EAAQ,UAAU,CAAC,EACpD,MAAM,IAAI,MAAM,wBAAwBka,CAAI,EAAE,CAClD,EACA,OAAOmf,EAAS,CACZ,GAAIA,EAAQ,OAAS,IAAMA,EAAQ,OAAS,GACxC,MAAM,IAAI,MAAM,wBAAwB,EAE5C,GAAIr5B,EAAQ,QAAUq5B,EAAQ,YAAW,EAAG,WAAW,GAAGr5B,EAAQ,MAAM,GAAG,EAAG,CAC1E,IAAIyD,EACJ,GAAI,CAEA,GADAA,EAAMoE,GAAO,OAAOwxB,CAAO,EACvB51B,EAAI,MAAM,CAAC,IAAM,EACjB,MAAM,IAAI,MAAM,yBAAyBA,EAAI,MAAM,CAAC,CAAC,EAAE,CAC/D,MACU,CAGN,GADAA,EAAMqE,GAAQ,OAAOuxB,CAAO,EACxB51B,EAAI,MAAM,CAAC,IAAM,EACjB,MAAM,IAAI,MAAM,0BAA0BA,EAAI,MAAM,CAAC,CAAC,EAAE,CAChE,CACA,GAAIA,EAAI,SAAWzD,EAAQ,OACvB,MAAM,IAAI,MAAM,uBAAuByD,EAAI,MAAM,EAAE,EACvD,KAAM,CAAC20B,EAAS,GAAGkB,CAAO,EAAI71B,EAAI,MAC5BN,EAAO0E,GAAO,UAAUyxB,CAAO,EAErC,GADAN,GAAgBZ,EAASj1B,CAAI,EACzBi1B,IAAY,GAAKj1B,EAAK,SAAW,GACjC,MAAO,CAAE,KAAM,MAAO,KAAMA,CAAI,EAC/B,GAAIi1B,IAAY,GAAKj1B,EAAK,SAAW,GACtC,MAAO,CAAE,KAAM,OAAQ,KAAMA,CAAI,EAChC,GAAIi1B,IAAY,GAAKj1B,EAAK,SAAW,GACtC,MAAO,CAAE,KAAM,KAAM,OAAQA,CAAI,EAEjC,MAAM,IAAI,MAAM,yBAAyB,CACjD,CACA,MAAMA,EAAO41B,GAAY,OAAOM,CAAO,EACvC,GAAIl2B,EAAK,SAAW,GAChB,MAAM,IAAI,MAAM,wBAAwB,EAE5C,GAAIA,EAAK,CAAC,IAAMnD,EAAQ,WACpB,MAAO,CAAE,KAAM,MAAO,KAAMmD,EAAK,MAAM,CAAC,CAAC,EAExC,GAAIA,EAAK,CAAC,IAAMnD,EAAQ,WACzB,MAAO,CACH,KAAM,KACN,KAAMmD,EAAK,MAAM,CAAC,CACtC,EAEY,MAAM,IAAI,MAAM,0BAA0BA,EAAK,CAAC,CAAC,EAAE,CACvD,CACR,CACA,CClrBO,SAASo2B,GACdv5B,EACgB,CAChB,OAAIA,IAAY,UAAkBw5B,GAC9Bx5B,IAAY,UAAkBy5B,GAE3BD,EACT,CAEO,SAASE,GAAU15B,EAAkC,CAC1D,OAAOA,EAAQ,SAAW,IAC5B,CCRO,SAAS25B,GACd35B,EACAq5B,EACa,CACb,OAAIO,GAAe55B,EAASq5B,CAAO,EAC1B,QACEQ,GAAc75B,EAASq5B,CAAO,EAChC,OACES,GAAgB95B,EAASq5B,CAAO,EAClC,SACEU,GAAe/5B,EAASq5B,CAAO,EACjC,QACEW,GAAch6B,EAASq5B,CAAO,EAChC,OAEA,SAEX,CAEO,SAASO,GACd55B,EACAq5B,EACS,CACT,OAAIK,GAAU15B,CAAO,EACZq5B,EAAQ,WAAW,GAAG,EAEtBA,EAAQ,WAAW,GAAG,GAAKA,EAAQ,WAAW,GAAG,CAE5D,CAEO,SAASQ,GACd75B,EACAq5B,EACS,CACT,OAAIK,GAAU15B,CAAO,EACZq5B,EAAQ,WAAW,GAAG,EAEtBA,EAAQ,WAAW,GAAG,CAEjC,CAEO,SAASS,GACd95B,EACAq5B,EACS,CACT,OAAIK,GAAU15B,CAAO,EACZq5B,EAAQ,WAAW,MAAM,EAEzBA,EAAQ,WAAW,MAAM,CAEpC,CAEO,SAASW,GACdh6B,EACAq5B,EACS,CACT,OAAIK,GAAU15B,CAAO,EACZq5B,EAAQ,WAAW,MAAM,EAEzBA,EAAQ,WAAW,MAAM,CAEpC,CAEO,SAASU,GACd/5B,EACAq5B,EACS,CAIT,OAHIW,GAAch6B,EAASq5B,CAAO,GAG9BS,GAAgB95B,EAASq5B,CAAO,EAC3B,GAGLK,GAAU15B,CAAO,EACZq5B,EAAQ,WAAW,KAAK,EAExBA,EAAQ,WAAW,KAAK,CAEnC,CAEO,SAASY,GACdj6B,EACA6iB,EACY,CAEZ,GAAIA,EAAU,aAAe,GAC3B,MAAM,IAAI,MAAM,2BAA2B,EAE7C,OAAOA,EAAU,MAAM,CAAC,CAC1B,CAEO,SAASqX,GACdl6B,EACA6iB,EACY,CACZ,OAAOsX,GACLF,GAAyBj6B,EAAS6iB,CAAS,EAC3C,OACA7iB,CAAA,EACA,cACJ,CAEO,SAASo6B,GACdp6B,EACA6iB,EACY,CACZ,OAAOwX,GAASC,GAAWzX,EAAW7iB,CAAO,EAAGA,CAAO,EAAE,YAC3D,CAEO,SAASu6B,GACdv6B,EACAq5B,EACY,CACZ,MAAMmB,EAAOxC,GAAQh4B,CAAO,EAAE,OAAOq5B,CAAO,EAC5C,OAAOjC,GAAU,OAAOoD,CAAI,CAC9B,CAEO,SAASC,GACdz6B,EACAq5B,EACQ,CACR,OAAOnxB,EAAI,OAAOqyB,GAAsBv6B,EAASq5B,CAAO,CAAC,CAC3D,CChHA,MAAMqB,GACJ,mEAEIC,GACJ,mEAEIC,GAAqB1yB,EAAI,OAC7BksB,GAAO,OAAO,CAAC,OAAQlsB,EAAI,OAAOyyB,EAAe,EAAG,OAAQ,eAAe,CAAC,CAC9E,EAEO,MAAME,EAAkD,CAC7D,YACU76B,EACAmuB,EACA2M,EAIR,CANQ,KAAA,QAAA96B,EACA,KAAA,MAAAmuB,EACA,KAAA,UAAA2M,CAIP,CAEH,MAAM,SAAyB,CAC7B,MAAM,KAAK,MAAM,QAAA,CACnB,CAEA,MAAM,YAA4B,CAChC,MAAM,KAAK,MAAM,WAAA,CACnB,CAEA,MAAM,cAAgD,CACpD,MAAMA,EAAY,MAAM,KAAK,MAAM,aAAA,EAE7BC,EAA0B,CAC9BC,EACArwB,IAIyB,CACzB,MAAMswB,EAAWtB,GAAe,KAAK,QAAShvB,EAAK,OAAO,EAGpDuwB,EACJD,IAAa,OAASE,EAAAA,yBAAyB,KAC/CF,IAAa,OAASE,EAAAA,yBAAyB,YAC/CF,IAAa,SAAWE,EAAAA,yBAAyB,OACjDF,IAAa,QAAUE,EAAAA,yBAAyB,MACzB,OAIzB,GAAID,GAAe,KACjB,MAAM,IAAIE,EAAAA,0BACR,yDAAyDJ,CAAW,UAAA,EAIxE,MAAO,CACL,QAAStB,GAAU,KAAK,OAAO,EAC3B2B,8BAA4B,QAC5BA,EAAAA,4BAA4B,QAChC,SAAU1wB,EAAK,SACf,YAAAuwB,EACA,QAASvwB,EAAK,QACd,aAAc8vB,GAAyB,KAAK,QAAS9vB,EAAK,OAAO,EACjE,UAAWgwB,GACX,aAAcC,GACd,eAAgBF,EAAA,CAEpB,EAEA,IAAIY,EACAC,EAEJ,OAAI,KAAK,UAAU,SAAW,OAC5BD,EAAiBP,EAAwB,UAAW,CAClD,GAAG,KAAK,UAAU,QAClB,SAAU,CAACS,EAAAA,4BAA4B,OAAO,CAAA,CAC/C,GAGC,KAAK,UAAU,UAAY,OAC7BD,EAAkBR,EAAwB,WAAY,CACpD,GAAG,KAAK,UAAU,SAClB,SAAU,CACRS,EAAAA,4BAA4B,SAC5BA,EAAAA,4BAA4B,MAC5BA,8BAA4B,KAAA,CAC9B,CACD,GAGIV,EAAU,QAAQl6B,GAAK,CAC5B,MAAM+Q,EAAiC,CAAA,EACvC,IAAI8pB,EAAe76B,EAAE,SAErB,OACE06B,GAAkB,MAClBG,EAAa,SAASD,EAAAA,4BAA4B,OAAO,IAEzD7pB,EAAO,KAAK2pB,CAAc,EAC1BG,EAAeA,EAAa,OAC1Bj7B,GAAKA,IAAMg7B,8BAA4B,OAAA,GAKzCD,GAAmB,MACnBE,EAAa,SAASD,EAAAA,4BAA4B,QAAQ,IAE1D7pB,EAAO,KAAK4pB,CAAe,EAC3BE,EAAeA,EAAa,OAC1Bj7B,GAAKA,IAAMg7B,8BAA4B,QAAA,GAIvCC,EAAa,OAAS,GACxB9pB,EAAO,KAAK,CAAE,GAAG/Q,EAAG,SAAU66B,EAAc,EAGvC9pB,CACT,CAAC,CACH,CAEA,MAAM,YACJ0nB,EACAne,EAC4B,CAC5B,MAAM,IAAIkgB,EAAAA,0BACR,wEAAA,CAEJ,CAEA,IAAI,8BAAyE,CAC3E,OAAO,KAAK,MAAM,4BACpB,CAEA,IAAI,kCAGW,CACb,OAAO,KAAK,MAAM,gCACpB,CAEA,YACEM,EACAC,EACAC,EAC2B,CAC3B,MAAM,IAAIR,EAAAA,0BACR,oEAAA,CAEJ,CAEA,gBACEM,EACAC,EACAE,EAC2B,CAC3B,MAAM,IAAIT,EAAAA,0BACR,wEAAA,CAEJ,CAEA,oBAAoBU,EAAqD,CACvE,MAAM,IAAIV,EAAAA,0BACR,wEAAA,CAEJ,CAEA,mBAAmBW,EAEjB,CAEA,MAAO,CACL,YAAa,IAAM,CAEnB,CAAA,CAEJ,CACF","x_google_ignoreList":[7,8,9,10,11,12,13,14,15,16,17,18,19,20,21]}