{
  "version": 3,
  "sources": ["../src/index.ts", "../node_modules/@noble/hashes/src/_assert.ts", "../node_modules/@noble/hashes/src/utils.ts", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/crypto.ts", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/utils.ts", "../node_modules/@scure/base/lib/esm/index.js", "../node_modules/nostr-tools/lib/esm/nip19.js", "../src/helpers.ts", "../src/nip07.ts", "../node_modules/@noble/hashes/esm/_assert.js", "../node_modules/@noble/hashes/esm/crypto.js", "../node_modules/@noble/hashes/esm/utils.js", "../node_modules/@noble/hashes/esm/_md.js", "../node_modules/@noble/hashes/esm/sha256.js", "../node_modules/@noble/curves/esm/abstract/utils.js", "../node_modules/@noble/curves/esm/abstract/modular.js", "../node_modules/@noble/curves/esm/abstract/curve.js", "../node_modules/@noble/curves/esm/abstract/weierstrass.js", "../node_modules/@noble/hashes/esm/hmac.js", "../node_modules/@noble/curves/esm/_shortw_utils.js", "../node_modules/@noble/curves/esm/secp256k1.js", "../node_modules/@scure/base/lib/esm/index.js", "../node_modules/rx-nostr-crypto/src/crypto.ts", "../node_modules/rx-nostr-crypto/src/signer.ts", "../node_modules/rx-nostr-crypto/src/verifier.ts", "../node_modules/rx-nostr-crypto/src/uitls/batch.ts", "../node_modules/rx-nostr-crypto/src/worker.ts", "../node_modules/@noble/curves/node_modules/@noble/hashes/src/_assert.ts", "../node_modules/@noble/curves/node_modules/@noble/hashes/src/crypto.ts", "../node_modules/@noble/curves/node_modules/@noble/hashes/src/utils.ts", "../node_modules/@noble/curves/node_modules/@noble/hashes/src/_sha2.ts", "../node_modules/@noble/curves/node_modules/@noble/hashes/src/sha256.ts", "../node_modules/@noble/curves/src/abstract/utils.ts", "../node_modules/@noble/curves/src/abstract/modular.ts", "../node_modules/@noble/curves/src/abstract/curve.ts", "../node_modules/@noble/curves/src/abstract/weierstrass.ts", "../node_modules/@noble/curves/node_modules/@noble/hashes/src/hmac.ts", "../node_modules/@noble/curves/src/_shortw_utils.ts", "../node_modules/@noble/curves/src/secp256k1.ts", "../node_modules/@noble/ciphers/src/_assert.ts", "../node_modules/@noble/ciphers/src/utils.ts", "../node_modules/@noble/ciphers/src/_polyval.ts", "../node_modules/@noble/ciphers/src/aes.ts", "../node_modules/nostr-tools/lib/esm/nip04.js", "../node_modules/@noble/ciphers/src/_poly1305.ts", "../node_modules/@noble/ciphers/src/_arx.ts", "../node_modules/@noble/ciphers/src/chacha.ts", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/_assert.ts", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/hmac.ts", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/hkdf.ts", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/_sha2.ts", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/sha256.ts", "../node_modules/nostr-tools/lib/esm/nip44.js", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/pbkdf2.ts", "../node_modules/nostr-tools/node_modules/@noble/hashes/src/scrypt.ts", "../node_modules/nostr-tools/lib/esm/nip49.js", "../node_modules/nostr-tools/lib/esm/pure.js", "../src/secret_key.ts", "../node_modules/rx-nostr/src/error.ts", "../node_modules/rx-nostr/src/utils/config.ts", "../node_modules/rx-nostr/src/nostr/event.ts", "../node_modules/rx-nostr/src/utils/inline-throw.ts", "../node_modules/rx-nostr/src/config/signer.ts", "../node_modules/rx-nostr/src/config/config.ts", "../node_modules/rx-nostr/src/config/verifier.ts", "../node_modules/rx-nostr/src/lazy-filter.ts", "../node_modules/rx-nostr/src/nostr/nip11.ts", "../node_modules/rx-nostr/src/utils/inline-try.ts", "../node_modules/rx-nostr/src/utils/normalize-url.ts", "../node_modules/rx-nostr/src/utils/url-map.ts", "../node_modules/rx-nostr/src/nip11.ts", "../node_modules/@noble/hashes/esm/_assert.js", "../node_modules/@noble/hashes/esm/utils.js", "../node_modules/@scure/base/lib/esm/index.js", "../node_modules/rx-nostr/src/nostr/bech32.ts", "../node_modules/rx-nostr/src/nostr/filter.ts", "../node_modules/rx-nostr/src/nostr/nip40.ts", "../node_modules/rx-nostr/node_modules/tslib/tslib.es6.mjs", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isFunction.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/createErrorClass.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/UnsubscriptionError.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/arrRemove.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/Subscription.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/config.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduler/timeoutProvider.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/reportUnhandledError.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/noop.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/errorContext.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/Subscriber.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/symbol/observable.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/identity.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/pipe.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/Observable.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/lift.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/OperatorSubscriber.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/ObjectUnsubscribedError.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/Subject.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/BehaviorSubject.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduler/dateTimestampProvider.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduler/Action.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduler/intervalProvider.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduler/AsyncAction.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/Scheduler.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduler/AsyncScheduler.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduler/async.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/observable/empty.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isScheduler.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/args.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isArrayLike.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isPromise.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isInteropObservable.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isAsyncIterable.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/throwUnobservableError.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/symbol/iterator.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isIterable.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isReadableStreamLike.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/observable/innerFrom.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/executeSchedule.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/observeOn.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/subscribeOn.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduled/scheduleObservable.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduled/schedulePromise.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduled/scheduleArray.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduled/scheduleIterable.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduled/scheduleAsyncIterable.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduled/scheduleReadableStreamLike.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/scheduled/scheduled.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/observable/from.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/observable/of.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/EmptyError.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/firstValueFrom.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/isDate.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/timeout.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/map.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/mapOneOrManyArgs.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/argsArgArrayOrObject.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/util/createObject.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/observable/combineLatest.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/mergeInternals.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/mergeMap.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/mergeAll.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/concatAll.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/observable/concat.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/observable/timer.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/observable/merge.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/filter.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/catchError.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/scanInternals.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/defaultIfEmpty.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/take.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/ignoreElements.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/mapTo.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/delayWhen.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/delay.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/distinct.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/distinctUntilChanged.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/throwIfEmpty.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/finalize.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/first.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/groupBy.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/scan.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/switchMap.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/switchAll.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/takeUntil.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/takeWhile.js", "../node_modules/rx-nostr/node_modules/rxjs/dist/esm5/internal/operators/tap.js", "../node_modules/rx-nostr/src/operator.ts", "../node_modules/rx-nostr/src/connection/auth.ts", "../node_modules/rx-nostr/src/connection/utils.ts", "../node_modules/rx-nostr/src/connection/publish.ts", "../node_modules/rx-nostr/src/websocket.ts", "../node_modules/rx-nostr/src/connection/relay.ts", "../node_modules/rx-nostr/src/connection/subscribe.ts", "../node_modules/rx-nostr/src/connection/connection.ts", "../node_modules/rx-nostr/src/utils/array-operation.ts", "../node_modules/rx-nostr/src/rx-nostr/utils.ts", "../node_modules/rx-nostr/src/rx-nostr/rx-nostr.ts", "../node_modules/rx-nostr/src/rx-nostr/rx-req.ts", "../node_modules/rx-nostr/src/index.ts", "../src/nip46/relay_pool.ts", "../src/nip46/rpc.ts", "../src/nip46/signer.ts"],
  "sourcesContent": ["export type { NostrSigner } from \"./interface\";\nexport { Nip07ExtensionSigner, type Nip07Extension } from \"./nip07\";\nexport { Nip46RemoteSigner } from \"./nip46/signer\";\nexport type {\n  Nip46ClientMetadata,\n  Nip46ConnectionParams,\n  Nip46SessionState,\n  Nip46RemoteSignerOptions,\n  Nip46RemoteSignerConnectOptions,\n} from \"./nip46/signer\";\nexport { SecretKeySigner } from \"./secret_key\";\n", "function number(n: number) {\n  if (!Number.isSafeInteger(n) || n < 0) throw new Error(`positive integer expected, not ${n}`);\n}\n\nfunction bool(b: boolean) {\n  if (typeof b !== 'boolean') throw new Error(`boolean expected, not ${b}`);\n}\n\n// copied from utils\nexport function isBytes(a: unknown): a is Uint8Array {\n  return (\n    a instanceof Uint8Array ||\n    (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n  );\n}\n\nfunction bytes(b: Uint8Array | undefined, ...lengths: number[]) {\n  if (!isBytes(b)) throw new Error('Uint8Array expected');\n  if (lengths.length > 0 && !lengths.includes(b.length))\n    throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\n\ntype Hash = {\n  (data: Uint8Array): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create: any;\n};\nfunction hash(h: Hash) {\n  if (typeof h !== 'function' || typeof h.create !== 'function')\n    throw new Error('Hash should be wrapped by utils.wrapConstructor');\n  number(h.outputLen);\n  number(h.blockLen);\n}\n\nfunction exists(instance: any, checkFinished = true) {\n  if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n  if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\nfunction output(out: any, instance: any) {\n  bytes(out);\n  const min = instance.outputLen;\n  if (out.length < min) {\n    throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n  }\n}\n\nexport { number, bool, bytes, hash, exists, output };\n\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n", "/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a: unknown): a is Uint8Array {\n  return (\n    a instanceof Uint8Array ||\n    (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n  );\n}\n\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n  Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n// Cast array to different type\nexport const u8 = (arr: TypedArray) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr: TypedArray) =>\n  new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n\n// Cast array to view\nexport const createView = (arr: TypedArray) =>\n  new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word: number, shift: number) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word: number, shift: number) =>\n  (word << shift) | ((word >>> (32 - shift)) >>> 0);\n\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word: number) =>\n  ((word << 24) & 0xff000000) |\n  ((word << 8) & 0xff0000) |\n  ((word >>> 8) & 0xff00) |\n  ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (n: number) => n : (n: number) => byteSwap(n);\n\n// In place byte swap for Uint32Array\nexport function byteSwap32(arr: Uint32Array) {\n  for (let i = 0; i < arr.length; i++) {\n    arr[i] = byteSwap(arr[i]);\n  }\n}\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n  i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n  abytes(bytes);\n  // pre-caching improves the speed 6x\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 } as const;\nfunction asciiToBase16(char: number): number | undefined {\n  if (char >= asciis._0 && char <= asciis._9) return char - asciis._0;\n  if (char >= asciis._A && char <= asciis._F) return char - (asciis._A - 10);\n  if (char >= asciis._a && char <= asciis._f) return char - (asciis._a - 10);\n  return;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  const hl = hex.length;\n  const al = hl / 2;\n  if (hl % 2) throw new Error('padded 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;\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.\nexport const nextTick = async () => {};\n\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters: number, tick: number, cb: (i: number) => void) {\n  let ts = Date.now();\n  for (let i = 0; i < iters; i++) {\n    cb(i);\n    // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n    const diff = Date.now() - ts;\n    if (diff >= 0 && diff < tick) continue;\n    await nextTick();\n    ts += diff;\n  }\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n  if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\nexport type Input = Uint8Array | string;\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data: Input): Uint8Array {\n  if (typeof data === 'string') data = utf8ToBytes(data);\n  abytes(data);\n  return data;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n  let sum = 0;\n  for (let i = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    abytes(a);\n    sum += a.length;\n  }\n  const res = new Uint8Array(sum);\n  for (let i = 0, pad = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    res.set(a, pad);\n    pad += a.length;\n  }\n  return res;\n}\n\n// For runtime check if class implements interface\nexport abstract class Hash<T extends Hash<T>> {\n  abstract blockLen: number; // Bytes per block\n  abstract outputLen: number; // Bytes in output\n  abstract update(buf: Input): this;\n  // Writes digest into buf\n  abstract digestInto(buf: Uint8Array): void;\n  abstract digest(): Uint8Array;\n  /**\n   * Resets internal state. Makes Hash instance unusable.\n   * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n   * by user, they will need to manually call `destroy()` when zeroing is necessary.\n   */\n  abstract destroy(): void;\n  /**\n   * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n   * when no options are passed.\n   * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n   * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n   * There are no guarantees for clean-up because it's impossible in JS.\n   */\n  abstract _cloneInto(to?: T): T;\n  // Safe version that clones internal state\n  clone(): T {\n    return this._cloneInto();\n  }\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n  xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n  xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\nconst toStr = {}.toString;\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n  defaults: T1,\n  opts?: T2\n): T1 & T2 {\n  if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n    throw new Error('Options should be object or undefined');\n  const merged = Object.assign(defaults, opts);\n  return merged as T1 & T2;\n}\n\nexport type CHash = ReturnType<typeof wrapConstructor>;\n\nexport function wrapConstructor<T extends Hash<T>>(hashCons: () => Hash<T>) {\n  const hashC = (msg: Input): Uint8Array => hashCons().update(toBytes(msg)).digest();\n  const tmp = hashCons();\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = () => hashCons();\n  return hashC;\n}\n\nexport function wrapConstructorWithOpts<H extends Hash<H>, T extends Object>(\n  hashCons: (opts?: T) => Hash<H>\n) {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts: T) => hashCons(opts);\n  return hashC;\n}\n\nexport function wrapXOFConstructorWithOpts<H extends HashXOF<H>, T extends Object>(\n  hashCons: (opts?: T) => HashXOF<H>\n) {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts: T) => hashCons(opts);\n  return hashC;\n}\n\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n  if (crypto && typeof crypto.getRandomValues === 'function') {\n    return crypto.getRandomValues(new Uint8Array(bytesLength));\n  }\n  // Legacy Node.js compatibility\n  if (crypto && typeof crypto.randomBytes === 'function') {\n    return crypto.randomBytes(bytesLength);\n  }\n  throw new Error('crypto.getRandomValues must be defined');\n}\n", "// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// See utils.ts for details.\ndeclare const globalThis: Record<string, any> | undefined;\nexport const crypto =\n  typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n", "/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated, we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\n\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n  Uint16Array | Int16Array | Uint32Array | Int32Array;\n\nconst u8a = (a: any): a is Uint8Array => a instanceof Uint8Array;\n// Cast array to different type\nexport const u8 = (arr: TypedArray) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr: TypedArray) =>\n  new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n\n// Cast array to view\nexport const createView = (arr: TypedArray) =>\n  new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word: number, shift: number) => (word << (32 - shift)) | (word >>> shift);\n\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE) throw new Error('Non little-endian hardware is not supported');\n\nconst hexes = Array.from({ length: 256 }, (v, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n  if (!u8a(bytes)) throw new Error('Uint8Array expected');\n  // pre-caching improves the speed 6x\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  const len = hex.length;\n  if (len % 2) throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n  const array = new Uint8Array(len / 2);\n  for (let i = 0; i < array.length; i++) {\n    const j = i * 2;\n    const hexByte = hex.slice(j, j + 2);\n    const byte = Number.parseInt(hexByte, 16);\n    if (Number.isNaN(byte) || byte < 0) throw new Error('Invalid byte sequence');\n    array[i] = byte;\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.\nexport const nextTick = async () => {};\n\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters: number, tick: number, cb: (i: number) => void) {\n  let ts = Date.now();\n  for (let i = 0; i < iters; i++) {\n    cb(i);\n    // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n    const diff = Date.now() - ts;\n    if (diff >= 0 && diff < tick) continue;\n    await nextTick();\n    ts += diff;\n  }\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n  if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\nexport type Input = Uint8Array | string;\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data: Input): Uint8Array {\n  if (typeof data === 'string') data = utf8ToBytes(data);\n  if (!u8a(data)) throw new Error(`expected Uint8Array, got ${typeof data}`);\n  return data;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n  const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n  let pad = 0; // walk through each item, ensure they have proper type\n  arrays.forEach((a) => {\n    if (!u8a(a)) throw new Error('Uint8Array expected');\n    r.set(a, pad);\n    pad += a.length;\n  });\n  return r;\n}\n\n// For runtime check if class implements interface\nexport abstract class Hash<T extends Hash<T>> {\n  abstract blockLen: number; // Bytes per block\n  abstract outputLen: number; // Bytes in output\n  abstract update(buf: Input): this;\n  // Writes digest into buf\n  abstract digestInto(buf: Uint8Array): void;\n  abstract digest(): Uint8Array;\n  /**\n   * Resets internal state. Makes Hash instance unusable.\n   * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n   * by user, they will need to manually call `destroy()` when zeroing is necessary.\n   */\n  abstract destroy(): void;\n  /**\n   * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n   * when no options are passed.\n   * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n   * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n   * There are no guarantees for clean-up because it's impossible in JS.\n   */\n  abstract _cloneInto(to?: T): T;\n  // Safe version that clones internal state\n  clone(): T {\n    return this._cloneInto();\n  }\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n  xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n  xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\n// Check if object doens't have custom constructor (like Uint8Array/Array)\nconst isPlainObject = (obj: any) =>\n  Object.prototype.toString.call(obj) === '[object Object]' && obj.constructor === Object;\n\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n  defaults: T1,\n  opts?: T2\n): T1 & T2 {\n  if (opts !== undefined && (typeof opts !== 'object' || !isPlainObject(opts)))\n    throw new Error('Options should be object or undefined');\n  const merged = Object.assign(defaults, opts);\n  return merged as T1 & T2;\n}\n\nexport type CHash = ReturnType<typeof wrapConstructor>;\n\nexport function wrapConstructor<T extends Hash<T>>(hashCons: () => Hash<T>) {\n  const hashC = (msg: Input): Uint8Array => hashCons().update(toBytes(msg)).digest();\n  const tmp = hashCons();\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = () => hashCons();\n  return hashC;\n}\n\nexport function wrapConstructorWithOpts<H extends Hash<H>, T extends Object>(\n  hashCons: (opts?: T) => Hash<H>\n) {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts: T) => hashCons(opts);\n  return hashC;\n}\n\nexport function wrapXOFConstructorWithOpts<H extends HashXOF<H>, T extends Object>(\n  hashCons: (opts?: T) => HashXOF<H>\n) {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts: T) => hashCons(opts);\n  return hashC;\n}\n\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n  if (crypto && typeof crypto.getRandomValues === 'function') {\n    return crypto.getRandomValues(new Uint8Array(bytesLength));\n  }\n  throw new Error('crypto.getRandomValues must be defined');\n}\n", "/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nexport function assertNumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`Wrong integer: ${n}`);\n}\nfunction chain(...args) {\n    const wrap = (a, b) => (c) => a(b(c));\n    const encode = Array.from(args)\n        .reverse()\n        .reduce((acc, i) => (acc ? wrap(acc, i.encode) : i.encode), undefined);\n    const decode = args.reduce((acc, i) => (acc ? wrap(acc, i.decode) : i.decode), undefined);\n    return { encode, decode };\n}\nfunction alphabet(alphabet) {\n    return {\n        encode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('alphabet.encode input should be an array of numbers');\n            return digits.map((i) => {\n                assertNumber(i);\n                if (i < 0 || i >= alphabet.length)\n                    throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n                return alphabet[i];\n            });\n        },\n        decode: (input) => {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('alphabet.decode input should be array of strings');\n            return input.map((letter) => {\n                if (typeof letter !== 'string')\n                    throw new Error(`alphabet.decode: not string element=${letter}`);\n                const index = alphabet.indexOf(letter);\n                if (index === -1)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n                return index;\n            });\n        },\n    };\n}\nfunction join(separator = '') {\n    if (typeof separator !== 'string')\n        throw new Error('join separator should be string');\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n                throw new Error('join.encode input should be array of strings');\n            for (let i of from)\n                if (typeof i !== 'string')\n                    throw new Error(`join.encode: non-string input=${i}`);\n            return from.join(separator);\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error('join.decode input should be string');\n            return to.split(separator);\n        },\n    };\n}\nfunction padding(bits, chr = '=') {\n    assertNumber(bits);\n    if (typeof chr !== 'string')\n        throw new Error('padding chr should be string');\n    return {\n        encode(data) {\n            if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of data)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.encode: non-string input=${i}`);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of input)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.decode: non-string input=${i}`);\n            let end = input.length;\n            if ((end * bits) % 8)\n                throw new Error('Invalid padding: string should have whole number of bytes');\n            for (; end > 0 && input[end - 1] === chr; end--) {\n                if (!(((end - 1) * bits) % 8))\n                    throw new Error('Invalid padding: string has too much padding');\n            }\n            return input.slice(0, end);\n        },\n    };\n}\nfunction normalize(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('normalize fn should be function');\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\nfunction convertRadix(data, from, to) {\n    if (from < 2)\n        throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n    if (!Array.isArray(data))\n        throw new Error('convertRadix: data should be array');\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data);\n    digits.forEach((d) => {\n        assertNumber(d);\n        if (d < 0 || d >= from)\n            throw new Error(`Wrong integer: ${d}`);\n    });\n    while (true) {\n        let carry = 0;\n        let done = true;\n        for (let i = pos; i < digits.length; i++) {\n            const digit = digits[i];\n            const digitBase = from * carry + digit;\n            if (!Number.isSafeInteger(digitBase) ||\n                (from * carry) / from !== carry ||\n                digitBase - digit !== from * carry) {\n                throw new Error('convertRadix: carry overflow');\n            }\n            carry = digitBase % to;\n            digits[i] = Math.floor(digitBase / to);\n            if (!Number.isSafeInteger(digits[i]) || digits[i] * to + carry !== digitBase)\n                throw new Error('convertRadix: carry overflow');\n            if (!done)\n                continue;\n            else if (!digits[i])\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 ? a : gcd(b, a % b));\nconst radix2carry = (from, to) => from + (to - gcd(from, to));\nfunction convertRadix2(data, from, to, padding) {\n    if (!Array.isArray(data))\n        throw new Error('convertRadix2: data should be array');\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;\n    const mask = 2 ** to - 1;\n    const res = [];\n    for (const n of data) {\n        assertNumber(n);\n        if (n >= 2 ** from)\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        carry &= 2 ** pos - 1;\n    }\n    carry = (carry << (to - pos)) & mask;\n    if (!padding && pos >= from)\n        throw new Error('Excess padding');\n    if (!padding && carry)\n        throw new Error(`Non-zero padding: ${carry}`);\n    if (padding && pos > 0)\n        res.push(carry >>> 0);\n    return res;\n}\nfunction radix(num) {\n    assertNumber(num);\n    return {\n        encode: (bytes) => {\n            if (!(bytes instanceof Uint8Array))\n                throw new Error('radix.encode input should be Uint8Array');\n            return convertRadix(Array.from(bytes), 2 ** 8, num);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix.decode input should be array of strings');\n            return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\n        },\n    };\n}\nfunction radix2(bits, revPadding = false) {\n    assertNumber(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 (!(bytes instanceof Uint8Array))\n                throw new Error('radix2.encode input should be Uint8Array');\n            return convertRadix2(Array.from(bytes), 8, bits, !revPadding);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix2.decode input should be array of strings');\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\nfunction unsafeWrapper(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('unsafeWrapper fn should be function');\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\nfunction checksum(len, fn) {\n    assertNumber(len);\n    if (typeof fn !== 'function')\n        throw new Error('checksum fn should be function');\n    return {\n        encode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.encode: input should be Uint8Array');\n            const checksum = fn(data).slice(0, len);\n            const res = new Uint8Array(data.length + len);\n            res.set(data);\n            res.set(checksum, data.length);\n            return res;\n        },\n        decode(data) {\n            if (!(data instanceof Uint8Array))\n                throw new Error('checksum.decode: input should be Uint8Array');\n            const payload = data.slice(0, -len);\n            const newChecksum = fn(payload).slice(0, len);\n            const oldChecksum = data.slice(-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}\nexport const utils = { alphabet, chain, checksum, radix, radix2, join, padding };\nexport const base16 = chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexport const base32 = chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexport const base32hex = chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexport const base32crockford = chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexport const base64 = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexport const base64url = chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexport const base58 = genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexport const base58flickr = genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexport const base58xrp = genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\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};\nexport const base58check = (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\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 % 2 ** 30], 30, 5, false));\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        if (typeof prefix !== 'string')\n            throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n        if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n            throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n        const actualLength = prefix.length + 7 + words.length;\n        if (limit !== false && actualLength > limit)\n            throw new TypeError(`Length ${actualLength} exceeds limit ${limit}`);\n        prefix = prefix.toLowerCase();\n        return `${prefix}1${BECH_ALPHABET.encode(words)}${bechChecksum(prefix, words, ENCODING_CONST)}`;\n    }\n    function decode(str, limit = 90) {\n        if (typeof str !== 'string')\n            throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n        if (str.length < 8 || (limit !== false && str.length > limit))\n            throw new TypeError(`Wrong string length: ${str.length} (${str}). Expected (8..${limit})`);\n        const lowered = str.toLowerCase();\n        if (str !== lowered && str !== str.toUpperCase())\n            throw new Error(`String must be lowercase or uppercase`);\n        str = lowered;\n        const sepIndex = str.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 = str.slice(0, sepIndex);\n        const _words = str.slice(sepIndex + 1);\n        if (_words.length < 6)\n            throw new Error('Data must be at least 6 characters long');\n        const words = BECH_ALPHABET.decode(_words).slice(0, -6);\n        const sum = bechChecksum(prefix, words, ENCODING_CONST);\n        if (!_words.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    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\nexport const bech32 = genBech32('bech32');\nexport const bech32m = genBech32('bech32m');\nexport const utf8 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\nexport const hex = chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n    if (typeof s !== 'string' || s.length % 2)\n        throw new TypeError(`hex.decode: expected string, got ${typeof s} with length ${s.length}`);\n    return s.toLowerCase();\n}));\nconst CODERS = {\n    utf8, hex, base16, base32, base64, base64url, base58, base58xmr\n};\nconst coderTypeError = `Invalid encoding type. Available types: ${Object.keys(CODERS).join(', ')}`;\nexport const bytesToString = (type, bytes) => {\n    if (typeof type !== 'string' || !CODERS.hasOwnProperty(type))\n        throw new TypeError(coderTypeError);\n    if (!(bytes instanceof Uint8Array))\n        throw new TypeError('bytesToString() expects Uint8Array');\n    return CODERS[type].encode(bytes);\n};\nexport const str = bytesToString;\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};\nexport const bytes = stringToBytes;\n", "// nip19.ts\nimport { bytesToHex, concatBytes, hexToBytes } from \"@noble/hashes/utils\";\nimport { bech32 } from \"@scure/base\";\n\n// utils.ts\nvar utf8Decoder = new TextDecoder(\"utf-8\");\nvar utf8Encoder = new TextEncoder();\n\n// nip19.ts\nvar NostrTypeGuard = {\n  isNProfile: (value) => /^nprofile1[a-z\\d]+$/.test(value || \"\"),\n  isNEvent: (value) => /^nevent1[a-z\\d]+$/.test(value || \"\"),\n  isNAddr: (value) => /^naddr1[a-z\\d]+$/.test(value || \"\"),\n  isNSec: (value) => /^nsec1[a-z\\d]{58}$/.test(value || \"\"),\n  isNPub: (value) => /^npub1[a-z\\d]{58}$/.test(value || \"\"),\n  isNote: (value) => /^note1[a-z\\d]+$/.test(value || \"\"),\n  isNcryptsec: (value) => /^ncryptsec1[a-z\\d]+$/.test(value || \"\")\n};\nvar Bech32MaxSize = 5e3;\nvar BECH32_REGEX = /[\\x21-\\x7E]{1,83}1[023456789acdefghjklmnpqrstuvwxyz]{6,}/;\nfunction integerToUint8Array(number) {\n  const uint8Array = new Uint8Array(4);\n  uint8Array[0] = number >> 24 & 255;\n  uint8Array[1] = number >> 16 & 255;\n  uint8Array[2] = number >> 8 & 255;\n  uint8Array[3] = number & 255;\n  return uint8Array;\n}\nfunction decode(nip19) {\n  let { prefix, words } = bech32.decode(nip19, Bech32MaxSize);\n  let data = new Uint8Array(bech32.fromWords(words));\n  switch (prefix) {\n    case \"nprofile\": {\n      let tlv = parseTLV(data);\n      if (!tlv[0]?.[0])\n        throw new Error(\"missing TLV 0 for nprofile\");\n      if (tlv[0][0].length !== 32)\n        throw new Error(\"TLV 0 should be 32 bytes\");\n      return {\n        type: \"nprofile\",\n        data: {\n          pubkey: bytesToHex(tlv[0][0]),\n          relays: tlv[1] ? tlv[1].map((d) => utf8Decoder.decode(d)) : []\n        }\n      };\n    }\n    case \"nevent\": {\n      let tlv = parseTLV(data);\n      if (!tlv[0]?.[0])\n        throw new Error(\"missing TLV 0 for nevent\");\n      if (tlv[0][0].length !== 32)\n        throw new Error(\"TLV 0 should be 32 bytes\");\n      if (tlv[2] && tlv[2][0].length !== 32)\n        throw new Error(\"TLV 2 should be 32 bytes\");\n      if (tlv[3] && tlv[3][0].length !== 4)\n        throw new Error(\"TLV 3 should be 4 bytes\");\n      return {\n        type: \"nevent\",\n        data: {\n          id: bytesToHex(tlv[0][0]),\n          relays: tlv[1] ? tlv[1].map((d) => utf8Decoder.decode(d)) : [],\n          author: tlv[2]?.[0] ? bytesToHex(tlv[2][0]) : void 0,\n          kind: tlv[3]?.[0] ? parseInt(bytesToHex(tlv[3][0]), 16) : void 0\n        }\n      };\n    }\n    case \"naddr\": {\n      let tlv = parseTLV(data);\n      if (!tlv[0]?.[0])\n        throw new Error(\"missing TLV 0 for naddr\");\n      if (!tlv[2]?.[0])\n        throw new Error(\"missing TLV 2 for naddr\");\n      if (tlv[2][0].length !== 32)\n        throw new Error(\"TLV 2 should be 32 bytes\");\n      if (!tlv[3]?.[0])\n        throw new Error(\"missing TLV 3 for naddr\");\n      if (tlv[3][0].length !== 4)\n        throw new Error(\"TLV 3 should be 4 bytes\");\n      return {\n        type: \"naddr\",\n        data: {\n          identifier: utf8Decoder.decode(tlv[0][0]),\n          pubkey: bytesToHex(tlv[2][0]),\n          kind: parseInt(bytesToHex(tlv[3][0]), 16),\n          relays: tlv[1] ? tlv[1].map((d) => utf8Decoder.decode(d)) : []\n        }\n      };\n    }\n    case \"nsec\":\n      return { type: prefix, data };\n    case \"npub\":\n    case \"note\":\n      return { type: prefix, data: bytesToHex(data) };\n    default:\n      throw new Error(`unknown prefix ${prefix}`);\n  }\n}\nfunction parseTLV(data) {\n  let result = {};\n  let rest = data;\n  while (rest.length > 0) {\n    let t = rest[0];\n    let l = rest[1];\n    let v = rest.slice(2, 2 + l);\n    rest = rest.slice(2 + l);\n    if (v.length < l)\n      throw new Error(`not enough data to read on TLV ${t}`);\n    result[t] = result[t] || [];\n    result[t].push(v);\n  }\n  return result;\n}\nfunction nsecEncode(key) {\n  return encodeBytes(\"nsec\", key);\n}\nfunction npubEncode(hex) {\n  return encodeBytes(\"npub\", hexToBytes(hex));\n}\nfunction noteEncode(hex) {\n  return encodeBytes(\"note\", hexToBytes(hex));\n}\nfunction encodeBech32(prefix, data) {\n  let words = bech32.toWords(data);\n  return bech32.encode(prefix, words, Bech32MaxSize);\n}\nfunction encodeBytes(prefix, bytes) {\n  return encodeBech32(prefix, bytes);\n}\nfunction nprofileEncode(profile) {\n  let data = encodeTLV({\n    0: [hexToBytes(profile.pubkey)],\n    1: (profile.relays || []).map((url) => utf8Encoder.encode(url))\n  });\n  return encodeBech32(\"nprofile\", data);\n}\nfunction neventEncode(event) {\n  let kindArray;\n  if (event.kind !== void 0) {\n    kindArray = integerToUint8Array(event.kind);\n  }\n  let data = encodeTLV({\n    0: [hexToBytes(event.id)],\n    1: (event.relays || []).map((url) => utf8Encoder.encode(url)),\n    2: event.author ? [hexToBytes(event.author)] : [],\n    3: kindArray ? [new Uint8Array(kindArray)] : []\n  });\n  return encodeBech32(\"nevent\", data);\n}\nfunction naddrEncode(addr) {\n  let kind = new ArrayBuffer(4);\n  new DataView(kind).setUint32(0, addr.kind, false);\n  let data = encodeTLV({\n    0: [utf8Encoder.encode(addr.identifier)],\n    1: (addr.relays || []).map((url) => utf8Encoder.encode(url)),\n    2: [hexToBytes(addr.pubkey)],\n    3: [new Uint8Array(kind)]\n  });\n  return encodeBech32(\"naddr\", data);\n}\nfunction encodeTLV(tlv) {\n  let entries = [];\n  Object.entries(tlv).reverse().forEach(([t, vs]) => {\n    vs.forEach((v) => {\n      let entry = new Uint8Array(v.length + 2);\n      entry.set([parseInt(t)], 0);\n      entry.set([v.length], 1);\n      entry.set(v, 2);\n      entries.push(entry);\n    });\n  });\n  return concatBytes(...entries);\n}\nexport {\n  BECH32_REGEX,\n  Bech32MaxSize,\n  NostrTypeGuard,\n  decode,\n  encodeBytes,\n  naddrEncode,\n  neventEncode,\n  noteEncode,\n  nprofileEncode,\n  npubEncode,\n  nsecEncode\n};\n", "import { bytesToHex, hexToBytes } from \"@noble/hashes/utils\";\nimport * as nip19 from \"nostr-tools/nip19\";\n\nconst regexHexKey = /^[0-9a-f]{64}$/;\n\n/**\n * Parses the given secret key of any string format (hex/bech32)\n * @returns Secret key as both a hex string and an array of bytes, or undefined if the input is invalid\n */\nexport const parseSecKey = (secKey: string): { hex: string; bytes: Uint8Array } | undefined => {\n  if (secKey.startsWith(\"nsec1\")) {\n    const bytes = nip19.decode(secKey as `nsec1${string}`).data;\n    return {\n      hex: bytesToHex(bytes),\n      bytes,\n    };\n  }\n  if (regexHexKey.test(secKey)) {\n    return {\n      hex: secKey,\n      bytes: hexToBytes(secKey),\n    };\n  }\n  return undefined;\n};\n\n/**\n * Parses the given public key of any string format (hex/bech32) as hex\n * @returns Public key as a hex string, or undefined if the input is invalid\n */\nexport const parsePubkey = (pubkey: string): string | undefined => {\n  if (pubkey.startsWith(\"npub1\")) {\n    return nip19.decode(pubkey as `npub1${string}`).data;\n  }\n  if (regexHexKey.test(pubkey)) {\n    return pubkey;\n  }\n  return undefined;\n};\n\n/**\n * Current Unix timestamp in seconds.\n */\nexport const currentUnixtimeSec = () => Math.floor(Date.now() / 1000);\n\nexport const generateRandomString = () => Math.random().toString(32).substring(2, 8);\n\nexport interface Deferred<T> {\n  resolve(v: T | PromiseLike<T>): void;\n  reject(e?: unknown): void;\n}\n\n// biome-ignore lint/suspicious/noUnsafeDeclarationMerging:\nexport class Deferred<T> {\n  promise: Promise<T>;\n  constructor() {\n    this.promise = new Promise((resolve, reject) => {\n      this.resolve = (v) => {\n        resolve(v);\n      };\n      this.reject = (e) => {\n        reject(e);\n      };\n    });\n  }\n}\n\nexport const delay = (durationMs: number) => new Promise((resolve) => setTimeout(resolve, durationMs));\n\nexport const mergeOptionsWithDefaults = <T>(defaults: Required<T>, opts: T): Required<T> => ({ ...defaults, ...opts });\n", "import type { Event as NostrEvent, EventTemplate as NostrEventTemplate } from \"nostr-tools\";\nimport { Deferred, mergeOptionsWithDefaults } from \"./helpers\";\nimport type { NostrSigner, RelayList } from \"./interface\";\n\nexport type Nip07Extension = {\n  getPublicKey(): Promise<string>;\n  signEvent(event: NostrEventTemplate): Promise<NostrEvent>;\n  getRelays?(): Promise<RelayList>;\n  nip04?: {\n    encrypt?(pubKey: string, value: string): Promise<string>;\n    decrypt?(pubKey: string, value: string): Promise<string>;\n  };\n  nip44?: {\n    encrypt?(pubKey: string, value: string): Promise<string>;\n    decrypt?(pubKey: string, value: string): Promise<string>;\n  };\n};\n\nexport type Nip07ExtensionSignerOptions = {\n  /**\n   * Enables the request queueing.\n   * Under the request queueing, you can still call methods concurrently, though actually only a single request is executed at a point in time.\n   *\n   * This is useful when the NIP-07 extension you use can't process concurrent requests correctly.\n   *\n   * @default false\n   */\n  enableQueueing?: boolean;\n};\n\nconst defaultOptions: Required<Nip07ExtensionSignerOptions> = {\n  enableQueueing: false,\n};\n\n/**\n * An implementation of NostrSigner based on a [NIP-07](https://github.com/nostr-protocol/nips/blob/master/07.md) browser extension.\n *\n * NOTE: `nip04/nip44`-`Encrypt/Decrypt` methods throw error if the underlying NIP-07 extension doesn't support them.\n */\nexport class Nip07ExtensionSigner implements NostrSigner {\n  #nip07Ext: Nip07Extension;\n  #reqSerializer: RequestSerializer;\n\n  /**\n   * Creates a Nip07ExtensionSigner from an instance of NIP-07 browser extension.\n   *\n   * @param nip07Ext an instance of NIP-07 extension (`window.nostr`)\n   */\n  public constructor(nip07Ext: Nip07Extension, options: Nip07ExtensionSignerOptions = {}) {\n    this.#nip07Ext = nip07Ext;\n\n    const { enableQueueing } = mergeOptionsWithDefaults(defaultOptions, options);\n    if (enableQueueing) {\n      this.#reqSerializer = new ReqSerializationQueue();\n    } else {\n      this.#reqSerializer = new NoopReqSerializer();\n    }\n  }\n\n  /**\n   * Returns the public key that corresponds to the underlying secret key, in hex string format.\n   */\n  public async getPublicKey(): Promise<string> {\n    return this.#reqSerializer.addRequest(() => this.#nip07Ext.getPublicKey());\n  }\n\n  /**\n   * Returns the list of relays preferred by the user.\n   *\n   * Each entry is a mapping from the relay URL to the preferred use (read/write) of the relay.\n   */\n  public async getRelays(): Promise<RelayList> {\n    if (typeof this.#nip07Ext.getRelays !== \"function\") {\n      throw Error(\"NIP-07 browser extension doesn't support getRelays\");\n    }\n    // biome-ignore lint/style/noNonNullAssertion: extension's field existence hardly changes during runtime\n    return this.#reqSerializer.addRequest(() => this.#nip07Ext.getRelays!());\n  }\n\n  /**\n   * Signs a given Nostr event with the underlying secret key.\n   *\n   * @param event a Nostr event template (unsigned event)\n   * @returns a Promise that resolves to a signed Nostr event\n   */\n  public async signEvent(event: NostrEventTemplate): Promise<NostrEvent> {\n    return this.#reqSerializer.addRequest(() => this.#nip07Ext.signEvent(event));\n  }\n\n  /**\n   * Encrypts a given text to secretly communicate with others, by the encryption algorithm defined in [NIP-04](https://github.com/nostr-protocol/nips/blob/master/04.md).\n   *\n   * @param recipientPubkey a public key of a message recipient, in hex string format\n   * @param plaintext a plaintext to encrypt\n   * @returns a Promise that resolves to a encrypted text\n   */\n  public async nip04Encrypt(recipientPubkey: string, plaintext: string): Promise<string> {\n    if (typeof this.#nip07Ext.nip04?.encrypt !== \"function\") {\n      throw Error(\"NIP-07 browser extension doesn't support nip04.encrypt\");\n    }\n    // biome-ignore lint/style/noNonNullAssertion: extension's field existence hardly changes during runtime\n    return this.#reqSerializer.addRequest(() => this.#nip07Ext.nip04!.encrypt!(recipientPubkey, plaintext));\n  }\n\n  /**\n   * Decrypts a given ciphertext from others, by the decryption algorithm defined in [NIP-04](https://github.com/nostr-protocol/nips/blob/master/04.md).\n   *\n   * @param senderPubkey a public key of a message sender, in hex string format\n   * @param ciphertext a ciphertext to decrypt\n   * @returns a Promise that resolves to a decrypted text\n   */\n  public async nip04Decrypt(senderPubkey: string, ciphertext: string): Promise<string> {\n    if (typeof this.#nip07Ext.nip04?.decrypt !== \"function\") {\n      throw Error(\"NIP-07 browser extension doesn't support nip04.decrypt\");\n    }\n    // biome-ignore lint/style/noNonNullAssertion: extension's field existence hardly changes during runtime\n    return this.#reqSerializer.addRequest(() => this.#nip07Ext.nip04!.decrypt!(senderPubkey, ciphertext));\n  }\n\n  /**\n   * Encrypts a given text to secretly communicate with others, by the encryption algorithm defined in [NIP-44](https://github.com/nostr-protocol/nips/blob/master/44.md).\n   *\n   * @param recipientPubkey a public key of a message recipient, in hex string format\n   * @param plaintext a plaintext to encrypt\n   * @returns a Promise that resolves to a encrypted text\n   */\n  public async nip44Encrypt(recipientPubkey: string, plaintext: string): Promise<string> {\n    if (typeof this.#nip07Ext.nip44?.encrypt !== \"function\") {\n      throw Error(\"NIP-07 browser extension doesn't support nip44.encrypt\");\n    }\n    // biome-ignore lint/style/noNonNullAssertion: extension's field existence hardly changes during runtime\n    return this.#reqSerializer.addRequest(() => this.#nip07Ext.nip44!.encrypt!(recipientPubkey, plaintext));\n  }\n\n  /**\n   * Decrypts a given ciphertext from others, by the decryption algorithm defined in [NIP-44](https://github.com/nostr-protocol/nips/blob/master/44.md).\n   *\n   * @param senderPubkey a public key of a message sender, in hex string format\n   * @param ciphertext a ciphertext to decrypt\n   * @returns a Promise that resolves to a decrypted text\n   */\n  public async nip44Decrypt(senderPubkey: string, ciphertext: string): Promise<string> {\n    if (typeof this.#nip07Ext.nip44?.decrypt !== \"function\") {\n      throw Error(\"NIP-07 browser extension doesn't support nip44.decrypt\");\n    }\n    // biome-ignore lint/style/noNonNullAssertion: extension's field existence hardly changes during runtime\n    return this.#reqSerializer.addRequest(() => this.#nip07Ext.nip44!.decrypt!(senderPubkey, ciphertext));\n  }\n}\n\ninterface RequestSerializer {\n  addRequest<T>(req: () => Promise<T>): Promise<T>;\n}\n\nclass ReqSerializationQueue implements RequestSerializer {\n  #reqQ: (() => Promise<unknown>)[] = [];\n  #running = false;\n\n  public addRequest<T>(req: () => Promise<T>): Promise<T> {\n    const d = new Deferred<T>();\n    const r = async () => {\n      try {\n        d.resolve(await req());\n      } catch (err) {\n        d.reject(err);\n      }\n    };\n    this.#reqQ.push(r);\n\n    if (!this.#running) {\n      this.#running = true;\n      this.startLoop();\n    }\n\n    return d.promise;\n  }\n\n  private async startLoop() {\n    try {\n      while (true) {\n        const req = this.#reqQ.shift();\n        if (req === undefined) {\n          break;\n        }\n        await req();\n      }\n    } finally {\n      this.#running = false;\n    }\n  }\n}\n\nclass NoopReqSerializer implements RequestSerializer {\n  public addRequest<T>(req: () => Promise<T>): Promise<T> {\n    return req();\n  }\n}\n", "function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`boolean expected, not ${b}`);\n}\n// copied from utils\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(h) {\n    if (typeof h !== 'function' || typeof h.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(h.outputLen);\n    number(h.blockLen);\n}\nfunction exists(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}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map", "export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map", "/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word) => ((word << 24) & 0xff000000) |\n    ((word << 8) & 0xff0000) |\n    ((word >>> 8) & 0xff00) |\n    ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (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}\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 * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\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(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\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    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded 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;\n    }\n    return array;\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.\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 * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    abytes(data);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\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// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map", "import { exists, output } from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        return view.setBigUint64(byteOffset, value, isLE);\n    const _32n = BigInt(32);\n    const _u32_max = BigInt(0xffffffff);\n    const wh = Number((value >> _32n) & _u32_max);\n    const wl = Number(value & _u32_max);\n    const h = isLE ? 4 : 0;\n    const l = isLE ? 0 : 4;\n    view.setUint32(byteOffset + h, wh, isLE);\n    view.setUint32(byteOffset + l, wl, isLE);\n}\n// Choice: a ? b : c\nexport const Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nexport const Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\n/**\n * Merkle-Damgard hash construction base class.\n * Could be used to create MD5, RIPEMD, SHA1, SHA2.\n */\nexport class HashMD extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\n        exists(this);\n        const { view, buffer, blockLen } = this;\n        data = toBytes(data);\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        exists(this);\n        output(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        this.buffer.subarray(pos).fill(0);\n        // we have less than padOffset left in buffer, so we cannot put length in\n        // current block, need process it and pad again\n        if (this.padOffset > blockLen - pos) {\n            this.process(view, 0);\n            pos = 0;\n        }\n        // Pad until full block byte with zeros\n        for (let i = pos; i < blockLen; i++)\n            buffer[i] = 0;\n        // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n        // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n        // So we just write lowest 64 bits of that value.\n        setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n        this.process(view, 0);\n        const oview = createView(out);\n        const len = this.outputLen;\n        // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n        if (len % 4)\n            throw new Error('_sha2: outputLen should be aligned to 32bit');\n        const outLen = len / 4;\n        const state = this.get();\n        if (outLen > state.length)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            oview.setUint32(4 * i, state[i], isLE);\n    }\n    digest() {\n        const { buffer, outputLen } = this;\n        this.digestInto(buffer);\n        const res = buffer.slice(0, outputLen);\n        this.destroy();\n        return res;\n    }\n    _cloneInto(to) {\n        to || (to = new this.constructor());\n        to.set(...this.get());\n        const { blockLen, buffer, length, finished, destroyed, pos } = this;\n        to.length = length;\n        to.pos = pos;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        if (length % blockLen)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_md.js.map", "import { HashMD, Chi, Maj } from './_md.js';\nimport { rotr, wrapConstructor } from './utils.js';\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */ new Uint32Array([\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// Initial state:\n// first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19\n// prettier-ignore\nconst SHA256_IV = /* @__PURE__ */ new Uint32Array([\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends HashMD {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = SHA256_IV[0] | 0;\n        this.B = SHA256_IV[1] | 0;\n        this.C = SHA256_IV[2] | 0;\n        this.D = SHA256_IV[3] | 0;\n        this.E = SHA256_IV[4] | 0;\n        this.F = SHA256_IV[5] | 0;\n        this.G = SHA256_IV[6] | 0;\n        this.H = SHA256_IV[7] | 0;\n    }\n    get() {\n        const { A, B, C, D, E, F, G, H } = this;\n        return [A, B, C, D, E, F, G, H];\n    }\n    // prettier-ignore\n    set(A, B, C, D, E, F, G, H) {\n        this.A = A | 0;\n        this.B = B | 0;\n        this.C = C | 0;\n        this.D = D | 0;\n        this.E = E | 0;\n        this.F = F | 0;\n        this.G = G | 0;\n        this.H = H | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4)\n            SHA256_W[i] = view.getUint32(offset, false);\n        for (let i = 16; i < 64; i++) {\n            const W15 = SHA256_W[i - 15];\n            const W2 = SHA256_W[i - 2];\n            const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n            const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n            SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n        }\n        // Compression function main loop, 64 rounds\n        let { A, B, C, D, E, F, G, H } = this;\n        for (let i = 0; i < 64; i++) {\n            const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n            const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n            const T2 = (sigma0 + Maj(A, B, C)) | 0;\n            H = G;\n            G = F;\n            F = E;\n            E = (D + T1) | 0;\n            D = C;\n            C = B;\n            B = A;\n            A = (T1 + T2) | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        A = (A + this.A) | 0;\n        B = (B + this.B) | 0;\n        C = (C + this.C) | 0;\n        D = (D + this.D) | 0;\n        E = (E + this.E) | 0;\n        F = (F + this.F) | 0;\n        G = (G + this.G) | 0;\n        H = (H + this.H) | 0;\n        this.set(A, B, C, D, E, F, G, H);\n    }\n    roundClean() {\n        SHA256_W.fill(0);\n    }\n    destroy() {\n        this.set(0, 0, 0, 0, 0, 0, 0, 0);\n        this.buffer.fill(0);\n    }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\n    }\n}\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n//# sourceMappingURL=sha256.js.map", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nexport function abytes(item) {\n    if (!isBytes(item))\n        throw new Error('Uint8Array expected');\n}\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 * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\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}\nexport function numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? `0${hex}` : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // Big Endian\n    return BigInt(hex === '' ? '0' : `0x${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(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\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    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded 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;\n    }\n    return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    abytes(bytes);\n    return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(n));\n}\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes(hex);\n        }\n        catch (e) {\n            throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n        }\n    }\n    else if (isBytes(hex)) {\n        // Uint8Array.from() instead of hash.slice() because node.js Buffer\n        // is instance of Uint8Array, and its slice() creates **mutable** copy\n        res = Uint8Array.from(hex);\n    }\n    else {\n        throw new Error(`${title} must be hex string or Uint8Array`);\n    }\n    const len = res.length;\n    if (typeof expectedLength === 'number' && len !== expectedLength)\n        throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n    return res;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\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// 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 * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\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) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        throw new Error('hmacFn must be a function');\n    // Step B, Step C: set hashLen to 8*ceil(hlen/8)\n    let v = u8n(hashLen); // Minimal non-full-spec HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n    let k = u8n(hashLen); // Steps B and C of RFC6979 3.2: set hashLen, in our case always same\n    let i = 0; // Iterations counter, will throw when over 1000\n    const reset = () => {\n        v.fill(1);\n        k.fill(0);\n        i = 0;\n    };\n    const h = (...b) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n    const reseed = (seed = u8n()) => {\n        // HMAC-DRBG reseed() function. Steps D-G\n        k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n        v = h(); // v = hmac(k || v)\n        if (seed.length === 0)\n            return;\n        k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n        v = h(); // v = hmac(k || v)\n    };\n    const gen = () => {\n        // HMAC-DRBG generate() function\n        if (i++ >= 1000)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\n        while (len < qByteLen) {\n            v = h();\n            const sl = v.slice();\n            out.push(sl);\n            len += v.length;\n        }\n        return concatBytes(...out);\n    };\n    const genUntil = (seed, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    stringOrUint8Array: (val) => typeof val === 'string' || isBytes(val),\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error(`Invalid validator \"${type}\", expected function`);\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        checkField(fieldName, type, true);\n    return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n//# sourceMappingURL=utils.js.map", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, validateObject, } from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = 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 */\n// TODO: use field version && remove\nexport function pow(num, power, modulo) {\n    if (modulo <= _0n || power < _0n)\n        throw new Error('Expected power/modulo > 0');\n    if (modulo === _1n)\n        return _0n;\n    let res = _1n;\n    while (power > _0n) {\n        if (power & _1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= _1n;\n    }\n    return res;\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// Inverses number over modulo\nexport function invert(number, modulo) {\n    if (number === _0n || modulo <= _0n) {\n        throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n    }\n    // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\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}\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 * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P) {\n    // Legendre constant: used to calculate Legendre symbol (a | p),\n    // which denotes the value of a^((p-1)/2) (mod p).\n    // (a | p) ≡ 1    if a is a square (mod p)\n    // (a | p) ≡ -1   if a is not a square (mod p)\n    // (a | p) ≡ 0    if a ≡ 0 (mod p)\n    const legendreC = (P - _1n) / _2n;\n    let Q, S, Z;\n    // Step 1: By factoring out powers of 2 from p - 1,\n    // find q and s such that p - 1 = q*(2^s) with q odd\n    for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++)\n        ;\n    // Step 2: Select a non-square z such that (z | p) ≡ -1 and set c ≡ zq\n    for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++)\n        ;\n    // Fast-path\n    if (S === 1) {\n        const p1div4 = (P + _1n) / _4n;\n        return function tonelliFast(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\n        // Step 0: Check that n is indeed a square: (n | p) should not be ≡ -1\n        if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE))\n            throw new Error('Cannot find square root');\n        let r = S;\n        // TODO: will fail at Fp2/etc\n        let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n        let x = Fp.pow(n, Q1div2); // first guess at the square root\n        let b = Fp.pow(n, Q); // first guess at the fudge factor\n        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n            // Find m such b^(2^m)==1\n            let m = 1;\n            for (let t2 = Fp.sqr(b); m < r; m++) {\n                if (Fp.eql(t2, Fp.ONE))\n                    break;\n                t2 = Fp.sqr(t2); // t2 *= t2\n            }\n            // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n            const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n            g = Fp.sqr(ge); // g = ge * ge\n            x = Fp.mul(x, ge); // x *= ge\n            b = Fp.mul(b, g); // b *= g\n            r = m;\n        }\n        return x;\n    };\n}\nexport function FpSqrt(P) {\n    // NOTE: 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    // P ≡ 3 (mod 4)\n    // √n = n^((P+1)/4)\n    if (P % _4n === _3n) {\n        // Not all roots possible!\n        // const ORDER =\n        //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n        // const NUM = 72057594037927816n;\n        const p1div4 = (P + _1n) / _4n;\n        return function sqrt3mod4(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Atkin algorithm for q ≡ 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n    if (P % _8n === _5n) {\n        const c1 = (P - _5n) / _8n;\n        return function sqrt5mod8(Fp, n) {\n            const n2 = Fp.mul(n, _2n);\n            const v = Fp.pow(n2, c1);\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            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // P ≡ 9 (mod 16)\n    if (P % _16n === _9n) {\n        // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n        // Means we cannot use sqrt for constants at all!\n        //\n        // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n        // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n        // const c3 = Fp.sqrt(Fp.negate(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        // sqrt = (x) => {\n        //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n        //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n        //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n        //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n        //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n        //   const e2 = Fp.equals(Fp.square(tv3), x); //  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.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n        //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n        // }\n    }\n    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\n// prettier-ignore\nconst FIELD_FIELDS = [\n    'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n    'eql', 'add', 'sub', 'mul', 'pow', 'div',\n    'addN', 'subN', 'mulN', 'sqrN'\n];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\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(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < _0n)\n        throw new Error('Expected power > 0');\n    if (power === _0n)\n        return f.ONE;\n    if (power === _1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= _1n;\n    }\n    return p;\n}\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch(f, nums) {\n    const tmp = new Array(nums.length);\n    // Walk from first to last, multiply them by each other MOD p\n    const lastMultiplied = nums.reduce((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = acc;\n        return f.mul(acc, num);\n    }, f.ONE);\n    // Invert last element\n    const inverted = f.inv(lastMultiplied);\n    // Walk from last to first, multiply them by inverted each other MOD p\n    nums.reduceRight((acc, num, i) => {\n        if (f.is0(num))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n    const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n    return (x) => {\n        const p = f.pow(x, legendreConst);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\n    // Bit size, byte size of CURVE.n\n    const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n    const nByteLength = Math.ceil(_nBitLength / 8);\n    return { nBitLength: _nBitLength, nByteLength };\n}\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: 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, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= _0n)\n        throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('Field lengths over 2048 bytes are not supported');\n    const sqrtP = FpSqrt(ORDER);\n    const f = Object.freeze({\n        ORDER,\n        BITS,\n        BYTES,\n        MASK: bitMask(BITS),\n        ZERO: _0n,\n        ONE: _1n,\n        create: (num) => mod(num, ORDER),\n        isValid: (num) => {\n            if (typeof num !== 'bigint')\n                throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n            return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n        },\n        is0: (num) => num === _0n,\n        isOdd: (num) => (num & _1n) === _1n,\n        neg: (num) => mod(-num, ORDER),\n        eql: (lhs, rhs) => lhs === rhs,\n        sqr: (num) => mod(num * num, ORDER),\n        add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n        sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n        mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n        pow: (num, power) => FpPow(f, num, power),\n        div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n        // Same as above, but doesn't normalize\n        sqrN: (num) => num * num,\n        addN: (lhs, rhs) => lhs + rhs,\n        subN: (lhs, rhs) => lhs - rhs,\n        mulN: (lhs, rhs) => lhs * rhs,\n        inv: (num) => invert(num, ORDER),\n        sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n        invertBatch: (lst) => FpInvertBatch(f, lst),\n        // TODO: do we really need constant cmov?\n        // We don't have const-time bigints anyway, so probably will be not very useful\n        cmov: (a, b, c) => (c ? b : a),\n        toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n        fromBytes: (bytes) => {\n            if (bytes.length !== BYTES)\n                throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n            return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n        },\n    });\n    return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(hash, groupOrder, isLE = false) {\n    hash = ensureBytes('privateHash', hash);\n    const hashLen = hash.length;\n    const minLen = nLength(groupOrder).nByteLength + 8;\n    if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n        throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n    const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n    return mod(num, groupOrder - _1n) + _1n;\n}\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\n}\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\n}\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key, fieldOrder, isLE = false) {\n    const len = key.length;\n    const fieldLen = getFieldBytesLength(fieldOrder);\n    const minLen = getMinHashLength(fieldOrder);\n    // No small numbers: need to understand bias story. No huge numbers: easier to detect JS timings.\n    if (len < 16 || len < minLen || len > 1024)\n        throw new Error(`expected ${minLen}-1024 bytes of input, got ${len}`);\n    const num = isLE ? bytesToNumberBE(key) : bytesToNumberLE(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", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n// Elliptic curve multiplication of Point by scalar. Fragile.\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// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF(c, bits) {\n    const constTimeNegate = (condition, item) => {\n        const neg = item.negate();\n        return condition ? neg : item;\n    };\n    const opts = (W) => {\n        const windows = Math.ceil(bits / W) + 1; // +1, because\n        const windowSize = 2 ** (W - 1); // -1 because we skip zero\n        return { windows, windowSize };\n    };\n    return {\n        constTimeNegate,\n        // non-const time multiplication ladder\n        unsafeLadder(elm, n) {\n            let p = c.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         * @returns precomputed point tables flattened to a single array\n         */\n        precomputeWindow(elm, W) {\n            const { windows, windowSize } = opts(W);\n            const points = [];\n            let p = elm;\n            let base = p;\n            for (let window = 0; window < windows; window++) {\n                base = p;\n                points.push(base);\n                // =1, because we skip zero\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         * @param W window size\n         * @param precomputes precomputed tables\n         * @param n scalar (we don't check here, but should be less than curve order)\n         * @returns real and fake (for const-time) points\n         */\n        wNAF(W, precomputes, n) {\n            // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n            // But need to carefully remove other checks before wNAF. ORDER == bits here\n            const { windows, windowSize } = opts(W);\n            let p = c.ZERO;\n            let f = c.BASE;\n            const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n            const maxNumber = 2 ** W;\n            const shiftBy = BigInt(W);\n            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\n                // If the bits are bigger than max size, we'll split those.\n                // +224 => 256 - 32\n                if (wbits > windowSize) {\n                    wbits -= maxNumber;\n                    n += _1n;\n                }\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                // Check if we're onto Zero point.\n                // Add random point inside current window to f.\n                const offset1 = offset;\n                const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n                const cond1 = window % 2 !== 0;\n                const cond2 = wbits < 0;\n                if (wbits === 0) {\n                    // The most important part for const-time getPublicKey\n                    f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n                }\n                else {\n                    p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n                }\n            }\n            // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n            // Even if the variable is still unused, there are some checks which will\n            // throw an exception, so compiler needs to prove they won't happen, which is hard.\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        wNAFCached(P, precomputesMap, n, transform) {\n            // @ts-ignore\n            const W = P._WINDOW_SIZE || 1;\n            // Calculate precomputes on a first run, reuse them after\n            let comp = precomputesMap.get(P);\n            if (!comp) {\n                comp = this.precomputeWindow(P, W);\n                if (W !== 1) {\n                    precomputesMap.set(P, transform(comp));\n                }\n            }\n            return this.wNAF(W, comp, n);\n        },\n    };\n}\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y² = x³ + ax + b\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { ensureBytes } from './utils.js';\nimport { wNAF, validateBasic } from './curve.js';\nfunction validatePointOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        a: 'field',\n        b: 'field',\n    }, {\n        allowedPrivateKeyLengths: 'array',\n        wrapPrivateKey: 'boolean',\n        isTorsionFree: 'function',\n        clearCofactor: 'function',\n        allowInfinityPoint: 'boolean',\n        fromBytes: 'function',\n        toBytes: 'function',\n    });\n    const { endo, Fp, a } = opts;\n    if (endo) {\n        if (!Fp.eql(a, Fp.ZERO)) {\n            throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n        }\n        if (typeof endo !== 'object' ||\n            typeof endo.beta !== 'bigint' ||\n            typeof endo.splitScalar !== 'function') {\n            throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n        }\n    }\n    return Object.freeze({ ...opts });\n}\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n    // asn.1 DER encoding utils\n    Err: class DERErr extends Error {\n        constructor(m = '') {\n            super(m);\n        }\n    },\n    _parseInt(data) {\n        const { Err: E } = DER;\n        if (data.length < 2 || data[0] !== 0x02)\n            throw new E('Invalid signature integer tag');\n        const len = data[1];\n        const res = data.subarray(2, len + 2);\n        if (!len || res.length !== len)\n            throw new E('Invalid signature integer: wrong length');\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        if (res[0] & 0b10000000)\n            throw new E('Invalid signature integer: negative');\n        if (res[0] === 0x00 && !(res[1] & 0b10000000))\n            throw new E('Invalid signature integer: unnecessary leading zero');\n        return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n    },\n    toSig(hex) {\n        // parse DER signature\n        const { Err: E } = DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        ut.abytes(data);\n        let l = data.length;\n        if (l < 2 || data[0] != 0x30)\n            throw new E('Invalid signature tag');\n        if (data[1] !== l - 2)\n            throw new E('Invalid signature: incorrect length');\n        const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n        const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n        if (rBytesLeft.length)\n            throw new E('Invalid signature: left bytes after parsing');\n        return { r, s };\n    },\n    hexFromSig(sig) {\n        // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n        const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n        const h = (num) => {\n            const hex = num.toString(16);\n            return hex.length & 1 ? `0${hex}` : hex;\n        };\n        const s = slice(h(sig.s));\n        const r = slice(h(sig.r));\n        const shl = s.length / 2;\n        const rhl = r.length / 2;\n        const sl = h(shl);\n        const rl = h(rhl);\n        return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n    },\n};\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\nexport function weierstrassPoints(opts) {\n    const CURVE = validatePointOpts(opts);\n    const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n    const toBytes = CURVE.toBytes ||\n        ((_c, point, _isCompressed) => {\n            const a = point.toAffine();\n            return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n        });\n    const fromBytes = CURVE.fromBytes ||\n        ((bytes) => {\n            // const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n            const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n            const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n            return { x, y };\n        });\n    /**\n     * y² = x³ + ax + b: Short weierstrass curve formula\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\n        const { a, b } = CURVE;\n        const x2 = Fp.sqr(x); // x * x\n        const x3 = Fp.mul(x2, x); // x2 * x\n        return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n    }\n    // Validate whether the passed curve params are valid.\n    // We check if curve equation works for generator point.\n    // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n    // ProjectivePoint class has not been initialized yet.\n    if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n        throw new Error('bad generator point: equation left != right');\n    // Valid group elements reside in range 1..n-1\n    function isWithinCurveOrder(num) {\n        return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n    }\n    function assertGE(num) {\n        if (!isWithinCurveOrder(num))\n            throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n    }\n    // Validates if priv key is valid and converts it to bigint.\n    // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n    function normPrivateKeyToScalar(key) {\n        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n        if (lengths && typeof key !== 'bigint') {\n            if (ut.isBytes(key))\n                key = ut.bytesToHex(key);\n            // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n            if (typeof key !== 'string' || !lengths.includes(key.length))\n                throw new Error('Invalid key');\n            key = key.padStart(nByteLength * 2, '0');\n        }\n        let num;\n        try {\n            num =\n                typeof key === 'bigint'\n                    ? key\n                    : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n        }\n        catch (error) {\n            throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n        }\n        if (wrapPrivateKey)\n            num = mod.mod(num, n); // disabled by default, enabled for BLS\n        assertGE(num); // num in range [1..N-1]\n        return num;\n    }\n    const pointPrecomputes = new Map();\n    function assertPrjPoint(other) {\n        if (!(other instanceof Point))\n            throw new Error('ProjectivePoint expected');\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        constructor(px, py, pz) {\n            this.px = px;\n            this.py = py;\n            this.pz = pz;\n            if (px == null || !Fp.isValid(px))\n                throw new Error('x required');\n            if (py == null || !Fp.isValid(py))\n                throw new Error('y required');\n            if (pz == null || !Fp.isValid(pz))\n                throw new Error('z required');\n        }\n        // Does not validate if the point is on-curve.\n        // Use fromHex instead, or call assertValidity() later.\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            const is0 = (i) => Fp.eql(i, Fp.ZERO);\n            // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n            if (is0(x) && is0(y))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\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         */\n        static normalizeZ(points) {\n            const toInv = Fp.invertBatch(points.map((p) => p.pz));\n            return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n        }\n        /**\n         * Converts hash string or Uint8Array to Point.\n         * @param hex short/long ECDSA hex\n         */\n        static fromHex(hex) {\n            const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n            P.assertValidity();\n            return P;\n        }\n        // Multiplies generator point by privateKey.\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // A point on curve is valid if it conforms to equation.\n        assertValidity() {\n            if (this.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 wrong representation of ZERO and is always invalid.\n                if (CURVE.allowInfinityPoint && !Fp.is0(this.py))\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 } = this.toAffine();\n            // Check if x, y are valid field elements\n            if (!Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('bad point: x or y not FE');\n            const left = Fp.sqr(y); // y²\n            const right = weierstrassEquation(x); // x³ + ax + b\n            if (!Fp.eql(left, right))\n                throw new Error('bad point: equation left != right');\n            if (!this.isTorsionFree())\n                throw new Error('bad point: not in prime-order subgroup');\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (Fp.isOdd)\n                return !Fp.isOdd(y);\n            throw new Error(\"Field doesn't support isOdd\");\n        }\n        /**\n         * Compare one point to another.\n         */\n        equals(other) {\n            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: Z2 } = other;\n            const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n            const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n            return U1 && U2;\n        }\n        /**\n         * Flips point to one corresponding to (x, -y) in Affine coordinates.\n         */\n        negate() {\n            return new Point(this.px, Fp.neg(this.py), this.pz);\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 { px: X1, py: Y1, pz: 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            assertPrjPoint(other);\n            const { px: X1, py: Y1, pz: Z1 } = this;\n            const { px: X2, py: Y2, pz: 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        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, (comp) => {\n                const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n                return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n            });\n        }\n        /**\n         * Non-constant-time multiplication. Uses double-and-add algorithm.\n         * It's faster, but should only be used when you don't care about\n         * an exposed private key e.g. sig verification, which works over *public* keys.\n         */\n        multiplyUnsafe(n) {\n            const I = Point.ZERO;\n            if (n === _0n)\n                return I;\n            assertGE(n); // Will throw on 0\n            if (n === _1n)\n                return this;\n            const { endo } = CURVE;\n            if (!endo)\n                return wnaf.unsafeLadder(this, n);\n            // Apply endomorphism\n            let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n            let k1p = I;\n            let k2p = I;\n            let d = this;\n            while (k1 > _0n || k2 > _0n) {\n                if (k1 & _1n)\n                    k1p = k1p.add(d);\n                if (k2 & _1n)\n                    k2p = k2p.add(d);\n                d = d.double();\n                k1 >>= _1n;\n                k2 >>= _1n;\n            }\n            if (k1neg)\n                k1p = k1p.negate();\n            if (k2neg)\n                k2p = k2p.negate();\n            k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n            return k1p.add(k2p);\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            assertGE(scalar);\n            let n = scalar;\n            let point, fake; // Fake point is used to const-time mult\n            const { endo } = CURVE;\n            if (endo) {\n                const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n                let { p: k1p, f: f1p } = this.wNAF(k1);\n                let { p: k2p, f: f2p } = this.wNAF(k2);\n                k1p = wnaf.constTimeNegate(k1neg, k1p);\n                k2p = wnaf.constTimeNegate(k2neg, k2p);\n                k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n                point = k1p.add(k2p);\n                fake = f1p.add(f2p);\n            }\n            else {\n                const { p, f } = this.wNAF(n);\n                point = p;\n                fake = f;\n            }\n            // Normalize `z` for both points, but return only real one\n            return Point.normalizeZ([point, fake])[0];\n        }\n        /**\n         * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n         * Not using Strauss-Shamir trick: precomputation tables are faster.\n         * The trick could be useful if both P and Q are not G (not in our case).\n         * @returns non-zero affine point\n         */\n        multiplyAndAddUnsafe(Q, a, b) {\n            const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n            const mul = (P, a // Select faster multiply() method\n            ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n            const sum = mul(this, a).add(mul(Q, b));\n            return sum.is0() ? undefined : sum;\n        }\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        toAffine(iz) {\n            const { px: x, py: y, pz: z } = this;\n            const is0 = this.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 ax = Fp.mul(x, iz);\n            const ay = 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: ax, y: ay };\n        }\n        isTorsionFree() {\n            const { h: cofactor, isTorsionFree } = CURVE;\n            if (cofactor === _1n)\n                return true; // No subgroups, always torsion-free\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n        }\n        clearCofactor() {\n            const { h: cofactor, clearCofactor } = CURVE;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(CURVE.h);\n        }\n        toRawBytes(isCompressed = true) {\n            this.assertValidity();\n            return toBytes(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return ut.bytesToHex(this.toRawBytes(isCompressed));\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n    const _bits = CURVE.nBitLength;\n    const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n    // Validate if generator point is on curve\n    return {\n        CURVE,\n        ProjectivePoint: Point,\n        normPrivateKeyToScalar,\n        weierstrassEquation,\n        isWithinCurveOrder,\n    };\n}\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        hash: 'hash',\n        hmac: 'function',\n        randomBytes: 'function',\n    }, {\n        bits2int: 'function',\n        bits2int_modN: 'function',\n        lowS: 'boolean',\n    });\n    return Object.freeze({ lowS: true, ...opts });\n}\nexport function weierstrass(curveDef) {\n    const CURVE = validateOpts(curveDef);\n    const { Fp, n: CURVE_ORDER } = CURVE;\n    const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n    const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n    function isValidFieldElement(num) {\n        return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n    }\n    function modN(a) {\n        return mod.mod(a, CURVE_ORDER);\n    }\n    function invN(a) {\n        return mod.invert(a, CURVE_ORDER);\n    }\n    const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n        ...CURVE,\n        toBytes(_c, point, isCompressed) {\n            const a = point.toAffine();\n            const x = Fp.toBytes(a.x);\n            const cat = ut.concatBytes;\n            if (isCompressed) {\n                return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n            }\n            else {\n                return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n            }\n        },\n        fromBytes(bytes) {\n            const len = bytes.length;\n            const head = bytes[0];\n            const tail = bytes.subarray(1);\n            // this.assertValidity() is done inside of fromHex\n            if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n                const x = ut.bytesToNumberBE(tail);\n                if (!isValidFieldElement(x))\n                    throw new Error('Point is not on curve');\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 suffix = sqrtError instanceof Error ? ': ' + sqrtError.message : '';\n                    throw new Error('Point is not on curve' + suffix);\n                }\n                const isYOdd = (y & _1n) === _1n;\n                // ECDSA\n                const isHeadOdd = (head & 1) === 1;\n                if (isHeadOdd !== isYOdd)\n                    y = Fp.neg(y);\n                return { x, y };\n            }\n            else if (len === uncompressedLen && head === 0x04) {\n                const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n                const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n                return { x, y };\n            }\n            else {\n                throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n            }\n        },\n    });\n    const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function normalizeS(s) {\n        return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n    }\n    // slice bytes num\n    const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n    /**\n     * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = r;\n            this.s = s;\n            this.recovery = recovery;\n            this.assertValidity();\n        }\n        // pair (bytes of r, bytes of s)\n        static fromCompact(hex) {\n            const l = CURVE.nByteLength;\n            hex = ensureBytes('compactSignature', hex, l * 2);\n            return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n        }\n        // DER encoded ECDSA signature\n        // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n        static fromDER(hex) {\n            const { r, s } = DER.toSig(ensureBytes('DER', hex));\n            return new Signature(r, s);\n        }\n        assertValidity() {\n            // can use assertGE here\n            if (!isWithinCurveOrder(this.r))\n                throw new Error('r must be 0 < r < CURVE.n');\n            if (!isWithinCurveOrder(this.s))\n                throw new Error('s must be 0 < s < CURVE.n');\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(msgHash) {\n            const { r, s, recovery: rec } = this;\n            const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n            if (rec == null || ![0, 1, 2, 3].includes(rec))\n                throw new Error('recovery id invalid');\n            const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n            if (radj >= Fp.ORDER)\n                throw new Error('recovery id 2 or 3 invalid');\n            const prefix = (rec & 1) === 0 ? '02' : '03';\n            const R = Point.fromHex(prefix + numToNByteStr(radj));\n            const ir = invN(radj); // r^-1\n            const u1 = modN(-h * ir); // -hr^-1\n            const u2 = modN(s * ir); // sr^-1\n            const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n            if (!Q)\n                throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\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        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n        }\n        // DER-encoded\n        toDERRawBytes() {\n            return ut.hexToBytes(this.toDERHex());\n        }\n        toDERHex() {\n            return DER.hexFromSig({ r: this.r, s: this.s });\n        }\n        // padded bytes of r, then padded bytes of s\n        toCompactRawBytes() {\n            return ut.hexToBytes(this.toCompactHex());\n        }\n        toCompactHex() {\n            return numToNByteStr(this.r) + numToNByteStr(this.s);\n        }\n    }\n    const utils = {\n        isValidPrivateKey(privateKey) {\n            try {\n                normPrivateKeyToScalar(privateKey);\n                return true;\n            }\n            catch (error) {\n                return false;\n            }\n        },\n        normPrivateKeyToScalar: normPrivateKeyToScalar,\n        /**\n         * Produces cryptographically secure private key from random of size\n         * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n         */\n        randomPrivateKey: () => {\n            const length = mod.getMinHashLength(CURVE.n);\n            return mod.mapHashToField(CURVE.randomBytes(length), CURVE.n);\n        },\n        /**\n         * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n         * Allows to massively speed-up `point.multiply(scalar)`.\n         * @returns cached point\n         * @example\n         * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n         * fast.multiply(privKey); // much faster ECDH now\n         */\n        precompute(windowSize = 8, point = Point.BASE) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n            return point;\n        },\n    };\n    /**\n     * Computes public key for a private key. Checks for validity of the private key.\n     * @param privateKey private 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(privateKey, isCompressed = true) {\n        return Point.fromPrivateKey(privateKey).toRawBytes(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 arr = ut.isBytes(item);\n        const str = typeof item === 'string';\n        const len = (arr || str) && item.length;\n        if (arr)\n            return len === compressedLen || len === uncompressedLen;\n        if (str)\n            return len === 2 * compressedLen || len === 2 * uncompressedLen;\n        if (item instanceof Point)\n            return true;\n        return false;\n    }\n    /**\n     * ECDH (Elliptic Curve Diffie Hellman).\n     * Computes shared public key from private key and public key.\n     * Checks: 1) private key validity 2) shared key is on-curve.\n     * Does NOT hash the result.\n     * @param privateA private key\n     * @param publicB different public key\n     * @param isCompressed whether to return compact (default), or full key\n     * @returns shared public key\n     */\n    function getSharedSecret(privateA, publicB, isCompressed = true) {\n        if (isProbPub(privateA))\n            throw new Error('first arg must be private key');\n        if (!isProbPub(publicB))\n            throw new Error('second arg must be public key');\n        const b = Point.fromHex(publicB); // check for being on-curve\n        return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\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 = CURVE.bits2int ||\n        function (bytes) {\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 = ut.bytesToNumberBE(bytes); // check for == u8 done here\n            const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n            return delta > 0 ? num >> BigInt(delta) : num;\n        };\n    const bits2int_modN = CURVE.bits2int_modN ||\n        function (bytes) {\n            return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n        };\n    // NOTE: pads output with zero as per spec\n    const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n    /**\n     * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n     */\n    function int2octets(num) {\n        if (typeof num !== 'bigint')\n            throw new Error('bigint expected');\n        if (!(_0n <= num && num < ORDER_MASK))\n            throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n        // works with order, can have different size than numToField!\n        return ut.numberToBytesBE(num, CURVE.nByteLength);\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    // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n    // Also it can be bigger for P224 + SHA256\n    function prepSig(msgHash, privateKey, opts = defaultSigOpts) {\n        if (['recovered', 'canonical'].some((k) => k in opts))\n            throw new Error('sign() legacy options not supported');\n        const { hash, randomBytes } = CURVE;\n        let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n        if (lowS == null)\n            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n        msgHash = ensureBytes('msgHash', msgHash);\n        if (prehash)\n            msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n        // We can't later call bits2octets, since nested bits2int is broken for curves\n        // with nBitLength % 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(msgHash);\n        const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n        const seedArgs = [int2octets(d), int2octets(h1int)];\n        // extraEntropy. RFC6979 3.6: additional k' (optional).\n        if (ent != null && ent !== false) {\n            // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n            const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n            seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n        }\n        const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n        const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n        // Converts signature params into point w r/s, checks result for validity.\n        function k2sig(kBytes) {\n            // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n            const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n            if (!isWithinCurveOrder(k))\n                return; // Important: all mod() calls here must be done over N\n            const ik = invN(k); // k^-1 mod n\n            const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n            const r = modN(q.x); // r = q.x mod n\n            if (r === _0n)\n                return;\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            const s = modN(ik * modN(m + r * d)); // Not using blinding here\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 = normalizeS(s); // if lowS was passed, ensure s is always\n                recovery ^= 1; // // in the bottom half of N\n            }\n            return new Signature(r, normS, recovery); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\n    /**\n     * Signs message hash with a private key.\n     * ```\n     * sign(m, d, k) where\n     *   (x, y) = G × k\n     *   r = x mod n\n     *   s = (m + dr)/k mod n\n     * ```\n     * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n     * @param privKey private key\n     * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n     * @returns signature with recovery param\n     */\n    function sign(msgHash, privKey, opts = defaultSigOpts) {\n        const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n        const C = CURVE;\n        const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n        return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    }\n    // Enable precomputes. Slows down first publicKey computation by 20ms.\n    Point.BASE._setWindowSize(8);\n    // utils.precompute(8, ProjectivePoint.BASE)\n    /**\n     * Verifies a signature against message hash and public key.\n     * Rejects lowS signatures by default: to override,\n     * specify option `{lowS: false}`. 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, msgHash, publicKey, opts = defaultVerOpts) {\n        const sg = signature;\n        msgHash = ensureBytes('msgHash', msgHash);\n        publicKey = ensureBytes('publicKey', publicKey);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        const { lowS, prehash } = opts;\n        let _sig = undefined;\n        let P;\n        try {\n            if (typeof sg === 'string' || ut.isBytes(sg)) {\n                // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n                // Since DER can also be 2*nByteLength bytes, we check for it first.\n                try {\n                    _sig = Signature.fromDER(sg);\n                }\n                catch (derError) {\n                    if (!(derError instanceof DER.Err))\n                        throw derError;\n                    _sig = Signature.fromCompact(sg);\n                }\n            }\n            else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n                const { r, s } = sg;\n                _sig = new Signature(r, s);\n            }\n            else {\n                throw new Error('PARSE');\n            }\n            P = Point.fromHex(publicKey);\n        }\n        catch (error) {\n            if (error.message === 'PARSE')\n                throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n            return false;\n        }\n        if (lowS && _sig.hasHighS())\n            return false;\n        if (prehash)\n            msgHash = CURVE.hash(msgHash);\n        const { r, s } = _sig;\n        const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n        const is = invN(s); // s^-1\n        const u1 = modN(h * is); // u1 = hs^-1 mod n\n        const u2 = modN(r * is); // u2 = rs^-1 mod n\n        const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1⋅G + u2⋅P\n        if (!R)\n            return false;\n        const v = modN(R.x);\n        return v === r;\n    }\n    return {\n        CURVE,\n        getPublicKey,\n        getSharedSecret,\n        sign,\n        verify,\n        ProjectivePoint: Point,\n        Signature,\n        utils,\n    };\n}\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio(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    mod.validateField(Fp);\n    if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n        throw new Error('mapToCurveSimpleSWU: invalid opts');\n    const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n    if (!Fp.isOdd)\n        throw new Error('Fp.isOdd is not implemented!');\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, opts.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, opts.B); // 6.  tv3 = B * tv3\n        tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n        tv4 = Fp.mul(tv4, opts.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, opts.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, opts.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        x = Fp.div(x, tv4); // 25.   x = x / tv4\n        return { x, y };\n    };\n}\n//# sourceMappingURL=weierstrass.js.map", "import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC extends Hash {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        assertHash(hash);\n        const key = toBytes(_key);\n        this.iHash = hash.create();\n        if (typeof this.iHash.update !== 'function')\n            throw new Error('Expected instance of class which extends utils.Hash');\n        this.blockLen = this.iHash.blockLen;\n        this.outputLen = this.iHash.outputLen;\n        const blockLen = this.blockLen;\n        const pad = new Uint8Array(blockLen);\n        // blockLen can be bigger than outputLen\n        pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36;\n        this.iHash.update(pad);\n        // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n        this.oHash = hash.create();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        pad.fill(0);\n    }\n    update(buf) {\n        assertExists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\n        assertExists(this);\n        assertBytes(out, this.outputLen);\n        this.finished = true;\n        this.iHash.digestInto(out);\n        this.oHash.update(out);\n        this.oHash.digestInto(out);\n        this.destroy();\n    }\n    digest() {\n        const out = new Uint8Array(this.oHash.outputLen);\n        this.digestInto(out);\n        return out;\n    }\n    _cloneInto(to) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to || (to = Object.create(Object.getPrototypeOf(this), {}));\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\n        to.finished = finished;\n        to.destroyed = destroyed;\n        to.blockLen = blockLen;\n        to.outputLen = outputLen;\n        to.oHash = oHash._cloneInto(to.oHash);\n        to.iHash = iHash._cloneInto(to.iHash);\n        return to;\n    }\n    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 */\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", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass } from './abstract/weierstrass.js';\n// connects noble-curves to noble-hashes\nexport function getHash(hash) {\n    return {\n        hash,\n        hmac: (key, ...msgs) => hmac(hash, key, concatBytes(...msgs)),\n        randomBytes,\n    };\n}\nexport function createCurve(curveDef, defHash) {\n    const create = (hash) => weierstrass({ ...curveDef, ...getHash(hash) });\n    return Object.freeze({ ...create(defHash), create });\n}\n//# sourceMappingURL=_shortw_utils.js.map", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha256';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nimport { bytesToNumberBE, concatBytes, ensureBytes, numberToBytesBE } from './abstract/utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { createCurve } from './_shortw_utils.js';\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a, b) => (a + b / _2n) / b;\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 = secp256k1P;\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 (!Fp.eql(Fp.sqr(root), y))\n        throw new Error('Cannot find square root');\n    return root;\n}\nconst Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\nexport const secp256k1 = createCurve({\n    a: BigInt(0), // equation params: a, b\n    b: BigInt(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975\n    Fp, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n\n    n: secp256k1N, // Curve order, total count of valid points in the field\n    // Base point (x, y) aka generator point\n    Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n    Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n    h: BigInt(1), // Cofactor\n    lowS: true, // Allow only low-S signatures by default in sign() and verify()\n    /**\n     * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n     * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n     * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n     * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066\n     */\n    endo: {\n        beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n        splitScalar: (k) => {\n            const n = secp256k1N;\n            const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n            const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n            const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n            const b2 = a1;\n            const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n            const c1 = divNearest(b2 * k, n);\n            const c2 = divNearest(-b1 * k, n);\n            let k1 = mod(k - c1 * a1 - c2 * a2, n);\n            let k2 = mod(-c1 * b1 - c2 * b2, n);\n            const k1neg = k1 > POW_2_128;\n            const k2neg = k2 > POW_2_128;\n            if (k1neg)\n                k1 = n - k1;\n            if (k2neg)\n                k2 = n - k2;\n            if (k1 > POW_2_128 || k2 > POW_2_128) {\n                throw new Error('splitScalar: Endomorphism failed, k=' + k);\n            }\n            return { k1neg, k1, k2neg, k2 };\n        },\n    },\n}, 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\nconst _0n = BigInt(0);\nconst fe = (x) => typeof x === 'bigint' && _0n < x && x < secp256k1P;\nconst ge = (x) => typeof x === 'bigint' && _0n < x && x < secp256k1N;\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(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\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.toRawBytes(true).slice(1);\nconst numTo32b = (n) => numberToBytesBE(n, 32);\nconst modP = (x) => mod(x, secp256k1P);\nconst modN = (x) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\n    let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n    let p = Point.fromPrivateKey(d_); // P = d'⋅G; 0 < d' < n check is done inside\n    const scalar = p.hasEvenY() ? d_ : modN(-d_);\n    return { scalar: 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    if (!fe(x))\n        throw new Error('bad x: need 0 < x < p'); // Fail if x ≥ p.\n    const xx = modP(x * x);\n    const c = modP(xx * x + BigInt(7)); // Let c = x³ + 7 mod p.\n    let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n    if (y % _2n !== _0n)\n        y = modP(-y); // Return the unique point P such that x(P) = x and\n    const p = new Point(x, y, _1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n    p.assertValidity();\n    return p;\n}\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args) {\n    return modN(bytesToNumberBE(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey) {\n    return schnorrGetExtPubKey(privateKey).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, privateKey, auxRand = randomBytes(32)) {\n    const m = ensureBytes('message', message);\n    const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n    const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n    const t = numTo32b(d ^ bytesToNumberBE(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    const k_ = modN(bytesToNumberBE(rand)); // Let k' = int(rand) mod n\n    if (k_ === _0n)\n        throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n    const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'⋅G.\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(numTo32b(modN(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 sig = ensureBytes('signature', signature, 64);\n    const m = ensureBytes('message', message);\n    const pub = ensureBytes('publicKey', publicKey, 32);\n    try {\n        const P = lift_x(bytesToNumberBE(pub)); // P = lift_x(int(pk)); fail if that fails\n        const r = bytesToNumberBE(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r ≥ p.\n        if (!fe(r))\n            return false;\n        const s = bytesToNumberBE(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n        if (!ge(s))\n            return false;\n        const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n        const R = GmulAdd(P, s, modN(-e)); // R = s⋅G - e⋅P\n        if (!R || !R.hasEvenY() || R.toAffine().x !== r)\n            return false; // -eP == (n-e)P\n        return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n    }\n    catch (error) {\n        return false;\n    }\n}\nexport const schnorr = /* @__PURE__ */ (() => ({\n    getPublicKey: schnorrGetPublicKey,\n    sign: schnorrSign,\n    verify: schnorrVerify,\n    utils: {\n        randomPrivateKey: secp256k1.utils.randomPrivateKey,\n        lift_x,\n        pointToBytes,\n        numberToBytesBE,\n        bytesToNumberBE,\n        taggedHash,\n        mod,\n    },\n}))();\nconst isoMap = /* @__PURE__ */ (() => isogenyMap(Fp, [\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(Fp, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fp.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n    const { x, y } = mapSWU(Fp.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: Fp.ORDER,\n    m: 1,\n    k: 128,\n    expand: 'xmd',\n    hash: sha256,\n}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.js.map", "/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport function assertNumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`Wrong integer: ${n}`);\n}\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\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 * @__NO_SIDE_EFFECTS__\n */\nfunction alphabet(alphabet) {\n    return {\n        encode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('alphabet.encode input should be an array of numbers');\n            return digits.map((i) => {\n                assertNumber(i);\n                if (i < 0 || i >= alphabet.length)\n                    throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n                return alphabet[i];\n            });\n        },\n        decode: (input) => {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('alphabet.decode input should be array of strings');\n            return input.map((letter) => {\n                if (typeof letter !== 'string')\n                    throw new Error(`alphabet.decode: not string element=${letter}`);\n                const index = alphabet.indexOf(letter);\n                if (index === -1)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n                return index;\n            });\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction join(separator = '') {\n    if (typeof separator !== 'string')\n        throw new Error('join separator should be string');\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n                throw new Error('join.encode input should be array of strings');\n            for (let i of from)\n                if (typeof i !== 'string')\n                    throw new Error(`join.encode: non-string input=${i}`);\n            return from.join(separator);\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error('join.decode input should be string');\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    assertNumber(bits);\n    if (typeof chr !== 'string')\n        throw new Error('padding chr should be string');\n    return {\n        encode(data) {\n            if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of data)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.encode: non-string input=${i}`);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of input)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.decode: non-string input=${i}`);\n            let end = input.length;\n            if ((end * bits) % 8)\n                throw new Error('Invalid padding: string should have whole number of bytes');\n            for (; end > 0 && input[end - 1] === chr; end--) {\n                if (!(((end - 1) * bits) % 8))\n                    throw new Error('Invalid padding: 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    if (typeof fn !== 'function')\n        throw new Error('normalize fn should be function');\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\n/**\n * Slow: O(n^2) time complexity\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix(data, from, to) {\n    // base 1 is impossible\n    if (from < 2)\n        throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n    if (!Array.isArray(data))\n        throw new Error('convertRadix: data should be array');\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data);\n    digits.forEach((d) => {\n        assertNumber(d);\n        if (d < 0 || d >= from)\n            throw new Error(`Wrong integer: ${d}`);\n    });\n    while (true) {\n        let carry = 0;\n        let done = true;\n        for (let i = pos; i < digits.length; i++) {\n            const digit = digits[i];\n            const digitBase = from * carry + digit;\n            if (!Number.isSafeInteger(digitBase) ||\n                (from * carry) / from !== carry ||\n                digitBase - digit !== from * carry) {\n                throw new Error('convertRadix: carry overflow');\n            }\n            carry = digitBase % to;\n            const rounded = Math.floor(digitBase / to);\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 = /* @__NO_SIDE_EFFECTS__ */ (a, b) => (!b ? a : gcd(b, a % b));\nconst radix2carry = /*@__NO_SIDE_EFFECTS__ */ (from, to) => from + (to - gcd(from, to));\n/**\n * Implemented with numbers, because BigInt is 5x slower\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix2(data, from, to, padding) {\n    if (!Array.isArray(data))\n        throw new Error('convertRadix2: data should be array');\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 mask = 2 ** to - 1;\n    const res = [];\n    for (const n of data) {\n        assertNumber(n);\n        if (n >= 2 ** from)\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        carry &= 2 ** pos - 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)\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    assertNumber(num);\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), 2 ** 8, num);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix.decode input should be array of numbers');\n            return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\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    assertNumber(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            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix2.decode input should be array of numbers');\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction unsafeWrapper(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('unsafeWrapper fn should be function');\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction checksum(len, fn) {\n    assertNumber(len);\n    if (typeof fn !== 'function')\n        throw new Error('checksum fn should be function');\n    return {\n        encode(data) {\n            if (!isBytes(data))\n                throw new Error('checksum.encode: input should be Uint8Array');\n            const checksum = fn(data).slice(0, len);\n            const res = new Uint8Array(data.length + len);\n            res.set(data);\n            res.set(checksum, 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 newChecksum = fn(payload).slice(0, len);\n            const oldChecksum = data.slice(-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// ---------------------\nexport const base16 = /* @__PURE__ */ chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexport const base32 = /* @__PURE__ */ chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexport const base32hex = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexport const base32crockford = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexport const base64 = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexport const base64nopad = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), join(''));\nexport const base64url = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nexport const base64urlnopad = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), join(''));\n// base58 code\n// -----------\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexport const base58 = /* @__PURE__ */ genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexport const base58flickr = /* @__PURE__ */ genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexport const base58xrp = /* @__PURE__ */ genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\n// xmr ver is 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// Data len (index) -> encoded block len\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\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};\nexport const createBase58check = /* @__PURE__ */ (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\n// legacy export, bad name\nexport const base58check = createBase58check;\nconst BECH_ALPHABET = /* @__PURE__ */ chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\n/**\n * @__NO_SIDE_EFFECTS__\n */\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}\n/**\n * @__NO_SIDE_EFFECTS__\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 % 2 ** 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        if (typeof prefix !== 'string')\n            throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n        if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n            throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n        if (prefix.length === 0)\n            throw new TypeError(`Invalid prefix length ${prefix.length}`);\n        const actualLength = prefix.length + 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        if (typeof str !== 'string')\n            throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n        if (str.length < 8 || (limit !== false && str.length > limit))\n            throw new TypeError(`Wrong string length: ${str.length} (${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    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\nexport const bech32 = /* @__PURE__ */ genBech32('bech32');\nexport const bech32m = /* @__PURE__ */ genBech32('bech32m');\nexport const utf8 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\nexport const hex = /* @__PURE__ */ chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n    if (typeof s !== 'string' || s.length % 2)\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';\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};\nexport const str = bytesToString; // as in python, but for bytes only\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};\nexport const bytes = stringToBytes;\n//# sourceMappingURL=index.js.map", "import { schnorr as _schnorr } from \"@noble/curves/secp256k1\";\nimport { sha256 as _sha256 } from \"@noble/hashes/sha256\";\nimport { bytesToHex } from \"@noble/hashes/utils\";\nimport { bech32 } from \"@scure/base\";\nimport * as Nostr from \"nostr-typedef\";\n\nconst utf8Encoder = new TextEncoder();\n\nexport function sha256(m: string): string {\n  return bytesToHex(_sha256(utf8Encoder.encode(m)));\n}\n\nexport interface Schnorr {\n  sign(m: string, seckey: string): string;\n  verify(sig: string, m: string, pubkey: string): boolean;\n  getPublicKey(seckey: string): string;\n}\n\nexport const schnorr: Schnorr = {\n  sign: (m: string, seckey: string): string =>\n    bytesToHex(_schnorr.sign(m, seckey)),\n  verify: _schnorr.verify,\n  getPublicKey: (seckey: string) => bytesToHex(_schnorr.getPublicKey(seckey)),\n};\n\n/** Calculate and return public key in HEX format. */\nexport function getPublicKey(seckey: string): string {\n  return schnorr.getPublicKey(seckey);\n}\n\n/** Calculate and return event's hash (ID). */\nexport function getEventHash(event: Nostr.UnsignedEvent): string {\n  const serialized = JSON.stringify([\n    0,\n    event.pubkey,\n    event.created_at,\n    event.kind,\n    event.tags,\n    event.content,\n  ]);\n  return sha256(serialized);\n}\n\n/** Calculate and return schnorr signature. */\nexport function getSignature(eventHash: string, seckey: string): string {\n  return schnorr.sign(eventHash, seckey);\n}\n\n/** Verify the given event and return true if it is valid. */\nexport function verify(event: Nostr.Event): boolean {\n  try {\n    return schnorr.verify(event.sig, getEventHash(event), event.pubkey);\n  } catch (err) {\n    console.warn(\"The following error occurred during verify():\", err);\n    return false;\n  }\n}\n\n/** Convert bech32 format string to HEX format string. */\nexport function toHex(str: string): string {\n  const { words } = bech32.decode(str);\n  const data = new Uint8Array(bech32.fromWords(words));\n  return bytesToHex(data);\n}\n", "import * as Nostr from \"nostr-typedef\";\n\nimport { getEventHash, getPublicKey, getSignature, toHex } from \"./crypto.js\";\n\nexport interface EventSigner {\n  signEvent<K extends number>(\n    params: Nostr.EventParameters<K>,\n  ): Promise<Nostr.Event<K>>;\n  getPublicKey(): Promise<string>;\n}\n\nexport interface EventSignerOptions {\n  /** If set, the set tags is appended to the end of the given event's tags on signing. */\n  tags?: Nostr.Tag.Any[];\n}\n\nexport function seckeySigner(\n  seckey: string,\n  options?: EventSignerOptions,\n): EventSigner {\n  const sechex = seckey.startsWith(\"nsec1\") ? toHex(seckey) : seckey;\n  const pubhex = getPublicKey(sechex);\n\n  return {\n    async signEvent(params) {\n      const event = {\n        ...params,\n        pubkey: params.pubkey ?? pubhex,\n        tags: [...(params.tags ?? []), ...(options?.tags ?? [])],\n        created_at: params.created_at ?? Math.floor(Date.now() / 1000),\n      };\n\n      if (ensureEventFields(event)) {\n        return event;\n      }\n\n      const id = event.id ?? getEventHash(event);\n      const sig = event.sig ?? getSignature(id, sechex);\n\n      return {\n        ...event,\n        id,\n        sig,\n      };\n    },\n    async getPublicKey() {\n      return pubhex;\n    },\n  };\n}\n\nfunction ensureEventFields(event: Partial<Nostr.Event>): event is Nostr.Event {\n  if (typeof event.id !== \"string\") return false;\n  if (typeof event.sig !== \"string\") return false;\n  if (typeof event.kind !== \"number\") return false;\n  if (typeof event.pubkey !== \"string\") return false;\n  if (typeof event.content !== \"string\") return false;\n  if (typeof event.created_at !== \"number\") return false;\n\n  if (!Array.isArray(event.tags)) return false;\n  for (let i = 0; i < event.tags.length; i++) {\n    const tag = event.tags[i];\n    if (!Array.isArray(tag)) return false;\n    for (let j = 0; j < tag.length; j++) {\n      if (typeof tag[j] === \"object\") return false;\n    }\n  }\n\n  return true;\n}\n", "import * as Nostr from \"nostr-typedef\";\n\nimport { verify } from \"./crypto.js\";\n\nexport interface EventVerifier {\n  (params: Nostr.Event): Promise<boolean>;\n}\n\nexport const verifier: EventVerifier = async (event: Nostr.Event) =>\n  verify(event);\n", "type Callback = () => void;\n\nexport class Batch {\n  private timer: ReturnType<typeof setInterval>;\n  private fireNext: Callback[] = [];\n  private takeNext: Callback[] = [];\n\n  constructor(interval: number) {\n    this.timer = setInterval(() => {\n      for (const f of this.fireNext) {\n        f();\n      }\n      this.fireNext = this.takeNext;\n      this.takeNext = [];\n    }, interval);\n  }\n\n  set(f: Callback) {\n    this.takeNext.push(f);\n  }\n\n  stop() {\n    clearInterval(this.timer);\n  }\n}\n", "import * as Nostr from \"nostr-typedef\";\n\nimport type {\n  VerificationRequest,\n  VerificationResponse,\n  VerificationServiceStatus,\n} from \"./types.js\";\nimport { Batch } from \"./uitls/batch.js\";\nimport { type EventVerifier, verifier as defaultVerifier } from \"./verifier.js\";\n\ntype PingMessage = \"ping\";\ntype PongMessage = \"pong\";\n\nexport interface SignerOptions {\n  tags?: Nostr.Tag.Any[];\n}\n\nexport interface VerificationServiceClientConfig extends SignerOptions {\n  worker: Worker;\n  fallback?: EventVerifier;\n  timeout?: number;\n}\n\nexport interface VerificationServiceClient {\n  start(): void;\n  verifier: EventVerifier;\n  get status(): VerificationServiceStatus;\n  dispose(): void;\n  [Symbol.dispose](): void;\n}\n\n/**\n * On the Worker context, it performs the verification process\n * in response to a request from VerificationServiceClient and returns the results to the client.\n */\nexport const startVerificationServiceHost = (\n  verifier: EventVerifier = defaultVerifier,\n) => {\n  if (\n    typeof WorkerGlobalScope === \"undefined\" ||\n    !(self instanceof WorkerGlobalScope)\n  ) {\n    throw new Error(\n      \"startVerificationServiceHost() must be called in a Worker context.\",\n    );\n  }\n\n  self.addEventListener(\n    \"message\",\n    async (ev: MessageEvent<VerificationRequest | PingMessage>) => {\n      if (ev.data === \"ping\") {\n        self.postMessage(\"pong\" satisfies PongMessage);\n        return;\n      }\n\n      const { reqId, event } = ev.data;\n\n      try {\n        const ok = await verifier(event);\n\n        self.postMessage({\n          reqId,\n          ok,\n        } satisfies VerificationResponse);\n      } catch (err) {\n        self.postMessage({\n          reqId,\n          ok: false,\n          error: `${err}`,\n        } satisfies VerificationResponse);\n      }\n    },\n  );\n};\n\n/**\n * This client does nothing, but can be used when you have to create a fake client\n * in a context where Worker does not exist, e.g. SSR\n */\nexport const createNoopClient = (): VerificationServiceClient => {\n  const noop = () => {};\n  return {\n    start: noop,\n    verifier: async () => false,\n    get status() {\n      return \"prepared\" as const;\n    },\n    dispose: noop,\n    [Symbol.dispose]: noop,\n  };\n};\n\n/**\n * Create a client that sends a verification request to the Worker and receive the result.\n * Since this does the verification process outside of the UI thread, it prevents the UI thread from hanging.\n * However, for example, if the Worker is not ready, the verification process is done by `fallback`, which runs on the UI thread.\n */\nexport const createVerificationServiceClient = ({\n  worker,\n  fallback,\n  tags,\n  timeout,\n}: VerificationServiceClientConfig): VerificationServiceClient => {\n  let status: VerificationServiceStatus = \"prepared\";\n  let nextReqId = 1;\n\n  const resolvers = new Map<number, (ok: boolean) => void>();\n  const batch = new Batch(timeout ?? 10000);\n\n  const fallbackVerifier: EventVerifier = fallback ?? defaultVerifier;\n  const workerVerifier: EventVerifier = (event) => {\n    const reqId = nextReqId++;\n\n    const r = new Promise<boolean>((resolve, reject) => {\n      resolvers.set(reqId, resolve);\n      batch.set(() => {\n        if (resolvers.get(reqId)) {\n          reject(new Error(\"Verification request was timed out.\"));\n          resolvers.delete(reqId);\n        }\n      });\n    });\n\n    worker?.postMessage({\n      reqId,\n      event,\n    } satisfies VerificationRequest);\n\n    return r;\n  };\n\n  const onmessage = (ev: MessageEvent<VerificationResponse | PongMessage>) => {\n    if (status === \"terminated\") {\n      return;\n    }\n\n    if (ev.data === \"pong\") {\n      status = \"active\";\n      return;\n    }\n\n    const { reqId, ok } = ev.data;\n\n    resolvers.get(reqId)?.(ok);\n    resolvers.delete(reqId);\n  };\n\n  const onerror = () => {\n    if (status === \"terminated\") {\n      return;\n    }\n\n    status = \"error\";\n  };\n\n  const start = () => {\n    if (status === \"prepared\") {\n      status = \"booting\";\n      worker.addEventListener(\"message\", onmessage);\n      worker.addEventListener(\"error\", onerror);\n      worker.addEventListener(\"messageerror\", onerror);\n      worker.postMessage(\"ping\" as PingMessage);\n    }\n  };\n\n  const verifier: EventVerifier = (event) => {\n    event = {\n      ...event,\n      tags: [...(event.tags ?? []), ...(tags ?? [])],\n    };\n\n    switch (status) {\n      case \"prepared\":\n        throw new Error(\"VerificationServiceClient is not started yet.\");\n      case \"booting\":\n      case \"error\":\n        return fallbackVerifier(event);\n      case \"active\":\n        return workerVerifier(event);\n      case \"terminated\":\n        throw new Error(\"VerificationServiceClient is already disposed.\");\n    }\n  };\n\n  const dispose = () => {\n    if (status === \"terminated\") {\n      return;\n    }\n\n    status = \"terminated\";\n    worker.removeEventListener(\"message\", onmessage);\n    worker.removeEventListener(\"error\", onerror);\n    worker.removeEventListener(\"messageerror\", onerror);\n    worker.terminate();\n    batch.stop();\n  };\n\n  return {\n    start,\n    verifier,\n    get status() {\n      return status;\n    },\n    dispose,\n    [Symbol.dispose]: dispose,\n  };\n};\n", "function number(n: number) {\n  if (!Number.isSafeInteger(n) || n < 0) throw new Error(`Wrong positive integer: ${n}`);\n}\n\nfunction bool(b: boolean) {\n  if (typeof b !== 'boolean') throw new Error(`Expected boolean, not ${b}`);\n}\n\nfunction bytes(b: Uint8Array | undefined, ...lengths: number[]) {\n  if (!(b instanceof Uint8Array)) throw new Error('Expected Uint8Array');\n  if (lengths.length > 0 && !lengths.includes(b.length))\n    throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\n\ntype Hash = {\n  (data: Uint8Array): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create: any;\n};\nfunction hash(hash: Hash) {\n  if (typeof hash !== 'function' || typeof hash.create !== 'function')\n    throw new Error('Hash should be wrapped by utils.wrapConstructor');\n  number(hash.outputLen);\n  number(hash.blockLen);\n}\n\nfunction exists(instance: any, checkFinished = true) {\n  if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n  if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\nfunction output(out: any, instance: any) {\n  bytes(out);\n  const min = instance.outputLen;\n  if (out.length < min) {\n    throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n  }\n}\n\nexport { number, bool, bytes, hash, exists, output };\n\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n", "// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// See utils.ts for details.\ndeclare const globalThis: Record<string, any> | undefined;\nexport const crypto =\n  typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n", "/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated, we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\n\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n  Uint16Array | Int16Array | Uint32Array | Int32Array;\n\nconst u8a = (a: any): a is Uint8Array => a instanceof Uint8Array;\n// Cast array to different type\nexport const u8 = (arr: TypedArray) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr: TypedArray) =>\n  new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n\n// Cast array to view\nexport const createView = (arr: TypedArray) =>\n  new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word: number, shift: number) => (word << (32 - shift)) | (word >>> shift);\n\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE) throw new Error('Non little-endian hardware is not supported');\n\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n  i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n  if (!u8a(bytes)) throw new Error('Uint8Array expected');\n  // pre-caching improves the speed 6x\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  const len = hex.length;\n  if (len % 2) throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n  const array = new Uint8Array(len / 2);\n  for (let i = 0; i < array.length; i++) {\n    const j = i * 2;\n    const hexByte = hex.slice(j, j + 2);\n    const byte = Number.parseInt(hexByte, 16);\n    if (Number.isNaN(byte) || byte < 0) throw new Error('Invalid byte sequence');\n    array[i] = byte;\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.\nexport const nextTick = async () => {};\n\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters: number, tick: number, cb: (i: number) => void) {\n  let ts = Date.now();\n  for (let i = 0; i < iters; i++) {\n    cb(i);\n    // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n    const diff = Date.now() - ts;\n    if (diff >= 0 && diff < tick) continue;\n    await nextTick();\n    ts += diff;\n  }\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n  if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\nexport type Input = Uint8Array | string;\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data: Input): Uint8Array {\n  if (typeof data === 'string') data = utf8ToBytes(data);\n  if (!u8a(data)) throw new Error(`expected Uint8Array, got ${typeof data}`);\n  return data;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n  const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n  let pad = 0; // walk through each item, ensure they have proper type\n  arrays.forEach((a) => {\n    if (!u8a(a)) throw new Error('Uint8Array expected');\n    r.set(a, pad);\n    pad += a.length;\n  });\n  return r;\n}\n\n// For runtime check if class implements interface\nexport abstract class Hash<T extends Hash<T>> {\n  abstract blockLen: number; // Bytes per block\n  abstract outputLen: number; // Bytes in output\n  abstract update(buf: Input): this;\n  // Writes digest into buf\n  abstract digestInto(buf: Uint8Array): void;\n  abstract digest(): Uint8Array;\n  /**\n   * Resets internal state. Makes Hash instance unusable.\n   * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n   * by user, they will need to manually call `destroy()` when zeroing is necessary.\n   */\n  abstract destroy(): void;\n  /**\n   * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n   * when no options are passed.\n   * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n   * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n   * There are no guarantees for clean-up because it's impossible in JS.\n   */\n  abstract _cloneInto(to?: T): T;\n  // Safe version that clones internal state\n  clone(): T {\n    return this._cloneInto();\n  }\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n  xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n  xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\nconst toStr = {}.toString;\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n  defaults: T1,\n  opts?: T2\n): T1 & T2 {\n  if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n    throw new Error('Options should be object or undefined');\n  const merged = Object.assign(defaults, opts);\n  return merged as T1 & T2;\n}\n\nexport type CHash = ReturnType<typeof wrapConstructor>;\n\nexport function wrapConstructor<T extends Hash<T>>(hashCons: () => Hash<T>) {\n  const hashC = (msg: Input): Uint8Array => hashCons().update(toBytes(msg)).digest();\n  const tmp = hashCons();\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = () => hashCons();\n  return hashC;\n}\n\nexport function wrapConstructorWithOpts<H extends Hash<H>, T extends Object>(\n  hashCons: (opts?: T) => Hash<H>\n) {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts: T) => hashCons(opts);\n  return hashC;\n}\n\nexport function wrapXOFConstructorWithOpts<H extends HashXOF<H>, T extends Object>(\n  hashCons: (opts?: T) => HashXOF<H>\n) {\n  const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n  const tmp = hashCons({} as T);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (opts: T) => hashCons(opts);\n  return hashC;\n}\n\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n  if (crypto && typeof crypto.getRandomValues === 'function') {\n    return crypto.getRandomValues(new Uint8Array(bytesLength));\n  }\n  throw new Error('crypto.getRandomValues must be defined');\n}\n", "import { exists, output } from './_assert.js';\nimport { Hash, createView, Input, toBytes } from './utils.js';\n\n// Polyfill for Safari 14\nfunction setBigUint64(view: DataView, byteOffset: number, value: bigint, isLE: boolean): void {\n  if (typeof view.setBigUint64 === 'function') return view.setBigUint64(byteOffset, value, isLE);\n  const _32n = BigInt(32);\n  const _u32_max = BigInt(0xffffffff);\n  const wh = Number((value >> _32n) & _u32_max);\n  const wl = Number(value & _u32_max);\n  const h = isLE ? 4 : 0;\n  const l = isLE ? 0 : 4;\n  view.setUint32(byteOffset + h, wh, isLE);\n  view.setUint32(byteOffset + l, wl, isLE);\n}\n\n// Base SHA2 class (RFC 6234)\nexport abstract class SHA2<T extends SHA2<T>> extends Hash<T> {\n  protected abstract process(buf: DataView, offset: number): void;\n  protected abstract get(): number[];\n  protected abstract set(...args: number[]): void;\n  abstract destroy(): void;\n  protected abstract roundClean(): void;\n  // For partial updates less than block size\n  protected buffer: Uint8Array;\n  protected view: DataView;\n  protected finished = false;\n  protected length = 0;\n  protected pos = 0;\n  protected destroyed = false;\n\n  constructor(\n    readonly blockLen: number,\n    public outputLen: number,\n    readonly padOffset: number,\n    readonly isLE: boolean\n  ) {\n    super();\n    this.buffer = new Uint8Array(blockLen);\n    this.view = createView(this.buffer);\n  }\n  update(data: Input): this {\n    exists(this);\n    const { view, buffer, blockLen } = this;\n    data = toBytes(data);\n    const len = data.length;\n    for (let pos = 0; pos < len; ) {\n      const take = Math.min(blockLen - this.pos, len - pos);\n      // Fast path: we have at least one block in input, cast it to view and process\n      if (take === blockLen) {\n        const dataView = createView(data);\n        for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);\n        continue;\n      }\n      buffer.set(data.subarray(pos, pos + take), this.pos);\n      this.pos += take;\n      pos += take;\n      if (this.pos === blockLen) {\n        this.process(view, 0);\n        this.pos = 0;\n      }\n    }\n    this.length += data.length;\n    this.roundClean();\n    return this;\n  }\n  digestInto(out: Uint8Array) {\n    exists(this);\n    output(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    this.buffer.subarray(pos).fill(0);\n    // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n    if (this.padOffset > blockLen - pos) {\n      this.process(view, 0);\n      pos = 0;\n    }\n    // Pad until full block byte with zeros\n    for (let i = pos; i < blockLen; i++) buffer[i] = 0;\n    // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n    // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n    // So we just write lowest 64 bits of that value.\n    setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n    this.process(view, 0);\n    const oview = createView(out);\n    const len = this.outputLen;\n    // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n    if (len % 4) throw new Error('_sha2: outputLen should be aligned to 32bit');\n    const outLen = len / 4;\n    const state = this.get();\n    if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n    for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n  }\n  digest() {\n    const { buffer, outputLen } = this;\n    this.digestInto(buffer);\n    const res = buffer.slice(0, outputLen);\n    this.destroy();\n    return res;\n  }\n  _cloneInto(to?: T): T {\n    to ||= new (this.constructor as any)() as T;\n    to.set(...this.get());\n    const { blockLen, buffer, length, finished, destroyed, pos } = this;\n    to.length = length;\n    to.pos = pos;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    if (length % blockLen) to.buffer.set(buffer);\n    return to;\n  }\n}\n", "import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n\n// Choice: a ? b : c\nconst Chi = (a: number, b: number, c: number) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a: number, b: number, c: number) => (a & b) ^ (a & c) ^ (b & c);\n\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */new Uint32Array([\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = /* @__PURE__ */new Uint32Array([\n  0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends SHA2<SHA256> {\n  // We cannot use array here since array allows indexing by variable\n  // which means optimizer/compiler cannot use registers.\n  A = IV[0] | 0;\n  B = IV[1] | 0;\n  C = IV[2] | 0;\n  D = IV[3] | 0;\n  E = IV[4] | 0;\n  F = IV[5] | 0;\n  G = IV[6] | 0;\n  H = IV[7] | 0;\n\n  constructor() {\n    super(64, 32, 8, false);\n  }\n  protected get(): [number, number, number, number, number, number, number, number] {\n    const { A, B, C, D, E, F, G, H } = this;\n    return [A, B, C, D, E, F, G, H];\n  }\n  // prettier-ignore\n  protected set(\n    A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n  ) {\n    this.A = A | 0;\n    this.B = B | 0;\n    this.C = C | 0;\n    this.D = D | 0;\n    this.E = E | 0;\n    this.F = F | 0;\n    this.G = G | 0;\n    this.H = H | 0;\n  }\n  protected process(view: DataView, offset: number): void {\n    // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n    for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);\n    for (let i = 16; i < 64; i++) {\n      const W15 = SHA256_W[i - 15];\n      const W2 = SHA256_W[i - 2];\n      const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n      const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n      SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n    }\n    // Compression function main loop, 64 rounds\n    let { A, B, C, D, E, F, G, H } = this;\n    for (let i = 0; i < 64; i++) {\n      const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n      const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n      const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n      const T2 = (sigma0 + Maj(A, B, C)) | 0;\n      H = G;\n      G = F;\n      F = E;\n      E = (D + T1) | 0;\n      D = C;\n      C = B;\n      B = A;\n      A = (T1 + T2) | 0;\n    }\n    // Add the compressed chunk to the current hash value\n    A = (A + this.A) | 0;\n    B = (B + this.B) | 0;\n    C = (C + this.C) | 0;\n    D = (D + this.D) | 0;\n    E = (E + this.E) | 0;\n    F = (F + this.F) | 0;\n    G = (G + this.G) | 0;\n    H = (H + this.H) | 0;\n    this.set(A, B, C, D, E, F, G, H);\n  }\n  protected roundClean() {\n    SHA256_W.fill(0);\n  }\n  destroy() {\n    this.set(0, 0, 0, 0, 0, 0, 0, 0);\n    this.buffer.fill(0);\n  }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n  A = 0xc1059ed8 | 0;\n  B = 0x367cd507 | 0;\n  C = 0x3070dd17 | 0;\n  D = 0xf70e5939 | 0;\n  E = 0xffc00b31 | 0;\n  F = 0x68581511 | 0;\n  G = 0x64f98fa7 | 0;\n  H = 0xbefa4fa4 | 0;\n  constructor() {\n    super();\n    this.outputLen = 28;\n  }\n}\n\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// 100 lines of code in the file are duplicated from noble-hashes (utils).\n// This is OK: `abstract` directory does not use noble-hashes.\n// User may opt-in into using different hashing library. This way, noble-hashes\n// won't be included into their bundle.\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst u8a = (a: any): a is Uint8Array => a instanceof Uint8Array;\nexport type Hex = Uint8Array | string; // hex strings are accepted for simplicity\nexport type PrivKey = Hex | bigint; // bigints are accepted to ease learning curve\nexport type CHash = {\n  (message: Uint8Array | string): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create(opts?: { dkLen?: number }): any; // For shake\n};\nexport type FHash = (message: Uint8Array | string) => Uint8Array;\n\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n  i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n  if (!u8a(bytes)) throw new Error('Uint8Array expected');\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\nexport function numberToHexUnpadded(num: number | bigint): string {\n  const hex = num.toString(16);\n  return hex.length & 1 ? `0${hex}` : hex;\n}\n\nexport function hexToNumber(hex: string): bigint {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  // Big Endian\n  return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  const len = hex.length;\n  if (len % 2) throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n  const array = new Uint8Array(len / 2);\n  for (let i = 0; i < array.length; i++) {\n    const j = i * 2;\n    const hexByte = hex.slice(j, j + 2);\n    const byte = Number.parseInt(hexByte, 16);\n    if (Number.isNaN(byte) || byte < 0) throw new Error('Invalid byte sequence');\n    array[i] = byte;\n  }\n  return array;\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n  return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes: Uint8Array): bigint {\n  if (!u8a(bytes)) throw new Error('Uint8Array expected');\n  return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n  return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n: number | bigint, len: number): Uint8Array {\n  return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n: number | bigint): Uint8Array {\n  return hexToBytes(numberToHexUnpadded(n));\n}\n\n/**\n * Takes hex string or Uint8Array, converts to Uint8Array.\n * Validates output length.\n * Will throw error for other types.\n * @param title descriptive title for an error e.g. 'private key'\n * @param hex hex string or Uint8Array\n * @param expectedLength optional, will compare to result array's length\n * @returns\n */\nexport function ensureBytes(title: string, hex: Hex, expectedLength?: number): Uint8Array {\n  let res: Uint8Array;\n  if (typeof hex === 'string') {\n    try {\n      res = hexToBytes(hex);\n    } catch (e) {\n      throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n    }\n  } else if (u8a(hex)) {\n    // Uint8Array.from() instead of hash.slice() because node.js Buffer\n    // is instance of Uint8Array, and its slice() creates **mutable** copy\n    res = Uint8Array.from(hex);\n  } else {\n    throw new Error(`${title} must be hex string or Uint8Array`);\n  }\n  const len = res.length;\n  if (typeof expectedLength === 'number' && len !== expectedLength)\n    throw new Error(`${title} expected ${expectedLength} bytes, got ${len}`);\n  return res;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n  const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n  let pad = 0; // walk through each item, ensure they have proper type\n  arrays.forEach((a) => {\n    if (!u8a(a)) throw new Error('Uint8Array expected');\n    r.set(a, pad);\n    pad += a.length;\n  });\n  return r;\n}\n\nexport function equalBytes(b1: Uint8Array, b2: Uint8Array) {\n  // We don't care about timing attacks here\n  if (b1.length !== b2.length) return false;\n  for (let i = 0; i < b1.length; i++) if (b1[i] !== b2[i]) return false;\n  return true;\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n  if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n// Bit operations\n\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n: bigint) {\n  let len;\n  for (len = 0; n > _0n; n >>= _1n, len += 1);\n  return len;\n}\n\n/**\n * Gets single bit at position.\n * NOTE: first bit position is 0 (same as arrays)\n * Same as `!!+Array.from(n.toString(2)).reverse()[pos]`\n */\nexport function bitGet(n: bigint, pos: number) {\n  return (n >> BigInt(pos)) & _1n;\n}\n\n/**\n * Sets single bit at position.\n */\nexport const bitSet = (n: bigint, pos: number, value: boolean) => {\n  return n | ((value ? _1n : _0n) << BigInt(pos));\n};\n\n/**\n * Calculate mask for N bits. Not using ** operator with bigints because of old engines.\n * Same as BigInt(`0b${Array(i).fill('1').join('')}`)\n */\nexport const bitMask = (n: number) => (_2n << BigInt(n - 1)) - _1n;\n\n// DRBG\n\nconst u8n = (data?: any) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr: any) => Uint8Array.from(arr); // another shortcut\ntype Pred<T> = (v: Uint8Array) => T | undefined;\n/**\n * Minimal HMAC-DRBG from NIST 800-90 for RFC6979 sigs.\n * @returns function that will call DRBG until 2nd arg returns something meaningful\n * @example\n *   const drbg = createHmacDRBG<Key>(32, 32, hmac);\n *   drbg(seed, bytesToKey); // bytesToKey must return Key or undefined\n */\nexport function createHmacDrbg<T>(\n  hashLen: number,\n  qByteLen: number,\n  hmacFn: (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array\n): (seed: Uint8Array, predicate: Pred<T>) => T {\n  if (typeof hashLen !== 'number' || hashLen < 2) throw new Error('hashLen must be a number');\n  if (typeof qByteLen !== 'number' || qByteLen < 2) throw new Error('qByteLen must be a number');\n  if (typeof hmacFn !== 'function') throw new Error('hmacFn must be a function');\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 = (...b: Uint8Array[]) => hmacFn(k, v, ...b); // hmac(k)(v, ...values)\n  const reseed = (seed = u8n()) => {\n    // HMAC-DRBG reseed() function. Steps D-G\n    k = h(u8fr([0x00]), seed); // k = hmac(k || v || 0x00 || seed)\n    v = h(); // v = hmac(k || v)\n    if (seed.length === 0) return;\n    k = h(u8fr([0x01]), seed); // k = hmac(k || v || 0x01 || seed)\n    v = h(); // v = hmac(k || v)\n  };\n  const gen = () => {\n    // HMAC-DRBG generate() function\n    if (i++ >= 1000) throw new Error('drbg: tried 1000 values');\n    let len = 0;\n    const out: Uint8Array[] = [];\n    while (len < qByteLen) {\n      v = h();\n      const sl = v.slice();\n      out.push(sl);\n      len += v.length;\n    }\n    return concatBytes(...out);\n  };\n  const genUntil = (seed: Uint8Array, pred: Pred<T>): T => {\n    reset();\n    reseed(seed); // Steps D-G\n    let res: T | undefined = undefined; // Step H: grind until k is in [1..n-1]\n    while (!(res = pred(gen()))) reseed();\n    reset();\n    return res;\n  };\n  return genUntil;\n}\n\n// Validating curves and fields\n\nconst validatorFns = {\n  bigint: (val: any) => typeof val === 'bigint',\n  function: (val: any) => typeof val === 'function',\n  boolean: (val: any) => typeof val === 'boolean',\n  string: (val: any) => typeof val === 'string',\n  stringOrUint8Array: (val: any) => typeof val === 'string' || val instanceof Uint8Array,\n  isSafeInteger: (val: any) => Number.isSafeInteger(val),\n  array: (val: any) => Array.isArray(val),\n  field: (val: any, object: any) => (object as any).Fp.isValid(val),\n  hash: (val: any) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n} as const;\ntype Validator = keyof typeof validatorFns;\ntype ValMap<T extends Record<string, any>> = { [K in keyof T]?: Validator };\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\n\nexport function validateObject<T extends Record<string, any>>(\n  object: T,\n  validators: ValMap<T>,\n  optValidators: ValMap<T> = {}\n) {\n  const checkField = (fieldName: keyof T, type: Validator, isOptional: boolean) => {\n    const checkVal = validatorFns[type];\n    if (typeof checkVal !== 'function')\n      throw new Error(`Invalid validator \"${type}\", expected function`);\n\n    const val = object[fieldName as keyof typeof object];\n    if (isOptional && val === undefined) return;\n    if (!checkVal(val, object)) {\n      throw new Error(\n        `Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`\n      );\n    }\n  };\n  for (const [fieldName, type] of Object.entries(validators)) checkField(fieldName, type!, false);\n  for (const [fieldName, type] of Object.entries(optValidators)) checkField(fieldName, type!, true);\n  return object;\n}\n// validate type tests\n// const o: { a: number; b: number; c: number } = { a: 1, b: 5, c: 6 };\n// const z0 = validateObject(o, { a: 'isSafeInteger' }, { c: 'bigint' }); // Ok!\n// // Should fail type-check\n// const z1 = validateObject(o, { a: 'tmp' }, { c: 'zz' });\n// const z2 = validateObject(o, { a: 'isSafeInteger' }, { c: 'zz' });\n// const z3 = validateObject(o, { test: 'boolean', z: 'bug' });\n// const z4 = validateObject(o, { a: 'boolean', z: 'bug' });\n", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport {\n  bitMask,\n  numberToBytesBE,\n  numberToBytesLE,\n  bytesToNumberBE,\n  bytesToNumberLE,\n  ensureBytes,\n  validateObject,\n} from './utils.js';\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3);\n// prettier-ignore\nconst _4n = BigInt(4), _5n = BigInt(5), _8n = BigInt(8);\n// prettier-ignore\nconst _9n = BigInt(9), _16n = BigInt(16);\n\n// Calculates a modulo b\nexport function mod(a: bigint, b: bigint): bigint {\n  const result = a % b;\n  return result >= _0n ? result : b + result;\n}\n/**\n * Efficiently raise num to power and do modular division.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\n// TODO: use field version && remove\nexport function pow(num: bigint, power: bigint, modulo: bigint): bigint {\n  if (modulo <= _0n || power < _0n) throw new Error('Expected power/modulo > 0');\n  if (modulo === _1n) return _0n;\n  let res = _1n;\n  while (power > _0n) {\n    if (power & _1n) res = (res * num) % modulo;\n    num = (num * num) % modulo;\n    power >>= _1n;\n  }\n  return res;\n}\n\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x: bigint, power: bigint, modulo: bigint): bigint {\n  let res = x;\n  while (power-- > _0n) {\n    res *= res;\n    res %= modulo;\n  }\n  return res;\n}\n\n// Inverses number over modulo\nexport function invert(number: bigint, modulo: bigint): bigint {\n  if (number === _0n || modulo <= _0n) {\n    throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n  }\n  // Euclidean GCD https://brilliant.org/wiki/extended-euclidean-algorithm/\n  // Fermat's little theorem \"CT-like\" version inv(n) = n^(m-2) mod m is 30x slower.\n  let a = mod(number, modulo);\n  let b = modulo;\n  // prettier-ignore\n  let x = _0n, y = _1n, u = _1n, v = _0n;\n  while (a !== _0n) {\n    // JIT applies optimization if those two lines follow each other\n    const q = b / a;\n    const r = b % a;\n    const m = x - u * q;\n    const n = y - v * q;\n    // prettier-ignore\n    b = a, a = r, x = u, y = v, u = m, v = n;\n  }\n  const gcd = b;\n  if (gcd !== _1n) throw new Error('invert: does not exist');\n  return mod(x, modulo);\n}\n\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 * Will start an infinite loop if field order P is not prime.\n * @param P field order\n * @returns function that takes field Fp (created from P) and number n\n */\nexport function tonelliShanks(P: bigint) {\n  // Legendre constant: used to calculate Legendre symbol (a | p),\n  // which denotes the value of a^((p-1)/2) (mod p).\n  // (a | p) \u2261 1    if a is a square (mod p)\n  // (a | p) \u2261 -1   if a is not a square (mod p)\n  // (a | p) \u2261 0    if a \u2261 0 (mod p)\n  const legendreC = (P - _1n) / _2n;\n\n  let Q: bigint, S: number, Z: bigint;\n  // Step 1: By factoring out powers of 2 from p - 1,\n  // find q and s such that p - 1 = q*(2^s) with q odd\n  for (Q = P - _1n, S = 0; Q % _2n === _0n; Q /= _2n, S++);\n\n  // Step 2: Select a non-square z such that (z | p) \u2261 -1 and set c \u2261 zq\n  for (Z = _2n; Z < P && pow(Z, legendreC, P) !== P - _1n; Z++);\n\n  // Fast-path\n  if (S === 1) {\n    const p1div4 = (P + _1n) / _4n;\n    return function tonelliFast<T>(Fp: IField<T>, n: T) {\n      const root = Fp.pow(n, p1div4);\n      if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n      return root;\n    };\n  }\n\n  // Slow-path\n  const Q1div2 = (Q + _1n) / _2n;\n  return function tonelliSlow<T>(Fp: IField<T>, n: T): T {\n    // Step 0: Check that n is indeed a square: (n | p) should not be \u2261 -1\n    if (Fp.pow(n, legendreC) === Fp.neg(Fp.ONE)) throw new Error('Cannot find square root');\n    let r = S;\n    // TODO: will fail at Fp2/etc\n    let g = Fp.pow(Fp.mul(Fp.ONE, Z), Q); // will update both x and b\n    let x = Fp.pow(n, Q1div2); // first guess at the square root\n    let b = Fp.pow(n, Q); // first guess at the fudge factor\n\n    while (!Fp.eql(b, Fp.ONE)) {\n      if (Fp.eql(b, Fp.ZERO)) return Fp.ZERO; // https://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm (4. If t = 0, return r = 0)\n      // Find m such b^(2^m)==1\n      let m = 1;\n      for (let t2 = Fp.sqr(b); m < r; m++) {\n        if (Fp.eql(t2, Fp.ONE)) break;\n        t2 = Fp.sqr(t2); // t2 *= t2\n      }\n      // NOTE: r-m-1 can be bigger than 32, need to convert to bigint before shift, otherwise there will be overflow\n      const ge = Fp.pow(g, _1n << BigInt(r - m - 1)); // ge = 2^(r-m-1)\n      g = Fp.sqr(ge); // g = ge * ge\n      x = Fp.mul(x, ge); // x *= ge\n      b = Fp.mul(b, g); // b *= g\n      r = m;\n    }\n    return x;\n  };\n}\n\nexport function FpSqrt(P: bigint) {\n  // NOTE: 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\n  // P \u2261 3 (mod 4)\n  // \u221An = n^((P+1)/4)\n  if (P % _4n === _3n) {\n    // Not all roots possible!\n    // const ORDER =\n    //   0x1a0111ea397fe69a4b1ba7b6434bacd764774b84f38512bf6730d2a0f6b0f6241eabfffeb153ffffb9feffffffffaaabn;\n    // const NUM = 72057594037927816n;\n    const p1div4 = (P + _1n) / _4n;\n    return function sqrt3mod4<T>(Fp: IField<T>, n: T) {\n      const root = Fp.pow(n, p1div4);\n      // Throw if root**2 != n\n      if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n      return root;\n    };\n  }\n\n  // Atkin algorithm for q \u2261 5 (mod 8), https://eprint.iacr.org/2012/685.pdf (page 10)\n  if (P % _8n === _5n) {\n    const c1 = (P - _5n) / _8n;\n    return function sqrt5mod8<T>(Fp: IField<T>, n: T) {\n      const n2 = Fp.mul(n, _2n);\n      const v = Fp.pow(n2, c1);\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      if (!Fp.eql(Fp.sqr(root), n)) throw new Error('Cannot find square root');\n      return root;\n    };\n  }\n\n  // P \u2261 9 (mod 16)\n  if (P % _16n === _9n) {\n    // NOTE: tonelli is too slow for bls-Fp2 calculations even on start\n    // Means we cannot use sqrt for constants at all!\n    //\n    // const c1 = Fp.sqrt(Fp.negate(Fp.ONE)); //  1. c1 = sqrt(-1) in F, i.e., (c1^2) == -1 in F\n    // const c2 = Fp.sqrt(c1);                //  2. c2 = sqrt(c1) in F, i.e., (c2^2) == c1 in F\n    // const c3 = Fp.sqrt(Fp.negate(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    // sqrt = (x) => {\n    //   let tv1 = Fp.pow(x, c4);             //  1. tv1 = x^c4\n    //   let tv2 = Fp.mul(c1, tv1);           //  2. tv2 = c1 * tv1\n    //   const tv3 = Fp.mul(c2, tv1);         //  3. tv3 = c2 * tv1\n    //   let tv4 = Fp.mul(c3, tv1);           //  4. tv4 = c3 * tv1\n    //   const e1 = Fp.equals(Fp.square(tv2), x); //  5.  e1 = (tv2^2) == x\n    //   const e2 = Fp.equals(Fp.square(tv3), x); //  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.equals(Fp.square(tv2), x); //  9.  e3 = (tv2^2) == x\n    //   return Fp.cmov(tv1, tv2, e3); //  10.  z = CMOV(tv1, tv2, e3)  # Select the sqrt from tv1 and tv2\n    // }\n  }\n\n  // Other cases: Tonelli-Shanks algorithm\n  return tonelliShanks(P);\n}\n\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num: bigint, modulo: bigint) => (mod(num, modulo) & _1n) === _1n;\n\n// Field is not always over prime: for example, Fp2 has ORDER(q)=p^m\nexport interface IField<T> {\n  ORDER: bigint;\n  BYTES: number;\n  BITS: number;\n  MASK: bigint;\n  ZERO: T;\n  ONE: T;\n  // 1-arg\n  create: (num: T) => T;\n  isValid: (num: T) => boolean;\n  is0: (num: T) => boolean;\n  neg(num: T): T;\n  inv(num: T): T;\n  sqrt(num: T): T;\n  sqr(num: T): T;\n  // 2-args\n  eql(lhs: T, rhs: T): boolean;\n  add(lhs: T, rhs: T): T;\n  sub(lhs: T, rhs: T): T;\n  mul(lhs: T, rhs: T | bigint): T;\n  pow(lhs: T, power: bigint): T;\n  div(lhs: T, rhs: T | bigint): T;\n  // N for NonNormalized (for now)\n  addN(lhs: T, rhs: T): T;\n  subN(lhs: T, rhs: T): T;\n  mulN(lhs: T, rhs: T | bigint): T;\n  sqrN(num: T): T;\n\n  // Optional\n  // Should be same as sgn0 function in\n  // [RFC9380](https://www.rfc-editor.org/rfc/rfc9380#section-4.1).\n  // NOTE: sgn0 is 'negative in LE', which is same as odd. And negative in LE is kinda strange definition anyway.\n  isOdd?(num: T): boolean; // Odd instead of even since we have it for Fp2\n  // legendre?(num: T): T;\n  pow(lhs: T, power: bigint): T;\n  invertBatch: (lst: T[]) => T[];\n  toBytes(num: T): Uint8Array;\n  fromBytes(bytes: Uint8Array): T;\n  // If c is False, CMOV returns a, otherwise it returns b.\n  cmov(a: T, b: T, c: boolean): T;\n}\n// prettier-ignore\nconst FIELD_FIELDS = [\n  'create', 'isValid', 'is0', 'neg', 'inv', 'sqrt', 'sqr',\n  'eql', 'add', 'sub', 'mul', 'pow', 'div',\n  'addN', 'subN', 'mulN', 'sqrN'\n] as const;\nexport function validateField<T>(field: IField<T>) {\n  const initial = {\n    ORDER: 'bigint',\n    MASK: 'bigint',\n    BYTES: 'isSafeInteger',\n    BITS: 'isSafeInteger',\n  } as Record<string, string>;\n  const opts = FIELD_FIELDS.reduce((map, val: string) => {\n    map[val] = 'function';\n    return map;\n  }, initial);\n  return validateObject(field, opts);\n}\n\n// Generic field functions\n\n/**\n * Same as `pow` but for Fp: non-constant-time.\n * Unsafe in some contexts: uses ladder, so can expose bigint bits.\n */\nexport function FpPow<T>(f: IField<T>, num: T, power: bigint): T {\n  // Should have same speed as pow for bigints\n  // TODO: benchmark!\n  if (power < _0n) throw new Error('Expected power > 0');\n  if (power === _0n) return f.ONE;\n  if (power === _1n) return num;\n  let p = f.ONE;\n  let d = num;\n  while (power > _0n) {\n    if (power & _1n) p = f.mul(p, d);\n    d = f.sqr(d);\n    power >>= _1n;\n  }\n  return p;\n}\n\n/**\n * Efficiently invert an array of Field elements.\n * `inv(0)` will return `undefined` here: make sure to throw an error.\n */\nexport function FpInvertBatch<T>(f: IField<T>, nums: T[]): T[] {\n  const tmp = new Array(nums.length);\n  // Walk from first to last, multiply them by each other MOD p\n  const lastMultiplied = nums.reduce((acc, num, i) => {\n    if (f.is0(num)) return acc;\n    tmp[i] = acc;\n    return f.mul(acc, num);\n  }, f.ONE);\n  // Invert last element\n  const inverted = f.inv(lastMultiplied);\n  // Walk from last to first, multiply them by inverted each other MOD p\n  nums.reduceRight((acc, num, i) => {\n    if (f.is0(num)) return acc;\n    tmp[i] = f.mul(acc, tmp[i]);\n    return f.mul(acc, num);\n  }, inverted);\n  return tmp;\n}\n\nexport function FpDiv<T>(f: IField<T>, lhs: T, rhs: T | bigint): T {\n  return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare<T>(f: IField<T>) {\n  const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n  return (x: T): boolean => {\n    const p = f.pow(x, legendreConst);\n    return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n  };\n}\n\n// CURVE.n lengths\nexport function nLength(n: bigint, nBitLength?: number) {\n  // Bit size, byte size of CURVE.n\n  const _nBitLength = nBitLength !== undefined ? nBitLength : n.toString(2).length;\n  const nByteLength = Math.ceil(_nBitLength / 8);\n  return { nBitLength: _nBitLength, nByteLength };\n}\n\ntype FpField = IField<bigint> & Required<Pick<IField<bigint>, 'isOdd'>>;\n/**\n * Initializes a finite field over prime. **Non-primes are not supported.**\n * Do not init in loop: slow. Very fragile: always run a benchmark on a change.\n * Major performance optimizations:\n * * a) denormalized operations like mulN instead of mul\n * * b) same object shape: never add or remove keys\n * * c) Object.freeze\n * @param ORDER prime positive bigint\n * @param bitLen how many bits the field consumes\n * @param isLE (def: false) if encoding / decoding should be in little-endian\n * @param redef optional faster redefinitions of sqrt and other methods\n */\nexport function Field(\n  ORDER: bigint,\n  bitLen?: number,\n  isLE = false,\n  redef: Partial<IField<bigint>> = {}\n): Readonly<FpField> {\n  if (ORDER <= _0n) throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n  const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n  if (BYTES > 2048) throw new Error('Field lengths over 2048 bytes are not supported');\n  const sqrtP = FpSqrt(ORDER);\n  const f: Readonly<FpField> = Object.freeze({\n    ORDER,\n    BITS,\n    BYTES,\n    MASK: bitMask(BITS),\n    ZERO: _0n,\n    ONE: _1n,\n    create: (num) => mod(num, ORDER),\n    isValid: (num) => {\n      if (typeof num !== 'bigint')\n        throw new Error(`Invalid field element: expected bigint, got ${typeof num}`);\n      return _0n <= num && num < ORDER; // 0 is valid element, but it's not invertible\n    },\n    is0: (num) => num === _0n,\n    isOdd: (num) => (num & _1n) === _1n,\n    neg: (num) => mod(-num, ORDER),\n    eql: (lhs, rhs) => lhs === rhs,\n\n    sqr: (num) => mod(num * num, ORDER),\n    add: (lhs, rhs) => mod(lhs + rhs, ORDER),\n    sub: (lhs, rhs) => mod(lhs - rhs, ORDER),\n    mul: (lhs, rhs) => mod(lhs * rhs, ORDER),\n    pow: (num, power) => FpPow(f, num, power),\n    div: (lhs, rhs) => mod(lhs * invert(rhs, ORDER), ORDER),\n\n    // Same as above, but doesn't normalize\n    sqrN: (num) => num * num,\n    addN: (lhs, rhs) => lhs + rhs,\n    subN: (lhs, rhs) => lhs - rhs,\n    mulN: (lhs, rhs) => lhs * rhs,\n\n    inv: (num) => invert(num, ORDER),\n    sqrt: redef.sqrt || ((n) => sqrtP(f, n)),\n    invertBatch: (lst) => FpInvertBatch(f, lst),\n    // TODO: do we really need constant cmov?\n    // We don't have const-time bigints anyway, so probably will be not very useful\n    cmov: (a, b, c) => (c ? b : a),\n    toBytes: (num) => (isLE ? numberToBytesLE(num, BYTES) : numberToBytesBE(num, BYTES)),\n    fromBytes: (bytes) => {\n      if (bytes.length !== BYTES)\n        throw new Error(`Fp.fromBytes: expected ${BYTES}, got ${bytes.length}`);\n      return isLE ? bytesToNumberLE(bytes) : bytesToNumberBE(bytes);\n    },\n  } as FpField);\n  return Object.freeze(f);\n}\n\nexport function FpSqrtOdd<T>(Fp: IField<T>, elm: T) {\n  if (!Fp.isOdd) throw new Error(`Field doesn't have isOdd`);\n  const root = Fp.sqrt(elm);\n  return Fp.isOdd(root) ? root : Fp.neg(root);\n}\n\nexport function FpSqrtEven<T>(Fp: IField<T>, elm: T) {\n  if (!Fp.isOdd) throw new Error(`Field doesn't have isOdd`);\n  const root = Fp.sqrt(elm);\n  return Fp.isOdd(root) ? Fp.neg(root) : root;\n}\n\n/**\n * \"Constant-time\" private key generation utility.\n * Same as mapKeyToField, but accepts less bytes (40 instead of 48 for 32-byte field).\n * Which makes it slightly more biased, less secure.\n * @deprecated use mapKeyToField instead\n */\nexport function hashToPrivateScalar(\n  hash: string | Uint8Array,\n  groupOrder: bigint,\n  isLE = false\n): bigint {\n  hash = ensureBytes('privateHash', hash);\n  const hashLen = hash.length;\n  const minLen = nLength(groupOrder).nByteLength + 8;\n  if (minLen < 24 || hashLen < minLen || hashLen > 1024)\n    throw new Error(`hashToPrivateScalar: expected ${minLen}-1024 bytes of input, got ${hashLen}`);\n  const num = isLE ? bytesToNumberLE(hash) : bytesToNumberBE(hash);\n  return mod(num, groupOrder - _1n) + _1n;\n}\n\n/**\n * Returns total number of bytes consumed by the field element.\n * For example, 32 bytes for usual 256-bit weierstrass curve.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of field\n */\nexport function getFieldBytesLength(fieldOrder: bigint): number {\n  if (typeof fieldOrder !== 'bigint') throw new Error('field order must be bigint');\n  const bitLength = fieldOrder.toString(2).length;\n  return Math.ceil(bitLength / 8);\n}\n\n/**\n * Returns minimal amount of bytes that can be safely reduced\n * by field order.\n * Should be 2^-128 for 128-bit curve such as P256.\n * @param fieldOrder number of field elements, usually CURVE.n\n * @returns byte length of target hash\n */\nexport function getMinHashLength(fieldOrder: bigint): number {\n  const length = getFieldBytesLength(fieldOrder);\n  return length + Math.ceil(length / 2);\n}\n\n/**\n * \"Constant-time\" private key generation utility.\n * Can take (n + n/2) or more bytes of uniform input e.g. from CSPRNG or KDF\n * and convert them into private scalar, with the modulo bias being negligible.\n * Needs at least 48 bytes of input for 32-byte private key.\n * https://research.kudelskisecurity.com/2020/07/28/the-definitive-guide-to-modulo-bias-and-how-to-avoid-it/\n * FIPS 186-5, A.2 https://csrc.nist.gov/publications/detail/fips/186/5/final\n * RFC 9380, https://www.rfc-editor.org/rfc/rfc9380#section-5\n * @param hash hash output from SHA3 or a similar function\n * @param groupOrder size of subgroup - (e.g. secp256k1.CURVE.n)\n * @param isLE interpret hash bytes as LE num\n * @returns valid private scalar\n */\nexport function mapHashToField(key: Uint8Array, fieldOrder: bigint, isLE = false): Uint8Array {\n  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 ? bytesToNumberBE(key) : bytesToNumberLE(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", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { IField, validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\n\nexport type AffinePoint<T> = {\n  x: T;\n  y: T;\n} & { z?: never; t?: never };\n\nexport interface Group<T extends Group<T>> {\n  double(): T;\n  negate(): T;\n  add(other: T): T;\n  subtract(other: T): T;\n  equals(other: T): boolean;\n  multiply(scalar: bigint): T;\n}\n\nexport type GroupConstructor<T> = {\n  BASE: T;\n  ZERO: T;\n};\nexport type Mapper<T> = (i: T[]) => T[];\n\n// Elliptic curve multiplication of Point by scalar. Fragile.\n// Scalars should always be less than curve order: this should be checked inside of a curve itself.\n// Creates precomputation tables for fast multiplication:\n// - private scalar is split by fixed size windows of W bits\n// - every window point is collected from window's table & added to accumulator\n// - since windows are different, same point inside tables won't be accessed more than once per calc\n// - each multiplication is 'Math.ceil(CURVE_ORDER / \uD835\uDC4A) + 1' point additions (fixed for any scalar)\n// - +1 window is neccessary for wNAF\n// - wNAF reduces table size: 2x less memory + 2x faster generation, but 10% slower multiplication\n// TODO: Research returning 2d JS array of windows, instead of a single window. This would allow\n// windows to be in different memory locations\nexport function wNAF<T extends Group<T>>(c: GroupConstructor<T>, bits: number) {\n  const constTimeNegate = (condition: boolean, item: T): T => {\n    const neg = item.negate();\n    return condition ? neg : item;\n  };\n  const opts = (W: number) => {\n    const windows = Math.ceil(bits / W) + 1; // +1, because\n    const windowSize = 2 ** (W - 1); // -1 because we skip zero\n    return { windows, windowSize };\n  };\n  return {\n    constTimeNegate,\n    // non-const time multiplication ladder\n    unsafeLadder(elm: T, n: bigint) {\n      let p = c.ZERO;\n      let d: T = elm;\n      while (n > _0n) {\n        if (n & _1n) p = p.add(d);\n        d = d.double();\n        n >>= _1n;\n      }\n      return p;\n    },\n\n    /**\n     * Creates a wNAF precomputation window. Used for caching.\n     * Default window size is set by `utils.precompute()` and is equal to 8.\n     * Number of precomputed points depends on the curve size:\n     * 2^(\uD835\uDC4A\u22121) * (Math.ceil(\uD835\uDC5B / \uD835\uDC4A) + 1), where:\n     * - \uD835\uDC4A is the window size\n     * - \uD835\uDC5B is the bitlength of the curve order.\n     * For a 256-bit curve and window size 8, the number of precomputed points is 128 * 33 = 4224.\n     * @returns precomputed point tables flattened to a single array\n     */\n    precomputeWindow(elm: T, W: number): Group<T>[] {\n      const { windows, windowSize } = opts(W);\n      const points: T[] = [];\n      let p: T = elm;\n      let base = p;\n      for (let window = 0; window < windows; window++) {\n        base = p;\n        points.push(base);\n        // =1, because we skip zero\n        for (let i = 1; i < windowSize; i++) {\n          base = base.add(p);\n          points.push(base);\n        }\n        p = base.double();\n      }\n      return points;\n    },\n\n    /**\n     * Implements ec multiplication using precomputed tables and w-ary non-adjacent form.\n     * @param W window size\n     * @param precomputes precomputed tables\n     * @param n scalar (we don't check here, but should be less than curve order)\n     * @returns real and fake (for const-time) points\n     */\n    wNAF(W: number, precomputes: T[], n: bigint): { p: T; f: T } {\n      // TODO: maybe check that scalar is less than group order? wNAF behavious is undefined otherwise\n      // But need to carefully remove other checks before wNAF. ORDER == bits here\n      const { windows, windowSize } = opts(W);\n\n      let p = c.ZERO;\n      let f = c.BASE;\n\n      const mask = BigInt(2 ** W - 1); // Create mask with W ones: 0b1111 for W=4 etc.\n      const maxNumber = 2 ** W;\n      const shiftBy = BigInt(W);\n\n      for (let window = 0; window < windows; window++) {\n        const offset = window * windowSize;\n        // Extract W bits.\n        let wbits = Number(n & mask);\n\n        // Shift number by W bits.\n        n >>= shiftBy;\n\n        // If the bits are bigger than max size, we'll split those.\n        // +224 => 256 - 32\n        if (wbits > windowSize) {\n          wbits -= maxNumber;\n          n += _1n;\n        }\n\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\n        // Check if we're onto Zero point.\n        // Add random point inside current window to f.\n        const offset1 = offset;\n        const offset2 = offset + Math.abs(wbits) - 1; // -1 because we skip zero\n        const cond1 = window % 2 !== 0;\n        const cond2 = wbits < 0;\n        if (wbits === 0) {\n          // The most important part for const-time getPublicKey\n          f = f.add(constTimeNegate(cond1, precomputes[offset1]));\n        } else {\n          p = p.add(constTimeNegate(cond2, precomputes[offset2]));\n        }\n      }\n      // JIT-compiler should not eliminate f here, since it will later be used in normalizeZ()\n      // Even if the variable is still unused, there are some checks which will\n      // throw an exception, so compiler needs to prove they won't happen, which is hard.\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    wNAFCached(P: T, precomputesMap: Map<T, T[]>, n: bigint, transform: Mapper<T>): { p: T; f: T } {\n      // @ts-ignore\n      const W: number = P._WINDOW_SIZE || 1;\n      // Calculate precomputes on a first run, reuse them after\n      let comp = precomputesMap.get(P);\n      if (!comp) {\n        comp = this.precomputeWindow(P, W) as T[];\n        if (W !== 1) {\n          precomputesMap.set(P, transform(comp));\n        }\n      }\n      return this.wNAF(W, comp, n);\n    },\n  };\n}\n\n// Generic BasicCurve interface: works even for polynomial fields (BLS): P, n, h would be ok.\n// Though generator can be different (Fp2 / Fp6 for BLS).\nexport type BasicCurve<T> = {\n  Fp: IField<T>; // Field over which we'll do calculations (Fp)\n  n: bigint; // Curve order, total count of valid points in the field\n  nBitLength?: number; // bit length of curve order\n  nByteLength?: number; // byte length of curve order\n  h: bigint; // cofactor. we can assign default=1, but users will just ignore it w/o validation\n  hEff?: bigint; // Number to multiply to clear cofactor\n  Gx: T; // base point X coordinate\n  Gy: T; // base point Y coordinate\n  allowInfinityPoint?: boolean; // bls12-381 requires it. ZERO point is valid, but invalid pubkey\n};\n\nexport function validateBasic<FP, T>(curve: BasicCurve<FP> & T) {\n  validateField(curve.Fp);\n  validateObject(\n    curve,\n    {\n      n: 'bigint',\n      h: 'bigint',\n      Gx: 'field',\n      Gy: 'field',\n    },\n    {\n      nBitLength: 'isSafeInteger',\n      nByteLength: 'isSafeInteger',\n    }\n  );\n  // Set defaults\n  return Object.freeze({\n    ...nLength(curve.n, curve.nBitLength),\n    ...curve,\n    ...{ p: curve.Fp.ORDER },\n  } as const);\n}\n", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Short Weierstrass curve. The formula is: y\u00B2 = x\u00B3 + ax + b\nimport * as mod from './modular.js';\nimport * as ut from './utils.js';\nimport { CHash, Hex, PrivKey, ensureBytes } from './utils.js';\nimport { Group, GroupConstructor, wNAF, BasicCurve, validateBasic, AffinePoint } from './curve.js';\n\nexport type { AffinePoint };\ntype HmacFnSync = (key: Uint8Array, ...messages: Uint8Array[]) => Uint8Array;\ntype EndomorphismOpts = {\n  beta: bigint;\n  splitScalar: (k: bigint) => { k1neg: boolean; k1: bigint; k2neg: boolean; k2: bigint };\n};\nexport type BasicWCurve<T> = BasicCurve<T> & {\n  // Params: a, b\n  a: T;\n  b: T;\n\n  // Optional params\n  allowedPrivateKeyLengths?: readonly number[]; // for P521\n  wrapPrivateKey?: boolean; // bls12-381 requires mod(n) instead of rejecting keys >= n\n  endo?: EndomorphismOpts; // Endomorphism options for Koblitz curves\n  // When a cofactor != 1, there can be an effective methods to:\n  // 1. Determine whether a point is torsion-free\n  isTorsionFree?: (c: ProjConstructor<T>, point: ProjPointType<T>) => boolean;\n  // 2. Clear torsion component\n  clearCofactor?: (c: ProjConstructor<T>, point: ProjPointType<T>) => ProjPointType<T>;\n};\n\ntype Entropy = Hex | true;\nexport type SignOpts = { lowS?: boolean; extraEntropy?: Entropy; prehash?: boolean };\nexport type VerOpts = { lowS?: boolean; prehash?: boolean };\n\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 of nominative types in TypeScript and interfaces only check for shape, so it's hard to create 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 */\n\n// Instance for 3d XYZ points\nexport interface ProjPointType<T> extends Group<ProjPointType<T>> {\n  readonly px: T;\n  readonly py: T;\n  readonly pz: T;\n  get x(): T;\n  get y(): T;\n  multiply(scalar: bigint): ProjPointType<T>;\n  toAffine(iz?: T): AffinePoint<T>;\n  isTorsionFree(): boolean;\n  clearCofactor(): ProjPointType<T>;\n  assertValidity(): void;\n  hasEvenY(): boolean;\n  toRawBytes(isCompressed?: boolean): Uint8Array;\n  toHex(isCompressed?: boolean): string;\n\n  multiplyUnsafe(scalar: bigint): ProjPointType<T>;\n  multiplyAndAddUnsafe(Q: ProjPointType<T>, a: bigint, b: bigint): ProjPointType<T> | undefined;\n  _setWindowSize(windowSize: number): void;\n}\n// Static methods for 3d XYZ points\nexport interface ProjConstructor<T> extends GroupConstructor<ProjPointType<T>> {\n  new (x: T, y: T, z: T): ProjPointType<T>;\n  fromAffine(p: AffinePoint<T>): ProjPointType<T>;\n  fromHex(hex: Hex): ProjPointType<T>;\n  fromPrivateKey(privateKey: PrivKey): ProjPointType<T>;\n  normalizeZ(points: ProjPointType<T>[]): ProjPointType<T>[];\n}\n\nexport type CurvePointsType<T> = BasicWCurve<T> & {\n  // Bytes\n  fromBytes?: (bytes: Uint8Array) => AffinePoint<T>;\n  toBytes?: (c: ProjConstructor<T>, point: ProjPointType<T>, isCompressed: boolean) => Uint8Array;\n};\n\nfunction validatePointOpts<T>(curve: CurvePointsType<T>) {\n  const opts = validateBasic(curve);\n  ut.validateObject(\n    opts,\n    {\n      a: 'field',\n      b: 'field',\n    },\n    {\n      allowedPrivateKeyLengths: 'array',\n      wrapPrivateKey: 'boolean',\n      isTorsionFree: 'function',\n      clearCofactor: 'function',\n      allowInfinityPoint: 'boolean',\n      fromBytes: 'function',\n      toBytes: 'function',\n    }\n  );\n  const { endo, Fp, a } = opts;\n  if (endo) {\n    if (!Fp.eql(a, Fp.ZERO)) {\n      throw new Error('Endomorphism can only be defined for Koblitz curves that have a=0');\n    }\n    if (\n      typeof endo !== 'object' ||\n      typeof endo.beta !== 'bigint' ||\n      typeof endo.splitScalar !== 'function'\n    ) {\n      throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n    }\n  }\n  return Object.freeze({ ...opts } as const);\n}\n\nexport type CurvePointsRes<T> = {\n  ProjectivePoint: ProjConstructor<T>;\n  normPrivateKeyToScalar: (key: PrivKey) => bigint;\n  weierstrassEquation: (x: T) => T;\n  isWithinCurveOrder: (num: bigint) => boolean;\n};\n\n// ASN.1 DER encoding utilities\nconst { bytesToNumberBE: b2n, hexToBytes: h2b } = ut;\nexport const DER = {\n  // asn.1 DER encoding utils\n  Err: class DERErr extends Error {\n    constructor(m = '') {\n      super(m);\n    }\n  },\n  _parseInt(data: Uint8Array): { d: bigint; l: Uint8Array } {\n    const { Err: E } = DER;\n    if (data.length < 2 || data[0] !== 0x02) throw new E('Invalid signature integer tag');\n    const len = data[1];\n    const res = data.subarray(2, len + 2);\n    if (!len || res.length !== len) throw new E('Invalid signature integer: wrong length');\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    if (res[0] & 0b10000000) throw new E('Invalid signature integer: negative');\n    if (res[0] === 0x00 && !(res[1] & 0b10000000))\n      throw new E('Invalid signature integer: unnecessary leading zero');\n    return { d: b2n(res), l: data.subarray(len + 2) }; // d is data, l is left\n  },\n  toSig(hex: string | Uint8Array): { r: bigint; s: bigint } {\n    // parse DER signature\n    const { Err: E } = DER;\n    const data = typeof hex === 'string' ? h2b(hex) : hex;\n    if (!(data instanceof Uint8Array)) throw new Error('ui8a expected');\n    let l = data.length;\n    if (l < 2 || data[0] != 0x30) throw new E('Invalid signature tag');\n    if (data[1] !== l - 2) throw new E('Invalid signature: incorrect length');\n    const { d: r, l: sBytes } = DER._parseInt(data.subarray(2));\n    const { d: s, l: rBytesLeft } = DER._parseInt(sBytes);\n    if (rBytesLeft.length) throw new E('Invalid signature: left bytes after parsing');\n    return { r, s };\n  },\n  hexFromSig(sig: { r: bigint; s: bigint }): string {\n    // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n    const slice = (s: string): string => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n    const h = (num: number | bigint) => {\n      const hex = num.toString(16);\n      return hex.length & 1 ? `0${hex}` : hex;\n    };\n    const s = slice(h(sig.s));\n    const r = slice(h(sig.r));\n    const shl = s.length / 2;\n    const rhl = r.length / 2;\n    const sl = h(shl);\n    const rl = h(rhl);\n    return `30${h(rhl + shl + 4)}02${rl}${r}02${sl}${s}`;\n  },\n};\n\n// Be friendly to bad ECMAScript parsers by not using bigint literals\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = BigInt(2), _3n = BigInt(3), _4n = BigInt(4);\n\nexport function weierstrassPoints<T>(opts: CurvePointsType<T>) {\n  const CURVE = validatePointOpts(opts);\n  const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n\n  const toBytes =\n    CURVE.toBytes ||\n    ((_c: ProjConstructor<T>, point: ProjPointType<T>, _isCompressed: boolean) => {\n      const a = point.toAffine();\n      return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n    });\n  const fromBytes =\n    CURVE.fromBytes ||\n    ((bytes: Uint8Array) => {\n      // const head = bytes[0];\n      const tail = bytes.subarray(1);\n      // if (head !== 0x04) throw new Error('Only non-compressed encoding is supported');\n      const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n      const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n      return { x, y };\n    });\n\n  /**\n   * y\u00B2 = x\u00B3 + ax + b: Short weierstrass curve formula\n   * @returns y\u00B2\n   */\n  function weierstrassEquation(x: T): T {\n    const { a, b } = CURVE;\n    const x2 = Fp.sqr(x); // x * x\n    const x3 = Fp.mul(x2, x); // x2 * x\n    return Fp.add(Fp.add(x3, Fp.mul(x, a)), b); // x3 + a * x + b\n  }\n  // Validate whether the passed curve params are valid.\n  // We check if curve equation works for generator point.\n  // `assertValidity()` won't work: `isTorsionFree()` is not available at this point in bls12-381.\n  // ProjectivePoint class has not been initialized yet.\n  if (!Fp.eql(Fp.sqr(CURVE.Gy), weierstrassEquation(CURVE.Gx)))\n    throw new Error('bad generator point: equation left != right');\n\n  // Valid group elements reside in range 1..n-1\n  function isWithinCurveOrder(num: bigint): boolean {\n    return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n  }\n  function assertGE(num: bigint) {\n    if (!isWithinCurveOrder(num)) throw new Error('Expected valid bigint: 0 < bigint < curve.n');\n  }\n  // Validates if priv key is valid and converts it to bigint.\n  // Supports options allowedPrivateKeyLengths and wrapPrivateKey.\n  function normPrivateKeyToScalar(key: PrivKey): bigint {\n    const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n    if (lengths && typeof key !== 'bigint') {\n      if (key instanceof Uint8Array) key = ut.bytesToHex(key);\n      // Normalize to hex string, pad. E.g. P521 would norm 130-132 char hex to 132-char bytes\n      if (typeof key !== 'string' || !lengths.includes(key.length)) throw new Error('Invalid key');\n      key = key.padStart(nByteLength * 2, '0');\n    }\n    let num: bigint;\n    try {\n      num =\n        typeof key === 'bigint'\n          ? key\n          : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n    } catch (error) {\n      throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n    }\n    if (wrapPrivateKey) num = mod.mod(num, n); // disabled by default, enabled for BLS\n    assertGE(num); // num in range [1..N-1]\n    return num;\n  }\n\n  const pointPrecomputes = new Map<Point, Point[]>();\n  function assertPrjPoint(other: unknown) {\n    if (!(other instanceof Point)) throw new Error('ProjectivePoint expected');\n  }\n  /**\n   * Projective Point works in 3d / projective (homogeneous) coordinates: (x, y, z) \u220B (x=x/z, y=y/z)\n   * Default Point works in 2d / affine coordinates: (x, y)\n   * We're doing calculations in projective, because its operations don't require costly inversion.\n   */\n  class Point implements ProjPointType<T> {\n    static readonly BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    static readonly ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\n\n    constructor(readonly px: T, readonly py: T, readonly pz: T) {\n      if (px == null || !Fp.isValid(px)) throw new Error('x required');\n      if (py == null || !Fp.isValid(py)) throw new Error('y required');\n      if (pz == null || !Fp.isValid(pz)) throw new Error('z required');\n    }\n\n    // Does not validate if the point is on-curve.\n    // Use fromHex instead, or call assertValidity() later.\n    static fromAffine(p: AffinePoint<T>): Point {\n      const { x, y } = p || {};\n      if (!p || !Fp.isValid(x) || !Fp.isValid(y)) throw new Error('invalid affine point');\n      if (p instanceof Point) throw new Error('projective point not allowed');\n      const is0 = (i: T) => Fp.eql(i, Fp.ZERO);\n      // fromAffine(x:0, y:0) would produce (x:0, y:0, z:1), but we need (x:0, y:1, z:0)\n      if (is0(x) && is0(y)) return Point.ZERO;\n      return new Point(x, y, Fp.ONE);\n    }\n\n    get x(): T {\n      return this.toAffine().x;\n    }\n    get y(): T {\n      return this.toAffine().y;\n    }\n\n    /**\n     * 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     */\n    static normalizeZ(points: Point[]): Point[] {\n      const toInv = Fp.invertBatch(points.map((p) => p.pz));\n      return points.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n    }\n\n    /**\n     * Converts hash string or Uint8Array to Point.\n     * @param hex short/long ECDSA hex\n     */\n    static fromHex(hex: Hex): Point {\n      const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n      P.assertValidity();\n      return P;\n    }\n\n    // Multiplies generator point by privateKey.\n    static fromPrivateKey(privateKey: PrivKey) {\n      return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n    }\n\n    // We calculate precomputes for elliptic curve point multiplication\n    // using windowed method. This specifies window size and\n    // stores precomputed values. Usually only base point would be precomputed.\n    _WINDOW_SIZE?: number;\n\n    // \"Private method\", don't use it directly\n    _setWindowSize(windowSize: number) {\n      this._WINDOW_SIZE = windowSize;\n      pointPrecomputes.delete(this);\n    }\n\n    // A point on curve is valid if it conforms to equation.\n    assertValidity(): void {\n      if (this.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 wrong representation of ZERO and is always invalid.\n        if (CURVE.allowInfinityPoint && !Fp.is0(this.py)) 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 } = this.toAffine();\n      // Check if x, y are valid field elements\n      if (!Fp.isValid(x) || !Fp.isValid(y)) throw new Error('bad point: x or y not FE');\n      const left = Fp.sqr(y); // y\u00B2\n      const right = weierstrassEquation(x); // x\u00B3 + ax + b\n      if (!Fp.eql(left, right)) throw new Error('bad point: equation left != right');\n      if (!this.isTorsionFree()) throw new Error('bad point: not in prime-order subgroup');\n    }\n    hasEvenY(): boolean {\n      const { y } = this.toAffine();\n      if (Fp.isOdd) return !Fp.isOdd(y);\n      throw new Error(\"Field doesn't support isOdd\");\n    }\n\n    /**\n     * Compare one point to another.\n     */\n    equals(other: Point): boolean {\n      assertPrjPoint(other);\n      const { px: X1, py: Y1, pz: Z1 } = this;\n      const { px: X2, py: Y2, pz: Z2 } = other;\n      const U1 = Fp.eql(Fp.mul(X1, Z2), Fp.mul(X2, Z1));\n      const U2 = Fp.eql(Fp.mul(Y1, Z2), Fp.mul(Y2, Z1));\n      return U1 && U2;\n    }\n\n    /**\n     * Flips point to one corresponding to (x, -y) in Affine coordinates.\n     */\n    negate(): Point {\n      return new Point(this.px, Fp.neg(this.py), this.pz);\n    }\n\n    // Renes-Costello-Batina exception-free doubling formula.\n    // There is 30% faster Jacobian formula, but it is not complete.\n    // https://eprint.iacr.org/2015/1060, algorithm 3\n    // Cost: 8M + 3S + 3*a + 2*b3 + 15add.\n    double() {\n      const { a, b } = CURVE;\n      const b3 = Fp.mul(b, _3n);\n      const { px: X1, py: Y1, pz: Z1 } = this;\n      let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n      let t0 = Fp.mul(X1, X1); // step 1\n      let t1 = Fp.mul(Y1, Y1);\n      let t2 = Fp.mul(Z1, Z1);\n      let t3 = Fp.mul(X1, Y1);\n      t3 = Fp.add(t3, t3); // step 5\n      Z3 = Fp.mul(X1, Z1);\n      Z3 = Fp.add(Z3, Z3);\n      X3 = Fp.mul(a, Z3);\n      Y3 = Fp.mul(b3, t2);\n      Y3 = Fp.add(X3, Y3); // step 10\n      X3 = Fp.sub(t1, Y3);\n      Y3 = Fp.add(t1, Y3);\n      Y3 = Fp.mul(X3, Y3);\n      X3 = Fp.mul(t3, X3);\n      Z3 = Fp.mul(b3, Z3); // step 15\n      t2 = Fp.mul(a, t2);\n      t3 = Fp.sub(t0, t2);\n      t3 = Fp.mul(a, t3);\n      t3 = Fp.add(t3, Z3);\n      Z3 = Fp.add(t0, t0); // step 20\n      t0 = Fp.add(Z3, t0);\n      t0 = Fp.add(t0, t2);\n      t0 = Fp.mul(t0, t3);\n      Y3 = Fp.add(Y3, t0);\n      t2 = Fp.mul(Y1, Z1); // step 25\n      t2 = Fp.add(t2, t2);\n      t0 = Fp.mul(t2, t3);\n      X3 = Fp.sub(X3, t0);\n      Z3 = Fp.mul(t2, t1);\n      Z3 = Fp.add(Z3, Z3); // step 30\n      Z3 = Fp.add(Z3, Z3);\n      return new Point(X3, Y3, Z3);\n    }\n\n    // Renes-Costello-Batina exception-free addition formula.\n    // There is 30% faster Jacobian formula, but it is not complete.\n    // https://eprint.iacr.org/2015/1060, algorithm 1\n    // Cost: 12M + 0S + 3*a + 3*b3 + 23add.\n    add(other: Point): Point {\n      assertPrjPoint(other);\n      const { px: X1, py: Y1, pz: Z1 } = this;\n      const { px: X2, py: Y2, pz: Z2 } = other;\n      let X3 = Fp.ZERO, Y3 = Fp.ZERO, Z3 = Fp.ZERO; // prettier-ignore\n      const a = CURVE.a;\n      const b3 = Fp.mul(CURVE.b, _3n);\n      let t0 = Fp.mul(X1, X2); // step 1\n      let t1 = Fp.mul(Y1, Y2);\n      let t2 = Fp.mul(Z1, Z2);\n      let t3 = Fp.add(X1, Y1);\n      let t4 = Fp.add(X2, Y2); // step 5\n      t3 = Fp.mul(t3, t4);\n      t4 = Fp.add(t0, t1);\n      t3 = Fp.sub(t3, t4);\n      t4 = Fp.add(X1, Z1);\n      let t5 = Fp.add(X2, Z2); // step 10\n      t4 = Fp.mul(t4, t5);\n      t5 = Fp.add(t0, t2);\n      t4 = Fp.sub(t4, t5);\n      t5 = Fp.add(Y1, Z1);\n      X3 = Fp.add(Y2, Z2); // step 15\n      t5 = Fp.mul(t5, X3);\n      X3 = Fp.add(t1, t2);\n      t5 = Fp.sub(t5, X3);\n      Z3 = Fp.mul(a, t4);\n      X3 = Fp.mul(b3, t2); // step 20\n      Z3 = Fp.add(X3, Z3);\n      X3 = Fp.sub(t1, Z3);\n      Z3 = Fp.add(t1, Z3);\n      Y3 = Fp.mul(X3, Z3);\n      t1 = Fp.add(t0, t0); // step 25\n      t1 = Fp.add(t1, t0);\n      t2 = Fp.mul(a, t2);\n      t4 = Fp.mul(b3, t4);\n      t1 = Fp.add(t1, t2);\n      t2 = Fp.sub(t0, t2); // step 30\n      t2 = Fp.mul(a, t2);\n      t4 = Fp.add(t4, t2);\n      t0 = Fp.mul(t1, t4);\n      Y3 = Fp.add(Y3, t0);\n      t0 = Fp.mul(t5, t4); // step 35\n      X3 = Fp.mul(t3, X3);\n      X3 = Fp.sub(X3, t0);\n      t0 = Fp.mul(t3, t1);\n      Z3 = Fp.mul(t5, Z3);\n      Z3 = Fp.add(Z3, t0); // step 40\n      return new Point(X3, Y3, Z3);\n    }\n\n    subtract(other: Point) {\n      return this.add(other.negate());\n    }\n\n    private is0() {\n      return this.equals(Point.ZERO);\n    }\n    private wNAF(n: bigint): { p: Point; f: Point } {\n      return wnaf.wNAFCached(this, pointPrecomputes, n, (comp: Point[]) => {\n        const toInv = Fp.invertBatch(comp.map((p) => p.pz));\n        return comp.map((p, i) => p.toAffine(toInv[i])).map(Point.fromAffine);\n      });\n    }\n\n    /**\n     * Non-constant-time multiplication. Uses double-and-add algorithm.\n     * It's faster, but should only be used when you don't care about\n     * an exposed private key e.g. sig verification, which works over *public* keys.\n     */\n    multiplyUnsafe(n: bigint): Point {\n      const I = Point.ZERO;\n      if (n === _0n) return I;\n      assertGE(n); // Will throw on 0\n      if (n === _1n) return this;\n      const { endo } = CURVE;\n      if (!endo) return wnaf.unsafeLadder(this, n);\n\n      // Apply endomorphism\n      let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n      let k1p = I;\n      let k2p = I;\n      let d: Point = this;\n      while (k1 > _0n || k2 > _0n) {\n        if (k1 & _1n) k1p = k1p.add(d);\n        if (k2 & _1n) k2p = k2p.add(d);\n        d = d.double();\n        k1 >>= _1n;\n        k2 >>= _1n;\n      }\n      if (k1neg) k1p = k1p.negate();\n      if (k2neg) k2p = k2p.negate();\n      k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n      return k1p.add(k2p);\n    }\n\n    /**\n     * Constant time multiplication.\n     * Uses wNAF method. Windowed method may be 10% faster,\n     * but takes 2x longer to generate and consumes 2x memory.\n     * Uses precomputes when available.\n     * Uses endomorphism for Koblitz curves.\n     * @param scalar by which the point would be multiplied\n     * @returns New point\n     */\n    multiply(scalar: bigint): Point {\n      assertGE(scalar);\n      let n = scalar;\n      let point: Point, fake: Point; // Fake point is used to const-time mult\n      const { endo } = CURVE;\n      if (endo) {\n        const { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n        let { p: k1p, f: f1p } = this.wNAF(k1);\n        let { p: k2p, f: f2p } = this.wNAF(k2);\n        k1p = wnaf.constTimeNegate(k1neg, k1p);\n        k2p = wnaf.constTimeNegate(k2neg, k2p);\n        k2p = new Point(Fp.mul(k2p.px, endo.beta), k2p.py, k2p.pz);\n        point = k1p.add(k2p);\n        fake = f1p.add(f2p);\n      } else {\n        const { p, f } = this.wNAF(n);\n        point = p;\n        fake = f;\n      }\n      // Normalize `z` for both points, but return only real one\n      return Point.normalizeZ([point, fake])[0];\n    }\n\n    /**\n     * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.\n     * Not using Strauss-Shamir trick: precomputation tables are faster.\n     * The trick could be useful if both P and Q are not G (not in our case).\n     * @returns non-zero affine point\n     */\n    multiplyAndAddUnsafe(Q: Point, a: bigint, b: bigint): Point | undefined {\n      const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n      const mul = (\n        P: Point,\n        a: bigint // Select faster multiply() method\n      ) => (a === _0n || a === _1n || !P.equals(G) ? P.multiplyUnsafe(a) : P.multiply(a));\n      const sum = mul(this, a).add(mul(Q, b));\n      return sum.is0() ? undefined : sum;\n    }\n\n    // Converts Projective point to affine (x, y) coordinates.\n    // Can accept precomputed Z^-1 - for example, from invertBatch.\n    // (x, y, z) \u220B (x=x/z, y=y/z)\n    toAffine(iz?: T): AffinePoint<T> {\n      const { px: x, py: y, pz: z } = this;\n      const is0 = this.is0();\n      // If invZ was 0, we return zero point. However we still want to execute\n      // all operations, so we replace invZ with a random number, 1.\n      if (iz == null) iz = is0 ? Fp.ONE : Fp.inv(z);\n      const ax = Fp.mul(x, iz);\n      const ay = Fp.mul(y, iz);\n      const zz = Fp.mul(z, iz);\n      if (is0) return { x: Fp.ZERO, y: Fp.ZERO };\n      if (!Fp.eql(zz, Fp.ONE)) throw new Error('invZ was invalid');\n      return { x: ax, y: ay };\n    }\n    isTorsionFree(): boolean {\n      const { h: cofactor, isTorsionFree } = CURVE;\n      if (cofactor === _1n) return true; // No subgroups, always torsion-free\n      if (isTorsionFree) return isTorsionFree(Point, this);\n      throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n    }\n    clearCofactor(): Point {\n      const { h: cofactor, clearCofactor } = CURVE;\n      if (cofactor === _1n) return this; // Fast-path\n      if (clearCofactor) return clearCofactor(Point, this) as Point;\n      return this.multiplyUnsafe(CURVE.h);\n    }\n\n    toRawBytes(isCompressed = true): Uint8Array {\n      this.assertValidity();\n      return toBytes(Point, this, isCompressed);\n    }\n\n    toHex(isCompressed = true): string {\n      return ut.bytesToHex(this.toRawBytes(isCompressed));\n    }\n  }\n  const _bits = CURVE.nBitLength;\n  const wnaf = wNAF(Point, CURVE.endo ? Math.ceil(_bits / 2) : _bits);\n  // Validate if generator point is on curve\n  return {\n    CURVE,\n    ProjectivePoint: Point as ProjConstructor<T>,\n    normPrivateKeyToScalar,\n    weierstrassEquation,\n    isWithinCurveOrder,\n  };\n}\n\n// Instance\nexport interface SignatureType {\n  readonly r: bigint;\n  readonly s: bigint;\n  readonly recovery?: number;\n  assertValidity(): void;\n  addRecoveryBit(recovery: number): RecoveredSignatureType;\n  hasHighS(): boolean;\n  normalizeS(): SignatureType;\n  recoverPublicKey(msgHash: Hex): ProjPointType<bigint>;\n  toCompactRawBytes(): Uint8Array;\n  toCompactHex(): string;\n  // DER-encoded\n  toDERRawBytes(isCompressed?: boolean): Uint8Array;\n  toDERHex(isCompressed?: boolean): string;\n}\nexport type RecoveredSignatureType = SignatureType & {\n  readonly recovery: number;\n};\n// Static methods\nexport type SignatureConstructor = {\n  new (r: bigint, s: bigint): SignatureType;\n  fromCompact(hex: Hex): SignatureType;\n  fromDER(hex: Hex): SignatureType;\n};\ntype SignatureLike = { r: bigint; s: bigint };\n\nexport type PubKey = Hex | ProjPointType<bigint>;\n\nexport type CurveType = BasicWCurve<bigint> & {\n  hash: CHash; // CHash not FHash because we need outputLen for DRBG\n  hmac: HmacFnSync;\n  randomBytes: (bytesLength?: number) => Uint8Array;\n  lowS?: boolean;\n  bits2int?: (bytes: Uint8Array) => bigint;\n  bits2int_modN?: (bytes: Uint8Array) => bigint;\n};\n\nfunction validateOpts(curve: CurveType) {\n  const opts = validateBasic(curve);\n  ut.validateObject(\n    opts,\n    {\n      hash: 'hash',\n      hmac: 'function',\n      randomBytes: 'function',\n    },\n    {\n      bits2int: 'function',\n      bits2int_modN: 'function',\n      lowS: 'boolean',\n    }\n  );\n  return Object.freeze({ lowS: true, ...opts } as const);\n}\n\nexport type CurveFn = {\n  CURVE: ReturnType<typeof validateOpts>;\n  getPublicKey: (privateKey: PrivKey, isCompressed?: boolean) => Uint8Array;\n  getSharedSecret: (privateA: PrivKey, publicB: Hex, isCompressed?: boolean) => Uint8Array;\n  sign: (msgHash: Hex, privKey: PrivKey, opts?: SignOpts) => RecoveredSignatureType;\n  verify: (signature: Hex | SignatureLike, msgHash: Hex, publicKey: Hex, opts?: VerOpts) => boolean;\n  ProjectivePoint: ProjConstructor<bigint>;\n  Signature: SignatureConstructor;\n  utils: {\n    normPrivateKeyToScalar: (key: PrivKey) => bigint;\n    isValidPrivateKey(privateKey: PrivKey): boolean;\n    randomPrivateKey: () => Uint8Array;\n    precompute: (windowSize?: number, point?: ProjPointType<bigint>) => ProjPointType<bigint>;\n  };\n};\n\nexport function weierstrass(curveDef: CurveType): CurveFn {\n  const CURVE = validateOpts(curveDef) as ReturnType<typeof validateOpts>;\n  const { Fp, n: CURVE_ORDER } = CURVE;\n  const compressedLen = Fp.BYTES + 1; // e.g. 33 for 32\n  const uncompressedLen = 2 * Fp.BYTES + 1; // e.g. 65 for 32\n\n  function isValidFieldElement(num: bigint): boolean {\n    return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n  }\n  function modN(a: bigint) {\n    return mod.mod(a, CURVE_ORDER);\n  }\n  function invN(a: bigint) {\n    return mod.invert(a, CURVE_ORDER);\n  }\n\n  const {\n    ProjectivePoint: Point,\n    normPrivateKeyToScalar,\n    weierstrassEquation,\n    isWithinCurveOrder,\n  } = weierstrassPoints({\n    ...CURVE,\n    toBytes(_c, point, isCompressed: boolean): Uint8Array {\n      const a = point.toAffine();\n      const x = Fp.toBytes(a.x);\n      const cat = ut.concatBytes;\n      if (isCompressed) {\n        return cat(Uint8Array.from([point.hasEvenY() ? 0x02 : 0x03]), x);\n      } else {\n        return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n      }\n    },\n    fromBytes(bytes: Uint8Array) {\n      const len = bytes.length;\n      const head = bytes[0];\n      const tail = bytes.subarray(1);\n      // this.assertValidity() is done inside of fromHex\n      if (len === compressedLen && (head === 0x02 || head === 0x03)) {\n        const x = ut.bytesToNumberBE(tail);\n        if (!isValidFieldElement(x)) throw new Error('Point is not on curve');\n        const y2 = weierstrassEquation(x); // y\u00B2 = x\u00B3 + ax + b\n        let y = Fp.sqrt(y2); // y = y\u00B2 ^ (p+1)/4\n        const isYOdd = (y & _1n) === _1n;\n        // ECDSA\n        const isHeadOdd = (head & 1) === 1;\n        if (isHeadOdd !== isYOdd) y = Fp.neg(y);\n        return { x, y };\n      } else if (len === uncompressedLen && head === 0x04) {\n        const x = Fp.fromBytes(tail.subarray(0, Fp.BYTES));\n        const y = Fp.fromBytes(tail.subarray(Fp.BYTES, 2 * Fp.BYTES));\n        return { x, y };\n      } else {\n        throw new Error(\n          `Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`\n        );\n      }\n    },\n  });\n  const numToNByteStr = (num: bigint): string =>\n    ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n\n  function isBiggerThanHalfOrder(number: bigint) {\n    const HALF = CURVE_ORDER >> _1n;\n    return number > HALF;\n  }\n\n  function normalizeS(s: bigint) {\n    return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n  }\n  // slice bytes num\n  const slcNum = (b: Uint8Array, from: number, to: number) => ut.bytesToNumberBE(b.slice(from, to));\n\n  /**\n   * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n   */\n  class Signature implements SignatureType {\n    constructor(readonly r: bigint, readonly s: bigint, readonly recovery?: number) {\n      this.assertValidity();\n    }\n\n    // pair (bytes of r, bytes of s)\n    static fromCompact(hex: Hex) {\n      const l = CURVE.nByteLength;\n      hex = ensureBytes('compactSignature', hex, l * 2);\n      return new Signature(slcNum(hex, 0, l), slcNum(hex, l, 2 * l));\n    }\n\n    // DER encoded ECDSA signature\n    // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script\n    static fromDER(hex: Hex) {\n      const { r, s } = DER.toSig(ensureBytes('DER', hex));\n      return new Signature(r, s);\n    }\n\n    assertValidity(): void {\n      // can use assertGE here\n      if (!isWithinCurveOrder(this.r)) throw new Error('r must be 0 < r < CURVE.n');\n      if (!isWithinCurveOrder(this.s)) throw new Error('s must be 0 < s < CURVE.n');\n    }\n\n    addRecoveryBit(recovery: number): RecoveredSignature {\n      return new Signature(this.r, this.s, recovery) as RecoveredSignature;\n    }\n\n    recoverPublicKey(msgHash: Hex): typeof Point.BASE {\n      const { r, s, recovery: rec } = this;\n      const h = bits2int_modN(ensureBytes('msgHash', msgHash)); // Truncate hash\n      if (rec == null || ![0, 1, 2, 3].includes(rec)) throw new Error('recovery id invalid');\n      const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n      if (radj >= Fp.ORDER) throw new Error('recovery id 2 or 3 invalid');\n      const prefix = (rec & 1) === 0 ? '02' : '03';\n      const R = Point.fromHex(prefix + numToNByteStr(radj));\n      const ir = invN(radj); // r^-1\n      const u1 = modN(-h * ir); // -hr^-1\n      const u2 = modN(s * ir); // sr^-1\n      const Q = Point.BASE.multiplyAndAddUnsafe(R, u1, u2); // (sr^-1)R-(hr^-1)G = -(hr^-1)G + (sr^-1)\n      if (!Q) throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n      Q.assertValidity();\n      return Q;\n    }\n\n    // Signatures should be low-s, to prevent malleability.\n    hasHighS(): boolean {\n      return isBiggerThanHalfOrder(this.s);\n    }\n\n    normalizeS() {\n      return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\n    }\n\n    // DER-encoded\n    toDERRawBytes() {\n      return ut.hexToBytes(this.toDERHex());\n    }\n    toDERHex() {\n      return DER.hexFromSig({ r: this.r, s: this.s });\n    }\n\n    // padded bytes of r, then padded bytes of s\n    toCompactRawBytes() {\n      return ut.hexToBytes(this.toCompactHex());\n    }\n    toCompactHex() {\n      return numToNByteStr(this.r) + numToNByteStr(this.s);\n    }\n  }\n  type RecoveredSignature = Signature & { recovery: number };\n\n  const utils = {\n    isValidPrivateKey(privateKey: PrivKey) {\n      try {\n        normPrivateKeyToScalar(privateKey);\n        return true;\n      } catch (error) {\n        return false;\n      }\n    },\n    normPrivateKeyToScalar: normPrivateKeyToScalar,\n\n    /**\n     * Produces cryptographically secure private key from random of size\n     * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n     */\n    randomPrivateKey: (): Uint8Array => {\n      const length = mod.getMinHashLength(CURVE.n);\n      return mod.mapHashToField(CURVE.randomBytes(length), CURVE.n);\n    },\n\n    /**\n     * Creates precompute table for an arbitrary EC point. Makes point \"cached\".\n     * Allows to massively speed-up `point.multiply(scalar)`.\n     * @returns cached point\n     * @example\n     * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));\n     * fast.multiply(privKey); // much faster ECDH now\n     */\n    precompute(windowSize = 8, point = Point.BASE): typeof Point.BASE {\n      point._setWindowSize(windowSize);\n      point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n      return point;\n    },\n  };\n\n  /**\n   * Computes public key for a private key. Checks for validity of the private key.\n   * @param privateKey private 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(privateKey: PrivKey, isCompressed = true): Uint8Array {\n    return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\n  }\n\n  /**\n   * Quick and dirty check for item being public key. Does not validate hex, or being on-curve.\n   */\n  function isProbPub(item: PrivKey | PubKey): boolean {\n    const arr = item instanceof Uint8Array;\n    const str = typeof item === 'string';\n    const len = (arr || str) && (item as Hex).length;\n    if (arr) return len === compressedLen || len === uncompressedLen;\n    if (str) return len === 2 * compressedLen || len === 2 * uncompressedLen;\n    if (item instanceof Point) return true;\n    return false;\n  }\n\n  /**\n   * ECDH (Elliptic Curve Diffie Hellman).\n   * Computes shared public key from private key and public key.\n   * Checks: 1) private key validity 2) shared key is on-curve.\n   * Does NOT hash the result.\n   * @param privateA private key\n   * @param publicB different public key\n   * @param isCompressed whether to return compact (default), or full key\n   * @returns shared public key\n   */\n  function getSharedSecret(privateA: PrivKey, publicB: Hex, isCompressed = true): Uint8Array {\n    if (isProbPub(privateA)) throw new Error('first arg must be private key');\n    if (!isProbPub(publicB)) throw new Error('second arg must be public key');\n    const b = Point.fromHex(publicB); // check for being on-curve\n    return b.multiply(normPrivateKeyToScalar(privateA)).toRawBytes(isCompressed);\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 =\n    CURVE.bits2int ||\n    function (bytes: Uint8Array): bigint {\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 = ut.bytesToNumberBE(bytes); // check for == u8 done here\n      const delta = bytes.length * 8 - CURVE.nBitLength; // truncate to nBitLength leftmost bits\n      return delta > 0 ? num >> BigInt(delta) : num;\n    };\n  const bits2int_modN =\n    CURVE.bits2int_modN ||\n    function (bytes: Uint8Array): bigint {\n      return modN(bits2int(bytes)); // can't use bytesToNumberBE here\n    };\n  // NOTE: pads output with zero as per spec\n  const ORDER_MASK = ut.bitMask(CURVE.nBitLength);\n  /**\n   * Converts to bytes. Checks if num in `[0..ORDER_MASK-1]` e.g.: `[0..2^256-1]`.\n   */\n  function int2octets(num: bigint): Uint8Array {\n    if (typeof num !== 'bigint') throw new Error('bigint expected');\n    if (!(_0n <= num && num < ORDER_MASK))\n      throw new Error(`bigint expected < 2^${CURVE.nBitLength}`);\n    // works with order, can have different size than numToField!\n    return ut.numberToBytesBE(num, CURVE.nByteLength);\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  // NOTE: we cannot assume here that msgHash has same amount of bytes as curve order, this will be wrong at least for P521.\n  // Also it can be bigger for P224 + SHA256\n  function prepSig(msgHash: Hex, privateKey: PrivKey, opts = defaultSigOpts) {\n    if (['recovered', 'canonical'].some((k) => k in opts))\n      throw new Error('sign() legacy options not supported');\n    const { hash, randomBytes } = CURVE;\n    let { lowS, prehash, extraEntropy: ent } = opts; // generates low-s sigs by default\n    if (lowS == null) lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n    msgHash = ensureBytes('msgHash', msgHash);\n    if (prehash) msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\n\n    // We can't later call bits2octets, since nested bits2int is broken for curves\n    // with nBitLength % 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(msgHash);\n    const d = normPrivateKeyToScalar(privateKey); // validate private key, convert to bigint\n    const seedArgs = [int2octets(d), int2octets(h1int)];\n    // extraEntropy. RFC6979 3.6: additional k' (optional).\n    if (ent != null) {\n      // K = HMAC_K(V || 0x00 || int2octets(x) || bits2octets(h1) || k')\n      const e = ent === true ? randomBytes(Fp.BYTES) : ent; // generate random bytes OR pass as-is\n      seedArgs.push(ensureBytes('extraEntropy', e)); // check for being bytes\n    }\n    const seed = ut.concatBytes(...seedArgs); // Step D of RFC6979 3.2\n    const m = h1int; // NOTE: no need to call bits2int second time here, it is inside truncateHash!\n    // Converts signature params into point w r/s, checks result for validity.\n    function k2sig(kBytes: Uint8Array): RecoveredSignature | undefined {\n      // RFC 6979 Section 3.2, step 3: k = bits2int(T)\n      const k = bits2int(kBytes); // Cannot use fields methods, since it is group element\n      if (!isWithinCurveOrder(k)) return; // Important: all mod() calls here must be done over N\n      const ik = invN(k); // k^-1 mod n\n      const q = Point.BASE.multiply(k).toAffine(); // q = Gk\n      const r = modN(q.x); // r = q.x mod n\n      if (r === _0n) return;\n      // Can use scalar blinding b^-1(bm + bdr) where b \u2208 [1,q\u22121] according to\n      // https://tches.iacr.org/index.php/TCHES/article/view/7337/6509. We've decided against it:\n      // a) dependency on CSPRNG b) 15% slowdown c) doesn't really help since bigints are not CT\n      const s = modN(ik * modN(m + r * d)); // Not using blinding here\n      if (s === _0n) return;\n      let recovery = (q.x === r ? 0 : 2) | Number(q.y & _1n); // recovery bit (2 or 3, when q.x > n)\n      let normS = s;\n      if (lowS && isBiggerThanHalfOrder(s)) {\n        normS = normalizeS(s); // if lowS was passed, ensure s is always\n        recovery ^= 1; // // in the bottom half of N\n      }\n      return new Signature(r, normS, recovery) as RecoveredSignature; // use normS, not s\n    }\n    return { seed, k2sig };\n  }\n  const defaultSigOpts: SignOpts = { lowS: CURVE.lowS, prehash: false };\n  const defaultVerOpts: VerOpts = { lowS: CURVE.lowS, prehash: false };\n\n  /**\n   * Signs message hash with a private key.\n   * ```\n   * sign(m, d, k) where\n   *   (x, y) = G \u00D7 k\n   *   r = x mod n\n   *   s = (m + dr)/k mod n\n   * ```\n   * @param msgHash NOT message. msg needs to be hashed to `msgHash`, or use `prehash`.\n   * @param privKey private key\n   * @param opts lowS for non-malleable sigs. extraEntropy for mixing randomness into k. prehash will hash first arg.\n   * @returns signature with recovery param\n   */\n  function sign(msgHash: Hex, privKey: PrivKey, opts = defaultSigOpts): RecoveredSignature {\n    const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n    const C = CURVE;\n    const drbg = ut.createHmacDrbg<RecoveredSignature>(C.hash.outputLen, C.nByteLength, C.hmac);\n    return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n  }\n\n  // Enable precomputes. Slows down first publicKey computation by 20ms.\n  Point.BASE._setWindowSize(8);\n  // utils.precompute(8, ProjectivePoint.BASE)\n\n  /**\n   * Verifies a signature against message hash and public key.\n   * Rejects lowS signatures by default: to override,\n   * specify option `{lowS: false}`. Implements section 4.1.4 from https://www.secg.org/sec1-v2.pdf:\n   *\n   * ```\n   * verify(r, s, h, P) where\n   *   U1 = hs^-1 mod n\n   *   U2 = rs^-1 mod n\n   *   R = U1\u22C5G - U2\u22C5P\n   *   mod(R.x, n) == r\n   * ```\n   */\n  function verify(\n    signature: Hex | SignatureLike,\n    msgHash: Hex,\n    publicKey: Hex,\n    opts = defaultVerOpts\n  ): boolean {\n    const sg = signature;\n    msgHash = ensureBytes('msgHash', msgHash);\n    publicKey = ensureBytes('publicKey', publicKey);\n    if ('strict' in opts) throw new Error('options.strict was renamed to lowS');\n    const { lowS, prehash } = opts;\n\n    let _sig: Signature | undefined = undefined;\n    let P: ProjPointType<bigint>;\n    try {\n      if (typeof sg === 'string' || sg instanceof Uint8Array) {\n        // Signature can be represented in 2 ways: compact (2*nByteLength) & DER (variable-length).\n        // Since DER can also be 2*nByteLength bytes, we check for it first.\n        try {\n          _sig = Signature.fromDER(sg);\n        } catch (derError) {\n          if (!(derError instanceof DER.Err)) throw derError;\n          _sig = Signature.fromCompact(sg);\n        }\n      } else if (typeof sg === 'object' && typeof sg.r === 'bigint' && typeof sg.s === 'bigint') {\n        const { r, s } = sg;\n        _sig = new Signature(r, s);\n      } else {\n        throw new Error('PARSE');\n      }\n      P = Point.fromHex(publicKey);\n    } catch (error) {\n      if ((error as Error).message === 'PARSE')\n        throw new Error(`signature must be Signature instance, Uint8Array or hex string`);\n      return false;\n    }\n    if (lowS && _sig.hasHighS()) return false;\n    if (prehash) msgHash = CURVE.hash(msgHash);\n    const { r, s } = _sig;\n    const h = bits2int_modN(msgHash); // Cannot use fields methods, since it is group element\n    const is = invN(s); // s^-1\n    const u1 = modN(h * is); // u1 = hs^-1 mod n\n    const u2 = modN(r * is); // u2 = rs^-1 mod n\n    const R = Point.BASE.multiplyAndAddUnsafe(P, u1, u2)?.toAffine(); // R = u1\u22C5G + u2\u22C5P\n    if (!R) return false;\n    const v = modN(R.x);\n    return v === r;\n  }\n  return {\n    CURVE,\n    getPublicKey,\n    getSharedSecret,\n    sign,\n    verify,\n    ProjectivePoint: Point,\n    Signature,\n    utils,\n  };\n}\n\n/**\n * Implementation of the Shallue and van de Woestijne method for any weierstrass curve.\n * TODO: check if there is a way to merge this with uvRatio in Edwards; move to modular.\n * b = True and y = sqrt(u / v) if (u / v) is square in F, and\n * b = False and y = sqrt(Z * (u / v)) otherwise.\n * @param Fp\n * @param Z\n * @returns\n */\nexport function SWUFpSqrtRatio<T>(Fp: mod.IField<T>, Z: T) {\n  // Generic implementation\n  const q = Fp.ORDER;\n  let l = _0n;\n  for (let o = q - _1n; o % _2n === _0n; o /= _2n) l += _1n;\n  const c1 = l; // 1. c1, the largest integer such that 2^c1 divides q - 1.\n  // We need 2n ** c1 and 2n ** (c1-1). We can't use **; but we can use <<.\n  // 2n ** c1 == 2n << (c1-1)\n  const _2n_pow_c1_1 = _2n << (c1 - _1n - _1n);\n  const _2n_pow_c1 = _2n_pow_c1_1 * _2n;\n  const c2 = (q - _1n) / _2n_pow_c1; // 2. c2 = (q - 1) / (2^c1)  # Integer arithmetic\n  const c3 = (c2 - _1n) / _2n; // 3. c3 = (c2 - 1) / 2            # Integer arithmetic\n  const c4 = _2n_pow_c1 - _1n; // 4. c4 = 2^c1 - 1                # Integer arithmetic\n  const c5 = _2n_pow_c1_1; // 5. c5 = 2^(c1 - 1)                  # Integer arithmetic\n  const c6 = Fp.pow(Z, c2); // 6. c6 = Z^c2\n  const c7 = Fp.pow(Z, (c2 + _1n) / _2n); // 7. c7 = Z^((c2 + 1) / 2)\n  let sqrtRatio = (u: T, v: T): { isValid: boolean; value: T } => {\n    let tv1 = c6; // 1. tv1 = c6\n    let tv2 = Fp.pow(v, c4); // 2. tv2 = v^c4\n    let tv3 = Fp.sqr(tv2); // 3. tv3 = tv2^2\n    tv3 = Fp.mul(tv3, v); // 4. tv3 = tv3 * v\n    let tv5 = Fp.mul(u, tv3); // 5. tv5 = u * tv3\n    tv5 = Fp.pow(tv5, c3); // 6. tv5 = tv5^c3\n    tv5 = Fp.mul(tv5, tv2); // 7. tv5 = tv5 * tv2\n    tv2 = Fp.mul(tv5, v); // 8. tv2 = tv5 * v\n    tv3 = Fp.mul(tv5, u); // 9. tv3 = tv5 * u\n    let tv4 = Fp.mul(tv3, tv2); // 10. tv4 = tv3 * tv2\n    tv5 = Fp.pow(tv4, c5); // 11. tv5 = tv4^c5\n    let isQR = Fp.eql(tv5, Fp.ONE); // 12. isQR = tv5 == 1\n    tv2 = Fp.mul(tv3, c7); // 13. tv2 = tv3 * c7\n    tv5 = Fp.mul(tv4, tv1); // 14. tv5 = tv4 * tv1\n    tv3 = Fp.cmov(tv2, tv3, isQR); // 15. tv3 = CMOV(tv2, tv3, isQR)\n    tv4 = Fp.cmov(tv5, tv4, isQR); // 16. tv4 = CMOV(tv5, tv4, isQR)\n    // 17. for i in (c1, c1 - 1, ..., 2):\n    for (let i = c1; i > _1n; i--) {\n      let tv5 = i - _2n; // 18.    tv5 = i - 2\n      tv5 = _2n << (tv5 - _1n); // 19.    tv5 = 2^tv5\n      let tvv5 = Fp.pow(tv4, tv5); // 20.    tv5 = tv4^tv5\n      const e1 = Fp.eql(tvv5, Fp.ONE); // 21.    e1 = tv5 == 1\n      tv2 = Fp.mul(tv3, tv1); // 22.    tv2 = tv3 * tv1\n      tv1 = Fp.mul(tv1, tv1); // 23.    tv1 = tv1 * tv1\n      tvv5 = Fp.mul(tv4, tv1); // 24.    tv5 = tv4 * tv1\n      tv3 = Fp.cmov(tv2, tv3, e1); // 25.    tv3 = CMOV(tv2, tv3, e1)\n      tv4 = Fp.cmov(tvv5, tv4, e1); // 26.    tv4 = CMOV(tv5, tv4, e1)\n    }\n    return { isValid: isQR, value: tv3 };\n  };\n  if (Fp.ORDER % _4n === _3n) {\n    // sqrt_ratio_3mod4(u, v)\n    const c1 = (Fp.ORDER - _3n) / _4n; // 1. c1 = (q - 3) / 4     # Integer arithmetic\n    const c2 = Fp.sqrt(Fp.neg(Z)); // 2. c2 = sqrt(-Z)\n    sqrtRatio = (u: T, v: T) => {\n      let tv1 = Fp.sqr(v); // 1. tv1 = v^2\n      const tv2 = Fp.mul(u, v); // 2. tv2 = u * v\n      tv1 = Fp.mul(tv1, tv2); // 3. tv1 = tv1 * tv2\n      let y1 = Fp.pow(tv1, c1); // 4. y1 = tv1^c1\n      y1 = Fp.mul(y1, tv2); // 5. y1 = y1 * tv2\n      const y2 = Fp.mul(y1, c2); // 6. y2 = y1 * c2\n      const tv3 = Fp.mul(Fp.sqr(y1), v); // 7. tv3 = y1^2; 8. tv3 = tv3 * v\n      const isQR = Fp.eql(tv3, u); // 9. isQR = tv3 == u\n      let y = Fp.cmov(y2, y1, isQR); // 10. y = CMOV(y2, y1, isQR)\n      return { isValid: isQR, value: y }; // 11. return (isQR, y) isQR ? y : y*c2\n    };\n  }\n  // No curves uses that\n  // if (Fp.ORDER % _8n === _5n) // sqrt_ratio_5mod8\n  return sqrtRatio;\n}\n/**\n * Simplified Shallue-van de Woestijne-Ulas Method\n * https://www.rfc-editor.org/rfc/rfc9380#section-6.6.2\n */\nexport function mapToCurveSimpleSWU<T>(\n  Fp: mod.IField<T>,\n  opts: {\n    A: T;\n    B: T;\n    Z: T;\n  }\n) {\n  mod.validateField(Fp);\n  if (!Fp.isValid(opts.A) || !Fp.isValid(opts.B) || !Fp.isValid(opts.Z))\n    throw new Error('mapToCurveSimpleSWU: invalid opts');\n  const sqrtRatio = SWUFpSqrtRatio(Fp, opts.Z);\n  if (!Fp.isOdd) throw new Error('Fp.isOdd is not implemented!');\n  // Input: u, an element of F.\n  // Output: (x, y), a point on E.\n  return (u: T): { x: T; y: T } => {\n    // prettier-ignore\n    let tv1, tv2, tv3, tv4, tv5, tv6, x, y;\n    tv1 = Fp.sqr(u); // 1.  tv1 = u^2\n    tv1 = Fp.mul(tv1, opts.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, opts.B); // 6.  tv3 = B * tv3\n    tv4 = Fp.cmov(opts.Z, Fp.neg(tv2), !Fp.eql(tv2, Fp.ZERO)); // 7.  tv4 = CMOV(Z, -tv2, tv2 != 0)\n    tv4 = Fp.mul(tv4, opts.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, opts.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, opts.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    x = Fp.div(x, tv4); // 25.   x = x / tv4\n    return { x, y };\n  };\n}\n", "import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, CHash, Input, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC<T extends Hash<T>> extends Hash<HMAC<T>> {\n  oHash: T;\n  iHash: T;\n  blockLen: number;\n  outputLen: number;\n  private finished = false;\n  private destroyed = false;\n\n  constructor(hash: CHash, _key: Input) {\n    super();\n    assertHash(hash);\n    const key = toBytes(_key);\n    this.iHash = hash.create() as T;\n    if (typeof this.iHash.update !== 'function')\n      throw new Error('Expected instance of class which extends utils.Hash');\n    this.blockLen = this.iHash.blockLen;\n    this.outputLen = this.iHash.outputLen;\n    const blockLen = this.blockLen;\n    const pad = new Uint8Array(blockLen);\n    // blockLen can be bigger than outputLen\n    pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n    for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36;\n    this.iHash.update(pad);\n    // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n    this.oHash = hash.create() as T;\n    // Undo internal XOR && apply outer XOR\n    for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n    this.oHash.update(pad);\n    pad.fill(0);\n  }\n  update(buf: Input) {\n    assertExists(this);\n    this.iHash.update(buf);\n    return this;\n  }\n  digestInto(out: Uint8Array) {\n    assertExists(this);\n    assertBytes(out, this.outputLen);\n    this.finished = true;\n    this.iHash.digestInto(out);\n    this.oHash.update(out);\n    this.oHash.digestInto(out);\n    this.destroy();\n  }\n  digest() {\n    const out = new Uint8Array(this.oHash.outputLen);\n    this.digestInto(out);\n    return out;\n  }\n  _cloneInto(to?: HMAC<T>): HMAC<T> {\n    // Create new instance without calling constructor since key already in state and we don't know it.\n    to ||= Object.create(Object.getPrototypeOf(this), {});\n    const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n    to = to as this;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    to.blockLen = blockLen;\n    to.outputLen = outputLen;\n    to.oHash = oHash._cloneInto(to.oHash);\n    to.iHash = iHash._cloneInto(to.iHash);\n    return to;\n  }\n  destroy() {\n    this.destroyed = true;\n    this.oHash.destroy();\n    this.iHash.destroy();\n  }\n}\n\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash: CHash, key: Input, message: Input): Uint8Array =>\n  new HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Input) => new HMAC<any>(hash, key);\n", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { hmac } from '@noble/hashes/hmac';\nimport { concatBytes, randomBytes } from '@noble/hashes/utils';\nimport { weierstrass, CurveType } from './abstract/weierstrass.js';\nimport { CHash } from './abstract/utils.js';\n\n// connects noble-curves to noble-hashes\nexport function getHash(hash: CHash) {\n  return {\n    hash,\n    hmac: (key: Uint8Array, ...msgs: Uint8Array[]) => hmac(hash, key, concatBytes(...msgs)),\n    randomBytes,\n  };\n}\n// Same API as @noble/hashes, with ability to create curve with custom hash\ntype CurveDef = Readonly<Omit<CurveType, 'hash' | 'hmac' | 'randomBytes'>>;\nexport function createCurve(curveDef: CurveDef, defHash: CHash) {\n  const create = (hash: CHash) => weierstrass({ ...curveDef, ...getHash(hash) });\n  return Object.freeze({ ...create(defHash), create });\n}\n", "/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha256';\nimport { randomBytes } from '@noble/hashes/utils';\nimport { Field, mod, pow2 } from './abstract/modular.js';\nimport { ProjPointType as PointType, mapToCurveSimpleSWU } from './abstract/weierstrass.js';\nimport type { Hex, PrivKey } from './abstract/utils.js';\nimport { bytesToNumberBE, concatBytes, ensureBytes, numberToBytesBE } from './abstract/utils.js';\nimport { createHasher, isogenyMap } from './abstract/hash-to-curve.js';\nimport { createCurve } from './_shortw_utils.js';\n\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a: bigint, b: bigint) => (a + b / _2n) / b;\n\n/**\n * \u221An = n^((p+1)/4) for fields p = 3 mod 4. We unwrap the loop and multiply bit-by-bit.\n * (P+1n/4n).toString(2) would produce bits [223x 1, 0, 22x 1, 4x 0, 11, 00]\n */\nfunction sqrtMod(y: bigint): bigint {\n  const P = secp256k1P;\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 (!Fp.eql(Fp.sqr(root), y)) throw new Error('Cannot find square root');\n  return root;\n}\n\nconst Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\n\nexport const secp256k1 = createCurve(\n  {\n    a: BigInt(0), // equation params: a, b\n    b: BigInt(7), // Seem to be rigid: bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975\n    Fp, // Field's prime: 2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n\n    n: secp256k1N, // Curve order, total count of valid points in the field\n    // Base point (x, y) aka generator point\n    Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n    Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n    h: BigInt(1), // Cofactor\n    lowS: true, // Allow only low-S signatures by default in sign() and verify()\n    /**\n     * secp256k1 belongs to Koblitz curves: it has efficiently computable endomorphism.\n     * Endomorphism uses 2x less RAM, speeds up precomputation by 2x and ECDH / key recovery by 20%.\n     * For precomputed wNAF it trades off 1/2 init time & 1/3 ram for 20% perf hit.\n     * Explanation: https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066\n     */\n    endo: {\n      beta: BigInt('0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee'),\n      splitScalar: (k: bigint) => {\n        const n = secp256k1N;\n        const a1 = BigInt('0x3086d221a7d46bcde86c90e49284eb15');\n        const b1 = -_1n * BigInt('0xe4437ed6010e88286f547fa90abfe4c3');\n        const a2 = BigInt('0x114ca50f7a8e2f3f657c1108d9d44cfd8');\n        const b2 = a1;\n        const POW_2_128 = BigInt('0x100000000000000000000000000000000'); // (2n**128n).toString(16)\n\n        const c1 = divNearest(b2 * k, n);\n        const c2 = divNearest(-b1 * k, n);\n        let k1 = mod(k - c1 * a1 - c2 * a2, n);\n        let k2 = mod(-c1 * b1 - c2 * b2, n);\n        const k1neg = k1 > POW_2_128;\n        const k2neg = k2 > POW_2_128;\n        if (k1neg) k1 = n - k1;\n        if (k2neg) k2 = n - k2;\n        if (k1 > POW_2_128 || k2 > POW_2_128) {\n          throw new Error('splitScalar: Endomorphism failed, k=' + k);\n        }\n        return { k1neg, k1, k2neg, k2 };\n      },\n    },\n  },\n  sha256\n);\n\n// Schnorr signatures are superior to ECDSA from above. Below is Schnorr-specific BIP0340 code.\n// https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\nconst _0n = BigInt(0);\nconst fe = (x: bigint) => typeof x === 'bigint' && _0n < x && x < secp256k1P;\nconst ge = (x: bigint) => typeof x === 'bigint' && _0n < x && x < secp256k1N;\n/** An object mapping tags to their tagged hash prefix of [SHA256(tag) | SHA256(tag)] */\nconst TAGGED_HASH_PREFIXES: { [tag: string]: Uint8Array } = {};\nfunction taggedHash(tag: string, ...messages: Uint8Array[]): Uint8Array {\n  let tagP = TAGGED_HASH_PREFIXES[tag];\n  if (tagP === undefined) {\n    const tagH = sha256(Uint8Array.from(tag, (c) => c.charCodeAt(0)));\n    tagP = concatBytes(tagH, tagH);\n    TAGGED_HASH_PREFIXES[tag] = tagP;\n  }\n  return sha256(concatBytes(tagP, ...messages));\n}\n\n// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point: PointType<bigint>) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n: bigint) => numberToBytesBE(n, 32);\nconst modP = (x: bigint) => mod(x, secp256k1P);\nconst modN = (x: bigint) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q: PointType<bigint>, a: bigint, b: bigint) =>\n  Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv: PrivKey) {\n  let d_ = secp256k1.utils.normPrivateKeyToScalar(priv); // same method executed in fromPrivateKey\n  let p = Point.fromPrivateKey(d_); // P = d'\u22C5G; 0 < d' < n check is done inside\n  const scalar = p.hasEvenY() ? d_ : modN(-d_);\n  return { scalar: scalar, bytes: pointToBytes(p) };\n}\n/**\n * lift_x from BIP340. Convert 32-byte x coordinate to elliptic curve point.\n * @returns valid point checked for being on-curve\n */\nfunction lift_x(x: bigint): PointType<bigint> {\n  if (!fe(x)) throw new Error('bad x: need 0 < x < p'); // Fail if x \u2265 p.\n  const xx = modP(x * x);\n  const c = modP(xx * x + BigInt(7)); // Let c = x\u00B3 + 7 mod p.\n  let y = sqrtMod(c); // Let y = c^(p+1)/4 mod p.\n  if (y % _2n !== _0n) y = modP(-y); // Return the unique point P such that x(P) = x and\n  const p = new Point(x, y, _1n); // y(P) = y if y mod 2 = 0 or y(P) = p-y otherwise.\n  p.assertValidity();\n  return p;\n}\n/**\n * Create tagged hash, convert it to bigint, reduce modulo-n.\n */\nfunction challenge(...args: Uint8Array[]): bigint {\n  return modN(bytesToNumberBE(taggedHash('BIP0340/challenge', ...args)));\n}\n\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey: Hex): Uint8Array {\n  return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'\u2265n. Ret bytes(d'\u22C5G)\n}\n\n/**\n * Creates Schnorr signature as per BIP340. Verifies itself before returning anything.\n * auxRand is optional and is not the sole source of k generation: bad CSPRNG won't be dangerous.\n */\nfunction schnorrSign(\n  message: Hex,\n  privateKey: PrivKey,\n  auxRand: Hex = randomBytes(32)\n): Uint8Array {\n  const m = ensureBytes('message', message);\n  const { bytes: px, scalar: d } = schnorrGetExtPubKey(privateKey); // checks for isWithinCurveOrder\n  const a = ensureBytes('auxRand', auxRand, 32); // Auxiliary random data a: a 32-byte array\n  const t = numTo32b(d ^ bytesToNumberBE(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  const k_ = modN(bytesToNumberBE(rand)); // Let k' = int(rand) mod n\n  if (k_ === _0n) throw new Error('sign failed: k is zero'); // Fail if k' = 0.\n  const { bytes: rx, scalar: k } = schnorrGetExtPubKey(k_); // Let R = k'\u22C5G.\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(numTo32b(modN(k + e * d)), 32);\n  // If Verify(bytes(P), m, sig) (see below) returns failure, abort\n  if (!schnorrVerify(sig, m, px)) throw new Error('sign: Invalid signature produced');\n  return sig;\n}\n\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature: Hex, message: Hex, publicKey: Hex): boolean {\n  const sig = ensureBytes('signature', signature, 64);\n  const m = ensureBytes('message', message);\n  const pub = ensureBytes('publicKey', publicKey, 32);\n  try {\n    const P = lift_x(bytesToNumberBE(pub)); // P = lift_x(int(pk)); fail if that fails\n    const r = bytesToNumberBE(sig.subarray(0, 32)); // Let r = int(sig[0:32]); fail if r \u2265 p.\n    if (!fe(r)) return false;\n    const s = bytesToNumberBE(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s \u2265 n.\n    if (!ge(s)) return false;\n    const e = challenge(numTo32b(r), pointToBytes(P), m); // int(challenge(bytes(r)||bytes(P)||m))%n\n    const R = GmulAdd(P, s, modN(-e)); // R = s\u22C5G - e\u22C5P\n    if (!R || !R.hasEvenY() || R.toAffine().x !== r) return false; // -eP == (n-e)P\n    return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) \u2260 r.\n  } catch (error) {\n    return false;\n  }\n}\n\nexport const schnorr = /* @__PURE__ */ (() => ({\n  getPublicKey: schnorrGetPublicKey,\n  sign: schnorrSign,\n  verify: schnorrVerify,\n  utils: {\n    randomPrivateKey: secp256k1.utils.randomPrivateKey,\n    lift_x,\n    pointToBytes,\n    numberToBytesBE,\n    bytesToNumberBE,\n    taggedHash,\n    mod,\n  },\n}))();\n\nconst isoMap = /* @__PURE__ */ (() =>\n  isogenyMap(\n    Fp,\n    [\n      // xNum\n      [\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa8c7',\n        '0x7d3d4c80bc321d5b9f315cea7fd44c5d595d2fc0bf63b92dfff1044f17c6581',\n        '0x534c328d23f234e6e2a413deca25caece4506144037c40314ecbd0b53d9dd262',\n        '0x8e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38e38daaaaa88c',\n      ],\n      // xDen\n      [\n        '0xd35771193d94918a9ca34ccbb7b640dd86cd409542f8487d9fe6b745781eb49b',\n        '0xedadc6f64383dc1df7c4b2d51b54225406d36b641f5e41bbc52a56612a8c6d14',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n      ],\n      // yNum\n      [\n        '0x4bda12f684bda12f684bda12f684bda12f684bda12f684bda12f684b8e38e23c',\n        '0xc75e0c32d5cb7c0fa9d0a54b12a0a6d5647ab046d686da6fdffc90fc201d71a3',\n        '0x29a6194691f91a73715209ef6512e576722830a201be2018a765e85a9ecee931',\n        '0x2f684bda12f684bda12f684bda12f684bda12f684bda12f684bda12f38e38d84',\n      ],\n      // yDen\n      [\n        '0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffff93b',\n        '0x7a06534bb8bdb49fd5e9e6632722c2989467c1bfc8e8d978dfb425d2685c2573',\n        '0x6484aa716545ca2cf3a70c3fa8fe337e0a3d21162f0d6299a7bf8192bfd2a76f',\n        '0x0000000000000000000000000000000000000000000000000000000000000001', // LAST 1\n      ],\n    ].map((i) => i.map((j) => BigInt(j))) as [bigint[], bigint[], bigint[], bigint[]]\n  ))();\nconst mapSWU = /* @__PURE__ */ (() =>\n  mapToCurveSimpleSWU(Fp, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fp.create(BigInt('-11')),\n  }))();\nconst htf = /* @__PURE__ */ (() =>\n  createHasher(\n    secp256k1.ProjectivePoint,\n    (scalars: bigint[]) => {\n      const { x, y } = mapSWU(Fp.create(scalars[0]));\n      return isoMap(x, y);\n    },\n    {\n      DST: 'secp256k1_XMD:SHA-256_SSWU_RO_',\n      encodeDST: 'secp256k1_XMD:SHA-256_SSWU_NU_',\n      p: Fp.ORDER,\n      m: 1,\n      k: 128,\n      expand: 'xmd',\n      hash: sha256,\n    }\n  ))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n", "function number(n: number) {\n  if (!Number.isSafeInteger(n) || n < 0) throw new Error(`positive integer expected, not ${n}`);\n}\n\nfunction bool(b: boolean) {\n  if (typeof b !== 'boolean') throw new Error(`boolean expected, not ${b}`);\n}\n\nexport function isBytes(a: unknown): a is Uint8Array {\n  return (\n    a instanceof Uint8Array ||\n    (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n  );\n}\n\nfunction bytes(b: Uint8Array | undefined, ...lengths: number[]) {\n  if (!isBytes(b)) throw new Error('Uint8Array expected');\n  if (lengths.length > 0 && !lengths.includes(b.length))\n    throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\n\nexport type Hash = {\n  (data: Uint8Array): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create: any;\n};\nfunction hash(hash: Hash) {\n  if (typeof hash !== 'function' || typeof hash.create !== 'function')\n    throw new Error('hash must be wrapped by utils.wrapConstructor');\n  number(hash.outputLen);\n  number(hash.blockLen);\n}\n\nfunction exists(instance: any, checkFinished = true) {\n  if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n  if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\n\nfunction output(out: any, instance: any) {\n  bytes(out);\n  const min = instance.outputLen;\n  if (out.length < min) {\n    throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n  }\n}\n\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n", "/*! noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) */\nimport { bytes as abytes, isBytes } from './_assert.js';\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n  Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n// Cast array to different type\nexport const u8 = (arr: TypedArray) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u16 = (arr: TypedArray) =>\n  new Uint16Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 2));\nexport const u32 = (arr: TypedArray) =>\n  new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n\n// Cast array to view\nexport const createView = (arr: TypedArray) =>\n  new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n\n// big-endian hardware is rare. Just in case someone still decides to run ciphers:\n// early-throw an error because we don't support BE yet.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE) throw new Error('Non little-endian hardware is not supported');\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n  i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n  abytes(bytes);\n  // pre-caching improves the speed 6x\n  let hex = '';\n  for (let i = 0; i < bytes.length; i++) {\n    hex += hexes[bytes[i]];\n  }\n  return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 } as const;\nfunction asciiToBase16(char: number): number | undefined {\n  if (char >= asciis._0 && char <= asciis._9) return char - asciis._0;\n  if (char >= asciis._A && char <= asciis._F) return char - (asciis._A - 10);\n  if (char >= asciis._a && char <= asciis._f) return char - (asciis._a - 10);\n  return;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  const hl = hex.length;\n  const al = hl / 2;\n  if (hl % 2) throw new Error('padded 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;\n  }\n  return array;\n}\n\nexport function hexToNumber(hex: string): bigint {\n  if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n  // Big Endian\n  return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes: Uint8Array): bigint {\n  return hexToNumber(bytesToHex(bytes));\n}\n\nexport function numberToBytesBE(n: number | bigint, len: number): Uint8Array {\n  return hexToBytes(n.toString(16).padStart(len * 2, '0'));\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.\nexport const nextTick = async () => {};\n\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters: number, tick: number, cb: (i: number) => void) {\n  let ts = Date.now();\n  for (let i = 0; i < iters; i++) {\n    cb(i);\n    // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n    const diff = Date.now() - ts;\n    if (diff >= 0 && diff < tick) continue;\n    await nextTick();\n    ts += diff;\n  }\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\ndeclare const TextDecoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n  if (typeof str !== 'string') throw new Error(`string expected, got ${typeof str}`);\n  return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\n/**\n * @example bytesToUtf8(new Uint8Array([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes: Uint8Array): string {\n  return new TextDecoder().decode(bytes);\n}\n\nexport type Input = Uint8Array | string;\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data: Input): Uint8Array {\n  if (typeof data === 'string') data = utf8ToBytes(data);\n  else if (isBytes(data)) data = data.slice();\n  else throw new Error(`Uint8Array expected, got ${typeof data}`);\n  return data;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n  let sum = 0;\n  for (let i = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    abytes(a);\n    sum += a.length;\n  }\n  const res = new Uint8Array(sum);\n  for (let i = 0, pad = 0; i < arrays.length; i++) {\n    const a = arrays[i];\n    res.set(a, pad);\n    pad += a.length;\n  }\n  return res;\n}\n\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n  defaults: T1,\n  opts: T2\n): T1 & T2 {\n  if (opts == null || typeof opts !== 'object') throw new Error('options must be defined');\n  const merged = Object.assign(defaults, opts);\n  return merged as T1 & T2;\n}\n\n// Compares 2 u8a-s in kinda constant time\nexport function equalBytes(a: Uint8Array, b: Uint8Array) {\n  if (a.length !== b.length) return false;\n  let diff = 0;\n  for (let i = 0; i < a.length; i++) diff |= a[i] ^ b[i];\n  return diff === 0;\n}\n\n// For runtime check if class implements interface\nexport abstract class Hash<T extends Hash<T>> {\n  abstract blockLen: number; // Bytes per block\n  abstract outputLen: number; // Bytes in output\n  abstract update(buf: Input): this;\n  // Writes digest into buf\n  abstract digestInto(buf: Uint8Array): void;\n  abstract digest(): Uint8Array;\n  /**\n   * Resets internal state. Makes Hash instance unusable.\n   * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n   * by user, they will need to manually call `destroy()` when zeroing is necessary.\n   */\n  abstract destroy(): void;\n}\n\n// This will allow to re-use with composable things like packed & base encoders\n// Also, we probably can make tags composable\nexport type Cipher = {\n  encrypt(plaintext: Uint8Array): Uint8Array;\n  decrypt(ciphertext: Uint8Array): Uint8Array;\n};\n\nexport type AsyncCipher = {\n  encrypt(plaintext: Uint8Array): Promise<Uint8Array>;\n  decrypt(ciphertext: Uint8Array): Promise<Uint8Array>;\n};\n\nexport type CipherWithOutput = Cipher & {\n  encrypt(plaintext: Uint8Array, output?: Uint8Array): Uint8Array;\n  decrypt(ciphertext: Uint8Array, output?: Uint8Array): Uint8Array;\n};\n\n// Params is outside return type, so it is accessible before calling constructor\n// If function support multiple nonceLength's, we return best one\nexport type CipherParams = { blockSize: number; nonceLength?: number; tagLength?: number };\nexport type CipherCons<T extends any[]> = (key: Uint8Array, ...args: T) => Cipher;\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport const wrapCipher = <C extends CipherCons<any>, P extends CipherParams>(\n  params: P,\n  c: C\n): C & P => {\n  Object.assign(c, params);\n  return c as C & P;\n};\n\nexport type XorStream = (\n  key: Uint8Array,\n  nonce: Uint8Array,\n  data: Uint8Array,\n  output?: Uint8Array,\n  counter?: number\n) => Uint8Array;\n\n// Polyfill for Safari 14\nexport function setBigUint64(\n  view: DataView,\n  byteOffset: number,\n  value: bigint,\n  isLE: boolean\n): void {\n  if (typeof view.setBigUint64 === 'function') return view.setBigUint64(byteOffset, value, isLE);\n  const _32n = BigInt(32);\n  const _u32_max = BigInt(0xffffffff);\n  const wh = Number((value >> _32n) & _u32_max);\n  const wl = Number(value & _u32_max);\n  const h = isLE ? 4 : 0;\n  const l = isLE ? 0 : 4;\n  view.setUint32(byteOffset + h, wh, isLE);\n  view.setUint32(byteOffset + l, wl, isLE);\n}\n\nexport function u64Lengths(ciphertext: Uint8Array, AAD?: Uint8Array) {\n  const num = new Uint8Array(16);\n  const view = createView(num);\n  setBigUint64(view, 0, BigInt(AAD ? AAD.length : 0), true);\n  setBigUint64(view, 8, BigInt(ciphertext.length), true);\n  return num;\n}\n", "import { createView, toBytes, Input, Hash, u32 } from './utils.js';\nimport { bytes as abytes, exists as aexists, output as aoutput } from './_assert.js';\n\n// GHash from AES-GCM and its little-endian \"mirror image\" Polyval from AES-SIV.\n// Implemented in terms of GHash with conversion function for keys\n// GCM GHASH from NIST SP800-38d, SIV from RFC 8452.\n// https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-38d.pdf\n\n// GHASH   modulo: x^128 + x^7   + x^2   + x     + 1\n// POLYVAL modulo: x^128 + x^127 + x^126 + x^121 + 1\n\nconst BLOCK_SIZE = 16;\n// TODO: rewrite\n// temporary padding buffer\nconst ZEROS16 = /* @__PURE__ */ new Uint8Array(16);\nconst ZEROS32 = u32(ZEROS16);\nconst POLY = 0xe1; // v = 2*v % POLY\n\n// v = 2*v % POLY\n// NOTE: because x + x = 0 (add/sub is same), mul2(x) != x+x\n// We can multiply any number using montgomery ladder and this function (works as double, add is simple xor)\nconst mul2 = (s0: number, s1: number, s2: number, s3: number) => {\n  const hiBit = s3 & 1;\n  return {\n    s3: (s2 << 31) | (s3 >>> 1),\n    s2: (s1 << 31) | (s2 >>> 1),\n    s1: (s0 << 31) | (s1 >>> 1),\n    s0: (s0 >>> 1) ^ ((POLY << 24) & -(hiBit & 1)), // reduce % poly\n  };\n};\n\nconst swapLE = (n: number) =>\n  (((n >>> 0) & 0xff) << 24) |\n  (((n >>> 8) & 0xff) << 16) |\n  (((n >>> 16) & 0xff) << 8) |\n  ((n >>> 24) & 0xff) |\n  0;\n\n/**\n * `mulX_POLYVAL(ByteReverse(H))` from spec\n * @param k mutated in place\n */\nexport function _toGHASHKey(k: Uint8Array): Uint8Array {\n  k.reverse();\n  const hiBit = k[15] & 1;\n  // k >>= 1\n  let carry = 0;\n  for (let i = 0; i < k.length; i++) {\n    const t = k[i];\n    k[i] = (t >>> 1) | carry;\n    carry = (t & 1) << 7;\n  }\n  k[0] ^= -hiBit & 0xe1; // if (hiBit) n ^= 0xe1000000000000000000000000000000;\n  return k;\n}\n\ntype Value = { s0: number; s1: number; s2: number; s3: number };\n\nconst estimateWindow = (bytes: number) => {\n  if (bytes > 64 * 1024) return 8;\n  if (bytes > 1024) return 4;\n  return 2;\n};\n\nclass GHASH implements Hash<GHASH> {\n  readonly blockLen = BLOCK_SIZE;\n  readonly outputLen = BLOCK_SIZE;\n  protected s0 = 0;\n  protected s1 = 0;\n  protected s2 = 0;\n  protected s3 = 0;\n  protected finished = false;\n  protected t: Value[];\n  private W: number;\n  private windowSize: number;\n  // We select bits per window adaptively based on expectedLength\n  constructor(key: Input, expectedLength?: number) {\n    key = toBytes(key);\n    abytes(key, 16);\n    const kView = createView(key);\n    let k0 = kView.getUint32(0, false);\n    let k1 = kView.getUint32(4, false);\n    let k2 = kView.getUint32(8, false);\n    let k3 = kView.getUint32(12, false);\n    // generate table of doubled keys (half of montgomery ladder)\n    const doubles: Value[] = [];\n    for (let i = 0; i < 128; i++) {\n      doubles.push({ s0: swapLE(k0), s1: swapLE(k1), s2: swapLE(k2), s3: swapLE(k3) });\n      ({ s0: k0, s1: k1, s2: k2, s3: k3 } = mul2(k0, k1, k2, k3));\n    }\n    const W = estimateWindow(expectedLength || 1024);\n    if (![1, 2, 4, 8].includes(W))\n      throw new Error(`ghash: wrong window size=${W}, should be 2, 4 or 8`);\n    this.W = W;\n    const bits = 128; // always 128 bits;\n    const windows = bits / W;\n    const windowSize = (this.windowSize = 2 ** W);\n    const items: Value[] = [];\n    // Create precompute table for window of W bits\n    for (let w = 0; w < windows; w++) {\n      // truth table: 00, 01, 10, 11\n      for (let byte = 0; byte < windowSize; byte++) {\n        // prettier-ignore\n        let s0 = 0, s1 = 0, s2 = 0, s3 = 0;\n        for (let j = 0; j < W; j++) {\n          const bit = (byte >>> (W - j - 1)) & 1;\n          if (!bit) continue;\n          const { s0: d0, s1: d1, s2: d2, s3: d3 } = doubles[W * w + j];\n          (s0 ^= d0), (s1 ^= d1), (s2 ^= d2), (s3 ^= d3);\n        }\n        items.push({ s0, s1, s2, s3 });\n      }\n    }\n    this.t = items;\n  }\n  protected _updateBlock(s0: number, s1: number, s2: number, s3: number) {\n    (s0 ^= this.s0), (s1 ^= this.s1), (s2 ^= this.s2), (s3 ^= this.s3);\n    const { W, t, windowSize } = this;\n    // prettier-ignore\n    let o0 = 0, o1 = 0, o2 = 0, o3 = 0;\n    const mask = (1 << W) - 1; // 2**W will kill performance.\n    let w = 0;\n    for (const num of [s0, s1, s2, s3]) {\n      for (let bytePos = 0; bytePos < 4; bytePos++) {\n        const byte = (num >>> (8 * bytePos)) & 0xff;\n        for (let bitPos = 8 / W - 1; bitPos >= 0; bitPos--) {\n          const bit = (byte >>> (W * bitPos)) & mask;\n          const { s0: e0, s1: e1, s2: e2, s3: e3 } = t[w * windowSize + bit];\n          (o0 ^= e0), (o1 ^= e1), (o2 ^= e2), (o3 ^= e3);\n          w += 1;\n        }\n      }\n    }\n    this.s0 = o0;\n    this.s1 = o1;\n    this.s2 = o2;\n    this.s3 = o3;\n  }\n  update(data: Input): this {\n    data = toBytes(data);\n    aexists(this);\n    const b32 = u32(data);\n    const blocks = Math.floor(data.length / BLOCK_SIZE);\n    const left = data.length % BLOCK_SIZE;\n    for (let i = 0; i < blocks; i++) {\n      this._updateBlock(b32[i * 4 + 0], b32[i * 4 + 1], b32[i * 4 + 2], b32[i * 4 + 3]);\n    }\n    if (left) {\n      ZEROS16.set(data.subarray(blocks * BLOCK_SIZE));\n      this._updateBlock(ZEROS32[0], ZEROS32[1], ZEROS32[2], ZEROS32[3]);\n      ZEROS32.fill(0); // clean tmp buffer\n    }\n    return this;\n  }\n  destroy() {\n    const { t } = this;\n    // clean precompute table\n    for (const elm of t) {\n      (elm.s0 = 0), (elm.s1 = 0), (elm.s2 = 0), (elm.s3 = 0);\n    }\n  }\n  digestInto(out: Uint8Array) {\n    aexists(this);\n    aoutput(out, this);\n    this.finished = true;\n    const { s0, s1, s2, s3 } = this;\n    const o32 = u32(out);\n    o32[0] = s0;\n    o32[1] = s1;\n    o32[2] = s2;\n    o32[3] = s3;\n    return out;\n  }\n  digest(): Uint8Array {\n    const res = new Uint8Array(BLOCK_SIZE);\n    this.digestInto(res);\n    this.destroy();\n    return res;\n  }\n}\n\nclass Polyval extends GHASH {\n  constructor(key: Input, expectedLength?: number) {\n    key = toBytes(key);\n    const ghKey = _toGHASHKey(key.slice());\n    super(ghKey, expectedLength);\n    ghKey.fill(0);\n  }\n  update(data: Input): this {\n    data = toBytes(data);\n    aexists(this);\n    const b32 = u32(data);\n    const left = data.length % BLOCK_SIZE;\n    const blocks = Math.floor(data.length / BLOCK_SIZE);\n    for (let i = 0; i < blocks; i++) {\n      this._updateBlock(\n        swapLE(b32[i * 4 + 3]),\n        swapLE(b32[i * 4 + 2]),\n        swapLE(b32[i * 4 + 1]),\n        swapLE(b32[i * 4 + 0])\n      );\n    }\n    if (left) {\n      ZEROS16.set(data.subarray(blocks * BLOCK_SIZE));\n      this._updateBlock(\n        swapLE(ZEROS32[3]),\n        swapLE(ZEROS32[2]),\n        swapLE(ZEROS32[1]),\n        swapLE(ZEROS32[0])\n      );\n      ZEROS32.fill(0); // clean tmp buffer\n    }\n    return this;\n  }\n  digestInto(out: Uint8Array) {\n    aexists(this);\n    aoutput(out, this);\n    this.finished = true;\n    // tmp ugly hack\n    const { s0, s1, s2, s3 } = this;\n    const o32 = u32(out);\n    o32[0] = s0;\n    o32[1] = s1;\n    o32[2] = s2;\n    o32[3] = s3;\n    return out.reverse();\n  }\n}\n\nexport type CHash = ReturnType<typeof wrapConstructorWithKey>;\nfunction wrapConstructorWithKey<H extends Hash<H>>(\n  hashCons: (key: Input, expectedLength?: number) => Hash<H>\n) {\n  const hashC = (msg: Input, key: Input): Uint8Array =>\n    hashCons(key, msg.length).update(toBytes(msg)).digest();\n  const tmp = hashCons(new Uint8Array(16), 0);\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (key: Input, expectedLength?: number) => hashCons(key, expectedLength);\n  return hashC;\n}\n\nexport const ghash = wrapConstructorWithKey(\n  (key, expectedLength) => new GHASH(key, expectedLength)\n);\nexport const polyval = wrapConstructorWithKey(\n  (key, expectedLength) => new Polyval(key, expectedLength)\n);\n", "// prettier-ignore\nimport {\n  wrapCipher, Cipher, CipherWithOutput,\n  createView, setBigUint64, equalBytes, u32, u8,\n} from './utils.js';\nimport { ghash, polyval } from './_polyval.js';\nimport { bytes as abytes } from './_assert.js';\n\n/*\nAES (Advanced Encryption Standard) aka Rijndael block cipher.\n\nData is split into 128-bit blocks. Encrypted in 10/12/14 rounds (128/192/256 bits). In every round:\n1. **S-box**, table substitution\n2. **Shift rows**, cyclic shift left of all rows of data array\n3. **Mix columns**, multiplying every column by fixed polynomial\n4. **Add round key**, round_key xor i-th column of array\n\nResources:\n- FIPS-197 https://csrc.nist.gov/files/pubs/fips/197/final/docs/fips-197.pdf\n- Original proposal: https://csrc.nist.gov/csrc/media/projects/cryptographic-standards-and-guidelines/documents/aes-development/rijndael-ammended.pdf\n*/\n\nconst BLOCK_SIZE = 16;\nconst BLOCK_SIZE32 = 4;\nconst EMPTY_BLOCK = new Uint8Array(BLOCK_SIZE);\nconst POLY = 0x11b; // 1 + x + x**3 + x**4 + x**8\n\n// TODO: remove multiplication, binary ops only\nfunction mul2(n: number) {\n  return (n << 1) ^ (POLY & -(n >> 7));\n}\n\nfunction mul(a: number, b: number) {\n  let res = 0;\n  for (; b > 0; b >>= 1) {\n    // Montgomery ladder\n    res ^= a & -(b & 1); // if (b&1) res ^=a (but const-time).\n    a = mul2(a); // a = 2*a\n  }\n  return res;\n}\n\n// AES S-box is generated using finite field inversion,\n// an affine transform, and xor of a constant 0x63.\nconst sbox = /* @__PURE__ */ (() => {\n  let t = new Uint8Array(256);\n  for (let i = 0, x = 1; i < 256; i++, x ^= mul2(x)) t[i] = x;\n  const box = new Uint8Array(256);\n  box[0] = 0x63; // first elm\n  for (let i = 0; i < 255; i++) {\n    let x = t[255 - i];\n    x |= x << 8;\n    box[t[i]] = (x ^ (x >> 4) ^ (x >> 5) ^ (x >> 6) ^ (x >> 7) ^ 0x63) & 0xff;\n  }\n  return box;\n})();\n\n// Inverted S-box\nconst invSbox = /* @__PURE__ */ sbox.map((_, j) => sbox.indexOf(j));\n\n// Rotate u32 by 8\nconst rotr32_8 = (n: number) => (n << 24) | (n >>> 8);\nconst rotl32_8 = (n: number) => (n << 8) | (n >>> 24);\n\n// T-table is optimization suggested in 5.2 of original proposal (missed from FIPS-197). Changes:\n// - LE instead of BE\n// - bigger tables: T0 and T1 are merged into T01 table and T2 & T3 into T23;\n//   so index is u16, instead of u8. This speeds up things, unexpectedly\nfunction genTtable(sbox: Uint8Array, fn: (n: number) => number) {\n  if (sbox.length !== 256) throw new Error('Wrong sbox length');\n  const T0 = new Uint32Array(256).map((_, j) => fn(sbox[j]));\n  const T1 = T0.map(rotl32_8);\n  const T2 = T1.map(rotl32_8);\n  const T3 = T2.map(rotl32_8);\n  const T01 = new Uint32Array(256 * 256);\n  const T23 = new Uint32Array(256 * 256);\n  const sbox2 = new Uint16Array(256 * 256);\n  for (let i = 0; i < 256; i++) {\n    for (let j = 0; j < 256; j++) {\n      const idx = i * 256 + j;\n      T01[idx] = T0[i] ^ T1[j];\n      T23[idx] = T2[i] ^ T3[j];\n      sbox2[idx] = (sbox[i] << 8) | sbox[j];\n    }\n  }\n  return { sbox, sbox2, T0, T1, T2, T3, T01, T23 };\n}\n\nconst tableEncoding = /* @__PURE__ */ genTtable(\n  sbox,\n  (s: number) => (mul(s, 3) << 24) | (s << 16) | (s << 8) | mul(s, 2)\n);\nconst tableDecoding = /* @__PURE__ */ genTtable(\n  invSbox,\n  (s) => (mul(s, 11) << 24) | (mul(s, 13) << 16) | (mul(s, 9) << 8) | mul(s, 14)\n);\n\nconst xPowers = /* @__PURE__ */ (() => {\n  const p = new Uint8Array(16);\n  for (let i = 0, x = 1; i < 16; i++, x = mul2(x)) p[i] = x;\n  return p;\n})();\n\nexport function expandKeyLE(key: Uint8Array): Uint32Array {\n  abytes(key);\n  const len = key.length;\n  if (![16, 24, 32].includes(len))\n    throw new Error(`aes: wrong key size: should be 16, 24 or 32, got: ${len}`);\n  const { sbox2 } = tableEncoding;\n  const k32 = u32(key);\n  const Nk = k32.length;\n  const subByte = (n: number) => applySbox(sbox2, n, n, n, n);\n  const xk = new Uint32Array(len + 28); // expanded key\n  xk.set(k32);\n  // 4.3.1 Key expansion\n  for (let i = Nk; i < xk.length; i++) {\n    let t = xk[i - 1];\n    if (i % Nk === 0) t = subByte(rotr32_8(t)) ^ xPowers[i / Nk - 1];\n    else if (Nk > 6 && i % Nk === 4) t = subByte(t);\n    xk[i] = xk[i - Nk] ^ t;\n  }\n  return xk;\n}\n\nexport function expandKeyDecLE(key: Uint8Array): Uint32Array {\n  const encKey = expandKeyLE(key);\n  const xk = encKey.slice();\n  const Nk = encKey.length;\n  const { sbox2 } = tableEncoding;\n  const { T0, T1, T2, T3 } = tableDecoding;\n  // Inverse key by chunks of 4 (rounds)\n  for (let i = 0; i < Nk; i += 4) {\n    for (let j = 0; j < 4; j++) xk[i + j] = encKey[Nk - i - 4 + j];\n  }\n  encKey.fill(0);\n  // apply InvMixColumn except first & last round\n  for (let i = 4; i < Nk - 4; i++) {\n    const x = xk[i];\n    const w = applySbox(sbox2, x, x, x, x);\n    xk[i] = T0[w & 0xff] ^ T1[(w >>> 8) & 0xff] ^ T2[(w >>> 16) & 0xff] ^ T3[w >>> 24];\n  }\n  return xk;\n}\n\n// Apply tables\nfunction apply0123(\n  T01: Uint32Array,\n  T23: Uint32Array,\n  s0: number,\n  s1: number,\n  s2: number,\n  s3: number\n) {\n  return (\n    T01[((s0 << 8) & 0xff00) | ((s1 >>> 8) & 0xff)] ^\n    T23[((s2 >>> 8) & 0xff00) | ((s3 >>> 24) & 0xff)]\n  );\n}\n\nfunction applySbox(sbox2: Uint16Array, s0: number, s1: number, s2: number, s3: number) {\n  return (\n    sbox2[(s0 & 0xff) | (s1 & 0xff00)] |\n    (sbox2[((s2 >>> 16) & 0xff) | ((s3 >>> 16) & 0xff00)] << 16)\n  );\n}\n\nfunction encrypt(xk: Uint32Array, s0: number, s1: number, s2: number, s3: number) {\n  const { sbox2, T01, T23 } = tableEncoding;\n  let k = 0;\n  (s0 ^= xk[k++]), (s1 ^= xk[k++]), (s2 ^= xk[k++]), (s3 ^= xk[k++]);\n  const rounds = xk.length / 4 - 2;\n  for (let i = 0; i < rounds; i++) {\n    const t0 = xk[k++] ^ apply0123(T01, T23, s0, s1, s2, s3);\n    const t1 = xk[k++] ^ apply0123(T01, T23, s1, s2, s3, s0);\n    const t2 = xk[k++] ^ apply0123(T01, T23, s2, s3, s0, s1);\n    const t3 = xk[k++] ^ apply0123(T01, T23, s3, s0, s1, s2);\n    (s0 = t0), (s1 = t1), (s2 = t2), (s3 = t3);\n  }\n  // last round (without mixcolumns, so using SBOX2 table)\n  const t0 = xk[k++] ^ applySbox(sbox2, s0, s1, s2, s3);\n  const t1 = xk[k++] ^ applySbox(sbox2, s1, s2, s3, s0);\n  const t2 = xk[k++] ^ applySbox(sbox2, s2, s3, s0, s1);\n  const t3 = xk[k++] ^ applySbox(sbox2, s3, s0, s1, s2);\n  return { s0: t0, s1: t1, s2: t2, s3: t3 };\n}\n\nfunction decrypt(xk: Uint32Array, s0: number, s1: number, s2: number, s3: number) {\n  const { sbox2, T01, T23 } = tableDecoding;\n  let k = 0;\n  (s0 ^= xk[k++]), (s1 ^= xk[k++]), (s2 ^= xk[k++]), (s3 ^= xk[k++]);\n  const rounds = xk.length / 4 - 2;\n  for (let i = 0; i < rounds; i++) {\n    const t0 = xk[k++] ^ apply0123(T01, T23, s0, s3, s2, s1);\n    const t1 = xk[k++] ^ apply0123(T01, T23, s1, s0, s3, s2);\n    const t2 = xk[k++] ^ apply0123(T01, T23, s2, s1, s0, s3);\n    const t3 = xk[k++] ^ apply0123(T01, T23, s3, s2, s1, s0);\n    (s0 = t0), (s1 = t1), (s2 = t2), (s3 = t3);\n  }\n  // Last round\n  const t0 = xk[k++] ^ applySbox(sbox2, s0, s3, s2, s1);\n  const t1 = xk[k++] ^ applySbox(sbox2, s1, s0, s3, s2);\n  const t2 = xk[k++] ^ applySbox(sbox2, s2, s1, s0, s3);\n  const t3 = xk[k++] ^ applySbox(sbox2, s3, s2, s1, s0);\n  return { s0: t0, s1: t1, s2: t2, s3: t3 };\n}\n\nfunction getDst(len: number, dst?: Uint8Array) {\n  if (!dst) return new Uint8Array(len);\n  abytes(dst);\n  if (dst.length < len)\n    throw new Error(`aes: wrong destination length, expected at least ${len}, got: ${dst.length}`);\n  return dst;\n}\n\n// TODO: investigate merging with ctr32\nfunction ctrCounter(xk: Uint32Array, nonce: Uint8Array, src: Uint8Array, dst?: Uint8Array) {\n  abytes(nonce, BLOCK_SIZE);\n  abytes(src);\n  const srcLen = src.length;\n  dst = getDst(srcLen, dst);\n  const ctr = nonce;\n  const c32 = u32(ctr);\n  // Fill block (empty, ctr=0)\n  let { s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]);\n  const src32 = u32(src);\n  const dst32 = u32(dst);\n  // process blocks\n  for (let i = 0; i + 4 <= src32.length; i += 4) {\n    dst32[i + 0] = src32[i + 0] ^ s0;\n    dst32[i + 1] = src32[i + 1] ^ s1;\n    dst32[i + 2] = src32[i + 2] ^ s2;\n    dst32[i + 3] = src32[i + 3] ^ s3;\n    // Full 128 bit counter with wrap around\n    let carry = 1;\n    for (let i = ctr.length - 1; i >= 0; i--) {\n      carry = (carry + (ctr[i] & 0xff)) | 0;\n      ctr[i] = carry & 0xff;\n      carry >>>= 8;\n    }\n    ({ s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]));\n  }\n  // leftovers (less than block)\n  // It's possible to handle > u32 fast, but is it worth it?\n  const start = BLOCK_SIZE * Math.floor(src32.length / BLOCK_SIZE32);\n  if (start < srcLen) {\n    const b32 = new Uint32Array([s0, s1, s2, s3]);\n    const buf = u8(b32);\n    for (let i = start, pos = 0; i < srcLen; i++, pos++) dst[i] = src[i] ^ buf[pos];\n  }\n  return dst;\n}\n\n// AES CTR with overflowing 32 bit counter\n// It's possible to do 32le significantly simpler (and probably faster) by using u32.\n// But, we need both, and perf bottleneck is in ghash anyway.\nfunction ctr32(\n  xk: Uint32Array,\n  isLE: boolean,\n  nonce: Uint8Array,\n  src: Uint8Array,\n  dst?: Uint8Array\n) {\n  abytes(nonce, BLOCK_SIZE);\n  abytes(src);\n  dst = getDst(src.length, dst);\n  const ctr = nonce; // write new value to nonce, so it can be re-used\n  const c32 = u32(ctr);\n  const view = createView(ctr);\n  const src32 = u32(src);\n  const dst32 = u32(dst);\n  const ctrPos = isLE ? 0 : 12;\n  const srcLen = src.length;\n  // Fill block (empty, ctr=0)\n  let ctrNum = view.getUint32(ctrPos, isLE); // read current counter value\n  let { s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]);\n  // process blocks\n  for (let i = 0; i + 4 <= src32.length; i += 4) {\n    dst32[i + 0] = src32[i + 0] ^ s0;\n    dst32[i + 1] = src32[i + 1] ^ s1;\n    dst32[i + 2] = src32[i + 2] ^ s2;\n    dst32[i + 3] = src32[i + 3] ^ s3;\n    ctrNum = (ctrNum + 1) >>> 0; // u32 wrap\n    view.setUint32(ctrPos, ctrNum, isLE);\n    ({ s0, s1, s2, s3 } = encrypt(xk, c32[0], c32[1], c32[2], c32[3]));\n  }\n  // leftovers (less than a block)\n  const start = BLOCK_SIZE * Math.floor(src32.length / BLOCK_SIZE32);\n  if (start < srcLen) {\n    const b32 = new Uint32Array([s0, s1, s2, s3]);\n    const buf = u8(b32);\n    for (let i = start, pos = 0; i < srcLen; i++, pos++) dst[i] = src[i] ^ buf[pos];\n  }\n  return dst;\n}\n\n/**\n * CTR: counter mode. Creates stream cipher.\n * Requires good IV. Parallelizable. OK, but no MAC.\n */\nexport const ctr = wrapCipher(\n  { blockSize: 16, nonceLength: 16 },\n  function ctr(key: Uint8Array, nonce: Uint8Array): CipherWithOutput {\n    abytes(key);\n    abytes(nonce, BLOCK_SIZE);\n    function processCtr(buf: Uint8Array, dst?: Uint8Array) {\n      const xk = expandKeyLE(key);\n      const n = nonce.slice();\n      const out = ctrCounter(xk, n, buf, dst);\n      xk.fill(0);\n      n.fill(0);\n      return out;\n    }\n    return {\n      encrypt: (plaintext: Uint8Array, dst?: Uint8Array) => processCtr(plaintext, dst),\n      decrypt: (ciphertext: Uint8Array, dst?: Uint8Array) => processCtr(ciphertext, dst),\n    };\n  }\n);\n\nfunction validateBlockDecrypt(data: Uint8Array) {\n  abytes(data);\n  if (data.length % BLOCK_SIZE !== 0) {\n    throw new Error(\n      `aes/(cbc-ecb).decrypt ciphertext should consist of blocks with size ${BLOCK_SIZE}`\n    );\n  }\n}\n\nfunction validateBlockEncrypt(plaintext: Uint8Array, pcks5: boolean, dst?: Uint8Array) {\n  let outLen = plaintext.length;\n  const remaining = outLen % BLOCK_SIZE;\n  if (!pcks5 && remaining !== 0)\n    throw new Error('aec/(cbc-ecb): unpadded plaintext with disabled padding');\n  const b = u32(plaintext);\n  if (pcks5) {\n    let left = BLOCK_SIZE - remaining;\n    if (!left) left = BLOCK_SIZE; // if no bytes left, create empty padding block\n    outLen = outLen + left;\n  }\n  const out = getDst(outLen, dst);\n  const o = u32(out);\n  return { b, o, out };\n}\n\nfunction validatePCKS(data: Uint8Array, pcks5: boolean) {\n  if (!pcks5) return data;\n  const len = data.length;\n  if (!len) throw new Error(`aes/pcks5: empty ciphertext not allowed`);\n  const lastByte = data[len - 1];\n  if (lastByte <= 0 || lastByte > 16) throw new Error(`aes/pcks5: wrong padding byte: ${lastByte}`);\n  const out = data.subarray(0, -lastByte);\n  for (let i = 0; i < lastByte; i++)\n    if (data[len - i - 1] !== lastByte) throw new Error(`aes/pcks5: wrong padding`);\n  return out;\n}\n\nfunction padPCKS(left: Uint8Array) {\n  const tmp = new Uint8Array(16);\n  const tmp32 = u32(tmp);\n  tmp.set(left);\n  const paddingByte = BLOCK_SIZE - left.length;\n  for (let i = BLOCK_SIZE - paddingByte; i < BLOCK_SIZE; i++) tmp[i] = paddingByte;\n  return tmp32;\n}\n\nexport type BlockOpts = { disablePadding?: boolean };\n\n/**\n * ECB: Electronic CodeBook. Simple deterministic replacement.\n * Dangerous: always map x to y. See [AES Penguin](https://words.filippo.io/the-ecb-penguin/).\n */\nexport const ecb = wrapCipher(\n  { blockSize: 16 },\n  function ecb(key: Uint8Array, opts: BlockOpts = {}): CipherWithOutput {\n    abytes(key);\n    const pcks5 = !opts.disablePadding;\n    return {\n      encrypt: (plaintext: Uint8Array, dst?: Uint8Array) => {\n        abytes(plaintext);\n        const { b, o, out: _out } = validateBlockEncrypt(plaintext, pcks5, dst);\n        const xk = expandKeyLE(key);\n        let i = 0;\n        for (; i + 4 <= b.length; ) {\n          const { s0, s1, s2, s3 } = encrypt(xk, b[i + 0], b[i + 1], b[i + 2], b[i + 3]);\n          (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n        }\n        if (pcks5) {\n          const tmp32 = padPCKS(plaintext.subarray(i * 4));\n          const { s0, s1, s2, s3 } = encrypt(xk, tmp32[0], tmp32[1], tmp32[2], tmp32[3]);\n          (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n        }\n        xk.fill(0);\n        return _out;\n      },\n      decrypt: (ciphertext: Uint8Array, dst?: Uint8Array) => {\n        validateBlockDecrypt(ciphertext);\n        const xk = expandKeyDecLE(key);\n        const out = getDst(ciphertext.length, dst);\n        const b = u32(ciphertext);\n        const o = u32(out);\n        for (let i = 0; i + 4 <= b.length; ) {\n          const { s0, s1, s2, s3 } = decrypt(xk, b[i + 0], b[i + 1], b[i + 2], b[i + 3]);\n          (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n        }\n        xk.fill(0);\n        return validatePCKS(out, pcks5);\n      },\n    };\n  }\n);\n\n/**\n * CBC: Cipher-Block-Chaining. Key is previous round\u2019s block.\n * Fragile: needs proper padding. Unauthenticated: needs MAC.\n */\nexport const cbc = wrapCipher(\n  { blockSize: 16, nonceLength: 16 },\n  function cbc(key: Uint8Array, iv: Uint8Array, opts: BlockOpts = {}): CipherWithOutput {\n    abytes(key);\n    abytes(iv, 16);\n    const pcks5 = !opts.disablePadding;\n    return {\n      encrypt: (plaintext: Uint8Array, dst?: Uint8Array) => {\n        const xk = expandKeyLE(key);\n        const { b, o, out: _out } = validateBlockEncrypt(plaintext, pcks5, dst);\n        const n32 = u32(iv);\n        // prettier-ignore\n        let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];\n        let i = 0;\n        for (; i + 4 <= b.length; ) {\n          (s0 ^= b[i + 0]), (s1 ^= b[i + 1]), (s2 ^= b[i + 2]), (s3 ^= b[i + 3]);\n          ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));\n          (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n        }\n        if (pcks5) {\n          const tmp32 = padPCKS(plaintext.subarray(i * 4));\n          (s0 ^= tmp32[0]), (s1 ^= tmp32[1]), (s2 ^= tmp32[2]), (s3 ^= tmp32[3]);\n          ({ s0, s1, s2, s3 } = encrypt(xk, s0, s1, s2, s3));\n          (o[i++] = s0), (o[i++] = s1), (o[i++] = s2), (o[i++] = s3);\n        }\n        xk.fill(0);\n        return _out;\n      },\n      decrypt: (ciphertext: Uint8Array, dst?: Uint8Array) => {\n        validateBlockDecrypt(ciphertext);\n        const xk = expandKeyDecLE(key);\n        const n32 = u32(iv);\n        const out = getDst(ciphertext.length, dst);\n        const b = u32(ciphertext);\n        const o = u32(out);\n        // prettier-ignore\n        let s0 = n32[0], s1 = n32[1], s2 = n32[2], s3 = n32[3];\n        for (let i = 0; i + 4 <= b.length; ) {\n          // prettier-ignore\n          const ps0 = s0, ps1 = s1, ps2 = s2, ps3 = s3;\n          (s0 = b[i + 0]), (s1 = b[i + 1]), (s2 = b[i + 2]), (s3 = b[i + 3]);\n          const { s0: o0, s1: o1, s2: o2, s3: o3 } = decrypt(xk, s0, s1, s2, s3);\n          (o[i++] = o0 ^ ps0), (o[i++] = o1 ^ ps1), (o[i++] = o2 ^ ps2), (o[i++] = o3 ^ ps3);\n        }\n        xk.fill(0);\n        return validatePCKS(out, pcks5);\n      },\n    };\n  }\n);\n\n// TODO: merge with chacha, however gcm has bitLen while chacha has byteLen\nfunction computeTag(\n  fn: typeof ghash,\n  isLE: boolean,\n  key: Uint8Array,\n  data: Uint8Array,\n  AAD?: Uint8Array\n) {\n  const h = fn.create(key, data.length + (AAD?.length || 0));\n  if (AAD) h.update(AAD);\n  h.update(data);\n  const num = new Uint8Array(16);\n  const view = createView(num);\n  if (AAD) setBigUint64(view, 0, BigInt(AAD.length * 8), isLE);\n  setBigUint64(view, 8, BigInt(data.length * 8), isLE);\n  h.update(num);\n  return h.digest();\n}\n\n/**\n * GCM: Galois/Counter Mode.\n * Good, modern version of CTR, parallel, with MAC.\n * Be careful: MACs can be forged.\n */\nexport const gcm = wrapCipher(\n  { blockSize: 16, nonceLength: 12, tagLength: 16 },\n  function gcm(key: Uint8Array, nonce: Uint8Array, AAD?: Uint8Array): Cipher {\n    abytes(nonce);\n    // Nonce can be pretty much anything (even 1 byte). But smaller nonces less secure.\n    if (nonce.length === 0) throw new Error('aes/gcm: empty nonce');\n    const tagLength = 16;\n    function _computeTag(authKey: Uint8Array, tagMask: Uint8Array, data: Uint8Array) {\n      const tag = computeTag(ghash, false, authKey, data, AAD);\n      for (let i = 0; i < tagMask.length; i++) tag[i] ^= tagMask[i];\n      return tag;\n    }\n    function deriveKeys() {\n      const xk = expandKeyLE(key);\n      const authKey = EMPTY_BLOCK.slice();\n      const counter = EMPTY_BLOCK.slice();\n      ctr32(xk, false, counter, counter, authKey);\n      if (nonce.length === 12) {\n        counter.set(nonce);\n      } else {\n        // Spec (NIST 800-38d) supports variable size nonce.\n        // Not supported for now, but can be useful.\n        const nonceLen = EMPTY_BLOCK.slice();\n        const view = createView(nonceLen);\n        setBigUint64(view, 8, BigInt(nonce.length * 8), false);\n        // ghash(nonce || u64be(0) || u64be(nonceLen*8))\n        ghash.create(authKey).update(nonce).update(nonceLen).digestInto(counter);\n      }\n      const tagMask = ctr32(xk, false, counter, EMPTY_BLOCK);\n      return { xk, authKey, counter, tagMask };\n    }\n    return {\n      encrypt: (plaintext: Uint8Array) => {\n        abytes(plaintext);\n        const { xk, authKey, counter, tagMask } = deriveKeys();\n        const out = new Uint8Array(plaintext.length + tagLength);\n        ctr32(xk, false, counter, plaintext, out);\n        const tag = _computeTag(authKey, tagMask, out.subarray(0, out.length - tagLength));\n        out.set(tag, plaintext.length);\n        xk.fill(0);\n        return out;\n      },\n      decrypt: (ciphertext: Uint8Array) => {\n        abytes(ciphertext);\n        if (ciphertext.length < tagLength)\n          throw new Error(`aes/gcm: ciphertext less than tagLen (${tagLength})`);\n        const { xk, authKey, counter, tagMask } = deriveKeys();\n        const data = ciphertext.subarray(0, -tagLength);\n        const passedTag = ciphertext.subarray(-tagLength);\n        const tag = _computeTag(authKey, tagMask, data);\n        if (!equalBytes(tag, passedTag)) throw new Error('aes/gcm: invalid ghash tag');\n        const out = ctr32(xk, false, counter, data);\n        authKey.fill(0);\n        tagMask.fill(0);\n        xk.fill(0);\n        return out;\n      },\n    };\n  }\n);\n\nconst limit = (name: string, min: number, max: number) => (value: number) => {\n  if (!Number.isSafeInteger(value) || min > value || value > max)\n    throw new Error(`${name}: invalid value=${value}, must be [${min}..${max}]`);\n};\n\n/**\n * AES-GCM-SIV: classic AES-GCM with nonce-misuse resistance.\n * Guarantees that, when a nonce is repeated, the only security loss is that identical\n * plaintexts will produce identical ciphertexts.\n * RFC 8452, https://datatracker.ietf.org/doc/html/rfc8452\n */\nexport const siv = wrapCipher(\n  { blockSize: 16, nonceLength: 12, tagLength: 16 },\n  function siv(key: Uint8Array, nonce: Uint8Array, AAD?: Uint8Array): Cipher {\n    const tagLength = 16;\n    // From RFC 8452: Section 6\n    const AAD_LIMIT = limit('AAD', 0, 2 ** 36);\n    const PLAIN_LIMIT = limit('plaintext', 0, 2 ** 36);\n    const NONCE_LIMIT = limit('nonce', 12, 12);\n    const CIPHER_LIMIT = limit('ciphertext', 16, 2 ** 36 + 16);\n    abytes(nonce);\n    NONCE_LIMIT(nonce.length);\n    if (AAD) {\n      abytes(AAD);\n      AAD_LIMIT(AAD.length);\n    }\n    function deriveKeys() {\n      const len = key.length;\n      if (len !== 16 && len !== 24 && len !== 32)\n        throw new Error(`key length must be 16, 24 or 32 bytes, got: ${len} bytes`);\n      const xk = expandKeyLE(key);\n      const encKey = new Uint8Array(len);\n      const authKey = new Uint8Array(16);\n      const n32 = u32(nonce);\n      // prettier-ignore\n      let s0 = 0, s1 = n32[0], s2 = n32[1], s3 = n32[2];\n      let counter = 0;\n      for (const derivedKey of [authKey, encKey].map(u32)) {\n        const d32 = u32(derivedKey);\n        for (let i = 0; i < d32.length; i += 2) {\n          // aes(u32le(0) || nonce)[:8] || aes(u32le(1) || nonce)[:8] ...\n          const { s0: o0, s1: o1 } = encrypt(xk, s0, s1, s2, s3);\n          d32[i + 0] = o0;\n          d32[i + 1] = o1;\n          s0 = ++counter; // increment counter inside state\n        }\n      }\n      xk.fill(0);\n      return { authKey, encKey: expandKeyLE(encKey) };\n    }\n    function _computeTag(encKey: Uint32Array, authKey: Uint8Array, data: Uint8Array) {\n      const tag = computeTag(polyval, true, authKey, data, AAD);\n      // Compute the expected tag by XORing S_s and the nonce, clearing the\n      // most significant bit of the last byte and encrypting with the\n      // message-encryption key.\n      for (let i = 0; i < 12; i++) tag[i] ^= nonce[i];\n      tag[15] &= 0x7f; // Clear the highest bit\n      // encrypt tag as block\n      const t32 = u32(tag);\n      // prettier-ignore\n      let s0 = t32[0], s1 = t32[1], s2 = t32[2], s3 = t32[3];\n      ({ s0, s1, s2, s3 } = encrypt(encKey, s0, s1, s2, s3));\n      (t32[0] = s0), (t32[1] = s1), (t32[2] = s2), (t32[3] = s3);\n      return tag;\n    }\n    // actual decrypt/encrypt of message.\n    function processSiv(encKey: Uint32Array, tag: Uint8Array, input: Uint8Array) {\n      let block = tag.slice();\n      block[15] |= 0x80; // Force highest bit\n      return ctr32(encKey, true, block, input);\n    }\n    return {\n      encrypt: (plaintext: Uint8Array) => {\n        abytes(plaintext);\n        PLAIN_LIMIT(plaintext.length);\n        const { encKey, authKey } = deriveKeys();\n        const tag = _computeTag(encKey, authKey, plaintext);\n        const out = new Uint8Array(plaintext.length + tagLength);\n        out.set(tag, plaintext.length);\n        out.set(processSiv(encKey, tag, plaintext));\n        encKey.fill(0);\n        authKey.fill(0);\n        return out;\n      },\n      decrypt: (ciphertext: Uint8Array) => {\n        abytes(ciphertext);\n        CIPHER_LIMIT(ciphertext.length);\n        const tag = ciphertext.subarray(-tagLength);\n        const { encKey, authKey } = deriveKeys();\n        const plaintext = processSiv(encKey, tag, ciphertext.subarray(0, -tagLength));\n        const expectedTag = _computeTag(encKey, authKey, plaintext);\n        encKey.fill(0);\n        authKey.fill(0);\n        if (!equalBytes(tag, expectedTag)) throw new Error('invalid polyval tag');\n        return plaintext;\n      },\n    };\n  }\n);\n\nfunction isBytes32(a: unknown): a is Uint8Array {\n  return (\n    a != null &&\n    typeof a === 'object' &&\n    (a instanceof Uint32Array || a.constructor.name === 'Uint32Array')\n  );\n}\n\nfunction encryptBlock(xk: Uint32Array, block: Uint8Array) {\n  abytes(block, 16);\n  if (!isBytes32(xk)) throw new Error('_encryptBlock accepts result of expandKeyLE');\n  const b32 = u32(block);\n  let { s0, s1, s2, s3 } = encrypt(xk, b32[0], b32[1], b32[2], b32[3]);\n  (b32[0] = s0), (b32[1] = s1), (b32[2] = s2), (b32[3] = s3);\n  return block;\n}\n\nfunction decryptBlock(xk: Uint32Array, block: Uint8Array) {\n  abytes(block, 16);\n  if (!isBytes32(xk)) throw new Error('_decryptBlock accepts result of expandKeyLE');\n  const b32 = u32(block);\n  let { s0, s1, s2, s3 } = decrypt(xk, b32[0], b32[1], b32[2], b32[3]);\n  (b32[0] = s0), (b32[1] = s1), (b32[2] = s2), (b32[3] = s3);\n  return block;\n}\n\n// Highly unsafe private functions for implementing new modes or ciphers based on AES\n// Can change at any time, no API guarantees\nexport const unsafe = {\n  expandKeyLE,\n  expandKeyDecLE,\n  encrypt,\n  decrypt,\n  encryptBlock,\n  decryptBlock,\n  ctrCounter,\n  ctr32,\n};\n", "// nip04.ts\nimport { bytesToHex, randomBytes } from \"@noble/hashes/utils\";\nimport { secp256k1 } from \"@noble/curves/secp256k1\";\nimport { cbc } from \"@noble/ciphers/aes\";\nimport { base64 } from \"@scure/base\";\n\n// utils.ts\nvar utf8Decoder = new TextDecoder(\"utf-8\");\nvar utf8Encoder = new TextEncoder();\n\n// nip04.ts\nasync function encrypt(secretKey, pubkey, text) {\n  const privkey = secretKey instanceof Uint8Array ? bytesToHex(secretKey) : secretKey;\n  const key = secp256k1.getSharedSecret(privkey, \"02\" + pubkey);\n  const normalizedKey = getNormalizedX(key);\n  let iv = Uint8Array.from(randomBytes(16));\n  let plaintext = utf8Encoder.encode(text);\n  let ciphertext = cbc(normalizedKey, iv).encrypt(plaintext);\n  let ctb64 = base64.encode(new Uint8Array(ciphertext));\n  let ivb64 = base64.encode(new Uint8Array(iv.buffer));\n  return `${ctb64}?iv=${ivb64}`;\n}\nasync function decrypt(secretKey, pubkey, data) {\n  const privkey = secretKey instanceof Uint8Array ? bytesToHex(secretKey) : secretKey;\n  let [ctb64, ivb64] = data.split(\"?iv=\");\n  let key = secp256k1.getSharedSecret(privkey, \"02\" + pubkey);\n  let normalizedKey = getNormalizedX(key);\n  let iv = base64.decode(ivb64);\n  let ciphertext = base64.decode(ctb64);\n  let plaintext = cbc(normalizedKey, iv).decrypt(ciphertext);\n  return utf8Decoder.decode(plaintext);\n}\nfunction getNormalizedX(key) {\n  return key.slice(1, 33);\n}\nexport {\n  decrypt,\n  encrypt\n};\n", "import { exists as aexists, bytes as abytes, output as aoutput } from './_assert.js';\nimport { Input, toBytes, Hash } from './utils.js';\n\n// Poly1305 is a fast and parallel secret-key message-authentication code.\n// https://cr.yp.to/mac.html, https://cr.yp.to/mac/poly1305-20050329.pdf\n// https://datatracker.ietf.org/doc/html/rfc8439\n\n// Based on Public Domain poly1305-donna https://github.com/floodyberry/poly1305-donna\nconst u8to16 = (a: Uint8Array, i: number) => (a[i++] & 0xff) | ((a[i++] & 0xff) << 8);\nclass Poly1305 implements Hash<Poly1305> {\n  readonly blockLen = 16;\n  readonly outputLen = 16;\n  private buffer = new Uint8Array(16);\n  private r = new Uint16Array(10);\n  private h = new Uint16Array(10);\n  private pad = new Uint16Array(8);\n  private pos = 0;\n  protected finished = false;\n\n  constructor(key: Input) {\n    key = toBytes(key);\n    abytes(key, 32);\n    const t0 = u8to16(key, 0);\n    const t1 = u8to16(key, 2);\n    const t2 = u8to16(key, 4);\n    const t3 = u8to16(key, 6);\n    const t4 = u8to16(key, 8);\n    const t5 = u8to16(key, 10);\n    const t6 = u8to16(key, 12);\n    const t7 = u8to16(key, 14);\n\n    // https://github.com/floodyberry/poly1305-donna/blob/e6ad6e091d30d7f4ec2d4f978be1fcfcbce72781/poly1305-donna-16.h#L47\n    this.r[0] = t0 & 0x1fff;\n    this.r[1] = ((t0 >>> 13) | (t1 << 3)) & 0x1fff;\n    this.r[2] = ((t1 >>> 10) | (t2 << 6)) & 0x1f03;\n    this.r[3] = ((t2 >>> 7) | (t3 << 9)) & 0x1fff;\n    this.r[4] = ((t3 >>> 4) | (t4 << 12)) & 0x00ff;\n    this.r[5] = (t4 >>> 1) & 0x1ffe;\n    this.r[6] = ((t4 >>> 14) | (t5 << 2)) & 0x1fff;\n    this.r[7] = ((t5 >>> 11) | (t6 << 5)) & 0x1f81;\n    this.r[8] = ((t6 >>> 8) | (t7 << 8)) & 0x1fff;\n    this.r[9] = (t7 >>> 5) & 0x007f;\n    for (let i = 0; i < 8; i++) this.pad[i] = u8to16(key, 16 + 2 * i);\n  }\n\n  private process(data: Uint8Array, offset: number, isLast = false) {\n    const hibit = isLast ? 0 : 1 << 11;\n    const { h, r } = this;\n    const r0 = r[0];\n    const r1 = r[1];\n    const r2 = r[2];\n    const r3 = r[3];\n    const r4 = r[4];\n    const r5 = r[5];\n    const r6 = r[6];\n    const r7 = r[7];\n    const r8 = r[8];\n    const r9 = r[9];\n\n    const t0 = u8to16(data, offset + 0);\n    const t1 = u8to16(data, offset + 2);\n    const t2 = u8to16(data, offset + 4);\n    const t3 = u8to16(data, offset + 6);\n    const t4 = u8to16(data, offset + 8);\n    const t5 = u8to16(data, offset + 10);\n    const t6 = u8to16(data, offset + 12);\n    const t7 = u8to16(data, offset + 14);\n\n    let h0 = h[0] + (t0 & 0x1fff);\n    let h1 = h[1] + (((t0 >>> 13) | (t1 << 3)) & 0x1fff);\n    let h2 = h[2] + (((t1 >>> 10) | (t2 << 6)) & 0x1fff);\n    let h3 = h[3] + (((t2 >>> 7) | (t3 << 9)) & 0x1fff);\n    let h4 = h[4] + (((t3 >>> 4) | (t4 << 12)) & 0x1fff);\n    let h5 = h[5] + ((t4 >>> 1) & 0x1fff);\n    let h6 = h[6] + (((t4 >>> 14) | (t5 << 2)) & 0x1fff);\n    let h7 = h[7] + (((t5 >>> 11) | (t6 << 5)) & 0x1fff);\n    let h8 = h[8] + (((t6 >>> 8) | (t7 << 8)) & 0x1fff);\n    let h9 = h[9] + ((t7 >>> 5) | hibit);\n\n    let c = 0;\n\n    let d0 = c + h0 * r0 + h1 * (5 * r9) + h2 * (5 * r8) + h3 * (5 * r7) + h4 * (5 * r6);\n    c = d0 >>> 13;\n    d0 &= 0x1fff;\n    d0 += h5 * (5 * r5) + h6 * (5 * r4) + h7 * (5 * r3) + h8 * (5 * r2) + h9 * (5 * r1);\n    c += d0 >>> 13;\n    d0 &= 0x1fff;\n\n    let d1 = c + h0 * r1 + h1 * r0 + h2 * (5 * r9) + h3 * (5 * r8) + h4 * (5 * r7);\n    c = d1 >>> 13;\n    d1 &= 0x1fff;\n    d1 += h5 * (5 * r6) + h6 * (5 * r5) + h7 * (5 * r4) + h8 * (5 * r3) + h9 * (5 * r2);\n    c += d1 >>> 13;\n    d1 &= 0x1fff;\n\n    let d2 = c + h0 * r2 + h1 * r1 + h2 * r0 + h3 * (5 * r9) + h4 * (5 * r8);\n    c = d2 >>> 13;\n    d2 &= 0x1fff;\n    d2 += h5 * (5 * r7) + h6 * (5 * r6) + h7 * (5 * r5) + h8 * (5 * r4) + h9 * (5 * r3);\n    c += d2 >>> 13;\n    d2 &= 0x1fff;\n\n    let d3 = c + h0 * r3 + h1 * r2 + h2 * r1 + h3 * r0 + h4 * (5 * r9);\n    c = d3 >>> 13;\n    d3 &= 0x1fff;\n    d3 += h5 * (5 * r8) + h6 * (5 * r7) + h7 * (5 * r6) + h8 * (5 * r5) + h9 * (5 * r4);\n    c += d3 >>> 13;\n    d3 &= 0x1fff;\n\n    let d4 = c + h0 * r4 + h1 * r3 + h2 * r2 + h3 * r1 + h4 * r0;\n    c = d4 >>> 13;\n    d4 &= 0x1fff;\n    d4 += h5 * (5 * r9) + h6 * (5 * r8) + h7 * (5 * r7) + h8 * (5 * r6) + h9 * (5 * r5);\n    c += d4 >>> 13;\n    d4 &= 0x1fff;\n\n    let d5 = c + h0 * r5 + h1 * r4 + h2 * r3 + h3 * r2 + h4 * r1;\n    c = d5 >>> 13;\n    d5 &= 0x1fff;\n    d5 += h5 * r0 + h6 * (5 * r9) + h7 * (5 * r8) + h8 * (5 * r7) + h9 * (5 * r6);\n    c += d5 >>> 13;\n    d5 &= 0x1fff;\n\n    let d6 = c + h0 * r6 + h1 * r5 + h2 * r4 + h3 * r3 + h4 * r2;\n    c = d6 >>> 13;\n    d6 &= 0x1fff;\n    d6 += h5 * r1 + h6 * r0 + h7 * (5 * r9) + h8 * (5 * r8) + h9 * (5 * r7);\n    c += d6 >>> 13;\n    d6 &= 0x1fff;\n\n    let d7 = c + h0 * r7 + h1 * r6 + h2 * r5 + h3 * r4 + h4 * r3;\n    c = d7 >>> 13;\n    d7 &= 0x1fff;\n    d7 += h5 * r2 + h6 * r1 + h7 * r0 + h8 * (5 * r9) + h9 * (5 * r8);\n    c += d7 >>> 13;\n    d7 &= 0x1fff;\n\n    let d8 = c + h0 * r8 + h1 * r7 + h2 * r6 + h3 * r5 + h4 * r4;\n    c = d8 >>> 13;\n    d8 &= 0x1fff;\n    d8 += h5 * r3 + h6 * r2 + h7 * r1 + h8 * r0 + h9 * (5 * r9);\n    c += d8 >>> 13;\n    d8 &= 0x1fff;\n\n    let d9 = c + h0 * r9 + h1 * r8 + h2 * r7 + h3 * r6 + h4 * r5;\n    c = d9 >>> 13;\n    d9 &= 0x1fff;\n    d9 += h5 * r4 + h6 * r3 + h7 * r2 + h8 * r1 + h9 * r0;\n    c += d9 >>> 13;\n    d9 &= 0x1fff;\n\n    c = ((c << 2) + c) | 0;\n    c = (c + d0) | 0;\n    d0 = c & 0x1fff;\n    c = c >>> 13;\n    d1 += c;\n\n    h[0] = d0;\n    h[1] = d1;\n    h[2] = d2;\n    h[3] = d3;\n    h[4] = d4;\n    h[5] = d5;\n    h[6] = d6;\n    h[7] = d7;\n    h[8] = d8;\n    h[9] = d9;\n  }\n\n  private finalize() {\n    const { h, pad } = this;\n    const g = new Uint16Array(10);\n    let c = h[1] >>> 13;\n    h[1] &= 0x1fff;\n    for (let i = 2; i < 10; i++) {\n      h[i] += c;\n      c = h[i] >>> 13;\n      h[i] &= 0x1fff;\n    }\n    h[0] += c * 5;\n    c = h[0] >>> 13;\n    h[0] &= 0x1fff;\n    h[1] += c;\n    c = h[1] >>> 13;\n    h[1] &= 0x1fff;\n    h[2] += c;\n\n    g[0] = h[0] + 5;\n    c = g[0] >>> 13;\n    g[0] &= 0x1fff;\n    for (let i = 1; i < 10; i++) {\n      g[i] = h[i] + c;\n      c = g[i] >>> 13;\n      g[i] &= 0x1fff;\n    }\n    g[9] -= 1 << 13;\n\n    let mask = (c ^ 1) - 1;\n    for (let i = 0; i < 10; i++) g[i] &= mask;\n    mask = ~mask;\n    for (let i = 0; i < 10; i++) h[i] = (h[i] & mask) | g[i];\n    h[0] = (h[0] | (h[1] << 13)) & 0xffff;\n    h[1] = ((h[1] >>> 3) | (h[2] << 10)) & 0xffff;\n    h[2] = ((h[2] >>> 6) | (h[3] << 7)) & 0xffff;\n    h[3] = ((h[3] >>> 9) | (h[4] << 4)) & 0xffff;\n    h[4] = ((h[4] >>> 12) | (h[5] << 1) | (h[6] << 14)) & 0xffff;\n    h[5] = ((h[6] >>> 2) | (h[7] << 11)) & 0xffff;\n    h[6] = ((h[7] >>> 5) | (h[8] << 8)) & 0xffff;\n    h[7] = ((h[8] >>> 8) | (h[9] << 5)) & 0xffff;\n\n    let f = h[0] + pad[0];\n    h[0] = f & 0xffff;\n    for (let i = 1; i < 8; i++) {\n      f = (((h[i] + pad[i]) | 0) + (f >>> 16)) | 0;\n      h[i] = f & 0xffff;\n    }\n  }\n  update(data: Input): this {\n    aexists(this);\n    const { buffer, blockLen } = this;\n    data = toBytes(data);\n    const len = data.length;\n\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\n      if (take === blockLen) {\n        for (; blockLen <= len - pos; pos += blockLen) this.process(data, 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(buffer, 0, false);\n        this.pos = 0;\n      }\n    }\n    return this;\n  }\n  destroy() {\n    this.h.fill(0);\n    this.r.fill(0);\n    this.buffer.fill(0);\n    this.pad.fill(0);\n  }\n  digestInto(out: Uint8Array) {\n    aexists(this);\n    aoutput(out, this);\n    this.finished = true;\n    const { buffer, h } = this;\n    let { pos } = this;\n    if (pos) {\n      buffer[pos++] = 1;\n      // buffer.subarray(pos).fill(0);\n      for (; pos < 16; pos++) buffer[pos] = 0;\n      this.process(buffer, 0, true);\n    }\n    this.finalize();\n    let opos = 0;\n    for (let i = 0; i < 8; i++) {\n      out[opos++] = h[i] >>> 0;\n      out[opos++] = h[i] >>> 8;\n    }\n    return out;\n  }\n  digest(): Uint8Array {\n    const { buffer, outputLen } = this;\n    this.digestInto(buffer);\n    const res = buffer.slice(0, outputLen);\n    this.destroy();\n    return res;\n  }\n}\n\nexport type CHash = ReturnType<typeof wrapConstructorWithKey>;\nexport function wrapConstructorWithKey<H extends Hash<H>>(hashCons: (key: Input) => Hash<H>) {\n  const hashC = (msg: Input, key: Input): Uint8Array => hashCons(key).update(toBytes(msg)).digest();\n  const tmp = hashCons(new Uint8Array(32));\n  hashC.outputLen = tmp.outputLen;\n  hashC.blockLen = tmp.blockLen;\n  hashC.create = (key: Input) => hashCons(key);\n  return hashC;\n}\n\nexport const poly1305 = wrapConstructorWithKey((key) => new Poly1305(key));\n", "// Basic utils for ARX (add-rotate-xor) salsa and chacha ciphers.\nimport { number as anumber, bytes as abytes, bool as abool } from './_assert.js';\nimport { XorStream, checkOpts, u32, utf8ToBytes } from './utils.js';\n\n/*\nRFC8439 requires multi-step cipher stream, where\nauthKey starts with counter: 0, actual msg with counter: 1.\n\nFor this, we need a way to re-use nonce / counter:\n\n    const counter = new Uint8Array(4);\n    chacha(..., counter, ...); // counter is now 1\n    chacha(..., counter, ...); // counter is now 2\n\nThis is complicated:\n\n- 32-bit counters are enough, no need for 64-bit: max ArrayBuffer size in JS is 4GB\n- Original papers don't allow mutating counters\n- Counter overflow is undefined [^1]\n- Idea A: allow providing (nonce | counter) instead of just nonce, re-use it\n- Caveat: Cannot be re-used through all cases:\n- * chacha has (counter | nonce)\n- * xchacha has (nonce16 | counter | nonce16)\n- Idea B: separate nonce / counter and provide separate API for counter re-use\n- Caveat: there are different counter sizes depending on an algorithm.\n- salsa & chacha also differ in structures of key & sigma:\n  salsa20:      s[0] | k(4) | s[1] | nonce(2) | ctr(2) | s[2] | k(4) | s[3]\n  chacha:       s(4) | k(8) | ctr(1) | nonce(3)\n  chacha20orig: s(4) | k(8) | ctr(2) | nonce(2)\n- Idea C: helper method such as `setSalsaState(key, nonce, sigma, data)`\n- Caveat: we can't re-use counter array\n\nxchacha [^2] uses the subkey and remaining 8 byte nonce with ChaCha20 as normal\n(prefixed by 4 NUL bytes, since [RFC8439] specifies a 12-byte nonce).\n\n[^1]: https://mailarchive.ietf.org/arch/msg/cfrg/gsOnTJzcbgG6OqD8Sc0GO5aR_tU/\n[^2]: https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha#appendix-A.2\n*/\n\nconst sigma16 = utf8ToBytes('expand 16-byte k');\nconst sigma32 = utf8ToBytes('expand 32-byte k');\nconst sigma16_32 = u32(sigma16);\nconst sigma32_32 = u32(sigma32);\n\nexport function rotl(a: number, b: number): number {\n  return (a << b) | (a >>> (32 - b));\n}\n\nexport type CipherCoreFn = (\n  sigma: Uint32Array,\n  key: Uint32Array,\n  nonce: Uint32Array,\n  output: Uint32Array,\n  counter: number,\n  rounds?: number\n) => void;\n\nexport type ExtendNonceFn = (\n  sigma: Uint32Array,\n  key: Uint32Array,\n  input: Uint32Array,\n  output: Uint32Array\n) => void;\n\nexport type CipherOpts = {\n  allowShortKeys?: boolean; // Original salsa / chacha allow 16-byte keys\n  extendNonceFn?: ExtendNonceFn;\n  counterLength?: number;\n  counterRight?: boolean; // right: nonce|counter; left: counter|nonce\n  rounds?: number;\n};\n\n// Is byte array aligned to 4 byte offset (u32)?\nfunction isAligned32(b: Uint8Array) {\n  return b.byteOffset % 4 === 0;\n}\n\n// Salsa and Chacha block length is always 512-bit\nconst BLOCK_LEN = 64;\nconst BLOCK_LEN32 = 16;\n\n// new Uint32Array([2**32])   // => Uint32Array(1) [ 0 ]\n// new Uint32Array([2**32-1]) // => Uint32Array(1) [ 4294967295 ]\nconst MAX_COUNTER = 2 ** 32 - 1;\n\nconst U32_EMPTY = new Uint32Array();\nfunction runCipher(\n  core: CipherCoreFn,\n  sigma: Uint32Array,\n  key: Uint32Array,\n  nonce: Uint32Array,\n  data: Uint8Array,\n  output: Uint8Array,\n  counter: number,\n  rounds: number\n): void {\n  const len = data.length;\n  const block = new Uint8Array(BLOCK_LEN);\n  const b32 = u32(block);\n  // Make sure that buffers aligned to 4 bytes\n  const isAligned = isAligned32(data) && isAligned32(output);\n  const d32 = isAligned ? u32(data) : U32_EMPTY;\n  const o32 = isAligned ? u32(output) : U32_EMPTY;\n  for (let pos = 0; pos < len; counter++) {\n    core(sigma, key, nonce, b32, counter, rounds);\n    if (counter >= MAX_COUNTER) throw new Error('arx: counter overflow');\n    const take = Math.min(BLOCK_LEN, len - pos);\n    // aligned to 4 bytes\n    if (isAligned && take === BLOCK_LEN) {\n      const pos32 = pos / 4;\n      if (pos % 4 !== 0) throw new Error('arx: invalid block position');\n      for (let j = 0, posj: number; j < BLOCK_LEN32; j++) {\n        posj = pos32 + j;\n        o32[posj] = d32[posj] ^ b32[j];\n      }\n      pos += BLOCK_LEN;\n      continue;\n    }\n    for (let j = 0, posj; j < take; j++) {\n      posj = pos + j;\n      output[posj] = data[posj] ^ block[j];\n    }\n    pos += take;\n  }\n}\n\nexport function createCipher(core: CipherCoreFn, opts: CipherOpts): XorStream {\n  const { allowShortKeys, extendNonceFn, counterLength, counterRight, rounds } = checkOpts(\n    { allowShortKeys: false, counterLength: 8, counterRight: false, rounds: 20 },\n    opts\n  );\n  if (typeof core !== 'function') throw new Error('core must be a function');\n  anumber(counterLength);\n  anumber(rounds);\n  abool(counterRight);\n  abool(allowShortKeys);\n  return (\n    key: Uint8Array,\n    nonce: Uint8Array,\n    data: Uint8Array,\n    output?: Uint8Array,\n    counter = 0\n  ): Uint8Array => {\n    abytes(key);\n    abytes(nonce);\n    abytes(data);\n    const len = data.length;\n    if (!output) output = new Uint8Array(len);\n    abytes(output);\n    anumber(counter);\n    if (counter < 0 || counter >= MAX_COUNTER) throw new Error('arx: counter overflow');\n    if (output.length < len)\n      throw new Error(`arx: output (${output.length}) is shorter than data (${len})`);\n    const toClean = [];\n\n    // Key & sigma\n    // key=16 -> sigma16, k=key|key\n    // key=32 -> sigma32, k=key\n    let l = key.length,\n      k: Uint8Array,\n      sigma: Uint32Array;\n    if (l === 32) {\n      k = key.slice();\n      toClean.push(k);\n      sigma = sigma32_32;\n    } else if (l === 16 && allowShortKeys) {\n      k = new Uint8Array(32);\n      k.set(key);\n      k.set(key, 16);\n      sigma = sigma16_32;\n      toClean.push(k);\n    } else {\n      throw new Error(`arx: invalid 32-byte key, got length=${l}`);\n    }\n\n    // Nonce\n    // salsa20:      8   (8-byte counter)\n    // chacha20orig: 8   (8-byte counter)\n    // chacha20:     12  (4-byte counter)\n    // xsalsa20:     24  (16 -> hsalsa,  8 -> old nonce)\n    // xchacha20:    24  (16 -> hchacha, 8 -> old nonce)\n    // Align nonce to 4 bytes\n    if (!isAligned32(nonce)) {\n      nonce = nonce.slice();\n      toClean.push(nonce);\n    }\n\n    const k32 = u32(k);\n    // hsalsa & hchacha: handle extended nonce\n    if (extendNonceFn) {\n      if (nonce.length !== 24) throw new Error(`arx: extended nonce must be 24 bytes`);\n      extendNonceFn(sigma, k32, u32(nonce.subarray(0, 16)), k32);\n      nonce = nonce.subarray(16);\n    }\n\n    // Handle nonce counter\n    const nonceNcLen = 16 - counterLength;\n    if (nonceNcLen !== nonce.length)\n      throw new Error(`arx: nonce must be ${nonceNcLen} or 16 bytes`);\n\n    // Pad counter when nonce is 64 bit\n    if (nonceNcLen !== 12) {\n      const nc = new Uint8Array(12);\n      nc.set(nonce, counterRight ? 0 : 12 - nonce.length);\n      nonce = nc;\n      toClean.push(nonce);\n    }\n    const n32 = u32(nonce);\n    runCipher(core, sigma, k32, n32, data, output, counter, rounds);\n    while (toClean.length > 0) toClean.pop()!.fill(0);\n    return output;\n  };\n}\n", "// prettier-ignore\nimport {\n  wrapCipher, CipherWithOutput, XorStream, createView, equalBytes, setBigUint64,\n} from './utils.js';\nimport { poly1305 } from './_poly1305.js';\nimport { createCipher, rotl } from './_arx.js';\nimport { bytes as abytes } from './_assert.js';\n\n// ChaCha20 stream cipher was released in 2008. ChaCha aims to increase\n// the diffusion per round, but had slightly less cryptanalysis.\n// https://cr.yp.to/chacha.html, http://cr.yp.to/chacha/chacha-20080128.pdf\n\n/**\n * ChaCha core function.\n */\n// prettier-ignore\nfunction chachaCore(\n  s: Uint32Array, k: Uint32Array, n: Uint32Array, out: Uint32Array, cnt: number, rounds = 20\n): void {\n  let y00 = s[0], y01 = s[1], y02 = s[2], y03 = s[3], // \"expa\"   \"nd 3\"  \"2-by\"  \"te k\"\n      y04 = k[0], y05 = k[1], y06 = k[2], y07 = k[3], // Key      Key     Key     Key\n      y08 = k[4], y09 = k[5], y10 = k[6], y11 = k[7], // Key      Key     Key     Key\n      y12 = cnt,  y13 = n[0], y14 = n[1], y15 = n[2]; // Counter  Counter\tNonce   Nonce\n  // Save state to temporary variables\n  let x00 = y00, x01 = y01, x02 = y02, x03 = y03,\n      x04 = y04, x05 = y05, x06 = y06, x07 = y07,\n      x08 = y08, x09 = y09, x10 = y10, x11 = y11,\n      x12 = y12, x13 = y13, x14 = y14, x15 = y15;\n  for (let r = 0; r < rounds; r += 2) {\n    x00 = (x00 + x04) | 0; x12 = rotl(x12 ^ x00, 16);\n    x08 = (x08 + x12) | 0; x04 = rotl(x04 ^ x08, 12);\n    x00 = (x00 + x04) | 0; x12 = rotl(x12 ^ x00, 8);\n    x08 = (x08 + x12) | 0; x04 = rotl(x04 ^ x08, 7);\n\n    x01 = (x01 + x05) | 0; x13 = rotl(x13 ^ x01, 16);\n    x09 = (x09 + x13) | 0; x05 = rotl(x05 ^ x09, 12);\n    x01 = (x01 + x05) | 0; x13 = rotl(x13 ^ x01, 8);\n    x09 = (x09 + x13) | 0; x05 = rotl(x05 ^ x09, 7);\n\n    x02 = (x02 + x06) | 0; x14 = rotl(x14 ^ x02, 16);\n    x10 = (x10 + x14) | 0; x06 = rotl(x06 ^ x10, 12);\n    x02 = (x02 + x06) | 0; x14 = rotl(x14 ^x02, 8);\n    x10 = (x10 + x14) | 0; x06 = rotl(x06 ^ x10, 7);\n\n    x03 = (x03 + x07) | 0; x15 = rotl(x15 ^ x03, 16);\n    x11 = (x11 + x15) | 0; x07 = rotl(x07 ^ x11, 12);\n    x03 = (x03 + x07) | 0; x15 = rotl(x15 ^ x03, 8)\n    x11 = (x11 + x15) | 0; x07 = rotl(x07 ^ x11, 7);\n\n    x00 = (x00 + x05) | 0; x15 = rotl(x15 ^ x00, 16);\n    x10 = (x10 + x15) | 0; x05 = rotl(x05 ^ x10, 12);\n    x00 = (x00 + x05) | 0; x15 = rotl(x15 ^ x00, 8);\n    x10 = (x10 + x15) | 0; x05 = rotl(x05 ^ x10, 7);\n\n    x01 = (x01 + x06) | 0; x12 = rotl(x12 ^ x01, 16);\n    x11 = (x11 + x12) | 0; x06 = rotl(x06 ^ x11, 12);\n    x01 = (x01 + x06) | 0; x12 = rotl(x12 ^ x01, 8);\n    x11 = (x11 + x12) | 0; x06 = rotl(x06 ^ x11, 7);\n\n    x02 = (x02 + x07) | 0; x13 = rotl(x13 ^ x02, 16);\n    x08 = (x08 + x13) | 0; x07 = rotl(x07 ^ x08, 12);\n    x02 = (x02 + x07) | 0; x13 = rotl(x13 ^ x02, 8);\n    x08 = (x08 + x13) | 0; x07 = rotl(x07 ^ x08, 7);\n\n    x03 = (x03 + x04) | 0; x14 = rotl(x14 ^ x03, 16)\n    x09 = (x09 + x14) | 0; x04 = rotl(x04 ^ x09, 12);\n    x03 = (x03 + x04) | 0; x14 = rotl(x14 ^ x03, 8);\n    x09 = (x09 + x14) | 0; x04 = rotl(x04 ^ x09, 7);\n  }\n  // Write output\n  let oi = 0;\n  out[oi++] = (y00 + x00) | 0; out[oi++] = (y01 + x01) | 0;\n  out[oi++] = (y02 + x02) | 0; out[oi++] = (y03 + x03) | 0;\n  out[oi++] = (y04 + x04) | 0; out[oi++] = (y05 + x05) | 0;\n  out[oi++] = (y06 + x06) | 0; out[oi++] = (y07 + x07) | 0;\n  out[oi++] = (y08 + x08) | 0; out[oi++] = (y09 + x09) | 0;\n  out[oi++] = (y10 + x10) | 0; out[oi++] = (y11 + x11) | 0;\n  out[oi++] = (y12 + x12) | 0; out[oi++] = (y13 + x13) | 0;\n  out[oi++] = (y14 + x14) | 0; out[oi++] = (y15 + x15) | 0;\n}\n/**\n * hchacha helper method, used primarily in xchacha, to hash\n * key and nonce into key' and nonce'.\n * Same as chachaCore, but there doesn't seem to be a way to move the block\n * out without 25% performance hit.\n */\n// prettier-ignore\nexport function hchacha(\n  s: Uint32Array, k: Uint32Array, i: Uint32Array, o32: Uint32Array\n) {\n  let x00 = s[0], x01 = s[1], x02 = s[2], x03 = s[3],\n      x04 = k[0], x05 = k[1], x06 = k[2], x07 = k[3],\n      x08 = k[4], x09 = k[5], x10 = k[6], x11 = k[7],\n      x12 = i[0], x13 = i[1], x14 = i[2], x15 = i[3];\n  for (let r = 0; r < 20; r += 2) {\n    x00 = (x00 + x04) | 0; x12 = rotl(x12 ^ x00, 16);\n    x08 = (x08 + x12) | 0; x04 = rotl(x04 ^ x08, 12);\n    x00 = (x00 + x04) | 0; x12 = rotl(x12 ^ x00, 8);\n    x08 = (x08 + x12) | 0; x04 = rotl(x04 ^ x08, 7);\n\n    x01 = (x01 + x05) | 0; x13 = rotl(x13 ^ x01, 16);\n    x09 = (x09 + x13) | 0; x05 = rotl(x05 ^ x09, 12);\n    x01 = (x01 + x05) | 0; x13 = rotl(x13 ^ x01, 8);\n    x09 = (x09 + x13) | 0; x05 = rotl(x05 ^ x09, 7);\n\n    x02 = (x02 + x06) | 0; x14 = rotl(x14 ^ x02, 16);\n    x10 = (x10 + x14) | 0; x06 = rotl(x06 ^ x10, 12);\n    x02 = (x02 + x06) | 0; x14 = rotl(x14 ^ x02, 8);\n    x10 = (x10 + x14) | 0; x06 = rotl(x06 ^ x10, 7);\n\n    x03 = (x03 + x07) | 0; x15 = rotl(x15 ^ x03, 16);\n    x11 = (x11 + x15) | 0; x07 = rotl(x07 ^ x11, 12);\n    x03 = (x03 + x07) | 0; x15 = rotl(x15 ^ x03, 8)\n    x11 = (x11 + x15) | 0; x07 = rotl(x07 ^ x11, 7);\n\n    x00 = (x00 + x05) | 0; x15 = rotl(x15 ^ x00, 16);\n    x10 = (x10 + x15) | 0; x05 = rotl(x05 ^ x10, 12);\n    x00 = (x00 + x05) | 0; x15 = rotl(x15 ^ x00, 8);\n    x10 = (x10 + x15) | 0; x05 = rotl(x05 ^ x10, 7);\n\n    x01 = (x01 + x06) | 0; x12 = rotl(x12 ^ x01, 16);\n    x11 = (x11 + x12) | 0; x06 = rotl(x06 ^ x11, 12);\n    x01 = (x01 + x06) | 0; x12 = rotl(x12 ^ x01, 8);\n    x11 = (x11 + x12) | 0; x06 = rotl(x06 ^ x11, 7);\n\n    x02 = (x02 + x07) | 0; x13 = rotl(x13 ^ x02, 16);\n    x08 = (x08 + x13) | 0; x07 = rotl(x07 ^ x08, 12);\n    x02 = (x02 + x07) | 0; x13 = rotl(x13 ^ x02, 8);\n    x08 = (x08 + x13) | 0; x07 = rotl(x07 ^ x08, 7);\n\n    x03 = (x03 + x04) | 0; x14 = rotl(x14 ^ x03, 16)\n    x09 = (x09 + x14) | 0; x04 = rotl(x04 ^ x09, 12);\n    x03 = (x03 + x04) | 0; x14 = rotl(x14 ^ x03, 8);\n    x09 = (x09 + x14) | 0; x04 = rotl(x04 ^ x09, 7);\n  }\n  let oi = 0;\n  o32[oi++] = x00; o32[oi++] = x01;\n  o32[oi++] = x02; o32[oi++] = x03;\n  o32[oi++] = x12; o32[oi++] = x13;\n  o32[oi++] = x14; o32[oi++] = x15;\n}\n/**\n * Original, non-RFC chacha20 from DJB. 8-byte nonce, 8-byte counter.\n */\nexport const chacha20orig = /* @__PURE__ */ createCipher(chachaCore, {\n  counterRight: false,\n  counterLength: 8,\n  allowShortKeys: true,\n});\n/**\n * ChaCha stream cipher. Conforms to RFC 8439 (IETF, TLS). 12-byte nonce, 4-byte counter.\n * With 12-byte nonce, it's not safe to use fill it with random (CSPRNG), due to collision chance.\n */\nexport const chacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n  counterRight: false,\n  counterLength: 4,\n  allowShortKeys: false,\n});\n\n/**\n * XChaCha eXtended-nonce ChaCha. 24-byte nonce.\n * With 24-byte nonce, it's safe to use fill it with random (CSPRNG).\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha\n */\nexport const xchacha20 = /* @__PURE__ */ createCipher(chachaCore, {\n  counterRight: false,\n  counterLength: 8,\n  extendNonceFn: hchacha,\n  allowShortKeys: false,\n});\n\n/**\n * Reduced 8-round chacha, described in original paper.\n */\nexport const chacha8 = /* @__PURE__ */ createCipher(chachaCore, {\n  counterRight: false,\n  counterLength: 4,\n  rounds: 8,\n});\n\n/**\n * Reduced 12-round chacha, described in original paper.\n */\nexport const chacha12 = /* @__PURE__ */ createCipher(chachaCore, {\n  counterRight: false,\n  counterLength: 4,\n  rounds: 12,\n});\n\nconst ZEROS16 = /* @__PURE__ */ new Uint8Array(16);\n// Pad to digest size with zeros\nconst updatePadded = (h: ReturnType<typeof poly1305.create>, msg: Uint8Array) => {\n  h.update(msg);\n  const left = msg.length % 16;\n  if (left) h.update(ZEROS16.subarray(left));\n};\n\nconst ZEROS32 = /* @__PURE__ */ new Uint8Array(32);\nfunction computeTag(\n  fn: XorStream,\n  key: Uint8Array,\n  nonce: Uint8Array,\n  data: Uint8Array,\n  AAD?: Uint8Array\n): Uint8Array {\n  const authKey = fn(key, nonce, ZEROS32);\n  const h = poly1305.create(authKey);\n  if (AAD) updatePadded(h, AAD);\n  updatePadded(h, data);\n  const num = new Uint8Array(16);\n  const view = createView(num);\n  setBigUint64(view, 0, BigInt(AAD ? AAD.length : 0), true);\n  setBigUint64(view, 8, BigInt(data.length), true);\n  h.update(num);\n  const res = h.digest();\n  authKey.fill(0);\n  return res;\n}\n\n/**\n * AEAD algorithm from RFC 8439.\n * Salsa20 and chacha (RFC 8439) use poly1305 differently.\n * We could have composed them similar to:\n * https://github.com/paulmillr/scure-base/blob/b266c73dde977b1dd7ef40ef7a23cc15aab526b3/index.ts#L250\n * But it's hard because of authKey:\n * In salsa20, authKey changes position in salsa stream.\n * In chacha, authKey can't be computed inside computeTag, it modifies the counter.\n */\nexport const _poly1305_aead =\n  (xorStream: XorStream) =>\n  (key: Uint8Array, nonce: Uint8Array, AAD?: Uint8Array): CipherWithOutput => {\n    const tagLength = 16;\n    abytes(key, 32);\n    abytes(nonce);\n    return {\n      encrypt: (plaintext: Uint8Array, output?: Uint8Array) => {\n        const plength = plaintext.length;\n        const clength = plength + tagLength;\n        if (output) {\n          abytes(output, clength);\n        } else {\n          output = new Uint8Array(clength);\n        }\n        xorStream(key, nonce, plaintext, output, 1);\n        const tag = computeTag(xorStream, key, nonce, output.subarray(0, -tagLength), AAD);\n        output.set(tag, plength); // append tag\n        return output;\n      },\n      decrypt: (ciphertext: Uint8Array, output?: Uint8Array) => {\n        const clength = ciphertext.length;\n        const plength = clength - tagLength;\n        if (clength < tagLength)\n          throw new Error(`encrypted data must be at least ${tagLength} bytes`);\n        if (output) {\n          abytes(output, plength);\n        } else {\n          output = new Uint8Array(plength);\n        }\n        const data = ciphertext.subarray(0, -tagLength);\n        const passedTag = ciphertext.subarray(-tagLength);\n        const tag = computeTag(xorStream, key, nonce, data, AAD);\n        if (!equalBytes(passedTag, tag)) throw new Error('invalid tag');\n        xorStream(key, nonce, data, output, 1);\n        return output;\n      },\n    };\n  };\n\n/**\n * ChaCha20-Poly1305 from RFC 8439.\n * With 12-byte nonce, it's not safe to use fill it with random (CSPRNG), due to collision chance.\n */\nexport const chacha20poly1305 = /* @__PURE__ */ wrapCipher(\n  { blockSize: 64, nonceLength: 12, tagLength: 16 },\n  _poly1305_aead(chacha20)\n);\n/**\n * XChaCha20-Poly1305 extended-nonce chacha.\n * https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha\n * With 24-byte nonce, it's safe to use fill it with random (CSPRNG).\n */\nexport const xchacha20poly1305 = /* @__PURE__ */ wrapCipher(\n  { blockSize: 64, nonceLength: 24, tagLength: 16 },\n  _poly1305_aead(xchacha20)\n);\n", "export function number(n: number) {\n  if (!Number.isSafeInteger(n) || n < 0) throw new Error(`Wrong positive integer: ${n}`);\n}\n\nexport function bool(b: boolean) {\n  if (typeof b !== 'boolean') throw new Error(`Expected boolean, not ${b}`);\n}\n\nexport function bytes(b: Uint8Array | undefined, ...lengths: number[]) {\n  if (!(b instanceof Uint8Array)) throw new Error('Expected Uint8Array');\n  if (lengths.length > 0 && !lengths.includes(b.length))\n    throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\n\ntype Hash = {\n  (data: Uint8Array): Uint8Array;\n  blockLen: number;\n  outputLen: number;\n  create: any;\n};\nexport function hash(hash: Hash) {\n  if (typeof hash !== 'function' || typeof hash.create !== 'function')\n    throw new Error('Hash should be wrapped by utils.wrapConstructor');\n  number(hash.outputLen);\n  number(hash.blockLen);\n}\n\nexport function exists(instance: any, checkFinished = true) {\n  if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n  if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\nexport function output(out: any, instance: any) {\n  bytes(out);\n  const min = instance.outputLen;\n  if (out.length < min) {\n    throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n  }\n}\n\nconst assert = {\n  number,\n  bool,\n  bytes,\n  hash,\n  exists,\n  output,\n};\n\nexport default assert;\n", "import assert from './_assert.js';\nimport { Hash, CHash, Input, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC<T extends Hash<T>> extends Hash<HMAC<T>> {\n  oHash: T;\n  iHash: T;\n  blockLen: number;\n  outputLen: number;\n  private finished = false;\n  private destroyed = false;\n\n  constructor(hash: CHash, _key: Input) {\n    super();\n    assert.hash(hash);\n    const key = toBytes(_key);\n    this.iHash = hash.create() as T;\n    if (typeof this.iHash.update !== 'function')\n      throw new Error('Expected instance of class which extends utils.Hash');\n    this.blockLen = this.iHash.blockLen;\n    this.outputLen = this.iHash.outputLen;\n    const blockLen = this.blockLen;\n    const pad = new Uint8Array(blockLen);\n    // blockLen can be bigger than outputLen\n    pad.set(key.length > blockLen ? hash.create().update(key).digest() : key);\n    for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36;\n    this.iHash.update(pad);\n    // By doing update (processing of first block) of outer hash here we can re-use it between multiple calls via clone\n    this.oHash = hash.create() as T;\n    // Undo internal XOR && apply outer XOR\n    for (let i = 0; i < pad.length; i++) pad[i] ^= 0x36 ^ 0x5c;\n    this.oHash.update(pad);\n    pad.fill(0);\n  }\n  update(buf: Input) {\n    assert.exists(this);\n    this.iHash.update(buf);\n    return this;\n  }\n  digestInto(out: Uint8Array) {\n    assert.exists(this);\n    assert.bytes(out, this.outputLen);\n    this.finished = true;\n    this.iHash.digestInto(out);\n    this.oHash.update(out);\n    this.oHash.digestInto(out);\n    this.destroy();\n  }\n  digest() {\n    const out = new Uint8Array(this.oHash.outputLen);\n    this.digestInto(out);\n    return out;\n  }\n  _cloneInto(to?: HMAC<T>): HMAC<T> {\n    // Create new instance without calling constructor since key already in state and we don't know it.\n    to ||= Object.create(Object.getPrototypeOf(this), {});\n    const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n    to = to as this;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    to.blockLen = blockLen;\n    to.outputLen = outputLen;\n    to.oHash = oHash._cloneInto(to.oHash);\n    to.iHash = iHash._cloneInto(to.iHash);\n    return to;\n  }\n  destroy() {\n    this.destroyed = true;\n    this.oHash.destroy();\n    this.iHash.destroy();\n  }\n}\n\n/**\n * HMAC: RFC2104 message authentication code.\n * @param hash - function that would be used e.g. sha256\n * @param key - message key\n * @param message - message data\n */\nexport const hmac = (hash: CHash, key: Input, message: Input): Uint8Array =>\n  new HMAC<any>(hash, key).update(message).digest();\nhmac.create = (hash: CHash, key: Input) => new HMAC<any>(hash, key);\n", "import assert from './_assert.js';\nimport { CHash, Input, toBytes } from './utils.js';\nimport { hmac } from './hmac.js';\n\n// HKDF (RFC 5869)\n// https://soatok.blog/2021/11/17/understanding-hkdf/\n\n/**\n * HKDF-Extract(IKM, salt) -> PRK\n * Arguments position differs from spec (IKM is first one, since it is not optional)\n * @param hash\n * @param ikm\n * @param salt\n * @returns\n */\nexport function extract(hash: CHash, ikm: Input, salt?: Input) {\n  assert.hash(hash);\n  // NOTE: some libraries treat zero-length array as 'not provided';\n  // we don't, since we have undefined as 'not provided'\n  // https://github.com/RustCrypto/KDFs/issues/15\n  if (salt === undefined) salt = new Uint8Array(hash.outputLen); // if not provided, it is set to a string of HashLen zeros\n  return hmac(hash, toBytes(salt), toBytes(ikm));\n}\n\n// HKDF-Expand(PRK, info, L) -> OKM\nconst HKDF_COUNTER = new Uint8Array([0]);\nconst EMPTY_BUFFER = new Uint8Array();\n\n/**\n * HKDF-expand from the spec.\n * @param prk - a pseudorandom key of at least HashLen octets (usually, the output from the extract step)\n * @param info - optional context and application specific information (can be a zero-length string)\n * @param length - length of output keying material in octets\n */\nexport function expand(hash: CHash, prk: Input, info?: Input, length: number = 32) {\n  assert.hash(hash);\n  assert.number(length);\n  if (length > 255 * hash.outputLen) throw new Error('Length should be <= 255*HashLen');\n  const blocks = Math.ceil(length / hash.outputLen);\n  if (info === undefined) info = EMPTY_BUFFER;\n  // first L(ength) octets of T\n  const okm = new Uint8Array(blocks * hash.outputLen);\n  // Re-use HMAC instance between blocks\n  const HMAC = hmac.create(hash, prk);\n  const HMACTmp = HMAC._cloneInto();\n  const T = new Uint8Array(HMAC.outputLen);\n  for (let counter = 0; counter < blocks; counter++) {\n    HKDF_COUNTER[0] = counter + 1;\n    // T(0) = empty string (zero length)\n    // T(N) = HMAC-Hash(PRK, T(N-1) | info | N)\n    HMACTmp.update(counter === 0 ? EMPTY_BUFFER : T)\n      .update(info)\n      .update(HKDF_COUNTER)\n      .digestInto(T);\n    okm.set(T, hash.outputLen * counter);\n    HMAC._cloneInto(HMACTmp);\n  }\n  HMAC.destroy();\n  HMACTmp.destroy();\n  T.fill(0);\n  HKDF_COUNTER.fill(0);\n  return okm.slice(0, length);\n}\n\n/**\n * HKDF (RFC 5869): extract + expand in one step.\n * @param hash - hash function that would be used (e.g. sha256)\n * @param ikm - input keying material, the initial key\n * @param salt - optional salt value (a non-secret random value)\n * @param info - optional context and application specific information\n * @param length - length of output keying material in octets\n */\nexport const hkdf = (\n  hash: CHash,\n  ikm: Input,\n  salt: Input | undefined,\n  info: Input | undefined,\n  length: number\n) => expand(hash, extract(hash, ikm, salt), info, length);\n", "import assert from './_assert.js';\nimport { Hash, createView, Input, toBytes } from './utils.js';\n\n// Polyfill for Safari 14\nfunction setBigUint64(view: DataView, byteOffset: number, value: bigint, isLE: boolean): void {\n  if (typeof view.setBigUint64 === 'function') return view.setBigUint64(byteOffset, value, isLE);\n  const _32n = BigInt(32);\n  const _u32_max = BigInt(0xffffffff);\n  const wh = Number((value >> _32n) & _u32_max);\n  const wl = Number(value & _u32_max);\n  const h = isLE ? 4 : 0;\n  const l = isLE ? 0 : 4;\n  view.setUint32(byteOffset + h, wh, isLE);\n  view.setUint32(byteOffset + l, wl, isLE);\n}\n\n// Base SHA2 class (RFC 6234)\nexport abstract class SHA2<T extends SHA2<T>> extends Hash<T> {\n  protected abstract process(buf: DataView, offset: number): void;\n  protected abstract get(): number[];\n  protected abstract set(...args: number[]): void;\n  abstract destroy(): void;\n  protected abstract roundClean(): void;\n  // For partial updates less than block size\n  protected buffer: Uint8Array;\n  protected view: DataView;\n  protected finished = false;\n  protected length = 0;\n  protected pos = 0;\n  protected destroyed = false;\n\n  constructor(\n    readonly blockLen: number,\n    public outputLen: number,\n    readonly padOffset: number,\n    readonly isLE: boolean\n  ) {\n    super();\n    this.buffer = new Uint8Array(blockLen);\n    this.view = createView(this.buffer);\n  }\n  update(data: Input): this {\n    assert.exists(this);\n    const { view, buffer, blockLen } = this;\n    data = toBytes(data);\n    const len = data.length;\n    for (let pos = 0; pos < len; ) {\n      const take = Math.min(blockLen - this.pos, len - pos);\n      // Fast path: we have at least one block in input, cast it to view and process\n      if (take === blockLen) {\n        const dataView = createView(data);\n        for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);\n        continue;\n      }\n      buffer.set(data.subarray(pos, pos + take), this.pos);\n      this.pos += take;\n      pos += take;\n      if (this.pos === blockLen) {\n        this.process(view, 0);\n        this.pos = 0;\n      }\n    }\n    this.length += data.length;\n    this.roundClean();\n    return this;\n  }\n  digestInto(out: Uint8Array) {\n    assert.exists(this);\n    assert.output(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    this.buffer.subarray(pos).fill(0);\n    // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n    if (this.padOffset > blockLen - pos) {\n      this.process(view, 0);\n      pos = 0;\n    }\n    // Pad until full block byte with zeros\n    for (let i = pos; i < blockLen; i++) buffer[i] = 0;\n    // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n    // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n    // So we just write lowest 64 bits of that value.\n    setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n    this.process(view, 0);\n    const oview = createView(out);\n    const len = this.outputLen;\n    // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n    if (len % 4) throw new Error('_sha2: outputLen should be aligned to 32bit');\n    const outLen = len / 4;\n    const state = this.get();\n    if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n    for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n  }\n  digest() {\n    const { buffer, outputLen } = this;\n    this.digestInto(buffer);\n    const res = buffer.slice(0, outputLen);\n    this.destroy();\n    return res;\n  }\n  _cloneInto(to?: T): T {\n    to ||= new (this.constructor as any)() as T;\n    to.set(...this.get());\n    const { blockLen, buffer, length, finished, destroyed, pos } = this;\n    to.length = length;\n    to.pos = pos;\n    to.finished = finished;\n    to.destroyed = destroyed;\n    if (length % blockLen) to.buffer.set(buffer);\n    return to;\n  }\n}\n", "import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n\n// Choice: a ? b : c\nconst Chi = (a: number, b: number, c: number) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a: number, b: number, c: number) => (a & b) ^ (a & c) ^ (b & c);\n\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = new Uint32Array([\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = new Uint32Array([\n  0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = new Uint32Array(64);\nclass SHA256 extends SHA2<SHA256> {\n  // We cannot use array here since array allows indexing by variable\n  // which means optimizer/compiler cannot use registers.\n  A = IV[0] | 0;\n  B = IV[1] | 0;\n  C = IV[2] | 0;\n  D = IV[3] | 0;\n  E = IV[4] | 0;\n  F = IV[5] | 0;\n  G = IV[6] | 0;\n  H = IV[7] | 0;\n\n  constructor() {\n    super(64, 32, 8, false);\n  }\n  protected get(): [number, number, number, number, number, number, number, number] {\n    const { A, B, C, D, E, F, G, H } = this;\n    return [A, B, C, D, E, F, G, H];\n  }\n  // prettier-ignore\n  protected set(\n    A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n  ) {\n    this.A = A | 0;\n    this.B = B | 0;\n    this.C = C | 0;\n    this.D = D | 0;\n    this.E = E | 0;\n    this.F = F | 0;\n    this.G = G | 0;\n    this.H = H | 0;\n  }\n  protected process(view: DataView, offset: number): void {\n    // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n    for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);\n    for (let i = 16; i < 64; i++) {\n      const W15 = SHA256_W[i - 15];\n      const W2 = SHA256_W[i - 2];\n      const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n      const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n      SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n    }\n    // Compression function main loop, 64 rounds\n    let { A, B, C, D, E, F, G, H } = this;\n    for (let i = 0; i < 64; i++) {\n      const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n      const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n      const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n      const T2 = (sigma0 + Maj(A, B, C)) | 0;\n      H = G;\n      G = F;\n      F = E;\n      E = (D + T1) | 0;\n      D = C;\n      C = B;\n      B = A;\n      A = (T1 + T2) | 0;\n    }\n    // Add the compressed chunk to the current hash value\n    A = (A + this.A) | 0;\n    B = (B + this.B) | 0;\n    C = (C + this.C) | 0;\n    D = (D + this.D) | 0;\n    E = (E + this.E) | 0;\n    F = (F + this.F) | 0;\n    G = (G + this.G) | 0;\n    H = (H + this.H) | 0;\n    this.set(A, B, C, D, E, F, G, H);\n  }\n  protected roundClean() {\n    SHA256_W.fill(0);\n  }\n  destroy() {\n    this.set(0, 0, 0, 0, 0, 0, 0, 0);\n    this.buffer.fill(0);\n  }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n  A = 0xc1059ed8 | 0;\n  B = 0x367cd507 | 0;\n  C = 0x3070dd17 | 0;\n  D = 0xf70e5939 | 0;\n  E = 0xffc00b31 | 0;\n  F = 0x68581511 | 0;\n  G = 0x64f98fa7 | 0;\n  H = 0xbefa4fa4 | 0;\n  constructor() {\n    super();\n    this.outputLen = 28;\n  }\n}\n\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = wrapConstructor(() => new SHA256());\nexport const sha224 = wrapConstructor(() => new SHA224());\n", "// nip44.ts\nimport { chacha20 } from \"@noble/ciphers/chacha\";\nimport { equalBytes } from \"@noble/ciphers/utils\";\nimport { secp256k1 } from \"@noble/curves/secp256k1\";\nimport { extract as hkdf_extract, expand as hkdf_expand } from \"@noble/hashes/hkdf\";\nimport { hmac } from \"@noble/hashes/hmac\";\nimport { sha256 } from \"@noble/hashes/sha256\";\nimport { concatBytes, randomBytes } from \"@noble/hashes/utils\";\nimport { base64 } from \"@scure/base\";\n\n// utils.ts\nvar utf8Decoder = new TextDecoder(\"utf-8\");\nvar utf8Encoder = new TextEncoder();\n\n// nip44.ts\nvar minPlaintextSize = 1;\nvar maxPlaintextSize = 65535;\nfunction getConversationKey(privkeyA, pubkeyB) {\n  const sharedX = secp256k1.getSharedSecret(privkeyA, \"02\" + pubkeyB).subarray(1, 33);\n  return hkdf_extract(sha256, sharedX, \"nip44-v2\");\n}\nfunction getMessageKeys(conversationKey, nonce) {\n  const keys = hkdf_expand(sha256, conversationKey, nonce, 76);\n  return {\n    chacha_key: keys.subarray(0, 32),\n    chacha_nonce: keys.subarray(32, 44),\n    hmac_key: keys.subarray(44, 76)\n  };\n}\nfunction calcPaddedLen(len) {\n  if (!Number.isSafeInteger(len) || len < 1)\n    throw new Error(\"expected positive integer\");\n  if (len <= 32)\n    return 32;\n  const nextPower = 1 << Math.floor(Math.log2(len - 1)) + 1;\n  const chunk = nextPower <= 256 ? 32 : nextPower / 8;\n  return chunk * (Math.floor((len - 1) / chunk) + 1);\n}\nfunction writeU16BE(num) {\n  if (!Number.isSafeInteger(num) || num < minPlaintextSize || num > maxPlaintextSize)\n    throw new Error(\"invalid plaintext size: must be between 1 and 65535 bytes\");\n  const arr = new Uint8Array(2);\n  new DataView(arr.buffer).setUint16(0, num, false);\n  return arr;\n}\nfunction pad(plaintext) {\n  const unpadded = utf8Encoder.encode(plaintext);\n  const unpaddedLen = unpadded.length;\n  const prefix = writeU16BE(unpaddedLen);\n  const suffix = new Uint8Array(calcPaddedLen(unpaddedLen) - unpaddedLen);\n  return concatBytes(prefix, unpadded, suffix);\n}\nfunction unpad(padded) {\n  const unpaddedLen = new DataView(padded.buffer).getUint16(0);\n  const unpadded = padded.subarray(2, 2 + unpaddedLen);\n  if (unpaddedLen < minPlaintextSize || unpaddedLen > maxPlaintextSize || unpadded.length !== unpaddedLen || padded.length !== 2 + calcPaddedLen(unpaddedLen))\n    throw new Error(\"invalid padding\");\n  return utf8Decoder.decode(unpadded);\n}\nfunction hmacAad(key, message, aad) {\n  if (aad.length !== 32)\n    throw new Error(\"AAD associated data must be 32 bytes\");\n  const combined = concatBytes(aad, message);\n  return hmac(sha256, key, combined);\n}\nfunction decodePayload(payload) {\n  if (typeof payload !== \"string\")\n    throw new Error(\"payload must be a valid string\");\n  const plen = payload.length;\n  if (plen < 132 || plen > 87472)\n    throw new Error(\"invalid payload length: \" + plen);\n  if (payload[0] === \"#\")\n    throw new Error(\"unknown encryption version\");\n  let data;\n  try {\n    data = base64.decode(payload);\n  } catch (error) {\n    throw new Error(\"invalid base64: \" + error.message);\n  }\n  const dlen = data.length;\n  if (dlen < 99 || dlen > 65603)\n    throw new Error(\"invalid data length: \" + dlen);\n  const vers = data[0];\n  if (vers !== 2)\n    throw new Error(\"unknown encryption version \" + vers);\n  return {\n    nonce: data.subarray(1, 33),\n    ciphertext: data.subarray(33, -32),\n    mac: data.subarray(-32)\n  };\n}\nfunction encrypt(plaintext, conversationKey, nonce = randomBytes(32)) {\n  const { chacha_key, chacha_nonce, hmac_key } = getMessageKeys(conversationKey, nonce);\n  const padded = pad(plaintext);\n  const ciphertext = chacha20(chacha_key, chacha_nonce, padded);\n  const mac = hmacAad(hmac_key, ciphertext, nonce);\n  return base64.encode(concatBytes(new Uint8Array([2]), nonce, ciphertext, mac));\n}\nfunction decrypt(payload, conversationKey) {\n  const { nonce, ciphertext, mac } = decodePayload(payload);\n  const { chacha_key, chacha_nonce, hmac_key } = getMessageKeys(conversationKey, nonce);\n  const calculatedMac = hmacAad(hmac_key, ciphertext, nonce);\n  if (!equalBytes(calculatedMac, mac))\n    throw new Error(\"invalid MAC\");\n  const padded = chacha20(chacha_key, chacha_nonce, ciphertext);\n  return unpad(padded);\n}\nvar v2 = {\n  utils: {\n    getConversationKey,\n    calcPaddedLen\n  },\n  encrypt,\n  decrypt\n};\nexport {\n  decrypt,\n  encrypt,\n  getConversationKey,\n  v2\n};\n", "import assert from './_assert.js';\nimport { hmac } from './hmac.js';\nimport { Hash, CHash, Input, createView, toBytes, checkOpts, asyncLoop } from './utils.js';\n\n// PBKDF (RFC 2898)\nexport type Pbkdf2Opt = {\n  c: number; // Iterations\n  dkLen?: number; // Desired key length in bytes (Intended output length in octets of the derived key\n  asyncTick?: number; // Maximum time in ms for which async function can block execution\n};\n// Common prologue and epilogue for sync/async functions\nfunction pbkdf2Init(hash: CHash, _password: Input, _salt: Input, _opts: Pbkdf2Opt) {\n  assert.hash(hash);\n  const opts = checkOpts({ dkLen: 32, asyncTick: 10 }, _opts);\n  const { c, dkLen, asyncTick } = opts;\n  assert.number(c);\n  assert.number(dkLen);\n  assert.number(asyncTick);\n  if (c < 1) throw new Error('PBKDF2: iterations (c) should be >= 1');\n  const password = toBytes(_password);\n  const salt = toBytes(_salt);\n  // DK = PBKDF2(PRF, Password, Salt, c, dkLen);\n  const DK = new Uint8Array(dkLen);\n  // U1 = PRF(Password, Salt + INT_32_BE(i))\n  const PRF = hmac.create(hash, password);\n  const PRFSalt = PRF._cloneInto().update(salt);\n  return { c, dkLen, asyncTick, DK, PRF, PRFSalt };\n}\n\nfunction pbkdf2Output<T extends Hash<T>>(\n  PRF: Hash<T>,\n  PRFSalt: Hash<T>,\n  DK: Uint8Array,\n  prfW: Hash<T>,\n  u: Uint8Array\n) {\n  PRF.destroy();\n  PRFSalt.destroy();\n  if (prfW) prfW.destroy();\n  u.fill(0);\n  return DK;\n}\n\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function\n * @param hash - hash function that would be used e.g. sha256\n * @param password - password from which a derived key is generated\n * @param salt - cryptographic salt\n * @param opts - {c, dkLen} where c is work factor and dkLen is output message size\n */\nexport function pbkdf2(hash: CHash, password: Input, salt: Input, opts: Pbkdf2Opt) {\n  const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n  let prfW: any; // Working copy\n  const arr = new Uint8Array(4);\n  const view = createView(arr);\n  const u = new Uint8Array(PRF.outputLen);\n  // DK = T1 + T2 + \u22EF + Tdklen/hlen\n  for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n    // Ti = F(Password, Salt, c, i)\n    const Ti = DK.subarray(pos, pos + PRF.outputLen);\n    view.setInt32(0, ti, false);\n    // F(Password, Salt, c, i) = U1 ^ U2 ^ \u22EF ^ Uc\n    // U1 = PRF(Password, Salt + INT_32_BE(i))\n    (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n    Ti.set(u.subarray(0, Ti.length));\n    for (let ui = 1; ui < c; ui++) {\n      // Uc = PRF(Password, Uc\u22121)\n      PRF._cloneInto(prfW).update(u).digestInto(u);\n      for (let i = 0; i < Ti.length; i++) Ti[i] ^= u[i];\n    }\n  }\n  return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n\nexport async function pbkdf2Async(hash: CHash, password: Input, salt: Input, opts: Pbkdf2Opt) {\n  const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n  let prfW: any; // Working copy\n  const arr = new Uint8Array(4);\n  const view = createView(arr);\n  const u = new Uint8Array(PRF.outputLen);\n  // DK = T1 + T2 + \u22EF + Tdklen/hlen\n  for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n    // Ti = F(Password, Salt, c, i)\n    const Ti = DK.subarray(pos, pos + PRF.outputLen);\n    view.setInt32(0, ti, false);\n    // F(Password, Salt, c, i) = U1 ^ U2 ^ \u22EF ^ Uc\n    // U1 = PRF(Password, Salt + INT_32_BE(i))\n    (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n    Ti.set(u.subarray(0, Ti.length));\n    await asyncLoop(c - 1, asyncTick, (i) => {\n      // Uc = PRF(Password, Uc\u22121)\n      PRF._cloneInto(prfW).update(u).digestInto(u);\n      for (let i = 0; i < Ti.length; i++) Ti[i] ^= u[i];\n    });\n  }\n  return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n", "import assert from './_assert.js';\nimport { sha256 } from './sha256.js';\nimport { pbkdf2 } from './pbkdf2.js';\nimport { asyncLoop, checkOpts, Input, u32 } from './utils.js';\n\n// RFC 7914 Scrypt KDF\n\n// Left rotate for uint32\nconst rotl = (a: number, b: number) => (a << b) | (a >>> (32 - b));\n\n// The main Scrypt loop: uses Salsa extensively.\n// Six versions of the function were tried, this is the fastest one.\n// prettier-ignore\nfunction XorAndSalsa(\n  prev: Uint32Array,\n  pi: number,\n  input: Uint32Array,\n  ii: number,\n  out: Uint32Array,\n  oi: number\n) {\n  // Based on https://cr.yp.to/salsa20.html\n  // Xor blocks\n  let y00 = prev[pi++] ^ input[ii++], y01 = prev[pi++] ^ input[ii++];\n  let y02 = prev[pi++] ^ input[ii++], y03 = prev[pi++] ^ input[ii++];\n  let y04 = prev[pi++] ^ input[ii++], y05 = prev[pi++] ^ input[ii++];\n  let y06 = prev[pi++] ^ input[ii++], y07 = prev[pi++] ^ input[ii++];\n  let y08 = prev[pi++] ^ input[ii++], y09 = prev[pi++] ^ input[ii++];\n  let y10 = prev[pi++] ^ input[ii++], y11 = prev[pi++] ^ input[ii++];\n  let y12 = prev[pi++] ^ input[ii++], y13 = prev[pi++] ^ input[ii++];\n  let y14 = prev[pi++] ^ input[ii++], y15 = prev[pi++] ^ input[ii++];\n  // Save state to temporary variables (salsa)\n  let x00 = y00, x01 = y01, x02 = y02, x03 = y03,\n      x04 = y04, x05 = y05, x06 = y06, x07 = y07,\n      x08 = y08, x09 = y09, x10 = y10, x11 = y11,\n      x12 = y12, x13 = y13, x14 = y14, x15 = y15;\n  // Main loop (salsa)\n  for (let i = 0; i < 8; i += 2) {\n    x04 ^= rotl(x00 + x12 | 0,  7); x08 ^= rotl(x04 + x00 | 0,  9);\n    x12 ^= rotl(x08 + x04 | 0, 13); x00 ^= rotl(x12 + x08 | 0, 18);\n    x09 ^= rotl(x05 + x01 | 0,  7); x13 ^= rotl(x09 + x05 | 0,  9);\n    x01 ^= rotl(x13 + x09 | 0, 13); x05 ^= rotl(x01 + x13 | 0, 18);\n    x14 ^= rotl(x10 + x06 | 0,  7); x02 ^= rotl(x14 + x10 | 0,  9);\n    x06 ^= rotl(x02 + x14 | 0, 13); x10 ^= rotl(x06 + x02 | 0, 18);\n    x03 ^= rotl(x15 + x11 | 0,  7); x07 ^= rotl(x03 + x15 | 0,  9);\n    x11 ^= rotl(x07 + x03 | 0, 13); x15 ^= rotl(x11 + x07 | 0, 18);\n    x01 ^= rotl(x00 + x03 | 0,  7); x02 ^= rotl(x01 + x00 | 0,  9);\n    x03 ^= rotl(x02 + x01 | 0, 13); x00 ^= rotl(x03 + x02 | 0, 18);\n    x06 ^= rotl(x05 + x04 | 0,  7); x07 ^= rotl(x06 + x05 | 0,  9);\n    x04 ^= rotl(x07 + x06 | 0, 13); x05 ^= rotl(x04 + x07 | 0, 18);\n    x11 ^= rotl(x10 + x09 | 0,  7); x08 ^= rotl(x11 + x10 | 0,  9);\n    x09 ^= rotl(x08 + x11 | 0, 13); x10 ^= rotl(x09 + x08 | 0, 18);\n    x12 ^= rotl(x15 + x14 | 0,  7); x13 ^= rotl(x12 + x15 | 0,  9);\n    x14 ^= rotl(x13 + x12 | 0, 13); x15 ^= rotl(x14 + x13 | 0, 18);\n  }\n  // Write output (salsa)\n  out[oi++] = (y00 + x00) | 0; out[oi++] = (y01 + x01) | 0;\n  out[oi++] = (y02 + x02) | 0; out[oi++] = (y03 + x03) | 0;\n  out[oi++] = (y04 + x04) | 0; out[oi++] = (y05 + x05) | 0;\n  out[oi++] = (y06 + x06) | 0; out[oi++] = (y07 + x07) | 0;\n  out[oi++] = (y08 + x08) | 0; out[oi++] = (y09 + x09) | 0;\n  out[oi++] = (y10 + x10) | 0; out[oi++] = (y11 + x11) | 0;\n  out[oi++] = (y12 + x12) | 0; out[oi++] = (y13 + x13) | 0;\n  out[oi++] = (y14 + x14) | 0; out[oi++] = (y15 + x15) | 0;\n}\n\nfunction BlockMix(input: Uint32Array, ii: number, out: Uint32Array, oi: number, r: number) {\n  // The block B is r 128-byte chunks (which is equivalent of 2r 64-byte chunks)\n  let head = oi + 0;\n  let tail = oi + 16 * r;\n  for (let i = 0; i < 16; i++) out[tail + i] = input[ii + (2 * r - 1) * 16 + i]; // X \u2190 B[2r\u22121]\n  for (let i = 0; i < r; i++, head += 16, ii += 16) {\n    // We write odd & even Yi at same time. Even: 0bXXXXX0 Odd:  0bXXXXX1\n    XorAndSalsa(out, tail, input, ii, out, head); // head[i] = Salsa(blockIn[2*i] ^ tail[i-1])\n    if (i > 0) tail += 16; // First iteration overwrites tmp value in tail\n    XorAndSalsa(out, head, input, (ii += 16), out, tail); // tail[i] = Salsa(blockIn[2*i+1] ^ head[i])\n  }\n}\n\nexport type ScryptOpts = {\n  N: number; // cost factor\n  r: number; // block size\n  p: number; // parallelization\n  dkLen?: number; // key length\n  asyncTick?: number; // block execution max time\n  maxmem?: number;\n  onProgress?: (progress: number) => void;\n};\n\n// Common prologue and epilogue for sync/async functions\nfunction scryptInit(password: Input, salt: Input, _opts?: ScryptOpts) {\n  // Maxmem - 1GB+1KB by default\n  const opts = checkOpts(\n    {\n      dkLen: 32,\n      asyncTick: 10,\n      maxmem: 1024 ** 3 + 1024,\n    },\n    _opts\n  );\n  const { N, r, p, dkLen, asyncTick, maxmem, onProgress } = opts;\n  assert.number(N);\n  assert.number(r);\n  assert.number(p);\n  assert.number(dkLen);\n  assert.number(asyncTick);\n  assert.number(maxmem);\n  if (onProgress !== undefined && typeof onProgress !== 'function')\n    throw new Error('progressCb should be function');\n  const blockSize = 128 * r;\n  const blockSize32 = blockSize / 4;\n  if (N <= 1 || (N & (N - 1)) !== 0 || N >= 2 ** (blockSize / 8) || N > 2 ** 32) {\n    // NOTE: we limit N to be less than 2**32 because of 32 bit variant of Integrify function\n    // There is no JS engines that allows alocate more than 4GB per single Uint8Array for now, but can change in future.\n    throw new Error(\n      'Scrypt: N must be larger than 1, a power of 2, less than 2^(128 * r / 8) and less than 2^32'\n    );\n  }\n  if (p < 0 || p > ((2 ** 32 - 1) * 32) / blockSize) {\n    throw new Error(\n      'Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)'\n    );\n  }\n  if (dkLen < 0 || dkLen > (2 ** 32 - 1) * 32) {\n    throw new Error(\n      'Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32'\n    );\n  }\n  const memUsed = blockSize * (N + p);\n  if (memUsed > maxmem) {\n    throw new Error(\n      `Scrypt: parameters too large, ${memUsed} (128 * r * (N + p)) > ${maxmem} (maxmem)`\n    );\n  }\n  // [B0...Bp\u22121] \u2190 PBKDF2HMAC-SHA256(Passphrase, Salt, 1, blockSize*ParallelizationFactor)\n  // Since it has only one iteration there is no reason to use async variant\n  const B = pbkdf2(sha256, password, salt, { c: 1, dkLen: blockSize * p });\n  const B32 = u32(B);\n  // Re-used between parallel iterations. Array(iterations) of B\n  const V = u32(new Uint8Array(blockSize * N));\n  const tmp = u32(new Uint8Array(blockSize));\n  let blockMixCb = () => {};\n  if (onProgress) {\n    const totalBlockMix = 2 * N * p;\n    // Invoke callback if progress changes from 10.01 to 10.02\n    // Allows to draw smooth progress bar on up to 8K screen\n    const callbackPer = Math.max(Math.floor(totalBlockMix / 10000), 1);\n    let blockMixCnt = 0;\n    blockMixCb = () => {\n      blockMixCnt++;\n      if (onProgress && (!(blockMixCnt % callbackPer) || blockMixCnt === totalBlockMix))\n        onProgress(blockMixCnt / totalBlockMix);\n    };\n  }\n  return { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb, asyncTick };\n}\n\nfunction scryptOutput(\n  password: Input,\n  dkLen: number,\n  B: Uint8Array,\n  V: Uint32Array,\n  tmp: Uint32Array\n) {\n  const res = pbkdf2(sha256, password, B, { c: 1, dkLen });\n  B.fill(0);\n  V.fill(0);\n  tmp.fill(0);\n  return res;\n}\n\n/**\n * Scrypt KDF from RFC 7914.\n * @param password - pass\n * @param salt - salt\n * @param opts - parameters\n * - `N` is cpu/mem work factor (power of 2 e.g. 2**18)\n * - `r` is block size (8 is common), fine-tunes sequential memory read size and performance\n * - `p` is parallelization factor (1 is common)\n * - `dkLen` is output key length in bytes e.g. 32.\n * - `asyncTick` - (default: 10) max time in ms for which async function can block execution\n * - `maxmem` - (default: `1024 ** 3 + 1024` aka 1GB+1KB). A limit that the app could use for scrypt\n * - `onProgress` - callback function that would be executed for progress report\n * @returns Derived key\n */\nexport function scrypt(password: Input, salt: Input, opts: ScryptOpts) {\n  const { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb } = scryptInit(\n    password,\n    salt,\n    opts\n  );\n  for (let pi = 0; pi < p; pi++) {\n    const Pi = blockSize32 * pi;\n    for (let i = 0; i < blockSize32; i++) V[i] = B32[Pi + i]; // V[0] = B[i]\n    for (let i = 0, pos = 0; i < N - 1; i++) {\n      BlockMix(V, pos, V, (pos += blockSize32), r); // V[i] = BlockMix(V[i-1]);\n      blockMixCb();\n    }\n    BlockMix(V, (N - 1) * blockSize32, B32, Pi, r); // Process last element\n    blockMixCb();\n    for (let i = 0; i < N; i++) {\n      // First u32 of the last 64-byte block (u32 is LE)\n      const j = B32[Pi + blockSize32 - 16] % N; // j = Integrify(X) % iterations\n      for (let k = 0; k < blockSize32; k++) tmp[k] = B32[Pi + k] ^ V[j * blockSize32 + k]; // tmp = B ^ V[j]\n      BlockMix(tmp, 0, B32, Pi, r); // B = BlockMix(B ^ V[j])\n      blockMixCb();\n    }\n  }\n  return scryptOutput(password, dkLen, B, V, tmp);\n}\n\n/**\n * Scrypt KDF from RFC 7914.\n */\nexport async function scryptAsync(password: Input, salt: Input, opts: ScryptOpts) {\n  const { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb, asyncTick } = scryptInit(\n    password,\n    salt,\n    opts\n  );\n  for (let pi = 0; pi < p; pi++) {\n    const Pi = blockSize32 * pi;\n    for (let i = 0; i < blockSize32; i++) V[i] = B32[Pi + i]; // V[0] = B[i]\n    let pos = 0;\n    await asyncLoop(N - 1, asyncTick, (i) => {\n      BlockMix(V, pos, V, (pos += blockSize32), r); // V[i] = BlockMix(V[i-1]);\n      blockMixCb();\n    });\n    BlockMix(V, (N - 1) * blockSize32, B32, Pi, r); // Process last element\n    blockMixCb();\n    await asyncLoop(N, asyncTick, (i) => {\n      // First u32 of the last 64-byte block (u32 is LE)\n      const j = B32[Pi + blockSize32 - 16] % N; // j = Integrify(X) % iterations\n      for (let k = 0; k < blockSize32; k++) tmp[k] = B32[Pi + k] ^ V[j * blockSize32 + k]; // tmp = B ^ V[j]\n      BlockMix(tmp, 0, B32, Pi, r); // B = BlockMix(B ^ V[j])\n      blockMixCb();\n    });\n  }\n  return scryptOutput(password, dkLen, B, V, tmp);\n}\n", "// nip49.ts\nimport { scrypt } from \"@noble/hashes/scrypt\";\nimport { xchacha20poly1305 } from \"@noble/ciphers/chacha\";\nimport { concatBytes as concatBytes2, randomBytes } from \"@noble/hashes/utils\";\n\n// nip19.ts\nimport { bytesToHex, concatBytes, hexToBytes } from \"@noble/hashes/utils\";\nimport { bech32 } from \"@scure/base\";\nvar Bech32MaxSize = 5e3;\nfunction encodeBech32(prefix, data) {\n  let words = bech32.toWords(data);\n  return bech32.encode(prefix, words, Bech32MaxSize);\n}\nfunction encodeBytes(prefix, bytes) {\n  return encodeBech32(prefix, bytes);\n}\n\n// nip49.ts\nimport { bech32 as bech322 } from \"@scure/base\";\nfunction encrypt(sec, password, logn = 16, ksb = 2) {\n  let salt = randomBytes(16);\n  let n = 2 ** logn;\n  let key = scrypt(password.normalize(\"NFKC\"), salt, { N: n, r: 8, p: 1, dkLen: 32 });\n  let nonce = randomBytes(24);\n  let aad = Uint8Array.from([ksb]);\n  let xc2p1 = xchacha20poly1305(key, nonce, aad);\n  let ciphertext = xc2p1.encrypt(sec);\n  let b = concatBytes2(Uint8Array.from([2]), Uint8Array.from([logn]), salt, nonce, aad, ciphertext);\n  return encodeBytes(\"ncryptsec\", b);\n}\nfunction decrypt(ncryptsec, password) {\n  let { prefix, words } = bech322.decode(ncryptsec, Bech32MaxSize);\n  if (prefix !== \"ncryptsec\") {\n    throw new Error(`invalid prefix ${prefix}, expected 'ncryptsec'`);\n  }\n  let b = new Uint8Array(bech322.fromWords(words));\n  let version = b[0];\n  if (version !== 2) {\n    throw new Error(`invalid version ${version}, expected 0x02`);\n  }\n  let logn = b[1];\n  let n = 2 ** logn;\n  let salt = b.slice(2, 2 + 16);\n  let nonce = b.slice(2 + 16, 2 + 16 + 24);\n  let ksb = b[2 + 16 + 24];\n  let aad = Uint8Array.from([ksb]);\n  let ciphertext = b.slice(2 + 16 + 24 + 1);\n  let key = scrypt(password.normalize(\"NFKC\"), salt, { N: n, r: 8, p: 1, dkLen: 32 });\n  let xc2p1 = xchacha20poly1305(key, nonce, aad);\n  let sec = xc2p1.decrypt(ciphertext);\n  return sec;\n}\nexport {\n  decrypt,\n  encrypt\n};\n", "// pure.ts\nimport { schnorr } from \"@noble/curves/secp256k1\";\nimport { bytesToHex } from \"@noble/hashes/utils\";\n\n// core.ts\nvar verifiedSymbol = Symbol(\"verified\");\nvar isRecord = (obj) => obj instanceof Object;\nfunction validateEvent(event) {\n  if (!isRecord(event))\n    return false;\n  if (typeof event.kind !== \"number\")\n    return false;\n  if (typeof event.content !== \"string\")\n    return false;\n  if (typeof event.created_at !== \"number\")\n    return false;\n  if (typeof event.pubkey !== \"string\")\n    return false;\n  if (!event.pubkey.match(/^[a-f0-9]{64}$/))\n    return false;\n  if (!Array.isArray(event.tags))\n    return false;\n  for (let i2 = 0; i2 < event.tags.length; i2++) {\n    let tag = event.tags[i2];\n    if (!Array.isArray(tag))\n      return false;\n    for (let j = 0; j < tag.length; j++) {\n      if (typeof tag[j] === \"object\")\n        return false;\n    }\n  }\n  return true;\n}\nfunction sortEvents(events) {\n  return events.sort((a, b) => {\n    if (a.created_at !== b.created_at) {\n      return b.created_at - a.created_at;\n    }\n    return a.id.localeCompare(b.id);\n  });\n}\n\n// pure.ts\nimport { sha256 } from \"@noble/hashes/sha256\";\n\n// utils.ts\nvar utf8Decoder = new TextDecoder(\"utf-8\");\nvar utf8Encoder = new TextEncoder();\n\n// pure.ts\nvar JS = class {\n  generateSecretKey() {\n    return schnorr.utils.randomPrivateKey();\n  }\n  getPublicKey(secretKey) {\n    return bytesToHex(schnorr.getPublicKey(secretKey));\n  }\n  finalizeEvent(t, secretKey) {\n    const event = t;\n    event.pubkey = bytesToHex(schnorr.getPublicKey(secretKey));\n    event.id = getEventHash(event);\n    event.sig = bytesToHex(schnorr.sign(getEventHash(event), secretKey));\n    event[verifiedSymbol] = true;\n    return event;\n  }\n  verifyEvent(event) {\n    if (typeof event[verifiedSymbol] === \"boolean\")\n      return event[verifiedSymbol];\n    const hash = getEventHash(event);\n    if (hash !== event.id) {\n      event[verifiedSymbol] = false;\n      return false;\n    }\n    try {\n      const valid = schnorr.verify(event.sig, hash, event.pubkey);\n      event[verifiedSymbol] = valid;\n      return valid;\n    } catch (err) {\n      event[verifiedSymbol] = false;\n      return false;\n    }\n  }\n};\nfunction serializeEvent(evt) {\n  if (!validateEvent(evt))\n    throw new Error(\"can't serialize event with wrong or missing properties\");\n  return JSON.stringify([0, evt.pubkey, evt.created_at, evt.kind, evt.tags, evt.content]);\n}\nfunction getEventHash(event) {\n  let eventHash = sha256(utf8Encoder.encode(serializeEvent(event)));\n  return bytesToHex(eventHash);\n}\nvar i = new JS();\nvar generateSecretKey = i.generateSecretKey;\nvar getPublicKey = i.getPublicKey;\nvar finalizeEvent = i.finalizeEvent;\nvar verifyEvent = i.verifyEvent;\nexport {\n  finalizeEvent,\n  generateSecretKey,\n  getEventHash,\n  getPublicKey,\n  serializeEvent,\n  sortEvents,\n  validateEvent,\n  verifiedSymbol,\n  verifyEvent\n};\n", "import { bytesToHex } from \"@noble/hashes/utils\";\nimport type { Event as NostrEvent, EventTemplate as NostrEventTemplate } from \"nostr-tools\";\nimport * as nip04 from \"nostr-tools/nip04\";\nimport * as nip44 from \"nostr-tools/nip44\";\nimport * as nip49 from \"nostr-tools/nip49\";\nimport { finalizeEvent, generateSecretKey, getPublicKey as pubkeyFromSeckeyBytes } from \"nostr-tools/pure\";\nimport { parseSecKey } from \"./helpers\";\nimport type { NostrSigner, RelayList } from \"./interface\";\n\n/**\n * An implementation of NostrSigner based on a bare secret key in memory.\n *\n * You can create a SecretKeySigner in the following ways:\n *\n * - via the constructor (`new SecretKeySigner(key)`), from secret keys in hex string, bech32 (`nsec1...`) or binary format.\n * - via `SecretKeySigner.fromEncryptedKey()`, from a NIP-49 encrypted secret key (`ncryptsec...`) and a password for it.\n * - via `SecretKeySigner.withRandomKey()`, to make a signer with a random key.\n */\nexport class SecretKeySigner implements NostrSigner {\n  #seckeyHex: string;\n  #seckeyBytes: Uint8Array;\n\n  /**\n   * Creates a SecretKeySigner from a secret key in hex string or bech32 (`nsec1...`) format.\n   *\n   * @param secKeyStr a secret key in hex string or bech32 format\n   */\n  public constructor(secKeyStr: string);\n\n  /**\n   * Creates a SecretKeySigner from a secret key in binary format.\n   *\n   * @param secKeyBytes a secret key in binary format (`Uint8Array`)\n   */\n  public constructor(secKeyBytes: Uint8Array);\n\n  public constructor(secKey: string | Uint8Array) {\n    if (typeof secKey === \"string\") {\n      const res = parseSecKey(secKey);\n      if (res === undefined) {\n        throw Error(\"SecretKeySigner: constructor got an invalid secret key\");\n      }\n      this.#seckeyHex = res.hex;\n      this.#seckeyBytes = res.bytes;\n    } else {\n      // secret key must be 32 bytes length.\n      if (secKey.length !== 32) {\n        throw Error(\"SecretKeySigner: constructor got an invalid secret key\");\n      }\n      this.#seckeyBytes = secKey;\n      this.#seckeyHex = bytesToHex(secKey);\n    }\n  }\n\n  /**\n   *  Creates a SecretKeySigner from a NIP-49 encrypted secret key (`ncryptsec...`) and a password.\n   *\n   * @param ncryptsec NIP-49 encrypted secret key\n   * @param password password to decrypt the secret key\n   */\n  public static fromEncryptedKey(ncryptsec: string, password: string) {\n    return new SecretKeySigner(nip49.decrypt(ncryptsec, password));\n  }\n\n  /**\n   * Creates a SecretKeySigner with a random secret key.\n   */\n  public static withRandomKey(): SecretKeySigner {\n    return new SecretKeySigner(generateSecretKey());\n  }\n\n  /**\n   * Returns the underlying secret key in hex string format.\n   */\n  public get secretKey(): string {\n    return this.#seckeyHex;\n  }\n\n  /**\n   * Returns the public key that corresponds to the underlying secret key, in hex string format.\n   */\n  public get publicKey(): string {\n    return pubkeyFromSeckeyBytes(this.#seckeyBytes);\n  }\n\n  /**\n   * Returns the public key that corresponds to the underlying secret key, in hex string format.\n   */\n  public async getPublicKey(): Promise<string> {\n    return this.publicKey;\n  }\n\n  /**\n   * Returns the list of relays preferred by the user.\n   *\n   * `getRelays()` on `SecretKeySigner` acutually returns an empty list because it doesn't have any information of user preferences about relays.\n   */\n  public async getRelays(): Promise<RelayList> {\n    return {};\n  }\n\n  /**\n   * Signs a given Nostr event with the underlying secret key.\n   *\n   * @param event a Nostr event template (unsigned event)\n   * @returns a Promise that resolves to a signed Nostr event\n   */\n  public async signEvent(event: NostrEventTemplate): Promise<NostrEvent> {\n    return Promise.resolve(finalizeEvent(event, this.#seckeyBytes));\n  }\n\n  /**\n   * Encrypts a given text to secretly communicate with others, by the encryption algorithm defined in [NIP-04](https://github.com/nostr-protocol/nips/blob/master/04.md).\n   *\n   * @param recipientPubkey a public key of a message recipient, in hex string format\n   * @param plaintext a plaintext to encrypt\n   * @returns a Promise that resolves to a encrypted text\n   */\n  public async nip04Encrypt(recipientPubkey: string, plaintext: string): Promise<string> {\n    return nip04.encrypt(this.#seckeyHex, recipientPubkey, plaintext);\n  }\n\n  /**\n   * Decrypts a given ciphertext from others, by the decryption algorithm defined in [NIP-04](https://github.com/nostr-protocol/nips/blob/master/04.md).\n   *\n   * @param senderPubkey a public key of a message sender, in hex string format\n   * @param ciphertext a ciphertext to decrypt\n   * @returns a Promise that resolves to a decrypted text\n   */\n  public async nip04Decrypt(senderPubkey: string, ciphertext: string): Promise<string> {\n    return nip04.decrypt(this.#seckeyHex, senderPubkey, ciphertext);\n  }\n\n  /**\n   * Encrypts a given text to secretly communicate with others, by the encryption algorithm defined in [NIP-44](https://github.com/nostr-protocol/nips/blob/master/44.md).\n   *\n   * @param recipientPubkey a public key of a message recipient, in hex string format\n   * @param plaintext a plaintext to encrypt\n   * @returns a Promise that resolves to a encrypted text\n   */\n  public async nip44Encrypt(recipientPubkey: string, plaintext: string): Promise<string> {\n    const convKey = nip44.v2.utils.getConversationKey(this.#seckeyBytes, recipientPubkey);\n    return nip44.v2.encrypt(plaintext, convKey);\n  }\n\n  /**\n   * Decrypts a given ciphertext from others, by the decryption algorithm defined in [NIP-44](https://github.com/nostr-protocol/nips/blob/master/44.md).\n   *\n   * @param senderPubkey a public key of a message sender, in hex string format\n   * @param ciphertext a ciphertext to decrypt\n   * @returns a Promise that resolves to a decrypted text\n   */\n  public async nip44Decrypt(senderPubkey: string, ciphertext: string): Promise<string> {\n    const convkey = nip44.v2.utils.getConversationKey(this.#seckeyBytes, senderPubkey);\n    return nip44.v2.decrypt(ciphertext, convkey);\n  }\n}\n", "export abstract class RxNostrError extends Error {}\n\n/**\n * This is thrown when WebSocket connection is closed unexpectedly.\n * You may see them in a stream made by `rxNostr.createAllErrorObservable()`.\n */\nexport class RxNostrWebSocketError extends RxNostrError {\n  constructor(public code?: number) {\n    super(\n      `RxNostrWebSocketError: WebSocket was closed with code ${code} by relay.`,\n    );\n    this.name = \"RxNostrWebSocketError\";\n  }\n}\n\n/**\n * This is usually thrown when rx-nostr is used incorrectly (or possibly rx-nostr has a bug).\n * Please fix your program according to the message.\n *\n * Normally, you should not catch the exception.\n */\nexport class RxNostrInvalidUsageError extends RxNostrError {\n  constructor(message: string) {\n    super(`RxNostrInvalidUsageError: ${message}`);\n    this.name = \"RxNostrInvalidUsageError\";\n  }\n}\n\n/**\n * This is usually thrown when rx-nostr is used properly\n * but an error occurs due to external environmental causes.\n */\nexport class RxNostrEnvironmentError extends RxNostrError {\n  constructor(message: string) {\n    super(`RxNostrEnvironmentError: ${message}`);\n    this.name = \"RxNostrEnvironmentError\";\n  }\n}\n\n/**\n * This is thrown only by a bug inside rx-nostr.\n *\n * Normally, you should not catch the exception.\n */\nexport class RxNostrLogicError extends RxNostrError {\n  constructor() {\n    super(\n      \"RxNostrLogicError: This is rx-nostr's internal bug. Please report to the author of the library.\",\n    );\n    this.name = \"RxNostrLogicError\";\n  }\n}\n\n/**\n * This is thrown when you attempt to access a disposed rx-nostr's resource.\n *\n * Normally, you should not catch the exception.\n */\nexport class RxNostrAlreadyDisposedError extends RxNostrError {\n  constructor() {\n    super(\n      \"RxNostrAlreadyDisposedError: Attempted to access a disposed resource.\",\n    );\n    this.name = \"RxNostrAlreadyDisposedError\";\n  }\n}\n", "import { RxNostrLogicError } from \"../error.js\";\nimport { EMPTY, Empty } from \"./empty.js\";\nimport type { OptionalPart, RequiredPart } from \"./types.js\";\n\ntype FilledConfig<C, D> = RequiredPart<C> & {\n  [K in keyof OptionalPart<C>]: K extends keyof D ? NonNullable<C[K]> : C[K];\n};\n\nexport const config = <C>() => ({\n  default: <const D extends Partial<OptionalPart<C>>>(factory: () => D) => {\n    const defaults = factory();\n    let inputs: C | Empty = EMPTY;\n\n    return {\n      set(config: C) {\n        inputs = config;\n      },\n      get<const K extends keyof FilledConfig<C, D>>(\n        key: K,\n      ): FilledConfig<C, D>[K] {\n        if (inputs === EMPTY) {\n          throw new RxNostrLogicError();\n        }\n\n        return (inputs[key] ?? defaults[key]) as FilledConfig<C, D>[K];\n      },\n    };\n  },\n});\n\nexport const fill = <\n  C,\n  const D extends Partial<OptionalPart<C>> = Partial<OptionalPart<C>>,\n>(\n  config: C,\n  defaults: D,\n): FilledConfig<C, D> =>\n  ({\n    ...defaults,\n    ...config,\n  }) as FilledConfig<C, D>;\n", "import * as Nostr from \"nostr-typedef\";\n\nexport function ensureEventFields(\n  event: Partial<Nostr.Event>,\n): event is Nostr.Event {\n  if (typeof event.id !== \"string\") return false;\n  if (typeof event.sig !== \"string\") return false;\n  if (typeof event.kind !== \"number\") return false;\n  if (typeof event.pubkey !== \"string\") return false;\n  if (typeof event.content !== \"string\") return false;\n  if (typeof event.created_at !== \"number\") return false;\n\n  if (!Array.isArray(event.tags)) return false;\n  for (let i = 0; i < event.tags.length; i++) {\n    const tag = event.tags[i];\n    if (!Array.isArray(tag)) return false;\n    for (let j = 0; j < tag.length; j++) {\n      if (typeof tag[j] === \"object\") return false;\n    }\n  }\n\n  return true;\n}\n\n/** Return an event that has earlier `created_at`. */\nexport function earlierEvent(a: Nostr.Event, b: Nostr.Event): Nostr.Event {\n  return compareEvents(a, b) < 0 ? a : b;\n}\n\n/** Return an event that has later `created_at`. */\nexport function laterEvent(a: Nostr.Event, b: Nostr.Event): Nostr.Event {\n  return compareEvents(a, b) < 0 ? b : a;\n}\n\n/** Sort key function to sort events based on `created_at`. */\nexport function compareEvents(a: Nostr.Event, b: Nostr.Event): number {\n  if (a.id === b.id) {\n    return 0;\n  }\n\n  return a.created_at < b.created_at ||\n    // https://github.com/nostr-protocol/nips/blob/master/16.md#replaceable-events\n    (a.created_at === b.created_at && a.id < b.id)\n    ? -1\n    : 1;\n}\n", "export function inlineThrow(err: Error): never {\n  throw err;\n}\n", "import * as Nostr from \"nostr-typedef\";\n\nimport { RxNostrEnvironmentError, RxNostrInvalidUsageError } from \"../error.js\";\nimport { ensureEventFields } from \"../nostr/event.js\";\nimport { inlineThrow } from \"../utils/inline-throw.js\";\n\nexport interface EventSigner {\n  signEvent<K extends number>(\n    params: Nostr.EventParameters<K>,\n  ): Promise<Nostr.Event<K>>;\n  getPublicKey(): Promise<string>;\n}\n\nexport interface EventSignerOptions {\n  /** If set, the set tags is appended to the end of the given event's tags on signing. */\n  tags?: Nostr.Tag.Any[];\n}\n\nexport function nip07Signer(options?: EventSignerOptions): EventSigner {\n  return {\n    async signEvent<K extends number>(\n      params: Nostr.EventParameters<K>,\n    ): Promise<Nostr.Event<K>> {\n      const event = {\n        ...params,\n        pubkey:\n          params.pubkey ??\n          (await window?.nostr?.getPublicKey()) ??\n          inlineThrow(\n            new RxNostrEnvironmentError(\n              \"window.nostr.getPublicKey() is not found\",\n            ),\n          ),\n        tags: [...(params.tags ?? []), ...(options?.tags ?? [])],\n        created_at: params.created_at ?? Math.floor(Date.now() / 1000),\n      };\n\n      if (ensureEventFields(event)) {\n        return event;\n      }\n\n      return (\n        (await window?.nostr?.signEvent(event)) ??\n        inlineThrow(\n          new RxNostrEnvironmentError(\"window.nostr.signEvent() is not found\"),\n        )\n      );\n    },\n    getPublicKey() {\n      return (\n        window?.nostr?.getPublicKey() ??\n        inlineThrow(\n          new RxNostrEnvironmentError(\n            \"window.nostr.getPublicKey() is not found\",\n          ),\n        )\n      );\n    },\n  };\n}\n\nexport function noopSigner(): EventSigner {\n  return {\n    async signEvent<K extends number>(params: Nostr.EventParameters<K>) {\n      return params as Nostr.Event<K>;\n    },\n    async getPublicKey() {\n      throw new RxNostrInvalidUsageError(\"noopSigner cannot calculate pubkey.\");\n    },\n  };\n}\n", "import { fill } from \"../utils/config.js\";\nimport type { IWebSocketConstructor } from \"../websocket.js\";\nimport { AuthenticatorConfig } from \"./authenticator.js\";\nimport { EventSigner, nip07Signer } from \"./signer.js\";\nimport { EventVerifier } from \"./verifier.js\";\n\nexport const makeRxNostrConfig = (config: RxNostrConfig) =>\n  fill(config, {\n    signer: nip07Signer(),\n    connectionStrategy: \"lazy\",\n    retry: {\n      strategy: \"exponential\",\n      maxCount: 5,\n      initialDelay: 1000,\n    },\n    eoseTimeout: 30 * 1000,\n    okTimeout: 30 * 1000,\n    authTimeout: 30 * 1000,\n    skipVerify: false,\n    skipValidateFilterMatching: false,\n    skipExpirationCheck: false,\n    skipFetchNip11: false,\n  });\nexport type FilledRxNostrConfig = ReturnType<typeof makeRxNostrConfig>;\n\n/**\n * Configuration object for a RxNostr instance.\n */\nexport interface RxNostrConfig {\n  /**\n   * Default signer, which is used to convert event parameters into signed event.\n   */\n  signer?: EventSigner;\n  /**\n   * Default verifier, which is used to verify event's signature.\n   */\n  verifier: EventVerifier;\n  authenticator?:\n    | AuthenticatorConfig\n    | ((relay: string) => AuthenticatorConfig);\n\n  /**\n   * Connection strategy for default relays.\n   */\n  connectionStrategy?: ConnectionStrategy;\n\n  /**\n   * Auto reconnection strategy.\n   */\n  retry?: RetryConfig;\n  /**\n   * Specify how long rx-nostr waits for EOSE messages in `use()` following backward strategy (milliseconds).\n   *\n   * If EOSE doesn't come after waiting for this amount of time,\n   * rx-nostr is considered to get EOSE.\n   */\n  eoseTimeout?: number;\n  /**\n   * Specify how long rx-nostr waits for OK messages in `send()` (milliseconds).\n   *\n   * If OK doesn't come after waiting for this amount of time,\n   * rx-nostr stops listening OK and the Observable come from `send()` finishes with TimeoutError.\n   */\n  okTimeout?: number;\n  authTimeout?: number;\n  /**\n   * If true, skip filtering EVENTs based on signature verification.\n   */\n  skipVerify?: boolean;\n  /**\n   * If true, skip filtering EVENTs based on matching with REQ filter.\n   */\n  skipValidateFilterMatching?: boolean;\n  /**\n   * If true, skip automatic expiration check based on NIP-40.\n   */\n  skipExpirationCheck?: boolean;\n  /**\n   * If true, skip automatic fetching NIP-11 relay information.\n   */\n  skipFetchNip11?: boolean;\n  /**\n   * Optional. For environments where `WebSocket` doesn't exist in `globalThis` such as Node.js.\n   */\n  websocketCtor?: IWebSocketConstructor;\n}\n\n/**\n * Auto reconnection strategy.\n *\n * `strategy` can be one of the followings:\n *\n * - `\"exponential\"`: Exponential backoff and jitter strategy.\n * - `\"linear\"`: Retry at regular intervals.\n * - `\"immediately\"`: Retry immediately.\n * - `\"off\"`: Won't retry.\n *\n * `maxCount` specifies the maximum number of consecutive retry attempts.\n */\nexport type RetryConfig =\n  | {\n      strategy: \"exponential\";\n      maxCount: number;\n      initialDelay: number;\n    }\n  | {\n      strategy: \"linear\";\n      maxCount: number;\n      interval: number;\n    }\n  | {\n      strategy: \"immediately\";\n      maxCount: number;\n    }\n  | {\n      strategy: \"off\";\n    };\n\n/**\n * Connection strategy for default relays.\n *\n * - `\"lazy\"`: Connect when needed, and disconnect when unneeded.\n * - `\"lazy-keep\"`: Connect when needed, when the relay gets to be non-default and it is unneeded.\n * - `\"aggressive\"`: Connect immediately, and disconnect when the relay gets to be non-default and it is unneeded.\n */\nexport type ConnectionStrategy = \"lazy\" | \"lazy-keep\" | \"aggressive\";\n", "import * as Nostr from \"nostr-typedef\";\n\nexport interface EventVerifier {\n  (params: Nostr.Event): Promise<boolean>;\n}\n\nexport const noopVerifier: EventVerifier = async () => true;\n\nexport const emptyVerifier: EventVerifier = async () => {\n  throw new Error(\n    \"You must give some verifier to createRxNostr(). In most cases, rx-nostr-crypto packages will help you.\",\n  );\n};\n", "import * as Nostr from \"nostr-typedef\";\n\nimport { LazyFilter } from \"./packet.js\";\n\n/**\n * Evaluate one or more `LazyFilter`s and return `Nostr.Filter[]`.\n */\nexport function evalFilters(\n  filters: LazyFilter | LazyFilter[],\n): Nostr.Filter[] {\n  if (\"length\" in filters) {\n    return filters.map(evalFilter);\n  } else {\n    return [evalFilter(filters)];\n  }\n}\n\nfunction evalFilter(filter: LazyFilter): Nostr.Filter {\n  return {\n    ...filter,\n    since: filter.since ? evalLazyNumber(filter.since) : undefined,\n    until: filter.until ? evalLazyNumber(filter.until) : undefined,\n  };\n}\n\nfunction evalLazyNumber(lazyNumber: number | (() => number)): number {\n  return typeof lazyNumber === \"number\" ? lazyNumber : lazyNumber();\n}\n", "import * as Nostr from \"nostr-typedef\";\n\n/**\n * Fetch relay's information based on [NIP-11](https://github.com/nostr-protocol/nips/blob/master/11.md).\n */\nexport async function fetchRelayInfo(\n  url: string,\n): Promise<Nostr.Nip11.RelayInfo> {\n  try {\n    const u = new URL(url);\n    u.protocol = u.protocol.replace(/^ws(s?):/, \"http$1:\");\n\n    const res = await fetch(u.toString(), {\n      headers: { Accept: \"application/nostr+json\" },\n    });\n    return await res.json();\n  } catch {\n    return {};\n  }\n}\n", "export function inlineTry<T, U>(\n  f: () => T,\n  g: U | ((err: unknown) => U),\n): T | U {\n  try {\n    return f();\n  } catch (err) {\n    if (g instanceof Function) {\n      return g(err);\n    } else {\n      return g;\n    }\n  }\n}\n", "import { inlineTry } from \"./inline-try.js\";\n\nexport function normalizeRelayUrl(url: string) {\n  let o = \"\";\n\n  try {\n    o = url.trim();\n\n    const u = new URL(o);\n\n    u.hash = \"\";\n    u.pathname = inlineTry(() => decodeURI(u.pathname), u.pathname);\n    u.pathname = u.pathname.replace(/\\/$/, \"\");\n    u.hostname = u.hostname.replace(/\\.$/, \"\");\n    u.searchParams.sort();\n    u.search = inlineTry(() => decodeURIComponent(u.search), u.search);\n\n    let s = u.toString();\n    if (!u.search) {\n      s = s.replace(/\\/$/, \"\");\n    }\n\n    return s;\n  } catch {\n    return o;\n  }\n}\n", "import { normalizeRelayUrl } from \"./normalize-url.js\";\n\nexport class UrlMap<T> extends Map<string, T> {\n  constructor(obj?: Record<string, T>) {\n    super();\n\n    if (!obj) {\n      return;\n    }\n\n    for (const [url, v] of Object.entries(obj)) {\n      this.set(normalizeRelayUrl(url), v);\n    }\n  }\n  get(url: string) {\n    return super.get(normalizeRelayUrl(url));\n  }\n  getMany(urls: string[]) {\n    const vs: T[] = [];\n\n    for (const url of new Set(urls.map(normalizeRelayUrl))) {\n      const v = this.get(url);\n      if (v !== undefined) {\n        vs.push(v);\n      }\n    }\n\n    return vs;\n  }\n  set(url: string, v: T) {\n    return super.set(normalizeRelayUrl(url), v);\n  }\n  has(url: string): boolean {\n    return super.has(normalizeRelayUrl(url));\n  }\n  delete(url: string) {\n    return super.delete(normalizeRelayUrl(url));\n  }\n  toObject(): Record<string, T> {\n    const obj: Record<string, T> = {};\n\n    for (const [url, v] of this.entries()) {\n      obj[url] = v;\n    }\n\n    return obj;\n  }\n  toKeys(): string[] {\n    return [...super.keys()];\n  }\n  toValues(): T[] {\n    return [...super.values()];\n  }\n  copy() {\n    return new UrlMap(this.toObject());\n  }\n}\n", "import * as Nostr from \"nostr-typedef\";\n\nimport { fetchRelayInfo } from \"./nostr/nip11.js\";\nimport { UrlMap } from \"./utils/url-map.js\";\n\n/**\n * This is used by rx-nostr to access NIP-11 relay information.\n * rx-nostr works adaptively to the [`limitation`](https://github.com/nostr-protocol/nips/blob/master/11.md#server-limitations) defined by NIP-11.\n *\n * If you `set()` or `setDefault()` NIP-11 relay information in advance,\n * rx-nostr will use them instead of fetching even if `skipFetchNip11` is enabled.\n */\nexport class Nip11Registry {\n  private static cache = new UrlMap<\n    Promise<Nostr.Nip11.RelayInfo> | Nostr.Nip11.RelayInfo\n  >();\n  private static default: Nostr.Nip11.RelayInfo = {};\n\n  static async getValue<T>(\n    url: string,\n    getter: (data: Nostr.Nip11.RelayInfo) => T,\n    options?: {\n      skipFetch?: boolean;\n      skipCache?: boolean;\n    },\n  ): Promise<T> {\n    if (!options?.skipCache) {\n      const data = await this.cache.get(url);\n      if (data) {\n        return getter(data);\n      }\n    }\n    if (!options?.skipFetch) {\n      const data = await this.fetch(url);\n      if (data) {\n        return getter(data);\n      }\n    }\n\n    return getter(this.default);\n  }\n\n  /**\n   * Return cached or `set()`'ed NIP-11 information.\n   */\n  static get(url: string): Nostr.Nip11.RelayInfo | undefined {\n    const v = this.cache.get(url);\n    if (v && !(v instanceof Promise)) {\n      return v;\n    } else {\n      return undefined;\n    }\n  }\n\n  /**\n   * Cache fetched information then return it.\n   */\n  static async fetch(url: string) {\n    const promise = fetchRelayInfo(url);\n\n    this.cache.set(url, promise);\n    promise.then((v) => {\n      this.cache.set(url, v);\n    });\n\n    return promise;\n  }\n\n  /**\n   * Return cached or `set()`'ed NIP-11 information,\n   * or cache fetched information then return it.\n   */\n  static async getOrFetch(url: string): Promise<Nostr.Nip11.RelayInfo> {\n    return this.cache.get(url) ?? this.fetch(url);\n  }\n\n  /**\n   * Set NIP-11 information manually for given relay URL.\n   */\n  static set(url: string, nip11: Nostr.Nip11.RelayInfo) {\n    this.cache.set(url, nip11);\n  }\n\n  /**\n   * Get NIP-11 information for fallback.\n   */\n  static getDefault(): Nostr.Nip11.RelayInfo {\n    return this.default;\n  }\n\n  /**\n   * Set NIP-11 information for fallback.\n   */\n  static setDefault(nip11: Nostr.Nip11.RelayInfo) {\n    this.default = nip11;\n  }\n\n  /**\n   * Forget cached NIP-11 information for given relay URL.\n   */\n  static forget(url: string) {\n    this.cache.delete(url);\n  }\n\n  /**\n   * Forget all cached NIP-11 information.\n   *\n   * This doesn't erase `setDefault()`'ed value.\n   * If you want it, you can `setDefault({})` instead.\n   */\n  static forgetAll() {\n    this.cache.clear();\n  }\n}\n", "function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`positive integer expected, not ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`boolean expected, not ${b}`);\n}\n// copied from utils\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\nfunction bytes(b, ...lengths) {\n    if (!isBytes(b))\n        throw new Error('Uint8Array expected');\n    if (lengths.length > 0 && !lengths.includes(b.length))\n        throw new Error(`Uint8Array expected of length ${lengths}, not of length=${b.length}`);\n}\nfunction hash(h) {\n    if (typeof h !== 'function' || typeof h.create !== 'function')\n        throw new Error('Hash should be wrapped by utils.wrapConstructor');\n    number(h.outputLen);\n    number(h.blockLen);\n}\nfunction exists(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}\nfunction output(out, instance) {\n    bytes(out);\n    const min = instance.outputLen;\n    if (out.length < min) {\n        throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n    }\n}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map", "/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nimport { bytes as abytes } from './_assert.js';\n// export { isBytes } from './_assert.js';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\n}\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\n// The rotate left (circular left shift) operation for uint32\nexport const rotl = (word, shift) => (word << shift) | ((word >>> (32 - shift)) >>> 0);\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\n// The byte swap operation for uint32\nexport const byteSwap = (word) => ((word << 24) & 0xff000000) |\n    ((word << 8) & 0xff0000) |\n    ((word >>> 8) & 0xff00) |\n    ((word >>> 24) & 0xff);\n// Conditionally byte swap if on a big-endian platform\nexport const byteSwapIfBE = isLE ? (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}\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 * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    abytes(bytes);\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(char) {\n    if (char >= asciis._0 && char <= asciis._9)\n        return char - asciis._0;\n    if (char >= asciis._A && char <= asciis._F)\n        return char - (asciis._A - 10);\n    if (char >= asciis._a && char <= asciis._f)\n        return char - (asciis._a - 10);\n    return;\n}\n/**\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    const hl = hex.length;\n    const al = hl / 2;\n    if (hl % 2)\n        throw new Error('padded 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;\n    }\n    return array;\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.\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 * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    abytes(data);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\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// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\n    if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n        throw new Error('Options should be object or undefined');\n    const merged = Object.assign(defaults, opts);\n    return merged;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => hashCons().update(toBytes(msg)).digest();\n    const tmp = hashCons();\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = () => hashCons();\n    return hashC;\n}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\n    if (crypto && typeof crypto.getRandomValues === 'function') {\n        return crypto.getRandomValues(new Uint8Array(bytesLength));\n    }\n    throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map", "/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities\n/**\n * @__NO_SIDE_EFFECTS__\n */\nexport function assertNumber(n) {\n    if (!Number.isSafeInteger(n))\n        throw new Error(`Wrong integer: ${n}`);\n}\nfunction isBytes(a) {\n    return (a instanceof Uint8Array ||\n        (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array'));\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 * @__NO_SIDE_EFFECTS__\n */\nfunction alphabet(alphabet) {\n    return {\n        encode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('alphabet.encode input should be an array of numbers');\n            return digits.map((i) => {\n                assertNumber(i);\n                if (i < 0 || i >= alphabet.length)\n                    throw new Error(`Digit index outside alphabet: ${i} (alphabet: ${alphabet.length})`);\n                return alphabet[i];\n            });\n        },\n        decode: (input) => {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('alphabet.decode input should be array of strings');\n            return input.map((letter) => {\n                if (typeof letter !== 'string')\n                    throw new Error(`alphabet.decode: not string element=${letter}`);\n                const index = alphabet.indexOf(letter);\n                if (index === -1)\n                    throw new Error(`Unknown letter: \"${letter}\". Allowed: ${alphabet}`);\n                return index;\n            });\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction join(separator = '') {\n    if (typeof separator !== 'string')\n        throw new Error('join separator should be string');\n    return {\n        encode: (from) => {\n            if (!Array.isArray(from) || (from.length && typeof from[0] !== 'string'))\n                throw new Error('join.encode input should be array of strings');\n            for (let i of from)\n                if (typeof i !== 'string')\n                    throw new Error(`join.encode: non-string input=${i}`);\n            return from.join(separator);\n        },\n        decode: (to) => {\n            if (typeof to !== 'string')\n                throw new Error('join.decode input should be string');\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    assertNumber(bits);\n    if (typeof chr !== 'string')\n        throw new Error('padding chr should be string');\n    return {\n        encode(data) {\n            if (!Array.isArray(data) || (data.length && typeof data[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of data)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.encode: non-string input=${i}`);\n            while ((data.length * bits) % 8)\n                data.push(chr);\n            return data;\n        },\n        decode(input) {\n            if (!Array.isArray(input) || (input.length && typeof input[0] !== 'string'))\n                throw new Error('padding.encode input should be array of strings');\n            for (let i of input)\n                if (typeof i !== 'string')\n                    throw new Error(`padding.decode: non-string input=${i}`);\n            let end = input.length;\n            if ((end * bits) % 8)\n                throw new Error('Invalid padding: string should have whole number of bytes');\n            for (; end > 0 && input[end - 1] === chr; end--) {\n                if (!(((end - 1) * bits) % 8))\n                    throw new Error('Invalid padding: 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    if (typeof fn !== 'function')\n        throw new Error('normalize fn should be function');\n    return { encode: (from) => from, decode: (to) => fn(to) };\n}\n/**\n * Slow: O(n^2) time complexity\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix(data, from, to) {\n    // base 1 is impossible\n    if (from < 2)\n        throw new Error(`convertRadix: wrong from=${from}, base cannot be less than 2`);\n    if (to < 2)\n        throw new Error(`convertRadix: wrong to=${to}, base cannot be less than 2`);\n    if (!Array.isArray(data))\n        throw new Error('convertRadix: data should be array');\n    if (!data.length)\n        return [];\n    let pos = 0;\n    const res = [];\n    const digits = Array.from(data);\n    digits.forEach((d) => {\n        assertNumber(d);\n        if (d < 0 || d >= from)\n            throw new Error(`Wrong integer: ${d}`);\n    });\n    while (true) {\n        let carry = 0;\n        let done = true;\n        for (let i = pos; i < digits.length; i++) {\n            const digit = digits[i];\n            const digitBase = from * carry + digit;\n            if (!Number.isSafeInteger(digitBase) ||\n                (from * carry) / from !== carry ||\n                digitBase - digit !== from * carry) {\n                throw new Error('convertRadix: carry overflow');\n            }\n            carry = digitBase % to;\n            const rounded = Math.floor(digitBase / to);\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 = /* @__NO_SIDE_EFFECTS__ */ (a, b) => (!b ? a : gcd(b, a % b));\nconst radix2carry = /*@__NO_SIDE_EFFECTS__ */ (from, to) => from + (to - gcd(from, to));\n/**\n * Implemented with numbers, because BigInt is 5x slower\n * @__NO_SIDE_EFFECTS__\n */\nfunction convertRadix2(data, from, to, padding) {\n    if (!Array.isArray(data))\n        throw new Error('convertRadix2: data should be array');\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 mask = 2 ** to - 1;\n    const res = [];\n    for (const n of data) {\n        assertNumber(n);\n        if (n >= 2 ** from)\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        carry &= 2 ** pos - 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)\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    assertNumber(num);\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), 2 ** 8, num);\n        },\n        decode: (digits) => {\n            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix.decode input should be array of numbers');\n            return Uint8Array.from(convertRadix(digits, num, 2 ** 8));\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    assertNumber(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            if (!Array.isArray(digits) || (digits.length && typeof digits[0] !== 'number'))\n                throw new Error('radix2.decode input should be array of numbers');\n            return Uint8Array.from(convertRadix2(digits, bits, 8, revPadding));\n        },\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction unsafeWrapper(fn) {\n    if (typeof fn !== 'function')\n        throw new Error('unsafeWrapper fn should be function');\n    return function (...args) {\n        try {\n            return fn.apply(null, args);\n        }\n        catch (e) { }\n    };\n}\n/**\n * @__NO_SIDE_EFFECTS__\n */\nfunction checksum(len, fn) {\n    assertNumber(len);\n    if (typeof fn !== 'function')\n        throw new Error('checksum fn should be function');\n    return {\n        encode(data) {\n            if (!isBytes(data))\n                throw new Error('checksum.encode: input should be Uint8Array');\n            const checksum = fn(data).slice(0, len);\n            const res = new Uint8Array(data.length + len);\n            res.set(data);\n            res.set(checksum, 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 newChecksum = fn(payload).slice(0, len);\n            const oldChecksum = data.slice(-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// ---------------------\nexport const base16 = /* @__PURE__ */ chain(radix2(4), alphabet('0123456789ABCDEF'), join(''));\nexport const base32 = /* @__PURE__ */ chain(radix2(5), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'), padding(5), join(''));\nexport const base32hex = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHIJKLMNOPQRSTUV'), padding(5), join(''));\nexport const base32crockford = /* @__PURE__ */ chain(radix2(5), alphabet('0123456789ABCDEFGHJKMNPQRSTVWXYZ'), join(''), normalize((s) => s.toUpperCase().replace(/O/g, '0').replace(/[IL]/g, '1')));\nexport const base64 = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), padding(6), join(''));\nexport const base64nopad = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'), join(''));\nexport const base64url = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), padding(6), join(''));\nexport const base64urlnopad = /* @__PURE__ */ chain(radix2(6), alphabet('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'), join(''));\n// base58 code\n// -----------\nconst genBase58 = (abc) => chain(radix(58), alphabet(abc), join(''));\nexport const base58 = /* @__PURE__ */ genBase58('123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz');\nexport const base58flickr = /* @__PURE__ */ genBase58('123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ');\nexport const base58xrp = /* @__PURE__ */ genBase58('rpshnaf39wBUDNEGHJKLM4PQRST7VWXYZ2bcdeCg65jkm8oFqi1tuvAxyz');\n// xmr ver is 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// Data len (index) -> encoded block len\nconst XMR_BLOCK_LEN = [0, 2, 3, 5, 6, 7, 9, 10, 11];\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};\nexport const createBase58check = /* @__PURE__ */ (sha256) => chain(checksum(4, (data) => sha256(sha256(data))), base58);\n// legacy export, bad name\nexport const base58check = createBase58check;\nconst BECH_ALPHABET = /* @__PURE__ */ chain(alphabet('qpzry9x8gf2tvdw0s3jn54khce6mua7l'), join(''));\nconst POLYMOD_GENERATORS = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\n/**\n * @__NO_SIDE_EFFECTS__\n */\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}\n/**\n * @__NO_SIDE_EFFECTS__\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 % 2 ** 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        if (typeof prefix !== 'string')\n            throw new Error(`bech32.encode prefix should be string, not ${typeof prefix}`);\n        if (!Array.isArray(words) || (words.length && typeof words[0] !== 'number'))\n            throw new Error(`bech32.encode words should be array of numbers, not ${typeof words}`);\n        if (prefix.length === 0)\n            throw new TypeError(`Invalid prefix length ${prefix.length}`);\n        const actualLength = prefix.length + 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        if (typeof str !== 'string')\n            throw new Error(`bech32.decode input should be string, not ${typeof str}`);\n        if (str.length < 8 || (limit !== false && str.length > limit))\n            throw new TypeError(`Wrong string length: ${str.length} (${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    return { encode, decode, decodeToBytes, decodeUnsafe, fromWords, fromWordsUnsafe, toWords };\n}\nexport const bech32 = /* @__PURE__ */ genBech32('bech32');\nexport const bech32m = /* @__PURE__ */ genBech32('bech32m');\nexport const utf8 = {\n    encode: (data) => new TextDecoder().decode(data),\n    decode: (str) => new TextEncoder().encode(str),\n};\nexport const hex = /* @__PURE__ */ chain(radix2(4), alphabet('0123456789abcdef'), join(''), normalize((s) => {\n    if (typeof s !== 'string' || s.length % 2)\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';\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};\nexport const str = bytesToString; // as in python, but for bytes only\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};\nexport const bytes = stringToBytes;\n//# sourceMappingURL=index.js.map", "import { bytesToHex } from \"@noble/hashes/utils\";\nimport { bech32 } from \"@scure/base\";\n\n/** Convert bech32 format string to HEX format string. */\nexport function toHex(str: string): string {\n  const { words } = bech32.decode(str);\n  const data = new Uint8Array(bech32.fromWords(words));\n  return bytesToHex(data);\n}\n", "import * as Nostr from \"nostr-typedef\";\n\nimport { fill } from \"../utils/config.js\";\n\nexport interface MatchFilterOptions {\n  sinceInclusive: boolean;\n  untilInclusive: boolean;\n}\n\n/**\n * Return true if the given filter matches the given filters.\n */\nexport function isFiltered(\n  event: Nostr.Event,\n  filters: Nostr.Filter | Nostr.Filter[],\n  options?: Partial<MatchFilterOptions>,\n): boolean {\n  if (Array.isArray(filters)) {\n    return filters.some((filter) => _isFiltered(event, filter, options));\n  } else {\n    return _isFiltered(event, filters, options);\n  }\n}\n\nfunction _isFiltered(\n  event: Nostr.Event,\n  filter: Nostr.Filter,\n  options?: Partial<MatchFilterOptions>,\n): boolean {\n  const { sinceInclusive, untilInclusive } = fill(options ?? {}, {\n    sinceInclusive: true,\n    untilInclusive: true,\n  });\n\n  if (\n    filter.ids &&\n    filter.ids.every((prefix) => !event.id.startsWith(prefix))\n  ) {\n    return false;\n  }\n  if (filter.kinds && !filter.kinds.includes(event.kind)) {\n    return false;\n  }\n  if (\n    filter.authors &&\n    filter.authors.every((pubkey) => !event.pubkey.startsWith(pubkey))\n  ) {\n    return false;\n  }\n  if (\n    filter.since &&\n    ((sinceInclusive && !(filter.since <= event.created_at)) ||\n      (!sinceInclusive && !(filter.since < event.created_at)))\n  ) {\n    return false;\n  }\n  if (\n    filter.until &&\n    ((untilInclusive && !(event.created_at <= filter.until)) ||\n      (!untilInclusive && !(event.created_at < filter.until)))\n  ) {\n    return false;\n  }\n\n  for (const [key, needleValues] of Object.entries(filter)) {\n    if (!key.startsWith(\"#\") || !Array.isArray(needleValues)) {\n      continue;\n    }\n    const needleTagName = key.slice(1);\n\n    if (\n      !event.tags.find(\n        ([tagName, tagValue]) =>\n          needleTagName === tagName &&\n          (needleValues as string[]).includes(tagValue),\n      )\n    ) {\n      return false;\n    }\n  }\n\n  return true;\n}\n", "import * as Nostr from \"nostr-typedef\";\n\nexport function isExpired(event: Nostr.Event, now?: number): boolean {\n  const tag = event.tags.find((tag) => tag[0] === \"expiration\");\n\n  if (!tag) {\n    return false;\n  }\n\n  try {\n    const timestamp = Number(tag[1]);\n\n    if (!Number.isInteger(timestamp)) {\n      return false;\n    }\n\n    return timestamp <= (now ?? Math.floor(Date.now() / 1000));\n  } catch {\n    return false;\n  }\n}\n", "/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n  return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose;\n    if (async) {\n        if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n        dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n        if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n        dispose = value[Symbol.dispose];\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  function next() {\n    while (env.stack.length) {\n      var rec = env.stack.pop();\n      try {\n        var result = rec.dispose && rec.dispose.call(rec.value);\n        if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n      }\n      catch (e) {\n          fail(e);\n      }\n    }\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n};\n", "export function isFunction(value) {\n    return typeof value === 'function';\n}\n//# sourceMappingURL=isFunction.js.map", "export function createErrorClass(createImpl) {\n    var _super = function (instance) {\n        Error.call(instance);\n        instance.stack = new Error().stack;\n    };\n    var ctorFunc = createImpl(_super);\n    ctorFunc.prototype = Object.create(Error.prototype);\n    ctorFunc.prototype.constructor = ctorFunc;\n    return ctorFunc;\n}\n//# sourceMappingURL=createErrorClass.js.map", "import { createErrorClass } from './createErrorClass';\nexport var UnsubscriptionError = createErrorClass(function (_super) {\n    return function UnsubscriptionErrorImpl(errors) {\n        _super(this);\n        this.message = errors\n            ? errors.length + \" errors occurred during unsubscription:\\n\" + errors.map(function (err, i) { return i + 1 + \") \" + err.toString(); }).join('\\n  ')\n            : '';\n        this.name = 'UnsubscriptionError';\n        this.errors = errors;\n    };\n});\n//# sourceMappingURL=UnsubscriptionError.js.map", "export function arrRemove(arr, item) {\n    if (arr) {\n        var index = arr.indexOf(item);\n        0 <= index && arr.splice(index, 1);\n    }\n}\n//# sourceMappingURL=arrRemove.js.map", "import { __read, __spreadArray, __values } from \"tslib\";\nimport { isFunction } from './util/isFunction';\nimport { UnsubscriptionError } from './util/UnsubscriptionError';\nimport { arrRemove } from './util/arrRemove';\nvar Subscription = (function () {\n    function Subscription(initialTeardown) {\n        this.initialTeardown = initialTeardown;\n        this.closed = false;\n        this._parentage = null;\n        this._finalizers = null;\n    }\n    Subscription.prototype.unsubscribe = function () {\n        var e_1, _a, e_2, _b;\n        var errors;\n        if (!this.closed) {\n            this.closed = true;\n            var _parentage = this._parentage;\n            if (_parentage) {\n                this._parentage = null;\n                if (Array.isArray(_parentage)) {\n                    try {\n                        for (var _parentage_1 = __values(_parentage), _parentage_1_1 = _parentage_1.next(); !_parentage_1_1.done; _parentage_1_1 = _parentage_1.next()) {\n                            var parent_1 = _parentage_1_1.value;\n                            parent_1.remove(this);\n                        }\n                    }\n                    catch (e_1_1) { e_1 = { error: e_1_1 }; }\n                    finally {\n                        try {\n                            if (_parentage_1_1 && !_parentage_1_1.done && (_a = _parentage_1.return)) _a.call(_parentage_1);\n                        }\n                        finally { if (e_1) throw e_1.error; }\n                    }\n                }\n                else {\n                    _parentage.remove(this);\n                }\n            }\n            var initialFinalizer = this.initialTeardown;\n            if (isFunction(initialFinalizer)) {\n                try {\n                    initialFinalizer();\n                }\n                catch (e) {\n                    errors = e instanceof UnsubscriptionError ? e.errors : [e];\n                }\n            }\n            var _finalizers = this._finalizers;\n            if (_finalizers) {\n                this._finalizers = null;\n                try {\n                    for (var _finalizers_1 = __values(_finalizers), _finalizers_1_1 = _finalizers_1.next(); !_finalizers_1_1.done; _finalizers_1_1 = _finalizers_1.next()) {\n                        var finalizer = _finalizers_1_1.value;\n                        try {\n                            execFinalizer(finalizer);\n                        }\n                        catch (err) {\n                            errors = errors !== null && errors !== void 0 ? errors : [];\n                            if (err instanceof UnsubscriptionError) {\n                                errors = __spreadArray(__spreadArray([], __read(errors)), __read(err.errors));\n                            }\n                            else {\n                                errors.push(err);\n                            }\n                        }\n                    }\n                }\n                catch (e_2_1) { e_2 = { error: e_2_1 }; }\n                finally {\n                    try {\n                        if (_finalizers_1_1 && !_finalizers_1_1.done && (_b = _finalizers_1.return)) _b.call(_finalizers_1);\n                    }\n                    finally { if (e_2) throw e_2.error; }\n                }\n            }\n            if (errors) {\n                throw new UnsubscriptionError(errors);\n            }\n        }\n    };\n    Subscription.prototype.add = function (teardown) {\n        var _a;\n        if (teardown && teardown !== this) {\n            if (this.closed) {\n                execFinalizer(teardown);\n            }\n            else {\n                if (teardown instanceof Subscription) {\n                    if (teardown.closed || teardown._hasParent(this)) {\n                        return;\n                    }\n                    teardown._addParent(this);\n                }\n                (this._finalizers = (_a = this._finalizers) !== null && _a !== void 0 ? _a : []).push(teardown);\n            }\n        }\n    };\n    Subscription.prototype._hasParent = function (parent) {\n        var _parentage = this._parentage;\n        return _parentage === parent || (Array.isArray(_parentage) && _parentage.includes(parent));\n    };\n    Subscription.prototype._addParent = function (parent) {\n        var _parentage = this._parentage;\n        this._parentage = Array.isArray(_parentage) ? (_parentage.push(parent), _parentage) : _parentage ? [_parentage, parent] : parent;\n    };\n    Subscription.prototype._removeParent = function (parent) {\n        var _parentage = this._parentage;\n        if (_parentage === parent) {\n            this._parentage = null;\n        }\n        else if (Array.isArray(_parentage)) {\n            arrRemove(_parentage, parent);\n        }\n    };\n    Subscription.prototype.remove = function (teardown) {\n        var _finalizers = this._finalizers;\n        _finalizers && arrRemove(_finalizers, teardown);\n        if (teardown instanceof Subscription) {\n            teardown._removeParent(this);\n        }\n    };\n    Subscription.EMPTY = (function () {\n        var empty = new Subscription();\n        empty.closed = true;\n        return empty;\n    })();\n    return Subscription;\n}());\nexport { Subscription };\nexport var EMPTY_SUBSCRIPTION = Subscription.EMPTY;\nexport function isSubscription(value) {\n    return (value instanceof Subscription ||\n        (value && 'closed' in value && isFunction(value.remove) && isFunction(value.add) && isFunction(value.unsubscribe)));\n}\nfunction execFinalizer(finalizer) {\n    if (isFunction(finalizer)) {\n        finalizer();\n    }\n    else {\n        finalizer.unsubscribe();\n    }\n}\n//# sourceMappingURL=Subscription.js.map", "export var config = {\n    onUnhandledError: null,\n    onStoppedNotification: null,\n    Promise: undefined,\n    useDeprecatedSynchronousErrorHandling: false,\n    useDeprecatedNextContext: false,\n};\n//# sourceMappingURL=config.js.map", "import { __read, __spreadArray } from \"tslib\";\nexport var timeoutProvider = {\n    setTimeout: function (handler, timeout) {\n        var args = [];\n        for (var _i = 2; _i < arguments.length; _i++) {\n            args[_i - 2] = arguments[_i];\n        }\n        var delegate = timeoutProvider.delegate;\n        if (delegate === null || delegate === void 0 ? void 0 : delegate.setTimeout) {\n            return delegate.setTimeout.apply(delegate, __spreadArray([handler, timeout], __read(args)));\n        }\n        return setTimeout.apply(void 0, __spreadArray([handler, timeout], __read(args)));\n    },\n    clearTimeout: function (handle) {\n        var delegate = timeoutProvider.delegate;\n        return ((delegate === null || delegate === void 0 ? void 0 : delegate.clearTimeout) || clearTimeout)(handle);\n    },\n    delegate: undefined,\n};\n//# sourceMappingURL=timeoutProvider.js.map", "import { config } from '../config';\nimport { timeoutProvider } from '../scheduler/timeoutProvider';\nexport function reportUnhandledError(err) {\n    timeoutProvider.setTimeout(function () {\n        var onUnhandledError = config.onUnhandledError;\n        if (onUnhandledError) {\n            onUnhandledError(err);\n        }\n        else {\n            throw err;\n        }\n    });\n}\n//# sourceMappingURL=reportUnhandledError.js.map", "export function noop() { }\n//# sourceMappingURL=noop.js.map", "import { config } from '../config';\nvar context = null;\nexport function errorContext(cb) {\n    if (config.useDeprecatedSynchronousErrorHandling) {\n        var isRoot = !context;\n        if (isRoot) {\n            context = { errorThrown: false, error: null };\n        }\n        cb();\n        if (isRoot) {\n            var _a = context, errorThrown = _a.errorThrown, error = _a.error;\n            context = null;\n            if (errorThrown) {\n                throw error;\n            }\n        }\n    }\n    else {\n        cb();\n    }\n}\nexport function captureError(err) {\n    if (config.useDeprecatedSynchronousErrorHandling && context) {\n        context.errorThrown = true;\n        context.error = err;\n    }\n}\n//# sourceMappingURL=errorContext.js.map", "import { __extends } from \"tslib\";\nimport { isFunction } from './util/isFunction';\nimport { isSubscription, Subscription } from './Subscription';\nimport { config } from './config';\nimport { reportUnhandledError } from './util/reportUnhandledError';\nimport { noop } from './util/noop';\nimport { nextNotification, errorNotification, COMPLETE_NOTIFICATION } from './NotificationFactories';\nimport { timeoutProvider } from './scheduler/timeoutProvider';\nimport { captureError } from './util/errorContext';\nvar Subscriber = (function (_super) {\n    __extends(Subscriber, _super);\n    function Subscriber(destination) {\n        var _this = _super.call(this) || this;\n        _this.isStopped = false;\n        if (destination) {\n            _this.destination = destination;\n            if (isSubscription(destination)) {\n                destination.add(_this);\n            }\n        }\n        else {\n            _this.destination = EMPTY_OBSERVER;\n        }\n        return _this;\n    }\n    Subscriber.create = function (next, error, complete) {\n        return new SafeSubscriber(next, error, complete);\n    };\n    Subscriber.prototype.next = function (value) {\n        if (this.isStopped) {\n            handleStoppedNotification(nextNotification(value), this);\n        }\n        else {\n            this._next(value);\n        }\n    };\n    Subscriber.prototype.error = function (err) {\n        if (this.isStopped) {\n            handleStoppedNotification(errorNotification(err), this);\n        }\n        else {\n            this.isStopped = true;\n            this._error(err);\n        }\n    };\n    Subscriber.prototype.complete = function () {\n        if (this.isStopped) {\n            handleStoppedNotification(COMPLETE_NOTIFICATION, this);\n        }\n        else {\n            this.isStopped = true;\n            this._complete();\n        }\n    };\n    Subscriber.prototype.unsubscribe = function () {\n        if (!this.closed) {\n            this.isStopped = true;\n            _super.prototype.unsubscribe.call(this);\n            this.destination = null;\n        }\n    };\n    Subscriber.prototype._next = function (value) {\n        this.destination.next(value);\n    };\n    Subscriber.prototype._error = function (err) {\n        try {\n            this.destination.error(err);\n        }\n        finally {\n            this.unsubscribe();\n        }\n    };\n    Subscriber.prototype._complete = function () {\n        try {\n            this.destination.complete();\n        }\n        finally {\n            this.unsubscribe();\n        }\n    };\n    return Subscriber;\n}(Subscription));\nexport { Subscriber };\nvar _bind = Function.prototype.bind;\nfunction bind(fn, thisArg) {\n    return _bind.call(fn, thisArg);\n}\nvar ConsumerObserver = (function () {\n    function ConsumerObserver(partialObserver) {\n        this.partialObserver = partialObserver;\n    }\n    ConsumerObserver.prototype.next = function (value) {\n        var partialObserver = this.partialObserver;\n        if (partialObserver.next) {\n            try {\n                partialObserver.next(value);\n            }\n            catch (error) {\n                handleUnhandledError(error);\n            }\n        }\n    };\n    ConsumerObserver.prototype.error = function (err) {\n        var partialObserver = this.partialObserver;\n        if (partialObserver.error) {\n            try {\n                partialObserver.error(err);\n            }\n            catch (error) {\n                handleUnhandledError(error);\n            }\n        }\n        else {\n            handleUnhandledError(err);\n        }\n    };\n    ConsumerObserver.prototype.complete = function () {\n        var partialObserver = this.partialObserver;\n        if (partialObserver.complete) {\n            try {\n                partialObserver.complete();\n            }\n            catch (error) {\n                handleUnhandledError(error);\n            }\n        }\n    };\n    return ConsumerObserver;\n}());\nvar SafeSubscriber = (function (_super) {\n    __extends(SafeSubscriber, _super);\n    function SafeSubscriber(observerOrNext, error, complete) {\n        var _this = _super.call(this) || this;\n        var partialObserver;\n        if (isFunction(observerOrNext) || !observerOrNext) {\n            partialObserver = {\n                next: (observerOrNext !== null && observerOrNext !== void 0 ? observerOrNext : undefined),\n                error: error !== null && error !== void 0 ? error : undefined,\n                complete: complete !== null && complete !== void 0 ? complete : undefined,\n            };\n        }\n        else {\n            var context_1;\n            if (_this && config.useDeprecatedNextContext) {\n                context_1 = Object.create(observerOrNext);\n                context_1.unsubscribe = function () { return _this.unsubscribe(); };\n                partialObserver = {\n                    next: observerOrNext.next && bind(observerOrNext.next, context_1),\n                    error: observerOrNext.error && bind(observerOrNext.error, context_1),\n                    complete: observerOrNext.complete && bind(observerOrNext.complete, context_1),\n                };\n            }\n            else {\n                partialObserver = observerOrNext;\n            }\n        }\n        _this.destination = new ConsumerObserver(partialObserver);\n        return _this;\n    }\n    return SafeSubscriber;\n}(Subscriber));\nexport { SafeSubscriber };\nfunction handleUnhandledError(error) {\n    if (config.useDeprecatedSynchronousErrorHandling) {\n        captureError(error);\n    }\n    else {\n        reportUnhandledError(error);\n    }\n}\nfunction defaultErrorHandler(err) {\n    throw err;\n}\nfunction handleStoppedNotification(notification, subscriber) {\n    var onStoppedNotification = config.onStoppedNotification;\n    onStoppedNotification && timeoutProvider.setTimeout(function () { return onStoppedNotification(notification, subscriber); });\n}\nexport var EMPTY_OBSERVER = {\n    closed: true,\n    next: noop,\n    error: defaultErrorHandler,\n    complete: noop,\n};\n//# sourceMappingURL=Subscriber.js.map", "export var observable = (function () { return (typeof Symbol === 'function' && Symbol.observable) || '@@observable'; })();\n//# sourceMappingURL=observable.js.map", "export function identity(x) {\n    return x;\n}\n//# sourceMappingURL=identity.js.map", "import { identity } from './identity';\nexport function pipe() {\n    var fns = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        fns[_i] = arguments[_i];\n    }\n    return pipeFromArray(fns);\n}\nexport function pipeFromArray(fns) {\n    if (fns.length === 0) {\n        return identity;\n    }\n    if (fns.length === 1) {\n        return fns[0];\n    }\n    return function piped(input) {\n        return fns.reduce(function (prev, fn) { return fn(prev); }, input);\n    };\n}\n//# sourceMappingURL=pipe.js.map", "import { SafeSubscriber, Subscriber } from './Subscriber';\nimport { isSubscription } from './Subscription';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nimport { isFunction } from './util/isFunction';\nimport { errorContext } from './util/errorContext';\nvar Observable = (function () {\n    function Observable(subscribe) {\n        if (subscribe) {\n            this._subscribe = subscribe;\n        }\n    }\n    Observable.prototype.lift = function (operator) {\n        var observable = new Observable();\n        observable.source = this;\n        observable.operator = operator;\n        return observable;\n    };\n    Observable.prototype.subscribe = function (observerOrNext, error, complete) {\n        var _this = this;\n        var subscriber = isSubscriber(observerOrNext) ? observerOrNext : new SafeSubscriber(observerOrNext, error, complete);\n        errorContext(function () {\n            var _a = _this, operator = _a.operator, source = _a.source;\n            subscriber.add(operator\n                ?\n                    operator.call(subscriber, source)\n                : source\n                    ?\n                        _this._subscribe(subscriber)\n                    :\n                        _this._trySubscribe(subscriber));\n        });\n        return subscriber;\n    };\n    Observable.prototype._trySubscribe = function (sink) {\n        try {\n            return this._subscribe(sink);\n        }\n        catch (err) {\n            sink.error(err);\n        }\n    };\n    Observable.prototype.forEach = function (next, promiseCtor) {\n        var _this = this;\n        promiseCtor = getPromiseCtor(promiseCtor);\n        return new promiseCtor(function (resolve, reject) {\n            var subscriber = new SafeSubscriber({\n                next: function (value) {\n                    try {\n                        next(value);\n                    }\n                    catch (err) {\n                        reject(err);\n                        subscriber.unsubscribe();\n                    }\n                },\n                error: reject,\n                complete: resolve,\n            });\n            _this.subscribe(subscriber);\n        });\n    };\n    Observable.prototype._subscribe = function (subscriber) {\n        var _a;\n        return (_a = this.source) === null || _a === void 0 ? void 0 : _a.subscribe(subscriber);\n    };\n    Observable.prototype[Symbol_observable] = function () {\n        return this;\n    };\n    Observable.prototype.pipe = function () {\n        var operations = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            operations[_i] = arguments[_i];\n        }\n        return pipeFromArray(operations)(this);\n    };\n    Observable.prototype.toPromise = function (promiseCtor) {\n        var _this = this;\n        promiseCtor = getPromiseCtor(promiseCtor);\n        return new promiseCtor(function (resolve, reject) {\n            var value;\n            _this.subscribe(function (x) { return (value = x); }, function (err) { return reject(err); }, function () { return resolve(value); });\n        });\n    };\n    Observable.create = function (subscribe) {\n        return new Observable(subscribe);\n    };\n    return Observable;\n}());\nexport { Observable };\nfunction getPromiseCtor(promiseCtor) {\n    var _a;\n    return (_a = promiseCtor !== null && promiseCtor !== void 0 ? promiseCtor : config.Promise) !== null && _a !== void 0 ? _a : Promise;\n}\nfunction isObserver(value) {\n    return value && isFunction(value.next) && isFunction(value.error) && isFunction(value.complete);\n}\nfunction isSubscriber(value) {\n    return (value && value instanceof Subscriber) || (isObserver(value) && isSubscription(value));\n}\n//# sourceMappingURL=Observable.js.map", "import { isFunction } from './isFunction';\nexport function hasLift(source) {\n    return isFunction(source === null || source === void 0 ? void 0 : source.lift);\n}\nexport function operate(init) {\n    return function (source) {\n        if (hasLift(source)) {\n            return source.lift(function (liftedSource) {\n                try {\n                    return init(liftedSource, this);\n                }\n                catch (err) {\n                    this.error(err);\n                }\n            });\n        }\n        throw new TypeError('Unable to lift unknown Observable type');\n    };\n}\n//# sourceMappingURL=lift.js.map", "import { __extends } from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function createOperatorSubscriber(destination, onNext, onComplete, onError, onFinalize) {\n    return new OperatorSubscriber(destination, onNext, onComplete, onError, onFinalize);\n}\nvar OperatorSubscriber = (function (_super) {\n    __extends(OperatorSubscriber, _super);\n    function OperatorSubscriber(destination, onNext, onComplete, onError, onFinalize, shouldUnsubscribe) {\n        var _this = _super.call(this, destination) || this;\n        _this.onFinalize = onFinalize;\n        _this.shouldUnsubscribe = shouldUnsubscribe;\n        _this._next = onNext\n            ? function (value) {\n                try {\n                    onNext(value);\n                }\n                catch (err) {\n                    destination.error(err);\n                }\n            }\n            : _super.prototype._next;\n        _this._error = onError\n            ? function (err) {\n                try {\n                    onError(err);\n                }\n                catch (err) {\n                    destination.error(err);\n                }\n                finally {\n                    this.unsubscribe();\n                }\n            }\n            : _super.prototype._error;\n        _this._complete = onComplete\n            ? function () {\n                try {\n                    onComplete();\n                }\n                catch (err) {\n                    destination.error(err);\n                }\n                finally {\n                    this.unsubscribe();\n                }\n            }\n            : _super.prototype._complete;\n        return _this;\n    }\n    OperatorSubscriber.prototype.unsubscribe = function () {\n        var _a;\n        if (!this.shouldUnsubscribe || this.shouldUnsubscribe()) {\n            var closed_1 = this.closed;\n            _super.prototype.unsubscribe.call(this);\n            !closed_1 && ((_a = this.onFinalize) === null || _a === void 0 ? void 0 : _a.call(this));\n        }\n    };\n    return OperatorSubscriber;\n}(Subscriber));\nexport { OperatorSubscriber };\n//# sourceMappingURL=OperatorSubscriber.js.map", "import { createErrorClass } from './createErrorClass';\nexport var ObjectUnsubscribedError = createErrorClass(function (_super) {\n    return function ObjectUnsubscribedErrorImpl() {\n        _super(this);\n        this.name = 'ObjectUnsubscribedError';\n        this.message = 'object unsubscribed';\n    };\n});\n//# sourceMappingURL=ObjectUnsubscribedError.js.map", "import { __extends, __values } from \"tslib\";\nimport { Observable } from './Observable';\nimport { Subscription, EMPTY_SUBSCRIPTION } from './Subscription';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { arrRemove } from './util/arrRemove';\nimport { errorContext } from './util/errorContext';\nvar Subject = (function (_super) {\n    __extends(Subject, _super);\n    function Subject() {\n        var _this = _super.call(this) || this;\n        _this.closed = false;\n        _this.currentObservers = null;\n        _this.observers = [];\n        _this.isStopped = false;\n        _this.hasError = false;\n        _this.thrownError = null;\n        return _this;\n    }\n    Subject.prototype.lift = function (operator) {\n        var subject = new AnonymousSubject(this, this);\n        subject.operator = operator;\n        return subject;\n    };\n    Subject.prototype._throwIfClosed = function () {\n        if (this.closed) {\n            throw new ObjectUnsubscribedError();\n        }\n    };\n    Subject.prototype.next = function (value) {\n        var _this = this;\n        errorContext(function () {\n            var e_1, _a;\n            _this._throwIfClosed();\n            if (!_this.isStopped) {\n                if (!_this.currentObservers) {\n                    _this.currentObservers = Array.from(_this.observers);\n                }\n                try {\n                    for (var _b = __values(_this.currentObservers), _c = _b.next(); !_c.done; _c = _b.next()) {\n                        var observer = _c.value;\n                        observer.next(value);\n                    }\n                }\n                catch (e_1_1) { e_1 = { error: e_1_1 }; }\n                finally {\n                    try {\n                        if (_c && !_c.done && (_a = _b.return)) _a.call(_b);\n                    }\n                    finally { if (e_1) throw e_1.error; }\n                }\n            }\n        });\n    };\n    Subject.prototype.error = function (err) {\n        var _this = this;\n        errorContext(function () {\n            _this._throwIfClosed();\n            if (!_this.isStopped) {\n                _this.hasError = _this.isStopped = true;\n                _this.thrownError = err;\n                var observers = _this.observers;\n                while (observers.length) {\n                    observers.shift().error(err);\n                }\n            }\n        });\n    };\n    Subject.prototype.complete = function () {\n        var _this = this;\n        errorContext(function () {\n            _this._throwIfClosed();\n            if (!_this.isStopped) {\n                _this.isStopped = true;\n                var observers = _this.observers;\n                while (observers.length) {\n                    observers.shift().complete();\n                }\n            }\n        });\n    };\n    Subject.prototype.unsubscribe = function () {\n        this.isStopped = this.closed = true;\n        this.observers = this.currentObservers = null;\n    };\n    Object.defineProperty(Subject.prototype, \"observed\", {\n        get: function () {\n            var _a;\n            return ((_a = this.observers) === null || _a === void 0 ? void 0 : _a.length) > 0;\n        },\n        enumerable: false,\n        configurable: true\n    });\n    Subject.prototype._trySubscribe = function (subscriber) {\n        this._throwIfClosed();\n        return _super.prototype._trySubscribe.call(this, subscriber);\n    };\n    Subject.prototype._subscribe = function (subscriber) {\n        this._throwIfClosed();\n        this._checkFinalizedStatuses(subscriber);\n        return this._innerSubscribe(subscriber);\n    };\n    Subject.prototype._innerSubscribe = function (subscriber) {\n        var _this = this;\n        var _a = this, hasError = _a.hasError, isStopped = _a.isStopped, observers = _a.observers;\n        if (hasError || isStopped) {\n            return EMPTY_SUBSCRIPTION;\n        }\n        this.currentObservers = null;\n        observers.push(subscriber);\n        return new Subscription(function () {\n            _this.currentObservers = null;\n            arrRemove(observers, subscriber);\n        });\n    };\n    Subject.prototype._checkFinalizedStatuses = function (subscriber) {\n        var _a = this, hasError = _a.hasError, thrownError = _a.thrownError, isStopped = _a.isStopped;\n        if (hasError) {\n            subscriber.error(thrownError);\n        }\n        else if (isStopped) {\n            subscriber.complete();\n        }\n    };\n    Subject.prototype.asObservable = function () {\n        var observable = new Observable();\n        observable.source = this;\n        return observable;\n    };\n    Subject.create = function (destination, source) {\n        return new AnonymousSubject(destination, source);\n    };\n    return Subject;\n}(Observable));\nexport { Subject };\nvar AnonymousSubject = (function (_super) {\n    __extends(AnonymousSubject, _super);\n    function AnonymousSubject(destination, source) {\n        var _this = _super.call(this) || this;\n        _this.destination = destination;\n        _this.source = source;\n        return _this;\n    }\n    AnonymousSubject.prototype.next = function (value) {\n        var _a, _b;\n        (_b = (_a = this.destination) === null || _a === void 0 ? void 0 : _a.next) === null || _b === void 0 ? void 0 : _b.call(_a, value);\n    };\n    AnonymousSubject.prototype.error = function (err) {\n        var _a, _b;\n        (_b = (_a = this.destination) === null || _a === void 0 ? void 0 : _a.error) === null || _b === void 0 ? void 0 : _b.call(_a, err);\n    };\n    AnonymousSubject.prototype.complete = function () {\n        var _a, _b;\n        (_b = (_a = this.destination) === null || _a === void 0 ? void 0 : _a.complete) === null || _b === void 0 ? void 0 : _b.call(_a);\n    };\n    AnonymousSubject.prototype._subscribe = function (subscriber) {\n        var _a, _b;\n        return (_b = (_a = this.source) === null || _a === void 0 ? void 0 : _a.subscribe(subscriber)) !== null && _b !== void 0 ? _b : EMPTY_SUBSCRIPTION;\n    };\n    return AnonymousSubject;\n}(Subject));\nexport { AnonymousSubject };\n//# sourceMappingURL=Subject.js.map", "import { __extends } from \"tslib\";\nimport { Subject } from './Subject';\nvar BehaviorSubject = (function (_super) {\n    __extends(BehaviorSubject, _super);\n    function BehaviorSubject(_value) {\n        var _this = _super.call(this) || this;\n        _this._value = _value;\n        return _this;\n    }\n    Object.defineProperty(BehaviorSubject.prototype, \"value\", {\n        get: function () {\n            return this.getValue();\n        },\n        enumerable: false,\n        configurable: true\n    });\n    BehaviorSubject.prototype._subscribe = function (subscriber) {\n        var subscription = _super.prototype._subscribe.call(this, subscriber);\n        !subscription.closed && subscriber.next(this._value);\n        return subscription;\n    };\n    BehaviorSubject.prototype.getValue = function () {\n        var _a = this, hasError = _a.hasError, thrownError = _a.thrownError, _value = _a._value;\n        if (hasError) {\n            throw thrownError;\n        }\n        this._throwIfClosed();\n        return _value;\n    };\n    BehaviorSubject.prototype.next = function (value) {\n        _super.prototype.next.call(this, (this._value = value));\n    };\n    return BehaviorSubject;\n}(Subject));\nexport { BehaviorSubject };\n//# sourceMappingURL=BehaviorSubject.js.map", "export var dateTimestampProvider = {\n    now: function () {\n        return (dateTimestampProvider.delegate || Date).now();\n    },\n    delegate: undefined,\n};\n//# sourceMappingURL=dateTimestampProvider.js.map", "import { __extends } from \"tslib\";\nimport { Subscription } from '../Subscription';\nvar Action = (function (_super) {\n    __extends(Action, _super);\n    function Action(scheduler, work) {\n        return _super.call(this) || this;\n    }\n    Action.prototype.schedule = function (state, delay) {\n        if (delay === void 0) { delay = 0; }\n        return this;\n    };\n    return Action;\n}(Subscription));\nexport { Action };\n//# sourceMappingURL=Action.js.map", "import { __read, __spreadArray } from \"tslib\";\nexport var intervalProvider = {\n    setInterval: function (handler, timeout) {\n        var args = [];\n        for (var _i = 2; _i < arguments.length; _i++) {\n            args[_i - 2] = arguments[_i];\n        }\n        var delegate = intervalProvider.delegate;\n        if (delegate === null || delegate === void 0 ? void 0 : delegate.setInterval) {\n            return delegate.setInterval.apply(delegate, __spreadArray([handler, timeout], __read(args)));\n        }\n        return setInterval.apply(void 0, __spreadArray([handler, timeout], __read(args)));\n    },\n    clearInterval: function (handle) {\n        var delegate = intervalProvider.delegate;\n        return ((delegate === null || delegate === void 0 ? void 0 : delegate.clearInterval) || clearInterval)(handle);\n    },\n    delegate: undefined,\n};\n//# sourceMappingURL=intervalProvider.js.map", "import { __extends } from \"tslib\";\nimport { Action } from './Action';\nimport { intervalProvider } from './intervalProvider';\nimport { arrRemove } from '../util/arrRemove';\nvar AsyncAction = (function (_super) {\n    __extends(AsyncAction, _super);\n    function AsyncAction(scheduler, work) {\n        var _this = _super.call(this, scheduler, work) || this;\n        _this.scheduler = scheduler;\n        _this.work = work;\n        _this.pending = false;\n        return _this;\n    }\n    AsyncAction.prototype.schedule = function (state, delay) {\n        var _a;\n        if (delay === void 0) { delay = 0; }\n        if (this.closed) {\n            return this;\n        }\n        this.state = state;\n        var id = this.id;\n        var scheduler = this.scheduler;\n        if (id != null) {\n            this.id = this.recycleAsyncId(scheduler, id, delay);\n        }\n        this.pending = true;\n        this.delay = delay;\n        this.id = (_a = this.id) !== null && _a !== void 0 ? _a : this.requestAsyncId(scheduler, this.id, delay);\n        return this;\n    };\n    AsyncAction.prototype.requestAsyncId = function (scheduler, _id, delay) {\n        if (delay === void 0) { delay = 0; }\n        return intervalProvider.setInterval(scheduler.flush.bind(scheduler, this), delay);\n    };\n    AsyncAction.prototype.recycleAsyncId = function (_scheduler, id, delay) {\n        if (delay === void 0) { delay = 0; }\n        if (delay != null && this.delay === delay && this.pending === false) {\n            return id;\n        }\n        if (id != null) {\n            intervalProvider.clearInterval(id);\n        }\n        return undefined;\n    };\n    AsyncAction.prototype.execute = function (state, delay) {\n        if (this.closed) {\n            return new Error('executing a cancelled action');\n        }\n        this.pending = false;\n        var error = this._execute(state, delay);\n        if (error) {\n            return error;\n        }\n        else if (this.pending === false && this.id != null) {\n            this.id = this.recycleAsyncId(this.scheduler, this.id, null);\n        }\n    };\n    AsyncAction.prototype._execute = function (state, _delay) {\n        var errored = false;\n        var errorValue;\n        try {\n            this.work(state);\n        }\n        catch (e) {\n            errored = true;\n            errorValue = e ? e : new Error('Scheduled action threw falsy error');\n        }\n        if (errored) {\n            this.unsubscribe();\n            return errorValue;\n        }\n    };\n    AsyncAction.prototype.unsubscribe = function () {\n        if (!this.closed) {\n            var _a = this, id = _a.id, scheduler = _a.scheduler;\n            var actions = scheduler.actions;\n            this.work = this.state = this.scheduler = null;\n            this.pending = false;\n            arrRemove(actions, this);\n            if (id != null) {\n                this.id = this.recycleAsyncId(scheduler, id, null);\n            }\n            this.delay = null;\n            _super.prototype.unsubscribe.call(this);\n        }\n    };\n    return AsyncAction;\n}(Action));\nexport { AsyncAction };\n//# sourceMappingURL=AsyncAction.js.map", "import { dateTimestampProvider } from './scheduler/dateTimestampProvider';\nvar Scheduler = (function () {\n    function Scheduler(schedulerActionCtor, now) {\n        if (now === void 0) { now = Scheduler.now; }\n        this.schedulerActionCtor = schedulerActionCtor;\n        this.now = now;\n    }\n    Scheduler.prototype.schedule = function (work, delay, state) {\n        if (delay === void 0) { delay = 0; }\n        return new this.schedulerActionCtor(this, work).schedule(state, delay);\n    };\n    Scheduler.now = dateTimestampProvider.now;\n    return Scheduler;\n}());\nexport { Scheduler };\n//# sourceMappingURL=Scheduler.js.map", "import { __extends } from \"tslib\";\nimport { Scheduler } from '../Scheduler';\nvar AsyncScheduler = (function (_super) {\n    __extends(AsyncScheduler, _super);\n    function AsyncScheduler(SchedulerAction, now) {\n        if (now === void 0) { now = Scheduler.now; }\n        var _this = _super.call(this, SchedulerAction, now) || this;\n        _this.actions = [];\n        _this._active = false;\n        return _this;\n    }\n    AsyncScheduler.prototype.flush = function (action) {\n        var actions = this.actions;\n        if (this._active) {\n            actions.push(action);\n            return;\n        }\n        var error;\n        this._active = true;\n        do {\n            if ((error = action.execute(action.state, action.delay))) {\n                break;\n            }\n        } while ((action = actions.shift()));\n        this._active = false;\n        if (error) {\n            while ((action = actions.shift())) {\n                action.unsubscribe();\n            }\n            throw error;\n        }\n    };\n    return AsyncScheduler;\n}(Scheduler));\nexport { AsyncScheduler };\n//# sourceMappingURL=AsyncScheduler.js.map", "import { AsyncAction } from './AsyncAction';\nimport { AsyncScheduler } from './AsyncScheduler';\nexport var asyncScheduler = new AsyncScheduler(AsyncAction);\nexport var async = asyncScheduler;\n//# sourceMappingURL=async.js.map", "import { Observable } from '../Observable';\nexport var EMPTY = new Observable(function (subscriber) { return subscriber.complete(); });\nexport function empty(scheduler) {\n    return scheduler ? emptyScheduled(scheduler) : EMPTY;\n}\nfunction emptyScheduled(scheduler) {\n    return new Observable(function (subscriber) { return scheduler.schedule(function () { return subscriber.complete(); }); });\n}\n//# sourceMappingURL=empty.js.map", "import { isFunction } from './isFunction';\nexport function isScheduler(value) {\n    return value && isFunction(value.schedule);\n}\n//# sourceMappingURL=isScheduler.js.map", "import { isFunction } from './isFunction';\nimport { isScheduler } from './isScheduler';\nfunction last(arr) {\n    return arr[arr.length - 1];\n}\nexport function popResultSelector(args) {\n    return isFunction(last(args)) ? args.pop() : undefined;\n}\nexport function popScheduler(args) {\n    return isScheduler(last(args)) ? args.pop() : undefined;\n}\nexport function popNumber(args, defaultValue) {\n    return typeof last(args) === 'number' ? args.pop() : defaultValue;\n}\n//# sourceMappingURL=args.js.map", "export var isArrayLike = (function (x) { return x && typeof x.length === 'number' && typeof x !== 'function'; });\n//# sourceMappingURL=isArrayLike.js.map", "import { isFunction } from \"./isFunction\";\nexport function isPromise(value) {\n    return isFunction(value === null || value === void 0 ? void 0 : value.then);\n}\n//# sourceMappingURL=isPromise.js.map", "import { observable as Symbol_observable } from '../symbol/observable';\nimport { isFunction } from './isFunction';\nexport function isInteropObservable(input) {\n    return isFunction(input[Symbol_observable]);\n}\n//# sourceMappingURL=isInteropObservable.js.map", "import { isFunction } from './isFunction';\nexport function isAsyncIterable(obj) {\n    return Symbol.asyncIterator && isFunction(obj === null || obj === void 0 ? void 0 : obj[Symbol.asyncIterator]);\n}\n//# sourceMappingURL=isAsyncIterable.js.map", "export function createInvalidObservableTypeError(input) {\n    return new TypeError(\"You provided \" + (input !== null && typeof input === 'object' ? 'an invalid object' : \"'\" + input + \"'\") + \" where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.\");\n}\n//# sourceMappingURL=throwUnobservableError.js.map", "export function getSymbolIterator() {\n    if (typeof Symbol !== 'function' || !Symbol.iterator) {\n        return '@@iterator';\n    }\n    return Symbol.iterator;\n}\nexport var iterator = getSymbolIterator();\n//# sourceMappingURL=iterator.js.map", "import { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from './isFunction';\nexport function isIterable(input) {\n    return isFunction(input === null || input === void 0 ? void 0 : input[Symbol_iterator]);\n}\n//# sourceMappingURL=isIterable.js.map", "import { __asyncGenerator, __await, __generator } from \"tslib\";\nimport { isFunction } from './isFunction';\nexport function readableStreamLikeToAsyncGenerator(readableStream) {\n    return __asyncGenerator(this, arguments, function readableStreamLikeToAsyncGenerator_1() {\n        var reader, _a, value, done;\n        return __generator(this, function (_b) {\n            switch (_b.label) {\n                case 0:\n                    reader = readableStream.getReader();\n                    _b.label = 1;\n                case 1:\n                    _b.trys.push([1, , 9, 10]);\n                    _b.label = 2;\n                case 2:\n                    if (!true) return [3, 8];\n                    return [4, __await(reader.read())];\n                case 3:\n                    _a = _b.sent(), value = _a.value, done = _a.done;\n                    if (!done) return [3, 5];\n                    return [4, __await(void 0)];\n                case 4: return [2, _b.sent()];\n                case 5: return [4, __await(value)];\n                case 6: return [4, _b.sent()];\n                case 7:\n                    _b.sent();\n                    return [3, 2];\n                case 8: return [3, 10];\n                case 9:\n                    reader.releaseLock();\n                    return [7];\n                case 10: return [2];\n            }\n        });\n    });\n}\nexport function isReadableStreamLike(obj) {\n    return isFunction(obj === null || obj === void 0 ? void 0 : obj.getReader);\n}\n//# sourceMappingURL=isReadableStreamLike.js.map", "import { __asyncValues, __awaiter, __generator, __values } from \"tslib\";\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isPromise } from '../util/isPromise';\nimport { Observable } from '../Observable';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isIterable } from '../util/isIterable';\nimport { isReadableStreamLike, readableStreamLikeToAsyncGenerator } from '../util/isReadableStreamLike';\nimport { isFunction } from '../util/isFunction';\nimport { reportUnhandledError } from '../util/reportUnhandledError';\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport function innerFrom(input) {\n    if (input instanceof Observable) {\n        return input;\n    }\n    if (input != null) {\n        if (isInteropObservable(input)) {\n            return fromInteropObservable(input);\n        }\n        if (isArrayLike(input)) {\n            return fromArrayLike(input);\n        }\n        if (isPromise(input)) {\n            return fromPromise(input);\n        }\n        if (isAsyncIterable(input)) {\n            return fromAsyncIterable(input);\n        }\n        if (isIterable(input)) {\n            return fromIterable(input);\n        }\n        if (isReadableStreamLike(input)) {\n            return fromReadableStreamLike(input);\n        }\n    }\n    throw createInvalidObservableTypeError(input);\n}\nexport function fromInteropObservable(obj) {\n    return new Observable(function (subscriber) {\n        var obs = obj[Symbol_observable]();\n        if (isFunction(obs.subscribe)) {\n            return obs.subscribe(subscriber);\n        }\n        throw new TypeError('Provided object does not correctly implement Symbol.observable');\n    });\n}\nexport function fromArrayLike(array) {\n    return new Observable(function (subscriber) {\n        for (var i = 0; i < array.length && !subscriber.closed; i++) {\n            subscriber.next(array[i]);\n        }\n        subscriber.complete();\n    });\n}\nexport function fromPromise(promise) {\n    return new Observable(function (subscriber) {\n        promise\n            .then(function (value) {\n            if (!subscriber.closed) {\n                subscriber.next(value);\n                subscriber.complete();\n            }\n        }, function (err) { return subscriber.error(err); })\n            .then(null, reportUnhandledError);\n    });\n}\nexport function fromIterable(iterable) {\n    return new Observable(function (subscriber) {\n        var e_1, _a;\n        try {\n            for (var iterable_1 = __values(iterable), iterable_1_1 = iterable_1.next(); !iterable_1_1.done; iterable_1_1 = iterable_1.next()) {\n                var value = iterable_1_1.value;\n                subscriber.next(value);\n                if (subscriber.closed) {\n                    return;\n                }\n            }\n        }\n        catch (e_1_1) { e_1 = { error: e_1_1 }; }\n        finally {\n            try {\n                if (iterable_1_1 && !iterable_1_1.done && (_a = iterable_1.return)) _a.call(iterable_1);\n            }\n            finally { if (e_1) throw e_1.error; }\n        }\n        subscriber.complete();\n    });\n}\nexport function fromAsyncIterable(asyncIterable) {\n    return new Observable(function (subscriber) {\n        process(asyncIterable, subscriber).catch(function (err) { return subscriber.error(err); });\n    });\n}\nexport function fromReadableStreamLike(readableStream) {\n    return fromAsyncIterable(readableStreamLikeToAsyncGenerator(readableStream));\n}\nfunction process(asyncIterable, subscriber) {\n    var asyncIterable_1, asyncIterable_1_1;\n    var e_2, _a;\n    return __awaiter(this, void 0, void 0, function () {\n        var value, e_2_1;\n        return __generator(this, function (_b) {\n            switch (_b.label) {\n                case 0:\n                    _b.trys.push([0, 5, 6, 11]);\n                    asyncIterable_1 = __asyncValues(asyncIterable);\n                    _b.label = 1;\n                case 1: return [4, asyncIterable_1.next()];\n                case 2:\n                    if (!(asyncIterable_1_1 = _b.sent(), !asyncIterable_1_1.done)) return [3, 4];\n                    value = asyncIterable_1_1.value;\n                    subscriber.next(value);\n                    if (subscriber.closed) {\n                        return [2];\n                    }\n                    _b.label = 3;\n                case 3: return [3, 1];\n                case 4: return [3, 11];\n                case 5:\n                    e_2_1 = _b.sent();\n                    e_2 = { error: e_2_1 };\n                    return [3, 11];\n                case 6:\n                    _b.trys.push([6, , 9, 10]);\n                    if (!(asyncIterable_1_1 && !asyncIterable_1_1.done && (_a = asyncIterable_1.return))) return [3, 8];\n                    return [4, _a.call(asyncIterable_1)];\n                case 7:\n                    _b.sent();\n                    _b.label = 8;\n                case 8: return [3, 10];\n                case 9:\n                    if (e_2) throw e_2.error;\n                    return [7];\n                case 10: return [7];\n                case 11:\n                    subscriber.complete();\n                    return [2];\n            }\n        });\n    });\n}\n//# sourceMappingURL=innerFrom.js.map", "export function executeSchedule(parentSubscription, scheduler, work, delay, repeat) {\n    if (delay === void 0) { delay = 0; }\n    if (repeat === void 0) { repeat = false; }\n    var scheduleSubscription = scheduler.schedule(function () {\n        work();\n        if (repeat) {\n            parentSubscription.add(this.schedule(null, delay));\n        }\n        else {\n            this.unsubscribe();\n        }\n    }, delay);\n    parentSubscription.add(scheduleSubscription);\n    if (!repeat) {\n        return scheduleSubscription;\n    }\n}\n//# sourceMappingURL=executeSchedule.js.map", "import { executeSchedule } from '../util/executeSchedule';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function observeOn(scheduler, delay) {\n    if (delay === void 0) { delay = 0; }\n    return operate(function (source, subscriber) {\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) { return executeSchedule(subscriber, scheduler, function () { return subscriber.next(value); }, delay); }, function () { return executeSchedule(subscriber, scheduler, function () { return subscriber.complete(); }, delay); }, function (err) { return executeSchedule(subscriber, scheduler, function () { return subscriber.error(err); }, delay); }));\n    });\n}\n//# sourceMappingURL=observeOn.js.map", "import { operate } from '../util/lift';\nexport function subscribeOn(scheduler, delay) {\n    if (delay === void 0) { delay = 0; }\n    return operate(function (source, subscriber) {\n        subscriber.add(scheduler.schedule(function () { return source.subscribe(subscriber); }, delay));\n    });\n}\n//# sourceMappingURL=subscribeOn.js.map", "import { innerFrom } from '../observable/innerFrom';\nimport { observeOn } from '../operators/observeOn';\nimport { subscribeOn } from '../operators/subscribeOn';\nexport function scheduleObservable(input, scheduler) {\n    return innerFrom(input).pipe(subscribeOn(scheduler), observeOn(scheduler));\n}\n//# sourceMappingURL=scheduleObservable.js.map", "import { innerFrom } from '../observable/innerFrom';\nimport { observeOn } from '../operators/observeOn';\nimport { subscribeOn } from '../operators/subscribeOn';\nexport function schedulePromise(input, scheduler) {\n    return innerFrom(input).pipe(subscribeOn(scheduler), observeOn(scheduler));\n}\n//# sourceMappingURL=schedulePromise.js.map", "import { Observable } from '../Observable';\nexport function scheduleArray(input, scheduler) {\n    return new Observable(function (subscriber) {\n        var i = 0;\n        return scheduler.schedule(function () {\n            if (i === input.length) {\n                subscriber.complete();\n            }\n            else {\n                subscriber.next(input[i++]);\n                if (!subscriber.closed) {\n                    this.schedule();\n                }\n            }\n        });\n    });\n}\n//# sourceMappingURL=scheduleArray.js.map", "import { Observable } from '../Observable';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from '../util/isFunction';\nimport { executeSchedule } from '../util/executeSchedule';\nexport function scheduleIterable(input, scheduler) {\n    return new Observable(function (subscriber) {\n        var iterator;\n        executeSchedule(subscriber, scheduler, function () {\n            iterator = input[Symbol_iterator]();\n            executeSchedule(subscriber, scheduler, function () {\n                var _a;\n                var value;\n                var done;\n                try {\n                    (_a = iterator.next(), value = _a.value, done = _a.done);\n                }\n                catch (err) {\n                    subscriber.error(err);\n                    return;\n                }\n                if (done) {\n                    subscriber.complete();\n                }\n                else {\n                    subscriber.next(value);\n                }\n            }, 0, true);\n        });\n        return function () { return isFunction(iterator === null || iterator === void 0 ? void 0 : iterator.return) && iterator.return(); };\n    });\n}\n//# sourceMappingURL=scheduleIterable.js.map", "import { Observable } from '../Observable';\nimport { executeSchedule } from '../util/executeSchedule';\nexport function scheduleAsyncIterable(input, scheduler) {\n    if (!input) {\n        throw new Error('Iterable cannot be null');\n    }\n    return new Observable(function (subscriber) {\n        executeSchedule(subscriber, scheduler, function () {\n            var iterator = input[Symbol.asyncIterator]();\n            executeSchedule(subscriber, scheduler, function () {\n                iterator.next().then(function (result) {\n                    if (result.done) {\n                        subscriber.complete();\n                    }\n                    else {\n                        subscriber.next(result.value);\n                    }\n                });\n            }, 0, true);\n        });\n    });\n}\n//# sourceMappingURL=scheduleAsyncIterable.js.map", "import { scheduleAsyncIterable } from './scheduleAsyncIterable';\nimport { readableStreamLikeToAsyncGenerator } from '../util/isReadableStreamLike';\nexport function scheduleReadableStreamLike(input, scheduler) {\n    return scheduleAsyncIterable(readableStreamLikeToAsyncGenerator(input), scheduler);\n}\n//# sourceMappingURL=scheduleReadableStreamLike.js.map", "import { scheduleObservable } from './scheduleObservable';\nimport { schedulePromise } from './schedulePromise';\nimport { scheduleArray } from './scheduleArray';\nimport { scheduleIterable } from './scheduleIterable';\nimport { scheduleAsyncIterable } from './scheduleAsyncIterable';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isPromise } from '../util/isPromise';\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isIterable } from '../util/isIterable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isReadableStreamLike } from '../util/isReadableStreamLike';\nimport { scheduleReadableStreamLike } from './scheduleReadableStreamLike';\nexport function scheduled(input, scheduler) {\n    if (input != null) {\n        if (isInteropObservable(input)) {\n            return scheduleObservable(input, scheduler);\n        }\n        if (isArrayLike(input)) {\n            return scheduleArray(input, scheduler);\n        }\n        if (isPromise(input)) {\n            return schedulePromise(input, scheduler);\n        }\n        if (isAsyncIterable(input)) {\n            return scheduleAsyncIterable(input, scheduler);\n        }\n        if (isIterable(input)) {\n            return scheduleIterable(input, scheduler);\n        }\n        if (isReadableStreamLike(input)) {\n            return scheduleReadableStreamLike(input, scheduler);\n        }\n    }\n    throw createInvalidObservableTypeError(input);\n}\n//# sourceMappingURL=scheduled.js.map", "import { scheduled } from '../scheduled/scheduled';\nimport { innerFrom } from './innerFrom';\nexport function from(input, scheduler) {\n    return scheduler ? scheduled(input, scheduler) : innerFrom(input);\n}\n//# sourceMappingURL=from.js.map", "import { popScheduler } from '../util/args';\nimport { from } from './from';\nexport function of() {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        args[_i] = arguments[_i];\n    }\n    var scheduler = popScheduler(args);\n    return from(args, scheduler);\n}\n//# sourceMappingURL=of.js.map", "import { createErrorClass } from './createErrorClass';\nexport var EmptyError = createErrorClass(function (_super) { return function EmptyErrorImpl() {\n    _super(this);\n    this.name = 'EmptyError';\n    this.message = 'no elements in sequence';\n}; });\n//# sourceMappingURL=EmptyError.js.map", "import { EmptyError } from './util/EmptyError';\nimport { SafeSubscriber } from './Subscriber';\nexport function firstValueFrom(source, config) {\n    var hasConfig = typeof config === 'object';\n    return new Promise(function (resolve, reject) {\n        var subscriber = new SafeSubscriber({\n            next: function (value) {\n                resolve(value);\n                subscriber.unsubscribe();\n            },\n            error: reject,\n            complete: function () {\n                if (hasConfig) {\n                    resolve(config.defaultValue);\n                }\n                else {\n                    reject(new EmptyError());\n                }\n            },\n        });\n        source.subscribe(subscriber);\n    });\n}\n//# sourceMappingURL=firstValueFrom.js.map", "export function isValidDate(value) {\n    return value instanceof Date && !isNaN(value);\n}\n//# sourceMappingURL=isDate.js.map", "import { asyncScheduler } from '../scheduler/async';\nimport { isValidDate } from '../util/isDate';\nimport { operate } from '../util/lift';\nimport { innerFrom } from '../observable/innerFrom';\nimport { createErrorClass } from '../util/createErrorClass';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { executeSchedule } from '../util/executeSchedule';\nexport var TimeoutError = createErrorClass(function (_super) {\n    return function TimeoutErrorImpl(info) {\n        if (info === void 0) { info = null; }\n        _super(this);\n        this.message = 'Timeout has occurred';\n        this.name = 'TimeoutError';\n        this.info = info;\n    };\n});\nexport function timeout(config, schedulerArg) {\n    var _a = (isValidDate(config) ? { first: config } : typeof config === 'number' ? { each: config } : config), first = _a.first, each = _a.each, _b = _a.with, _with = _b === void 0 ? timeoutErrorFactory : _b, _c = _a.scheduler, scheduler = _c === void 0 ? schedulerArg !== null && schedulerArg !== void 0 ? schedulerArg : asyncScheduler : _c, _d = _a.meta, meta = _d === void 0 ? null : _d;\n    if (first == null && each == null) {\n        throw new TypeError('No timeout provided.');\n    }\n    return operate(function (source, subscriber) {\n        var originalSourceSubscription;\n        var timerSubscription;\n        var lastValue = null;\n        var seen = 0;\n        var startTimer = function (delay) {\n            timerSubscription = executeSchedule(subscriber, scheduler, function () {\n                try {\n                    originalSourceSubscription.unsubscribe();\n                    innerFrom(_with({\n                        meta: meta,\n                        lastValue: lastValue,\n                        seen: seen,\n                    })).subscribe(subscriber);\n                }\n                catch (err) {\n                    subscriber.error(err);\n                }\n            }, delay);\n        };\n        originalSourceSubscription = source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            timerSubscription === null || timerSubscription === void 0 ? void 0 : timerSubscription.unsubscribe();\n            seen++;\n            subscriber.next((lastValue = value));\n            each > 0 && startTimer(each);\n        }, undefined, undefined, function () {\n            if (!(timerSubscription === null || timerSubscription === void 0 ? void 0 : timerSubscription.closed)) {\n                timerSubscription === null || timerSubscription === void 0 ? void 0 : timerSubscription.unsubscribe();\n            }\n            lastValue = null;\n        }));\n        !seen && startTimer(first != null ? (typeof first === 'number' ? first : +first - scheduler.now()) : each);\n    });\n}\nfunction timeoutErrorFactory(info) {\n    throw new TimeoutError(info);\n}\n//# sourceMappingURL=timeout.js.map", "import { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function map(project, thisArg) {\n    return operate(function (source, subscriber) {\n        var index = 0;\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            subscriber.next(project.call(thisArg, value, index++));\n        }));\n    });\n}\n//# sourceMappingURL=map.js.map", "import { __read, __spreadArray } from \"tslib\";\nimport { map } from \"../operators/map\";\nvar isArray = Array.isArray;\nfunction callOrApply(fn, args) {\n    return isArray(args) ? fn.apply(void 0, __spreadArray([], __read(args))) : fn(args);\n}\nexport function mapOneOrManyArgs(fn) {\n    return map(function (args) { return callOrApply(fn, args); });\n}\n//# sourceMappingURL=mapOneOrManyArgs.js.map", "var isArray = Array.isArray;\nvar getPrototypeOf = Object.getPrototypeOf, objectProto = Object.prototype, getKeys = Object.keys;\nexport function argsArgArrayOrObject(args) {\n    if (args.length === 1) {\n        var first_1 = args[0];\n        if (isArray(first_1)) {\n            return { args: first_1, keys: null };\n        }\n        if (isPOJO(first_1)) {\n            var keys = getKeys(first_1);\n            return {\n                args: keys.map(function (key) { return first_1[key]; }),\n                keys: keys,\n            };\n        }\n    }\n    return { args: args, keys: null };\n}\nfunction isPOJO(obj) {\n    return obj && typeof obj === 'object' && getPrototypeOf(obj) === objectProto;\n}\n//# sourceMappingURL=argsArgArrayOrObject.js.map", "export function createObject(keys, values) {\n    return keys.reduce(function (result, key, i) { return ((result[key] = values[i]), result); }, {});\n}\n//# sourceMappingURL=createObject.js.map", "import { Observable } from '../Observable';\nimport { argsArgArrayOrObject } from '../util/argsArgArrayOrObject';\nimport { from } from './from';\nimport { identity } from '../util/identity';\nimport { mapOneOrManyArgs } from '../util/mapOneOrManyArgs';\nimport { popResultSelector, popScheduler } from '../util/args';\nimport { createObject } from '../util/createObject';\nimport { createOperatorSubscriber } from '../operators/OperatorSubscriber';\nimport { executeSchedule } from '../util/executeSchedule';\nexport function combineLatest() {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        args[_i] = arguments[_i];\n    }\n    var scheduler = popScheduler(args);\n    var resultSelector = popResultSelector(args);\n    var _a = argsArgArrayOrObject(args), observables = _a.args, keys = _a.keys;\n    if (observables.length === 0) {\n        return from([], scheduler);\n    }\n    var result = new Observable(combineLatestInit(observables, scheduler, keys\n        ?\n            function (values) { return createObject(keys, values); }\n        :\n            identity));\n    return resultSelector ? result.pipe(mapOneOrManyArgs(resultSelector)) : result;\n}\nexport function combineLatestInit(observables, scheduler, valueTransform) {\n    if (valueTransform === void 0) { valueTransform = identity; }\n    return function (subscriber) {\n        maybeSchedule(scheduler, function () {\n            var length = observables.length;\n            var values = new Array(length);\n            var active = length;\n            var remainingFirstValues = length;\n            var _loop_1 = function (i) {\n                maybeSchedule(scheduler, function () {\n                    var source = from(observables[i], scheduler);\n                    var hasFirstValue = false;\n                    source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n                        values[i] = value;\n                        if (!hasFirstValue) {\n                            hasFirstValue = true;\n                            remainingFirstValues--;\n                        }\n                        if (!remainingFirstValues) {\n                            subscriber.next(valueTransform(values.slice()));\n                        }\n                    }, function () {\n                        if (!--active) {\n                            subscriber.complete();\n                        }\n                    }));\n                }, subscriber);\n            };\n            for (var i = 0; i < length; i++) {\n                _loop_1(i);\n            }\n        }, subscriber);\n    };\n}\nfunction maybeSchedule(scheduler, execute, subscription) {\n    if (scheduler) {\n        executeSchedule(subscription, scheduler, execute);\n    }\n    else {\n        execute();\n    }\n}\n//# sourceMappingURL=combineLatest.js.map", "import { innerFrom } from '../observable/innerFrom';\nimport { executeSchedule } from '../util/executeSchedule';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function mergeInternals(source, subscriber, project, concurrent, onBeforeNext, expand, innerSubScheduler, additionalFinalizer) {\n    var buffer = [];\n    var active = 0;\n    var index = 0;\n    var isComplete = false;\n    var checkComplete = function () {\n        if (isComplete && !buffer.length && !active) {\n            subscriber.complete();\n        }\n    };\n    var outerNext = function (value) { return (active < concurrent ? doInnerSub(value) : buffer.push(value)); };\n    var doInnerSub = function (value) {\n        expand && subscriber.next(value);\n        active++;\n        var innerComplete = false;\n        innerFrom(project(value, index++)).subscribe(createOperatorSubscriber(subscriber, function (innerValue) {\n            onBeforeNext === null || onBeforeNext === void 0 ? void 0 : onBeforeNext(innerValue);\n            if (expand) {\n                outerNext(innerValue);\n            }\n            else {\n                subscriber.next(innerValue);\n            }\n        }, function () {\n            innerComplete = true;\n        }, undefined, function () {\n            if (innerComplete) {\n                try {\n                    active--;\n                    var _loop_1 = function () {\n                        var bufferedValue = buffer.shift();\n                        if (innerSubScheduler) {\n                            executeSchedule(subscriber, innerSubScheduler, function () { return doInnerSub(bufferedValue); });\n                        }\n                        else {\n                            doInnerSub(bufferedValue);\n                        }\n                    };\n                    while (buffer.length && active < concurrent) {\n                        _loop_1();\n                    }\n                    checkComplete();\n                }\n                catch (err) {\n                    subscriber.error(err);\n                }\n            }\n        }));\n    };\n    source.subscribe(createOperatorSubscriber(subscriber, outerNext, function () {\n        isComplete = true;\n        checkComplete();\n    }));\n    return function () {\n        additionalFinalizer === null || additionalFinalizer === void 0 ? void 0 : additionalFinalizer();\n    };\n}\n//# sourceMappingURL=mergeInternals.js.map", "import { map } from './map';\nimport { innerFrom } from '../observable/innerFrom';\nimport { operate } from '../util/lift';\nimport { mergeInternals } from './mergeInternals';\nimport { isFunction } from '../util/isFunction';\nexport function mergeMap(project, resultSelector, concurrent) {\n    if (concurrent === void 0) { concurrent = Infinity; }\n    if (isFunction(resultSelector)) {\n        return mergeMap(function (a, i) { return map(function (b, ii) { return resultSelector(a, b, i, ii); })(innerFrom(project(a, i))); }, concurrent);\n    }\n    else if (typeof resultSelector === 'number') {\n        concurrent = resultSelector;\n    }\n    return operate(function (source, subscriber) { return mergeInternals(source, subscriber, project, concurrent); });\n}\n//# sourceMappingURL=mergeMap.js.map", "import { mergeMap } from './mergeMap';\nimport { identity } from '../util/identity';\nexport function mergeAll(concurrent) {\n    if (concurrent === void 0) { concurrent = Infinity; }\n    return mergeMap(identity, concurrent);\n}\n//# sourceMappingURL=mergeAll.js.map", "import { mergeAll } from './mergeAll';\nexport function concatAll() {\n    return mergeAll(1);\n}\n//# sourceMappingURL=concatAll.js.map", "import { concatAll } from '../operators/concatAll';\nimport { popScheduler } from '../util/args';\nimport { from } from './from';\nexport function concat() {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        args[_i] = arguments[_i];\n    }\n    return concatAll()(from(args, popScheduler(args)));\n}\n//# sourceMappingURL=concat.js.map", "import { Observable } from '../Observable';\nimport { async as asyncScheduler } from '../scheduler/async';\nimport { isScheduler } from '../util/isScheduler';\nimport { isValidDate } from '../util/isDate';\nexport function timer(dueTime, intervalOrScheduler, scheduler) {\n    if (dueTime === void 0) { dueTime = 0; }\n    if (scheduler === void 0) { scheduler = asyncScheduler; }\n    var intervalDuration = -1;\n    if (intervalOrScheduler != null) {\n        if (isScheduler(intervalOrScheduler)) {\n            scheduler = intervalOrScheduler;\n        }\n        else {\n            intervalDuration = intervalOrScheduler;\n        }\n    }\n    return new Observable(function (subscriber) {\n        var due = isValidDate(dueTime) ? +dueTime - scheduler.now() : dueTime;\n        if (due < 0) {\n            due = 0;\n        }\n        var n = 0;\n        return scheduler.schedule(function () {\n            if (!subscriber.closed) {\n                subscriber.next(n++);\n                if (0 <= intervalDuration) {\n                    this.schedule(undefined, intervalDuration);\n                }\n                else {\n                    subscriber.complete();\n                }\n            }\n        }, due);\n    });\n}\n//# sourceMappingURL=timer.js.map", "import { mergeAll } from '../operators/mergeAll';\nimport { innerFrom } from './innerFrom';\nimport { EMPTY } from './empty';\nimport { popNumber, popScheduler } from '../util/args';\nimport { from } from './from';\nexport function merge() {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        args[_i] = arguments[_i];\n    }\n    var scheduler = popScheduler(args);\n    var concurrent = popNumber(args, Infinity);\n    var sources = args;\n    return !sources.length\n        ?\n            EMPTY\n        : sources.length === 1\n            ?\n                innerFrom(sources[0])\n            :\n                mergeAll(concurrent)(from(sources, scheduler));\n}\n//# sourceMappingURL=merge.js.map", "import { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function filter(predicate, thisArg) {\n    return operate(function (source, subscriber) {\n        var index = 0;\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) { return predicate.call(thisArg, value, index++) && subscriber.next(value); }));\n    });\n}\n//# sourceMappingURL=filter.js.map", "import { innerFrom } from '../observable/innerFrom';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { operate } from '../util/lift';\nexport function catchError(selector) {\n    return operate(function (source, subscriber) {\n        var innerSub = null;\n        var syncUnsub = false;\n        var handledResult;\n        innerSub = source.subscribe(createOperatorSubscriber(subscriber, undefined, undefined, function (err) {\n            handledResult = innerFrom(selector(err, catchError(selector)(source)));\n            if (innerSub) {\n                innerSub.unsubscribe();\n                innerSub = null;\n                handledResult.subscribe(subscriber);\n            }\n            else {\n                syncUnsub = true;\n            }\n        }));\n        if (syncUnsub) {\n            innerSub.unsubscribe();\n            innerSub = null;\n            handledResult.subscribe(subscriber);\n        }\n    });\n}\n//# sourceMappingURL=catchError.js.map", "import { createOperatorSubscriber } from './OperatorSubscriber';\nexport function scanInternals(accumulator, seed, hasSeed, emitOnNext, emitBeforeComplete) {\n    return function (source, subscriber) {\n        var hasState = hasSeed;\n        var state = seed;\n        var index = 0;\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            var i = index++;\n            state = hasState\n                ?\n                    accumulator(state, value, i)\n                :\n                    ((hasState = true), value);\n            emitOnNext && subscriber.next(state);\n        }, emitBeforeComplete &&\n            (function () {\n                hasState && subscriber.next(state);\n                subscriber.complete();\n            })));\n    };\n}\n//# sourceMappingURL=scanInternals.js.map", "import { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function defaultIfEmpty(defaultValue) {\n    return operate(function (source, subscriber) {\n        var hasValue = false;\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            hasValue = true;\n            subscriber.next(value);\n        }, function () {\n            if (!hasValue) {\n                subscriber.next(defaultValue);\n            }\n            subscriber.complete();\n        }));\n    });\n}\n//# sourceMappingURL=defaultIfEmpty.js.map", "import { EMPTY } from '../observable/empty';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function take(count) {\n    return count <= 0\n        ?\n            function () { return EMPTY; }\n        : operate(function (source, subscriber) {\n            var seen = 0;\n            source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n                if (++seen <= count) {\n                    subscriber.next(value);\n                    if (count <= seen) {\n                        subscriber.complete();\n                    }\n                }\n            }));\n        });\n}\n//# sourceMappingURL=take.js.map", "import { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { noop } from '../util/noop';\nexport function ignoreElements() {\n    return operate(function (source, subscriber) {\n        source.subscribe(createOperatorSubscriber(subscriber, noop));\n    });\n}\n//# sourceMappingURL=ignoreElements.js.map", "import { map } from './map';\nexport function mapTo(value) {\n    return map(function () { return value; });\n}\n//# sourceMappingURL=mapTo.js.map", "import { concat } from '../observable/concat';\nimport { take } from './take';\nimport { ignoreElements } from './ignoreElements';\nimport { mapTo } from './mapTo';\nimport { mergeMap } from './mergeMap';\nimport { innerFrom } from '../observable/innerFrom';\nexport function delayWhen(delayDurationSelector, subscriptionDelay) {\n    if (subscriptionDelay) {\n        return function (source) {\n            return concat(subscriptionDelay.pipe(take(1), ignoreElements()), source.pipe(delayWhen(delayDurationSelector)));\n        };\n    }\n    return mergeMap(function (value, index) { return innerFrom(delayDurationSelector(value, index)).pipe(take(1), mapTo(value)); });\n}\n//# sourceMappingURL=delayWhen.js.map", "import { asyncScheduler } from '../scheduler/async';\nimport { delayWhen } from './delayWhen';\nimport { timer } from '../observable/timer';\nexport function delay(due, scheduler) {\n    if (scheduler === void 0) { scheduler = asyncScheduler; }\n    var duration = timer(due, scheduler);\n    return delayWhen(function () { return duration; });\n}\n//# sourceMappingURL=delay.js.map", "import { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { noop } from '../util/noop';\nimport { innerFrom } from '../observable/innerFrom';\nexport function distinct(keySelector, flushes) {\n    return operate(function (source, subscriber) {\n        var distinctKeys = new Set();\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            var key = keySelector ? keySelector(value) : value;\n            if (!distinctKeys.has(key)) {\n                distinctKeys.add(key);\n                subscriber.next(value);\n            }\n        }));\n        flushes && innerFrom(flushes).subscribe(createOperatorSubscriber(subscriber, function () { return distinctKeys.clear(); }, noop));\n    });\n}\n//# sourceMappingURL=distinct.js.map", "import { identity } from '../util/identity';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function distinctUntilChanged(comparator, keySelector) {\n    if (keySelector === void 0) { keySelector = identity; }\n    comparator = comparator !== null && comparator !== void 0 ? comparator : defaultCompare;\n    return operate(function (source, subscriber) {\n        var previousKey;\n        var first = true;\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            var currentKey = keySelector(value);\n            if (first || !comparator(previousKey, currentKey)) {\n                first = false;\n                previousKey = currentKey;\n                subscriber.next(value);\n            }\n        }));\n    });\n}\nfunction defaultCompare(a, b) {\n    return a === b;\n}\n//# sourceMappingURL=distinctUntilChanged.js.map", "import { EmptyError } from '../util/EmptyError';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function throwIfEmpty(errorFactory) {\n    if (errorFactory === void 0) { errorFactory = defaultErrorFactory; }\n    return operate(function (source, subscriber) {\n        var hasValue = false;\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            hasValue = true;\n            subscriber.next(value);\n        }, function () { return (hasValue ? subscriber.complete() : subscriber.error(errorFactory())); }));\n    });\n}\nfunction defaultErrorFactory() {\n    return new EmptyError();\n}\n//# sourceMappingURL=throwIfEmpty.js.map", "import { operate } from '../util/lift';\nexport function finalize(callback) {\n    return operate(function (source, subscriber) {\n        try {\n            source.subscribe(subscriber);\n        }\n        finally {\n            subscriber.add(callback);\n        }\n    });\n}\n//# sourceMappingURL=finalize.js.map", "import { EmptyError } from '../util/EmptyError';\nimport { filter } from './filter';\nimport { take } from './take';\nimport { defaultIfEmpty } from './defaultIfEmpty';\nimport { throwIfEmpty } from './throwIfEmpty';\nimport { identity } from '../util/identity';\nexport function first(predicate, defaultValue) {\n    var hasDefaultValue = arguments.length >= 2;\n    return function (source) {\n        return source.pipe(predicate ? filter(function (v, i) { return predicate(v, i, source); }) : identity, take(1), hasDefaultValue ? defaultIfEmpty(defaultValue) : throwIfEmpty(function () { return new EmptyError(); }));\n    };\n}\n//# sourceMappingURL=first.js.map", "import { Observable } from '../Observable';\nimport { innerFrom } from '../observable/innerFrom';\nimport { Subject } from '../Subject';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber, OperatorSubscriber } from './OperatorSubscriber';\nexport function groupBy(keySelector, elementOrOptions, duration, connector) {\n    return operate(function (source, subscriber) {\n        var element;\n        if (!elementOrOptions || typeof elementOrOptions === 'function') {\n            element = elementOrOptions;\n        }\n        else {\n            (duration = elementOrOptions.duration, element = elementOrOptions.element, connector = elementOrOptions.connector);\n        }\n        var groups = new Map();\n        var notify = function (cb) {\n            groups.forEach(cb);\n            cb(subscriber);\n        };\n        var handleError = function (err) { return notify(function (consumer) { return consumer.error(err); }); };\n        var activeGroups = 0;\n        var teardownAttempted = false;\n        var groupBySourceSubscriber = new OperatorSubscriber(subscriber, function (value) {\n            try {\n                var key_1 = keySelector(value);\n                var group_1 = groups.get(key_1);\n                if (!group_1) {\n                    groups.set(key_1, (group_1 = connector ? connector() : new Subject()));\n                    var grouped = createGroupedObservable(key_1, group_1);\n                    subscriber.next(grouped);\n                    if (duration) {\n                        var durationSubscriber_1 = createOperatorSubscriber(group_1, function () {\n                            group_1.complete();\n                            durationSubscriber_1 === null || durationSubscriber_1 === void 0 ? void 0 : durationSubscriber_1.unsubscribe();\n                        }, undefined, undefined, function () { return groups.delete(key_1); });\n                        groupBySourceSubscriber.add(innerFrom(duration(grouped)).subscribe(durationSubscriber_1));\n                    }\n                }\n                group_1.next(element ? element(value) : value);\n            }\n            catch (err) {\n                handleError(err);\n            }\n        }, function () { return notify(function (consumer) { return consumer.complete(); }); }, handleError, function () { return groups.clear(); }, function () {\n            teardownAttempted = true;\n            return activeGroups === 0;\n        });\n        source.subscribe(groupBySourceSubscriber);\n        function createGroupedObservable(key, groupSubject) {\n            var result = new Observable(function (groupSubscriber) {\n                activeGroups++;\n                var innerSub = groupSubject.subscribe(groupSubscriber);\n                return function () {\n                    innerSub.unsubscribe();\n                    --activeGroups === 0 && teardownAttempted && groupBySourceSubscriber.unsubscribe();\n                };\n            });\n            result.key = key;\n            return result;\n        }\n    });\n}\n//# sourceMappingURL=groupBy.js.map", "import { operate } from '../util/lift';\nimport { scanInternals } from './scanInternals';\nexport function scan(accumulator, seed) {\n    return operate(scanInternals(accumulator, seed, arguments.length >= 2, true));\n}\n//# sourceMappingURL=scan.js.map", "import { innerFrom } from '../observable/innerFrom';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function switchMap(project, resultSelector) {\n    return operate(function (source, subscriber) {\n        var innerSubscriber = null;\n        var index = 0;\n        var isComplete = false;\n        var checkComplete = function () { return isComplete && !innerSubscriber && subscriber.complete(); };\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            innerSubscriber === null || innerSubscriber === void 0 ? void 0 : innerSubscriber.unsubscribe();\n            var innerIndex = 0;\n            var outerIndex = index++;\n            innerFrom(project(value, outerIndex)).subscribe((innerSubscriber = createOperatorSubscriber(subscriber, function (innerValue) { return subscriber.next(resultSelector ? resultSelector(value, innerValue, outerIndex, innerIndex++) : innerValue); }, function () {\n                innerSubscriber = null;\n                checkComplete();\n            })));\n        }, function () {\n            isComplete = true;\n            checkComplete();\n        }));\n    });\n}\n//# sourceMappingURL=switchMap.js.map", "import { switchMap } from './switchMap';\nimport { identity } from '../util/identity';\nexport function switchAll() {\n    return switchMap(identity);\n}\n//# sourceMappingURL=switchAll.js.map", "import { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { innerFrom } from '../observable/innerFrom';\nimport { noop } from '../util/noop';\nexport function takeUntil(notifier) {\n    return operate(function (source, subscriber) {\n        innerFrom(notifier).subscribe(createOperatorSubscriber(subscriber, function () { return subscriber.complete(); }, noop));\n        !subscriber.closed && source.subscribe(subscriber);\n    });\n}\n//# sourceMappingURL=takeUntil.js.map", "import { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nexport function takeWhile(predicate, inclusive) {\n    if (inclusive === void 0) { inclusive = false; }\n    return operate(function (source, subscriber) {\n        var index = 0;\n        source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n            var result = predicate(value, index++);\n            (result || inclusive) && subscriber.next(value);\n            !result && subscriber.complete();\n        }));\n    });\n}\n//# sourceMappingURL=takeWhile.js.map", "import { isFunction } from '../util/isFunction';\nimport { operate } from '../util/lift';\nimport { createOperatorSubscriber } from './OperatorSubscriber';\nimport { identity } from '../util/identity';\nexport function tap(observerOrNext, error, complete) {\n    var tapObserver = isFunction(observerOrNext) || error || complete\n        ?\n            { next: observerOrNext, error: error, complete: complete }\n        : observerOrNext;\n    return tapObserver\n        ? operate(function (source, subscriber) {\n            var _a;\n            (_a = tapObserver.subscribe) === null || _a === void 0 ? void 0 : _a.call(tapObserver);\n            var isUnsub = true;\n            source.subscribe(createOperatorSubscriber(subscriber, function (value) {\n                var _a;\n                (_a = tapObserver.next) === null || _a === void 0 ? void 0 : _a.call(tapObserver, value);\n                subscriber.next(value);\n            }, function () {\n                var _a;\n                isUnsub = false;\n                (_a = tapObserver.complete) === null || _a === void 0 ? void 0 : _a.call(tapObserver);\n                subscriber.complete();\n            }, function (err) {\n                var _a;\n                isUnsub = false;\n                (_a = tapObserver.error) === null || _a === void 0 ? void 0 : _a.call(tapObserver, err);\n                subscriber.error(err);\n            }, function () {\n                var _a, _b;\n                if (isUnsub) {\n                    (_a = tapObserver.unsubscribe) === null || _a === void 0 ? void 0 : _a.call(tapObserver);\n                }\n                (_b = tapObserver.finalize) === null || _b === void 0 ? void 0 : _b.call(tapObserver);\n            }));\n        })\n        :\n            identity;\n}\n//# sourceMappingURL=tap.js.map", "import * as Nostr from \"nostr-typedef\";\nimport {\n  catchError,\n  delay,\n  distinct,\n  distinctUntilChanged,\n  EMPTY,\n  filter,\n  from,\n  groupBy,\n  map,\n  mergeAll,\n  mergeMap,\n  type MonoTypeOperatorFunction,\n  type ObservableInput,\n  of,\n  type OperatorFunction,\n  pipe,\n  scan,\n  tap,\n  timeout,\n  TimeoutError,\n} from \"rxjs\";\n\nimport { EventVerifier } from \"./config/verifier.js\";\nimport { RxNostrLogicError } from \"./error.js\";\nimport { evalFilters } from \"./lazy-filter.js\";\nimport { compareEvents } from \"./nostr/event.js\";\nimport { isFiltered, MatchFilterOptions } from \"./nostr/filter.js\";\nimport { isExpired } from \"./nostr/nip40.js\";\nimport {\n  EventPacket,\n  LazyFilter,\n  MessagePacket,\n  OkPacket,\n  ReqPacket,\n} from \"./packet.js\";\nimport { fill } from \"./utils/config.js\";\n\n// --------------------- //\n// EventPacket operators //\n// --------------------- //\n\n/**\n * Remove the events once seen.\n */\nexport function uniq<P extends EventPacket>(\n  flushes?: ObservableInput<unknown>,\n): MonoTypeOperatorFunction<P> {\n  return distinct<P, string>(({ event }) => event.id, flushes);\n}\n\n/**\n * Create a customizable uniq operator.\n *\n * If `keyFn()` returns a non-null key, the key is stored in `Set`.\n * The operator filters packets with keys already stored.\n *\n * The `Set` returned in the second value of the tuple\n * can be manipulated externally or in optional event handlers.\n * For example, you can call `Set#clear()` to forget all keys.\n */\nexport function createUniq<P extends EventPacket, T>(\n  keyFn: (packet: P) => T | null,\n  options?: CreateUniqOptions<T>,\n): [MonoTypeOperatorFunction<P>, Set<T>] {\n  const cache = new Set<T>();\n\n  return [\n    filter((packet) => {\n      const key = keyFn(packet);\n      if (key === null) {\n        return true;\n      }\n\n      if (cache.has(key)) {\n        options?.onHit?.(packet, cache);\n        return false;\n      } else {\n        cache.add(key);\n        options?.onCache?.(packet, cache);\n        return true;\n      }\n    }),\n    cache,\n  ];\n}\n\n/**\n * Drop the event if it has already been seen,\n * then record on which relay the event was seen.\n */\nexport function tie<P extends EventPacket>(\n  flushes?: ObservableInput<unknown>,\n): OperatorFunction<P, P & { seenOn: Set<string> }> {\n  const [fn, memo] = createTie<P>();\n\n  if (flushes) {\n    from(flushes).subscribe(() => {\n      memo.clear();\n    });\n  }\n\n  return fn;\n}\n\n/**\n * Create a customizable tie operator.\n */\nexport function createTie<P extends EventPacket>(): [\n  OperatorFunction<P, P & { seenOn: Set<string>; isNew: boolean }>,\n  Map<string, Set<string>>,\n] {\n  const memo = new Map<string, Set<string>>();\n\n  return [\n    pipe(\n      filter((packet) => !memo.get(packet.event.id)?.has(packet.from)),\n      map((packet) => {\n        const seenOn = memo.get(packet.event.id) ?? new Set<string>();\n        const isNew = seenOn.size <= 0;\n\n        seenOn.add(packet.from);\n        memo.set(packet.event.id, seenOn);\n\n        return {\n          ...packet,\n          seenOn,\n          isNew,\n        };\n      }),\n    ),\n    memo,\n  ];\n}\n\n/**\n * Only the latest events are allowed to pass.\n */\nexport function latest<P extends EventPacket>(): MonoTypeOperatorFunction<P> {\n  return pipe(\n    scan((acc, packet) =>\n      compareEvents(acc.event, packet.event) < 0 ? packet : acc,\n    ),\n    distinctUntilChanged(\n      (a, b) => a === b,\n      ({ event }) => event.id,\n    ),\n  );\n}\n\n/**\n * For each key, only the latest events are allowed to pass.\n */\nexport function latestEach<P extends EventPacket, K>(\n  key: (packet: P) => K,\n): MonoTypeOperatorFunction<P> {\n  return pipe(groupBy(key), map(pipe(latest())), mergeAll());\n}\n\n/**\n * Only events with a valid signature are allowed to pass.\n */\nexport function verify<P extends EventPacket>(\n  verifier: EventVerifier,\n): MonoTypeOperatorFunction<P> {\n  return filterAsync(({ event }) => verifier(event));\n}\n\n/**\n * Only events with given kind are allowed to pass.\n */\nexport function filterByKind<P extends EventPacket>(\n  kind: number,\n  options?: NotOption,\n): MonoTypeOperatorFunction<P> {\n  const { not } = fill(options, { not: false });\n  return filter(({ event }) => xor(event.kind === kind, not));\n}\n\n/**\n * Only events with given kinds are allowed to pass.\n */\nexport function filterByKinds<P extends EventPacket>(\n  kinds: number[],\n  options?: NotOption,\n): MonoTypeOperatorFunction<P> {\n  const { not } = fill(options, { not: false });\n  return filter(({ event }) => xor(kinds.includes(event.kind), not));\n}\n\n/**\n * Filter events based on a REQ filter object.\n */\nexport function filterBy<P extends EventPacket>(\n  filters: LazyFilter | LazyFilter[],\n  options?: MatchFilterOptions & NotOption,\n): MonoTypeOperatorFunction<P> {\n  const { not } = fill(options, { not: false });\n  const evaledFilter = evalFilters(filters);\n  return filter(({ event }) => {\n    return xor(isFiltered(event, evaledFilter, options), not);\n  });\n}\n\n/**\n * Accumulate latest events in order of new arrival (based on `created_at`).\n */\nexport function timeline<P extends EventPacket>(\n  limit?: number,\n): OperatorFunction<P, P[]> {\n  return scan<P, P[]>((acc, packet) => {\n    const next = [...acc, packet].sort(\n      (a, b) => -1 * compareEvents(a.event, b.event),\n    );\n    if (limit !== undefined) {\n      next.splice(limit);\n    }\n    return next;\n  }, []);\n}\n\nexport function sortEvents<P extends EventPacket>(\n  bufferTime: number,\n  compareFn?: (a: P, b: P) => number,\n): MonoTypeOperatorFunction<P> {\n  return sort(\n    bufferTime,\n    compareFn ?? ((a, b) => compareEvents(a.event, b.event)),\n  );\n}\n\n/**\n * Remove expired events. See also [NIP-40](https://github.com/nostr-protocol/nips/blob/master/40.md).\n */\nexport function dropExpiredEvents<P extends EventPacket>(\n  now?: Date,\n): MonoTypeOperatorFunction<P> {\n  let refTime: number | undefined = undefined;\n  if (now) {\n    refTime = Math.floor(now?.getTime() / 1000);\n  }\n\n  return filter(({ event }) => !isExpired(event, refTime));\n}\n\n// ----------------------- //\n// MessagePacket operators //\n// ----------------------- //\n\nexport function filterByType<T extends Nostr.ToClientMessage.Type>(\n  type: T,\n): OperatorFunction<MessagePacket, MessagePacket & { type: T }> {\n  return filter(\n    (packet): packet is MessagePacket & { type: T } => packet.type === type,\n  );\n}\n\n// ----------------------- //\n// OkPacket operators      //\n// ----------------------- //\n\n/**\n * Only events with given kind are allowed to pass.\n */\nexport function filterByEventId<P extends OkPacket>(\n  eventId: string,\n  options?: NotOption,\n): MonoTypeOperatorFunction<P> {\n  const { not } = fill(options, { not: false });\n  return filter((p) => xor(p.eventId === eventId, not));\n}\n\n// ------------------- //\n// ReqPacket operators //\n// ------------------- //\n\n/**\n * Map REQ packets into a single REQ packet.\n *\n * It is useful to reduce REQ requests in a time interval.\n */\nexport function batch(\n  /** Function used for merge REQ filters. Default behavior is simple concatenation. */\n  mergeFilter?: MergeFilter,\n): OperatorFunction<ReqPacket[], ReqPacket> {\n  return mergeMap((packets) => {\n    const batched: ReqPacket[] = [];\n    for (const packetGroup of groupByRelays(packets)) {\n      if (!packetGroup[0]) {\n        continue;\n      }\n\n      const foldedFilters = packetGroup\n        .map(({ filters }) => filters)\n        .reduce((acc, v) => (mergeFilter ?? defaultMergeFilter)(acc, v), []);\n\n      batched.push({ ...packetGroup[0], filters: foldedFilters });\n    }\n\n    return from(batched);\n  });\n}\n\nfunction groupByRelays(packets: ReqPacket[]): ReqPacket[][] {\n  const groups: Record<string, ReqPacket[]> = {};\n  const toKey = (relays: string[] | undefined): string =>\n    relays ? relays.join(\",\") : \"*\";\n\n  for (const packet of packets) {\n    const key = toKey(packet.relays);\n    groups[key] ??= [];\n    groups[key].push(packet);\n  }\n\n  return Object.values(groups);\n}\n\n/**\n * Chunk a REQ packet into multiple REQ packets.\n *\n * It is useful to avoid to send large REQ filter.\n */\nexport function chunk(\n  predicate: (f: LazyFilter[]) => boolean,\n  toChunks: (f: LazyFilter[]) => LazyFilter[][],\n): MonoTypeOperatorFunction<ReqPacket> {\n  return mergeMap((packet) =>\n    predicate(packet.filters)\n      ? from(\n          toChunks(packet.filters).map((filters) => ({ ...packet, filters })),\n        )\n      : of(packet),\n  );\n}\n\n// ----------------- //\n// General operators //\n// ----------------- //\n\nexport function filterAsync<T>(\n  predicate: (x: T, index: number) => Promise<boolean>,\n): MonoTypeOperatorFunction<T> {\n  return mergeMap((packet, index) =>\n    from(predicate(packet, index)).pipe(\n      mergeMap((result) => (result ? of(packet) : EMPTY)),\n    ),\n  );\n}\n\n/**\n * Almost RxJS's `timeout`, but won't throw.\n */\nexport function completeOnTimeout<T>(\n  time: number,\n): MonoTypeOperatorFunction<T> {\n  return pipe(\n    timeout(time),\n    catchError((error: unknown) => {\n      if (error instanceof TimeoutError) {\n        return EMPTY;\n      } else {\n        throw error;\n      }\n    }),\n  );\n}\n\n/**\n * Buffer the received values for a specified time\n * and return the values in sorted order as possible.\n */\nexport function sort<T>(\n  bufferTime: number,\n  compareFn: (a: T, b: T) => number,\n): MonoTypeOperatorFunction<T> {\n  const buffer: T[] = [];\n\n  return pipe(\n    tap((v) => {\n      buffer.push(v);\n      buffer.sort(compareFn);\n    }),\n    delay(bufferTime),\n    map(() => {\n      if (buffer.length <= 0) {\n        throw new RxNostrLogicError();\n      }\n      // Non-null is valid because the length has been checked.\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      return buffer.shift()!;\n    }),\n  );\n}\n\nexport function filterBySubId<P extends { subId: string }>(\n  subId: string,\n  options?: NotOption,\n): OperatorFunction<P, P> {\n  const { not } = fill(options, { not: false });\n  return filter((packet) => xor(packet.subId === subId, not));\n}\n\n// ----------- //\n// Other stuff //\n// ----------- //\n\nexport type MergeFilter = (a: LazyFilter[], b: LazyFilter[]) => LazyFilter[];\n\nfunction defaultMergeFilter(a: LazyFilter[], b: LazyFilter[]): LazyFilter[] {\n  return [...a, ...b];\n}\n\nexport interface CreateUniqOptions<T> {\n  onCache?: (packet: EventPacket, cache: Set<T>) => void;\n  onHit?: (packet: EventPacket, cache: Set<T>) => void;\n}\n\nexport interface NotOption {\n  not: boolean;\n}\n\nfunction xor(x: boolean, y: boolean) {\n  return (!x && y) || (x && !y);\n}\n", "import { Subject } from \"rxjs\";\n\nimport type { Authenticator, FilledRxNostrConfig } from \"../config/index.js\";\nimport type { RelayConnection } from \"./relay.js\";\n\nexport class AuthProxy {\n  private relay: RelayConnection;\n  private config: FilledRxNostrConfig;\n  private authenticator: Authenticator;\n  private ongoings = new Set<string>();\n  private authResult$ = new Subject<boolean>();\n  private disposed = false;\n\n  constructor(params: {\n    relay: RelayConnection;\n    config: FilledRxNostrConfig;\n    authenticator: Authenticator;\n  }) {\n    this.relay = params.relay;\n    this.config = params.config;\n    this.authenticator = params.authenticator;\n\n    const listenOK = this.relay.getOKObservable().subscribe((result) => {\n      const { eventId, ok } = result;\n\n      if (!this.ongoings.has(eventId)) {\n        return;\n      }\n\n      this.ongoings.delete(eventId);\n      this.authResult$.next(ok);\n\n      if (!ok) {\n        listenOK.unsubscribe();\n        listenAUTH.unsubscribe();\n      }\n    });\n\n    const listenAUTH = this.relay\n      .getAUTHObservable()\n      .subscribe(({ challenge }) => {\n        this.challenge(challenge);\n      });\n  }\n\n  getAuthResultObservable() {\n    return this.authResult$.asObservable();\n  }\n\n  private async challenge(challenge: string): Promise<void> {\n    try {\n      const event = await this.signer.signEvent({\n        kind: 22242,\n        content: \"\",\n        tags: [\n          [\"relay\", this.relay.url],\n          [\"challenge\", challenge],\n        ],\n      });\n\n      this.ongoings.add(event.id);\n      this.relay.send([\"AUTH\", event]);\n    } catch {\n      // do nothing\n    }\n  }\n\n  private get signer() {\n    return this.authenticator.signer ?? this.config.signer;\n  }\n\n  dispose() {\n    this[Symbol.dispose]();\n  }\n\n  [Symbol.dispose](): void {\n    if (this.disposed) {\n      return;\n    }\n\n    this.disposed = true;\n\n    const subjects = [this.authResult$];\n    for (const sub of subjects) {\n      sub.complete();\n    }\n  }\n}\n", "import { BehaviorSubject, first, firstValueFrom, Subject } from \"rxjs\";\n\nexport class CounterSubject extends BehaviorSubject<number> {\n  constructor(count?: number) {\n    super(count ?? 0);\n  }\n\n  increment() {\n    this.next(this.getValue() + 1);\n  }\n  decrement() {\n    this.next(this.getValue() - 1);\n  }\n  next(x: ((v: number) => number) | number) {\n    if (typeof x === \"number\") {\n      super.next(x);\n    } else {\n      super.next(x(this.getValue()));\n    }\n  }\n}\n\nexport class NotifySubject<T = void> extends Subject<T> {\n  waitNext() {\n    return firstValueFrom(this.pipe(first()));\n  }\n}\n", "import * as Nostr from \"nostr-typedef\";\nimport { Observable, Subject } from \"rxjs\";\n\nimport { OkPacketAgainstEvent } from \"../packet.js\";\nimport { AuthProxy } from \"./auth.js\";\nimport { RelayConnection } from \"./relay.js\";\nimport { CounterSubject } from \"./utils.js\";\n\nexport class PublishProxy {\n  private relay: RelayConnection;\n  private authProxy: AuthProxy | null;\n  private pubs = new Map<string, Nostr.Event>();\n  private authRequiredPubs = new Set<string>();\n  private count$ = new CounterSubject(0);\n  private ok$ = new Subject<OkPacketAgainstEvent>();\n  private disposed = false;\n\n  constructor(params: { relay: RelayConnection; authProxy: AuthProxy | null }) {\n    this.relay = params.relay;\n    this.authProxy = params.authProxy;\n\n    // Recovering\n    this.relay.getReconnectedObservable().subscribe((toRelayMessage) => {\n      for (const [type, event] of toRelayMessage) {\n        if (type !== \"EVENT\") {\n          continue;\n        }\n\n        if (this.pubs.has(event.id)) {\n          this.sendEVENT(event);\n        }\n      }\n    });\n\n    // Handle OKs.\n    // If auth is required and it can be done,\n    // set a flag on OkPacket and try to resend EVENT after done.\n    this.relay.getOKObservable().subscribe(async (packet) => {\n      const { eventId, notice } = packet;\n      const event = this.pubs.get(eventId);\n      if (!event) {\n        return;\n      }\n\n      if (this.authProxy && notice?.startsWith(\"auth-required:\")) {\n        this.authRequiredPubs.add(eventId);\n        this.ok$.next({ ...packet, done: false });\n      } else {\n        this.ok$.next({\n          ...packet,\n          done: true,\n        });\n        this.confirmOK(eventId);\n      }\n    });\n\n    this.authProxy?.getAuthResultObservable().subscribe((ok) => {\n      if (ok) {\n        for (const eventId of this.authRequiredPubs) {\n          const event = this.pubs.get(eventId);\n          if (event) {\n            this.sendEVENT(event);\n          }\n        }\n      } else {\n        for (const eventId of this.authRequiredPubs) {\n          this.confirmOK(eventId);\n        }\n      }\n\n      this.authRequiredPubs.clear();\n    });\n  }\n\n  async publish(event: Nostr.Event): Promise<void> {\n    if (this.disposed) {\n      return;\n    }\n\n    if (!this.pubs.has(event.id)) {\n      this.pubs.set(event.id, event);\n      this.count$.increment();\n    }\n\n    return this.sendEVENT(event);\n  }\n\n  confirmOK(eventId: string): void {\n    if (this.disposed) {\n      return;\n    }\n\n    if (!this.pubs.has(eventId)) {\n      this.pubs.delete(eventId);\n      this.count$.decrement();\n    }\n  }\n\n  getOkAgainstEventObservable(): Observable<OkPacketAgainstEvent> {\n    return this.ok$.asObservable();\n  }\n\n  getLogicalConnectionSizeObservable(): Observable<number> {\n    return this.count$.asObservable();\n  }\n\n  dispose() {\n    this[Symbol.dispose]();\n  }\n\n  [Symbol.dispose](): void {\n    if (this.disposed) {\n      return;\n    }\n\n    this.disposed = true;\n\n    const subjects = [this.count$, this.ok$];\n    for (const sub of subjects) {\n      sub.complete();\n    }\n  }\n\n  private sendEVENT(event: Nostr.Event) {\n    return this.relay.send([\"EVENT\", event]);\n  }\n}\n", "// the minimum WebSocket interface definition for rx-nostr to work\n\nexport interface IWebSocketConstructor {\n  new (url: string): IWebSocket;\n}\n\nexport interface IWebSocket {\n  readyState: number;\n\n  addEventListener(\n    method: \"message\",\n    callback: (event: IMessageEvent) => void,\n  ): void;\n  addEventListener(\n    method: \"close\",\n    callback: (event: ICloseEvent) => void,\n  ): void;\n  addEventListener(method: \"open\", callback: () => void): void;\n  removeEventListener(\n    method: \"message\",\n    callback: (event: IMessageEvent) => void,\n  ): void;\n  removeEventListener(\n    method: \"close\",\n    callback: (event: ICloseEvent) => void,\n  ): void;\n  removeEventListener(method: \"open\", callback: () => void): void;\n\n  send(data: string): void;\n  close(code?: number): void;\n}\n\nexport interface ICloseEvent {\n  type: string;\n  code: number;\n  reason: string;\n}\n\nexport interface IMessageEvent {\n  type: string;\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  data: any;\n}\n\nexport const ReadyState = {\n  CONNECTING: 0,\n  OPEN: 1,\n  CLOSING: 2,\n  CLOSED: 3,\n} as const;\n", "import * as Nostr from \"nostr-typedef\";\nimport {\n  distinctUntilChanged,\n  EMPTY,\n  filter,\n  map,\n  Observable,\n  of,\n  Subject,\n  Subscription,\n  timer,\n} from \"rxjs\";\n\nimport type { FilledRxNostrConfig, RetryConfig } from \"../config/index.js\";\nimport {\n  RxNostrInvalidUsageError,\n  RxNostrLogicError,\n  RxNostrWebSocketError,\n} from \"../error.js\";\nimport { Nip11Registry } from \"../nip11.js\";\nimport {\n  AuthPacket,\n  ClosedPacket,\n  ConnectionState,\n  ConnectionStatePacket,\n  EosePacket,\n  EventPacket,\n  MessagePacket,\n  OkPacket,\n  OutgoingMessagePacket,\n} from \"../packet.js\";\nimport {\n  ICloseEvent,\n  IMessageEvent,\n  IWebSocket,\n  IWebSocketConstructor,\n  ReadyState,\n} from \"../websocket.js\";\nimport { NotifySubject } from \"./utils.js\";\n\nexport class RelayConnection {\n  private socket: IWebSocket | null = null;\n  private buffer: Nostr.ToRelayMessage.Any[] = [];\n  private unsent: Nostr.ToRelayMessage.Any[] = [];\n  private reconnected$ = new Subject<Nostr.ToRelayMessage.Any[]>();\n  private outgoing$ = new Subject<OutgoingMessagePacket>();\n  private message$ = new Subject<MessagePacket>();\n  private error$ = new Subject<unknown>();\n  private retryTimer: Subscription | null = null;\n  private sendAttempted$ = new NotifySubject();\n\n  private disposed = false;\n\n  private state$ = new Subject<ConnectionState>();\n  private _state: ConnectionState = \"initialized\";\n  get state(): ConnectionState {\n    return this._state;\n  }\n  private setState(state: ConnectionState) {\n    this._state = state;\n    this.state$.next(state);\n  }\n\n  constructor(\n    public url: string,\n    private config: FilledRxNostrConfig,\n  ) {\n    // Caching\n    if (!config.skipFetchNip11) {\n      Nip11Registry.getOrFetch(url);\n    }\n\n    this.setState(\"initialized\");\n  }\n\n  connectManually() {\n    this.connect();\n  }\n  private connect(retryCount?: number) {\n    if (this.state === \"terminated\") {\n      return;\n    }\n\n    const isRetry = typeof retryCount === \"number\";\n    const canConnect =\n      this.state === \"initialized\" ||\n      this.state === \"dormant\" ||\n      this.state === \"error\" ||\n      this.state === \"rejected\" ||\n      isRetry;\n    if (!canConnect) {\n      return;\n    }\n\n    this.socket = this.createSocket(retryCount ?? 0);\n  }\n  private createSocket(retryCount: number) {\n    const isAutoRetry = retryCount > 0;\n    const isManualRetry = this.state === \"error\" || this.state === \"rejected\";\n\n    if (isAutoRetry) {\n      this.setState(\"retrying\");\n    } else {\n      this.setState(\"connecting\");\n    }\n\n    const onopen = async () => {\n      if (this.state === \"terminated\") {\n        socket.close(WebSocketCloseCode.RX_NOSTR_DISPOSED);\n        return;\n      }\n\n      this.setState(\"connected\");\n\n      if (isAutoRetry || isManualRetry) {\n        this.reconnected$.next(this.unsent);\n        this.unsent = [];\n      }\n\n      try {\n        for (const message of this.buffer) {\n          this.send(message);\n        }\n      } catch (err) {\n        this.error$.next(err);\n      } finally {\n        this.buffer = [];\n      }\n    };\n    const onmessage = ({ data }: IMessageEvent) => {\n      if (this.state === \"terminated\") {\n        return;\n      }\n\n      try {\n        this.message$.next(this.pack(JSON.parse(data)));\n      } catch (err) {\n        this.error$.next(err);\n      }\n    };\n    const onclose = ({ code }: ICloseEvent) => {\n      socket.removeEventListener(\"open\", onopen);\n      socket.removeEventListener(\"message\", onmessage);\n      socket.removeEventListener(\"close\", onclose);\n      if (this.socket === socket) {\n        this.socket = null;\n      }\n\n      if (\n        this.state === \"terminated\" ||\n        code === WebSocketCloseCode.RX_NOSTR_DISPOSED\n      ) {\n        this.unsent = [];\n        this.buffer = [];\n        return;\n      }\n\n      if (code === WebSocketCloseCode.RX_NOSTR_IDLE) {\n        this.setState(\"dormant\");\n\n        if (this.buffer.length > 0) {\n          this.connect();\n        }\n      } else if (code === WebSocketCloseCode.DONT_RETRY) {\n        this.unsent = [];\n        this.buffer = [];\n\n        this.error$.next(new RxNostrWebSocketError(code));\n        this.setState(\"rejected\");\n      } else {\n        this.unsent.push(...this.buffer);\n        this.buffer = [];\n\n        this.error$.next(new RxNostrWebSocketError(code));\n\n        const nextRetry = retryCount + 1;\n        const shouldRetry =\n          this.config.retry.strategy !== \"off\" &&\n          nextRetry <= this.config.retry.maxCount;\n\n        if (shouldRetry) {\n          this.setState(\"waiting-for-retrying\");\n\n          this.retryTimer?.unsubscribe();\n          this.retryTimer = retryTimer(this.config.retry, nextRetry).subscribe(\n            () => {\n              if (!this.disposed) {\n                this.connect(nextRetry);\n              }\n            },\n          );\n        } else {\n          this.setState(\"error\");\n        }\n      }\n    };\n\n    const WebSocket: IWebSocketConstructor =\n      this.config.websocketCtor ?? globalThis.WebSocket;\n\n    if (!WebSocket) {\n      throw new RxNostrInvalidUsageError(\"WebSocket constructor is missing\");\n    }\n\n    const socket: IWebSocket = new WebSocket(this.url);\n\n    socket.addEventListener(\"open\", onopen);\n    socket.addEventListener(\"message\", onmessage);\n    socket.addEventListener(\"close\", onclose);\n\n    return socket;\n  }\n  private pack(message: Nostr.ToClientMessage.Any): MessagePacket {\n    const type = message[0];\n    const from = this.url;\n\n    switch (type) {\n      case \"EVENT\":\n        return {\n          from,\n          type,\n          message,\n          subId: message[1],\n          event: message[2],\n        };\n      case \"EOSE\":\n        return {\n          from,\n          type,\n          message,\n          subId: message[1],\n        };\n      case \"OK\":\n        return {\n          from,\n          type,\n          message,\n          eventId: message[1],\n          ok: message[2],\n          notice: message[3],\n        };\n      case \"CLOSED\":\n        return {\n          from,\n          type,\n          message,\n          subId: message[1],\n          notice: message[2],\n        };\n      case \"NOTICE\":\n        return {\n          from,\n          type,\n          message,\n          notice: message[1],\n        };\n      case \"AUTH\":\n        return {\n          from,\n          type,\n          message,\n          challenge: message[1],\n        };\n      case \"COUNT\":\n        return {\n          from,\n          type,\n          message,\n          subId: message[1],\n          count: message[2],\n        };\n      default:\n        return {\n          from,\n          type: \"unknown\",\n          message,\n        };\n    }\n  }\n\n  disconnect(code: WebSocketCloseCode): void {\n    if (this.socket?.readyState === ReadyState.OPEN) {\n      this.socket.close(code);\n    }\n  }\n\n  send(message: Nostr.ToRelayMessage.Any): Promise<void> {\n    const done = this.sendAttempted$.waitNext();\n\n    switch (this.state) {\n      case \"terminated\":\n      case \"rejected\": {\n        this.sendAttempted$.next();\n        return done;\n      }\n      case \"initialized\":\n      case \"connecting\":\n      case \"dormant\": {\n        this.buffer.push(message);\n        this.connect();\n        return done;\n      }\n      case \"connected\": {\n        if (!this.socket) {\n          throw new RxNostrLogicError();\n        }\n\n        if (this.socket.readyState === ReadyState.OPEN) {\n          this.outgoing$.next({ to: this.url, message });\n          this.socket.send(JSON.stringify(message));\n          this.sendAttempted$.next();\n          return done;\n        } else {\n          this.buffer.push(message);\n        }\n        return done;\n      }\n      case \"waiting-for-retrying\":\n      case \"retrying\":\n      case \"error\": {\n        this.sendAttempted$.next();\n        this.unsent.push(message);\n        return done;\n      }\n    }\n  }\n\n  getEVENTObservable(): Observable<EventPacket> {\n    return this.message$.pipe(\n      filter((p): p is EventPacket => p.type === \"EVENT\"),\n    );\n  }\n  getEOSEObservable(): Observable<EosePacket> {\n    return this.message$.pipe(\n      filter((p): p is EosePacket => p.type === \"EOSE\"),\n    );\n  }\n  getCLOSEDObservable(): Observable<ClosedPacket> {\n    return this.message$.pipe(\n      filter((p): p is ClosedPacket => p.type === \"CLOSED\"),\n    );\n  }\n  getOKObservable(): Observable<OkPacket> {\n    return this.message$.pipe(filter((p): p is OkPacket => p.type === \"OK\"));\n  }\n  getAUTHObservable(): Observable<AuthPacket> {\n    return this.message$.pipe(\n      filter((p): p is AuthPacket => p.type === \"AUTH\"),\n    );\n  }\n  getAllMessageObservable(): Observable<MessagePacket> {\n    return this.message$.asObservable();\n  }\n\n  getOutgoingMessageObservable(): Observable<OutgoingMessagePacket> {\n    return this.outgoing$.asObservable();\n  }\n  getReconnectedObservable(): Observable<Nostr.ToRelayMessage.Any[]> {\n    return this.reconnected$.asObservable();\n  }\n  getConnectionStateObservable(): Observable<ConnectionStatePacket> {\n    return this.state$.pipe(\n      distinctUntilChanged(),\n      map((state) => ({\n        from: this.url,\n        state,\n      })),\n    );\n  }\n  getErrorObservable(): Observable<unknown> {\n    return this.error$.asObservable();\n  }\n\n  dispose() {\n    this[Symbol.dispose]();\n  }\n\n  [Symbol.dispose](): void {\n    if (this.disposed) {\n      return;\n    }\n    this.disposed = true;\n    this.setState(\"terminated\");\n\n    this.retryTimer?.unsubscribe();\n\n    this.socket?.close(WebSocketCloseCode.RX_NOSTR_DISPOSED);\n    this.socket = null;\n\n    const subjects = [\n      this.state$,\n      this.outgoing$,\n      this.message$,\n      this.error$,\n      this.reconnected$,\n      this.sendAttempted$,\n    ];\n    for (const sub of subjects) {\n      sub.complete();\n    }\n  }\n}\n\nfunction retryTimer(config: RetryConfig, count: number) {\n  switch (config.strategy) {\n    case \"exponential\": {\n      const time = Math.max(\n        config.initialDelay * 2 ** (count - 1) + (Math.random() - 0.5) * 1000,\n        1000,\n      );\n      return timer(time);\n    }\n    case \"immediately\":\n      return of(0);\n    case \"linear\":\n      return timer(config.interval);\n    case \"off\":\n      return EMPTY;\n  }\n}\n\nexport const WebSocketCloseCode = {\n  /**\n   * 1006 is a reserved value and MUST NOT be set as a status code in a\n   * Close control frame by an endpoint.  It is designated for use in\n   * applications expecting a status code to indicate that the\n   * connection was closed abnormally, e.g., without sending or\n   * receiving a Close control frame.\n   *\n   * See also: https://www.rfc-editor.org/rfc/rfc6455.html#section-7.4.1\n   */\n  ABNORMAL_CLOSURE: 1006,\n  /**\n   * When a websocket is closed by the relay with a status code 4000\n   * that means the client shouldn't try to connect again.\n   *\n   * See also: https://github.com/nostr-protocol/nips/blob/fab6a21a779460f696f11169ddf343b437327592/01.md?plain=1#L113\n   */\n  DONT_RETRY: 4000,\n  /** @internal rx-nostr uses it internally. */\n  RX_NOSTR_IDLE: 4537,\n  /** @internal rx-nostr uses it internally. */\n  RX_NOSTR_DISPOSED: 4538,\n} as const;\n\ntype WebSocketCloseCode =\n  (typeof WebSocketCloseCode)[keyof typeof WebSocketCloseCode];\n", "import * as Nostr from \"nostr-typedef\";\nimport { filter, Observable, Subject } from \"rxjs\";\n\nimport type { FilledRxNostrConfig } from \"../config/index.js\";\nimport { evalFilters } from \"../lazy-filter.js\";\nimport { Nip11Registry } from \"../nip11.js\";\nimport { isFiltered } from \"../nostr/filter.js\";\nimport { EventPacket, LazyREQ } from \"../packet.js\";\nimport { AuthProxy } from \"./auth.js\";\nimport { RelayConnection } from \"./relay.js\";\nimport { CounterSubject } from \"./utils.js\";\n\nexport interface FinPacket {\n  from: string;\n  subId: string;\n}\n\nexport class SubscribeProxy {\n  // maxSubscriptions: number | null = undefined;\n  // maxFilters: number | null;\n  // maxLimit: number | null;\n  private relay: RelayConnection;\n  private authProxy: AuthProxy | null;\n  private config: FilledRxNostrConfig;\n  private subs = new Map<string, SubRecord>();\n  private authRequiredSubs = new Set<string>();\n  private fin$ = new Subject<FinPacket>();\n  private disposed = false;\n  private queue: SubQueue;\n\n  constructor(params: {\n    relay: RelayConnection;\n    authProxy: AuthProxy | null;\n    config: FilledRxNostrConfig;\n  }) {\n    this.relay = params.relay;\n    this.authProxy = params.authProxy;\n    this.config = params.config;\n\n    this.queue = new SubQueue(this.relay.url, this.config);\n\n    // Dequeuing\n    this.queue.getActivationObservable().subscribe((activated) => {\n      for (const { req } of activated) {\n        this.sendREQ(req);\n      }\n    });\n\n    // Recovering\n    this.relay.getReconnectedObservable().subscribe(() => {\n      for (const { req } of this.queue.ongoings) {\n        this.sendREQ(req);\n      }\n    });\n\n    // Auto closing\n    this.relay.getEOSEObservable().subscribe(({ subId }) => {\n      if (this.subs.get(subId)?.autoclose) {\n        this.unsubscribe(subId);\n      }\n    });\n\n    // Mark as closed\n    this.relay.getCLOSEDObservable().subscribe(async ({ subId, notice }) => {\n      const sub = this.subs.get(subId);\n      if (!sub) {\n        return;\n      }\n\n      if (this.authProxy && notice?.startsWith(\"auth-required:\")) {\n        this.authRequiredSubs.add(subId);\n      } else {\n        this.fin(subId);\n      }\n    });\n\n    this.authProxy?.getAuthResultObservable().subscribe((ok) => {\n      if (ok) {\n        for (const subId of this.authRequiredSubs) {\n          const req = this.subs.get(subId)?.req;\n          if (req) {\n            this.sendREQ(req);\n          }\n        }\n      } else {\n        for (const subId of this.authRequiredSubs) {\n          this.fin(subId);\n        }\n      }\n\n      this.authRequiredSubs.clear();\n    });\n  }\n\n  subscribe(req: LazyREQ, autoclose: boolean): void {\n    if (this.disposed) {\n      return;\n    }\n\n    const subId = req[1];\n    const sub: SubRecord = {\n      subId,\n      req,\n      autoclose,\n    };\n\n    this.subs.set(subId, sub);\n    this.queue.enqueue(sub);\n  }\n  unsubscribe(subId: string): void {\n    if (this.disposed) {\n      return;\n    }\n\n    if (this.subs.has(subId)) {\n      this.sendCLOSE(subId);\n    }\n    this.fin(subId);\n  }\n\n  isOngoingOrQueued(subId: string): boolean {\n    return this.subs.has(subId);\n  }\n\n  getEventObservable(): Observable<EventPacket> {\n    return this.relay.getEVENTObservable().pipe(\n      filter(({ subId, event }) => {\n        const filters = this.subs.get(subId)?.filters;\n        if (!filters) {\n          return false;\n        }\n\n        return (\n          this.config.skipValidateFilterMatching || isFiltered(event, filters)\n        );\n      }),\n    );\n  }\n  getFinObservable(): Observable<FinPacket> {\n    return this.fin$.asObservable();\n  }\n  getLogicalConnectionSizeObservable(): Observable<number> {\n    return this.queue.getSizeObservable();\n  }\n\n  dispose() {\n    this[Symbol.dispose]();\n  }\n\n  [Symbol.dispose](): void {\n    if (this.disposed) {\n      return;\n    }\n\n    this.disposed = true;\n\n    const subjects = [this.fin$];\n    for (const sub of subjects) {\n      sub.complete();\n    }\n\n    this.queue.dispose();\n  }\n\n  private sendREQ([, subId, ...lazyFilters]: LazyREQ) {\n    const filters = evalFilters(lazyFilters);\n    const sub = this.subs.get(subId);\n    if (!sub) {\n      return;\n    }\n\n    sub.filters = filters;\n    this.relay.send([\"REQ\", subId, ...filters]);\n  }\n  private sendCLOSE(subId: string) {\n    this.relay.send([\"CLOSE\", subId]);\n  }\n  private fin(subId: string) {\n    this.subs.delete(subId);\n    this.queue.drop(subId);\n    this.fin$.next({\n      from: this.relay.url,\n      subId,\n    });\n  }\n}\n\ninterface SubRecord {\n  subId: string;\n  req: LazyREQ;\n  filters?: Nostr.Filter[];\n  autoclose: boolean;\n}\n\nclass SubQueue {\n  private _queuings: SubRecord[] = [];\n  private _ongoings: SubRecord[] = [];\n  private activated$ = new Subject<SubRecord[]>();\n  private count$ = new CounterSubject();\n\n  get queuings(): SubRecord[] {\n    return this._queuings;\n  }\n  private set queuings(v: SubRecord[]) {\n    this._queuings = v;\n  }\n  get ongoings(): SubRecord[] {\n    return this._ongoings;\n  }\n  private set ongoings(v: SubRecord[]) {\n    this._ongoings = v;\n  }\n\n  constructor(\n    private url: string,\n    private config: FilledRxNostrConfig,\n  ) {}\n\n  enqueue(v: SubRecord): void {\n    this.queuings = [...this.queuings, v];\n    this.count$.increment();\n\n    this.shift();\n  }\n  drop(subId: string): void {\n    const remove = (arr: SubRecord[], subId: string): [SubRecord[], number] => {\n      const prevLength = arr.length;\n      const filtered = arr.filter((e) => e.subId !== subId);\n      const removed = prevLength - filtered.length;\n\n      return [filtered, removed];\n    };\n\n    const [queuings, droppedX] = remove(this.queuings, subId);\n    const [ongoings, droppedY] = remove(this.ongoings, subId);\n    this.queuings = queuings;\n    this.ongoings = ongoings;\n    this.count$.next((v) => v - (droppedX + droppedY));\n\n    this.shift();\n  }\n\n  getActivationObservable() {\n    return this.activated$.asObservable();\n  }\n  getSizeObservable() {\n    return this.count$.asObservable();\n  }\n\n  dispose() {\n    const subjects = [this.activated$, this.count$];\n\n    for (const sub of subjects) {\n      sub.complete();\n    }\n  }\n\n  private async shift() {\n    const capacity = await this.capacity();\n\n    const concated = [...this.ongoings, ...this.queuings];\n    const ongoings = concated.slice(0, capacity);\n    const queuings = concated.slice(capacity);\n    const activated = this.queuings.slice(0, capacity - this.ongoings.length);\n\n    this.ongoings = ongoings;\n    this.queuings = queuings;\n\n    if (activated.length > 0) {\n      this.activated$.next(activated);\n    }\n  }\n\n  private async capacity() {\n    const capacity = await Nip11Registry.getValue(\n      this.url,\n      (data) => data.limitation?.max_subscriptions,\n      {\n        skipFetch: this.config.skipFetchNip11,\n      },\n    );\n    return capacity ?? Infinity;\n  }\n}\n", "import * as Nostr from \"nostr-typedef\";\nimport { combineLatest, map, Observable } from \"rxjs\";\n\nimport type {\n  Authenticator,\n  ConnectionStrategy,\n  FilledRxNostrConfig,\n} from \"../config/index.js\";\nimport { RxNostrAlreadyDisposedError } from \"../error.js\";\nimport {\n  ConnectionState,\n  ConnectionStatePacket,\n  ErrorPacket,\n  EventPacket,\n  LazyREQ,\n  MessagePacket,\n  OkPacketAgainstEvent,\n  OutgoingMessagePacket,\n} from \"../packet.js\";\nimport { fill } from \"../utils/config.js\";\nimport { normalizeRelayUrl } from \"../utils/normalize-url.js\";\nimport { AuthProxy } from \"./auth.js\";\nimport { PublishProxy } from \"./publish.js\";\nimport { RelayConnection, WebSocketCloseCode } from \"./relay.js\";\nimport { FinPacket, SubscribeProxy } from \"./subscribe.js\";\n\nexport interface SubscribeOptions {\n  overwrite: boolean;\n  autoclose: boolean;\n  mode: REQMode;\n}\n\n/**\n * - `\"default\"`: Subscriptions are active only while the relay is marked as a default relay.\n * - `\"temporary\"`: Subscriptions are always active.\n */\nexport type REQMode = \"default\" | \"temporary\";\n\nexport class NostrConnection {\n  private relay: RelayConnection;\n  private pubProxy: PublishProxy;\n  private subProxy: SubscribeProxy;\n  private defaultSubscriptionIds: Set<string> = new Set();\n  private communicating = false;\n  private strategy: ConnectionStrategy = \"lazy\";\n  private isDefaultRelay = false;\n  private disposed = false;\n  private _url: string;\n\n  get url() {\n    return this._url;\n  }\n\n  constructor(url: string, config: FilledRxNostrConfig) {\n    this._url = normalizeRelayUrl(url);\n    const authenticator = getAuthenticator(url, config);\n\n    const relay = new RelayConnection(this.url, config);\n    const authProxy = authenticator\n      ? new AuthProxy({ relay, config, authenticator })\n      : null;\n    const pubProxy = new PublishProxy({ relay, authProxy });\n    const subProxy = new SubscribeProxy({ relay, authProxy, config });\n    this.relay = relay;\n    this.pubProxy = pubProxy;\n    this.subProxy = subProxy;\n\n    // Idling cold sockets\n    combineLatest([\n      this.pubProxy.getLogicalConnectionSizeObservable(),\n      this.subProxy.getLogicalConnectionSizeObservable(),\n    ])\n      .pipe(map(([pubConns, subConns]) => pubConns + subConns))\n      .subscribe((logicalConns) => {\n        this.communicating = logicalConns > 0;\n        this.resetConnection();\n      });\n  }\n\n  setConnectionStrategy(strategy: ConnectionStrategy): void {\n    if (this.disposed) {\n      return;\n    }\n\n    this.strategy = strategy;\n    this.resetConnection();\n  }\n\n  private resetConnection() {\n    let strategy = this.strategy;\n    if (!this.isDefaultRelay) {\n      strategy = \"lazy\";\n    }\n\n    switch (strategy) {\n      case \"lazy\": {\n        if (!this.communicating) {\n          this.relay.disconnect(WebSocketCloseCode.RX_NOSTR_IDLE);\n        }\n        break;\n      }\n      case \"lazy-keep\": {\n        break;\n      }\n      case \"aggressive\": {\n        if (\n          this.connectionState === \"initialized\" ||\n          this.connectionState === \"dormant\"\n        ) {\n          this.relay.connectManually();\n        }\n        break;\n      }\n    }\n  }\n\n  markAsDefault(flag: boolean): void {\n    if (this.disposed) {\n      return;\n    }\n\n    this.isDefaultRelay = flag;\n\n    if (!this.isDefaultRelay) {\n      for (const subId of this.defaultSubscriptionIds) {\n        this.subProxy.unsubscribe(subId);\n      }\n      this.defaultSubscriptionIds.clear();\n    }\n\n    this.resetConnection();\n  }\n\n  async publish(event: Nostr.Event<number>): Promise<void> {\n    if (this.disposed) {\n      return;\n    }\n\n    return this.pubProxy.publish(event);\n  }\n  confirmOK(eventId: string): void {\n    if (this.disposed) {\n      return;\n    }\n\n    this.pubProxy.confirmOK(eventId);\n  }\n  subscribe(req: LazyREQ, options?: Partial<SubscribeOptions>): void {\n    if (this.disposed) {\n      return;\n    }\n\n    const { mode, overwrite, autoclose } = fill(options ?? {}, {\n      overwrite: false,\n      autoclose: false,\n      mode: \"default\",\n    });\n    const [, subId] = req;\n\n    if (mode === \"default\" && !this.isDefaultRelay) {\n      return;\n    }\n    if (!overwrite && this.subProxy.isOngoingOrQueued(subId)) {\n      return;\n    }\n\n    if (mode === \"default\") {\n      this.defaultSubscriptionIds.add(subId);\n    }\n    this.subProxy.subscribe(req, autoclose);\n  }\n  unsubscribe(subId: string): void {\n    if (this.disposed) {\n      return;\n    }\n\n    this.defaultSubscriptionIds.delete(subId);\n    this.subProxy.unsubscribe(subId);\n  }\n\n  getEventObservable(): Observable<EventPacket> {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    return this.subProxy.getEventObservable();\n  }\n  getFinObservable(): Observable<FinPacket> {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    return this.subProxy.getFinObservable();\n  }\n  getOkAgainstEventObservable(): Observable<OkPacketAgainstEvent> {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    return this.pubProxy.getOkAgainstEventObservable();\n  }\n  getAllMessageObservable(): Observable<MessagePacket> {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    return this.relay.getAllMessageObservable();\n  }\n\n  getOutgoingMessageObservable(): Observable<OutgoingMessagePacket> {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    return this.relay.getOutgoingMessageObservable();\n  }\n\n  getConnectionStateObservable(): Observable<ConnectionStatePacket> {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    return this.relay.getConnectionStateObservable();\n  }\n  get connectionState(): ConnectionState {\n    return this.relay.state;\n  }\n\n  getErrorObservable(): Observable<ErrorPacket> {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    return this.relay.getErrorObservable().pipe(\n      map((reason) => ({\n        from: this.url,\n        reason,\n      })),\n    );\n  }\n\n  connectManually() {\n    this.relay.connectManually();\n  }\n\n  dispose() {\n    this[Symbol.dispose]();\n  }\n\n  [Symbol.dispose](): void {\n    if (this.disposed) {\n      return;\n    }\n\n    this.disposed = true;\n\n    this.relay.dispose();\n    this.pubProxy.dispose();\n    this.subProxy.dispose();\n  }\n}\n\nfunction getAuthenticator(\n  url: string,\n  config: FilledRxNostrConfig,\n): Authenticator | undefined {\n  const a = config.authenticator;\n  if (!a) {\n    return;\n  }\n\n  const c = a instanceof Function ? a(url) : a;\n  return c === \"auto\" ? {} : c;\n}\n", "export function subtract<T>(x: T[], y: T[]): T[] {\n  return x.filter((e) => !y.includes(e));\n}\n", "import type { LazyFilter, LazyREQ } from \"../packet.js\";\nimport { normalizeRelayUrl } from \"../utils/normalize-url.js\";\nimport type {\n  AcceptableDefaultRelaysConfig,\n  DefaultRelayConfig,\n  RxNostr,\n  RxNostrOnParams,\n} from \"./interface.js\";\nimport type { RxReq } from \"./rx-req.js\";\n\nexport function makeSubId(params: { rxReq: RxReq; index: number }): string {\n  const { rxReq, index } = params;\n  const { rxReqId, strategy } = rxReq;\n\n  const childId = strategy === \"backward\" ? index : 0;\n\n  return `${rxReqId}:${childId}`;\n}\n\nexport function makeLazyREQ(params: {\n  rxReq: RxReq;\n  filters: LazyFilter[];\n  index: number;\n}): LazyREQ {\n  const { rxReq, filters, index } = params;\n\n  return [\"REQ\", makeSubId({ rxReq, index }), ...filters];\n}\n\nexport function normalizeRelaysConfig(\n  config: AcceptableDefaultRelaysConfig,\n): Record<string, DefaultRelayConfig> {\n  if (Array.isArray(config)) {\n    const arr = config.map((urlOrConfig) => {\n      let url = \"\";\n      let read = false;\n      let write = false;\n      if (typeof urlOrConfig === \"string\") {\n        url = urlOrConfig;\n        read = true;\n        write = true;\n      } else if (Array.isArray(urlOrConfig)) {\n        const mode = urlOrConfig[2];\n        url = urlOrConfig[1];\n        read = !mode || mode === \"read\";\n        write = !mode || mode === \"write\";\n      } else {\n        url = urlOrConfig.url;\n        read = urlOrConfig.read;\n        write = urlOrConfig.write;\n      }\n\n      return {\n        url,\n        read,\n        write,\n      };\n    });\n\n    return Object.fromEntries(arr.map((e) => [e.url, e]));\n  } else {\n    const arr = Object.entries(config).map(([url, flags]) => ({\n      url,\n      ...flags,\n    }));\n\n    return Object.fromEntries(arr.map((e) => [e.url, e]));\n  }\n}\n\nexport function getMethodScopeRelays(\n  rxNostr: RxNostr,\n  options?: {\n    relays?: string[];\n    on?: RxNostrOnParams;\n  },\n): string[] | undefined {\n  const targets = new Set<string>();\n\n  if (options?.on) {\n    const on = options.on;\n\n    if (!on.defaultReadRelays && !on.defaultWriteRelays && !on.relays) {\n      return undefined;\n    }\n\n    const defaultRelays = rxNostr.getDefaultRelays();\n\n    if (on.defaultReadRelays) {\n      for (const { url } of Object.values(defaultRelays).filter(\n        (e) => e.read,\n      )) {\n        targets.add(url);\n      }\n    }\n    if (on.defaultWriteRelays) {\n      for (const { url } of Object.values(defaultRelays).filter(\n        (e) => e.write,\n      )) {\n        targets.add(url);\n      }\n    }\n    if (on.relays) {\n      for (const url of on.relays) {\n        targets.add(normalizeRelayUrl(url));\n      }\n    }\n\n    return [...targets];\n  } else if (options?.relays) {\n    for (const url of options.relays) {\n      targets.add(normalizeRelayUrl(url));\n    }\n\n    return [...targets];\n  } else {\n    return undefined;\n  }\n}\n", "import * as Nostr from \"nostr-typedef\";\nimport {\n  filter,\n  finalize,\n  first,\n  firstValueFrom,\n  identity,\n  map,\n  merge,\n  mergeAll,\n  type MonoTypeOperatorFunction,\n  Observable,\n  Subject,\n  switchAll,\n  takeUntil,\n  takeWhile,\n  tap,\n  timeout,\n} from \"rxjs\";\n\nimport {\n  type FilledRxNostrConfig,\n  makeRxNostrConfig,\n  type RxNostrConfig,\n} from \"../config/index.js\";\nimport { NostrConnection, type REQMode } from \"../connection/index.js\";\nimport { FinPacket } from \"../connection/index.js\";\nimport {\n  RxNostrAlreadyDisposedError,\n  RxNostrInvalidUsageError,\n  RxNostrLogicError,\n} from \"../error.js\";\nimport { isExpired } from \"../nostr/nip40.js\";\nimport { completeOnTimeout, filterAsync, filterBySubId } from \"../operator.js\";\nimport type {\n  ConnectionState,\n  ConnectionStatePacket,\n  ErrorPacket,\n  EventPacket,\n  LazyREQ,\n  MessagePacket,\n  OkPacketAgainstEvent,\n  OutgoingMessagePacket,\n  ReqPacket,\n} from \"../packet.js\";\nimport { subtract } from \"../utils/array-operation.js\";\nimport { fill } from \"../utils/config.js\";\nimport { UrlMap } from \"../utils/url-map.js\";\nimport {\n  type AcceptableDefaultRelaysConfig,\n  type DefaultRelayConfig,\n  RelayStatus,\n  type RxNostr,\n  type RxNostrSendOptions,\n  type RxNostrUseOptions,\n} from \"./interface.js\";\nimport type { RxReq } from \"./rx-req.js\";\nimport {\n  getMethodScopeRelays,\n  makeLazyREQ,\n  normalizeRelaysConfig,\n} from \"./utils.js\";\n\n/** Create a RxNostr object. This is the only way to create that. */\nexport function createRxNostr(config: RxNostrConfig): RxNostr {\n  return new RxNostrImpl(makeRxNostrConfig(config ?? {}));\n}\n\nclass RxNostrImpl implements RxNostr {\n  private connections = new UrlMap<NostrConnection>();\n  private defaultRelays = new UrlMap<DefaultRelayConfig>();\n  private get defaultReadables(): NostrConnection[] {\n    const conns: NostrConnection[] = [];\n    for (const { url, read } of this.defaultRelays.values()) {\n      const conn = this.connections.get(url);\n      if (read && conn) {\n        conns.push(conn);\n      }\n    }\n    return conns;\n  }\n  private get defaultWritables(): NostrConnection[] {\n    const conns: NostrConnection[] = [];\n    for (const { url, write } of this.defaultRelays.values()) {\n      const conn = this.connections.get(url);\n      if (write && conn) {\n        conns.push(conn);\n      }\n    }\n    return conns;\n  }\n  private defaultSubscriptions: Map<\n    string,\n    { req: LazyREQ; autoclose: boolean }\n  > = new Map();\n\n  private event$ = new Subject<EventPacket>();\n  private fin$ = new Subject<FinPacket>();\n  private ok$ = new Subject<OkPacketAgainstEvent>();\n  private all$ = new Subject<MessagePacket>();\n\n  private error$ = new Subject<ErrorPacket>();\n  private connectionState$ = new Subject<ConnectionStatePacket>();\n  private outgoing$ = new Subject<OutgoingMessagePacket>();\n\n  private dispose$ = new Subject<void>();\n  private disposed = false;\n\n  constructor(private config: FilledRxNostrConfig) {}\n\n  // #region defaultRelays getter/setter\n  getDefaultRelays(): Record<string, DefaultRelayConfig> {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    return this.defaultRelays.toObject();\n  }\n  getDefaultRelay(url: string): DefaultRelayConfig | undefined {\n    return this.defaultRelays.get(url);\n  }\n\n  setDefaultRelays(relays: AcceptableDefaultRelaysConfig): void {\n    if (this.disposed) {\n      throw new RxNostrAlreadyDisposedError();\n    }\n\n    const nextDefaultRelays = new UrlMap(normalizeRelaysConfig(relays));\n    const nextReadableConnections: NostrConnection[] = [];\n\n    for (const { read, url } of nextDefaultRelays.values()) {\n      const conn = this.ensureNostrConnection(url);\n      conn.setConnectionStrategy(this.config.connectionStrategy);\n\n      if (read) {\n        nextReadableConnections.push(conn);\n      }\n    }\n\n    this.updateDefaultSubscriptions(nextReadableConnections);\n\n    this.defaultRelays = nextDefaultRelays;\n  }\n  private ensureNostrConnection(url: string): NostrConnection {\n    let conn = this.connections.get(url);\n\n    if (conn) {\n      return conn;\n    }\n\n    conn = new NostrConnection(url, this.config);\n\n    this.attachNostrConnection(conn);\n    this.connections.set(url, conn);\n\n    return conn;\n  }\n  private attachNostrConnection(conn: NostrConnection): void {\n    conn.getEventObservable().subscribe(this.event$);\n    conn.getFinObservable().subscribe(this.fin$);\n    conn.getOkAgainstEventObservable().subscribe(this.ok$);\n    conn.getAllMessageObservable().subscribe(this.all$);\n    conn.getConnectionStateObservable().subscribe(this.connectionState$);\n    conn.getErrorObservable().subscribe(this.error$);\n    conn.getOutgoingMessageObservable().subscribe(this.outgoing$);\n  }\n  private updateDefaultSubscriptions(\n    nextReadableConnections: NostrConnection[],\n  ): void {\n    const noLongerNeededConnections = subtract(\n      this.defaultReadables,\n      nextReadableConnections,\n    );\n\n    for (const conn of noLongerNeededConnections) {\n      conn.markAsDefault(false);\n    }\n    for (const conn of nextReadableConnections) {\n      conn.markAsDefault(true);\n      for (const { req, autoclose } of this.defaultSubscriptions.values()) {\n        conn?.subscribe(req, {\n          mode: \"default\",\n          overwrite: false,\n          autoclose,\n        });\n      }\n    }\n  }\n  addDefaultRelays(relays: AcceptableDefaultRelaysConfig): void {\n    const additionalDefaultRelays = normalizeRelaysConfig(relays);\n\n    this.setDefaultRelays({\n      ...this.defaultRelays.toObject(),\n      ...additionalDefaultRelays,\n    });\n  }\n  removeDefaultRelays(urls: string | string[]): void {\n    const defaultRelays = this.defaultRelays.copy();\n    const targets = Array.isArray(urls) ? urls : [urls];\n    for (const url of targets) {\n      defaultRelays.delete(url);\n    }\n\n    this.setDefaultRelays(defaultRelays.toObject());\n  }\n  // #endregion\n\n  // #region connection state getter\n  getAllRelayStatus(): Record<string, RelayStatus> {\n    return Object.fromEntries(\n      Array.from(this.connections.values()).map((e) => [\n        e.url,\n        { connection: e.connectionState },\n      ]),\n    );\n  }\n  getRelayStatus(url: string): RelayStatus | undefined {\n    const conn = this.connections.get(url);\n    if (!conn) {\n      return undefined;\n    }\n\n    return { connection: conn.connectionState };\n  }\n  // #endregion\n\n  reconnect(url: string): void {\n    const relay = this.getDefaultRelay(url);\n    if (!relay) {\n      throw new RxNostrInvalidUsageError(\n        `The relay (${url}) is not a default relay. \\`reconnect()\\` can be used only for a readable default relay.`,\n      );\n    }\n    if (!relay.read) {\n      throw new RxNostrInvalidUsageError(\n        `The relay (${url}) is not readable. \\`reconnect()\\` can be used only for a readable default relay.`,\n      );\n    }\n\n    const conn = this.connections.get(url);\n    if (!conn) {\n      throw new RxNostrLogicError();\n    }\n    if (\n      conn.connectionState === \"error\" ||\n      conn.connectionState === \"rejected\"\n    ) {\n      conn.connectManually();\n    }\n  }\n\n  // #region use\n  use(\n    rxReq: RxReq,\n    options?: Partial<RxNostrUseOptions>,\n  ): Observable<EventPacket> {\n    const useScopeRelays = getMethodScopeRelays(this, options);\n\n    interface OrderPacket {\n      subId: string;\n      req: LazyREQ;\n      targetConnections: NostrConnection[];\n      mode: REQMode;\n    }\n\n    const makeOrderPacket = (\n      { filters, relays }: ReqPacket,\n      index: number,\n    ): OrderPacket => {\n      const emitScopeRelays =\n        rxReq.strategy === \"backward\" ? relays : undefined;\n      const req = makeLazyREQ({ rxReq, filters, index });\n      const subId = req[1];\n\n      return {\n        subId,\n        req,\n        targetConnections:\n          (emitScopeRelays ?? useScopeRelays)?.map((url) =>\n            this.ensureNostrConnection(url),\n          ) ?? this.defaultReadables,\n        mode:\n          emitScopeRelays === undefined && useScopeRelays === undefined\n            ? \"default\"\n            : \"temporary\",\n      };\n    };\n    const startSubscription = ({\n      req,\n      targetConnections,\n      mode,\n    }: OrderPacket) => {\n      this.startSubscription({\n        req,\n        targetConnections,\n        mode,\n        overwrite: rxReq.strategy === \"forward\",\n        autoclose: rxReq.strategy === \"backward\",\n      });\n    };\n    const teardownSubscription = ({\n      subId,\n      targetConnections,\n      mode,\n    }: OrderPacket) => {\n      this.teardownSubscription({\n        subId,\n        targetConnections,\n        mode,\n      });\n    };\n    const createEventObservable = ({ req, targetConnections }: OrderPacket) => {\n      if (rxReq.strategy === \"forward\") {\n        return this.createForwardEventObservable({\n          req,\n        }).pipe(takeUntil(this.dispose$));\n      } else {\n        return this.createBackwardEventObservable({\n          req,\n          targetConnections,\n        }).pipe(takeUntil(this.dispose$));\n      }\n    };\n\n    const order$ = rxReq.getReqPacketObservable().pipe(\n      filter(({ filters }) => filters.length > 0),\n      map(makeOrderPacket),\n      takeUntil(this.dispose$),\n    );\n\n    const validate = () =>\n      filterAsync<EventPacket>(async ({ event }) => {\n        return (\n          (this.config.skipVerify || (await this.config.verifier(event))) &&\n          (this.config.skipExpirationCheck || !isExpired(event))\n        );\n      });\n\n    if (rxReq.strategy === \"forward\") {\n      let firstOrder: OrderPacket | undefined;\n\n      return order$.pipe(\n        tap((order) => {\n          firstOrder = order;\n        }),\n        tap(startSubscription),\n        map(createEventObservable),\n        finalize(() => {\n          if (!firstOrder) {\n            return;\n          }\n          // Because subId, targetConnections and mode keeps their value under forward strategy\n          teardownSubscription(firstOrder);\n        }),\n        switchAll(),\n        validate(),\n      );\n    } else {\n      return order$.pipe(\n        tap(startSubscription),\n        map((order) =>\n          createEventObservable(order).pipe(\n            finalize(() => {\n              teardownSubscription(order);\n            }),\n          ),\n        ),\n        mergeAll(),\n        validate(),\n      );\n    }\n  }\n  private createForwardEventObservable(params: {\n    req: LazyREQ;\n  }): Observable<EventPacket> {\n    const { req } = params;\n    const subId = req[1];\n\n    return this.event$.pipe(filterBySubId(subId));\n  }\n  private createBackwardEventObservable(params: {\n    req: LazyREQ;\n    targetConnections: NostrConnection[];\n  }): Observable<EventPacket> {\n    const { req, targetConnections } = params;\n    const subId = req[1];\n    const finishedRelays = new Set<string>();\n\n    const isDown = (state: ConnectionState): boolean =>\n      state === \"error\" || state === \"rejected\" || state === \"terminated\";\n    const shouldComplete = () =>\n      targetConnections.every(\n        ({ connectionState, url }) =>\n          isDown(connectionState) || finishedRelays.has(url),\n      );\n\n    const fin$ = this.fin$.pipe(\n      filterBySubId(subId),\n      tap(({ from }) => {\n        finishedRelays.add(from);\n      }),\n    );\n    const complete$ = merge(fin$, this.connectionState$.asObservable()).pipe(\n      filter(() => shouldComplete()),\n      first(),\n    );\n\n    return this.event$.pipe(\n      takeUntil(complete$),\n      completeOnTimeout(this.config.eoseTimeout),\n      filterBySubId(subId),\n      filter((e) => !finishedRelays.has(e.from)),\n    );\n  }\n  private startSubscription(params: {\n    req: LazyREQ;\n    targetConnections: NostrConnection[];\n    mode: REQMode;\n    overwrite: boolean;\n    autoclose: boolean;\n  }) {\n    const { req, targetConnections, mode, overwrite, autoclose } = params;\n    const subId = req[1];\n\n    if (mode === \"default\") {\n      this.defaultSubscriptions.set(subId, { req, autoclose });\n    }\n    for (const conn of targetConnections) {\n      conn.subscribe(req, {\n        mode,\n        overwrite,\n        autoclose,\n      });\n    }\n  }\n  private teardownSubscription(params: {\n    subId: string;\n    targetConnections: NostrConnection[];\n    mode: REQMode;\n  }): void {\n    const { subId, targetConnections, mode } = params;\n\n    if (mode === \"default\") {\n      this.defaultSubscriptions.delete(subId);\n    }\n    for (const conn of targetConnections) {\n      conn.unsubscribe(subId);\n    }\n  }\n  // #endregion use\n\n  // #region createObservable\n  createAllEventObservable(): Observable<EventPacket> {\n    return this.event$.asObservable();\n  }\n  createAllErrorObservable(): Observable<ErrorPacket> {\n    return this.error$.asObservable();\n  }\n  createAllMessageObservable(): Observable<MessagePacket> {\n    return this.all$.asObservable();\n  }\n  createConnectionStateObservable(): Observable<ConnectionStatePacket> {\n    return this.connectionState$.asObservable();\n  }\n  createOutgoingMessageObservable(): Observable<OutgoingMessagePacket> {\n    return this.outgoing$.asObservable();\n  }\n  // #endregion\n\n  send(\n    params: Nostr.EventParameters,\n    options?: Partial<RxNostrSendOptions>,\n  ): Observable<OkPacketAgainstEvent> {\n    const { signer, errorOnTimeout, completeOn } = fill(options ?? {}, {\n      signer: this.config.signer,\n      errorOnTimeout: false,\n      completeOn: \"all-ok\",\n    });\n    const relays = getMethodScopeRelays(this, options);\n\n    const targetRelays =\n      relays === undefined\n        ? this.defaultWritables\n        : relays.map((url) => this.ensureNostrConnection(url));\n    const subject = new Subject<OkPacketAgainstEvent>();\n    const finishedRelays = new Set<string>();\n    let eventId = \"\";\n\n    const teardown = () => {\n      if (!subject.closed) {\n        subject.complete();\n      }\n\n      for (const conn of targetRelays) {\n        conn.confirmOK(eventId);\n      }\n    };\n\n    signer\n      .signEvent(params)\n      .then(async (event) => {\n        if (subject.closed) {\n          return;\n        }\n\n        eventId = event.id;\n\n        this.ok$\n          .pipe(filter(({ eventId }) => eventId === event.id))\n          .subscribe(subject);\n\n        await Promise.all(targetRelays.map((conn) => conn.publish(event)));\n\n        if (completeOn === \"sent\") {\n          subject.complete();\n        }\n      })\n      .catch((err) => {\n        teardown();\n\n        throw new RxNostrInvalidUsageError(\n          err instanceof Error ? err.message : \"Failed to sign the given event\",\n        );\n      });\n\n    const completeManager =\n      ((): MonoTypeOperatorFunction<OkPacketAgainstEvent> => {\n        switch (completeOn) {\n          case \"sent\":\n            return identity;\n          case \"all-ok\":\n            return takeWhile(({ from, done }) => {\n              if (done) {\n                finishedRelays.add(from);\n              }\n              return finishedRelays.size < targetRelays.length;\n            }, true);\n          case \"any-ok\":\n            return first((p) => p.ok);\n        }\n      })();\n\n    return subject.pipe(\n      completeManager,\n      takeUntil(this.dispose$),\n      errorOnTimeout\n        ? timeout(this.config.okTimeout)\n        : completeOnTimeout(this.config.okTimeout),\n      finalize(teardown),\n    );\n  }\n\n  async cast(\n    params: Nostr.EventParameters<number>,\n    options?: Partial<Omit<RxNostrSendOptions, \"completeOn\">> | undefined,\n  ): Promise<void> {\n    await firstValueFrom(this.send(params, { ...options, completeOn: \"sent\" }));\n  }\n\n  dispose() {\n    this[Symbol.dispose]();\n  }\n\n  [Symbol.dispose](): void {\n    if (this.disposed) {\n      return;\n    }\n    this.disposed = true;\n\n    for (const conn of this.connections.values()) {\n      conn.dispose();\n    }\n    this.connections.clear();\n\n    const subjects = [\n      this.event$,\n      this.ok$,\n      this.fin$,\n      this.all$,\n      this.connectionState$,\n      this.error$,\n      this.outgoing$,\n    ];\n    for (const sub of subjects) {\n      sub.complete();\n    }\n\n    this.dispose$.next();\n    this.dispose$.complete();\n  }\n}\n", "import * as Nostr from \"nostr-typedef\";\nimport { Observable, of, type OperatorFunction, Subject } from \"rxjs\";\n\nimport { LazyFilter, ReqPacket } from \"../packet.js\";\n\n/**\n * The RxReq interface that is provided for RxNostr (**not for users**).\n */\nexport interface RxReq<S extends RxReqStrategy = RxReqStrategy> {\n  /** @internal User should not use this directly. The RxReq strategy. It is read-only and must not change. */\n  strategy: S;\n  /** @internal User should not use this directly. Used to construct subId. */\n  rxReqId: string;\n  /** @internal User should not use this directly. Get an Observable of ReqPacket. */\n  getReqPacketObservable(): Observable<ReqPacket>;\n}\n\n/**\n * REQ strategy.\n *\n * See comments on `createRxForwardReq()`, `createRxBackwardReq()` and `createRxOneshotReq()\n */\nexport type RxReqStrategy = \"forward\" | \"backward\";\n\nexport interface RxReqPipeable {\n  /**\n   * Returns itself overriding only `getReqObservable()`.\n   * It is useful for throttling and other control purposes.\n   */\n  pipe(): RxReq;\n  pipe(op1: OperatorFunction<ReqPacket, ReqPacket>): RxReq;\n  pipe<A>(\n    op1: OperatorFunction<ReqPacket, A>,\n    op2: OperatorFunction<A, ReqPacket>,\n  ): RxReq;\n  pipe<A, B>(\n    op1: OperatorFunction<ReqPacket, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, ReqPacket>,\n  ): RxReq;\n  pipe<A, B, C>(\n    op1: OperatorFunction<ReqPacket, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, ReqPacket>,\n  ): RxReq;\n  pipe<A, B, C, D>(\n    op1: OperatorFunction<ReqPacket, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, ReqPacket>,\n  ): RxReq;\n  pipe<A, B, C, D, E>(\n    op1: OperatorFunction<ReqPacket, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, ReqPacket>,\n  ): RxReq;\n  pipe<A, B, C, D, E, F>(\n    op1: OperatorFunction<ReqPacket, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, ReqPacket>,\n  ): RxReq;\n  pipe<A, B, C, D, E, F, G>(\n    op1: OperatorFunction<ReqPacket, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, ReqPacket>,\n  ): RxReq;\n  pipe<A, B, C, D, E, F, G, H>(\n    op1: OperatorFunction<ReqPacket, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>,\n    op9: OperatorFunction<H, ReqPacket>,\n  ): RxReq;\n}\n\nexport type RxReqEmittable<O = void> = O extends void\n  ? {\n      /** Start new REQ on the RxNostr with which the RxReq is associated. */\n      emit(filters: LazyFilter | LazyFilter[]): void;\n    }\n  : {\n      /** Start new REQ on the RxNostr with which the RxReq is associated. */\n      emit(filters: LazyFilter | LazyFilter[], options?: O): void;\n    };\n\n/**\n * Notify RxNostr that it does not intend to send any more REQs.\n * The Observable that returned by `use()` is complete\n * when all REQs that have already been sent have been completed.\n */\nexport interface RxReqOverable {\n  over(): void;\n}\n\nconst createRxReq = <S extends RxReqStrategy>(params: {\n  strategy: S;\n  rxReqId?: string;\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  operators?: OperatorFunction<any, any>[];\n  subject?: Subject<ReqPacket>;\n}): RxReq<S> &\n  RxReqEmittable<{ relays: string[] }> &\n  RxReqOverable &\n  RxReqPipeable => {\n  const { strategy } = params;\n  const _operators = params.operators ?? [];\n  const rxReqId = params.rxReqId ?? getRandomDigitsString();\n\n  const filters$ = params.subject ?? new Subject<ReqPacket>();\n\n  return {\n    strategy,\n    rxReqId,\n    getReqPacketObservable(): Observable<ReqPacket> {\n      return filters$.pipe(...(_operators as []));\n    },\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    pipe(...operators: OperatorFunction<any, any>[]): RxReq {\n      return createRxReq({\n        strategy,\n        rxReqId,\n        operators: [..._operators, ...operators],\n        subject: filters$,\n      });\n    },\n    emit(filters: LazyFilter | LazyFilter[], options?: { relays: string[] }) {\n      filters$.next({ filters: normalizeFilters(filters), ...(options ?? {}) });\n    },\n    over() {\n      filters$.complete();\n    },\n  };\n};\n\n/**\n * Create a RxReq instance based on the backward strategy.\n * It is useful if you want to retrieve past events that have already been published.\n *\n * In backward strategy:\n * - All REQs have different subIds.\n * - All REQ-subscriptions keep alive until timeout or getting EOSE.\n * - In most cases, you should specify `until` or `limit` for filters.\n *\n * For more information, see [document](https://penpenpng.github.io/rx-nostr/v1/req-strategy.html#backward-strategy).\n */\nexport function createRxBackwardReq(\n  rxReqId?: string,\n): RxReq<\"backward\"> &\n  RxReqEmittable<{ relays: string[] }> &\n  RxReqOverable &\n  RxReqPipeable {\n  return createRxReq({\n    strategy: \"backward\",\n    rxReqId,\n  });\n}\n\n/**\n * Create a RxReq instance based on the forward strategy.\n * It is useful if you want to listen future events.\n *\n * In forward strategy:\n * - All REQs have the same subId.\n * - When a new REQ is issued, the old REQ is overwritten and terminated immediately.\n *   The latest REQ keeps alive until it is overwritten or explicitly terminated.\n * - In most cases, you should not specify `limit` for filters.\n *\n * For more information, see [document](https://penpenpng.github.io/rx-nostr/v1/req-strategy.html#forward-strategy).\n */\nexport function createRxForwardReq(\n  rxReqId?: string,\n): RxReq<\"forward\"> & RxReqEmittable & RxReqPipeable {\n  return createRxReq({\n    strategy: \"forward\",\n    rxReqId,\n  });\n}\n\n/**\n * Create a RxReq instance based on the oneshot strategy.\n * It is almost the same as backward strategy, however can publish only one REQ\n * and the Observable completes on EOSE.\n *\n * For more information, see [document](https://penpenpng.github.io/rx-nostr/v1/req-strategy.html#oneshot-strategy).\n */\nexport function createRxOneshotReq(params: {\n  filters: LazyFilter | LazyFilter[];\n  rxReqId?: string;\n}): RxReq<\"backward\"> {\n  return {\n    strategy: \"backward\",\n    rxReqId: params.rxReqId ?? getRandomDigitsString(),\n    getReqPacketObservable: () =>\n      of({ filters: normalizeFilters(params.filters) }),\n  };\n}\n\nexport interface Mixin<R, T> {\n  (): ThisType<R> & T;\n}\n\nfunction getRandomDigitsString() {\n  return `${Math.floor(Math.random() * 1000000)}`;\n}\n\nfunction normalizeFilter(filter: LazyFilter): LazyFilter | null {\n  const res: LazyFilter = {};\n  const isTagName = (s: string): s is Nostr.TagName => /^#[a-zA-Z]$/.test(s);\n\n  for (const key of Object.keys(filter)) {\n    if (key === \"limit\" && (filter[key] ?? -1) >= 0) {\n      res[key] = filter[key];\n      continue;\n    }\n    if (key === \"since\" || key === \"until\") {\n      const f = filter[key];\n      if (typeof f !== \"number\" || (f ?? -1) >= 0) {\n        res[key] = f;\n        continue;\n      }\n    }\n    if (\n      (isTagName(key) || key === \"ids\" || key === \"authors\") &&\n      filter[key] !== undefined &&\n      (filter[key]?.length ?? -1) > 0\n    ) {\n      res[key] = filter[key];\n      continue;\n    }\n    if (\n      key === \"kinds\" &&\n      filter[key] !== undefined &&\n      (filter[key]?.length ?? -1) > 0\n    ) {\n      res[key] = filter[key];\n      continue;\n    }\n    if (key === \"search\" && filter[key] !== undefined) {\n      res[key] = filter[key];\n      continue;\n    }\n  }\n\n  const timeRangeIsValid =\n    typeof res.since !== \"number\" ||\n    typeof res.until !== \"number\" ||\n    res.since <= res.until;\n  if (!timeRangeIsValid) {\n    return null;\n  }\n\n  return res;\n}\n\nfunction normalizeFilters(filters: LazyFilter | LazyFilter[]): LazyFilter[] {\n  return (Array.isArray(filters) ? filters : [filters])\n    .map((e) => normalizeFilter(e))\n    .filter((e): e is LazyFilter => e !== null);\n}\n", "export type * from \"./config/index.js\";\nexport { nip07Signer, noopSigner, noopVerifier } from \"./config/index.js\";\nexport * from \"./error.js\";\nexport * from \"./lazy-filter.js\";\nexport { Nip11Registry } from \"./nip11.js\";\nexport { toHex } from \"./nostr/bech32.js\";\nexport { compareEvents, earlierEvent, laterEvent } from \"./nostr/event.js\";\nexport { isFiltered } from \"./nostr/filter.js\";\nexport { fetchRelayInfo } from \"./nostr/nip11.js\";\nexport { isExpired } from \"./nostr/nip40.js\";\nexport * from \"./operator.js\";\nexport * from \"./packet.js\";\nexport * from \"./rx-nostr/index.js\";\nexport type * from \"./websocket.js\";\n\nexport function now(): number {\n  return Math.floor(Date.now() / 1000);\n}\n", "import type { Filter, NostrEvent } from \"nostr-tools\";\nimport { type RxNostr, createRxForwardReq, createRxNostr, uniq } from \"rx-nostr\";\nimport { verifier } from \"rx-nostr-crypto\";\nimport { currentUnixtimeSec, delay } from \"../helpers\";\n\nexport type RelayPool = {\n  // start to subscribe events\n  subscribe(filter: Filter, onEvent: (ev: NostrEvent) => void): () => void;\n  // try to publish a Nostr event and wait for at least one OK response\n  publish(ev: NostrEvent): Promise<void>;\n  // try to reconnect to all relays\n  reconnectAll(): void;\n  // dispose the relay pool\n  dispose(): void;\n};\n\ntype TryPubResult =\n  | {\n      status: \"ok\";\n    }\n  | {\n      status: \"timeout\";\n    }\n  | {\n      status: \"error\";\n      reason: string;\n    };\n\nexport class RxNostrRelayPool implements RelayPool {\n  #rxn: RxNostr;\n  #relayUrls: string[];\n\n  constructor(relayUrls: string[]) {\n    this.#relayUrls = relayUrls;\n\n    const rxn = createRxNostr({ verifier, skipFetchNip11: true, connectionStrategy: \"lazy-keep\" });\n    rxn.setDefaultRelays(relayUrls);\n\n    rxn.createConnectionStateObservable().subscribe(({ from: rurl, state }) => {\n      console.debug(`[Nip46RemoteSigner] ${rurl}: connection state changed to ${state}`);\n    });\n\n    this.#rxn = rxn;\n  }\n\n  subscribe(filter: Filter, onEvent: (ev: NostrEvent) => void): () => void {\n    const req = createRxForwardReq();\n    const sub = this.#rxn\n      .use(req)\n      .pipe(uniq())\n      .subscribe(({ event }) => onEvent(event));\n\n    req.emit({ ...filter, since: currentUnixtimeSec });\n    return () => sub.unsubscribe();\n  }\n\n  async publish(ev: NostrEvent): Promise<void> {\n    const maxRetry = 3;\n    let retry = 0;\n\n    while (true) {\n      if (retry === maxRetry) {\n        throw Error(\"failed to publish: timed out multiple times and max retry count exceeded\");\n      }\n      const res = await this.#tryPub(ev, 3000);\n      switch (res.status) {\n        case \"ok\":\n          return;\n\n        case \"error\":\n          throw Error(`failed to publish event: ${res.reason}`);\n\n        case \"timeout\":\n          await delay((1 << retry) * 1000);\n          retry++;\n      }\n    }\n  }\n\n  // try to publish event, and wait for at least one OK response\n  async #tryPub(ev: NostrEvent, timeoutMs: number): Promise<TryPubResult> {\n    return new Promise<TryPubResult>((resolve) => {\n      try {\n        const timeoutSig = AbortSignal.timeout(timeoutMs);\n        timeoutSig.addEventListener(\"abort\", () => {\n          okSub.unsubscribe();\n          resolve({ status: \"timeout\" });\n        });\n        const okSub = this.#rxn.send(ev).subscribe(({ ok, notice }) => {\n          if (ok) {\n            resolve({ status: \"ok\" });\n          } else {\n            resolve({ status: \"error\", reason: notice ?? \"(empty reason)\" });\n          }\n        });\n      } catch (err) {\n        if (err instanceof Error) {\n          resolve({ status: \"error\", reason: err.message });\n        } else {\n          resolve({ status: \"error\", reason: \"(unknown error)\" });\n        }\n      }\n    });\n  }\n\n  reconnectAll(): void {\n    this.#relayUrls.map((rurl) => {\n      this.#rxn.reconnect(rurl);\n    });\n  }\n\n  dispose(): void {\n    this.#rxn.dispose();\n  }\n}\n", "import type { NostrEvent, EventTemplate as NostrEventTemplate } from \"nostr-tools\";\nimport { Deferred, currentUnixtimeSec, generateRandomString, mergeOptionsWithDefaults } from \"../helpers\";\nimport type { NostrSigner, RelayList } from \"../interface\";\nimport type { SecretKeySigner } from \"../secret_key\";\nimport type { RelayPool } from \"./relay_pool\";\n\nexport type Nip46RpcReq = {\n  id: string;\n  method: string;\n  params: string[];\n};\n\nexport type Nip46RpcResp = {\n  id: string;\n  result?: string | undefined | null;\n  error?: string | undefined | null;\n};\n\ntype ParsedNip46RpcResp = { id: string } & (\n  | {\n      status: \"ok\";\n      result: string;\n    }\n  | {\n      status: \"error\";\n      error: string;\n    }\n  | {\n      status: \"auth\";\n      authUrl: string;\n    }\n  | {\n      status: \"empty\";\n    }\n);\n\nconst parseNip46RpcResp = async (ev: NostrEvent, signer: NostrSigner): Promise<ParsedNip46RpcResp> => {\n  const plainContent = await signer.nip44Decrypt(ev.pubkey, ev.content);\n  const { id, result, error } = JSON.parse(plainContent) as Nip46RpcResp;\n\n  // there are cases that both `error` and `result` have values, so check error first\n  if (error != null) {\n    // if `result` is \"auth_url\", response should be regarded as an auth challenge.\n    // in this case, `error` points to a URL for user authentication.\n    if (result === \"auth_url\") {\n      return { id, status: \"auth\", authUrl: error };\n    }\n    return { id, status: \"error\", error };\n  }\n  if (result != null) {\n    return { id, status: \"ok\", result };\n  }\n  return { id, status: \"empty\" };\n};\n\ntype Nip46RpcSignatures = {\n  connect: {\n    params: [remotePubkey: string, secret?: string, permissions?: string];\n    result: string;\n  };\n  sign_event: {\n    params: [event: NostrEventTemplate];\n    result: NostrEvent;\n  };\n  ping: {\n    params: [];\n    result: string;\n  };\n  get_relays: {\n    params: [];\n    result: RelayList;\n  };\n  get_public_key: {\n    params: [];\n    result: string;\n  };\n  nip04_encrypt: {\n    params: [remotePubkey: string, plainText: string];\n    result: string;\n  };\n  nip04_decrypt: {\n    params: [remotePubkey: string, cipherText: string];\n    result: string;\n  };\n  nip44_encrypt: {\n    params: [remotePubkey: string, plainText: string];\n    result: string;\n  };\n  nip44_decrypt: {\n    params: [remotePubkey: string, cipherText: string];\n    result: string;\n  };\n};\n\ntype Nip46RpcMethods = keyof Nip46RpcSignatures;\ntype Nip46RpcParams<M extends Nip46RpcMethods> = Nip46RpcSignatures[M][\"params\"];\ntype Nip46RpcResult<M extends Nip46RpcMethods> = Nip46RpcSignatures[M][\"result\"];\n\ntype Nip46RpcParamsEncoders = {\n  [M in keyof Nip46RpcSignatures]: (params: Nip46RpcParams<M>) => string[];\n};\ntype Nip46RpcResultDecoders = {\n  [M in keyof Nip46RpcSignatures]: (rawResult: string) => Nip46RpcResult<M>;\n};\n\nconst identity = <T>(v: T) => v;\nconst nip46RpcParamsEncoders: Nip46RpcParamsEncoders = {\n  connect: (params) => params as string[],\n  sign_event: ([ev]) => [JSON.stringify(ev)],\n  ping: identity,\n  get_relays: identity,\n  get_public_key: identity,\n  nip04_encrypt: identity,\n  nip04_decrypt: identity,\n  nip44_encrypt: identity,\n  nip44_decrypt: identity,\n};\nconst nip46RpcResultDecoders: Nip46RpcResultDecoders = {\n  connect: identity,\n  sign_event: (raw: string) => JSON.parse(raw) as NostrEvent,\n  ping: identity,\n  get_relays: (raw: string) => JSON.parse(raw) as RelayList,\n  get_public_key: identity,\n  nip04_encrypt: identity,\n  nip04_decrypt: identity,\n  nip44_encrypt: identity,\n  nip44_decrypt: identity,\n};\n\nexport type Nip46RpcClientOptions = {\n  /**\n   * The maximum amount of time to wait for a response to a signer operation request, in milliseconds.\n   *\n   * @default 15000\n   */\n  requestTimeoutMs?: number;\n\n  /**\n   * The handler for auth challenge from a remote signer.\n   *\n   * Default is just ignoring any auth challenges.\n   */\n  onAuthChallenge?: (authUrl: string) => void;\n};\n\nexport const defaultRpcCliOptions: Required<Nip46RpcClientOptions> = {\n  requestTimeoutMs: 15 * 1000,\n  onAuthChallenge: (_) => {\n    console.debug(\"NIP-46 RPC: ignoring auth challenge...\");\n  },\n};\n\nexport class Nip46RpcClient {\n  #localSigner: NostrSigner;\n  #remotePubkey: string;\n  #options: Required<Nip46RpcClientOptions>;\n\n  #relayPool: RelayPool;\n  #closeSub: (() => void) | undefined = undefined;\n\n  #inflightRpcs: Map<string, Deferred<string>> = new Map();\n\n  constructor(\n    localSigner: NostrSigner,\n    remotePubkey: string,\n    relayPool: RelayPool,\n    options: Required<Nip46RpcClientOptions>,\n  ) {\n    this.#localSigner = localSigner;\n    this.#remotePubkey = remotePubkey;\n    this.#options = options;\n    this.#relayPool = relayPool;\n  }\n\n  /**\n   * Start waiting for a `connect` response from a remote signer.\n   */\n  public static startWaitingForConnectRespFromRemote(\n    localSigner: SecretKeySigner,\n    relayPool: RelayPool,\n    secret: string,\n    timeoutMs: number,\n  ): { connected: Promise<string> } {\n    const respWait = new Deferred<string>();\n\n    const onEvent = async (ev: NostrEvent) => {\n      const resp = await parseNip46RpcResp(ev, localSigner);\n      switch (resp.status) {\n        case \"ok\": {\n          const signerPubkey = ev.pubkey;\n          if (resp.result === \"ack\") {\n            // TODO: approve \"ack\" for now, but should be rejected in the future\n            console.warn(\"NIP-46 RPC: remote signer respondeds with just 'ack'\");\n            respWait.resolve(signerPubkey);\n            return;\n          }\n          if (resp.result !== secret) {\n            respWait.reject(new Error(\"NIP-46 RPC: secret mismatch\"));\n            return;\n          }\n          // secret returned from the remote siner matches with the one in connection token!\n          respWait.resolve(signerPubkey);\n          return;\n        }\n        case \"auth\":\n          console.debug(\"NIP-46 RPC: ignoring auth challenge during waiting for connection from remote...\");\n          return;\n        case \"error\":\n          respWait.reject(new Error(`NIP-46 RPC resulted in error: ${resp.error}`));\n          return;\n        case \"empty\":\n          respWait.reject(new Error(\"NIP-46 RPC: empty response\"));\n          return;\n      }\n    };\n\n    const timeoutSignal = AbortSignal.timeout(timeoutMs);\n    const onTimeout = async () => {\n      respWait.reject(new Error(\"NIP-46: nostrconnect connection initiation flow timed out!\"));\n    };\n    timeoutSignal.addEventListener(\"abort\", onTimeout, { once: true });\n\n    const unsub = relayPool.subscribe({ kinds: [24133], \"#p\": [localSigner.publicKey] }, onEvent);\n\n    // cleanups to be performed on the settlement of `respWait`.\n    const cleanup = () => {\n      unsub();\n      timeoutSignal.removeEventListener(\"abort\", onTimeout);\n    };\n    return { connected: respWait.promise.finally(cleanup) };\n  }\n\n  /**\n   * Creates a NIP-46 remote signer handle with RPC response subscription started.\n   *\n   * It's guaranteed that the signer handle and its internal relay pool are disposed in case of an initialization error.\n   */\n  public static async init(\n    localSigner: NostrSigner,\n    remotePubkey: string,\n    relayPool: RelayPool,\n    options: Nip46RpcClientOptions,\n  ): Promise<Nip46RpcClient> {\n    const finalOpts = mergeOptionsWithDefaults(defaultRpcCliOptions, options);\n\n    let rpcCli: Nip46RpcClient | undefined;\n    try {\n      rpcCli = new Nip46RpcClient(localSigner, remotePubkey, relayPool, finalOpts);\n      await rpcCli.#startRespSubscription();\n      return rpcCli;\n    } catch (e) {\n      rpcCli?.dispose();\n      throw e;\n    }\n  }\n\n  async #startRespSubscription() {\n    const onevent = async (ev: NostrEvent) => {\n      let rpcId: string | undefined;\n      try {\n        const resp = await parseNip46RpcResp(ev, this.#localSigner);\n        rpcId = resp.id;\n\n        const respWait = this.#inflightRpcs.get(resp.id);\n        if (respWait === undefined) {\n          console.debug(\"no waiter found for NIP-46 RPC response\");\n          return;\n        }\n\n        switch (resp.status) {\n          case \"ok\":\n            respWait.resolve(resp.result);\n            return;\n          case \"auth\":\n            this.#options.onAuthChallenge(resp.authUrl);\n            return;\n          case \"error\":\n            respWait.reject(new Error(`NIP-46 RPC resulted in error: ${resp.error}`));\n            return;\n          case \"empty\":\n            respWait.reject(new Error(\"NIP-46 RPC: empty response\"));\n            return;\n        }\n      } catch (err) {\n        console.error(\"error on receiving NIP-46 RPC response\", err);\n      }\n\n      if (rpcId !== undefined) {\n        this.#inflightRpcs.delete(rpcId);\n      }\n    };\n\n    const localPubkey = await this.#localSigner.getPublicKey();\n    this.#closeSub = this.#relayPool.subscribe({ kinds: [24133], \"#p\": [localPubkey] }, onevent);\n  }\n\n  #startWaitingRpcResp(rpcId: string): {\n    waitResp: Promise<string>;\n    startCancelTimer: (timeoutMs: number) => void;\n  } {\n    const d = new Deferred<string>();\n    this.#inflightRpcs.set(rpcId, d);\n\n    const startCancelTimer = (timeoutMs: number) => {\n      const signal = AbortSignal.timeout(timeoutMs);\n      signal.addEventListener(\n        \"abort\",\n        () => {\n          d.reject(new Error(\"NIP-46 RPC timed out!\"));\n          this.#inflightRpcs.delete(rpcId);\n        },\n        { once: true },\n      );\n    };\n\n    return { waitResp: d.promise, startCancelTimer };\n  }\n\n  public async request<M extends Nip46RpcMethods>(\n    method: M,\n    params: Nip46RpcParams<M>,\n    timeoutMs = this.#options.requestTimeoutMs,\n  ): Promise<Nip46RpcResult<M>> {\n    const rpcId = generateRandomString();\n    const { waitResp, startCancelTimer } = this.#startWaitingRpcResp(rpcId);\n\n    const rpcReq: Nip46RpcReq = {\n      id: rpcId,\n      method,\n      params: nip46RpcParamsEncoders[method](params),\n    };\n    const cipheredReq = await this.#localSigner.nip44Encrypt(this.#remotePubkey, JSON.stringify(rpcReq));\n    const reqEv: NostrEventTemplate = {\n      kind: 24133,\n      tags: [[\"p\", this.#remotePubkey]],\n      content: cipheredReq,\n      created_at: currentUnixtimeSec(),\n    };\n    const signedReqEv = await this.#localSigner.signEvent(reqEv);\n\n    await this.#relayPool.publish(signedReqEv);\n\n    // once the request is sent, start a timer to cancel the request if it takes too long\n    startCancelTimer(timeoutMs);\n\n    // rethrow if RPC result in error.\n    const rawResp = await waitResp;\n    return nip46RpcResultDecoders[method](rawResp);\n  }\n\n  /**\n   * Tries to reconnect to all the relays that are used to communicate with the remote signer.\n   */\n  public reconnectToRelays() {\n    this.#relayPool.reconnectAll();\n  }\n\n  /**\n   * Disposes this remote signer handle.\n   */\n  public dispose() {\n    if (this.#closeSub !== undefined) {\n      this.#closeSub?.();\n      this.#closeSub = undefined;\n    }\n    this.#relayPool.dispose();\n    this.#inflightRpcs.clear();\n  }\n}\n", "import type { Event as NostrEvent, EventTemplate as NostrEventTemplate } from \"nostr-tools\";\nimport { getPublicKey as getPubkeyFromHex } from \"rx-nostr-crypto\";\nimport { generateRandomString, mergeOptionsWithDefaults, parsePubkey } from \"../helpers\";\nimport type { NostrSigner, RelayList } from \"../interface\";\nimport { SecretKeySigner } from \"../secret_key\";\nimport { type RelayPool, RxNostrRelayPool } from \"./relay_pool\";\nimport { Nip46RpcClient, type Nip46RpcClientOptions, defaultRpcCliOptions } from \"./rpc\";\n\nexport type Nip46ConnectionParams = {\n  remotePubkey: string;\n  relayUrls: string[];\n  secretToken?: string | undefined;\n};\n\nconst BUNKER_TOKEN_PREFIX = \"bunker://\";\nconst BUNKER_TOKEN_PREFIX_LEN = BUNKER_TOKEN_PREFIX.length;\n\n// parse `bunker://` connection token (format: bunker://<hex-pubkey>?relay=wss://...&relay=wss://...&secret=<optional-secret>)\nexport const parseBunkerToken = (token: string): Nip46ConnectionParams => {\n  if (!token.startsWith(BUNKER_TOKEN_PREFIX)) {\n    throw Error(\"invalid bunker connection token: must starts with 'bunker://'\");\n  }\n  const prefixTrimmed = token.substring(BUNKER_TOKEN_PREFIX_LEN);\n  const qIdx = prefixTrimmed.indexOf(\"?\");\n  if (qIdx < 0) {\n    throw Error(\"invalid bunker connection token: must have '?'\");\n  }\n\n  const [rawPubkey, rawParams] = [prefixTrimmed.substring(0, qIdx), prefixTrimmed.substring(qIdx + 1)];\n  const remotePubkey = parsePubkey(rawPubkey);\n  if (remotePubkey === undefined) {\n    throw Error(\"invalid bunker connection token: malformed pubkey\");\n  }\n\n  const searchParams = new URLSearchParams(rawParams);\n  const secretToken = searchParams.get(\"secret\") ?? undefined;\n  const relayUrls = searchParams.getAll(\"relay\");\n  if (relayUrls.length === 0) {\n    throw Error(\"invalid bunker connection token: must have at least 1 relay URL\");\n  }\n\n  return {\n    remotePubkey,\n    relayUrls,\n    secretToken,\n  };\n};\n\nexport type Nip46SessionState = Nip46ConnectionParams & {\n  sessionKey: string;\n};\n\ntype StartSessionResult = {\n  /**\n   * A handle for the connected NIP-46 remote signer.\n   */\n  signer: Nip46RemoteSigner;\n\n  /**\n   * State data needed to resume a session to the NIP-46 remote signer later.\n   */\n  session: Nip46SessionState;\n};\n\nexport type Nip46ClientMetadata = {\n  name: string;\n  url?: string;\n  description?: string;\n  icons?: string[];\n};\n\nexport type Nip46RemoteSignerOptions = Nip46RpcClientOptions;\n\nexport type Nip46RemoteSignerConnectOptions = Nip46RemoteSignerOptions & {\n  /**\n   * The maximum amount of time allowed to attempt to connect to a remote signer, in milliseconds.\n   *\n   * @default 30000\n   */\n  connectTimeoutMs?: number;\n\n  /**\n   * The permissions to request on the connection.\n   */\n  permissions?: string[];\n};\n\nconst defaultConnectOptions: Required<Nip46RemoteSignerConnectOptions> = {\n  ...defaultRpcCliOptions,\n  connectTimeoutMs: 30 * 1000,\n  permissions: [],\n};\n\n/**\n * An implementation of NostrSigner based on a [NIP-46](https://github.com/nostr-protocol/nips/blob/master/46.md) remote signer (a.k.a. Nostr Connect or nsecBunker).\n * It acts as a client-side handle for a NIP-46 remote signer.\n *\n * You can initialize a Nip46RemoteSigner instance by calling one of the following initialization methods, each corresponds to a signer discovery flow defined in NIP-46:\n *\n * - `Nip46RemoteSigner.connectToRemote(connToken)`: \"Started by the signer (nsecBunker)\" discovery flow\n * - `Nip46RemoteSigner.listenConnectionFromRemote(relayUrls, clientMetadata)`: \"Started by the client\" discovery flow\n *\n * During an initialization process, a session to a remote signer is established. Session state data is returned as a result of the initialization, along with a Nip46RemoteSigner instance.\n * Your app should store the session state data, and use it to resume the session later via `Nip46RemoteSigner.resumeSession(sessionState)`.\n */\nexport class Nip46RemoteSigner implements NostrSigner, Disposable {\n  #rpcCli: Nip46RpcClient;\n  #remotePubkey: string;\n\n  private constructor(rpcCli: Nip46RpcClient, remotePubkey: string) {\n    this.#rpcCli = rpcCli;\n    this.#remotePubkey = remotePubkey;\n  }\n\n  /**\n   * Creates a NIP-46 remote signer handle with RPC response subscription started.\n   *\n   * It's guaranteed that the signer handle and its internal relay pool are disposed in case of an initialization error.\n   */\n  static async #init(\n    localSigner: NostrSigner,\n    remotePubkey: string,\n    relayUrls: string[],\n    options: Required<Nip46RemoteSignerOptions>,\n  ): Promise<Nip46RemoteSigner> {\n    let relayPool: RelayPool | undefined;\n    try {\n      relayPool = new RxNostrRelayPool(relayUrls);\n    } catch (e) {\n      relayPool?.dispose();\n      throw e;\n    }\n\n    const rpcCli = await Nip46RpcClient.init(localSigner, remotePubkey, relayPool, options);\n    return new Nip46RemoteSigner(rpcCli, remotePubkey);\n  }\n\n  /**\n   * Initializes a NIP-46 remote signer handle, then performs a connection handshake.\n   *\n   * It's guaranteed that the signer handle and its internal relay pool are disposed in case of a connection handshake error.\n   */\n  static async #connect(\n    localSigner: NostrSigner,\n    { remotePubkey, secretToken, relayUrls }: Nip46ConnectionParams,\n    options: Required<Nip46RemoteSignerConnectOptions>,\n  ): Promise<Nip46RemoteSigner> {\n    const signer = await Nip46RemoteSigner.#init(localSigner, remotePubkey, relayUrls, options);\n\n    // perform connection handshake\n    try {\n      const connParams: [string] = [remotePubkey];\n      if (secretToken !== undefined) {\n        connParams.push(secretToken);\n      }\n      if (options.permissions.length > 0) {\n        connParams.push(options.permissions.join(\",\"));\n      }\n\n      const connResp = await signer.#rpcCli.request(\"connect\", connParams, options.connectTimeoutMs);\n      if (connResp !== \"ack\") {\n        console.warn(\"NIP-46 remote signer responded for `connect` with other than 'ack'\");\n      }\n      return signer;\n    } catch (err) {\n      // HACK: nsecBunker returns error if you connect twice to it with the same token. However, in spite of the error, other methods still work with the token.\n      // It seems that Coracle just ignores this error on connect, and we follow the behavior here.\n      if (err instanceof Error && err.message.includes(\"Token already redeemed\")) {\n        console.debug(\"ignoring 'Token already redeemed' error on connect from remote signer\");\n        return signer;\n      }\n\n      signer.dispose();\n      throw err;\n    }\n  }\n\n  /**\n   * Connects to a NIP-46 remote signer with a given connection token, and establishes a session to the remote signer.\n   * This is the \"Started by the signer (nsecBunker)\" signer discovery flow defined in NIP-46.\n   *\n   * Internally, it generates SecretKeySigner with a random secret key and use it to communicate with a remote signer.\n   * This secret key acts as a \"session key\", and it is returned along with other session data (as `session` property).\n   * You should store the session state data (`session`) in somewhere to resume the session later via `Nip46RemoteSigner.resumeSession`.\n   *\n   * @returns a Promise that resolves to an object that contains a handle for the connected remote signer and a session state\n   */\n  public static async connectToRemote(\n    connToken: string,\n    options: Nip46RemoteSignerConnectOptions = {},\n  ): Promise<StartSessionResult> {\n    const finalOpts = mergeOptionsWithDefaults(defaultConnectOptions, options);\n\n    const connParams = parseBunkerToken(connToken);\n    const localSigner = SecretKeySigner.withRandomKey();\n    const sessionKey = localSigner.secretKey;\n\n    return {\n      signer: await Nip46RemoteSigner.#connect(localSigner, connParams, finalOpts),\n      session: {\n        sessionKey,\n        ...connParams,\n      },\n    };\n  }\n\n  /**\n   * Starts to listen a connection request from a NIP-46 remote signer, and once a connection request is received, establishes a session to the remote signer.\n   * This is the \"Started by the client\" signer discovery flow defined in NIP-46.\n   *\n   * Internally, it generates SecretKeySigner with a random secret key and use it to communicate with a remote signer.\n   * This secret key acts as a \"session key\", and it is returned along with other session data (as `session` property).\n   * You should store the session state data (`session`) in somewhere to resume the session later via `Nip46RemoteSigner.resumeSession`.\n   *\n   * @returns an object with following properties:\n   *  - `connectUri`: a URI that can be shared with the remote signer to connect to this client\n   *  - `established`: a Promise that resolves to an object that contains a handle for the connected remote signer and a session state\n   */\n  public static listenConnectionFromRemote(\n    relayUrls: string[],\n    clientMetadata: Nip46ClientMetadata,\n    options: Nip46RemoteSignerConnectOptions = {},\n  ): {\n    connectUri: string;\n    established: Promise<StartSessionResult>;\n  } {\n    const finalOpts = mergeOptionsWithDefaults(defaultConnectOptions, options);\n\n    const localSigner = SecretKeySigner.withRandomKey();\n    const sessionKey = localSigner.secretKey;\n    const localPubkey = getPubkeyFromHex(sessionKey);\n\n    // construct nostrconnect URI\n    const connSecret = generateRandomString();\n    const connUri = new URL(`nostrconnect://${localPubkey}`);\n    for (const rurl of relayUrls) {\n      connUri.searchParams.append(\"relay\", rurl);\n    }\n    const metaWithPerms = {\n      ...clientMetadata,\n      perms: finalOpts.permissions.length > 0 ? finalOpts.permissions.join(\",\") : undefined,\n    };\n    connUri.searchParams.set(\"metadata\", JSON.stringify(metaWithPerms));\n    connUri.searchParams.set(\"secret\", connSecret);\n\n    // start listening for `connect` response from the remote signer\n    const relayPool = new RxNostrRelayPool(relayUrls);\n\n    const { connected } = Nip46RpcClient.startWaitingForConnectRespFromRemote(\n      localSigner,\n      relayPool,\n      connSecret,\n      finalOpts.connectTimeoutMs,\n    );\n\n    // once `connect` response is received, initialize a handle for the remote signer\n    const established = connected.then(async (remotePubkey): Promise<StartSessionResult> => {\n      const rpcCli = await Nip46RpcClient.init(localSigner, remotePubkey, relayPool, finalOpts);\n      const signer = new Nip46RemoteSigner(rpcCli, remotePubkey);\n      return {\n        signer,\n        session: {\n          sessionKey,\n          remotePubkey,\n          relayUrls,\n        },\n      };\n    });\n\n    return {\n      connectUri: connUri.toString(),\n      established,\n    };\n  }\n\n  /**\n   * Resumes a session to a NIP-46 remote signer, which is established by `Nip46RemoteSigner.connectToRemote` or `Nip46RemoteSigner.listenConnectionFromRemote`.\n   */\n  public static async resumeSession(\n    { sessionKey, ...connParams }: Nip46SessionState,\n    options: Nip46RemoteSignerOptions = {},\n  ): Promise<Nip46RemoteSigner> {\n    const finalOpts = mergeOptionsWithDefaults(defaultRpcCliOptions, options);\n\n    const localSigner = new SecretKeySigner(sessionKey);\n    return Nip46RemoteSigner.#init(localSigner, connParams.remotePubkey, connParams.relayUrls, finalOpts);\n  }\n\n  /**\n   * Returns the public key that corresponds to the underlying secret key, in hex string format.\n   */\n  public async getPublicKey(): Promise<string> {\n    return this.#rpcCli.request(\"get_public_key\", []);\n  }\n\n  /**\n   * Returns the list of relays preferred by the user.\n   *\n   * Each entry is a mapping from the relay URL to the preferred use (read/write) of the relay.\n   */\n  public async getRelays(): Promise<RelayList> {\n    return this.#rpcCli.request(\"get_relays\", []);\n  }\n\n  /**\n   * Signs a given Nostr event with the underlying secret key.\n   *\n   * @param event a Nostr event template (unsigned event)\n   * @returns a Promise that resolves to a signed Nostr event\n   */\n  public async signEvent(event: NostrEventTemplate): Promise<NostrEvent> {\n    // HACK: set pubkey to event here, since sometimes nsecbunkerd fails to sign event if the input doesn't have pubkey field.\n    const ev = event as NostrEventTemplate & { pubkey?: string };\n    if (!ev.pubkey) {\n      ev.pubkey = this.#remotePubkey;\n    }\n    return this.#rpcCli.request(\"sign_event\", [ev]);\n  }\n\n  /**\n   * Encrypts a given text to secretly communicate with others, by the encryption algorithm defined in [NIP-04](https://github.com/nostr-protocol/nips/blob/master/04.md).\n   *\n   * @param recipientPubkey a public key of a message recipient, in hex string format\n   * @param plaintext a plaintext to encrypt\n   * @returns a Promise that resolves to a encrypted text\n   */\n  public async nip04Encrypt(recipientPubkey: string, plaintext: string): Promise<string> {\n    return this.#rpcCli.request(\"nip04_encrypt\", [recipientPubkey, plaintext]);\n  }\n\n  /**\n   * Decrypts a given ciphertext from others, by the decryption algorithm defined in [NIP-04](https://github.com/nostr-protocol/nips/blob/master/04.md).\n   *\n   * @param senderPubkey a public key of a message sender, in hex string format\n   * @param ciphertext a ciphertext to decrypt\n   * @returns a Promise that resolves to a decrypted text\n   */\n  public async nip04Decrypt(senderPubkey: string, ciphertext: string): Promise<string> {\n    return this.#rpcCli.request(\"nip04_decrypt\", [senderPubkey, ciphertext]);\n  }\n\n  /**\n   * Encrypts a given text to secretly communicate with others, by the encryption algorithm defined in [NIP-44](https://github.com/nostr-protocol/nips/blob/master/44.md).\n   *\n   * @param recipientPubkey a public key of a message recipient, in hex string format\n   * @param plaintext a plaintext to encrypt\n   * @returns a Promise that resolves to a encrypted text\n   */\n  public async nip44Encrypt(recipientPubkey: string, plaintext: string): Promise<string> {\n    return this.#rpcCli.request(\"nip44_encrypt\", [recipientPubkey, plaintext]);\n  }\n\n  /**\n   * Decrypts a given ciphertext from others, by the decryption algorithm defined in [NIP-44](https://github.com/nostr-protocol/nips/blob/master/44.md).\n   *\n   * @param senderPubkey a public key of a message sender, in hex string format\n   * @param ciphertext a ciphertext to decrypt\n   * @returns a Promise that resolves to a decrypted text\n   */\n  public async nip44Decrypt(senderPubkey: string, ciphertext: string): Promise<string> {\n    return this.#rpcCli.request(\"nip44_decrypt\", [senderPubkey, ciphertext]);\n  }\n\n  /**\n   * Sends a ping to the remote signer.\n   */\n  public async ping(): Promise<void> {\n    const resp = await this.#rpcCli.request(\"ping\", []);\n    // response should be \"pong\"\n    if (resp !== \"pong\") {\n      throw Error(\"unexpected response for ping from the remote signer\");\n    }\n  }\n\n  /**\n   * Tries to reconnect to all the relays that are used to communicate with the remote signer.\n   */\n  public reconnectToRpcRelays() {\n    this.#rpcCli.reconnectToRelays();\n  }\n\n  /**\n   * Disposes this remote signer handle.\n   */\n  public dispose() {\n    this.#rpcCli.dispose();\n  }\n\n  /**\n   * Disposes this remote signer handle.\n   */\n  public [Symbol.dispose]() {\n    this.dispose();\n  }\n}\n"],
  "mappings": "ubAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,0BAAAE,GAAA,sBAAAC,GAAA,oBAAAC,KAAA,eAAAC,GAAAL,ICSM,SAAUM,GAAQC,EAAU,CAChC,OACEA,aAAa,YACZA,GAAK,MAAQ,OAAOA,GAAM,UAAYA,EAAE,YAAY,OAAS,YAElE,CAEA,SAASC,GAAMC,KAA8BC,EAAiB,CAC5D,GAAI,CAACJ,GAAQG,CAAC,EAAG,MAAM,IAAI,MAAM,qBAAqB,EACtD,GAAIC,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAASD,EAAE,MAAM,EAClD,MAAM,IAAI,MAAM,iCAAiCC,CAAO,mBAAmBD,EAAE,MAAM,EAAE,CACzF,CCkBO,IAAME,GAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAkBhF,IAAMC,GAAwB,MAAM,KAAK,CAAE,OAAQ,GAAG,EAAI,CAACC,EAAGC,IAC5DA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAK3B,SAAUC,GAAWC,EAAiB,CAC1CA,GAAOA,CAAK,EAEZ,IAAIC,EAAM,GACV,QAASH,EAAI,EAAGA,EAAIE,EAAM,OAAQF,IAChCG,GAAOL,GAAMI,EAAMF,CAAC,CAAC,EAEvB,OAAOG,CACT,CAGA,IAAMC,GAAS,CAAE,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAG,EAChE,SAASC,GAAcC,EAAY,CACjC,GAAIA,GAAQF,GAAO,IAAME,GAAQF,GAAO,GAAI,OAAOE,EAAOF,GAAO,GACjE,GAAIE,GAAQF,GAAO,IAAME,GAAQF,GAAO,GAAI,OAAOE,GAAQF,GAAO,GAAK,IACvE,GAAIE,GAAQF,GAAO,IAAME,GAAQF,GAAO,GAAI,OAAOE,GAAQF,GAAO,GAAK,GAEzE,CAKM,SAAUG,GAAWJ,EAAW,CACpC,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EACrF,IAAMK,EAAKL,EAAI,OACTM,EAAKD,EAAK,EAChB,GAAIA,EAAK,EAAG,MAAM,IAAI,MAAM,0DAA4DA,CAAE,EAC1F,IAAME,EAAQ,IAAI,WAAWD,CAAE,EAC/B,QAASE,EAAK,EAAGC,EAAK,EAAGD,EAAKF,EAAIE,IAAMC,GAAM,EAAG,CAC/C,IAAMC,EAAKR,GAAcF,EAAI,WAAWS,CAAE,CAAC,EACrCE,EAAKT,GAAcF,EAAI,WAAWS,EAAK,CAAC,CAAC,EAC/C,GAAIC,IAAO,QAAaC,IAAO,OAAW,CACxC,IAAMR,EAAOH,EAAIS,CAAE,EAAIT,EAAIS,EAAK,CAAC,EACjC,MAAM,IAAI,MAAM,+CAAiDN,EAAO,cAAgBM,CAAE,CAC5F,CACAF,EAAMC,CAAE,EAAIE,EAAK,GAAKC,CACxB,CACA,OAAOJ,CACT,CAsGA,IAAMK,GAAQ,CAAA,EAAG,SCvMV,IAAMC,GACX,OAAO,YAAe,UAAY,WAAY,WAAa,WAAW,OAAS,OCUjF,IAAMC,GAAOC,GAA4BA,aAAa,WAG/C,IAAMC,GAAOC,GAClB,IAAI,YAAYA,EAAI,OAAQA,EAAI,WAAY,KAAK,MAAMA,EAAI,WAAa,CAAC,CAAC,EAG/DC,GAAcD,GACzB,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAG5CE,GAAO,CAACC,EAAcC,IAAmBD,GAAS,GAAKC,EAAWD,IAASC,EAI3EC,GAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAChF,GAAI,CAACA,GAAM,MAAM,IAAI,MAAM,6CAA6C,EAExE,IAAMC,GAAQ,MAAM,KAAK,CAAE,OAAQ,GAAG,EAAI,CAACC,EAAGC,IAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAI7E,SAAUC,GAAWC,EAAiB,CAC1C,GAAI,CAACC,GAAID,CAAK,EAAG,MAAM,IAAI,MAAM,qBAAqB,EAEtD,IAAIE,EAAM,GACV,QAASJ,EAAI,EAAGA,EAAIE,EAAM,OAAQF,IAChCI,GAAON,GAAMI,EAAMF,CAAC,CAAC,EAEvB,OAAOI,CACT,CA6CM,SAAUC,GAAYC,EAAW,CACrC,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EAC7F,OAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAOA,CAAG,CAAC,CACrD,CAQM,SAAUC,GAAQC,EAAW,CAEjC,GADI,OAAOA,GAAS,WAAUA,EAAOH,GAAYG,CAAI,GACjD,CAACC,GAAID,CAAI,EAAG,MAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE,EACzE,OAAOA,CACT,CAKM,SAAUE,MAAeC,EAAoB,CACjD,IAAMC,EAAI,IAAI,WAAWD,EAAO,OAAO,CAACE,EAAKC,IAAMD,EAAMC,EAAE,OAAQ,CAAC,CAAC,EACjEC,EAAM,EACV,OAAAJ,EAAO,QAASG,GAAK,CACnB,GAAI,CAACL,GAAIK,CAAC,EAAG,MAAM,IAAI,MAAM,qBAAqB,EAClDF,EAAE,IAAIE,EAAGC,CAAG,EACZA,GAAOD,EAAE,MACX,CAAC,EACMF,CACT,CAGM,IAAgBI,GAAhB,KAAoB,CAsBxB,OAAK,CACH,OAAO,KAAK,WAAU,CACxB,GAeIC,GAAiBC,GACrB,OAAO,UAAU,SAAS,KAAKA,CAAG,IAAM,mBAAqBA,EAAI,cAAgB,OAG7E,SAAUC,GACdC,EACAC,EAAS,CAET,GAAIA,IAAS,SAAc,OAAOA,GAAS,UAAY,CAACJ,GAAcI,CAAI,GACxE,MAAM,IAAI,MAAM,uCAAuC,EAEzD,OADe,OAAO,OAAOD,EAAUC,CAAI,CAE7C,CAIM,SAAUC,GAAmCC,EAAuB,CACxE,IAAMC,EAASC,GAA2BF,EAAQ,EAAG,OAAOhB,GAAQkB,CAAG,CAAC,EAAE,OAAM,EAC1EC,EAAMH,EAAQ,EACpB,OAAAC,EAAM,UAAYE,EAAI,UACtBF,EAAM,SAAWE,EAAI,SACrBF,EAAM,OAAS,IAAMD,EAAQ,EACtBC,CACT,CA2BM,SAAUG,GAAYC,EAAc,GAAE,CAC1C,GAAIC,IAAU,OAAOA,GAAO,iBAAoB,WAC9C,OAAOA,GAAO,gBAAgB,IAAI,WAAWD,CAAW,CAAC,EAE3D,MAAM,IAAI,MAAM,wCAAwC,CAC1D,CCtNO,SAASE,GAAaC,EAAG,CAC5B,GAAI,CAAC,OAAO,cAAcA,CAAC,EACvB,MAAM,IAAI,MAAM,kBAAkBA,CAAC,EAAE,CAC7C,CACA,SAASC,MAASC,EAAM,CACpB,IAAMC,EAAO,CAACC,EAAGC,IAAOC,GAAMF,EAAEC,EAAEC,CAAC,CAAC,EAC9BC,EAAS,MAAM,KAAKL,CAAI,EACzB,QAAQ,EACR,OAAO,CAACM,EAAKC,IAAOD,EAAML,EAAKK,EAAKC,EAAE,MAAM,EAAIA,EAAE,OAAS,MAAS,EACnEC,EAASR,EAAK,OAAO,CAACM,EAAKC,IAAOD,EAAML,EAAKK,EAAKC,EAAE,MAAM,EAAIA,EAAE,OAAS,MAAS,EACxF,MAAO,CAAE,OAAAF,EAAQ,OAAAG,CAAO,CAC5B,CACA,SAASC,GAASA,EAAU,CACxB,MAAO,CACH,OAASC,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,qDAAqD,EACzE,OAAOA,EAAO,IAAKH,GAAM,CAErB,GADAV,GAAaU,CAAC,EACVA,EAAI,GAAKA,GAAKE,EAAS,OACvB,MAAM,IAAI,MAAM,iCAAiCF,CAAC,eAAeE,EAAS,MAAM,GAAG,EACvF,OAAOA,EAASF,CAAC,CACrB,CAAC,CACL,EACA,OAASI,GAAU,CACf,GAAI,CAAC,MAAM,QAAQA,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,kDAAkD,EACtE,OAAOA,EAAM,IAAKC,GAAW,CACzB,GAAI,OAAOA,GAAW,SAClB,MAAM,IAAI,MAAM,uCAAuCA,CAAM,EAAE,EACnE,IAAMC,EAAQJ,EAAS,QAAQG,CAAM,EACrC,GAAIC,IAAU,GACV,MAAM,IAAI,MAAM,oBAAoBD,CAAM,eAAeH,CAAQ,EAAE,EACvE,OAAOI,CACX,CAAC,CACL,CACJ,CACJ,CACA,SAASC,GAAKC,EAAY,GAAI,CAC1B,GAAI,OAAOA,GAAc,SACrB,MAAM,IAAI,MAAM,iCAAiC,EACrD,MAAO,CACH,OAASC,GAAS,CACd,GAAI,CAAC,MAAM,QAAQA,CAAI,GAAMA,EAAK,QAAU,OAAOA,EAAK,CAAC,GAAM,SAC3D,MAAM,IAAI,MAAM,8CAA8C,EAClE,QAAST,KAAKS,EACV,GAAI,OAAOT,GAAM,SACb,MAAM,IAAI,MAAM,iCAAiCA,CAAC,EAAE,EAC5D,OAAOS,EAAK,KAAKD,CAAS,CAC9B,EACA,OAASE,GAAO,CACZ,GAAI,OAAOA,GAAO,SACd,MAAM,IAAI,MAAM,oCAAoC,EACxD,OAAOA,EAAG,MAAMF,CAAS,CAC7B,CACJ,CACJ,CACA,SAASG,GAAQC,EAAMC,EAAM,IAAK,CAE9B,GADAvB,GAAasB,CAAI,EACb,OAAOC,GAAQ,SACf,MAAM,IAAI,MAAM,8BAA8B,EAClD,MAAO,CACH,OAAOC,EAAM,CACT,GAAI,CAAC,MAAM,QAAQA,CAAI,GAAMA,EAAK,QAAU,OAAOA,EAAK,CAAC,GAAM,SAC3D,MAAM,IAAI,MAAM,iDAAiD,EACrE,QAASd,KAAKc,EACV,GAAI,OAAOd,GAAM,SACb,MAAM,IAAI,MAAM,oCAAoCA,CAAC,EAAE,EAC/D,KAAQc,EAAK,OAASF,EAAQ,GAC1BE,EAAK,KAAKD,CAAG,EACjB,OAAOC,CACX,EACA,OAAOV,EAAO,CACV,GAAI,CAAC,MAAM,QAAQA,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,iDAAiD,EACrE,QAASJ,KAAKI,EACV,GAAI,OAAOJ,GAAM,SACb,MAAM,IAAI,MAAM,oCAAoCA,CAAC,EAAE,EAC/D,IAAIe,EAAMX,EAAM,OAChB,GAAKW,EAAMH,EAAQ,EACf,MAAM,IAAI,MAAM,2DAA2D,EAC/E,KAAOG,EAAM,GAAKX,EAAMW,EAAM,CAAC,IAAMF,EAAKE,IACtC,GAAI,GAAIA,EAAM,GAAKH,EAAQ,GACvB,MAAM,IAAI,MAAM,8CAA8C,EAEtE,OAAOR,EAAM,MAAM,EAAGW,CAAG,CAC7B,CACJ,CACJ,CACA,SAASC,GAAUC,EAAI,CACnB,GAAI,OAAOA,GAAO,WACd,MAAM,IAAI,MAAM,iCAAiC,EACrD,MAAO,CAAE,OAASR,GAASA,EAAM,OAASC,GAAOO,EAAGP,CAAE,CAAE,CAC5D,CACA,SAASQ,GAAaJ,EAAML,EAAMC,EAAI,CAClC,GAAID,EAAO,EACP,MAAM,IAAI,MAAM,4BAA4BA,CAAI,8BAA8B,EAClF,GAAIC,EAAK,EACL,MAAM,IAAI,MAAM,0BAA0BA,CAAE,8BAA8B,EAC9E,GAAI,CAAC,MAAM,QAAQI,CAAI,EACnB,MAAM,IAAI,MAAM,oCAAoC,EACxD,GAAI,CAACA,EAAK,OACN,MAAO,CAAC,EACZ,IAAIK,EAAM,EACJC,EAAM,CAAC,EACPjB,EAAS,MAAM,KAAKW,CAAI,EAM9B,IALAX,EAAO,QAASkB,GAAM,CAElB,GADA/B,GAAa+B,CAAC,EACVA,EAAI,GAAKA,GAAKZ,EACd,MAAM,IAAI,MAAM,kBAAkBY,CAAC,EAAE,CAC7C,CAAC,IACY,CACT,IAAIC,EAAQ,EACRC,EAAO,GACX,QAASvB,EAAImB,EAAKnB,EAAIG,EAAO,OAAQH,IAAK,CACtC,IAAMwB,EAAQrB,EAAOH,CAAC,EAChByB,EAAYhB,EAAOa,EAAQE,EACjC,GAAI,CAAC,OAAO,cAAcC,CAAS,GAC9BhB,EAAOa,EAASb,IAASa,GAC1BG,EAAYD,IAAUf,EAAOa,EAC7B,MAAM,IAAI,MAAM,8BAA8B,EAIlD,GAFAA,EAAQG,EAAYf,EACpBP,EAAOH,CAAC,EAAI,KAAK,MAAMyB,EAAYf,CAAE,EACjC,CAAC,OAAO,cAAcP,EAAOH,CAAC,CAAC,GAAKG,EAAOH,CAAC,EAAIU,EAAKY,IAAUG,EAC/D,MAAM,IAAI,MAAM,8BAA8B,EAClD,GAAKF,EAEKpB,EAAOH,CAAC,EAGduB,EAAO,GAFPJ,EAAMnB,MAFN,SAKR,CAEA,GADAoB,EAAI,KAAKE,CAAK,EACVC,EACA,KACR,CACA,QAAS,EAAI,EAAG,EAAIT,EAAK,OAAS,GAAKA,EAAK,CAAC,IAAM,EAAG,IAClDM,EAAI,KAAK,CAAC,EACd,OAAOA,EAAI,QAAQ,CACvB,CACA,IAAMM,GAAM,CAAC/B,EAAGC,IAAQA,EAAQ8B,GAAI9B,EAAGD,EAAIC,CAAC,EAAhBD,EACtBgC,GAAc,CAAClB,EAAMC,IAAOD,GAAQC,EAAKgB,GAAIjB,EAAMC,CAAE,GAC3D,SAASkB,GAAcd,EAAML,EAAMC,EAAIC,EAAS,CAC5C,GAAI,CAAC,MAAM,QAAQG,CAAI,EACnB,MAAM,IAAI,MAAM,qCAAqC,EACzD,GAAIL,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI,MAAM,6BAA6BA,CAAI,EAAE,EACvD,GAAIC,GAAM,GAAKA,EAAK,GAChB,MAAM,IAAI,MAAM,2BAA2BA,CAAE,EAAE,EACnD,GAAIiB,GAAYlB,EAAMC,CAAE,EAAI,GACxB,MAAM,IAAI,MAAM,sCAAsCD,CAAI,OAAOC,CAAE,cAAciB,GAAYlB,EAAMC,CAAE,CAAC,EAAE,EAE5G,IAAIY,EAAQ,EACRH,EAAM,EACJU,EAAO,GAAKnB,EAAK,EACjBU,EAAM,CAAC,EACb,QAAW7B,KAAKuB,EAAM,CAElB,GADAxB,GAAaC,CAAC,EACVA,GAAK,GAAKkB,EACV,MAAM,IAAI,MAAM,oCAAoClB,CAAC,SAASkB,CAAI,EAAE,EAExE,GADAa,EAASA,GAASb,EAAQlB,EACtB4B,EAAMV,EAAO,GACb,MAAM,IAAI,MAAM,qCAAqCU,CAAG,SAASV,CAAI,EAAE,EAE3E,IADAU,GAAOV,EACAU,GAAOT,EAAIS,GAAOT,EACrBU,EAAI,MAAOE,GAAUH,EAAMT,EAAOmB,KAAU,CAAC,EACjDP,GAAS,GAAKH,EAAM,CACxB,CAEA,GADAG,EAASA,GAAUZ,EAAKS,EAAQU,EAC5B,CAAClB,GAAWQ,GAAOV,EACnB,MAAM,IAAI,MAAM,gBAAgB,EACpC,GAAI,CAACE,GAAWW,EACZ,MAAM,IAAI,MAAM,qBAAqBA,CAAK,EAAE,EAChD,OAAIX,GAAWQ,EAAM,GACjBC,EAAI,KAAKE,IAAU,CAAC,EACjBF,CACX,CACA,SAASU,GAAMC,EAAK,CAChB,OAAAzC,GAAayC,CAAG,EACT,CACH,OAASC,GAAU,CACf,GAAI,EAAEA,aAAiB,YACnB,MAAM,IAAI,MAAM,yCAAyC,EAC7D,OAAOd,GAAa,MAAM,KAAKc,CAAK,EAAG,GAAK,EAAGD,CAAG,CACtD,EACA,OAAS5B,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,+CAA+C,EACnE,OAAO,WAAW,KAAKe,GAAaf,EAAQ4B,EAAK,GAAK,CAAC,CAAC,CAC5D,CACJ,CACJ,CACA,SAASE,GAAOrB,EAAMsB,EAAa,GAAO,CAEtC,GADA5C,GAAasB,CAAI,EACbA,GAAQ,GAAKA,EAAO,GACpB,MAAM,IAAI,MAAM,mCAAmC,EACvD,GAAIe,GAAY,EAAGf,CAAI,EAAI,IAAMe,GAAYf,EAAM,CAAC,EAAI,GACpD,MAAM,IAAI,MAAM,wBAAwB,EAC5C,MAAO,CACH,OAASoB,GAAU,CACf,GAAI,EAAEA,aAAiB,YACnB,MAAM,IAAI,MAAM,0CAA0C,EAC9D,OAAOJ,GAAc,MAAM,KAAKI,CAAK,EAAG,EAAGpB,EAAM,CAACsB,CAAU,CAChE,EACA,OAAS/B,GAAW,CAChB,GAAI,CAAC,MAAM,QAAQA,CAAM,GAAMA,EAAO,QAAU,OAAOA,EAAO,CAAC,GAAM,SACjE,MAAM,IAAI,MAAM,gDAAgD,EACpE,OAAO,WAAW,KAAKyB,GAAczB,EAAQS,EAAM,EAAGsB,CAAU,CAAC,CACrE,CACJ,CACJ,CACA,SAASC,GAAclB,EAAI,CACvB,GAAI,OAAOA,GAAO,WACd,MAAM,IAAI,MAAM,qCAAqC,EACzD,OAAO,YAAaxB,EAAM,CACtB,GAAI,CACA,OAAOwB,EAAG,MAAM,KAAMxB,CAAI,CAC9B,MACU,CAAE,CAChB,CACJ,CA6BO,IAAM2C,GAASC,GAAMC,GAAO,CAAC,EAAGC,GAAS,kBAAkB,EAAGC,GAAK,EAAE,CAAC,EAChEC,GAASJ,GAAMC,GAAO,CAAC,EAAGC,GAAS,kCAAkC,EAAGG,GAAQ,CAAC,EAAGF,GAAK,EAAE,CAAC,EAC5FG,GAAYN,GAAMC,GAAO,CAAC,EAAGC,GAAS,kCAAkC,EAAGG,GAAQ,CAAC,EAAGF,GAAK,EAAE,CAAC,EAC/FI,GAAkBP,GAAMC,GAAO,CAAC,EAAGC,GAAS,kCAAkC,EAAGC,GAAK,EAAE,EAAGK,GAAWC,GAAMA,EAAE,YAAY,EAAE,QAAQ,KAAM,GAAG,EAAE,QAAQ,QAAS,GAAG,CAAC,CAAC,EACrKC,GAASV,GAAMC,GAAO,CAAC,EAAGC,GAAS,kEAAkE,EAAGG,GAAQ,CAAC,EAAGF,GAAK,EAAE,CAAC,EAC5HQ,GAAYX,GAAMC,GAAO,CAAC,EAAGC,GAAS,kEAAkE,EAAGG,GAAQ,CAAC,EAAGF,GAAK,EAAE,CAAC,EACtIS,GAAaC,GAAQb,GAAMc,GAAM,EAAE,EAAGZ,GAASW,CAAG,EAAGV,GAAK,EAAE,CAAC,EACtDY,GAASH,GAAU,4DAA4D,EAC/EI,GAAeJ,GAAU,4DAA4D,EACrFK,GAAYL,GAAU,4DAA4D,EACzFM,GAAgB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAE,EACrCC,GAAY,CACrB,OAAOC,EAAM,CACT,IAAIC,EAAM,GACV,QAASC,EAAI,EAAGA,EAAIF,EAAK,OAAQE,GAAK,EAAG,CACrC,IAAMC,EAAQH,EAAK,SAASE,EAAGA,EAAI,CAAC,EACpCD,GAAON,GAAO,OAAOQ,CAAK,EAAE,SAASL,GAAcK,EAAM,MAAM,EAAG,GAAG,CACzE,CACA,OAAOF,CACX,EACA,OAAOG,EAAK,CACR,IAAIH,EAAM,CAAC,EACX,QAASC,EAAI,EAAGA,EAAIE,EAAI,OAAQF,GAAK,GAAI,CACrC,IAAMG,EAAQD,EAAI,MAAMF,EAAGA,EAAI,EAAE,EAC3BI,EAAWR,GAAc,QAAQO,EAAM,MAAM,EAC7CF,EAAQR,GAAO,OAAOU,CAAK,EACjC,QAASE,EAAI,EAAGA,EAAIJ,EAAM,OAASG,EAAUC,IACzC,GAAIJ,EAAMI,CAAC,IAAM,EACb,MAAM,IAAI,MAAM,0BAA0B,EAElDN,EAAMA,EAAI,OAAO,MAAM,KAAKE,EAAM,MAAMA,EAAM,OAASG,CAAQ,CAAC,CAAC,CACrE,CACA,OAAO,WAAW,KAAKL,CAAG,CAC9B,CACJ,EAEA,IAAMO,GAAgBC,GAAMC,GAAS,kCAAkC,EAAGC,GAAK,EAAE,CAAC,EAC5EC,GAAqB,CAAC,UAAY,UAAY,UAAY,WAAY,SAAU,EACtF,SAASC,GAAcC,EAAK,CACxB,IAAMC,EAAID,GAAO,GACbE,GAAOF,EAAM,WAAc,EAC/B,QAASG,EAAI,EAAGA,EAAIL,GAAmB,OAAQK,KACrCF,GAAKE,EAAK,KAAO,IACnBD,GAAOJ,GAAmBK,CAAC,GAEnC,OAAOD,CACX,CACA,SAASE,GAAaC,EAAQC,EAAOC,EAAgB,EAAG,CACpD,IAAMC,EAAMH,EAAO,OACfH,EAAM,EACV,QAASC,EAAI,EAAGA,EAAIK,EAAKL,IAAK,CAC1B,IAAMM,EAAIJ,EAAO,WAAWF,CAAC,EAC7B,GAAIM,EAAI,IAAMA,EAAI,IACd,MAAM,IAAI,MAAM,mBAAmBJ,CAAM,GAAG,EAChDH,EAAMH,GAAcG,CAAG,EAAKO,GAAK,CACrC,CACAP,EAAMH,GAAcG,CAAG,EACvB,QAASC,EAAI,EAAGA,EAAIK,EAAKL,IACrBD,EAAMH,GAAcG,CAAG,EAAKG,EAAO,WAAWF,CAAC,EAAI,GACvD,QAASO,KAAKJ,EACVJ,EAAMH,GAAcG,CAAG,EAAIQ,EAC/B,QAASP,EAAI,EAAGA,EAAI,EAAGA,IACnBD,EAAMH,GAAcG,CAAG,EAC3B,OAAAA,GAAOK,EACAb,GAAc,OAAOiB,GAAc,CAACT,EAAM,GAAK,EAAE,EAAG,GAAI,EAAG,EAAK,CAAC,CAC5E,CACA,SAASU,GAAUC,EAAU,CACzB,IAAMC,EAAiBD,IAAa,SAAW,EAAI,UAC7CE,EAASC,GAAO,CAAC,EACjBC,EAAYF,EAAO,OACnBG,EAAUH,EAAO,OACjBI,EAAkBC,GAAcH,CAAS,EAC/C,SAASI,EAAOhB,EAAQC,EAAOgB,EAAQ,GAAI,CACvC,GAAI,OAAOjB,GAAW,SAClB,MAAM,IAAI,MAAM,8CAA8C,OAAOA,CAAM,EAAE,EACjF,GAAI,CAAC,MAAM,QAAQC,CAAK,GAAMA,EAAM,QAAU,OAAOA,EAAM,CAAC,GAAM,SAC9D,MAAM,IAAI,MAAM,uDAAuD,OAAOA,CAAK,EAAE,EACzF,IAAMiB,EAAelB,EAAO,OAAS,EAAIC,EAAM,OAC/C,GAAIgB,IAAU,IAASC,EAAeD,EAClC,MAAM,IAAI,UAAU,UAAUC,CAAY,kBAAkBD,CAAK,EAAE,EACvE,OAAAjB,EAASA,EAAO,YAAY,EACrB,GAAGA,CAAM,IAAIX,GAAc,OAAOY,CAAK,CAAC,GAAGF,GAAaC,EAAQC,EAAOQ,CAAc,CAAC,EACjG,CACA,SAASU,EAAOC,EAAKH,EAAQ,GAAI,CAC7B,GAAI,OAAOG,GAAQ,SACf,MAAM,IAAI,MAAM,6CAA6C,OAAOA,CAAG,EAAE,EAC7E,GAAIA,EAAI,OAAS,GAAMH,IAAU,IAASG,EAAI,OAASH,EACnD,MAAM,IAAI,UAAU,wBAAwBG,EAAI,MAAM,KAAKA,CAAG,mBAAmBH,CAAK,GAAG,EAC7F,IAAMI,EAAUD,EAAI,YAAY,EAChC,GAAIA,IAAQC,GAAWD,IAAQA,EAAI,YAAY,EAC3C,MAAM,IAAI,MAAM,uCAAuC,EAC3DA,EAAMC,EACN,IAAMC,EAAWF,EAAI,YAAY,GAAG,EACpC,GAAIE,IAAa,GAAKA,IAAa,GAC/B,MAAM,IAAI,MAAM,yDAAyD,EAC7E,IAAMtB,EAASoB,EAAI,MAAM,EAAGE,CAAQ,EAC9BZ,EAASU,EAAI,MAAME,EAAW,CAAC,EACrC,GAAIZ,EAAO,OAAS,EAChB,MAAM,IAAI,MAAM,yCAAyC,EAC7D,IAAMT,EAAQZ,GAAc,OAAOqB,CAAM,EAAE,MAAM,EAAG,EAAE,EAChDa,EAAMxB,GAAaC,EAAQC,EAAOQ,CAAc,EACtD,GAAI,CAACC,EAAO,SAASa,CAAG,EACpB,MAAM,IAAI,MAAM,uBAAuBH,CAAG,eAAeG,CAAG,GAAG,EACnE,MAAO,CAAE,OAAAvB,EAAQ,MAAAC,CAAM,CAC3B,CACA,IAAMuB,EAAeT,GAAcI,CAAM,EACzC,SAASM,EAAcL,EAAK,CACxB,GAAM,CAAE,OAAApB,EAAQ,MAAAC,CAAM,EAAIkB,EAAOC,EAAK,EAAK,EAC3C,MAAO,CAAE,OAAApB,EAAQ,MAAAC,EAAO,MAAOW,EAAUX,CAAK,CAAE,CACpD,CACA,MAAO,CAAE,OAAAe,EAAQ,OAAAG,EAAQ,cAAAM,EAAe,aAAAD,EAAc,UAAAZ,EAAW,gBAAAE,EAAiB,QAAAD,CAAQ,CAC9F,CACO,IAAMa,GAASnB,GAAU,QAAQ,EAC3BoB,GAAUpB,GAAU,SAAS,EAC7BqB,GAAO,CAChB,OAASC,GAAS,IAAI,YAAY,EAAE,OAAOA,CAAI,EAC/C,OAAST,GAAQ,IAAI,YAAY,EAAE,OAAOA,CAAG,CACjD,EACaU,GAAMxC,GAAMqB,GAAO,CAAC,EAAGpB,GAAS,kBAAkB,EAAGC,GAAK,EAAE,EAAGuC,GAAWC,GAAM,CACzF,GAAI,OAAOA,GAAM,UAAYA,EAAE,OAAS,EACpC,MAAM,IAAI,UAAU,oCAAoC,OAAOA,CAAC,gBAAgBA,EAAE,MAAM,EAAE,EAC9F,OAAOA,EAAE,YAAY,CACzB,CAAC,CAAC,EACIC,GAAS,CACX,KAAAL,GAAM,IAAAE,GAAK,OAAAI,GAAQ,OAAAC,GAAQ,OAAAC,GAAQ,UAAAC,GAAW,OAAAC,GAAQ,UAAAC,EAC1D,EACMC,GAAiB,2CAA2C,OAAO,KAAKP,EAAM,EAAE,KAAK,IAAI,CAAC,GCpXhG,IAAIQ,GAAc,IAAI,YAAY,OAAO,EACrCC,GAAc,IAAI,YAYtB,IAAIC,GAAgB,IAUpB,SAASC,GAAOC,EAAO,CACrB,GAAI,CAAE,OAAAC,EAAQ,MAAAC,CAAM,EAAIC,GAAO,OAAOH,EAAOI,EAAa,EACtDC,EAAO,IAAI,WAAWF,GAAO,UAAUD,CAAK,CAAC,EACjD,OAAQD,EAAQ,CACd,IAAK,WAAY,CACf,IAAIK,EAAMC,GAASF,CAAI,EACvB,GAAI,CAACC,EAAI,CAAC,IAAI,CAAC,EACb,MAAM,IAAI,MAAM,4BAA4B,EAC9C,GAAIA,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,GACvB,MAAM,IAAI,MAAM,0BAA0B,EAC5C,MAAO,CACL,KAAM,WACN,KAAM,CACJ,OAAQE,GAAWF,EAAI,CAAC,EAAE,CAAC,CAAC,EAC5B,OAAQA,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,IAAKG,GAAMC,GAAY,OAAOD,CAAC,CAAC,EAAI,CAAC,CAC/D,CACF,CACF,CACA,IAAK,SAAU,CACb,IAAIH,EAAMC,GAASF,CAAI,EACvB,GAAI,CAACC,EAAI,CAAC,IAAI,CAAC,EACb,MAAM,IAAI,MAAM,0BAA0B,EAC5C,GAAIA,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,GACvB,MAAM,IAAI,MAAM,0BAA0B,EAC5C,GAAIA,EAAI,CAAC,GAAKA,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,GACjC,MAAM,IAAI,MAAM,0BAA0B,EAC5C,GAAIA,EAAI,CAAC,GAAKA,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,EACjC,MAAM,IAAI,MAAM,yBAAyB,EAC3C,MAAO,CACL,KAAM,SACN,KAAM,CACJ,GAAIE,GAAWF,EAAI,CAAC,EAAE,CAAC,CAAC,EACxB,OAAQA,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,IAAKG,GAAMC,GAAY,OAAOD,CAAC,CAAC,EAAI,CAAC,EAC7D,OAAQH,EAAI,CAAC,IAAI,CAAC,EAAIE,GAAWF,EAAI,CAAC,EAAE,CAAC,CAAC,EAAI,OAC9C,KAAMA,EAAI,CAAC,IAAI,CAAC,EAAI,SAASE,GAAWF,EAAI,CAAC,EAAE,CAAC,CAAC,EAAG,EAAE,EAAI,MAC5D,CACF,CACF,CACA,IAAK,QAAS,CACZ,IAAIA,EAAMC,GAASF,CAAI,EACvB,GAAI,CAACC,EAAI,CAAC,IAAI,CAAC,EACb,MAAM,IAAI,MAAM,yBAAyB,EAC3C,GAAI,CAACA,EAAI,CAAC,IAAI,CAAC,EACb,MAAM,IAAI,MAAM,yBAAyB,EAC3C,GAAIA,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,GACvB,MAAM,IAAI,MAAM,0BAA0B,EAC5C,GAAI,CAACA,EAAI,CAAC,IAAI,CAAC,EACb,MAAM,IAAI,MAAM,yBAAyB,EAC3C,GAAIA,EAAI,CAAC,EAAE,CAAC,EAAE,SAAW,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC3C,MAAO,CACL,KAAM,QACN,KAAM,CACJ,WAAYI,GAAY,OAAOJ,EAAI,CAAC,EAAE,CAAC,CAAC,EACxC,OAAQE,GAAWF,EAAI,CAAC,EAAE,CAAC,CAAC,EAC5B,KAAM,SAASE,GAAWF,EAAI,CAAC,EAAE,CAAC,CAAC,EAAG,EAAE,EACxC,OAAQA,EAAI,CAAC,EAAIA,EAAI,CAAC,EAAE,IAAKG,GAAMC,GAAY,OAAOD,CAAC,CAAC,EAAI,CAAC,CAC/D,CACF,CACF,CACA,IAAK,OACH,MAAO,CAAE,KAAMR,EAAQ,KAAAI,CAAK,EAC9B,IAAK,OACL,IAAK,OACH,MAAO,CAAE,KAAMJ,EAAQ,KAAMO,GAAWH,CAAI,CAAE,EAChD,QACE,MAAM,IAAI,MAAM,kBAAkBJ,CAAM,EAAE,CAC9C,CACF,CACA,SAASM,GAASF,EAAM,CACtB,IAAIM,EAAS,CAAC,EACVC,EAAOP,EACX,KAAOO,EAAK,OAAS,GAAG,CACtB,IAAIC,EAAID,EAAK,CAAC,EACVE,EAAIF,EAAK,CAAC,EACVG,EAAIH,EAAK,MAAM,EAAG,EAAIE,CAAC,EAE3B,GADAF,EAAOA,EAAK,MAAM,EAAIE,CAAC,EACnBC,EAAE,OAASD,EACb,MAAM,IAAI,MAAM,kCAAkCD,CAAC,EAAE,EACvDF,EAAOE,CAAC,EAAIF,EAAOE,CAAC,GAAK,CAAC,EAC1BF,EAAOE,CAAC,EAAE,KAAKE,CAAC,CAClB,CACA,OAAOJ,CACT,CC5GA,IAAMK,GAAc,iBAMPC,GAAeC,GAAmE,CAC7F,GAAIA,EAAO,WAAW,OAAO,EAAG,CAC9B,IAAMC,EAAcC,GAAOF,CAA0B,EAAE,KACvD,MAAO,CACL,IAAKG,GAAWF,CAAK,EACrB,MAAAA,CACF,CACF,CACA,GAAIH,GAAY,KAAKE,CAAM,EACzB,MAAO,CACL,IAAKA,EACL,MAAOI,GAAWJ,CAAM,CAC1B,CAGJ,EAMaK,GAAeC,GAAuC,CACjE,GAAIA,EAAO,WAAW,OAAO,EAC3B,OAAaJ,GAAOI,CAA0B,EAAE,KAElD,GAAIR,GAAY,KAAKQ,CAAM,EACzB,OAAOA,CAGX,EAKaC,GAAqB,IAAM,KAAK,MAAM,KAAK,IAAI,EAAI,GAAI,EAEvDC,GAAuB,IAAM,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,UAAU,EAAG,CAAC,EAQtEC,GAAN,KAAkB,CACvB,QACA,aAAc,CACZ,KAAK,QAAU,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC9C,KAAK,QAAWC,GAAM,CACpBF,EAAQE,CAAC,CACX,EACA,KAAK,OAAUC,GAAM,CACnBF,EAAOE,CAAC,CACV,CACF,CAAC,CACH,CACF,EAEaC,GAASC,GAAuB,IAAI,QAASL,GAAY,WAAWA,EAASK,CAAU,CAAC,EAExFC,GAA2B,CAAIC,EAAuBC,KAA0B,CAAE,GAAGD,EAAU,GAAGC,CAAK,GCvCpH,IAAMC,GAAwD,CAC5D,eAAgB,EAClB,EAOaC,GAAN,KAAkD,CACvDC,GACAC,GAOO,YAAYC,EAA0BC,EAAuC,CAAC,EAAG,CACtF,KAAKH,GAAYE,EAEjB,GAAM,CAAE,eAAAE,CAAe,EAAIC,GAAyBP,GAAgBK,CAAO,EACvEC,EACF,KAAKH,GAAiB,IAAIK,GAE1B,KAAKL,GAAiB,IAAIM,EAE9B,CAKA,MAAa,cAAgC,CAC3C,OAAO,KAAKN,GAAe,WAAW,IAAM,KAAKD,GAAU,aAAa,CAAC,CAC3E,CAOA,MAAa,WAAgC,CAC3C,GAAI,OAAO,KAAKA,GAAU,WAAc,WACtC,MAAM,MAAM,oDAAoD,EAGlE,OAAO,KAAKC,GAAe,WAAW,IAAM,KAAKD,GAAU,UAAW,CAAC,CACzE,CAQA,MAAa,UAAUQ,EAAgD,CACrE,OAAO,KAAKP,GAAe,WAAW,IAAM,KAAKD,GAAU,UAAUQ,CAAK,CAAC,CAC7E,CASA,MAAa,aAAaC,EAAyBC,EAAoC,CACrF,GAAI,OAAO,KAAKV,GAAU,OAAO,SAAY,WAC3C,MAAM,MAAM,wDAAwD,EAGtE,OAAO,KAAKC,GAAe,WAAW,IAAM,KAAKD,GAAU,MAAO,QAASS,EAAiBC,CAAS,CAAC,CACxG,CASA,MAAa,aAAaC,EAAsBC,EAAqC,CACnF,GAAI,OAAO,KAAKZ,GAAU,OAAO,SAAY,WAC3C,MAAM,MAAM,wDAAwD,EAGtE,OAAO,KAAKC,GAAe,WAAW,IAAM,KAAKD,GAAU,MAAO,QAASW,EAAcC,CAAU,CAAC,CACtG,CASA,MAAa,aAAaH,EAAyBC,EAAoC,CACrF,GAAI,OAAO,KAAKV,GAAU,OAAO,SAAY,WAC3C,MAAM,MAAM,wDAAwD,EAGtE,OAAO,KAAKC,GAAe,WAAW,IAAM,KAAKD,GAAU,MAAO,QAASS,EAAiBC,CAAS,CAAC,CACxG,CASA,MAAa,aAAaC,EAAsBC,EAAqC,CACnF,GAAI,OAAO,KAAKZ,GAAU,OAAO,SAAY,WAC3C,MAAM,MAAM,wDAAwD,EAGtE,OAAO,KAAKC,GAAe,WAAW,IAAM,KAAKD,GAAU,MAAO,QAASW,EAAcC,CAAU,CAAC,CACtG,CACF,EAMMN,GAAN,KAAyD,CACvDO,GAAoC,CAAC,EACrCC,GAAW,GAEJ,WAAcC,EAAmC,CACtD,IAAMC,EAAI,IAAIC,GACRC,EAAI,SAAY,CACpB,GAAI,CACFF,EAAE,QAAQ,MAAMD,EAAI,CAAC,CACvB,OAASI,EAAK,CACZH,EAAE,OAAOG,CAAG,CACd,CACF,EACA,YAAKN,GAAM,KAAKK,CAAC,EAEZ,KAAKJ,KACR,KAAKA,GAAW,GAChB,KAAK,UAAU,GAGVE,EAAE,OACX,CAEA,MAAc,WAAY,CACxB,GAAI,CACF,OAAa,CACX,IAAMD,EAAM,KAAKF,GAAM,MAAM,EAC7B,GAAIE,IAAQ,OACV,MAEF,MAAMA,EAAI,CACZ,CACF,QAAE,CACA,KAAKD,GAAW,EAClB,CACF,CACF,EAEMP,GAAN,KAAqD,CAC5C,WAAcQ,EAAmC,CACtD,OAAOA,EAAI,CACb,CACF,ECpMA,SAASK,GAAOC,EAAG,CACf,GAAI,CAAC,OAAO,cAAcA,CAAC,GAAKA,EAAI,EAChC,MAAM,IAAI,MAAM,kCAAkCA,CAAC,EAAE,CAC7D,CAMO,SAASC,GAAQC,EAAG,CACvB,OAAQA,aAAa,YAChBA,GAAK,MAAQ,OAAOA,GAAM,UAAYA,EAAE,YAAY,OAAS,YACtE,CACA,SAASC,GAAMC,KAAMC,EAAS,CAC1B,GAAI,CAACJ,GAAQG,CAAC,EACV,MAAM,IAAI,MAAM,qBAAqB,EACzC,GAAIC,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAASD,EAAE,MAAM,EAChD,MAAM,IAAI,MAAM,iCAAiCC,CAAO,mBAAmBD,EAAE,MAAM,EAAE,CAC7F,CACA,SAASE,GAAKC,EAAG,CACb,GAAI,OAAOA,GAAM,YAAc,OAAOA,EAAE,QAAW,WAC/C,MAAM,IAAI,MAAM,iDAAiD,EACrER,GAAOQ,EAAE,SAAS,EAClBR,GAAOQ,EAAE,QAAQ,CACrB,CACA,SAASC,GAAOC,EAAUC,EAAgB,GAAM,CAC5C,GAAID,EAAS,UACT,MAAM,IAAI,MAAM,kCAAkC,EACtD,GAAIC,GAAiBD,EAAS,SAC1B,MAAM,IAAI,MAAM,uCAAuC,CAC/D,CACA,SAASE,GAAOC,EAAKH,EAAU,CAC3BN,GAAMS,CAAG,EACT,IAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACb,MAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE,CAEtF,CCrCO,IAAMC,GAAS,OAAO,YAAe,UAAY,WAAY,WAAa,WAAW,OAAS,OCmB9F,IAAMC,GAAcC,GAAQ,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAE7EC,GAAO,CAACC,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC,EAGpD,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,EAe1E,IAAMC,GAAwB,MAAM,KAAK,CAAE,OAAQ,GAAK,EAAE,CAACC,EAAGC,IAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAI5F,SAASC,GAAWpB,EAAO,CAC9BqB,GAAOrB,CAAK,EAEZ,IAAIsB,EAAM,GACV,QAASH,EAAI,EAAGA,EAAInB,EAAM,OAAQmB,IAC9BG,GAAOL,GAAMjB,EAAMmB,CAAC,CAAC,EAEzB,OAAOG,CACX,CAsDO,SAASC,GAAYC,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EACpE,OAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC,CACvD,CAMO,SAASC,GAAQC,EAAM,CAC1B,OAAI,OAAOA,GAAS,WAChBA,EAAOH,GAAYG,CAAI,GAC3BL,GAAOK,CAAI,EACJA,CACX,CAIO,SAASC,MAAeC,EAAQ,CACnC,IAAIC,EAAM,EACV,QAASV,EAAI,EAAGA,EAAIS,EAAO,OAAQT,IAAK,CACpC,IAAMpB,EAAI6B,EAAOT,CAAC,EAClBE,GAAOtB,CAAC,EACR8B,GAAO9B,EAAE,MACZ,CACD,IAAM+B,EAAM,IAAI,WAAWD,CAAG,EAC9B,QAASV,EAAI,EAAGY,EAAM,EAAGZ,EAAIS,EAAO,OAAQT,IAAK,CAC7C,IAAMpB,EAAI6B,EAAOT,CAAC,EAClBW,EAAI,IAAI/B,EAAGgC,CAAG,EACdA,GAAOhC,EAAE,MACZ,CACD,OAAO+B,CACX,CAEO,IAAME,GAAN,KAAW,CAEd,OAAQ,CACJ,OAAO,KAAK,WAAA,CACf,CACL,EAQO,SAASC,GAAgBC,EAAU,CACtC,IAAMC,EAASC,GAAQF,EAAU,EAAC,OAAOT,GAAQW,CAAG,CAAC,EAAE,OAAA,EACjDC,EAAMH,EAAAA,EACZ,OAAAC,EAAM,UAAYE,EAAI,UACtBF,EAAM,SAAWE,EAAI,SACrBF,EAAM,OAAS,IAAMD,EAAAA,EACdC,CACX,CAoBO,SAASG,GAAYC,EAAc,GAAI,CAC1C,GAAI5B,IAAU,OAAOA,GAAO,iBAAoB,WAC5C,OAAOA,GAAO,gBAAgB,IAAI,WAAW4B,CAAW,CAAC,EAE7D,MAAM,IAAI,MAAM,wCAAwC,CAC5D,CCtLA,SAASC,GAAaC,EAAMC,EAAYC,EAAOC,EAAM,CACjD,GAAI,OAAOH,EAAK,cAAiB,WAC7B,OAAOA,EAAK,aAAaC,EAAYC,EAAOC,CAAI,EACpD,IAAMC,EAAO,OAAO,EAAE,EAChBC,EAAW,OAAO,UAAU,EAC5BC,EAAK,OAAQJ,GAASE,EAAQC,CAAQ,EACtCE,EAAK,OAAOL,EAAQG,CAAQ,EAC5B1C,EAAIwC,EAAO,EAAI,EACfK,EAAIL,EAAO,EAAI,EACrBH,EAAK,UAAUC,EAAatC,EAAG2C,EAAIH,CAAI,EACvCH,EAAK,UAAUC,EAAaO,EAAGD,EAAIJ,CAAI,CAC3C,CAEO,IAAMM,GAAM,CAACnD,EAAGE,EAAGkD,IAAOpD,EAAIE,EAAM,CAACF,EAAIoD,EAEnCC,GAAM,CAACrD,EAAGE,EAAGkD,IAAOpD,EAAIE,EAAMF,EAAIoD,EAAMlD,EAAIkD,EAK5CE,GAAN,cAAqBrB,EAAK,CAC7B,YAAYsB,EAAUC,EAAWC,EAAWZ,EAAM,CAC9C,MAAA,EACA,KAAK,SAAWU,EAChB,KAAK,UAAYC,EACjB,KAAK,UAAYC,EACjB,KAAK,KAAOZ,EACZ,KAAK,SAAW,GAChB,KAAK,OAAS,EACd,KAAK,IAAM,EACX,KAAK,UAAY,GACjB,KAAK,OAAS,IAAI,WAAWU,CAAQ,EACrC,KAAK,KAAO1C,GAAW,KAAK,MAAM,CACrC,CACD,OAAOc,EAAM,CACTrB,GAAO,IAAI,EACX,GAAM,CAAE,KAAAoC,EAAM,OAAAgB,EAAQ,SAAAH,CAAQ,EAAK,KACnC5B,EAAOD,GAAQC,CAAI,EACnB,IAAMgC,EAAMhC,EAAK,OACjB,QAASiC,EAAM,EAAGA,EAAMD,GAAM,CAC1B,IAAME,EAAO,KAAK,IAAIN,EAAW,KAAK,IAAKI,EAAMC,CAAG,EAEpD,GAAIC,IAASN,EAAU,CACnB,IAAMO,EAAWjD,GAAWc,CAAI,EAChC,KAAO4B,GAAYI,EAAMC,EAAKA,GAAOL,EACjC,KAAK,QAAQO,EAAUF,CAAG,EAC9B,QACH,CACDF,EAAO,IAAI/B,EAAK,SAASiC,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQN,IACb,KAAK,QAAQb,EAAM,CAAC,EACpB,KAAK,IAAM,EAElB,CACD,OAAA,KAAK,QAAUf,EAAK,OACpB,KAAK,WAAU,EACR,IACV,CACD,WAAWjB,EAAK,CACZJ,GAAO,IAAI,EACXG,GAAOC,EAAK,IAAI,EAChB,KAAK,SAAW,GAIhB,GAAM,CAAE,OAAAgD,EAAQ,KAAAhB,EAAM,SAAAa,EAAU,KAAAV,CAAI,EAAK,KACrC,CAAE,IAAAe,CAAK,EAAG,KAEdF,EAAOE,GAAK,EAAI,IAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,EAG5B,KAAK,UAAYL,EAAWK,IAC5B,KAAK,QAAQlB,EAAM,CAAC,EACpBkB,EAAM,GAGV,QAASxC,EAAIwC,EAAKxC,EAAImC,EAAUnC,IAC5BsC,EAAOtC,CAAC,EAAI,EAIhBqB,GAAaC,EAAMa,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGV,CAAI,EAC9D,KAAK,QAAQH,EAAM,CAAC,EACpB,IAAMqB,EAAQlD,GAAWH,CAAG,EACtBiD,EAAM,KAAK,UAEjB,GAAIA,EAAM,EACN,MAAM,IAAI,MAAM,6CAA6C,EACjE,IAAMK,EAASL,EAAM,EACfM,EAAQ,KAAK,IAAA,EACnB,GAAID,EAASC,EAAM,OACf,MAAM,IAAI,MAAM,oCAAoC,EACxD,QAAS7C,EAAI,EAAGA,EAAI4C,EAAQ5C,IACxB2C,EAAM,UAAU,EAAI3C,EAAG6C,EAAM7C,CAAC,EAAGyB,CAAI,CAC5C,CACD,QAAS,CACL,GAAM,CAAE,OAAAa,EAAQ,UAAAF,CAAW,EAAG,KAC9B,KAAK,WAAWE,CAAM,EACtB,IAAM3B,EAAM2B,EAAO,MAAM,EAAGF,CAAS,EACrC,OAAA,KAAK,QAAO,EACLzB,CACV,CACD,WAAWmC,EAAI,CACXA,IAAOA,EAAK,IAAI,KAAK,aACrBA,EAAG,IAAI,GAAG,KAAK,IAAK,CAAA,EACpB,GAAM,CAAE,SAAAX,EAAU,OAAAG,EAAQ,OAAAS,EAAQ,SAAAC,EAAU,UAAAC,EAAW,IAAAT,CAAK,EAAG,KAC/D,OAAAM,EAAG,OAASC,EACZD,EAAG,IAAMN,EACTM,EAAG,SAAWE,EACdF,EAAG,UAAYG,EACXF,EAASZ,GACTW,EAAG,OAAO,IAAIR,CAAM,EACjBQ,CACV,CACL,ECjHMI,GAA2B,IAAI,YAAY,CAC7C,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,EAIKC,GAA4B,IAAI,YAAY,CAC9C,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACxF,CAAC,EAGKC,GAA2B,IAAI,YAAY,EAAE,EAC7CC,GAAN,cAAqBnB,EAAO,CACxB,aAAc,CACV,MAAM,GAAI,GAAI,EAAG,EAAK,EAGtB,KAAK,EAAIiB,GAAU,CAAC,EAAI,EACxB,KAAK,EAAIA,GAAU,CAAC,EAAI,EACxB,KAAK,EAAIA,GAAU,CAAC,EAAI,EACxB,KAAK,EAAIA,GAAU,CAAC,EAAI,EACxB,KAAK,EAAIA,GAAU,CAAC,EAAI,EACxB,KAAK,EAAIA,GAAU,CAAC,EAAI,EACxB,KAAK,EAAIA,GAAU,CAAC,EAAI,EACxB,KAAK,EAAIA,GAAU,CAAC,EAAI,CAC3B,CACD,KAAM,CACF,GAAM,CAAE,EAAAG,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAG,EAAG,KACnC,MAAO,CAACP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACjC,CAED,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,CAChB,CACD,QAAQvC,EAAMwC,EAAQ,CAElB,QAAS9D,EAAI,EAAGA,EAAI,GAAIA,IAAK8D,GAAU,EACnCV,GAASpD,CAAC,EAAIsB,EAAK,UAAUwC,EAAQ,EAAK,EAC9C,QAAS9D,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,IAAM+D,EAAMX,GAASpD,EAAI,EAAE,EACrBgE,EAAKZ,GAASpD,EAAI,CAAC,EACnBiE,EAAKtE,GAAKoE,EAAK,CAAC,EAAIpE,GAAKoE,EAAK,EAAE,EAAKA,IAAQ,EAC7CG,EAAKvE,GAAKqE,EAAI,EAAE,EAAIrE,GAAKqE,EAAI,EAAE,EAAKA,IAAO,GACjDZ,GAASpD,CAAC,EAAKkE,EAAKd,GAASpD,EAAI,CAAC,EAAIiE,EAAKb,GAASpD,EAAI,EAAE,EAAK,CAClE,CAED,GAAI,CAAE,EAAAsD,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAG,EAAG,KACjC,QAAS7D,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,IAAMmE,EAASxE,GAAK+D,EAAG,CAAC,EAAI/D,GAAK+D,EAAG,EAAE,EAAI/D,GAAK+D,EAAG,EAAE,EAC9CU,EAAMP,EAAIM,EAASpC,GAAI2B,EAAGC,EAAGC,CAAC,EAAIV,GAASlD,CAAC,EAAIoD,GAASpD,CAAC,EAAK,EAE/DqE,GADS1E,GAAK2D,EAAG,CAAC,EAAI3D,GAAK2D,EAAG,EAAE,EAAI3D,GAAK2D,EAAG,EAAE,GAC/BrB,GAAIqB,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIW,EAAM,EACfX,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKc,EAAKC,EAAM,CACnB,CAEDf,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,CAClC,CACD,YAAa,CACTT,GAAS,KAAK,CAAC,CAClB,CACD,SAAU,CACN,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B,KAAK,OAAO,KAAK,CAAC,CACrB,CACL,EAoBakB,GAAyBxD,GAAgB,IAAM,IAAIuC,EAAQ,ECnHxE,IAAMkB,GAAM,OAAO,CAAC,EACdC,GAAM,OAAO,CAAC,EACdC,GAAM,OAAO,CAAC,EACb,SAAS9F,GAAQC,EAAG,CACvB,OAAQA,aAAa,YAChBA,GAAK,MAAQ,OAAOA,GAAM,UAAYA,EAAE,YAAY,OAAS,YACtE,CACO,SAASsB,GAAOwE,EAAM,CACzB,GAAI,CAAC/F,GAAQ+F,CAAI,EACb,MAAM,IAAI,MAAM,qBAAqB,CAC7C,CAEA,IAAM5E,GAAwB,MAAM,KAAK,CAAE,OAAQ,GAAK,EAAE,CAACC,EAAGC,IAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAI5F,SAASC,GAAWpB,EAAO,CAC9BqB,GAAOrB,CAAK,EAEZ,IAAIsB,EAAM,GACV,QAASH,EAAI,EAAGA,EAAInB,EAAM,OAAQmB,IAC9BG,GAAOL,GAAMjB,EAAMmB,CAAC,CAAC,EAEzB,OAAOG,CACX,CACO,SAASwE,GAAoBC,EAAK,CACrC,IAAMzE,EAAMyE,EAAI,SAAS,EAAE,EAC3B,OAAOzE,EAAI,OAAS,EAAI,IAAIA,CAAG,GAAKA,CACxC,CACO,SAAS0E,GAAY1E,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAE5D,OAAO,OAAOA,IAAQ,GAAK,IAAM,KAAKA,CAAG,EAAE,CAC/C,CAEA,IAAM2E,GAAS,CAAE,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAG,EAChE,SAASC,GAAcC,EAAM,CACzB,GAAIA,GAAQF,GAAO,IAAME,GAAQF,GAAO,GACpC,OAAOE,EAAOF,GAAO,GACzB,GAAIE,GAAQF,GAAO,IAAME,GAAQF,GAAO,GACpC,OAAOE,GAAQF,GAAO,GAAK,IAC/B,GAAIE,GAAQF,GAAO,IAAME,GAAQF,GAAO,GACpC,OAAOE,GAAQF,GAAO,GAAK,GAEnC,CAIO,SAASG,GAAW9E,EAAK,CAC5B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAC5D,IAAM+E,EAAK/E,EAAI,OACTgF,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAI,MAAM,0DAA4DA,CAAE,EAClF,IAAME,EAAQ,IAAI,WAAWD,CAAE,EAC/B,QAASE,EAAK,EAAGC,EAAK,EAAGD,EAAKF,EAAIE,IAAMC,GAAM,EAAG,CAC7C,IAAMC,EAAKR,GAAc5E,EAAI,WAAWmF,CAAE,CAAC,EACrCE,EAAKT,GAAc5E,EAAI,WAAWmF,EAAK,CAAC,CAAC,EAC/C,GAAIC,IAAO,QAAaC,IAAO,OAAW,CACtC,IAAMR,EAAO7E,EAAImF,CAAE,EAAInF,EAAImF,EAAK,CAAC,EACjC,MAAM,IAAI,MAAM,+CAAiDN,EAAO,cAAgBM,CAAE,CAC7F,CACDF,EAAMC,CAAE,EAAIE,EAAK,GAAKC,CACzB,CACD,OAAOJ,CACX,CAEO,SAASK,GAAgB5G,EAAO,CACnC,OAAOgG,GAAY5E,GAAWpB,CAAK,CAAC,CACxC,CACO,SAAS6G,GAAgB7G,EAAO,CACnC,OAAAqB,GAAOrB,CAAK,EACLgG,GAAY5E,GAAW,WAAW,KAAKpB,CAAK,EAAE,QAAS,CAAA,CAAC,CACnE,CACO,SAAS8G,GAAgBjH,EAAG6D,EAAK,CACpC,OAAO0C,GAAWvG,EAAE,SAAS,EAAE,EAAE,SAAS6D,EAAM,EAAG,GAAG,CAAC,CAC3D,CACO,SAASqD,GAAgBlH,EAAG6D,EAAK,CACpC,OAAOoD,GAAgBjH,EAAG6D,CAAG,EAAE,QAAO,CAC1C,CAEO,SAASsD,GAAmBnH,EAAG,CAClC,OAAOuG,GAAWN,GAAoBjG,CAAC,CAAC,CAC5C,CAUO,SAASoH,GAAYC,EAAO5F,EAAK6F,EAAgB,CACpD,IAAIrF,EACJ,GAAI,OAAOR,GAAQ,SACf,GAAI,CACAQ,EAAMsE,GAAW9E,CAAG,CACvB,OACM8F,EAAG,CACN,MAAM,IAAI,MAAM,GAAGF,CAAK,mCAAmC5F,CAAG,aAAa8F,CAAC,EAAE,CACjF,SAEItH,GAAQwB,CAAG,EAGhBQ,EAAM,WAAW,KAAKR,CAAG,MAGzB,OAAM,IAAI,MAAM,GAAG4F,CAAK,mCAAmC,EAE/D,IAAMxD,EAAM5B,EAAI,OAChB,GAAI,OAAOqF,GAAmB,UAAYzD,IAAQyD,EAC9C,MAAM,IAAI,MAAM,GAAGD,CAAK,aAAaC,CAAc,eAAezD,CAAG,EAAE,EAC3E,OAAO5B,CACX,CAIO,SAASH,MAAeC,EAAQ,CACnC,IAAIC,EAAM,EACV,QAASV,EAAI,EAAGA,EAAIS,EAAO,OAAQT,IAAK,CACpC,IAAMpB,EAAI6B,EAAOT,CAAC,EAClBE,GAAOtB,CAAC,EACR8B,GAAO9B,EAAE,MACZ,CACD,IAAM+B,EAAM,IAAI,WAAWD,CAAG,EAC9B,QAASV,EAAI,EAAGY,EAAM,EAAGZ,EAAIS,EAAO,OAAQT,IAAK,CAC7C,IAAMpB,EAAI6B,EAAOT,CAAC,EAClBW,EAAI,IAAI/B,EAAGgC,CAAG,EACdA,GAAOhC,EAAE,MACZ,CACD,OAAO+B,CACX,CAEO,SAASuF,GAAWtH,EAAGE,EAAG,CAC7B,GAAIF,EAAE,SAAWE,EAAE,OACf,MAAO,GACX,IAAIqH,EAAO,EACX,QAASnG,EAAI,EAAGA,EAAIpB,EAAE,OAAQoB,IAC1BmG,GAAQvH,EAAEoB,CAAC,EAAIlB,EAAEkB,CAAC,EACtB,OAAOmG,IAAS,CACpB,CAIO,SAAS/F,GAAYC,EAAK,CAC7B,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EACpE,OAAO,IAAI,WAAW,IAAI,YAAa,EAAC,OAAOA,CAAG,CAAC,CACvD,CAMO,SAAS+F,GAAO1H,EAAG,CACtB,IAAI6D,EACJ,IAAKA,EAAM,EAAG7D,EAAI6F,GAAK7F,IAAM8F,GAAKjC,GAAO,EACrC,CACJ,OAAOA,CACX,CAMO,SAAS8D,GAAO3H,EAAG8D,EAAK,CAC3B,OAAQ9D,GAAK,OAAO8D,CAAG,EAAKgC,EAChC,CAIO,SAAS8B,GAAO5H,EAAG8D,EAAKhB,EAAO,CAClC,OAAO9C,GAAM8C,EAAQgD,GAAMD,KAAQ,OAAO/B,CAAG,CACjD,CAKO,IAAM+D,GAAW7H,IAAO+F,IAAO,OAAO/F,EAAI,CAAC,GAAK8F,GAEjDgC,GAAOjG,GAAS,IAAI,WAAWA,CAAI,EACnCkG,GAAQ/G,GAAQ,WAAW,KAAKA,CAAG,EAQlC,SAASgH,GAAeC,EAASC,EAAUC,EAAQ,CACtD,GAAI,OAAOF,GAAY,UAAYA,EAAU,EACzC,MAAM,IAAI,MAAM,0BAA0B,EAC9C,GAAI,OAAOC,GAAa,UAAYA,EAAW,EAC3C,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAI,OAAOC,GAAW,WAClB,MAAM,IAAI,MAAM,2BAA2B,EAE/C,IAAIC,EAAIN,GAAIG,CAAO,EACfI,EAAIP,GAAIG,CAAO,EACf3G,EAAI,EACFgH,EAAQ,IAAM,CAChBF,EAAE,KAAK,CAAC,EACRC,EAAE,KAAK,CAAC,EACR/G,EAAI,CACZ,EACUf,EAAI,IAAIH,IAAM+H,EAAOE,EAAGD,EAAG,GAAGhI,CAAC,EAC/BmI,EAAS,CAACC,EAAOV,GAAAA,IAAU,CAE7BO,EAAI9H,EAAEwH,GAAK,CAAC,CAAI,CAAC,EAAGS,CAAI,EACxBJ,EAAI7H,EAAC,EACDiI,EAAK,SAAW,IAEpBH,EAAI9H,EAAEwH,GAAK,CAAC,CAAI,CAAC,EAAGS,CAAI,EACxBJ,EAAI7H,EAAC,EACb,EACUkI,EAAM,IAAM,CAEd,GAAInH,KAAO,IACP,MAAM,IAAI,MAAM,yBAAyB,EAC7C,IAAIuC,EAAM,EACJjD,EAAM,CAAA,EACZ,KAAOiD,EAAMqE,GAAU,CACnBE,EAAI7H,EAAC,EACL,IAAMmI,EAAKN,EAAE,MAAA,EACbxH,EAAI,KAAK8H,CAAE,EACX7E,GAAOuE,EAAE,MACZ,CACD,OAAOtG,GAAY,GAAGlB,CAAG,CACjC,EAUI,MATiB,CAAC4H,EAAMG,IAAS,CAC7BL,EAAAA,EACAC,EAAOC,CAAI,EACX,IAAIvG,EACJ,KAAO,EAAEA,EAAM0G,EAAKF,EAAK,CAAA,IACrBF,EAAAA,EACJ,OAAAD,EAAAA,EACOrG,CACf,CAEA,CAEA,IAAM2G,GAAe,CACjB,OAASC,GAAQ,OAAOA,GAAQ,SAChC,SAAWA,GAAQ,OAAOA,GAAQ,WAClC,QAAUA,GAAQ,OAAOA,GAAQ,UACjC,OAASA,GAAQ,OAAOA,GAAQ,SAChC,mBAAqBA,GAAQ,OAAOA,GAAQ,UAAY5I,GAAQ4I,CAAG,EACnE,cAAgBA,GAAQ,OAAO,cAAcA,CAAG,EAChD,MAAQA,GAAQ,MAAM,QAAQA,CAAG,EACjC,MAAO,CAACA,EAAKC,IAAWA,EAAO,GAAG,QAAQD,CAAG,EAC7C,KAAOA,GAAQ,OAAOA,GAAQ,YAAc,OAAO,cAAcA,EAAI,SAAS,CAClF,EAEO,SAASE,GAAeD,EAAQE,EAAYC,EAAgB,CAAA,EAAI,CACnE,IAAMC,EAAa,CAACC,EAAWC,EAAMC,IAAe,CAChD,IAAMC,EAAWV,GAAaQ,CAAI,EAClC,GAAI,OAAOE,GAAa,WACpB,MAAM,IAAI,MAAM,sBAAsBF,CAAI,sBAAsB,EACpE,IAAMP,EAAMC,EAAOK,CAAS,EAC5B,GAAI,EAAAE,GAAcR,IAAQ,SAEtB,CAACS,EAAST,EAAKC,CAAM,EACrB,MAAM,IAAI,MAAM,iBAAiB,OAAOK,CAAS,CAAC,IAAIN,CAAG,KAAK,OAAOA,CAAG,eAAeO,CAAI,EAAE,CAEzG,EACI,OAAW,CAACD,EAAWC,CAAI,IAAK,OAAO,QAAQJ,CAAU,EACrDE,EAAWC,EAAWC,EAAM,EAAK,EACrC,OAAW,CAACD,EAAWC,CAAI,IAAK,OAAO,QAAQH,CAAa,EACxDC,EAAWC,EAAWC,EAAM,EAAI,EACpC,OAAON,CACX,oaCnRA,IAAMjD,GAAM,OAAO,CAAC,EAAGC,EAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGwD,GAAM,OAAO,CAAC,EAEjEC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAE1C,OAAO,CAAC,EAAU,OAAO,EAAE,EAEhC,SAASC,GAAIzJ,EAAGE,EAAG,CACtB,IAAMwJ,EAAS1J,EAAIE,EACnB,OAAOwJ,GAAU/D,GAAM+D,EAASxJ,EAAIwJ,CACxC,CAQO,SAASC,GAAI3D,EAAK4D,EAAOC,EAAQ,CACpC,GAAIA,GAAUlE,IAAOiE,EAAQjE,GACzB,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAIkE,IAAWjE,EACX,OAAOD,GACX,IAAI5D,EAAM6D,EACV,KAAOgE,EAAQjE,IACPiE,EAAQhE,IACR7D,EAAOA,EAAMiE,EAAO6D,GACxB7D,EAAOA,EAAMA,EAAO6D,EACpBD,IAAUhE,EAEd,OAAO7D,CACX,CAEO,SAAS+H,GAAKC,EAAGH,EAAOC,EAAQ,CACnC,IAAI9H,EAAMgI,EACV,KAAOH,KAAUjE,IACb5D,GAAOA,EACPA,GAAO8H,EAEX,OAAO9H,CACX,CAEO,SAASiI,GAAOnK,EAAQgK,EAAQ,CACnC,GAAIhK,IAAW8F,IAAOkE,GAAUlE,GAC5B,MAAM,IAAI,MAAM,6CAA6C9F,CAAM,QAAQgK,CAAM,EAAE,EAIvF,IAAI7J,EAAIyJ,GAAI5J,EAAQgK,CAAM,EACtB3J,EAAI2J,EAEJE,EAAIpE,GAAcsE,EAAIrE,EAC1B,KAAO5F,IAAM2F,IAAK,CAEd,IAAMuE,EAAIhK,EAAIF,EACRmK,EAAIjK,EAAIF,EACRoK,EAAIL,EAAIE,EAAIC,EAGlBhK,EAAIF,EAAGA,EAAImK,EAAGJ,EAAIE,EAAUA,EAAIG,CACnC,CAED,GADYlK,IACA0F,EACR,MAAM,IAAI,MAAM,wBAAwB,EAC5C,OAAO6D,GAAIM,EAAGF,CAAM,CACxB,CASO,SAASQ,GAAcC,EAAG,CAM7B,IAAMC,GAAaD,EAAI1E,GAAOC,GAC1B2E,EAAGC,EAAGC,EAGV,IAAKF,EAAIF,EAAI1E,EAAK6E,EAAI,EAAGD,EAAI3E,KAAQF,GAAK6E,GAAK3E,GAAK4E,IAChD,CAEJ,IAAKC,EAAI7E,GAAK6E,EAAIJ,GAAKX,GAAIe,EAAGH,EAAWD,CAAC,IAAMA,EAAI1E,EAAK8E,IACrD,CAEJ,GAAID,IAAM,EAAG,CACT,IAAME,GAAUL,EAAI1E,GAAO0D,GAC3B,OAAO,SAAqBsB,EAAI9K,EAAG,CAC/B,IAAM+K,EAAOD,EAAG,IAAI9K,EAAG6K,CAAM,EAC7B,GAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG/K,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO+K,CACnB,CACK,CAED,IAAMC,GAAUN,EAAI5E,GAAOC,GAC3B,OAAO,SAAqB+E,EAAI9K,EAAG,CAE/B,GAAI8K,EAAG,IAAI9K,EAAGyK,CAAS,IAAMK,EAAG,IAAIA,EAAG,GAAG,EACtC,MAAM,IAAI,MAAM,yBAAyB,EAC7C,IAAIT,EAAIM,EAEJM,EAAIH,EAAG,IAAIA,EAAG,IAAIA,EAAG,IAAKF,CAAC,EAAGF,CAAC,EAC/BT,EAAIa,EAAG,IAAI9K,EAAGgL,CAAM,EACpB5K,EAAI0K,EAAG,IAAI9K,EAAG0K,CAAC,EACnB,KAAO,CAACI,EAAG,IAAI1K,EAAG0K,EAAG,GAAG,GAAG,CACvB,GAAIA,EAAG,IAAI1K,EAAG0K,EAAG,IAAI,EACjB,OAAOA,EAAG,KAEd,IAAIR,EAAI,EACR,QAASY,EAAKJ,EAAG,IAAI1K,CAAC,EAAGkK,EAAID,GACrB,CAAAS,EAAG,IAAII,EAAIJ,EAAG,GAAG,EADOR,IAG5BY,EAAKJ,EAAG,IAAII,CAAE,EAGlB,IAAMC,EAAKL,EAAG,IAAIG,EAAGnF,GAAO,OAAOuE,EAAIC,EAAI,CAAC,CAAC,EAC7CW,EAAIH,EAAG,IAAIK,CAAE,EACblB,EAAIa,EAAG,IAAIb,EAAGkB,CAAE,EAChB/K,EAAI0K,EAAG,IAAI1K,EAAG6K,CAAC,EACfZ,EAAIC,CACP,CACD,OAAOL,CACf,CACA,CACO,SAASmB,GAAOZ,EAAG,CAKtB,GAAIA,EAAIhB,KAAQD,GAAK,CAKjB,IAAMsB,GAAUL,EAAI1E,GAAO0D,GAC3B,OAAO,SAAmBsB,EAAI9K,EAAG,CAC7B,IAAM+K,EAAOD,EAAG,IAAI9K,EAAG6K,CAAM,EAE7B,GAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG/K,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO+K,CACnB,CACK,CAED,GAAIP,EAAId,KAAQD,GAAK,CACjB,IAAM4B,GAAMb,EAAIf,IAAOC,GACvB,OAAO,SAAmBoB,EAAI9K,EAAG,CAC7B,IAAM8G,EAAKgE,EAAG,IAAI9K,EAAG+F,EAAG,EAClBqC,EAAI0C,EAAG,IAAIhE,EAAIuE,CAAE,EACjBC,EAAKR,EAAG,IAAI9K,EAAGoI,CAAC,EAChB9G,EAAIwJ,EAAG,IAAIA,EAAG,IAAIQ,EAAIvF,EAAG,EAAGqC,CAAC,EAC7B2C,EAAOD,EAAG,IAAIQ,EAAIR,EAAG,IAAIxJ,EAAGwJ,EAAG,GAAG,CAAC,EACzC,GAAI,CAACA,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAG/K,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO+K,CACnB,CACK,CAwBD,OAAOR,GAAcC,CAAC,CAC1B,CAIA,IAAMe,GAAe,CACjB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,MAC5B,EACO,SAASC,GAAcC,EAAO,CACjC,IAAMC,EAAU,CACZ,MAAO,SACP,KAAM,SACN,MAAO,gBACP,KAAM,eACd,EACUC,EAAOJ,GAAa,OAAO,CAACK,EAAK/C,KACnC+C,EAAI/C,CAAG,EAAI,WACJ+C,GACRF,CAAO,EACV,OAAO3C,GAAe0C,EAAOE,CAAI,CACrC,CAMO,SAASE,GAAMC,EAAG5F,EAAK4D,EAAO,CAGjC,GAAIA,EAAQjE,GACR,MAAM,IAAI,MAAM,oBAAoB,EACxC,GAAIiE,IAAUjE,GACV,OAAOiG,EAAE,IACb,GAAIhC,IAAUhE,EACV,OAAOI,EACX,IAAI6F,EAAID,EAAE,IACNE,EAAI9F,EACR,KAAO4D,EAAQjE,IACPiE,EAAQhE,IACRiG,EAAID,EAAE,IAAIC,EAAGC,CAAC,GAClBA,EAAIF,EAAE,IAAIE,CAAC,EACXlC,IAAUhE,EAEd,OAAOiG,CACX,CAKO,SAASE,GAAcH,EAAGI,EAAM,CACnC,IAAM1J,EAAM,IAAI,MAAM0J,EAAK,MAAM,EAE3BC,EAAiBD,EAAK,OAAO,CAACE,EAAKlG,EAAK5E,IACtCwK,EAAE,IAAI5F,CAAG,EACFkG,GACX5J,EAAIlB,CAAC,EAAI8K,EACFN,EAAE,IAAIM,EAAKlG,CAAG,GACtB4F,EAAE,GAAG,EAEFO,EAAWP,EAAE,IAAIK,CAAc,EAErC,OAAAD,EAAK,YAAY,CAACE,EAAKlG,EAAK5E,IACpBwK,EAAE,IAAI5F,CAAG,EACFkG,GACX5J,EAAIlB,CAAC,EAAIwK,EAAE,IAAIM,EAAK5J,EAAIlB,CAAC,CAAC,EACnBwK,EAAE,IAAIM,EAAKlG,CAAG,GACtBmG,CAAQ,EACJ7J,CACX,CAaO,SAAS8J,GAAQtM,EAAGuM,EAAY,CAEnC,IAAMC,EAAcD,IAAe,OAAYA,EAAavM,EAAE,SAAS,CAAC,EAAE,OACpEyM,EAAc,KAAK,KAAKD,EAAc,CAAC,EAC7C,MAAO,CAAE,WAAYA,EAAa,YAAAC,CAAAA,CACtC,CAaO,SAASC,GAAMC,EAAOjF,EAAQ3E,EAAO,GAAO6J,EAAQ,CAAA,EAAI,CAC3D,GAAID,GAAS9G,GACT,MAAM,IAAI,MAAM,iCAAiC8G,CAAK,EAAE,EAC5D,GAAM,CAAE,WAAYE,EAAM,YAAaC,CAAK,EAAKR,GAAQK,EAAOjF,CAAM,EACtE,GAAIoF,EAAQ,KACR,MAAM,IAAI,MAAM,iDAAiD,EACrE,IAAMC,EAAQ3B,GAAOuB,CAAK,EACpBb,EAAI,OAAO,OAAO,CACpB,MAAAa,EACA,KAAAE,EACA,MAAAC,EACA,KAAMjF,GAAQgF,CAAI,EAClB,KAAMhH,GACN,IAAKC,EACL,OAASI,GAAQyD,GAAIzD,EAAKyG,CAAK,EAC/B,QAAUzG,GAAQ,CACd,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,+CAA+C,OAAOA,CAAG,EAAE,EAC/E,OAAOL,IAAOK,GAAOA,EAAMyG,CAC9B,EACD,IAAMzG,GAAQA,IAAQL,GACtB,MAAQK,IAASA,EAAMJ,KAASA,EAChC,IAAMI,GAAQyD,GAAI,CAACzD,EAAKyG,CAAK,EAC7B,IAAK,CAACK,EAAKC,IAAQD,IAAQC,EAC3B,IAAM/G,GAAQyD,GAAIzD,EAAMA,EAAKyG,CAAK,EAClC,IAAK,CAACK,EAAKC,IAAQtD,GAAIqD,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAACK,EAAKC,IAAQtD,GAAIqD,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAACK,EAAKC,IAAQtD,GAAIqD,EAAMC,EAAKN,CAAK,EACvC,IAAK,CAACzG,EAAK4D,IAAU+B,GAAMC,EAAG5F,EAAK4D,CAAK,EACxC,IAAK,CAACkD,EAAKC,IAAQtD,GAAIqD,EAAM9C,GAAO+C,EAAKN,CAAK,EAAGA,CAAK,EAEtD,KAAOzG,GAAQA,EAAMA,EACrB,KAAM,CAAC8G,EAAKC,IAAQD,EAAMC,EAC1B,KAAM,CAACD,EAAKC,IAAQD,EAAMC,EAC1B,KAAM,CAACD,EAAKC,IAAQD,EAAMC,EAC1B,IAAM/G,GAAQgE,GAAOhE,EAAKyG,CAAK,EAC/B,KAAMC,EAAM,OAAU5M,GAAM+M,EAAMjB,EAAG9L,CAAC,GACtC,YAAckN,GAAQjB,GAAcH,EAAGoB,CAAG,EAG1C,KAAM,CAAChN,EAAGE,EAAGkD,IAAOA,EAAIlD,EAAIF,EAC5B,QAAUgG,GAASnD,EAAOmE,GAAgBhB,EAAK4G,CAAK,EAAI7F,GAAgBf,EAAK4G,CAAK,EAClF,UAAY3M,GAAU,CAClB,GAAIA,EAAM,SAAW2M,EACjB,MAAM,IAAI,MAAM,0BAA0BA,CAAK,SAAS3M,EAAM,MAAM,EAAE,EAC1E,OAAO4C,EAAOiE,GAAgB7G,CAAK,EAAI4G,GAAgB5G,CAAK,CAC/D,CACT,CAAK,EACD,OAAO,OAAO,OAAO2L,CAAC,CAC1B,CAkCO,SAASqB,GAAoBC,EAAY,CAC5C,GAAI,OAAOA,GAAe,SACtB,MAAM,IAAI,MAAM,4BAA4B,EAChD,IAAMC,EAAYD,EAAW,SAAS,CAAC,EAAE,OACzC,OAAO,KAAK,KAAKC,EAAY,CAAC,CAClC,CAQO,SAASC,GAAiBF,EAAY,CACzC,IAAM/I,EAAS8I,GAAoBC,CAAU,EAC7C,OAAO/I,EAAS,KAAK,KAAKA,EAAS,CAAC,CACxC,CAcO,SAASkJ,GAAeC,EAAKJ,EAAYrK,EAAO,GAAO,CAC1D,IAAMc,EAAM2J,EAAI,OACVC,EAAWN,GAAoBC,CAAU,EACzCM,EAASJ,GAAiBF,CAAU,EAE1C,GAAIvJ,EAAM,IAAMA,EAAM6J,GAAU7J,EAAM,KAClC,MAAM,IAAI,MAAM,YAAY6J,CAAM,6BAA6B7J,CAAG,EAAE,EACxE,IAAMqC,EAAMnD,EAAOgE,GAAgByG,CAAG,EAAIxG,GAAgBwG,CAAG,EAEvDG,EAAUhE,GAAIzD,EAAKkH,EAAatH,CAAG,EAAIA,EAC7C,OAAO/C,EAAOmE,GAAgByG,EAASF,CAAQ,EAAIxG,GAAgB0G,EAASF,CAAQ,CACxF,CC1ZA,IAAM5H,GAAM,OAAO,CAAC,EACdC,GAAM,OAAO,CAAC,EAYb,SAAS8H,GAAKtK,EAAGuK,EAAM,CAC1B,IAAMC,EAAkB,CAACC,EAAW/H,IAAS,CACzC,IAAMgI,EAAMhI,EAAK,OAAA,EACjB,OAAO+H,EAAYC,EAAMhI,CACjC,EACU2F,EAAQsC,GAAM,CAChB,IAAMC,EAAU,KAAK,KAAKL,EAAOI,CAAC,EAAI,EAChCE,EAAa,IAAMF,EAAI,GAC7B,MAAO,CAAE,QAAAC,EAAS,WAAAC,CAAAA,CAC1B,EACI,MAAO,CACH,gBAAAL,EAEA,aAAaM,EAAKpO,EAAG,CACjB,IAAI+L,EAAIzI,EAAE,KACN0I,EAAIoC,EACR,KAAOpO,EAAI6F,IACH7F,EAAI8F,KACJiG,EAAIA,EAAE,IAAIC,CAAC,GACfA,EAAIA,EAAE,OAAA,EACNhM,IAAM8F,GAEV,OAAOiG,CACV,EAWD,iBAAiBqC,EAAKH,EAAG,CACrB,GAAM,CAAE,QAAAC,EAAS,WAAAC,CAAY,EAAGxC,EAAKsC,CAAC,EAChCI,EAAS,CAAA,EACXtC,EAAIqC,EACJE,EAAOvC,EACX,QAASwC,EAAS,EAAGA,EAASL,EAASK,IAAU,CAC7CD,EAAOvC,EACPsC,EAAO,KAAKC,CAAI,EAEhB,QAAShN,EAAI,EAAGA,EAAI6M,EAAY7M,IAC5BgN,EAAOA,EAAK,IAAIvC,CAAC,EACjBsC,EAAO,KAAKC,CAAI,EAEpBvC,EAAIuC,EAAK,OAAA,CACZ,CACD,OAAOD,CACV,EAQD,KAAKJ,EAAGO,EAAaxO,EAAG,CAGpB,GAAM,CAAE,QAAAkO,EAAS,WAAAC,CAAY,EAAGxC,EAAKsC,CAAC,EAClClC,EAAIzI,EAAE,KACNwI,EAAIxI,EAAE,KACJmL,EAAO,OAAO,GAAKR,EAAI,CAAC,EACxBS,EAAY,GAAKT,EACjBU,EAAU,OAAOV,CAAC,EACxB,QAASM,EAAS,EAAGA,EAASL,EAASK,IAAU,CAC7C,IAAMnJ,EAASmJ,EAASJ,EAEpBS,EAAQ,OAAO5O,EAAIyO,CAAI,EAE3BzO,IAAM2O,EAGFC,EAAQT,IACRS,GAASF,EACT1O,GAAK8F,IAST,IAAM+I,EAAUzJ,EACV0J,EAAU1J,EAAS,KAAK,IAAIwJ,CAAK,EAAI,EACrCG,EAAQR,EAAS,IAAM,EACvBS,EAAQJ,EAAQ,EAClBA,IAAU,EAEV9C,EAAIA,EAAE,IAAIgC,EAAgBiB,EAAOP,EAAYK,CAAO,CAAC,CAAC,EAGtD9C,EAAIA,EAAE,IAAI+B,EAAgBkB,EAAOR,EAAYM,CAAO,CAAC,CAAC,CAE7D,CAMD,MAAO,CAAE,EAAA/C,EAAGC,CAAAF,CACf,EACD,WAAWtB,EAAGyE,EAAgBjP,EAAGkP,EAAW,CAExC,IAAMjB,EAAIzD,EAAE,cAAgB,EAExB2E,EAAOF,EAAe,IAAIzE,CAAC,EAC/B,OAAK2E,IACDA,EAAO,KAAK,iBAAiB3E,EAAGyD,CAAC,EAC7BA,IAAM,GACNgB,EAAe,IAAIzE,EAAG0E,EAAUC,CAAI,CAAC,GAGtC,KAAK,KAAKlB,EAAGkB,EAAMnP,CAAC,CAC9B,CACT,CACA,CACO,SAASoP,GAAcC,EAAO,CACjC,OAAA7D,GAAc6D,EAAM,EAAE,EACtBtG,GAAesG,EAAO,CAClB,EAAG,SACH,EAAG,SACH,GAAI,QACJ,GAAI,OACZ,EAAO,CACC,WAAY,gBACZ,YAAa,eACrB,CAAK,EAEM,OAAO,OAAO,CACjB,GAAG/C,GAAQ+C,EAAM,EAAGA,EAAM,UAAU,EACpC,GAAGA,EACE,EAAGA,EAAM,GAAG,KACzB,CAAK,CACL,CCpJA,SAASC,GAAkBD,EAAO,CAC9B,IAAM1D,EAAOyD,GAAcC,CAAK,EAChCE,GAAkB5D,EAAM,CACpB,EAAG,QACH,EAAG,OACX,EAAO,CACC,yBAA0B,QAC1B,eAAgB,UAChB,cAAe,WACf,cAAe,WACf,mBAAoB,UACpB,UAAW,WACX,QAAS,UACjB,CAAK,EACD,GAAM,CAAE,KAAA6D,EAAM,GAAA1E,EAAI,EAAA5K,CAAC,EAAKyL,EACxB,GAAI6D,EAAM,CACN,GAAI,CAAC1E,EAAG,IAAI5K,EAAG4K,EAAG,IAAI,EAClB,MAAM,IAAI,MAAM,mEAAmE,EAEvF,GAAI,OAAO0E,GAAS,UAChB,OAAOA,EAAK,MAAS,UACrB,OAAOA,EAAK,aAAgB,WAC5B,MAAM,IAAI,MAAM,mEAAmE,CAE1F,CACD,OAAO,OAAO,OAAO,CAAE,GAAG7D,CAAM,CAAA,CACpC,CAEA,GAAM,CAAE,gBAAiB8D,GAAK,WAAYC,EAAG,EAAKC,GACrCC,GAAM,CAEf,IAAK,cAAqB,KAAM,CAC5B,YAAYtF,EAAI,GAAI,CAChB,MAAMA,CAAC,CACV,CACJ,EACD,UAAUzI,EAAM,CACZ,GAAM,CAAE,IAAKmD,CAAG,EAAG4K,GACnB,GAAI/N,EAAK,OAAS,GAAKA,EAAK,CAAC,IAAM,EAC/B,MAAM,IAAImD,EAAE,+BAA+B,EAC/C,IAAMnB,EAAMhC,EAAK,CAAC,EACZI,EAAMJ,EAAK,SAAS,EAAGgC,EAAM,CAAC,EACpC,GAAI,CAACA,GAAO5B,EAAI,SAAW4B,EACvB,MAAM,IAAImB,EAAE,yCAAyC,EAKzD,GAAI/C,EAAI,CAAC,EAAI,IACT,MAAM,IAAI+C,EAAE,qCAAqC,EACrD,GAAI/C,EAAI,CAAC,IAAM,GAAQ,EAAEA,EAAI,CAAC,EAAI,KAC9B,MAAM,IAAI+C,EAAE,qDAAqD,EACrE,MAAO,CAAE,EAAGyK,GAAIxN,CAAG,EAAG,EAAGJ,EAAK,SAASgC,EAAM,CAAC,CAAA,CACjD,EACD,MAAMpC,EAAK,CAEP,GAAM,CAAE,IAAKuD,CAAG,EAAG4K,GACb/N,EAAO,OAAOJ,GAAQ,SAAWiO,GAAIjO,CAAG,EAAIA,EAClDoO,GAAUhO,CAAI,EACd,IAAIuB,EAAIvB,EAAK,OACb,GAAIuB,EAAI,GAAKvB,EAAK,CAAC,GAAK,GACpB,MAAM,IAAImD,EAAE,uBAAuB,EACvC,GAAInD,EAAK,CAAC,IAAMuB,EAAI,EAChB,MAAM,IAAI4B,EAAE,qCAAqC,EACrD,GAAM,CAAE,EAAGqF,EAAG,EAAGyF,CAAQ,EAAGF,GAAI,UAAU/N,EAAK,SAAS,CAAC,CAAC,EACpD,CAAE,EAAGkO,EAAG,EAAGC,CAAU,EAAKJ,GAAI,UAAUE,CAAM,EACpD,GAAIE,EAAW,OACX,MAAM,IAAIhL,EAAE,6CAA6C,EAC7D,MAAO,CAAE,EAAAqF,EAAG,EAAA0F,CAAAA,CACf,EACD,WAAWE,EAAK,CAEZ,IAAMC,EAASH,GAAO,OAAO,SAASA,EAAE,CAAC,EAAG,EAAE,EAAI,EAAS,KAAOA,EAAIA,EAChExP,EAAK2F,GAAQ,CACf,IAAMzE,EAAMyE,EAAI,SAAS,EAAE,EAC3B,OAAOzE,EAAI,OAAS,EAAI,IAAIA,CAAG,GAAKA,CAChD,EACcsO,EAAIG,EAAM3P,EAAE0P,EAAI,CAAC,CAAC,EAClB5F,EAAI6F,EAAM3P,EAAE0P,EAAI,CAAC,CAAC,EAClBE,EAAMJ,EAAE,OAAS,EACjBK,EAAM/F,EAAE,OAAS,EACjB3B,EAAKnI,EAAE4P,CAAG,EACVE,EAAK9P,EAAE6P,CAAG,EAChB,MAAO,KAAK7P,EAAE6P,EAAMD,EAAM,CAAC,CAAC,KAAKE,CAAE,GAAGhG,CAAC,KAAK3B,CAAE,GAAGqH,CAAC,EACrD,CACL,EAGMlK,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAS,OAAO,CAAC,EAAE,IAACyD,GAAM,OAAO,CAAC,EAAS,OAAO,CAAC,EACjF,SAAS+G,GAAkB3E,EAAM,CACpC,IAAM4E,EAAQjB,GAAkB3D,CAAI,EAC9B,CAAE,GAAAb,CAAI,EAAGyF,EACT3O,EAAU2O,EAAM,UACjB,CAACC,EAAIC,EAAOC,IAAkB,CAC3B,IAAMxQ,EAAIuQ,EAAM,SAAA,EAChB,OAAOE,GAAe,WAAW,KAAK,CAAC,CAAI,CAAC,EAAG7F,EAAG,QAAQ5K,EAAE,CAAC,EAAG4K,EAAG,QAAQ5K,EAAE,CAAC,CAAC,CAC3F,GACU0Q,EAAYL,EAAM,YAClBpQ,GAAU,CAER,IAAM0Q,EAAO1Q,EAAM,SAAS,CAAC,EAEvB8J,EAAIa,EAAG,UAAU+F,EAAK,SAAS,EAAG/F,EAAG,KAAK,CAAC,EAC3CgG,EAAIhG,EAAG,UAAU+F,EAAK,SAAS/F,EAAG,MAAO,EAAIA,EAAG,KAAK,CAAC,EAC5D,MAAO,CAAE,EAAAb,EAAG,EAAA6G,CAAAA,CACxB,GAKI,SAASC,EAAoB9G,EAAG,CAC5B,GAAM,CAAE,EAAA/J,EAAG,EAAAE,CAAG,EAAGmQ,EACXS,EAAKlG,EAAG,IAAIb,CAAC,EACbgH,EAAKnG,EAAG,IAAIkG,EAAI/G,CAAC,EACvB,OAAOa,EAAG,IAAIA,EAAG,IAAImG,EAAInG,EAAG,IAAIb,EAAG/J,CAAC,CAAC,EAAGE,CAAC,CAC5C,CAKD,GAAI,CAAC0K,EAAG,IAAIA,EAAG,IAAIyF,EAAM,EAAE,EAAGQ,EAAoBR,EAAM,EAAE,CAAC,EACvD,MAAM,IAAI,MAAM,6CAA6C,EAEjE,SAASW,EAAmBhL,EAAK,CAC7B,OAAO,OAAOA,GAAQ,UAAYL,GAAMK,GAAOA,EAAMqK,EAAM,CAC9D,CACD,SAASY,EAASjL,EAAK,CACnB,GAAI,CAACgL,EAAmBhL,CAAG,EACvB,MAAM,IAAI,MAAM,6CAA6C,CACpE,CAGD,SAASkL,EAAuB5D,EAAK,CACjC,GAAM,CAAE,yBAA0BnN,EAAS,YAAAoM,EAAa,eAAA4E,EAAgB,EAAArR,CAAG,EAAGuQ,EAC9E,GAAIlQ,GAAW,OAAOmN,GAAQ,SAAU,CAIpC,GAHI8D,GAAW9D,CAAG,IACdA,EAAM+D,GAAc/D,CAAG,GAEvB,OAAOA,GAAQ,UAAY,CAACnN,EAAQ,SAASmN,EAAI,MAAM,EACvD,MAAM,IAAI,MAAM,aAAa,EACjCA,EAAMA,EAAI,SAASf,EAAc,EAAG,GAAG,CAC1C,CACD,IAAIvG,EACJ,GAAI,CACAA,EACI,OAAOsH,GAAQ,SACTA,EACAgE,GAAmBpK,GAAY,cAAeoG,EAAKf,CAAW,CAAC,CAC5E,MACa,CACV,MAAM,IAAI,MAAM,uBAAuBA,CAAW,8BAA8B,OAAOe,CAAG,EAAE,CAC/F,CACD,OAAI6D,IACAnL,EAAMuL,GAAQvL,EAAKlG,CAAC,GACxBmR,EAASjL,CAAG,EACLA,CACV,CACD,IAAMwL,EAAmB,IAAI,IAC7B,SAASC,EAAeC,EAAO,CAC3B,GAAI,EAAEA,aAAiBC,GACnB,MAAM,IAAI,MAAM,0BAA0B,CACjD,CAMD,MAAMA,CAAM,CACR,YAAYC,EAAIC,EAAIC,EAAI,CAIpB,GAHA,KAAK,GAAKF,EACV,KAAK,GAAKC,EACV,KAAK,GAAKC,EACNF,GAAM,MAAQ,CAAChH,EAAG,QAAQgH,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,EAChC,GAAIC,GAAM,MAAQ,CAACjH,EAAG,QAAQiH,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,EAChC,GAAIC,GAAM,MAAQ,CAAClH,EAAG,QAAQkH,CAAE,EAC5B,MAAM,IAAI,MAAM,YAAY,CACnC,CAGD,OAAO,WAAWjG,EAAG,CACjB,GAAM,CAAE,EAAA9B,EAAG,EAAA6G,CAAAA,EAAM/E,GAAK,CAAA,EACtB,GAAI,CAACA,GAAK,CAACjB,EAAG,QAAQb,CAAC,GAAK,CAACa,EAAG,QAAQgG,CAAC,EACrC,MAAM,IAAI,MAAM,sBAAsB,EAC1C,GAAI/E,aAAa8F,EACb,MAAM,IAAI,MAAM,8BAA8B,EAClD,IAAMI,EAAO3Q,GAAMwJ,EAAG,IAAIxJ,EAAGwJ,EAAG,IAAI,EAEpC,OAAImH,EAAIhI,CAAC,GAAKgI,EAAInB,CAAC,EACRe,EAAM,KACV,IAAIA,EAAM5H,EAAG6G,EAAGhG,EAAG,GAAG,CAChC,CACD,IAAI,GAAI,CACJ,OAAO,KAAK,SAAU,EAAC,CAC1B,CACD,IAAI,GAAI,CACJ,OAAO,KAAK,SAAU,EAAC,CAC1B,CAOD,OAAO,WAAWuD,EAAQ,CACtB,IAAM6D,EAAQpH,EAAG,YAAYuD,EAAO,IAAKtC,GAAMA,EAAE,EAAE,CAAC,EACpD,OAAOsC,EAAO,IAAI,CAACtC,EAAGzK,IAAMyK,EAAE,SAASmG,EAAM5Q,CAAC,CAAC,CAAC,EAAE,IAAIuQ,EAAM,UAAU,CACzE,CAKD,OAAO,QAAQpQ,EAAK,CAChB,IAAM+I,EAAIqH,EAAM,WAAWjB,EAAUxJ,GAAY,WAAY3F,CAAG,CAAC,CAAC,EAClE,OAAA+I,EAAE,eAAc,EACTA,CACV,CAED,OAAO,eAAe2H,EAAY,CAC9B,OAAON,EAAM,KAAK,SAAST,EAAuBe,CAAU,CAAC,CAChE,CAED,eAAehE,EAAY,CACvB,KAAK,aAAeA,EACpBuD,EAAiB,OAAO,IAAI,CAC/B,CAED,gBAAiB,CACb,GAAI,KAAK,IAAA,EAAO,CAIZ,GAAInB,EAAM,oBAAsB,CAACzF,EAAG,IAAI,KAAK,EAAE,EAC3C,OACJ,MAAM,IAAI,MAAM,iBAAiB,CACpC,CAED,GAAM,CAAE,EAAAb,EAAG,EAAA6G,CAAG,EAAG,KAAK,SAAQ,EAE9B,GAAI,CAAChG,EAAG,QAAQb,CAAC,GAAK,CAACa,EAAG,QAAQgG,CAAC,EAC/B,MAAM,IAAI,MAAM,0BAA0B,EAC9C,IAAMsB,EAAOtH,EAAG,IAAIgG,CAAC,EACfuB,EAAQtB,EAAoB9G,CAAC,EACnC,GAAI,CAACa,EAAG,IAAIsH,EAAMC,CAAK,EACnB,MAAM,IAAI,MAAM,mCAAmC,EACvD,GAAI,CAAC,KAAK,cAAe,EACrB,MAAM,IAAI,MAAM,wCAAwC,CAC/D,CACD,UAAW,CACP,GAAM,CAAE,EAAAvB,CAAC,EAAK,KAAK,SAAQ,EAC3B,GAAIhG,EAAG,MACH,MAAO,CAACA,EAAG,MAAMgG,CAAC,EACtB,MAAM,IAAI,MAAM,6BAA6B,CAChD,CAID,OAAOc,EAAO,CACVD,EAAeC,CAAK,EACpB,GAAM,CAAE,GAAIU,EAAI,GAAIC,EAAI,GAAIC,CAAI,EAAG,KAC7B,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAI,EAAGf,EAC7BgB,EAAK9H,EAAG,IAAIA,EAAG,IAAIwH,EAAIK,CAAE,EAAG7H,EAAG,IAAI2H,EAAID,CAAE,CAAC,EAC1CK,EAAK/H,EAAG,IAAIA,EAAG,IAAIyH,EAAII,CAAE,EAAG7H,EAAG,IAAI4H,EAAIF,CAAE,CAAC,EAChD,OAAOI,GAAMC,CAChB,CAID,QAAS,CACL,OAAO,IAAIhB,EAAM,KAAK,GAAI/G,EAAG,IAAI,KAAK,EAAE,EAAG,KAAK,EAAE,CACrD,CAKD,QAAS,CACL,GAAM,CAAE,EAAA5K,EAAG,EAAAE,CAAG,EAAGmQ,EACXuC,EAAKhI,EAAG,IAAI1K,EAAGmJ,EAAG,EAClB,CAAE,GAAI+I,EAAI,GAAIC,EAAI,GAAIC,CAAI,EAAG,KAC/BO,EAAKjI,EAAG,KAAMkI,EAAKlI,EAAG,KAAMmI,EAAKnI,EAAG,KACpCoI,EAAKpI,EAAG,IAAIwH,EAAIA,CAAE,EAClBa,EAAKrI,EAAG,IAAIyH,EAAIA,CAAE,EAClBrH,EAAKJ,EAAG,IAAI0H,EAAIA,CAAE,EAClBY,EAAKtI,EAAG,IAAIwH,EAAIC,CAAE,EACtB,OAAAa,EAAKtI,EAAG,IAAIsI,EAAIA,CAAE,EAClBH,EAAKnI,EAAG,IAAIwH,EAAIE,CAAE,EAClBS,EAAKnI,EAAG,IAAImI,EAAIA,CAAE,EAClBF,EAAKjI,EAAG,IAAI5K,EAAG+S,CAAE,EACjBD,EAAKlI,EAAG,IAAIgI,EAAI5H,CAAE,EAClB8H,EAAKlI,EAAG,IAAIiI,EAAIC,CAAE,EAClBD,EAAKjI,EAAG,IAAIqI,EAAIH,CAAE,EAClBA,EAAKlI,EAAG,IAAIqI,EAAIH,CAAE,EAClBA,EAAKlI,EAAG,IAAIiI,EAAIC,CAAE,EAClBD,EAAKjI,EAAG,IAAIsI,EAAIL,CAAE,EAClBE,EAAKnI,EAAG,IAAIgI,EAAIG,CAAE,EAClB/H,EAAKJ,EAAG,IAAI5K,EAAGgL,CAAE,EACjBkI,EAAKtI,EAAG,IAAIoI,EAAIhI,CAAE,EAClBkI,EAAKtI,EAAG,IAAI5K,EAAGkT,CAAE,EACjBA,EAAKtI,EAAG,IAAIsI,EAAIH,CAAE,EAClBA,EAAKnI,EAAG,IAAIoI,EAAIA,CAAE,EAClBA,EAAKpI,EAAG,IAAImI,EAAIC,CAAE,EAClBA,EAAKpI,EAAG,IAAIoI,EAAIhI,CAAE,EAClBgI,EAAKpI,EAAG,IAAIoI,EAAIE,CAAE,EAClBJ,EAAKlI,EAAG,IAAIkI,EAAIE,CAAE,EAClBhI,EAAKJ,EAAG,IAAIyH,EAAIC,CAAE,EAClBtH,EAAKJ,EAAG,IAAII,EAAIA,CAAE,EAClBgI,EAAKpI,EAAG,IAAII,EAAIkI,CAAE,EAClBL,EAAKjI,EAAG,IAAIiI,EAAIG,CAAE,EAClBD,EAAKnI,EAAG,IAAII,EAAIiI,CAAE,EAClBF,EAAKnI,EAAG,IAAImI,EAAIA,CAAE,EAClBA,EAAKnI,EAAG,IAAImI,EAAIA,CAAE,EACX,IAAIpB,EAAMkB,EAAIC,EAAIC,CAAE,CAC9B,CAKD,IAAIrB,EAAO,CACPD,EAAeC,CAAK,EACpB,GAAM,CAAE,GAAIU,EAAI,GAAIC,EAAI,GAAIC,CAAI,EAAG,KAC7B,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAI,EAAGf,EAC/BmB,EAAKjI,EAAG,KAAMkI,EAAKlI,EAAG,KAAMmI,EAAKnI,EAAG,KAClC5K,EAAIqQ,EAAM,EACVuC,EAAKhI,EAAG,IAAIyF,EAAM,EAAGhH,EAAG,EAC1B2J,EAAKpI,EAAG,IAAIwH,EAAIG,CAAE,EAClBU,EAAKrI,EAAG,IAAIyH,EAAIG,CAAE,EAClBxH,EAAKJ,EAAG,IAAI0H,EAAIG,CAAE,EAClBS,EAAKtI,EAAG,IAAIwH,EAAIC,CAAE,EAClBc,EAAKvI,EAAG,IAAI2H,EAAIC,CAAE,EACtBU,EAAKtI,EAAG,IAAIsI,EAAIC,CAAE,EAClBA,EAAKvI,EAAG,IAAIoI,EAAIC,CAAE,EAClBC,EAAKtI,EAAG,IAAIsI,EAAIC,CAAE,EAClBA,EAAKvI,EAAG,IAAIwH,EAAIE,CAAE,EAClB,IAAIc,EAAKxI,EAAG,IAAI2H,EAAIE,CAAE,EACtB,OAAAU,EAAKvI,EAAG,IAAIuI,EAAIC,CAAE,EAClBA,EAAKxI,EAAG,IAAIoI,EAAIhI,CAAE,EAClBmI,EAAKvI,EAAG,IAAIuI,EAAIC,CAAE,EAClBA,EAAKxI,EAAG,IAAIyH,EAAIC,CAAE,EAClBO,EAAKjI,EAAG,IAAI4H,EAAIC,CAAE,EAClBW,EAAKxI,EAAG,IAAIwI,EAAIP,CAAE,EAClBA,EAAKjI,EAAG,IAAIqI,EAAIjI,CAAE,EAClBoI,EAAKxI,EAAG,IAAIwI,EAAIP,CAAE,EAClBE,EAAKnI,EAAG,IAAI5K,EAAGmT,CAAE,EACjBN,EAAKjI,EAAG,IAAIgI,EAAI5H,CAAE,EAClB+H,EAAKnI,EAAG,IAAIiI,EAAIE,CAAE,EAClBF,EAAKjI,EAAG,IAAIqI,EAAIF,CAAE,EAClBA,EAAKnI,EAAG,IAAIqI,EAAIF,CAAE,EAClBD,EAAKlI,EAAG,IAAIiI,EAAIE,CAAE,EAClBE,EAAKrI,EAAG,IAAIoI,EAAIA,CAAE,EAClBC,EAAKrI,EAAG,IAAIqI,EAAID,CAAE,EAClBhI,EAAKJ,EAAG,IAAI5K,EAAGgL,CAAE,EACjBmI,EAAKvI,EAAG,IAAIgI,EAAIO,CAAE,EAClBF,EAAKrI,EAAG,IAAIqI,EAAIjI,CAAE,EAClBA,EAAKJ,EAAG,IAAIoI,EAAIhI,CAAE,EAClBA,EAAKJ,EAAG,IAAI5K,EAAGgL,CAAE,EACjBmI,EAAKvI,EAAG,IAAIuI,EAAInI,CAAE,EAClBgI,EAAKpI,EAAG,IAAIqI,EAAIE,CAAE,EAClBL,EAAKlI,EAAG,IAAIkI,EAAIE,CAAE,EAClBA,EAAKpI,EAAG,IAAIwI,EAAID,CAAE,EAClBN,EAAKjI,EAAG,IAAIsI,EAAIL,CAAE,EAClBA,EAAKjI,EAAG,IAAIiI,EAAIG,CAAE,EAClBA,EAAKpI,EAAG,IAAIsI,EAAID,CAAE,EAClBF,EAAKnI,EAAG,IAAIwI,EAAIL,CAAE,EAClBA,EAAKnI,EAAG,IAAImI,EAAIC,CAAE,EACX,IAAIrB,EAAMkB,EAAIC,EAAIC,CAAE,CAC9B,CACD,SAASrB,EAAO,CACZ,OAAO,KAAK,IAAIA,EAAM,OAAQ,CAAA,CACjC,CACD,KAAM,CACF,OAAO,KAAK,OAAOC,EAAM,IAAI,CAChC,CACD,KAAK7R,EAAG,CACJ,OAAOuT,EAAK,WAAW,KAAM7B,EAAkB1R,EAAImP,GAAS,CACxD,IAAM+C,EAAQpH,EAAG,YAAYqE,EAAK,IAAKpD,GAAMA,EAAE,EAAE,CAAC,EAClD,OAAOoD,EAAK,IAAI,CAACpD,EAAGzK,IAAMyK,EAAE,SAASmG,EAAM5Q,CAAC,CAAC,CAAC,EAAE,IAAIuQ,EAAM,UAAU,CACpF,CAAa,CACJ,CAMD,eAAe7R,EAAG,CACd,IAAMwT,EAAI3B,EAAM,KAChB,GAAI7R,IAAM6F,GACN,OAAO2N,EAEX,GADArC,EAASnR,CAAC,EACNA,IAAM8F,GACN,OAAO,KACX,GAAM,CAAE,KAAA0J,CAAM,EAAGe,EACjB,GAAI,CAACf,EACD,OAAO+D,EAAK,aAAa,KAAMvT,CAAC,EAEpC,GAAI,CAAE,MAAAyT,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAC,CAAE,EAAKpE,EAAK,YAAYxP,CAAC,EAC7C6T,EAAML,EACNM,EAAMN,EACNxH,EAAI,KACR,KAAO0H,EAAK7N,IAAO+N,EAAK/N,IAChB6N,EAAK5N,KACL+N,EAAMA,EAAI,IAAI7H,CAAC,GACf4H,EAAK9N,KACLgO,EAAMA,EAAI,IAAI9H,CAAC,GACnBA,EAAIA,EAAE,OAAA,EACN0H,IAAO5N,GACP8N,IAAO9N,GAEX,OAAI2N,IACAI,EAAMA,EAAI,OAAA,GACVF,IACAG,EAAMA,EAAI,OAAA,GACdA,EAAM,IAAIjC,EAAM/G,EAAG,IAAIgJ,EAAI,GAAItE,EAAK,IAAI,EAAGsE,EAAI,GAAIA,EAAI,EAAE,EAClDD,EAAI,IAAIC,CAAG,CACrB,CAUD,SAASC,EAAQ,CACb5C,EAAS4C,CAAM,EACf,IAAI/T,EAAI+T,EACJtD,EAAOuD,EACL,CAAE,KAAAxE,CAAM,EAAGe,EACjB,GAAIf,EAAM,CACN,GAAM,CAAE,MAAAiE,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAC,CAAE,EAAKpE,EAAK,YAAYxP,CAAC,EAC/C,CAAE,EAAG6T,EAAK,EAAGI,CAAG,EAAK,KAAK,KAAKP,CAAE,EACjC,CAAE,EAAGI,EAAK,EAAGI,CAAG,EAAK,KAAK,KAAKN,CAAE,EACrCC,EAAMN,EAAK,gBAAgBE,EAAOI,CAAG,EACrCC,EAAMP,EAAK,gBAAgBI,EAAOG,CAAG,EACrCA,EAAM,IAAIjC,EAAM/G,EAAG,IAAIgJ,EAAI,GAAItE,EAAK,IAAI,EAAGsE,EAAI,GAAIA,EAAI,EAAE,EACzDrD,EAAQoD,EAAI,IAAIC,CAAG,EACnBE,EAAOC,EAAI,IAAIC,CAAG,CACrB,KACI,CACD,GAAM,CAAE,EAAAnI,EAAG,EAAAD,CAAC,EAAK,KAAK,KAAK9L,CAAC,EAC5ByQ,EAAQ1E,EACRiI,EAAOlI,CACV,CAED,OAAO+F,EAAM,WAAW,CAACpB,EAAOuD,CAAI,CAAC,EAAE,CAAC,CAC3C,CAOD,qBAAqBtJ,EAAGxK,EAAGE,EAAG,CAC1B,IAAM8E,EAAI2M,EAAM,KACVsC,EAAM,CAAC3J,EAAGtK,IACVA,IAAM2F,IAAO3F,IAAM4F,IAAO,CAAC0E,EAAE,OAAOtF,CAAC,EAAIsF,EAAE,eAAetK,CAAC,EAAIsK,EAAE,SAAStK,CAAC,EAC3E8B,EAAMmS,EAAI,KAAMjU,CAAC,EAAE,IAAIiU,EAAIzJ,EAAGtK,CAAC,CAAC,EACtC,OAAO4B,EAAI,IAAA,EAAQ,OAAYA,CAClC,CAID,SAASoS,EAAI,CACT,GAAM,CAAE,GAAInK,EAAG,GAAI6G,EAAG,GAAIuD,CAAG,EAAG,KAC1BpC,EAAM,KAAK,IAAA,EAGbmC,GAAM,OACNA,EAAKnC,EAAMnH,EAAG,IAAMA,EAAG,IAAIuJ,CAAC,GAChC,IAAMC,EAAKxJ,EAAG,IAAIb,EAAGmK,CAAE,EACjBG,EAAKzJ,EAAG,IAAIgG,EAAGsD,CAAE,EACjBI,EAAK1J,EAAG,IAAIuJ,EAAGD,CAAE,EACvB,GAAInC,EACA,MAAO,CAAE,EAAGnH,EAAG,KAAM,EAAGA,EAAG,IAAA,EAC/B,GAAI,CAACA,EAAG,IAAI0J,EAAI1J,EAAG,GAAG,EAClB,MAAM,IAAI,MAAM,kBAAkB,EACtC,MAAO,CAAE,EAAGwJ,EAAI,EAAGC,CAAE,CACxB,CACD,eAAgB,CACZ,GAAM,CAAErU,EAAa,cAAAuU,CAAa,EAAKlE,EACvC,GAAImE,IAAa5O,GACb,MAAO,GACX,GAAI2O,EACA,OAAOA,EAAc5C,EAAO,IAAI,EACpC,MAAM,IAAI,MAAM,8DAA8D,CACjF,CACD,eAAgB,CACZ,GAAM,CAAE3R,EAAa,cAAAyU,CAAa,EAAKpE,EACvC,OAAImE,IAAa5O,GACN,KACP6O,EACOA,EAAc9C,EAAO,IAAI,EAC7B,KAAK,eAAetB,EAAM,CAAC,CACrC,CACD,WAAWqE,EAAe,GAAM,CAC5B,OAAA,KAAK,eAAc,EACZhT,EAAQiQ,EAAO,KAAM+C,CAAY,CAC3C,CACD,MAAMA,EAAe,GAAM,CACvB,OAAOrD,GAAc,KAAK,WAAWqD,CAAY,CAAC,CACrD,CACJ,CACD/C,EAAM,KAAO,IAAIA,EAAMtB,EAAM,GAAIA,EAAM,GAAIzF,EAAG,GAAG,EACjD+G,EAAM,KAAO,IAAIA,EAAM/G,EAAG,KAAMA,EAAG,IAAKA,EAAG,IAAI,EAC/C,IAAM+J,EAAQtE,EAAM,WACdgD,EAAO3F,GAAKiE,EAAOtB,EAAM,KAAO,KAAK,KAAKsE,EAAQ,CAAC,EAAIA,CAAK,EAElE,MAAO,CACH,MAAAtE,EACA,gBAAiBsB,EACjB,uBAAAT,EACA,oBAAAL,EACA,mBAAAG,CACR,CACA,CACA,SAAS4D,GAAazF,EAAO,CACzB,IAAM1D,EAAOyD,GAAcC,CAAK,EAChCE,OAAAA,GAAkB5D,EAAM,CACpB,KAAM,OACN,KAAM,WACN,YAAa,UACrB,EAAO,CACC,SAAU,WACV,cAAe,WACf,KAAM,SACd,CAAK,EACM,OAAO,OAAO,CAAE,KAAM,GAAM,GAAGA,CAAI,CAAE,CAChD,CACO,SAASoJ,GAAYC,EAAU,CAClC,IAAMzE,EAAQuE,GAAaE,CAAQ,EAC7B,CAAE,GAAAlK,EAAIT,CAAc,EAAKkG,EACzB0E,EAAgBnK,EAAG,MAAQ,EAC3BoK,EAAkB,EAAIpK,EAAG,MAAQ,EACvC,SAASqK,EAAoBjP,EAAK,CAC9B,OAAOL,GAAMK,GAAOA,EAAM4E,EAAG,KAChC,CACD,SAASsK,EAAKlV,EAAG,CACb,OAAOuR,GAAQvR,EAAGmV,CAAW,CAChC,CACD,SAASC,EAAKpV,EAAG,CACb,OAAOqV,GAAWrV,EAAGmV,CAAW,CACnC,CACD,GAAM,CAAE,gBAAiBxD,EAAO,uBAAAT,EAAwB,oBAAAL,EAAqB,mBAAAG,CAAqB,EAAGZ,GAAkB,CACnH,GAAGC,EACH,QAAQC,EAAIC,EAAOmE,EAAc,CAC7B,IAAM1U,EAAIuQ,EAAM,SAAA,EACVxG,EAAIa,EAAG,QAAQ5K,EAAE,CAAC,EAClBsV,EAAM7E,GACZ,OAAIiE,EACOY,EAAI,WAAW,KAAK,CAAC/E,EAAM,SAAU,EAAG,EAAO,CAAI,CAAC,EAAGxG,CAAC,EAGxDuL,EAAI,WAAW,KAAK,CAAC,CAAI,CAAC,EAAGvL,EAAGa,EAAG,QAAQ5K,EAAE,CAAC,CAAC,CAE7D,EACD,UAAUC,EAAO,CACb,IAAM0D,EAAM1D,EAAM,OACZsV,EAAOtV,EAAM,CAAC,EACd0Q,EAAO1Q,EAAM,SAAS,CAAC,EAE7B,GAAI0D,IAAQoR,IAAkBQ,IAAS,GAAQA,IAAS,GAAO,CAC3D,IAAMxL,EAAIuH,GAAmBX,CAAI,EACjC,GAAI,CAACsE,EAAoBlL,CAAC,EACtB,MAAM,IAAI,MAAM,uBAAuB,EAC3C,IAAMyL,EAAK3E,EAAoB9G,CAAC,EAC5B6G,EACJ,GAAI,CACAA,EAAIhG,EAAG,KAAK4K,CAAE,CACjB,OACMC,EAAW,CACd,IAAMC,EAASD,aAAqB,MAAQ,KAAOA,EAAU,QAAU,GACvE,MAAM,IAAI,MAAM,wBAA0BC,CAAM,CACnD,CACD,IAAMC,GAAU/E,EAAIhL,MAASA,GAG7B,OADmB2P,EAAO,KAAO,IACfI,IACd/E,EAAIhG,EAAG,IAAIgG,CAAC,GACT,CAAE,EAAA7G,EAAG,EAAA6G,CAAAA,CACf,SACQjN,IAAQqR,GAAmBO,IAAS,EAAM,CAC/C,IAAMxL,EAAIa,EAAG,UAAU+F,EAAK,SAAS,EAAG/F,EAAG,KAAK,CAAC,EAC3CgG,EAAIhG,EAAG,UAAU+F,EAAK,SAAS/F,EAAG,MAAO,EAAIA,EAAG,KAAK,CAAC,EAC5D,MAAO,CAAE,EAAAb,EAAG,EAAA6G,CAAAA,CACf,KAEG,OAAM,IAAI,MAAM,mBAAmBjN,CAAG,0BAA0BoR,CAAa,wBAAwBC,CAAe,qBAAqB,CAEhJ,CACT,CAAK,EACKY,EAAiB5P,GAAQqL,GAAcwE,GAAmB7P,EAAKqK,EAAM,WAAW,CAAC,EACvF,SAASyF,EAAsBjW,EAAQ,CACnC,IAAMkW,EAAOZ,GAAevP,GAC5B,OAAO/F,EAASkW,CACnB,CACD,SAASC,EAAWnG,EAAG,CACnB,OAAOiG,EAAsBjG,CAAC,EAAIqF,EAAK,CAACrF,CAAC,EAAIA,CAChD,CAED,IAAMoG,EAAS,CAAC/V,EAAGgW,EAAMhS,IAAOoN,GAAmBpR,EAAE,MAAMgW,EAAMhS,CAAE,CAAC,EAIpE,MAAMiS,CAAU,CACZ,YAAYhM,EAAG0F,EAAGuG,EAAU,CACxB,KAAK,EAAIjM,EACT,KAAK,EAAI0F,EACT,KAAK,SAAWuG,EAChB,KAAK,eAAc,CACtB,CAED,OAAO,YAAY7U,EAAK,CACpB,IAAM2B,EAAImN,EAAM,YAChB,OAAA9O,EAAM2F,GAAY,mBAAoB3F,EAAK2B,EAAI,CAAC,EACzC,IAAIiT,EAAUF,EAAO1U,EAAK,EAAG2B,CAAC,EAAG+S,EAAO1U,EAAK2B,EAAG,EAAIA,CAAC,CAAC,CAChE,CAGD,OAAO,QAAQ3B,EAAK,CAChB,GAAM,CAAE,EAAA4I,EAAG,EAAA0F,CAAC,EAAKH,GAAI,MAAMxI,GAAY,MAAO3F,CAAG,CAAC,EAClD,OAAO,IAAI4U,EAAUhM,EAAG0F,CAAC,CAC5B,CACD,gBAAiB,CAEb,GAAI,CAACmB,EAAmB,KAAK,CAAC,EAC1B,MAAM,IAAI,MAAM,2BAA2B,EAC/C,GAAI,CAACA,EAAmB,KAAK,CAAC,EAC1B,MAAM,IAAI,MAAM,2BAA2B,CAClD,CACD,eAAeoF,EAAU,CACrB,OAAO,IAAID,EAAU,KAAK,EAAG,KAAK,EAAGC,CAAQ,CAChD,CACD,iBAAiBC,EAAS,CACtB,GAAM,CAAE,EAAAlM,EAAG,EAAA0F,EAAG,SAAUyG,CAAG,EAAK,KAC1BjW,EAAIkW,EAAcrP,GAAY,UAAWmP,CAAO,CAAC,EACvD,GAAIC,GAAO,MAAQ,CAAC,CAAC,EAAG,EAAG,EAAG,CAAC,EAAE,SAASA,CAAG,EACzC,MAAM,IAAI,MAAM,qBAAqB,EACzC,IAAME,EAAOF,IAAQ,GAAKA,IAAQ,EAAInM,EAAIkG,EAAM,EAAIlG,EACpD,GAAIqM,GAAQ5L,EAAG,MACX,MAAM,IAAI,MAAM,4BAA4B,EAChD,IAAM6L,EAAUH,EAAM,EAAkB,KAAP,KAC3BI,EAAI/E,EAAM,QAAQ8E,EAASb,EAAcY,CAAI,CAAC,EAC9CG,EAAKvB,EAAKoB,CAAI,EACdI,EAAK1B,EAAK,CAAC7U,EAAIsW,CAAE,EACjBE,GAAK3B,EAAKrF,EAAI8G,CAAE,EAChBnM,EAAImH,EAAM,KAAK,qBAAqB+E,EAAGE,EAAIC,EAAE,EACnD,GAAI,CAACrM,EACD,MAAM,IAAI,MAAM,mBAAmB,EACvC,OAAAA,EAAE,eAAc,EACTA,CACV,CAED,UAAW,CACP,OAAOsL,EAAsB,KAAK,CAAC,CACtC,CACD,YAAa,CACT,OAAO,KAAK,SAAQ,EAAK,IAAIK,EAAU,KAAK,EAAGjB,EAAK,CAAC,KAAK,CAAC,EAAG,KAAK,QAAQ,EAAI,IAClF,CAED,eAAgB,CACZ,OAAO4B,GAAc,KAAK,SAAQ,CAAE,CACvC,CACD,UAAW,CACP,OAAOpH,GAAI,WAAW,CAAE,EAAG,KAAK,EAAG,EAAG,KAAK,CAAC,CAAE,CACjD,CAED,mBAAoB,CAChB,OAAOoH,GAAc,KAAK,aAAY,CAAE,CAC3C,CACD,cAAe,CACX,OAAOlB,EAAc,KAAK,CAAC,EAAIA,EAAc,KAAK,CAAC,CACtD,CACJ,CACD,IAAMmB,EAAQ,CACV,kBAAkB9E,EAAY,CAC1B,GAAI,CACA,OAAAf,EAAuBe,CAAU,EAC1B,EACV,MACa,CACV,MAAO,EACV,CACJ,EACD,uBAAwBf,EAKxB,iBAAkB,IAAM,CACpB,IAAM/M,EAAS6S,GAAqB3G,EAAM,CAAC,EAC3C,OAAO4G,GAAmB5G,EAAM,YAAYlM,CAAM,EAAGkM,EAAM,CAAC,CAC/D,EASD,WAAWpC,EAAa,EAAGsC,EAAQoB,EAAM,KAAM,CAC3C,OAAApB,EAAM,eAAetC,CAAU,EAC/BsC,EAAM,SAAS,OAAO,CAAC,CAAC,EACjBA,CACV,CACT,EAOI,SAAS2G,EAAajF,EAAYyC,EAAe,GAAM,CACnD,OAAO/C,EAAM,eAAeM,CAAU,EAAE,WAAWyC,CAAY,CAClE,CAID,SAASyC,EAAUrR,EAAM,CACrB,IAAMhF,EAAMsQ,GAAWtL,CAAI,EACrBrE,EAAM,OAAOqE,GAAS,SACtBnC,GAAO7C,GAAOW,IAAQqE,EAAK,OACjC,OAAIhF,EACO6C,IAAQoR,GAAiBpR,IAAQqR,EACxCvT,EACOkC,IAAQ,EAAIoR,GAAiBpR,IAAQ,EAAIqR,EAChDlP,aAAgB6L,CAGvB,CAWD,SAASyF,EAAgBC,EAAUC,EAAS5C,EAAe,GAAM,CAC7D,GAAIyC,EAAUE,CAAQ,EAClB,MAAM,IAAI,MAAM,+BAA+B,EACnD,GAAI,CAACF,EAAUG,CAAO,EAClB,MAAM,IAAI,MAAM,+BAA+B,EAEnD,OADU3F,EAAM,QAAQ2F,CAAO,EACtB,SAASpG,EAAuBmG,CAAQ,CAAC,EAAE,WAAW3C,CAAY,CAC9E,CAKD,IAAM6C,EAAWlH,EAAM,UACnB,SAAUpQ,EAAO,CAGb,IAAM+F,EAAMsL,GAAmBrR,CAAK,EAC9BuX,EAAQvX,EAAM,OAAS,EAAIoQ,EAAM,WACvC,OAAOmH,EAAQ,EAAIxR,GAAO,OAAOwR,CAAK,EAAIxR,CACtD,EACUuQ,EAAgBlG,EAAM,eACxB,SAAUpQ,EAAO,CACb,OAAOiV,EAAKqC,EAAStX,CAAK,CAAC,CACvC,EAEUwX,EAAaC,GAAWrH,EAAM,UAAU,EAI9C,SAASsH,EAAW3R,EAAK,CACrB,GAAI,OAAOA,GAAQ,SACf,MAAM,IAAI,MAAM,iBAAiB,EACrC,GAAI,EAAEL,IAAOK,GAAOA,EAAMyR,GACtB,MAAM,IAAI,MAAM,uBAAuBpH,EAAM,UAAU,EAAE,EAE7D,OAAOwF,GAAmB7P,EAAKqK,EAAM,WAAW,CACnD,CAMD,SAASuH,EAAQvB,EAASpE,EAAYxG,EAAOoM,EAAgB,CACzD,GAAI,CAAC,YAAa,WAAW,EAAE,KAAM1P,GAAMA,KAAKsD,CAAI,EAChD,MAAM,IAAI,MAAM,qCAAqC,EACzD,GAAM,CAAE,KAAArL,EAAM,YAAAmC,CAAa,EAAG8N,EAC1B,CAAE,KAAAyH,EAAM,QAAAC,EAAS,aAAcC,CAAG,EAAKvM,EACvCqM,GAAQ,OACRA,EAAO,IACXzB,EAAUnP,GAAY,UAAWmP,CAAO,EACpC0B,IACA1B,EAAUnP,GAAY,oBAAqB9G,EAAKiW,CAAO,CAAC,GAI5D,IAAM4B,EAAQ1B,EAAcF,CAAO,EAC7BvK,EAAIoF,EAAuBe,CAAU,EACrCiG,EAAW,CAACP,EAAW7L,CAAC,EAAG6L,EAAWM,CAAK,CAAC,EAElD,GAAID,GAAO,MAAQA,IAAQ,GAAO,CAE9B,IAAM3Q,EAAI2Q,IAAQ,GAAOzV,EAAYqI,EAAG,KAAK,EAAIoN,EACjDE,EAAS,KAAKhR,GAAY,eAAgBG,CAAC,CAAC,CAC/C,CACD,IAAMiB,GAAOmI,GAAe,GAAGyH,CAAQ,EACjC9N,EAAI6N,EAEV,SAASE,GAAMC,EAAQ,CAEnB,IAAMjQ,GAAIoP,EAASa,CAAM,EACzB,GAAI,CAACpH,EAAmB7I,EAAC,EACrB,OACJ,IAAMkQ,GAAKjD,EAAKjN,EAAC,EACX+B,EAAIyH,EAAM,KAAK,SAASxJ,EAAC,EAAE,SAAA,EAC3BgC,GAAI+K,EAAKhL,EAAE,CAAC,EAClB,GAAIC,KAAMxE,GACN,OAIJ,IAAMkK,GAAIqF,EAAKmD,GAAKnD,EAAK9K,EAAID,GAAI2B,CAAC,CAAC,EACnC,GAAI+D,KAAMlK,GACN,OACJ,IAAIyQ,IAAYlM,EAAE,IAAMC,GAAI,EAAI,GAAK,OAAOD,EAAE,EAAItE,EAAG,EACjD0S,GAAQzI,GACZ,OAAIiI,GAAQhC,EAAsBjG,EAAC,IAC/ByI,GAAQtC,EAAWnG,EAAC,EACpBuG,IAAY,GAET,IAAID,EAAUhM,GAAGmO,GAAOlC,EAAQ,CAC1C,CACD,MAAO,CAAE,KAAA9N,GAAM,MAAA6P,EAAAA,CAClB,CACD,IAAMN,EAAiB,CAAE,KAAMxH,EAAM,KAAM,QAAS,EAAA,EAC9CkI,EAAiB,CAAE,KAAMlI,EAAM,KAAM,QAAS,EAAA,EAcpD,SAASmI,EAAKnC,EAASoC,EAAShN,EAAOoM,EAAgB,CACnD,GAAM,CAAE,KAAAvP,EAAM,MAAA6P,CAAO,EAAGP,EAAQvB,EAASoC,EAAShN,CAAI,EAChD7G,EAAIyL,EAEV,OADaqI,GAAkB9T,EAAE,KAAK,UAAWA,EAAE,YAAaA,EAAE,IAAI,EAC1D0D,EAAM6P,CAAK,CAC1B,CAEDxG,EAAM,KAAK,eAAe,CAAC,EAe3B,SAASgH,EAAOC,EAAWvC,EAASwC,EAAWpN,EAAO8M,EAAgB,CR72B1E,IAAAO,EQ82BQ,IAAMC,EAAKH,EAGX,GAFAvC,EAAUnP,GAAY,UAAWmP,CAAO,EACxCwC,EAAY3R,GAAY,YAAa2R,CAAS,EAC1C,WAAYpN,EACZ,MAAM,IAAI,MAAM,oCAAoC,EACxD,GAAM,CAAE,KAAAqM,EAAM,QAAAC,CAAS,EAAGtM,EACtBuN,EACA1O,EACJ,GAAI,CACA,GAAI,OAAOyO,GAAO,UAAY3H,GAAW2H,CAAE,EAGvC,GAAI,CACAC,EAAO7C,EAAU,QAAQ4C,CAAE,CAC9B,OACME,EAAU,CACb,GAAI,EAAEA,aAAoBvJ,GAAI,KAC1B,MAAMuJ,EACVD,EAAO7C,EAAU,YAAY4C,CAAE,CAClC,SAEI,OAAOA,GAAO,UAAY,OAAOA,EAAG,GAAM,UAAY,OAAOA,EAAG,GAAM,SAAU,CACrF,GAAM,CAAE,EAAA5O,EAAG,EAAA0F,EAAG,EAAGkJ,EACjBC,EAAO,IAAI7C,EAAUhM,EAAG0F,EAAC,CAC5B,KAEG,OAAM,IAAI,MAAM,OAAO,EAE3BvF,EAAIqH,EAAM,QAAQkH,CAAS,CAC9B,OACMK,EAAO,CACV,GAAIA,EAAM,UAAY,QAClB,MAAM,IAAI,MAAM,gEAAgE,EACpF,MAAO,EACV,CACD,GAAIpB,GAAQkB,EAAK,SAAU,EACvB,MAAO,GACPjB,IACA1B,EAAUhG,EAAM,KAAKgG,CAAO,GAChC,GAAM,CAAE,EAAAlM,EAAG,EAAA0F,EAAG,EAAGmJ,EACX3Y,EAAIkW,EAAcF,CAAO,EACzB8C,GAAK/D,EAAKvF,EAAC,EACX+G,EAAK1B,EAAK7U,EAAI8Y,EAAE,EAChBtC,GAAK3B,EAAK/K,EAAIgP,EAAE,EAChBzC,IAAIoC,EAAAnH,EAAM,KAAK,qBAAqBrH,EAAGsM,EAAIC,EAAE,IAAzC,KAAA,OAAAiC,EAA4C,SAAA,EACtD,OAAKpC,GAEKxB,EAAKwB,GAAE,CAAC,IACLvM,EAFF,EAGd,CACD,MAAO,CACH,MAAAkG,EACA,aAAA6G,EACA,gBAAAE,EACA,KAAAoB,EACA,OAAAG,EACA,gBAAiBhH,EACjB,UAAAwE,EACA,MAAAY,CACR,CACA,CCv6BO,IAAMqC,GAAN,cAAmBnX,EAAK,CAC3B,YAAY7B,EAAMiZ,EAAM,CACpB,MAAA,EACA,KAAK,SAAW,GAChB,KAAK,UAAY,GACjBC,GAAWlZ,CAAI,EACf,IAAMkN,EAAM5L,GAAQ2X,CAAI,EAExB,GADA,KAAK,MAAQjZ,EAAK,OAAA,EACd,OAAO,KAAK,MAAM,QAAW,WAC7B,MAAM,IAAI,MAAM,qDAAqD,EACzE,KAAK,SAAW,KAAK,MAAM,SAC3B,KAAK,UAAY,KAAK,MAAM,UAC5B,IAAMmD,EAAW,KAAK,SAChBvB,EAAM,IAAI,WAAWuB,CAAQ,EAEnCvB,EAAI,IAAIsL,EAAI,OAAS/J,EAAWnD,EAAK,OAAQ,EAAC,OAAOkN,CAAG,EAAE,OAAQ,EAAGA,CAAG,EACxE,QAASlM,EAAI,EAAGA,EAAIY,EAAI,OAAQZ,IAC5BY,EAAIZ,CAAC,GAAK,GACd,KAAK,MAAM,OAAOY,CAAG,EAErB,KAAK,MAAQ5B,EAAK,OAAA,EAElB,QAASgB,EAAI,EAAGA,EAAIY,EAAI,OAAQZ,IAC5BY,EAAIZ,CAAC,GAAK,IACd,KAAK,MAAM,OAAOY,CAAG,EACrBA,EAAI,KAAK,CAAC,CACb,CACD,OAAOuX,EAAK,CACRC,OAAAA,GAAa,IAAI,EACjB,KAAK,MAAM,OAAOD,CAAG,EACd,IACV,CACD,WAAW7Y,EAAK,CACZ8Y,GAAa,IAAI,EACjBC,GAAY/Y,EAAK,KAAK,SAAS,EAC/B,KAAK,SAAW,GAChB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,MAAM,OAAOA,CAAG,EACrB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,QAAO,CACf,CACD,QAAS,CACL,IAAMA,EAAM,IAAI,WAAW,KAAK,MAAM,SAAS,EAC/C,OAAA,KAAK,WAAWA,CAAG,EACZA,CACV,CACD,WAAWwD,EAAI,CAEXA,IAAOA,EAAK,OAAO,OAAO,OAAO,eAAe,IAAI,EAAG,CAAE,CAAA,GACzD,GAAM,CAAE,MAAAwV,EAAO,MAAAC,EAAO,SAAAvV,EAAU,UAAAC,EAAW,SAAAd,EAAU,UAAAC,CAAW,EAAG,KACnE,OAAAU,EAAKA,EACLA,EAAG,SAAWE,EACdF,EAAG,UAAYG,EACfH,EAAG,SAAWX,EACdW,EAAG,UAAYV,EACfU,EAAG,MAAQwV,EAAM,WAAWxV,EAAG,KAAK,EACpCA,EAAG,MAAQyV,EAAM,WAAWzV,EAAG,KAAK,EAC7BA,CACV,CACD,SAAU,CACN,KAAK,UAAY,GACjB,KAAK,MAAM,QAAA,EACX,KAAK,MAAM,QAAA,CACd,CACL,EAOa0V,GAAO,CAACxZ,EAAMkN,EAAKuM,IAAY,IAAIT,GAAKhZ,EAAMkN,CAAG,EAAE,OAAOuM,CAAO,EAAE,OAAM,EACtFD,GAAK,OAAS,CAACxZ,EAAMkN,IAAQ,IAAI8L,GAAKhZ,EAAMkN,CAAG,ECtExC,SAASwM,GAAQ1Z,EAAM,CAC1B,MAAO,CACH,KAAAA,EACA,KAAM,CAACkN,KAAQyM,IAASH,GAAKxZ,EAAMkN,EAAK1L,GAAY,GAAGmY,CAAI,CAAC,EAC5D,YAAAxX,EACR,CACA,CACO,SAASyX,GAAYlF,EAAUmF,EAAS,CAC3C,IAAMC,EAAU9Z,GAASyU,GAAY,CAAE,GAAGC,EAAU,GAAGgF,GAAQ1Z,CAAI,CAAC,CAAE,EACtE,OAAO,OAAO,OAAO,CAAE,GAAG8Z,EAAOD,CAAO,EAAG,OAAAC,CAAM,CAAE,CACvD,CCPA,IAAMC,GAAa,OAAO,oEAAoE,EACxFC,GAAa,OAAO,oEAAoE,EACxFxU,GAAM,OAAO,CAAC,EACdC,GAAM,OAAO,CAAC,EACdwU,GAAa,CAACra,EAAGE,KAAOF,EAAIE,EAAI2F,IAAO3F,EAK7C,SAASoa,GAAQ1J,EAAG,CAChB,IAAMtG,EAAI6P,GAEJ9Q,EAAM,OAAO,CAAC,EAAGkR,EAAM,OAAO,CAAC,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAErEC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EACtDC,EAAMjK,EAAIA,EAAIA,EAAKtG,EACnBsI,EAAMiI,EAAKA,EAAKjK,EAAKtG,EACrBwQ,EAAMhR,GAAK8I,EAAIvJ,EAAKiB,CAAC,EAAIsI,EAAMtI,EAC/ByQ,EAAMjR,GAAKgR,EAAIzR,EAAKiB,CAAC,EAAIsI,EAAMtI,EAC/B0Q,EAAOlR,GAAKiR,EAAIlV,GAAKyE,CAAC,EAAIuQ,EAAMvQ,EAChC2Q,EAAOnR,GAAKkR,EAAKR,EAAMlQ,CAAC,EAAI0Q,EAAO1Q,EACnC4Q,EAAOpR,GAAKmR,EAAKR,EAAMnQ,CAAC,EAAI2Q,EAAO3Q,EACnC6Q,EAAOrR,GAAKoR,EAAKP,EAAMrQ,CAAC,EAAI4Q,EAAO5Q,EACnC8Q,EAAQtR,GAAKqR,EAAKP,EAAMtQ,CAAC,EAAI6Q,EAAO7Q,EACpC+Q,EAAQvR,GAAKsR,EAAMT,EAAMrQ,CAAC,EAAI4Q,EAAO5Q,EACrCgR,EAAQxR,GAAKuR,EAAMhS,EAAKiB,CAAC,EAAIsI,EAAMtI,EACnC2I,EAAMnJ,GAAKwR,EAAMZ,EAAMpQ,CAAC,EAAI2Q,EAAO3Q,EACnCU,EAAMlB,GAAKmJ,EAAIsH,EAAKjQ,CAAC,EAAIuQ,EAAMvQ,EAC/BO,EAAOf,GAAKkB,EAAInF,GAAKyE,CAAC,EAC5B,GAAI,CAACM,GAAG,IAAIA,GAAG,IAAIC,CAAI,EAAG+F,CAAC,EACvB,MAAM,IAAI,MAAM,yBAAyB,EAC7C,OAAO/F,CACX,CACA,IAAMD,GAAK4B,GAAM2N,GAAY,OAAW,OAAW,CAAE,KAAMG,EAAO,CAAE,EACvDiB,GAAYvB,GAAY,CACjC,EAAG,OAAO,CAAC,EACX,EAAG,OAAO,CAAC,EACX,GAAApP,GACA,EAAGwP,GAEH,GAAI,OAAO,+EAA+E,EAC1F,GAAI,OAAO,+EAA+E,EAC1F,EAAG,OAAO,CAAC,EACX,KAAM,GAON,KAAM,CACF,KAAM,OAAO,oEAAoE,EACjF,YAAcjS,GAAM,CAChB,IAAMrI,EAAIsa,GACJoB,EAAK,OAAO,oCAAoC,EAChDC,EAAK,CAAC7V,GAAM,OAAO,oCAAoC,EACvD8V,EAAK,OAAO,qCAAqC,EACjDb,EAAKW,EACLG,EAAY,OAAO,qCAAqC,EACxDxQ,EAAKkP,GAAWQ,EAAK1S,EAAGrI,CAAC,EACzB8b,EAAKvB,GAAW,CAACoB,EAAKtT,EAAGrI,CAAC,EAC5B0T,EAAK/J,GAAItB,EAAIgD,EAAKqQ,EAAKI,EAAKF,EAAI5b,CAAC,EACjC4T,EAAKjK,GAAI,CAAC0B,EAAKsQ,EAAKG,EAAKf,EAAI/a,CAAC,EAC5ByT,EAAQC,EAAKmI,EACblI,EAAQC,EAAKiI,EAKnB,GAJIpI,IACAC,EAAK1T,EAAI0T,GACTC,IACAC,EAAK5T,EAAI4T,GACTF,EAAKmI,GAAajI,EAAKiI,EACvB,MAAM,IAAI,MAAM,uCAAyCxT,CAAC,EAE9D,MAAO,CAAE,MAAAoL,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAC,CAAE,CAChC,CACJ,CACL,EAAGhO,EAAM,EAGHC,GAAM,OAAO,CAAC,EACdkW,GAAM9R,GAAM,OAAOA,GAAM,UAAYpE,GAAMoE,GAAKA,EAAIoQ,GACpDlP,GAAMlB,GAAM,OAAOA,GAAM,UAAYpE,GAAMoE,GAAKA,EAAIqQ,GAEpD0B,GAAuB,CAAA,EAC7B,SAASC,GAAWC,KAAQC,EAAU,CAClC,IAAIC,EAAOJ,GAAqBE,CAAG,EACnC,GAAIE,IAAS,OAAW,CACpB,IAAMC,EAAOzW,GAAO,WAAW,KAAKsW,EAAM5Y,GAAMA,EAAE,WAAW,CAAC,CAAC,CAAC,EAChE8Y,EAAOta,GAAYua,EAAMA,CAAI,EAC7BL,GAAqBE,CAAG,EAAIE,CAC/B,CACD,OAAOxW,GAAO9D,GAAYsa,EAAM,GAAGD,CAAQ,CAAC,CAChD,CAEA,IAAMG,GAAgB7L,GAAUA,EAAM,WAAW,EAAI,EAAE,MAAM,CAAC,EACxD8L,GAAYvc,GAAMiH,GAAgBjH,EAAG,EAAE,EACvCwc,GAAQvS,GAAMN,GAAIM,EAAGoQ,EAAU,EAC/BjF,GAAQnL,GAAMN,GAAIM,EAAGqQ,EAAU,EAC/BzI,GAAQ4J,GAAU,gBAClBgB,GAAU,CAAC/R,EAAGxK,EAAGE,IAAMyR,GAAM,KAAK,qBAAqBnH,EAAGxK,EAAGE,CAAC,EAEpE,SAASsc,GAAoBC,EAAM,CAC/B,IAAIC,EAAKnB,GAAU,MAAM,uBAAuBkB,CAAI,EAChD5Q,EAAI8F,GAAM,eAAe+K,CAAE,EAE/B,MAAO,CAAE,OADM7Q,EAAE,SAAQ,EAAK6Q,EAAKxH,GAAK,CAACwH,CAAE,EAClB,MAAON,GAAavQ,CAAC,CAAA,CAClD,CAKA,SAAS8Q,GAAO5S,EAAG,CACf,GAAI,CAAC8R,GAAG9R,CAAC,EACL,MAAM,IAAI,MAAM,uBAAuB,EAC3C,IAAM6S,EAAKN,GAAKvS,EAAIA,CAAC,EACf3G,EAAIkZ,GAAKM,EAAK7S,EAAI,OAAO,CAAC,CAAC,EAC7B6G,EAAI0J,GAAQlX,CAAC,EACbwN,EAAI/K,KAAQF,KACZiL,EAAI0L,GAAK,CAAC1L,CAAC,GACf,IAAM/E,EAAI,IAAI8F,GAAM5H,EAAG6G,EAAGhL,EAAG,EAC7B,OAAAiG,EAAE,eAAc,EACTA,CACX,CAIA,SAASgR,MAAaC,EAAM,CACxB,OAAO5H,GAAKrO,GAAgBkV,GAAW,oBAAqB,GAAGe,CAAI,CAAC,CAAC,CACzE,CAIA,SAASC,GAAoB9K,EAAY,CACrC,OAAOuK,GAAoBvK,CAAU,EAAE,KAC3C,CAKA,SAAS+K,GAAYnD,EAAS5H,EAAYgL,EAAU1a,GAAY,EAAE,EAAG,CACjE,IAAM6H,EAAIlD,GAAY,UAAW2S,CAAO,EAClC,CAAE,MAAOjI,EAAI,OAAQ9F,CAAAA,EAAM0Q,GAAoBvK,CAAU,EACzDjS,EAAIkH,GAAY,UAAW+V,EAAS,EAAE,EACtCC,EAAIb,GAASvQ,EAAIjF,GAAgBkV,GAAW,cAAe/b,CAAC,CAAC,CAAC,EAC9Dmd,EAAOpB,GAAW,gBAAiBmB,EAAGtL,EAAIxH,CAAC,EAC3CgT,EAAKlI,GAAKrO,GAAgBsW,CAAI,CAAC,EACrC,GAAIC,IAAOzX,GACP,MAAM,IAAI,MAAM,wBAAwB,EAC5C,GAAM,CAAE,MAAO0X,EAAI,OAAQlV,CAAAA,EAAMqU,GAAoBY,CAAE,EACjD/V,EAAIwV,GAAUQ,EAAIzL,EAAIxH,CAAC,EACvB2F,EAAM,IAAI,WAAW,EAAE,EAI7B,GAHAA,EAAI,IAAIsN,EAAI,CAAC,EACbtN,EAAI,IAAIsM,GAASnH,GAAK/M,EAAId,EAAIyE,CAAC,CAAC,EAAG,EAAE,EAEjC,CAACwR,GAAcvN,EAAK3F,EAAGwH,CAAE,EACzB,MAAM,IAAI,MAAM,kCAAkC,EACtD,OAAO7B,CACX,CAKA,SAASuN,GAAc1E,EAAWiB,EAAShB,EAAW,CAClD,IAAM9I,EAAM7I,GAAY,YAAa0R,EAAW,EAAE,EAC5CxO,EAAIlD,GAAY,UAAW2S,CAAO,EAClC0D,EAAMrW,GAAY,YAAa2R,EAAW,EAAE,EAClD,GAAI,CACA,IAAMvO,EAAIqS,GAAO9V,GAAgB0W,CAAG,CAAC,EAC/BpT,EAAItD,GAAgBkJ,EAAI,SAAS,EAAG,EAAE,CAAC,EAC7C,GAAI,CAAC8L,GAAG1R,CAAC,EACL,MAAO,GACX,IAAM0F,EAAIhJ,GAAgBkJ,EAAI,SAAS,GAAI,EAAE,CAAC,EAC9C,GAAI,CAAC9E,GAAG4E,CAAC,EACL,MAAO,GACX,IAAMxI,EAAIwV,GAAUR,GAASlS,CAAC,EAAGiS,GAAa9R,CAAC,EAAGF,CAAC,EAC7CsM,EAAI6F,GAAQjS,EAAGuF,EAAGqF,GAAK,CAAC7N,CAAC,CAAC,EAChC,MAAI,EAAA,CAACqP,GAAK,CAACA,EAAE,SAAU,GAAIA,EAAE,SAAA,EAAW,IAAMvM,EAGjD,MACa,CACV,MAAO,EACV,CACL,CACO,IAAMqT,GAAkC,CAC3C,aAAcT,GACd,KAAMC,GACN,OAAQM,GACR,MAAO,CACH,iBAAkB/B,GAAU,MAAM,iBAClC,OAAAoB,GACA,aAAAP,GACA,gBAAArV,GACA,gBAAAF,GACA,WAAAkV,GACA,IAAAtS,EACH,CACL,EC4OO,IClbDgU,GAAc,IAAI,YAEjB,SAASC,GAAOC,EAAmB,CACxC,OAAOC,GAAWC,GAAQJ,GAAY,OAAOE,CAAC,CAAC,CAAC,CAClD,CAQO,IAAMG,GAAmB,CAC9B,KAAM,CAACH,EAAWI,IAChBH,GAAWI,GAAS,KAAKL,EAAGI,CAAM,CAAC,EACrC,OAAQC,GAAS,OACjB,aAAeD,GAAmBH,GAAWI,GAAS,aAAaD,CAAM,CAAC,CAC5E,EAGO,SAASE,GAAaF,EAAwB,CAC5C,OAAAD,GAAQ,aAAaC,CAAM,CACpC,CAGO,SAASG,GAAaC,EAAoC,CACzD,IAAAC,EAAa,KAAK,UAAU,CAChC,EACAD,EAAM,OACNA,EAAM,WACNA,EAAM,KACNA,EAAM,KACNA,EAAM,OAAA,CACP,EACD,OAAOT,GAAOU,CAAU,CAC1B,CAQO,SAASC,GAAOC,EAA6B,CAC9C,GAAA,CACK,OAAAC,GAAQ,OAAOD,EAAM,IAAKE,GAAaF,CAAK,EAAGA,EAAM,MAAM,CAAA,OAC3DG,EAAK,CACJ,OAAA,QAAA,KAAK,gDAAiDA,CAAG,EAC1D,EACT,CACF,CEhDO,IAAMC,GAA0B,MAAOC,GAC5CC,GAAOD,CAAK,EGTd,SAASE,GAAOC,EAAS,CACvB,GAAI,CAAC,OAAO,cAAcA,CAAC,GAAKA,EAAI,EAAG,MAAM,IAAI,MAAM,2BAA2BA,CAAC,EAAE,CACvF,CAMA,SAASC,GAAMC,KAA8BC,EAAiB,CAC5D,GAAI,EAAED,aAAa,YAAa,MAAM,IAAI,MAAM,qBAAqB,EACrE,GAAIC,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAASD,EAAE,MAAM,EAClD,MAAM,IAAI,MAAM,iCAAiCC,CAAO,mBAAmBD,EAAE,MAAM,EAAE,CACzF,CAQA,SAASE,GAAKA,EAAU,CACtB,GAAI,OAAOA,GAAS,YAAc,OAAOA,EAAK,QAAW,WACvD,MAAM,IAAI,MAAM,iDAAiD,EACnEC,GAAOD,EAAK,SAAS,EACrBC,GAAOD,EAAK,QAAQ,CACtB,CAEA,SAASE,GAAOC,EAAeC,EAAgB,GAAI,CACjD,GAAID,EAAS,UAAW,MAAM,IAAI,MAAM,kCAAkC,EAC1E,GAAIC,GAAiBD,EAAS,SAAU,MAAM,IAAI,MAAM,uCAAuC,CACjG,CACA,SAASE,GAAOC,EAAUH,EAAa,CACrCN,GAAMS,CAAG,EACT,IAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACf,MAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE,CAElF,CClCO,IAAMC,GACX,OAAO,YAAe,UAAY,WAAY,WAAa,WAAW,OAAS,OCUjF,IAAMC,GAAOC,GAA4BA,aAAa,WAO/C,IAAMC,GAAcC,GACzB,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAG5CC,GAAO,CAACC,EAAcC,IAAmBD,GAAS,GAAKC,EAAWD,IAASC,EAI3EC,GAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAChF,GAAI,CAACA,GAAM,MAAM,IAAI,MAAM,6CAA6C,EA6DlE,SAAUC,GAAYC,EAAW,CACrC,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EAC7F,OAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAOA,CAAG,CAAC,CACrD,CAQM,SAAUC,GAAQC,EAAW,CAEjC,GADI,OAAOA,GAAS,WAAUA,EAAOH,GAAYG,CAAI,GACjD,CAACC,GAAID,CAAI,EAAG,MAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE,EACzE,OAAOA,CACT,CAKM,SAAUE,MAAeC,EAAoB,CACjD,IAAMC,EAAI,IAAI,WAAWD,EAAO,OAAO,CAACE,EAAKC,IAAMD,EAAMC,EAAE,OAAQ,CAAC,CAAC,EACjEC,EAAM,EACV,OAAAJ,EAAO,QAASG,GAAK,CACnB,GAAI,CAACL,GAAIK,CAAC,EAAG,MAAM,IAAI,MAAM,qBAAqB,EAClDF,EAAE,IAAIE,EAAGC,CAAG,EACZA,GAAOD,EAAE,MACX,CAAC,EACMF,CACT,CAGM,IAAgBI,GAAhB,KAAoB,CAsBxB,OAAK,CACH,OAAO,KAAK,WAAU,CACxB,GAcIC,GAAQ,CAAA,EAAG,SAcX,SAAUC,GAAmCC,EAAuB,CACxE,IAAMC,EAASC,GAA2BF,EAAQ,EAAG,OAAOG,GAAQD,CAAG,CAAC,EAAE,OAAM,EAC1EE,EAAMJ,EAAQ,EACpB,OAAAC,EAAM,UAAYG,EAAI,UACtBH,EAAM,SAAWG,EAAI,SACrBH,EAAM,OAAS,IAAMD,EAAQ,EACtBC,CACT,CA2BM,SAAUI,GAAYC,EAAc,GAAE,CAC1C,GAAIC,IAAU,OAAOA,GAAO,iBAAoB,WAC9C,OAAOA,GAAO,gBAAgB,IAAI,WAAWD,CAAW,CAAC,EAE3D,MAAM,IAAI,MAAM,wCAAwC,CAC1D,CClNA,SAASE,GAAaC,EAAgBC,EAAoBC,EAAeC,EAAa,CACpF,GAAI,OAAOH,EAAK,cAAiB,WAAY,OAAOA,EAAK,aAAaC,EAAYC,EAAOC,CAAI,EAC7F,IAAMC,EAAO,OAAO,EAAE,EAChBC,EAAW,OAAO,UAAU,EAC5BC,EAAK,OAAQJ,GAASE,EAAQC,CAAQ,EACtCE,EAAK,OAAOL,EAAQG,CAAQ,EAC5BG,EAAIL,EAAO,EAAI,EACfM,EAAIN,EAAO,EAAI,EACrBH,EAAK,UAAUC,EAAaO,EAAGF,EAAIH,CAAI,EACvCH,EAAK,UAAUC,EAAaQ,EAAGF,EAAIJ,CAAI,CACzC,CAGM,IAAgBO,GAAhB,cAAgDC,EAAO,CAc3D,YACWC,EACFC,EACEC,EACAX,EAAa,CAEtB,MAAK,EALI,KAAA,SAAAS,EACF,KAAA,UAAAC,EACE,KAAA,UAAAC,EACA,KAAA,KAAAX,EATD,KAAA,SAAW,GACX,KAAA,OAAS,EACT,KAAA,IAAM,EACN,KAAA,UAAY,GASpB,KAAK,OAAS,IAAI,WAAWS,CAAQ,EACrC,KAAK,KAAOG,GAAW,KAAK,MAAM,CACpC,CACA,OAAOC,EAAW,CAChBC,GAAO,IAAI,EACX,GAAM,CAAE,KAAAjB,EAAM,OAAAkB,EAAQ,SAAAN,CAAQ,EAAK,KACnCI,EAAOG,GAAQH,CAAI,EACnB,IAAMI,EAAMJ,EAAK,OACjB,QAASK,EAAM,EAAGA,EAAMD,GAAO,CAC7B,IAAME,EAAO,KAAK,IAAIV,EAAW,KAAK,IAAKQ,EAAMC,CAAG,EAEpD,GAAIC,IAASV,EAAU,CACrB,IAAMW,EAAWR,GAAWC,CAAI,EAChC,KAAOJ,GAAYQ,EAAMC,EAAKA,GAAOT,EAAU,KAAK,QAAQW,EAAUF,CAAG,EACzE,SAEFH,EAAO,IAAIF,EAAK,SAASK,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQV,IACf,KAAK,QAAQZ,EAAM,CAAC,EACpB,KAAK,IAAM,GAGf,YAAK,QAAUgB,EAAK,OACpB,KAAK,WAAU,EACR,IACT,CACA,WAAWQ,EAAe,CACxBP,GAAO,IAAI,EACXQ,GAAOD,EAAK,IAAI,EAChB,KAAK,SAAW,GAIhB,GAAM,CAAE,OAAAN,EAAQ,KAAAlB,EAAM,SAAAY,EAAU,KAAAT,CAAI,EAAK,KACrC,CAAE,IAAAkB,CAAG,EAAK,KAEdH,EAAOG,GAAK,EAAI,IAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,EAE5B,KAAK,UAAYT,EAAWS,IAC9B,KAAK,QAAQrB,EAAM,CAAC,EACpBqB,EAAM,GAGR,QAASK,EAAIL,EAAKK,EAAId,EAAUc,IAAKR,EAAOQ,CAAC,EAAI,EAIjD3B,GAAaC,EAAMY,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGT,CAAI,EAC9D,KAAK,QAAQH,EAAM,CAAC,EACpB,IAAM2B,EAAQZ,GAAWS,CAAG,EACtBJ,EAAM,KAAK,UAEjB,GAAIA,EAAM,EAAG,MAAM,IAAI,MAAM,6CAA6C,EAC1E,IAAMQ,EAASR,EAAM,EACfS,EAAQ,KAAK,IAAG,EACtB,GAAID,EAASC,EAAM,OAAQ,MAAM,IAAI,MAAM,oCAAoC,EAC/E,QAASH,EAAI,EAAGA,EAAIE,EAAQF,IAAKC,EAAM,UAAU,EAAID,EAAGG,EAAMH,CAAC,EAAGvB,CAAI,CACxE,CACA,QAAM,CACJ,GAAM,CAAE,OAAAe,EAAQ,UAAAL,CAAS,EAAK,KAC9B,KAAK,WAAWK,CAAM,EACtB,IAAMY,EAAMZ,EAAO,MAAM,EAAGL,CAAS,EACrC,YAAK,QAAO,EACLiB,CACT,CACA,WAAWC,EAAM,CACfA,IAAAA,EAAO,IAAK,KAAK,aACjBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,GAAM,CAAE,SAAAnB,EAAU,OAAAM,EAAQ,OAAAc,EAAQ,SAAAC,EAAU,UAAAC,EAAW,IAAAb,CAAG,EAAK,KAC/D,OAAAU,EAAG,OAASC,EACZD,EAAG,IAAMV,EACTU,EAAG,SAAWE,EACdF,EAAG,UAAYG,EACXF,EAASpB,GAAUmB,EAAG,OAAO,IAAIb,CAAM,EACpCa,CACT,GC7GF,IAAMI,GAAM,CAACC,EAAWC,EAAWC,IAAeF,EAAIC,EAAM,CAACD,EAAIE,EAE3DC,GAAM,CAACH,EAAWC,EAAWC,IAAeF,EAAIC,EAAMD,EAAIE,EAAMD,EAAIC,EAKpEE,GAA0B,IAAI,YAAY,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,WACrF,EAIKC,GAAoB,IAAI,YAAY,CACxC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WACrF,EAIKC,GAA2B,IAAI,YAAY,EAAE,EAC7CC,GAAN,cAAqBC,EAAY,CAY/B,aAAA,CACE,MAAM,GAAI,GAAI,EAAG,EAAK,EAVxB,KAAA,EAAIH,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,CAIZ,CACU,KAAG,CACX,GAAM,CAAE,EAAAI,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,CAChC,CAEU,IACRP,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAS,CAEtF,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,CACf,CACU,QAAQC,EAAgBC,EAAc,CAE9C,QAASC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EAAGZ,GAASa,CAAC,EAAIF,EAAK,UAAUC,EAAQ,EAAK,EACpF,QAASC,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,IAAMC,EAAMd,GAASa,EAAI,EAAE,EACrBE,EAAKf,GAASa,EAAI,CAAC,EACnBG,EAAKC,GAAKH,EAAK,CAAC,EAAIG,GAAKH,EAAK,EAAE,EAAKA,IAAQ,EAC7CI,EAAKD,GAAKF,EAAI,EAAE,EAAIE,GAAKF,EAAI,EAAE,EAAKA,IAAO,GACjDf,GAASa,CAAC,EAAKK,EAAKlB,GAASa,EAAI,CAAC,EAAIG,EAAKhB,GAASa,EAAI,EAAE,EAAK,EAGjE,GAAI,CAAE,EAAAV,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAASG,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAC3B,IAAMM,EAASF,GAAKV,EAAG,CAAC,EAAIU,GAAKV,EAAG,EAAE,EAAIU,GAAKV,EAAG,EAAE,EAC9Ca,EAAMV,EAAIS,EAAS1B,GAAIc,EAAGC,EAAGC,CAAC,EAAIX,GAASe,CAAC,EAAIb,GAASa,CAAC,EAAK,EAE/DQ,GADSJ,GAAKd,EAAG,CAAC,EAAIc,GAAKd,EAAG,EAAE,EAAIc,GAAKd,EAAG,EAAE,GAC/BN,GAAIM,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIc,EAAM,EACfd,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKiB,EAAKC,EAAM,EAGlBlB,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,CACjC,CACU,YAAU,CAClBV,GAAS,KAAK,CAAC,CACjB,CACA,SAAO,CACL,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B,KAAK,OAAO,KAAK,CAAC,CACpB,GAsBK,IAAMsB,GAAyBC,GAAgB,IAAM,IAAIC,EAAQ,ECnIxE,IAAAC,GAAA,GAAAC,GAAAD,GAAA,YAAAE,GAAA,WAAAC,GAAA,YAAAC,GAAA,WAAAC,GAAA,eAAAC,GAAA,oBAAAC,GAAA,oBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,GAAA,gBAAAC,GAAA,eAAAC,GAAA,eAAAC,GAAA,gBAAAC,GAAA,oBAAAC,GAAA,oBAAAC,GAAA,wBAAAC,GAAA,uBAAAC,GAAA,gBAAAC,GAAA,mBAAAC,KAKA,IAAMC,GAAM,OAAO,CAAC,EACdC,GAAM,OAAO,CAAC,EACdC,GAAM,OAAO,CAAC,EACdC,GAAOC,GAA4BA,aAAa,WAWhDC,GAAwB,MAAM,KAAK,CAAE,OAAQ,GAAG,EAAI,CAACC,EAAGC,IAC5DA,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,EAK3B,SAAUtB,GAAWuB,EAAiB,CAC1C,GAAI,CAACL,GAAIK,CAAK,EAAG,MAAM,IAAI,MAAM,qBAAqB,EAEtD,IAAIC,EAAM,GACV,QAASF,EAAI,EAAGA,EAAIC,EAAM,OAAQD,IAChCE,GAAOJ,GAAMG,EAAMD,CAAC,CAAC,EAEvB,OAAOE,CACT,CAEM,SAAUb,GAAoBc,EAAoB,CACtD,IAAMD,EAAMC,EAAI,SAAS,EAAE,EAC3B,OAAOD,EAAI,OAAS,EAAI,IAAIA,CAAG,GAAKA,CACtC,CAEM,SAAUhB,GAAYgB,EAAW,CACrC,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EAErF,OAAO,OAAOA,IAAQ,GAAK,IAAM,KAAKA,CAAG,EAAE,CAC7C,CAKM,SAAUjB,GAAWiB,EAAW,CACpC,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,4BAA8B,OAAOA,CAAG,EACrF,IAAME,EAAMF,EAAI,OAChB,GAAIE,EAAM,EAAG,MAAM,IAAI,MAAM,0DAA4DA,CAAG,EAC5F,IAAMC,EAAQ,IAAI,WAAWD,EAAM,CAAC,EACpC,QAASJ,EAAI,EAAGA,EAAIK,EAAM,OAAQL,IAAK,CACrC,IAAMM,EAAIN,EAAI,EACRO,EAAUL,EAAI,MAAMI,EAAGA,EAAI,CAAC,EAC5BE,EAAO,OAAO,SAASD,EAAS,EAAE,EACxC,GAAI,OAAO,MAAMC,CAAI,GAAKA,EAAO,EAAG,MAAM,IAAI,MAAM,uBAAuB,EAC3EH,EAAML,CAAC,EAAIQ,EAEb,OAAOH,CACT,CAGM,SAAU1B,GAAgBsB,EAAiB,CAC/C,OAAOf,GAAYR,GAAWuB,CAAK,CAAC,CACtC,CACM,SAAUrB,GAAgBqB,EAAiB,CAC/C,GAAI,CAACL,GAAIK,CAAK,EAAG,MAAM,IAAI,MAAM,qBAAqB,EACtD,OAAOf,GAAYR,GAAW,WAAW,KAAKuB,CAAK,EAAE,QAAO,CAAE,CAAC,CACjE,CAEM,SAAUd,GAAgBsB,EAAoBL,EAAW,CAC7D,OAAOnB,GAAWwB,EAAE,SAAS,EAAE,EAAE,SAASL,EAAM,EAAG,GAAG,CAAC,CACzD,CACM,SAAUhB,GAAgBqB,EAAoBL,EAAW,CAC7D,OAAOjB,GAAgBsB,EAAGL,CAAG,EAAE,QAAO,CACxC,CAEM,SAAUd,GAAmBmB,EAAkB,CACnD,OAAOxB,GAAWI,GAAoBoB,CAAC,CAAC,CAC1C,CAWM,SAAU1B,GAAY2B,EAAeR,EAAUS,EAAuB,CAC1E,IAAIC,EACJ,GAAI,OAAOV,GAAQ,SACjB,GAAI,CACFU,EAAM3B,GAAWiB,CAAG,QACbW,EAAG,CACV,MAAM,IAAI,MAAM,GAAGH,CAAK,mCAAmCR,CAAG,aAAaW,CAAC,EAAE,UAEvEjB,GAAIM,CAAG,EAGhBU,EAAM,WAAW,KAAKV,CAAG,MAEzB,OAAM,IAAI,MAAM,GAAGQ,CAAK,mCAAmC,EAE7D,IAAMN,EAAMQ,EAAI,OAChB,GAAI,OAAOD,GAAmB,UAAYP,IAAQO,EAChD,MAAM,IAAI,MAAM,GAAGD,CAAK,aAAaC,CAAc,eAAeP,CAAG,EAAE,EACzE,OAAOQ,CACT,CAKM,SAAU/B,MAAeiC,EAAoB,CACjD,IAAMC,EAAI,IAAI,WAAWD,EAAO,OAAO,CAACE,EAAKnB,IAAMmB,EAAMnB,EAAE,OAAQ,CAAC,CAAC,EACjEoB,EAAM,EACV,OAAAH,EAAO,QAASjB,GAAK,CACnB,GAAI,CAACD,GAAIC,CAAC,EAAG,MAAM,IAAI,MAAM,qBAAqB,EAClDkB,EAAE,IAAIlB,EAAGoB,CAAG,EACZA,GAAOpB,EAAE,MACX,CAAC,EACMkB,CACT,CAEM,SAAU/B,GAAWkC,EAAgBC,EAAc,CAEvD,GAAID,EAAG,SAAWC,EAAG,OAAQ,MAAO,GACpC,QAASnB,EAAI,EAAGA,EAAIkB,EAAG,OAAQlB,IAAK,GAAIkB,EAAGlB,CAAC,IAAMmB,EAAGnB,CAAC,EAAG,MAAO,GAChE,MAAO,EACT,CASM,SAAUT,GAAY6B,EAAW,CACrC,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EAC7F,OAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAOA,CAAG,CAAC,CACrD,CAQM,SAAU7C,GAAOkC,EAAS,CAC9B,IAAIL,EACJ,IAAKA,EAAM,EAAGK,EAAIhB,GAAKgB,IAAMf,GAAKU,GAAO,EAAE,CAC3C,OAAOA,CACT,CAOM,SAAU9B,GAAOmC,EAAWY,EAAW,CAC3C,OAAQZ,GAAK,OAAOY,CAAG,EAAK3B,EAC9B,CAKO,IAAMjB,GAAS,CAACgC,EAAWY,EAAaC,IACtCb,GAAMa,EAAQ5B,GAAMD,KAAQ,OAAO4B,CAAG,EAOlC7C,GAAWiC,IAAed,IAAO,OAAOc,EAAI,CAAC,GAAKf,GAIzD6B,GAAOC,GAAe,IAAI,WAAWA,CAAI,EACzCC,GAAQC,GAAa,WAAW,KAAKA,CAAG,EASxC,SAAU5C,GACd6C,EACAC,EACAC,EAAkE,CAElE,GAAI,OAAOF,GAAY,UAAYA,EAAU,EAAG,MAAM,IAAI,MAAM,0BAA0B,EAC1F,GAAI,OAAOC,GAAa,UAAYA,EAAW,EAAG,MAAM,IAAI,MAAM,2BAA2B,EAC7F,GAAI,OAAOC,GAAW,WAAY,MAAM,IAAI,MAAM,2BAA2B,EAE7E,IAAIC,EAAIP,GAAII,CAAO,EACfI,EAAIR,GAAII,CAAO,EACf3B,EAAI,EACFgC,EAAQ,IAAK,CACjBF,EAAE,KAAK,CAAC,EACRC,EAAE,KAAK,CAAC,EACR/B,EAAI,CACN,EACMiC,EAAI,IAAIC,IAAoBL,EAAOE,EAAGD,EAAG,GAAGI,CAAC,EAC7CC,EAAS,CAACC,EAAOb,GAAG,IAAM,CAE9BQ,EAAIE,EAAER,GAAK,CAAC,CAAI,CAAC,EAAGW,CAAI,EACxBN,EAAIG,EAAC,EACDG,EAAK,SAAW,IACpBL,EAAIE,EAAER,GAAK,CAAC,CAAI,CAAC,EAAGW,CAAI,EACxBN,EAAIG,EAAC,EACP,EACMI,EAAM,IAAK,CAEf,GAAIrC,KAAO,IAAM,MAAM,IAAI,MAAM,yBAAyB,EAC1D,IAAII,EAAM,EACJkC,EAAoB,CAAA,EAC1B,KAAOlC,EAAMwB,GAAU,CACrBE,EAAIG,EAAC,EACL,IAAMM,EAAKT,EAAE,MAAK,EAClBQ,EAAI,KAAKC,CAAE,EACXnC,GAAO0B,EAAE,OAEX,OAAOjD,GAAY,GAAGyD,CAAG,CAC3B,EASA,MARiB,CAACF,EAAkBI,IAAoB,CACtDR,EAAK,EACLG,EAAOC,CAAI,EACX,IAAIxB,EACJ,KAAO,EAAEA,EAAM4B,EAAKH,EAAG,CAAE,IAAIF,EAAM,EACnC,OAAAH,EAAK,EACEpB,CACT,CAEF,CAIA,IAAM6B,GAAe,CACnB,OAASC,GAAa,OAAOA,GAAQ,SACrC,SAAWA,GAAa,OAAOA,GAAQ,WACvC,QAAUA,GAAa,OAAOA,GAAQ,UACtC,OAASA,GAAa,OAAOA,GAAQ,SACrC,mBAAqBA,GAAa,OAAOA,GAAQ,UAAYA,aAAe,WAC5E,cAAgBA,GAAa,OAAO,cAAcA,CAAG,EACrD,MAAQA,GAAa,MAAM,QAAQA,CAAG,EACtC,MAAO,CAACA,EAAUC,IAAiBA,EAAe,GAAG,QAAQD,CAAG,EAChE,KAAOA,GAAa,OAAOA,GAAQ,YAAc,OAAO,cAAcA,EAAI,SAAS,GAM/E,SAAUlD,GACdmD,EACAC,EACAC,EAA2B,CAAA,EAAE,CAE7B,IAAMC,EAAa,CAACC,EAAoBC,EAAiBC,IAAuB,CAC9E,IAAMC,EAAWT,GAAaO,CAAI,EAClC,GAAI,OAAOE,GAAa,WACtB,MAAM,IAAI,MAAM,sBAAsBF,CAAI,sBAAsB,EAElE,IAAMN,EAAMC,EAAOI,CAAgC,EACnD,GAAI,EAAAE,GAAcP,IAAQ,SACtB,CAACQ,EAASR,EAAKC,CAAM,EACvB,MAAM,IAAI,MACR,iBAAiB,OAAOI,CAAS,CAAC,IAAIL,CAAG,KAAK,OAAOA,CAAG,eAAeM,CAAI,EAAE,CAGnF,EACA,OAAW,CAACD,EAAWC,CAAI,IAAK,OAAO,QAAQJ,CAAU,EAAGE,EAAWC,EAAWC,EAAO,EAAK,EAC9F,OAAW,CAACD,EAAWC,CAAI,IAAK,OAAO,QAAQH,CAAa,EAAGC,EAAWC,EAAWC,EAAO,EAAI,EAChG,OAAOL,CACT,CC7QA,IAAMQ,GAAM,OAAO,CAAC,EAAGC,EAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAEjEC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAEhDC,GAAM,OAAO,CAAC,EAAGC,GAAO,OAAO,EAAE,EAGjC,SAAUC,GAAIC,EAAWC,EAAS,CACtC,IAAMC,EAASF,EAAIC,EACnB,OAAOC,GAAUZ,GAAMY,EAASD,EAAIC,CACtC,CAQM,SAAUC,GAAIC,EAAaC,EAAeC,EAAc,CAC5D,GAAIA,GAAUhB,IAAOe,EAAQf,GAAK,MAAM,IAAI,MAAM,2BAA2B,EAC7E,GAAIgB,IAAWf,EAAK,OAAOD,GAC3B,IAAIiB,EAAMhB,EACV,KAAOc,EAAQf,IACTe,EAAQd,IAAKgB,EAAOA,EAAMH,EAAOE,GACrCF,EAAOA,EAAMA,EAAOE,EACpBD,IAAUd,EAEZ,OAAOgB,CACT,CAGM,SAAUC,GAAKC,EAAWJ,EAAeC,EAAc,CAC3D,IAAIC,EAAME,EACV,KAAOJ,KAAUf,IACfiB,GAAOA,EACPA,GAAOD,EAET,OAAOC,CACT,CAGM,SAAUG,GAAOC,EAAgBL,EAAc,CACnD,GAAIK,IAAWrB,IAAOgB,GAAUhB,GAC9B,MAAM,IAAI,MAAM,6CAA6CqB,CAAM,QAAQL,CAAM,EAAE,EAIrF,IAAIN,EAAID,GAAIY,EAAQL,CAAM,EACtBL,EAAIK,EAEJG,EAAInB,GAAKsB,EAAIrB,EAAKsB,EAAItB,EAAKuB,EAAIxB,GACnC,KAAOU,IAAMV,IAAK,CAEhB,IAAMyB,EAAId,EAAID,EACRgB,EAAIf,EAAID,EACRiB,EAAIR,EAAII,EAAIE,EACZG,EAAIN,EAAIE,EAAIC,EAElBd,EAAID,EAAGA,EAAIgB,EAAGP,EAAII,EAAGD,EAAIE,EAAGD,EAAII,EAAGH,EAAII,EAGzC,GADYjB,IACAV,EAAK,MAAM,IAAI,MAAM,wBAAwB,EACzD,OAAOQ,GAAIU,EAAGH,CAAM,CACtB,CAUM,SAAUa,GAAcC,EAAS,CAMrC,IAAMC,GAAaD,EAAI7B,GAAOC,GAE1B8B,EAAWC,EAAWC,EAG1B,IAAKF,EAAIF,EAAI7B,EAAKgC,EAAI,EAAGD,EAAI9B,KAAQF,GAAKgC,GAAK9B,GAAK+B,IAAI,CAGxD,IAAKC,EAAIhC,GAAKgC,EAAIJ,GAAKjB,GAAIqB,EAAGH,EAAWD,CAAC,IAAMA,EAAI7B,EAAKiC,IAAI,CAG7D,GAAID,IAAM,EAAG,CACX,IAAME,GAAUL,EAAI7B,GAAOG,GAC3B,OAAO,SAAwBgC,EAAeR,EAAI,CAChD,IAAMS,EAAOD,EAAG,IAAIR,EAAGO,CAAM,EAC7B,GAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAGT,CAAC,EAAG,MAAM,IAAI,MAAM,yBAAyB,EACvE,OAAOS,CACT,EAIF,IAAMC,GAAUN,EAAI/B,GAAOC,GAC3B,OAAO,SAAwBkC,EAAeR,EAAI,CAEhD,GAAIQ,EAAG,IAAIR,EAAGG,CAAS,IAAMK,EAAG,IAAIA,EAAG,GAAG,EAAG,MAAM,IAAI,MAAM,yBAAyB,EACtF,IAAIV,EAAIO,EAEJM,EAAIH,EAAG,IAAIA,EAAG,IAAIA,EAAG,IAAKF,CAAC,EAAGF,CAAC,EAC/Bb,EAAIiB,EAAG,IAAIR,EAAGU,CAAM,EACpB3B,EAAIyB,EAAG,IAAIR,EAAGI,CAAC,EAEnB,KAAO,CAACI,EAAG,IAAIzB,EAAGyB,EAAG,GAAG,GAAG,CACzB,GAAIA,EAAG,IAAIzB,EAAGyB,EAAG,IAAI,EAAG,OAAOA,EAAG,KAElC,IAAIT,EAAI,EACR,QAASa,EAAKJ,EAAG,IAAIzB,CAAC,EAAGgB,EAAID,GACvB,CAAAU,EAAG,IAAII,EAAIJ,EAAG,GAAG,EADST,IAE9Ba,EAAKJ,EAAG,IAAII,CAAE,EAGhB,IAAMC,EAAKL,EAAG,IAAIG,EAAGtC,GAAO,OAAOyB,EAAIC,EAAI,CAAC,CAAC,EAC7CY,EAAIH,EAAG,IAAIK,CAAE,EACbtB,EAAIiB,EAAG,IAAIjB,EAAGsB,CAAE,EAChB9B,EAAIyB,EAAG,IAAIzB,EAAG4B,CAAC,EACfb,EAAIC,EAEN,OAAOR,CACT,CACF,CAEM,SAAUuB,GAAOZ,EAAS,CAM9B,GAAIA,EAAI1B,KAAQD,GAAK,CAKnB,IAAMgC,GAAUL,EAAI7B,GAAOG,GAC3B,OAAO,SAAsBgC,EAAeR,EAAI,CAC9C,IAAMS,EAAOD,EAAG,IAAIR,EAAGO,CAAM,EAE7B,GAAI,CAACC,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAGT,CAAC,EAAG,MAAM,IAAI,MAAM,yBAAyB,EACvE,OAAOS,CACT,EAIF,GAAIP,EAAIxB,KAAQD,GAAK,CACnB,IAAMsC,GAAMb,EAAIzB,IAAOC,GACvB,OAAO,SAAsB8B,EAAeR,EAAI,CAC9C,IAAMgB,EAAKR,EAAG,IAAIR,EAAG1B,EAAG,EAClBsB,EAAIY,EAAG,IAAIQ,EAAID,CAAE,EACjBE,EAAKT,EAAG,IAAIR,EAAGJ,CAAC,EAChBsB,EAAIV,EAAG,IAAIA,EAAG,IAAIS,EAAI3C,EAAG,EAAGsB,CAAC,EAC7Ba,EAAOD,EAAG,IAAIS,EAAIT,EAAG,IAAIU,EAAGV,EAAG,GAAG,CAAC,EACzC,GAAI,CAACA,EAAG,IAAIA,EAAG,IAAIC,CAAI,EAAGT,CAAC,EAAG,MAAM,IAAI,MAAM,yBAAyB,EACvE,OAAOS,CACT,EAIF,OAAIP,EAAItB,GAuBDqB,GAAcC,CAAC,CACxB,CAgDA,IAAMiB,GAAe,CACnB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,QAEpB,SAAUC,GAAiBC,EAAgB,CAC/C,IAAMC,EAAU,CACd,MAAO,SACP,KAAM,SACN,MAAO,gBACP,KAAM,iBAEFC,EAAOJ,GAAa,OAAO,CAACK,EAAKC,KACrCD,EAAIC,CAAG,EAAI,WACJD,GACNF,CAAO,EACV,OAAOI,GAAeL,EAAOE,CAAI,CACnC,CAQM,SAAUI,GAASC,EAAcC,EAAQC,EAAa,CAG1D,GAAIA,EAAQC,GAAK,MAAM,IAAI,MAAM,oBAAoB,EACrD,GAAID,IAAUC,GAAK,OAAOH,EAAE,IAC5B,GAAIE,IAAUE,EAAK,OAAOH,EAC1B,IAAII,EAAIL,EAAE,IACNM,EAAIL,EACR,KAAOC,EAAQC,IACTD,EAAQE,IAAKC,EAAIL,EAAE,IAAIK,EAAGC,CAAC,GAC/BA,EAAIN,EAAE,IAAIM,CAAC,EACXJ,IAAUE,EAEZ,OAAOC,CACT,CAMM,SAAUE,GAAiBP,EAAcQ,EAAS,CACtD,IAAMC,EAAM,IAAI,MAAMD,EAAK,MAAM,EAE3BE,EAAiBF,EAAK,OAAO,CAACG,EAAKV,EAAKW,IACxCZ,EAAE,IAAIC,CAAG,EAAUU,GACvBF,EAAIG,CAAC,EAAID,EACFX,EAAE,IAAIW,EAAKV,CAAG,GACpBD,EAAE,GAAG,EAEFa,EAAWb,EAAE,IAAIU,CAAc,EAErC,OAAAF,EAAK,YAAY,CAACG,EAAKV,EAAKW,IACtBZ,EAAE,IAAIC,CAAG,EAAUU,GACvBF,EAAIG,CAAC,EAAIZ,EAAE,IAAIW,EAAKF,EAAIG,CAAC,CAAC,EACnBZ,EAAE,IAAIW,EAAKV,CAAG,GACpBY,CAAQ,EACJJ,CACT,CAgBM,SAAUK,GAAQC,EAAWC,EAAmB,CAEpD,IAAMC,EAAcD,IAAe,OAAYA,EAAaD,EAAE,SAAS,CAAC,EAAE,OACpEG,EAAc,KAAK,KAAKD,EAAc,CAAC,EAC7C,MAAO,CAAE,WAAYA,EAAa,YAAAC,CAAW,CAC/C,CAeM,SAAUC,GACdC,EACAC,EACAC,EAAO,GACPC,EAAiC,CAAA,EAAE,CAEnC,GAAIH,GAASI,GAAK,MAAM,IAAI,MAAM,iCAAiCJ,CAAK,EAAE,EAC1E,GAAM,CAAE,WAAYK,EAAM,YAAaC,CAAK,EAAKZ,GAAQM,EAAOC,CAAM,EACtE,GAAIK,EAAQ,KAAM,MAAM,IAAI,MAAM,iDAAiD,EACnF,IAAMC,EAAQC,GAAOR,CAAK,EACpBS,EAAuB,OAAO,OAAO,CACzC,MAAAT,EACA,KAAAK,EACA,MAAAC,EACA,KAAMI,GAAQL,CAAI,EAClB,KAAMD,GACN,IAAKO,EACL,OAASC,GAAQC,GAAID,EAAKZ,CAAK,EAC/B,QAAUY,GAAO,CACf,GAAI,OAAOA,GAAQ,SACjB,MAAM,IAAI,MAAM,+CAA+C,OAAOA,CAAG,EAAE,EAC7E,OAAOR,IAAOQ,GAAOA,EAAMZ,CAC7B,EACA,IAAMY,GAAQA,IAAQR,GACtB,MAAQQ,IAASA,EAAMD,KAASA,EAChC,IAAMC,GAAQC,GAAI,CAACD,EAAKZ,CAAK,EAC7B,IAAK,CAACc,EAAKC,IAAQD,IAAQC,EAE3B,IAAMH,GAAQC,GAAID,EAAMA,EAAKZ,CAAK,EAClC,IAAK,CAACc,EAAKC,IAAQF,GAAIC,EAAMC,EAAKf,CAAK,EACvC,IAAK,CAACc,EAAKC,IAAQF,GAAIC,EAAMC,EAAKf,CAAK,EACvC,IAAK,CAACc,EAAKC,IAAQF,GAAIC,EAAMC,EAAKf,CAAK,EACvC,IAAK,CAACY,EAAKI,IAAUC,GAAMR,EAAGG,EAAKI,CAAK,EACxC,IAAK,CAACF,EAAKC,IAAQF,GAAIC,EAAMI,GAAOH,EAAKf,CAAK,EAAGA,CAAK,EAGtD,KAAOY,GAAQA,EAAMA,EACrB,KAAM,CAACE,EAAKC,IAAQD,EAAMC,EAC1B,KAAM,CAACD,EAAKC,IAAQD,EAAMC,EAC1B,KAAM,CAACD,EAAKC,IAAQD,EAAMC,EAE1B,IAAMH,GAAQM,GAAON,EAAKZ,CAAK,EAC/B,KAAMG,EAAM,OAAUR,GAAMY,EAAME,EAAGd,CAAC,GACtC,YAAcwB,GAAQC,GAAcX,EAAGU,CAAG,EAG1C,KAAM,CAAC,EAAGE,EAAGC,IAAOA,EAAID,EAAI,EAC5B,QAAUT,GAASV,EAAOqB,GAAgBX,EAAKN,CAAK,EAAIkB,GAAgBZ,EAAKN,CAAK,EAClF,UAAYmB,GAAS,CACnB,GAAIA,EAAM,SAAWnB,EACnB,MAAM,IAAI,MAAM,0BAA0BA,CAAK,SAASmB,EAAM,MAAM,EAAE,EACxE,OAAOvB,EAAOwB,GAAgBD,CAAK,EAAIE,GAAgBF,CAAK,CAC9D,EACU,EACZ,OAAO,OAAO,OAAOhB,CAAC,CACxB,CAwCM,SAAUmB,GAAoBC,EAAkB,CACpD,GAAI,OAAOA,GAAe,SAAU,MAAM,IAAI,MAAM,4BAA4B,EAChF,IAAMC,EAAYD,EAAW,SAAS,CAAC,EAAE,OACzC,OAAO,KAAK,KAAKC,EAAY,CAAC,CAChC,CASM,SAAUC,GAAiBF,EAAkB,CACjD,IAAMG,EAASJ,GAAoBC,CAAU,EAC7C,OAAOG,EAAS,KAAK,KAAKA,EAAS,CAAC,CACtC,CAeM,SAAUC,GAAeC,EAAiBL,EAAoBM,EAAO,GAAK,CAC9E,IAAMC,EAAMF,EAAI,OACVG,EAAWT,GAAoBC,CAAU,EACzCS,EAASP,GAAiBF,CAAU,EAE1C,GAAIO,EAAM,IAAMA,EAAME,GAAUF,EAAM,KACpC,MAAM,IAAI,MAAM,YAAYE,CAAM,6BAA6BF,CAAG,EAAE,EACtE,IAAMG,EAAMJ,EAAOK,GAAgBN,CAAG,EAAIO,GAAgBP,CAAG,EAEvDQ,EAAUC,GAAIJ,EAAKV,EAAae,CAAG,EAAIA,EAC7C,OAAOT,EAAOU,GAAgBH,EAASL,CAAQ,EAAIS,GAAgBJ,EAASL,CAAQ,CACtF,CC/dA,IAAMU,GAAM,OAAO,CAAC,EACdC,GAAM,OAAO,CAAC,EAiCd,SAAUC,GAAyBC,EAAwBC,EAAY,CAC3E,IAAMC,EAAkB,CAACC,EAAoBC,IAAc,CACzD,IAAMC,EAAMD,EAAK,OAAM,EACvB,OAAOD,EAAYE,EAAMD,CAC3B,EACME,EAAQC,GAAa,CACzB,IAAMC,EAAU,KAAK,KAAKP,EAAOM,CAAC,EAAI,EAChCE,EAAa,IAAMF,EAAI,GAC7B,MAAO,CAAE,QAAAC,EAAS,WAAAC,CAAU,CAC9B,EACA,MAAO,CACL,gBAAAP,EAEA,aAAaQ,EAAQC,EAAS,CAC5B,IAAIC,EAAIZ,EAAE,KACNa,EAAOH,EACX,KAAOC,EAAId,IACLc,EAAIb,KAAKc,EAAIA,EAAE,IAAIC,CAAC,GACxBA,EAAIA,EAAE,OAAM,EACZF,IAAMb,GAER,OAAOc,CACT,EAYA,iBAAiBF,EAAQH,EAAS,CAChC,GAAM,CAAE,QAAAC,EAAS,WAAAC,CAAU,EAAKH,EAAKC,CAAC,EAChCO,EAAc,CAAA,EAChBF,EAAOF,EACPK,EAAOH,EACX,QAASI,EAAS,EAAGA,EAASR,EAASQ,IAAU,CAC/CD,EAAOH,EACPE,EAAO,KAAKC,CAAI,EAEhB,QAASE,EAAI,EAAGA,EAAIR,EAAYQ,IAC9BF,EAAOA,EAAK,IAAIH,CAAC,EACjBE,EAAO,KAAKC,CAAI,EAElBH,EAAIG,EAAK,OAAM,EAEjB,OAAOD,CACT,EASA,KAAKP,EAAWW,EAAkBP,EAAS,CAGzC,GAAM,CAAE,QAAAH,EAAS,WAAAC,CAAU,EAAKH,EAAKC,CAAC,EAElCK,EAAIZ,EAAE,KACN,EAAIA,EAAE,KAEJmB,EAAO,OAAO,GAAKZ,EAAI,CAAC,EACxBa,EAAY,GAAKb,EACjBc,EAAU,OAAOd,CAAC,EAExB,QAASS,EAAS,EAAGA,EAASR,EAASQ,IAAU,CAC/C,IAAMM,EAASN,EAASP,EAEpBc,EAAQ,OAAOZ,EAAIQ,CAAI,EAG3BR,IAAMU,EAIFE,EAAQd,IACVc,GAASH,EACTT,GAAKb,IAWP,IAAM0B,EAAUF,EACVG,EAAUH,EAAS,KAAK,IAAIC,CAAK,EAAI,EACrCG,EAAQV,EAAS,IAAM,EACvBW,EAAQJ,EAAQ,EAClBA,IAAU,EAEZ,EAAI,EAAE,IAAIrB,EAAgBwB,EAAOR,EAAYM,CAAO,CAAC,CAAC,EAEtDZ,EAAIA,EAAE,IAAIV,EAAgByB,EAAOT,EAAYO,CAAO,CAAC,CAAC,EAQ1D,MAAO,CAAE,EAAAb,EAAG,CAAC,CACf,EAEA,WAAWgB,EAAMC,EAA6BlB,EAAWmB,EAAoB,CAE3E,IAAMvB,EAAYqB,EAAE,cAAgB,EAEhCG,EAAOF,EAAe,IAAID,CAAC,EAC/B,OAAKG,IACHA,EAAO,KAAK,iBAAiBH,EAAGrB,CAAC,EAC7BA,IAAM,GACRsB,EAAe,IAAID,EAAGE,EAAUC,CAAI,CAAC,GAGlC,KAAK,KAAKxB,EAAGwB,EAAMpB,CAAC,CAC7B,EAEJ,CAgBM,SAAUqB,GAAqBC,EAAyB,CAC5D,OAAAC,GAAcD,EAAM,EAAE,EACtBE,GACEF,EACA,CACE,EAAG,SACH,EAAG,SACH,GAAI,QACJ,GAAI,SAEN,CACE,WAAY,gBACZ,YAAa,gBACd,EAGI,OAAO,OAAO,CACnB,GAAGG,GAAQH,EAAM,EAAGA,EAAM,UAAU,EACpC,GAAGA,EACE,EAAGA,EAAM,GAAG,MACT,CACZ,CChHA,SAASI,GAAqBC,EAAyB,CACrD,IAAMC,EAAOC,GAAcF,CAAK,EAC7BG,GACDF,EACA,CACE,EAAG,QACH,EAAG,SAEL,CACE,yBAA0B,QAC1B,eAAgB,UAChB,cAAe,WACf,cAAe,WACf,mBAAoB,UACpB,UAAW,WACX,QAAS,WACV,EAEH,GAAM,CAAE,KAAAG,EAAM,GAAAC,EAAI,EAAAC,CAAC,EAAKL,EACxB,GAAIG,EAAM,CACR,GAAI,CAACC,EAAG,IAAIC,EAAGD,EAAG,IAAI,EACpB,MAAM,IAAI,MAAM,mEAAmE,EAErF,GACE,OAAOD,GAAS,UAChB,OAAOA,EAAK,MAAS,UACrB,OAAOA,EAAK,aAAgB,WAE5B,MAAM,IAAI,MAAM,mEAAmE,EAGvF,OAAO,OAAO,OAAO,CAAE,GAAGH,CAAI,CAAW,CAC3C,CAUA,GAAM,CAAE,gBAAiBM,GAAK,WAAYC,EAAG,EAAKC,GACrCC,GAAM,CAEjB,IAAK,cAAqB,KAAK,CAC7B,YAAYC,EAAI,GAAE,CAChB,MAAMA,CAAC,CACT,GAEF,UAAUC,EAAgB,CACxB,GAAM,CAAE,IAAKC,CAAC,EAAKH,GACnB,GAAIE,EAAK,OAAS,GAAKA,EAAK,CAAC,IAAM,EAAM,MAAM,IAAIC,EAAE,+BAA+B,EACpF,IAAMC,EAAMF,EAAK,CAAC,EACZG,EAAMH,EAAK,SAAS,EAAGE,EAAM,CAAC,EACpC,GAAI,CAACA,GAAOC,EAAI,SAAWD,EAAK,MAAM,IAAID,EAAE,yCAAyC,EAKrF,GAAIE,EAAI,CAAC,EAAI,IAAY,MAAM,IAAIF,EAAE,qCAAqC,EAC1E,GAAIE,EAAI,CAAC,IAAM,GAAQ,EAAEA,EAAI,CAAC,EAAI,KAChC,MAAM,IAAIF,EAAE,qDAAqD,EACnE,MAAO,CAAE,EAAGN,GAAIQ,CAAG,EAAG,EAAGH,EAAK,SAASE,EAAM,CAAC,CAAC,CACjD,EACA,MAAME,EAAwB,CAE5B,GAAM,CAAE,IAAKH,CAAC,EAAKH,GACbE,EAAO,OAAOI,GAAQ,SAAWR,GAAIQ,CAAG,EAAIA,EAClD,GAAI,EAAEJ,aAAgB,YAAa,MAAM,IAAI,MAAM,eAAe,EAClE,IAAIK,EAAIL,EAAK,OACb,GAAIK,EAAI,GAAKL,EAAK,CAAC,GAAK,GAAM,MAAM,IAAIC,EAAE,uBAAuB,EACjE,GAAID,EAAK,CAAC,IAAMK,EAAI,EAAG,MAAM,IAAIJ,EAAE,qCAAqC,EACxE,GAAM,CAAE,EAAGK,EAAG,EAAGC,CAAM,EAAKT,GAAI,UAAUE,EAAK,SAAS,CAAC,CAAC,EACpD,CAAE,EAAGQ,EAAG,EAAGC,CAAU,EAAKX,GAAI,UAAUS,CAAM,EACpD,GAAIE,EAAW,OAAQ,MAAM,IAAIR,EAAE,6CAA6C,EAChF,MAAO,CAAE,EAAAK,EAAG,EAAAE,CAAC,CACf,EACA,WAAWE,EAA6B,CAEtC,IAAMC,EAASH,GAAuB,OAAO,SAASA,EAAE,CAAC,EAAG,EAAE,EAAI,EAAS,KAAOA,EAAIA,EAChFI,EAAKC,GAAwB,CACjC,IAAMT,EAAMS,EAAI,SAAS,EAAE,EAC3B,OAAOT,EAAI,OAAS,EAAI,IAAIA,CAAG,GAAKA,CACtC,EACMI,EAAIG,EAAMC,EAAEF,EAAI,CAAC,CAAC,EAClBJ,EAAIK,EAAMC,EAAEF,EAAI,CAAC,CAAC,EAClBI,EAAMN,EAAE,OAAS,EACjBO,EAAMT,EAAE,OAAS,EACjBU,EAAKJ,EAAEE,CAAG,EACVG,EAAKL,EAAEG,CAAG,EAChB,MAAO,KAAKH,EAAEG,EAAMD,EAAM,CAAC,CAAC,KAAKG,CAAE,GAAGX,CAAC,KAAKU,CAAE,GAAGR,CAAC,EACpD,GAKIU,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAAGC,GAAM,OAAO,CAAC,EAElF,SAAUC,GAAqBlC,EAAwB,CAC3D,IAAMmC,EAAQrC,GAAkBE,CAAI,EAC9B,CAAE,GAAAI,CAAE,EAAK+B,EAETC,EACJD,EAAM,UACL,CAACE,EAAwBC,EAAyBC,IAA0B,CAC3E,IAAMlC,EAAIiC,EAAM,SAAQ,EACxB,OAAUE,GAAY,WAAW,KAAK,CAAC,CAAI,CAAC,EAAGpC,EAAG,QAAQC,EAAE,CAAC,EAAGD,EAAG,QAAQC,EAAE,CAAC,CAAC,CACjF,GACIoC,EACJN,EAAM,YACJO,GAAqB,CAErB,IAAMC,EAAOD,EAAM,SAAS,CAAC,EAEvBE,EAAIxC,EAAG,UAAUuC,EAAK,SAAS,EAAGvC,EAAG,KAAK,CAAC,EAC3CyC,EAAIzC,EAAG,UAAUuC,EAAK,SAASvC,EAAG,MAAO,EAAIA,EAAG,KAAK,CAAC,EAC5D,MAAO,CAAE,EAAAwC,EAAG,EAAAC,CAAC,CACf,GAMF,SAASC,EAAoBF,EAAI,CAC/B,GAAM,CAAE,EAAAvC,EAAG,EAAA0C,CAAC,EAAKZ,EACXa,EAAK5C,EAAG,IAAIwC,CAAC,EACbK,EAAK7C,EAAG,IAAI4C,EAAIJ,CAAC,EACvB,OAAOxC,EAAG,IAAIA,EAAG,IAAI6C,EAAI7C,EAAG,IAAIwC,EAAGvC,CAAC,CAAC,EAAG0C,CAAC,CAC3C,CAKA,GAAI,CAAC3C,EAAG,IAAIA,EAAG,IAAI+B,EAAM,EAAE,EAAGW,EAAoBX,EAAM,EAAE,CAAC,EACzD,MAAM,IAAI,MAAM,6CAA6C,EAG/D,SAASe,EAAmB1B,EAAW,CACrC,OAAO,OAAOA,GAAQ,UAAYK,GAAML,GAAOA,EAAMW,EAAM,CAC7D,CACA,SAASgB,EAAS3B,EAAW,CAC3B,GAAI,CAAC0B,EAAmB1B,CAAG,EAAG,MAAM,IAAI,MAAM,6CAA6C,CAC7F,CAGA,SAAS4B,EAAuBC,EAAY,CAC1C,GAAM,CAAE,yBAA0BC,EAAS,YAAAC,EAAa,eAAAC,EAAgB,EAAAC,CAAC,EAAKtB,EAC9E,GAAImB,GAAW,OAAOD,GAAQ,SAAU,CAGtC,GAFIA,aAAe,aAAYA,EAASK,GAAWL,CAAG,GAElD,OAAOA,GAAQ,UAAY,CAACC,EAAQ,SAASD,EAAI,MAAM,EAAG,MAAM,IAAI,MAAM,aAAa,EAC3FA,EAAMA,EAAI,SAASE,EAAc,EAAG,GAAG,EAEzC,IAAI/B,EACJ,GAAI,CACFA,EACE,OAAO6B,GAAQ,SACXA,EACGM,GAAgBC,GAAY,cAAeP,EAAKE,CAAW,CAAC,OACvD,CACd,MAAM,IAAI,MAAM,uBAAuBA,CAAW,8BAA8B,OAAOF,CAAG,EAAE,EAE9F,OAAIG,IAAgBhC,EAAUqC,GAAIrC,EAAKiC,CAAC,GACxCN,EAAS3B,CAAG,EACLA,CACT,CAEA,IAAMsC,EAAmB,IAAI,IAC7B,SAASC,EAAeC,EAAc,CACpC,GAAI,EAAEA,aAAiBC,GAAQ,MAAM,IAAI,MAAM,0BAA0B,CAC3E,CAMA,MAAMA,CAAK,CAIT,YAAqBC,EAAgBC,EAAgBC,EAAK,CACxD,GADmB,KAAA,GAAAF,EAAgB,KAAA,GAAAC,EAAgB,KAAA,GAAAC,EAC/CF,GAAM,MAAQ,CAAC9D,EAAG,QAAQ8D,CAAE,EAAG,MAAM,IAAI,MAAM,YAAY,EAC/D,GAAIC,GAAM,MAAQ,CAAC/D,EAAG,QAAQ+D,CAAE,EAAG,MAAM,IAAI,MAAM,YAAY,EAC/D,GAAIC,GAAM,MAAQ,CAAChE,EAAG,QAAQgE,CAAE,EAAG,MAAM,IAAI,MAAM,YAAY,CACjE,CAIA,OAAO,WAAWC,EAAiB,CACjC,GAAM,CAAE,EAAAzB,EAAG,EAAAC,CAAC,EAAKwB,GAAK,CAAA,EACtB,GAAI,CAACA,GAAK,CAACjE,EAAG,QAAQwC,CAAC,GAAK,CAACxC,EAAG,QAAQyC,CAAC,EAAG,MAAM,IAAI,MAAM,sBAAsB,EAClF,GAAIwB,aAAaJ,EAAO,MAAM,IAAI,MAAM,8BAA8B,EACtE,IAAMK,EAAOC,GAASnE,EAAG,IAAImE,EAAGnE,EAAG,IAAI,EAEvC,OAAIkE,EAAI1B,CAAC,GAAK0B,EAAIzB,CAAC,EAAUoB,EAAM,KAC5B,IAAIA,EAAMrB,EAAGC,EAAGzC,EAAG,GAAG,CAC/B,CAEA,IAAI,GAAC,CACH,OAAO,KAAK,SAAQ,EAAG,CACzB,CACA,IAAI,GAAC,CACH,OAAO,KAAK,SAAQ,EAAG,CACzB,CAQA,OAAO,WAAWoE,EAAe,CAC/B,IAAMC,EAAQrE,EAAG,YAAYoE,EAAO,IAAKH,GAAMA,EAAE,EAAE,CAAC,EACpD,OAAOG,EAAO,IAAI,CAACH,EAAGE,IAAMF,EAAE,SAASI,EAAMF,CAAC,CAAC,CAAC,EAAE,IAAIN,EAAM,UAAU,CACxE,CAMA,OAAO,QAAQlD,EAAQ,CACrB,IAAM2D,EAAIT,EAAM,WAAWxB,EAAUmB,GAAY,WAAY7C,CAAG,CAAC,CAAC,EAClE,OAAA2D,EAAE,eAAc,EACTA,CACT,CAGA,OAAO,eAAeC,EAAmB,CACvC,OAAOV,EAAM,KAAK,SAASb,EAAuBuB,CAAU,CAAC,CAC/D,CAQA,eAAeC,EAAkB,CAC/B,KAAK,aAAeA,EACpBd,EAAiB,OAAO,IAAI,CAC9B,CAGA,gBAAc,CACZ,GAAI,KAAK,IAAG,EAAI,CAId,GAAI3B,EAAM,oBAAsB,CAAC/B,EAAG,IAAI,KAAK,EAAE,EAAG,OAClD,MAAM,IAAI,MAAM,iBAAiB,EAGnC,GAAM,CAAE,EAAAwC,EAAG,EAAAC,CAAC,EAAK,KAAK,SAAQ,EAE9B,GAAI,CAACzC,EAAG,QAAQwC,CAAC,GAAK,CAACxC,EAAG,QAAQyC,CAAC,EAAG,MAAM,IAAI,MAAM,0BAA0B,EAChF,IAAMgC,EAAOzE,EAAG,IAAIyC,CAAC,EACfiC,EAAQhC,EAAoBF,CAAC,EACnC,GAAI,CAACxC,EAAG,IAAIyE,EAAMC,CAAK,EAAG,MAAM,IAAI,MAAM,mCAAmC,EAC7E,GAAI,CAAC,KAAK,cAAa,EAAI,MAAM,IAAI,MAAM,wCAAwC,CACrF,CACA,UAAQ,CACN,GAAM,CAAE,EAAAjC,CAAC,EAAK,KAAK,SAAQ,EAC3B,GAAIzC,EAAG,MAAO,MAAO,CAACA,EAAG,MAAMyC,CAAC,EAChC,MAAM,IAAI,MAAM,6BAA6B,CAC/C,CAKA,OAAOmB,EAAY,CACjBD,EAAeC,CAAK,EACpB,GAAM,CAAE,GAAIe,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KAC7B,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKpB,EAC7BqB,EAAKjF,EAAG,IAAIA,EAAG,IAAI2E,EAAIK,CAAE,EAAGhF,EAAG,IAAI8E,EAAID,CAAE,CAAC,EAC1CK,EAAKlF,EAAG,IAAIA,EAAG,IAAI4E,EAAII,CAAE,EAAGhF,EAAG,IAAI+E,EAAIF,CAAE,CAAC,EAChD,OAAOI,GAAMC,CACf,CAKA,QAAM,CACJ,OAAO,IAAIrB,EAAM,KAAK,GAAI7D,EAAG,IAAI,KAAK,EAAE,EAAG,KAAK,EAAE,CACpD,CAMA,QAAM,CACJ,GAAM,CAAE,EAAAC,EAAG,EAAA0C,CAAC,EAAKZ,EACXoD,EAAKnF,EAAG,IAAI2C,EAAGf,EAAG,EAClB,CAAE,GAAI+C,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KAC/BO,EAAKpF,EAAG,KAAMqF,EAAKrF,EAAG,KAAMsF,EAAKtF,EAAG,KACpCuF,EAAKvF,EAAG,IAAI2E,EAAIA,CAAE,EAClBa,EAAKxF,EAAG,IAAI4E,EAAIA,CAAE,EAClBa,EAAKzF,EAAG,IAAI6E,EAAIA,CAAE,EAClBa,EAAK1F,EAAG,IAAI2E,EAAIC,CAAE,EACtB,OAAAc,EAAK1F,EAAG,IAAI0F,EAAIA,CAAE,EAClBJ,EAAKtF,EAAG,IAAI2E,EAAIE,CAAE,EAClBS,EAAKtF,EAAG,IAAIsF,EAAIA,CAAE,EAClBF,EAAKpF,EAAG,IAAIC,EAAGqF,CAAE,EACjBD,EAAKrF,EAAG,IAAImF,EAAIM,CAAE,EAClBJ,EAAKrF,EAAG,IAAIoF,EAAIC,CAAE,EAClBD,EAAKpF,EAAG,IAAIwF,EAAIH,CAAE,EAClBA,EAAKrF,EAAG,IAAIwF,EAAIH,CAAE,EAClBA,EAAKrF,EAAG,IAAIoF,EAAIC,CAAE,EAClBD,EAAKpF,EAAG,IAAI0F,EAAIN,CAAE,EAClBE,EAAKtF,EAAG,IAAImF,EAAIG,CAAE,EAClBG,EAAKzF,EAAG,IAAIC,EAAGwF,CAAE,EACjBC,EAAK1F,EAAG,IAAIuF,EAAIE,CAAE,EAClBC,EAAK1F,EAAG,IAAIC,EAAGyF,CAAE,EACjBA,EAAK1F,EAAG,IAAI0F,EAAIJ,CAAE,EAClBA,EAAKtF,EAAG,IAAIuF,EAAIA,CAAE,EAClBA,EAAKvF,EAAG,IAAIsF,EAAIC,CAAE,EAClBA,EAAKvF,EAAG,IAAIuF,EAAIE,CAAE,EAClBF,EAAKvF,EAAG,IAAIuF,EAAIG,CAAE,EAClBL,EAAKrF,EAAG,IAAIqF,EAAIE,CAAE,EAClBE,EAAKzF,EAAG,IAAI4E,EAAIC,CAAE,EAClBY,EAAKzF,EAAG,IAAIyF,EAAIA,CAAE,EAClBF,EAAKvF,EAAG,IAAIyF,EAAIC,CAAE,EAClBN,EAAKpF,EAAG,IAAIoF,EAAIG,CAAE,EAClBD,EAAKtF,EAAG,IAAIyF,EAAID,CAAE,EAClBF,EAAKtF,EAAG,IAAIsF,EAAIA,CAAE,EAClBA,EAAKtF,EAAG,IAAIsF,EAAIA,CAAE,EACX,IAAIzB,EAAMuB,EAAIC,EAAIC,CAAE,CAC7B,CAMA,IAAI1B,EAAY,CACdD,EAAeC,CAAK,EACpB,GAAM,CAAE,GAAIe,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAK,KAC7B,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKpB,EAC/BwB,EAAKpF,EAAG,KAAMqF,EAAKrF,EAAG,KAAMsF,EAAKtF,EAAG,KAClCC,EAAI8B,EAAM,EACVoD,EAAKnF,EAAG,IAAI+B,EAAM,EAAGH,EAAG,EAC1B2D,EAAKvF,EAAG,IAAI2E,EAAIG,CAAE,EAClBU,EAAKxF,EAAG,IAAI4E,EAAIG,CAAE,EAClBU,EAAKzF,EAAG,IAAI6E,EAAIG,CAAE,EAClBU,EAAK1F,EAAG,IAAI2E,EAAIC,CAAE,EAClBe,EAAK3F,EAAG,IAAI8E,EAAIC,CAAE,EACtBW,EAAK1F,EAAG,IAAI0F,EAAIC,CAAE,EAClBA,EAAK3F,EAAG,IAAIuF,EAAIC,CAAE,EAClBE,EAAK1F,EAAG,IAAI0F,EAAIC,CAAE,EAClBA,EAAK3F,EAAG,IAAI2E,EAAIE,CAAE,EAClB,IAAIe,EAAK5F,EAAG,IAAI8E,EAAIE,CAAE,EACtB,OAAAW,EAAK3F,EAAG,IAAI2F,EAAIC,CAAE,EAClBA,EAAK5F,EAAG,IAAIuF,EAAIE,CAAE,EAClBE,EAAK3F,EAAG,IAAI2F,EAAIC,CAAE,EAClBA,EAAK5F,EAAG,IAAI4E,EAAIC,CAAE,EAClBO,EAAKpF,EAAG,IAAI+E,EAAIC,CAAE,EAClBY,EAAK5F,EAAG,IAAI4F,EAAIR,CAAE,EAClBA,EAAKpF,EAAG,IAAIwF,EAAIC,CAAE,EAClBG,EAAK5F,EAAG,IAAI4F,EAAIR,CAAE,EAClBE,EAAKtF,EAAG,IAAIC,EAAG0F,CAAE,EACjBP,EAAKpF,EAAG,IAAImF,EAAIM,CAAE,EAClBH,EAAKtF,EAAG,IAAIoF,EAAIE,CAAE,EAClBF,EAAKpF,EAAG,IAAIwF,EAAIF,CAAE,EAClBA,EAAKtF,EAAG,IAAIwF,EAAIF,CAAE,EAClBD,EAAKrF,EAAG,IAAIoF,EAAIE,CAAE,EAClBE,EAAKxF,EAAG,IAAIuF,EAAIA,CAAE,EAClBC,EAAKxF,EAAG,IAAIwF,EAAID,CAAE,EAClBE,EAAKzF,EAAG,IAAIC,EAAGwF,CAAE,EACjBE,EAAK3F,EAAG,IAAImF,EAAIQ,CAAE,EAClBH,EAAKxF,EAAG,IAAIwF,EAAIC,CAAE,EAClBA,EAAKzF,EAAG,IAAIuF,EAAIE,CAAE,EAClBA,EAAKzF,EAAG,IAAIC,EAAGwF,CAAE,EACjBE,EAAK3F,EAAG,IAAI2F,EAAIF,CAAE,EAClBF,EAAKvF,EAAG,IAAIwF,EAAIG,CAAE,EAClBN,EAAKrF,EAAG,IAAIqF,EAAIE,CAAE,EAClBA,EAAKvF,EAAG,IAAI4F,EAAID,CAAE,EAClBP,EAAKpF,EAAG,IAAI0F,EAAIN,CAAE,EAClBA,EAAKpF,EAAG,IAAIoF,EAAIG,CAAE,EAClBA,EAAKvF,EAAG,IAAI0F,EAAIF,CAAE,EAClBF,EAAKtF,EAAG,IAAI4F,EAAIN,CAAE,EAClBA,EAAKtF,EAAG,IAAIsF,EAAIC,CAAE,EACX,IAAI1B,EAAMuB,EAAIC,EAAIC,CAAE,CAC7B,CAEA,SAAS1B,EAAY,CACnB,OAAO,KAAK,IAAIA,EAAM,OAAM,CAAE,CAChC,CAEQ,KAAG,CACT,OAAO,KAAK,OAAOC,EAAM,IAAI,CAC/B,CACQ,KAAKR,EAAS,CACpB,OAAOwC,EAAK,WAAW,KAAMnC,EAAkBL,EAAIyC,GAAiB,CAClE,IAAMzB,EAAQrE,EAAG,YAAY8F,EAAK,IAAK7B,GAAMA,EAAE,EAAE,CAAC,EAClD,OAAO6B,EAAK,IAAI,CAAC7B,EAAGE,IAAMF,EAAE,SAASI,EAAMF,CAAC,CAAC,CAAC,EAAE,IAAIN,EAAM,UAAU,CACtE,CAAC,CACH,CAOA,eAAeR,EAAS,CACtB,IAAM0C,EAAIlC,EAAM,KAChB,GAAIR,IAAM5B,GAAK,OAAOsE,EAEtB,GADAhD,EAASM,CAAC,EACNA,IAAM3B,GAAK,OAAO,KACtB,GAAM,CAAE,KAAA3B,CAAI,EAAKgC,EACjB,GAAI,CAAChC,EAAM,OAAO8F,EAAK,aAAa,KAAMxC,CAAC,EAG3C,GAAI,CAAE,MAAA2C,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAC,CAAE,EAAKpG,EAAK,YAAYsD,CAAC,EAC7C+C,EAAML,EACNM,EAAMN,EACNO,EAAW,KACf,KAAOL,EAAKxE,IAAO0E,EAAK1E,IAClBwE,EAAKvE,KAAK0E,EAAMA,EAAI,IAAIE,CAAC,GACzBH,EAAKzE,KAAK2E,EAAMA,EAAI,IAAIC,CAAC,GAC7BA,EAAIA,EAAE,OAAM,EACZL,IAAOvE,GACPyE,IAAOzE,GAET,OAAIsE,IAAOI,EAAMA,EAAI,OAAM,GACvBF,IAAOG,EAAMA,EAAI,OAAM,GAC3BA,EAAM,IAAIxC,EAAM7D,EAAG,IAAIqG,EAAI,GAAItG,EAAK,IAAI,EAAGsG,EAAI,GAAIA,EAAI,EAAE,EAClDD,EAAI,IAAIC,CAAG,CACpB,CAWA,SAASE,EAAc,CACrBxD,EAASwD,CAAM,EACf,IAAIlD,EAAIkD,EACJrE,EAAcsE,EACZ,CAAE,KAAAzG,CAAI,EAAKgC,EACjB,GAAIhC,EAAM,CACR,GAAM,CAAE,MAAAiG,EAAO,GAAAC,EAAI,MAAAC,EAAO,GAAAC,CAAE,EAAKpG,EAAK,YAAYsD,CAAC,EAC/C,CAAE,EAAG+C,EAAK,EAAGK,CAAG,EAAK,KAAK,KAAKR,CAAE,EACjC,CAAE,EAAGI,EAAK,EAAGK,CAAG,EAAK,KAAK,KAAKP,CAAE,EACrCC,EAAMP,EAAK,gBAAgBG,EAAOI,CAAG,EACrCC,EAAMR,EAAK,gBAAgBK,EAAOG,CAAG,EACrCA,EAAM,IAAIxC,EAAM7D,EAAG,IAAIqG,EAAI,GAAItG,EAAK,IAAI,EAAGsG,EAAI,GAAIA,EAAI,EAAE,EACzDnE,EAAQkE,EAAI,IAAIC,CAAG,EACnBG,EAAOC,EAAI,IAAIC,CAAG,MACb,CACL,GAAM,CAAE,EAAAzC,EAAG,EAAA0C,CAAC,EAAK,KAAK,KAAKtD,CAAC,EAC5BnB,EAAQ+B,EACRuC,EAAOG,EAGT,OAAO9C,EAAM,WAAW,CAAC3B,EAAOsE,CAAI,CAAC,EAAE,CAAC,CAC1C,CAQA,qBAAqBI,EAAU3G,EAAW,EAAS,CACjD,IAAM4G,EAAIhD,EAAM,KACViD,EAAM,CACVxC,EACArE,IACIA,IAAMwB,IAAOxB,IAAMyB,IAAO,CAAC4C,EAAE,OAAOuC,CAAC,EAAIvC,EAAE,eAAerE,CAAC,EAAIqE,EAAE,SAASrE,CAAC,EAC3E8G,EAAMD,EAAI,KAAM7G,CAAC,EAAE,IAAI6G,EAAIF,EAAG,CAAC,CAAC,EACtC,OAAOG,EAAI,IAAG,EAAK,OAAYA,CACjC,CAKA,SAASC,EAAM,CACb,GAAM,CAAE,GAAIxE,EAAG,GAAIC,EAAG,GAAIwE,CAAC,EAAK,KAC1B/C,EAAM,KAAK,IAAG,EAGhB8C,GAAM,OAAMA,EAAK9C,EAAMlE,EAAG,IAAMA,EAAG,IAAIiH,CAAC,GAC5C,IAAMC,EAAKlH,EAAG,IAAIwC,EAAGwE,CAAE,EACjBG,EAAKnH,EAAG,IAAIyC,EAAGuE,CAAE,EACjBI,EAAKpH,EAAG,IAAIiH,EAAGD,CAAE,EACvB,GAAI9C,EAAK,MAAO,CAAE,EAAGlE,EAAG,KAAM,EAAGA,EAAG,IAAI,EACxC,GAAI,CAACA,EAAG,IAAIoH,EAAIpH,EAAG,GAAG,EAAG,MAAM,IAAI,MAAM,kBAAkB,EAC3D,MAAO,CAAE,EAAGkH,EAAI,EAAGC,CAAE,CACvB,CACA,eAAa,CACX,GAAM,CAAEE,EAAa,cAAAC,CAAa,EAAKvF,EACvC,GAAIsF,IAAa3F,GAAK,MAAO,GAC7B,GAAI4F,EAAe,OAAOA,EAAczD,EAAO,IAAI,EACnD,MAAM,IAAI,MAAM,8DAA8D,CAChF,CACA,eAAa,CACX,GAAM,CAAEwD,EAAa,cAAAE,CAAa,EAAKxF,EACvC,OAAIsF,IAAa3F,GAAY,KACzB6F,EAAsBA,EAAc1D,EAAO,IAAI,EAC5C,KAAK,eAAe9B,EAAM,CAAC,CACpC,CAEA,WAAWyF,EAAe,GAAI,CAC5B,YAAK,eAAc,EACZxF,EAAQ6B,EAAO,KAAM2D,CAAY,CAC1C,CAEA,MAAMA,EAAe,GAAI,CACvB,OAAUlE,GAAW,KAAK,WAAWkE,CAAY,CAAC,CACpD,EA9UgB3D,EAAA,KAAO,IAAIA,EAAM9B,EAAM,GAAIA,EAAM,GAAI/B,EAAG,GAAG,EAC3C6D,EAAA,KAAO,IAAIA,EAAM7D,EAAG,KAAMA,EAAG,IAAKA,EAAG,IAAI,EA+U3D,IAAMyH,EAAQ1F,EAAM,WACd8D,EAAO6B,GAAK7D,EAAO9B,EAAM,KAAO,KAAK,KAAK0F,EAAQ,CAAC,EAAIA,CAAK,EAElE,MAAO,CACL,MAAA1F,EACA,gBAAiB8B,EACjB,uBAAAb,EACA,oBAAAN,EACA,mBAAAI,EAEJ,CAwCA,SAAS6E,GAAahI,EAAgB,CACpC,IAAMC,EAAOC,GAAcF,CAAK,EAChC,OAAGG,GACDF,EACA,CACE,KAAM,OACN,KAAM,WACN,YAAa,YAEf,CACE,SAAU,WACV,cAAe,WACf,KAAM,UACP,EAEI,OAAO,OAAO,CAAE,KAAM,GAAM,GAAGA,CAAI,CAAW,CACvD,CAkBM,SAAUgI,GAAYC,EAAmB,CAC7C,IAAM9F,EAAQ4F,GAAaE,CAAQ,EAC7B,CAAE,GAAA7H,EAAI8H,CAAc,EAAK/F,EACzBgG,EAAgB/H,EAAG,MAAQ,EAC3BgI,EAAkB,EAAIhI,EAAG,MAAQ,EAEvC,SAASiI,EAAoB7G,EAAW,CACtC,OAAOK,GAAML,GAAOA,EAAMpB,EAAG,KAC/B,CACA,SAASkI,EAAKjI,EAAS,CACrB,OAAWwD,GAAIxD,EAAG6H,CAAW,CAC/B,CACA,SAASK,EAAKlI,EAAS,CACrB,OAAWmI,GAAOnI,EAAG6H,CAAW,CAClC,CAEA,GAAM,CACJ,gBAAiBjE,EACjB,uBAAAb,EACA,oBAAAN,EACA,mBAAAI,CAAkB,EAChBhB,GAAkB,CACpB,GAAGC,EACH,QAAQE,EAAIC,EAAOsF,EAAqB,CACtC,IAAMvH,EAAIiC,EAAM,SAAQ,EAClBM,EAAIxC,EAAG,QAAQC,EAAE,CAAC,EAClBoI,EAASjG,GACf,OAAIoF,EACKa,EAAI,WAAW,KAAK,CAACnG,EAAM,SAAQ,EAAK,EAAO,CAAI,CAAC,EAAGM,CAAC,EAExD6F,EAAI,WAAW,KAAK,CAAC,CAAI,CAAC,EAAG7F,EAAGxC,EAAG,QAAQC,EAAE,CAAC,CAAC,CAE1D,EACA,UAAUqC,EAAiB,CACzB,IAAM7B,EAAM6B,EAAM,OACZgG,EAAOhG,EAAM,CAAC,EACdC,EAAOD,EAAM,SAAS,CAAC,EAE7B,GAAI7B,IAAQsH,IAAkBO,IAAS,GAAQA,IAAS,GAAO,CAC7D,IAAM9F,EAAOe,GAAgBhB,CAAI,EACjC,GAAI,CAAC0F,EAAoBzF,CAAC,EAAG,MAAM,IAAI,MAAM,uBAAuB,EACpE,IAAM+F,EAAK7F,EAAoBF,CAAC,EAC5BC,EAAIzC,EAAG,KAAKuI,CAAE,EACZC,GAAU/F,EAAIf,MAASA,GAG7B,OADmB4G,EAAO,KAAO,IACfE,IAAQ/F,EAAIzC,EAAG,IAAIyC,CAAC,GAC/B,CAAE,EAAAD,EAAG,EAAAC,CAAC,UACJhC,IAAQuH,GAAmBM,IAAS,EAAM,CACnD,IAAM9F,EAAIxC,EAAG,UAAUuC,EAAK,SAAS,EAAGvC,EAAG,KAAK,CAAC,EAC3CyC,EAAIzC,EAAG,UAAUuC,EAAK,SAASvC,EAAG,MAAO,EAAIA,EAAG,KAAK,CAAC,EAC5D,MAAO,CAAE,EAAAwC,EAAG,EAAAC,CAAC,MAEb,OAAM,IAAI,MACR,mBAAmBhC,CAAG,0BAA0BsH,CAAa,wBAAwBC,CAAe,qBAAqB,CAG/H,EACD,EACKS,EAAiBrH,GAClBkC,GAAcoF,GAAgBtH,EAAKW,EAAM,WAAW,CAAC,EAE1D,SAAS4G,EAAsBC,EAAc,CAC3C,IAAMC,EAAOf,GAAepG,GAC5B,OAAOkH,EAASC,CAClB,CAEA,SAASC,EAAW/H,EAAS,CAC3B,OAAO4H,EAAsB5H,CAAC,EAAImH,EAAK,CAACnH,CAAC,EAAIA,CAC/C,CAEA,IAAMgI,EAAS,CAACpG,EAAeqG,EAAcC,IAAkB1F,GAAgBZ,EAAE,MAAMqG,EAAMC,CAAE,CAAC,EAKhG,MAAMC,CAAS,CACb,YAAqBrI,EAAoBE,EAAoBoI,EAAiB,CAAzD,KAAA,EAAAtI,EAAoB,KAAA,EAAAE,EAAoB,KAAA,SAAAoI,EAC3D,KAAK,eAAc,CACrB,CAGA,OAAO,YAAYxI,EAAQ,CACzB,IAAMC,EAAImB,EAAM,YAChB,OAAApB,EAAM6C,GAAY,mBAAoB7C,EAAKC,EAAI,CAAC,EACzC,IAAIsI,EAAUH,EAAOpI,EAAK,EAAGC,CAAC,EAAGmI,EAAOpI,EAAKC,EAAG,EAAIA,CAAC,CAAC,CAC/D,CAIA,OAAO,QAAQD,EAAQ,CACrB,GAAM,CAAE,EAAAE,EAAG,EAAAE,CAAC,EAAKV,GAAI,MAAMmD,GAAY,MAAO7C,CAAG,CAAC,EAClD,OAAO,IAAIuI,EAAUrI,EAAGE,CAAC,CAC3B,CAEA,gBAAc,CAEZ,GAAI,CAAC+B,EAAmB,KAAK,CAAC,EAAG,MAAM,IAAI,MAAM,2BAA2B,EAC5E,GAAI,CAACA,EAAmB,KAAK,CAAC,EAAG,MAAM,IAAI,MAAM,2BAA2B,CAC9E,CAEA,eAAeqG,EAAgB,CAC7B,OAAO,IAAID,EAAU,KAAK,EAAG,KAAK,EAAGC,CAAQ,CAC/C,CAEA,iBAAiBC,EAAY,CAC3B,GAAM,CAAE,EAAAvI,EAAG,EAAAE,EAAG,SAAUsI,CAAG,EAAK,KAC1BlI,EAAImI,EAAc9F,GAAY,UAAW4F,CAAO,CAAC,EACvD,GAAIC,GAAO,MAAQ,CAAC,CAAC,EAAG,EAAG,EAAG,CAAC,EAAE,SAASA,CAAG,EAAG,MAAM,IAAI,MAAM,qBAAqB,EACrF,IAAME,EAAOF,IAAQ,GAAKA,IAAQ,EAAIxI,EAAIkB,EAAM,EAAIlB,EACpD,GAAI0I,GAAQvJ,EAAG,MAAO,MAAM,IAAI,MAAM,4BAA4B,EAClE,IAAMwJ,EAAUH,EAAM,EAAkB,KAAP,KAC3BI,EAAI5F,EAAM,QAAQ2F,EAASf,EAAcc,CAAI,CAAC,EAC9CG,EAAKvB,EAAKoB,CAAI,EACdI,EAAKzB,EAAK,CAAC/G,EAAIuI,CAAE,EACjBE,GAAK1B,EAAKnH,EAAI2I,CAAE,EAChB9C,EAAI/C,EAAM,KAAK,qBAAqB4F,EAAGE,EAAIC,EAAE,EACnD,GAAI,CAAChD,EAAG,MAAM,IAAI,MAAM,mBAAmB,EAC3C,OAAAA,EAAE,eAAc,EACTA,CACT,CAGA,UAAQ,CACN,OAAO+B,EAAsB,KAAK,CAAC,CACrC,CAEA,YAAU,CACR,OAAO,KAAK,SAAQ,EAAK,IAAIO,EAAU,KAAK,EAAGhB,EAAK,CAAC,KAAK,CAAC,EAAG,KAAK,QAAQ,EAAI,IACjF,CAGA,eAAa,CACX,OAAU2B,GAAW,KAAK,SAAQ,CAAE,CACtC,CACA,UAAQ,CACN,OAAOxJ,GAAI,WAAW,CAAE,EAAG,KAAK,EAAG,EAAG,KAAK,CAAC,CAAE,CAChD,CAGA,mBAAiB,CACf,OAAUwJ,GAAW,KAAK,aAAY,CAAE,CAC1C,CACA,cAAY,CACV,OAAOpB,EAAc,KAAK,CAAC,EAAIA,EAAc,KAAK,CAAC,CACrD,EAIF,IAAMqB,EAAQ,CACZ,kBAAkBvF,EAAmB,CACnC,GAAI,CACF,OAAAvB,EAAuBuB,CAAU,EAC1B,QACO,CACd,MAAO,GAEX,EACA,uBAAwBvB,EAMxB,iBAAkB,IAAiB,CACjC,IAAM+G,EAAaC,GAAiBjI,EAAM,CAAC,EAC3C,OAAWkI,GAAelI,EAAM,YAAYgI,CAAM,EAAGhI,EAAM,CAAC,CAC9D,EAUA,WAAWyC,EAAa,EAAGtC,EAAQ2B,EAAM,KAAI,CAC3C,OAAA3B,EAAM,eAAesC,CAAU,EAC/BtC,EAAM,SAAS,OAAO,CAAC,CAAC,EACjBA,CACT,GASF,SAASgI,EAAa3F,EAAqBiD,EAAe,GAAI,CAC5D,OAAO3D,EAAM,eAAeU,CAAU,EAAE,WAAWiD,CAAY,CACjE,CAKA,SAAS2C,EAAUC,EAAsB,CACvC,IAAMC,EAAMD,aAAgB,WACtBE,EAAM,OAAOF,GAAS,SACtB3J,GAAO4J,GAAOC,IAASF,EAAa,OAC1C,OAAIC,EAAY5J,IAAQsH,GAAiBtH,IAAQuH,EAC7CsC,EAAY7J,IAAQ,EAAIsH,GAAiBtH,IAAQ,EAAIuH,EACrDoC,aAAgBvG,CAEtB,CAYA,SAAS0G,EAAgBC,EAAmBC,EAAcjD,EAAe,GAAI,CAC3E,GAAI2C,EAAUK,CAAQ,EAAG,MAAM,IAAI,MAAM,+BAA+B,EACxE,GAAI,CAACL,EAAUM,CAAO,EAAG,MAAM,IAAI,MAAM,+BAA+B,EAExE,OADU5G,EAAM,QAAQ4G,CAAO,EACtB,SAASzH,EAAuBwH,CAAQ,CAAC,EAAE,WAAWhD,CAAY,CAC7E,CAMA,IAAMkD,EACJ3I,EAAM,UACN,SAAUO,EAAiB,CAGzB,IAAMlB,EAASmC,GAAgBjB,CAAK,EAC9BqI,EAAQrI,EAAM,OAAS,EAAIP,EAAM,WACvC,OAAO4I,EAAQ,EAAIvJ,GAAO,OAAOuJ,CAAK,EAAIvJ,CAC5C,EACIkI,EACJvH,EAAM,eACN,SAAUO,EAAiB,CACzB,OAAO4F,EAAKwC,EAASpI,CAAK,CAAC,CAC7B,EAEIsI,EAAgBC,GAAQ9I,EAAM,UAAU,EAI9C,SAAS+I,EAAW1J,EAAW,CAC7B,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,iBAAiB,EAC9D,GAAI,EAAEK,IAAOL,GAAOA,EAAMwJ,GACxB,MAAM,IAAI,MAAM,uBAAuB7I,EAAM,UAAU,EAAE,EAE3D,OAAU2G,GAAgBtH,EAAKW,EAAM,WAAW,CAClD,CAOA,SAASgJ,EAAQ3B,EAAc7E,EAAqB3E,EAAOoL,EAAc,CACvE,GAAI,CAAC,YAAa,WAAW,EAAE,KAAMC,GAAMA,KAAKrL,CAAI,EAClD,MAAM,IAAI,MAAM,qCAAqC,EACvD,GAAM,CAAE,KAAAsL,EAAM,YAAAC,CAAW,EAAKpJ,EAC1B,CAAE,KAAAqJ,EAAM,QAAAC,EAAS,aAAcC,CAAG,EAAK1L,EACvCwL,GAAQ,OAAMA,EAAO,IACzBhC,EAAU5F,GAAY,UAAW4F,CAAO,EACpCiC,IAASjC,EAAU5F,GAAY,oBAAqB0H,EAAK9B,CAAO,CAAC,GAKrE,IAAMmC,EAAQjC,EAAcF,CAAO,EAC7B9C,EAAItD,EAAuBuB,CAAU,EACrCiH,EAAW,CAACV,EAAWxE,CAAC,EAAGwE,EAAWS,CAAK,CAAC,EAElD,GAAID,GAAO,KAAM,CAEf,IAAMG,EAAIH,IAAQ,GAAOH,EAAYnL,EAAG,KAAK,EAAIsL,EACjDE,EAAS,KAAKhI,GAAY,eAAgBiI,CAAC,CAAC,EAE9C,IAAMC,GAAUtJ,GAAY,GAAGoJ,CAAQ,EACjClL,EAAIiL,EAEV,SAASI,GAAMC,EAAkB,CAE/B,IAAMX,GAAIP,EAASkB,CAAM,EACzB,GAAI,CAAC9I,EAAmBmI,EAAC,EAAG,OAC5B,IAAMY,GAAK1D,EAAK8C,EAAC,EACXa,EAAIjI,EAAM,KAAK,SAASoH,EAAC,EAAE,SAAQ,EACnCpK,GAAIqH,EAAK4D,EAAE,CAAC,EAClB,GAAIjL,KAAMY,GAAK,OAIf,IAAMV,GAAImH,EAAK2D,GAAK3D,EAAK5H,EAAIO,GAAIyF,CAAC,CAAC,EACnC,GAAIvF,KAAMU,GAAK,OACf,IAAI0H,IAAY2C,EAAE,IAAMjL,GAAI,EAAI,GAAK,OAAOiL,EAAE,EAAIpK,EAAG,EACjDqK,GAAQhL,GACZ,OAAIqK,GAAQzC,EAAsB5H,EAAC,IACjCgL,GAAQjD,EAAW/H,EAAC,EACpBoI,IAAY,GAEP,IAAID,EAAUrI,GAAGkL,GAAO5C,EAAQ,CACzC,CACA,MAAO,CAAE,KAAAuC,GAAM,MAAAC,EAAK,CACtB,CACA,IAAMX,EAA2B,CAAE,KAAMjJ,EAAM,KAAM,QAAS,EAAK,EAC7DiK,EAA0B,CAAE,KAAMjK,EAAM,KAAM,QAAS,EAAK,EAelE,SAASkK,EAAK7C,EAAc8C,EAAkBtM,EAAOoL,EAAc,CACjE,GAAM,CAAE,KAAAU,EAAM,MAAAC,CAAK,EAAKZ,EAAQ3B,EAAS8C,EAAStM,CAAI,EAChDuM,EAAIpK,EAEV,OADgBqK,GAAmCD,EAAE,KAAK,UAAWA,EAAE,YAAaA,EAAE,IAAI,EAC9ET,EAAMC,CAAK,CACzB,CAGA9H,EAAM,KAAK,eAAe,CAAC,EAgB3B,SAASwI,EACPC,EACAlD,EACAmD,EACA3M,EAAOoM,EAAc,CAErB,IAAMQ,EAAKF,EAGX,GAFAlD,EAAU5F,GAAY,UAAW4F,CAAO,EACxCmD,EAAY/I,GAAY,YAAa+I,CAAS,EAC1C,WAAY3M,EAAM,MAAM,IAAI,MAAM,oCAAoC,EAC1E,GAAM,CAAE,KAAAwL,EAAM,QAAAC,CAAO,EAAKzL,EAEtB6M,EACAnI,EACJ,GAAI,CACF,GAAI,OAAOkI,GAAO,UAAYA,aAAc,WAG1C,GAAI,CACFC,EAAOvD,EAAU,QAAQsD,CAAE,QACpBE,EAAU,CACjB,GAAI,EAAEA,aAAoBrM,GAAI,KAAM,MAAMqM,EAC1CD,EAAOvD,EAAU,YAAYsD,CAAE,UAExB,OAAOA,GAAO,UAAY,OAAOA,EAAG,GAAM,UAAY,OAAOA,EAAG,GAAM,SAAU,CACzF,GAAM,CAAE,EAAA3L,EAAG,EAAAE,EAAC,EAAKyL,EACjBC,EAAO,IAAIvD,EAAUrI,EAAGE,EAAC,MAEzB,OAAM,IAAI,MAAM,OAAO,EAEzBuD,EAAIT,EAAM,QAAQ0I,CAAS,QACpBI,EAAO,CACd,GAAKA,EAAgB,UAAY,QAC/B,MAAM,IAAI,MAAM,gEAAgE,EAClF,MAAO,GAET,GAAIvB,GAAQqB,EAAK,SAAQ,EAAI,MAAO,GAChCpB,IAASjC,EAAUrH,EAAM,KAAKqH,CAAO,GACzC,GAAM,CAAE,EAAAvI,EAAG,EAAAE,CAAC,EAAK0L,EACXtL,GAAImI,EAAcF,CAAO,EACzBwD,EAAKzE,EAAKpH,CAAC,EACX4I,GAAKzB,EAAK/G,GAAIyL,CAAE,EAChBhD,EAAK1B,EAAKrH,EAAI+L,CAAE,EAChBnD,GAAI5F,EAAM,KAAK,qBAAqBS,EAAGqF,GAAIC,CAAE,GAAG,SAAQ,EAC9D,OAAKH,GACKvB,EAAKuB,GAAE,CAAC,IACL5I,EAFE,EAGjB,CACA,MAAO,CACL,MAAAkB,EACA,aAAAmI,EACA,gBAAAK,EACA,KAAA0B,EACA,OAAAI,EACA,gBAAiBxI,EACjB,UAAAqF,EACA,MAAAY,EAEJ,CClkCM,IAAO+C,GAAP,cAAuCC,EAAa,CAQxD,YAAYC,EAAaC,EAAW,CAClC,MAAK,EAJC,KAAA,SAAW,GACX,KAAA,UAAY,GAIlBD,GAAWA,CAAI,EACf,IAAME,EAAMC,GAAQF,CAAI,EAExB,GADA,KAAK,MAAQD,EAAK,OAAM,EACpB,OAAO,KAAK,MAAM,QAAW,WAC/B,MAAM,IAAI,MAAM,qDAAqD,EACvE,KAAK,SAAW,KAAK,MAAM,SAC3B,KAAK,UAAY,KAAK,MAAM,UAC5B,IAAMI,EAAW,KAAK,SAChBC,EAAM,IAAI,WAAWD,CAAQ,EAEnCC,EAAI,IAAIH,EAAI,OAASE,EAAWJ,EAAK,OAAM,EAAG,OAAOE,CAAG,EAAE,OAAM,EAAKA,CAAG,EACxE,QAAS,EAAI,EAAG,EAAIG,EAAI,OAAQ,IAAKA,EAAI,CAAC,GAAK,GAC/C,KAAK,MAAM,OAAOA,CAAG,EAErB,KAAK,MAAQL,EAAK,OAAM,EAExB,QAAS,EAAI,EAAG,EAAIK,EAAI,OAAQ,IAAKA,EAAI,CAAC,GAAK,IAC/C,KAAK,MAAM,OAAOA,CAAG,EACrBA,EAAI,KAAK,CAAC,CACZ,CACA,OAAOC,EAAU,CACf,OAAAC,GAAa,IAAI,EACjB,KAAK,MAAM,OAAOD,CAAG,EACd,IACT,CACA,WAAWE,EAAe,CACxBD,GAAa,IAAI,EACjBE,GAAYD,EAAK,KAAK,SAAS,EAC/B,KAAK,SAAW,GAChB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,MAAM,OAAOA,CAAG,EACrB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,QAAO,CACd,CACA,QAAM,CACJ,IAAMA,EAAM,IAAI,WAAW,KAAK,MAAM,SAAS,EAC/C,YAAK,WAAWA,CAAG,EACZA,CACT,CACA,WAAWE,EAAY,CAErBA,IAAAA,EAAO,OAAO,OAAO,OAAO,eAAe,IAAI,EAAG,CAAA,CAAE,GACpD,GAAM,CAAE,MAAAC,EAAO,MAAAC,EAAO,SAAAC,EAAU,UAAAC,EAAW,SAAAV,EAAU,UAAAW,CAAS,EAAK,KACnE,OAAAL,EAAKA,EACLA,EAAG,SAAWG,EACdH,EAAG,UAAYI,EACfJ,EAAG,SAAWN,EACdM,EAAG,UAAYK,EACfL,EAAG,MAAQC,EAAM,WAAWD,EAAG,KAAK,EACpCA,EAAG,MAAQE,EAAM,WAAWF,EAAG,KAAK,EAC7BA,CACT,CACA,SAAO,CACL,KAAK,UAAY,GACjB,KAAK,MAAM,QAAO,EAClB,KAAK,MAAM,QAAO,CACpB,GASWM,GAAO,CAAChB,EAAaE,EAAYe,IAC5C,IAAInB,GAAUE,EAAME,CAAG,EAAE,OAAOe,CAAO,EAAE,OAAM,EACjDD,GAAK,OAAS,CAAChB,EAAaE,IAAe,IAAIJ,GAAUE,EAAME,CAAG,ECzE5D,SAAUgB,GAAQC,EAAW,CACjC,MAAO,CACL,KAAAA,EACA,KAAM,CAACC,KAAoBC,IAAuBC,GAAKH,EAAMC,EAAKG,GAAY,GAAGF,CAAI,CAAC,EACtF,YAAAG,GAEJ,CAGM,SAAUC,GAAYC,EAAoBC,EAAc,CAC5D,IAAMC,EAAUT,GAAgBU,GAAY,CAAE,GAAGH,EAAU,GAAGR,GAAQC,CAAI,CAAC,CAAE,EAC7E,OAAO,OAAO,OAAO,CAAE,GAAGS,EAAOD,CAAO,EAAG,OAAAC,CAAM,CAAE,CACrD,CCTA,IAAME,GAAa,OAAO,oEAAoE,EACxFC,GAAa,OAAO,oEAAoE,EACxFC,GAAM,OAAO,CAAC,EACdC,GAAM,OAAO,CAAC,EACdC,GAAa,CAACC,EAAWC,KAAeD,EAAIC,EAAIH,IAAOG,EAM7D,SAASC,GAAQC,EAAS,CACxB,IAAMC,EAAIT,GAEJU,EAAM,OAAO,CAAC,EAAGC,EAAM,OAAO,CAAC,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAErEC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EAAGC,EAAO,OAAO,EAAE,EACtDC,EAAMT,EAAIA,EAAIA,EAAKC,EACnBS,EAAMD,EAAKA,EAAKT,EAAKC,EACrBU,EAAMC,GAAKF,EAAIR,EAAKD,CAAC,EAAIS,EAAMT,EAC/BY,EAAMD,GAAKD,EAAIT,EAAKD,CAAC,EAAIS,EAAMT,EAC/Ba,EAAOF,GAAKC,EAAIlB,GAAKM,CAAC,EAAIQ,EAAMR,EAChCc,EAAOH,GAAKE,EAAKV,EAAMH,CAAC,EAAIa,EAAOb,EACnCe,EAAOJ,GAAKG,EAAKV,EAAMJ,CAAC,EAAIc,EAAOd,EACnCgB,EAAOL,GAAKI,EAAKT,EAAMN,CAAC,EAAIe,EAAOf,EACnCiB,EAAQN,GAAKK,EAAKT,EAAMP,CAAC,EAAIgB,EAAOhB,EACpCkB,EAAQP,GAAKM,EAAMX,EAAMN,CAAC,EAAIe,EAAOf,EACrCmB,EAAQR,GAAKO,EAAMjB,EAAKD,CAAC,EAAIS,EAAMT,EACnCoB,EAAMT,GAAKQ,EAAMd,EAAML,CAAC,EAAIc,EAAOd,EACnCqB,EAAMV,GAAKS,EAAIlB,EAAKF,CAAC,EAAIQ,EAAMR,EAC/BsB,EAAOX,GAAKU,EAAI3B,GAAKM,CAAC,EAC5B,GAAI,CAACuB,GAAG,IAAIA,GAAG,IAAID,CAAI,EAAGvB,CAAC,EAAG,MAAM,IAAI,MAAM,yBAAyB,EACvE,OAAOuB,CACT,CAEA,IAAMC,GAAKC,GAAMjC,GAAY,OAAW,OAAW,CAAE,KAAMO,EAAO,CAAE,EAEvD2B,GAAYC,GACvB,CACE,EAAG,OAAO,CAAC,EACX,EAAG,OAAO,CAAC,EACX,GAAAH,GACA,EAAG/B,GAEH,GAAI,OAAO,+EAA+E,EAC1F,GAAI,OAAO,+EAA+E,EAC1F,EAAG,OAAO,CAAC,EACX,KAAM,GAON,KAAM,CACJ,KAAM,OAAO,oEAAoE,EACjF,YAAcmC,GAAa,CACzB,IAAMC,EAAIpC,GACJqC,EAAK,OAAO,oCAAoC,EAChDC,EAAK,CAACrC,GAAM,OAAO,oCAAoC,EACvDsC,EAAK,OAAO,qCAAqC,EACjDvB,EAAKqB,EACLG,EAAY,OAAO,qCAAqC,EAExDC,EAAKtC,GAAWa,EAAKmB,EAAGC,CAAC,EACzBM,EAAKvC,GAAW,CAACmC,EAAKH,EAAGC,CAAC,EAC5BO,EAAKC,GAAIT,EAAIM,EAAKJ,EAAKK,EAAKH,EAAIH,CAAC,EACjCS,EAAKD,GAAI,CAACH,EAAKH,EAAKI,EAAK1B,EAAIoB,CAAC,EAC5BU,EAAQH,EAAKH,EACbO,EAAQF,EAAKL,EAGnB,GAFIM,IAAOH,EAAKP,EAAIO,GAChBI,IAAOF,EAAKT,EAAIS,GAChBF,EAAKH,GAAaK,EAAKL,EACzB,MAAM,IAAI,MAAM,uCAAyCL,CAAC,EAE5D,MAAO,CAAE,MAAAW,EAAO,GAAAH,EAAI,MAAAI,EAAO,GAAAF,CAAE,CAC/B,IAGJG,EAAM,EAKFC,GAAM,OAAO,CAAC,EACdC,GAAMC,GAAc,OAAOA,GAAM,UAAYF,GAAME,GAAKA,EAAIpD,GAC5DqD,GAAMD,GAAc,OAAOA,GAAM,UAAYF,GAAME,GAAKA,EAAInD,GAE5DqD,GAAsD,CAAA,EAC5D,SAASC,GAAWC,KAAgBC,EAAsB,CACxD,IAAIC,EAAOJ,GAAqBE,CAAG,EACnC,GAAIE,IAAS,OAAW,CACtB,IAAMC,EAAOV,GAAO,WAAW,KAAKO,EAAMI,GAAMA,EAAE,WAAW,CAAC,CAAC,CAAC,EAChEF,EAAOG,GAAYF,EAAMA,CAAI,EAC7BL,GAAqBE,CAAG,EAAIE,EAE9B,OAAOT,GAAOY,GAAYH,EAAM,GAAGD,CAAQ,CAAC,CAC9C,CAGA,IAAMK,GAAgBC,GAA6BA,EAAM,WAAW,EAAI,EAAE,MAAM,CAAC,EAC3EC,GAAY3B,GAAc4B,GAAgB5B,EAAG,EAAE,EAC/C6B,GAAQd,GAAcP,GAAIO,EAAGpD,EAAU,EACvCmE,GAAQf,GAAcP,GAAIO,EAAGnD,EAAU,EACvCmE,GAAQlC,GAAU,gBAClBmC,GAAU,CAACC,EAAsBjE,EAAWC,IAChD8D,GAAM,KAAK,qBAAqBE,EAAGjE,EAAGC,CAAC,EAGzC,SAASiE,GAAoBC,EAAa,CACxC,IAAIC,EAAKvC,GAAU,MAAM,uBAAuBsC,CAAI,EAChDE,EAAIN,GAAM,eAAeK,CAAE,EAE/B,MAAO,CAAE,OADMC,EAAE,SAAQ,EAAKD,EAAKN,GAAK,CAACM,CAAE,EAClB,MAAOX,GAAaY,CAAC,CAAC,CACjD,CAKA,SAASC,GAAOvB,EAAS,CACvB,GAAI,CAACD,GAAGC,CAAC,EAAG,MAAM,IAAI,MAAM,uBAAuB,EACnD,IAAMwB,EAAKV,GAAKd,EAAIA,CAAC,EACfQ,EAAIM,GAAKU,EAAKxB,EAAI,OAAO,CAAC,CAAC,EAC7B5C,EAAID,GAAQqD,CAAC,EACbpD,EAAIL,KAAQ+C,KAAK1C,EAAI0D,GAAK,CAAC1D,CAAC,GAChC,IAAMkE,EAAI,IAAIN,GAAMhB,EAAG5C,EAAGN,EAAG,EAC7B,OAAAwE,EAAE,eAAc,EACTA,CACT,CAIA,SAASG,MAAaC,EAAkB,CACtC,OAAOX,GAAKY,GAAgBxB,GAAW,oBAAqB,GAAGuB,CAAI,CAAC,CAAC,CACvE,CAKA,SAASE,GAAoBC,EAAe,CAC1C,OAAOV,GAAoBU,CAAU,EAAE,KACzC,CAMA,SAASC,GACPC,EACAF,EACAG,EAAeC,GAAY,EAAE,EAAC,CAE9B,IAAMC,EAAIC,GAAY,UAAWJ,CAAO,EAClC,CAAE,MAAOK,EAAI,OAAQC,CAAC,EAAKlB,GAAoBU,CAAU,EACzD5E,EAAIkF,GAAY,UAAWH,EAAS,EAAE,EACtCM,EAAI1B,GAASyB,EAAIV,GAAgBxB,GAAW,cAAelD,CAAC,CAAC,CAAC,EAC9DsF,EAAOpC,GAAW,gBAAiBmC,EAAGF,EAAIF,CAAC,EAC3CM,EAAKzB,GAAKY,GAAgBY,CAAI,CAAC,EACrC,GAAIC,IAAO1C,GAAK,MAAM,IAAI,MAAM,wBAAwB,EACxD,GAAM,CAAE,MAAO2C,EAAI,OAAQzD,CAAC,EAAKmC,GAAoBqB,CAAE,EACjDE,EAAIjB,GAAUgB,EAAIL,EAAIF,CAAC,EACvBS,EAAM,IAAI,WAAW,EAAE,EAI7B,GAHAA,EAAI,IAAIF,EAAI,CAAC,EACbE,EAAI,IAAI/B,GAASG,GAAK/B,EAAI0D,EAAIL,CAAC,CAAC,EAAG,EAAE,EAEjC,CAACO,GAAcD,EAAKT,EAAGE,CAAE,EAAG,MAAM,IAAI,MAAM,kCAAkC,EAClF,OAAOO,CACT,CAMA,SAASC,GAAcC,EAAgBd,EAAce,EAAc,CACjE,IAAMH,EAAMR,GAAY,YAAaU,EAAW,EAAE,EAC5CX,EAAIC,GAAY,UAAWJ,CAAO,EAClCgB,EAAMZ,GAAY,YAAaW,EAAW,EAAE,EAClD,GAAI,CACF,IAAMzF,EAAIkE,GAAOI,GAAgBoB,CAAG,CAAC,EAC/BC,EAAIrB,GAAgBgB,EAAI,SAAS,EAAG,EAAE,CAAC,EAC7C,GAAI,CAAC5C,GAAGiD,CAAC,EAAG,MAAO,GACnB,IAAMC,EAAItB,GAAgBgB,EAAI,SAAS,GAAI,EAAE,CAAC,EAC9C,GAAI,CAAC1C,GAAGgD,CAAC,EAAG,MAAO,GACnB,IAAMP,EAAIjB,GAAUb,GAASoC,CAAC,EAAGtC,GAAarD,CAAC,EAAG6E,CAAC,EAC7CgB,EAAIjC,GAAQ5D,EAAG4F,EAAGlC,GAAK,CAAC2B,CAAC,CAAC,EAChC,MAAI,GAACQ,GAAK,CAACA,EAAE,SAAQ,GAAMA,EAAE,SAAQ,EAAG,IAAMF,QAEhC,CACd,MAAO,GAEX,CAEO,IAAMG,GAAkC,CAC7C,aAAcvB,GACd,KAAME,GACN,OAAQc,GACR,MAAO,CACL,iBAAkB9D,GAAU,MAAM,iBAClC,OAAAyC,GACA,aAAAb,GACA,gBAAAG,GACA,gBAAAc,GACA,WAAAxB,GACA,IAAAV,KCpNJ,SAAS2D,GAAOC,EAAS,CACvB,GAAI,CAAC,OAAO,cAAcA,CAAC,GAAKA,EAAI,EAAG,MAAM,IAAI,MAAM,kCAAkCA,CAAC,EAAE,CAC9F,CAEA,SAASC,GAAKC,EAAU,CACtB,GAAI,OAAOA,GAAM,UAAW,MAAM,IAAI,MAAM,yBAAyBA,CAAC,EAAE,CAC1E,CAEM,SAAUC,GAAQC,EAAU,CAChC,OACEA,aAAa,YACZA,GAAK,MAAQ,OAAOA,GAAM,UAAYA,EAAE,YAAY,OAAS,YAElE,CAEA,SAASC,EAAMH,KAA8BI,EAAiB,CAC5D,GAAI,CAACH,GAAQD,CAAC,EAAG,MAAM,IAAI,MAAM,qBAAqB,EACtD,GAAII,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAASJ,EAAE,MAAM,EAClD,MAAM,IAAI,MAAM,iCAAiCI,CAAO,mBAAmBJ,EAAE,MAAM,EAAE,CACzF,CAeA,SAASK,GAAOC,EAAeC,EAAgB,GAAI,CACjD,GAAID,EAAS,UAAW,MAAM,IAAI,MAAM,kCAAkC,EAC1E,GAAIC,GAAiBD,EAAS,SAAU,MAAM,IAAI,MAAM,uCAAuC,CACjG,CAEA,SAASE,GAAOC,EAAUH,EAAa,CACrCI,EAAMD,CAAG,EACT,IAAME,EAAML,EAAS,UACrB,GAAIG,EAAI,OAASE,EACf,MAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE,CAElF,CCtCO,IAAMC,GAAMC,GAAoB,IAAI,WAAWA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAGzF,IAAMC,EAAOC,GAClB,IAAI,YAAYA,EAAI,OAAQA,EAAI,WAAY,KAAK,MAAMA,EAAI,WAAa,CAAC,CAAC,EAG/DC,GAAcD,GACzB,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAI5CE,GAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAChF,GAAI,CAACA,GAAM,MAAM,IAAI,MAAM,6CAA6C,EA0FlE,SAAUC,GAAYC,EAAW,CACrC,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,wBAAwB,OAAOA,CAAG,EAAE,EACjF,OAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAOA,CAAG,CAAC,CACrD,CAeM,SAAUC,GAAQC,EAAW,CACjC,GAAI,OAAOA,GAAS,SAAUA,EAAOC,GAAYD,CAAI,UAC5CE,GAAQF,CAAI,EAAGA,EAAOA,EAAK,MAAK,MACpC,OAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE,EAC9D,OAAOA,CACT,CAsBM,SAAUG,GACdC,EACAC,EAAQ,CAER,GAAIA,GAAQ,MAAQ,OAAOA,GAAS,SAAU,MAAM,IAAI,MAAM,yBAAyB,EAEvF,OADe,OAAO,OAAOD,EAAUC,CAAI,CAE7C,CAGM,SAAUC,GAAWC,EAAeC,EAAa,CACrD,GAAID,EAAE,SAAWC,EAAE,OAAQ,MAAO,GAClC,IAAIC,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIH,EAAE,OAAQG,IAAKD,GAAQF,EAAEG,CAAC,EAAIF,EAAEE,CAAC,EACrD,OAAOD,IAAS,CAClB,CA0CO,IAAME,GAAa,CACxBC,EACAC,KAEA,OAAO,OAAOA,EAAGD,CAAM,EAChBC,GAYH,SAAUC,GACdC,EACAC,EACAC,EACAC,EAAa,CAEb,GAAI,OAAOH,EAAK,cAAiB,WAAY,OAAOA,EAAK,aAAaC,EAAYC,EAAOC,CAAI,EAC7F,IAAMC,EAAO,OAAO,EAAE,EAChBC,EAAW,OAAO,UAAU,EAC5BC,EAAK,OAAQJ,GAASE,EAAQC,CAAQ,EACtCE,EAAK,OAAOL,EAAQG,CAAQ,EAC5BG,EAAIL,EAAO,EAAI,EACfM,EAAIN,EAAO,EAAI,EACrBH,EAAK,UAAUC,EAAaO,EAAGF,EAAIH,CAAI,EACvCH,EAAK,UAAUC,EAAaQ,EAAGF,EAAIJ,CAAI,CACzC,CCzOA,IAAMO,GAAa,GAGbC,GAA0B,IAAI,WAAW,EAAE,EAC3CC,GAAUC,EAAIF,EAAO,EACrBG,GAAO,IAKPC,GAAO,CAACC,EAAYC,EAAYC,EAAYC,IAAc,CAC9D,IAAMC,EAAQD,EAAK,EACnB,MAAO,CACL,GAAKD,GAAM,GAAOC,IAAO,EACzB,GAAKF,GAAM,GAAOC,IAAO,EACzB,GAAKF,GAAM,GAAOC,IAAO,EACzB,GAAKD,IAAO,EAAOF,IAAQ,GAAM,EAAEM,EAAQ,GAE/C,EAEMC,GAAUC,IACXA,IAAM,EAAK,MAAS,IACpBA,IAAM,EAAK,MAAS,IACpBA,IAAM,GAAM,MAAS,EACtBA,IAAM,GAAM,IACd,EAMI,SAAUC,GAAYC,EAAa,CACvCA,EAAE,QAAO,EACT,IAAMJ,EAAQI,EAAE,EAAE,EAAI,EAElBC,EAAQ,EACZ,QAASC,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAAK,CACjC,IAAMC,EAAIH,EAAEE,CAAC,EACbF,EAAEE,CAAC,EAAKC,IAAM,EAAKF,EACnBA,GAASE,EAAI,IAAM,CACrB,CACA,OAAAH,EAAE,CAAC,GAAK,CAACJ,EAAQ,IACVI,CACT,CAIA,IAAMI,GAAkBC,GAClBA,EAAQ,GAAK,KAAa,EAC1BA,EAAQ,KAAa,EAClB,EAGHC,GAAN,KAAW,CAYT,YAAYC,EAAYC,EAAuB,CAXtC,KAAA,SAAWtB,GACX,KAAA,UAAYA,GACX,KAAA,GAAK,EACL,KAAA,GAAK,EACL,KAAA,GAAK,EACL,KAAA,GAAK,EACL,KAAA,SAAW,GAMnBqB,EAAME,GAAQF,CAAG,EACjBF,EAAOE,EAAK,EAAE,EACd,IAAMG,EAAQC,GAAWJ,CAAG,EACxBK,EAAKF,EAAM,UAAU,EAAG,EAAK,EAC7BG,EAAKH,EAAM,UAAU,EAAG,EAAK,EAC7BI,EAAKJ,EAAM,UAAU,EAAG,EAAK,EAC7BK,EAAKL,EAAM,UAAU,GAAI,EAAK,EAE5BM,EAAmB,CAAA,EACzB,QAASd,EAAI,EAAGA,EAAI,IAAKA,IACvBc,EAAQ,KAAK,CAAE,GAAInB,GAAOe,CAAE,EAAG,GAAIf,GAAOgB,CAAE,EAAG,GAAIhB,GAAOiB,CAAE,EAAG,GAAIjB,GAAOkB,CAAE,CAAC,CAAE,EAC9E,CAAE,GAAIH,EAAI,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKxB,GAAKqB,EAAIC,EAAIC,EAAIC,CAAE,EAE3D,IAAME,EAAIb,GAAeI,GAAkB,IAAI,EAC/C,GAAI,CAAC,CAAC,EAAG,EAAG,EAAG,CAAC,EAAE,SAASS,CAAC,EAC1B,MAAM,IAAI,MAAM,4BAA4BA,CAAC,uBAAuB,EACtE,KAAK,EAAIA,EAET,IAAMC,EADO,IACUD,EACjBE,EAAc,KAAK,WAAa,GAAKF,EACrCG,EAAiB,CAAA,EAEvB,QAASC,EAAI,EAAGA,EAAIH,EAASG,IAE3B,QAASC,EAAO,EAAGA,EAAOH,EAAYG,IAAQ,CAE5C,IAAI9B,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EACjC,QAAS4B,EAAI,EAAGA,EAAIN,EAAGM,IAAK,CAE1B,GAAI,EADSD,IAAUL,EAAIM,EAAI,EAAM,GAC3B,SACV,GAAM,CAAE,GAAIC,EAAI,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKX,EAAQC,EAAII,EAAIE,CAAC,EAC3D/B,GAAMgC,EAAM/B,GAAMgC,EAAM/B,GAAMgC,EAAM/B,GAAMgC,CAC7C,CACAP,EAAM,KAAK,CAAE,GAAA5B,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,CAAE,CAC/B,CAEF,KAAK,EAAIyB,CACX,CACU,aAAa5B,EAAYC,EAAYC,EAAYC,EAAU,CAClEH,GAAM,KAAK,GAAMC,GAAM,KAAK,GAAMC,GAAM,KAAK,GAAMC,GAAM,KAAK,GAC/D,GAAM,CAAE,EAAAsB,EAAG,EAAAd,EAAG,WAAAgB,CAAU,EAAK,KAEzBS,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAC3BC,GAAQ,GAAKf,GAAK,EACpBI,EAAI,EACR,QAAWY,IAAO,CAACzC,EAAIC,EAAIC,EAAIC,CAAE,EAC/B,QAASuC,EAAU,EAAGA,EAAU,EAAGA,IAAW,CAC5C,IAAMZ,EAAQW,IAAS,EAAIC,EAAY,IACvC,QAASC,EAAS,EAAIlB,EAAI,EAAGkB,GAAU,EAAGA,IAAU,CAClD,IAAMC,EAAOd,IAAUL,EAAIkB,EAAWH,EAChC,CAAE,GAAIK,EAAI,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKrC,EAAEkB,EAAIF,EAAaiB,CAAG,EAChER,GAAMS,EAAMR,GAAMS,EAAMR,GAAMS,EAAMR,GAAMS,EAC3CnB,GAAK,CACP,CACF,CAEF,KAAK,GAAKO,EACV,KAAK,GAAKC,EACV,KAAK,GAAKC,EACV,KAAK,GAAKC,CACZ,CACA,OAAOU,EAAW,CAChBA,EAAOhC,GAAQgC,CAAI,EACnBC,GAAQ,IAAI,EACZ,IAAMC,EAAMtD,EAAIoD,CAAI,EACdG,EAAS,KAAK,MAAMH,EAAK,OAASvD,EAAU,EAC5C2D,EAAOJ,EAAK,OAASvD,GAC3B,QAASgB,EAAI,EAAGA,EAAI0C,EAAQ1C,IAC1B,KAAK,aAAayC,EAAIzC,EAAI,EAAI,CAAC,EAAGyC,EAAIzC,EAAI,EAAI,CAAC,EAAGyC,EAAIzC,EAAI,EAAI,CAAC,EAAGyC,EAAIzC,EAAI,EAAI,CAAC,CAAC,EAElF,OAAI2C,IACF1D,GAAQ,IAAIsD,EAAK,SAASG,EAAS1D,EAAU,CAAC,EAC9C,KAAK,aAAaE,GAAQ,CAAC,EAAGA,GAAQ,CAAC,EAAGA,GAAQ,CAAC,EAAGA,GAAQ,CAAC,CAAC,EAChEA,GAAQ,KAAK,CAAC,GAET,IACT,CACA,SAAO,CACL,GAAM,CAAE,CAAC,EAAK,KAEd,QAAW0D,KAAO,EACfA,EAAI,GAAK,EAAKA,EAAI,GAAK,EAAKA,EAAI,GAAK,EAAKA,EAAI,GAAK,CAExD,CACA,WAAWC,EAAe,CACxBL,GAAQ,IAAI,EACZM,GAAQD,EAAK,IAAI,EACjB,KAAK,SAAW,GAChB,GAAM,CAAE,GAAAvD,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAK,KACrBsD,EAAM5D,EAAI0D,CAAG,EACnB,OAAAE,EAAI,CAAC,EAAIzD,EACTyD,EAAI,CAAC,EAAIxD,EACTwD,EAAI,CAAC,EAAIvD,EACTuD,EAAI,CAAC,EAAItD,EACFoD,CACT,CACA,QAAM,CACJ,IAAMG,EAAM,IAAI,WAAWhE,EAAU,EACrC,YAAK,WAAWgE,CAAG,EACnB,KAAK,QAAO,EACLA,CACT,GAGIC,GAAN,cAAsB7C,EAAK,CACzB,YAAYC,EAAYC,EAAuB,CAC7CD,EAAME,GAAQF,CAAG,EACjB,IAAM6C,EAAQrD,GAAYQ,EAAI,MAAK,CAAE,EACrC,MAAM6C,EAAO5C,CAAc,EAC3B4C,EAAM,KAAK,CAAC,CACd,CACA,OAAOX,EAAW,CAChBA,EAAOhC,GAAQgC,CAAI,EACnBC,GAAQ,IAAI,EACZ,IAAMC,EAAMtD,EAAIoD,CAAI,EACdI,EAAOJ,EAAK,OAASvD,GACrB0D,EAAS,KAAK,MAAMH,EAAK,OAASvD,EAAU,EAClD,QAASgB,EAAI,EAAGA,EAAI0C,EAAQ1C,IAC1B,KAAK,aACHL,GAAO8C,EAAIzC,EAAI,EAAI,CAAC,CAAC,EACrBL,GAAO8C,EAAIzC,EAAI,EAAI,CAAC,CAAC,EACrBL,GAAO8C,EAAIzC,EAAI,EAAI,CAAC,CAAC,EACrBL,GAAO8C,EAAIzC,EAAI,EAAI,CAAC,CAAC,CAAC,EAG1B,OAAI2C,IACF1D,GAAQ,IAAIsD,EAAK,SAASG,EAAS1D,EAAU,CAAC,EAC9C,KAAK,aACHW,GAAOT,GAAQ,CAAC,CAAC,EACjBS,GAAOT,GAAQ,CAAC,CAAC,EACjBS,GAAOT,GAAQ,CAAC,CAAC,EACjBS,GAAOT,GAAQ,CAAC,CAAC,CAAC,EAEpBA,GAAQ,KAAK,CAAC,GAET,IACT,CACA,WAAW2D,EAAe,CACxBL,GAAQ,IAAI,EACZM,GAAQD,EAAK,IAAI,EACjB,KAAK,SAAW,GAEhB,GAAM,CAAE,GAAAvD,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAK,KACrBsD,EAAM5D,EAAI0D,CAAG,EACnB,OAAAE,EAAI,CAAC,EAAIzD,EACTyD,EAAI,CAAC,EAAIxD,EACTwD,EAAI,CAAC,EAAIvD,EACTuD,EAAI,CAAC,EAAItD,EACFoD,EAAI,QAAO,CACpB,GAIF,SAASM,GACPC,EAA0D,CAE1D,IAAMC,EAAQ,CAACC,EAAYjD,IACzB+C,EAAS/C,EAAKiD,EAAI,MAAM,EAAE,OAAO/C,GAAQ+C,CAAG,CAAC,EAAE,OAAM,EACjDC,EAAMH,EAAS,IAAI,WAAW,EAAE,EAAG,CAAC,EAC1C,OAAAC,EAAM,UAAYE,EAAI,UACtBF,EAAM,SAAWE,EAAI,SACrBF,EAAM,OAAS,CAAChD,EAAYC,IAA4B8C,EAAS/C,EAAKC,CAAc,EAC7E+C,CACT,CAEO,IAAMG,GAAQL,GACnB,CAAC9C,EAAKC,IAAmB,IAAIF,GAAMC,EAAKC,CAAc,CAAC,EAE5CmD,GAAUN,GACrB,CAAC9C,EAAKC,IAAmB,IAAI2C,GAAQ5C,EAAKC,CAAc,CAAC,EChO3D,IAAMoD,GAAa,GACbC,GAAe,EACfC,GAAc,IAAI,WAAWF,EAAU,EACvCG,GAAO,IAGb,SAASC,GAAKC,EAAS,CACrB,OAAQA,GAAK,EAAMF,GAAO,EAAEE,GAAK,EACnC,CAEA,SAASC,GAAIC,EAAWC,EAAS,CAC/B,IAAIC,EAAM,EACV,KAAOD,EAAI,EAAGA,IAAM,EAElBC,GAAOF,EAAI,EAAEC,EAAI,GACjBD,EAAIH,GAAKG,CAAC,EAEZ,OAAOE,CACT,CAIA,IAAMC,IAAwB,IAAK,CACjC,IAAIC,EAAI,IAAI,WAAW,GAAG,EAC1B,QAASC,EAAI,EAAGC,EAAI,EAAGD,EAAI,IAAKA,IAAKC,GAAKT,GAAKS,CAAC,EAAGF,EAAEC,CAAC,EAAIC,EAC1D,IAAMC,EAAM,IAAI,WAAW,GAAG,EAC9BA,EAAI,CAAC,EAAI,GACT,QAASF,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B,IAAIC,EAAIF,EAAE,IAAMC,CAAC,EACjBC,GAAKA,GAAK,EACVC,EAAIH,EAAEC,CAAC,CAAC,GAAKC,EAAKA,GAAK,EAAMA,GAAK,EAAMA,GAAK,EAAMA,GAAK,EAAK,IAAQ,GACvE,CACA,OAAOC,CACT,GAAE,EAGIC,GAA0BL,GAAK,IAAI,CAACM,EAAGC,IAAMP,GAAK,QAAQO,CAAC,CAAC,EAG5DC,GAAYb,GAAeA,GAAK,GAAOA,IAAM,EAC7Cc,GAAYd,GAAeA,GAAK,EAAMA,IAAM,GAMlD,SAASe,GAAUV,EAAkBW,EAAyB,CAC5D,GAAIX,EAAK,SAAW,IAAK,MAAM,IAAI,MAAM,mBAAmB,EAC5D,IAAMY,EAAK,IAAI,YAAY,GAAG,EAAE,IAAI,CAACN,EAAGC,IAAMI,EAAGX,EAAKO,CAAC,CAAC,CAAC,EACnDM,EAAKD,EAAG,IAAIH,EAAQ,EACpBK,EAAKD,EAAG,IAAIJ,EAAQ,EACpBM,EAAKD,EAAG,IAAIL,EAAQ,EACpBO,EAAM,IAAI,YAAY,IAAM,GAAG,EAC/BC,EAAM,IAAI,YAAY,IAAM,GAAG,EAC/BC,EAAQ,IAAI,YAAY,IAAM,GAAG,EACvC,QAAShB,EAAI,EAAGA,EAAI,IAAKA,IACvB,QAASK,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B,IAAMY,EAAMjB,EAAI,IAAMK,EACtBS,EAAIG,CAAG,EAAIP,EAAGV,CAAC,EAAIW,EAAGN,CAAC,EACvBU,EAAIE,CAAG,EAAIL,EAAGZ,CAAC,EAAIa,EAAGR,CAAC,EACvBW,EAAMC,CAAG,EAAKnB,EAAKE,CAAC,GAAK,EAAKF,EAAKO,CAAC,CACtC,CAEF,MAAO,CAAE,KAAAP,EAAM,MAAAkB,EAAO,GAAAN,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,EAAI,IAAAC,EAAK,IAAAC,CAAG,CAChD,CAEA,IAAMG,GAAgCV,GACpCV,GACCqB,GAAezB,GAAIyB,EAAG,CAAC,GAAK,GAAOA,GAAK,GAAOA,GAAK,EAAKzB,GAAIyB,EAAG,CAAC,CAAC,EAE/DC,GAAgCZ,GACpCL,GACCgB,GAAOzB,GAAIyB,EAAG,EAAE,GAAK,GAAOzB,GAAIyB,EAAG,EAAE,GAAK,GAAOzB,GAAIyB,EAAG,CAAC,GAAK,EAAKzB,GAAIyB,EAAG,EAAE,CAAC,EAG1EE,IAA2B,IAAK,CACpC,IAAMC,EAAI,IAAI,WAAW,EAAE,EAC3B,QAAStB,EAAI,EAAGC,EAAI,EAAGD,EAAI,GAAIA,IAAKC,EAAIT,GAAKS,CAAC,EAAGqB,EAAEtB,CAAC,EAAIC,EACxD,OAAOqB,CACT,GAAE,EAEI,SAAUC,GAAYC,EAAe,CACzCC,EAAOD,CAAG,EACV,IAAME,EAAMF,EAAI,OAChB,GAAI,CAAC,CAAC,GAAI,GAAI,EAAE,EAAE,SAASE,CAAG,EAC5B,MAAM,IAAI,MAAM,qDAAqDA,CAAG,EAAE,EAC5E,GAAM,CAAE,MAAAV,CAAK,EAAKE,GACZS,EAAMC,EAAIJ,CAAG,EACbK,EAAKF,EAAI,OACTG,EAAWrC,GAAcsC,GAAUf,EAAOvB,EAAGA,EAAGA,EAAGA,CAAC,EACpDuC,EAAK,IAAI,YAAYN,EAAM,EAAE,EACnCM,EAAG,IAAIL,CAAG,EAEV,QAAS3B,EAAI6B,EAAI7B,EAAIgC,EAAG,OAAQhC,IAAK,CACnC,IAAID,EAAIiC,EAAGhC,EAAI,CAAC,EACZA,EAAI6B,IAAO,EAAG9B,EAAI+B,EAAQxB,GAASP,CAAC,CAAC,EAAIsB,GAAQrB,EAAI6B,EAAK,CAAC,EACtDA,EAAK,GAAK7B,EAAI6B,IAAO,IAAG9B,EAAI+B,EAAQ/B,CAAC,GAC9CiC,EAAGhC,CAAC,EAAIgC,EAAGhC,EAAI6B,CAAE,EAAI9B,CACvB,CACA,OAAOiC,CACT,CAEM,SAAUC,GAAeT,EAAe,CAC5C,IAAMU,EAASX,GAAYC,CAAG,EACxBQ,EAAKE,EAAO,MAAK,EACjBL,EAAKK,EAAO,OACZ,CAAE,MAAAlB,CAAK,EAAKE,GACZ,CAAE,GAAAR,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKO,GAE3B,QAASpB,EAAI,EAAGA,EAAI6B,EAAI7B,GAAK,EAC3B,QAASK,EAAI,EAAGA,EAAI,EAAGA,IAAK2B,EAAGhC,EAAIK,CAAC,EAAI6B,EAAOL,EAAK7B,EAAI,EAAIK,CAAC,EAE/D6B,EAAO,KAAK,CAAC,EAEb,QAASlC,EAAI,EAAGA,EAAI6B,EAAK,EAAG7B,IAAK,CAC/B,IAAMC,EAAI+B,EAAGhC,CAAC,EACRmC,EAAIJ,GAAUf,EAAOf,EAAGA,EAAGA,EAAGA,CAAC,EACrC+B,EAAGhC,CAAC,EAAIU,EAAGyB,EAAI,GAAI,EAAIxB,EAAIwB,IAAM,EAAK,GAAI,EAAIvB,EAAIuB,IAAM,GAAM,GAAI,EAAItB,EAAGsB,IAAM,EAAE,CACnF,CACA,OAAOH,CACT,CAGA,SAASI,GACPtB,EACAC,EACAsB,EACAC,EACAC,EACAC,EAAU,CAEV,OACE1B,EAAMuB,GAAM,EAAK,MAAYC,IAAO,EAAK,GAAK,EAC9CvB,EAAMwB,IAAO,EAAK,MAAYC,IAAO,GAAM,GAAK,CAEpD,CAEA,SAAST,GAAUf,EAAoBqB,EAAYC,EAAYC,EAAYC,EAAU,CACnF,OACExB,EAAOqB,EAAK,IAASC,EAAK,KAAO,EAChCtB,EAAQuB,IAAO,GAAM,IAAUC,IAAO,GAAM,KAAO,GAAK,EAE7D,CAEA,SAASC,GAAQT,EAAiBK,EAAYC,EAAYC,EAAYC,EAAU,CAC9E,GAAM,CAAE,MAAAxB,EAAO,IAAAF,EAAK,IAAAC,CAAG,EAAKG,GACxBwB,EAAI,EACPL,GAAML,EAAGU,GAAG,EAAKJ,GAAMN,EAAGU,GAAG,EAAKH,GAAMP,EAAGU,GAAG,EAAKF,GAAMR,EAAGU,GAAG,EAChE,IAAMC,EAASX,EAAG,OAAS,EAAI,EAC/B,QAAShC,EAAI,EAAGA,EAAI2C,EAAQ3C,IAAK,CAC/B,IAAM4C,EAAKZ,EAAGU,GAAG,EAAIN,GAAUtB,EAAKC,EAAKsB,EAAIC,EAAIC,EAAIC,CAAE,EACjDK,EAAKb,EAAGU,GAAG,EAAIN,GAAUtB,EAAKC,EAAKuB,EAAIC,EAAIC,EAAIH,CAAE,EACjDS,EAAKd,EAAGU,GAAG,EAAIN,GAAUtB,EAAKC,EAAKwB,EAAIC,EAAIH,EAAIC,CAAE,EACjDS,EAAKf,EAAGU,GAAG,EAAIN,GAAUtB,EAAKC,EAAKyB,EAAIH,EAAIC,EAAIC,CAAE,EACtDF,EAAKO,EAAMN,EAAKO,EAAMN,EAAKO,EAAMN,EAAKO,CACzC,CAEA,IAAMH,EAAKZ,EAAGU,GAAG,EAAIX,GAAUf,EAAOqB,EAAIC,EAAIC,EAAIC,CAAE,EAC9CK,EAAKb,EAAGU,GAAG,EAAIX,GAAUf,EAAOsB,EAAIC,EAAIC,EAAIH,CAAE,EAC9CS,EAAKd,EAAGU,GAAG,EAAIX,GAAUf,EAAOuB,EAAIC,EAAIH,EAAIC,CAAE,EAC9CS,EAAKf,EAAGU,GAAG,EAAIX,GAAUf,EAAOwB,EAAIH,EAAIC,EAAIC,CAAE,EACpD,MAAO,CAAE,GAAIK,EAAI,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,CACzC,CAEA,SAASC,GAAQhB,EAAiBK,EAAYC,EAAYC,EAAYC,EAAU,CAC9E,GAAM,CAAE,MAAAxB,EAAO,IAAAF,EAAK,IAAAC,CAAG,EAAKK,GACxBsB,EAAI,EACPL,GAAML,EAAGU,GAAG,EAAKJ,GAAMN,EAAGU,GAAG,EAAKH,GAAMP,EAAGU,GAAG,EAAKF,GAAMR,EAAGU,GAAG,EAChE,IAAMC,EAASX,EAAG,OAAS,EAAI,EAC/B,QAAShC,EAAI,EAAGA,EAAI2C,EAAQ3C,IAAK,CAC/B,IAAM4C,EAAKZ,EAAGU,GAAG,EAAIN,GAAUtB,EAAKC,EAAKsB,EAAIG,EAAID,EAAID,CAAE,EACjDO,EAAKb,EAAGU,GAAG,EAAIN,GAAUtB,EAAKC,EAAKuB,EAAID,EAAIG,EAAID,CAAE,EACjDO,EAAKd,EAAGU,GAAG,EAAIN,GAAUtB,EAAKC,EAAKwB,EAAID,EAAID,EAAIG,CAAE,EACjDO,EAAKf,EAAGU,GAAG,EAAIN,GAAUtB,EAAKC,EAAKyB,EAAID,EAAID,EAAID,CAAE,EACtDA,EAAKO,EAAMN,EAAKO,EAAMN,EAAKO,EAAMN,EAAKO,CACzC,CAEA,IAAMH,EAAKZ,EAAGU,GAAG,EAAIX,GAAUf,EAAOqB,EAAIG,EAAID,EAAID,CAAE,EAC9CO,EAAKb,EAAGU,GAAG,EAAIX,GAAUf,EAAOsB,EAAID,EAAIG,EAAID,CAAE,EAC9CO,EAAKd,EAAGU,GAAG,EAAIX,GAAUf,EAAOuB,EAAID,EAAID,EAAIG,CAAE,EAC9CO,EAAKf,EAAGU,GAAG,EAAIX,GAAUf,EAAOwB,EAAID,EAAID,EAAID,CAAE,EACpD,MAAO,CAAE,GAAIO,EAAI,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,CACzC,CAEA,SAASE,GAAOvB,EAAawB,EAAgB,CAC3C,GAAI,CAACA,EAAK,OAAO,IAAI,WAAWxB,CAAG,EAEnC,GADAD,EAAOyB,CAAG,EACNA,EAAI,OAASxB,EACf,MAAM,IAAI,MAAM,oDAAoDA,CAAG,UAAUwB,EAAI,MAAM,EAAE,EAC/F,OAAOA,CACT,CAGA,SAASC,GAAWnB,EAAiBoB,EAAmBC,EAAiBH,EAAgB,CACvFzB,EAAO2B,EAAOhE,EAAU,EACxBqC,EAAO4B,CAAG,EACV,IAAMC,EAASD,EAAI,OACnBH,EAAMD,GAAOK,EAAQJ,CAAG,EACxB,IAAMK,EAAMH,EACNI,EAAM5B,EAAI2B,CAAG,EAEf,CAAE,GAAAlB,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQT,EAAIwB,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAC7DC,EAAQ7B,EAAIyB,CAAG,EACfK,EAAQ9B,EAAIsB,CAAG,EAErB,QAASlD,EAAI,EAAGA,EAAI,GAAKyD,EAAM,OAAQzD,GAAK,EAAG,CAC7C0D,EAAM1D,EAAI,CAAC,EAAIyD,EAAMzD,EAAI,CAAC,EAAIqC,EAC9BqB,EAAM1D,EAAI,CAAC,EAAIyD,EAAMzD,EAAI,CAAC,EAAIsC,EAC9BoB,EAAM1D,EAAI,CAAC,EAAIyD,EAAMzD,EAAI,CAAC,EAAIuC,EAC9BmB,EAAM1D,EAAI,CAAC,EAAIyD,EAAMzD,EAAI,CAAC,EAAIwC,EAE9B,IAAImB,EAAQ,EACZ,QAAS3D,EAAIuD,EAAI,OAAS,EAAGvD,GAAK,EAAGA,IACnC2D,EAASA,GAASJ,EAAIvD,CAAC,EAAI,KAAS,EACpCuD,EAAIvD,CAAC,EAAI2D,EAAQ,IACjBA,KAAW,GAEZ,CAAE,GAAAtB,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQT,EAAIwB,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAClE,CAGA,IAAMI,EAAQxE,GAAa,KAAK,MAAMqE,EAAM,OAASpE,EAAY,EACjE,GAAIuE,EAAQN,EAAQ,CAClB,IAAMO,EAAM,IAAI,YAAY,CAACxB,EAAIC,EAAIC,EAAIC,CAAE,CAAC,EACtCsB,EAAMC,GAAGF,CAAG,EAClB,QAAS7D,EAAI4D,EAAOI,EAAM,EAAGhE,EAAIsD,EAAQtD,IAAKgE,IAAOd,EAAIlD,CAAC,EAAIqD,EAAIrD,CAAC,EAAI8D,EAAIE,CAAG,CAChF,CACA,OAAOd,CACT,CAKA,SAASe,GACPjC,EACAkC,EACAd,EACAC,EACAH,EAAgB,CAEhBzB,EAAO2B,EAAOhE,EAAU,EACxBqC,EAAO4B,CAAG,EACVH,EAAMD,GAAOI,EAAI,OAAQH,CAAG,EAC5B,IAAMK,EAAMH,EACNI,EAAM5B,EAAI2B,CAAG,EACbY,EAAOC,GAAWb,CAAG,EACrBE,EAAQ7B,EAAIyB,CAAG,EACfK,EAAQ9B,EAAIsB,CAAG,EACfmB,EAASH,EAAO,EAAI,GACpBZ,EAASD,EAAI,OAEfiB,EAASH,EAAK,UAAUE,EAAQH,CAAI,EACpC,CAAE,GAAA7B,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQT,EAAIwB,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAEnE,QAASxD,EAAI,EAAGA,EAAI,GAAKyD,EAAM,OAAQzD,GAAK,EAC1C0D,EAAM1D,EAAI,CAAC,EAAIyD,EAAMzD,EAAI,CAAC,EAAIqC,EAC9BqB,EAAM1D,EAAI,CAAC,EAAIyD,EAAMzD,EAAI,CAAC,EAAIsC,EAC9BoB,EAAM1D,EAAI,CAAC,EAAIyD,EAAMzD,EAAI,CAAC,EAAIuC,EAC9BmB,EAAM1D,EAAI,CAAC,EAAIyD,EAAMzD,EAAI,CAAC,EAAIwC,EAC9B8B,EAAUA,EAAS,IAAO,EAC1BH,EAAK,UAAUE,EAAQC,EAAQJ,CAAI,EAClC,CAAE,GAAA7B,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQT,EAAIwB,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAGlE,IAAMI,EAAQxE,GAAa,KAAK,MAAMqE,EAAM,OAASpE,EAAY,EACjE,GAAIuE,EAAQN,EAAQ,CAClB,IAAMO,EAAM,IAAI,YAAY,CAACxB,EAAIC,EAAIC,EAAIC,CAAE,CAAC,EACtCsB,EAAMC,GAAGF,CAAG,EAClB,QAAS7D,EAAI4D,EAAOI,EAAM,EAAGhE,EAAIsD,EAAQtD,IAAKgE,IAAOd,EAAIlD,CAAC,EAAIqD,EAAIrD,CAAC,EAAI8D,EAAIE,CAAG,CAChF,CACA,OAAOd,CACT,CAMO,IAAMK,GAAMgB,GACjB,CAAE,UAAW,GAAI,YAAa,EAAE,EAChC,SAAa/C,EAAiB4B,EAAiB,CAC7C3B,EAAOD,CAAG,EACVC,EAAO2B,EAAOhE,EAAU,EACxB,SAASoF,EAAWV,EAAiBZ,EAAgB,CACnD,IAAMlB,EAAKT,GAAYC,CAAG,EACpB/B,EAAI2D,EAAM,MAAK,EACfqB,EAAMtB,GAAWnB,EAAIvC,EAAGqE,EAAKZ,CAAG,EACtC,OAAAlB,EAAG,KAAK,CAAC,EACTvC,EAAE,KAAK,CAAC,EACDgF,CACT,CACA,MAAO,CACL,QAAS,CAACC,EAAuBxB,IAAqBsB,EAAWE,EAAWxB,CAAG,EAC/E,QAAS,CAACyB,EAAwBzB,IAAqBsB,EAAWG,EAAYzB,CAAG,EAErF,CAAC,EAGH,SAAS0B,GAAqBC,EAAgB,CAE5C,GADApD,EAAOoD,CAAI,EACPA,EAAK,OAASzF,KAAe,EAC/B,MAAM,IAAI,MACR,uEAAuEA,EAAU,EAAE,CAGzF,CAEA,SAAS0F,GAAqBJ,EAAuBK,EAAgB7B,EAAgB,CACnF,IAAI8B,EAASN,EAAU,OACjBO,EAAYD,EAAS5F,GAC3B,GAAI,CAAC2F,GAASE,IAAc,EAC1B,MAAM,IAAI,MAAM,yDAAyD,EAC3E,IAAMrF,EAAIgC,EAAI8C,CAAS,EACvB,GAAIK,EAAO,CACT,IAAIG,EAAO9F,GAAa6F,EACnBC,IAAMA,EAAO9F,IAClB4F,EAASA,EAASE,CACpB,CACA,IAAMT,EAAMxB,GAAO+B,EAAQ9B,CAAG,EACxBiC,EAAIvD,EAAI6C,CAAG,EACjB,MAAO,CAAE,EAAA7E,EAAG,EAAAuF,EAAG,IAAAV,CAAG,CACpB,CAEA,SAASW,GAAaP,EAAkBE,EAAc,CACpD,GAAI,CAACA,EAAO,OAAOF,EACnB,IAAMnD,EAAMmD,EAAK,OACjB,GAAI,CAACnD,EAAK,MAAM,IAAI,MAAM,yCAAyC,EACnE,IAAM2D,EAAWR,EAAKnD,EAAM,CAAC,EAC7B,GAAI2D,GAAY,GAAKA,EAAW,GAAI,MAAM,IAAI,MAAM,kCAAkCA,CAAQ,EAAE,EAChG,IAAMZ,EAAMI,EAAK,SAAS,EAAG,CAACQ,CAAQ,EACtC,QAASrF,EAAI,EAAGA,EAAIqF,EAAUrF,IAC5B,GAAI6E,EAAKnD,EAAM1B,EAAI,CAAC,IAAMqF,EAAU,MAAM,IAAI,MAAM,0BAA0B,EAChF,OAAOZ,CACT,CAEA,SAASa,GAAQJ,EAAgB,CAC/B,IAAMK,EAAM,IAAI,WAAW,EAAE,EACvBC,EAAQ5D,EAAI2D,CAAG,EACrBA,EAAI,IAAIL,CAAI,EACZ,IAAMO,EAAcrG,GAAa8F,EAAK,OACtC,QAASlF,EAAIZ,GAAaqG,EAAazF,EAAIZ,GAAYY,IAAKuF,EAAIvF,CAAC,EAAIyF,EACrE,OAAOD,CACT,CAQO,IAAME,GAAMnB,GACjB,CAAE,UAAW,EAAE,EACf,SAAa/C,EAAiBmE,EAAkB,CAAA,EAAE,CAChDlE,EAAOD,CAAG,EACV,IAAMuD,EAAQ,CAACY,EAAK,eACpB,MAAO,CACL,QAAS,CAACjB,EAAuBxB,IAAoB,CACnDzB,EAAOiD,CAAS,EAChB,GAAM,CAAE,EAAA9E,EAAG,EAAAuF,EAAG,IAAKS,CAAI,EAAKd,GAAqBJ,EAAWK,EAAO7B,CAAG,EAChElB,EAAKT,GAAYC,CAAG,EACtBxB,EAAI,EACR,KAAOA,EAAI,GAAKJ,EAAE,QAAU,CAC1B,GAAM,CAAE,GAAAyC,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQT,EAAIpC,EAAEI,EAAI,CAAC,EAAGJ,EAAEI,EAAI,CAAC,EAAGJ,EAAEI,EAAI,CAAC,EAAGJ,EAAEI,EAAI,CAAC,CAAC,EAC5EmF,EAAEnF,GAAG,EAAIqC,EAAM8C,EAAEnF,GAAG,EAAIsC,EAAM6C,EAAEnF,GAAG,EAAIuC,EAAM4C,EAAEnF,GAAG,EAAIwC,CACzD,CACA,GAAIuC,EAAO,CACT,IAAMS,EAAQF,GAAQZ,EAAU,SAAS1E,EAAI,CAAC,CAAC,EACzC,CAAE,GAAAqC,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQT,EAAIwD,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,EAC5EL,EAAEnF,GAAG,EAAIqC,EAAM8C,EAAEnF,GAAG,EAAIsC,EAAM6C,EAAEnF,GAAG,EAAIuC,EAAM4C,EAAEnF,GAAG,EAAIwC,CACzD,CACA,OAAAR,EAAG,KAAK,CAAC,EACF4D,CACT,EACA,QAAS,CAACjB,EAAwBzB,IAAoB,CACpD0B,GAAqBD,CAAU,EAC/B,IAAM3C,EAAKC,GAAeT,CAAG,EACvBiD,EAAMxB,GAAO0B,EAAW,OAAQzB,CAAG,EACnCtD,EAAIgC,EAAI+C,CAAU,EAClBQ,EAAIvD,EAAI6C,CAAG,EACjB,QAASzE,EAAI,EAAGA,EAAI,GAAKJ,EAAE,QAAU,CACnC,GAAM,CAAE,GAAAyC,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKQ,GAAQhB,EAAIpC,EAAEI,EAAI,CAAC,EAAGJ,EAAEI,EAAI,CAAC,EAAGJ,EAAEI,EAAI,CAAC,EAAGJ,EAAEI,EAAI,CAAC,CAAC,EAC5EmF,EAAEnF,GAAG,EAAIqC,EAAM8C,EAAEnF,GAAG,EAAIsC,EAAM6C,EAAEnF,GAAG,EAAIuC,EAAM4C,EAAEnF,GAAG,EAAIwC,CACzD,CACA,OAAAR,EAAG,KAAK,CAAC,EACFoD,GAAaX,EAAKM,CAAK,CAChC,EAEJ,CAAC,EAOUc,GAAMtB,GACjB,CAAE,UAAW,GAAI,YAAa,EAAE,EAChC,SAAa/C,EAAiBsE,EAAgBH,EAAkB,CAAA,EAAE,CAChElE,EAAOD,CAAG,EACVC,EAAOqE,EAAI,EAAE,EACb,IAAMf,EAAQ,CAACY,EAAK,eACpB,MAAO,CACL,QAAS,CAACjB,EAAuBxB,IAAoB,CACnD,IAAMlB,EAAKT,GAAYC,CAAG,EACpB,CAAE,EAAA5B,EAAG,EAAAuF,EAAG,IAAKS,CAAI,EAAKd,GAAqBJ,EAAWK,EAAO7B,CAAG,EAChE6C,EAAMnE,EAAIkE,CAAE,EAEdzD,EAAK0D,EAAI,CAAC,EAAGzD,EAAKyD,EAAI,CAAC,EAAGxD,EAAKwD,EAAI,CAAC,EAAGvD,EAAKuD,EAAI,CAAC,EACjD/F,EAAI,EACR,KAAOA,EAAI,GAAKJ,EAAE,QACfyC,GAAMzC,EAAEI,EAAI,CAAC,EAAKsC,GAAM1C,EAAEI,EAAI,CAAC,EAAKuC,GAAM3C,EAAEI,EAAI,CAAC,EAAKwC,GAAM5C,EAAEI,EAAI,CAAC,EACnE,CAAE,GAAAqC,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQT,EAAIK,EAAIC,EAAIC,EAAIC,CAAE,EAC/C2C,EAAEnF,GAAG,EAAIqC,EAAM8C,EAAEnF,GAAG,EAAIsC,EAAM6C,EAAEnF,GAAG,EAAIuC,EAAM4C,EAAEnF,GAAG,EAAIwC,EAEzD,GAAIuC,EAAO,CACT,IAAMS,EAAQF,GAAQZ,EAAU,SAAS1E,EAAI,CAAC,CAAC,EAC9CqC,GAAMmD,EAAM,CAAC,EAAKlD,GAAMkD,EAAM,CAAC,EAAKjD,GAAMiD,EAAM,CAAC,EAAKhD,GAAMgD,EAAM,CAAC,EACnE,CAAE,GAAAnD,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQT,EAAIK,EAAIC,EAAIC,EAAIC,CAAE,EAC/C2C,EAAEnF,GAAG,EAAIqC,EAAM8C,EAAEnF,GAAG,EAAIsC,EAAM6C,EAAEnF,GAAG,EAAIuC,EAAM4C,EAAEnF,GAAG,EAAIwC,CACzD,CACA,OAAAR,EAAG,KAAK,CAAC,EACF4D,CACT,EACA,QAAS,CAACjB,EAAwBzB,IAAoB,CACpD0B,GAAqBD,CAAU,EAC/B,IAAM3C,EAAKC,GAAeT,CAAG,EACvBuE,EAAMnE,EAAIkE,CAAE,EACZrB,EAAMxB,GAAO0B,EAAW,OAAQzB,CAAG,EACnCtD,EAAIgC,EAAI+C,CAAU,EAClBQ,EAAIvD,EAAI6C,CAAG,EAEbpC,EAAK0D,EAAI,CAAC,EAAGzD,EAAKyD,EAAI,CAAC,EAAGxD,EAAKwD,EAAI,CAAC,EAAGvD,EAAKuD,EAAI,CAAC,EACrD,QAAS/F,EAAI,EAAGA,EAAI,GAAKJ,EAAE,QAAU,CAEnC,IAAMoG,EAAM3D,EAAI4D,EAAM3D,EAAI4D,EAAM3D,EAAI4D,EAAM3D,EACzCH,EAAKzC,EAAEI,EAAI,CAAC,EAAKsC,EAAK1C,EAAEI,EAAI,CAAC,EAAKuC,EAAK3C,EAAEI,EAAI,CAAC,EAAKwC,EAAK5C,EAAEI,EAAI,CAAC,EAChE,GAAM,CAAE,GAAIoG,EAAI,GAAIC,EAAI,GAAIC,EAAI,GAAIC,CAAE,EAAKvD,GAAQhB,EAAIK,EAAIC,EAAIC,EAAIC,CAAE,EACpE2C,EAAEnF,GAAG,EAAIoG,EAAKJ,EAAOb,EAAEnF,GAAG,EAAIqG,EAAKJ,EAAOd,EAAEnF,GAAG,EAAIsG,EAAKJ,EAAOf,EAAEnF,GAAG,EAAIuG,EAAKJ,CAChF,CACA,OAAAnE,EAAG,KAAK,CAAC,EACFoD,GAAaX,EAAKM,CAAK,CAChC,EAEJ,CAAC,EAIH,SAASyB,GACP/F,EACAyD,EACA1C,EACAqD,EACA4B,EAAgB,CAEhB,IAAMC,EAAIjG,EAAG,OAAOe,EAAKqD,EAAK,QAAU4B,GAAK,QAAU,EAAE,EACrDA,GAAKC,EAAE,OAAOD,CAAG,EACrBC,EAAE,OAAO7B,CAAI,EACb,IAAM8B,EAAM,IAAI,WAAW,EAAE,EACvBxC,EAAOC,GAAWuC,CAAG,EAC3B,OAAIF,GAAKG,GAAazC,EAAM,EAAG,OAAOsC,EAAI,OAAS,CAAC,EAAGvC,CAAI,EAC3D0C,GAAazC,EAAM,EAAG,OAAOU,EAAK,OAAS,CAAC,EAAGX,CAAI,EACnDwC,EAAE,OAAOC,CAAG,EACLD,EAAE,OAAM,CACjB,CAOO,IAAMG,GAAMtC,GACjB,CAAE,UAAW,GAAI,YAAa,GAAI,UAAW,EAAE,EAC/C,SAAa/C,EAAiB4B,EAAmBqD,EAAgB,CAG/D,GAFAhF,EAAO2B,CAAK,EAERA,EAAM,SAAW,EAAG,MAAM,IAAI,MAAM,sBAAsB,EAC9D,IAAM0D,EAAY,GAClB,SAASC,EAAYC,EAAqBC,EAAqBpC,EAAgB,CAC7E,IAAMqC,EAAMV,GAAWW,GAAO,GAAOH,EAASnC,EAAM4B,CAAG,EACvD,QAASzG,EAAI,EAAGA,EAAIiH,EAAQ,OAAQjH,IAAKkH,EAAIlH,CAAC,GAAKiH,EAAQjH,CAAC,EAC5D,OAAOkH,CACT,CACA,SAASE,GAAU,CACjB,IAAMpF,EAAKT,GAAYC,CAAG,EACpBwF,EAAU1H,GAAY,MAAK,EAC3B+H,EAAU/H,GAAY,MAAK,EAEjC,GADA2E,GAAMjC,EAAI,GAAOqF,EAASA,EAASL,CAAO,EACtC5D,EAAM,SAAW,GACnBiE,EAAQ,IAAIjE,CAAK,MACZ,CAGL,IAAMkE,EAAWhI,GAAY,MAAK,EAC5B6E,EAAOC,GAAWkD,CAAQ,EAChCV,GAAazC,EAAM,EAAG,OAAOf,EAAM,OAAS,CAAC,EAAG,EAAK,EAErD+D,GAAM,OAAOH,CAAO,EAAE,OAAO5D,CAAK,EAAE,OAAOkE,CAAQ,EAAE,WAAWD,CAAO,CACzE,CACA,IAAMJ,EAAUhD,GAAMjC,EAAI,GAAOqF,EAAS/H,EAAW,EACrD,MAAO,CAAE,GAAA0C,EAAI,QAAAgF,EAAS,QAAAK,EAAS,QAAAJ,CAAO,CACxC,CACA,MAAO,CACL,QAAUvC,GAAyB,CACjCjD,EAAOiD,CAAS,EAChB,GAAM,CAAE,GAAA1C,EAAI,QAAAgF,EAAS,QAAAK,EAAS,QAAAJ,CAAO,EAAKG,EAAU,EAC9C3C,EAAM,IAAI,WAAWC,EAAU,OAASoC,CAAS,EACvD7C,GAAMjC,EAAI,GAAOqF,EAAS3C,EAAWD,CAAG,EACxC,IAAMyC,EAAMH,EAAYC,EAASC,EAASxC,EAAI,SAAS,EAAGA,EAAI,OAASqC,CAAS,CAAC,EACjF,OAAArC,EAAI,IAAIyC,EAAKxC,EAAU,MAAM,EAC7B1C,EAAG,KAAK,CAAC,EACFyC,CACT,EACA,QAAUE,GAA0B,CAElC,GADAlD,EAAOkD,CAAU,EACbA,EAAW,OAASmC,EACtB,MAAM,IAAI,MAAM,yCAAyCA,CAAS,GAAG,EACvE,GAAM,CAAE,GAAA9E,EAAI,QAAAgF,EAAS,QAAAK,EAAS,QAAAJ,CAAO,EAAKG,EAAU,EAC9CvC,EAAOF,EAAW,SAAS,EAAG,CAACmC,CAAS,EACxCS,EAAY5C,EAAW,SAAS,CAACmC,CAAS,EAC1CI,EAAMH,EAAYC,EAASC,EAASpC,CAAI,EAC9C,GAAI,CAAC2C,GAAWN,EAAKK,CAAS,EAAG,MAAM,IAAI,MAAM,4BAA4B,EAC7E,IAAM9C,EAAMR,GAAMjC,EAAI,GAAOqF,EAASxC,CAAI,EAC1C,OAAAmC,EAAQ,KAAK,CAAC,EACdC,EAAQ,KAAK,CAAC,EACdjF,EAAG,KAAK,CAAC,EACFyC,CACT,EAEJ,CAAC,EAGGgD,GAAQ,CAACC,EAAcC,EAAaC,IAAiBC,GAAiB,CAC1E,GAAI,CAAC,OAAO,cAAcA,CAAK,GAAKF,EAAME,GAASA,EAAQD,EACzD,MAAM,IAAI,MAAM,GAAGF,CAAI,mBAAmBG,CAAK,cAAcF,CAAG,KAAKC,CAAG,GAAG,CAC/E,EAQaE,GAAMvD,GACjB,CAAE,UAAW,GAAI,YAAa,GAAI,UAAW,EAAE,EAC/C,SAAa/C,EAAiB4B,EAAmBqD,EAAgB,CAG/D,IAAMsB,EAAYN,GAAM,MAAO,EAAG,WAAO,EACnCO,EAAcP,GAAM,YAAa,EAAG,GAAK,EAAE,EAC3CQ,EAAcR,GAAM,QAAS,GAAI,EAAE,EACnCS,EAAeT,GAAM,aAAc,GAAI,GAAK,GAAK,EAAE,EACzDhG,EAAO2B,CAAK,EACZ6E,EAAY7E,EAAM,MAAM,EACpBqD,IACFhF,EAAOgF,CAAG,EACVsB,EAAUtB,EAAI,MAAM,GAEtB,SAASW,GAAU,CACjB,IAAM1F,EAAMF,EAAI,OAChB,GAAIE,IAAQ,IAAMA,IAAQ,IAAMA,IAAQ,GACtC,MAAM,IAAI,MAAM,+CAA+CA,CAAG,QAAQ,EAC5E,IAAMM,EAAKT,GAAYC,CAAG,EACpBU,EAAS,IAAI,WAAWR,CAAG,EAC3BsF,EAAU,IAAI,WAAW,EAAE,EAC3BjB,EAAMnE,EAAIwB,CAAK,EAEjBf,EAAK,EAAGC,EAAKyD,EAAI,CAAC,EAAGxD,EAAKwD,EAAI,CAAC,EAAGvD,EAAKuD,EAAI,CAAC,EAC5CsB,EAAU,EACd,QAAWc,IAAc,CAACnB,EAAS9E,CAAM,EAAE,IAAIN,CAAG,EAAG,CACnD,IAAMwG,EAAMxG,EAAIuG,CAAU,EAC1B,QAASnI,EAAI,EAAGA,EAAIoI,EAAI,OAAQpI,GAAK,EAAG,CAEtC,GAAM,CAAE,GAAIoG,EAAI,GAAIC,CAAE,EAAK5D,GAAQT,EAAIK,EAAIC,EAAIC,EAAIC,CAAE,EACrD4F,EAAIpI,EAAI,CAAC,EAAIoG,EACbgC,EAAIpI,EAAI,CAAC,EAAIqG,EACbhE,EAAK,EAAEgF,CACT,CACF,CACA,OAAArF,EAAG,KAAK,CAAC,EACF,CAAE,QAAAgF,EAAS,OAAQzF,GAAYW,CAAM,CAAC,CAC/C,CACA,SAAS6E,EAAY7E,EAAqB8E,EAAqBnC,EAAgB,CAC7E,IAAMqC,EAAMV,GAAW6B,GAAS,GAAMrB,EAASnC,EAAM4B,CAAG,EAIxD,QAASzG,EAAI,EAAGA,EAAI,GAAIA,IAAKkH,EAAIlH,CAAC,GAAKoD,EAAMpD,CAAC,EAC9CkH,EAAI,EAAE,GAAK,IAEX,IAAMoB,EAAM1G,EAAIsF,CAAG,EAEf7E,EAAKiG,EAAI,CAAC,EAAGhG,EAAKgG,EAAI,CAAC,EAAG/F,EAAK+F,EAAI,CAAC,EAAG9F,EAAK8F,EAAI,CAAC,EACrD,MAAC,CAAE,GAAAjG,EAAI,GAAAC,EAAI,GAAAC,EAAI,GAAAC,CAAE,EAAKC,GAAQP,EAAQG,EAAIC,EAAIC,EAAIC,CAAE,EACnD8F,EAAI,CAAC,EAAIjG,EAAMiG,EAAI,CAAC,EAAIhG,EAAMgG,EAAI,CAAC,EAAI/F,EAAM+F,EAAI,CAAC,EAAI9F,EAChD0E,CACT,CAEA,SAASqB,EAAWrG,EAAqBgF,EAAiBsB,EAAiB,CACzE,IAAIC,EAAQvB,EAAI,MAAK,EACrB,OAAAuB,EAAM,EAAE,GAAK,IACNxE,GAAM/B,EAAQ,GAAMuG,EAAOD,CAAK,CACzC,CACA,MAAO,CACL,QAAU9D,GAAyB,CACjCjD,EAAOiD,CAAS,EAChBsD,EAAYtD,EAAU,MAAM,EAC5B,GAAM,CAAE,OAAAxC,EAAQ,QAAA8E,CAAO,EAAKI,EAAU,EAChCF,EAAMH,EAAY7E,EAAQ8E,EAAStC,CAAS,EAC5CD,EAAM,IAAI,WAAWC,EAAU,OAAS,EAAS,EACvD,OAAAD,EAAI,IAAIyC,EAAKxC,EAAU,MAAM,EAC7BD,EAAI,IAAI8D,EAAWrG,EAAQgF,EAAKxC,CAAS,CAAC,EAC1CxC,EAAO,KAAK,CAAC,EACb8E,EAAQ,KAAK,CAAC,EACPvC,CACT,EACA,QAAUE,GAA0B,CAClClD,EAAOkD,CAAU,EACjBuD,EAAavD,EAAW,MAAM,EAC9B,IAAMuC,EAAMvC,EAAW,SAAS,GAAU,EACpC,CAAE,OAAAzC,EAAQ,QAAA8E,CAAO,EAAKI,EAAU,EAChC1C,EAAY6D,EAAWrG,EAAQgF,EAAKvC,EAAW,SAAS,EAAG,GAAU,CAAC,EACtE+D,EAAc3B,EAAY7E,EAAQ8E,EAAStC,CAAS,EAG1D,GAFAxC,EAAO,KAAK,CAAC,EACb8E,EAAQ,KAAK,CAAC,EACV,CAACQ,GAAWN,EAAKwB,CAAW,EAAG,MAAM,IAAI,MAAM,qBAAqB,EACxE,OAAOhE,CACT,EAEJ,CAAC,ECjoBH,IAAIiE,GAAc,IAAI,YAAY,OAAO,EACrCC,GAAc,IAAI,YAGtB,eAAeC,GAAQC,EAAWC,EAAQC,EAAM,CAC9C,IAAMC,EAAUH,aAAqB,WAAaI,GAAWJ,CAAS,EAAIA,EACpEK,EAAMC,GAAU,gBAAgBH,EAAS,KAAOF,CAAM,EACtDM,EAAgBC,GAAeH,CAAG,EACpCI,EAAK,WAAW,KAAKC,GAAY,EAAE,CAAC,EACpCC,EAAYb,GAAY,OAAOI,CAAI,EACnCU,EAAaC,GAAIN,EAAeE,CAAE,EAAE,QAAQE,CAAS,EACrDG,EAAQC,GAAO,OAAO,IAAI,WAAWH,CAAU,CAAC,EAChDI,EAAQD,GAAO,OAAO,IAAI,WAAWN,EAAG,MAAM,CAAC,EACnD,MAAO,GAAGK,CAAK,OAAOE,CAAK,EAC7B,CACA,eAAeC,GAAQjB,EAAWC,EAAQiB,EAAM,CAC9C,IAAMf,EAAUH,aAAqB,WAAaI,GAAWJ,CAAS,EAAIA,EACtE,CAACc,EAAOE,CAAK,EAAIE,EAAK,MAAM,MAAM,EAClCb,EAAMC,GAAU,gBAAgBH,EAAS,KAAOF,CAAM,EACtDM,EAAgBC,GAAeH,CAAG,EAClCI,EAAKM,GAAO,OAAOC,CAAK,EACxBJ,EAAaG,GAAO,OAAOD,CAAK,EAChCH,EAAYE,GAAIN,EAAeE,CAAE,EAAE,QAAQG,CAAU,EACzD,OAAOf,GAAY,OAAOc,CAAS,CACrC,CACA,SAASH,GAAeH,EAAK,CAC3B,OAAOA,EAAI,MAAM,EAAG,EAAE,CACxB,CC1BA,IAAMc,GAAS,CAACC,EAAeC,IAAeD,EAAEC,GAAG,EAAI,KAAUD,EAAEC,GAAG,EAAI,MAAS,EAC7EC,GAAN,KAAc,CAUZ,YAAYC,EAAU,CATb,KAAA,SAAW,GACX,KAAA,UAAY,GACb,KAAA,OAAS,IAAI,WAAW,EAAE,EAC1B,KAAA,EAAI,IAAI,YAAY,EAAE,EACtB,KAAA,EAAI,IAAI,YAAY,EAAE,EACtB,KAAA,IAAM,IAAI,YAAY,CAAC,EACvB,KAAA,IAAM,EACJ,KAAA,SAAW,GAGnBA,EAAMC,GAAQD,CAAG,EACjBE,EAAOF,EAAK,EAAE,EACd,IAAMG,EAAKP,GAAOI,EAAK,CAAC,EAClBI,EAAKR,GAAOI,EAAK,CAAC,EAClBK,EAAKT,GAAOI,EAAK,CAAC,EAClBM,EAAKV,GAAOI,EAAK,CAAC,EAClBO,EAAKX,GAAOI,EAAK,CAAC,EAClBQ,EAAKZ,GAAOI,EAAK,EAAE,EACnBS,EAAKb,GAAOI,EAAK,EAAE,EACnBU,EAAKd,GAAOI,EAAK,EAAE,EAGzB,KAAK,EAAE,CAAC,EAAIG,EAAK,KACjB,KAAK,EAAE,CAAC,GAAMA,IAAO,GAAOC,GAAM,GAAM,KACxC,KAAK,EAAE,CAAC,GAAMA,IAAO,GAAOC,GAAM,GAAM,KACxC,KAAK,EAAE,CAAC,GAAMA,IAAO,EAAMC,GAAM,GAAM,KACvC,KAAK,EAAE,CAAC,GAAMA,IAAO,EAAMC,GAAM,IAAO,IACxC,KAAK,EAAE,CAAC,EAAKA,IAAO,EAAK,KACzB,KAAK,EAAE,CAAC,GAAMA,IAAO,GAAOC,GAAM,GAAM,KACxC,KAAK,EAAE,CAAC,GAAMA,IAAO,GAAOC,GAAM,GAAM,KACxC,KAAK,EAAE,CAAC,GAAMA,IAAO,EAAMC,GAAM,GAAM,KACvC,KAAK,EAAE,CAAC,EAAKA,IAAO,EAAK,IACzB,QAASZ,EAAI,EAAGA,EAAI,EAAGA,IAAK,KAAK,IAAIA,CAAC,EAAIF,GAAOI,EAAK,GAAK,EAAIF,CAAC,CAClE,CAEQ,QAAQa,EAAkBC,EAAgBC,EAAS,GAAK,CAC9D,IAAMC,EAAQD,EAAS,EAAI,KACrB,CAAE,EAAAE,EAAG,EAAAC,CAAC,EAAK,KACXC,EAAKD,EAAE,CAAC,EACRE,EAAKF,EAAE,CAAC,EACRG,EAAKH,EAAE,CAAC,EACRI,EAAKJ,EAAE,CAAC,EACRK,EAAKL,EAAE,CAAC,EACRM,EAAKN,EAAE,CAAC,EACRO,EAAKP,EAAE,CAAC,EACRQ,EAAKR,EAAE,CAAC,EACRS,EAAKT,EAAE,CAAC,EACRU,EAAKV,EAAE,CAAC,EAERb,EAAKP,GAAOe,EAAMC,EAAS,CAAC,EAC5BR,EAAKR,GAAOe,EAAMC,EAAS,CAAC,EAC5BP,EAAKT,GAAOe,EAAMC,EAAS,CAAC,EAC5BN,EAAKV,GAAOe,EAAMC,EAAS,CAAC,EAC5BL,EAAKX,GAAOe,EAAMC,EAAS,CAAC,EAC5BJ,EAAKZ,GAAOe,EAAMC,EAAS,EAAE,EAC7BH,EAAKb,GAAOe,EAAMC,EAAS,EAAE,EAC7BF,EAAKd,GAAOe,EAAMC,EAAS,EAAE,EAE/Be,EAAKZ,EAAE,CAAC,GAAKZ,EAAK,MAClByB,EAAKb,EAAE,CAAC,IAAOZ,IAAO,GAAOC,GAAM,GAAM,MACzCyB,EAAKd,EAAE,CAAC,IAAOX,IAAO,GAAOC,GAAM,GAAM,MACzCyB,EAAKf,EAAE,CAAC,IAAOV,IAAO,EAAMC,GAAM,GAAM,MACxCyB,EAAKhB,EAAE,CAAC,IAAOT,IAAO,EAAMC,GAAM,IAAO,MACzCyB,EAAKjB,EAAE,CAAC,GAAMR,IAAO,EAAK,MAC1B0B,EAAKlB,EAAE,CAAC,IAAOR,IAAO,GAAOC,GAAM,GAAM,MACzC0B,EAAKnB,EAAE,CAAC,IAAOP,IAAO,GAAOC,GAAM,GAAM,MACzC0B,EAAKpB,EAAE,CAAC,IAAON,IAAO,EAAMC,GAAM,GAAM,MACxC0B,EAAKrB,EAAE,CAAC,GAAML,IAAO,EAAKI,GAE1BuB,EAAI,EAEJC,EAAKD,EAAIV,EAAKV,EAAKW,GAAM,EAAIF,GAAMG,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GACjFc,EAAIC,IAAO,GACXA,GAAM,KACNA,GAAMN,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAAMe,GAAM,EAAIhB,GAAMiB,GAAM,EAAIlB,GAChFmB,GAAKC,IAAO,GACZA,GAAM,KAEN,IAAIC,EAAKF,EAAIV,EAAKT,EAAKU,EAAKX,EAAKY,GAAM,EAAIH,GAAMI,GAAM,EAAIL,GAAMM,GAAM,EAAIP,GAC3Ea,EAAIE,IAAO,GACXA,GAAM,KACNA,GAAMP,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAAMc,GAAM,EAAIf,GAAMgB,GAAM,EAAIjB,GAChFkB,GAAKE,IAAO,GACZA,GAAM,KAEN,IAAIC,EAAKH,EAAIV,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAAKa,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GACrEY,EAAIG,IAAO,GACXA,GAAM,KACNA,GAAMR,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAAMe,GAAM,EAAIhB,GAChFiB,GAAKG,IAAO,GACZA,GAAM,KAEN,IAAIC,EAAKJ,EAAIV,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAAKY,EAAKb,EAAKc,GAAM,EAAIL,GAC/DW,EAAII,IAAO,GACXA,GAAM,KACNA,GAAMT,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAAMc,GAAM,EAAIf,GAChFgB,GAAKI,IAAO,GACZA,GAAM,KAEN,IAAIC,EAAKL,EAAIV,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAAKa,EAAKd,EAC1DoB,EAAIK,IAAO,GACXA,GAAM,KACNA,GAAMV,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAChFe,GAAKK,IAAO,GACZA,GAAM,KAEN,IAAIC,EAAKN,EAAIV,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAAKY,EAAKb,EAC1DmB,EAAIM,IAAO,GACXA,GAAM,KACNA,GAAMX,EAAKf,EAAKgB,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAC1Ec,GAAKM,IAAO,GACZA,GAAM,KAEN,IAAIC,GAAKP,EAAIV,EAAKJ,EAAKK,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAC1DkB,EAAIO,KAAO,GACXA,IAAM,KACNA,IAAMZ,EAAKd,EAAKe,EAAKhB,EAAKiB,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GACpEa,GAAKO,KAAO,GACZA,IAAM,KAEN,IAAIC,EAAKR,EAAIV,EAAKH,EAAKI,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAC1DiB,EAAIQ,IAAO,GACXA,GAAM,KACNA,GAAMb,EAAKb,EAAKc,EAAKf,EAAKgB,EAAKjB,EAAKkB,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAC9DY,GAAKQ,IAAO,GACZA,GAAM,KAEN,IAAIC,GAAKT,EAAIV,EAAKF,EAAKG,EAAKJ,EAAKK,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAC1DgB,EAAIS,KAAO,GACXA,IAAM,KACNA,IAAMd,EAAKZ,EAAKa,EAAKd,EAAKe,EAAKhB,EAAKiB,EAAKlB,EAAKmB,GAAM,EAAIV,GACxDW,GAAKS,KAAO,GACZA,IAAM,KAEN,IAAIC,EAAKV,EAAIV,EAAKD,EAAKE,EAAKH,EAAKI,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAC1De,EAAIU,IAAO,GACXA,GAAM,KACNA,GAAMf,EAAKX,EAAKY,EAAKb,EAAKc,EAAKf,EAAKgB,EAAKjB,EAAKkB,EAAKnB,EACnDoB,GAAKU,IAAO,GACZA,GAAM,KAENV,GAAMA,GAAK,GAAKA,EAAK,EACrBA,EAAKA,EAAIC,EAAM,EACfA,EAAKD,EAAI,KACTA,EAAIA,IAAM,GACVE,GAAMF,EAENtB,EAAE,CAAC,EAAIuB,EACPvB,EAAE,CAAC,EAAIwB,EACPxB,EAAE,CAAC,EAAIyB,EACPzB,EAAE,CAAC,EAAI0B,EACP1B,EAAE,CAAC,EAAI2B,EACP3B,EAAE,CAAC,EAAI4B,EACP5B,EAAE,CAAC,EAAI6B,GACP7B,EAAE,CAAC,EAAI8B,EACP9B,EAAE,CAAC,EAAI+B,GACP/B,EAAE,CAAC,EAAIgC,CACT,CAEQ,UAAQ,CACd,GAAM,CAAE,EAAAhC,EAAG,IAAAiC,CAAG,EAAK,KACbC,EAAI,IAAI,YAAY,EAAE,EACxBZ,EAAItB,EAAE,CAAC,IAAM,GACjBA,EAAE,CAAC,GAAK,KACR,QAASjB,EAAI,EAAGA,EAAI,GAAIA,IACtBiB,EAAEjB,CAAC,GAAKuC,EACRA,EAAItB,EAAEjB,CAAC,IAAM,GACbiB,EAAEjB,CAAC,GAAK,KAEViB,EAAE,CAAC,GAAKsB,EAAI,EACZA,EAAItB,EAAE,CAAC,IAAM,GACbA,EAAE,CAAC,GAAK,KACRA,EAAE,CAAC,GAAKsB,EACRA,EAAItB,EAAE,CAAC,IAAM,GACbA,EAAE,CAAC,GAAK,KACRA,EAAE,CAAC,GAAKsB,EAERY,EAAE,CAAC,EAAIlC,EAAE,CAAC,EAAI,EACdsB,EAAIY,EAAE,CAAC,IAAM,GACbA,EAAE,CAAC,GAAK,KACR,QAASnD,EAAI,EAAGA,EAAI,GAAIA,IACtBmD,EAAEnD,CAAC,EAAIiB,EAAEjB,CAAC,EAAIuC,EACdA,EAAIY,EAAEnD,CAAC,IAAM,GACbmD,EAAEnD,CAAC,GAAK,KAEVmD,EAAE,CAAC,GAAK,KAER,IAAIC,GAAQb,EAAI,GAAK,EACrB,QAASvC,EAAI,EAAGA,EAAI,GAAIA,IAAKmD,EAAEnD,CAAC,GAAKoD,EACrCA,EAAO,CAACA,EACR,QAASpD,EAAI,EAAGA,EAAI,GAAIA,IAAKiB,EAAEjB,CAAC,EAAKiB,EAAEjB,CAAC,EAAIoD,EAAQD,EAAEnD,CAAC,EACvDiB,EAAE,CAAC,GAAKA,EAAE,CAAC,EAAKA,EAAE,CAAC,GAAK,IAAO,MAC/BA,EAAE,CAAC,GAAMA,EAAE,CAAC,IAAM,EAAMA,EAAE,CAAC,GAAK,IAAO,MACvCA,EAAE,CAAC,GAAMA,EAAE,CAAC,IAAM,EAAMA,EAAE,CAAC,GAAK,GAAM,MACtCA,EAAE,CAAC,GAAMA,EAAE,CAAC,IAAM,EAAMA,EAAE,CAAC,GAAK,GAAM,MACtCA,EAAE,CAAC,GAAMA,EAAE,CAAC,IAAM,GAAOA,EAAE,CAAC,GAAK,EAAMA,EAAE,CAAC,GAAK,IAAO,MACtDA,EAAE,CAAC,GAAMA,EAAE,CAAC,IAAM,EAAMA,EAAE,CAAC,GAAK,IAAO,MACvCA,EAAE,CAAC,GAAMA,EAAE,CAAC,IAAM,EAAMA,EAAE,CAAC,GAAK,GAAM,MACtCA,EAAE,CAAC,GAAMA,EAAE,CAAC,IAAM,EAAMA,EAAE,CAAC,GAAK,GAAM,MAEtC,IAAIoC,EAAIpC,EAAE,CAAC,EAAIiC,EAAI,CAAC,EACpBjC,EAAE,CAAC,EAAIoC,EAAI,MACX,QAASrD,EAAI,EAAGA,EAAI,EAAGA,IACrBqD,GAAOpC,EAAEjB,CAAC,EAAIkD,EAAIlD,CAAC,EAAK,IAAMqD,IAAM,IAAO,EAC3CpC,EAAEjB,CAAC,EAAIqD,EAAI,KAEf,CACA,OAAOxC,EAAW,CAChByC,GAAQ,IAAI,EACZ,GAAM,CAAE,OAAAC,EAAQ,SAAAC,CAAQ,EAAK,KAC7B3C,EAAOV,GAAQU,CAAI,EACnB,IAAM4C,EAAM5C,EAAK,OAEjB,QAAS6C,EAAM,EAAGA,EAAMD,GAAO,CAC7B,IAAME,EAAO,KAAK,IAAIH,EAAW,KAAK,IAAKC,EAAMC,CAAG,EAEpD,GAAIC,IAASH,EAAU,CACrB,KAAOA,GAAYC,EAAMC,EAAKA,GAAOF,EAAU,KAAK,QAAQ3C,EAAM6C,CAAG,EACrE,QACF,CACAH,EAAO,IAAI1C,EAAK,SAAS6C,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQH,IACf,KAAK,QAAQD,EAAQ,EAAG,EAAK,EAC7B,KAAK,IAAM,EAEf,CACA,OAAO,IACT,CACA,SAAO,CACL,KAAK,EAAE,KAAK,CAAC,EACb,KAAK,EAAE,KAAK,CAAC,EACb,KAAK,OAAO,KAAK,CAAC,EAClB,KAAK,IAAI,KAAK,CAAC,CACjB,CACA,WAAWK,EAAe,CACxBN,GAAQ,IAAI,EACZO,GAAQD,EAAK,IAAI,EACjB,KAAK,SAAW,GAChB,GAAM,CAAE,OAAAL,EAAQ,EAAAtC,CAAC,EAAK,KAClB,CAAE,IAAAyC,CAAG,EAAK,KACd,GAAIA,EAAK,CAGP,IAFAH,EAAOG,GAAK,EAAI,EAETA,EAAM,GAAIA,IAAOH,EAAOG,CAAG,EAAI,EACtC,KAAK,QAAQH,EAAQ,EAAG,EAAI,CAC9B,CACA,KAAK,SAAQ,EACb,IAAIO,EAAO,EACX,QAAS,EAAI,EAAG,EAAI,EAAG,IACrBF,EAAIE,GAAM,EAAI7C,EAAE,CAAC,IAAM,EACvB2C,EAAIE,GAAM,EAAI7C,EAAE,CAAC,IAAM,EAEzB,OAAO2C,CACT,CACA,QAAM,CACJ,GAAM,CAAE,OAAAL,EAAQ,UAAAQ,CAAS,EAAK,KAC9B,KAAK,WAAWR,CAAM,EACtB,IAAMS,EAAMT,EAAO,MAAM,EAAGQ,CAAS,EACrC,YAAK,QAAO,EACLC,CACT,GAII,SAAUC,GAA0CC,EAAiC,CACzF,IAAMC,EAAQ,CAACC,EAAYlE,IAA2BgE,EAAShE,CAAG,EAAE,OAAOC,GAAQiE,CAAG,CAAC,EAAE,OAAM,EACzFC,EAAMH,EAAS,IAAI,WAAW,EAAE,CAAC,EACvC,OAAAC,EAAM,UAAYE,EAAI,UACtBF,EAAM,SAAWE,EAAI,SACrBF,EAAM,OAAUjE,GAAegE,EAAShE,CAAG,EACpCiE,CACT,CAEO,IAAMG,GAAWL,GAAwB/D,GAAQ,IAAID,GAASC,CAAG,CAAC,ECtPzE,IAAMqE,GAAUC,GAAY,kBAAkB,EACxCC,GAAUD,GAAY,kBAAkB,EACxCE,GAAaC,EAAIJ,EAAO,EACxBK,GAAaD,EAAIF,EAAO,EAExB,SAAUI,EAAKC,EAAWC,EAAS,CACvC,OAAQD,GAAKC,EAAMD,IAAO,GAAKC,CACjC,CA2BA,SAASC,GAAYD,EAAa,CAChC,OAAOA,EAAE,WAAa,IAAM,CAC9B,CAGA,IAAME,GAAY,GACZC,GAAc,GAIdC,GAAc,GAAK,GAAK,EAExBC,GAAY,IAAI,YACtB,SAASC,GACPC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAc,CAEd,IAAMC,EAAMJ,EAAK,OACXK,EAAQ,IAAI,WAAWd,EAAS,EAChCe,EAAMrB,EAAIoB,CAAK,EAEfE,EAAYjB,GAAYU,CAAI,GAAKV,GAAYW,CAAM,EACnDO,EAAMD,EAAYtB,EAAIe,CAAI,EAAIN,GAC9Be,EAAMF,EAAYtB,EAAIgB,CAAM,EAAIP,GACtC,QAASgB,EAAM,EAAGA,EAAMN,EAAKF,IAAW,CAEtC,GADAN,EAAKC,EAAOC,EAAKC,EAAOO,EAAKJ,EAASC,CAAM,EACxCD,GAAWT,GAAa,MAAM,IAAI,MAAM,uBAAuB,EACnE,IAAMkB,EAAO,KAAK,IAAIpB,GAAWa,EAAMM,CAAG,EAE1C,GAAIH,GAAaI,IAASpB,GAAW,CACnC,IAAMqB,EAAQF,EAAM,EACpB,GAAIA,EAAM,IAAM,EAAG,MAAM,IAAI,MAAM,6BAA6B,EAChE,QAASG,EAAI,EAAGC,EAAcD,EAAIrB,GAAaqB,IAC7CC,EAAOF,EAAQC,EACfJ,EAAIK,CAAI,EAAIN,EAAIM,CAAI,EAAIR,EAAIO,CAAC,EAE/BH,GAAOnB,GACP,QACF,CACA,QAASsB,EAAI,EAAGC,EAAMD,EAAIF,EAAME,IAC9BC,EAAOJ,EAAMG,EACbZ,EAAOa,CAAI,EAAId,EAAKc,CAAI,EAAIT,EAAMQ,CAAC,EAErCH,GAAOC,CACT,CACF,CAEM,SAAUI,GAAanB,EAAoBoB,EAAgB,CAC/D,GAAM,CAAE,eAAAC,EAAgB,cAAAC,EAAe,cAAAC,EAAe,aAAAC,EAAc,OAAAjB,CAAM,EAAKkB,GAC7E,CAAE,eAAgB,GAAO,cAAe,EAAG,aAAc,GAAO,OAAQ,EAAE,EAC1EL,CAAI,EAEN,GAAI,OAAOpB,GAAS,WAAY,MAAM,IAAI,MAAM,yBAAyB,EACzE,OAAA0B,GAAQH,CAAa,EACrBG,GAAQnB,CAAM,EACdoB,GAAMH,CAAY,EAClBG,GAAMN,CAAc,EACb,CACLnB,EACAC,EACAC,EACAC,EACAC,EAAU,IACI,CACdsB,EAAO1B,CAAG,EACV0B,EAAOzB,CAAK,EACZyB,EAAOxB,CAAI,EACX,IAAMI,EAAMJ,EAAK,OAIjB,GAHKC,IAAQA,EAAS,IAAI,WAAWG,CAAG,GACxCoB,EAAOvB,CAAM,EACbqB,GAAQpB,CAAO,EACXA,EAAU,GAAKA,GAAWT,GAAa,MAAM,IAAI,MAAM,uBAAuB,EAClF,GAAIQ,EAAO,OAASG,EAClB,MAAM,IAAI,MAAM,gBAAgBH,EAAO,MAAM,2BAA2BG,CAAG,GAAG,EAChF,IAAMqB,EAAU,CAAA,EAKZC,EAAI5B,EAAI,OACV6B,EACA9B,EACF,GAAI6B,IAAM,GACRC,EAAI7B,EAAI,MAAK,EACb2B,EAAQ,KAAKE,CAAC,EACd9B,EAAQX,WACCwC,IAAM,IAAMT,EACrBU,EAAI,IAAI,WAAW,EAAE,EACrBA,EAAE,IAAI7B,CAAG,EACT6B,EAAE,IAAI7B,EAAK,EAAE,EACbD,EAAQb,GACRyC,EAAQ,KAAKE,CAAC,MAEd,OAAM,IAAI,MAAM,wCAAwCD,CAAC,EAAE,EAUxDpC,GAAYS,CAAK,IACpBA,EAAQA,EAAM,MAAK,EACnB0B,EAAQ,KAAK1B,CAAK,GAGpB,IAAM6B,EAAM3C,EAAI0C,CAAC,EAEjB,GAAIT,EAAe,CACjB,GAAInB,EAAM,SAAW,GAAI,MAAM,IAAI,MAAM,sCAAsC,EAC/EmB,EAAcrB,EAAO+B,EAAK3C,EAAIc,EAAM,SAAS,EAAG,EAAE,CAAC,EAAG6B,CAAG,EACzD7B,EAAQA,EAAM,SAAS,EAAE,CAC3B,CAGA,IAAM8B,EAAa,GAAKV,EACxB,GAAIU,IAAe9B,EAAM,OACvB,MAAM,IAAI,MAAM,sBAAsB8B,CAAU,cAAc,EAGhE,GAAIA,IAAe,GAAI,CACrB,IAAMC,EAAK,IAAI,WAAW,EAAE,EAC5BA,EAAG,IAAI/B,EAAOqB,EAAe,EAAI,GAAKrB,EAAM,MAAM,EAClDA,EAAQ+B,EACRL,EAAQ,KAAK1B,CAAK,CACpB,CACA,IAAMgC,EAAM9C,EAAIc,CAAK,EAErB,IADAJ,GAAUC,EAAMC,EAAO+B,EAAKG,EAAK/B,EAAMC,EAAQC,EAASC,CAAM,EACvDsB,EAAQ,OAAS,GAAGA,EAAQ,IAAG,EAAI,KAAK,CAAC,EAChD,OAAOxB,CACT,CACF,CCpMA,SAAS+B,GACPC,EAAgBC,EAAgBC,EAAgBC,EAAkBC,EAAaC,EAAS,GAAE,CAE1F,IAAIC,EAAMN,EAAE,CAAC,EAAGO,EAAMP,EAAE,CAAC,EAAGQ,EAAMR,EAAE,CAAC,EAAGS,EAAMT,EAAE,CAAC,EAC7CU,EAAMT,EAAE,CAAC,EAAGU,EAAMV,EAAE,CAAC,EAAGW,EAAMX,EAAE,CAAC,EAAGY,EAAMZ,EAAE,CAAC,EAC7Ca,EAAMb,EAAE,CAAC,EAAGc,EAAMd,EAAE,CAAC,EAAGe,EAAMf,EAAE,CAAC,EAAGgB,EAAMhB,EAAE,CAAC,EAC7CiB,EAAMd,EAAMe,EAAMjB,EAAE,CAAC,EAAGkB,EAAMlB,EAAE,CAAC,EAAGmB,EAAMnB,EAAE,CAAC,EAE7CoB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EACvCiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EACvCiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EACvCiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAC3C,QAASiB,EAAI,EAAGA,EAAIjC,EAAQiC,GAAK,EAC/BhB,EAAOA,EAAMI,EAAO,EAAGQ,EAAMK,EAAKL,EAAMZ,EAAK,EAAE,EAC/CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMa,EAAKb,EAAMI,EAAK,EAAE,EAC/CR,EAAOA,EAAMI,EAAO,EAAGQ,EAAMK,EAAKL,EAAMZ,EAAK,CAAC,EAC9CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMa,EAAKb,EAAMI,EAAK,CAAC,EAE9CP,EAAOA,EAAMI,EAAO,EAAGQ,EAAMI,EAAKJ,EAAMZ,EAAK,EAAE,EAC/CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMY,EAAKZ,EAAMI,EAAK,EAAE,EAC/CR,EAAOA,EAAMI,EAAO,EAAGQ,EAAMI,EAAKJ,EAAMZ,EAAK,CAAC,EAC9CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMY,EAAKZ,EAAMI,EAAK,CAAC,EAE9CP,EAAOA,EAAMI,EAAO,EAAGQ,EAAMG,EAAKH,EAAMZ,EAAK,EAAE,EAC/CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMW,EAAKX,EAAMI,EAAK,EAAE,EAC/CR,EAAOA,EAAMI,EAAO,EAAGQ,EAAMG,EAAKH,EAAKZ,EAAK,CAAC,EAC7CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMW,EAAKX,EAAMI,EAAK,CAAC,EAE9CP,EAAOA,EAAMI,EAAO,EAAGQ,EAAME,EAAKF,EAAMZ,EAAK,EAAE,EAC/CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMU,EAAKV,EAAMI,EAAK,EAAE,EAC/CR,EAAOA,EAAMI,EAAO,EAAGQ,EAAME,EAAKF,EAAMZ,EAAK,CAAC,EAC9CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMU,EAAKV,EAAMI,EAAK,CAAC,EAE9CX,EAAOA,EAAMK,EAAO,EAAGU,EAAME,EAAKF,EAAMf,EAAK,EAAE,EAC/CU,EAAOA,EAAMK,EAAO,EAAGV,EAAMY,EAAKZ,EAAMK,EAAK,EAAE,EAC/CV,EAAOA,EAAMK,EAAO,EAAGU,EAAME,EAAKF,EAAMf,EAAK,CAAC,EAC9CU,EAAOA,EAAMK,EAAO,EAAGV,EAAMY,EAAKZ,EAAMK,EAAK,CAAC,EAE9CT,EAAOA,EAAMK,EAAO,EAAGM,EAAMK,EAAKL,EAAMX,EAAK,EAAE,EAC/CU,EAAOA,EAAMC,EAAO,EAAGN,EAAMW,EAAKX,EAAMK,EAAK,EAAE,EAC/CV,EAAOA,EAAMK,EAAO,EAAGM,EAAMK,EAAKL,EAAMX,EAAK,CAAC,EAC9CU,EAAOA,EAAMC,EAAO,EAAGN,EAAMW,EAAKX,EAAMK,EAAK,CAAC,EAE9CT,EAAOA,EAAMK,EAAO,EAAGM,EAAMI,EAAKJ,EAAMX,EAAK,EAAE,EAC/CM,EAAOA,EAAMK,EAAO,EAAGN,EAAMU,EAAKV,EAAMC,EAAK,EAAE,EAC/CN,EAAOA,EAAMK,EAAO,EAAGM,EAAMI,EAAKJ,EAAMX,EAAK,CAAC,EAC9CM,EAAOA,EAAMK,EAAO,EAAGN,EAAMU,EAAKV,EAAMC,EAAK,CAAC,EAE9CL,EAAOA,EAAMC,EAAO,EAAGU,EAAMG,EAAKH,EAAMX,EAAK,EAAE,EAC/CM,EAAOA,EAAMK,EAAO,EAAGV,EAAMa,EAAKb,EAAMK,EAAK,EAAE,EAC/CN,EAAOA,EAAMC,EAAO,EAAGU,EAAMG,EAAKH,EAAMX,EAAK,CAAC,EAC9CM,EAAOA,EAAMK,EAAO,EAAGV,EAAMa,EAAKb,EAAMK,EAAK,CAAC,EAGhD,IAAIS,EAAK,EACTrC,EAAIqC,GAAI,EAAKlC,EAAMgB,EAAO,EAAGnB,EAAIqC,GAAI,EAAKjC,EAAMgB,EAAO,EACvDpB,EAAIqC,GAAI,EAAKhC,EAAMgB,EAAO,EAAGrB,EAAIqC,GAAI,EAAK/B,EAAMgB,EAAO,EACvDtB,EAAIqC,GAAI,EAAK9B,EAAMgB,EAAO,EAAGvB,EAAIqC,GAAI,EAAK7B,EAAMgB,EAAO,EACvDxB,EAAIqC,GAAI,EAAK5B,EAAMgB,EAAO,EAAGzB,EAAIqC,GAAI,EAAK3B,EAAMgB,EAAO,EACvD1B,EAAIqC,GAAI,EAAK1B,EAAMgB,EAAO,EAAG3B,EAAIqC,GAAI,EAAKzB,EAAMgB,EAAO,EACvD5B,EAAIqC,GAAI,EAAKxB,EAAMgB,EAAO,EAAG7B,EAAIqC,GAAI,EAAKvB,EAAMgB,EAAO,EACvD9B,EAAIqC,GAAI,EAAKtB,EAAMgB,EAAO,EAAG/B,EAAIqC,GAAI,EAAKrB,EAAMgB,EAAO,EACvDhC,EAAIqC,GAAI,EAAKpB,EAAMgB,EAAO,EAAGjC,EAAIqC,GAAI,EAAKnB,EAAMgB,EAAO,CACzD,CAQM,SAAUI,GACdzC,EAAgBC,EAAgByC,EAAgBC,EAAgB,CAEhE,IAAIrB,EAAMtB,EAAE,CAAC,EAAGuB,EAAMvB,EAAE,CAAC,EAAGwB,EAAMxB,EAAE,CAAC,EAAGyB,EAAMzB,EAAE,CAAC,EAC7C0B,EAAMzB,EAAE,CAAC,EAAG0B,EAAM1B,EAAE,CAAC,EAAG2B,EAAM3B,EAAE,CAAC,EAAG4B,EAAM5B,EAAE,CAAC,EAC7C6B,EAAM7B,EAAE,CAAC,EAAG8B,EAAM9B,EAAE,CAAC,EAAG+B,EAAM/B,EAAE,CAAC,EAAGgC,EAAMhC,EAAE,CAAC,EAC7CiC,EAAMQ,EAAE,CAAC,EAAGP,EAAMO,EAAE,CAAC,EAAGN,EAAMM,EAAE,CAAC,EAAGL,EAAMK,EAAE,CAAC,EACjD,QAASJ,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAC3BhB,EAAOA,EAAMI,EAAO,EAAGQ,EAAMK,EAAKL,EAAMZ,EAAK,EAAE,EAC/CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMa,EAAKb,EAAMI,EAAK,EAAE,EAC/CR,EAAOA,EAAMI,EAAO,EAAGQ,EAAMK,EAAKL,EAAMZ,EAAK,CAAC,EAC9CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMa,EAAKb,EAAMI,EAAK,CAAC,EAE9CP,EAAOA,EAAMI,EAAO,EAAGQ,EAAMI,EAAKJ,EAAMZ,EAAK,EAAE,EAC/CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMY,EAAKZ,EAAMI,EAAK,EAAE,EAC/CR,EAAOA,EAAMI,EAAO,EAAGQ,EAAMI,EAAKJ,EAAMZ,EAAK,CAAC,EAC9CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMY,EAAKZ,EAAMI,EAAK,CAAC,EAE9CP,EAAOA,EAAMI,EAAO,EAAGQ,EAAMG,EAAKH,EAAMZ,EAAK,EAAE,EAC/CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMW,EAAKX,EAAMI,EAAK,EAAE,EAC/CR,EAAOA,EAAMI,EAAO,EAAGQ,EAAMG,EAAKH,EAAMZ,EAAK,CAAC,EAC9CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMW,EAAKX,EAAMI,EAAK,CAAC,EAE9CP,EAAOA,EAAMI,EAAO,EAAGQ,EAAME,EAAKF,EAAMZ,EAAK,EAAE,EAC/CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMU,EAAKV,EAAMI,EAAK,EAAE,EAC/CR,EAAOA,EAAMI,EAAO,EAAGQ,EAAME,EAAKF,EAAMZ,EAAK,CAAC,EAC9CQ,EAAOA,EAAMI,EAAO,EAAGR,EAAMU,EAAKV,EAAMI,EAAK,CAAC,EAE9CX,EAAOA,EAAMK,EAAO,EAAGU,EAAME,EAAKF,EAAMf,EAAK,EAAE,EAC/CU,EAAOA,EAAMK,EAAO,EAAGV,EAAMY,EAAKZ,EAAMK,EAAK,EAAE,EAC/CV,EAAOA,EAAMK,EAAO,EAAGU,EAAME,EAAKF,EAAMf,EAAK,CAAC,EAC9CU,EAAOA,EAAMK,EAAO,EAAGV,EAAMY,EAAKZ,EAAMK,EAAK,CAAC,EAE9CT,EAAOA,EAAMK,EAAO,EAAGM,EAAMK,EAAKL,EAAMX,EAAK,EAAE,EAC/CU,EAAOA,EAAMC,EAAO,EAAGN,EAAMW,EAAKX,EAAMK,EAAK,EAAE,EAC/CV,EAAOA,EAAMK,EAAO,EAAGM,EAAMK,EAAKL,EAAMX,EAAK,CAAC,EAC9CU,EAAOA,EAAMC,EAAO,EAAGN,EAAMW,EAAKX,EAAMK,EAAK,CAAC,EAE9CT,EAAOA,EAAMK,EAAO,EAAGM,EAAMI,EAAKJ,EAAMX,EAAK,EAAE,EAC/CM,EAAOA,EAAMK,EAAO,EAAGN,EAAMU,EAAKV,EAAMC,EAAK,EAAE,EAC/CN,EAAOA,EAAMK,EAAO,EAAGM,EAAMI,EAAKJ,EAAMX,EAAK,CAAC,EAC9CM,EAAOA,EAAMK,EAAO,EAAGN,EAAMU,EAAKV,EAAMC,EAAK,CAAC,EAE9CL,EAAOA,EAAMC,EAAO,EAAGU,EAAMG,EAAKH,EAAMX,EAAK,EAAE,EAC/CM,EAAOA,EAAMK,EAAO,EAAGV,EAAMa,EAAKb,EAAMK,EAAK,EAAE,EAC/CN,EAAOA,EAAMC,EAAO,EAAGU,EAAMG,EAAKH,EAAMX,EAAK,CAAC,EAC9CM,EAAOA,EAAMK,EAAO,EAAGV,EAAMa,EAAKb,EAAMK,EAAK,CAAC,EAEhD,IAAIS,EAAK,EACTG,EAAIH,GAAI,EAAIlB,EAAKqB,EAAIH,GAAI,EAAIjB,EAC7BoB,EAAIH,GAAI,EAAIhB,EAAKmB,EAAIH,GAAI,EAAIf,EAC7BkB,EAAIH,GAAI,EAAIN,EAAKS,EAAIH,GAAI,EAAIL,EAC7BQ,EAAIH,GAAI,EAAIJ,EAAKO,EAAIH,GAAI,EAAIH,CAC/B,CAaO,IAAMO,GAA2BC,GAAaC,GAAY,CAC/D,aAAc,GACd,cAAe,EACf,eAAgB,GACjB,EAOYC,GAA4BF,GAAaC,GAAY,CAChE,aAAc,GACd,cAAe,EACf,cAAeE,GACf,eAAgB,GACjB,EAoBD,IAAMC,GAA0B,IAAI,WAAW,EAAE,EAE3CC,GAAe,CAACC,EAAuCC,IAAmB,CAC9ED,EAAE,OAAOC,CAAG,EACZ,IAAMC,EAAOD,EAAI,OAAS,GACtBC,GAAMF,EAAE,OAAOF,GAAQ,SAASI,CAAI,CAAC,CAC3C,EAEMC,GAA0B,IAAI,WAAW,EAAE,EACjD,SAASC,GACPC,EACAC,EACAC,EACAC,EACAC,EAAgB,CAEhB,IAAMC,EAAUL,EAAGC,EAAKC,EAAOJ,EAAO,EAChCH,EAAIW,GAAS,OAAOD,CAAO,EAC7BD,GAAKV,GAAaC,EAAGS,CAAG,EAC5BV,GAAaC,EAAGQ,CAAI,EACpB,IAAMI,EAAM,IAAI,WAAW,EAAE,EACvBC,EAAOC,GAAWF,CAAG,EAC3BG,GAAaF,EAAM,EAAG,OAAOJ,EAAMA,EAAI,OAAS,CAAC,EAAG,EAAI,EACxDM,GAAaF,EAAM,EAAG,OAAOL,EAAK,MAAM,EAAG,EAAI,EAC/CR,EAAE,OAAOY,CAAG,EACZ,IAAMI,EAAMhB,EAAE,OAAM,EACpB,OAAAU,EAAQ,KAAK,CAAC,EACPM,CACT,CAWO,IAAMC,GACVC,GACD,CAACZ,EAAiBC,EAAmBE,KAEnCU,EAAOb,EAAK,EAAE,EACda,EAAOZ,CAAK,EACL,CACL,QAAS,CAACa,EAAuBC,IAAuB,CACtD,IAAMC,EAAUF,EAAU,OACpBG,EAAUD,EAAU,GACtBD,EACFF,EAAOE,EAAQE,CAAO,EAEtBF,EAAS,IAAI,WAAWE,CAAO,EAEjCL,EAAUZ,EAAKC,EAAOa,EAAWC,EAAQ,CAAC,EAC1C,IAAMG,EAAMpB,GAAWc,EAAWZ,EAAKC,EAAOc,EAAO,SAAS,EAAG,GAAU,EAAGZ,CAAG,EACjF,OAAAY,EAAO,IAAIG,EAAKF,CAAO,EAChBD,CACT,EACA,QAAS,CAACI,EAAwBJ,IAAuB,CACvD,IAAME,EAAUE,EAAW,OACrBH,EAAUC,EAAU,GAC1B,GAAIA,EAAU,GACZ,MAAM,IAAI,MAAM,0CAAoD,EAClEF,EACFF,EAAOE,EAAQC,CAAO,EAEtBD,EAAS,IAAI,WAAWC,CAAO,EAEjC,IAAMd,EAAOiB,EAAW,SAAS,EAAG,GAAU,EACxCC,EAAYD,EAAW,SAAS,GAAU,EAC1CD,EAAMpB,GAAWc,EAAWZ,EAAKC,EAAOC,EAAMC,CAAG,EACvD,GAAI,CAACkB,GAAWD,EAAWF,CAAG,EAAG,MAAM,IAAI,MAAM,aAAa,EAC9D,OAAAN,EAAUZ,EAAKC,EAAOC,EAAMa,EAAQ,CAAC,EAC9BA,CACT,IAQOO,GAAmCC,GAC9C,CAAE,UAAW,GAAI,YAAa,GAAI,UAAW,EAAE,EAC/CZ,GAAea,EAAQ,CAAC,EAObC,GAAoCF,GAC/C,CAAE,UAAW,GAAI,YAAa,GAAI,UAAW,EAAE,EAC/CZ,GAAee,EAAS,CAAC,EC3RrB,SAAUC,GAAOC,EAAS,CAC9B,GAAI,CAAC,OAAO,cAAcA,CAAC,GAAKA,EAAI,EAAG,MAAM,IAAI,MAAM,2BAA2BA,CAAC,EAAE,CACvF,CAEM,SAAUC,GAAKC,EAAU,CAC7B,GAAI,OAAOA,GAAM,UAAW,MAAM,IAAI,MAAM,yBAAyBA,CAAC,EAAE,CAC1E,CAEM,SAAUC,GAAMD,KAA8BE,EAAiB,CACnE,GAAI,EAAEF,aAAa,YAAa,MAAM,IAAI,MAAM,qBAAqB,EACrE,GAAIE,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAASF,EAAE,MAAM,EAClD,MAAM,IAAI,MAAM,iCAAiCE,CAAO,mBAAmBF,EAAE,MAAM,EAAE,CACzF,CAQM,SAAUG,GAAKA,EAAU,CAC7B,GAAI,OAAOA,GAAS,YAAc,OAAOA,EAAK,QAAW,WACvD,MAAM,IAAI,MAAM,iDAAiD,EACnEN,GAAOM,EAAK,SAAS,EACrBN,GAAOM,EAAK,QAAQ,CACtB,CAEM,SAAUC,GAAOC,EAAeC,EAAgB,GAAI,CACxD,GAAID,EAAS,UAAW,MAAM,IAAI,MAAM,kCAAkC,EAC1E,GAAIC,GAAiBD,EAAS,SAAU,MAAM,IAAI,MAAM,uCAAuC,CACjG,CACM,SAAUE,GAAOC,EAAUH,EAAa,CAC5CJ,GAAMO,CAAG,EACT,IAAMC,EAAMJ,EAAS,UACrB,GAAIG,EAAI,OAASC,EACf,MAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE,CAElF,CAEA,IAAMC,GAAS,CACb,OAAAb,GACA,KAAAE,GACA,MAAAE,GACA,KAAAE,GACA,OAAAC,GACA,OAAAG,IAGFI,EAAeD,GC7CT,IAAOE,GAAP,cAAuCC,EAAa,CAQxD,YAAYC,EAAaC,EAAW,CAClC,MAAK,EAJC,KAAA,SAAW,GACX,KAAA,UAAY,GAIlBC,EAAO,KAAKF,CAAI,EAChB,IAAMG,EAAMC,GAAQH,CAAI,EAExB,GADA,KAAK,MAAQD,EAAK,OAAM,EACpB,OAAO,KAAK,MAAM,QAAW,WAC/B,MAAM,IAAI,MAAM,qDAAqD,EACvE,KAAK,SAAW,KAAK,MAAM,SAC3B,KAAK,UAAY,KAAK,MAAM,UAC5B,IAAMK,EAAW,KAAK,SAChBC,EAAM,IAAI,WAAWD,CAAQ,EAEnCC,EAAI,IAAIH,EAAI,OAASE,EAAWL,EAAK,OAAM,EAAG,OAAOG,CAAG,EAAE,OAAM,EAAKA,CAAG,EACxE,QAAS,EAAI,EAAG,EAAIG,EAAI,OAAQ,IAAKA,EAAI,CAAC,GAAK,GAC/C,KAAK,MAAM,OAAOA,CAAG,EAErB,KAAK,MAAQN,EAAK,OAAM,EAExB,QAAS,EAAI,EAAG,EAAIM,EAAI,OAAQ,IAAKA,EAAI,CAAC,GAAK,IAC/C,KAAK,MAAM,OAAOA,CAAG,EACrBA,EAAI,KAAK,CAAC,CACZ,CACA,OAAOC,EAAU,CACf,OAAAL,EAAO,OAAO,IAAI,EAClB,KAAK,MAAM,OAAOK,CAAG,EACd,IACT,CACA,WAAWC,EAAe,CACxBN,EAAO,OAAO,IAAI,EAClBA,EAAO,MAAMM,EAAK,KAAK,SAAS,EAChC,KAAK,SAAW,GAChB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,MAAM,OAAOA,CAAG,EACrB,KAAK,MAAM,WAAWA,CAAG,EACzB,KAAK,QAAO,CACd,CACA,QAAM,CACJ,IAAMA,EAAM,IAAI,WAAW,KAAK,MAAM,SAAS,EAC/C,YAAK,WAAWA,CAAG,EACZA,CACT,CACA,WAAWC,EAAY,CAErBA,IAAAA,EAAO,OAAO,OAAO,OAAO,eAAe,IAAI,EAAG,CAAA,CAAE,GACpD,GAAM,CAAE,MAAAC,EAAO,MAAAC,EAAO,SAAAC,EAAU,UAAAC,EAAW,SAAAR,EAAU,UAAAS,CAAS,EAAK,KACnE,OAAAL,EAAKA,EACLA,EAAG,SAAWG,EACdH,EAAG,UAAYI,EACfJ,EAAG,SAAWJ,EACdI,EAAG,UAAYK,EACfL,EAAG,MAAQC,EAAM,WAAWD,EAAG,KAAK,EACpCA,EAAG,MAAQE,EAAM,WAAWF,EAAG,KAAK,EAC7BA,CACT,CACA,SAAO,CACL,KAAK,UAAY,GACjB,KAAK,MAAM,QAAO,EAClB,KAAK,MAAM,QAAO,CACpB,GASWM,GAAO,CAACf,EAAaG,EAAYa,IAC5C,IAAIlB,GAAUE,EAAMG,CAAG,EAAE,OAAOa,CAAO,EAAE,OAAM,EACjDD,GAAK,OAAS,CAACf,EAAaG,IAAe,IAAIL,GAAUE,EAAMG,CAAG,ECjE5D,SAAUc,GAAQC,EAAaC,EAAYC,EAAY,CAC3D,OAAAC,EAAO,KAAKH,CAAI,EAIZE,IAAS,SAAWA,EAAO,IAAI,WAAWF,EAAK,SAAS,GACrDI,GAAKJ,EAAMK,GAAQH,CAAI,EAAGG,GAAQJ,CAAG,CAAC,CAC/C,CAGA,IAAMK,GAAe,IAAI,WAAW,CAAC,CAAC,CAAC,EACjCC,GAAe,IAAI,WAQnB,SAAUC,GAAOR,EAAaS,EAAYC,EAAcC,EAAiB,GAAE,CAG/E,GAFAR,EAAO,KAAKH,CAAI,EAChBG,EAAO,OAAOQ,CAAM,EAChBA,EAAS,IAAMX,EAAK,UAAW,MAAM,IAAI,MAAM,iCAAiC,EACpF,IAAMY,EAAS,KAAK,KAAKD,EAASX,EAAK,SAAS,EAC5CU,IAAS,SAAWA,EAAOH,IAE/B,IAAMM,EAAM,IAAI,WAAWD,EAASZ,EAAK,SAAS,EAE5Cc,EAAOV,GAAK,OAAOJ,EAAMS,CAAG,EAC5BM,EAAUD,EAAK,WAAU,EACzBE,EAAI,IAAI,WAAWF,EAAK,SAAS,EACvC,QAASG,EAAU,EAAGA,EAAUL,EAAQK,IACtCX,GAAa,CAAC,EAAIW,EAAU,EAG5BF,EAAQ,OAAOE,IAAY,EAAIV,GAAeS,CAAC,EAC5C,OAAON,CAAI,EACX,OAAOJ,EAAY,EACnB,WAAWU,CAAC,EACfH,EAAI,IAAIG,EAAGhB,EAAK,UAAYiB,CAAO,EACnCH,EAAK,WAAWC,CAAO,EAEzB,OAAAD,EAAK,QAAO,EACZC,EAAQ,QAAO,EACfC,EAAE,KAAK,CAAC,EACRV,GAAa,KAAK,CAAC,EACZO,EAAI,MAAM,EAAGF,CAAM,CAC5B,CC1DA,SAASO,GAAaC,EAAgBC,EAAoBC,EAAeC,EAAa,CACpF,GAAI,OAAOH,EAAK,cAAiB,WAAY,OAAOA,EAAK,aAAaC,EAAYC,EAAOC,CAAI,EAC7F,IAAMC,EAAO,OAAO,EAAE,EAChBC,EAAW,OAAO,UAAU,EAC5BC,EAAK,OAAQJ,GAASE,EAAQC,CAAQ,EACtCE,EAAK,OAAOL,EAAQG,CAAQ,EAC5BG,EAAIL,EAAO,EAAI,EACfM,EAAIN,EAAO,EAAI,EACrBH,EAAK,UAAUC,EAAaO,EAAGF,EAAIH,CAAI,EACvCH,EAAK,UAAUC,EAAaQ,EAAGF,EAAIJ,CAAI,CACzC,CAGM,IAAgBO,GAAhB,cAAgDC,EAAO,CAc3D,YACWC,EACFC,EACEC,EACAX,EAAa,CAEtB,MAAK,EALI,KAAA,SAAAS,EACF,KAAA,UAAAC,EACE,KAAA,UAAAC,EACA,KAAA,KAAAX,EATD,KAAA,SAAW,GACX,KAAA,OAAS,EACT,KAAA,IAAM,EACN,KAAA,UAAY,GASpB,KAAK,OAAS,IAAI,WAAWS,CAAQ,EACrC,KAAK,KAAOG,GAAW,KAAK,MAAM,CACpC,CACA,OAAOC,EAAW,CAChBC,EAAO,OAAO,IAAI,EAClB,GAAM,CAAE,KAAAjB,EAAM,OAAAkB,EAAQ,SAAAN,CAAQ,EAAK,KACnCI,EAAOG,GAAQH,CAAI,EACnB,IAAMI,EAAMJ,EAAK,OACjB,QAASK,EAAM,EAAGA,EAAMD,GAAO,CAC7B,IAAME,EAAO,KAAK,IAAIV,EAAW,KAAK,IAAKQ,EAAMC,CAAG,EAEpD,GAAIC,IAASV,EAAU,CACrB,IAAMW,EAAWR,GAAWC,CAAI,EAChC,KAAOJ,GAAYQ,EAAMC,EAAKA,GAAOT,EAAU,KAAK,QAAQW,EAAUF,CAAG,EACzE,SAEFH,EAAO,IAAIF,EAAK,SAASK,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQV,IACf,KAAK,QAAQZ,EAAM,CAAC,EACpB,KAAK,IAAM,GAGf,YAAK,QAAUgB,EAAK,OACpB,KAAK,WAAU,EACR,IACT,CACA,WAAWQ,EAAe,CACxBP,EAAO,OAAO,IAAI,EAClBA,EAAO,OAAOO,EAAK,IAAI,EACvB,KAAK,SAAW,GAIhB,GAAM,CAAE,OAAAN,EAAQ,KAAAlB,EAAM,SAAAY,EAAU,KAAAT,CAAI,EAAK,KACrC,CAAE,IAAAkB,CAAG,EAAK,KAEdH,EAAOG,GAAK,EAAI,IAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,EAE5B,KAAK,UAAYT,EAAWS,IAC9B,KAAK,QAAQrB,EAAM,CAAC,EACpBqB,EAAM,GAGR,QAASI,EAAIJ,EAAKI,EAAIb,EAAUa,IAAKP,EAAOO,CAAC,EAAI,EAIjD1B,GAAaC,EAAMY,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGT,CAAI,EAC9D,KAAK,QAAQH,EAAM,CAAC,EACpB,IAAM0B,EAAQX,GAAWS,CAAG,EACtBJ,EAAM,KAAK,UAEjB,GAAIA,EAAM,EAAG,MAAM,IAAI,MAAM,6CAA6C,EAC1E,IAAMO,EAASP,EAAM,EACfQ,EAAQ,KAAK,IAAG,EACtB,GAAID,EAASC,EAAM,OAAQ,MAAM,IAAI,MAAM,oCAAoC,EAC/E,QAASH,EAAI,EAAGA,EAAIE,EAAQF,IAAKC,EAAM,UAAU,EAAID,EAAGG,EAAMH,CAAC,EAAGtB,CAAI,CACxE,CACA,QAAM,CACJ,GAAM,CAAE,OAAAe,EAAQ,UAAAL,CAAS,EAAK,KAC9B,KAAK,WAAWK,CAAM,EACtB,IAAMW,EAAMX,EAAO,MAAM,EAAGL,CAAS,EACrC,YAAK,QAAO,EACLgB,CACT,CACA,WAAWC,EAAM,CACfA,IAAAA,EAAO,IAAK,KAAK,aACjBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,GAAM,CAAE,SAAAlB,EAAU,OAAAM,EAAQ,OAAAa,EAAQ,SAAAC,EAAU,UAAAC,EAAW,IAAAZ,CAAG,EAAK,KAC/D,OAAAS,EAAG,OAASC,EACZD,EAAG,IAAMT,EACTS,EAAG,SAAWE,EACdF,EAAG,UAAYG,EACXF,EAASnB,GAAUkB,EAAG,OAAO,IAAIZ,CAAM,EACpCY,CACT,GChHF,IAAMI,GAAM,CAACC,EAAWC,EAAWC,IAAeF,EAAIC,EAAM,CAACD,EAAIE,EAE3DC,GAAM,CAACH,EAAWC,EAAWC,IAAeF,EAAIC,EAAMD,EAAIE,EAAMD,EAAIC,EAKpEE,GAAW,IAAI,YAAY,CAC/B,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,WACrF,EAIKC,GAAK,IAAI,YAAY,CACzB,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WACrF,EAIKC,GAAW,IAAI,YAAY,EAAE,EAC7BC,GAAN,cAAqBC,EAAY,CAY/B,aAAA,CACE,MAAM,GAAI,GAAI,EAAG,EAAK,EAVxB,KAAA,EAAIH,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,CAIZ,CACU,KAAG,CACX,GAAM,CAAE,EAAAI,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,CAChC,CAEU,IACRP,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAS,CAEtF,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,CACf,CACU,QAAQC,EAAgBC,EAAc,CAE9C,QAASC,EAAI,EAAGA,EAAI,GAAIA,IAAKD,GAAU,EAAGZ,GAASa,CAAC,EAAIF,EAAK,UAAUC,EAAQ,EAAK,EACpF,QAASC,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,IAAMC,EAAMd,GAASa,EAAI,EAAE,EACrBE,EAAKf,GAASa,EAAI,CAAC,EACnBG,EAAKC,GAAKH,EAAK,CAAC,EAAIG,GAAKH,EAAK,EAAE,EAAKA,IAAQ,EAC7CI,EAAKD,GAAKF,EAAI,EAAE,EAAIE,GAAKF,EAAI,EAAE,EAAKA,IAAO,GACjDf,GAASa,CAAC,EAAKK,EAAKlB,GAASa,EAAI,CAAC,EAAIG,EAAKhB,GAASa,EAAI,EAAE,EAAK,EAGjE,GAAI,CAAE,EAAAV,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAASG,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAC3B,IAAMM,EAASF,GAAKV,EAAG,CAAC,EAAIU,GAAKV,EAAG,EAAE,EAAIU,GAAKV,EAAG,EAAE,EAC9Ca,EAAMV,EAAIS,EAAS1B,GAAIc,EAAGC,EAAGC,CAAC,EAAIX,GAASe,CAAC,EAAIb,GAASa,CAAC,EAAK,EAE/DQ,GADSJ,GAAKd,EAAG,CAAC,EAAIc,GAAKd,EAAG,EAAE,EAAIc,GAAKd,EAAG,EAAE,GAC/BN,GAAIM,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIc,EAAM,EACfd,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKiB,EAAKC,EAAM,EAGlBlB,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,CACjC,CACU,YAAU,CAClBV,GAAS,KAAK,CAAC,CACjB,CACA,SAAO,CACL,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B,KAAK,OAAO,KAAK,CAAC,CACpB,GAGIsB,GAAN,cAAqBrB,EAAM,CASzB,aAAA,CACE,MAAK,EATP,KAAA,EAAI,YACJ,KAAA,EAAI,UACJ,KAAA,EAAI,UACJ,KAAA,EAAI,WACJ,KAAA,EAAI,SACJ,KAAA,EAAI,WACJ,KAAA,EAAI,WACJ,KAAA,EAAI,YAGF,KAAK,UAAY,EACnB,GAOWsB,GAASC,GAAgB,IAAM,IAAIvB,EAAQ,EAC3CwB,GAASD,GAAgB,IAAM,IAAIF,EAAQ,ECtHxD,IAAII,GAAc,IAAI,YAAY,OAAO,EACrCC,GAAc,IAAI,YAGlBC,GAAmB,EACnBC,GAAmB,MACvB,SAASC,GAAmBC,EAAUC,EAAS,CAC7C,IAAMC,EAAUC,GAAU,gBAAgBH,EAAU,KAAOC,CAAO,EAAE,SAAS,EAAG,EAAE,EAClF,OAAOG,GAAaC,GAAQH,EAAS,UAAU,CACjD,CACA,SAASI,GAAeC,EAAiBC,EAAO,CAC9C,IAAMC,EAAOC,GAAYL,GAAQE,EAAiBC,EAAO,EAAE,EAC3D,MAAO,CACL,WAAYC,EAAK,SAAS,EAAG,EAAE,EAC/B,aAAcA,EAAK,SAAS,GAAI,EAAE,EAClC,SAAUA,EAAK,SAAS,GAAI,EAAE,CAChC,CACF,CACA,SAASE,GAAcC,EAAK,CAC1B,GAAI,CAAC,OAAO,cAAcA,CAAG,GAAKA,EAAM,EACtC,MAAM,IAAI,MAAM,2BAA2B,EAC7C,GAAIA,GAAO,GACT,MAAO,IACT,IAAMC,EAAY,GAAK,KAAK,MAAM,KAAK,KAAKD,EAAM,CAAC,CAAC,EAAI,EAClDE,EAAQD,GAAa,IAAM,GAAKA,EAAY,EAClD,OAAOC,GAAS,KAAK,OAAOF,EAAM,GAAKE,CAAK,EAAI,EAClD,CACA,SAASC,GAAWC,EAAK,CACvB,GAAI,CAAC,OAAO,cAAcA,CAAG,GAAKA,EAAMnB,IAAoBmB,EAAMlB,GAChE,MAAM,IAAI,MAAM,2DAA2D,EAC7E,IAAMmB,EAAM,IAAI,WAAW,CAAC,EAC5B,WAAI,SAASA,EAAI,MAAM,EAAE,UAAU,EAAGD,EAAK,EAAK,EACzCC,CACT,CACA,SAASC,GAAIC,EAAW,CACtB,IAAMC,EAAWxB,GAAY,OAAOuB,CAAS,EACvCE,EAAcD,EAAS,OACvBE,EAASP,GAAWM,CAAW,EAC/BE,EAAS,IAAI,WAAWZ,GAAcU,CAAW,EAAIA,CAAW,EACtE,OAAOG,GAAYF,EAAQF,EAAUG,CAAM,CAC7C,CACA,SAASE,GAAMC,EAAQ,CACrB,IAAML,EAAc,IAAI,SAASK,EAAO,MAAM,EAAE,UAAU,CAAC,EACrDN,EAAWM,EAAO,SAAS,EAAG,EAAIL,CAAW,EACnD,GAAIA,EAAcxB,IAAoBwB,EAAcvB,IAAoBsB,EAAS,SAAWC,GAAeK,EAAO,SAAW,EAAIf,GAAcU,CAAW,EACxJ,MAAM,IAAI,MAAM,iBAAiB,EACnC,OAAO1B,GAAY,OAAOyB,CAAQ,CACpC,CACA,SAASO,GAAQC,EAAKC,EAASC,EAAK,CAClC,GAAIA,EAAI,SAAW,GACjB,MAAM,IAAI,MAAM,sCAAsC,EACxD,IAAMC,EAAWP,GAAYM,EAAKD,CAAO,EACzC,OAAOG,GAAK3B,GAAQuB,EAAKG,CAAQ,CACnC,CACA,SAASE,GAAcC,EAAS,CAC9B,GAAI,OAAOA,GAAY,SACrB,MAAM,IAAI,MAAM,gCAAgC,EAClD,IAAMC,EAAOD,EAAQ,OACrB,GAAIC,EAAO,KAAOA,EAAO,MACvB,MAAM,IAAI,MAAM,2BAA6BA,CAAI,EACnD,GAAID,EAAQ,CAAC,IAAM,IACjB,MAAM,IAAI,MAAM,4BAA4B,EAC9C,IAAIE,EACJ,GAAI,CACFA,EAAOC,GAAO,OAAOH,CAAO,CAC9B,OAASI,EAAO,CACd,MAAM,IAAI,MAAM,mBAAqBA,EAAM,OAAO,CACpD,CACA,IAAMC,EAAOH,EAAK,OAClB,GAAIG,EAAO,IAAMA,EAAO,MACtB,MAAM,IAAI,MAAM,wBAA0BA,CAAI,EAChD,IAAMC,EAAOJ,EAAK,CAAC,EACnB,GAAII,IAAS,EACX,MAAM,IAAI,MAAM,8BAAgCA,CAAI,EACtD,MAAO,CACL,MAAOJ,EAAK,SAAS,EAAG,EAAE,EAC1B,WAAYA,EAAK,SAAS,GAAI,GAAG,EACjC,IAAKA,EAAK,SAAS,GAAG,CACxB,CACF,CACA,SAASK,GAAQtB,EAAWZ,EAAiBC,EAAQkC,GAAY,EAAE,EAAG,CACpE,GAAM,CAAE,WAAAC,EAAY,aAAAC,EAAc,SAAAC,CAAS,EAAIvC,GAAeC,EAAiBC,CAAK,EAC9EkB,EAASR,GAAIC,CAAS,EACtB2B,EAAaC,GAASJ,EAAYC,EAAclB,CAAM,EACtDsB,EAAMrB,GAAQkB,EAAUC,EAAYtC,CAAK,EAC/C,OAAO6B,GAAO,OAAOb,GAAY,IAAI,WAAW,CAAC,CAAC,CAAC,EAAGhB,EAAOsC,EAAYE,CAAG,CAAC,CAC/E,CACA,SAASC,GAAQf,EAAS3B,EAAiB,CACzC,GAAM,CAAE,MAAAC,EAAO,WAAAsC,EAAY,IAAAE,CAAI,EAAIf,GAAcC,CAAO,EAClD,CAAE,WAAAS,EAAY,aAAAC,EAAc,SAAAC,CAAS,EAAIvC,GAAeC,EAAiBC,CAAK,EAC9E0C,EAAgBvB,GAAQkB,EAAUC,EAAYtC,CAAK,EACzD,GAAI,CAAC2C,GAAWD,EAAeF,CAAG,EAChC,MAAM,IAAI,MAAM,aAAa,EAC/B,IAAMtB,EAASqB,GAASJ,EAAYC,EAAcE,CAAU,EAC5D,OAAOrB,GAAMC,CAAM,CACrB,CACA,IAAI0B,GAAK,CACP,MAAO,CACL,mBAAArD,GACA,cAAAY,EACF,EACA,QAAA8B,GACA,QAAAQ,EACF,ECvGA,SAASI,GAAWC,EAAaC,EAAkBC,EAAcC,EAAgB,CAC/EC,EAAO,KAAKJ,CAAI,EAChB,IAAMK,EAAOC,GAAU,CAAE,MAAO,GAAI,UAAW,EAAE,EAAIH,CAAK,EACpD,CAAE,EAAAI,EAAG,MAAAC,EAAO,UAAAC,CAAS,EAAKJ,EAIhC,GAHAD,EAAO,OAAOG,CAAC,EACfH,EAAO,OAAOI,CAAK,EACnBJ,EAAO,OAAOK,CAAS,EACnBF,EAAI,EAAG,MAAM,IAAI,MAAM,uCAAuC,EAClE,IAAMG,EAAWC,GAAQV,CAAS,EAC5BW,EAAOD,GAAQT,CAAK,EAEpBW,EAAK,IAAI,WAAWL,CAAK,EAEzBM,EAAMC,GAAK,OAAOf,EAAMU,CAAQ,EAChCM,EAAUF,EAAI,WAAU,EAAG,OAAOF,CAAI,EAC5C,MAAO,CAAE,EAAAL,EAAG,MAAAC,EAAO,UAAAC,EAAW,GAAAI,EAAI,IAAAC,EAAK,QAAAE,CAAO,CAChD,CAEA,SAASC,GACPH,EACAE,EACAH,EACAK,EACAC,EAAa,CAEb,OAAAL,EAAI,QAAO,EACXE,EAAQ,QAAO,EACXE,GAAMA,EAAK,QAAO,EACtBC,EAAE,KAAK,CAAC,EACDN,CACT,CASM,SAAUO,GAAOpB,EAAaU,EAAiBE,EAAaP,EAAe,CAC/E,GAAM,CAAE,EAAAE,EAAG,MAAAC,EAAO,GAAAK,EAAI,IAAAC,EAAK,QAAAE,CAAO,EAAKjB,GAAWC,EAAMU,EAAUE,EAAMP,CAAI,EACxEa,EACEG,EAAM,IAAI,WAAW,CAAC,EACtBC,EAAOC,GAAWF,CAAG,EACrBF,EAAI,IAAI,WAAWL,EAAI,SAAS,EAEtC,QAASU,EAAK,EAAGC,EAAM,EAAGA,EAAMjB,EAAOgB,IAAMC,GAAOX,EAAI,UAAW,CAEjE,IAAMY,EAAKb,EAAG,SAASY,EAAKA,EAAMX,EAAI,SAAS,EAC/CQ,EAAK,SAAS,EAAGE,EAAI,EAAK,GAGzBN,EAAOF,EAAQ,WAAWE,CAAI,GAAG,OAAOG,CAAG,EAAE,WAAWF,CAAC,EAC1DO,EAAG,IAAIP,EAAE,SAAS,EAAGO,EAAG,MAAM,CAAC,EAC/B,QAASC,EAAK,EAAGA,EAAKpB,EAAGoB,IAAM,CAE7Bb,EAAI,WAAWI,CAAI,EAAE,OAAOC,CAAC,EAAE,WAAWA,CAAC,EAC3C,QAASS,EAAI,EAAGA,EAAIF,EAAG,OAAQE,IAAKF,EAAGE,CAAC,GAAKT,EAAES,CAAC,GAGpD,OAAOX,GAAaH,EAAKE,EAASH,EAAIK,EAAMC,CAAC,CAC/C,CChEA,IAAMU,EAAO,CAACC,EAAWC,IAAeD,GAAKC,EAAMD,IAAO,GAAKC,EAK/D,SAASC,GACPC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAU,CAIV,IAAIC,EAAMN,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAAGI,EAAMP,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAC7DK,EAAMR,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAAGM,EAAMT,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAC7DO,EAAMV,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAAGQ,EAAMX,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAC7DS,EAAMZ,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAAGU,EAAMb,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAC7DW,EAAMd,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAAGY,EAAMf,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAC7Da,EAAMhB,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAAGc,EAAMjB,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAC7De,EAAMlB,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAAGgB,EAAMnB,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAC7DiB,EAAMpB,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAAGkB,EAAMrB,EAAKC,GAAI,EAAIC,EAAMC,GAAI,EAE7DmB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EACvCiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EACvCiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EACvCiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAE3C,QAASiB,EAAI,EAAGA,EAAI,EAAGA,GAAK,EAC1BZ,GAAO9B,EAAK0B,EAAMY,EAAM,EAAI,CAAC,EAAGJ,GAAOlC,EAAK8B,EAAMJ,EAAM,EAAI,CAAC,EAC7DY,GAAOtC,EAAKkC,EAAMJ,EAAM,EAAG,EAAE,EAAGJ,GAAO1B,EAAKsC,EAAMJ,EAAM,EAAG,EAAE,EAC7DC,GAAOnC,EAAK+B,EAAMJ,EAAM,EAAI,CAAC,EAAGY,GAAOvC,EAAKmC,EAAMJ,EAAM,EAAI,CAAC,EAC7DJ,GAAO3B,EAAKuC,EAAMJ,EAAM,EAAG,EAAE,EAAGJ,GAAO/B,EAAK2B,EAAMY,EAAM,EAAG,EAAE,EAC7DC,GAAOxC,EAAKoC,EAAMJ,EAAM,EAAI,CAAC,EAAGJ,GAAO5B,EAAKwC,EAAMJ,EAAM,EAAI,CAAC,EAC7DJ,GAAOhC,EAAK4B,EAAMY,EAAM,EAAG,EAAE,EAAGJ,GAAOpC,EAAKgC,EAAMJ,EAAM,EAAG,EAAE,EAC7DC,GAAO7B,EAAKyC,EAAMJ,EAAM,EAAI,CAAC,EAAGJ,GAAOjC,EAAK6B,EAAMY,EAAM,EAAI,CAAC,EAC7DJ,GAAOrC,EAAKiC,EAAMJ,EAAM,EAAG,EAAE,EAAGY,GAAOzC,EAAKqC,EAAMJ,EAAM,EAAG,EAAE,EAC7DN,GAAO3B,EAAK0B,EAAMG,EAAM,EAAI,CAAC,EAAGD,GAAO5B,EAAK2B,EAAMD,EAAM,EAAI,CAAC,EAC7DG,GAAO7B,EAAK4B,EAAMD,EAAM,EAAG,EAAE,EAAGD,GAAO1B,EAAK6B,EAAMD,EAAM,EAAG,EAAE,EAC7DI,GAAOhC,EAAK+B,EAAMD,EAAM,EAAI,CAAC,EAAGG,GAAOjC,EAAKgC,EAAMD,EAAM,EAAI,CAAC,EAC7DD,GAAO9B,EAAKiC,EAAMD,EAAM,EAAG,EAAE,EAAGD,GAAO/B,EAAK8B,EAAMG,EAAM,EAAG,EAAE,EAC7DI,GAAOrC,EAAKoC,EAAMD,EAAM,EAAI,CAAC,EAAGD,GAAOlC,EAAKqC,EAAMD,EAAM,EAAI,CAAC,EAC7DD,GAAOnC,EAAKkC,EAAMG,EAAM,EAAG,EAAE,EAAGD,GAAOpC,EAAKmC,EAAMD,EAAM,EAAG,EAAE,EAC7DI,GAAOtC,EAAKyC,EAAMD,EAAM,EAAI,CAAC,EAAGD,GAAOvC,EAAKsC,EAAMG,EAAM,EAAI,CAAC,EAC7DD,GAAOxC,EAAKuC,EAAMD,EAAM,EAAG,EAAE,EAAGG,GAAOzC,EAAKwC,EAAMD,EAAM,EAAG,EAAE,EAG/D/B,EAAIC,GAAI,EAAKC,EAAMgB,EAAO,EAAGlB,EAAIC,GAAI,EAAKE,EAAMgB,EAAO,EACvDnB,EAAIC,GAAI,EAAKG,EAAMgB,EAAO,EAAGpB,EAAIC,GAAI,EAAKI,EAAMgB,EAAO,EACvDrB,EAAIC,GAAI,EAAKK,EAAMgB,EAAO,EAAGtB,EAAIC,GAAI,EAAKM,EAAMgB,EAAO,EACvDvB,EAAIC,GAAI,EAAKO,EAAMgB,EAAO,EAAGxB,EAAIC,GAAI,EAAKQ,EAAMgB,EAAO,EACvDzB,EAAIC,GAAI,EAAKS,EAAMgB,EAAO,EAAG1B,EAAIC,GAAI,EAAKU,EAAMgB,EAAO,EACvD3B,EAAIC,GAAI,EAAKW,EAAMgB,EAAO,EAAG5B,EAAIC,GAAI,EAAKY,EAAMgB,EAAO,EACvD7B,EAAIC,GAAI,EAAKa,EAAMgB,EAAO,EAAG9B,EAAIC,GAAI,EAAKc,EAAMgB,EAAO,EACvD/B,EAAIC,GAAI,EAAKe,EAAMgB,EAAO,EAAGhC,EAAIC,GAAI,EAAKgB,EAAMgB,EAAO,CACzD,CAEA,SAASE,GAASrC,EAAoBC,EAAYC,EAAkBC,EAAYmC,EAAS,CAEvF,IAAIC,EAAOpC,EAAK,EACZqC,EAAOrC,EAAK,GAAKmC,EACrB,QAASF,EAAI,EAAGA,EAAI,GAAIA,IAAKlC,EAAIsC,EAAOJ,CAAC,EAAIpC,EAAMC,GAAM,EAAIqC,EAAI,GAAK,GAAKF,CAAC,EAC5E,QAASA,EAAI,EAAGA,EAAIE,EAAGF,IAAKG,GAAQ,GAAItC,GAAM,GAE5CJ,GAAYK,EAAKsC,EAAMxC,EAAOC,EAAIC,EAAKqC,CAAI,EACvCH,EAAI,IAAGI,GAAQ,IACnB3C,GAAYK,EAAKqC,EAAMvC,EAAQC,GAAM,GAAKC,EAAKsC,CAAI,CAEvD,CAaA,SAASC,GAAWC,EAAiBC,EAAaC,EAAkB,CAElE,IAAMC,EAAOC,GACX,CACE,MAAO,GACP,UAAW,GACX,OAAQ,YAEVF,CAAK,EAED,CAAE,EAAAG,EAAG,EAAAT,EAAG,EAAAU,EAAG,MAAAC,EAAO,UAAAC,EAAW,OAAAC,EAAQ,WAAAC,CAAU,EAAKP,EAO1D,GANAQ,EAAO,OAAON,CAAC,EACfM,EAAO,OAAOf,CAAC,EACfe,EAAO,OAAOL,CAAC,EACfK,EAAO,OAAOJ,CAAK,EACnBI,EAAO,OAAOH,CAAS,EACvBG,EAAO,OAAOF,CAAM,EAChBC,IAAe,QAAa,OAAOA,GAAe,WACpD,MAAM,IAAI,MAAM,+BAA+B,EACjD,IAAME,EAAY,IAAMhB,EAClBiB,EAAcD,EAAY,EAChC,GAAIP,GAAK,GAAMA,EAAKA,EAAI,GAAaA,GAAK,IAAMO,EAAY,IAAMP,EAAI,GAAK,GAGzE,MAAM,IAAI,MACR,6FAA6F,EAGjG,GAAIC,EAAI,GAAKA,GAAM,GAAK,GAAK,GAAK,GAAMM,EACtC,MAAM,IAAI,MACR,0FAA0F,EAG9F,GAAIL,EAAQ,GAAKA,GAAS,GAAK,GAAK,GAAK,GACvC,MAAM,IAAI,MACR,gFAAgF,EAGpF,IAAMO,EAAUF,GAAaP,EAAIC,GACjC,GAAIQ,EAAUL,EACZ,MAAM,IAAI,MACR,iCAAiCK,CAAO,0BAA0BL,CAAM,WAAW,EAKvF,IAAMM,EAAIC,GAAOC,GAAQjB,EAAUC,EAAM,CAAE,EAAG,EAAG,MAAOW,EAAYN,CAAC,CAAE,EACjEY,EAAMC,GAAIJ,CAAC,EAEXK,EAAID,GAAI,IAAI,WAAWP,EAAYP,CAAC,CAAC,EACrCgB,EAAMF,GAAI,IAAI,WAAWP,CAAS,CAAC,EACrCU,EAAa,IAAK,CAAE,EACxB,GAAIZ,EAAY,CACd,IAAMa,EAAgB,EAAIlB,EAAIC,EAGxBkB,EAAc,KAAK,IAAI,KAAK,MAAMD,EAAgB,GAAK,EAAG,CAAC,EAC7DE,EAAc,EAClBH,EAAa,IAAK,CAChBG,IACIf,IAAe,EAAEe,EAAcD,IAAgBC,IAAgBF,IACjEb,EAAWe,EAAcF,CAAa,CAC1C,EAEF,MAAO,CAAE,EAAAlB,EAAG,EAAAT,EAAG,EAAAU,EAAG,MAAAC,EAAO,YAAAM,EAAa,EAAAO,EAAG,IAAAF,EAAK,EAAAH,EAAG,IAAAM,EAAK,WAAAC,EAAY,UAAAd,CAAS,CAC7E,CAEA,SAASkB,GACP1B,EACAO,EACAQ,EACAK,EACAC,EAAgB,CAEhB,IAAMM,EAAMX,GAAOC,GAAQjB,EAAUe,EAAG,CAAE,EAAG,EAAG,MAAAR,CAAK,CAAE,EACvD,OAAAQ,EAAE,KAAK,CAAC,EACRK,EAAE,KAAK,CAAC,EACRC,EAAI,KAAK,CAAC,EACHM,CACT,CAgBM,SAAUC,GAAO5B,EAAiBC,EAAaE,EAAgB,CACnE,GAAM,CAAE,EAAAE,EAAG,EAAAT,EAAG,EAAAU,EAAG,MAAAC,EAAO,YAAAM,EAAa,EAAAO,EAAG,IAAAF,EAAK,EAAAH,EAAG,IAAAM,EAAK,WAAAC,CAAU,EAAKvB,GAClEC,EACAC,EACAE,CAAI,EAEN,QAAS9C,EAAK,EAAGA,EAAKiD,EAAGjD,IAAM,CAC7B,IAAMwE,EAAKhB,EAAcxD,EACzB,QAASqC,EAAI,EAAGA,EAAImB,EAAanB,IAAK0B,EAAE1B,CAAC,EAAIwB,EAAIW,EAAKnC,CAAC,EACvD,QAASA,EAAI,EAAGoC,EAAM,EAAGpC,EAAIW,EAAI,EAAGX,IAClCC,GAASyB,EAAGU,EAAKV,EAAIU,GAAOjB,EAAcjB,CAAC,EAC3C0B,EAAU,EAEZ3B,GAASyB,GAAIf,EAAI,GAAKQ,EAAaK,EAAKW,EAAIjC,CAAC,EAC7C0B,EAAU,EACV,QAAS5B,EAAI,EAAGA,EAAIW,EAAGX,IAAK,CAE1B,IAAMqC,EAAIb,EAAIW,EAAKhB,EAAc,EAAE,EAAIR,EACvC,QAAS2B,EAAI,EAAGA,EAAInB,EAAamB,IAAKX,EAAIW,CAAC,EAAId,EAAIW,EAAKG,CAAC,EAAIZ,EAAEW,EAAIlB,EAAcmB,CAAC,EAClFrC,GAAS0B,EAAK,EAAGH,EAAKW,EAAIjC,CAAC,EAC3B0B,EAAU,GAGd,OAAOI,GAAa1B,EAAUO,EAAOQ,EAAGK,EAAGC,CAAG,CAChD,CCzMA,IAAIY,GAAgB,IAsBpB,SAASC,GAAQC,EAAWC,EAAU,CACpC,GAAI,CAAE,OAAAC,EAAQ,MAAAC,CAAM,EAAIC,GAAQ,OAAOJ,EAAWK,EAAa,EAC/D,GAAIH,IAAW,YACb,MAAM,IAAI,MAAM,kBAAkBA,CAAM,wBAAwB,EAElE,IAAII,EAAI,IAAI,WAAWF,GAAQ,UAAUD,CAAK,CAAC,EAC3CI,EAAUD,EAAE,CAAC,EACjB,GAAIC,IAAY,EACd,MAAM,IAAI,MAAM,mBAAmBA,CAAO,iBAAiB,EAG7D,IAAIC,EAAI,GADGF,EAAE,CAAC,EAEVG,EAAOH,EAAE,MAAM,EAAG,EAAM,EACxBI,EAAQJ,EAAE,MAAM,GAAQ,EAAW,EACnCK,EAAML,EAAE,EAAW,EACnBM,EAAM,WAAW,KAAK,CAACD,CAAG,CAAC,EAC3BE,EAAaP,EAAE,MAAM,EAAe,EACpCQ,EAAMC,GAAOd,EAAS,UAAU,MAAM,EAAGQ,EAAM,CAAE,EAAGD,EAAG,EAAG,EAAG,EAAG,EAAG,MAAO,EAAG,CAAC,EAGlF,OAFYQ,GAAkBF,EAAKJ,EAAOE,CAAG,EAC7B,QAAQC,CAAU,CAEpC,CC9CA,IAAII,GAAiB,OAAO,UAAU,EAClCC,GAAYC,GAAQA,aAAe,OACvC,SAASC,GAAcC,EAAO,CAa5B,GAZI,CAACH,GAASG,CAAK,GAEf,OAAOA,EAAM,MAAS,UAEtB,OAAOA,EAAM,SAAY,UAEzB,OAAOA,EAAM,YAAe,UAE5B,OAAOA,EAAM,QAAW,UAExB,CAACA,EAAM,OAAO,MAAM,gBAAgB,GAEpC,CAAC,MAAM,QAAQA,EAAM,IAAI,EAC3B,MAAO,GACT,QAASC,EAAK,EAAGA,EAAKD,EAAM,KAAK,OAAQC,IAAM,CAC7C,IAAIC,EAAMF,EAAM,KAAKC,CAAE,EACvB,GAAI,CAAC,MAAM,QAAQC,CAAG,EACpB,MAAO,GACT,QAASC,EAAI,EAAGA,EAAID,EAAI,OAAQC,IAC9B,GAAI,OAAOD,EAAIC,CAAC,GAAM,SACpB,MAAO,EAEb,CACA,MAAO,EACT,CAcA,IAAIC,GAAc,IAAI,YAAY,OAAO,EACrCC,GAAc,IAAI,YAGlBC,GAAK,KAAM,CACb,mBAAoB,CAClB,OAAOC,GAAQ,MAAM,iBAAiB,CACxC,CACA,aAAaC,EAAW,CACtB,OAAOC,GAAWF,GAAQ,aAAaC,CAAS,CAAC,CACnD,CACA,cAAcE,EAAGF,EAAW,CAC1B,IAAMG,EAAQD,EACd,OAAAC,EAAM,OAASF,GAAWF,GAAQ,aAAaC,CAAS,CAAC,EACzDG,EAAM,GAAKC,GAAaD,CAAK,EAC7BA,EAAM,IAAMF,GAAWF,GAAQ,KAAKK,GAAaD,CAAK,EAAGH,CAAS,CAAC,EACnEG,EAAME,EAAc,EAAI,GACjBF,CACT,CACA,YAAYA,EAAO,CACjB,GAAI,OAAOA,EAAME,EAAc,GAAM,UACnC,OAAOF,EAAME,EAAc,EAC7B,IAAMC,EAAOF,GAAaD,CAAK,EAC/B,GAAIG,IAASH,EAAM,GACjB,OAAAA,EAAME,EAAc,EAAI,GACjB,GAET,GAAI,CACF,IAAME,EAAQR,GAAQ,OAAOI,EAAM,IAAKG,EAAMH,EAAM,MAAM,EAC1D,OAAAA,EAAME,EAAc,EAAIE,EACjBA,CACT,MAAc,CACZ,OAAAJ,EAAME,EAAc,EAAI,GACjB,EACT,CACF,CACF,EACA,SAASG,GAAeC,EAAK,CAC3B,GAAI,CAACC,GAAcD,CAAG,EACpB,MAAM,IAAI,MAAM,wDAAwD,EAC1E,OAAO,KAAK,UAAU,CAAC,EAAGA,EAAI,OAAQA,EAAI,WAAYA,EAAI,KAAMA,EAAI,KAAMA,EAAI,OAAO,CAAC,CACxF,CACA,SAASL,GAAaD,EAAO,CAC3B,IAAIQ,EAAYC,GAAOf,GAAY,OAAOW,GAAeL,CAAK,CAAC,CAAC,EAChE,OAAOF,GAAWU,CAAS,CAC7B,CACA,IAAIE,GAAI,IAAIf,GACRgB,GAAoBD,GAAE,kBACtBE,GAAeF,GAAE,aACjBG,GAAgBH,GAAE,cAClBI,GAAcJ,GAAE,YC9Eb,IAAMK,GAAN,MAAMC,CAAuC,CAClDC,GACAC,GAgBO,YAAYC,EAA6B,CAC9C,GAAI,OAAOA,GAAW,SAAU,CAC9B,IAAMC,EAAMC,GAAYF,CAAM,EAC9B,GAAIC,IAAQ,OACV,MAAM,MAAM,wDAAwD,EAEtE,KAAKH,GAAaG,EAAI,IACtB,KAAKF,GAAeE,EAAI,KAC1B,KAAO,CAEL,GAAID,EAAO,SAAW,GACpB,MAAM,MAAM,wDAAwD,EAEtE,KAAKD,GAAeC,EACpB,KAAKF,GAAaK,GAAWH,CAAM,CACrC,CACF,CAQA,OAAc,iBAAiBI,EAAmBC,EAAkB,CAClE,OAAO,IAAIR,EAAsBS,GAAQF,EAAWC,CAAQ,CAAC,CAC/D,CAKA,OAAc,eAAiC,CAC7C,OAAO,IAAIR,EAAgBU,GAAkB,CAAC,CAChD,CAKA,IAAW,WAAoB,CAC7B,OAAO,KAAKT,EACd,CAKA,IAAW,WAAoB,CAC7B,OAAOU,GAAsB,KAAKT,EAAY,CAChD,CAKA,MAAa,cAAgC,CAC3C,OAAO,KAAK,SACd,CAOA,MAAa,WAAgC,CAC3C,MAAO,CAAC,CACV,CAQA,MAAa,UAAUU,EAAgD,CACrE,OAAO,QAAQ,QAAQC,GAAcD,EAAO,KAAKV,EAAY,CAAC,CAChE,CASA,MAAa,aAAaY,EAAyBC,EAAoC,CACrF,OAAaC,GAAQ,KAAKf,GAAYa,EAAiBC,CAAS,CAClE,CASA,MAAa,aAAaE,EAAsBC,EAAqC,CACnF,OAAaT,GAAQ,KAAKR,GAAYgB,EAAcC,CAAU,CAChE,CASA,MAAa,aAAaJ,EAAyBC,EAAoC,CACrF,IAAMI,EAAgBC,GAAG,MAAM,mBAAmB,KAAKlB,GAAcY,CAAe,EACpF,OAAaM,GAAG,QAAQL,EAAWI,CAAO,CAC5C,CASA,MAAa,aAAaF,EAAsBC,EAAqC,CACnF,IAAMG,EAAgBD,GAAG,MAAM,mBAAmB,KAAKlB,GAAce,CAAY,EACjF,OAAaG,GAAG,QAAQF,EAAYG,CAAO,CAC7C,CACF,sKC5JsBC,GAAf,cAAoC,KAAM,CAAC,EAMrCC,GAAN,cAAoCD,EAAa,CACtD,YAAmBE,EAAe,CAChC,MACE,yDAAyDA,CAAI,YAAA,EAF9C,KAAA,KAAAA,EAIjB,KAAK,KAAO,uBACd,CACF,EAQaC,GAAN,cAAuCH,EAAa,CACzD,YAAYI,EAAiB,CACrB,MAAA,6BAA6BA,CAAO,EAAE,EAC5C,KAAK,KAAO,0BACd,CACF,EAMaC,GAAN,cAAsCL,EAAa,CACxD,YAAYI,EAAiB,CACrB,MAAA,4BAA4BA,CAAO,EAAE,EAC3C,KAAK,KAAO,yBACd,CACF,EAOaE,GAAN,cAAgCN,EAAa,CAClD,aAAc,CACZ,MACE,iGAAA,EAEF,KAAK,KAAO,mBACd,CACF,EAOaO,GAAN,cAA0CP,EAAa,CAC5D,aAAc,CACZ,MACE,uEAAA,EAEF,KAAK,KAAO,6BACd,CACF,ECnCaQ,GAAO,CAIlBC,EACAC,KAEC,CACC,GAAGA,EACH,GAAGD,CACL,GCtCK,SAASE,GACdC,EACsB,CAQtB,GAPI,OAAOA,EAAM,IAAO,UACpB,OAAOA,EAAM,KAAQ,UACrB,OAAOA,EAAM,MAAS,UACtB,OAAOA,EAAM,QAAW,UACxB,OAAOA,EAAM,SAAY,UACzB,OAAOA,EAAM,YAAe,UAE5B,CAAC,MAAM,QAAQA,EAAM,IAAI,EAAU,MAAA,GACvC,QAASC,EAAI,EAAGA,EAAID,EAAM,KAAK,OAAQC,IAAK,CACpC,IAAAC,EAAMF,EAAM,KAAKC,CAAC,EACpB,GAAA,CAAC,MAAM,QAAQC,CAAG,EAAU,MAAA,GAChC,QAASC,EAAI,EAAGA,EAAID,EAAI,OAAQC,IAC1B,GAAA,OAAOD,EAAIC,CAAC,GAAM,SAAiB,MAAA,EAE3C,CAEO,MAAA,EACT,CCtBO,SAASC,GAAYC,EAAmB,CACvC,MAAAA,CACR,CCgBO,SAASC,GAAYC,EAA2C,CAC9D,MAAA,CACL,MAAM,UACJC,EACyB,CJtBxB,IAAAC,EAAAC,EIuBD,IAAMC,EAAQ,CACZ,GAAGH,EACH,OACEA,EAAO,QACN,OAAMC,EAAA,QAAQ,QAAR,KAAA,OAAAA,EAAe,aAAA,IACtBL,GACE,IAAIQ,GACF,0CACF,CACF,EACF,KAAM,CAAC,GAAIJ,EAAO,MAAQ,CAAC,EAAI,GAAID,GAAS,MAAQ,CAAA,CAAG,EACvD,WAAYC,EAAO,YAAc,KAAK,MAAM,KAAK,IAAA,EAAQ,GAAI,CAAA,EAG3D,OAAAK,GAAkBF,CAAK,EAClBA,EAIN,OAAMD,EAAA,QAAQ,QAAR,KAAA,OAAAA,EAAe,UAAUC,CAAAA,IAChCP,GACE,IAAIQ,GAAwB,uCAAuC,CAAA,CAGzE,EACA,cAAe,CJhDZ,IAAAH,EIkDC,QAAAA,EAAA,QAAQ,QAAR,KAAA,OAAAA,EAAe,aAAA,IACfL,GACE,IAAIQ,GACF,0CACF,CAAA,CAGN,CAAA,CAEJ,CCrDO,IAAME,GAAqBC,GAChCC,GAAKD,EAAQ,CACX,OAAQE,GAAY,EACpB,mBAAoB,OACpB,MAAO,CACL,SAAU,cACV,SAAU,EACV,aAAc,GAChB,EACA,YAAa,GAAK,IAClB,UAAW,GAAK,IAChB,YAAa,GAAK,IAClB,WAAY,GACZ,2BAA4B,GAC5B,oBAAqB,GACrB,eAAgB,EAClB,CAAC,EEfI,SAASC,GACdC,EACgB,CAChB,MAAI,WAAYA,EACPA,EAAQ,IAAIC,EAAU,EAEtB,CAACA,GAAWD,CAAO,CAAC,CAE/B,CAEA,SAASC,GAAWC,EAAkC,CAC7C,MAAA,CACL,GAAGA,EACH,MAAOA,EAAO,MAAQC,GAAeD,EAAO,KAAK,EAAI,OACrD,MAAOA,EAAO,MAAQC,GAAeD,EAAO,KAAK,EAAI,MAAA,CAEzD,CAEA,SAASC,GAAeC,EAA6C,CACnE,OAAO,OAAOA,GAAe,SAAWA,EAAaA,EAAW,CAClE,CCtBA,eAAsBC,GACpBC,EACgC,CAC5B,GAAA,CACI,IAAAC,EAAI,IAAI,IAAID,CAAG,EACrB,OAAAC,EAAE,SAAWA,EAAE,SAAS,QAAQ,WAAY,SAAS,EAK9C,MAHK,MAAM,MAAMA,EAAE,SAAA,EAAY,CACpC,QAAS,CAAE,OAAQ,wBAAyB,CAAA,CAC7C,GACgB,KAAA,CAAK,MAChB,CACN,MAAO,CAAA,CACT,CACF,CCnBgB,SAAAC,GACdC,EACAC,EACO,CACH,GAAA,CACF,OAAOD,EAAE,CAAA,OACFE,EAAK,CACZ,OAAID,aAAa,SACRA,EAAEC,CAAG,EAELD,CAEX,CACF,CCXO,SAASE,GAAkBN,EAAa,CAC7C,IAAIO,EAAI,GAEJ,GAAA,CACFA,EAAIP,EAAI,KAAA,EAEF,IAAAC,EAAI,IAAI,IAAIM,CAAC,EAEnBN,EAAE,KAAO,GACPA,EAAA,SAAWC,GAAU,IAAM,UAAUD,EAAE,QAAQ,EAAGA,EAAE,QAAQ,EAC9DA,EAAE,SAAWA,EAAE,SAAS,QAAQ,MAAO,EAAE,EACzCA,EAAE,SAAWA,EAAE,SAAS,QAAQ,MAAO,EAAE,EACzCA,EAAE,aAAa,KAAA,EACbA,EAAA,OAASC,GAAU,IAAM,mBAAmBD,EAAE,MAAM,EAAGA,EAAE,MAAM,EAE7D,IAAAO,EAAIP,EAAE,SAAA,EACN,OAACA,EAAE,SACDO,EAAAA,EAAE,QAAQ,MAAO,EAAE,GAGlBA,CAAA,MACD,CACC,OAAAD,CACT,CACF,CCxBO,IAAME,GAAN,MAAMA,UAAkB,GAAe,CAC5C,YAAYC,EAAyB,CAGnC,GAFM,MAAA,EAEF,CAAA,CAACA,EAIL,OAAW,CAACV,EAAKW,CAAC,IAAK,OAAO,QAAQD,CAAG,EACvC,KAAK,IAAIJ,GAAkBN,CAAG,EAAGW,CAAC,CAEtC,CACA,IAAIX,EAAa,CACf,OAAO,MAAM,IAAIM,GAAkBN,CAAG,CAAC,CACzC,CACA,QAAQY,EAAgB,CACtB,IAAMC,EAAU,CAAA,EAEhB,QAAWb,KAAO,IAAI,IAAIY,EAAK,IAAIN,EAAiB,CAAC,EAAG,CAChD,IAAAK,EAAI,KAAK,IAAIX,CAAG,EAClBW,IAAM,QACRE,EAAG,KAAKF,CAAC,CAEb,CAEO,OAAAE,CACT,CACA,IAAIb,EAAaW,EAAM,CACrB,OAAO,MAAM,IAAIL,GAAkBN,CAAG,EAAGW,CAAC,CAC5C,CACA,IAAIX,EAAsB,CACxB,OAAO,MAAM,IAAIM,GAAkBN,CAAG,CAAC,CACzC,CACA,OAAOA,EAAa,CAClB,OAAO,MAAM,OAAOM,GAAkBN,CAAG,CAAC,CAC5C,CACA,UAA8B,CAC5B,IAAMU,EAAyB,CAAA,EAE/B,OAAW,CAACV,EAAKW,CAAC,IAAK,KAAK,QAAA,EAC1BD,EAAIV,CAAG,EAAIW,EAGN,OAAAD,CACT,CACA,QAAmB,CACjB,MAAO,CAAC,GAAG,MAAM,KAAA,CAAM,CACzB,CACA,UAAgB,CACd,MAAO,CAAC,GAAG,MAAM,OAAA,CAAQ,CAC3B,CACA,MAAO,CACL,OAAO,IAAID,EAAO,KAAK,SAAU,CAAA,CACnC,CACF,EC5CaK,GAAN,KAAoB,CAMzB,aAAa,SACXd,EACAe,EACAC,EAIY,CACR,GAAA,EAACA,GAAA,MAAAA,EAAS,WAAW,CACvB,IAAMC,EAAO,MAAM,KAAK,MAAM,IAAIjB,CAAG,EACrC,GAAIiB,EACF,OAAOF,EAAOE,CAAI,CAEtB,CACI,GAAA,EAACD,GAAA,MAAAA,EAAS,WAAW,CACvB,IAAMC,EAAO,MAAM,KAAK,MAAMjB,CAAG,EACjC,GAAIiB,EACF,OAAOF,EAAOE,CAAI,CAEtB,CAEO,OAAAF,EAAO,KAAK,OAAO,CAC5B,CAKA,OAAO,IAAIf,EAAgD,CACzD,IAAMW,EAAI,KAAK,MAAM,IAAIX,CAAG,EACxB,GAAAW,GAAK,EAAEA,aAAa,SACf,OAAAA,CAIX,CAKA,aAAa,MAAMX,EAAa,CACxB,IAAAkB,EAAUnB,GAAeC,CAAG,EAE7B,OAAA,KAAA,MAAM,IAAIA,EAAKkB,CAAO,EACnBA,EAAA,KAAMP,GAAM,CACb,KAAA,MAAM,IAAIX,EAAKW,CAAC,CAAA,CACtB,EAEMO,CACT,CAMA,aAAa,WAAWlB,EAA6C,CACnE,OAAO,KAAK,MAAM,IAAIA,CAAG,GAAK,KAAK,MAAMA,CAAG,CAC9C,CAKA,OAAO,IAAIA,EAAamB,EAA8B,CAC/C,KAAA,MAAM,IAAInB,EAAKmB,CAAK,CAC3B,CAKA,OAAO,YAAoC,CACzC,OAAO,KAAK,OACd,CAKA,OAAO,WAAWA,EAA8B,CAC9C,KAAK,QAAUA,CACjB,CAKA,OAAO,OAAOnB,EAAa,CACpB,KAAA,MAAM,OAAOA,CAAG,CACvB,CAQA,OAAO,WAAY,CACjB,KAAK,MAAM,MAAA,CACb,CACF,EApGEoB,EADWN,GACI,QAAQ,IAAIL,EAAAA,EAG3BW,EAJWN,GAII,UAAiC,CAAA,CAAA,EEQ9B,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,EGZ1D,SAAAO,GACdC,EACAC,EACAC,EACS,CACL,OAAA,MAAM,QAAQD,CAAO,EAChBA,EAAQ,KAAME,GAAWC,GAAYJ,EAAOG,EAAQD,CAAO,CAAC,EAE5DE,GAAYJ,EAAOC,EAASC,CAAO,CAE9C,CAEA,SAASE,GACPJ,EACAG,EACAD,EACS,CACT,GAAM,CAAE,eAAAG,EAAgB,eAAAC,CAAA,EAAmBC,GAAKL,GAAW,CAAA,EAAI,CAC7D,eAAgB,GAChB,eAAgB,EAAA,CACjB,EAwBD,GArBEC,EAAO,KACPA,EAAO,IAAI,MAAOK,GAAW,CAACR,EAAM,GAAG,WAAWQ,CAAM,CAAC,GAIvDL,EAAO,OAAS,CAACA,EAAO,MAAM,SAASH,EAAM,IAAI,GAInDG,EAAO,SACPA,EAAO,QAAQ,MAAOM,GAAW,CAACT,EAAM,OAAO,WAAWS,CAAM,CAAC,GAKjEN,EAAO,QACLE,GAAkB,EAAEF,EAAO,OAASH,EAAM,aACzC,CAACK,GAAkB,EAAEF,EAAO,MAAQH,EAAM,cAK7CG,EAAO,QACLG,GAAkB,EAAEN,EAAM,YAAcG,EAAO,QAC9C,CAACG,GAAkB,EAAEN,EAAM,WAAaG,EAAO,QAE3C,MAAA,GAGT,OAAW,CAACO,EAAKC,CAAY,IAAK,OAAO,QAAQR,CAAM,EAAG,CACpD,GAAA,CAACO,EAAI,WAAW,GAAG,GAAK,CAAC,MAAM,QAAQC,CAAY,EACrD,SAEI,IAAAC,EAAgBF,EAAI,MAAM,CAAC,EAG/B,GAAA,CAACV,EAAM,KAAK,KACV,CAAC,CAACa,EAASC,CAAQ,IACjBF,IAAkBC,GACjBF,EAA0B,SAASG,CAAQ,CAAA,EAGzC,MAAA,EAEX,CAEO,MAAA,EACT,CChFgB,SAAAC,GAAUf,EAAoBgB,EAAuB,CAC7D,IAAAC,EAAMjB,EAAM,KAAK,KAAMiB,GAAQA,EAAI,CAAC,IAAM,YAAY,EAE5D,GAAI,CAACA,EACI,MAAA,GAGL,GAAA,CACF,IAAMC,EAAY,OAAOD,EAAI,CAAC,CAAC,EAE/B,OAAK,OAAO,UAAUC,CAAS,EAIxBA,IAAcF,GAAO,KAAK,MAAM,KAAK,IAAA,EAAQ,GAAI,GAH/C,EAG+C,MAClD,CACC,MAAA,EACT,CACF,CCJA,IAAIG,GAAgB,SAASC,EAAGC,EAAG,CACjC,OAAAF,GAAgB,OAAO,gBAClB,CAAE,UAAW,CAAA,CAAA,YAAgB,OAAS,SAAUC,EAAGC,EAAG,CAAED,EAAE,UAAYC,CAAE,GACzE,SAAUD,EAAGC,EAAG,CAAE,QAASC,KAAKD,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGC,CAAC,IAAGF,EAAEE,CAAC,EAAID,EAAEC,CAAC,EAAA,EAC1FH,GAAcC,EAAGC,CAAC,CAC3B,EAEO,SAASE,GAAUH,EAAGC,EAAG,CAC9B,GAAI,OAAOA,GAAM,YAAcA,IAAM,KACjC,MAAM,IAAI,UAAU,uBAAyB,OAAOA,CAAC,EAAI,+BAA+B,EAC5FF,GAAcC,EAAGC,CAAC,EAClB,SAASG,GAAK,CAAE,KAAK,YAAcJ,CAAI,CACvCA,EAAE,UAAYC,IAAM,KAAO,OAAO,OAAOA,CAAC,GAAKG,EAAG,UAAYH,EAAE,UAAW,IAAIG,EACjF,CAqFO,SAASC,GAAUC,EAASC,EAAYC,EAAGC,EAAW,CAC3D,SAASC,EAAMC,EAAO,CAAE,OAAOA,aAAiBH,EAAIG,EAAQ,IAAIH,EAAE,SAAUI,EAAS,CAAEA,EAAQD,CAAK,CAAE,CAAE,CAAI,CAC5G,OAAO,IAAKH,IAAMA,EAAI,UAAU,SAAUI,EAASC,EAAQ,CACvD,SAASC,EAAUH,EAAO,CAAE,GAAI,CAAEI,EAAKN,EAAU,KAAKE,CAAK,CAAC,CAAE,OAAUK,EAAG,CAAEH,EAAOG,CAAC,CAAA,CAAM,CAC3F,SAASC,EAASN,EAAO,CAAE,GAAI,CAAEI,EAAKN,EAAU,MAASE,CAAK,CAAC,CAAI,OAAQK,EAAG,CAAEH,EAAOG,CAAC,CAAA,CAAM,CAC9F,SAASD,EAAKG,EAAQ,CAAEA,EAAO,KAAON,EAAQM,EAAO,KAAK,EAAIR,EAAMQ,EAAO,KAAK,EAAE,KAAKJ,EAAWG,CAAQ,CAAI,CAC9GF,GAAMN,EAAYA,EAAU,MAAMH,EAASC,GAAc,CAAE,CAAA,GAAG,KAAI,CAAE,CAC1E,CAAG,CACH,CAEO,SAASY,GAAYb,EAASc,EAAM,CACzC,IAAIC,EAAI,CAAE,MAAO,EAAG,KAAM,UAAW,CAAE,GAAIC,EAAE,CAAC,EAAI,EAAG,MAAMA,EAAE,CAAC,EAAG,OAAOA,EAAE,CAAC,CAAI,EAAE,KAAM,CAAE,EAAE,IAAK,CAAA,CAAI,EAAEC,EAAGC,EAAGF,EAAGG,EAC/G,OAAOA,EAAI,CAAE,KAAMC,EAAK,CAAC,EAAG,MAASA,EAAK,CAAC,EAAG,OAAUA,EAAK,CAAC,CAAG,EAAE,OAAO,QAAW,aAAeD,EAAE,OAAO,QAAQ,EAAI,UAAW,CAAE,OAAO,IAAO,GAAGA,EACvJ,SAASC,EAAKC,EAAG,CAAE,OAAO,SAAUC,EAAG,CAAE,OAAOb,EAAK,CAACY,EAAGC,CAAC,CAAC,CAAI,CAAG,CAClE,SAASb,EAAKc,EAAI,CACd,GAAIN,EAAG,MAAM,IAAI,UAAU,iCAAiC,EAC5D,KAAOE,IAAMA,EAAI,EAAGI,EAAG,CAAC,IAAMR,EAAI,IAAKA,GAAG,GAAI,CAC1C,GAAIE,EAAI,EAAGC,IAAMF,EAAIO,EAAG,CAAC,EAAI,EAAIL,EAAE,OAAYK,EAAG,CAAC,EAAIL,EAAE,SAAcF,EAAIE,EAAE,SAAcF,EAAE,KAAKE,CAAC,EAAG,GAAKA,EAAE,OAAS,EAAEF,EAAIA,EAAE,KAAKE,EAAGK,EAAG,CAAC,CAAC,GAAG,KAAM,OAAOP,EAE3J,OADIE,EAAI,EAAGF,IAAGO,EAAK,CAACA,EAAG,CAAC,EAAI,EAAGP,EAAE,KAAK,GAC9BO,EAAG,CAAC,EAAC,CACT,IAAK,GAAG,IAAK,GAAGP,EAAIO,EAAI,MACxB,IAAK,GAAG,OAAAR,EAAE,QAAgB,CAAE,MAAOQ,EAAG,CAAC,EAAG,KAAM,EAAK,EACrD,IAAK,GAAGR,EAAE,QAASG,EAAIK,EAAG,CAAC,EAAGA,EAAK,CAAC,CAAC,EAAG,SACxC,IAAK,GAAGA,EAAKR,EAAE,IAAI,IAAA,EAAOA,EAAE,KAAK,IAAG,EAAI,SACxC,QACI,GAAMC,EAAID,EAAE,KAAM,EAAAC,EAAIA,EAAE,OAAS,GAAKA,EAAEA,EAAE,OAAS,CAAC,KAAOO,EAAG,CAAC,IAAM,GAAKA,EAAG,CAAC,IAAM,GAAI,CAAER,EAAI,EAAG,QAAW,CAC5G,GAAIQ,EAAG,CAAC,IAAM,IAAM,CAACP,GAAMO,EAAG,CAAC,EAAIP,EAAE,CAAC,GAAKO,EAAG,CAAC,EAAIP,EAAE,CAAC,GAAK,CAAED,EAAE,MAAQQ,EAAG,CAAC,EAAG,KAAQ,CACtF,GAAIA,EAAG,CAAC,IAAM,GAAKR,EAAE,MAAQC,EAAE,CAAC,EAAG,CAAED,EAAE,MAAQC,EAAE,CAAC,EAAGA,EAAIO,EAAI,KAAQ,CACrE,GAAIP,GAAKD,EAAE,MAAQC,EAAE,CAAC,EAAG,CAAED,EAAE,MAAQC,EAAE,CAAC,EAAGD,EAAE,IAAI,KAAKQ,CAAE,EAAG,KAAQ,CAC/DP,EAAE,CAAC,GAAGD,EAAE,IAAI,IAAG,EACnBA,EAAE,KAAK,IAAK,EAAE,QACrB,CACDQ,EAAKT,EAAK,KAAKd,EAASe,CAAC,CAC5B,OAAQL,EAAG,CAAEa,EAAK,CAAC,EAAGb,CAAC,EAAGQ,EAAI,CAAE,QAAA,CAAaD,EAAID,EAAI,CAAI,CAC1D,GAAIO,EAAG,CAAC,EAAI,EAAG,MAAMA,EAAG,CAAC,EAAG,MAAO,CAAE,MAAOA,EAAG,CAAC,EAAIA,EAAG,CAAC,EAAI,OAAQ,KAAM,EAAA,CAC7E,CACH,CAkBO,SAASC,GAASC,EAAG,CAC1B,IAAIC,EAAI,OAAO,QAAW,YAAc,OAAO,SAAUC,EAAID,GAAKD,EAAEC,CAAC,EAAGE,EAAI,EAC5E,GAAID,EAAG,OAAOA,EAAE,KAAKF,CAAC,EACtB,GAAIA,GAAK,OAAOA,EAAE,QAAW,SAAU,MAAO,CAC1C,KAAM,UAAY,CACd,OAAIA,GAAKG,GAAKH,EAAE,SAAQA,EAAI,QACrB,CAAE,MAAOA,GAAKA,EAAEG,GAAG,EAAG,KAAM,CAACH,CAAAA,CACvC,CACP,EACE,MAAM,IAAI,UAAUC,EAAI,0BAA4B,iCAAiC,CACvF,CAEO,SAASG,GAAOJ,EAAGJ,EAAG,CAC3B,IAAIM,EAAI,OAAO,QAAW,YAAcF,EAAE,OAAO,QAAQ,EACzD,GAAI,CAACE,EAAG,OAAOF,EACf,IAAIG,EAAID,EAAE,KAAKF,CAAC,EAAGK,EAAGC,EAAK,CAAE,EAAErB,EAC/B,GAAI,CACA,MAAQW,IAAM,QAAUA,KAAM,IAAM,EAAES,EAAIF,EAAE,KAAM,GAAE,MAAMG,EAAG,KAAKD,EAAE,KAAK,CAC5E,OACME,EAAO,CAAEtB,EAAI,CAAE,MAAOsB,CAAO,CAAG,QAAA,CAEnC,GAAI,CACIF,GAAK,CAACA,EAAE,OAASH,EAAIC,EAAE,SAAYD,EAAE,KAAKC,CAAC,CAClD,QAAA,CACS,GAAIlB,EAAG,MAAMA,EAAE,KAAQ,CACpC,CACD,OAAOqB,CACT,CAkBO,SAASE,GAAcC,EAAIC,EAAMC,EAAM,CAC5C,GAAIA,GAAQ,UAAU,SAAW,EAAG,QAASR,EAAI,EAAGS,EAAIF,EAAK,OAAQJ,EAAIH,EAAIS,EAAGT,KACxEG,GAAM,EAAEH,KAAKO,MACRJ,IAAIA,EAAK,MAAM,UAAU,MAAM,KAAKI,EAAM,EAAGP,CAAC,GACnDG,EAAGH,CAAC,EAAIO,EAAKP,CAAC,GAGtB,OAAOM,EAAG,OAAOH,GAAM,MAAM,UAAU,MAAM,KAAKI,CAAI,CAAC,CACzD,CAEO,SAASG,GAAQhB,EAAG,CACzB,OAAO,gBAAgBgB,IAAW,KAAK,EAAIhB,EAAG,MAAQ,IAAIgB,GAAQhB,CAAC,CACrE,CAEO,SAASiB,GAAiBvC,EAASC,EAAYE,EAAW,CAC/D,GAAI,CAAC,OAAO,cAAe,MAAM,IAAI,UAAU,sCAAsC,EACrF,IAAIgB,EAAIhB,EAAU,MAAMH,EAASC,GAAc,CAAA,CAAE,EAAG2B,EAAGY,EAAI,CAAA,EAC3D,OAAOZ,EAAI,CAAA,EAAIR,EAAK,MAAM,EAAGA,EAAK,OAAO,EAAGA,EAAK,QAAQ,EAAGQ,EAAE,OAAO,aAAa,EAAI,UAAY,CAAE,OAAO,IAAO,EAAEA,EACpH,SAASR,EAAKC,EAAG,CAAMF,EAAEE,CAAC,IAAGO,EAAEP,CAAC,EAAI,SAAUC,EAAG,CAAE,OAAO,IAAI,QAAQ,SAAUmB,EAAG9C,EAAG,CAAE6C,EAAE,KAAK,CAACnB,EAAGC,EAAGmB,EAAG9C,CAAC,CAAC,EAAI,GAAK+C,EAAOrB,EAAGC,CAAC,CAAE,CAAE,CAAI,EAAG,CAC1I,SAASoB,EAAOrB,EAAGC,EAAG,CAAE,GAAI,CAAEb,EAAKU,EAAEE,CAAC,EAAEC,CAAC,CAAC,CAAE,OAAUZ,EAAG,CAAEiC,EAAOH,EAAE,CAAC,EAAE,CAAC,EAAG9B,CAAC,CAAA,CAAM,CAClF,SAASD,EAAKqB,EAAG,CAAEA,EAAE,iBAAiBQ,GAAU,QAAQ,QAAQR,EAAE,MAAM,CAAC,EAAE,KAAKc,EAASrC,CAAM,EAAIoC,EAAOH,EAAE,CAAC,EAAE,CAAC,EAAGV,CAAC,CAAI,CACxH,SAASc,EAAQvC,EAAO,CAAEqC,EAAO,OAAQrC,CAAK,CAAI,CAClD,SAASE,EAAOF,EAAO,CAAEqC,EAAO,QAASrC,CAAK,CAAI,CAClD,SAASsC,EAAO1B,EAAGK,EAAG,CAAML,EAAEK,CAAC,EAAGkB,EAAE,MAAK,EAAIA,EAAE,QAAQE,EAAOF,EAAE,CAAC,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAE,CAAC,CAAC,CAAI,CACpF,CAQO,SAASK,GAAcpB,EAAG,CAC/B,GAAI,CAAC,OAAO,cAAe,MAAM,IAAI,UAAU,sCAAsC,EACrF,IAAIE,EAAIF,EAAE,OAAO,aAAa,EAAGG,EACjC,OAAOD,EAAIA,EAAE,KAAKF,CAAC,GAAKA,EAAI,OAAOD,IAAa,WAAaA,GAASC,CAAC,EAAIA,EAAE,OAAO,QAAQ,EAAC,EAAIG,EAAI,CAAE,EAAER,EAAK,MAAM,EAAGA,EAAK,OAAO,EAAGA,EAAK,QAAQ,EAAGQ,EAAE,OAAO,aAAa,EAAI,UAAY,CAAE,OAAO,IAAK,EAAIA,GAC9M,SAASR,EAAKC,EAAG,CAAEO,EAAEP,CAAC,EAAII,EAAEJ,CAAC,GAAK,SAAUC,EAAG,CAAE,OAAO,IAAI,QAAQ,SAAUhB,EAASC,EAAQ,CAAEe,EAAIG,EAAEJ,CAAC,EAAEC,CAAC,EAAGqB,EAAOrC,EAASC,EAAQe,EAAE,KAAMA,EAAE,KAAK,CAAE,CAAE,CAAI,CAAG,CAChK,SAASqB,EAAOrC,EAASC,EAAQb,EAAG4B,EAAG,CAAE,QAAQ,QAAQA,CAAC,EAAE,KAAK,SAASA,EAAG,CAAEhB,EAAQ,CAAE,MAAOgB,EAAG,KAAM5B,CAAC,CAAE,CAAE,EAAIa,CAAM,CAAI,CAC9H,CC3PO,SAASuC,GAAWzC,EAAO,CAC9B,OAAO,OAAOA,GAAU,UAC5B,CCFO,SAAS0C,GAAiBC,EAAY,CACzC,IAAIC,EAAS,SAAUC,EAAU,CAC7B,MAAM,KAAKA,CAAQ,EACnBA,EAAS,MAAQ,IAAI,MAAK,EAAG,KACrC,EACQC,EAAWH,EAAWC,CAAM,EAChC,OAAAE,EAAS,UAAY,OAAO,OAAO,MAAM,SAAS,EAClDA,EAAS,UAAU,YAAcA,EAC1BA,CACX,CCRO,IAAIC,GAAsBL,GAAiB,SAAUE,EAAQ,CAChE,OAAO,SAAiCI,EAAQ,CAC5CJ,EAAO,IAAI,EACX,KAAK,QAAUI,EACTA,EAAO,OAAS;EAA8CA,EAAO,IAAI,SAAUC,EAAK1B,EAAG,CAAE,OAAOA,EAAI,EAAI,KAAO0B,EAAI,SAAU,CAAA,CAAG,EAAE,KAAK;GAAM,EACjJ,GACN,KAAK,KAAO,sBACZ,KAAK,OAASD,CACtB,CACA,CAAC,ECVM,SAASE,GAAUC,EAAKC,EAAM,CACjC,GAAID,EAAK,CACL,IAAIE,EAAQF,EAAI,QAAQC,CAAI,EAC5B,GAAKC,GAASF,EAAI,OAAOE,EAAO,CAAC,CACpC,CACL,CCDA,IAAIC,GAAgB,UAAY,CAC5B,SAASA,EAAaC,EAAiB,CACnC,KAAK,gBAAkBA,EACvB,KAAK,OAAS,GACd,KAAK,WAAa,KAClB,KAAK,YAAc,IACtB,CACD,OAAAD,EAAa,UAAU,YAAc,UAAY,CAC7C,IAAIE,EAAKC,EAAIC,EAAKC,EACdX,EACJ,GAAI,CAAC,KAAK,OAAQ,CACd,KAAK,OAAS,GACd,IAAIY,EAAa,KAAK,WACtB,GAAIA,EAEA,GADA,KAAK,WAAa,KACd,MAAM,QAAQA,CAAU,EACxB,GAAI,CACA,QAASC,EAAe1C,GAASyC,CAAU,EAAGE,EAAiBD,EAAa,KAAI,EAAI,CAACC,EAAe,KAAMA,EAAiBD,EAAa,KAAI,EAAI,CAC5I,IAAIE,EAAWD,EAAe,MAC9BC,EAAS,OAAO,IAAI,CACvB,CACJ,OACMC,EAAO,CAAER,EAAM,CAAE,MAAOQ,CAAO,CAAG,QAAA,CAErC,GAAI,CACIF,GAAkB,CAACA,EAAe,OAASL,EAAKI,EAAa,SAASJ,EAAG,KAAKI,CAAY,CACjG,QAAA,CACS,GAAIL,EAAK,MAAMA,EAAI,KAAQ,CACxC,MAGDI,EAAW,OAAO,IAAI,EAG9B,IAAIK,EAAmB,KAAK,gBAC5B,GAAIxB,GAAWwB,CAAgB,EAC3B,GAAI,CACAA,EAAAA,CACH,OACM5D,EAAG,CACN2C,EAAS3C,aAAa0C,GAAsB1C,EAAE,OAAS,CAACA,CAAC,CAC5D,CAEL,IAAI6D,EAAc,KAAK,YACvB,GAAIA,EAAa,CACb,KAAK,YAAc,KACnB,GAAI,CACA,QAASC,EAAgBhD,GAAS+C,CAAW,EAAGE,EAAkBD,EAAc,KAAI,EAAI,CAACC,EAAgB,KAAMA,EAAkBD,EAAc,KAAI,EAAI,CACnJ,IAAIE,EAAYD,EAAgB,MAChC,GAAI,CACAE,GAAcD,CAAS,CAC1B,OACMpB,EAAK,CACRD,EAASA,GAAgD,CAAA,EACrDC,aAAeF,GACfC,EAASpB,GAAcA,GAAc,CAAA,EAAIJ,GAAOwB,CAAM,CAAC,EAAGxB,GAAOyB,EAAI,MAAM,CAAC,EAG5ED,EAAO,KAAKC,CAAG,CAEtB,CACJ,CACJ,OACMsB,EAAO,CAAEb,EAAM,CAAE,MAAOa,CAAO,CAAG,QAAA,CAErC,GAAI,CACIH,GAAmB,CAACA,EAAgB,OAAST,EAAKQ,EAAc,SAASR,EAAG,KAAKQ,CAAa,CACrG,QAAA,CACS,GAAIT,EAAK,MAAMA,EAAI,KAAQ,CACxC,CACJ,CACD,GAAIV,EACA,MAAM,IAAID,GAAoBC,CAAM,CAE3C,CACT,EACIM,EAAa,UAAU,IAAM,SAAUkB,EAAU,CAC7C,IAAIf,EACJ,GAAIe,GAAYA,IAAa,KACzB,GAAI,KAAK,OACLF,GAAcE,CAAQ,MAErB,CACD,GAAIA,aAAoBlB,EAAc,CAClC,GAAIkB,EAAS,QAAUA,EAAS,WAAW,IAAI,EAC3C,OAEJA,EAAS,WAAW,IAAI,CAC3B,EACA,KAAK,aAAef,EAAK,KAAK,eAAiB,MAAQA,IAAO,OAASA,EAAK,CAAE,GAAE,KAAKe,CAAQ,CACjG,CAEb,EACIlB,EAAa,UAAU,WAAa,SAAUmB,EAAQ,CAClD,IAAIb,EAAa,KAAK,WACtB,OAAOA,IAAea,GAAW,MAAM,QAAQb,CAAU,GAAKA,EAAW,SAASa,CAAM,CAChG,EACInB,EAAa,UAAU,WAAa,SAAUmB,EAAQ,CAClD,IAAIb,EAAa,KAAK,WACtB,KAAK,WAAa,MAAM,QAAQA,CAAU,GAAKA,EAAW,KAAKa,CAAM,EAAGb,GAAcA,EAAa,CAACA,EAAYa,CAAM,EAAIA,CAClI,EACInB,EAAa,UAAU,cAAgB,SAAUmB,EAAQ,CACrD,IAAIb,EAAa,KAAK,WAClBA,IAAea,EACf,KAAK,WAAa,KAEb,MAAM,QAAQb,CAAU,GAC7BV,GAAUU,EAAYa,CAAM,CAExC,EACInB,EAAa,UAAU,OAAS,SAAUkB,EAAU,CAChD,IAAIN,EAAc,KAAK,YACvBA,GAAehB,GAAUgB,EAAaM,CAAQ,EAC1CA,aAAoBlB,GACpBkB,EAAS,cAAc,IAAI,CAEvC,EACIlB,EAAa,MAAS,UAAY,CAC9B,IAAIoB,EAAQ,IAAIpB,EAChB,OAAAoB,EAAM,OAAS,GACRA,CACf,EAAA,EACWpB,CACX,EAAC,EAEUqB,GAAqBrB,GAAa,MACtC,SAASsB,GAAe5E,EAAO,CAClC,OAAQA,aAAiBsD,IACpBtD,GAAS,WAAYA,GAASyC,GAAWzC,EAAM,MAAM,GAAKyC,GAAWzC,EAAM,GAAG,GAAKyC,GAAWzC,EAAM,WAAW,CACxH,CACA,SAASsE,GAAcD,EAAW,CAC1B5B,GAAW4B,CAAS,EACpBA,EAAAA,EAGAA,EAAU,YAAW,CAE7B,CC7IO,IAAIQ,GAAS,CAChB,iBAAkB,KAClB,sBAAuB,KACvB,QAAS,OACT,sCAAuC,GACvC,yBAA0B,EAC9B,ECLWC,GAAkB,CACzB,WAAY,SAAUC,EAASC,EAAS,CAEpC,QADIC,EAAO,CAAA,EACFC,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCD,EAAKC,EAAK,CAAC,EAAI,UAAUA,CAAE,EAE/B,IAAIC,EAAWL,GAAgB,SAC/B,OAAIK,GAAa,MAAuCA,EAAS,WACtDA,EAAS,WAAW,MAAMA,EAAUvD,GAAc,CAACmD,EAASC,CAAO,EAAGxD,GAAOyD,CAAI,CAAC,CAAC,EAEvF,WAAW,MAAM,OAAQrD,GAAc,CAACmD,EAASC,CAAO,EAAGxD,GAAOyD,CAAI,CAAC,CAAC,CAClF,EACD,aAAc,SAAUG,EAAQ,CAC5B,IAAID,EAAWL,GAAgB,SAC/B,OAA6DK,GAAS,cAAiB,cAAcC,CAAM,CAC9G,EACD,SAAU,MACd,EChBO,SAASC,GAAqBpC,EAAK,CACtC6B,GAAgB,WAAW,UAAY,CAM/B,MAAM7B,CAElB,CAAK,CACL,CCZO,SAASqC,IAAO,CAAA,CCEhB,SAASC,GAAaC,EAAI,CAgBzBA,EAAAA,CAER,CCXA,IAAIC,GAAc,SAAU7C,EAAQ,CAChCpD,GAAUiG,EAAY7C,CAAM,EAC5B,SAAS6C,EAAWC,EAAa,CAC7B,IAAIC,EAAQ/C,EAAO,KAAK,IAAI,GAAK,KACjC,OAAA+C,EAAM,UAAY,GACdD,GACAC,EAAM,YAAcD,EAChBd,GAAec,CAAW,GAC1BA,EAAY,IAAIC,CAAK,GAIzBA,EAAM,YAAcC,GAEjBD,CACV,CACD,OAAAF,EAAW,OAAS,SAAUI,EAAMlE,EAAOmE,EAAU,CACjD,OAAO,IAAIC,GAAeF,EAAMlE,EAAOmE,CAAQ,CACvD,EACIL,EAAW,UAAU,KAAO,SAAUzF,EAAO,CACrC,KAAK,WAIL,KAAK,MAAMA,CAAK,CAE5B,EACIyF,EAAW,UAAU,MAAQ,SAAUxC,EAAK,CACpC,KAAK,YAIL,KAAK,UAAY,GACjB,KAAK,OAAOA,CAAG,EAE3B,EACIwC,EAAW,UAAU,SAAW,UAAY,CACpC,KAAK,YAIL,KAAK,UAAY,GACjB,KAAK,UAAS,EAE1B,EACIA,EAAW,UAAU,YAAc,UAAY,CACtC,KAAK,SACN,KAAK,UAAY,GACjB7C,EAAO,UAAU,YAAY,KAAK,IAAI,EACtC,KAAK,YAAc,KAE/B,EACI6C,EAAW,UAAU,MAAQ,SAAUzF,EAAO,CAC1C,KAAK,YAAY,KAAKA,CAAK,CACnC,EACIyF,EAAW,UAAU,OAAS,SAAUxC,EAAK,CACzC,GAAI,CACA,KAAK,YAAY,MAAMA,CAAG,CAC7B,QAAA,CAEG,KAAK,YAAW,CACnB,CACT,EACIwC,EAAW,UAAU,UAAY,UAAY,CACzC,GAAI,CACA,KAAK,YAAY,SAAA,CACpB,QAAA,CAEG,KAAK,YAAW,CACnB,CACT,EACWA,CACX,EAAEnC,EAAY,EAEV0C,GAAQ,SAAS,UAAU,KAC/B,SAASC,GAAKC,EAAIvG,EAAS,CACvB,OAAOqG,GAAM,KAAKE,EAAIvG,CAAO,CACjC,CACA,IAAIwG,GAAoB,UAAY,CAChC,SAASA,EAAiBC,EAAiB,CACvC,KAAK,gBAAkBA,CAC1B,CACD,OAAAD,EAAiB,UAAU,KAAO,SAAUnG,EAAO,CAC/C,IAAIoG,EAAkB,KAAK,gBAC3B,GAAIA,EAAgB,KAChB,GAAI,CACAA,EAAgB,KAAKpG,CAAK,CAC7B,OACM2B,EAAO,CACV0E,GAAqB1E,CAAK,CAC7B,CAEb,EACIwE,EAAiB,UAAU,MAAQ,SAAUlD,EAAK,CAC9C,IAAImD,EAAkB,KAAK,gBAC3B,GAAIA,EAAgB,MAChB,GAAI,CACAA,EAAgB,MAAMnD,CAAG,CAC5B,OACMtB,EAAO,CACV0E,GAAqB1E,CAAK,CAC7B,MAGD0E,GAAqBpD,CAAG,CAEpC,EACIkD,EAAiB,UAAU,SAAW,UAAY,CAC9C,IAAIC,EAAkB,KAAK,gBAC3B,GAAIA,EAAgB,SAChB,GAAI,CACAA,EAAgB,SAAQ,CAC3B,OACMzE,EAAO,CACV0E,GAAqB1E,CAAK,CAC7B,CAEb,EACWwE,CACX,EAAC,EACGJ,GAAkB,SAAUnD,EAAQ,CACpCpD,GAAUuG,EAAgBnD,CAAM,EAChC,SAASmD,EAAeO,EAAgB3E,EAAOmE,EAAU,CACrD,IAAIH,EAAQ/C,EAAO,KAAK,IAAI,GAAK,KAC7BwD,EACJ,GAAI3D,GAAW6D,CAAc,GAAK,CAACA,EAC/BF,EAAkB,CACd,KAAOE,GAAwE,OAC/E,MAAO3E,GAA6C,OACpD,SAAUmE,GAAsD,MAChF,MAEa,CACD,IAAIS,EACAZ,GAASd,GAAO,0BAChB0B,EAAY,OAAO,OAAOD,CAAc,EACxCC,EAAU,YAAc,UAAY,CAAE,OAAOZ,EAAM,YAAa,CAAA,EAChES,EAAkB,CACd,KAAME,EAAe,MAAQL,GAAKK,EAAe,KAAMC,CAAS,EAChE,MAAOD,EAAe,OAASL,GAAKK,EAAe,MAAOC,CAAS,EACnE,SAAUD,EAAe,UAAYL,GAAKK,EAAe,SAAUC,CAAS,CAChG,GAGgBH,EAAkBE,CAEzB,CACD,OAAAX,EAAM,YAAc,IAAIQ,GAAiBC,CAAe,EACjDT,CACV,CACD,OAAOI,CACX,EAAEN,EAAU,EAEZ,SAASY,GAAqB1E,EAAO,CAK7B0D,GAAqB1D,CAAK,CAElC,CACA,SAAS6E,GAAoBvD,EAAK,CAC9B,MAAMA,CACV,CAKO,IAAI2C,GAAiB,CACxB,OAAQ,GACR,KAAMN,GACN,MAAOkB,GACP,SAAUlB,EACd,ECtLWmB,GAAc,UAAY,CAAE,OAAQ,OAAO,QAAW,YAAc,OAAO,YAAe,gBAAoB,ECAlH,SAASC,GAASC,EAAG,CACxB,OAAOA,CACX,CCDO,SAASC,IAAO,CAEnB,QADIC,EAAM,CAAA,EACD3B,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpC2B,EAAI3B,CAAE,EAAI,UAAUA,CAAE,EAE1B,OAAO4B,GAAcD,CAAG,CAC5B,CACO,SAASC,GAAcD,EAAK,CAC/B,OAAIA,EAAI,SAAW,EACRH,GAEPG,EAAI,SAAW,EACRA,EAAI,CAAC,EAET,SAAeE,EAAO,CACzB,OAAOF,EAAI,OAAO,SAAUG,EAAMd,EAAI,CAAE,OAAOA,EAAGc,CAAI,CAAI,EAAED,CAAK,CACzE,CACA,CCXA,IAAIE,GAAc,UAAY,CAC1B,SAASA,EAAWC,EAAW,CACvBA,IACA,KAAK,WAAaA,EAEzB,CACD,OAAAD,EAAW,UAAU,KAAO,SAAUE,EAAU,CAC5C,IAAIV,EAAa,IAAIQ,EACrB,OAAAR,EAAW,OAAS,KACpBA,EAAW,SAAWU,EACfV,CACf,EACIQ,EAAW,UAAU,UAAY,SAAUX,EAAgB3E,EAAOmE,EAAU,CACxE,IAAIH,EAAQ,KACRyB,EAAaC,GAAaf,CAAc,EAAIA,EAAiB,IAAIP,GAAeO,EAAgB3E,EAAOmE,CAAQ,EACnH,OAAAP,GAAa,UAAY,CACrB,IAAI9B,EAAKkC,EAAOwB,EAAW1D,EAAG,SAAU6D,EAAS7D,EAAG,OACpD2D,EAAW,IAAID,EAEPA,EAAS,KAAKC,EAAYE,CAAM,EAClCA,EAEM3B,EAAM,WAAWyB,CAAU,EAE3BzB,EAAM,cAAcyB,CAAU,CAAC,CACvD,CAAS,EACMA,CACf,EACIH,EAAW,UAAU,cAAgB,SAAUM,EAAM,CACjD,GAAI,CACA,OAAO,KAAK,WAAWA,CAAI,CAC9B,OACMtE,EAAK,CACRsE,EAAK,MAAMtE,CAAG,CACjB,CACT,EACIgE,EAAW,UAAU,QAAU,SAAUpB,EAAM2B,EAAa,CACxD,IAAI7B,EAAQ,KACZ,OAAA6B,EAAcC,GAAeD,CAAW,EACjC,IAAIA,EAAY,SAAUvH,EAASC,EAAQ,CAC9C,IAAIkH,EAAa,IAAIrB,GAAe,CAChC,KAAM,SAAU/F,EAAO,CACnB,GAAI,CACA6F,EAAK7F,CAAK,CACb,OACMiD,EAAK,CACR/C,EAAO+C,CAAG,EACVmE,EAAW,YAAW,CACzB,CACJ,EACD,MAAOlH,EACP,SAAUD,CAC1B,CAAa,EACD0F,EAAM,UAAUyB,CAAU,CACtC,CAAS,CACT,EACIH,EAAW,UAAU,WAAa,SAAUG,EAAY,CACpD,IAAI3D,EACJ,OAAQA,EAAK,KAAK,UAAY,MAAQA,IAAO,OAAS,OAASA,EAAG,UAAU2D,CAAU,CAC9F,EACIH,EAAW,UAAUS,EAAiB,EAAI,UAAY,CAClD,OAAO,IACf,EACIT,EAAW,UAAU,KAAO,UAAY,CAEpC,QADIU,EAAa,CAAA,EACRzC,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCyC,EAAWzC,CAAE,EAAI,UAAUA,CAAE,EAEjC,OAAO4B,GAAca,CAAU,EAAE,IAAI,CAC7C,EACIV,EAAW,UAAU,UAAY,SAAUO,EAAa,CACpD,IAAI7B,EAAQ,KACZ,OAAA6B,EAAcC,GAAeD,CAAW,EACjC,IAAIA,EAAY,SAAUvH,EAASC,EAAQ,CAC9C,IAAIF,EACJ2F,EAAM,UAAU,SAAUgB,EAAG,CAAE,OAAQ3G,EAAQ2G,CAAK,EAAE,SAAU1D,EAAK,CAAE,OAAO/C,EAAO+C,CAAG,CAAA,EAAM,UAAY,CAAE,OAAOhD,EAAQD,CAAK,CAAE,CAAE,CAChJ,CAAS,CACT,EACIiH,EAAW,OAAS,SAAUC,EAAW,CACrC,OAAO,IAAID,EAAWC,CAAS,CACvC,EACWD,CACX,EAAC,EAED,SAASQ,GAAeD,EAAa,CACjC,IAAI/D,EACJ,OAAQA,EAAK+D,GAA+D3C,GAAO,WAAa,MAAQpB,IAAO,OAASA,EAAK,OACjI,CACA,SAASmE,GAAW5H,EAAO,CACvB,OAAOA,GAASyC,GAAWzC,EAAM,IAAI,GAAKyC,GAAWzC,EAAM,KAAK,GAAKyC,GAAWzC,EAAM,QAAQ,CAClG,CACA,SAASqH,GAAarH,EAAO,CACzB,OAAQA,GAASA,aAAiByF,IAAgBmC,GAAW5H,CAAK,GAAK4E,GAAe5E,CAAK,CAC/F,CCnGO,SAAS6H,GAAQP,EAAQ,CAC5B,OAAO7E,GAA2D6E,GAAO,IAAI,CACjF,CACO,SAASQ,GAAQC,EAAM,CAC1B,OAAO,SAAUT,EAAQ,CACrB,GAAIO,GAAQP,CAAM,EACd,OAAOA,EAAO,KAAK,SAAUU,EAAc,CACvC,GAAI,CACA,OAAOD,EAAKC,EAAc,IAAI,CACjC,OACM/E,EAAK,CACR,KAAK,MAAMA,CAAG,CACjB,CACjB,CAAa,EAEL,MAAM,IAAI,UAAU,wCAAwC,CACpE,CACA,CChBO,SAASgF,GAAyBvC,EAAawC,EAAQC,EAAYC,EAASC,EAAY,CAC3F,OAAO,IAAIC,GAAmB5C,EAAawC,EAAQC,EAAYC,EAASC,CAAU,CACtF,CACA,IAAIC,GAAsB,SAAU1F,EAAQ,CACxCpD,GAAU8I,EAAoB1F,CAAM,EACpC,SAAS0F,EAAmB5C,EAAawC,EAAQC,EAAYC,EAASC,EAAYE,EAAmB,CACjG,IAAI5C,EAAQ/C,EAAO,KAAK,KAAM8C,CAAW,GAAK,KAC9C,OAAAC,EAAM,WAAa0C,EACnB1C,EAAM,kBAAoB4C,EAC1B5C,EAAM,MAAQuC,EACR,SAAUlI,EAAO,CACf,GAAI,CACAkI,EAAOlI,CAAK,CACf,OACMiD,EAAK,CACRyC,EAAY,MAAMzC,CAAG,CACxB,CACJ,EACCL,EAAO,UAAU,MACvB+C,EAAM,OAASyC,EACT,SAAUnF,EAAK,CACb,GAAI,CACAmF,EAAQnF,CAAG,CACd,OACMA,EAAK,CACRyC,EAAY,MAAMzC,CAAG,CACxB,QAAA,CAEG,KAAK,YAAW,CACnB,CACJ,EACCL,EAAO,UAAU,OACvB+C,EAAM,UAAYwC,EACZ,UAAY,CACV,GAAI,CACAA,EAAAA,CACH,OACMlF,EAAK,CACRyC,EAAY,MAAMzC,CAAG,CACxB,QAAA,CAEG,KAAK,YAAW,CACnB,CACJ,EACCL,EAAO,UAAU,UAChB+C,CACV,CACD,OAAA2C,EAAmB,UAAU,YAAc,UAAY,CACnD,IAAI7E,EACJ,GAAI,CAAC,KAAK,mBAAqB,KAAK,kBAAiB,EAAI,CACrD,IAAI+E,EAAW,KAAK,OACpB5F,EAAO,UAAU,YAAY,KAAK,IAAI,EACtC,CAAC4F,KAAc/E,EAAK,KAAK,cAAgB,MAAQA,IAAO,QAAkBA,EAAG,KAAK,IAAI,EACzF,CACT,EACW6E,CACX,EAAE7C,EAAU,ECzDDgD,GAA0B/F,GAAiB,SAAUE,EAAQ,CACpE,OAAO,UAAuC,CAC1CA,EAAO,IAAI,EACX,KAAK,KAAO,0BACZ,KAAK,QAAU,qBACvB,CACA,CAAC,ECDG8F,EAAW,SAAU9F,EAAQ,CAC7BpD,GAAUkJ,EAAS9F,CAAM,EACzB,SAAS8F,GAAU,CACf,IAAI/C,EAAQ/C,EAAO,KAAK,IAAI,GAAK,KACjC,OAAA+C,EAAM,OAAS,GACfA,EAAM,iBAAmB,KACzBA,EAAM,UAAY,CAAA,EAClBA,EAAM,UAAY,GAClBA,EAAM,SAAW,GACjBA,EAAM,YAAc,KACbA,CACV,CACD,OAAA+C,EAAQ,UAAU,KAAO,SAAUvB,EAAU,CACzC,IAAIwB,EAAU,IAAIC,GAAiB,KAAM,IAAI,EAC7C,OAAAD,EAAQ,SAAWxB,EACZwB,CACf,EACID,EAAQ,UAAU,eAAiB,UAAY,CAC3C,GAAI,KAAK,OACL,MAAM,IAAID,EAEtB,EACIC,EAAQ,UAAU,KAAO,SAAU1I,EAAO,CACtC,IAAI2F,EAAQ,KACZJ,GAAa,UAAY,CACrB,IAAI/B,EAAKC,EAET,GADAkC,EAAM,eAAc,EAChB,CAACA,EAAM,UAAW,CACbA,EAAM,mBACPA,EAAM,iBAAmB,MAAM,KAAKA,EAAM,SAAS,GAEvD,GAAI,CACA,QAAShC,EAAKxC,GAASwE,EAAM,gBAAgB,EAAGkD,EAAKlF,EAAG,KAAM,EAAE,CAACkF,EAAG,KAAMA,EAAKlF,EAAG,KAAA,EAAQ,CACtF,IAAImF,EAAWD,EAAG,MAClBC,EAAS,KAAK9I,CAAK,CACtB,CACJ,OACMgE,EAAO,CAAER,EAAM,CAAE,MAAOQ,CAAO,CAAG,QAAA,CAErC,GAAI,CACI6E,GAAM,CAACA,EAAG,OAASpF,EAAKE,EAAG,SAASF,EAAG,KAAKE,CAAE,CACrD,QAAA,CACS,GAAIH,EAAK,MAAMA,EAAI,KAAQ,CACxC,CACJ,CACb,CAAS,CACT,EACIkF,EAAQ,UAAU,MAAQ,SAAUzF,EAAK,CACrC,IAAI0C,EAAQ,KACZJ,GAAa,UAAY,CAErB,GADAI,EAAM,eAAc,EAChB,CAACA,EAAM,UAAW,CAClBA,EAAM,SAAWA,EAAM,UAAY,GACnCA,EAAM,YAAc1C,EAEpB,QADI8F,EAAYpD,EAAM,UACfoD,EAAU,QACbA,EAAU,MAAK,EAAG,MAAM9F,CAAG,CAElC,CACb,CAAS,CACT,EACIyF,EAAQ,UAAU,SAAW,UAAY,CACrC,IAAI/C,EAAQ,KACZJ,GAAa,UAAY,CAErB,GADAI,EAAM,eAAc,EAChB,CAACA,EAAM,UAAW,CAClBA,EAAM,UAAY,GAElB,QADIoD,EAAYpD,EAAM,UACfoD,EAAU,QACbA,EAAU,MAAA,EAAQ,SAAA,CAEzB,CACb,CAAS,CACT,EACIL,EAAQ,UAAU,YAAc,UAAY,CACxC,KAAK,UAAY,KAAK,OAAS,GAC/B,KAAK,UAAY,KAAK,iBAAmB,IACjD,EACI,OAAO,eAAeA,EAAQ,UAAW,WAAY,CACjD,IAAK,UAAY,CACb,IAAIjF,EACJ,QAASA,EAAK,KAAK,aAAe,MAAQA,IAAO,OAAS,OAASA,EAAG,QAAU,CACnF,EACD,WAAY,GACZ,aAAc,EACtB,CAAK,EACDiF,EAAQ,UAAU,cAAgB,SAAUtB,EAAY,CACpD,OAAA,KAAK,eAAc,EACZxE,EAAO,UAAU,cAAc,KAAK,KAAMwE,CAAU,CACnE,EACIsB,EAAQ,UAAU,WAAa,SAAUtB,EAAY,CACjD,OAAA,KAAK,eAAc,EACnB,KAAK,wBAAwBA,CAAU,EAChC,KAAK,gBAAgBA,CAAU,CAC9C,EACIsB,EAAQ,UAAU,gBAAkB,SAAUtB,EAAY,CACtD,IAAIzB,EAAQ,KACRlC,EAAK,KAAMuF,EAAWvF,EAAG,SAAUwF,EAAYxF,EAAG,UAAWsF,EAAYtF,EAAG,UAChF,OAAIuF,GAAYC,EACLtE,IAEX,KAAK,iBAAmB,KACxBoE,EAAU,KAAK3B,CAAU,EAClB,IAAI9D,GAAa,UAAY,CAChCqC,EAAM,iBAAmB,KACzBzC,GAAU6F,EAAW3B,CAAU,CAC3C,CAAS,EACT,EACIsB,EAAQ,UAAU,wBAA0B,SAAUtB,EAAY,CAC9D,IAAI3D,EAAK,KAAMuF,EAAWvF,EAAG,SAAUyF,EAAczF,EAAG,YAAawF,EAAYxF,EAAG,UAChFuF,EACA5B,EAAW,MAAM8B,CAAW,EAEvBD,GACL7B,EAAW,SAAQ,CAE/B,EACIsB,EAAQ,UAAU,aAAe,UAAY,CACzC,IAAIjC,EAAa,IAAIQ,GACrB,OAAAR,EAAW,OAAS,KACbA,CACf,EACIiC,EAAQ,OAAS,SAAUhD,EAAa4B,EAAQ,CAC5C,OAAO,IAAIsB,GAAiBlD,EAAa4B,CAAM,CACvD,EACWoB,CACX,EAAEzB,EAAU,EAER2B,GAAoB,SAAUhG,EAAQ,CACtCpD,GAAUoJ,EAAkBhG,CAAM,EAClC,SAASgG,EAAiBlD,EAAa4B,EAAQ,CAC3C,IAAI3B,EAAQ/C,EAAO,KAAK,IAAI,GAAK,KACjC,OAAA+C,EAAM,YAAcD,EACpBC,EAAM,OAAS2B,EACR3B,CACV,CACD,OAAAiD,EAAiB,UAAU,KAAO,SAAU5I,EAAO,CAC/C,IAAIyD,EAAIE,GACPA,GAAMF,EAAK,KAAK,eAAiB,MAAQA,IAAO,OAAS,OAASA,EAAG,QAAU,MAAQE,IAAO,QAAkBA,EAAG,KAAKF,EAAIzD,CAAK,CAC1I,EACI4I,EAAiB,UAAU,MAAQ,SAAU3F,EAAK,CAC9C,IAAIQ,EAAIE,GACPA,GAAMF,EAAK,KAAK,eAAiB,MAAQA,IAAO,OAAS,OAASA,EAAG,SAAW,MAAQE,IAAO,QAAkBA,EAAG,KAAKF,EAAIR,CAAG,CACzI,EACI2F,EAAiB,UAAU,SAAW,UAAY,CAC9C,IAAInF,EAAIE,GACPA,GAAMF,EAAK,KAAK,eAAiB,MAAQA,IAAO,OAAS,OAASA,EAAG,YAAc,MAAQE,IAAO,QAAkBA,EAAG,KAAKF,CAAE,CACvI,EACImF,EAAiB,UAAU,WAAa,SAAUxB,EAAY,CAC1D,IAAI3D,EAAIE,EACR,OAAQA,GAAMF,EAAK,KAAK,UAAY,MAAQA,IAAO,OAAS,OAASA,EAAG,UAAU2D,CAAU,KAAO,MAAQzD,IAAO,OAASA,EAAKgB,EACxI,EACWiE,CACX,EAAEF,CAAO,EC7JLS,GAAmB,SAAUvG,EAAQ,CACrCpD,GAAU2J,EAAiBvG,CAAM,EACjC,SAASuG,EAAgBC,EAAQ,CAC7B,IAAIzD,EAAQ/C,EAAO,KAAK,IAAI,GAAK,KACjC,OAAA+C,EAAM,OAASyD,EACRzD,CACV,CACD,OAAA,OAAO,eAAewD,EAAgB,UAAW,QAAS,CACtD,IAAK,UAAY,CACb,OAAO,KAAK,SAAA,CACf,EACD,WAAY,GACZ,aAAc,EACtB,CAAK,EACDA,EAAgB,UAAU,WAAa,SAAU/B,EAAY,CACzD,IAAIiC,EAAezG,EAAO,UAAU,WAAW,KAAK,KAAMwE,CAAU,EACpE,MAAA,CAACiC,EAAa,QAAUjC,EAAW,KAAK,KAAK,MAAM,EAC5CiC,CACf,EACIF,EAAgB,UAAU,SAAW,UAAY,CAC7C,IAAI1F,EAAK,KAAMuF,EAAWvF,EAAG,SAAUyF,EAAczF,EAAG,YAAa2F,EAAS3F,EAAG,OACjF,GAAIuF,EACA,MAAME,EAEV,OAAA,KAAK,eAAc,EACZE,CACf,EACID,EAAgB,UAAU,KAAO,SAAUnJ,EAAO,CAC9C4C,EAAO,UAAU,KAAK,KAAK,KAAO,KAAK,OAAS5C,CAAAA,CACxD,EACWmJ,CACX,EAAET,CAAO,ECjCEY,GAAwB,CAC/B,IAAK,UAAY,CACb,OAAQA,GAAsB,UAAY,MAAM,IAAG,CACtD,EACD,SAAU,MACd,ECHIC,GAAU,SAAU3G,EAAQ,CAC5BpD,GAAU+J,EAAQ3G,CAAM,EACxB,SAAS2G,EAAOC,EAAWC,EAAM,CAC7B,OAAO7G,EAAO,KAAK,IAAI,GAAK,IAC/B,CACD,OAAA2G,EAAO,UAAU,SAAW,SAAUG,EAAOC,EAAO,CAEhD,OAAO,IACf,EACWJ,CACX,EAAEjG,EAAY,ECXHsG,GAAmB,CAC1B,YAAa,SAAU7E,EAASC,EAAS,CAErC,QADIC,EAAO,CAAA,EACFC,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCD,EAAKC,EAAK,CAAC,EAAI,UAAUA,CAAE,EAE/B,IAAIC,EAAWyE,GAAiB,SAChC,OAAIzE,GAAa,MAAuCA,EAAS,YACtDA,EAAS,YAAY,MAAMA,EAAUvD,GAAc,CAACmD,EAASC,CAAO,EAAGxD,GAAOyD,CAAI,CAAC,CAAC,EAExF,YAAY,MAAM,OAAQrD,GAAc,CAACmD,EAASC,CAAO,EAAGxD,GAAOyD,CAAI,CAAC,CAAC,CACnF,EACD,cAAe,SAAUG,EAAQ,CAC7B,IAAID,EAAWyE,GAAiB,SAChC,OAA6DzE,GAAS,eAAkB,eAAeC,CAAM,CAChH,EACD,SAAU,MACd,ECdIyE,GAAe,SAAUjH,EAAQ,CACjCpD,GAAUqK,EAAajH,CAAM,EAC7B,SAASiH,EAAYL,EAAWC,EAAM,CAClC,IAAI9D,EAAQ/C,EAAO,KAAK,KAAM4G,EAAWC,CAAI,GAAK,KAClD,OAAA9D,EAAM,UAAY6D,EAClB7D,EAAM,KAAO8D,EACb9D,EAAM,QAAU,GACTA,CACV,CACD,OAAAkE,EAAY,UAAU,SAAW,SAAUH,EAAOC,EAAO,CACrD,IAAIlG,EAEJ,GADIkG,IAAU,SAAUA,EAAQ,GAC5B,KAAK,OACL,OAAO,KAEX,KAAK,MAAQD,EACb,IAAII,EAAK,KAAK,GACVN,EAAY,KAAK,UACrB,OAAIM,GAAM,OACN,KAAK,GAAK,KAAK,eAAeN,EAAWM,EAAIH,CAAK,GAEtD,KAAK,QAAU,GACf,KAAK,MAAQA,EACb,KAAK,IAAMlG,EAAK,KAAK,MAAQ,MAAQA,IAAO,OAASA,EAAK,KAAK,eAAe+F,EAAW,KAAK,GAAIG,CAAK,EAChG,IACf,EACIE,EAAY,UAAU,eAAiB,SAAUL,EAAWO,EAAKJ,EAAO,CACpE,OAAIA,IAAU,SAAUA,EAAQ,GACzBC,GAAiB,YAAYJ,EAAU,MAAM,KAAKA,EAAW,IAAI,EAAGG,CAAK,CACxF,EACIE,EAAY,UAAU,eAAiB,SAAUG,EAAYF,EAAIH,EAAO,CAEpE,GADIA,IAAU,SAAUA,EAAQ,GAC5BA,GAAS,MAAQ,KAAK,QAAUA,GAAS,KAAK,UAAY,GAC1D,OAAOG,EAEPA,GAAM,MACNF,GAAiB,cAAcE,CAAE,CAG7C,EACID,EAAY,UAAU,QAAU,SAAUH,EAAOC,EAAO,CACpD,GAAI,KAAK,OACL,OAAO,IAAI,MAAM,8BAA8B,EAEnD,KAAK,QAAU,GACf,IAAIhI,EAAQ,KAAK,SAAS+H,EAAOC,CAAK,EACtC,GAAIhI,EACA,OAAOA,EAEF,KAAK,UAAY,IAAS,KAAK,IAAM,OAC1C,KAAK,GAAK,KAAK,eAAe,KAAK,UAAW,KAAK,GAAI,IAAI,EAEvE,EACIkI,EAAY,UAAU,SAAW,SAAUH,EAAOO,EAAQ,CACtD,IAAIC,EAAU,GACVC,EACJ,GAAI,CACA,KAAK,KAAKT,CAAK,CAClB,OACMrJ,EAAG,CACN6J,EAAU,GACVC,EAAa9J,GAAQ,IAAI,MAAM,oCAAoC,CACtE,CACD,GAAI6J,EACA,OAAA,KAAK,YAAW,EACTC,CAEnB,EACIN,EAAY,UAAU,YAAc,UAAY,CAC5C,GAAI,CAAC,KAAK,OAAQ,CACd,IAAIpG,EAAK,KAAMqG,EAAKrG,EAAG,GAAI+F,EAAY/F,EAAG,UACtC2G,EAAUZ,EAAU,QACxB,KAAK,KAAO,KAAK,MAAQ,KAAK,UAAY,KAC1C,KAAK,QAAU,GACftG,GAAUkH,EAAS,IAAI,EACnBN,GAAM,OACN,KAAK,GAAK,KAAK,eAAeN,EAAWM,EAAI,IAAI,GAErD,KAAK,MAAQ,KACblH,EAAO,UAAU,YAAY,KAAK,IAAI,CACzC,CACT,EACWiH,CACX,EAAEN,EAAM,ECtFJc,GAAa,UAAY,CACzB,SAASA,EAAUC,EAAqBrL,EAAK,CACrCA,IAAQ,SAAUA,EAAMoL,EAAU,KACtC,KAAK,oBAAsBC,EAC3B,KAAK,IAAMrL,CACd,CACD,OAAAoL,EAAU,UAAU,SAAW,SAAUZ,EAAME,EAAOD,EAAO,CACzD,OAAIC,IAAU,SAAUA,EAAQ,GACzB,IAAI,KAAK,oBAAoB,KAAMF,CAAI,EAAE,SAASC,EAAOC,CAAK,CAC7E,EACIU,EAAU,IAAMf,GAAsB,IAC/Be,CACX,EAAA,ECXIE,GAAkB,SAAU3H,EAAQ,CACpCpD,GAAU+K,EAAgB3H,CAAM,EAChC,SAAS2H,EAAeC,EAAiBvL,EAAK,CACtCA,IAAQ,SAAUA,EAAMoL,GAAU,KACtC,IAAI1E,EAAQ/C,EAAO,KAAK,KAAM4H,EAAiBvL,CAAG,GAAK,KACvD,OAAA0G,EAAM,QAAU,CAAA,EAChBA,EAAM,QAAU,GACTA,CACV,CACD,OAAA4E,EAAe,UAAU,MAAQ,SAAUE,EAAQ,CAC/C,IAAIL,EAAU,KAAK,QACnB,GAAI,KAAK,QAAS,CACdA,EAAQ,KAAKK,CAAM,EACnB,MACH,CACD,IAAI9I,EACJ,KAAK,QAAU,GACf,EACI,IAAKA,EAAQ8I,EAAO,QAAQA,EAAO,MAAOA,EAAO,KAAK,EAClD,YAEEA,EAASL,EAAQ,MAAA,GAE3B,GADA,KAAK,QAAU,GACXzI,EAAO,CACP,KAAQ8I,EAASL,EAAQ,MAAA,GACrBK,EAAO,YAAW,EAEtB,MAAM9I,CACT,CACT,EACW4I,CACX,EAAEF,EAAS,EC/BAK,GAAiB,IAAIH,GAAeV,EAAW,EAC/Cc,GAAQD,GCFRE,GAAQ,IAAI3D,GAAW,SAAUG,EAAY,CAAE,OAAOA,EAAW,SAAU,EAAG,ECAlF,SAASyD,GAAY7K,EAAO,CAC/B,OAAOA,GAASyC,GAAWzC,EAAM,QAAQ,CAC7C,CCDA,SAAS8K,GAAK3H,EAAK,CACf,OAAOA,EAAIA,EAAI,OAAS,CAAC,CAC7B,CACO,SAAS4H,GAAkB9F,EAAM,CACpC,OAAOxC,GAAWqI,GAAK7F,CAAI,CAAC,EAAIA,EAAK,IAAK,EAAG,MACjD,CACO,SAAS+F,GAAa/F,EAAM,CAC/B,OAAO4F,GAAYC,GAAK7F,CAAI,CAAC,EAAIA,EAAK,IAAK,EAAG,MAClD,CACO,SAASgG,GAAUhG,EAAMiG,EAAc,CAC1C,OAAO,OAAOJ,GAAK7F,CAAI,GAAM,SAAWA,EAAK,IAAK,EAAGiG,CACzD,CCbO,IAAIC,GAAe,SAAUxE,EAAG,CAAE,OAAOA,GAAK,OAAOA,EAAE,QAAW,UAAY,OAAOA,GAAM,UAAW,ECCtG,SAASyE,GAAUpL,EAAO,CAC7B,OAAOyC,GAAyDzC,GAAM,IAAI,CAC9E,CCDO,SAASqL,GAAoBtE,EAAO,CACvC,OAAOtE,GAAWsE,EAAMW,EAAiB,CAAC,CAC9C,CCHO,SAAS4D,GAAgBC,EAAK,CACjC,OAAO,OAAO,eAAiB9I,GAAqD8I,IAAI,OAAO,aAAa,CAAC,CACjH,CCHO,SAASC,GAAiCzE,EAAO,CACpD,OAAO,IAAI,UAAU,iBAAmBA,IAAU,MAAQ,OAAOA,GAAU,SAAW,oBAAsB,IAAMA,EAAQ,KAAO,0HAA0H,CAC/P,CCFO,SAAS0E,IAAoB,CAChC,OAAI,OAAO,QAAW,YAAc,CAAC,OAAO,SACjC,aAEJ,OAAO,QAClB,CACO,IAAIC,GAAWD,GAAmB,ECJlC,SAASE,GAAW5E,EAAO,CAC9B,OAAOtE,GAAyDsE,IAAM6E,EAAe,CAAC,CAC1F,CCFO,SAASC,GAAmCC,EAAgB,CAC/D,OAAO5J,GAAiB,KAAM,UAAW,UAAgD,CACrF,IAAI6J,EAAQtI,EAAIzD,EAAOgM,EACvB,OAAOxL,GAAY,KAAM,SAAUmD,EAAI,CACnC,OAAQA,EAAG,MAAK,CACZ,IAAK,GACDoI,EAASD,EAAe,UAAA,EACxBnI,EAAG,MAAQ,EACf,IAAK,GACDA,EAAG,KAAK,KAAK,CAAC,EAAC,CAAI,EAAG,EAAE,CAAC,EACzBA,EAAG,MAAQ,EACf,IAAK,GAED,MAAO,CAAC,EAAG1B,GAAQ8J,EAAO,KAAI,CAAE,CAAC,EACrC,IAAK,GAED,OADAtI,EAAKE,EAAG,KAAI,EAAI3D,EAAQyD,EAAG,MAAOuI,EAAOvI,EAAG,KACvCuI,EACE,CAAC,EAAG/J,GAAQ,MAAM,CAAC,EADR,CAAC,EAAG,CAAC,EAE3B,IAAK,GAAG,MAAO,CAAC,EAAG0B,EAAG,KAAM,CAAA,EAC5B,IAAK,GAAG,MAAO,CAAC,EAAG1B,GAAQjC,CAAK,CAAC,EACjC,IAAK,GAAG,MAAO,CAAC,EAAG2D,EAAG,KAAM,CAAA,EAC5B,IAAK,GACD,OAAAA,EAAG,KAAI,EACA,CAAC,EAAG,CAAC,EAChB,IAAK,GAAG,MAAO,CAAC,EAAG,EAAE,EACrB,IAAK,GACD,OAAAoI,EAAO,YAAW,EACX,CAAC,CAAC,EACb,IAAK,IAAI,MAAO,CAAC,CAAC,CACrB,CACb,CAAS,CACT,CAAK,CACL,CACO,SAASE,GAAqBV,EAAK,CACtC,OAAO9I,GAAqD8I,GAAI,SAAS,CAC7E,CCzBO,SAASW,GAAUnF,EAAO,CAC7B,GAAIA,aAAiBE,GACjB,OAAOF,EAEX,GAAIA,GAAS,KAAM,CACf,GAAIsE,GAAoBtE,CAAK,EACzB,OAAOoF,GAAsBpF,CAAK,EAEtC,GAAIoE,GAAYpE,CAAK,EACjB,OAAOqF,GAAcrF,CAAK,EAE9B,GAAIqE,GAAUrE,CAAK,EACf,OAAOsF,GAAYtF,CAAK,EAE5B,GAAIuE,GAAgBvE,CAAK,EACrB,OAAOuF,GAAkBvF,CAAK,EAElC,GAAI4E,GAAW5E,CAAK,EAChB,OAAOwF,GAAaxF,CAAK,EAE7B,GAAIkF,GAAqBlF,CAAK,EAC1B,OAAOyF,GAAuBzF,CAAK,CAE1C,CACD,MAAMyE,GAAiCzE,CAAK,CAChD,CACO,SAASoF,GAAsBZ,EAAK,CACvC,OAAO,IAAItE,GAAW,SAAUG,EAAY,CACxC,IAAIqF,EAAMlB,EAAI7D,EAAiB,EAAA,EAC/B,GAAIjF,GAAWgK,EAAI,SAAS,EACxB,OAAOA,EAAI,UAAUrF,CAAU,EAEnC,MAAM,IAAI,UAAU,gEAAgE,CAC5F,CAAK,CACL,CACO,SAASgF,GAAcM,EAAO,CACjC,OAAO,IAAIzF,GAAW,SAAUG,EAAY,CACxC,QAAS7F,EAAI,EAAGA,EAAImL,EAAM,QAAU,CAACtF,EAAW,OAAQ7F,IACpD6F,EAAW,KAAKsF,EAAMnL,CAAC,CAAC,EAE5B6F,EAAW,SAAQ,CAC3B,CAAK,CACL,CACO,SAASiF,GAAYM,EAAS,CACjC,OAAO,IAAI1F,GAAW,SAAUG,EAAY,CACxCuF,EACK,KAAK,SAAU3M,EAAO,CAClBoH,EAAW,SACZA,EAAW,KAAKpH,CAAK,EACrBoH,EAAW,SAAQ,EAEnC,EAAW,SAAUnE,EAAK,CAAE,OAAOmE,EAAW,MAAMnE,CAAG,CAAA,CAAI,EAC9C,KAAK,KAAMoC,EAAoB,CAC5C,CAAK,CACL,CACO,SAASkH,GAAaK,EAAU,CACnC,OAAO,IAAI3F,GAAW,SAAUG,EAAY,CACxC,IAAI5D,EAAKC,EACT,GAAI,CACA,QAASoJ,EAAa1L,GAASyL,CAAQ,EAAGE,EAAeD,EAAW,KAAI,EAAI,CAACC,EAAa,KAAMA,EAAeD,EAAW,KAAI,EAAI,CAC9H,IAAI7M,EAAQ8M,EAAa,MAEzB,GADA1F,EAAW,KAAKpH,CAAK,EACjBoH,EAAW,OACX,MAEP,CACJ,OACMpD,EAAO,CAAER,EAAM,CAAE,MAAOQ,CAAO,CAAG,QAAA,CAErC,GAAI,CACI8I,GAAgB,CAACA,EAAa,OAASrJ,EAAKoJ,EAAW,SAASpJ,EAAG,KAAKoJ,CAAU,CACzF,QAAA,CACS,GAAIrJ,EAAK,MAAMA,EAAI,KAAQ,CACxC,CACD4D,EAAW,SAAQ,CAC3B,CAAK,CACL,CACO,SAASkF,GAAkBS,EAAe,CAC7C,OAAO,IAAI9F,GAAW,SAAUG,EAAY,CACxC4F,GAAQD,EAAe3F,CAAU,EAAE,MAAM,SAAUnE,EAAK,CAAE,OAAOmE,EAAW,MAAMnE,CAAG,CAAI,CAAA,CACjG,CAAK,CACL,CACO,SAASuJ,GAAuBV,EAAgB,CACnD,OAAOQ,GAAkBT,GAAmCC,CAAc,CAAC,CAC/E,CACA,SAASkB,GAAQD,EAAe3F,EAAY,CACxC,IAAI6F,EAAiBC,EACjBxJ,EAAKD,EACT,OAAO/D,GAAU,KAAM,OAAQ,OAAQ,UAAY,CAC/C,IAAIM,EAAOuE,EACX,OAAO/D,GAAY,KAAM,SAAUmD,EAAI,CACnC,OAAQA,EAAG,MAAK,CACZ,IAAK,GACDA,EAAG,KAAK,KAAK,CAAC,EAAG,EAAG,EAAG,EAAE,CAAC,EAC1BsJ,EAAkBzK,GAAcuK,CAAa,EAC7CpJ,EAAG,MAAQ,EACf,IAAK,GAAG,MAAO,CAAC,EAAGsJ,EAAgB,KAAM,CAAA,EACzC,IAAK,GACD,GAAMC,EAAoBvJ,EAAG,KAAA,EAAQ,CAAA,CAACuJ,EAAkB,KAAO,MAAO,CAAC,EAAG,CAAC,EAG3E,GAFAlN,EAAQkN,EAAkB,MAC1B9F,EAAW,KAAKpH,CAAK,EACjBoH,EAAW,OACX,MAAO,CAAC,CAAC,EAEbzD,EAAG,MAAQ,EACf,IAAK,GAAG,MAAO,CAAC,EAAG,CAAC,EACpB,IAAK,GAAG,MAAO,CAAC,EAAG,EAAE,EACrB,IAAK,GACD,OAAAY,EAAQZ,EAAG,KAAA,EACXD,EAAM,CAAE,MAAOa,CAAAA,EACR,CAAC,EAAG,EAAE,EACjB,IAAK,GAED,OADAZ,EAAG,KAAK,KAAK,CAAC,EAAC,CAAI,EAAG,EAAE,CAAC,EACnBuJ,GAAqB,CAACA,EAAkB,OAASzJ,EAAKwJ,EAAgB,QACrE,CAAC,EAAGxJ,EAAG,KAAKwJ,CAAe,CAAC,EAD0D,CAAC,EAAG,CAAC,EAEtG,IAAK,GACDtJ,EAAG,KAAI,EACPA,EAAG,MAAQ,EACf,IAAK,GAAG,MAAO,CAAC,EAAG,EAAE,EACrB,IAAK,GACD,GAAID,EAAK,MAAMA,EAAI,MACnB,MAAO,CAAC,CAAC,EACb,IAAK,IAAI,MAAO,CAAC,CAAC,EAClB,IAAK,IACD,OAAA0D,EAAW,SAAQ,EACZ,CAAC,CAAC,CAChB,CACb,CAAS,CACT,CAAK,CACL,CC7IO,SAAS+F,GAAgBC,EAAoB5D,EAAWC,EAAME,EAAO0D,EAAQ,CAC5E1D,IAAU,SAAUA,EAAQ,GAC5B0D,IAAW,SAAUA,EAAS,IAClC,IAAIC,EAAuB9D,EAAU,SAAS,UAAY,CACtDC,EAAAA,EACI4D,EACAD,EAAmB,IAAI,KAAK,SAAS,KAAMzD,CAAK,CAAC,EAGjD,KAAK,YAAW,CAEvB,EAAEA,CAAK,EAER,GADAyD,EAAmB,IAAIE,CAAoB,EACvC,CAACD,EACD,OAAOC,CAEf,CCbO,SAASC,GAAU/D,EAAWG,EAAO,CACxC,OAAIA,IAAU,SAAUA,EAAQ,GACzB7B,GAAQ,SAAUR,EAAQF,EAAY,CACzCE,EAAO,UAAUW,GAAyBb,EAAY,SAAUpH,EAAO,CAAE,OAAOmN,GAAgB/F,EAAYoC,EAAW,UAAY,CAAE,OAAOpC,EAAW,KAAKpH,CAAK,CAAA,EAAM2J,CAAK,CAAE,EAAI,UAAY,CAAE,OAAOwD,GAAgB/F,EAAYoC,EAAW,UAAY,CAAE,OAAOpC,EAAW,SAAQ,CAAK,EAAEuC,CAAK,CAAA,EAAM,SAAU1G,EAAK,CAAE,OAAOkK,GAAgB/F,EAAYoC,EAAW,UAAY,CAAE,OAAOpC,EAAW,MAAMnE,CAAG,CAAE,EAAI0G,CAAK,CAAI,CAAA,CAAC,CACxa,CAAK,CACL,CCPO,SAAS6D,GAAYhE,EAAWG,EAAO,CAC1C,OAAIA,IAAU,SAAUA,EAAQ,GACzB7B,GAAQ,SAAUR,EAAQF,EAAY,CACzCA,EAAW,IAAIoC,EAAU,SAAS,UAAY,CAAE,OAAOlC,EAAO,UAAUF,CAAU,CAAA,EAAMuC,CAAK,CAAC,CACtG,CAAK,CACL,CCHO,SAAS8D,GAAmB1G,EAAOyC,EAAW,CACjD,OAAO0C,GAAUnF,CAAK,EAAE,KAAKyG,GAAYhE,CAAS,EAAG+D,GAAU/D,CAAS,CAAC,CAC7E,CCFO,SAASkE,GAAgB3G,EAAOyC,EAAW,CAC9C,OAAO0C,GAAUnF,CAAK,EAAE,KAAKyG,GAAYhE,CAAS,EAAG+D,GAAU/D,CAAS,CAAC,CAC7E,CCJO,SAASmE,GAAc5G,EAAOyC,EAAW,CAC5C,OAAO,IAAIvC,GAAW,SAAUG,EAAY,CACxC,IAAI7F,EAAI,EACR,OAAOiI,EAAU,SAAS,UAAY,CAC9BjI,IAAMwF,EAAM,OACZK,EAAW,SAAQ,GAGnBA,EAAW,KAAKL,EAAMxF,GAAG,CAAC,EACrB6F,EAAW,QACZ,KAAK,SAAQ,EAGjC,CAAS,CACT,CAAK,CACL,CCZO,SAASwG,GAAiB7G,EAAOyC,EAAW,CAC/C,OAAO,IAAIvC,GAAW,SAAUG,EAAY,CACxC,IAAIsE,EACJ,OAAAyB,GAAgB/F,EAAYoC,EAAW,UAAY,CAC/CkC,EAAW3E,EAAM6E,EAAe,EAAA,EAChCuB,GAAgB/F,EAAYoC,EAAW,UAAY,CAC/C,IAAI/F,EACAzD,EACAgM,EACJ,GAAI,CACCvI,EAAKiI,EAAS,KAAA,EAAQ1L,EAAQyD,EAAG,MAAOuI,EAAOvI,EAAG,IACtD,OACMR,EAAK,CACRmE,EAAW,MAAMnE,CAAG,EACpB,MACH,CACG+I,EACA5E,EAAW,SAAQ,EAGnBA,EAAW,KAAKpH,CAAK,CAEzC,EAAe,EAAG,EAAI,CACtB,CAAS,EACM,UAAY,CAAE,OAAOyC,GAA+DiJ,GAAS,MAAM,GAAKA,EAAS,OAAQ,CAAA,CACxI,CAAK,CACL,CC5BO,SAASmC,GAAsB9G,EAAOyC,EAAW,CACpD,GAAI,CAACzC,EACD,MAAM,IAAI,MAAM,yBAAyB,EAE7C,OAAO,IAAIE,GAAW,SAAUG,EAAY,CACxC+F,GAAgB/F,EAAYoC,EAAW,UAAY,CAC/C,IAAIkC,EAAW3E,EAAM,OAAO,aAAa,EAAC,EAC1CoG,GAAgB/F,EAAYoC,EAAW,UAAY,CAC/CkC,EAAS,KAAI,EAAG,KAAK,SAAUnL,EAAQ,CAC/BA,EAAO,KACP6G,EAAW,SAAQ,EAGnBA,EAAW,KAAK7G,EAAO,KAAK,CAEpD,CAAiB,CACjB,EAAe,EAAG,EAAI,CACtB,CAAS,CACT,CAAK,CACL,CCnBO,SAASuN,GAA2B/G,EAAOyC,EAAW,CACzD,OAAOqE,GAAsBhC,GAAmC9E,CAAK,EAAGyC,CAAS,CACrF,CCSO,SAASuE,GAAUhH,EAAOyC,EAAW,CACxC,GAAIzC,GAAS,KAAM,CACf,GAAIsE,GAAoBtE,CAAK,EACzB,OAAO0G,GAAmB1G,EAAOyC,CAAS,EAE9C,GAAI2B,GAAYpE,CAAK,EACjB,OAAO4G,GAAc5G,EAAOyC,CAAS,EAEzC,GAAI4B,GAAUrE,CAAK,EACf,OAAO2G,GAAgB3G,EAAOyC,CAAS,EAE3C,GAAI8B,GAAgBvE,CAAK,EACrB,OAAO8G,GAAsB9G,EAAOyC,CAAS,EAEjD,GAAImC,GAAW5E,CAAK,EAChB,OAAO6G,GAAiB7G,EAAOyC,CAAS,EAE5C,GAAIyC,GAAqBlF,CAAK,EAC1B,OAAO+G,GAA2B/G,EAAOyC,CAAS,CAEzD,CACD,MAAMgC,GAAiCzE,CAAK,CAChD,CCjCO,SAASjF,GAAKiF,EAAOyC,EAAW,CACnC,OAAOA,EAAYuE,GAAUhH,EAAOyC,CAAS,EAAI0C,GAAUnF,CAAK,CACpE,CCFO,SAASiH,IAAK,CAEjB,QADI/I,EAAO,CAAA,EACFC,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCD,EAAKC,CAAE,EAAI,UAAUA,CAAE,EAE3B,IAAIsE,EAAYwB,GAAa/F,CAAI,EACjC,OAAOnD,GAAKmD,EAAMuE,CAAS,CAC/B,CCRO,IAAIyE,GAAavL,GAAiB,SAAUE,EAAQ,CAAE,OAAO,UAA0B,CAC1FA,EAAO,IAAI,EACX,KAAK,KAAO,aACZ,KAAK,QAAU,yBACnB,EAAI,ECHG,SAASsL,GAAe5G,EAAQzC,EAAQ,CAC3C,IAAIsJ,EAAY,OAAOtJ,GAAW,SAClC,OAAO,IAAI,QAAQ,SAAU5E,EAASC,EAAQ,CAC1C,IAAIkH,EAAa,IAAIrB,GAAe,CAChC,KAAM,SAAU/F,EAAO,CACnBC,EAAQD,CAAK,EACboH,EAAW,YAAW,CACzB,EACD,MAAOlH,EACP,SAAU,UAAY,CACdiO,EACAlO,EAAQ4E,EAAO,YAAY,EAG3B3E,EAAO,IAAI+N,EAAY,CAE9B,CACb,CAAS,EACD3G,EAAO,UAAUF,CAAU,CACnC,CAAK,CACL,CCtBO,SAASgH,GAAYpO,EAAO,CAC/B,OAAOA,aAAiB,MAAQ,CAAC,MAAMA,CAAK,CAChD,CCKO,IAAIqO,GAAe3L,GAAiB,SAAUE,EAAQ,CACzD,OAAO,SAA0B0L,EAAM,CAC/BA,IAAS,SAAUA,EAAO,MAC9B1L,EAAO,IAAI,EACX,KAAK,QAAU,uBACf,KAAK,KAAO,eACZ,KAAK,KAAO0L,CACpB,CACA,CAAC,EACM,SAAStJ,GAAQH,EAAQ0J,EAAc,CAC1C,IAAI9K,EAAM2K,GAAYvJ,CAAM,EAAI,CAAE,MAAOA,CAAQ,EAAG,OAAOA,GAAW,SAAW,CAAE,KAAMA,CAAM,EAAKA,EAAS2J,EAAQ/K,EAAG,MAAOgL,EAAOhL,EAAG,KAAME,EAAKF,EAAG,KAAMiL,EAAQ/K,IAAO,OAASgL,GAAsBhL,EAAIkF,EAAKpF,EAAG,UAAW+F,EAAYX,IAAO,OAAS0F,GAAkE7D,GAAiB7B,EAAI+F,EAAKnL,EAAG,KAAMoL,EAAOD,IAAO,OAAS,KAAOA,EACjY,GAAIJ,GAAS,MAAQC,GAAQ,KACzB,MAAM,IAAI,UAAU,sBAAsB,EAE9C,OAAO3G,GAAQ,SAAUR,EAAQF,EAAY,CACzC,IAAI0H,EACAC,EACAC,EAAY,KACZC,EAAO,EACPC,EAAa,SAAUvF,EAAO,CAC9BoF,EAAoB5B,GAAgB/F,EAAYoC,EAAW,UAAY,CACnE,GAAI,CACAsF,EAA2B,YAAW,EACtC5C,GAAUwC,EAAM,CACZ,KAAMG,EACN,UAAWG,EACX,KAAMC,CAC9B,CAAqB,CAAC,EAAE,UAAU7H,CAAU,CAC3B,OACMnE,EAAK,CACRmE,EAAW,MAAMnE,CAAG,CACvB,CACJ,EAAE0G,CAAK,CACpB,EACQmF,EAA6BxH,EAAO,UAAUW,GAAyBb,EAAY,SAAUpH,EAAO,CAC1B+O,GAAkB,YAAA,EACxFE,IACA7H,EAAW,KAAM4H,EAAYhP,CAAAA,EAC7ByO,EAAO,GAAKS,EAAWT,CAAI,CACvC,EAAW,OAAW,OAAW,UAAY,CAC3BM,GAAsB,MAAgDA,EAAkB,QAC1FA,GAAsB,MAAgDA,EAAkB,YAAA,EAE5FC,EAAY,IACf,CAAA,CAAC,EACF,CAACC,GAAQC,EAAWV,GAAS,KAAQ,OAAOA,GAAU,SAAWA,EAAQ,CAACA,EAAQhF,EAAU,IAAK,EAAIiF,CAAI,CACjH,CAAK,CACL,CACA,SAASE,GAAoBL,EAAM,CAC/B,MAAM,IAAID,GAAaC,CAAI,CAC/B,CCvDO,SAASa,GAAIC,EAASzP,EAAS,CAClC,OAAOmI,GAAQ,SAAUR,EAAQF,EAAY,CACzC,IAAI/D,EAAQ,EACZiE,EAAO,UAAUW,GAAyBb,EAAY,SAAUpH,EAAO,CACnEoH,EAAW,KAAKgI,EAAQ,KAAKzP,EAASK,EAAOqD,GAAO,CAAC,CACxD,CAAA,CAAC,CACV,CAAK,CACL,CCPA,IAAIgM,GAAU,MAAM,QACpB,SAASC,GAAYpJ,EAAIjB,EAAM,CAC3B,OAAOoK,GAAQpK,CAAI,EAAIiB,EAAG,MAAM,OAAQtE,GAAc,CAAA,EAAIJ,GAAOyD,CAAI,CAAC,CAAC,EAAIiB,EAAGjB,CAAI,CACtF,CACO,SAASsK,GAAiBrJ,EAAI,CACjC,OAAOiJ,GAAI,SAAUlK,EAAM,CAAE,OAAOqK,GAAYpJ,EAAIjB,CAAI,CAAE,CAAE,CAChE,CCRA,IAAIoK,GAAU,MAAM,QAChBG,GAAiB,OAAO,eAAgBC,GAAc,OAAO,UAAWC,GAAU,OAAO,KACtF,SAASC,GAAqB1K,EAAM,CACvC,GAAIA,EAAK,SAAW,EAAG,CACnB,IAAI2K,EAAU3K,EAAK,CAAC,EACpB,GAAIoK,GAAQO,CAAO,EACf,MAAO,CAAE,KAAMA,EAAS,KAAM,IAAI,EAEtC,GAAIC,GAAOD,CAAO,EAAG,CACjB,IAAIE,EAAOJ,GAAQE,CAAO,EAC1B,MAAO,CACH,KAAME,EAAK,IAAI,SAAUnR,EAAK,CAAE,OAAOiR,EAAQjR,CAAG,CAAA,CAAI,EACtD,KAAMmR,CACtB,CACS,CACJ,CACD,MAAO,CAAE,KAAM7K,EAAM,KAAM,IAAI,CACnC,CACA,SAAS4K,GAAOtE,EAAK,CACjB,OAAOA,GAAO,OAAOA,GAAQ,UAAYiE,GAAejE,CAAG,IAAMkE,EACrE,CCpBO,SAASM,GAAaD,EAAME,EAAQ,CACvC,OAAOF,EAAK,OAAO,SAAUvP,EAAQ5B,EAAK4C,EAAG,CAAE,OAAShB,EAAO5B,CAAG,EAAIqR,EAAOzO,CAAC,EAAIhB,CAAQ,EAAI,CAAA,CAAE,CACpG,CCOO,SAAS0P,IAAgB,CAE5B,QADIhL,EAAO,CAAA,EACFC,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCD,EAAKC,CAAE,EAAI,UAAUA,CAAE,EAE3B,IAAIsE,EAAYwB,GAAa/F,CAAI,EAC7BiL,EAAiBnF,GAAkB9F,CAAI,EACvCxB,EAAKkM,GAAqB1K,CAAI,EAAGkL,EAAc1M,EAAG,KAAMqM,EAAOrM,EAAG,KACtE,GAAI0M,EAAY,SAAW,EACvB,OAAOrO,GAAK,CAAA,EAAI0H,CAAS,EAE7B,IAAIjJ,EAAS,IAAI0G,GAAWmJ,GAAkBD,EAAa3G,EAAWsG,EAE9D,SAAUE,EAAQ,CAAE,OAAOD,GAAaD,EAAME,CAAM,CAAI,EAExDtJ,EAAQ,CAAC,EACjB,OAAOwJ,EAAiB3P,EAAO,KAAKgP,GAAiBW,CAAc,CAAC,EAAI3P,CAC5E,CACO,SAAS6P,GAAkBD,EAAa3G,EAAW6G,EAAgB,CACtE,OAAIA,IAAmB,SAAUA,EAAiB3J,IAC3C,SAAUU,EAAY,CACzBkJ,GAAc9G,EAAW,UAAY,CAyBjC,QAxBI+G,EAASJ,EAAY,OACrBH,EAAS,IAAI,MAAMO,CAAM,EACzBC,EAASD,EACTE,EAAuBF,EACvBG,EAAU,SAAUnP,EAAG,CACvB+O,GAAc9G,EAAW,UAAY,CACjC,IAAIlC,EAASxF,GAAKqO,EAAY5O,CAAC,EAAGiI,CAAS,EACvCmH,EAAgB,GACpBrJ,EAAO,UAAUW,GAAyBb,EAAY,SAAUpH,EAAO,CACnEgQ,EAAOzO,CAAC,EAAIvB,EACP2Q,IACDA,EAAgB,GAChBF,KAECA,GACDrJ,EAAW,KAAKiJ,EAAeL,EAAO,MAAK,CAAE,CAAC,CAE1E,EAAuB,UAAY,CACN,EAAEQ,GACHpJ,EAAW,SAAQ,CAE1B,CAAA,CAAC,CACL,EAAEA,CAAU,CAC7B,EACqB7F,EAAI,EAAGA,EAAIgP,EAAQhP,IACxBmP,EAAQnP,CAAC,CAEhB,EAAE6F,CAAU,CACrB,CACA,CACA,SAASkJ,GAAc9G,EAAWoH,EAASvH,EAAc,CACjDG,EACA2D,GAAgB9D,EAAcG,EAAWoH,CAAO,EAGhDA,EAAAA,CAER,CCjEO,SAASC,GAAevJ,EAAQF,EAAYgI,EAAS0B,EAAYC,EAAcC,EAAQC,EAAmBC,EAAqB,CAClI,IAAIC,EAAS,CAAA,EACTX,EAAS,EACTnN,EAAQ,EACR+N,EAAa,GACbC,EAAgB,UAAY,CACxBD,GAAc,CAACD,EAAO,QAAU,CAACX,GACjCpJ,EAAW,SAAQ,CAE/B,EACQkK,EAAY,SAAUtR,EAAO,CAAE,OAAQwQ,EAASM,EAAaS,EAAWvR,CAAK,EAAImR,EAAO,KAAKnR,CAAK,CAAG,EACrGuR,EAAa,SAAUvR,EAAO,CAC9BgR,GAAU5J,EAAW,KAAKpH,CAAK,EAC/BwQ,IACA,IAAIgB,EAAgB,GACpBtF,GAAUkD,EAAQpP,EAAOqD,GAAO,CAAC,EAAE,UAAU4E,GAAyBb,EAAY,SAAUqK,EAAY,CACxCV,IAAaU,CAAU,EAC/ET,EACAM,EAAUG,CAAU,EAGpBrK,EAAW,KAAKqK,CAAU,CAE1C,EAAW,UAAY,CACXD,EAAgB,EACnB,EAAE,OAAW,UAAY,CACtB,GAAIA,EACA,GAAI,CACAhB,IAUA,QATIE,EAAU,UAAY,CACtB,IAAIgB,EAAgBP,EAAO,MAAA,EACvBF,EACA9D,GAAgB/F,EAAY6J,EAAmB,UAAY,CAAE,OAAOM,EAAWG,CAAa,CAAE,CAAE,EAGhGH,EAAWG,CAAa,CAEpD,EAC2BP,EAAO,QAAUX,EAASM,GAC7BJ,EAAAA,EAEJW,EAAAA,CACH,OACMpO,EAAK,CACRmE,EAAW,MAAMnE,CAAG,CACvB,CAER,CAAA,CAAC,CACV,EACI,OAAAqE,EAAO,UAAUW,GAAyBb,EAAYkK,EAAW,UAAY,CACzEF,EAAa,GACbC,EAAAA,CACH,CAAA,CAAC,EACK,UAAY,CAC2DH,IAAAA,CAClF,CACA,CCtDO,SAASS,GAASvC,EAASc,EAAgBY,EAAY,CAE1D,OADIA,IAAe,SAAUA,EAAa,KACtCrO,GAAWyN,CAAc,EAClByB,GAAS,SAAUvP,EAAGb,EAAG,CAAE,OAAO4N,GAAI,SAAU7P,EAAGsS,EAAI,CAAE,OAAO1B,EAAe9N,EAAG9C,EAAGiC,EAAGqQ,CAAE,CAAA,CAAI,EAAE1F,GAAUkD,EAAQhN,EAAGb,CAAC,CAAC,CAAC,CAAI,EAAEuP,CAAU,GAE1I,OAAOZ,GAAmB,WAC/BY,EAAaZ,GAEVpI,GAAQ,SAAUR,EAAQF,EAAY,CAAE,OAAOyJ,GAAevJ,EAAQF,EAAYgI,EAAS0B,CAAU,CAAI,CAAA,EACpH,CCZO,SAASe,GAASf,EAAY,CACjC,OAAIA,IAAe,SAAUA,EAAa,KACnCa,GAASjL,GAAUoK,CAAU,CACxC,CGDO,SAASgB,GAAMC,EAASC,EAAqBC,EAAW,CACvDF,IAAY,SAAUA,EAAU,GAChCE,IAAc,SAAUA,EAAYC,IACxC,IAAIC,EAAmB,GACvB,OAAIH,GAAuB,OACnBI,GAAYJ,CAAmB,EAC/BC,EAAYD,EAGZG,EAAmBH,GAGpB,IAAIK,GAAW,SAAUC,EAAY,CACxC,IAAIC,EAAMC,GAAYT,CAAO,EAAI,CAACA,EAAUE,EAAU,IAAK,EAAGF,EAC1DQ,EAAM,IACNA,EAAM,GAEV,IAAIE,EAAI,EACR,OAAOR,EAAU,SAAS,UAAY,CAC7BK,EAAW,SACZA,EAAW,KAAKG,GAAG,EACf,GAAKN,EACL,KAAK,SAAS,OAAWA,CAAgB,EAGzCG,EAAW,SAAQ,EAG9B,EAAEC,CAAG,CACd,CAAK,CACL,CC7BO,SAASG,IAAQ,CAEpB,QADIC,EAAO,CAAA,EACFC,EAAK,EAAGA,EAAK,UAAU,OAAQA,IACpCD,EAAKC,CAAE,EAAI,UAAUA,CAAE,EAE3B,IAAIX,EAAYY,GAAaF,CAAI,EAC7BG,EAAaC,GAAUJ,EAAM,GAAQ,EACrCK,EAAUL,EACd,OAAQK,EAAQ,OAGVA,EAAQ,SAAW,EAEbC,GAAUD,EAAQ,CAAC,CAAC,EAEpBE,GAASJ,CAAU,EAAEK,GAAKH,EAASf,CAAS,CAAC,EALjDmB,EAMZ,CCnBO,SAASC,GAAOC,EAAWC,EAAS,CACvC,OAAOC,GAAQ,SAAUC,EAAQnB,EAAY,CACzC,IAAIoB,EAAQ,EACZD,EAAO,UAAUE,GAAyBrB,EAAY,SAAUsB,EAAO,CAAE,OAAON,EAAU,KAAKC,EAASK,EAAOF,GAAO,GAAKpB,EAAW,KAAKsB,CAAK,CAAI,CAAA,CAAC,CAC7J,CAAK,CACL,CCJO,SAASC,GAAWC,EAAU,CACjC,OAAON,GAAQ,SAAUC,EAAQnB,EAAY,CACzC,IAAIyB,EAAW,KACXC,EAAY,GACZC,EACJF,EAAWN,EAAO,UAAUE,GAAyBrB,EAAY,OAAW,OAAW,SAAU4B,EAAK,CAClGD,EAAgBhB,GAAUa,EAASI,EAAKL,GAAWC,CAAQ,EAAEL,CAAM,CAAC,CAAC,EACjEM,GACAA,EAAS,YAAW,EACpBA,EAAW,KACXE,EAAc,UAAU3B,CAAU,GAGlC0B,EAAY,EAEnB,CAAA,CAAC,EACEA,IACAD,EAAS,YAAW,EACpBA,EAAW,KACXE,EAAc,UAAU3B,CAAU,EAE9C,CAAK,CACL,CEvBO,SAAS6B,GAAeC,EAAc,CACzC,OAAOC,GAAQ,SAAUC,EAAQC,EAAY,CACzC,IAAIC,EAAW,GACfF,EAAO,UAAUG,GAAyBF,EAAY,SAAUG,EAAO,CACnEF,EAAW,GACXD,EAAW,KAAKG,CAAK,CACjC,EAAW,UAAY,CACNF,GACDD,EAAW,KAAKH,CAAY,EAEhCG,EAAW,SAAQ,CACtB,CAAA,CAAC,CACV,CAAK,CACL,CCZO,SAASI,GAAKC,EAAO,CACxB,OAAOA,GAAS,EAER,UAAY,CAAE,OAAOC,EAAQ,EAC/BR,GAAQ,SAAUC,EAAQC,EAAY,CACpC,IAAIO,EAAO,EACXR,EAAO,UAAUG,GAAyBF,EAAY,SAAUG,EAAO,CAC/D,EAAEI,GAAQF,IACVL,EAAW,KAAKG,CAAK,EACjBE,GAASE,GACTP,EAAW,SAAQ,EAG9B,CAAA,CAAC,CACd,CAAS,CACT,CKdO,SAASQ,GAASC,EAAaC,EAAS,CAC3C,OAAOC,GAAQ,SAAUC,EAAQC,EAAY,CACzC,IAAIC,EAAe,IAAI,IACvBF,EAAO,UAAUG,GAAyBF,EAAY,SAAUG,EAAO,CACnE,IAAIC,EAAMR,EAAcA,EAAYO,CAAK,EAAIA,EACxCF,EAAa,IAAIG,CAAG,IACrBH,EAAa,IAAIG,CAAG,EACpBJ,EAAW,KAAKG,CAAK,EAE5B,CAAA,CAAC,EACFN,GAAWQ,GAAUR,CAAO,EAAE,UAAUK,GAAyBF,EAAY,UAAY,CAAE,OAAOC,EAAa,MAAK,CAAG,EAAIK,EAAI,CAAC,CACxI,CAAK,CACL,CCbO,SAASC,GAAqBC,EAAYZ,EAAa,CAC1D,OAAIA,IAAgB,SAAUA,EAAca,IAC5CD,EAAaA,GAA4DE,GAClEZ,GAAQ,SAAUC,EAAQC,EAAY,CACzC,IAAIW,EACAC,EAAQ,GACZb,EAAO,UAAUG,GAAyBF,EAAY,SAAUG,EAAO,CACnE,IAAIU,EAAajB,EAAYO,CAAK,GAC9BS,GAAS,CAACJ,EAAWG,EAAaE,CAAU,KAC5CD,EAAQ,GACRD,EAAcE,EACdb,EAAW,KAAKG,CAAK,EAE5B,CAAA,CAAC,CACV,CAAK,CACL,CACA,SAASO,GAAeI,EAAGC,EAAG,CAC1B,OAAOD,IAAMC,CACjB,CClBO,SAASC,GAAaC,EAAc,CACvC,OAAIA,IAAiB,SAAUA,EAAeC,IACvCpB,GAAQ,SAAUC,EAAQC,EAAY,CACzC,IAAImB,EAAW,GACfpB,EAAO,UAAUG,GAAyBF,EAAY,SAAUG,EAAO,CACnEgB,EAAW,GACXnB,EAAW,KAAKG,CAAK,CACxB,EAAE,UAAY,CAAE,OAAQgB,EAAWnB,EAAW,SAAU,EAAGA,EAAW,MAAMiB,EAAY,CAAE,CAAG,CAAE,CAAC,CACzG,CAAK,CACL,CACA,SAASC,IAAsB,CAC3B,OAAO,IAAIE,EACf,CCdO,SAASC,GAASC,EAAU,CAC/B,OAAOxB,GAAQ,SAAUC,EAAQC,EAAY,CACzC,GAAI,CACAD,EAAO,UAAUC,CAAU,CAC9B,QAAA,CAEGA,EAAW,IAAIsB,CAAQ,CAC1B,CACT,CAAK,CACL,CCJO,SAASV,GAAMW,EAAWC,EAAc,CAC3C,IAAIC,EAAkB,UAAU,QAAU,EAC1C,OAAO,SAAU1B,EAAQ,CACrB,OAAOA,EAAO,KAAKwB,EAAYG,GAAO,SAAUC,EAAGC,EAAG,CAAE,OAAOL,EAAUI,EAAGC,EAAG7B,CAAM,CAAI,CAAA,EAAIU,GAAUoB,GAAK,CAAC,EAAGJ,EAAkBK,GAAeN,CAAY,EAAIR,GAAa,UAAY,CAAE,OAAO,IAAII,EAAa,CAAE,CAAC,CAC/N,CACA,CGRO,SAASW,GAAUC,EAASC,EAAgB,CAC/C,OAAOC,GAAQ,SAAUC,EAAQC,EAAY,CACzC,IAAIC,EAAkB,KAClBC,EAAQ,EACRC,EAAa,GACbC,EAAgB,UAAY,CAAE,OAAOD,GAAc,CAACF,GAAmBD,EAAW,SAAU,CAAA,EAChGD,EAAO,UAAUM,GAAyBL,EAAY,SAAUM,EAAO,CACDL,GAAgB,YAAA,EAClF,IAAIM,EAAa,EACbC,EAAaN,IACjBO,GAAUb,EAAQU,EAAOE,CAAU,CAAC,EAAE,UAAWP,EAAkBI,GAAyBL,EAAY,SAAUU,EAAY,CAAE,OAAOV,EAAW,KAAKH,EAAiBA,EAAeS,EAAOI,EAAYF,EAAYD,GAAY,EAAIG,CAAU,CAAI,EAAE,UAAY,CAC9PT,EAAkB,KAClBG,EAAAA,CACH,CAAA,CAAA,CACb,EAAW,UAAY,CACXD,EAAa,GACbC,EAAAA,CACH,CAAA,CAAC,CACV,CAAK,CACL,CCpBO,SAASO,IAAY,CACxB,OAAOhB,GAAUiB,EAAQ,CAC7B,CCAO,SAASC,GAAUC,EAAU,CAChC,OAAOhB,GAAQ,SAAUC,EAAQC,EAAY,CACzCS,GAAUK,CAAQ,EAAE,UAAUT,GAAyBL,EAAY,UAAY,CAAE,OAAOA,EAAW,SAAU,CAAA,EAAKe,EAAI,CAAC,EACvH,CAACf,EAAW,QAAUD,EAAO,UAAUC,CAAU,CACzD,CAAK,CACL,CCPO,SAASgB,GAAUC,EAAWC,EAAW,CAC5C,OAAIA,IAAc,SAAUA,EAAY,IACjCpB,GAAQ,SAAUC,EAAQC,EAAY,CACzC,IAAIE,EAAQ,EACZH,EAAO,UAAUM,GAAyBL,EAAY,SAAUM,EAAO,CACnE,IAAIa,EAASF,EAAUX,EAAOJ,GAAO,GACpCiB,GAAUD,IAAclB,EAAW,KAAKM,CAAK,EAC9C,CAACa,GAAUnB,EAAW,SAAA,CACzB,CAAA,CAAC,CACV,CAAK,CACL,CCRO,SAASoB,GAAIC,EAAgBC,EAAOC,EAAU,CACjD,IAAIC,EAAcC,GAAWJ,CAAc,GAAKC,GAASC,EAEjD,CAAE,KAAMF,EAAgB,MAAOC,EAAO,SAAUC,CAAU,EAC5DF,EACN,OAAOG,EACD1B,GAAQ,SAAUC,EAAQC,EAAY,CACpC,IAAI0B,GACHA,EAAKF,EAAY,aAAe,MAAQE,IAAO,QAAkBA,EAAG,KAAKF,CAAW,EACrF,IAAIG,EAAU,GACd5B,EAAO,UAAUM,GAAyBL,EAAY,SAAUM,EAAO,CACnE,IAAIoB,GACHA,EAAKF,EAAY,QAAU,MAAQE,IAAO,QAAkBA,EAAG,KAAKF,EAAalB,CAAK,EACvFN,EAAW,KAAKM,CAAK,CACrC,EAAe,UAAY,CACX,IAAIoB,EACJC,EAAU,IACTD,EAAKF,EAAY,YAAc,MAAQE,IAAO,QAAkBA,EAAG,KAAKF,CAAW,EACpFxB,EAAW,SAAQ,CACtB,EAAE,SAAU4B,EAAK,CACd,IAAIF,EACJC,EAAU,IACTD,EAAKF,EAAY,SAAW,MAAQE,IAAO,QAAkBA,EAAG,KAAKF,EAAaI,CAAG,EACtF5B,EAAW,MAAM4B,CAAG,CACpC,EAAe,UAAY,CACX,IAAIF,EAAIG,EACJF,KACCD,EAAKF,EAAY,eAAiB,MAAQE,IAAO,QAAkBA,EAAG,KAAKF,CAAW,IAE1FK,EAAKL,EAAY,YAAc,MAAQK,IAAO,QAAkBA,EAAG,KAAKL,CAAW,CACvF,CAAA,CAAC,CACd,CAAS,EAEGZ,EACZ,CCQO,SAASkB,GACdC,EAC6B,CAC7B,OAAOC,GAAoB,CAAC,CAAE,MAAAC,CAAAA,IAAYA,EAAM,GAAIF,CAAO,CAC7D,CAkSO,SAASG,GACdC,EAC6B,CACtB,OAAAC,GAAS,CAACC,EAAQC,IACvBC,GAAKJ,EAAUE,EAAQC,CAAK,CAAC,EAAE,KAC7BF,GAAUI,GAAYA,EAASC,GAAGJ,CAAM,EAAIK,EAAM,CACpD,CAAA,CAEJ,CAKO,SAASC,GACdC,EAC6B,CACtB,OAAAC,GACLC,GAAQF,CAAI,EACZG,GAAYC,GAAmB,CAC7B,GAAIA,aAAiBC,GACZ,OAAAP,GAED,MAAAM,CACR,CACD,CAAA,CAEL,CA6BgB,SAAAE,GACdC,EACAC,EACwB,CAClB,GAAA,CAAE,IAAAC,CAAAA,EAAQC,GAAKF,EAAS,CAAE,IAAK,EAAA,CAAO,EACrC,OAAAG,GAAQC,GAAWC,GAAID,EAAO,QAAUL,EAAOE,CAAG,CAAC,CAC5D,CAqBA,SAASK,GAAIC,EAAYC,EAAY,CACnC,MAAQ,CAACD,GAAKC,GAAOD,GAAK,CAACC,CAC7B,CCnaO,IAAMC,GAAN,KAAgB,CAQrB,YAAYC,EAIT,CAXKC,EAAA,KAAA,OAAA,EACAA,EAAA,KAAA,QAAA,EACAA,EAAA,KAAA,eAAA,EACAA,EAAA,KAAA,WAAA,IAAe,GAAA,EACfA,EAAA,KAAA,cAAc,IAAIC,CAAAA,EAClBD,EAAA,KAAA,WAAW,EAAA,EAOjB,KAAK,MAAQD,EAAO,MACpB,KAAK,OAASA,EAAO,OACrB,KAAK,cAAgBA,EAAO,cAE5B,IAAMG,EAAW,KAAK,MAAM,gBAAA,EAAkB,UAAWC,GAAW,CAC5D,GAAA,CAAE,QAAAC,EAAS,GAAAC,CAAO,EAAAF,EAEnB,KAAK,SAAS,IAAIC,CAAO,IAIzB,KAAA,SAAS,OAAOA,CAAO,EACvB,KAAA,YAAY,KAAKC,CAAE,EAEnBA,IACHH,EAAS,YAAY,EACrBI,EAAW,YAAY,GACzB,CACD,EAEKA,EAAa,KAAK,MACrB,kBAAA,EACA,UAAU,CAAC,CAAE,UAAAC,CAAAA,IAAgB,CAC5B,KAAK,UAAUA,CAAS,CAAA,CACzB,CACL,CAEA,yBAA0B,CACjB,OAAA,KAAK,YAAY,aAAA,CAC1B,CAEA,MAAc,UAAUA,EAAkC,CACpD,GAAA,CACF,IAAMC,EAAQ,MAAM,KAAK,OAAO,UAAU,CACxC,KAAM,MACN,QAAS,GACT,KAAM,CACJ,CAAC,QAAS,KAAK,MAAM,GAAG,EACxB,CAAC,YAAaD,CAAS,CACzB,CAAA,CACD,EAEI,KAAA,SAAS,IAAIC,EAAM,EAAE,EAC1B,KAAK,MAAM,KAAK,CAAC,OAAQA,CAAK,CAAC,CAAA,MACzB,CAER,CACF,CAEA,IAAY,QAAS,CACnB,OAAO,KAAK,cAAc,QAAU,KAAK,OAAO,MAClD,CAEA,SAAU,CACH,KAAA,OAAO,OAAO,EAAA,CACrB,CAEA,CAAC,OAAO,OAAO,GAAU,CACvB,GAAI,KAAK,SACP,OAGF,KAAK,SAAW,GAEV,IAAAC,EAAW,CAAC,KAAK,WAAW,EAClC,QAAWC,KAAOD,EAChBC,EAAI,SAAS,CAEjB,CACF,ECrFaC,GAAN,cAA6BC,EAAwB,CAC1D,YAAYC,EAAgB,CAC1B,MAAMA,GAAS,CAAC,CAClB,CAEA,WAAY,CACV,KAAK,KAAK,KAAK,SAAS,EAAI,CAAC,CAC/B,CACA,WAAY,CACV,KAAK,KAAK,KAAK,SAAS,EAAI,CAAC,CAC/B,CACA,KAAKjB,EAAqC,CACpC,OAAOA,GAAM,SACf,MAAM,KAAKA,CAAC,EAEZ,MAAM,KAAKA,EAAE,KAAK,SAAA,CAAU,CAAC,CAEjC,CACF,EAEakB,GAAN,cAAsCb,CAAW,CACtD,UAAW,CACT,OAAOc,GAAe,KAAK,KAAKC,GAAA,CAAO,CAAC,CAC1C,CACF,EClBaC,GAAN,KAAmB,CASxB,YAAYlB,EAAiE,CARrEC,EAAA,KAAA,OAAA,EACAA,EAAA,KAAA,WAAA,EACAA,EAAA,KAAA,OAAA,IAAW,GAAA,EACXA,EAAA,KAAA,mBAAA,IAAuB,GAAA,EACvBA,EAAA,KAAA,SAAS,IAAIW,GAAe,CAAC,CAAA,EAC7BX,EAAA,KAAA,MAAM,IAAIC,CAAAA,EACVD,EAAA,KAAA,WAAW,EAAA,E/Gfd,IAAAkB,E+GkBH,KAAK,MAAQnB,EAAO,MACpB,KAAK,UAAYA,EAAO,UAGxB,KAAK,MAAM,yBAA2B,EAAA,UAAWoB,GAAmB,CAClE,OAAW,CAACC,EAAMZ,CAAK,IAAKW,EACtBC,IAAS,SAIT,KAAK,KAAK,IAAIZ,EAAM,EAAE,GACxB,KAAK,UAAUA,CAAK,CAExB,CACD,EAKD,KAAK,MAAM,gBAAkB,EAAA,UAAU,MAAOa,GAAW,CACjD,GAAA,CAAE,QAAAjB,EAAS,OAAAkB,CAAW,EAAAD,EACd,KAAK,KAAK,IAAIjB,CAAO,IAK/B,KAAK,WAAakB,GAAA,MAAAA,EAAQ,WAAW,gBAAA,GAClC,KAAA,iBAAiB,IAAIlB,CAAO,EACjC,KAAK,IAAI,KAAK,CAAE,GAAGiB,EAAQ,KAAM,EAAA,CAAO,IAExC,KAAK,IAAI,KAAK,CACZ,GAAGA,EACH,KAAM,EAAA,CACP,EACD,KAAK,UAAUjB,CAAO,GACxB,CACD,GAEDc,EAAA,KAAK,YAAL,MAAAA,EAAgB,wBAAA,EAA0B,UAAWb,GAAO,CAC1D,GAAIA,EACS,QAAAD,KAAW,KAAK,iBAAkB,CAC3C,IAAMI,EAAQ,KAAK,KAAK,IAAIJ,CAAO,EAC/BI,GACF,KAAK,UAAUA,CAAK,CAExB,KAEW,SAAAJ,KAAW,KAAK,iBACzB,KAAK,UAAUA,CAAO,EAI1B,KAAK,iBAAiB,MAAA,CAAM,CAAA,CAEhC,CAEA,MAAM,QAAQI,EAAmC,CAC/C,GAAI,CAAA,KAAK,SAIT,OAAK,KAAK,KAAK,IAAIA,EAAM,EAAE,IACzB,KAAK,KAAK,IAAIA,EAAM,GAAIA,CAAK,EAC7B,KAAK,OAAO,UAAA,GAGP,KAAK,UAAUA,CAAK,CAC7B,CAEA,UAAUJ,EAAuB,CAC3B,KAAK,UAIJ,KAAK,KAAK,IAAIA,CAAO,IACnB,KAAA,KAAK,OAAOA,CAAO,EACxB,KAAK,OAAO,UAAA,EAEhB,CAEA,6BAAgE,CACvD,OAAA,KAAK,IAAI,aAAA,CAClB,CAEA,oCAAyD,CAChD,OAAA,KAAK,OAAO,aAAA,CACrB,CAEA,SAAU,CACH,KAAA,OAAO,OAAO,EAAA,CACrB,CAEA,CAAC,OAAO,OAAO,GAAU,CACvB,GAAI,KAAK,SACP,OAGF,KAAK,SAAW,GAEhB,IAAMK,EAAW,CAAC,KAAK,OAAQ,KAAK,GAAG,EACvC,QAAWC,KAAOD,EAChBC,EAAI,SAAS,CAEjB,CAEQ,UAAUF,EAAoB,CACpC,OAAO,KAAK,MAAM,KAAK,CAAC,QAASA,CAAK,CAAC,CACzC,CACF,EClFae,GAAa,CACxB,WAAY,EACZ,KAAM,EACN,QAAS,EACT,OAAQ,CACV,ECTaC,GAAN,KAAsB,CAuB3B,YACSC,EACCC,EACR,CAzBM1B,EAAA,KAAA,SAA4B,IAAA,EAC5BA,EAAA,KAAA,SAAqC,CAAA,CAAA,EACrCA,EAAA,KAAA,SAAqC,CAAA,CAAA,EACrCA,EAAA,KAAA,eAAe,IAAIC,CAAAA,EACnBD,EAAA,KAAA,YAAY,IAAIC,CAAAA,EAChBD,EAAA,KAAA,WAAW,IAAIC,CAAAA,EACfD,EAAA,KAAA,SAAS,IAAIC,CAAAA,EACbD,EAAA,KAAA,aAAkC,IAAA,EAClCA,EAAA,KAAA,iBAAiB,IAAIc,EAAAA,EAErBd,EAAA,KAAA,WAAW,EAAA,EAEXA,EAAA,KAAA,SAAS,IAAIC,CAAAA,EACbD,EAAA,KAAA,SAA0B,aAAA,EAUzB,KAAA,IAAAyB,EACC,KAAA,OAAAC,EAGHA,EAAO,gBACVC,GAAc,WAAWF,CAAG,EAG9B,KAAK,SAAS,aAAa,CAC7B,CAlBA,IAAI,OAAyB,CAC3B,OAAO,KAAK,MACd,CACQ,SAASG,EAAwB,CACvC,KAAK,OAASA,EACT,KAAA,OAAO,KAAKA,CAAK,CACxB,CAcA,iBAAkB,CAChB,KAAK,QAAQ,CACf,CACQ,QAAQC,EAAqB,CAC/B,GAAA,KAAK,QAAU,aACjB,OAGI,IAAAC,EAAU,OAAOD,GAAe,UAEpC,KAAK,QAAU,eACf,KAAK,QAAU,WACf,KAAK,QAAU,SACf,KAAK,QAAU,YACfC,KAKF,KAAK,OAAS,KAAK,aAAaD,GAAc,CAAC,EACjD,CACQ,aAAaA,EAAoB,CACvC,IAAME,EAAcF,EAAa,EAC3BG,EAAgB,KAAK,QAAU,SAAW,KAAK,QAAU,WAE3DD,EACF,KAAK,SAAS,UAAU,EAExB,KAAK,SAAS,YAAY,EAG5B,IAAME,EAAS,SAAY,CACrB,GAAA,KAAK,QAAU,aAAc,CACxBC,EAAA,MAAMC,GAAmB,iBAAiB,EACjD,MACF,CAEA,KAAK,SAAS,WAAW,GAErBJ,GAAeC,KACZ,KAAA,aAAa,KAAK,KAAK,MAAM,EAClC,KAAK,OAAS,CAAA,GAGZ,GAAA,CACS,QAAAI,KAAW,KAAK,OACzB,KAAK,KAAKA,CAAO,CAAA,OAEZC,EAAK,CACP,KAAA,OAAO,KAAKA,CAAG,CAAA,QAAA,CAEpB,KAAK,OAAS,CAAA,CAChB,CAAA,EAEIC,EAAY,CAAC,CAAE,KAAAC,CAAAA,IAA0B,CACzC,GAAA,KAAK,QAAU,aAIf,GAAA,CACG,KAAA,SAAS,KAAK,KAAK,KAAK,KAAK,MAAMA,CAAI,CAAC,CAAC,CAAA,OACvCF,EAAK,CACP,KAAA,OAAO,KAAKA,CAAG,CACtB,CAAA,EAEIG,EAAU,CAAC,CAAE,KAAAC,CAAAA,IAAwB,CjH5IxC,IAAAvB,EiHoJD,GAPOgB,EAAA,oBAAoB,OAAQD,CAAM,EAClCC,EAAA,oBAAoB,UAAWI,CAAS,EACxCJ,EAAA,oBAAoB,QAASM,CAAO,EACvC,KAAK,SAAWN,IAClB,KAAK,OAAS,MAId,KAAK,QAAU,cACfO,IAASN,GAAmB,kBAC5B,CACA,KAAK,OAAS,CAAA,EACd,KAAK,OAAS,CAAA,EACd,MACF,CAEI,GAAAM,IAASN,GAAmB,cAC9B,KAAK,SAAS,SAAS,EAEnB,KAAK,OAAO,OAAS,GACvB,KAAK,QAAQ,UAENM,IAASN,GAAmB,WACrC,KAAK,OAAS,CAAA,EACd,KAAK,OAAS,CAAA,EAEd,KAAK,OAAO,KAAK,IAAIO,GAAsBD,CAAI,CAAC,EAChD,KAAK,SAAS,UAAU,MACnB,CACL,KAAK,OAAO,KAAK,GAAG,KAAK,MAAM,EAC/B,KAAK,OAAS,CAAA,EAEd,KAAK,OAAO,KAAK,IAAIC,GAAsBD,CAAI,CAAC,EAEhD,IAAME,EAAYd,EAAa,EAE7B,KAAK,OAAO,MAAM,WAAa,OAC/Bc,GAAa,KAAK,OAAO,MAAM,UAG/B,KAAK,SAAS,sBAAsB,GAEpCzB,EAAA,KAAK,aAAL,MAAAA,EAAiB,YAAA,EACjB,KAAK,WAAa0B,GAAW,KAAK,OAAO,MAAOD,CAAS,EAAE,UACzD,IAAM,CACC,KAAK,UACR,KAAK,QAAQA,CAAS,CAE1B,CAAA,GAGF,KAAK,SAAS,OAAO,CAEzB,CAAA,EAGIE,EACJ,KAAK,OAAO,eAAiB,WAAW,UAE1C,GAAI,CAACA,EACG,MAAA,IAAIC,GAAyB,kCAAkC,EAGvE,IAAMZ,EAAqB,IAAIW,EAAU,KAAK,GAAG,EAE1C,OAAAX,EAAA,iBAAiB,OAAQD,CAAM,EAC/BC,EAAA,iBAAiB,UAAWI,CAAS,EACrCJ,EAAA,iBAAiB,QAASM,CAAO,EAEjCN,CACT,CACQ,KAAKE,EAAmD,CACxD,IAAAhB,EAAOgB,EAAQ,CAAC,EAChBW,EAAO,KAAK,IAElB,OAAQ3B,EAAM,CACZ,IAAK,QACI,MAAA,CACL,KAAA2B,EACA,KAAA3B,EACA,QAAAgB,EACA,MAAOA,EAAQ,CAAC,EAChB,MAAOA,EAAQ,CAAC,CAAA,EAEpB,IAAK,OACI,MAAA,CACL,KAAAW,EACA,KAAA3B,EACA,QAAAgB,EACA,MAAOA,EAAQ,CAAC,CAAA,EAEpB,IAAK,KACI,MAAA,CACL,KAAAW,EACA,KAAA3B,EACA,QAAAgB,EACA,QAASA,EAAQ,CAAC,EAClB,GAAIA,EAAQ,CAAC,EACb,OAAQA,EAAQ,CAAC,CAAA,EAErB,IAAK,SACI,MAAA,CACL,KAAAW,EACA,KAAA3B,EACA,QAAAgB,EACA,MAAOA,EAAQ,CAAC,EAChB,OAAQA,EAAQ,CAAC,CAAA,EAErB,IAAK,SACI,MAAA,CACL,KAAAW,EACA,KAAA3B,EACA,QAAAgB,EACA,OAAQA,EAAQ,CAAC,CAAA,EAErB,IAAK,OACI,MAAA,CACL,KAAAW,EACA,KAAA3B,EACA,QAAAgB,EACA,UAAWA,EAAQ,CAAC,CAAA,EAExB,IAAK,QACI,MAAA,CACL,KAAAW,EACA,KAAA3B,EACA,QAAAgB,EACA,MAAOA,EAAQ,CAAC,EAChB,MAAOA,EAAQ,CAAC,CAAA,EAEpB,QACS,MAAA,CACL,KAAAW,EACA,KAAM,UACN,QAAAX,CAAA,CAEN,CACF,CAEA,WAAWK,EAAgC,CjHxRtC,IAAAvB,IiHyRCA,EAAA,KAAK,SAAL,KAAA,OAAAA,EAAa,cAAeK,GAAW,MACpC,KAAA,OAAO,MAAMkB,CAAI,CAE1B,CAEA,KAAKL,EAAkD,CAC/C,IAAAY,EAAO,KAAK,eAAe,SAAS,EAE1C,OAAQ,KAAK,MAAO,CAClB,IAAK,aACL,IAAK,WACH,OAAA,KAAK,eAAe,KAAA,EACbA,EAET,IAAK,cACL,IAAK,aACL,IAAK,UACE,OAAA,KAAA,OAAO,KAAKZ,CAAO,EACxB,KAAK,QAAQ,EACNY,EAET,IAAK,YAAa,CACZ,GAAA,CAAC,KAAK,OACR,MAAM,IAAIC,GAGZ,OAAI,KAAK,OAAO,aAAe1B,GAAW,MACxC,KAAK,UAAU,KAAK,CAAE,GAAI,KAAK,IAAK,QAAAa,CAAAA,CAAS,EAC7C,KAAK,OAAO,KAAK,KAAK,UAAUA,CAAO,CAAC,EACxC,KAAK,eAAe,KAAA,EACbY,IAEF,KAAA,OAAO,KAAKZ,CAAO,EAEnBY,EACT,CACA,IAAK,uBACL,IAAK,WACL,IAAK,QACH,OAAA,KAAK,eAAe,KAAA,EACf,KAAA,OAAO,KAAKZ,CAAO,EACjBY,CAEX,CACF,CAEA,oBAA8C,CAC5C,OAAO,KAAK,SAAS,KACnBE,GAAQC,GAAwBA,EAAE,OAAS,OAAO,CAAA,CAEtD,CACA,mBAA4C,CAC1C,OAAO,KAAK,SAAS,KACnBD,GAAQC,GAAuBA,EAAE,OAAS,MAAM,CAAA,CAEpD,CACA,qBAAgD,CAC9C,OAAO,KAAK,SAAS,KACnBD,GAAQC,GAAyBA,EAAE,OAAS,QAAQ,CAAA,CAExD,CACA,iBAAwC,CAC/B,OAAA,KAAK,SAAS,KAAKD,GAAQC,GAAqBA,EAAE,OAAS,IAAI,CAAC,CACzE,CACA,mBAA4C,CAC1C,OAAO,KAAK,SAAS,KACnBD,GAAQC,GAAuBA,EAAE,OAAS,MAAM,CAAA,CAEpD,CACA,yBAAqD,CAC5C,OAAA,KAAK,SAAS,aAAA,CACvB,CAEA,8BAAkE,CACzD,OAAA,KAAK,UAAU,aAAA,CACxB,CACA,0BAAmE,CAC1D,OAAA,KAAK,aAAa,aAAA,CAC3B,CACA,8BAAkE,CAChE,OAAO,KAAK,OAAO,KACjBC,GAAqB,EACrBC,GAAKzB,IAAW,CACd,KAAM,KAAK,IACX,MAAAA,CAAA,EACA,CAAA,CAEN,CACA,oBAA0C,CACjC,OAAA,KAAK,OAAO,aAAA,CACrB,CAEA,SAAU,CACH,KAAA,OAAO,OAAO,EAAA,CACrB,CAEA,CAAC,OAAO,OAAO,GAAU,CjHzXpB,IAAAV,EAAAoC,EiH0XH,GAAI,KAAK,SACP,OAEF,KAAK,SAAW,GAChB,KAAK,SAAS,YAAY,GAE1BpC,EAAA,KAAK,aAAL,MAAAA,EAAiB,YAAA,GAEZoC,EAAA,KAAA,SAAA,MAAAA,EAAQ,MAAMnB,GAAmB,iBAAA,EACtC,KAAK,OAAS,KAEd,IAAM1B,EAAW,CACf,KAAK,OACL,KAAK,UACL,KAAK,SACL,KAAK,OACL,KAAK,aACL,KAAK,cAAA,EAEP,QAAWC,KAAOD,EAChBC,EAAI,SAAS,CAEjB,CACF,EAEA,SAASkC,GAAWlB,EAAqBb,EAAe,CACtD,OAAQa,EAAO,SAAU,CACvB,IAAK,cAAe,CAClB,IAAM6B,EAAO,KAAK,IAChB7B,EAAO,aAAe,IAAMb,EAAQ,IAAM,KAAK,OAAA,EAAW,IAAO,IACjE,GAAA,EAEF,OAAO2C,GAAMD,CAAI,CACnB,CACA,IAAK,cACH,OAAOE,GAAG,CAAC,EACb,IAAK,SACI,OAAAD,GAAM9B,EAAO,QAAQ,EAC9B,IAAK,MACI,OAAAgC,EACX,CACF,CAEO,IAAMvB,GAAqB,CAUhC,iBAAkB,KAOlB,WAAY,IAEZ,cAAe,KAEf,kBAAmB,IACrB,EC1aawB,GAAN,KAAqB,CAa1B,YAAY5D,EAIT,CAbKC,EAAA,KAAA,OAAA,EACAA,EAAA,KAAA,WAAA,EACAA,EAAA,KAAA,QAAA,EACAA,EAAA,KAAA,OAAA,IAAW,GAAA,EACXA,EAAA,KAAA,mBAAA,IAAuB,GAAA,EACvBA,EAAA,KAAA,OAAO,IAAIC,CAAAA,EACXD,EAAA,KAAA,WAAW,EAAA,EACXA,EAAA,KAAA,OAAA,ElH5BH,IAAAkB,EkHmCH,KAAK,MAAQnB,EAAO,MACpB,KAAK,UAAYA,EAAO,UACxB,KAAK,OAASA,EAAO,OAErB,KAAK,MAAQ,IAAI6D,GAAS,KAAK,MAAM,IAAK,KAAK,MAAM,EAGrD,KAAK,MAAM,wBAA0B,EAAA,UAAWC,GAAc,CACjD,OAAA,CAAE,IAAAC,CAAI,IAAKD,EACpB,KAAK,QAAQC,CAAG,CAClB,CACD,EAGD,KAAK,MAAM,yBAA2B,EAAA,UAAU,IAAM,CACpD,OAAW,CAAE,IAAAA,CAAA,IAAS,KAAK,MAAM,SAC/B,KAAK,QAAQA,CAAG,CAClB,CACD,EAGD,KAAK,MAAM,kBAAkB,EAAE,UAAU,CAAC,CAAE,MAAAC,CAAAA,IAAY,ClHxDrD,IAAA7C,GkHyDGA,EAAA,KAAK,KAAK,IAAI6C,CAAK,IAAnB,MAAA7C,EAAsB,WACxB,KAAK,YAAY6C,CAAK,CACxB,CACD,EAGI,KAAA,MAAM,oBAAsB,EAAA,UAAU,MAAO,CAAE,MAAAA,EAAO,OAAAzC,CAAAA,IAAa,CAC1D,KAAK,KAAK,IAAIyC,CAAK,IAK3B,KAAK,WAAazC,GAAA,MAAAA,EAAQ,WAAW,gBAAA,EAClC,KAAA,iBAAiB,IAAIyC,CAAK,EAE/B,KAAK,IAAIA,CAAK,EAChB,CACD,GAED7C,EAAA,KAAK,YAAL,MAAAA,EAAgB,wBAAA,EAA0B,UAAWb,GAAO,ClH5EzD,IAAAa,EkH6ED,GAAIb,EACS,QAAA0D,KAAS,KAAK,iBAAkB,CACzC,IAAMD,GAAM5C,EAAA,KAAK,KAAK,IAAI6C,CAAK,IAAnB,KAAA,OAAA7C,EAAsB,IAC9B4C,GACF,KAAK,QAAQA,CAAG,CAEpB,KAEW,SAAAC,KAAS,KAAK,iBACvB,KAAK,IAAIA,CAAK,EAIlB,KAAK,iBAAiB,MAAA,CAAM,CAAA,CAEhC,CAEA,UAAUD,EAAcE,EAA0B,CAChD,GAAI,KAAK,SACP,OAGI,IAAAD,EAAQD,EAAI,CAAC,EACbpD,EAAiB,CACrB,MAAAqD,EACA,IAAAD,EACA,UAAAE,CAAA,EAGG,KAAA,KAAK,IAAID,EAAOrD,CAAG,EACnB,KAAA,MAAM,QAAQA,CAAG,CACxB,CACA,YAAYqD,EAAqB,CAC3B,KAAK,WAIL,KAAK,KAAK,IAAIA,CAAK,GACrB,KAAK,UAAUA,CAAK,EAEtB,KAAK,IAAIA,CAAK,EAChB,CAEA,kBAAkBA,EAAwB,CACjC,OAAA,KAAK,KAAK,IAAIA,CAAK,CAC5B,CAEA,oBAA8C,CACrC,OAAA,KAAK,MAAM,mBAAA,EAAqB,KACrCb,GAAO,CAAC,CAAE,MAAAa,EAAO,MAAAvD,CAAAA,IAAY,ClH9H5B,IAAAU,EkH+HC,IAAM+C,GAAU/C,EAAA,KAAK,KAAK,IAAI6C,CAAK,IAAnB,KAAA,OAAA7C,EAAsB,QACtC,OAAK+C,EAKH,KAAK,OAAO,4BAA8BC,GAAW1D,EAAOyD,CAAO,EAJ5D,EAI4D,CAEtE,CAAA,CAEL,CACA,kBAA0C,CACjC,OAAA,KAAK,KAAK,aAAA,CACnB,CACA,oCAAyD,CAChD,OAAA,KAAK,MAAM,kBAAA,CACpB,CAEA,SAAU,CACH,KAAA,OAAO,OAAO,EAAA,CACrB,CAEA,CAAC,OAAO,OAAO,GAAU,CACvB,GAAI,KAAK,SACP,OAGF,KAAK,SAAW,GAEV,IAAAxD,EAAW,CAAC,KAAK,IAAI,EAC3B,QAAWC,KAAOD,EAChBC,EAAI,SAAS,EAGf,KAAK,MAAM,QAAA,CACb,CAEQ,QAAQ,CAAG,CAAAqD,EAAO,GAAGI,CAAW,EAAY,CAC5C,IAAAF,EAAUG,GAAYD,CAAW,EACjCzD,EAAM,KAAK,KAAK,IAAIqD,CAAK,EAC1BrD,IAILA,EAAI,QAAUuD,EACd,KAAK,MAAM,KAAK,CAAC,MAAOF,EAAO,GAAGE,CAAO,CAAC,EAC5C,CACQ,UAAUF,EAAe,CAC/B,KAAK,MAAM,KAAK,CAAC,QAASA,CAAK,CAAC,CAClC,CACQ,IAAIA,EAAe,CACpB,KAAA,KAAK,OAAOA,CAAK,EACjB,KAAA,MAAM,KAAKA,CAAK,EACrB,KAAK,KAAK,KAAK,CACb,KAAM,KAAK,MAAM,IACjB,MAAAA,CAAA,CACD,CACH,CACF,EASMH,GAAN,KAAe,CAmBb,YACUnC,EACAC,EACR,CArBM1B,EAAA,KAAA,YAAyB,CAAA,CAAA,EACzBA,EAAA,KAAA,YAAyB,CAAA,CAAA,EACzBA,EAAA,KAAA,aAAa,IAAIC,CAAAA,EACjBD,EAAA,KAAA,SAAS,IAAIW,EAAAA,EAgBX,KAAA,IAAAc,EACA,KAAA,OAAAC,CACP,CAhBH,IAAI,UAAwB,CAC1B,OAAO,KAAK,SACd,CACA,IAAY,SAAS2C,EAAgB,CACnC,KAAK,UAAYA,CACnB,CACA,IAAI,UAAwB,CAC1B,OAAO,KAAK,SACd,CACA,IAAY,SAASA,EAAgB,CACnC,KAAK,UAAYA,CACnB,CAOA,QAAQA,EAAoB,CAC1B,KAAK,SAAW,CAAC,GAAG,KAAK,SAAUA,CAAC,EACpC,KAAK,OAAO,UAAA,EAEZ,KAAK,MAAM,CACb,CACA,KAAKN,EAAqB,CAClB,IAAAO,EAAS,CAACC,EAAkBR,IAAyC,CACzE,IAAMS,EAAaD,EAAI,OACjBE,EAAWF,EAAI,OAAQG,GAAMA,EAAE,QAAUX,CAAK,EAC9CY,EAAUH,EAAaC,EAAS,OAE/B,MAAA,CAACA,EAAUE,CAAO,CAAA,EAGrB,CAACC,EAAUC,CAAQ,EAAIP,EAAO,KAAK,SAAUP,CAAK,EAClD,CAACe,EAAUC,CAAQ,EAAIT,EAAO,KAAK,SAAUP,CAAK,EACxD,KAAK,SAAWa,EAChB,KAAK,SAAWE,EAChB,KAAK,OAAO,KAAMT,GAAMA,GAAKQ,EAAWE,EAAS,EAEjD,KAAK,MAAM,CACb,CAEA,yBAA0B,CACjB,OAAA,KAAK,WAAW,aAAA,CACzB,CACA,mBAAoB,CACX,OAAA,KAAK,OAAO,aAAA,CACrB,CAEA,SAAU,CACR,IAAMtE,EAAW,CAAC,KAAK,WAAY,KAAK,MAAM,EAE9C,QAAWC,KAAOD,EAChBC,EAAI,SAAS,CAEjB,CAEA,MAAc,OAAQ,CACd,IAAAsE,EAAW,MAAM,KAAK,SAAA,EAEtBC,EAAW,CAAC,GAAG,KAAK,SAAU,GAAG,KAAK,QAAQ,EAC9CH,EAAWG,EAAS,MAAM,EAAGD,CAAQ,EACrCJ,EAAWK,EAAS,MAAMD,CAAQ,EAClCnB,EAAY,KAAK,SAAS,MAAM,EAAGmB,EAAW,KAAK,SAAS,MAAM,EAExE,KAAK,SAAWF,EAChB,KAAK,SAAWF,EAEZf,EAAU,OAAS,GAChB,KAAA,WAAW,KAAKA,CAAS,CAElC,CAEA,MAAc,UAAW,CAQvB,OAPiB,MAAMlC,GAAc,SACnC,KAAK,IACJY,GAAS,ClHpRT,IAAArB,EkHoRS,OAAAA,EAAAqB,EAAK,aAAL,KAAA,OAAArB,EAAiB,iBAAA,EAC3B,CACE,UAAW,KAAK,OAAO,cACzB,CAAA,GAEiB,GACrB,CACF,ECrPagE,GAAN,KAAsB,CAe3B,YAAYzD,EAAaC,EAA6B,CAd9C1B,EAAA,KAAA,OAAA,EACAA,EAAA,KAAA,UAAA,EACAA,EAAA,KAAA,UAAA,EACAA,EAAA,KAAA,yBAAA,IAA0C,GAAA,EAC1CA,EAAA,KAAA,gBAAgB,EAAA,EAChBA,EAAA,KAAA,WAA+B,MAAA,EAC/BA,EAAA,KAAA,iBAAiB,EAAA,EACjBA,EAAA,KAAA,WAAW,EAAA,EACXA,EAAA,KAAA,MAAA,EAOD,KAAA,KAAOmF,GAAkB1D,CAAG,EAC3B,IAAA2D,EAAgBC,GAAiB5D,EAAKC,CAAM,EAE5C4D,EAAQ,IAAI9D,GAAgB,KAAK,IAAKE,CAAM,EAC5C6D,EAAYH,EACd,IAAItF,GAAU,CAAE,MAAAwF,EAAO,OAAA5D,EAAQ,cAAA0D,CAAAA,CAAe,EAC9C,KACEI,EAAW,IAAIvE,GAAa,CAAE,MAAAqE,EAAO,UAAAC,CAAW,CAAA,EAChDE,EAAW,IAAI9B,GAAe,CAAE,MAAA2B,EAAO,UAAAC,EAAW,OAAA7D,CAAAA,CAAQ,EAChE,KAAK,MAAQ4D,EACb,KAAK,SAAWE,EAChB,KAAK,SAAWC,EAGFC,GAAA,CACZ,KAAK,SAAS,mCAAmC,EACjD,KAAK,SAAS,mCAAmC,CAClD,CAAA,EACE,KAAKrC,GAAI,CAAC,CAACsC,EAAUC,CAAQ,IAAMD,EAAWC,CAAQ,CAAC,EACvD,UAAWC,GAAiB,CAC3B,KAAK,cAAgBA,EAAe,EACpC,KAAK,gBAAgB,CAAA,CACtB,CACL,CA5BA,IAAI,KAAM,CACR,OAAO,KAAK,IACd,CA4BA,sBAAsBC,EAAoC,CACpD,KAAK,WAIT,KAAK,SAAWA,EAChB,KAAK,gBAAgB,EACvB,CAEQ,iBAAkB,CACxB,IAAIA,EAAW,KAAK,SAKpB,OAJK,KAAK,iBACGA,EAAA,QAGLA,EAAU,CAChB,IAAK,OAAQ,CACN,KAAK,eACH,KAAA,MAAM,WAAW3D,GAAmB,aAAa,EAExD,KACF,CACA,IAAK,YACH,MAEF,IAAK,aAAc,EAEf,KAAK,kBAAoB,eACzB,KAAK,kBAAoB,YAEzB,KAAK,MAAM,gBAAA,EAEb,KACF,CACF,CACF,CAEA,cAAc4D,EAAqB,CACjC,GAAI,CAAA,KAAK,SAML,CAAA,GAFJ,KAAK,eAAiBA,EAElB,CAAC,KAAK,eAAgB,CACb,QAAAhC,KAAS,KAAK,uBAClB,KAAA,SAAS,YAAYA,CAAK,EAEjC,KAAK,uBAAuB,MAAA,CAC9B,CAEA,KAAK,gBAAgB,CAAA,CACvB,CAEA,MAAM,QAAQvD,EAA2C,CACvD,GAAI,CAAA,KAAK,SAIF,OAAA,KAAK,SAAS,QAAQA,CAAK,CACpC,CACA,UAAUJ,EAAuB,CAC3B,KAAK,UAIJ,KAAA,SAAS,UAAUA,CAAO,CACjC,CACA,UAAU0D,EAAckC,EAA2C,CACjE,GAAI,KAAK,SACP,OAGI,GAAA,CAAE,KAAAC,EAAM,UAAAC,EAAW,UAAAlC,CAAAA,EAAcmC,GAAKH,GAAW,CAAA,EAAI,CACzD,UAAW,GACX,UAAW,GACX,KAAM,SAAA,CACP,EACK,CAAG,CAAAjC,CAAK,EAAID,EAEdmC,IAAS,WAAa,CAAC,KAAK,gBAG5B,CAACC,GAAa,KAAK,SAAS,kBAAkBnC,CAAK,IAInDkC,IAAS,WACN,KAAA,uBAAuB,IAAIlC,CAAK,EAElC,KAAA,SAAS,UAAUD,EAAKE,CAAS,EACxC,CACA,YAAYD,EAAqB,CAC3B,KAAK,WAIJ,KAAA,uBAAuB,OAAOA,CAAK,EACnC,KAAA,SAAS,YAAYA,CAAK,EACjC,CAEA,oBAA8C,CAC5C,GAAI,KAAK,SACP,MAAM,IAAIqC,GAGL,OAAA,KAAK,SAAS,mBAAA,CACvB,CACA,kBAA0C,CACxC,GAAI,KAAK,SACP,MAAM,IAAIA,GAGL,OAAA,KAAK,SAAS,iBAAA,CACvB,CACA,6BAAgE,CAC9D,GAAI,KAAK,SACP,MAAM,IAAIA,GAGL,OAAA,KAAK,SAAS,4BAAA,CACvB,CACA,yBAAqD,CACnD,GAAI,KAAK,SACP,MAAM,IAAIA,GAGL,OAAA,KAAK,MAAM,wBAAA,CACpB,CAEA,8BAAkE,CAChE,GAAI,KAAK,SACP,MAAM,IAAIA,GAGL,OAAA,KAAK,MAAM,6BAAA,CACpB,CAEA,8BAAkE,CAChE,GAAI,KAAK,SACP,MAAM,IAAIA,GAGL,OAAA,KAAK,MAAM,6BAAA,CACpB,CACA,IAAI,iBAAmC,CACrC,OAAO,KAAK,MAAM,KACpB,CAEA,oBAA8C,CAC5C,GAAI,KAAK,SACP,MAAM,IAAIA,GAGL,OAAA,KAAK,MAAM,mBAAA,EAAqB,KACrC/C,GAAKgD,IAAY,CACf,KAAM,KAAK,IACX,OAAAA,CAAA,EACA,CAAA,CAEN,CAEA,iBAAkB,CAChB,KAAK,MAAM,gBAAA,CACb,CAEA,SAAU,CACH,KAAA,OAAO,OAAO,EAAA,CACrB,CAEA,CAAC,OAAO,OAAO,GAAU,CACnB,KAAK,WAIT,KAAK,SAAW,GAEhB,KAAK,MAAM,QAAA,EACX,KAAK,SAAS,QAAA,EACd,KAAK,SAAS,QAAA,EAChB,CACF,EAEA,SAAShB,GACP5D,EACAC,EAC2B,CAC3B,IAAM4E,EAAI5E,EAAO,cACjB,GAAI,CAAC4E,EACH,OAGF,IAAMC,EAAID,aAAa,SAAWA,EAAE7E,CAAG,EAAI6E,EACpC,OAAAC,IAAM,OAAS,CAAK,EAAAA,CAC7B,CCjRgB,SAAAC,GAAY5G,EAAQC,EAAa,CACxC,OAAAD,EAAE,OAAQ8E,GAAM,CAAC7E,EAAE,SAAS6E,CAAC,CAAC,CACvC,CCQO,SAAS+B,GAAU1G,EAAiD,CACnE,GAAA,CAAE,MAAA2G,EAAO,MAAAC,CAAU,EAAA5G,EACnB,CAAE,QAAA6G,EAAS,SAAAd,CAAa,EAAAY,EAIvB,MAAA,GAAGE,CAAO,IAFDd,IAAa,WAAaa,EAAQ,CAEtB,EAC9B,CAEO,SAASE,GAAY9G,EAIhB,CACV,GAAM,CAAE,MAAA2G,EAAO,QAAAzC,EAAS,MAAA0C,CAAA,EAAU5G,EAE3B,MAAA,CAAC,MAAO0G,GAAU,CAAE,MAAAC,EAAO,MAAAC,CAAAA,CAAO,EAAG,GAAG1C,CAAO,CACxD,CAEO,SAAS6C,GACdpF,EACoC,CAChC,GAAA,MAAM,QAAQA,CAAM,EAAG,CACzB,IAAM6C,EAAM7C,EAAO,IAAKqF,GAAgB,CACtC,IAAItF,EAAM,GACNuF,EAAO,GACPC,EAAQ,GACR,GAAA,OAAOF,GAAgB,SACnBtF,EAAAsF,EACCC,EAAA,GACCC,EAAA,WACC,MAAM,QAAQF,CAAW,EAAG,CAC/B,IAAAd,EAAOc,EAAY,CAAC,EAC1BtF,EAAMsF,EAAY,CAAC,EACZC,EAAA,CAACf,GAAQA,IAAS,OACjBgB,EAAA,CAAChB,GAAQA,IAAS,OAAA,MAE1BxE,EAAMsF,EAAY,IAClBC,EAAOD,EAAY,KACnBE,EAAQF,EAAY,MAGf,MAAA,CACL,IAAAtF,EACA,KAAAuF,EACA,MAAAC,CAAA,CACF,CACD,EAEM,OAAA,OAAO,YAAY1C,EAAI,IAAKG,GAAM,CAACA,EAAE,IAAKA,CAAC,CAAC,CAAC,CAAA,KAC/C,CACC,IAAAH,EAAM,OAAO,QAAQ7C,CAAM,EAAE,IAAI,CAAC,CAACD,EAAKyF,CAAK,KAAO,CACxD,IAAAzF,EACA,GAAGyF,CACH,EAAA,EAEK,OAAA,OAAO,YAAY3C,EAAI,IAAKG,GAAM,CAACA,EAAE,IAAKA,CAAC,CAAC,CAAC,CACtD,CACF,CAEgB,SAAAyC,GACdC,EACApB,EAIsB,CAChB,IAAAqB,EAAAA,IAAc,IAEpB,GAAIrB,GAAA,MAAAA,EAAS,GAAI,CACf,IAAMsB,EAAKtB,EAAQ,GAEf,GAAA,CAACsB,EAAG,mBAAqB,CAACA,EAAG,oBAAsB,CAACA,EAAG,OAClD,OAGH,IAAAC,EAAgBH,EAAQ,iBAAA,EAE9B,GAAIE,EAAG,kBACL,OAAW,CAAE,IAAA7F,CAAI,IAAK,OAAO,OAAO8F,CAAa,EAAE,OAChD7C,GAAMA,EAAE,IAAA,EAET2C,EAAQ,IAAI5F,CAAG,EAGnB,GAAI6F,EAAG,mBACL,OAAW,CAAE,IAAA7F,CAAI,IAAK,OAAO,OAAO8F,CAAa,EAAE,OAChD7C,GAAMA,EAAE,KAAA,EAET2C,EAAQ,IAAI5F,CAAG,EAGnB,GAAI6F,EAAG,OACM,QAAA7F,KAAO6F,EAAG,OACXD,EAAA,IAAIlC,GAAkB1D,CAAG,CAAC,EAI/B,MAAA,CAAC,GAAG4F,CAAO,CAAA,SACTrB,GAAA,MAAAA,EAAS,OAAQ,CACf,QAAAvE,KAAOuE,EAAQ,OAChBqB,EAAA,IAAIlC,GAAkB1D,CAAG,CAAC,EAG7B,MAAA,CAAC,GAAG4F,CAAO,CAAA,KAEX,OAEX,CCtDO,SAASG,GAAc9F,EAAgC,CAC5D,OAAO,IAAI+F,GAAYC,GAAkBhG,GAAU,CAAA,CAAE,CAAC,CACxD,CAEA,IAAM+F,GAAN,KAAqC,CAwCnC,YAAoB/F,EAA6B,CAvCzC1B,EAAA,KAAA,cAAc,IAAI2H,EAAAA,EAClB3H,EAAA,KAAA,gBAAgB,IAAI2H,EAAAA,EAqBpB3H,EAAA,KAAA,uBAAA,IAGA,GAAA,EAEAA,EAAA,KAAA,SAAS,IAAIC,CAAAA,EACbD,EAAA,KAAA,OAAO,IAAIC,CAAAA,EACXD,EAAA,KAAA,MAAM,IAAIC,CAAAA,EACVD,EAAA,KAAA,OAAO,IAAIC,CAAAA,EAEXD,EAAA,KAAA,SAAS,IAAIC,CAAAA,EACbD,EAAA,KAAA,mBAAmB,IAAIC,CAAAA,EACvBD,EAAA,KAAA,YAAY,IAAIC,CAAAA,EAEhBD,EAAA,KAAA,WAAW,IAAIC,CAAAA,EACfD,EAAA,KAAA,WAAW,EAAA,EAEC,KAAA,OAAA0B,CAA8B,CArClD,IAAY,kBAAsC,CAChD,IAAMkG,EAA2B,CAAA,EACjC,OAAW,CAAE,IAAAnG,EAAK,KAAAuF,CAAA,IAAU,KAAK,cAAc,OAAA,EAAU,CACvD,IAAMa,EAAO,KAAK,YAAY,IAAIpG,CAAG,EACjCuF,GAAQa,GACVD,EAAM,KAAKC,CAAI,CAEnB,CACO,OAAAD,CACT,CACA,IAAY,kBAAsC,CAChD,IAAMA,EAA2B,CAAA,EACjC,OAAW,CAAE,IAAAnG,EAAK,MAAAwF,CAAA,IAAW,KAAK,cAAc,OAAA,EAAU,CACxD,IAAMY,EAAO,KAAK,YAAY,IAAIpG,CAAG,EACjCwF,GAASY,GACXD,EAAM,KAAKC,CAAI,CAEnB,CACO,OAAAD,CACT,CAqBA,kBAAuD,CACrD,GAAI,KAAK,SACP,MAAM,IAAIxB,GAGL,OAAA,KAAK,cAAc,SAAA,CAC5B,CACA,gBAAgB3E,EAA6C,CACpD,OAAA,KAAK,cAAc,IAAIA,CAAG,CACnC,CAEA,iBAAiBqG,EAA6C,CAC5D,GAAI,KAAK,SACP,MAAM,IAAI1B,GAGZ,IAAM2B,EAAoB,IAAIJ,GAAOb,GAAsBgB,CAAM,CAAC,EAC5DE,EAA6C,CAAA,EAEnD,OAAW,CAAE,KAAAhB,EAAM,IAAAvF,CAAS,IAAAsG,EAAkB,OAAA,EAAU,CAChD,IAAAF,EAAO,KAAK,sBAAsBpG,CAAG,EACtCoG,EAAA,sBAAsB,KAAK,OAAO,kBAAkB,EAErDb,GACFgB,EAAwB,KAAKH,CAAI,CAErC,CAEA,KAAK,2BAA2BG,CAAuB,EAEvD,KAAK,cAAgBD,CACvB,CACQ,sBAAsBtG,EAA8B,CAC1D,IAAIoG,EAAO,KAAK,YAAY,IAAIpG,CAAG,EAEnC,OAAIoG,IAIJA,EAAO,IAAI3C,GAAgBzD,EAAK,KAAK,MAAM,EAE3C,KAAK,sBAAsBoG,CAAI,EAC1B,KAAA,YAAY,IAAIpG,EAAKoG,CAAI,EAEvBA,EACT,CACQ,sBAAsBA,EAA6B,CACzDA,EAAK,mBAAmB,EAAE,UAAU,KAAK,MAAM,EAC/CA,EAAK,iBAAiB,EAAE,UAAU,KAAK,IAAI,EAC3CA,EAAK,4BAA4B,EAAE,UAAU,KAAK,GAAG,EACrDA,EAAK,wBAAwB,EAAE,UAAU,KAAK,IAAI,EAClDA,EAAK,6BAA6B,EAAE,UAAU,KAAK,gBAAgB,EACnEA,EAAK,mBAAmB,EAAE,UAAU,KAAK,MAAM,EAC/CA,EAAK,6BAA6B,EAAE,UAAU,KAAK,SAAS,CAC9D,CACQ,2BACNG,EACM,CACN,IAAMC,EAA4BzB,GAChC,KAAK,iBACLwB,CAAA,EAGF,QAAWH,KAAQI,EACjBJ,EAAK,cAAc,EAAK,EAE1B,QAAWA,KAAQG,EAAyB,CAC1CH,EAAK,cAAc,EAAI,EACvB,OAAW,CAAE,IAAA/D,EAAK,UAAAE,CAAA,IAAe,KAAK,qBAAqB,OAAA,EACzD6D,GAAM,UAAU/D,EAAK,CACnB,KAAM,UACN,UAAW,GACX,UAAAE,CAAA,CAAA,CAGN,CACF,CACA,iBAAiB8D,EAA6C,CACtD,IAAAI,EAA0BpB,GAAsBgB,CAAM,EAE5D,KAAK,iBAAiB,CACpB,GAAG,KAAK,cAAc,SAAS,EAC/B,GAAGI,CAAA,CACJ,CACH,CACA,oBAAoBC,EAA+B,CAC3C,IAAAZ,EAAgB,KAAK,cAAc,KAAK,EACxCF,EAAU,MAAM,QAAQc,CAAI,EAAIA,EAAO,CAACA,CAAI,EAClD,QAAW1G,KAAO4F,EAChBE,EAAc,OAAO9F,CAAG,EAGrB,KAAA,iBAAiB8F,EAAc,SAAU,CAAA,CAChD,CAIA,mBAAiD,CAC/C,OAAO,OAAO,YACZ,MAAM,KAAK,KAAK,YAAY,OAAA,CAAQ,EAAE,IAAK7C,GAAM,CAC/CA,EAAE,IACF,CAAE,WAAYA,EAAE,eAAgB,CAAA,CACjC,CAAA,CAEL,CACA,eAAejD,EAAsC,CACnD,IAAMoG,EAAO,KAAK,YAAY,IAAIpG,CAAG,EACrC,GAAKoG,EAIE,MAAA,CAAE,WAAYA,EAAK,eAAA,CAC5B,CAGA,UAAUpG,EAAmB,CACrB,IAAA6D,EAAQ,KAAK,gBAAgB7D,CAAG,EACtC,GAAI,CAAC6D,EACH,MAAM,IAAIxC,GACR,cAAcrB,CAAG,0FAAA,EAGjB,GAAA,CAAC6D,EAAM,KACT,MAAM,IAAIxC,GACR,cAAcrB,CAAG,mFAAA,EAIrB,IAAMoG,EAAO,KAAK,YAAY,IAAIpG,CAAG,EACrC,GAAI,CAACoG,EACH,MAAM,IAAI5E,IAGV4E,EAAK,kBAAoB,SACzBA,EAAK,kBAAoB,aAEzBA,EAAK,gBAAgB,CAEzB,CAGA,IACEnB,EACAV,EACyB,CACnB,IAAAoC,EAAiBjB,GAAqB,KAAMnB,CAAO,EASnDqC,EAAkB,CACtB,CAAE,QAAApE,EAAS,OAAA6D,CAAA,EACXnB,IACgB,CtH5Qf,IAAAzF,EsH6QD,IAAMoH,EACJ5B,EAAM,WAAa,WAAaoB,EAAS,OACrChE,EAAM+C,GAAY,CAAE,MAAAH,EAAO,QAAAzC,EAAS,MAAA0C,CAAAA,CAAO,EAG1C,MAAA,CACL,MAHY7C,EAAI,CAAC,EAIjB,IAAAA,EACA,oBACG5C,EAAAoH,GAAmBF,IAAnB,KAAA,OAAAlH,EAAoC,IAAKO,GACxC,KAAK,sBAAsBA,CAAG,CAAA,IAC3B,KAAK,iBACZ,KACE6G,IAAoB,QAAaF,IAAmB,OAChD,UACA,WAAA,CACR,EAEIG,EAAoB,CAAC,CACzB,IAAAzE,EACA,kBAAA0E,EACA,KAAAvC,CAAA,IACiB,CACjB,KAAK,kBAAkB,CACrB,IAAAnC,EACA,kBAAA0E,EACA,KAAAvC,EACA,UAAWS,EAAM,WAAa,UAC9B,UAAWA,EAAM,WAAa,UAAA,CAC/B,CAAA,EAEG+B,EAAuB,CAAC,CAC5B,MAAA1E,EACA,kBAAAyE,EACA,KAAAvC,CAAA,IACiB,CACjB,KAAK,qBAAqB,CACxB,MAAAlC,EACA,kBAAAyE,EACA,KAAAvC,CAAA,CACD,CAAA,EAEGyC,EAAwB,CAAC,CAAE,IAAA5E,EAAK,kBAAA0E,CAAAA,IAChC9B,EAAM,WAAa,UACd,KAAK,6BAA6B,CACvC,IAAA5C,CACD,CAAA,EAAE,KAAK6E,GAAU,KAAK,QAAQ,CAAC,EAEzB,KAAK,8BAA8B,CACxC,IAAA7E,EACA,kBAAA0E,CACD,CAAA,EAAE,KAAKG,GAAU,KAAK,QAAQ,CAAC,EAI9BC,EAASlC,EAAM,uBAAA,EAAyB,KAC5CxD,GAAO,CAAC,CAAE,QAAAe,CAAAA,IAAcA,EAAQ,OAAS,CAAC,EAC1CZ,GAAIgF,CAAe,EACnBM,GAAU,KAAK,QAAQ,CAAA,EAGnBE,EAAW,IACfC,GAAyB,MAAO,CAAE,MAAAtI,CAAAA,KAE7B,KAAK,OAAO,YAAe,MAAM,KAAK,OAAO,SAASA,CAAK,KAC3D,KAAK,OAAO,qBAAuB,CAACuI,GAAUvI,CAAK,EAEvD,EAEC,GAAAkG,EAAM,WAAa,UAAW,CAC5B,IAAAsC,EAEJ,OAAOJ,EAAO,KACZK,GAAKC,GAAU,CACAF,EAAAE,CAAA,CACd,EACDD,GAAIV,CAAiB,EACrBlF,GAAIqF,CAAqB,EACzBS,GAAS,IAAM,CACRH,GAILP,EAAqBO,CAAU,CAAA,CAChC,EACDI,GAAU,EACVP,EAAS,CAAA,CACX,KAEA,QAAOD,EAAO,KACZK,GAAIV,CAAiB,EACrBlF,GAAK6F,GACHR,EAAsBQ,CAAK,EAAE,KAC3BC,GAAS,IAAM,CACbV,EAAqBS,CAAK,CAAA,CAC3B,CACH,CACF,EACAG,GAAS,EACTR,EAAS,CAAA,CAGf,CACQ,6BAA6B9I,EAET,CACpB,GAAA,CAAE,IAAA+D,CAAQ,EAAA/D,EACVgE,EAAQD,EAAI,CAAC,EAEnB,OAAO,KAAK,OAAO,KAAKwF,GAAcvF,CAAK,CAAC,CAC9C,CACQ,8BAA8BhE,EAGV,CACpB,GAAA,CAAE,IAAA+D,EAAK,kBAAA0E,CAAsB,EAAAzI,EAC7BgE,EAAQD,EAAI,CAAC,EACbyF,EAAAA,IAAqB,IAErBC,EAAU5H,GACdA,IAAU,SAAWA,IAAU,YAAcA,IAAU,aACnD6H,EAAiB,IACrBjB,EAAkB,MAChB,CAAC,CAAE,gBAAAkB,EAAiB,IAAAjI,CAAAA,IAClB+H,EAAOE,CAAe,GAAKH,EAAe,IAAI9H,CAAG,CAAA,EAGjDkI,EAAO,KAAK,KAAK,KACrBL,GAAcvF,CAAK,EACnBkF,GAAI,CAAC,CAAE,KAAAlG,CAAAA,IAAW,CAChBwG,EAAe,IAAIxG,CAAI,CAAA,CACxB,CAAA,EAEG6G,EAAYC,GAAMF,EAAM,KAAK,iBAAiB,aAAc,CAAA,EAAE,KAClEzG,GAAO,IAAMuG,EAAAA,CAAgB,EAC7BzI,GAAM,CAAA,EAGR,OAAO,KAAK,OAAO,KACjB2H,GAAUiB,CAAS,EACnBE,GAAkB,KAAK,OAAO,WAAW,EACzCR,GAAcvF,CAAK,EACnBb,GAAQwB,GAAM,CAAC6E,EAAe,IAAI7E,EAAE,IAAI,CAAC,CAAA,CAE7C,CACQ,kBAAkB3E,EAMvB,CACD,GAAM,CAAE,IAAA+D,EAAK,kBAAA0E,EAAmB,KAAAvC,EAAM,UAAAC,EAAW,UAAAlC,CAAc,EAAAjE,EACzDgE,EAAQD,EAAI,CAAC,EAEfmC,IAAS,WACX,KAAK,qBAAqB,IAAIlC,EAAO,CAAE,IAAAD,EAAK,UAAAE,CAAAA,CAAW,EAEzD,QAAW6D,KAAQW,EACjBX,EAAK,UAAU/D,EAAK,CAClB,KAAAmC,EACA,UAAAC,EACA,UAAAlC,CAAA,CACD,CAEL,CACQ,qBAAqBjE,EAIpB,CACP,GAAM,CAAE,MAAAgE,EAAO,kBAAAyE,EAAmB,KAAAvC,CAAA,EAASlG,EAEvCkG,IAAS,WACN,KAAA,qBAAqB,OAAOlC,CAAK,EAExC,QAAW8D,KAAQW,EACjBX,EAAK,YAAY9D,CAAK,CAE1B,CAIA,0BAAoD,CAC3C,OAAA,KAAK,OAAO,aAAA,CACrB,CACA,0BAAoD,CAC3C,OAAA,KAAK,OAAO,aAAA,CACrB,CACA,4BAAwD,CAC/C,OAAA,KAAK,KAAK,aAAA,CACnB,CACA,iCAAqE,CAC5D,OAAA,KAAK,iBAAiB,aAAA,CAC/B,CACA,iCAAqE,CAC5D,OAAA,KAAK,UAAU,aAAA,CACxB,CAGA,KACEhE,EACAiG,EACkC,CAC5B,GAAA,CAAE,OAAA+D,EAAQ,eAAAC,EAAgB,WAAAC,CAAAA,EAAe9D,GAAKH,GAAW,CAAA,EAAI,CACjE,OAAQ,KAAK,OAAO,OACpB,eAAgB,GAChB,WAAY,QAAA,CACb,EACK8B,EAASX,GAAqB,KAAMnB,CAAO,EAE3CkE,EACJpC,IAAW,OACP,KAAK,iBACLA,EAAO,IAAKrG,GAAQ,KAAK,sBAAsBA,CAAG,CAAC,EACnD0I,EAAU,IAAIlK,EACdsJ,EAAAA,IAAqB,IACvBnJ,EAAU,GAERgK,EAAW,IAAM,CAChBD,EAAQ,QACXA,EAAQ,SAAS,EAGnB,QAAWtC,KAAQqC,EACjBrC,EAAK,UAAUzH,CAAO,CACxB,EAGF2J,EACG,UAAUhK,CAAM,EAChB,KAAK,MAAOS,GAAU,CACjB2J,EAAQ,SAIZ/J,EAAUI,EAAM,GAEhB,KAAK,IACF,KAAK0C,GAAO,CAAC,CAAE,QAAA9C,CAAcA,IAAAA,IAAYI,EAAM,EAAE,CAAC,EAClD,UAAU2J,CAAO,EAEd,MAAA,QAAQ,IAAID,EAAa,IAAKrC,GAASA,EAAK,QAAQrH,CAAK,CAAC,CAAC,EAE7DyJ,IAAe,QACjBE,EAAQ,SAAS,EACnB,CACD,EACA,MAAO9H,GAAQ,CACL,MAAA+H,EAAAA,EAEH,IAAItH,GACRT,aAAe,MAAQA,EAAI,QAAU,gCAAA,CACvC,CACD,EAEH,IAAMgI,GACH,IAAsD,CACrD,OAAQJ,EAAY,CAClB,IAAK,OACI,OAAAK,GACT,IAAK,SACH,OAAOC,GAAU,CAAC,CAAE,KAAAxH,EAAM,KAAAC,CAAAA,KACpBA,GACFuG,EAAe,IAAIxG,CAAI,EAElBwG,EAAe,KAAOW,EAAa,QACzC,EAAI,EACT,IAAK,SACH,OAAOlJ,GAAOmC,GAAMA,EAAE,EAAE,CAC5B,CAAA,GAAA,EAGJ,OAAOgH,EAAQ,KACbE,EACA1B,GAAU,KAAK,QAAQ,EACvBqB,EACIQ,GAAQ,KAAK,OAAO,SAAS,EAC7BV,GAAkB,KAAK,OAAO,SAAS,EAC3CX,GAASiB,CAAQ,CAAA,CAErB,CAEA,MAAM,KACJrK,EACAiG,EACe,CACT,MAAAjF,GAAe,KAAK,KAAKhB,EAAQ,CAAE,GAAGiG,EAAS,WAAY,MAAQ,CAAA,CAAC,CAC5E,CAEA,SAAU,CACH,KAAA,OAAO,OAAO,EAAA,CACrB,CAEA,CAAC,OAAO,OAAO,GAAU,CACvB,GAAI,KAAK,SACP,OAEF,KAAK,SAAW,GAEhB,QAAW6B,KAAQ,KAAK,YAAY,OAAA,EAClCA,EAAK,QAAQ,EAEf,KAAK,YAAY,MAAA,EAEjB,IAAMpH,EAAW,CACf,KAAK,OACL,KAAK,IACL,KAAK,KACL,KAAK,KACL,KAAK,iBACL,KAAK,OACL,KAAK,SAAA,EAEP,QAAWC,KAAOD,EAChBC,EAAI,SAAS,EAGf,KAAK,SAAS,KAAA,EACd,KAAK,SAAS,SAAA,CAChB,CACF,EC9dM+J,GAAwC1K,GAS3B,CACX,GAAA,CAAE,SAAA+F,CAAa,EAAA/F,EACf2K,EAAa3K,EAAO,WAAa,CAAA,EACjC6G,EAAU7G,EAAO,SAAW4K,GAAsB,EAElDC,EAAW7K,EAAO,SAAW,IAAIE,EAEhC,MAAA,CACL,SAAA6F,EACA,QAAAc,EACA,wBAAgD,CACvC,OAAAgE,EAAS,KAAK,GAAIF,CAAiB,CAC5C,EAEA,QAAQG,EAAgD,CACtD,OAAOJ,GAAY,CACjB,SAAA3E,EACA,QAAAc,EACA,UAAW,CAAC,GAAG8D,EAAY,GAAGG,CAAS,EACvC,QAASD,CAAA,CACV,CACH,EACA,KAAK3G,EAAoC+B,EAAgC,CAC9D4E,EAAA,KAAK,CAAE,QAASE,GAAiB7G,CAAO,EAAG,GAAI+B,GAAW,CAAC,CAAA,CAAI,CAC1E,EACA,MAAO,CACL4E,EAAS,SAAS,CACpB,CAAA,CAEJ,EAqCO,SAASG,GACdC,EACmD,CACnD,OAAOC,GAAY,CACjB,SAAU,UACV,QAAAD,CAAA,CACD,CACH,CAyBA,SAASE,IAAwB,CAC/B,MAAO,GAAG,KAAK,MAAM,KAAK,OAAA,EAAW,GAAO,CAAC,EAC/C,CAEA,SAASC,GAAgBC,EAAuC,CvH/NzD,IAAAC,EAAAC,EuHgOL,IAAMC,EAAkB,CAAA,EAClBC,EAAaC,GAAkC,cAAc,KAAKA,CAAC,EAEzE,QAAWC,KAAO,OAAO,KAAKN,CAAM,EAAG,CACrC,GAAIM,IAAQ,UAAYN,EAAOM,CAAG,GAAK,KAAO,EAAG,CAC3CH,EAAAG,CAAG,EAAIN,EAAOM,CAAG,EACrB,QACF,CACI,GAAAA,IAAQ,SAAWA,IAAQ,QAAS,CAChC,IAAAC,EAAIP,EAAOM,CAAG,EACpB,GAAI,OAAOC,GAAM,WAAaA,GAAK,KAAO,EAAG,CAC3CJ,EAAIG,CAAG,EAAIC,EACX,QACF,CACF,CACA,IACGH,EAAUE,CAAG,GAAKA,IAAQ,OAASA,IAAQ,YAC5CN,EAAOM,CAAG,IAAM,WACfL,EAAAD,EAAOM,CAAG,IAAV,KAAA,OAAAL,EAAa,SAAU,IAAM,EAC9B,CACIE,EAAAG,CAAG,EAAIN,EAAOM,CAAG,EACrB,QACF,CAEE,GAAAA,IAAQ,SACRN,EAAOM,CAAG,IAAM,WACfJ,EAAAF,EAAOM,CAAG,IAAV,KAAA,OAAAJ,EAAa,SAAU,IAAM,EAC9B,CACIC,EAAAG,CAAG,EAAIN,EAAOM,CAAG,EACrB,QACF,CACA,GAAIA,IAAQ,UAAYN,EAAOM,CAAG,IAAM,OAAW,CAC7CH,EAAAG,CAAG,EAAIN,EAAOM,CAAG,EACrB,QACF,CACF,CAMA,OAHE,OAAOH,EAAI,OAAU,UACrB,OAAOA,EAAI,OAAU,UACrBA,EAAI,OAASA,EAAI,MAKZA,EAHE,IAIX,CAEA,SAASK,GAAiBC,EAAkD,CAC1E,OAAQ,MAAM,QAAQA,CAAO,EAAIA,EAAU,CAACA,CAAO,GAChD,IAAKC,GAAMX,GAAgBW,CAAC,CAAC,EAC7B,OAAQA,GAAuBA,IAAM,IAAI,CAC9C,CExPO,IAAMC,GAAN,KAA4C,CACjDC,GACAC,GAEA,YAAYC,EAAqB,CAC/B,KAAKD,GAAaC,EAElB,IAAMC,EAAMC,GAAc,CAAE,SAAAC,GAAU,eAAgB,GAAM,mBAAoB,WAAY,CAAC,EAC7FF,EAAI,iBAAiBD,CAAS,EAE9BC,EAAI,gCAAgC,EAAE,UAAU,CAAC,CAAE,KAAMG,EAAM,MAAAC,CAAM,IAAM,CACzE,QAAQ,MAAM,uBAAuBD,CAAI,iCAAiCC,CAAK,EAAE,CACnF,CAAC,EAED,KAAKP,GAAOG,CACd,CAEA,UAAUK,EAAgBC,EAA+C,CACvE,IAAMC,EAAMC,GAAmB,EACzBC,EAAM,KAAKZ,GACd,IAAIU,CAAG,EACP,KAAKG,GAAK,CAAC,EACX,UAAU,CAAC,CAAE,MAAAC,CAAM,IAAML,EAAQK,CAAK,CAAC,EAE1C,OAAAJ,EAAI,KAAK,CAAE,GAAGF,EAAQ,MAAOO,EAAmB,CAAC,EAC1C,IAAMH,EAAI,YAAY,CAC/B,CAEA,MAAM,QAAQI,EAA+B,CAE3C,IAAIC,EAAQ,EAEZ,OAAa,CACX,GAAIA,IAAU,EACZ,MAAM,MAAM,0EAA0E,EAExF,IAAMC,EAAM,MAAM,KAAKC,GAAQH,EAAI,GAAI,EACvC,OAAQE,EAAI,OAAQ,CAClB,IAAK,KACH,OAEF,IAAK,QACH,MAAM,MAAM,4BAA4BA,EAAI,MAAM,EAAE,EAEtD,IAAK,UACH,MAAME,IAAO,GAAKH,GAAS,GAAI,EAC/BA,GACJ,CACF,CACF,CAGA,KAAME,GAAQH,EAAgBK,EAA0C,CACtE,OAAO,IAAI,QAAuBC,GAAY,CAC5C,GAAI,CACiB,YAAY,QAAQD,CAAS,EACrC,iBAAiB,QAAS,IAAM,CACzCE,EAAM,YAAY,EAClBD,EAAQ,CAAE,OAAQ,SAAU,CAAC,CAC/B,CAAC,EACD,IAAMC,EAAQ,KAAKvB,GAAK,KAAKgB,CAAE,EAAE,UAAU,CAAC,CAAE,GAAAQ,EAAI,OAAAC,CAAO,IAAM,CAE3DH,EADEE,EACM,CAAE,OAAQ,IAAK,EAEf,CAAE,OAAQ,QAAS,OAAQC,GAAU,gBAAiB,CAFtC,CAI5B,CAAC,CACH,OAASC,EAAK,CACRA,aAAe,MACjBJ,EAAQ,CAAE,OAAQ,QAAS,OAAQI,EAAI,OAAQ,CAAC,EAEhDJ,EAAQ,CAAE,OAAQ,QAAS,OAAQ,iBAAkB,CAAC,CAE1D,CACF,CAAC,CACH,CAEA,cAAqB,CACnB,KAAKrB,GAAW,IAAKK,GAAS,CAC5B,KAAKN,GAAK,UAAUM,CAAI,CAC1B,CAAC,CACH,CAEA,SAAgB,CACd,KAAKN,GAAK,QAAQ,CACpB,CACF,EC9EA,IAAM2B,GAAoB,MAAOC,EAAgBC,IAAqD,CACpG,IAAMC,EAAe,MAAMD,EAAO,aAAaD,EAAG,OAAQA,EAAG,OAAO,EAC9D,CAAE,GAAAG,EAAI,OAAAC,EAAQ,MAAAC,CAAM,EAAI,KAAK,MAAMH,CAAY,EAGrD,OAAIG,GAAS,KAGPD,IAAW,WACN,CAAE,GAAAD,EAAI,OAAQ,OAAQ,QAASE,CAAM,EAEvC,CAAE,GAAAF,EAAI,OAAQ,QAAS,MAAAE,CAAM,EAElCD,GAAU,KACL,CAAE,GAAAD,EAAI,OAAQ,KAAM,OAAAC,CAAO,EAE7B,CAAE,GAAAD,EAAI,OAAQ,OAAQ,CAC/B,EAoDMG,GAAeC,GAASA,EACxBC,GAAiD,CACrD,QAAUC,GAAWA,EACrB,WAAY,CAAC,CAACT,CAAE,IAAM,CAAC,KAAK,UAAUA,CAAE,CAAC,EACzC,KAAMM,GACN,WAAYA,GACZ,eAAgBA,GAChB,cAAeA,GACf,cAAeA,GACf,cAAeA,GACf,cAAeA,EACjB,EACMI,GAAiD,CACrD,QAASJ,GACT,WAAaK,GAAgB,KAAK,MAAMA,CAAG,EAC3C,KAAML,GACN,WAAaK,GAAgB,KAAK,MAAMA,CAAG,EAC3C,eAAgBL,GAChB,cAAeA,GACf,cAAeA,GACf,cAAeA,GACf,cAAeA,EACjB,EAkBaM,GAAwD,CACnE,iBAAkB,GAAK,IACvB,gBAAkBC,GAAM,CACtB,QAAQ,MAAM,wCAAwC,CACxD,CACF,EAEaC,GAAN,MAAMC,CAAe,CAC1BC,GACAC,GACAC,GAEAC,GACAC,GAAsC,OAEtCC,GAA+C,IAAI,IAEnD,YACEC,EACAC,EACAC,EACAC,EACA,CACA,KAAKT,GAAeM,EACpB,KAAKL,GAAgBM,EACrB,KAAKL,GAAWO,EAChB,KAAKN,GAAaK,CACpB,CAKA,OAAc,qCACZF,EACAE,EACAE,EACAC,EACgC,CAChC,IAAMC,EAAW,IAAIC,GAEfC,EAAU,MAAO9B,GAAmB,CACxC,IAAM+B,EAAO,MAAMhC,GAAkBC,EAAIsB,CAAW,EACpD,OAAQS,EAAK,OAAQ,CACnB,IAAK,KAAM,CACT,IAAMC,EAAehC,EAAG,OACxB,GAAI+B,EAAK,SAAW,MAAO,CAEzB,QAAQ,KAAK,sDAAsD,EACnEH,EAAS,QAAQI,CAAY,EAC7B,MACF,CACA,GAAID,EAAK,SAAWL,EAAQ,CAC1BE,EAAS,OAAO,IAAI,MAAM,6BAA6B,CAAC,EACxD,MACF,CAEAA,EAAS,QAAQI,CAAY,EAC7B,MACF,CACA,IAAK,OACH,QAAQ,MAAM,kFAAkF,EAChG,OACF,IAAK,QACHJ,EAAS,OAAO,IAAI,MAAM,iCAAiCG,EAAK,KAAK,EAAE,CAAC,EACxE,OACF,IAAK,QACHH,EAAS,OAAO,IAAI,MAAM,4BAA4B,CAAC,EACvD,MACJ,CACF,EAEMK,EAAgB,YAAY,QAAQN,CAAS,EAC7CO,EAAY,SAAY,CAC5BN,EAAS,OAAO,IAAI,MAAM,4DAA4D,CAAC,CACzF,EACAK,EAAc,iBAAiB,QAASC,EAAW,CAAE,KAAM,EAAK,CAAC,EAEjE,IAAMC,EAAQX,EAAU,UAAU,CAAE,MAAO,CAAC,KAAK,EAAG,KAAM,CAACF,EAAY,SAAS,CAAE,EAAGQ,CAAO,EAGtFM,EAAU,IAAM,CACpBD,EAAM,EACNF,EAAc,oBAAoB,QAASC,CAAS,CACtD,EACA,MAAO,CAAE,UAAWN,EAAS,QAAQ,QAAQQ,CAAO,CAAE,CACxD,CAOA,aAAoB,KAClBd,EACAC,EACAC,EACAC,EACyB,CACzB,IAAMY,EAAYC,GAAyB1B,GAAsBa,CAAO,EAEpEc,EACJ,GAAI,CACF,OAAAA,EAAS,IAAIxB,EAAeO,EAAaC,EAAcC,EAAWa,CAAS,EAC3E,MAAME,EAAOC,GAAuB,EAC7BD,CACT,OAASE,EAAG,CACV,MAAAF,GAAQ,QAAQ,EACVE,CACR,CACF,CAEA,KAAMD,IAAyB,CAC7B,IAAME,EAAU,MAAO1C,GAAmB,CACxC,IAAI2C,EACJ,GAAI,CACF,IAAMZ,EAAO,MAAMhC,GAAkBC,EAAI,KAAKgB,EAAY,EAC1D2B,EAAQZ,EAAK,GAEb,IAAMH,EAAW,KAAKP,GAAc,IAAIU,EAAK,EAAE,EAC/C,GAAIH,IAAa,OAAW,CAC1B,QAAQ,MAAM,yCAAyC,EACvD,MACF,CAEA,OAAQG,EAAK,OAAQ,CACnB,IAAK,KACHH,EAAS,QAAQG,EAAK,MAAM,EAC5B,OACF,IAAK,OACH,KAAKb,GAAS,gBAAgBa,EAAK,OAAO,EAC1C,OACF,IAAK,QACHH,EAAS,OAAO,IAAI,MAAM,iCAAiCG,EAAK,KAAK,EAAE,CAAC,EACxE,OACF,IAAK,QACHH,EAAS,OAAO,IAAI,MAAM,4BAA4B,CAAC,EACvD,MACJ,CACF,OAASgB,EAAK,CACZ,QAAQ,MAAM,yCAA0CA,CAAG,CAC7D,CAEID,IAAU,QACZ,KAAKtB,GAAc,OAAOsB,CAAK,CAEnC,EAEME,EAAc,MAAM,KAAK7B,GAAa,aAAa,EACzD,KAAKI,GAAY,KAAKD,GAAW,UAAU,CAAE,MAAO,CAAC,KAAK,EAAG,KAAM,CAAC0B,CAAW,CAAE,EAAGH,CAAO,CAC7F,CAEAI,GAAqBH,EAGnB,CACA,IAAMI,EAAI,IAAIlB,GACd,KAAKR,GAAc,IAAIsB,EAAOI,CAAC,EAE/B,IAAMC,EAAoBrB,GAAsB,CAC/B,YAAY,QAAQA,CAAS,EACrC,iBACL,QACA,IAAM,CACJoB,EAAE,OAAO,IAAI,MAAM,uBAAuB,CAAC,EAC3C,KAAK1B,GAAc,OAAOsB,CAAK,CACjC,EACA,CAAE,KAAM,EAAK,CACf,CACF,EAEA,MAAO,CAAE,SAAUI,EAAE,QAAS,iBAAAC,CAAiB,CACjD,CAEA,MAAa,QACXC,EACAxC,EACAkB,EAAY,KAAKT,GAAS,iBACE,CAC5B,IAAMyB,EAAQO,GAAqB,EAC7B,CAAE,SAAAC,EAAU,iBAAAH,CAAiB,EAAI,KAAKF,GAAqBH,CAAK,EAEhES,EAAsB,CAC1B,GAAIT,EACJ,OAAAM,EACA,OAAQzC,GAAuByC,CAAM,EAAExC,CAAM,CAC/C,EACM4C,EAAc,MAAM,KAAKrC,GAAa,aAAa,KAAKC,GAAe,KAAK,UAAUmC,CAAM,CAAC,EAC7FE,EAA4B,CAChC,KAAM,MACN,KAAM,CAAC,CAAC,IAAK,KAAKrC,EAAa,CAAC,EAChC,QAASoC,EACT,WAAYE,GAAmB,CACjC,EACMC,EAAc,MAAM,KAAKxC,GAAa,UAAUsC,CAAK,EAE3D,MAAM,KAAKnC,GAAW,QAAQqC,CAAW,EAGzCR,EAAiBrB,CAAS,EAG1B,IAAM8B,EAAU,MAAMN,EACtB,OAAOzC,GAAuBuC,CAAM,EAAEQ,CAAO,CAC/C,CAKO,mBAAoB,CACzB,KAAKtC,GAAW,aAAa,CAC/B,CAKO,SAAU,CACX,KAAKC,KAAc,SACrB,KAAKA,KAAY,EACjB,KAAKA,GAAY,QAEnB,KAAKD,GAAW,QAAQ,EACxB,KAAKE,GAAc,MAAM,CAC3B,CACF,EClWA,IAAMqC,GAAsB,YACtBC,GAA0BD,GAAoB,OAGvCE,GAAoBC,GAAyC,CACxE,GAAI,CAACA,EAAM,WAAWH,EAAmB,EACvC,MAAM,MAAM,+DAA+D,EAE7E,IAAMI,EAAgBD,EAAM,UAAUF,EAAuB,EACvDI,EAAOD,EAAc,QAAQ,GAAG,EACtC,GAAIC,EAAO,EACT,MAAM,MAAM,gDAAgD,EAG9D,GAAM,CAACC,EAAWC,CAAS,EAAI,CAACH,EAAc,UAAU,EAAGC,CAAI,EAAGD,EAAc,UAAUC,EAAO,CAAC,CAAC,EAC7FG,EAAeC,GAAYH,CAAS,EAC1C,GAAIE,IAAiB,OACnB,MAAM,MAAM,mDAAmD,EAGjE,IAAME,EAAe,IAAI,gBAAgBH,CAAS,EAC5CI,EAAcD,EAAa,IAAI,QAAQ,GAAK,OAC5CE,EAAYF,EAAa,OAAO,OAAO,EAC7C,GAAIE,EAAU,SAAW,EACvB,MAAM,MAAM,iEAAiE,EAG/E,MAAO,CACL,aAAAJ,EACA,UAAAI,EACA,YAAAD,CACF,CACF,EAyCME,GAAmE,CACvE,GAAGC,GACH,iBAAkB,GAAK,IACvB,YAAa,CAAC,CAChB,EAcaC,GAAN,MAAMC,CAAqD,CAChEC,GACAC,GAEQ,YAAYC,EAAwBX,EAAsB,CAChE,KAAKS,GAAUE,EACf,KAAKD,GAAgBV,CACvB,CAOA,YAAaY,GACXC,EACAb,EACAI,EACAU,EAC4B,CAC5B,IAAIC,EACJ,GAAI,CACFA,EAAY,IAAIC,GAAiBZ,CAAS,CAC5C,OAASa,EAAG,CACV,MAAAF,GAAW,QAAQ,EACbE,CACR,CAEA,IAAMN,EAAS,MAAMO,GAAe,KAAKL,EAAab,EAAce,EAAWD,CAAO,EACtF,OAAO,IAAIN,EAAkBG,EAAQX,CAAY,CACnD,CAOA,YAAamB,GACXN,EACA,CAAE,aAAAb,EAAc,YAAAG,EAAa,UAAAC,CAAU,EACvCU,EAC4B,CAC5B,IAAMM,EAAS,MAAMZ,EAAkBI,GAAMC,EAAab,EAAcI,EAAWU,CAAO,EAG1F,GAAI,CACF,IAAMO,EAAuB,CAACrB,CAAY,EAC1C,OAAIG,IAAgB,QAClBkB,EAAW,KAAKlB,CAAW,EAEzBW,EAAQ,YAAY,OAAS,GAC/BO,EAAW,KAAKP,EAAQ,YAAY,KAAK,GAAG,CAAC,EAG9B,MAAMM,EAAOX,GAAQ,QAAQ,UAAWY,EAAYP,EAAQ,gBAAgB,IAC5E,OACf,QAAQ,KAAK,oEAAoE,EAE5EM,CACT,OAASE,EAAK,CAGZ,GAAIA,aAAe,OAASA,EAAI,QAAQ,SAAS,wBAAwB,EACvE,eAAQ,MAAM,uEAAuE,EAC9EF,EAGT,MAAAA,EAAO,QAAQ,EACTE,CACR,CACF,CAYA,aAAoB,gBAClBC,EACAT,EAA2C,CAAC,EACf,CAC7B,IAAMU,EAAYC,GAAyBpB,GAAuBS,CAAO,EAEnEO,EAAa3B,GAAiB6B,CAAS,EACvCV,EAAca,GAAgB,cAAc,EAC5CC,EAAad,EAAY,UAE/B,MAAO,CACL,OAAQ,MAAML,EAAkBW,GAASN,EAAaQ,EAAYG,CAAS,EAC3E,QAAS,CACP,WAAAG,EACA,GAAGN,CACL,CACF,CACF,CAcA,OAAc,2BACZjB,EACAwB,EACAd,EAA2C,CAAC,EAI5C,CACA,IAAMU,EAAYC,GAAyBpB,GAAuBS,CAAO,EAEnED,EAAca,GAAgB,cAAc,EAC5CC,EAAad,EAAY,UACzBgB,EAAcC,GAAiBH,CAAU,EAGzCI,EAAaC,GAAqB,EAClCC,EAAU,IAAI,IAAI,kBAAkBJ,CAAW,EAAE,EACvD,QAAWK,KAAQ9B,EACjB6B,EAAQ,aAAa,OAAO,QAASC,CAAI,EAE3C,IAAMC,EAAgB,CACpB,GAAGP,EACH,MAAOJ,EAAU,YAAY,OAAS,EAAIA,EAAU,YAAY,KAAK,GAAG,EAAI,MAC9E,EACAS,EAAQ,aAAa,IAAI,WAAY,KAAK,UAAUE,CAAa,CAAC,EAClEF,EAAQ,aAAa,IAAI,SAAUF,CAAU,EAG7C,IAAMhB,EAAY,IAAIC,GAAiBZ,CAAS,EAE1C,CAAE,UAAAgC,CAAU,EAAIlB,GAAe,qCACnCL,EACAE,EACAgB,EACAP,EAAU,gBACZ,EAGMa,EAAcD,EAAU,KAAK,MAAOpC,GAA8C,CACtF,IAAMW,EAAS,MAAMO,GAAe,KAAKL,EAAab,EAAce,EAAWS,CAAS,EAExF,MAAO,CACL,OAFa,IAAIhB,EAAkBG,EAAQX,CAAY,EAGvD,QAAS,CACP,WAAA2B,EACA,aAAA3B,EACA,UAAAI,CACF,CACF,CACF,CAAC,EAED,MAAO,CACL,WAAY6B,EAAQ,SAAS,EAC7B,YAAAI,CACF,CACF,CAKA,aAAoB,cAClB,CAAE,WAAAV,EAAY,GAAGN,CAAW,EAC5BP,EAAoC,CAAC,EACT,CAC5B,IAAMU,EAAYC,GAAyBnB,GAAsBQ,CAAO,EAElED,EAAc,IAAIa,GAAgBC,CAAU,EAClD,OAAOnB,EAAkBI,GAAMC,EAAaQ,EAAW,aAAcA,EAAW,UAAWG,CAAS,CACtG,CAKA,MAAa,cAAgC,CAC3C,OAAO,KAAKf,GAAQ,QAAQ,iBAAkB,CAAC,CAAC,CAClD,CAOA,MAAa,WAAgC,CAC3C,OAAO,KAAKA,GAAQ,QAAQ,aAAc,CAAC,CAAC,CAC9C,CAQA,MAAa,UAAU6B,EAAgD,CAErE,IAAMC,EAAKD,EACX,OAAKC,EAAG,SACNA,EAAG,OAAS,KAAK7B,IAEZ,KAAKD,GAAQ,QAAQ,aAAc,CAAC8B,CAAE,CAAC,CAChD,CASA,MAAa,aAAaC,EAAyBC,EAAoC,CACrF,OAAO,KAAKhC,GAAQ,QAAQ,gBAAiB,CAAC+B,EAAiBC,CAAS,CAAC,CAC3E,CASA,MAAa,aAAaC,EAAsBC,EAAqC,CACnF,OAAO,KAAKlC,GAAQ,QAAQ,gBAAiB,CAACiC,EAAcC,CAAU,CAAC,CACzE,CASA,MAAa,aAAaH,EAAyBC,EAAoC,CACrF,OAAO,KAAKhC,GAAQ,QAAQ,gBAAiB,CAAC+B,EAAiBC,CAAS,CAAC,CAC3E,CASA,MAAa,aAAaC,EAAsBC,EAAqC,CACnF,OAAO,KAAKlC,GAAQ,QAAQ,gBAAiB,CAACiC,EAAcC,CAAU,CAAC,CACzE,CAKA,MAAa,MAAsB,CAGjC,GAFa,MAAM,KAAKlC,GAAQ,QAAQ,OAAQ,CAAC,CAAC,IAErC,OACX,MAAM,MAAM,qDAAqD,CAErE,CAKO,sBAAuB,CAC5B,KAAKA,GAAQ,kBAAkB,CACjC,CAKO,SAAU,CACf,KAAKA,GAAQ,QAAQ,CACvB,CAKA,CAAQ,OAAO,OAAO,GAAI,CACxB,KAAK,QAAQ,CACf,CACF",
  "names": ["src_exports", "__export", "Nip07ExtensionSigner", "Nip46RemoteSigner", "SecretKeySigner", "__toCommonJS", "isBytes", "a", "bytes", "b", "lengths", "isLE", "hexes", "_", "i", "bytesToHex", "bytes", "hex", "asciis", "asciiToBase16", "char", "hexToBytes", "hl", "al", "array", "ai", "hi", "n1", "n2", "toStr", "crypto", "u8a", "a", "u32", "arr", "createView", "rotr", "word", "shift", "isLE", "hexes", "v", "i", "bytesToHex", "bytes", "u8a", "hex", "utf8ToBytes", "str", "toBytes", "data", "u8a", "concatBytes", "arrays", "r", "sum", "a", "pad", "Hash", "isPlainObject", "obj", "checkOpts", "defaults", "opts", "wrapConstructor", "hashCons", "hashC", "msg", "tmp", "randomBytes", "bytesLength", "crypto", "assertNumber", "n", "chain", "args", "wrap", "a", "b", "c", "encode", "acc", "i", "decode", "alphabet", "digits", "input", "letter", "index", "join", "separator", "from", "to", "padding", "bits", "chr", "data", "end", "normalize", "fn", "convertRadix", "pos", "res", "d", "carry", "done", "digit", "digitBase", "gcd", "radix2carry", "convertRadix2", "mask", "radix", "num", "bytes", "radix2", "revPadding", "unsafeWrapper", "base16", "chain", "radix2", "alphabet", "join", "base32", "padding", "base32hex", "base32crockford", "normalize", "s", "base64", "base64url", "genBase58", "abc", "radix", "base58", "base58flickr", "base58xrp", "XMR_BLOCK_LEN", "base58xmr", "data", "res", "i", "block", "str", "slice", "blockLen", "j", "BECH_ALPHABET", "chain", "alphabet", "join", "POLYMOD_GENERATORS", "bech32Polymod", "pre", "b", "chk", "i", "bechChecksum", "prefix", "words", "encodingConst", "len", "c", "v", "convertRadix2", "genBech32", "encoding", "ENCODING_CONST", "_words", "radix2", "fromWords", "toWords", "fromWordsUnsafe", "unsafeWrapper", "encode", "limit", "actualLength", "decode", "str", "lowered", "sepIndex", "sum", "decodeUnsafe", "decodeToBytes", "bech32", "bech32m", "utf8", "data", "hex", "normalize", "s", "CODERS", "base16", "base32", "base64", "base64url", "base58", "base58xmr", "coderTypeError", "utf8Decoder", "utf8Encoder", "Bech32MaxSize", "decode", "nip19", "prefix", "words", "bech32", "Bech32MaxSize", "data", "tlv", "parseTLV", "bytesToHex", "d", "utf8Decoder", "result", "rest", "t", "l", "v", "regexHexKey", "parseSecKey", "secKey", "bytes", "decode", "bytesToHex", "hexToBytes", "parsePubkey", "pubkey", "currentUnixtimeSec", "generateRandomString", "Deferred", "resolve", "reject", "v", "e", "delay", "durationMs", "mergeOptionsWithDefaults", "defaults", "opts", "defaultOptions", "Nip07ExtensionSigner", "#nip07Ext", "#reqSerializer", "nip07Ext", "options", "enableQueueing", "mergeOptionsWithDefaults", "ReqSerializationQueue", "NoopReqSerializer", "event", "recipientPubkey", "plaintext", "senderPubkey", "ciphertext", "#reqQ", "#running", "req", "d", "Deferred", "r", "err", "number", "n", "isBytes", "a", "bytes", "b", "lengths", "hash", "h", "exists", "instance", "checkFinished", "output", "out", "min", "crypto", "createView", "arr", "rotr", "word", "shift", "hexes", "_", "i", "bytesToHex", "abytes", "hex", "utf8ToBytes", "str", "toBytes", "data", "concatBytes", "arrays", "sum", "res", "pad", "Hash", "wrapConstructor", "hashCons", "hashC", "msg", "tmp", "randomBytes", "bytesLength", "setBigUint64", "view", "byteOffset", "value", "isLE", "_32n", "_u32_max", "wh", "wl", "l", "Chi", "c", "Maj", "HashMD", "blockLen", "outputLen", "padOffset", "buffer", "len", "pos", "take", "dataView", "oview", "outLen", "state", "to", "length", "finished", "destroyed", "SHA256_K", "SHA256_IV", "SHA256_W", "SHA256", "A", "B", "C", "D", "E", "F", "G", "H", "offset", "W15", "W2", "s0", "s1", "sigma1", "T1", "T2", "sha256", "_0n", "_1n", "_2n", "item", "numberToHexUnpadded", "num", "hexToNumber", "asciis", "asciiToBase16", "char", "hexToBytes", "hl", "al", "array", "ai", "hi", "n1", "n2", "bytesToNumberBE", "bytesToNumberLE", "numberToBytesBE", "numberToBytesLE", "numberToVarBytesBE", "ensureBytes", "title", "expectedLength", "e", "equalBytes", "diff", "bitLen", "bitGet", "bitSet", "bitMask", "u8n", "u8fr", "createHmacDrbg", "hashLen", "qByteLen", "hmacFn", "v", "k", "reset", "reseed", "seed", "gen", "sl", "pred", "validatorFns", "val", "object", "validateObject", "validators", "optValidators", "checkField", "fieldName", "type", "isOptional", "checkVal", "_3n", "_4n", "_5n", "_8n", "mod", "result", "pow", "power", "modulo", "pow2", "x", "invert", "u", "q", "r", "m", "tonelliShanks", "P", "legendreC", "Q", "S", "Z", "p1div4", "Fp", "root", "Q1div2", "g", "t2", "ge", "FpSqrt", "c1", "nv", "FIELD_FIELDS", "validateField", "field", "initial", "opts", "map", "FpPow", "f", "p", "d", "FpInvertBatch", "nums", "lastMultiplied", "acc", "inverted", "nLength", "nBitLength", "_nBitLength", "nByteLength", "Field", "ORDER", "redef", "BITS", "BYTES", "sqrtP", "lhs", "rhs", "lst", "getFieldBytesLength", "fieldOrder", "bitLength", "getMinHashLength", "mapHashToField", "key", "fieldLen", "minLen", "reduced", "wNAF", "bits", "constTimeNegate", "condition", "neg", "W", "windows", "windowSize", "elm", "points", "base", "window", "precomputes", "mask", "maxNumber", "shiftBy", "wbits", "offset1", "offset2", "cond1", "cond2", "precomputesMap", "transform", "comp", "validateBasic", "curve", "validatePointOpts", "ut.validateObject", "endo", "b2n", "h2b", "ut", "DER", "ut.abytes", "sBytes", "s", "rBytesLeft", "sig", "slice", "shl", "rhl", "rl", "weierstrassPoints", "CURVE", "_c", "point", "_isCompressed", "ut.concatBytes", "fromBytes", "tail", "y", "weierstrassEquation", "x2", "x3", "isWithinCurveOrder", "assertGE", "normPrivateKeyToScalar", "wrapPrivateKey", "ut.isBytes", "ut.bytesToHex", "ut.bytesToNumberBE", "mod.mod", "pointPrecomputes", "assertPrjPoint", "other", "Point", "px", "py", "pz", "is0", "toInv", "privateKey", "left", "right", "X1", "Y1", "Z1", "X2", "Y2", "Z2", "U1", "U2", "b3", "X3", "Y3", "Z3", "t0", "t1", "t3", "t4", "t5", "wnaf", "I", "k1neg", "k1", "k2neg", "k2", "k1p", "k2p", "scalar", "fake", "f1p", "f2p", "mul", "iz", "z", "ax", "ay", "zz", "isTorsionFree", "cofactor", "clearCofactor", "isCompressed", "_bits", "validateOpts", "weierstrass", "curveDef", "compressedLen", "uncompressedLen", "isValidFieldElement", "modN", "CURVE_ORDER", "invN", "mod.invert", "cat", "head", "y2", "sqrtError", "suffix", "isYOdd", "numToNByteStr", "ut.numberToBytesBE", "isBiggerThanHalfOrder", "HALF", "normalizeS", "slcNum", "from", "Signature", "recovery", "msgHash", "rec", "bits2int_modN", "radj", "prefix", "R", "ir", "u1", "u2", "ut.hexToBytes", "utils", "mod.getMinHashLength", "mod.mapHashToField", "getPublicKey", "isProbPub", "getSharedSecret", "privateA", "publicB", "bits2int", "delta", "ORDER_MASK", "ut.bitMask", "int2octets", "prepSig", "defaultSigOpts", "lowS", "prehash", "ent", "h1int", "seedArgs", "k2sig", "kBytes", "ik", "normS", "defaultVerOpts", "sign", "privKey", "ut.createHmacDrbg", "verify", "signature", "publicKey", "_a", "sg", "_sig", "derError", "error", "is", "HMAC", "_key", "assertHash", "buf", "assertExists", "assertBytes", "oHash", "iHash", "hmac", "message", "getHash", "msgs", "createCurve", "defHash", "create", "secp256k1P", "secp256k1N", "divNearest", "sqrtMod", "_6n", "_11n", "_22n", "_23n", "_44n", "_88n", "b2", "b6", "b9", "b11", "b22", "b44", "b88", "b176", "b220", "b223", "secp256k1", "a1", "b1", "a2", "POW_2_128", "c2", "fe", "TAGGED_HASH_PREFIXES", "taggedHash", "tag", "messages", "tagP", "tagH", "pointToBytes", "numTo32b", "modP", "GmulAdd", "schnorrGetExtPubKey", "priv", "d_", "lift_x", "xx", "challenge", "args", "schnorrGetPublicKey", "schnorrSign", "auxRand", "t", "rand", "k_", "rx", "schnorrVerify", "pub", "schnorr", "utf8Encoder", "sha256", "m", "bytesToHex", "_sha256", "schnorr", "seckey", "_schnorr", "getPublicKey", "getEventHash", "event", "serialized", "verify", "event", "schnorr", "getEventHash", "err", "verifier", "event", "verify", "number", "n", "bytes", "b", "lengths", "hash", "number", "exists", "instance", "checkFinished", "output", "out", "min", "crypto", "u8a", "a", "createView", "arr", "rotr", "word", "shift", "isLE", "utf8ToBytes", "str", "toBytes", "data", "u8a", "concatBytes", "arrays", "r", "sum", "a", "pad", "Hash", "toStr", "wrapConstructor", "hashCons", "hashC", "msg", "toBytes", "tmp", "randomBytes", "bytesLength", "crypto", "setBigUint64", "view", "byteOffset", "value", "isLE", "_32n", "_u32_max", "wh", "wl", "h", "l", "SHA2", "Hash", "blockLen", "outputLen", "padOffset", "createView", "data", "exists", "buffer", "toBytes", "len", "pos", "take", "dataView", "out", "output", "i", "oview", "outLen", "state", "res", "to", "length", "finished", "destroyed", "Chi", "a", "b", "c", "Maj", "SHA256_K", "IV", "SHA256_W", "SHA256", "SHA2", "A", "B", "C", "D", "E", "F", "G", "H", "view", "offset", "i", "W15", "W2", "s0", "rotr", "s1", "sigma1", "T1", "T2", "sha256", "wrapConstructor", "SHA256", "utils_exports", "__export", "bitGet", "bitLen", "bitMask", "bitSet", "bytesToHex", "bytesToNumberBE", "bytesToNumberLE", "concatBytes", "createHmacDrbg", "ensureBytes", "equalBytes", "hexToBytes", "hexToNumber", "numberToBytesBE", "numberToBytesLE", "numberToHexUnpadded", "numberToVarBytesBE", "utf8ToBytes", "validateObject", "_0n", "_1n", "_2n", "u8a", "a", "hexes", "_", "i", "bytes", "hex", "num", "len", "array", "j", "hexByte", "byte", "n", "title", "expectedLength", "res", "e", "arrays", "r", "sum", "pad", "b1", "b2", "str", "pos", "value", "u8n", "data", "u8fr", "arr", "hashLen", "qByteLen", "hmacFn", "v", "k", "reset", "h", "b", "reseed", "seed", "gen", "out", "sl", "pred", "validatorFns", "val", "object", "validators", "optValidators", "checkField", "fieldName", "type", "isOptional", "checkVal", "_0n", "_1n", "_2n", "_3n", "_4n", "_5n", "_8n", "_9n", "_16n", "mod", "a", "b", "result", "pow", "num", "power", "modulo", "res", "pow2", "x", "invert", "number", "y", "u", "v", "q", "r", "m", "n", "tonelliShanks", "P", "legendreC", "Q", "S", "Z", "p1div4", "Fp", "root", "Q1div2", "g", "t2", "ge", "FpSqrt", "c1", "n2", "nv", "i", "FIELD_FIELDS", "validateField", "field", "initial", "opts", "map", "val", "validateObject", "FpPow", "f", "num", "power", "_0n", "_1n", "p", "d", "FpInvertBatch", "nums", "tmp", "lastMultiplied", "acc", "i", "inverted", "nLength", "n", "nBitLength", "_nBitLength", "nByteLength", "Field", "ORDER", "bitLen", "isLE", "redef", "_0n", "BITS", "BYTES", "sqrtP", "FpSqrt", "f", "bitMask", "_1n", "num", "mod", "lhs", "rhs", "power", "FpPow", "invert", "lst", "FpInvertBatch", "b", "c", "numberToBytesLE", "numberToBytesBE", "bytes", "bytesToNumberLE", "bytesToNumberBE", "getFieldBytesLength", "fieldOrder", "bitLength", "getMinHashLength", "length", "mapHashToField", "key", "isLE", "len", "fieldLen", "minLen", "num", "bytesToNumberBE", "bytesToNumberLE", "reduced", "mod", "_1n", "numberToBytesLE", "numberToBytesBE", "_0n", "_1n", "wNAF", "c", "bits", "constTimeNegate", "condition", "item", "neg", "opts", "W", "windows", "windowSize", "elm", "n", "p", "d", "points", "base", "window", "i", "precomputes", "mask", "maxNumber", "shiftBy", "offset", "wbits", "offset1", "offset2", "cond1", "cond2", "P", "precomputesMap", "transform", "comp", "validateBasic", "curve", "validateField", "validateObject", "nLength", "validatePointOpts", "curve", "opts", "validateBasic", "validateObject", "endo", "Fp", "a", "b2n", "h2b", "utils_exports", "DER", "m", "data", "E", "len", "res", "hex", "l", "r", "sBytes", "s", "rBytesLeft", "sig", "slice", "h", "num", "shl", "rhl", "sl", "rl", "_0n", "_1n", "_2n", "_3n", "_4n", "weierstrassPoints", "CURVE", "toBytes", "_c", "point", "_isCompressed", "concatBytes", "fromBytes", "bytes", "tail", "x", "y", "weierstrassEquation", "b", "x2", "x3", "isWithinCurveOrder", "assertGE", "normPrivateKeyToScalar", "key", "lengths", "nByteLength", "wrapPrivateKey", "n", "bytesToHex", "bytesToNumberBE", "ensureBytes", "mod", "pointPrecomputes", "assertPrjPoint", "other", "Point", "px", "py", "pz", "p", "is0", "i", "points", "toInv", "P", "privateKey", "windowSize", "left", "right", "X1", "Y1", "Z1", "X2", "Y2", "Z2", "U1", "U2", "b3", "X3", "Y3", "Z3", "t0", "t1", "t2", "t3", "t4", "t5", "wnaf", "comp", "I", "k1neg", "k1", "k2neg", "k2", "k1p", "k2p", "d", "scalar", "fake", "f1p", "f2p", "f", "Q", "G", "mul", "sum", "iz", "z", "ax", "ay", "zz", "cofactor", "isTorsionFree", "clearCofactor", "isCompressed", "_bits", "wNAF", "validateOpts", "weierstrass", "curveDef", "CURVE_ORDER", "compressedLen", "uncompressedLen", "isValidFieldElement", "modN", "invN", "invert", "cat", "head", "y2", "isYOdd", "numToNByteStr", "numberToBytesBE", "isBiggerThanHalfOrder", "number", "HALF", "normalizeS", "slcNum", "from", "to", "Signature", "recovery", "msgHash", "rec", "bits2int_modN", "radj", "prefix", "R", "ir", "u1", "u2", "hexToBytes", "utils", "length", "getMinHashLength", "mapHashToField", "getPublicKey", "isProbPub", "item", "arr", "str", "getSharedSecret", "privateA", "publicB", "bits2int", "delta", "ORDER_MASK", "bitMask", "int2octets", "prepSig", "defaultSigOpts", "k", "hash", "randomBytes", "lowS", "prehash", "ent", "h1int", "seedArgs", "e", "seed", "k2sig", "kBytes", "ik", "q", "normS", "defaultVerOpts", "sign", "privKey", "C", "createHmacDrbg", "verify", "signature", "publicKey", "sg", "_sig", "derError", "error", "is", "HMAC", "Hash", "hash", "_key", "key", "toBytes", "blockLen", "pad", "buf", "exists", "out", "bytes", "to", "oHash", "iHash", "finished", "destroyed", "outputLen", "hmac", "message", "getHash", "hash", "key", "msgs", "hmac", "concatBytes", "randomBytes", "createCurve", "curveDef", "defHash", "create", "weierstrass", "secp256k1P", "secp256k1N", "_1n", "_2n", "divNearest", "a", "b", "sqrtMod", "y", "P", "_3n", "_6n", "_11n", "_22n", "_23n", "_44n", "_88n", "b2", "b3", "b6", "pow2", "b9", "b11", "b22", "b44", "b88", "b176", "b220", "b223", "t1", "t2", "root", "Fp", "Field", "secp256k1", "createCurve", "k", "n", "a1", "b1", "a2", "POW_2_128", "c1", "c2", "k1", "mod", "k2", "k1neg", "k2neg", "sha256", "_0n", "fe", "x", "ge", "TAGGED_HASH_PREFIXES", "taggedHash", "tag", "messages", "tagP", "tagH", "c", "concatBytes", "pointToBytes", "point", "numTo32b", "numberToBytesBE", "modP", "modN", "Point", "GmulAdd", "Q", "schnorrGetExtPubKey", "priv", "d_", "p", "lift_x", "xx", "challenge", "args", "bytesToNumberBE", "schnorrGetPublicKey", "privateKey", "schnorrSign", "message", "auxRand", "randomBytes", "m", "ensureBytes", "px", "d", "t", "rand", "k_", "rx", "e", "sig", "schnorrVerify", "signature", "publicKey", "pub", "r", "s", "R", "schnorr", "number", "n", "bool", "b", "isBytes", "a", "bytes", "lengths", "exists", "instance", "checkFinished", "output", "out", "bytes", "min", "u8", "arr", "u32", "arr", "createView", "isLE", "utf8ToBytes", "str", "toBytes", "data", "utf8ToBytes", "isBytes", "checkOpts", "defaults", "opts", "equalBytes", "a", "b", "diff", "i", "wrapCipher", "params", "c", "setBigUint64", "view", "byteOffset", "value", "isLE", "_32n", "_u32_max", "wh", "wl", "h", "l", "BLOCK_SIZE", "ZEROS16", "ZEROS32", "u32", "POLY", "mul2", "s0", "s1", "s2", "s3", "hiBit", "swapLE", "n", "_toGHASHKey", "k", "carry", "i", "t", "estimateWindow", "bytes", "GHASH", "key", "expectedLength", "toBytes", "kView", "createView", "k0", "k1", "k2", "k3", "doubles", "W", "windows", "windowSize", "items", "w", "byte", "j", "d0", "d1", "d2", "d3", "o0", "o1", "o2", "o3", "mask", "num", "bytePos", "bitPos", "bit", "e0", "e1", "e2", "e3", "data", "exists", "b32", "blocks", "left", "elm", "out", "output", "o32", "res", "Polyval", "ghKey", "wrapConstructorWithKey", "hashCons", "hashC", "msg", "tmp", "ghash", "polyval", "BLOCK_SIZE", "BLOCK_SIZE32", "EMPTY_BLOCK", "POLY", "mul2", "n", "mul", "a", "b", "res", "sbox", "t", "i", "x", "box", "invSbox", "_", "j", "rotr32_8", "rotl32_8", "genTtable", "fn", "T0", "T1", "T2", "T3", "T01", "T23", "sbox2", "idx", "tableEncoding", "s", "tableDecoding", "xPowers", "p", "expandKeyLE", "key", "bytes", "len", "k32", "u32", "Nk", "subByte", "applySbox", "xk", "expandKeyDecLE", "encKey", "w", "apply0123", "s0", "s1", "s2", "s3", "encrypt", "k", "rounds", "t0", "t1", "t2", "t3", "decrypt", "getDst", "dst", "ctrCounter", "nonce", "src", "srcLen", "ctr", "c32", "src32", "dst32", "carry", "start", "b32", "buf", "u8", "pos", "ctr32", "isLE", "view", "createView", "ctrPos", "ctrNum", "wrapCipher", "processCtr", "out", "plaintext", "ciphertext", "validateBlockDecrypt", "data", "validateBlockEncrypt", "pcks5", "outLen", "remaining", "left", "o", "validatePCKS", "lastByte", "padPCKS", "tmp", "tmp32", "paddingByte", "ecb", "opts", "_out", "cbc", "iv", "n32", "ps0", "ps1", "ps2", "ps3", "o0", "o1", "o2", "o3", "computeTag", "AAD", "h", "num", "setBigUint64", "gcm", "tagLength", "_computeTag", "authKey", "tagMask", "tag", "ghash", "deriveKeys", "counter", "nonceLen", "passedTag", "equalBytes", "limit", "name", "min", "max", "value", "siv", "AAD_LIMIT", "PLAIN_LIMIT", "NONCE_LIMIT", "CIPHER_LIMIT", "derivedKey", "d32", "polyval", "t32", "processSiv", "input", "block", "expectedTag", "utf8Decoder", "utf8Encoder", "encrypt", "secretKey", "pubkey", "text", "privkey", "bytesToHex", "key", "secp256k1", "normalizedKey", "getNormalizedX", "iv", "randomBytes", "plaintext", "ciphertext", "cbc", "ctb64", "base64", "ivb64", "decrypt", "data", "u8to16", "a", "i", "Poly1305", "key", "toBytes", "bytes", "t0", "t1", "t2", "t3", "t4", "t5", "t6", "t7", "data", "offset", "isLast", "hibit", "h", "r", "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", "r8", "r9", "h0", "h1", "h2", "h3", "h4", "h5", "h6", "h7", "h8", "h9", "c", "d0", "d1", "d2", "d3", "d4", "d5", "d6", "d7", "d8", "d9", "pad", "g", "mask", "f", "exists", "buffer", "blockLen", "len", "pos", "take", "out", "output", "opos", "outputLen", "res", "wrapConstructorWithKey", "hashCons", "hashC", "msg", "tmp", "poly1305", "sigma16", "utf8ToBytes", "sigma32", "sigma16_32", "u32", "sigma32_32", "rotl", "a", "b", "isAligned32", "BLOCK_LEN", "BLOCK_LEN32", "MAX_COUNTER", "U32_EMPTY", "runCipher", "core", "sigma", "key", "nonce", "data", "output", "counter", "rounds", "len", "block", "b32", "isAligned", "d32", "o32", "pos", "take", "pos32", "j", "posj", "createCipher", "opts", "allowShortKeys", "extendNonceFn", "counterLength", "counterRight", "checkOpts", "number", "bool", "bytes", "toClean", "l", "k", "k32", "nonceNcLen", "nc", "n32", "chachaCore", "s", "k", "n", "out", "cnt", "rounds", "y00", "y01", "y02", "y03", "y04", "y05", "y06", "y07", "y08", "y09", "y10", "y11", "y12", "y13", "y14", "y15", "x00", "x01", "x02", "x03", "x04", "x05", "x06", "x07", "x08", "x09", "x10", "x11", "x12", "x13", "x14", "x15", "r", "rotl", "oi", "hchacha", "i", "o32", "chacha20", "createCipher", "chachaCore", "xchacha20", "hchacha", "ZEROS16", "updatePadded", "h", "msg", "left", "ZEROS32", "computeTag", "fn", "key", "nonce", "data", "AAD", "authKey", "poly1305", "num", "view", "createView", "setBigUint64", "res", "_poly1305_aead", "xorStream", "bytes", "plaintext", "output", "plength", "clength", "tag", "ciphertext", "passedTag", "equalBytes", "chacha20poly1305", "wrapCipher", "chacha20", "xchacha20poly1305", "xchacha20", "number", "n", "bool", "b", "bytes", "lengths", "hash", "exists", "instance", "checkFinished", "output", "out", "min", "assert", "assert_default", "HMAC", "Hash", "hash", "_key", "assert_default", "key", "toBytes", "blockLen", "pad", "buf", "out", "to", "oHash", "iHash", "finished", "destroyed", "outputLen", "hmac", "message", "extract", "hash", "ikm", "salt", "assert_default", "hmac", "toBytes", "HKDF_COUNTER", "EMPTY_BUFFER", "expand", "prk", "info", "length", "blocks", "okm", "HMAC", "HMACTmp", "T", "counter", "setBigUint64", "view", "byteOffset", "value", "isLE", "_32n", "_u32_max", "wh", "wl", "h", "l", "SHA2", "Hash", "blockLen", "outputLen", "padOffset", "createView", "data", "assert_default", "buffer", "toBytes", "len", "pos", "take", "dataView", "out", "i", "oview", "outLen", "state", "res", "to", "length", "finished", "destroyed", "Chi", "a", "b", "c", "Maj", "SHA256_K", "IV", "SHA256_W", "SHA256", "SHA2", "A", "B", "C", "D", "E", "F", "G", "H", "view", "offset", "i", "W15", "W2", "s0", "rotr", "s1", "sigma1", "T1", "T2", "SHA224", "sha256", "wrapConstructor", "sha224", "utf8Decoder", "utf8Encoder", "minPlaintextSize", "maxPlaintextSize", "getConversationKey", "privkeyA", "pubkeyB", "sharedX", "secp256k1", "extract", "sha256", "getMessageKeys", "conversationKey", "nonce", "keys", "expand", "calcPaddedLen", "len", "nextPower", "chunk", "writeU16BE", "num", "arr", "pad", "plaintext", "unpadded", "unpaddedLen", "prefix", "suffix", "concatBytes", "unpad", "padded", "hmacAad", "key", "message", "aad", "combined", "hmac", "decodePayload", "payload", "plen", "data", "base64", "error", "dlen", "vers", "encrypt", "randomBytes", "chacha_key", "chacha_nonce", "hmac_key", "ciphertext", "chacha20", "mac", "decrypt", "calculatedMac", "equalBytes", "v2", "pbkdf2Init", "hash", "_password", "_salt", "_opts", "assert_default", "opts", "checkOpts", "c", "dkLen", "asyncTick", "password", "toBytes", "salt", "DK", "PRF", "hmac", "PRFSalt", "pbkdf2Output", "prfW", "u", "pbkdf2", "arr", "view", "createView", "ti", "pos", "Ti", "ui", "i", "rotl", "a", "b", "XorAndSalsa", "prev", "pi", "input", "ii", "out", "oi", "y00", "y01", "y02", "y03", "y04", "y05", "y06", "y07", "y08", "y09", "y10", "y11", "y12", "y13", "y14", "y15", "x00", "x01", "x02", "x03", "x04", "x05", "x06", "x07", "x08", "x09", "x10", "x11", "x12", "x13", "x14", "x15", "i", "BlockMix", "r", "head", "tail", "scryptInit", "password", "salt", "_opts", "opts", "checkOpts", "N", "p", "dkLen", "asyncTick", "maxmem", "onProgress", "assert_default", "blockSize", "blockSize32", "memUsed", "B", "pbkdf2", "sha256", "B32", "u32", "V", "tmp", "blockMixCb", "totalBlockMix", "callbackPer", "blockMixCnt", "scryptOutput", "res", "scrypt", "Pi", "pos", "j", "k", "Bech32MaxSize", "decrypt", "ncryptsec", "password", "prefix", "words", "bech32", "Bech32MaxSize", "b", "version", "n", "salt", "nonce", "ksb", "aad", "ciphertext", "key", "scrypt", "xchacha20poly1305", "verifiedSymbol", "isRecord", "obj", "validateEvent", "event", "i2", "tag", "j", "utf8Decoder", "utf8Encoder", "JS", "schnorr", "secretKey", "bytesToHex", "t", "event", "getEventHash", "verifiedSymbol", "hash", "valid", "serializeEvent", "evt", "validateEvent", "eventHash", "sha256", "i", "generateSecretKey", "getPublicKey", "finalizeEvent", "verifyEvent", "SecretKeySigner", "_SecretKeySigner", "#seckeyHex", "#seckeyBytes", "secKey", "res", "parseSecKey", "bytesToHex", "ncryptsec", "password", "decrypt", "generateSecretKey", "getPublicKey", "event", "finalizeEvent", "recipientPubkey", "plaintext", "encrypt", "senderPubkey", "ciphertext", "convKey", "v2", "convkey", "RxNostrError", "RxNostrWebSocketError", "code", "RxNostrInvalidUsageError", "message", "RxNostrEnvironmentError", "RxNostrLogicError", "RxNostrAlreadyDisposedError", "fill", "config", "defaults", "ensureEventFields", "event", "i", "tag", "j", "inlineThrow", "err", "nip07Signer", "options", "params", "_a", "_b", "event", "RxNostrEnvironmentError", "ensureEventFields", "makeRxNostrConfig", "config", "fill", "nip07Signer", "evalFilters", "filters", "evalFilter", "filter", "evalLazyNumber", "lazyNumber", "fetchRelayInfo", "url", "u", "inlineTry", "f", "g", "err", "normalizeRelayUrl", "o", "s", "UrlMap", "obj", "v", "urls", "vs", "Nip11Registry", "getter", "options", "data", "promise", "nip11", "__publicField", "isFiltered", "event", "filters", "options", "filter", "_isFiltered", "sinceInclusive", "untilInclusive", "fill", "prefix", "pubkey", "key", "needleValues", "needleTagName", "tagName", "tagValue", "isExpired", "now", "tag", "timestamp", "extendStatics", "d", "b", "p", "__extends", "__", "__awaiter", "thisArg", "_arguments", "P", "generator", "adopt", "value", "resolve", "reject", "fulfilled", "step", "e", "rejected", "result", "__generator", "body", "_", "t", "f", "y", "g", "verb", "n", "v", "op", "__values", "o", "s", "m", "i", "__read", "r", "ar", "error", "__spreadArray", "to", "from", "pack", "l", "__await", "__asyncGenerator", "q", "a", "resume", "settle", "fulfill", "__asyncValues", "isFunction", "createErrorClass", "createImpl", "_super", "instance", "ctorFunc", "UnsubscriptionError", "errors", "err", "arrRemove", "arr", "item", "index", "Subscription", "initialTeardown", "e_1", "_a", "e_2", "_b", "_parentage", "_parentage_1", "_parentage_1_1", "parent_1", "e_1_1", "initialFinalizer", "_finalizers", "_finalizers_1", "_finalizers_1_1", "finalizer", "execFinalizer", "e_2_1", "teardown", "parent", "empty", "EMPTY_SUBSCRIPTION", "isSubscription", "config", "timeoutProvider", "handler", "timeout", "args", "_i", "delegate", "handle", "reportUnhandledError", "noop", "errorContext", "cb", "Subscriber", "destination", "_this", "EMPTY_OBSERVER", "next", "complete", "SafeSubscriber", "_bind", "bind", "fn", "ConsumerObserver", "partialObserver", "handleUnhandledError", "observerOrNext", "context_1", "defaultErrorHandler", "observable", "identity", "x", "pipe", "fns", "pipeFromArray", "input", "prev", "Observable", "subscribe", "operator", "subscriber", "isSubscriber", "source", "sink", "promiseCtor", "getPromiseCtor", "Symbol_observable", "operations", "isObserver", "hasLift", "operate", "init", "liftedSource", "createOperatorSubscriber", "onNext", "onComplete", "onError", "onFinalize", "OperatorSubscriber", "shouldUnsubscribe", "closed_1", "ObjectUnsubscribedError", "Subject", "subject", "AnonymousSubject", "_c", "observer", "observers", "hasError", "isStopped", "thrownError", "BehaviorSubject", "_value", "subscription", "dateTimestampProvider", "Action", "scheduler", "work", "state", "delay", "intervalProvider", "AsyncAction", "id", "_id", "_scheduler", "_delay", "errored", "errorValue", "actions", "Scheduler", "schedulerActionCtor", "AsyncScheduler", "SchedulerAction", "action", "asyncScheduler", "async", "EMPTY", "isScheduler", "last", "popResultSelector", "popScheduler", "popNumber", "defaultValue", "isArrayLike", "isPromise", "isInteropObservable", "isAsyncIterable", "obj", "createInvalidObservableTypeError", "getSymbolIterator", "iterator", "isIterable", "Symbol_iterator", "readableStreamLikeToAsyncGenerator", "readableStream", "reader", "done", "isReadableStreamLike", "innerFrom", "fromInteropObservable", "fromArrayLike", "fromPromise", "fromAsyncIterable", "fromIterable", "fromReadableStreamLike", "obs", "array", "promise", "iterable", "iterable_1", "iterable_1_1", "asyncIterable", "process", "asyncIterable_1", "asyncIterable_1_1", "executeSchedule", "parentSubscription", "repeat", "scheduleSubscription", "observeOn", "subscribeOn", "scheduleObservable", "schedulePromise", "scheduleArray", "scheduleIterable", "scheduleAsyncIterable", "scheduleReadableStreamLike", "scheduled", "of", "EmptyError", "firstValueFrom", "hasConfig", "isValidDate", "TimeoutError", "info", "schedulerArg", "first", "each", "_with", "timeoutErrorFactory", "_d", "meta", "originalSourceSubscription", "timerSubscription", "lastValue", "seen", "startTimer", "map", "project", "isArray", "callOrApply", "mapOneOrManyArgs", "getPrototypeOf", "objectProto", "getKeys", "argsArgArrayOrObject", "first_1", "isPOJO", "keys", "createObject", "values", "combineLatest", "resultSelector", "observables", "combineLatestInit", "valueTransform", "maybeSchedule", "length", "active", "remainingFirstValues", "_loop_1", "hasFirstValue", "execute", "mergeInternals", "concurrent", "onBeforeNext", "expand", "innerSubScheduler", "additionalFinalizer", "buffer", "isComplete", "checkComplete", "outerNext", "doInnerSub", "innerComplete", "innerValue", "bufferedValue", "mergeMap", "ii", "mergeAll", "timer", "dueTime", "intervalOrScheduler", "scheduler", "asyncScheduler", "intervalDuration", "isScheduler", "Observable", "subscriber", "due", "isValidDate", "n", "merge", "args", "_i", "popScheduler", "concurrent", "popNumber", "sources", "innerFrom", "mergeAll", "from", "EMPTY", "filter", "predicate", "thisArg", "operate", "source", "index", "createOperatorSubscriber", "value", "catchError", "selector", "innerSub", "syncUnsub", "handledResult", "err", "defaultIfEmpty", "defaultValue", "operate", "source", "subscriber", "hasValue", "createOperatorSubscriber", "value", "take", "count", "EMPTY", "seen", "distinct", "keySelector", "flushes", "operate", "source", "subscriber", "distinctKeys", "createOperatorSubscriber", "value", "key", "innerFrom", "noop", "distinctUntilChanged", "comparator", "identity", "defaultCompare", "previousKey", "first", "currentKey", "a", "b", "throwIfEmpty", "errorFactory", "defaultErrorFactory", "hasValue", "EmptyError", "finalize", "callback", "predicate", "defaultValue", "hasDefaultValue", "filter", "v", "i", "take", "defaultIfEmpty", "switchMap", "project", "resultSelector", "operate", "source", "subscriber", "innerSubscriber", "index", "isComplete", "checkComplete", "createOperatorSubscriber", "value", "innerIndex", "outerIndex", "innerFrom", "innerValue", "switchAll", "identity", "takeUntil", "notifier", "noop", "takeWhile", "predicate", "inclusive", "result", "tap", "observerOrNext", "error", "complete", "tapObserver", "isFunction", "_a", "isUnsub", "err", "_b", "uniq", "flushes", "distinct", "event", "filterAsync", "predicate", "mergeMap", "packet", "index", "from", "result", "of", "EMPTY", "completeOnTimeout", "time", "pipe", "timeout", "catchError", "error", "TimeoutError", "filterBySubId", "subId", "options", "not", "fill", "filter", "packet", "xor", "xor", "x", "y", "AuthProxy", "params", "__publicField", "Subject", "listenOK", "result", "eventId", "ok", "listenAUTH", "challenge", "event", "subjects", "sub", "CounterSubject", "BehaviorSubject", "count", "NotifySubject", "firstValueFrom", "first", "PublishProxy", "_a", "toRelayMessage", "type", "packet", "notice", "ReadyState", "RelayConnection", "url", "config", "Nip11Registry", "state", "retryCount", "isRetry", "isAutoRetry", "isManualRetry", "onopen", "socket", "WebSocketCloseCode", "message", "err", "onmessage", "data", "onclose", "code", "RxNostrWebSocketError", "nextRetry", "retryTimer", "WebSocket", "RxNostrInvalidUsageError", "from", "done", "RxNostrLogicError", "filter", "p", "distinctUntilChanged", "map", "_b", "time", "timer", "of", "EMPTY", "SubscribeProxy", "SubQueue", "activated", "req", "subId", "autoclose", "filters", "isFiltered", "lazyFilters", "evalFilters", "v", "remove", "arr", "prevLength", "filtered", "e", "removed", "queuings", "droppedX", "ongoings", "droppedY", "capacity", "concated", "NostrConnection", "normalizeRelayUrl", "authenticator", "getAuthenticator", "relay", "authProxy", "pubProxy", "subProxy", "combineLatest", "pubConns", "subConns", "logicalConns", "strategy", "flag", "options", "mode", "overwrite", "fill", "RxNostrAlreadyDisposedError", "reason", "a", "c", "subtract", "makeSubId", "rxReq", "index", "rxReqId", "makeLazyREQ", "normalizeRelaysConfig", "urlOrConfig", "read", "write", "flags", "getMethodScopeRelays", "rxNostr", "targets", "on", "defaultRelays", "createRxNostr", "RxNostrImpl", "makeRxNostrConfig", "UrlMap", "conns", "conn", "relays", "nextDefaultRelays", "nextReadableConnections", "noLongerNeededConnections", "additionalDefaultRelays", "urls", "useScopeRelays", "makeOrderPacket", "emitScopeRelays", "startSubscription", "targetConnections", "teardownSubscription", "createEventObservable", "takeUntil", "order$", "validate", "filterAsync", "isExpired", "firstOrder", "tap", "order", "finalize", "switchAll", "mergeAll", "filterBySubId", "finishedRelays", "isDown", "shouldComplete", "connectionState", "fin$", "complete$", "merge", "completeOnTimeout", "signer", "errorOnTimeout", "completeOn", "targetRelays", "subject", "teardown", "completeManager", "identity", "takeWhile", "timeout", "createRxReq", "_operators", "getRandomDigitsString", "filters$", "operators", "normalizeFilters", "createRxForwardReq", "rxReqId", "createRxReq", "getRandomDigitsString", "normalizeFilter", "filter", "_a", "_b", "res", "isTagName", "s", "key", "f", "normalizeFilters", "filters", "e", "RxNostrRelayPool", "#rxn", "#relayUrls", "relayUrls", "rxn", "Wr", "Ue", "rurl", "state", "filter", "onEvent", "req", "Kr", "sub", "kr", "event", "currentUnixtimeSec", "ev", "retry", "res", "#tryPub", "delay", "timeoutMs", "resolve", "okSub", "ok", "notice", "err", "parseNip46RpcResp", "ev", "signer", "plainContent", "id", "result", "error", "identity", "v", "nip46RpcParamsEncoders", "params", "nip46RpcResultDecoders", "raw", "defaultRpcCliOptions", "_", "Nip46RpcClient", "_Nip46RpcClient", "#localSigner", "#remotePubkey", "#options", "#relayPool", "#closeSub", "#inflightRpcs", "localSigner", "remotePubkey", "relayPool", "options", "secret", "timeoutMs", "respWait", "Deferred", "onEvent", "resp", "signerPubkey", "timeoutSignal", "onTimeout", "unsub", "cleanup", "finalOpts", "mergeOptionsWithDefaults", "rpcCli", "#startRespSubscription", "e", "onevent", "rpcId", "err", "localPubkey", "#startWaitingRpcResp", "d", "startCancelTimer", "method", "generateRandomString", "waitResp", "rpcReq", "cipheredReq", "reqEv", "currentUnixtimeSec", "signedReqEv", "rawResp", "BUNKER_TOKEN_PREFIX", "BUNKER_TOKEN_PREFIX_LEN", "parseBunkerToken", "token", "prefixTrimmed", "qIdx", "rawPubkey", "rawParams", "remotePubkey", "parsePubkey", "searchParams", "secretToken", "relayUrls", "defaultConnectOptions", "defaultRpcCliOptions", "Nip46RemoteSigner", "_Nip46RemoteSigner", "#rpcCli", "#remotePubkey", "rpcCli", "#init", "localSigner", "options", "relayPool", "RxNostrRelayPool", "e", "Nip46RpcClient", "#connect", "signer", "connParams", "err", "connToken", "finalOpts", "mergeOptionsWithDefaults", "SecretKeySigner", "sessionKey", "clientMetadata", "localPubkey", "Rn", "connSecret", "generateRandomString", "connUri", "rurl", "metaWithPerms", "connected", "established", "event", "ev", "recipientPubkey", "plaintext", "senderPubkey", "ciphertext"]
}